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.
QEC matrix as an error-vector Gram operator
Statement
Let be nonzero finite-dimensional complex coordinate spaces with their specified orthonormal bases, and let be an isometry. Write for the images of the logical basis vectors. Let be a finite nonempty family of linear maps, and let be a coordinate space with orthonormal basis indexed by that family. Define the linear map by , where . Then has entries and is positive semidefinite, meaning for every .
For , the library's linear-first Gram matrix satisfies . The partial trace over the first, logical factor satisfies , retaining the error indices.
Facts & Assumptions
The specified coordinate conventions identify adjoints with conjugate transposes, define , and use the linear-first inner product . Ordered tensor registers use the product basis in the displayed factor order. Finite operator and ket conventions
An isometric code is specified by a linear isometry from the logical space into the physical space. Code restriction and decoded channel types A linear isometry is a linear map satisfying for every vector , with the induced inner-product norms. Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces
For an ordered finite list of vectors, the library Gram matrix has entries . The Gram matrix G(v₀,…,vᵣ₋₁)=(⟨ vᵢ,vⱼ⟩)_i,j<r and Gram determinant, with empty value 1
In ordered orthonormal product bases, the partial trace over the first factor has entries . Partial trace over the first tensor factor
Proof
Given: The spaces, isometry, maps, product basis and in the statement.
Goal: Establish the entries and positivity of , its orientation relative to , and the displayed partial-trace formula.
The prescribed values of on the product basis determine a linear map. Using conjugate transpose and matrix multiplication, its entry in is . For every , . Thus has the claimed entries and is positive semidefinite.
By the linear-first convention, . Applying the first-factor partial-trace definition to gives . These are the stated Gram orientation and contraction.
Depends on
- Finite operator and ket conventions
- Code restriction and decoded channel types
- The Gram matrix G(v₀,…,vᵣ₋₁)=(⟨ vᵢ,vⱼ⟩)_i,j<r and Gram determinant, with empty value 1
- Partial trace over the first tensor factor
- Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.