Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 12

Open
QAlgorithms.Papers.Independent.Gap48.P18.fixed_marginals_entropy_continuity

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

prove2quantum

For arbitrary density states ρ\rhoρ and σ\sigmaσ, let C(ρ,σ)C(\rho,\sigma)C(ρ,σ) be all joint density states with these marginals. Then

H∣C(ρ,σ) is finite and continuous  ⟺  H(ρ)<∞ and H(σ)<∞.H\big|_{C(\rho,\sigma)}\ \text{is finite and continuous}\iff H(\rho)<\infty\ \text{and}\ H(\sigma)<\infty.H​C(ρ,σ)​ is finite and continuous⟺H(ρ)<∞ and H(σ)<∞.

The coupling set includes every entangled state with the prescribed marginals.

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

/-- Corollary 12, arXiv:quant-ph/0510073v2, PDF pp.62.
 -/
theorem fixed_marginals_entropy_continuity {I J : Type}
    [Countable I] [Countable J] [Nonempty I] [Nonempty J]
    (rho : State I) (sigma : State J) :
    FiniteContinuousOn stateEntropyNats (couplingSet rho sigma) ↔
      stateEntropyNats rho < ⊤ ∧ stateEntropyNats sigma < ⊤ := by sorry

end QAlgorithms.Papers.Independent.Gap48.P18

end
Source
Entropic characteristics of subsets of states, arXiv:quant-ph/0510073v2, PDF p. 62, Corollary 12
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, respectively. A state on any index type KKK here is a complex matrix XXX admitting a representation 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​∥<∞, whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum 111. Write T(X)T(X)T(X) for the infimum of the sums in such representations, with value +∞+\infty+∞ if there are none, and use the state topology generated by T(Y−X)<εT(Y-X)<\varepsilonT(Y−X)<ε for states 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 s=∅s=\varnothings=∅ is included, [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0) is viewed in [0,+∞][0,+\infty][0,+∞], 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ρ,σ​ consist of states WWW on I×JI\times JI×J whose coefficients satisfy

∑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 all i,i′,j,j′i,i',j,j'i,i′,j,j′, using the total infinite sum, equal to 000 for a nonsummable family. Then HHH is finite at every state of Sρ,σS_{\rho,\sigma}Sρ,σ​ and continuous on this set as an extended-nonnegative-real-valued function if and only if H(ρ)<+∞H(\rho)<+\inftyH(ρ)<+∞ and H(σ)<+∞H(\sigma)<+\inftyH(σ)<+∞.

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