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.
Schmidt decomposition
Statement
Let be finite-dimensional complex-inner-product spaces with the tensor-product convention of Ordered tensor registers, their inner product, and wire permutations. For every there are an integer , positive numbers , and orthonormal families and such that
For take and the empty sum. For any chosen ordered pair of orthonormal bases, the construction below obtains the as the positive singular values of the coefficient matrix of in their ordered product basis.
Facts & Assumptions
Given: Finite-dimensional complex-inner-product spaces , their ordered orthonormal bases, and .
Ordered tensor registers, their inner product, and wire permutations: the ordered product basis is orthonormal and elementary-tensor pairings are products of the factor pairings.
Dirac Notation Conversion: the root inner product is linear in its first argument.
The proof of Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition, steps 1.1–2.1, constructs an orthonormal eigenbasis of the domain for , a finite orthonormal family for the positive singular values , and zero action on zero singular values. Expanding an arbitrary vector in the domain basis gives the positive-family identity ; this use does not require extending the positive family in the codomain to a basis.
Every finite-dimensional real or complex inner product space has an orthonormal basis: finite-dimensional inner-product spaces, including the zero space, have orthonormal bases.
The standard formulas on and on are inner products: the standard pairing on is linear in the first argument, and its standard basis is orthonormal.
Proof
Choose ordered orthonormal bases of and of using [F4], and write by [F1]. Define the complex-linear map by ; its standard matrix is exactly . Apply the positive-family construction [F3] to . If and are its right and positive left singular vectors, the identity there gives . Evaluating at each standard basis vector of and using [F5], the entry of this identity is . This is the coefficient formula needed below, obtained from the positive singular families without a codomain basis completion.
Define and . The coordinate columns of the are orthonormal by [F3]–[F5], so the are orthonormal. For the second family, , so it too is orthonormal. The coefficient of in is by step 1.1, so this sum equals . If , then and . The positive coefficients are precisely the positive singular values of .
By [F1], the vectors are orthonormal: their pairings are . Expanding the squared norm of the sum in step 2.1 therefore gives , including the empty sum when .
Remarks
This proof uses only the SVD supplier's positive singular families and the expansion obtained from its domain eigenbasis; it does not use the separate claim that the positive left-singular family has already been extended to a full basis. All remaining choices are finite-dimensional basis or finite coordinate choices.
Depends on
- Ordered tensor registers, their inner product, and wire permutations
- Dirac Notation Conversion
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
- Every finite-dimensional real or complex inner product space has an orthonormal basis
- The standard formulas $\langle x,y\rangle=\sum_{k<n}x_k y_k$ on $\mathbb R^n$ and $\sum_{k<n}x_k\overline{y_k}$ on $\mathbb C^n$ are inner products
Used by
- Pure-State Entanglement Across a Tensor Cut Definition
- Strong subadditivity for a pure GHZ tripartite state Example
- Coherent information equals output entropy minus environment entropy Lemma
- Coherent-information concavity and subadditivity for degradable channels Lemma
- Compression dimension bounds entanglement fidelity Lemma
- Entropy bounds for a finite mixture of states Lemma
- Flat-input coherent information is achievable by subspace codes Lemma
- Flat-input entanglement-assisted achievability by Weyl coding Lemma
- Additive entanglement-assisted classical capacity formula Theorem
- Diamond Norm Ancilla Dimension Bound Theorem
- Every finite state ensemble is obtainable from a purification Theorem
- Exact quantum, private, and entanglement-assisted erasure capacities Theorem
- Pure State No Cloning Theorem
- Purifications exist and are unitarily equivalent after padding Theorem
- Regularized coherent-information formula for quantum capacity Theorem
- The least purification environment dimension is the density rank Theorem
Dependency tree · two levels
31 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- John Watrous, The Theory of Quantum Information, §1.1.3, PDF pp.39–40 (printed pp.31–32) (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 2: Foundations I: States and Ensembles (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, §18.3, PDF pp.170–171 (printed pp.158–159) (standard reference, not scraped)