Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 2 (A–B): uniform approximation and continuity

Open
QAlgorithms.Papers.Independent.Support50.P34.corollary2_uniformApproximation

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

prove2quantum

Let fff be a concave lower semicontinuous lower-bounded extended-real function on S(H)S(\mathcal H)S(H), and let A⊆S(H)A\subseteq S(\mathcal H)A⊆S(H).

  1. If fff is finite continuous on every rank stratum and its rank roofs converge uniformly on AAA, then fff is finite continuous on AAA.
  2. If AAA is compact and fff is finite continuous on AAA, the rank roofs converge uniformly there.
f^kσ=f^kμ⟶funiformly on A.\hat f_k^\sigma=\hat f_k^\mu\longrightarrow f\quad\text{uniformly on }A.f^​kσ​=f^​kμ​⟶funiformly on A.

Uniform approximation uses the two additive extended-real inequalities with arbitrary positive real tolerance. The second assertion does not require rank-stratum continuity. This is the continuity criterion used for entropy.

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

/-- Corollary 2 A–B, arXiv:0904.1963v3, PDF p.15: uniform approximation
and the compact converse, without carrying the hypotheses of A into B. -/
theorem corollary2_uniformApproximation (b : HilbertBasis I ℂ H)
    (f : QuantumState b → EReal) (hf : LowerSemicontinuous f) (hb : LowerBounded f)
    (hc : StateConcaveOn b Set.univ f) (A : Set (QuantumState b)) :
    ((∀ k : ℕ, 0 < k → FiniteERealContinuousOn f (rankStates b k)) →
      UniformExtendedApproximation (fun n => rankMuRoof b f (n + 1)) f A →
      FiniteERealContinuousOn f A) ∧
    (IsCompact A → FiniteERealContinuousOn f A →
      UniformExtendedApproximation (fun n => rankMuRoof b f (n + 1)) f A) := 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. 15, Corollary 2 (A–B): uniform approximation and continuity
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 a trace-class operator admits 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​∥<∞; let ν(T)\nu(T)ν(T) be 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, equipped with the initial topology of all functions T↦ν(T−S)T\mapsto\nu(T-S)T↦ν(T−S) for trace-class SSS. Let Sb,k\mathcal S_{b,k}Sb,k​ be the states whose ranges lie in the span of some kkk vectors. Suppose f:Sb→[−∞,∞]f:\mathcal S_b\to[-\infty,\infty]f:Sb​→[−∞,∞] is lower semicontinuous, bounded below by a real constant, and concave: the state operators form a convex set and af(ρ)+cf(σ)≤f(τ)af(\rho)+cf(\sigma)\le f(\tau)af(ρ)+cf(σ)≤f(τ) whenever a,c≥0a,c\ge0a,c≥0, a+c=1a+c=1a+c=1, and τ=aρ+cσ\tau=a\rho+c\sigmaτ=aρ+cσ. For each kkk, define Fk(ρ)F_k(\rho)Fk​(ρ) as the supremum of ∫f+ dμ−∫(−f)+ dμ\int f_+\,d\mu-\int(-f)_+\,d\mu∫f+​dμ−∫(−f)+​dμ over probability measures on Sb,k\mathcal S_{b,k}Sb,k​ whose matrix elements are integrable and have barycenter ρ\rhoρ. For every subset A⊆SbA\subseteq\mathcal S_bA⊆Sb​, both following implications hold: if fff is finite and real-continuous on every Sb,k\mathcal S_{b,k}Sb,k​, k>0k>0k>0, and

∀ε>0  ∃N  ∀n≥N  ∀ρ∈A,f(ρ)≤Fn+1(ρ)+εandFn+1(ρ)≤f(ρ)+ε,\forall\varepsilon>0\;\exists N\;\forall n\ge N\;\forall\rho\in A,\qquad f(\rho)\le F_{n+1}(\rho)+\varepsilon \quad\text{and}\quad F_{n+1}(\rho)\le f(\rho)+\varepsilon,∀ε>0∃N∀n≥N∀ρ∈A,f(ρ)≤Fn+1​(ρ)+εandFn+1​(ρ)≤f(ρ)+ε,

then fff is finite on AAA and its real-valued version is continuous on AAA; and if AAA is compact and fff is finite and real-continuous on AAA, then the displayed uniform inequalities hold. Those inequalities are interpreted in extended-real arithmetic and do not themselves impose finite-valuedness. The subset AAA 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