Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Stabilizer labels form an isotropic space of the same rank

Statement

Let S be a stabilizer subgroup on n≥0 qubits and let λ(P(k,x,z))=(x,z). Then λ∣S is injective, its image L is an isotropic F2-subspace, the rank dim⁡F2L depends only on S and not on a generating list, and ∣S∣=2dim⁡F2L.

Facts & Assumptions

Given: A stabilizer subgroup S and the phase-aware Pauli convention P(k,x,z)=ikXxZz.

[F1]

Stabilizer subgroup: S is an abelian subgroup of Hermitian Paulis and −I∉S.

[F2]

Binary Pauli label and quotient: the binary label is λ(P(k,x,z))=(x,z) and forgets only scalar phase.

[F3]

Binary Pauli quotient isomorphism: the label map is a group homomorphism, and its kernel on phase-aware Paulis is the scalar center.

[F4]

Pauli commutator is symplectic pairing: two Pauli operators commute exactly when their labels have symplectic pairing zero.

[F5]

Hermitian Pauli phase criterion: P(k,x,z) is Hermitian exactly when k≡x⋅z(mod2); every Hermitian Pauli squares to I.

[F7]

A d-dimensional vector space over a field with q elements has exactly qd elements: an r-dimensional vector space over a field of order q has qr elements.

[F8]

Phase aware n qubit pauli group and Pauli group on the empty register: the ambient Pauli set is finite, so every subgroup S is finite.

[F9]

Pauli group on the empty register: for n=0, the Hermitian scalar Paulis are I and −I, and the binary-label space has one element.

Proof

Given: The data in the Statement.

1.1F1F9given

If n=0, then S={I}: a subgroup contains I and its only other possible Hermitian scalar Pauli is −I, which is excluded. Thus λ∣S is injective, its image is the zero subspace of dimension 0, this dimension is independent of any generating list, and ∣S∣=1=20.

1.2F1F2F3F6given

Assume now n≥1. The identity of S has zero label. If P,Q∈S, then PQ∈S and λ(PQ)=λ(P)+λ(Q) by [F3]. Thus L=λ(S) contains zero and is closed under addition; over F2, closure under the only scalars 0,1 follows, so L is a subspace.

1.3F1F3F5given

Suppose P,Q∈S have the same label. By the homomorphism in [F3], λ(P−1Q)=0, so P−1Q is a scalar Pauli. Since Hermitian Paulis square to I by [F5], P−1=P; as P,Q commute and are Hermitian, P−1Q=PQ is Hermitian. The phase criterion [F5] then makes this scalar equal to I or −I. The latter is excluded by [F1], hence P=Q and λ∣S is injective.

2.1F1F4step 1.2algebra

For n≥1, any two labels in L come from commuting elements of the abelian group S, so [F4] gives symplectic pairing zero. Bilinearity then makes every pair in their span pair to zero; hence L is isotropic. The image L is defined from S alone, so its dimension is unchanged by replacing one generating list of S by another.

2.2F6F7F8step 1.3

For n≥1, the map λ∣S:S→L is onto by the definition of L and injective by step 1.3, so it is a bijection of finite sets by [F8]. If r=dim⁡F2L, [F6] and [F7] give ∣L∣=2r. Therefore ∣S∣=∣L∣=2r, as claimed.

3.1step 1.1step 1.2step 2.2∎

Step 1.1 proves the claim for n=0, and step 1.2 and step 1.3 and step 2.1 and step 2.2 prove it for n≥1. These cases exhaust all n≥0.

Sources

De Wolf §20.1, PDF pp. 185–186, describes the finite Pauli group, commuting independent stabilizers, and the rank-n state condition. Aaronson–Gottesman §II, PDF pp. 2–4, gives the binary phase-aware Pauli row representation. The current batch-15 label-quotient and commutator supplier bodies are listed in the Facts & Assumptions above; this draft does not claim their independent acceptance.

Depends on

Used by

Cited to discharge well-definedness by Stabilizer subgroup.

Dependency tree · two levels

43 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