Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
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 HL,HP,HO be nonzero finite-dimensional complex coordinate spaces with their specified orthonormal bases, and let V:HL→HP be an isometry. Write ∣μˉ⟩=V∣μ⟩ for the images of the logical basis vectors. Let El:HP→HO be a finite nonempty family of linear maps, and let HE be a coordinate space with orthonormal basis ∣l⟩ indexed by that family. Define the linear map A:HL⊗HE→HO by A∣μ,l⟩=El∣μˉ⟩, where ∣μ,l⟩=∣μ⟩⊗∣l⟩. Then M=A†A has entries M[μ,l],[ν,k]=⟨μˉ∣El†Ek∣νˉ⟩ and is positive semidefinite, meaning x†Mx≥0 for every x∈HL⊗HE.

For vμ,l=El∣μˉ⟩, the library's linear-first Gram matrix satisfies G[μ,l],[ν,k]=M[ν,k],[μ,l]. The partial trace over the first, logical factor satisfies (Tr⁡LM)l,k=∑μM[μ,l],[μ,k], retaining the error indices.

Facts & Assumptions

[F1]

The specified coordinate conventions identify adjoints with conjugate transposes, define ⟨u∣B∣v⟩=u†Bv, and use the linear-first inner product ⟨x,y⟩root=y†x. Ordered tensor registers use the product basis in the displayed factor order. Finite operator and ket conventions

[F2]

An isometric code is specified by a linear isometry V from the logical space into the physical space. Code restriction and decoded channel types A linear isometry is a linear map V satisfying ∥Vx∥=∥x∥ for every vector x, with the induced inner-product norms. Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces

[F3]

For an ordered finite list of vectors, the library Gram matrix has entries Gij=⟨vi,vj⟩root. The Gram matrix G(v₀,…,vᵣ₋₁)=(⟨ vᵢ,vⱼ⟩)_i,j<r and Gram determinant, with empty value 1

[F4]

In ordered orthonormal product bases, the partial trace over the first factor has entries (Tr⁡LX)l,k=∑μX[μ,l],[μ,k]. Partial trace over the first tensor factor

Proof

Given: The spaces, isometry, maps, product basis and A in the statement.

Goal: Establish the entries and positivity of M, its orientation relative to G, and the displayed partial-trace formula.

1.1givenF1F2algebra

The prescribed values of A on the product basis determine a linear map. Using conjugate transpose and matrix multiplication, its ([μ,l],[ν,k]) entry in A†A is (El∣μˉ⟩)†(Ek∣νˉ⟩)=⟨μˉ∣El†Ek∣νˉ⟩. For every x, x†Mx=(Ax)†(Ax)=∑j∣(Ax)j∣2≥0. Thus M has the claimed entries and is positive semidefinite.

2.1F1F3F4step 1.1∎

By the linear-first convention, G[μ,l],[ν,k]=⟨vμ,l,vν,k⟩root=vν,k†vμ,l=M[ν,k],[μ,l]. Applying the first-factor partial-trace definition to M gives (Tr⁡LM)l,k=∑μM[μ,l],[μ,k]. These are the stated Gram orientation and contraction.

Depends on

Used by · 3

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.