Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Exact single-qubit Clifford+T ring characterization

Statement

A matrix U∈U(2) is exactly the matrix of a finite one-qubit Clifford+T word if and only if all four entries of U lie in D. This is a single-qubit statement; no multi-qubit exact ring characterization is asserted.

Facts & Assumptions

Given: The exact circuit matrices and matrix-product convention of the gate-library and circuit-semantics definitions.

[F1]

Clifford+T circuit entries lie in the dyadic cyclotomic ring: every finite Clifford+T circuit matrix has entries in D.

[F2]

Normal form of a single-qubit ring unitary: a ring-entry unitary has first column (u,v)T and determinant phase ωj, with second column ωj(−vˉ,uˉ)T.

[F3]

Clifford+T denominator descent and finite base table: every normalized ring column reduces by an HT−k step from squared-entry exponent s>3 to s−1, and every column with s≤3 has an exact H/T preparation word.

[F4]

Unit-modulus elements of the dyadic cyclotomic ring: the elements z∈D satisfying zzˉ=1 are exactly ωj.

Proof

1.1F1given

If U is a finite Clifford+T circuit matrix, [F1] puts all its entries in D.

1.2F2F3givenconstruct

Conversely, let U∈U(2) have entries in D. By [F2] its first column (u,v)T is a normalized column. Apply the descent in [F3] repeatedly while s=sde⁡(∣u∣2)>3. Each step replaces the current matrix M by HT−kM and decreases the nonnegative integer s by exactly one; hence after finitely many steps the first column lies in the base regime.

2.1F1F3F4step 1.2algebra

By [F3], the base column has a word W0 with W0∣0⟩=(u0,v0)T. Reversing each descent step by prepending its recorded TkH gives a word W with first column equal to the original (u,v)T. The unitary W∗U has first column (1,0)T, so orthogonality of its columns makes it diag⁡(1,λ) for a unit scalar λ. Its entries lie in D, since W,U have entries in that ring. Therefore [F4] gives λ=ωj, and U=WTj is a finite Clifford+T word.

3.1step 1.1step 2.1∎

Both implications are proved. The proof constructs the converse word with only exact coefficient operations and the finite base lookup; no approximation, ancilla, or multi-qubit inference is used.

Unresolved supplier checks

The actual QC07 gate matrices and QC09 circuit-semantics body were inspected; their exact matrix and chronological word interfaces agree with the local proof. The theorem remains limited to one qubit; no multi-qubit ring characterization is inferred.

Depends on

Used by

Dependency tree · two levels

20 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