Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Direct-sum compatibility of general pinching

Open
QAlgorithms.Papers.Independent.Intakethird100.P05.pinching_direct_sum

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let A,B,C,DA,B,C,DA,B,C,D be arbitrary linear operators on a finite-dimensional complex Hilbert space H\mathcal HH. For any operator TTT, let ET\mathcal E_TET​ be the Hilbert–Schmidt orthogonal projection onto the commutant of the unital ∗*∗-algebra generated by TTT. Then

EC⊕D(A⊕B)=EC(A)⊕ED(B).\mathcal E_{C\oplus D}(A\oplus B)=\mathcal E_C(A)\oplus\mathcal E_D(B).EC⊕D​(A⊕B)=EC​(A)⊕ED​(B).

The direct sum acts on H⊕H\mathcal H\oplus\mathcal HH⊕H. For Hermitian TTT, this projection is the sum ∑jPj( ⋅ )Pj\sum_jP_j(\,\cdot\,)P_j∑j​Pj​(⋅)Pj​ over distinct spectral eigenvalues, retaining entire degenerate eigenspaces. The formula is useful when passing to classical-label block states.

Formalization Note The literal arbitrary-reference quantifiers use (41): the commutant requires commuting with both TTT and T∗T^*T∗. This extends the Appendix's initial Hermitian setup without a non-Hermitian zero default.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P05
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P05

open scoped Matrix ComplexConjugate ComplexOrder BigOperators

open Filter Topology QAlgorithms

open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)

open QAlgorithms.Papers.Independent.Information100.P07 (positiveProjection)

open QAlgorithms.Papers.Independent.Dependency50.P28 (tr pinch typeI accept)

open QAlgorithms.Papers.Independent.Claimed50.P45 (pinchedTest)

open QAlgorithms.Papers.Independent.Information100.P58 (Distribution)

open QAlgorithms.Papers.Independent.Information100.P27 (average)

open QAlgorithms.Papers.Independent.Dependency50.P07 (wordProb)

open QAlgorithms.Papers.Independent.Dependency50.P35 (directSum)

open QAlgorithms.Papers.Independent.Renew46.P44 (wordOutput)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {X I : Type} [Fintype X] [DecidableEq X] [Fintype I] [DecidableEq I]

/-- PDF p.8, Lemma 3, (44): direct-sum compatibility of the projection (41).
The literal arbitrary A,B,C,D domain uses the commutant of the generated
*-algebra, so non-Hermitian references do not collapse to zero. -/
theorem pinching_direct_sum (A B C D : Mat I) :
    algebraPinch (directSum C D) (directSum A B) =
      directSum (algebraPinch C A) (algebraPinch D B) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P05

end
Source
A New Proof of the Channel Coding Theorem via Hypothesis Testing in Quantum Information Theory, arXiv:quant-ph/0208139v1, PDF p. 8, Lemma 3, (44)
Read-back

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

For every finite type III with decidable equality and arbitrary complex matrices A,B,C,DA,B,C,DA,B,C,D on III, define PC(A)\mathcal P_C(A)PC​(A) by viewing AAA as a vector with coordinates indexed by I×II\times II×I, taking its orthogonal projection in the Euclidean Hilbert–Schmidt inner product onto the complex linear subspace of matrices commuting with both CCC and C†C^\daggerC†, and converting that vector back to a matrix. If X⊕YX\oplus YX⊕Y denotes the block diagonal matrix on the disjoint union I⊔II\sqcup II⊔I, with diagonal blocks X,YX,YX,Y and zero off-diagonal blocks, then

PC⊕D(A⊕B)=PC(A)⊕PD(B).\mathcal P_{C\oplus D}(A\oplus B) =\mathcal P_C(A)\oplus\mathcal P_D(B).PC⊕D​(A⊕B)=PC​(A)⊕PD​(B).

No Hermitian, positivity, normalization, or nonemptiness hypothesis is imposed; the statement includes empty III.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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