p. 19 — the ε-approximation: µ₁[⟨u≤L, v⟩ ≤ s] = µ₂[⟨u≤L, v⟩ ≤ s] for all L, v ∈ ℝᴸ, s
ProvedDistCov.Hilbert.finite_projections_agreegaussianl2measure-determinationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be Borel probability measures on with finite first moments, and let be as above:
Suppose that for every , for -a.e. , for all and . Then for every , every and every ,
where .
This is the conclusion of the last paragraph of the proof of Theorem 3.16; together with the Cramér–Wold reduction it yields .
Formalization Note. Indices start at , so is . The hypothesis "for every " stands in for the paper's choice of large enough for a given .
Preamble
import Mathlib import Definitions.Def_DistCov_Hilbert_Setting
Formal statement
namespace DistCov.Hilbert
open MeasureTheory ProbabilityTheory
theorem finite_projections_agree (μ₁ μ₂ : Measure DistCov.Indep.L2N) [IsProbabilityMeasure μ₁]
[IsProbabilityMeasure μ₂] (h₁ : DistCov.Indep.FiniteFirstMoment μ₁) (h₂ : DistCov.Indep.FiniteFirstMoment μ₂)
(h : ∀ K : ℕ, ∀ᵐ w ∂rho, ∀ (v : Fin K → ℝ) (s : ℝ), baryDiff μ₁ μ₂ (splice K v w, s) = 0) :
∀ (L : ℕ) (v : Fin L → ℝ) (s : ℝ),
μ₁ {u : DistCov.Indep.L2N | ∑ i : Fin L, u i * v i ≤ s} = μ₂ {u : DistCov.Indep.L2N | ∑ i : Fin L, u i * v i ≤ s} := by sorry
end DistCov.Hilbert
Source
Lyons, Distance covariance in metric spaces, arXiv:1106.5758 (version of 19 Dec. 2020), p. 19, proof of Theorem 3.16, last paragraph
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.