Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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 K be a finite CW complex, possibly disconnected, and let G be a finite group. Write its connected components as K1,…,Km and choose a vertex vj in each. Let RG(K) be the product over j of the action groupoids whose objects are homomorphisms ρ:π1(Kj,vj)→G and whose arrows ρ→ρ′ are elements a∈G satisfying ρ′(γ)=aρ(γ)a−1 for every loop class γ; identity arrows are labeled by 1, and if a:ρ→ρ′ and b:ρ′→ρ′′, then their composite b∘a is labeled by ba. For K=∅, this empty product is the terminal groupoid. Choosing a maximal tree in each component, inverse path holonomy defines an equivalence ΦK:CG(K)≃RG(K): for an edge path traversing e1,…,en with signs ϵk, its holonomy is HA(e1ϵ1⋯enϵn)=genϵn⋯ge1ϵ1, and ΦK(A) sends a loop class represented by an edge loop [γ] to HA(γˉ); a gauge arrow h maps to the conjugating arrow h(vj) on component Kj. In particular, for connected K,

∣CG(K)∣=∣Hom⁡(π1(K,v1),G)∣∣G∣,

and for arbitrary finite K,

∣CG(K)∣=∏j=1m∣Hom⁡(π1(Kj,vj),G)∣∣G∣.

The action retains all conjugation stabilizers. For a subcomplex inclusion ȷ:L↪K, choose a base vertex vi in each component Li, a base vertex wj(i) in its containing component Kj(i), and an edge path γi in Kj(i) from wj(i) to vi. The associated based map is ȷγi,∗([ℓ])=[γi∗ȷ(ℓ)∗γˉi]. Under ΦK and ΦL, restriction corresponds to precomposition by these maps, up to the natural isomorphism whose component at a flat assignment A is conjugation by HA(γˉi). Thus the partition function depends only on the fundamental-group representation groupoid, not on the chosen finite cell decomposition.

Facts & Assumptions

Given: A finite CW complex K with connected components K1,…,Km, a finite group G, chosen vertices vj and maximal trees Tj in the 1-skeleta of those components, and the finite flat connection groupoid from Finite flat connection groupoid on a cell complex.

[F1]

Finite flat connection groupoid on a cell complex: flat edge assignments form the action groupoid Flat⁡(K,G)//GK0, and its cardinality is ∣Flat⁡(K,G)∣/∣G∣∣K0∣.

[F2]

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 π1(K,v0).

[F3]

Finite groupoid cardinality and homotopy-fiber integration: groupoid cardinality weights each isomorphism class by the reciprocal order of its automorphism group.

[F4]

Based loops and the fundamental group: multiplication in π1 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 G.

[F5]

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

1.1givenF1construct

For each connected component Kj, start with any flat assignment and set the root gauge value at vj to the identity. Along the unique tree paths in Tj from vj, 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 vj is the identity, since the condition that each transformed tree label remain 1 determines each next vertex value.

2.1F2F4step 1.1construct

In a tree-normalized assignment on Kj, every edge of Tj has label 1. Assign to each generator xe of π1(Kj,vj) 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 rf maps to 1. By the presentation in [F2], the normalized assignments on Kj are in bijection with homomorphisms ρ:π1(Kj,vj)→G.

3.1F1F4F5step 2.1construct

For a connected subcomplex Li⊆Kj(i) and base data as in the Statement, the pointed inclusion at vi induces a well-defined homomorphism on fundamental groups by [F5]. The base-path change map cγiKj(i):π1(Kj(i),vi)→π1(Kj(i),wj(i)), given by [α]↦[γi∗α∗γˉi], is a well-defined isomorphism: endpoint-fixed homotopies remain endpoint-fixed after adjoining γi,γˉi, insertion of the retraced path γˉi∗γi contracts in a product of loop classes, and cγˉiKj(i) is its inverse. Thus ȷγi,∗=cγiKj(i)∘ȷ∗ is well defined. For a flat assignment A and an edge loop ℓ in Li, the edge-product convention gives ΦKj(i)(A)(ȷγi,∗[ℓ])=HA(γˉi)HA(ℓˉ)HA(γi)=HA(γˉi)ΦLi(A∣Li)([ℓ])HA(γˉi)−1. If a gauge arrow h:A→A′ is applied, its path-product rule gives HA′(γˉi)=h(wj(i))HA(γˉi)h(vi)−1; 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.

4.1step 1.1step 2.1step 3.1construct

On a fixed component Kj, a gauge transformation taking one tree-normalized assignment to another must have equal values at the two endpoints of every edge of Tj, because both edge labels are 1. Since Tj is connected, it is constant on all vertices of Kj. Conversely, each constant gauge value a∈G preserves tree normalization and conjugates every generator label by a. Thus the full subgroupoid on tree-normalized objects over Kj is identified with Hom⁡(π1(Kj,vj),G)//G. 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 vj unchanged, so the object map ΦKj in the Statement agrees with normalization followed by this identification. For any gauge arrow h:A→A′, the gauge factors telescope along each based edge loop δ at vj to give HA′(δˉ)=h(vj)HA(δˉ)h(vj)−1, so ΦKj(A′)=h(vj)ΦKj(A)h(vj)−1. Conversely, after normalizing A and A′ 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 A and A′ with that value at vj. Hence the stated functor is fully faithful as well as essentially surjective, and is an equivalence.

5.1F1F2step 1.1step 2.1step 4.1algebra

For each connected component Kj, the subgroup of vertex gauges equal to 1 at vj 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 ∣G∣∣(Kj)0∣−1, so ∣Flat⁡(Kj,G)∣=∣G∣∣(Kj)0∣−1∣Hom⁡(π1(Kj,vj),G)∣. Substituting this count into [F1] gives the connected normalization. Equivalently, the action-groupoid cardinality in step 4.1 sums 1/∣Stab⁡(ρ)∣ over conjugacy classes; no freeness of the conjugation action is assumed.

6.1F1F3step 3.1step 4.1step 5.1algebra∎

For K=K1⊔⋯⊔Km, the defining edge-label and vertex-gauge data split componentwise, so CG(K)=∏jCG(Kj). Applying step 4.1 on each component gives the product equivalence ΦK:CG(K)≃RG(K), 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 m=0, the empty product is terminal with cardinality 1.

Depends on

Dependency tree · 2 levels

Sources