Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.3.1 (4.52): pinching under CP preprocessing

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.cp_preprocessing_pinching

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Tildes denote sandwiched Rényi quantities and bars denote Petz quantities. Their trace functionals are Q~α=Tr⁡(σ(1−α)/(2α)ρσ(1−α)/(2α))α\widetilde Q_\alpha=\operatorname{Tr}(\sigma^{(1-\alpha)/(2\alpha)}\rho\sigma^{(1-\alpha)/(2\alpha)})^\alphaQ​α​=Tr(σ(1−α)/(2α)ρσ(1−α)/(2α))α and Q‾α=Tr⁡(ρασ1−α)\overline Q_\alpha=\operatorname{Tr}(\rho^\alpha\sigma^{1-\alpha})Q​α​=Tr(ρασ1−α); the divergences include division by Tr⁡ρ\operatorname{Tr}\rhoTrρ inside the logarithm. Matrix powers vanish on the kernel, including power zero. The notation ρ≪σ\rho\ll\sigmaρ≪σ means support inclusion.

For CP E,F,α>0 and positive operators in the stated domain, Qtilde_α(Eρ||Fσ)≤|specσ|^α Qtilde_α(E(Pσρ)||Fσ).

Q~α(E(ρ)∥F(σ))≤∣spec⁡σ∣αQ~α(E(Pσρ)∥F(σ)).\widetilde Q_\alpha(\mathcal E(\rho)\|\mathcal F(\sigma))\le|\operatorname{spec}\sigma|^\alpha\widetilde Q_\alpha(\mathcal E(\mathcal P_\sigma\rho)\|\mathcal F(\sigma)).Q​α​(E(ρ)∥F(σ))≤∣specσ∣αQ​α​(E(Pσ​ρ)∥F(σ)).

This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
Formal statement
noncomputable section

open Filter

open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P07

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I J A B C D X Y Z : Type*}

variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]

variable [Fintype Z] [DecidableEq Z]

/-- NODE paper:1504.00233#4.generalpinching
§4.3.1 (4.52): pinching under CP preprocessing, arXiv:1504.00233v5, PDF p.62,63. -/
theorem cp_preprocessing_pinching [Nonempty I] [Nonempty J] (r s : paperMat I)
    (hr : IsDensityMatrix r) (hs : IsDensityMatrix s) (hc : paperSupported r s)
    (E F : paperMat I →ₗ[ℂ] paperMat J) (hE : QAlgorithms.Entanglement.IsCompletelyPositive E)
    (hF : QAlgorithms.Entanglement.IsCompletelyPositive F) (a : ℝ) (ha : 0 < a) :
    paperRenyiQ true (E r) (F s) a ≤ ((spectralValues s).card:ℝ)^a*paperRenyiQ true (E (paperPinch s r)) (F s) a := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 62, §4.3.1 (4.52): pinching under CP preprocessing
Read-back

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

Let I,JI,JI,J be finite, nonempty index types with decidable equality, let r,sr,sr,s be positive semidefinite complex matrices indexed by III, each of trace 111, and suppose ker⁡s⊆ker⁡r\ker s\subseteq\ker rkers⊆kerr. Let E,FE,FE,F be complex-linear maps from matrices indexed by III to matrices indexed by JJJ, each completely positive: for every natural number kkk, including zero, its amplification by the identity on a kkk-dimensional register sends every positive semidefinite block matrix to a positive semidefinite block matrix. Let a>0a>0a>0. Write M[p]M^{[p]}M[p] for functional calculus of the function equal to xpx^pxp off zero and zero at zero, even for zero or negative exponents, and define

Qa(X,Y)=Re⁡tr⁡[(Y[(1−a)/(2a)]XY[(1−a)/(2a)])[a]].Q_a(X,Y)=\operatorname{Re}\operatorname{tr} \left[\left(Y^{[(1-a)/(2a)]}XY^{[(1-a)/(2a)]}\right)^{[a]}\right].Qa​(X,Y)=Retr[(Y[(1−a)/(2a)]XY[(1−a)/(2a)])[a]].

Let Λ(s)\Lambda(s)Λ(s) be the finite set of distinct eigenvalues of sss, including zero if present, let PλP_\lambdaPλ​ be functional calculus of the indicator of {λ}\{\lambda\}{λ} applied to sss, and set Ps(r)=∑λ∈Λ(s)PλrPλ\mathcal P_s(r)=\sum_{\lambda\in\Lambda(s)}P_\lambda rP_\lambdaPs​(r)=∑λ∈Λ(s)​Pλ​rPλ​. Then

Qa(E(r),F(s))≤∣Λ(s)∣a Qa(E(Ps(r)),F(s)).Q_a(E(r),F(s)) \le |\Lambda(s)|^a\,Q_a(E(\mathcal P_s(r)),F(s)).Qa​(E(r),F(s))≤∣Λ(s)∣aQa​(E(Ps​(r)),F(s)).

Neither map is required to preserve trace, their outputs may be zero, and no upper bound on aaa is assumed.

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