Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 19 — the ε-approximation: µ₁[⟨u≤L, v⟩ ≤ s] = µ₂[⟨u≤L, v⟩ ≤ s] for all L, v ∈ ℝᴸ, s

Proved
DistCov.Hilbert.finite_projections_agree

by mikedeng1 · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

gaussianl2measure-determinationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let μ1,μ2\mu_1,\mu_2μ1​,μ2​ be Borel probability measures on ℓ2(Z+)\ell^2(\mathbb Z^+)ℓ2(Z+) with finite first moments, and let F=β(μ1−μ2)F=\beta(\mu_1-\mu_2)F=β(μ1​−μ2​) be as above:

F(w,s)=μ1{u ; w(u)≤cs}−μ2{u ; w(u)≤cs}.F(w,s)=\mu_1\{u\,;\,w(u)\le cs\}-\mu_2\{u\,;\,w(u)\le cs\}.F(w,s)=μ1​{u;w(u)≤cs}−μ2​{u;w(u)≤cs}.

Suppose that for every K≥0K\ge0K≥0, for ρ\rhoρ-a.e. www, F((v,w),s)=0F((v,w),s)=0F((v,w),s)=0 for all v∈RKv\in\mathbb R^Kv∈RK and s∈Rs\in\mathbb Rs∈R. Then for every LLL, every v∈RLv\in\mathbb R^Lv∈RL and every s∈Rs\in\mathbb Rs∈R,

μ1[⟨u≤L,v⟩≤s]=μ2[⟨u≤L,v⟩≤s],\mu_1\big[\langle u_{\le L},v\rangle\le s\big]=\mu_2\big[\langle u_{\le L},v\rangle\le s\big],μ1​[⟨u≤L​,v⟩≤s]=μ2​[⟨u≤L​,v⟩≤s],

where u≤L=(u1,…,uL)u_{\le L}=(u_1,\dots,u_L)u≤L​=(u1​,…,uL​).

This is the conclusion of the last paragraph of the proof of Theorem 3.16; together with the Cramér–Wold reduction it yields μ1=μ2\mu_1=\mu_2μ1​=μ2​.

Formalization Note. Indices start at 000, so u≤Lu_{\le L}u≤L​ is (u0,…,uL−1)(u_0,\dots,u_{L-1})(u0​,…,uL−1​). The hypothesis "for every KKK" stands in for the paper's choice of KKK large enough for a given ϵ\epsilonϵ.

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
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me