Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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 SU(2) graph holonomy model

Definition

A finite oriented graph consists of finite vertex and edge sets V,E, source and target maps s,t:E→V, and a fixed-point-free involution e↦eˉ with s(eˉ)=t(e) and t(eˉ)=s(e). A finite SU(2) graph configuration assigns ge∈SU(2) to every oriented edge and requires geˉ=ge−1. A graph path is a finite composable edge word e1,…,en; its holonomy is the later-left product gen⋯ge1, and the empty path has holonomy I2.

A vertex gauge assignment is a function h:V→SU(2). It acts on edge variables by

ge⟼ge′=ht(e)gehs(e)−1.

A finite-dimensional unitary representation is a group homomorphism ρ:SU(2)→U(W) on a finite-dimensional complex inner-product space W that is strongly continuous, meaning g↦ρ(g)w is continuous for each w∈W. Here

U(W):={T∈GL⁡(W):⟨Tv,Tw⟩=⟨v,w⟩ for all v,w∈W},

with the operator-norm topology inherited from End⁡(W). In finite dimension, strong continuity is equivalent to continuity in this operator norm.

For a closed graph path ℓ=(e1,…,en), the associated Wilson trace is the basis-independent trace of the endomorphism of W given by

Tr⁡(ρ(gen)⋯ρ(ge1)).

Here the trace of a finite-dimensional endomorphism is the trace of its matrix in any basis.

Remarks

This definition is a finite graph configuration model. An SU(2) graph is not obtained from a Lorentz connection without an additional reduction choice. This item makes no continuum-limit, Hamiltonian-constraint, physical-Hilbert-space, or empirical-observable claim.

Depends on

Dependency tree · 2 levels

Sources