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

Finite non-Abelian lattice gauge data

Definition

Assume the axiom of countable choice ACω. Fix the compact noncommutative finite-dimensional real Lie group G supplied by the earlier non-Abelian gauge-data definition. Its Lie algebra is g=TeG, with bracket induced by left-invariant smooth vector fields. Fix also a finite-dimensional complex vector space W, a positive-definite Hermitian form h on W, and a specified smooth group homomorphism ρ:G→U(W,h), where U(W,h) is the group of invertible complex-linear maps preserving h. Thus multiplication and inversion on G are smooth, G is compact in its manifold topology, and every ρ(g) preserves h. Every finite power GS below has the product smooth-manifold structure, with charts given by products of charts of G; for S=∅, set GS={()} with its one-point smooth structure. No connection, principal bundle sector, action functional, or continuum theory is part of the lattice data below.

A finite oriented lattice two-complex is a finite set V of vertices, a finite set E+ containing one chosen orientation of each edge, an endpoint map s,t:E+→V, and a finite set F of faces. Each face p∈F is supplied with a based closed edge word (e1,…,ek) in the oriented edges E+⊔E+‾, where the endpoint of each edge is the starting point of the next and the last endpoint is the first starting point. For the reverse orientation eˉ of e∈E+, set s(eˉ)=t(e) and t(eˉ)=s(e).

A link configuration is a tuple U=(Ue)e∈E+∈GE+, with Ueˉ:=Ue−1. The holonomy of a face p=(e1,…,ek) is the ordered product Up:=Ue1⋯Uek in traversal order, with the first traversed edge on the left. The vertex gauge group is GV with coordinatewise multiplication; write e=(e)v∈V for its identity tuple. It acts by

(h⋅U)e=hs(e)Ueht(e)−1,h=(hv)v∈V∈GV.

Choose a normalized bi-invariant finite Radon Borel probability measure μG on G; explicitly, μG(G)=1 and μG(gA)=μG(Ag)=μG(A) for every g∈G and Borel A⊆G. The link measure is the finite product μGE+; for E+=∅, this is the unit point mass on G∅={()}. Empty sums are zero. For each face choose a continuous dimensionless function Φp:G→R satisfying Φp(gzg−1)=Φp(z) and Φp(z−1)=Φp(z). Define the dimensionless lattice action and its normalized expectation by

SΛ(U):=∑p∈FΦp(Up),ZΛ:=∫GE+e−SΛ(U) dμGE+(U),⟨O⟩Λ:=ZΛ−1∫GE+O(U)e−SΛ(U) dμGE+(U)

for bounded measurable O:GE+→C. The finite-volume Gauss sector is the closed subspace of L2(GE+,PΛ) consisting of measurable functions with finite integral of ∣f∣2, modulo equality PΛ-almost everywhere, whose equivalence classes are invariant under each element of GV. Here PΛ is the normalized probability with density ZΛ−1e−SΛ relative to product link measure. For v∈V and X∈g, let X(v) be the tangent vector at the identity of GV with component X at v and zero at other vertices. If α(h,U)=h⋅U, define the infinitesimal Gauss generator on C∞(GE+) by

(Dv,Xf)(U):=dfU ⁣(dα(e,U)(X(v),0)).

The full Gauss sector uses invariance under every vertex gauge transformation; the infinitesimal equations Dv,Xf=0 alone are not asserted to impose invariance under disconnected components of G. Link variables and the action are dimensionless. This finite mathematical regulator makes no continuum-limit or empirical claim.

Definition references

Depends on

Dependency tree · 2 levels

Sources