Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge 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.

Phase gate pauli action

Statement

For a phase gate Sj=diag⁡(1,i) on factor j, the binary update is (xj,zj)↦(xj,zj+xj) and the phase update is k↦k+xj modulo 4. In particular SXS∗=Y and SZS∗=Z.

Facts & Assumptions

Given: n is a positive integer, j is a factor index, the phase-aware Pauli convention is fixed, and the register factors are ordered.

[F1]

The Pauli matrices: the explicit X,Y,Z matrices are defined in the ordered computational basis.

[F3]

Exact one-qubit gates and rotations: S=diag(1,i) and S*=diag(1,-i).

[F4]

Tensor products of finitely many linear maps and Tensor maps preserve composition, identities, and adjoints: tensor maps act factorwise and preserve composition and adjoints.

[F5]

Ordered tensor registers, their inner product, and wire permutations: the register factors have the declared order.

Proof

1.1F1F2F3algebra

Multiplying the matrices gives SXS∗=Y=iXZ and SZS∗=Z. Therefore SYS∗=i(SXS∗)(SZS∗)=iYZ=−X, using YZ=iX.

2.1F1F3F4F5step 1.1algebra∎

On factor j, SXxjZzjS∗=(iXZ)xjZzj=ixjXxjZzj+xj; other tensor factors are unchanged. Thus the total phase increases by xj modulo 4 and the binary zj coordinate increases by xj modulo 2.

Depends on

Used by

Dependency tree · two levels

37 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