Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Consequence 3

Open
QAlgorithms.Papers.Independent.Intakenext100.P56.squashed_local_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, namely first-register local monotonicity of the optimized Petz conditional mutual information (3.18), uniformly for every finite tripartite state and CPTP map. Let α∈(0,1)∪(1,2]\alpha\in(0,1)\cup(1,2]α∈(0,1)∪(1,2], let ρAB\rho_{AB}ρAB​ be a state, and let N:A→A′\mathcal N:A\to A'N:A→A′ and M:B→B′\mathcal M:B\to B'M:B→B′ be CPTP maps. With σ=(N⊗M)(ρ)\sigma=(\mathcal N\otimes\mathcal M)(\rho)σ=(N⊗M)(ρ),

Eαsq(A′;B′)σ≤Eαsq(A;B)ρ.E^{\rm sq}_\alpha(A';B')_\sigma\le E^{\rm sq}_\alpha(A;B)_\rho.Eαsq​(A′;B′)σ​≤Eαsq​(A;B)ρ​.

Here EαsqE^{\rm sq}_\alphaEαsq​ is one half the infimum of (3.18) over all finite normalized extensions, without any ancillary dimension cap. This establishes monotonicity under local operations.

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.8, Consequence 3, (4.2). -/
theorem squashed_local_monotone (hconjecture : LocalMonotonicityConjecture)
    (a : ℝ) (ha : DPOrder a) (rho : Op (A × B)) (hrho : IsDensityMatrix rho)
    (N : Superop A C) (M : Superop B D) (hN : IsChannel N) (hM : IsChannel M) :
    renyiSquashed a (idTensorSuperop M (applyFirstSuperop N rho)) ≤ renyiSquashed 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. 8, Consequence 3
Read-back

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

Let A,B,C,DA,B,C,DA,B,C,D be finite register index types with decidable equality, let ρ\rhoρ be a positive semidefinite matrix of trace 111 on A×BA\times BA×B, and let NNN and MMM be channels from AAA to CCC and from BBB to DDD, respectively; a channel here has a finite Kraus representation X↦∑jEjXEj†X\mapsto\sum_j E_jXE_j^\daggerX↦∑j​Ej​XEj†​ with ∑jEj†Ej=I\sum_jE_j^\dagger E_j=I∑j​Ej†​Ej​=I. For a matrix XXX, write Pt(X)P_t(X)Pt​(X) for continuous functional calculus with the real function that is 000 at 000 and xtx^txt elsewhere, so P0(X)P_0(X)P0​(X) is the support projector when XXX is positive semidefinite. For t>0t>0t>0, t≠1t\ne1t=1, and a state ω\omegaω on L×(R×E)L\times(R\times E)L×(R×E), define

It(ω)=tt−1log⁡Re⁡tr⁡P1/t ⁣(S Tr⁡L ⁣(R0Pt(ω)R0)S),R0=embed⁡LE ⁣(P(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\!\left(R_0P_t(\omega)R_0\right)S\right), \quad R_0=\operatorname{embed}_{LE}\!\left(P_{(1-t)/2}(\omega_{LE})\right), \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​),

where ωLE=Tr⁡Rω\omega_{LE}=\operatorname{Tr}_R\omegaωLE​=TrR​ω, ωE=Tr⁡RTr⁡Lω\omega_E=\operatorname{Tr}_R\operatorname{Tr}_L\omegaωE​=TrR​TrL​ω, and embed⁡LE(Z)(l,r,e),(l′,r′,e′)=δr,r′Z(l,e),(l′,e′)\operatorname{embed}_{LE}(Z)_{(l,r,e),(l',r',e')}=\delta_{r,r'}Z_{(l,e),(l',e')}embedLE​(Z)(l,r,e),(l′,r′,e′)​=δr,r′​Z(l,e),(l′,e′)​. Set

Qt(τ)=12inf⁡{It(ω):e∈N, ω is a density matrix on L×(R×{0,…,e}), Tr⁡Eω=τ},Q_t(\tau)=\frac12\inf\{I_t(\omega):e\in\mathbb N,\ \omega\text{ is a density matrix on }L\times(R\times\{0,\ldots,e\}),\ \operatorname{Tr}_E\omega=\tau\},Qt​(τ)=21​inf{It​(ω):e∈N, ω is a density matrix on L×(R×{0,…,e}), TrE​ω=τ},

with the infimum taken in the extended real numbers. Assume the global conjecture that, for every choice of finite nonempty registers, every 0<t≤20<t\le20<t≤2 with t≠1t\ne1t=1, every tripartite density matrix, and every channel on its first register, ItI_tIt​ cannot increase under that channel. Then, for every real aaa satisfying 0<a≤20<a\le20<a≤2 and a≠1a\ne1a=1,

Qa ⁣((N⊗M)(ρ))≤Qa(ρ).Q_a\!\left((N\otimes M)(\rho)\right)\le Q_a(\rho).Qa​((N⊗M)(ρ))≤Qa​(ρ).

Here a map acting on one register acts on each matrix block indexed by the other register; all logarithms are natural, and the extension dimension e+1e+1e+1 has no fixed upper bound.

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