Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6: determination by finite-rank states

Open
QAlgorithms.Papers.Independent.Support50.P34.lemma6_finiteRankDetermination

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

prove2quantum

Let f,g:S(H)→[−∞,+∞]f,g:S(\mathcal H)\to[-\infty,+\infty]f,g:S(H)→[−∞,+∞] each be concave, lower semicontinuous, and bounded below by a real number. If they agree on the finite-rank states Sf(H)S_f(\mathcal H)Sf​(H), then

f∣Sf(H)=g∣Sf(H)⟹f=g.f|_{S_f(\mathcal H)}=g|_{S_f(\mathcal H)}\quad\Longrightarrow\quad f=g.f∣Sf​(H)​=g∣Sf​(H)​⟹f=g.

Both functions may take the value +∞+\infty+∞. This states uniqueness from finite-rank data, rather than mere existence of a restriction.

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 6, arXiv:0904.1963v3, PDF p.14: uniqueness for two functions,
including infinite values. -/
theorem lemma6_finiteRankDetermination (b : HilbertBasis I ℂ H)
    (f g : QuantumState b → EReal) (hf : LowerSemicontinuous f)
    (hg : LowerSemicontinuous g) (hfb : LowerBounded f) (hgb : LowerBounded g)
    (hfc : StateConcaveOn b Set.univ f) (hgc : StateConcaveOn b Set.univ g)
    (hfg : ∀ rho ∈ finiteRankStates b, f rho = g rho) : f = g := 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. 14, Lemma 6: determination by finite-rank states
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 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​∥<∞, and ν(T)\nu(T)ν(T) is 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), with SSS trace class. Let f,g:Sb→[−∞,∞]f,g:\mathcal S_b\to[-\infty,\infty]f,g:Sb​→[−∞,∞] be lower semicontinuous, and assume each is bounded below by a real constant, with possibly different constants. Assume each is concave as follows: the set of state operators is convex, and for any states satisfying τ=aρ+cσ\tau=a\rho+c\sigmaτ=aρ+cσ, where a,c≥0a,c\ge0a,c≥0 and a+c=1a+c=1a+c=1, both

af(ρ)+cf(σ)≤f(τ),ag(ρ)+cg(σ)≤g(τ)af(\rho)+cf(\sigma)\le f(\tau), \qquad ag(\rho)+cg(\sigma)\le g(\tau)af(ρ)+cf(σ)≤f(τ),ag(ρ)+cg(σ)≤g(τ)

hold in extended-real arithmetic. Suppose f(ρ)=g(ρ)f(\rho)=g(\rho)f(ρ)=g(ρ) whenever there exists a natural number k>0k>0k>0 such that the range of ρ\rhoρ is contained in the span of some kkk vectors. Then f=gf=gf=g as functions on all states, including states for which their common value may be +∞+\infty+∞. No upper bound or finite-valuedness assumption is imposed.

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