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 homotopy gauging and cochain gluing
Statement
Fix a finite group , finite abelian group , action , normalized -cocycle , and a finite ordered simplicial complex . Let be the full background gauge -groupoid, retaining its vertex -gauge transformations, and let be constant on -arrows. Let be the numbers of vertices and edges and define
Then its higher gauging sum satisfies
For any subcomplex and fixed field on , the higher sum over the relative -groupoid is
In particular let , where the intersection is the subcomplex and all orders are induced. Assume invariant weights and obey . Put . These boundary functions are invariant on -arrows of and obey the actual finite -group gluing law
The empty complex has and one empty field. For a point and unit weight the sum is . When is trivial these formulas reduce to ordinary finite flat -connection normalization. The theorem assumes scalar invariant weights and their stated factorization; it does not assert that an arbitrary higher cocycle defines such boundary scalar data.
Statement references
Facts & Assumptions
Given: the finite data, invariant weights, subcomplexes and factorization hypothesis in the Statement.
Finite background groupoid and cocycle-weighted gauging data defines higher integration with and exact relative fields.
Finite background gauge 2-groupoid gives all objects, raw gauge parameters, affine composition and relative arrow conditions.
Coherence and stabilizers of finite background gauge 2-groupoids proves the -groupoid laws, reverses and kernel/image stabilizer formulas.
Proof
Fix and let be its raw -automorphism set. By [F3], and . Since is a homomorphism of finite abelian groups, its image has order . Hence . For relative cochains the identical argument replaces by .
There are raw gauge parameters with source , each having a target by [F3]. For any target in the component of , fix a raw arrow . Composition identifies raw automorphisms at bijectively with raw arrows : its vertex equation uniquely solves for the vertex labels of , and its edge equation uniquely solves for its edge labels since the coefficient of each is the automorphism . The solved vertex labels fix because both resulting arrows have target edge labels of . The solved edge labels fix because is affine with invertible linear coefficient on , and already sends to . Thus the solved parameter is indeed in . Therefore each target has arrows from , and this component has objects. The same argument is relative: compositions and inverses retain identity/zero boundary labels and the parameter count is .
Every fixed raw parameter acts bijectively on all background objects: the edge formula determines the original edge labels uniquely and the face formula is affine in with invertible coefficient . The source-wise reverse from [F3] shows the inverse preserves the background constraints. A boundary parameter on extends to a raw bulk parameter by identity labels on other vertices and zero labels on other edges. This bijection carries the set of extensions of to that of its transformed boundary field and preserves . Thus relative extension sums, and hence their normalized versions, are invariant under boundary -arrows.
Local equations identify a field on with exactly a pair of fields agreeing on : each simplex lies in one of the subcomplexes, so assignments glue uniquely and all flatness and tetrahedron equations remain valid. Vertex and edge counts satisfy inclusion-exclusion, so .
On each component the weight is constant. Its higher mass by step 1.1 is , while its unnormalized object sum has terms by step 1.2. Their ratio is . Summing gives the absolute formula. Relatively the ratio is , including empty extension sets. This proves the relative formula and, with step 1.3, boundary invariance.
By step 2.1, the object-sum form of the proposed boundary integral is . Substituting the two relative formulas gives times . Step 1.4 and weight factorization identify this with . Applying the absolute formula on to the invariant product converts its object sum to the stated boundary sum. The formula for complex-valued invariant products follows from the same component counting, which uses only constancy and finite addition, not unit modulus.
The empty and point cases follow by inserting their vertex/edge counts and object sets. If is trivial, the only -gauge labels are zero and , yielding ordinary finite flat-connection normalization. The finite sums, relative formula, invariance and gluing identity have all been established under precisely the stated weight hypotheses.