Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

Finite-graph U(1) phases for matrix kernels

Definition

Let X and E be finite sets, let s,t:E→X give the source and target of each directed edge, and assume X≠∅. Fix a positive integer r, a matrix Te∈Mr(C) for each e∈E, and an external link phase ζe∈U(1):={z∈C:∣z∣=1}. The finite spin space is HX:=⨁x∈XCr, of dimension d=r∣X∣.

For a real vertex phase θ=(θx)x∈X∈RX, define ζeθ:=ei(θs(e)−θt(e))ζe,Dθ:=diag⁡x∈X(eiθxIr)∈GLd(C). Define the link-hopping matrix V(ζ)∈Md(C) by its x,y block indexed by x,y∈X V(ζ)xy:=∑e∈Es(e)=x, t(e)=yTeζe. An empty sum is the zero r×r matrix. Additional fixed diagonal blocks belong to a separate base matrix. These data are finite-dimensional algebraic data; the phases are external parameters, not rotor multiplication operators on L2(TE).

The graph action uses the dimensionless phase angle θ as an independent external parameter. It does not choose an embedding of G=(X,E,s,t) into spacetime or assert a continuum limit.

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources