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 BF partition function is a topological invariant
Statement
Let be a finite CW complex, possibly disconnected, and let be a finite group. Write its connected components as and choose a vertex in each. Let be the product over of the action groupoids whose objects are homomorphisms and whose arrows are elements satisfying for every loop class ; identity arrows are labeled by , and if and , then their composite is labeled by . For , this empty product is the terminal groupoid. Choosing a maximal tree in each component, inverse path holonomy defines an equivalence : for an edge path traversing with signs , its holonomy is , and sends a loop class represented by an edge loop to ; a gauge arrow maps to the conjugating arrow on component . In particular, for connected ,
and for arbitrary finite ,
The action retains all conjugation stabilizers. For a subcomplex inclusion , choose a base vertex in each component , a base vertex in its containing component , and an edge path in from to . The associated based map is . Under and , restriction corresponds to precomposition by these maps, up to the natural isomorphism whose component at a flat assignment is conjugation by . Thus the partition function depends only on the fundamental-group representation groupoid, not on the chosen finite cell decomposition.
Statement references
Facts & Assumptions
Given: A finite CW complex with connected components , a finite group , chosen vertices and maximal trees in the 1-skeleta of those components, and the finite flat connection groupoid from Finite flat connection groupoid on a cell complex.
Finite flat connection groupoid on a cell complex: flat edge assignments form the action groupoid , and its cardinality is .
A finite connected CW complex has the edge-and-2-cell presentation: the oriented non-tree edges freely generate before the 2-cell relators are imposed, and higher cells do not change .
Finite groupoid cardinality and homotopy-fiber integration: groupoid cardinality weights each isomorphism class by the reciprocal order of its automorphism group.
Based loops and the fundamental group: multiplication in traverses the first loop and then the second, and the inverse class is represented by the reversed loop; consequently the inverse path-holonomy convention in the Statement gives a homomorphism to .
Induced fundamental-group maps are well defined, functorial and invariant under based homotopy: a pointed continuous map induces a well-defined homomorphism on fundamental groups, and these homomorphisms are functorial and invariant under homotopies fixing the basepoint.
Proof
For each connected component , start with any flat assignment and set the root gauge value at to the identity. Along the unique tree paths in from , choose the gauge value at each new vertex so that the transformed label on the traversed tree edge is the identity; when that edge is traversed against its chosen orientation, use its inverse label. This recursively produces a tree-normalized assignment on every component. It is unique among gauges whose value at each is the identity, since the condition that each transformed tree label remain determines each next vertex value.
In a tree-normalized assignment on , every edge of has label . Assign to each generator of the inverse of the label on its oriented non-tree edge. By [F4], this is a homomorphism for the traversal-first product on loops: holonomy of a concatenation is the reverse-ordered product, and reversing the path in the Statement reverses that order. Flatness says exactly that every relator maps to . By the presentation in [F2], the normalized assignments on are in bijection with homomorphisms .
For a connected subcomplex and base data as in the Statement, the pointed inclusion at induces a well-defined homomorphism on fundamental groups by [F5]. The base-path change map , given by , is a well-defined isomorphism: endpoint-fixed homotopies remain endpoint-fixed after adjoining , insertion of the retraced path contracts in a product of loop classes, and is its inverse. Thus is well defined. For a flat assignment and an edge loop in , the edge-product convention gives . If a gauge arrow is applied, its path-product rule gives ; this is exactly the naturality condition for the stated conjugation arrows. Hence inverse path holonomy intertwines restriction with the componentwise precomposition functor up to that natural isomorphism.
On a fixed component , a gauge transformation taking one tree-normalized assignment to another must have equal values at the two endpoints of every edge of , because both edge labels are . Since is connected, it is constant on all vertices of . Conversely, each constant gauge value preserves tree normalization and conjugates every generator label by . Thus the full subgroupoid on tree-normalized objects over is identified with . Step 1.1 makes its inclusion into the full flat-connection groupoid essentially surjective, and the inclusion is fully faithful because it is full. The root-one gauge used in step 1.1 leaves inverse path holonomy at unchanged, so the object map in the Statement agrees with normalization followed by this identification. For any gauge arrow , the gauge factors telescope along each based edge loop at to give , so . Conversely, after normalizing and by root-one gauges, each conjugating arrow between their representations is the unique constant gauge arrow between the normalized assignments; conjugating back gives the unique gauge arrow between and with that value at . Hence the stated functor is fully faithful as well as essentially surjective, and is an equivalence.
For each connected component , the subgroup of vertex gauges equal to at acts freely and transitively on each fiber of the map from flat assignments to their tree-normalized representative, by step 1.1 and its uniqueness. Its order is , so . Substituting this count into [F1] gives the connected normalization. Equivalently, the action-groupoid cardinality in step 4.1 sums over conjugacy classes; no freeness of the conjugation action is assumed.
For , the defining edge-label and vertex-gauge data split componentwise, so . Applying step 4.1 on each component gives the product equivalence , and applying step 3.1 componentwise gives the stated restriction naturality. Automorphism orders multiply in a product groupoid and its isomorphism classes are componentwise tuples, so its groupoid cardinality is the product of the connected cardinalities from step 5.1. When , the empty product is terminal with cardinality .
Depends on
Finite flat connection groupoid on a cell complex
Finite groupoid cardinality and homotopy-fiber integration
Based loops and the fundamental group
A finite connected CW complex has the edge-and-2-cell presentation
Induced fundamental-group maps are well defined, functorial and invariant under based homotopy
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
- Allen Hatcher, Algebraic Topology, Chapter 1, §1.2 Applications to Cell Complexes and §1.A Graphs and Free Groups