Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 14

Open
QAlgorithms.Papers.Independent.Intakenext100.P56.maximally_entangled_squashed

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≥1d\ge1d≥1, let {∣ui⟩}i=1d\{|u_i\rangle\}_{i=1}^d{∣ui​⟩}i=1d​ and {∣vi⟩}i=1d\{|v_i\rangle\}_{i=1}^d{∣vi​⟩}i=1d​ be arbitrary orthonormal families, and let ∣Φ⟩=d−1/2∑i∣ui⟩∣vi⟩|\Phi\rangle=d^{-1/2}\sum_i|u_i\rangle|v_i\rangle∣Φ⟩=d−1/2∑i​∣ui​⟩∣vi​⟩. For α∈(0,1)∪(1,2]\alpha\in(0,1)\cup(1,2]α∈(0,1)∪(1,2],

Eαsq(A;B)Φ=log⁡d.E^{\rm sq}_\alpha(A;B)_\Phi=\log d.Eαsq​(A;B)Φ​=logd.

The Schmidt rank ddd may be smaller than either ambient dimension. In particular d=1d=1d=1 gives zero. The equality fixes normalization in nats.

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.13, Corollary 14, (4.53).
Arbitrary orthonormal Schmidt families; d=1 is included. -/
theorem maximally_entangled_squashed (a : ℝ) (ha : DPOrder a)
    (d : ℕ) (hd : 0 < d) (U : Matrix A (Fin d) ℂ) (V : Matrix B (Fin d) ℂ)
    (hU : Uᴴ * U = 1) (hV : Vᴴ * V = 1) :
    renyiSquashed a (pureDensity (maxEntangledKet d U V)) = (Real.log d : 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. 13, Corollary 14
Read-back

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

Let A,BA,BA,B be finite register index types with decidable equality, let 0<a≤20<a\le20<a≤2, a≠1a\ne1a=1, let d∈Nd\in\mathbb Nd∈N satisfy d>0d>0d>0, and let U∈CA×{0,…,d−1}U\in\mathbb C^{A\times\{0,\ldots,d-1\}}U∈CA×{0,…,d−1} and V∈CB×{0,…,d−1}V\in\mathbb C^{B\times\{0,\ldots,d-1\}}V∈CB×{0,…,d−1} satisfy U†U=IdU^\dagger U=I_dU†U=Id​ and V†V=IdV^\dagger V=I_dV†V=Id​. Define

ψu,v=1d∑j=0d−1Uu,jVv,j,ρ(u,v),(u′,v′)=ψu,vψu′,v′‾.\psi_{u,v}=\frac1{\sqrt d}\sum_{j=0}^{d-1}U_{u,j}V_{v,j}, \qquad \rho_{(u,v),(u',v')}=\psi_{u,v}\overline{\psi_{u',v'}}.ψu,v​=d​1​j=0∑d−1​Uu,j​Vv,j​,ρ(u,v),(u′,v′)​=ψu,v​ψu′,v′​​.

For positive semidefinite ZZZ, let Pt(Z)P_t(Z)Pt​(Z) apply xtx^txt to nonzero eigenvalues and assign 000 to zero eigenvalues, including at t=0t=0t=0. For a density-matrix extension ω\omegaω on A×(B×E)A\times(B\times E)A×(B×E), define

Ia(ω)=aa−1log⁡Re⁡tr⁡P1/a ⁣(S Tr⁡A(R0Pa(ω)R0)S),R0=embed⁡AEP(1−a)/2(ωAE),S=IB⊗P(a−1)/2(ωE),I_a(\omega)=\frac{a}{a-1}\log\operatorname{Re}\operatorname{tr} P_{1/a}\!\left(S\,\operatorname{Tr}_A(R_0P_a(\omega)R_0)S\right), \quad R_0=\operatorname{embed}_{AE}P_{(1-a)/2}(\omega_{AE}),\quad S=I_B\otimes P_{(a-1)/2}(\omega_E),Ia​(ω)=a−1a​logRetrP1/a​(STrA​(R0​Pa​(ω)R0​)S),R0​=embedAE​P(1−a)/2​(ωAE​),S=IB​⊗P(a−1)/2​(ωE​),

where marginals are partial traces and the embedding inserts the identity on BBB. Then one half of the extended-real infimum of Ia(ω)I_a(\omega)Ia​(ω), over all positive semidefinite trace-111 extensions with Tr⁡Eω=ρ\operatorname{Tr}_E\omega=\rhoTrE​ω=ρ and arbitrary auxiliary dimension e+1e+1e+1, e∈Ne\in\mathbb Ne∈N, equals the embedded real number log⁡d\log dlogd. The case d=1d=1d=1 is included and gives 000; no complex conjugation appears on Vv,jV_{v,j}Vv,j​ in the definition of ψ\psiψ.

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