Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2

Open
QAlgorithms.Papers.Independent.Gap48.P18.entropy_maximizing_sequences_common_limit

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

prove2quantum

Let AAA be a nonempty closed convex set of density states, with finite entropy supremum S=sup⁡ρ∈AH(ρ)S=\sup_{\rho\in A}H(\rho)S=supρ∈A​H(ρ). There is a unique state ρ∗(A)∈A\rho_*(A)\in Aρ∗​(A)∈A such that every sequence ρn∈A\rho_n\in Aρn​∈A satisfying H(ρn)→SH(\rho_n)\to SH(ρn​)→S obeys

ρn⟶ρ∗(A)in trace norm.\rho_n\longrightarrow\rho_*(A)\quad\text{in trace norm}.ρn​⟶ρ∗​(A)in trace norm.

If an entropy maximizer Γ(A)\Gamma(A)Γ(A) exists, it equals ρ∗(A)\rho_*(A)ρ∗​(A) and entropy restricted to AAA is finite and continuous at Γ(A)\Gamma(A)Γ(A). The common limit need not itself attain the supremum.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P18
Formal statement
noncomputable section

open MeasureTheory Filter

open scoped ENNReal NNReal Topology Matrix.Norms.L2Operator

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State PureState traceSize traceClosure IsTraceClassChannel productCoeff)

open QAlgorithms.Papers.Independent.Frontier18.P07
  (GeneralizedEnsemble HasFiniteSupport HasAverage averageCoefficients
   extendedEntropyNats extendedRelativeEntropyNats
   finiteEnsembleCapacity pureStates)

open QAlgorithms.Papers.Independent.Frontier18.P01 (traceFirst traceSecond)

namespace QAlgorithms.Papers.Independent.Gap48.P18

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Lemma 2, arXiv:quant-ph/0510073v2, PDF pp.7.
 -/
theorem entropy_maximizing_sequences_common_limit {I : Type} [Countable I] [Nonempty I]
    (A : Set (State I)) (hA : A.Nonempty) (hclosed : IsClosed A)
    (hconvex : CoefficientConvexStates A) (hfinite : entropySup A < ⊤) :
    ∃! omega : State I, omega ∈ A ∧
      (∀ seq : ℕ → State I, (∀ n, seq n ∈ A) →
        Tendsto (fun n => stateEntropyNats (seq n)) atTop (𝓝 (entropySup A)) →
          Tendsto seq atTop (𝓝 omega)) ∧
      (∀ gamma ∈ A, stateEntropyNats gamma = entropySup A →
        gamma = omega ∧ FiniteContinuousWithinAt stateEntropyNats A gamma) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

end
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 7, Lemma 2
Read-back

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

Let III be an at most countable, nonempty index set. A state on III is a complex matrix RRR admitting an expansion Rij=∑m≥0um,ivm,j‾R_{ij}=\sum_{m\ge0}u_{m,i}\overline{v_{m,j}}Rij​=∑m≥0​um,i​vm,j​​, where um,vm∈ℓ2(I;C)u_m,v_m\in\ell^2(I;\mathbb C)um​,vm​∈ℓ2(I;C) and ∑m∥um∥∥vm∥<∞\sum_m\|u_m\|\|v_m\|<\infty∑m​∥um​∥∥vm​∥<∞, such that every finite quadratic form ∑i,j∈szi‾Rijzj\sum_{i,j\in s}\overline{z_i}R_{ij}z_j∑i,j∈s​zi​​Rij​zj​ is real and nonnegative, the real diagonal entries are summable, and their sum is 111. Write T(X)T(X)T(X) for the infimum, over all such expansions of XXX, of [∑m∥um∥∥vm∥]+[\sum_m\|u_m\|\|v_m\|]_+[∑m​∥um​∥∥vm​∥]+​, where [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0) is regarded as an element of [0,∞][0,\infty][0,∞], and an infimum over no expansions is ∞\infty∞. Equip states with the topology generated by the sets {R:T(R−R0)<ε}\{R:T(R-R_0)<\varepsilon\}{R:T(R−R0​)<ε}, for states R0R_0R0​ and real ε>0\varepsilon>0ε>0. For any matrix XXX, define

S(X)=sup⁡s⊆Is finite[Re⁡tr⁡(Xs)log⁡ ⁣(Re⁡tr⁡(Xs))−Re⁡tr⁡ ⁣(Xs log⁡cfcXs)]+,S(X)=\sup_{\substack{s\subseteq I\\s\text{ finite}}} \left[ \operatorname{Re}\operatorname{tr}(X_s)\log\!\bigl(\operatorname{Re}\operatorname{tr}(X_s)\bigr) -\operatorname{Re}\operatorname{tr}\!\bigl(X_s\,\log_{\mathrm{cfc}}X_s\bigr) \right]_+,S(X)=s⊆Is finite​sup​[Retr(Xs​)log(Retr(Xs​))−Retr(Xs​logcfc​Xs​)]+​,

where XsX_sXs​ is the principal compression indexed by sss, including the empty compression, and log⁡cfc\log_{\mathrm{cfc}}logcfc​ is the continuous functional calculus for the total real logarithm, with log⁡0=0\log 0=0log0=0. Suppose AAA is a nonempty closed set of states, its set of coefficient matrices is convex over R\mathbb RR, and S∗=sup⁡R∈AS(R)<∞S_*=\sup_{R\in A}S(R)<\inftyS∗​=supR∈A​S(R)<∞. Then there exists exactly one state ω\omegaω having all the following properties: ω∈A\omega\in Aω∈A; every sequence (Rn)n≥0(R_n)_{n\ge0}(Rn​)n≥0​ in AAA with S(Rn)→S∗S(R_n)\to S_*S(Rn​)→S∗​ converges to ω\omegaω; and every γ∈A\gamma\in Aγ∈A satisfying S(γ)=S∗S(\gamma)=S_*S(γ)=S∗​ equals ω\omegaω, has finite entropy, and is a point at which SSS is continuous when its argument is restricted to AAA. The statement does not separately assert that any state attains S∗S_*S∗​.

Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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