Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 20

Open
QAlgorithms.Papers.Independent.Intakenext100.P56.discord_rank_one

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.

For α∈(0,1)∪(1,2]\alpha\in(0,1)\cup(1,2]α∈(0,1)∪(1,2] and every state ρAB\rho_{AB}ρAB​,

Dα(Aˉ;B)ρ=inf⁡∑x∣φx⟩⟨φx∣=IAIα(E;B∣X)ωφ.D_\alpha(\bar A;B)_\rho=\inf_{\sum_x|\varphi_x\rangle\langle\varphi_x|=I_A}I_\alpha(E;B|X)_{\omega^{\varphi}}.Dα​(Aˉ;B)ρ​=∑x​∣φx​⟩⟨φx​∣=IA​inf​Iα​(E;B∣X)ωφ​.

The right side uses arbitrary finite rank-one POVMs and their actual measurement dilations. The kets need not be normalized or mutually orthogonal, and zero effects can be deleted. The assertion equates infima and does not assert attainment.

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 pp.17–18, Proposition 20: equality of infima. -/
theorem discord_rank_one (a : ℝ) (ha : DPOrder a)
    (rho : Op (A × B)) (hrho : IsDensityMatrix rho) :
    renyiDiscord a rho = rankOneDiscord a rho := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P56

end
Source
Rényi squashed entanglement, discord, and relative entropy differences, arXiv:1410.1443v3, PDF p. 17, Proposition 20
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, every 0<a≤20<a\le20<a≤2 with a≠1a\ne1a=1, and every positive semidefinite trace-one matrix ρ\rhoρ on A×BA\times BA×B, the following two extended-real infima are equal:

inf⁡m>0, Mx≥0, ∑xMx=IAIa(ΩM)=inf⁡m>0, ϕx∈CA, ∑x∣ϕx⟩⟨ϕx∣=IAIa ⁣(Ω(∣ϕx⟩⟨ϕx∣)x).\inf_{m>0,\ M_x\ge0,\ \sum_xM_x=I_A}\mathcal I_a(\Omega_M) = \inf_{m>0,\ \phi_x\in\mathbb C^A,\ \sum_x|\phi_x\rangle\langle\phi_x|=I_A} \mathcal I_a\!\left(\Omega_{(|\phi_x\rangle\langle\phi_x|)_x}\right).m>0, Mx​≥0, ∑x​Mx​=IA​inf​Ia​(ΩM​)=m>0, ϕx​∈CA, ∑x​∣ϕx​⟩⟨ϕx​∣=IA​inf​Ia​(Ω(∣ϕx​⟩⟨ϕx​∣)x​​).

The vectors ϕx\phi_xϕx​ are not required to have norm 111, and zero vectors are allowed. For a family MxM_xMx​, the matrix used in these objectives has entries

ΩM((x,i),(b,y);(x′,i′),(b′,y′))={∑k,l∈A(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\in A}(\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∈A∑​(Mx​​)ik​ρ(k,b),(l,b′)​(Mx′​​)i′l​​,0,​x=y, x′=y′,otherwise.​

For ω\omegaω on H×(K×L)H\times(K\times L)H×(K×L), write

Ia(ω)=aa−1log⁡Re⁡Tr⁡P1/a ⁣(S Tr⁡H(RPa(ω)R) S),R=P(1−a)/2(ωHL)⊗IK,S=IK⊗P(a−1)/2(ωL),\mathcal I_a(\omega)=\frac{a}{a-1}\log\operatorname{Re}\operatorname{Tr} P_{1/a}\!\left(S\,\operatorname{Tr}_H(RP_a(\omega)R)\,S\right), \quad R=P_{(1-a)/2}(\omega_{HL})\otimes I_K,\quad S=I_K\otimes P_{(a-1)/2}(\omega_L),Ia​(ω)=a−1a​logReTrP1/a​(STrH​(RPa​(ω)R)S),R=P(1−a)/2​(ωHL​)⊗IK​,S=IK​⊗P(a−1)/2​(ωL​),

where RRR acts on H,LH,LH,L, subscripts denote partial traces, and Pt(X)P_t(X)Pt​(X) applies the scalar function 0↦00\mapsto00↦0, x↦xtx\mapsto x^tx↦xt for x≠0x\ne0x=0, by spectral functional calculus. Both infima embed real objectives into the extended reals and exclude zero outcomes; an empty infimum is +∞+\infty+∞. Natural logarithms and inverses retain their total real conventions at zero.

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