Alphabeta Math
Pipeline-generated
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-group BF state sums, gauge groupoids and gluing

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite groupoid cardinality and homotopy-fiber integration

Definition

A finite groupoid is a small category in which every morphism is invertible, with finitely many isomorphism classes and a finite automorphism group at every object. Write π0(C) for its set of isomorphism classes. Its groupoid cardinality is

∣C∣:=∑[c]∈π0(C)1∣Aut⁡C(c)∣.

For an isomorphism-invariant function f:π0(C)→C, define

∫c∈Cf(c):=∑[c]∈π0(C)f(c)∣Aut⁡C(c)∣.

For finite groupoids C,D, a functor p:C→D, and an object d of D, its homotopy fiber Cd has objects (c,α) with α:p(c)⟶≅d and morphisms u:(c,α)→(c′,α′) satisfying α′∘p(u)=α. Define pullback and pushforward of invariant functions by

(p∗g)([c])=g([p(c)]),(p!f)([d])=∫(c,α)∈Cdf([c]).

A span X←aE→bY of finite groupoids therefore induces the linear map b!a∗ on invariant functions.

Facts & Assumptions

Given: Finite groupoids C,D, a functor p:C→D, and invariant complex-valued functions on their isomorphism classes.

[A1]

A finite groupoid has finitely many isomorphism classes and a finite automorphism group at every object.

Proof

1.1givenA1

The groupoid cardinality and integral in the Definition are finite sums by [A1]. Fix d∈D and one representative c from each source isomorphism class. The set of isomorphisms p(c)≅d is empty or a torsor for the finite group Aut⁡D(d). Every object of the homotopy fiber is isomorphic to one with such a chosen source representative, so the fiber has finitely many isomorphism classes. The automorphisms of (c,α) are the u∈Aut⁡C(c) satisfying α∘p(u)=α, a subgroup of a finite group by [A1]. Thus every homotopy fiber is finite and each pushforward sum is finite.

1.2givenA1construct

If η:d→d′ is an isomorphism in D, the rule (c,α)↦(c,η∘α) is an equivalence Cd→Cd′ with inverse given by η−1. It preserves isomorphism classes, automorphism groups, and the values of f([c]), so the fiber integral is independent of the representative of [d].

2.1givenstep 1.2algebra∎

If c→c′ is an isomorphism in C, then p(c)→p(c′) is an isomorphism in D, so p∗g is invariant; step 1.2 proves the same for p!f. Consequently b!a∗ is a well-defined linear map, since its sums are finite and both operations preserve linear combinations.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Homotopy pullback of finite groupoids

Definition

Let p:C→D and q:E→D be functors of finite groupoids. The homotopy pullback groupoid C×DhE has objects (c,e,α), where c∈C, e∈E, and α:p(c)⟶≅q(e) is an isomorphism in D. A morphism (u,v):(c,e,α)→(c′,e′,α′) consists of isomorphisms u:c→c′ and v:e→e′ satisfying

q(v)∘α=α′∘p(u).

Composition is componentwise. The projections to C and E send (c,e,α) to c and e, respectively.

Facts & Assumptions

Given: Finite groupoids C,D,E and functors p:C→D, q:E→D.

[F1]

Finite groupoid cardinality and homotopy-fiber integration: a finite groupoid has finitely many isomorphism classes and a finite automorphism group at every object.

Proof

1.1givenF1algebra

Identity pairs satisfy the compatibility equation. If (u,v) and (u′,v′) are composable compatible pairs, then q(v′∘v)∘α=q(v′)∘q(v)∘α=q(v′)∘α′∘p(u)=α′′∘p(u′∘u), so their composite is compatible. Inverting the compatibility equation shows (u−1,v−1) is compatible with the reversed objects. Thus the stated data form a groupoid.

2.1givenF1construct∎

Choose one representative from each of the finitely many isomorphism classes of C and E. If u:c→c0 and v:e→e0 are isomorphisms to representatives, then (c,e,α) is isomorphic to (c0,e0,q(v)∘α∘p(u)−1). For each representative pair (c0,e0), the possible isomorphisms p(c0)≅q(e0) are either absent or form a set on which postcomposition by Aut⁡D(q(e0)) acts freely and transitively; that set has finite size by [F1]. Thus there are finitely many isomorphism classes of triples. The automorphism group of a triple is the subgroup of Aut⁡C(c0)×Aut⁡E(e0) satisfying the compatibility equation, and is finite by [F1]. Hence the homotopy pullback is a finite groupoid.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite groupoid push-pull satisfies Fubini and adjunction

Statement

Let p:X→Y and q:Y→Z be functors of finite groupoids. The iterated homotopy fiber over any z∈Z is equivalent to the homotopy fiber of q∘p, so (q∘p)!=q!p!. Consequently, for composable spans of finite groupoids, the induced push-pull maps compose by the homotopy-pullback composite span. If X←aE→bY is a span, equip invariant functions with

⟨f,g⟩X:=∑[x]∈π0(X)f([x])‾ g([x])∣Aut⁡X(x)∣.

Then the adjoint of b!a∗ is a!b∗, the map of the transposed span.

Facts & Assumptions

Given: Finite groupoids and functors as in the Statement, and invariant complex-valued functions on their isomorphism classes.

[F1]

Finite groupoid cardinality and homotopy-fiber integration: homotopy-fiber objects are pairs (c,α:p(c)≅d); integration weights each class by the reciprocal automorphism-group order; a span acts by pushforward after pullback.

[F2]

Homotopy pullback of finite groupoids: the homotopy pullback of b:E→Y and c:F→Y has objects (e,f,α:b(e)≅c(f)) and compatible pairs of arrows.

Proof

1.1givenF1construct

For fixed z∈Z, an object of the iterated fiber is (y,β:q(y)→z,x,α:p(x)→y). The functor (y,β,x,α)↦(x,β∘q(α)) maps it to (X)z. A quasi-inverse sends (x,γ:q(p(x))→z) to (p(x),γ,x,id⁡p(x)). The composite on (X)z is the identity. For any iterated object, the isomorphism α:p(x)→y and id⁡x give a natural isomorphism from the quasi-inverse image back to that object. Hence the functor is an equivalence.

1.2givenF1algebra

Fix an isomorphism class [e] of E, set y=b(e), and write A=Aut⁡Y(y), B=Aut⁡E(e), I=im⁡(B→A), and N=ker⁡(B→A). The classes in the homotopy fiber Ey represented by this [e] are the orbits of I on the A-torsor of isomorphisms b(e)≅y, so there are ∣A∣/∣I∣ of them; each has automorphism group N. Their contribution after the outer factor 1/∣A∣ is f([e])/(∣I∣∣N∣)=f([e])/∣B∣, by the finite homomorphism counting identity ∣B∣=∣I∣∣N∣. Summing over [e] proves ∫y∈Yb!f(y)=∫e∈Ef(e).

2.1F1F2step 1.1construct

Compose spans X←aE→bY and Y←cF→dZ, and let P=E×YhF with projections πE,πF. For fixed z∈F, the homotopy fiber of πF over z has objects ((e,f′,α),τ:f′≅z). The functor to Ec(z) sends this object to (e,c(τ)∘α) and sends an arrow (u,v) to u. Such an arrow satisfies τ′∘v=τ and c(v)∘α=α′∘b(u), so its image satisfies β′∘b(u)=β. Conversely, for any such u between images (e,β) and (e′,β′), the only possible lift has v=(τ′)−1∘τ:f′→f′′; the equation β′∘b(u)=β implies c(v)∘α=α′∘b(u), so this lift exists and is unique. The functor is fully faithful; every object (e,β) is its image from ((e,z,β),id⁡z), so it is essentially surjective. It is therefore an equivalence. By [F1], equivalent fibers have equal finite integrals, giving c∗b!g=(πF)!πE∗g for every invariant function g on E. Applying step 1.1 to πF and d now gives d!c∗b!a∗f=(d∘πF)!(a∘πE)∗f, which is the push-pull map of the homotopy-pullback composite span.

2.2F1step 1.2algebra

Put ϕ([e]):=f([a(e)])‾g([b(e)]), which is invariant on π0(E). Expanding the left inner product by the definition of b! gives ⟨b!a∗f,g⟩Y=∑[y]1∣Aut⁡Y(y)∣∑[(e,η)]∈π0(Ey)f([a(e)])‾g([y])∣Aut⁡Ey(e,η)∣. Since η:b(e)≅y and g is invariant, g([y])=g([b(e)]), so this is ∫y∈Yb!ϕ(y)=∫e∈Eϕ(e)=∑[e]ϕ([e])∣Aut⁡E(e)∣ by step 1.2. On the other side, expanding a!b∗g and using ξ:a(e)≅x to replace f([x])‾ by f([a(e)])‾ gives ⟨f,a!b∗g⟩X=∑[x]1∣Aut⁡X(x)∣∑[(e,ξ)]∈π0(Ex)ϕ([e])∣Aut⁡Ex(e,ξ)∣=∫x∈Xa!ϕ(x)=∫e∈Eϕ(e), again by step 1.2. Both inner products therefore equal the same finite weighted sum, proving the adjoint identity.

3.1step 1.1step 2.1step 2.2∎

Step 2.2 proves that the adjoint of b!a∗ is a!b∗, and steps 1.1 and 2.1 prove composition through homotopy-pullback spans.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

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.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite gauge state spaces and bordism spans

Definition

Fix an integer d≥1 and a finite group G. A triangulated d-bordism M:Σ0→Σ1 is a compact oriented piecewise-linear d-manifold with product collars on its boundary, where Σ0 and Σ1 are closed oriented (d−1)-manifolds with finite triangulations and the incoming boundary is identified with −Σ0 while the outgoing boundary is identified with Σ1. The boundary triangulations agree with the induced triangulation of M.

For a closed (d−1)-manifold Σ, define the state space

VG(Σ):=Fun⁡(π0(CG(Σ)),C),⟨f,g⟩Σ:=∑[A]∈π0(CG(Σ))f([A])‾g([A])∣Aut⁡CG(Σ)(A)∣.

The orientation reversal −Σ has the same underlying triangulated cell complex and the same chosen directions on its edges, with only the manifold orientation reversed. Since the flat-connection groupoid uses the cell complex, directed edge labels, flatness equations, and vertex gauge action, not the manifold orientation, the identity on these data gives CG(−Σ)=CG(Σ) and hence the same function set for their state spaces. For a complex vector space W, write W‾ for its conjugate vector space, with the same addition and scalar multiplication λ⋅W‾w:=λ‾w. The map JΣ:VG(−Σ)→VG(Σ)‾ given by JΣ(f)=f‾ pointwise is complex-linear. Reversing the manifold orientation does not replace any fixed directed edge label by its inverse; inversion occurs only when a chosen edge direction itself is reversed.

The specified boundary triangulation identifications induce restriction functors. On the incoming end, r0 is restriction to ∂inM, transport through its identification with −Σ0, and then the identity on the common underlying cell data CG(−Σ0)=CG(Σ0). The outgoing functor r1 is defined by restriction and its specified identification with Σ1. In either transport, a chosen edge mapped to the opposite chosen direction uses the inverse-edge rule from the flat-connection Definition. These functors give a span of finite groupoids

CG(Σ0)←r0CG(M)→r1CG(Σ1).

The associated linear map is

ZM:=(r1)!r0∗:VG(Σ0)→VG(Σ1),

where pullback and pushforward are the finite homotopy-fiber operations just defined. For empty boundary, the amplitude is ZG(M)=∣CG(M)∣.

Facts & Assumptions

Given: A fixed integer d≥1, a finite group G, and a finite triangulated bordism with compatible boundary triangulations.

[F1]

Finite flat connection groupoid on a cell complex: every finite cell complex has a finite flat-connection groupoid formed from edge labels and vertex gauge transformations.

[F2]

Finite groupoid cardinality and homotopy-fiber integration: finite groupoid cardinality and homotopy-fiber pushforward use the weight 1/∣Aut⁡∣.

Proof

1.1givenF1F2

Each boundary and bulk triangulation has finitely many cells, and G is finite. Thus the field sets and gauge groups in [F1] are finite, the boundary state spaces are finite-dimensional complex vector spaces, and the sums defining their pairings and amplitudes are finite. The displayed inner product is positive definite because every coefficient 1/∣Aut⁡(A)∣ is a positive real number.

2.1F1F2step 1.1

Restricting the labels and vertex gauge transformations to a boundary transports each attaching word and its flatness equation, so the resulting edge assignment is still flat. If a boundary identification reverses a chosen edge direction, the transported label is inverted, and (ht(e)gehs(e)−1)−1=hs(e)ge−1ht(e)−1 is exactly the gauge action on that reversed edge. Thus the reindexed restrictions r0,r1 are functors. Pullback and homotopy-fiber pushforward therefore define ZM by [F2]; both are linear because they are substitution and finite weighted summation.

3.1F2step 2.1∎

If Σ0=Σ1=∅, the restriction span has the terminal groupoid at each end. Its induced map sends 1 to ∫A∈CG(M)1=∣CG(M)∣ by [F2], which is the stated closed amplitude.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Flat-connection groupoids satisfy boundary descent

Statement

Let M1 and M2 be compact triangulated d-bordisms glued along an identified closed triangulated boundary Σ, with collars and compatible triangulations. The finite flat-connection groupoid on the glued manifold is equivalent to the homotopy pullback groupoid

CG(M2∪ΣM1)≃CG(M2)×CG(Σ)hCG(M1).

Writing ri:CG(Mi)→CG(Σ) for restriction, a pullback object is (A2,A1,α:r2(A2)≅r1(A1)). A morphism (u2,u1) to (A2′,A1′,α′) satisfies r1(u1)∘α=α′∘r2(u2).

Facts & Assumptions

Given: The compatible triangulated bordisms M1,M2, their common boundary Σ, and the finite flat-connection groupoids from Finite flat connection groupoid on a cell complex.

[F1]

Finite flat connection groupoid on a cell complex: objects are flat edge labels and arrows are vertex gauge transformations; gauge transformations preserve flatness.

[F2]

Finite gauge state spaces and bordism spans: boundary restriction is a functor of finite flat-connection groupoids.

[F3]

Homotopy pullback of finite groupoids: a homotopy-pullback object includes an isomorphism α between the two images, and its arrows satisfy q(v)∘α=α′∘p(u).

Proof

1.1givenF1F2F3construct

A global flat labeling on M2∪ΣM1 restricts to flat labelings on both pieces whose boundary labels agree. The identity boundary isomorphism makes this a triple in the homotopy pullback defined by [F3]. Restriction of a global vertex gauge transformation gives a compatible pair, so restriction defines a functor from the global groupoid.

2.1givenF1F3step 1.1construct

Conversely, let (A2,A1,α) be a homotopy-pullback object as in [F3], where α:r2(A2)→r1(A1) is a boundary gauge isomorphism. Its finite vertex values on the boundary extend to the vertices of M2 by setting every non-boundary value to the identity. Applying this gauge transformation to A2 makes its boundary edge labels equal to those of A1. The two edge labelings then glue to a unique labeling on the union; every 2-cell lies in one of the pieces or their common boundary, so each flatness equation remains satisfied. This proves essential surjectivity.

3.1F1F2F3step 2.1construct

By [F3], a morphism in the homotopy pullback is a pair of gauge transformations on M2 and M1 satisfying the boundary compatibility equation. After the boundary representatives are aligned as in step 2.1, this equation says exactly that the two vertex gauge values agree at every identified boundary vertex. They therefore glue to a unique gauge transformation on M2∪ΣM1. Conversely, every global gauge transformation restricts to such a compatible pair. Thus the restriction functor is fully faithful and, with step 2.1, an equivalence.

4.1givenF1F2F3algebra∎

The boundary isomorphism α is load-bearing. For the one-object groupoid BG of a finite group G, an object of the homotopy pullback of two identity functors is an element α∈G. By [F3], a morphism (u,v):α→α′ satisfies vα=α′u, so every α is isomorphic to 1 and the automorphisms of 1 are the diagonal pairs (u,u). Thus the homotopy pullback has one isomorphism class with automorphism group isomorphic to G and cardinality 1/∣G∣. The ordinary set-theoretic fiber product has one object with trivial automorphism group and cardinality 1. Omitting α therefore discards the stabilizer factor required by the gluing measure.

Gluing diagram

Write ri:CG(Mi)→CG(Σ) for restriction to the common boundary and resi for restriction from the glued manifold to Mi. The restriction square below commutes with the identity boundary isomorphism. It is a homotopy pullback: the comparison functor to CG(M2)×CG(Σ)hCG(M1), sending a global field to its two restrictions and their identity boundary isomorphism, is the equivalence proved by descent. The proof is independent of the drawing.

\mathcal C_G(M_2\cup_\Sigma M_1) \arrow[r,"\mathrm{res}_1"] \arrow[d,"\mathrm{res}_2"'] &
\mathcal C_G(M_1) \arrow[d,"r_1"] \\
\mathcal C_G(M_2) \arrow[r,"r_2"'] & \mathcal C_G(\Sigma)
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite gauge theory gluing is weighted push-pull

Statement

Fix an integer d≥1 and a finite group G. The state spaces and linear maps defined for compatible collared triangulated d-bordisms compose under gluing: if M1:Σ0→Σ1 and M2:Σ1→Σ2, then

ZM2∪Σ1M1=ZM2∘ZM1.

The cylinder on Σ acts as the identity on VG(Σ). Disjoint unions act by tensor products of state spaces and maps. Let cΣ:VG(Σ)→VG(−Σ) be the anti-linear map cΣ(f)=f‾ under the common underlying groupoid of the orientation-reversed boundary. With the weighted inner products from the Definition, if M‾:−Σ1→−Σ0 denotes M:Σ0→Σ1 with reversed orientation, then

ZM‾∘cΣ1=cΣ0∘ZM†,

where ZM† is the adjoint of ZM; equivalently, after the pointwise-conjugation identifications, orientation reversal gives the weighted adjoint. For a connected closed d-manifold M, its scalar amplitude is ∣Hom⁡(π1(M),G)∣/∣G∣.

Facts & Assumptions

Given: A fixed dimension d≥1, finite group G, compatible boundary triangulations, and composable collared triangulated bordisms.

[F1]

Finite gauge state spaces and bordism spans: VG(Σ) consists of invariant functions on boundary flat-connection isomorphism classes; ZM=(r1)!r0∗ for the restriction span; the pairing weights each class by 1/∣Aut⁡∣.

[F2]

Finite groupoid push-pull satisfies Fubini and adjunction: push-pull maps compose through homotopy-pullback spans, and transposing a span gives the adjoint for the weighted inner product.

[F3]

Finite BF partition function is a topological invariant: for a finite CW complex with connected components Kj and chosen base vertices vj, CG(K) is equivalent to ∏j(Hom⁡(π1(Kj,vj),G)//G); restriction to a subcomplex corresponds to componentwise precomposition by its base-path-adjusted induced fundamental-group maps, up to the stated conjugating natural isomorphism. For connected K, its cardinality is ∣Hom⁡(π1(K,v),G)∣/∣G∣.

[F4]

Flat-connection groupoids satisfy boundary descent: flat-connection groupoids on glued bordisms are equivalent to the homotopy pullback of the two restriction functors, with a boundary isomorphism included.

[F5]

Homotopy pullback of finite groupoids: the homotopy pullback has objects (c,e,α:p(c)≅q(e)) and arrows satisfying q(v)∘α=α′∘p(u).

[F6]

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 homotopic maps that fix the basepoint induce the same homomorphism.

Proof

1.1F1F4F5construct

By [F4], with the homotopy-pullback groupoid explicitly given by [F5], the groupoid on the glued bordism is equivalent to the homotopy-pullback composite of the restriction spans for M1 and M2.

1.2F1F2F3F6construct

Write Σ=⨆j=1mΣj and let Cj=Σj×[0,1]. For each j and ϵ∈{0,1}, choose vj∈Σj and base the end inclusion iϵ:Σj→Cj at (vj,ϵ). The projection pj:Cj→Σj satisfies pjiϵ=id⁡, and iϵpj is based-homotopic to the identity through Hs(0)(x,t)=(x,(1−s)t) for ϵ=0 and Hs(1)(x,t)=(x,(1−s)t+s) for ϵ=1. By [F6], these maps induce inverse isomorphisms on fundamental groups. Precomposition with a group isomorphism is an equivalence of representation action groupoids, with inverse precomposition by its inverse and the identity map on conjugating arrows. The componentwise representation equivalence and restriction naturality in [F3] therefore make both end restriction functors CG(Cj)→CG(Σj) equivalences; taking products gives the same conclusion for disconnected Σ. Choose an edge path in each connected cylinder 1-skeleton joining its two end base vertices. The base-path naturality in [F3] gives a natural isomorphism between the two restriction functors. Hence the cylinder span is equivalent to the identity span. Each homotopy fiber of either end equivalence has one isomorphism class and trivial automorphism group, while the natural isomorphism identifies the two boundary values; its weighted push-pull map is therefore the identity on VG(Σ).

1.3F1F2algebra

For a disjoint union, a flat assignment and a vertex gauge transformation are exactly independent assignments on its components. Hence the bulk and boundary groupoids are products. Since the component sets are finite, the indicator functions of pairs of isomorphism classes form the tensor-product basis of the functions on their product. The automorphism weights multiply and the finite fiber sums factor, so the state spaces and maps identify with tensor products.

1.4F1F2algebra

By the corrected orientation convention in [F1], reversing the manifold orientation leaves each fixed directed edge label and its gauge action unchanged; it only exchanges the incoming and outgoing restriction functors. Thus the span of M‾ is the transposed span with the same underlying finite groupoids, so [F2] gives ZM‾=ZM† on those function spaces. Every coefficient of these push-pull maps in the isomorphism-class indicator bases is a finite sum of positive reciprocal automorphism orders, hence is real; the identity on underlying groupoids therefore yields ZM‾∘cΣ1=cΣ0∘ZM†. Pointwise conjugation is the only anti-linear operation, since this model has no cocycle phase.

2.1F1F2step 1.1

The push-pull composition identity in [F2] identifies the linear map of that composite span with ZM2∘ZM1. Equivalent finite groupoids give the same weighted fiber sums, so this map is ZM2∪Σ1M1.

3.1F1F3step 2.1step 1.2step 1.3step 1.4∎

For empty boundary the amplitude is ∣CG(M)∣ by [F1]. Applying [F3] to connected M gives ZG(M)=∣Hom⁡(π1(M),G)∣/∣G∣, with all conjugation stabilizers retained. The gluing, identity, disjoint-union, and orientation statements above establish the asserted finite state-sum rules.

Gluing diagram

Write ri:CG(Mi)→CG(Σ) for restriction to the common boundary and resi for restriction from the glued manifold to Mi. The restriction square below commutes with the identity boundary isomorphism. It is a homotopy pullback: the comparison functor to CG(M2)×CG(Σ)hCG(M1), sending a global field to its two restrictions and their identity boundary isomorphism, is the equivalence proved by descent. The proof is independent of the drawing.

\mathcal C_G(M_2\cup_\Sigma M_1) \arrow[r,"\mathrm{res}_1"] \arrow[d,"\mathrm{res}_2"'] &
\mathcal C_G(M_1) \arrow[d,"r_1"] \\
\mathcal C_G(M_2) \arrow[r,"r_2"'] & \mathcal C_G(\Sigma)

Remarks

This is an untwisted finite-group state sum. It does not define a continuous Lie-group BF integral or establish gravitational dynamics, and it gives no convergence theorem for the Ponzano–Regge state sum.

5 · Examples, experiments and counterexamples

None yet.

Sources