Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Consequence 4

Open
QAlgorithms.Papers.Independent.Intakenext100.P56.squashed_classical_communication

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.

Assume Conjecture 1 as stated above. For α∈(0,1)∪(1,2]\alpha\in(0,1)\cup(1,2]α∈(0,1)∪(1,2], a finite probability law pxp_xpx​, and bipartite states ρABx\rho^x_{AB}ρABx​, define ρXAXBAB=∑xpx∣x⟩⟨x∣XA⊗∣x⟩⟨x∣XB⊗ρABx\rho_{X_AX_BAB}=\sum_xp_x|x\rangle\langle x|_{X_A}\otimes|x\rangle\langle x|_{X_B}\otimes\rho^x_{AB}ρXA​XB​AB​=∑x​px​∣x⟩⟨x∣XA​​⊗∣x⟩⟨x∣XB​​⊗ρABx​. Then

Eαsq(AXA;B)ρ=Eαsq(AXA;BXB)ρ=Eαsq(A;BXB)ρ.E^{\rm sq}_\alpha(AX_A;B)_\rho=E^{\rm sq}_\alpha(AX_A;BX_B)_\rho=E^{\rm sq}_\alpha(A;BX_B)_\rho.Eαsq​(AXA​;B)ρ​=Eαsq​(AXA​;BXB​)ρ​=Eαsq​(A;BXB​)ρ​.

The first and last expressions use the corresponding marginals. The infimum defining squashed entanglement still ranges over all extensions. The equality describes invariance under sharing classical information.

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.8–9, Consequence 4, (4.3)–(4.4). -/
theorem squashed_classical_communication (hconjecture : LocalMonotonicityConjecture)
    (a : ℝ) (ha : DPOrder a) (p : X → ℝ) (hp : IsLaw p)
    (rho : X → Op (A × B)) (hrho : ∀ x, IsDensityMatrix (rho x)) :
    renyiSquashed a (flagLeft p rho) = renyiSquashed a (flagBoth p rho) ∧
    renyiSquashed a (flagBoth p rho) = renyiSquashed a (flagRight p 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. 8, Consequence 4
Read-back

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

Let A,B,XA,B,XA,B,X be finite register index types with decidable equality, let p:X→Rp:X\to\mathbb Rp:X→R satisfy px≥0p_x\ge0px​≥0 and ∑xpx=1\sum_xp_x=1∑x​px​=1, and let every ρx\rho_xρx​ be a positive semidefinite trace-111 matrix on A×BA\times BA×B. Define three matrices by

(ρL)((u,x),v),((u′,y),v′)=δx,ypx(ρx)(u,v),(u′,v′),(ρR)(u,(v,x)),(u′,(v′,y))=δx,ypx(ρx)(u,v),(u′,v′),(\rho^{L})_{((u,x),v),((u',y),v')}=\delta_{x,y}p_x(\rho_x)_{(u,v),(u',v')},\qquad (\rho^{R})_{(u,(v,x)),(u',(v',y))}=\delta_{x,y}p_x(\rho_x)_{(u,v),(u',v')},(ρL)((u,x),v),((u′,y),v′)​=δx,y​px​(ρx​)(u,v),(u′,v′)​,(ρR)(u,(v,x)),(u′,(v′,y))​=δx,y​px​(ρx​)(u,v),(u′,v′)​,

and let (ρLR)((u,x),(v,y)),((u′,x′),(v′,y′))(\rho^{LR})_{((u,x),(v,y)),((u',x'),(v',y'))}(ρLR)((u,x),(v,y)),((u′,x′),(v′,y′))​ equal px(ρx)(u,v),(u′,v′)p_x(\rho_x)_{(u,v),(u',v')}px​(ρx​)(u,v),(u′,v′)​ when x=y=x′=y′x=y=x'=y'x=y=x′=y′, and 000 otherwise. For positive semidefinite ZZZ, let Pt(Z)P_t(Z)Pt​(Z) be its spectral power with every zero eigenvalue assigned 000, including at t=0t=0t=0. For t>0t>0t>0, t≠1t\ne1t=1, define

It(ω)=tt−1log⁡Re⁡tr⁡P1/t ⁣(S Tr⁡L(R0Pt(ω)R0)S),R0=embed⁡LEP(1−t)/2(ωLE),S=IR⊗P(t−1)/2(ωE),I_t(\omega)=\frac{t}{t-1}\log\operatorname{Re}\operatorname{tr} P_{1/t}\!\left(S\,\operatorname{Tr}_L(R_0P_t(\omega)R_0)S\right), \quad R_0=\operatorname{embed}_{LE}P_{(1-t)/2}(\omega_{LE}),\quad S=I_R\otimes P_{(t-1)/2}(\omega_E),It​(ω)=t−1t​logRetrP1/t​(STrL​(R0​Pt​(ω)R0​)S),R0​=embedLE​P(1−t)/2​(ωLE​),S=IR​⊗P(t−1)/2​(ωE​),

for ω\omegaω on L×(R×E)L\times(R\times E)L×(R×E), where the marginals are obtained by partial traces and the embedding acts as the identity on RRR; define Qt(τ)Q_t(\tau)Qt​(τ) as one half of the extended-real infimum of It(ω)I_t(\omega)It​(ω) over all density-matrix extensions of τ\tauτ with auxiliary register {0,…,e}\{0,\ldots,e\}{0,…,e}, for arbitrary e∈Ne\in\mathbb Ne∈N. Assume the global conjecture that ItI_tIt​ decreases under every channel on the first register of every tripartite density matrix on finite nonempty registers whenever 0<t≤20<t\le20<t≤2 and t≠1t\ne1t=1, where channels admit finite Kraus operators satisfying ∑jEj†Ej=I\sum_jE_j^\dagger E_j=I∑j​Ej†​Ej​=I. Then every real aaa with 0<a≤20<a\le20<a≤2, a≠1a\ne1a=1, satisfies

Qa(ρL)=Qa(ρLR)andQa(ρLR)=Qa(ρR).Q_a(\rho^{L})=Q_a(\rho^{LR})\quad\text{and}\quad Q_a(\rho^{LR})=Q_a(\rho^{R}).Qa​(ρL)=Qa​(ρLR)andQa​(ρLR)=Qa​(ρR).

Zero probabilities are allowed, but ρx\rho_xρx​ must be a density matrix even when px=0p_x=0px​=0; logarithms are natural.

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