Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pointwise µ-compactness is characterized by ordinary convex-hull monotone continuity

Open
QAlgorithms.Papers.Independent.Support50.P33.pointwiseMuCompactCharacterization

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.

Write Cb(A)C_b(A)Cb​(A) for the bounded continuous real functions on AAA. For an extended-valued cost fff, let co⁡f\operatorname{co}fcof be its greatest convex minorant and co⁡‾f\overline{\operatorname{co}}fcof its greatest lower semicontinuous convex minorant. A finite lower bound means f(x)≥cf(x)\ge cf(x)≥c for all x∈Ax\in Ax∈A for some c∈Rc\in\mathbb Rc∈R, so positive infinity is permitted but negative infinity is excluded on AAA.

The set AAA is pointwise μ\muμ-compact if and only if every pointwise nondecreasing sequence (fn)(f_n)(fn​) in Cb(A)C_b(A)Cb​(A) whose pointwise limit is a separate function f0∈Cb(A)f_0\in C_b(A)f0​∈Cb​(A) satisfies

lim⁡n→∞co⁡fn(x)=co⁡f0(x)(x∈A).\lim_{n\to\infty}\operatorname{co}f_n(x)=\operatorname{co}f_0(x)\qquad(x\in A).n→∞lim​cofn​(x)=cof0​(x)(x∈A).

Each function is individually bounded; no common bound on the whole sequence is added. These are ordinary convex hulls, which are not required to be lower semicontinuous.

This detects compactness of individual barycenter fibers through continuity of the ordinary convex-hull operation.

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

/-- Remark 2 continuation, arXiv:1004.3792v1, PDF p.6. There are no
bars on the convex hulls in this equivalence. Inputs and the separate
pointwise limit are bounded continuous real functions on A. -/
theorem pointwiseMuCompactCharacterization (A : Set E)
    (hA : GeneralBarycenterSpace A) (hc : Convex ℝ A) :
    PointwiseMuCompact A ↔
      ∀ (f : ℕ → E → ℝ) (fLimit : E → ℝ),
        (∀ n, BoundedContinuousOn A (f n)) → BoundedContinuousOn A fLimit →
        (∀ x ∈ A, Monotone (fun n => f n x)) →
        (∀ x ∈ A, Tendsto (fun n => f n x) atTop (𝓝 (fLimit x))) →
        ∀ x ∈ A, Tendsto
          (fun n => convexHullFunction A (fun y => (f n y : EReal)) x)
          atTop (𝓝 (convexHullFunction A (fun y => (fLimit y : EReal)) x)) := by sorry

end LocallyConvexResults

end QAlgorithms.Papers.Independent.Support50.P33

end
Source
Characterization of convex μμμ-compact sets, arXiv:1004.3792v1, PDF p. 6, Remark 2 continuation: equivalence (i)–(ii)
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 HA=conv⁡‾R(A)H_A=\overline{\operatorname{conv}}_{\mathbb R}(A)HA​=convR​(A) complete, separable, and metrizable. For each Borel probability measure μ\muμ on AAA, define bA(μ)b_A(\mu)bA​(μ) by choosing a point z∈Ez\in Ez∈E such that every continuous real linear functional ℓ:E→R\ell:E\to\mathbb Rℓ:E→R is μ\muμ-integrable on AAA and ℓ(z)=∫Aℓ(y) dμ(y)\ell(z)=\int_A\ell(y)\,d\mu(y)ℓ(z)=∫A​ℓ(y)dμ(y), if such a point exists, and setting bA(μ)=0b_A(\mu)=0bA​(μ)=0 otherwise. For h:E→[−∞,+∞]h:E\to[-\infty,+\infty]h:E→[−∞,+∞], define VAh(x)V_Ah(x)VA​h(x) as the supremum of g(x)g(x)g(x) over all g:E→[−∞,+∞]g:E\to[-\infty,+\infty]g:E→[−∞,+∞] such that g(y)≤h(y)g(y)\le h(y)g(y)≤h(y) for every y∈Ay\in Ay∈A and g(au+bv)≤ag(u)+bg(v)g(au+bv)\le ag(u)+bg(v)g(au+bv)≤ag(u)+bg(v) for every u,v∈Au,v\in Au,v∈A and real a,b≥0a,b\ge0a,b≥0 with a+b=1a+b=1a+b=1, using extended-real arithmetic even when a coefficient is zero. Then the fiber {μ:bA(μ)=x}\{\mu:b_A(\mu)=x\}{μ:bA​(μ)=x} is compact for every x∈HAx\in H_Ax∈HA​ if and only if the following holds: for every sequence fn:E→Rf_n:E\to\mathbb Rfn​:E→R, indexed by n∈Nn\in\mathbb Nn∈N, and every f∞:E→Rf_\infty:E\to\mathbb Rf∞​:E→R, if each fnf_nfn​ and f∞f_\inftyf∞​ is continuous on AAA and bounded there in absolute value by a real constant, and fn(x)f_n(x)fn​(x) is nondecreasing and converges to f∞(x)f_\infty(x)f∞​(x) for every x∈Ax\in Ax∈A, then VAfn(x)→VAf∞(x)V_Af_n(x)\to V_Af_\infty(x)VA​fn​(x)→VA​f∞​(x) in the extended-real topology for every x∈Ax\in Ax∈A. The bounds for fnf_nfn​ may depend on nnn; no lower semicontinuity condition is imposed on the functions ggg defining VAV_AVA​. Empty fibers are permitted and are compact, and AAA itself may be empty.

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