Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6b

Open
QAlgorithms.Papers.Independent.Gap48.P18.layer_capacity_and_optimal_pure_measure

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

prove2quantum

For a density state σ\sigmaσ, retain a chosen eigenbasis in the definition of its layer L(σ)L(\sigma)L(σ). Then, including infinite values,

Cˉ(L(σ))=H(σ).\bar C(L(\sigma))=H(\sigma).Cˉ(L(σ))=H(σ).

The layer is regular exactly when H(σ)<∞H(\sigma)<\inftyH(σ)<∞. In that case Ω(L(σ))=σ\Omega(L(\sigma))=\sigmaΩ(L(σ))=σ, and there is an optimal law with barycenter σ\sigmaσ concentrated on pure states in the layer. This gives the capacity and optimal-measure structure of a fixed-diagonal set.

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

/-- Proposition 6b, arXiv:quant-ph/0510073v2, PDF pp.51,52.
 -/
theorem layer_capacity_and_optimal_pure_measure {I : Type} [Countable I] [Nonempty I]
    (sigma : State I) (hdiag : Diagonal sigma) :
    setChiCapacity (layer sigma) = stateEntropyNats sigma ∧
      (ChiRegular (layer sigma) ↔ stateEntropyNats sigma < ⊤) ∧
      (stateEntropyNats sigma < ⊤ →
        (∀ hL : (layer sigma).Nonempty, optimalAverage (layer sigma) hL = sigma) ∧
        ∃ mu : GeneralizedEnsemble I, OptimalMeasure (layer sigma) mu ∧
          probabilityAverage mu = sigma ∧
          MeasureConcentratedOn (mu : Measure (State I)) (layer sigma ∩ pureStates I)) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

end
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 51, Proposition 6b
Read-back

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

Let III be countable and nonempty. A state is a complex matrix XXX with a nuclear expansion Xij=∑rar(i)br(j)‾X_{ij}=\sum_r a_r(i)\overline{b_r(j)}Xij​=∑r​ar​(i)br​(j)​, where ar,br∈ℓ2(I;C)a_r,b_r\in\ell^2(I;\mathbb C)ar​,br​∈ℓ2(I;C) and ∑r∥ar∥∥br∥<∞\sum_r\|a_r\|\|b_r\|<\infty∑r​∥ar​∥∥br​∥<∞, with all finite quadratic forms real and nonnegative, summable real diagonal, and ∑iRe⁡Xii=1\sum_i\operatorname{Re}X_{ii}=1∑i​ReXii​=1. Define T(X)T(X)T(X) as the infimum of those expansion sums, with empty infimum +∞+\infty+∞, and give states the topology generated by T(Y−X)<εT(Y-X)<\varepsilonT(Y−X)<ε for state centers XXX and ε>0\varepsilon>0ε>0. For finite principal submatrices Xs,YsX_s,Y_sXs​,Ys​, including the empty submatrix, define

H(X)=sup⁡s[rslog⁡rs−Re⁡tr⁡(Xslog⁡Xs)]+,rs=Re⁡tr⁡Xs,H(X)=\sup_s\bigl[r_s\log r_s-\operatorname{Re}\operatorname{tr}(X_s\log X_s)\bigr]_+, \quad r_s=\operatorname{Re}\operatorname{tr}X_s,H(X)=ssup​[rs​logrs​−Retr(Xs​logXs​)]+​,rs​=RetrXs​,

and define D(X∥Y)D(X\|Y)D(X∥Y) as the supremum over sss of [Re⁡tr⁡(Xslog⁡Xs−Xslog⁡Ys+Ys−Xs)]+\bigl[\operatorname{Re}\operatorname{tr}(X_s\log X_s-X_s\log Y_s+Y_s-X_s)\bigr]_+[Retr(Xs​logXs​−Xs​logYs​+Ys​−Xs​)]+​ when ker⁡Ys⊆ker⁡Xs\ker Y_s\subseteq\ker X_skerYs​⊆kerXs​, and +∞+\infty+∞ otherwise. Here [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0) takes values in [0,+∞][0,+\infty][0,+∞], logarithms are natural and matrix logarithms use continuous functional calculus, with the total convention log⁡0=0\log0=0log0=0. For a Borel probability measure ν\nuν, let mνm_\numν​ be its entrywise integral, χ(ν)=∫−D(X∥mν) dν(X)\chi(\nu)=\int^-D(X\|m_\nu)\,d\nu(X)χ(ν)=∫−D(X∥mν​)dν(X), and b(ν)b(\nu)b(ν) its barycenter under the fixed chosen continuous map assigning an integrable entrywise average. Let C(S)C(S)C(S) be the supremum of χ(ν)\chi(\nu)χ(ν) over probability measures with finite topological support contained in SSS. Write K(S)K(S)K(S) for the states XXX such that, for every ε>0\varepsilon>0ε>0, some YYY in the real convex hull of the coefficient matrices of SSS satisfies T(X−Y)<εT(X-Y)<\varepsilonT(X−Y)<ε. A state ω\omegaω is a radius center of SSS when D(X∥ω)≤C(S)D(X\|\omega)\le C(S)D(X∥ω)≤C(S) for every X∈SX\in SX∈S; the chosen optimal average of a nonempty SSS is a chosen radius center if one exists, and otherwise the member supplied by its nonemptiness hypothesis. Say SSS is regular when it is nonempty, C(S)<+∞C(S)<+\inftyC(S)<+∞, and it has a radius center ω\omegaω satisfying at least one of the following: H(ω)<+∞H(\omega)<+\inftyH(ω)<+∞ and every sequence Xn∈K(S)X_n\in K(S)Xn​∈K(S) with D(Xn∥ω)→0D(X_n\|\omega)\to0D(Xn​∥ω)→0 has H(Xn)→H(ω)H(X_n)\to H(\omega)H(Xn​)→H(ω); or D(X∥ω)D(X\|\omega)D(X∥ω) is finite for every X∈SX\in SX∈S and continuous on SSS. For every state σ\sigmaσ satisfying σij=0\sigma_{ij}=0σij​=0 whenever i≠ji\ne ji=j, let Lσ={X:Xii=σii for every i}L_\sigma=\{X:X_{ii}=\sigma_{ii}\text{ for every }i\}Lσ​={X:Xii​=σii​ for every i}. Then

C(Lσ)=H(σ),Lσ is regular ⟺ H(σ)<+∞.C(L_\sigma)=H(\sigma),\qquad L_\sigma\text{ is regular}\ \Longleftrightarrow\ H(\sigma)<+\infty.C(Lσ​)=H(σ),Lσ​ is regular ⟺ H(σ)<+∞.

Moreover, if H(σ)<+∞H(\sigma)<+\inftyH(σ)<+∞, every choice of the nonemptiness hypothesis for LσL_\sigmaLσ​ gives chosen optimal average σ\sigmaσ, and there exists a probability measure μ\muμ with μ(Lσ)=1\mu(L_\sigma)=1μ(Lσ​)=1, χ(μ)=C(Lσ)\chi(\mu)=C(L_\sigma)χ(μ)=C(Lσ​), b(μ)=σb(\mu)=\sigmab(μ)=σ, and almost every state under μ\muμ belonging to LσL_\sigmaLσ​ and having coefficients uiuj‾u_i\overline{u_j}ui​uj​​ for some u∈ℓ2(I;C)u\in\ell^2(I;\mathbb C)u∈ℓ2(I;C) with ∥u∥=1\|u\|=1∥u∥=1.

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