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 two-qubit density matrices and separability
Definition
Use the single-qubit space and ordered two-qubit basis from Pauli matrices and the two-qubit exchange operator. A one-qubit density matrix is a Hermitian matrix such that for every and . A two-qubit density matrix is defined in the same way on , using the four-dimensional trace.
The tensor product of two one-qubit density matrices is again a two-qubit density matrix. To verify positivity, write any positive semidefinite Hermitian matrix as ; testing the quadratic form on the two coordinate vectors gives . If , completing the square gives
so positivity implies and
If , positivity forces : if , choose and with real , giving quadratic form . Then for . The nonnegative square roots exist by Existence and uniqueness of -th roots: a unique with through the preceding matrix conventions. Thus for one-qubit densities and , the tensor-product adjoint identity from Pauli matrices and the two-qubit exchange operator gives
which is Hermitian and positive semidefinite. In the displayed product basis, for matrices . Therefore .
A product density matrix is for one-qubit density matrices . A two-qubit density matrix is separable if it is a finite convex combination , where and ; these convex combinations are again density matrices by linearity of the trace and quadratic form. A two-qubit density matrix that is not separable is entangled. This finite-convex-combination convention is the one used by the local threshold proof.