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.
Entropy inequalities, recovery boundaries and thermal entanglement
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
- Knill–Laflamme Recovery and Subsystem Codes
- 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
- Pure and Mixed States, Ensembles, and Schmidt Decomposition
- Qm Math Composites
- Quantum Information Measures
- Quantum Relative Entropy, Data Processing, and Strong Subadditivity
- 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
- 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 ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Trust region and cubic regularization methods
- 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
3 · Logical flowchart
4 · Definitions, postulates, theorems and proofs
Dimensionless entropy, mutual and conditional information
Definition
All Hilbert spaces in this item are nonzero and finite-dimensional over . A density operator on is a Hermitian positive semidefinite endomorphism with . Its dimensionless von Neumann entropy, in nats, is
where are the eigenvalues of , the logarithm is natural, and . For any positive semidefinite endomorphisms on one finite-dimensional , let . Define
when , taking each logarithm spectrally on its positive support and setting zero-eigenvalue contributions to zero; set otherwise. For density operators this is the finite-dimensional quantum relative entropy in nats.
For a density operator on the ordered product , define and , where in orthonormal product bases and the first factor is retained. Define
For a density operator on , define
where each partial trace contracts the indicated tensor factor and retains the other factors in their displayed order.
using the partial traces in the displayed factor order. For any fixed positive conversion factor with units J/K, the corresponding physical entropy is ; no numerical value of is specified here.
Definition references
Facts & Assumptions
Given: Nonzero finite-dimensional complex inner-product spaces and density operators on the tensor products appearing in the Definition. Use the ordered tensor factors displayed there and natural logarithms.
Density operator: a density operator is Hermitian positive semidefinite and has trace one.
Finite-dimensional von Neumann entropy: for a finite density operator, with zero eigenvalues contributing .
Finite-dimensional quantum relative entropy: uses support inclusion and support-restricted logarithms; it is when support inclusion fails.
Partial trace over a finite tensor factor: the second tensor factor is contracted by summing its equal row and column indices in an ordered product basis.
Partial traces of a finite bipartite state are states: both marginals of a finite bipartite density operator are density operators.
Partial trace over the first tensor factor: in an ordered product basis, ; for a grouped residual tensor product, its displayed factor order is retained.
Proof
By [F1], the input is a positive trace-one endomorphism on its finite tensor product. Apply [F5] to each bipartite grouping of a finite multipartite density operator; this makes every one-factor and two-factor marginal used in the Definition a density operator. Repeated partial traces use [F4] for the second factor and [F6] for the first factor, retaining the stated residual tensor-factor order.
Each such density operator has finitely many eigenvalues in , so the finite entropy sum in [F2] is a real number, including when some eigenvalues vanish. The relative entropy clause is defined on exactly the two support cases in [F3]. Therefore and are finite real-valued functions on the stated density operators, and has the extended-real domain specified in the Definition.
Conditional mutual information and finite channel monotonicity
Statement
Let be nonzero finite-dimensional complex inner-product spaces and let be a density operator on . With dimensionless entropy and conditional mutual information defined by the conventions below,
Also let and let be a finite completely positive trace-preserving map. For all positive semidefinite ,
where is the support-sensitive finite-dimensional quantum relative entropy: it equals when , and otherwise. These are finite-dimensional mathematical statements. The channel inequality is one-sided and asserts no equality condition, recovery map, or infinite-dimensional extension.
Statement references
Stinespring factorization diagram
diagram failed to render:
\begin{tikzcd}
M_d(\mathbb C)_+ \arrow[r, "X\mapsto VXV^*"] \arrow[dr, "\Phi"'] & \operatorname{End}(\mathbb C^e\otimes\mathcal E)_+ \arrow[d, "\operatorname{Tr}_{\mathcal E}"] \\
& M_e(\mathbb C)_+
\end{tikzcd}Here denotes positive semidefinite matrices, is the finite environment constructed in step 1.2, and is its isometry. The triangle commutes because step 1.2 computes entrywise. The proof uses that computation and the stated partial-trace inequality, not the diagram.
Facts & Assumptions
Given: The spaces and state in the first clause of the Statement; integers and the finite channel in the second clause. Use natural logarithms and the ordered finite tensor conventions of the cited definitions.
Dimensionless entropy, mutual and conditional information: , with each marginal formed by partial trace.
Finite completely positive trace-preserving maps: a finite channel is a complex-linear completely positive and trace-preserving map on matrix algebras.
Strong subadditivity of finite-dimensional quantum entropy: for a density operator on any ordered finite triple , .
Partial-trace data processing for finite quantum relative entropy: for positive semidefinite on a finite tensor product, , including the extended-real support-failure cases.
Complete finite Choi-Kraus equivalence: a finite CPTP map has a finite Kraus representation , and trace preservation entails .
Partial trace over a finite tensor factor: in product bases, the partial trace over the second factor sums diagonal blocks in that factor.
Finite-dimensional quantum relative entropy: is finite on support inclusion and otherwise; the finite branch uses support-restricted spectral logarithms.
Finite matrix spectral and state calculus: positive finite matrices have finite spectral decompositions and spectral logarithms on their positive supports; the finite trace is basis-independent and satisfies .
Proof
By [A1], the left side of the first assertion is the displayed four-entropy difference. Apply [F1] to the given state with the same factor order; the resulting inequality is exactly .
By [F3], choose a finite Kraus list with ; because , this identity rules out . Let with orthonormal basis and define by . Orthogonality of the gives , so . The coordinate formula [F4] then gives for every .
The isometry maps each positive-eigenvalue eigenspace of onto the corresponding eigenspace of , with the same eigenvalue; the orthogonal complement of is in the kernel. Hence , and likewise for . Because is injective, support inclusion holds for exactly when it holds for . If it fails, both relative entropies are by [F5]. If it holds, the support-restricted spectral logarithms satisfy and on the corresponding supports. The trace identity in [F6] therefore yields .
Apply [F2] to and , which are positive semidefinite because is linear and . By step 1.2 their partial traces are , and by step 2.1 their relative entropy equals . Thus , including when the right side is .
Boundary energy bounds thermal mutual information
Statement
Assume the Axiom of Choice. Let be nonzero finite-dimensional complex inner-product spaces. Let act on , let act on , and let act on . Set
For , define and the finite Gibbs density . Then
where uses dimensionless entropy in nats and is the operator norm.
For the optional lattice-family conclusion, fix . For each member of a specified family, take a finite site set , a partition , and nonzero finite-dimensional complex inner-product spaces for . Use the lexicographic order on in , with the empty tensor product defined as , and identify with in the displayed factor order. Let be a finite set of interaction labels with nonempty supports and self-adjoint terms on . For containing , write for the extension of to by the identity on every factor in . The crossing-label set is
Let and . Set , , and . Under the stated identification these give the displayed Hamiltonian decomposition. For each , assume and define by the Gibbs formula above. If one specified satisfies for every family member, the bound gives memberwise. No finite-range condition or additional geometric scaling assumption is used. When and each interaction term are measured in joules, has units J and has units J, so the bound is dimensionless.
Statement references
Facts & Assumptions
Given: The spaces and Hermitian matrices in the Statement, , natural logarithms, and a fixed with units J/K when physical units are assigned. Put .
The Axiom of Choice: every family of nonempty sets has a choice function. This is inherited through the Gibbs variational supplier in [F1] and its [F2] relative-entropy-domain dependency Quantum spectral entropy and relative-entropy domains; the finite matrix calculation in this item makes no infinite-dimensional selection.
Finite Gibbs free-energy and entropy optimization: for a finite Hermitian Hamiltonian, its Gibbs density minimizes over all density matrices, including rank-deficient competitors, with and . Its relative-entropy-domain dependency, recorded as [F2] in that supplier, carries Choice through the declared supplier chain; its own [A1] records energy and units.
Partial traces of a finite bipartite state are states: both marginals of a finite bipartite density operator are density operators.
Finite partial trace, Schmidt decomposition and finite no-signalling: for every finite bipartite endomorphism and local endomorphism , , with the corresponding identity for tracing the first factor.
Finite matrix spectral and state calculus: finite Hermitian matrices have orthonormal eigenbases with real eigenvalues; positive matrices have nonnegative spectral weights, and the finite trace is cyclic.
Finite mixing, product entropy, and bipartite subadditivity: for finite-dimensional density matrices, the physical entropy of a tensor product is the sum of the physical entropies of its factors, including rank-deficient factors. Its declared supplier chain carries the same Choice hypothesis in [A1].
Proof
By [F5], has finitely many real eigenvalues, so is positive definite and . Thus is a finite Gibbs density to which [F1] applies. Its marginals and are density operators by [F2].
Set . Tensor products of orthonormal eigenbases show that is positive semidefinite with eigenvalues , whose sum is ; hence is a density operator. By [F6], . Since and , division by gives . Therefore [F4] gives .
Define for finite density matrices. Since , [F1] applies to this functional and yields . Rearranging and using step 2.1 gives .
The coordinate formula in [F3] gives and , since each factor has trace one. The defining trace-pairing identities in [F3], with cyclicity from [F5], then show that the expectations of in and agree, and likewise for . Thus both local terms cancel in the trace on the right of step 3.1, leaving .
Diagonalize by [F5]. For any density matrix , the numbers are nonnegative (each is a sum of nonnegative diagonal expectations of on an orthonormal basis of ) and sum to one. Thus . Applying this absolute bound to and gives . Combine this with steps 3.1 and 4.1 and multiply by to obtain the claimed inequality. Substituting the additional family bound yields its stated conditional area scaling.
5 · Examples, experiments and counterexamples
None yet.
Sources
- John Watrous, The Theory of Quantum Information, Chapter 5, §5.2.1, author-hosted manuscript
- Mark M. Wilde, From Classical to Quantum Shannon Theory, Chapter 11, §§11.1 and 11.6, second-edition prepublication full text
- John Watrous, The Theory of Quantum Information, Chapter 5, Theorem 5.35 and proof; Theorem 5.36 and proof, author-hosted manuscript
- Mark M. Wilde, From Classical to Quantum Shannon Theory, Chapter 11, Theorems 11.7.1 and 11.8.1; Corollary 11.9.1, second-edition prepublication full text
- Michael M. Wolf, Frank Verstraete, Matthew B. Hastings, and J. Ignacio Cirac, Area laws in quantum systems: mutual information and correlations, arXiv:0704.3906v2, ‘Area laws for classical and quantum systems,’ Eq. (3)
- Pieter Naaijkens, Quantum Spin Systems on Infinite Lattices, §3.4, finite-dimensional entropy and Gibbs free-energy identity
- John Watrous, The Theory of Quantum Information, Chapter 5, §§5.2.1–5.2.3, author-hosted manuscript