Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1: CPTP contractivity

Open
QAlgorithms.Papers.Independent.Intakenext100.P42.cptp_contractivity

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

prove2quantum

All registers are finite and nonempty; all input density matrices are positive semidefinite with trace one.

Let DDD be one coherent extended-real distance family on all finite register dimensions and on positive subnormalized blocks, including zero. Assume unitary invariance on normalized states (F2), partial-trace contractivity on normalized states (F3), and invariance under adjoining a rank-one projector onto a unit vector (proof-used F5b). For any CPTP map Φ\PhiΦ and density matrices σ,ρ\sigma,\rhoσ,ρ,

D(Φ(σ)∥Φ(ρ))≤D(σ∥ρ).D(\Phi(\sigma)\Vert\Phi(\rho))\le D(\sigma\Vert\rho).D(Φ(σ)∥Φ(ρ))≤D(σ∥ρ).

No locality is required. This is deterministic contractivity under the three stated conditions.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P42
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder ENNReal Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P42

open QAlgorithms QAlgorithms.Entanglement

open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy)

open QAlgorithms.Papers.Independent.Information100.P04 (copies)

open QAlgorithms.Papers.Independent.Bridge50.P49 (groupedProduct)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Theorem 1, PDF p.9 (introduced p.8): CPTP contractivity under F2,F3,F5b only. -/
theorem cptp_contractivity (D : DistanceFamily) (h2 : UnitaryInvariantDistance D) (h3 : F3 D) (h5 : F5b D)
    {I J : Type} [Fintype I] [Fintype J] [DecidableEq I] [DecidableEq J]
    [Nonempty I] [Nonempty J] (Phi : Superop I J) (hPhi : IsChannel Phi)
    (sigma rho : Matrix I I ℂ) (hsigma : IsDensityMatrix sigma) (hrho : IsDensityMatrix rho) :
    D (Phi sigma) (Phi rho) ≤ D sigma rho := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P42

end
Source
Entanglement Measures and Purification Procedures, arXiv:quant-ph/9707035v2, PDF p. 9, Theorem 1: CPTP contractivity
Read-back

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

Let DDD assign an extended real value to every ordered pair of complex square matrices on every finite index type equipped with decidable equality. Assume that DDD is invariant under simultaneous unitary conjugation of density matrices on every nonempty such type; that for all nonempty finite types A,BA,BA,B with decidable equality and all density matrices S,RS,RS,R on A×BA\times BA×B,

D(Tr⁡AS,Tr⁡AR)≤D(S,R),(Tr⁡AZ)b,b′=∑aZ(a,b),(a,b′);D(\operatorname{Tr}_A S,\operatorname{Tr}_A R)\le D(S,R), \qquad (\operatorname{Tr}_A Z)_{b,b'}=\sum_a Z_{(a,b),(a,b')};D(TrA​S,TrA​R)≤D(S,R),(TrA​Z)b,b′​=a∑​Z(a,b),(a,b′)​;

and that for every pair of density matrices S,RS,RS,R on a nonempty finite type and every unit vector α\alphaα on any nonempty finite ancillary type with decidable equality,

D(S⊗αα†,R⊗αα†)=D(S,R),D(S\otimes\alpha\alpha^\dagger,R\otimes\alpha\alpha^\dagger)=D(S,R),D(S⊗αα†,R⊗αα†)=D(S,R),

where (αα†)a,b=αaαb‾(\alpha\alpha^\dagger)_{a,b}=\alpha_a\overline{\alpha_b}(αα†)a,b​=αa​αb​​. Then, for any nonempty finite types I,JI,JI,J with decidable equality, any map Φ\PhiΦ from complex matrices on III to those on JJJ admitting a finite representation

Φ(X)=∑ℓ=0r−1EℓXEℓ†,∑ℓ=0r−1Eℓ†Eℓ=I,\Phi(X)=\sum_{\ell=0}^{r-1}E_\ell X E_\ell^\dagger, \qquad \sum_{\ell=0}^{r-1}E_\ell^\dagger E_\ell=I,Φ(X)=ℓ=0∑r−1​Eℓ​XEℓ†​,ℓ=0∑r−1​Eℓ†​Eℓ​=I,

and any density matrices σ,ρ\sigma,\rhoσ,ρ on III, one has D(Φ(σ),Φ(ρ))≤D(σ,ρ)D(\Phi(\sigma),\Phi(\rho))\le D(\sigma,\rho)D(Φ(σ),Φ(ρ))≤D(σ,ρ). Throughout, a density matrix means a positive semidefinite matrix whose complex trace is 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