Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The neighborhood criterion permits finitely many exceptional measures

Proved
QAlgorithms.Papers.Independent.Support50.P33.tightnessNeighborhoodFiniteExceptions

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let EEE be a real Hausdorff locally convex topological vector space, and let A⊆EA\subseteq EA⊆E be convex and von Neumann bounded. Assume the relative topology of AAA is generated by a countable subfamily of the ambient defining seminorms, and that AAA is complete and separable in the resulting metrizable additive uniformity. The set AAA is allowed to be empty. All regularity and convergence below are relative to AAA.

Write M(A)M(A)M(A) for the Borel probability measures on AAA with the weak convergence topology. The barycenter b(μ)∈Ab(\mu)\in Ab(μ)∈A is the Pettis integral of inclusion: every continuous real linear functional ℓ\ellℓ is integrable against μ\muμ, and ℓ(b(μ))=∫Aℓ(x) μ(dx)\ell(b(\mu))=\int_A\ell(x)\,\mu(dx)ℓ(b(μ))=∫A​ℓ(x)μ(dx). The set AAA is μ\muμ-compact when the barycenter preimage of every compact subset of AAA is compact in M(A)M(A)M(A); it is pointwise μ\muμ-compact when every barycenter fiber is compact.

Fix a complete metric ddd inducing the inherited additive uniformity on AAA, and let Uδ(K)U_\delta(K)Uδ​(K) be the closed δ\deltaδ-neighborhood, with Uδ(∅)=∅U_\delta(\varnothing)=\varnothingUδ​(∅)=∅. For an arbitrary subset M0⊆M(A)M_0\subseteq M(A)M0​⊆M(A),

M0 is tight⟺∀ε>0 ∀δ>0 ∃K⊆A compact ∃F⊆M0 finite ∀μ∈M0∖F,μ(Uδ(K))≥1−ε.\begin{aligned} M_0\text{ is tight}\quad\Longleftrightarrow\quad &\forall\varepsilon>0\ \forall\delta>0\ \exists K\subseteq A\text{ compact}\ \\ &\exists F\subseteq M_0\text{ finite}\ \forall\mu\in M_0\setminus F, \quad\mu(U_\delta(K))\ge 1-\varepsilon. \end{aligned}M0​ is tight⟺​∀ε>0 ∀δ>0 ∃K⊆A compact ∃F⊆M0​ finite ∀μ∈M0​∖F,μ(Uδ​(K))≥1−ε.​

Both KKK and the finite exceptional set FFF may depend on ε\varepsilonε and δ\deltaδ, and both are chosen before the universal measure. Here tightness has its usual uniform compact-complement meaning. No convexity or barycenter constraint is imposed on M0M_0M0​.

This form allows the neighborhood test to ignore finitely many measures for each pair of parameters.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P33
Formal statement
noncomputable section

open Set Filter MeasureTheory TopologicalSpace

open scoped Topology ENNReal

namespace QAlgorithms.Papers.Independent.Support50.P33

open QAlgorithms.Papers.Independent.Frontier18.P10

open QAlgorithms.Papers.Independent.Dependency50.P25

attribute [local instance] QAlgorithms.Papers.Independent.Support50.P33.paperMeasurable

attribute [local instance] QAlgorithms.Papers.Independent.Support50.P33.paperBorel

section LocallyConvexResults

variable {E : Type*} [UniformSpace E] [AddCommGroup E] [Module ℝ E]
    [hgroup : IsUniformAddGroup E] [hsmul : ContinuousSMul ℝ E]
    [hlc : LocallyConvexSpace ℝ E] [hhaus : T2Space E]

include hgroup hsmul hlc hhaus

/-- Unnumbered consequence after Lemma 2, arXiv:1004.3792v1, PDF p.5.
The finite exceptional subset of M, as well as the compact witness, may
vary with epsilon and delta; both precede the universal measure binder. -/
theorem tightnessNeighborhoodFiniteExceptions (A : Set E)
    (hA : GeneralBarycenterSpace A) (hc : Convex ℝ A)
    (d : MetricSpace A) (hd : d.toUniformSpace = (inferInstance : UniformSpace A))
    (M : Set (ProbabilityMeasure A)) :
    IsTightMeasureSet ((fun mu : ProbabilityMeasure A => (mu : Measure A)) '' M) ↔
      ∀ epsilon : ℝ, 0 < epsilon → ∀ delta : ℝ, 0 < delta →
        ∃ K : Set A, IsCompact K ∧
          ∃ F : Set (ProbabilityMeasure A), F ⊆ M ∧ F.Finite ∧
            ∀ mu ∈ M \ F, ENNReal.ofReal (1 - epsilon) ≤
              (mu : Measure A) (letI : MetricSpace A := d; Metric.cthickening delta K) := by sorry

end LocallyConvexResults

end QAlgorithms.Papers.Independent.Support50.P33

end
Source
Characterization of convex μμμ-compact sets, arXiv:1004.3792v1, PDF p. 5, Unnumbered consequence after Lemma 2
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let EEE be the ambient real vector space with its uniform structure and induced topology, and let A⊆EA\subseteq EA⊆E be closed, convex, and von Neumann bounded, with conv⁡‾R(A)\overline{\operatorname{conv}}_{\mathbb R}(A)convR​(A) complete, separable, and metrizable. Let ddd be any metric on AAA whose induced uniform structure equals the given subtype uniform structure, and let MMM be any set of Borel probability measures on AAA. The underlying measures in MMM are uniformly tight—meaning that, for every real η>0\eta>0η>0, there is a compact K⊆AK\subseteq AK⊆A with μ(A∖K)≤η\mu(A\setminus K)\le\etaμ(A∖K)≤η for every μ∈M\mu\in Mμ∈M—if and only if, for every real ε>0\varepsilon>0ε>0 and every real δ>0\delta>0δ>0, there exist a compact K⊆AK\subseteq AK⊆A and a finite set F⊆MF\subseteq MF⊆M such that max⁡(1−ε,0)≤μ(K[δ])\max(1-\varepsilon,0)\le\mu(K^{[\delta]})max(1−ε,0)≤μ(K[δ]) for every μ∈M∖F\mu\in M\setminus Fμ∈M∖F. Here K[δ]K^{[\delta]}K[δ] is the closed δ\deltaδ-neighborhood computed with ddd, consisting of points at distance at most δ\deltaδ from KKK, and is empty if KKK is empty; the inequality is in the extended nonnegative reals. Both KKK and FFF may depend on ε\varepsilonε and δ\deltaδ, and FFF may be empty or may equal MMM when MMM is finite, making the remaining universal condition vacuous. Empty AAA and empty MMM are also permitted, and the lower bound is zero whenever ε≥1\varepsilon\ge1ε≥1.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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