Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Monotone continuity characterizes convex µ-compact sets

Open
QAlgorithms.Papers.Independent.Support50.P33.monotoneContinuityCharacterization

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 following three properties are equivalent:

  1. AAA is μ\muμ-compact.
  2. Every pointwise nondecreasing sequence (fn)(f_n)(fn​) in Cb(A)C_b(A)Cb​(A) with pointwise limit 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}\overline{\operatorname{co}}f_n(x)=\overline{\operatorname{co}}f_0(x)\qquad(x\in A).n→∞lim​cofn​(x)=cof0​(x)(x∈A).
  1. Every pointwise nondecreasing sequence of lower semicontinuous functions fn:A→(−∞,+∞]f_n:A\to(-\infty,+\infty]fn​:A→(−∞,+∞], each with its own finite lower bound, with pointwise limit f0f_0f0​, satisfies the same displayed identity, with convergence in the extended real line. The limit f0f_0f0​ need not be finite or bounded.

When these equivalent properties hold, the displayed identity also holds for every pointwise nonincreasing sequence of bounded real lower semicontinuous functions fnf_nfn​ whose pointwise limit f0f_0f0​ is bounded real and lower semicontinuous. Boundedness is required individually, without a common two-sided bound across the sequence. The notation f0f_0f0​ here denotes the separate limit, not a designated first term.

This characterizes compactness of barycenter preimages by sequential continuity of convex closure, and includes the decreasing-sequence consequence.

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

/-- Theorem, arXiv:1004.3792v1, PDF p.3, including the final decreasing
sequence assertion. The two equivalences encode (i) iff (ii) iff (iii).
All envelopes in this theorem are closed convex envelopes. In (iii) every
term has a finite real lower bound, and positive infinite costs and limits
are allowed. The separate limit is not the first sequence term. -/
theorem monotoneContinuityCharacterization (A : Set E)
    (hA : GeneralBarycenterSpace A) (hc : Convex ℝ A) :
    (MuCompact 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 => closedConvexHullFunction A (fun y => (f n y : EReal)) x)
          atTop (𝓝 (closedConvexHullFunction A (fun y => (fLimit y : EReal)) x))) ∧
    (MuCompact A ↔
      ∀ (f : ℕ → E → EReal) (fLimit : E → EReal),
        (∀ n, LowerSemicontinuous (fun x : A => f n x)) →
        (∀ n, ∃ c : ℝ, ∀ x ∈ A, (c : EReal) ≤ f n x) →
        (∀ x ∈ A, Monotone (fun n => f n x)) →
        (∀ x ∈ A, Tendsto (fun n => f n x) atTop (𝓝 (fLimit x))) →
        ∀ x ∈ A, Tendsto (fun n => closedConvexHullFunction A (f n) x)
          atTop (𝓝 (closedConvexHullFunction A fLimit x))) ∧
    (MuCompact A →
      ∀ (f : ℕ → E → ℝ) (fLimit : E → ℝ),
        (∀ n, LowerSemicontinuous (fun x : A => f n x)) →
        (∀ n, ∃ M : ℝ, ∀ x ∈ A, |f n x| ≤ M) →
        LowerSemicontinuous (fun x : A => fLimit x) →
        (∃ M : ℝ, ∀ x ∈ A, |fLimit x| ≤ M) →
        (∀ x ∈ A, Antitone (fun n => f n x)) →
        (∀ x ∈ A, Tendsto (fun n => f n x) atTop (𝓝 (fLimit x))) →
        ∀ x ∈ A, Tendsto
          (fun n => closedConvexHullFunction A (fun y => (f n y : EReal)) x)
          atTop (𝓝 (closedConvexHullFunction 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. 3, Theorem
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 a 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 integrable on AAA against μ\muμ and satisfies ℓ(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. Write M(A)M(A)M(A) for the assertion that {μ:bA(μ)∈K}\{\mu:b_A(\mu)\in K\}{μ:bA​(μ)∈K} is compact in the space of probability measures on AAA for every compact K⊆HAK\subseteq H_AK⊆HA​. For h:E→[−∞,+∞]h:E\to[-\infty,+\infty]h:E→[−∞,+∞], define CAh(x)C_Ah(x)CA​h(x) as the supremum of g(x)g(x)g(x) over all g:E→[−∞,+∞]g:E\to[-\infty,+\infty]g:E→[−∞,+∞] whose restriction to AAA is lower semicontinuous, which satisfy g≤hg\le hg≤h on AAA, and for which g(au+bv)≤ag(u)+bg(v)g(au+bv)\le ag(u)+bg(v)g(au+bv)≤ag(u)+bg(v) whenever u,v∈Au,v\in Au,v∈A, a,b≥0a,b\ge0a,b≥0, and a+b=1a+b=1a+b=1; these operations use extended-real arithmetic, including zero coefficients. The theorem asserts the conjunction of three statements: (1) M(A)M(A)M(A) holds if and only if, for every sequence fn:E→Rf_n:E\to\mathbb Rfn​:E→R, indexed by all n∈Nn\in\mathbb Nn∈N, and every f∞:E→Rf_\infty:E\to\mathbb Rf∞​:E→R, if every fnf_nfn​ and f∞f_\inftyf∞​ is continuous on AAA and bounded there in absolute value by a real constant, fn(x)f_n(x)fn​(x) is nondecreasing in nnn for every x∈Ax\in Ax∈A, and fn(x)→f∞(x)f_n(x)\to f_\infty(x)fn​(x)→f∞​(x) for every x∈Ax\in Ax∈A, then CAfn(x)→CAf∞(x)C_Af_n(x)\to C_Af_\infty(x)CA​fn​(x)→CA​f∞​(x) for every x∈Ax\in Ax∈A. (2) M(A)M(A)M(A) holds if and only if the same envelope-convergence conclusion holds for every sequence fn:E→[−∞,+∞]f_n:E\to[-\infty,+\infty]fn​:E→[−∞,+∞] and every f∞:E→[−∞,+∞]f_\infty:E\to[-\infty,+\infty]f∞​:E→[−∞,+∞] such that each fn∣Af_n|_Afn​∣A​ is lower semicontinuous, each fnf_nfn​ has a real lower bound cn≤fn(x)c_n\le f_n(x)cn​≤fn​(x) for all x∈Ax\in Ax∈A, and fn(x)f_n(x)fn​(x) increases nondecreasingly to f∞(x)f_\infty(x)f∞​(x) at every x∈Ax\in Ax∈A; no separate regularity assumption on f∞f_\inftyf∞​ is imposed. (3) If M(A)M(A)M(A) holds, then CAfn(x)→CAf∞(x)C_Af_n(x)\to C_Af_\infty(x)CA​fn​(x)→CA​f∞​(x) for every x∈Ax\in Ax∈A whenever fn,f∞:E→Rf_n,f_\infty:E\to\mathbb Rfn​,f∞​:E→R are lower semicontinuous on AAA, each is bounded there in absolute value by a real constant, and fn(x)f_n(x)fn​(x) decreases nonincreasingly to f∞(x)f_\infty(x)f∞​(x) at every x∈Ax\in Ax∈A. All bounds on individual sequence terms may depend on nnn, and all envelope convergence is in the extended-real topology. The set AAA may be empty, in which case assertions quantified over x∈Ax\in Ax∈A are vacuous.

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