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.

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.

Depends on

Dependency tree · 1 level

Sources