production module
AutoSamplingTheory.TechnicalLemmas.Analysis.PermutedProductCostIntegral
2 named declarations scanned from AutoSamplingTheory/TechnicalLemmas/Analysis/PermutedProductCostIntegral.lean.
Declarations
theorem AutoSamplingTheory.TechnicalLemmas.Analysis.PermutedProductCostIntegral.measurePreserving_pair_eval Partial Not mapped
- Evaluating two distinct coordinates of a finite product probability is a measure-preserving map to the corresponding two-coordinate product law.
theorem measurePreserving_pair_eval
(mu : I → ProbabilityMeasure (E × E)) {i j : I} (hij : i ≠ j) :
MeasurePreserving (fun q : I → E × E => (q i, q j))
(Measure.pi (fun k => (mu k : Measure (E × E))))
((mu i : Measure (E × E)).prod (mu j : Measure (E × E))) := by
exact ⟨((measurable_pi_apply i).prodMk (measurable_pi_apply j)),
map_pair_eval_eq_prod mu hij⟩
/-- For a fixed-point-free permutation, the expected permuted quadratic cost
under the finite product law is the sum of the corresponding two-coordinate
cross-cost expectations. -/
AutoSamplingTheory/TechnicalLemmas/Analysis/PermutedProductCostIntegral.lean:35published source at 0e31a3cda412
theorem AutoSamplingTheory.TechnicalLemmas.Analysis.PermutedProductCostIntegral.integral_permutedQuadraticCost_eq_sum Partial Not mapped
- For a fixed-point-free permutation, the expected permuted quadratic cost under the finite product law is the sum of the corresponding two-coordinate cross-cost expectations.
theorem integral_permutedQuadraticCost_eq_sum
(mu : I → ProbabilityMeasure (E × E))
(σ : Equiv.Perm I)
(hσ : ∀ i, σ i ≠ i)
(hcost : ∀ i, Integrable
(fun z : (E × E) × (E × E) => ‖z.1.1 - z.2.2‖ ^ 2)
((mu (σ i) : Measure (E × E)).prod (mu i : Measure (E × E)))) :
(∫ q : I → E × E, permutedQuadraticCost q σ
∂Measure.pi (fun i => (mu i : Measure (E × E)))) =
∑ i, ∫ z : (E × E) × (E × E), ‖z.1.1 - z.2.2‖ ^ 2
∂((mu (σ i) : Measure (E × E)).prod (mu i : Measure (E × E))) := by
classical
rw [permutedQuadraticCost]
rw [integral_finset_sum]
· apply Finset.sum_congr rfl
intro i _hi
exact integral_comp_pair_eval mu (hσ i) (hcost i).aestronglyMeasurable
· intro i _hi
have hmp := measurePreserving_pair_eval mu (hσ i)
simpa [Function.comp_def] using hmp.integrable_comp_of_integrable (hcost i)
end
end PermutedProductCostIntegral
end Analysis
end TechnicalLemmas
end AutoSamplingTheory
AutoSamplingTheory/TechnicalLemmas/Analysis/PermutedProductCostIntegral.lean:46published source at 0e31a3cda412