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.
Quantum Relative Entropy, Data Processing, and Strong Subadditivity
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- 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
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- 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
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Fundamental Trigonometric Identities
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Knill–Laflamme Recovery and Subsystem Codes
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- 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
- Pure and Mixed States, Ensembles, and Schmidt Decomposition
- Quantum Information Measures
- 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
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- 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 Galois Correspondence
- The Logarithm and General Powers
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Trust region and cubic regularization methods
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This finite-dimensional development uses the support-sensitive quantum relative entropy with natural logarithms. It uses the resolvent compression inequality, the Jensen inequality for the negative logarithm, and partial-trace and channel data processing through finite Stinespring dilation, proved together with joint convexity on Quantum Information Measures. The entropy consequences are strong subadditivity and nonnegativity of conditional mutual information; the measurement consequence is the finite Holevo bound established on that prerequisite page. States and positive semidefinite operators are both allowed where the stated relative entropy convention permits them. No infinite-dimensional extension or equality/recovery claim is made.
The channel data-processing proof factors the channel through an isometric embedding and a partial trace. The top route denotes that factorization, and the lower arrow denotes the original channel; the equality is justified by the finite Stinespring theorem and the proof text, not by the picture.
\begin{tikzcd}
\mathcal L(H) \arrow[r, "X\mapsto VXV^\dagger"] \arrow[rr, "\Phi"'] & \mathcal L(K\otimes E) \arrow[r, "\operatorname{Tr}_E"] & \mathcal L(K)
\end{tikzcd}
The entropy inequalities use finite marginal definitions and preserve their factor order explicitly. All logarithms are natural, so divergences and entropies are measured in nats.
3 · Logical flowchart
4 · Definitions, theorems and proofs
The finite Weyl twirl is the normalized partial trace
Statement
Let be finite-dimensional complex inner-product spaces with , and fix an ordered orthonormal basis of . Let and , where (and when ). For ,
Facts & Assumptions
Given: Finite-dimensional complex-inner-product spaces , , an ordered orthonormal basis of , and .
Partial trace over a finite tensor factor: in an ordered product basis with the retained factor first, .
Ordered tensor registers, their inner product, and wire permutations: the product basis is ordered by factor indices and elementary-tensor pairings are products of the factor pairings.
Complex de Moivre formula for every integer exponent: integer powers of equal .
, and exactly when : exactly when .
Euler's formula: for every real : for real .
Proof
If , Euler's identity [F5] and the integer-power formula [F3] give for every integer . By [F4], this equals exactly when divides , so has exact order and . The shift permutes the orthonormal basis and the phase multiplies its vectors by unit scalars, so both are unitary. For both are the identity. For , is when ; otherwise multiplication by makes the geometric sum telescope to , so it is .
Write and expand in the product basis. Direct action on basis vectors gives and , with indices modulo . Averaging first over using step 1.1 removes every term and keeps .
For each remaining diagonal unit, . Therefore the full average is . By [F1], , giving the identity. When , [F1] says is the unique coefficient , so the same equality holds.
Strong subadditivity of finite-dimensional quantum entropy
Statement
Let be nonzero finite-dimensional complex inner-product spaces and let be a density operator on their ordered tensor product. Write for its marginals using the partial traces in Partial trace over a finite tensor factor. Then where with as in Finite-dimensional von Neumann entropy.
Facts & Assumptions
Given: Nonzero finite-dimensional complex inner-product spaces and a density operator on .
Finite-dimensional quantum relative entropy: is finite on support inclusion and equals there; otherwise it is .
Joint state support is contained in the tensor product of its marginal supports: for any bipartite state, the joint support is contained in the tensor product of its marginal supports, so its relative entropy to the product of its marginals is finite.
Finite quantum mutual information identities and the Holevo identity: for a finite bipartite state , .
Partial-trace data processing for finite quantum relative entropy: for positive semidefinite on a finite tensor product, , including extended values.
Density operator: a state is positive semidefinite and has trace one.
Partial trace over a finite tensor factor: tracing out the last factor sums the diagonal blocks indexed by that factor.
Ordered tensor registers, their inner product, and wire permutations: the product basis has the displayed factor order and tensor products act factorwise.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: positive operators have finite spectral decompositions in orthonormal eigenbases.
Partial traces of a finite bipartite state are states: partial traces of a finite bipartite density operator are density operators.
Proof
View first across the grouped bipartition : [F9] makes and states. Applying [F9] across also makes a state. Applying it once more to across makes a state. This is also : in the ordered product basis [F6]–[F7], both have coefficient , since the finite sums may be reordered. The operator is also a state: spectral decompositions of the two positive factors give nonnegative product eigenvalues, and their sum is . Applying [F2] to the bipartite states and gives support inclusion for both relative entropies and ; [F1] then makes both finite.
Set and . By [F6] and the ordered product basis [F7], and : the latter equality follows entrywise by summing the C-diagonal block of while the A-factor matrix coefficient remains fixed. Apply [F4] to this pair to obtain
Both sides in step 2.1 are finite by step 1.1, so [F3] identifies them as and , respectively. Cancel the common finite term and rearrange the inequality to obtain .
Nonnegativity of finite-dimensional quantum conditional mutual information
Statement
Let be a finite-dimensional tripartite state, with conditional mutual information defined by Finite quantum mutual, conditional, and conditional mutual information. Then
Facts & Assumptions
Given: A density operator on a finite ordered tensor product .
Finite quantum mutual, conditional, and conditional mutual information: , where is obtained by permuting to and tracing out the last factor.
Strong subadditivity of finite-dimensional quantum entropy: every tripartite state satisfies .
Finite wire permutations are unitary basis permutations: reordering tensor factors gives a unitary basis permutation.
Partial trace over a finite tensor factor and Ordered tensor registers, their inner product, and wire permutations: partial traces sum matrix blocks in the displayed ordered product basis, and the tensor factors retain their specified order.
Finite-dimensional von Neumann entropy: entropy is the sum over positive eigenvalues.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: a finite-dimensional self-adjoint operator has an orthonormal eigenbasis.
Proof
Let be the two-factor swap and let . Put . By [F3], is unitary; therefore an orthonormal eigenbasis of is carried to an orthonormal eigenbasis of with the same eigenvalues, and [F5] gives . The marginal of is exactly by the definition in [F1].
In the product basis, tracing out A from gives : its coefficient is the sum over of the coefficients with indices , which is precisely the swapped coefficient. Thus [F3] and the eigenvalue argument in step 1.1 give . Tracing out both A and B gives the same C marginal , since the finite sums over their basis indices are merely reordered.
Apply [F2] to the tripartite state with middle register C. It yields . Substituting the equalities in steps 1.1 and 2.1 gives exactly the expression in [F1], so .
5 · Examples, counterexamples and false statements
None yet.