Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary to Theorem 1: pinching

Open
QAlgorithms.Papers.Independent.Intakenext100.P42.pinching_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 satisfy F2, F3, unit-vector F5b, and block additivity F5a on the positive subnormalized domain. Let PiP_iPi​ be a finite complete family of pairwise orthogonal Hermitian projectors, and let σ,ρ\sigma,\rhoσ,ρ be density matrices. Then

∑iD(PiσPi∥PiρPi)≤D(σ∥ρ).\sum_iD(P_i\sigma P_i\Vert P_i\rho P_i)\le D(\sigma\Vert\rho).i∑​D(Pi​σPi​∥Pi​ρPi​)≤D(σ∥ρ).

This is the summed-block consequence of pinching contractivity, including zero blocks.

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

/-- Corollary, PDF p.10, Eq.(15): the right-hand projectors occur in BOTH blocks. -/
theorem pinching_contractivity (D : DistanceFamily) (h2 : UnitaryInvariantDistance D) (h3 : F3 D)
    (h5a : F5a D) (h5b : F5b D)
    {I K : Type} [Fintype I] [Fintype K] [DecidableEq I] [Nonempty I]
    (P : K → Matrix I I ℂ) (hP : CompleteProjectors P)
    (sigma rho : Matrix I I ℂ) (hsigma : IsDensityMatrix sigma) (hrho : IsDensityMatrix rho) :
    (∑ k, D (P k * sigma * P k) (P k * rho * P k)) ≤ D sigma rho := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P42

end
Source
Entanglement Measures and Purification Procedures, arXiv:quant-ph/9707035v2, PDF p. 10, Corollary to Theorem 1: pinching
Read-back

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

Let DDD be an extended real valued family on pairs of complex square matrices on finite types with decidable equality. Assume simultaneous unitary conjugation leaves DDD unchanged on density matrices; partial trace over any nonempty finite factor does not increase DDD on density matrices; and tensoring both arguments with the same pure matrix αα†\alpha\alpha^\daggerαα†, for any unit vector α\alphaα on a nonempty finite ancillary type with decidable equality, leaves DDD unchanged. These assumptions apply on every nonempty finite underlying type with decidable equality. Also assume that, for every such underlying type, every finite outcome type, every family of mutually orthogonal Hermitian idempotents QkQ_kQk​ summing to the identity, and every density pair S,RS,RS,R,

D ⁣(∑kQkSQk,∑kQkRQk)=∑kD(QkSQk,QkRQk).D\!\left(\sum_kQ_kSQ_k,\sum_kQ_kRQ_k\right) =\sum_kD(Q_kSQ_k,Q_kRQ_k).D(k∑​Qk​SQk​,k∑​Qk​RQk​)=k∑​D(Qk​SQk​,Qk​RQk​).

Here a density matrix is positive semidefinite with complex trace 111, (αα†)a,b=αaαb‾(\alpha\alpha^\dagger)_{a,b}=\alpha_a\overline{\alpha_b}(αα†)a,b​=αa​αb​​, and partial trace over AAA means (Tr⁡AZ)b,b′=∑aZ(a,b),(a,b′)(\operatorname{Tr}_A Z)_{b,b'}=\sum_aZ_{(a,b),(a,b')}(TrA​Z)b,b′​=∑a​Z(a,b),(a,b′)​. Then, for every nonempty finite type III with decidable equality, every finite type KKK, every family PkP_kPk​ of complex matrices on III satisfying

Pk†=Pk,Pk2=Pk,PkPl=0 (k≠l),∑kPk=I,P_k^\dagger=P_k,\quad P_k^2=P_k,\quad P_kP_l=0\ (k\ne l),\quad \sum_kP_k=I,Pk†​=Pk​,Pk2​=Pk​,Pk​Pl​=0 (k=l),k∑​Pk​=I,

and every density pair σ,ρ\sigma,\rhoσ,ρ on III,

∑kD(PkσPk,PkρPk)≤D(σ,ρ).\sum_kD(P_k\sigma P_k,P_k\rho P_k)\le D(\sigma,\rho).k∑​D(Pk​σPk​,Pk​ρPk​)≤D(σ,ρ).

No decidable equality or nonemptiness assumption is imposed on KKK; if KKK is empty, the completeness hypothesis is impossible because III is nonempty.

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