Alphabeta Math
Pipeline-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.

✓ 1 result · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 1 also cleared it.

Pauli and Clifford Groups, Binary Symplectic Tableaux — Examples

1 · Prerequisites

2 · Summary

The one-qubit example checks the sign convention directly: X and Z have pairing one and anticommute, while Z and −Z share a binary label and retain distinct scalar phases.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Pauli commutator and binary symplectic sign

Example

For one qubit, the labels of X and Z have symplectic pairing 1, so the binary form records their anticommutation. The two operators Z and −Z have the same binary label but different mod-4 phases.

Facts & Assumptions

Given: one qubit and P(k,x,z)=ikXxZz.

[F1]

Pauli commutator is symplectic pairing: Pauli commutation is determined by (−1)ω.

[F2]

The Pauli matrices and Pauli matrix algebra and trace identities: X and Z are the displayed one-qubit matrices and XZ=−ZX.

Verification

1.1givenF1F2algebra

The labels are λ(X)=(1,0) and λ(Z)=(0,1). Their pairing is 1⋅1+0⋅0=1 in F2, so [F1] gives XZ=−ZX, which also follows by multiplying the matrices in [F2].

2.1givenF2algebra∎

The operators Z=P(0,0,1) and −Z=P(2,0,1) have equal binary label (0,1) and distinct scalar phases 1 and −1. Thus the label quotient records commutation but alone does not recover the exact signed Pauli.

Sources