Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Consequence 7

Open
QAlgorithms.Papers.Independent.Intakenext100.P56.squashed_entanglement_monotone

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 and let 0<α<10<\alpha<10<α<1. Then EαsqE^{\rm sq}_\alphaEαsq​ is both monotone under every finite adaptive LOCC protocol and convex over every normalized finite ensemble:

Eαsq(L(ρ))≤Eαsq(ρ),Eαsq ⁣(∑xpxρx)≤∑xpxEαsq(ρx).E^{\rm sq}_\alpha(\mathcal L(\rho))\le E^{\rm sq}_\alpha(\rho),\qquad E^{\rm sq}_\alpha\!\left(\sum_xp_x\rho^x\right)\le\sum_xp_xE^{\rm sq}_\alpha(\rho^x).Eαsq​(L(ρ))≤Eαsq​(ρ),Eαsq​(x∑​px​ρx)≤x∑​px​Eαsq​(ρx).

These two properties are exactly the paper's definition of an entanglement monotone.

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,10, Consequence 7: both defining properties. -/
theorem squashed_entanglement_monotone (hconjecture : LocalMonotonicityConjecture)
    (a : ℝ) (ha0 : 0 < a) (ha1 : a < 1) :
    SquashedLOCC a ∧ SquashedConvex a := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P56

end
Source
Rényi squashed entanglement, discord, and relative entropy differences, arXiv:1410.1443v3, PDF p. 10, Consequence 7
Read-back

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

For positive semidefinite ZZZ, let Pt(Z)P_t(Z)Pt​(Z) denote its spectral power with zero eigenvalues assigned 000, also at t=0t=0t=0. Define, for t>0t>0t>0, t≠1t\ne1t=1,

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 a tripartite density matrix on L×(R×E)L\times(R\times E)L×(R×E), with the indicated partial-trace marginals and identity embedding on RRR. Let Qt(τ)Q_t(\tau)Qt​(τ) be one half of the extended-real infimum of It(ω)I_t(\omega)It​(ω) over density-matrix extensions of τ\tauτ with arbitrary positive finite auxiliary dimension e+1e+1e+1. Assume the global conjecture that, on every finite nonempty collection of registers, ItI_tIt​ decreases under every channel on its first register whenever 0<t≤20<t\le20<t≤2, t≠1t\ne1t=1, where channels have finite Kraus representations satisfying ∑jEj†Ej=I\sum_jE_j^\dagger E_j=I∑j​Ej†​Ej​=I. For every 0<a<10<a<10<a<1, both of the following hold: for every k,l,m,n∈Nk,l,m,n\in\mathbb Nk,l,m,n∈N, every density matrix ρ\rhoρ on registers of dimensions k+1,l+1k+1,l+1k+1,l+1, and every finite recursive local protocol Φ\PhiΦ to dimensions m+1,n+1m+1,n+1m+1,n+1, Qa(Φ(ρ))≤Qa(ρ)Q_a(\Phi(\rho))\le Q_a(\rho)Qa​(Φ(ρ))≤Qa​(ρ); and, for every finite nonempty A,B,XA,B,XA,B,X, probability weights pxp_xpx​, and density matrices ρx\rho_xρx​ on A×BA\times BA×B, Qa(∑xpxρx)≤∑xpxQa(ρx)Q_a(\sum_xp_x\rho_x)\le\sum_xp_xQ_a(\rho_x)Qa​(∑x​px​ρx​)≤∑x​px​Qa​(ρx​). A finite recursive local protocol is built from identities by local finite Kraus families on either party, satisfying completeness, with outcome-dependent recursive continuations and summation of branches. Zero ensemble weights are allowed, all component states remain required to be density matrices, and 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