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 be a finite ordered simplicial complex; let be a finite group, a finite abelian group written additively, a left action, and a normalized group -cocycle with the convention that its associator is directed from to . Let be flat on every ordered triangle, let be an -valued -cochain at the first vertex, and assume on every ordered tetrahedron that
For arbitrary vertex labels and edge labels , put and
Then is flat and satisfies the same twisted tetrahedron equation. If is followed by , with , their composite is where
Each transformation is invertible: for a fixed source background, put and
then its composite has . 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.
Statement references
Facts & Assumptions
Given: finite data , a flat edge cochain , a -cochain satisfying the displayed tetrahedron equation, and vertex/edge gauge parameters as in the Statement.
Finite 2-group background cochains: a flat edge cochain satisfies , local coefficient transport from to is , and the twisted differential on a -cochain is .
Finite 2-group background cochains: the skeletal -group tensor product is , its associator has label , and the normalized -cocycle identity is the associator pentagon equation.
Proof
Flatness of gives , so is flat and defines its local coefficient transport.
For consecutive transformations and , start with the edge product . The successive associator/edge-morphism labels along are , , , , and , respectively; adding them gives exactly in the Statement.
For an edge cochain , expanding on gives terms ; the first and fourth cancel because is flat and is an action, and every other term cancels with its displayed opposite. Hence the -form shift contributes zero to the transformed tetrahedron equation.
Write , , , , , and . Expanding using the three displayed terms in each and applying the five-term cocycle identity to the four ordered quadruples , , , and yields , where . The cancellation uses flatness and to identify the adjacent products. Hence on each tetrahedron.
Let be the part of . The sequential and direct face formulas agree exactly when , where . For a fixed ordered triangle , write , , , and . For the cocycle expression , direct expansion gives the exact formal identity . To verify it, substitute in these six terms, use and to identify mixed products, and use , , to identify long edges. The remaining terms are precisely the three expressions and the three terms of on the left; every other beta term cancels with its opposite. All six terms vanish by [F2]. In full, and , so the displayed identity proves equality on every triangle.
For a fixed source background, set and choose by the displayed reverse formula. Substitution into the composite law cancels its five terms and gives , , and . The identity transformation fixes because is normalized and .
The coefficient transport identity gives . Combining this with , steps 2.1–2.2, and gives .
To check the opposite composite on the target , first apply and then . Its -form labels are . For a fixed edge , write , , , and ; substituting the reverse formula for in the composite law gives . Set and . The identities on , , and , with normalization of , give respectively , , , and . Substituting the first two identities into the first three terms of gives ; the third identity then combines all remaining terms involving into , and the fourth gives , since . The composite has identity vertex labels, so normalization gives and its -shift is : explicitly, on , flatness of and the action law give . 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.