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

Pauli product and adjoint

Statement

For k,k′∈Z/4Z and x,z,x′,z′∈F2n, with P(k,x,z)=ikXxZz and XxZz ordered as written,

P(k,x,z)P(k′,x′,z′)=P(k+k′+2(z⋅x′),x+x′,z+z′),

where the dot product is first evaluated in F2 as 0 or 1, and then multiplied by 2 in Z/4Z. The set Pn is a group. If p∈{0,1} represents x⋅z∈F2, then P(k,x,z)∗=P(2p−k,x,z)=P(k,x,z)−1, and its center is Zn={ikI:k∈Z/4Z}.

Facts & Assumptions

Given: n>=1, the ordered register, and the phase-aware Pauli convention.

[F1]

Pauli matrix algebra and trace identities: X and Z are Hermitian involutions and ZX=-XZ.

[F2]

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

[F3]

Ordered tensor registers, their inner product, and wire permutations: the tensor factors and product basis have a fixed order.

Proof

1.1givenF1F2F3algebra

On one factor, ZzjXxj′=(−1)zjxj′Xxj′Zzj, since the factors commute unless both exponents are 1, when ZX=−XZ by [F1]. Multiplying these identities over the ordered factors gives ZzXx′=(−1)pXx′Zz, where p is the integer representative 0 or 1 of z⋅x′∈F2.

2.1givenstep 1.1algebra

Substituting that reordering into ik+k′XxZzXx′Zz′ gives ik+k′+2pXx+x′Zz+z′, which is exactly the stated product formula; all binary exponents add modulo 2, while the phase exponent adds modulo 4.

3.1givenstep 2.1algebra

The formula proves closure. P(0,0,0)=I is an identity, and associativity is inherited from matrix multiplication, so Pn is a group once inverses are supplied below.

3.2givenF1F2step 2.1algebra

Taking the adjoint reverses the order and conjugates ik: (ikXxZz)∗=i−kZzXx=i−k(−1)pXxZz=P(2p−k,x,z), where p represents x⋅z. The product formula then gives P∗P=PP∗=I, so this adjoint is the inverse and completes the group proof.

4.1givenF1step 2.1algebra∎

Scalar operators ikI commute with every matrix and belong to Pn. Conversely, if P(k,x,z) commutes with every Xj, the product law forces zj=0 for each j; commuting with every Zj forces xj=0 for each j. Thus every central element is scalar and the center is exactly Zn.

Depends on

Used by

Cited to discharge well-definedness by Phase aware n qubit pauli group.

Dependency tree · two levels

31 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