Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.4: coupling compactness and attained entropy supremum

Open
QAlgorithms.Papers.Independent.Gap48.P18.fixed_marginal_compactness_and_entropy_maximum

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

prove2quantum

For density states ρ,σ\rho,\sigmaρ,σ on arbitrary nonzero separable Hilbert spaces, the full coupling set C(ρ,σ)C(\rho,\sigma)C(ρ,σ) is compact and convex. Including infinite entropies,

sup⁡ω∈C(ρ,σ)H(ω)=H(ρ)+H(σ),\sup_{\omega\in C(\rho,\sigma)}H(\omega)=H(\rho)+H(\sigma),ω∈C(ρ,σ)sup​H(ω)=H(ρ)+H(σ),

and the product state ρ⊗σ\rho\otimes\sigmaρ⊗σ attains this supremum. This identifies an actual maximizing state, rather than only a numerical 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

/-- §5.4: coupling compactness and attained entropy supremum, arXiv:quant-ph/0510073v2, PDF pp.62.
 -/
theorem fixed_marginal_compactness_and_entropy_maximum {I J : Type}
    [Countable I] [Countable J] [Nonempty I] [Nonempty J]
    (rho : State I) (sigma : State J) :
    IsCompact (couplingSet rho sigma) ∧ CoefficientConvexStates (couplingSet rho sigma) ∧
      entropySup (couplingSet rho sigma) = stateEntropyNats rho + stateEntropyNats sigma ∧
      ∃ tau ∈ couplingSet rho sigma,
        tau.coefficients = productCoeff rho.coefficients sigma.coefficients ∧
        stateEntropyNats tau = entropySup (couplingSet rho sigma) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

end
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 62, §5.4: coupling compactness and attained entropy supremum
Read-back

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

Let I,JI,JI,J be countable, nonempty types, and let ρ,σ\rho,\sigmaρ,σ be states on I,JI,JI,J. A state on any index type KKK here is a complex matrix XXX admitting Xij=∑rar(i)br(j)‾X_{ij}=\sum_r a_r(i)\overline{b_r(j)}Xij​=∑r​ar​(i)br​(j)​, with ar,br∈ℓ2(K;C)a_r,b_r\in\ell^2(K;\mathbb C)ar​,br​∈ℓ2(K;C) and ∑r∥ar∥∥br∥<∞\sum_r\|a_r\|\|b_r\|<\infty∑r​∥ar​∥∥br​∥<∞, such that every finite quadratic form is real and nonnegative and the real diagonal is summable with sum 111. Let T(X)T(X)T(X) be the infimum of such representation sums, with empty infimum +∞+\infty+∞, and use the state topology generated by T(Y−X)<εT(Y-X)<\varepsilonT(Y−X)<ε for state centers XXX and ε>0\varepsilon>0ε>0. Define

H(X)=sup⁡s⊆Ks finite[rslog⁡rs−Re⁡tr⁡(Xslog⁡Xs)]+,rs=Re⁡tr⁡Xs,H(X)=\sup_{\substack{s\subseteq K\\s\text{ finite}}} \left[ r_s\log r_s-\operatorname{Re}\operatorname{tr}(X_s\log X_s) \right]_+,\qquad r_s=\operatorname{Re}\operatorname{tr}X_s,H(X)=s⊆Ks finite​sup​[rs​logrs​−Retr(Xs​logXs​)]+​,rs​=RetrXs​,

where the empty principal submatrix is included, [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0) is extended nonnegative, and matrix logarithms use continuous functional calculus of the total natural logarithm, with log⁡0=0\log0=0log0=0. Let Sρ,σS_{\rho,\sigma}Sρ,σ​ be the states WWW on I×JI\times JI×J satisfying

∑r∈J′W(i,r),(i′,r)=ρii′,∑r∈I′W(r,j),(r,j′)=σjj′\sum_{r\in J}'W_{(i,r),(i',r)}=\rho_{ii'},\qquad \sum_{r\in I}'W_{(r,j),(r,j')}=\sigma_{jj'}r∈J∑′​W(i,r),(i′,r)​=ρii′​,r∈I∑′​W(r,j),(r,j′)​=σjj′​

for every i,i′,j,j′i,i',j,j'i,i′,j,j′, with total infinite sums returning 000 when nonsummable. Then Sρ,σS_{\rho,\sigma}Sρ,σ​ is compact, its coefficient matrices form a convex set over R\mathbb RR, and

sup⁡W∈Sρ,σH(W)=H(ρ)+H(σ).\sup_{W\in S_{\rho,\sigma}}H(W)=H(\rho)+H(\sigma).W∈Sρ,σ​sup​H(W)=H(ρ)+H(σ).

Moreover, there exists τ∈Sρ,σ\tau\in S_{\rho,\sigma}τ∈Sρ,σ​ such that τ(i,j),(i′,j′)=ρii′σjj′\tau_{(i,j),(i',j')}=\rho_{ii'}\sigma_{jj'}τ(i,j),(i′,j′)​=ρii′​σjj′​ for all indices and H(τ)=sup⁡W∈Sρ,σH(W)H(\tau)=\sup_{W\in S_{\rho,\sigma}}H(W)H(τ)=supW∈Sρ,σ​​H(W). All entropy values and the sum are in [0,+∞][0,+\infty][0,+∞]; no finiteness hypothesis is imposed, so this attained value may be +∞+\infty+∞.

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