How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Finite completely positive trace-preserving maps — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Analyticity of Holomorphic Functions; Liouville and Morera
- Approximation and Compactness in C(K)
- Arc Length and Rectifiable Curves
- Banach Alaoglu Goldstine and Krein Milman
- Banach Algebras Spectrum and Holomorphic Functional Calculus
- Banach Valued Integration and the Radon Nikodym Property
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Bounded Variation and the Riemann–Stieltjes Integral
- Compact Operators and Riesz Schauder Theory
- Compact Self Adjoint Hilbert Schmidt and Trace Class Operators
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Norms and Realification
- Complex Power Series and Analytic Functions
- Complex Subspace Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Computational foundations: factorization, KL, and optimization
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Continuous Functional Calculus for Self Adjoint and Normal Operators
- Contour Integration
- Convergence: Nets and Filters
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Domination and Likelihood Ratios
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite completely positive trace-preserving maps
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Function Space Topologies and the Exponential Law
- Fundamental Trigonometric Identities
- Gelfand Theory and Commutative C Star Algebras
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Line Integrals and the Gradient Theorem
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Minimax Lower Bounds
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal density states and spectral moments
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- pi: the Equivalent Characterizations
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Qm Math Composites
- Radon Measures and the Riesz Markov Kakutani Theorem
- Registers, Tensor Products, and Partial Trace
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Spectral Measures and Borel Functional Calculus
- Splitting Fields
- Stone–Weierstrass in General
- Strongly Continuous Semigroups and Hille Yosida
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The Analytic Hahn Banach Theorem
- The Baire Principles of Functional Analysis
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Fundamental Theorems of Calculus
- The Galois Correspondence
- The Integral Logarithm and the Equivalence of Its Characterisations
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Trace-class bounded-observable response
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Unbounded Self Adjoint Operators and Stones Theorem
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These exact finite calculations separate positivity from complete positivity, show a channel that lowers von Neumann entropy, and exhibit correlated joint preparations with the same system marginal but different outputs. A final two-qubit product-preparation model gives channel maps at every time while violating the semigroup law through a coherence revival. The counterexamples report no measurements and make no universal claim about every correlated preparation or every finite bath.
3 · Logical flowchart
4 · Definitions, postulates, theorems and proofs
None yet.
5 · Examples, experiments and counterexamples
Amplitude damping can decrease system entropy
Statement refuted
Every finite quantum channel and every positive semidefinite trace-one matrix satisfy .
Facts & Assumptions
Given: The finite channel and entropy definitions, with units , and the full Axiom of Choice as required by the KL supplier below.
The Axiom of Choice: every family of nonempty sets has a choice function. It is an explicit hypothesis of the published KL nonnegativity supplier used for the strict entropy comparison.
Finite completely positive trace-preserving maps: a finite channel is a complex-linear completely positive trace-preserving map.
Complete finite Choi-Kraus equivalence: a finite Kraus map is completely positive, and it is trace-preserving when .
Quantum spectral entropy and relative-entropy domains: for a positive trace-one matrix with eigenvalues , , with .
Kullback–Leibler divergence: for probability laws , , using the natural logarithm.
Kullback–Leibler divergence is nonnegative: under full AC, , with equality exactly when .
The real exponential function and the number by a power series: is the real exponential function defined by its power series, with .
The exponential is positive and satisfies : for every real .
Counterexample
Fix in and in seconds, so by [F6]–[F8]. On , define , , and . Since , [F2] and [F1] show that is a finite channel.
The matrix is positive semidefinite with trace one. Direct multiplication gives , where by [F6]–[F8]. The entropy difference is , where . For the binary laws and , [F4] gives ; since , [F5] gives . With , this yields and refutes the universal claim.
Transpose positivity fails ancillary positivity
Statement refuted
Every complex-linear positive trace-preserving map between finite matrix algebras is completely positive.
Facts & Assumptions
Given: The standard ordered basis of , finite matrix transpose , and the finite channel definitions.
Finite completely positive trace-preserving maps: a positive map sends positive semidefinite inputs to positive semidefinite outputs; complete positivity additionally requires positivity of for every finite .
Finite matrix spectral and state calculus: every positive semidefinite finite matrix has a positive square root, finite Hermitian matrices have spectral decompositions, and the finite trace is cyclic.
Complete finite Choi-Kraus equivalence: with the unnormalized Choi matrix , a finite map is completely positive if and only if .
Counterexample
The transpose is complex-linear and preserves trace because it fixes the diagonal entries. For any , [F2] gives for some matrix ; hence . Thus is positive and trace-preserving.
Its Choi matrix is , the swap operator . For , one has ; therefore . By [F3], is not completely positive.
Finite-bath dephasing revival violates semigroup
Statement refuted
Every reduced-unitary family from a fixed finite system–environment Hamiltonian and a fixed product environment state is a semigroup: for all .
Facts & Assumptions
Given: Finite system and environment spaces , a total Hamiltonian , in joule-seconds, time in seconds, and a fixed product preparation .
Partial trace over a finite tensor factor: contracts the environment coordinate in the ordered product basis, .
Finite matrix spectral and state calculus: finite Hermitian matrices have spectral exponentials, and the finite trace is cyclic.
Independent-preparation reduced unitary channel: for a finite Hermitian total Hamiltonian and fixed environment density , the product-prepared reduced map is a channel for each real and uses the operator-norm power-series exponential. This theorem does not assert a semigroup law.
The complex exponential by its power series: for every , and .
, , and : for real , and .
is a bijection from onto the real unit circle: every point of the unit circle has the form for some .
Counterexample
Let , take in , and set . With and , the power-series definition of the finite operator exponential in [F3] and the -eigenbasis give . Applying [F1] to the two orthogonal environment sectors yields , where . In matrix coordinates, with . By [F3], each is a channel.
By [F7], choose a dimensionless with ; hence . Equation [F6] gives , and [F5] with [F4] gives and . Set and , with . By step 1.1, and . Therefore whereas , where . The outputs differ, so ; the family is not a semigroup.
Sources
- John Watrous, The Theory of Quantum Information, Chapter 4, §4.1.1 and Chapter 5, §5.2.2
- Lin Lin and Nathan Wiebe, Quantum Algorithms for Scientific Computation, Chapter 3, §3.2, Example 3.17
- John Watrous, The Theory of Quantum Information, Chapter 2, §2.2.2, Theorem 2.22
- Lin Lin and Nathan Wiebe, Quantum Algorithms for Scientific Computation, Chapter 3, §3.2, Example 3.11 and Theorem 3.18
- John Watrous, The Theory of Quantum Information, Chapter 2, §2.1.3
- John Watrous, The Theory of Quantum Information, Chapter 2, §2.2.2
- Lin Lin and Nathan Wiebe, Quantum Algorithms for Scientific Computation, Chapter 3, §§3.2–3.3
- John Watrous, The Theory of Quantum Information, Chapter 2, §§2.1.3–2.2.2