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 background gauge 2-groupoid

Definition

Fix a finite ordered simplicial complex K, a finite group G, a finite abelian group A in additive notation, a left action ρ:G→Aut⁡(A), and a normalized inhomogeneous 3-cocycle β:G3→A. A background x=(a,B) has flat edge labels aijajk=aik and satisfies δaB=a∗β, with coefficients at the first vertex. Here (δat)ij=ρaijtj−ti for a vertex cochain, (δaλ)ijk=ρaijλjk−λik+λij for an edge cochain, and (δaB)ijkl=ρaijBjkl−Bikl+Bijl−Bijk. The cocycle convention is

D(s,t,r,q):=ρsβ(t,r,q)−β(st,r,q)+β(s,tr,q)−β(s,t,rq)+β(s,t,r)=0.

The background gauge 2-groupoid B(K) has these backgrounds as objects. A 1-arrow f:x→y is a raw pair (g,λ) of vertex G-labels and edge A-labels with target y=(b,C) given by

bij=giaijgj−1,ζijkg(a)=−β(gi,aij,ajk)+β(bij,gj,ajk)−β(bij,bjk,gk),C=ρgB+ζg(a)+δbλ.

Raw pairs remain distinct even when their induced functions on backgrounds coincide. For fixed g and target edge labels b, a 2-arrow t:(g,λ)⇒(g,λ′) is a vertex A-cochain satisfying λ′−λ=δbt. There are no 2-arrows between different vertex labels g. Vertical composition adds vertex cochains; the identity 2-arrow is zero.

For consecutive 1-arrows (g,λ):x→y and (h,μ):y→z, write a,b,c for the successive edge labels. Their composite is (hg,ν), where

νij=ρhiλij+μij+τ(h,g;a)ij,τ(h,g;a)ij=β(hi,gi,aij)−β(hi,bij,gj)+β(cij,hj,gj).

Horizontal composition of t on the first arrow and s on the second is s+ρht. Identity 1-arrows have all vertex labels e and edge labels zero. For three consecutive arrows g,h,k, the associator from ((k∘h)∘g) to k∘(h∘g) is the vertex cochain σi=β(ki,hi,gi). Unit constraints are identity 2-arrows.

A 2-groupoid here means these data form a bicategory: each pair of objects has a category of 1-arrows and 2-arrows; horizontal composition preserves identities and vertical composition; associators are natural and obey the pentagon; units obey the triangle identity; all 2-arrows are invertible and every 1-arrow has a reverse up to invertible 2-arrows. Finiteness means all three sets of labels are finite. Coherence of the displayed data is a separate theorem.

Write π0B(K) for the equivalence classes of objects under 1-arrows. For an object x, let π1(B(K),x) be the group of 2-isomorphism classes of 1-automorphisms of x, and let π2(B(K),x) be the abelian group of 2-automorphisms of its identity 1-arrow. In particular, π2 retains vertex cochains with δat=0 rather than discarding them. For a subcomplex L⊆K and fixed background s on L, the relative background 2-groupoid has objects restricting exactly to s, 1-arrows with g=e on vertices of L and λ=0 on edges of L, and 2-arrows with t=0 on vertices of L.

Depends on

Dependency tree · 1 level

Sources