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.

Coherence and stabilizers of finite background gauge 2-groupoids

Statement

For every finite ordered simplicial complex and finite data (G,A,ρ,β) in the background gauge 2-groupoid definition, its displayed operations define a finite 2-groupoid, including the relative version for every subcomplex and fixed boundary field. Its raw 1-arrows are not identified by their effects on background objects. For x=(a,B),

π2(B(K),x)=ker⁡(δa:C0(K;A)→C1(K;A)).

If Sx is the finite set of raw 1-automorphisms at x, each 2-isomorphism class in Sx has ∣im⁡δa∣ elements, and

∣π1(B(K),x)∣=∣Sx∣/∣im⁡δa∣.

The same assertions hold relatively, using vertex and edge cochains vanishing on the subcomplex. On a single vertex, π1=G and π2=A, with associator determined by β.

Facts & Assumptions

Given: the finite cochain data and operations in the Statement.

[F1]

Finite background gauge 2-groupoid supplies the raw arrows, vertex 2-cochains, composition correction τ, associator σ, and D=0.

[F2]

Finite 2-group background gauge consistency proves background preservation, the exact raw pairwise composition formula and the displayed reverse parameter. Its triangle calculation expands into six exact cocycle identities.

Proof

1.1givenF1algebra

For a vertex cochain, (δb2t)ijk=ρbijρbjktk−ρbijtj−ρbiktk+ti+ρbijtj−ti=0 by flatness. Hence adding δbt to an edge parameter preserves its target background. Addition, zero and negation give each hom-category its composition, identity and inverses. For horizontal composition, cijhj=hibij gives δc(ρht)=ρhδbt, so changing the two input parameters by δbt,δcs changes their composite by δc(ρht+s). This proves that horizontal composition is a functor; its preservation of vertical sums and interchange follow from additivity.

1.2givenF1algebra

For three consecutive arrows with vertex labels g,h,k, write a,b,c,d for their edge backgrounds and L=((k∘h)∘g), R=k∘(h∘g). Set σi=β(ki,hi,gi). Expanding the four τ terms gives λL−λR=τ(k,h;b)+τ(kh,g;a)−ρkτ(h,g;a)−τ(k,hg;a). On an edge ij, this difference plus ρdijσj−σi is exactly −D(ki,hi,gi,aij)+D(ki,hi,bij,gj)−D(ki,cij,hj,gj)+D(dij,kj,hj,gj): substitution of the five-term definition of D cancels mixed products using bijgj=giaij, cijhj=hibij, and dijkj=kicij. All four terms vanish. Thus λR−λL=δdσ, exactly the required associator 2-arrow.

1.3givenF1algebra

The associator's vertex cochain depends only on the vertex labels, so its naturality reduces to commuting additions of A-cochains. For four consecutive arrows g,h,k,l, the difference of the two pentagon path labels at vertex i is ρliβ(ki,hi,gi)−β(liki,hi,gi)+β(li,kihi,gi)−β(li,ki,higi)+β(li,ki,hi)=D(li,ki,hi,gi)=0. Normalization makes every composition correction with an identity arrow zero and every associator containing one identity label zero. Thus the units are strict and the triangle identity holds.

1.4givenF1F2algebra

Given f=(g,λ):x→y, choose the reverse r=(g−1,μ) from [F2]; its composite r∘f is the identity raw pair at x. Write η for the edge label of f∘r, whose vertex labels are identities at y. Substituting (g,g−1,g) into the associator identity gives η=−δbβ(gi,gi−1,gi), since the left composite ((f∘r)∘f) has edge label η+λ and the right composite f∘(r∘f) has edge label λ. The vertex cochain β(gi,gi−1,gi) therefore gives a 2-isomorphism f∘r⇒idy. All 1-arrows are equivalences. Restricting operations to a subcomplex commutes with every formula. For relative arrows, identity boundary vertex labels and zero boundary edge labels force all corrections and associators there to vanish, so relative arrows and their reverses remain relative. Finite label sets prove finiteness.

1.5givenF1algebra

A 2-automorphism of the identity 1-arrow is exactly a vertex cochain with δat=0. For fixed vertex labels of a raw automorphism, 2-isomorphism identifies exactly its edge parameters differing by an element of im⁡δa; these translations act freely on parameters. Consequently each class has that image's order and the asserted quotient count follows. At a single vertex there are no edge parameters and no differentials: raw 1-labels are G, each has A as its 2-automorphisms, and different G-labels have no 2-arrows between them. Thus π1=G and π2=A. The same kernel/image argument applies to relative cochains.

2.1step 1.1step 1.2step 1.3step 1.4step 1.5∎

The hom-category, composition, associator, unit and equivalence checks above establish all the specified 2-groupoid axioms. The kernel/image counts establish the claimed stabilizers, including the single-vertex and relative cases.

Depends on

Dependency tree · 2 levels

Sources