Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-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 gauge consistency

Statement

Let K be a finite ordered simplicial complex; let G be a finite group, A a finite abelian group written additively, ρ:G→Aut⁡(A) a left action, and β:G3→A a normalized group 3-cocycle with the convention that its associator is directed from (gh)k to g(hk). Let aij∈G be flat on every ordered triangle, let Bijk∈A be an A-valued 2-cochain at the first vertex, and assume on every ordered tetrahedron that

ρaijBjkl−Bikl+Bijl−Bijk=β(aij,ajk,akl).

For arbitrary vertex labels gi∈G and edge labels λij∈A, put aij′=giaijgj−1 and

ζijk=−β(gi,aij,ajk)+β(aij′,gj,ajk)−β(aij′,ajk′,gk). Bijk′=ρgiBijk+ζijk+ρaij′λjk−λik+λij.

Then a′ is flat and (a′,B′) satisfies the same twisted tetrahedron equation. If (g,λ) is followed by (h,μ), with aij′′=hiaij′hj−1, their composite is (hg,ν) where

νij=β(hi,gi,aij)+ρhiλij−β(hi,aij′,gj)+μij+β(aij′′,hj,gj).

Each transformation is invertible: for a fixed source background, put hi=gi−1 and

μij=−β(hi,gi,aij)−ρhiλij+β(hi,aij′,gj)−β(aij,hj,gj);

then its composite has νij=0. Treating a gauge arrow as its induced map on background cochains, sequential maps compose associatively, and the displayed formula gives a representative for each composite. This is a mathematical consistency result and does not assert a physical anomaly theorem.

Facts & Assumptions

Given: finite data G,A,ρ,β,K, a flat edge cochain a, a 2-cochain B satisfying the displayed tetrahedron equation, and vertex/edge gauge parameters gi,λij as in the Statement.

[F1]

Finite 2-group background cochains: a flat edge cochain satisfies aijajk=aik, local coefficient transport from j to i is ρ(aij), and the twisted differential on a 2-cochain is ρ(aij)Bjkl−Bikl+Bijl−Bijk.

[F2]

Finite 2-group background cochains: the skeletal 2-group tensor product is (g,u)⊗(h,v)=(gh,u+ρgv), its associator has label β(g,h,k), and the normalized 3-cocycle identity is the associator pentagon equation.

Proof

1.1givenF1algebra

Flatness of a gives aij′ajk′=giaijgj−1gjajkgk−1=giaikgk−1=aik′, so a′ is flat and ρ(aij′) defines its local coefficient transport.

1.2F2givenconstructalgebra

For consecutive transformations (g,λ) and (h,μ), start with the edge product (higi)aij. The successive associator/edge-morphism labels along (higi)aij→hi(giaij)→hi(aij′gj)→(hiaij′)gj→(aij′′hj)gj→aij′′(hjgj) are β(hi,gi,aij), ρhiλij, −β(hi,aij′,gj), μij, and β(aij′′,hj,gj), respectively; adding them gives exactly νij in the Statement.

2.1F1step 1.1algebra

For an edge cochain λ, expanding δa′2λ on [ijkl] gives terms ρ(aij′)ρ(ajk′)λkl−ρ(aij′)λjl+ρ(aij′)λjk−ρ(aik′)λkl+λil−λik+ρ(aij′)λjl−λil+λij−ρ(aij′)λjk+λik−λij; the first and fourth cancel because a′ is flat and ρ is an action, and every other term cancels with its displayed opposite. Hence the 1-form shift contributes zero to the transformed tetrahedron equation.

2.2F2step 1.1algebra

Write u=a01′, v=a12′, w=a23′, x=a01, y=a12, and z=a23. Expanding δa′ζ using the three displayed terms in each ζijk and applying the five-term cocycle identity to the four ordered quadruples (g0,x,y,z), (u,g1,y,z), (u,v,g2,z), and (u,v,w,g3) yields (δa′ζ)0123+ρg0β(x,y,z)−β(u,v,w)=D(g0,x,y,z)−D(u,g1,y,z)+D(u,v,g2,z)−D(u,v,w,g3)=0, where D(s,t,r,q):=ρsβ(t,r,q)−β(st,r,q)+β(s,tr,q)−β(s,t,rq)+β(s,t,r). The cancellation uses flatness and aij′gj=giaij to identify the adjacent products. Hence δa′ζ=β(a01′,a12′,a23′)−ρg0β(a01,a12,a23) on each tetrahedron.

2.3F2step 1.2algebra

Let τij=β(hi,gi,aij)−β(hi,aij′,gj)+β(aij′′,hj,gj) be the β part of ν. The sequential and direct face formulas agree exactly when ρhiζijkg+ζijkh(a′)−ζijkhg(a)=(δa′′τ)ijk, where (δa′′τ)ijk=ρaij′′τjk−τik+τij. For a fixed ordered triangle i<j<k, write x=aij, y=ajk, brs=ars′, and crs=ars′′. For the cocycle expression D, direct expansion gives the exact formal identity ρhiζijkg+ζijkh(a′)−ζijkhg(a)−(δcτ)ijk=−D(hi,gi,x,y)+D(hi,bij,gj,y)−D(hi,bij,bjk,gk)−D(cij,hj,gj,y)+D(cij,hj,bjk,gk)−D(cij,cjk,hk,gk). To verify it, substitute D(s,t,r,q)=ρsβ(t,r,q)−β(st,r,q)+β(s,tr,q)−β(s,t,rq)+β(s,t,r) in these six terms, use bijgj=giaij and cijhj=hibij to identify mixed products, and use aik=aijajk, bik=bijbjk, cik=cijcjk to identify long edges. The remaining terms are precisely the three ζ expressions and the three terms of −δcτ on the left; every other beta term cancels with its opposite. All six D terms vanish by [F2]. In full, Bseq=ρhgB+ρhζg+ζh+δa′′(ρhλ+μ) and Bdirect=ρhgB+ζhg+δa′′(ρhλ+μ+τ), so the displayed identity proves equality on every triangle.

2.4F1F2step 1.2algebra

For a fixed source background, set hi=gi−1 and choose μij by the displayed reverse formula. Substitution into the composite law cancels its five terms and gives higi=e, νij=0, and a′′=a. The identity transformation fixes B because β is normalized and ρe=id⁡A.

3.1givenF1F2step 2.1step 2.2algebra

The coefficient transport identity ρ(aij′)ρ(gj)=ρ(gi)ρ(aij) gives (δa′(ρgB))ijkl=ρgi(δaB)ijkl. Combining this with B′=ρgB+ζ+δa′λ, steps 2.1–2.2, and δaB=a∗β gives δa′B′=ρgiβ(aij,ajk,akl)+β(aij′,ajk′,akl′)−ρgiβ(aij,ajk,akl)=a′∗β.

4.1F1F2step 1.2step 2.4algebra∎

To check the opposite composite on the target (b,C)=(a′,B′), first apply (h,μ) and then (g,λ). Its 0-form labels are gihi=e. For a fixed edge ij, write x=aij, u=gi, v=gj, and b=bij=uxv−1; substituting the reverse formula for μij in the composite law gives νijop=β(u,u−1,b)−ρuβ(u−1,u,x)+ρuβ(u−1,b,v)−ρuβ(x,v−1,v)−β(u,x,v−1)+β(b,v,v−1). Set σi=β(gi,gi−1,gi) and σj=β(gj,gj−1,gj). The identities D=0 on (u,u−1,u,x), (u,u−1,b,v), (u,x,v−1,v) and (b,v,v−1,v), with normalization of β, give respectively ρuβ(u−1,u,x)=β(u,u−1,ux)−σi, ρuβ(u−1,b,v)=−β(u,xv−1,v)+β(u,u−1,ux)−β(u,u−1,b), ρuβ(x,v−1,v)=β(ux,v−1,v)−β(u,xv−1,v)−β(u,x,v−1), and ρbσj=β(bv,v−1,v)−β(b,v,v−1). Substituting the first two identities into the first three terms of νijop gives σi−β(u,xv−1,v); the third identity then combines all remaining terms involving u into −β(ux,v−1,v), and the fourth gives νijop=σi−ρbσj=−(δbσ)ij, since bv=ux. The composite has identity vertex labels, so normalization gives ζe=0 and its B-shift is δbνop=−δb2σ=0: explicitly, on i<j<k, flatness of b and the action law give ρbij(ρbjkσk−σj)−(ρbikσk−σi)+(ρbijσj−σi)=0. Thus the opposite composite also induces the identity on background cochains. Each gauge arrow therefore has a two-sided inverse, while sequential induced maps compose associatively as ordinary function composition.

Depends on

Dependency tree · 1 level

Sources