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 , a finite group , a finite abelian group in additive notation, a left action , and a normalized inhomogeneous -cocycle . A background has flat edge labels and satisfies , with coefficients at the first vertex. Here for a vertex cochain, for an edge cochain, and . The cocycle convention is
The background gauge 2-groupoid has these backgrounds as objects. A -arrow is a raw pair of vertex -labels and edge -labels with target given by
Raw pairs remain distinct even when their induced functions on backgrounds coincide. For fixed and target edge labels , a -arrow is a vertex -cochain satisfying . There are no -arrows between different vertex labels . Vertical composition adds vertex cochains; the identity -arrow is zero.
For consecutive -arrows and , write for the successive edge labels. Their composite is , where
Horizontal composition of on the first arrow and on the second is . Identity -arrows have all vertex labels and edge labels zero. For three consecutive arrows , the associator from to is the vertex cochain . Unit constraints are identity -arrows.
A -groupoid here means these data form a bicategory: each pair of objects has a category of -arrows and -arrows; horizontal composition preserves identities and vertical composition; associators are natural and obey the pentagon; units obey the triangle identity; all -arrows are invertible and every -arrow has a reverse up to invertible -arrows. Finiteness means all three sets of labels are finite. Coherence of the displayed data is a separate theorem.
Write for the equivalence classes of objects under -arrows. For an object , let be the group of -isomorphism classes of -automorphisms of , and let be the abelian group of -automorphisms of its identity -arrow. In particular, retains vertex cochains with rather than discarding them. For a subcomplex and fixed background on , the relative background 2-groupoid has objects restricting exactly to , -arrows with on vertices of and on edges of , and -arrows with on vertices of .