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.
Strong subadditivity for a pure GHZ tripartite state
Statement
For three qubit registers , let Each one-register marginal and each two-register marginal has entropy , while . In particular, for the displayed order, so strong subadditivity is strict.
Facts & Assumptions
Given: The three-qubit computational basis and the normalized vector in the Statement.
Finite-dimensional von Neumann entropy: over the positive eigenvalues.
Density operator: a density operator is positive semidefinite and has trace one.
Partial trace over a finite tensor factor and Partial trace over the first tensor factor: marginals are obtained by summing the diagonal matrix blocks for the traced-out last or first register.
Ordered tensor registers, their inner product, and wire permutations and Finite registers and their ordered computational bases: the three qubit factors are ordered and their computational product basis is the corresponding tensor product basis.
Schmidt decomposition: a bipartite vector has an expansion with positive coefficients and orthonormal factor families, and its squared norm is .
Strong subadditivity of finite-dimensional quantum entropy: every finite tripartite state satisfies .
Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: the natural logarithm is strictly increasing and .
A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S: an operator diagonal in an orthonormal basis with nonnegative real diagonal entries is non-negative.
Finite wire permutations are unitary basis permutations: permuting tensor wires is a unitary basis permutation, preserving the spectrum under conjugation.
Diagram convention
The central node denotes the state-preparation map taking to ; the three outgoing legs are its ordered tensor factors. They describe one joint state, not a product of three states. No proof step relies on this diagram.
\begin{center} \begin{tikzpicture}[>=stealth, every node/.style={font=\small}] \node[draw,rounded corners,minimum width=1.8cm,minimum height=.8cm] (state) at (0,0) {}; \draw[->] (state.north west) -- (-1.1,1) node[above] {}; \draw[->] (state.north) -- (0,1) node[above] {}; \draw[->] (state.north east) -- (1.1,1) node[above] {}; \end{tikzpicture} \end{center}
Proof
By [F4], the vectors , , and the six computational basis vectors other than form an orthonormal basis. Direct multiplication by gives and zero on the other seven basis vectors. Thus its spectrum is ; it is non-negative by [F8] and has trace one, so it is a state by [F2]. Consequently by [F1] and [F7].
Expanding gives the four terms , , , and . For any traced register, the first- or last-factor formula [F3], after the wire permutation [F9] when needed, kills both off-diagonal terms because ; the resulting two-register marginal is . Tracing out two registers similarly gives for each one-register marginal. These diagonal matrices have positive eigenvalues , with two additional zero eigenvalues for each two-register marginal. Across each one-versus-two split, the displayed vector itself is a Schmidt expansion of the form [F5], with coefficients .
For each reduced state in step 1.2, [F1] gives entropy . Hence the left side of the claimed SSA instance is , and the right side is . Since and by strict monotonicity in [F7], the inequality is strict and equals the stated comparison.
Depends on
- Finite-dimensional von Neumann entropy
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
- Strong subadditivity of finite-dimensional quantum entropy
- Schmidt decomposition
- Density operator
- Partial trace over a finite tensor factor
- Partial trace over the first tensor factor
- Ordered tensor registers, their inner product, and wire permutations
- Finite registers and their ordered computational bases
- Finite wire permutations are unitary basis permutations
- A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
51 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 (2018), Chapter 5 (standard reference, not scraped)
- Mark M. Wilde, From Classical to Quantum Shannon Theory, second-edition prepublication v8 (2019) (standard reference, not scraped)