Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1: lower semicontinuous rank-concave roofs

Open
QAlgorithms.Papers.Independent.Support50.P34.proposition1_lowerSemicontinuousRoofs

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

prove2quantum

Let k≥1k\ge1k≥1 and let f:Sk(H)→[−∞,+∞]f:S_k(\mathcal H)\to[-\infty,+\infty]f:Sk​(H)→[−∞,+∞] be lower semicontinuous and bounded below by a real number. Its countable concave roof f^kσ\hat f_k^\sigmaf^​kσ​ maximizes ensemble averages over countable rank-at-most-kkk decompositions; its integral roof f^kμ\hat f_k^\muf^​kμ​ maximizes extended integrals over all Borel probability decompositions. Then

f^kσ=f^kμ.\hat f_k^\sigma=\hat f_k^\mu.f^​kσ​=f^​kμ​.

The common function is lower semicontinuous and μ\muμ-concave on all states. Here μ\muμ-concavity includes universal completion-measurability and Jensen's inequality for every Borel probability with its specified barycenter. No finite upper bound is assumed. This identifies the two roofs in the lower semicontinuous regime.

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

/-- Proposition 1, arXiv:0904.1963v3, PDF p.12: equality, lower semicontinuity,
and universal-measurability-inclusive mu concavity. -/
theorem proposition1_lowerSemicontinuousRoofs (b : HilbertBasis I ℂ H)
    (k : ℕ) (hk : 0 < k) (f : rankStates b k → EReal)
    (hf : LowerSemicontinuous f) (hb : LowerBounded f) :
    sigmaRoof b (rankStates b k) f = upperRoof b (rankStates b k) f ∧
    LowerSemicontinuous (upperRoof b (rankStates b k) f) ∧
    MuConcave b (upperRoof b (rankStates b k) f) := 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. 12, Proposition 1: lower semicontinuous rank-concave roofs
Read-back

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

Let HHH be a complex Hilbert space with Hilbert basis b=(bi)i∈Ib=(b_i)_{i\in I}b=(bi​)i∈I​. Here trace-class operators admit representations Tx=∑r⟨vr,x⟩urTx=\sum_r\langle v_r,x\rangle u_rTx=∑r​⟨vr​,x⟩ur​ with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞; write ν(T)\nu(T)ν(T) for the infimum of these sums. Let Sb\mathcal S_bSb​ consist of the self-adjoint trace-class operators with nonnegative quadratic forms and basis trace 111, topologized by all functions T↦ν(T−S)T\mapsto\nu(T-S)T↦ν(T−S) for trace-class SSS. For k∈Nk\in\mathbb Nk∈N with k>0k>0k>0, let Sb,k\mathcal S_{b,k}Sb,k​ be the states whose ranges lie in the span of some kkk vectors. A probability measure μ\muμ on this set has barycenter ρ\rhoρ if every matrix element is integrable and ⟨x,ρy⟩=∫⟨x,σy⟩ dμ(σ)\langle x,\rho y\rangle=\int\langle x,\sigma y\rangle\,d\mu(\sigma)⟨x,ρy⟩=∫⟨x,σy⟩dμ(σ) for all x,y∈Hx,y\in Hx,y∈H. For an extended-real function qqq, put

Iμ(q)=(∫q+ dμ)−(∫(−q)+ dμ),\mathcal I_\mu(q)= \left(\int q_+\,d\mu\right)-\left(\int(-q)_+\,d\mu\right),Iμ​(q)=(∫q+​dμ)−(∫(−q)+​dμ),

where each positive part is valued in [0,∞][0,\infty][0,∞], and the difference uses extended-real arithmetic. Let f:Sb,k→[−∞,∞]f:\mathcal S_{b,k}\to[-\infty,\infty]f:Sb,k​→[−∞,∞] be lower semicontinuous and satisfy c≤f(σ)c\le f(\sigma)c≤f(σ) for some real ccc and every σ\sigmaσ. Define Uf(ρ)U_f(\rho)Uf​(ρ) as the supremum of Iμ(f)\mathcal I_\mu(f)Iμ​(f) over all probability measures with barycenter ρ\rhoρ, and Ufat(ρ)U_f^{\mathrm{at}}(\rho)Ufat​(ρ) by restricting to measures concentrated on a countable set. Then Ufat=UfU_f^{\mathrm{at}}=U_fUfat​=Uf​ as functions on all states, UfU_fUf​ is lower semicontinuous, and UfU_fUf​ is almost-everywhere measurable for every probability measure λ\lambdaλ on Sb\mathcal S_bSb​ and satisfies Iλ(Uf)≤Uf(ρ)\mathcal I_\lambda(U_f)\le U_f(\rho)Iλ​(Uf​)≤Uf​(ρ) whenever λ\lambdaλ has barycenter ρ\rhoρ in the same matrix-element sense. The hypotheses allow f=+∞f=+\inftyf=+∞ at points but exclude f=−∞f=-\inftyf=−∞; an empty supremum is −∞-\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