Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 22

Open
QAlgorithms.Papers.Independent.Intakenext100.P56.maximally_entangled_discord

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All systems are finite-dimensional complex Hilbert spaces with nonempty finite bases. States are positive semidefinite operators of trace one; pure kets have norm one. All marginal states below are partial traces of the stated joint state. Logarithms are natural, and spectral powers vanish on the kernel, including at exponent zero.

Let ∣Φ⟩=d−1/2∑i=1d∣ui⟩A∣vi⟩B|\Phi\rangle=d^{-1/2}\sum_{i=1}^d|u_i\rangle_A|v_i\rangle_B∣Φ⟩=d−1/2∑i=1d​∣ui​⟩A​∣vi​⟩B​, where d=dim⁡A≥1d=\dim A\ge1d=dimA≥1 and both Schmidt families are orthonormal. For α∈(0,1)∪(1,2]\alpha\in(0,1)\cup(1,2]α∈(0,1)∪(1,2],

Dα(Aˉ;B)Φ=log⁡dim⁡A.D_\alpha(\bar A;B)_\Phi=\log\dim A.Dα​(Aˉ;B)Φ​=logdimA.

An unused orthogonal complement in BBB is allowed. The optimization still ranges over arbitrary rank-one POVMs; the proof's equal-probability sentence is not used to restrict them.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P56
Formal statement
noncomputable section

open Filter Topology

open scoped Matrix ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakenext100.P56

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms

open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw entropy average holevo)

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)

open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint petz extendedLog marginalAB)

open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)

open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)

open QAlgorithms.Papers.Independent.Dependency50.P07 (bipartiteProduct)

open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity)

open QAlgorithms.Papers.Independent.Advance50.P25 (renyiEntropyNats)

variable {A B C D E X : Type}

variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype E] [Fintype X]

variable [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] [Nonempty E] [Nonempty X]

open scoped Matrix.Norms.L2Operator

/-- arXiv:1410.1443v3, PDF p.21, Corollary 22, (5.40).
Schmidt rank equals |A|; B may contain an unused orthogonal complement. -/
theorem maximally_entangled_discord (a : ℝ) (ha : DPOrder a)
    (d : ℕ) (hd : 0 < d) (hdA : d = Fintype.card A)
    (U : Matrix A (Fin d) ℂ) (V : Matrix B (Fin d) ℂ)
    (hU : Uᴴ * U = 1) (hV : Vᴴ * V = 1) :
    renyiDiscord a (pureDensity (maxEntangledKet d U V)) =
      (Real.log (Fintype.card A) : EReal) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P56

end
Source
Rényi squashed entanglement, discord, and relative entropy differences, arXiv:1410.1443v3, PDF p. 21, Corollary 22
Read-back

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

For finite register types A,BA,BA,B, with decidable equality, let 0<a≤20<a\le20<a≤2, a≠1a\ne1a=1, let ddd be a positive integer equal to ∣A∣|A|∣A∣, and let U:Cd→CAU:\mathbb C^d\to\mathbb C^AU:Cd→CA and V:Cd→CBV:\mathbb C^d\to\mathbb C^BV:Cd→CB be matrices satisfying U†U=IdU^\dagger U=I_dU†U=Id​ and V†V=IdV^\dagger V=I_dV†V=Id​. Define

ψ(i,b)=1d∑k<dUikVbk,ρ(i,b),(j,c)=ψ(i,b)ψ(j,c)‾.\psi(i,b)=\frac1{\sqrt d}\sum_{k<d}U_{ik}V_{bk}, \qquad \rho_{(i,b),(j,c)}=\psi(i,b)\overline{\psi(j,c)}.ψ(i,b)=d​1​k<d∑​Uik​Vbk​,ρ(i,b),(j,c)​=ψ(i,b)ψ(j,c)​.

Then Da(ρ)=log⁡∣A∣\mathcal D_a(\rho)=\log|A|Da​(ρ)=log∣A∣, with the right-hand side embedded into the extended reals, where Da\mathcal D_aDa​ is defined as follows. For every positive integer mmm and positive semidefinite family MxM_xMx​ on AAA summing to IAI_AIA​, form

ΩM((x,i),(b,y);(x′,i′),(b′,y′))={∑k,l(Mx)ikρ(k,b),(l,b′)(Mx′)i′l‾,x=y, x′=y′,0,otherwise.\Omega_M((x,i),(b,y);(x',i'),(b',y'))= \begin{cases} \displaystyle\sum_{k,l}(\sqrt{M_x})_{ik}\rho_{(k,b),(l,b')} \overline{(\sqrt{M_{x'}})_{i'l}},&x=y,\ x'=y',\\ 0,&\text{otherwise}. \end{cases}ΩM​((x,i),(b,y);(x′,i′),(b′,y′))=⎩⎨⎧​k,l∑​(Mx​​)ik​ρ(k,b),(l,b′)​(Mx′​​)i′l​​,0,​x=y, x′=y′,otherwise.​

Its objective, viewing its registers as H×(K×L)H\times(K\times L)H×(K×L) with H={0,…,m−1}×AH=\{0,\ldots,m-1\}\times AH={0,…,m−1}×A, K=BK=BK=B, L={0,…,m−1}L=\{0,\ldots,m-1\}L={0,…,m−1}, is

aa−1log⁡Re⁡Tr⁡P1/a ⁣(S Tr⁡H(RPa(ΩM)R) S),R=P(1−a)/2((ΩM)HL)⊗IK,S=IK⊗P(a−1)/2((ΩM)L),\frac{a}{a-1}\log\operatorname{Re}\operatorname{Tr} P_{1/a}\!\left(S\,\operatorname{Tr}_H(RP_a(\Omega_M)R)\,S\right), \quad R=P_{(1-a)/2}((\Omega_M)_{HL})\otimes I_K,\quad S=I_K\otimes P_{(a-1)/2}((\Omega_M)_L),a−1a​logReTrP1/a​(STrH​(RPa​(ΩM​)R)S),R=P(1−a)/2​((ΩM​)HL​)⊗IK​,S=IK​⊗P(a−1)/2​((ΩM​)L​),

where RRR acts on H,LH,LH,L, and PtP_tPt​ is spectral functional calculus with value 000 at a zero eigenvalue and xtx^txt otherwise. The quantity Da\mathcal D_aDa​ is the extended-real infimum of these objectives. The hypotheses include d=1d=1d=1, in which case the asserted value is 000; they do not require VVV to be surjective.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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