Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 (A–B): semicontinuity of barycentric extremal extensions

Open
QAlgorithms.Papers.Independent.Support50.P34.lemma2_barycentricExtensions

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

prove2quantum

Let A⊆S(H)A\subseteq S(\mathcal H)A⊆S(H) be trace-norm closed and let f:A→[−∞,+∞]f:A\to[-\infty,+\infty]f:A→[−∞,+∞] be lower semicontinuous with a finite real lower bound. Write Pρ(A)\mathcal P_\rho(A)Pρ​(A) for Borel probabilities with barycenter ρ\rhoρ, and define

fˇA(ρ)=inf⁡μ∈Pρ(A)∫Af dμ,f^A(ρ)=sup⁡μ∈Pρ(A)∫Af dμ.\check f_A(\rho)=\inf_{\mu\in\mathcal P_\rho(A)}\int_A f\,d\mu,\qquad \hat f_A(\rho)=\sup_{\mu\in\mathcal P_\rho(A)}\int_A f\,d\mu.fˇ​A​(ρ)=μ∈Pρ​(A)inf​∫A​fdμ,f^​A​(ρ)=μ∈Pρ​(A)sup​∫A​fdμ.

On co⁡‾(A)\overline{\operatorname{co}}(A)co(A), the function fˇA\check f_Afˇ​A​ is convex and lower semicontinuous, and its infimum is attained at every state. If the barycenter map into this closed convex hull is open in its relative topology, then f^A\hat f_Af^​A​ is concave and lower semicontinuous there. This distinguishes the two extremal extensions and the one attainment assertion.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P34
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped ENNReal NNReal BigOperators

namespace QAlgorithms.Papers.Independent.Support50.P34

open QAlgorithms.Papers.Independent.Dependency50.P13
  (State PositiveTraceClass traceNormValue stateTraceNormTopology traceNormTopology
   operatorTrace IsPositive IsTraceClass stateEntropy relativeEntropy entropyWeight)

open QAlgorithms.Papers.Independent.Dependency50.P25 (extendedIntegral)

open QAlgorithms.Papers.Independent.Frontier18.P01 (binaryEntropy)

attribute [local instance] Classical.propDecidable Classical.decEq

section Operators

variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]

variable {I : Type*}

section Statements

variable [hsep : TopologicalSpace.SeparableSpace H] [hI : Countable I]

include hsep hI

/-- Lemma 2 A–B, arXiv:0904.1963v3, PDF pp.5–6: both extremal extensions,
with attainment for the lower extension only. -/
theorem lemma2_barycentricExtensions (b : HilbertBasis I ℂ H)
    (A : Set (QuantumState b)) (hA : IsClosed A) (f : A → EReal)
    (hf : LowerSemicontinuous f) (hb : LowerBounded f) :
    (StateConvexOn b (stateClosedHull b A) (lowerRoof b A f) ∧
      LowerSemicontinuous (fun rho : stateClosedHull b A => lowerRoof b A f rho.val) ∧
      ∀ rho ∈ stateClosedHull b A, ∃ mu ∈ stateFiber b A rho,
        lowerRoof b A f rho = extendedIntegral (mu : Measure A) f) ∧
    (BarycenterOpenIntoHull b A →
      StateConcaveOn b (stateClosedHull b A) (upperRoof b A f) ∧
      LowerSemicontinuous (fun rho : stateClosedHull b A => upperRoof b A f rho.val)) := by sorry

end Statements

end Operators

end QAlgorithms.Papers.Independent.Support50.P34

end
Source
Continuity of the von Neumann entropy, arXiv:0904.1963v3, PDF p. 5, Lemma 2 (A–B): semicontinuity of barycentric extremal extensions
Read-back

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

Let HHH be a complete complex inner product space with Hilbert basis b=(bi)i∈Ib=(b_i)_{i\in I}b=(bi​)i∈I​. States are self-adjoint continuous complex-linear operators with nonnegative real quadratic form, basis trace ∑i′⟨bi,ρbi⟩=1\sum'_i\langle b_i,\rho b_i\rangle=1∑i′​⟨bi​,ρbi​⟩=1, and representations ρx=∑r′⟨vr,x⟩ur\rho x=\sum'_r\langle v_r,x\rangle u_rρx=∑r′​⟨vr​,x⟩ur​ with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞. Define N(R)N(R)N(R) as the real conversion of the infimum of the nonnegative extended nuclear representation costs ∑r′[∥ur∥∥vr∥]+\sum'_r[\|u_r\|\|v_r\|]_+∑r′​[∥ur​∥∥vr​∥]+​, with +∞+\infty+∞ converted to 000, and give states the topology induced by all functions ρ↦N(ρ−S)\rho\mapsto N(\rho-S)ρ↦N(ρ−S) for trace-class SSS. Let AAA be closed in this topology, and let f:A→R∪{−∞,+∞}f:A\to\mathbb R\cup\{-\infty,+\infty\}f:A→R∪{−∞,+∞} be lower semicontinuous and bounded below by some real constant. Let CCC consist of the states ρ\rhoρ such that every ε>0\varepsilon>0ε>0 admits TTT in the real convex hull of AAA's operators with N(ρ−T)<εN(\rho-T)<\varepsilonN(ρ−T)<ε. For a state ρ\rhoρ, let Bρ\mathcal B_\rhoBρ​ be the Borel probability measures μ\muμ on AAA for which every function σ↦⟨x,σy⟩\sigma\mapsto\langle x,\sigma y\rangleσ↦⟨x,σy⟩ is integrable and has integral ⟨x,ρy⟩\langle x,\rho y\rangle⟨x,ρy⟩, for all x,y∈Hx,y\in Hx,y∈H. Define

Jf(μ)=(∫A−(f(σ))+ dμ)−(∫A−(−f(σ))+ dμ),L(ρ)=inf⁡μ∈BρJf(μ),U(ρ)=sup⁡μ∈BρJf(μ),J_f(\mu)= \left(\int_A^{-}(f(\sigma))_+\,d\mu\right) - \left(\int_A^{-}(-f(\sigma))_+\,d\mu\right),\qquad L(\rho)=\inf_{\mu\in\mathcal B_\rho}J_f(\mu),\qquad U(\rho)=\sup_{\mu\in\mathcal B_\rho}J_f(\mu),Jf​(μ)=(∫A−​(f(σ))+​dμ)−(∫A−​(−f(σ))+​dμ),L(ρ)=μ∈Bρ​inf​Jf​(μ),U(ρ)=μ∈Bρ​sup​Jf​(μ),

where r+r_+r+​ denotes conversion of the nonnegative part of an extended real to [0,∞][0,\infty][0,∞], and subtraction is in the extended real numbers. Then the set of operators represented by CCC is convex, LLL is convex on CCC, its restriction to CCC is lower semicontinuous, and every ρ∈C\rho\in Cρ∈C has a measure μ∈Bρ\mu\in\mathcal B_\rhoμ∈Bρ​ attaining L(ρ)=Jf(μ)L(\rho)=J_f(\mu)L(ρ)=Jf​(μ). Moreover, if for every open set VVV of probability measures on AAA the set {ρ∈C:Bρ∩V≠∅}\{\rho\in C:\mathcal B_\rho\cap V\ne\varnothing\}{ρ∈C:Bρ​∩V=∅} is open in CCC, then UUU is concave on CCC and its restriction to CCC is lower semicontinuous. Convexity and concavity mean the respective inequalities L(aρ+dσ)≤aL(ρ)+dL(σ)L(a\rho+d\sigma)\le aL(\rho)+dL(\sigma)L(aρ+dσ)≤aL(ρ)+dL(σ) and aU(ρ)+dU(σ)≤U(aρ+dσ)aU(\rho)+dU(\sigma)\le U(a\rho+d\sigma)aU(ρ)+dU(σ)≤U(aρ+dσ) for all states in CCC and all real a,d≥0a,d\ge0a,d≥0 with a+d=1a+d=1a+d=1, using extended real arithmetic. No finiteness of either roof and no attainment of the upper roof are asserted; an empty fiber gives lower value +∞+\infty+∞ and upper value −∞-\infty−∞.

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