Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Braid phase reference and correction ledger

Definition

For the fixed Fibonacci convention, write ρ(b) for the physical braid matrix and B(b) for the normalized word matrix obtained by removing the common exchange scalar R1 from each Artin generator, as in The braid phase is a common scalar character. If e(b) is exponent sum, then ρ(b)=R1e(b)B(b). On the three-anyon total-τ block the SK alphabet instead uses the special-unitary lifts zBj with z=e3πi/10, so a word of exponent sum k satisfies ρ(b)=(R1z−1)kB^(b),B^(b)=zkB(b). A phase reference record stores the exact generator scalar, exponent sum, which normalized convention was compiled, the resulting scalar on each coherently used branch, and any correction operation and its declared cost under Circuit-family and computation cost model. A standalone fixed-sector computation may report its output projectively using the metric of Projective braid gate and operator metric. In coherent control the active branch scalar is relative to the inactive branch and must remain in the record. No phase correction is assigned zero cost unless its interface says so. This ledger distinguishes the common R1e(b) phase from the additional z−e(b) needed when the compiled alphabet is the SU(2) lift.

Depends on

Used by

Dependency tree · two levels

25 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