Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix D, (D1): two-block pinching

Proved
QAlgorithms.Papers.Independent.Intakenext100.P20.two_block_pinching

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

prove2quantum

Let ρ\rhoρ be a positive semidefinite trace-one operator on a nonzero finite-dimensional complex Hilbert space. For every orthogonal projection P=P†=P2P=P^\dagger=P^2P=P†=P2,

PρP+(I−P)ρ(I−P)⪰12ρ.P\rho P+(I-P)\rho(I-P)\succeq\tfrac12\rho.PρP+(I−P)ρ(I−P)⪰21​ρ.

The order is the positive semidefinite operator order. This two-block pinching inequality is the operator comparison used in the positive-decoder converse.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P20
Formal statement
noncomputable section

open scoped Matrix ENNReal ComplexOrder Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P20

open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)

open QAlgorithms.Papers.Independent.Information100.P47 (IsProbability)

open QAlgorithms.Papers.Independent.Information100.P53 (SpectralData)

open QAlgorithms.Papers.Independent.Gap48.P19 (shannonNats)

open QAlgorithms.Papers.Independent.Dependency50.P28 (classicalD)

attribute [local instance] Classical.propDecidable

/-- Appendix D, PDF p.11, (D1): two-block pinching dominates half the state.
Projection means self-adjoint and idempotent, and rho remains normalized. -/
theorem two_block_pinching {d : ℕ} (hd : 0 < d)
    (rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho)
    (P : Matrix (Fin d) (Fin d) ℂ) (hself : Pᴴ = P) (hidempotent : P * P = P) :
    (P * rho * P + (1 - P) * rho * (1 - P) - (1 / 2 : ℂ) • rho).PosSemidef := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P20

end
Source
Exponents of quantum fixed-length pure state source coding, arXiv:quant-ph/0202002v6, PDF p. 11, Appendix D, (D1): two-block pinching
Read-back

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

For every positive integer ddd, every positive semidefinite complex d×dd\times dd×d matrix ρ\rhoρ with trace 111, and every complex d×dd\times dd×d matrix PPP satisfying P∗=PP^\ast=PP∗=P and P2=PP^2=PP2=P, the matrix

PρP+(I−P)ρ(I−P)−12ρP\rho P+(I-P)\rho(I-P)-\frac12\rhoPρP+(I−P)ρ(I−P)−21​ρ

is positive semidefinite. The hypotheses permit both P=0P=0P=0 and P=IP=IP=I, and impose no commutation condition between PPP and ρ\rhoρ.

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