Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge 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 2-group background cochains

Definition

Let G be a finite group with identity e, let A be a finite abelian group written additively, and let ρ:G→Aut⁡(A) be a left action, so ρgh=ρgρh and ρe=id⁡A. A group 2-cochain is a function c:G2→A; it is normalized when it vanishes if either input is e. Its coboundary is

(δρc)(g,h,k)=ρgc(h,k)−c(gh,k)+c(g,hk)−c(g,h).

A normalized group 3-cocycle is a function β:G3→A that vanishes whenever any argument is e and satisfies

ρgβ(h,k,l)−β(gh,k,l)+β(g,hk,l)−β(g,h,kl)+β(g,h,k)=0

for all g,h,k,l∈G. Two normalized 3-cocycles represent the same class when their difference is δρc for a normalized 2-cochain c; this is an equivalence relation by additivity of δρ. The class [β] is the Postnikov class in this skeletal model.

The corresponding skeletal categorical 2-group has objects g∈G and, for each g, one automorphism labelled by each u∈A; there are no morphisms between distinct objects. Composition of automorphisms adds their labels, tensor product is

(g,u)⊗(h,v)=(gh,u+ρgv),

and the associator from (gh)k to g(hk) has label β(g,h,k). The two pentagon path labels are β(gh,k,l)+β(g,h,kl) and ρgβ(h,k,l)+β(g,hk,l)+β(g,h,k); equality of these labels is exactly the displayed 3-cocycle equation.

A finite ordered simplicial complex K is a finite vertex set with a total order and a collection of nonempty finite vertex subsets, called simplices, closed under taking nonempty subsets. Write each simplex in increasing order. A q-cochain with values in a local coefficient system assigns an element to each ordered q-simplex at its first vertex. A flat G-valued edge cochain is a family aij∈G for each edge i<j such that aijajk=aik on every triangle. It defines the local coefficient system with fiber A at each vertex and transport ρaij from vertex j to vertex i.

For each integer q≥0 and local-coefficient q-cochain c, define the twisted coboundary on each ordered (q+1)-simplex by

(δac)i0…iq+1=ρai0i1ci1…iq+1+∑r=1q+1(−1)rci0…ir^…iq+1.

In particular, for an A-valued 2-cochain B,

(δaB)ijkl=ρaijBjkl−Bikl+Bijl−Bijk,(a∗β)ijkl=β(aij,ajk,akl).

A finite 2-group background on K is a flat edge cochain a and an A-valued 2-cochain B satisfying δaB=a∗β on every ordered tetrahedron. This fixes the cochain representative, local coefficient action, and sign convention.

A 1-gauge transformation consists of vertex labels gi∈G and edge labels λij∈A at vertex i. Define

aijg=giaijgj−1, ζijkg=−β(gi,aij,ajk)+β(aijg,gj,ajk)−β(aijg,ajkg,gk), Bijkg,λ=ρgiBijk+ζijkg+(δagλ)ijk,(δagλ)ijk=ρaijgλjk−λik+λij.

Changing the chosen representative to β′=β+δρc for a normalized 2-cochain c and simultaneously replacing B by B+a∗c changes the cochain presentation but preserves the background equation: on every tetrahedron, flatness gives

(δa(a∗c))ijkl=ρaijc(ajk,akl)−c(aik,akl)+c(aij,ajl)−c(aij,ajk)=(δρc)(aij,ajk,akl).

This finite mathematical model makes no assertion that a physical theory realizes the symmetry or has an anomaly.

Dependency tree · 0 levels

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

Sources