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 flat connection groupoid on a cell complex
Definition
Let be a finite connected CW complex and a finite group. Choose an orientation of each 1-cell and, for each 2-cell, its based attaching word in the finite edge presentation of ; the choice of base paths is part of that presentation. A flat edge assignment is a label for every oriented 1-cell with , such that each attaching word has holonomy . If a word traverses edges in that order with exponents , its holonomy is .
Write for the finite set of flat assignments and for the vertices. The finite vertex gauge group acts by
where and are the source and target vertices. The finite flat connection groupoid is the action groupoid : its objects are flat assignments and its arrows are the with . Its untwisted finite BF partition function is the groupoid cardinality
This is a finite combinatorial model; it has no continuous Lie-algebra-valued connection integral or additional cocycle phase.
For a finite disconnected CW complex, define to be the product of the groupoids of its connected components; for the empty complex use the terminal groupoid.
Definition references
Facts & Assumptions
Given: A finite connected CW complex , its finite edge-and-2-cell presentation, and a finite group .
Finite groupoid cardinality and homotopy-fiber integration: a finite action groupoid has cardinality , and its invariant-function integrals are finite.
A finite connected CW complex has the edge-and-2-cell presentation: the oriented non-tree edges generate and the 2-cell attaching words give its relators; cells of dimension at least three do not change this presentation.
Proof
Reversing an edge replaces by , and the gauge formula sends the reverse label to . For a closed attaching word based at a vertex , the transformed holonomy is . Thus the inverse-edge rule and the flatness equations are preserved by every vertex gauge transformation.
For , applying and then sends an edge label to . The identity vertex labeling acts as the identity, so this is a group action and its action groupoid has the composition and inverses stated in the Definition.
There are at most edge assignments and exactly gauge transformations, so the action groupoid is finite. Products over the finitely many connected components are finite groupoids as well; the empty product is terminal. By [F1], the connected groupoid cardinality is the orbit sum of reciprocal stabilizer sizes.
For an orbit represented by , the map , , is a bijection: equality of images is equivalent to . Hence . Summing over the disjoint orbits gives the final ratio in the Definition.
Depends on
Dependency tree · 2 levels
Sources
- Gregory W. Moore and Vivek Saxena, TASI Lectures on Topological Field Theories and Differential Cohomology
- Daniel S. Freed and Frank Quinn, Chern-Simons Theory with Finite Gauge Group
- Robbert Dijkgraaf and Edward Witten, Topological Gauge Theories and Group Cohomology
- John C. Baez, An Introduction to Spin Foam Models of BF Theory and Quantum Gravity