Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite-support replacement preserves barycenters and failure of relative compactness

Open
QAlgorithms.Papers.Independent.Support50.P33.finiteSupportReplacement

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.

Let (μk)k∈N(\mu_k)_{k\in\mathbb N}(μk​)k∈N​ be any sequence in M(A)M(A)M(A) whose range is not relatively compact. There is a sequence (μ~k)k∈N(\widetilde\mu_k)_{k\in\mathbb N}(μ​k​)k∈N​ in M(A)M(A)M(A) such that

supp⁡(μ~k) is finite for every k,{μ~k:k∈N}‾ is not compact,b(μ~k)=b(μk)(k∈N).\begin{gathered} \operatorname{supp}(\widetilde\mu_k)\text{ is finite for every }k,\qquad \overline{\{\widetilde\mu_k:k\in\mathbb N\}}\text{ is not compact},\\ b(\widetilde\mu_k)=b(\mu_k)\qquad(k\in\mathbb N). \end{gathered}supp(μ​k​) is finite for every k,{μ​k​:k∈N}​ is not compact,b(μ​k​)=b(μk​)(k∈N).​

Here closure and compactness are taken in the weak topology of M(A)M(A)M(A), and support is the topological support of a measure on the Polish space AAA, equivalently concentration on finitely many atoms.

This replacement preserves every barycenter while retaining the original obstruction to weak relative compactness.

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

/-- Lemma 1, arXiv:1004.3792v1, PDF pp.4–5 (statement crosses the
page break). Both sequence ranges have noncompact closure in the weak
probability topology. Barycenters agree for every index, and finiteness
refers to the measure's topological support on A. -/
theorem finiteSupportReplacement (A : Set E)
    (hA : GeneralBarycenterSpace A) (hc : Convex ℝ A)
    (mu : ℕ → ProbabilityMeasure A)
    (hmu : ¬ IsCompact (closure (Set.range mu))) :
    ∃ nu : ℕ → ProbabilityMeasure A,
      (∀ k, ((nu k : Measure A).support).Finite) ∧
      ¬ IsCompact (closure (Set.range nu)) ∧
      ∀ k, pettisBarycenter A (nu k) = pettisBarycenter A (mu k) := by sorry

end LocallyConvexResults

end QAlgorithms.Papers.Independent.Support50.P33

end
Source
Characterization of convex μμμ-compact sets, arXiv:1004.3792v1, PDF p. 4, Lemma 1 (continued on PDF p.5)
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. For each Borel probability measure ρ\rhoρ on AAA, let bA(ρ)b_A(\rho)bA​(ρ) be a chosen point z∈Ez\in Ez∈E such that, for every continuous real linear functional ℓ:E→R\ell:E\to\mathbb Rℓ:E→R, the function ℓ∣A\ell|_Aℓ∣A​ is ρ\rhoρ-integrable and ℓ(z)=∫Aℓ(y) dρ(y)\ell(z)=\int_A\ell(y)\,d\rho(y)ℓ(z)=∫A​ℓ(y)dρ(y), if such a point exists; otherwise let bA(ρ)=0b_A(\rho)=0bA​(ρ)=0. For every sequence (μk)k∈N(\mu_k)_{k\in\mathbb N}(μk​)k∈N​ of probability measures on AAA whose range has noncompact closure in the space of probability measures on AAA, there exists another sequence (νk)k∈N(\nu_k)_{k\in\mathbb N}(νk​)k∈N​ of probability measures on AAA such that the support of each underlying measure νk\nu_kνk​ is finite, the closure of {νk:k∈N}\{\nu_k:k\in\mathbb N\}{νk​:k∈N} is noncompact, and bA(νk)=bA(μk)b_A(\nu_k)=b_A(\mu_k)bA​(νk​)=bA​(μk​) for every k∈Nk\in\mathbb Nk∈N. The finite support sizes may depend on kkk. If AAA is empty, no input sequence of probability measures on AAA exists.

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