Quantum theory · Formalized result
Binary CPTP Product Composition
For finite CPTP maps, the binary product commutes with composition, preserves identity, and is natural under SWAP.
Detailed visual description
An ivory upper rail and cobalt lower rail carry finite state-cell clusters through exactly two channel stages. Gold vertical yokes bind the two plates in each stage into a binary product, while an interlocking central hinge makes sequential composition visible. The image does not depict a finite Pi-product, permutation-family product, capacity, fidelity, entropy, measurement, dilation environment, Lindblad flow, thermodynamic limit, or general open-system dynamics.
First read
The theorem in plain language
The result
For finite CPTP maps, the binary product commutes with composition, preserves identity, and is natural under SWAP.
Assumptions, conventions, and scope · 11 notes
Conventions
- The theorem uses QuantumInfo's binary `CPTPMap.prod` notation `⊗ᶜᵖ` and `CPTPMap.compose` notation `∘ₘ`.
- The proof reduces map equality to `MatrixMap.kron_comp_distrib` through `CPTPMap.ext`.
- The identity theorem reduces map equality to `MatrixMap.kron_id_id` through `CPTPMap.ext`.
- The swap-naturality theorem is retained only as binary-product convention support.
- Local axiom probes for the binary chain reported only `Classical.choice`, `Quot.sound`, and `propext`.
- Finite Pi-product APIs such as `CPTPMap.piProd`, `CPTPMap.fin_1_piProd`, and related `MatrixMap.piProd` lemmas remain out of scope.
What this result does not claim
- Does not prove finite Pi-product CPTP composition.
- Does not use or validate `CPTPMap.piProd` or `CPTPMap.fin_1_piProd`.
- Does not prove permutation-family channel products beyond the retained binary swap-naturality support theorem.
- Does not prove channel-capacity, fidelity, entropy, or general open-system dynamics statements.
- Does not establish semantic alignment beyond the narrow binary product convention boundary.
Inside the formalization
How the checked binary channel laws compose
A source-bound walkthrough of the three binary CPTP product convention laws present at the page's pinned evidence commit: composition distribution, identity preservation, and SWAP naturality.
Proof story
Three laws at the retained evidence boundary
These are the three binary product declarations available in the exact package commit bound to this page. Later SWAP-involution evidence and the broader channel showcase are deliberately not folded into this footprint.
Checked result 1 of 3
Distribute composition over the binary product
(Λ₂ ∘ Λ₁) ⊗ (Γ₂ ∘ Γ₁) = (Λ₂ ⊗ Γ₂) ∘ (Λ₁ ⊗ Γ₁)
Extensionality reduces equality of the bundled CPTP maps to their matrix-map fields, where the checked Kronecker composition-distribution law closes the binary convention identity.
Lean anchors · 1 declaration
- Binary product composition
PhysAtlasFormalizations.PhysAtlasFormalizations/Quantum/CPTPBinaryProduct.lean · source lines 28–37Quantum. CPTPBinaryProduct. binary_ prod_ comp
The checked law says that composing each channel and then taking the binary product agrees with composing the two binary products. Detailed visual description
Extensionality reduces equality of the bundled CPTP maps to their matrix-map fields, where the checked Kronecker composition-distribution law closes the binary convention identity. This image explains the proof organization and is not formal or semantic evidence.
- Binary product composition
Checked result 2 of 3
Preserve identity on the product system
id ⊗ id = id
The identity product theorem again uses extensionality, then discharges the matrix-map equality with the checked Kronecker identity law for the finite product system.
Lean anchors · 1 declaration
- Binary identity product
PhysAtlasFormalizations.PhysAtlasFormalizations/Quantum/CPTPBinaryProduct.lean · source lines 47–52Quantum. CPTPBinaryProduct. binary_ prod_ id
Taking the binary product of two identity channels leaves the combined finite product system unchanged. Detailed visual description
The identity product theorem again uses extensionality, then discharges the matrix-map equality with the checked Kronecker identity law for the finite product system. This image explains the proof organization and is not formal or semantic evidence.
- Binary identity product
Checked result 3 of 3
Commute the binary product with SWAP
SWAP ∘ (Λ ⊗ Γ) = (Γ ⊗ Λ) ∘ SWAP
The naturality proof expands the bundled operations to matrix maps, reindexes the product coordinates, and rearranges the finite sums so swapping before or after the binary channel pair agrees.
Lean anchors · 1 declaration
- Binary SWAP naturality
PhysAtlasFormalizations.PhysAtlasFormalizations/Quantum/CPTPBinaryProduct.lean · source lines 61–86Quantum. CPTPBinaryProduct. binary_ prod_ swap_ naturality
Swapping after the binary product matches swapping first and applying the two channels in the opposite order. Detailed visual description
The naturality proof expands the bundled operations to matrix maps, reindexes the product coordinates, and rearranges the finite sums so swapping before or after the binary channel pair agrees. This image explains the proof organization and is not formal or semantic evidence.
- Binary SWAP naturality
Exact checked composition law
Lean statement
PhysAtlasFormalizations@0ffb8304dceetheorem binary_prod_comp
{A₁ A₂ B₁ B₂ C₁ C₂ : Type*}
[Fintype A₁] [Fintype A₂] [Fintype B₁] [Fintype B₂] [Fintype C₁] [Fintype C₂]
[DecidableEq A₁] [DecidableEq A₂] [DecidableEq B₁] [DecidableEq B₂]
(Λ₁ : CPTPMap A₁ B₁) (Λ₂ : CPTPMap B₁ C₁)
(Γ₁ : CPTPMap A₂ B₂) (Γ₂ : CPTPMap B₂ C₂) :
(Λ₂ ∘ₘ Λ₁) ⊗ᶜᵖ (Γ₂ ∘ₘ Γ₁) =
(Λ₂ ⊗ᶜᵖ Γ₂) ∘ₘ (Λ₁ ⊗ᶜᵖ Γ₁)How to read the footprint: It measures retained source size, not proof difficulty or quality.
The diagrams explain the proof structure; the exact Lean statement above is the checked object.
Recorded connections
How this result fits
A one-step view of the published results directly connected to this page.
Prerequisites
Scientific or checked formal prerequisites
Used by
Results that build on this page
4 direct connections
- Scientific prerequisiteBinary CPTP Product CompositionprecedesFinite CPTP Stinespring Dilation
- Scientific prerequisiteBinary CPTP Product CompositionprecedesFinite CPTP Relative Entropy Data Processing
- Scientific prerequisiteFinite Density-State Invariants Under ConjugationprecedesBinary CPTP Product Composition
- Scientific prerequisiteTwo-Qubit Pauli-String Tensor BridgeprecedesBinary CPTP Product Composition
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 connectionsSources
Reviewed sources and further reading
PhysLib QuantumInfo finite CPTPMap binary product source
Reviewed source supporting the statement, conventions, or physical context on this page.
Source notes
Pinned QuantumInfo.Finite.CPTPMap.CPTP source reviewed for finite CPTPMap, CPTPMap.compose, binary CPTPMap.prod, and CPTPMap.SWAP conventions used by the retained local wrapper. Finite Pi-product APIs remain excluded because local probes found sorryAx dependencies in that path.
Watrous finite quantum-channel context
Reviewed source supporting the statement, conventions, or physical context on this page.
Source notes
Watrous, The Theory of Quantum Information, gives the standard finite-dimensional quantum-channel context: completely positive trace-preserving maps between matrix/operator spaces. This review uses Watrous as terminology/context support only; the exact binary product laws are reviewed against the pinned QuantumInfo API and retained Lean wrapper.
Lean evidence
What Lean checked
The walkthrough declarations come first. Additional linked names and scope boundaries stay in the technical index.
3 walkthrough declarations shown · 12 additional linked names.
Walkthrough declaration preview
PhysAtlasFormalizations.Quantum. CPTPBinaryProduct. binary_ prod_ comp PhysAtlasFormalizations.Quantum. CPTPBinaryProduct. binary_ prod_ id PhysAtlasFormalizations.Quantum. CPTPBinaryProduct. binary_ prod_ swap_ naturality
Technical evidence details12 more names · 5 scope boundaries
Related binary-product declarations
PhysAtlasFormalizations.Quantum. CPTPBinaryProduct. binary_ swap_ comp_ self PhysAtlasFormalizations.Quantum. CPTPBinaryProduct. binary_ swap_ self_ comp
Support-only channel showcase declarations
PhysAtlasFormalizations.Quantum. ChannelShowcase. binary_ composed_ channels PhysAtlasFormalizations.Quantum. ChannelShowcase. binary_ identity_ channel PhysAtlasFormalizations.Quantum. ChannelShowcase. channel_ comp_ apply PhysAtlasFormalizations.Quantum. ChannelShowcase. channel_ comp_ id PhysAtlasFormalizations.Quantum. ChannelShowcase. finite_ density_ evolution_ invariants PhysAtlasFormalizations.Quantum. ChannelShowcase. finite_ density_ evolution_ trace PhysAtlasFormalizations.Quantum. ChannelShowcase. finite_ density_ flow_ spectrum PhysAtlasFormalizations.Quantum. ChannelShowcase. id_ channel_ apply PhysAtlasFormalizations.Quantum. ChannelShowcase. id_ comp_ channel PhysAtlasFormalizations.Quantum. ChannelShowcase. lindblad_ rhs_ trace_ zero
Scope boundaries
- Does not establish semantic alignment beyond the narrow binary product convention boundary.
- Does not prove channel-capacity, fidelity, entropy, or general open-system dynamics statements.
- Does not prove finite Pi-product CPTP composition.
- Does not treat the finite quantum showcase bundle as one reviewed public physics claim.
- Does not use or validate
CPTPMap.piProdorCPTPMap.fin_1_piProd.
Proof bodies, checker logs, and local paths are not part of this public view.
Technical details and page dataPage identifier and JSON
quantum.channel.cptp_binary_product_composition


