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 and be functors of finite groupoids. The homotopy pullback groupoid has objects , where , , and is an isomorphism in . A morphism consists of isomorphisms and satisfying
Composition is componentwise. The projections to and send to and , respectively.
Definition references
Facts & Assumptions
Given: Finite groupoids and functors , .
Finite groupoid cardinality and homotopy-fiber integration: a finite groupoid has finitely many isomorphism classes and a finite automorphism group at every object.
Proof
Identity pairs satisfy the compatibility equation. If and are composable compatible pairs, then , so their composite is compatible. Inverting the compatibility equation shows is compatible with the reversed objects. Thus the stated data form a groupoid.
Choose one representative from each of the finitely many isomorphism classes of and . If and are isomorphisms to representatives, then is isomorphic to . For each representative pair , the possible isomorphisms are either absent or form a set on which postcomposition by 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 satisfying the compatibility equation, and is finite by [F1]. Hence the homotopy pullback is a finite groupoid.