Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 19

Open
QAlgorithms.Papers.Independent.Intakenext100.P56.discord_local_unitaries

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\alpha>0α>0, α≠1\alpha\ne1α=1, any state ρAB\rho_{AB}ρAB​ and arbitrary local unitary operators UA,VBU_A,V_BUA​,VB​,

Dα(Aˉ;B)(UA⊗VB)ρ(UA⊗VB)†=Dα(Aˉ;B)ρ.D_\alpha(\bar A;B)_{(U_A\otimes V_B)\rho(U_A\otimes V_B)^\dagger}=D_\alpha(\bar A;B)_\rho.Dα​(Aˉ;B)(UA​⊗VB​)ρ(UA​⊗VB​)†​=Dα​(Aˉ;B)ρ​.

The full printed order range uses the same defining measurement infimum. This unconditional equality expresses invariance under local changes of orthonormal coordinates.

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.17, Proposition 19; full printed order range. -/
theorem discord_local_unitaries (a : ℝ) (ha : RenyiOrder a)
    (rho : Op (A × B)) (hrho : IsDensityMatrix rho)
    (U : Matrix.unitaryGroup A ℂ) (V : Matrix.unitaryGroup B ℂ) :
    renyiDiscord a (let W := Matrix.kronecker (U : Op A) (V : Op B); W * rho * Wᴴ) =
      renyiDiscord 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 19
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 a>0a>0a>0 with a≠1a\ne1a=1, every positive semidefinite trace-one matrix ρ\rhoρ on A×BA\times BA×B, and every pair of unitary matrices UUU on AAA and VVV on BBB, an extended-real quantity Da\mathcal D_aDa​ defined below satisfies

Da((U⊗V)ρ(U⊗V)†)=Da(ρ).\mathcal D_a\bigl((U\otimes V)\rho(U\otimes V)^\dagger\bigr)=\mathcal D_a(\rho).Da​((U⊗V)ρ(U⊗V)†)=Da​(ρ).

For any input η\etaη on A×BA\times BA×B, Da(η)\mathcal D_a(\eta)Da​(η) is the infimum over all positive integers mmm and positive semidefinite matrices MxM_xMx​ on AAA, x<mx<mx<m, satisfying ∑xMx=IA\sum_xM_x=I_A∑x​Mx​=IA​, of Ia(ΩM(η))\mathcal I_a(\Omega_M(\eta))Ia​(ΩM​(η)), embedded into the extended reals, where

Ω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(\eta)((x,i),(b,y);(x',i'),(b',y'))= \begin{cases} \displaystyle\sum_{k,l\in A}(\sqrt{M_x})_{ik}\eta_{(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), the objective is

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​),

with RRR acting on H,LH,LH,L. Here PtP_tPt​ applies the scalar function that is 000 at 000 and xtx^txt elsewhere by spectral functional calculus. Measurement effects may be zero, m=0m=0m=0 is excluded, and there is no restriction a≤2a\le2a≤2. All logarithms are natural and use the total real convention 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