Quantum channels · PhysLib theorem
Kadison–Schwarz for Completely Positive Subunital Maps
For a finite complex matrix map M that is completely positive and satisfies M(I) ≤ I, PhysLib proves (M(X))†M(X) ≤ M(X†X) for every matrix X.
What it says
What the theorem says
Every finite complex matrix map that is completely positive and subunital obeys the Kadison–Schwarz inequality (M(X))†M(X) ≤ M(X†X) for arbitrary X. The comparison is in Löwner order and does not require trace preservation or unital equality.
Context
Why it matters
Kadison–Schwarz is a foundational structural inequality for positive maps, and PhysLib's concrete finite-matrix proof exposes Kraus positivity, block matrices, and a Schur-complement argument.
Inside the proof
Proof architecture
The source turns complete positivity into a Gram-type positive block matrix, uses the subunital gap to replace M(I) by I without losing positivity, and extracts the final inequality through a block-matrix positivity criterion.
Step 1
Build a positive Kraus block
A Kraus representation of the completely positive map expresses the block with entries M(I), M(X), M(X)†, and M(X†X) as a finite sum of positive Gram blocks.
[ M(I) M(X); M(X)† M(X†X) ] ≥ 0
Show the Lean ingredients
have hblockMatrixMap.IsCompletelyPositive.exists_krausMatrix.fromBlocks_gram_posSemidefStep 2
Add the subunital gap
Because M(I) ≤ I, the difference I−M(I) is positive. Adding it in the upper-left block converts the positive matrix into one whose upper-left entry is exactly I.
I − M(I) ≥ 0
Show the Lean ingredients
have hgap_blockhave hnonneghave hsumStep 3
Read the Schur complement
The identity block is positive definite and invertible. The block positivity criterion reduces the completed matrix to the desired Löwner-order inequality.
(M(X))†M(X) ≤ M(X†X)
Show the Lean ingredients
letI : Invertible (1 : Matrix B B ℂ)Matrix.PosDef.fromBlocks₁₁simpa [sub_nonneg]Authoritative formal type
Exact PhysLib statement
MatrixMap.cp_subunital_kadison_schwarz.{u_12, u_13} {A : Type u_12} {B : Type u_13} [Fintype A] [Fintype B] [DecidableEq A] {M : MatrixMap A B ℂ} [DecidableEq B] (hM : M.IsCompletelyPositive) (hM1 : M 1 ≤ 1) (X : Matrix A A ℂ) : (M X).conjTranspose * M X ≤ M (X.conjTranspose * X)This is the theorem's exact Lean type. The diagrams and commentary are explanatory; the pinned statement and source are authoritative.
Recorded connections
How this result fits
A one-step view of the published results directly connected to this page.
4 direct connections
- Related resultChannel Duality Preserves Expectation Valuesis related toKadison–Schwarz for Completely Positive Subunital Maps
- Related resultThe Dual of a Trace-Preserving Matrix Map Is Unitalis related toKadison–Schwarz for Completely Positive Subunital Maps
- Related resultChoi's Theorem for Completely Positive Mapsis related toKadison–Schwarz for Completely Positive Subunital Maps
- Related resultKadison–Schwarz for Completely Positive Subunital Mapsis related toKraus Representation of Completely Positive Maps
Only recorded public relationships are shown. A shared topic does not imply a dependency, and this is not a complete Lean proof-term dependency graph.
Open this result in the full theorem map4 direct connectionsProvenance and verification
Sources and technical checks
Show declaration provenance and Lean checks
MatrixMap.cp_subunital_kadison_schwarzQuantumInfo.Finite.CPTPMap.Unbundled6bd0b4b99d3dsorryAx reportedThe declaration footprint describes source layout, not proof difficulty or the size of its dependencies. The pinned checks verify the cited Lean theorem; semantic review remains a separate PhysAtlas judgment.



