Appendix D, (D1): two-block pinching
ProvedQAlgorithms.Papers.Independent.Intakenext100.P20.two_block_pinchingprove2quantum
Let be a positive semidefinite trace-one operator on a nonzero finite-dimensional complex Hilbert space. For every orthogonal projection ,
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 , every positive semidefinite complex matrix with trace , and every complex matrix satisfying and , the matrix
is positive semidefinite. The hypotheses permit both and , and impose no commutation condition between and .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.