Alphabeta Math
DefinitionDefinition: 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 flat connection groupoid on a cell complex

Definition

Let K be a finite connected CW complex and G 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 π1(K); the choice of base paths is part of that presentation. A flat edge assignment is a label ge∈G for every oriented 1-cell with geˉ=ge−1, such that each attaching word has holonomy 1. If a word traverses edges e1,…,em in that order with exponents ϵj∈{1,−1}, its holonomy is gemϵm⋯ge1ϵ1.

Write Flat⁡(K,G) for the finite set of flat assignments and K0 for the vertices. The finite vertex gauge group GK0 acts by

(h⋅g)e=ht(e)gehs(e)−1,

where s(e) and t(e) are the source and target vertices. The finite flat connection groupoid CG(K) is the action groupoid Flat⁡(K,G)//GK0: its objects are flat assignments and its arrows g→g′ are the h∈GK0 with h⋅g=g′. Its untwisted finite BF partition function is the groupoid cardinality

ZG(K):=∣CG(K)∣=∑[g]∈Flat⁡(K,G)/GK01∣Stab⁡(g)∣=∣Flat⁡(K,G)∣∣G∣∣K0∣.

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 CG(K) to be the product of the groupoids of its connected components; for the empty complex use the terminal groupoid.

Facts & Assumptions

Given: A finite connected CW complex K, its finite edge-and-2-cell presentation, and a finite group G.

[F1]

Finite groupoid cardinality and homotopy-fiber integration: a finite action groupoid has cardinality ∑[g]1/∣Aut⁡(g)∣, and its invariant-function integrals are finite.

[F2]

A finite connected CW complex has the edge-and-2-cell presentation: the oriented non-tree edges generate π1(K) and the 2-cell attaching words give its relators; cells of dimension at least three do not change this presentation.

Proof

1.1givenF2algebra

Reversing an edge replaces ge by ge−1, and the gauge formula sends the reverse label to (ht(e)gehs(e)−1)−1=hs(e)ge−1ht(e)−1. For a closed attaching word based at a vertex v, the transformed holonomy is hvHol⁡(w)hv−1. Thus the inverse-edge rule and the flatness equations are preserved by every vertex gauge transformation.

2.1givenstep 1.1algebra

For h,k∈GK0, applying k and then h sends an edge label to ht(e)kt(e)geks(e)−1hs(e)−1=(hk)t(e)ge(hk)s(e)−1. 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.

3.1givenF1step 2.1

There are at most ∣G∣∣E(K)∣ edge assignments and exactly ∣G∣∣K0∣ 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.

4.1givenstep 3.1algebra∎

For an orbit represented by g, the map GK0/Stab⁡(g)→GK0⋅g, hStab⁡(g)↦h⋅g, is a bijection: equality of images is equivalent to h2−1h1∈Stab⁡(g). Hence ∣GK0⋅g∣/∣GK0∣=1/∣Stab⁡(g)∣. Summing over the disjoint orbits gives the final ratio in the Definition.

Depends on

Dependency tree · 2 levels

Sources