Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.9 — strong negative type admits an embedding ϕ with β_ϕ injective on M¹(X)

Proved
DistCov.Indep.lemma_3_9

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

barycenterembeddingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strong-negative-type

Let X\mathcal XX be a separable metric space with its Borel σ\sigmaσ-field, of strong negative type. Then there exists an embedding ϕ:X→ℓ2(N)\phi:\mathcal X\to\ell^2(\mathbb N)ϕ:X→ℓ2(N), i.e. d(x,x′)=∥ϕ(x)−ϕ(x′)∥2d(x,x')=\|\phi(x)-\phi(x')\|^2d(x,x′)=∥ϕ(x)−ϕ(x′)∥2 for all x,x′x,x'x,x′, such that the barycenter map βϕ\beta_\phiβϕ​ is injective on M1(X)M^1(\mathcal X)M1(X), the finite signed measures μ\muμ for which ∣μ∣|\mu|∣μ∣ has a finite first moment (not merely on the probability measures).

Injectivity on all of M1(X)M^1(\mathcal X)M1(X), rather than on probability measures, is what the independence argument needs: the measure θ−μ×ν\theta-\mu\times\nuθ−μ×ν it must detect is a signed measure of total mass 000.

Formalization Note Injectivity on M1(X)M^1(\mathcal X)M1(X) is stated through pairs of finite measures: βϕ(m1)=βϕ(m2)⇒m1=m2\beta_\phi(m_1)=\beta_\phi(m_2)\Rightarrow m_1=m_2βϕ​(m1​)=βϕ​(m2​)⇒m1​=m2​ for finite m1,m2m_1,m_2m1​,m2​ with finite first moment (equivalent via the Jordan decomposition and linearity of βϕ\beta_\phiβϕ​). The target is ℓ2(N)\ell^2(\mathbb N)ℓ2(N), enough for separable X\mathcal XX. Separability is the standing assumption of Errata (i), p. 24.

Preamble
import Mathlib
import Definitions.Def_DistCov_Indep_Setting
Formal statement
namespace DistCov.Indep

open MeasureTheory

theorem lemma_3_9 {X : Type*} [MetricSpace X] [MeasurableSpace X] [BorelSpace X] [SecondCountableTopology X]
    (h : StrongNegType X) : ∃ ϕ : X → L2N, IsNegTypeEmbedding ϕ ∧ BaryInjM1 ϕ := by sorry

end DistCov.Indep
Source
Lyons, Distance covariance in metric spaces, arXiv:1106.5758 (version of 19 Dec. 2020), p. 16, Lemma 3.9 (M¹(X) defined on p. 15); Errata (i), p. 24
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