Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 9

Open
QAlgorithms.Papers.Independent.Intakenext100.P56.squashed_faithful

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 [BSW15a, Conjecture 34] for the actual optimized Petz conditional mutual information, including its von Neumann value at order one. For every α>1\alpha>1α>1 and state ρAB\rho_{AB}ρAB​,

Eαsq(A;B)ρ=0⟺ρAB is separable.E^{\rm sq}_\alpha(A;B)_\rho=0\quad\Longleftrightarrow\quad\rho_{AB}\text{ is separable}.Eαsq​(A;B)ρ​=0⟺ρAB​ is separable.

Separability means a finite convex mixture of product densities. The equivalence is the claimed faithfulness property, rather than only vanishing on separable inputs.

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.11, Remark 9. Faithfulness is an iff. -/
theorem squashed_faithful (hconjecture : PetzParameterConjecture) (a : ℝ) (ha : 1 < a)
    (rho : Op (A × B)) (hrho : IsDensityMatrix rho) :
    renyiSquashed a rho = 0 ↔ Entanglement.IsSeparableDensity 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. 11, Remark 9
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) assign 000 to zero eigenvalues and xtx^txt to nonzero eigenvalues. 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​)

when t>0t>0t>0, t≠1t\ne1t=1, for a density matrix on L×(R×E)L\times(R\times E)L×(R×E); the embedding inserts the identity on RRR, and the marginals are partial traces. At t=1t=1t=1, instead set I1(ω)=H(ωLE)+H(ωRE)−H(ωE)−H(ω)I_1(\omega)=H(\omega_{LE})+H(\omega_{RE})-H(\omega_E)-H(\omega)I1​(ω)=H(ωLE​)+H(ωRE​)−H(ωE​)−H(ω), where H(Z)=−Re⁡tr⁡f(Z)H(Z)=-\operatorname{Re}\operatorname{tr}f(Z)H(Z)=−Retrf(Z), f(x)=xlog⁡xf(x)=x\log xf(x)=xlogx, using continuous functional calculus and natural logarithms. Assume the global conjecture that Is(ω)≤It(ω)I_s(\omega)\le I_t(\omega)Is​(ω)≤It​(ω) for every tripartite density matrix on finite nonempty registers and every real 0<s≤t0<s\le t0<s≤t, with no upper bound on ttt. For finite register types A,BA,BA,B with decidable equality, every a>1a>1a>1, and every density matrix ρ\rhoρ on A×BA\times BA×B, define Qa(ρ)Q_a(\rho)Qa​(ρ) as one half of the extended-real infimum of Ia(ω)I_a(\omega)Ia​(ω) over all density-matrix extensions with arbitrary auxiliary dimension e+1e+1e+1, e∈Ne\in\mathbb Ne∈N. Then Qa(ρ)=0Q_a(\rho)=0Qa​(ρ)=0 if and only if ρ\rhoρ is a finite convex combination ∑j<qwj(αj⊗βj)\sum_{j<q}w_j(\alpha_j\otimes\beta_j)∑j<q​wj​(αj​⊗βj​), where wj≥0w_j\ge0wj​≥0, ∑jwj=1\sum_jw_j=1∑j​wj​=1, and every αj,βj\alpha_j,\beta_jαj​,βj​ is a density matrix. Zero weights are allowed; an empty convex combination cannot have total weight 111.

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