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.
Flat-connection groupoids satisfy boundary descent
Statement
Let and be compact triangulated -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
Writing for restriction, a pullback object is . A morphism to satisfies .
Statement references
Facts & Assumptions
Given: The compatible triangulated bordisms , their common boundary , and the finite flat-connection groupoids from Finite flat connection groupoid on a cell complex.
Finite flat connection groupoid on a cell complex: objects are flat edge labels and arrows are vertex gauge transformations; gauge transformations preserve flatness.
Finite gauge state spaces and bordism spans: boundary restriction is a functor of finite flat-connection groupoids.
Homotopy pullback of finite groupoids: a homotopy-pullback object includes an isomorphism between the two images, and its arrows satisfy .
Proof
A global flat labeling on 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.
Conversely, let be a homotopy-pullback object as in [F3], where is a boundary gauge isomorphism. Its finite vertex values on the boundary extend to the vertices of by setting every non-boundary value to the identity. Applying this gauge transformation to makes its boundary edge labels equal to those of . 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.
By [F3], a morphism in the homotopy pullback is a pair of gauge transformations on and 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 . 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.
The boundary isomorphism is load-bearing. For the one-object groupoid of a finite group , an object of the homotopy pullback of two identity functors is an element . By [F3], a morphism satisfies , so every is isomorphic to and the automorphisms of are the diagonal pairs . Thus the homotopy pullback has one isomorphism class with automorphism group isomorphic to and cardinality . The ordinary set-theoretic fiber product has one object with trivial automorphism group and cardinality . Omitting therefore discards the stabilizer factor required by the gluing measure.
Gluing diagram
Write for restriction to the common boundary and for restriction from the glued manifold to . The restriction square below commutes with the identity boundary isomorphism. It is a homotopy pullback: the comparison functor to , 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)