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

Physical realization boundary for braid compilation

Definition

A physical realization record for a mathematical braid-compilation instance contains, in addition to its finite fusion input and braid word, all of: a specified physical state space and low-energy-sector identification; a C2 Hermitian path and constant-rank uniformly gapped projection; an initial preparation isometry and its cost; a slow-time schedule; an endpoint frame; a separately justified identification of band transport with the logical-frame Fibonacci F/R target of Finite adiabatic braid compilation input, including its phase; and a locality model for exchanges. A local-Hamiltonian model specifies a finite lattice Λ with its metric, an interaction range R, and a uniform per-site interaction bound J for a decomposition H(s)=∑X⊆ΛhX(s): every hX(s) is Hermitian and supported on X, diam⁡(X)≤R, and sup⁡s∈[0,1], x∈Λ∑X∋x∥hX(s)∥≤J. The record separately states the local-indistinguishability and stability criteria, including their region scales, norms, tolerances, and the evidence used to establish them. It also supplies explicit preparation, excitation, measurement, and control-error terms. The first spectral-path clauses are the finite interface in Physical braid implementation interface and Finite adiabatic braid compilation input. The error ledger is Finite braid compilation and adiabatic error budget. A successful SK compilation, projective density theorem, or JRS leakage estimate supplies none of the material, locality, preparation, or band-holonomy evidence by itself; those are independent record fields, not consequences of the mathematical compiler. Only terms appearing as hypotheses in the stated error ledger contribute to its measured-output bound; a separately recorded preparation, excitation, or control error requires an additional bound before it can be included in a total physical error claim.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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