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.
Categories fibred in groupoids over a site
Definition
Let be a category (Category, object, morphism, domain, codomain, identity, composition, and hom-collection). A functor (Covariant functor, identity functor, composite functor, and contravariant functor) is a category fibred in groupoids over if every arrow of and every object of over admit a cartesian arrow over , and every fibre category is a groupoid (Isomorphism, groupoid, and connected category).
Cartesian means: for every , every object of over and every arrow with , there is a unique arrow over with . The fibre is the subcategory of objects over and morphisms over . The condition is equivalent to: every arrow of is cartesian, and for every and every object over there is an arrow over . Since an arrow over an identity is an isomorphism exactly when it is cartesian, this is a genuine condition on and not a matter of choosing arrows.
A 1-morphism is a functor over , i.e. (such a functor automatically preserves cartesian arrows). A 2-morphism is a natural transformation over , i.e. one whose components lie in the fibres (Natural transformation and its components). An equivalence is a 1-morphism admitting an inverse over the base up to natural isomorphisms over the base. It induces fully faithful, essentially surjective functors on all fibres. Conversely, fibrewise full faithfulness and essential surjectivity imply equivalence when choices of preimages and vertical isomorphisms are supplied for all target objects; for set-sized total categories these choices follow from AC (The Axiom of Choice). Indeed cartesian factorization turns fibrewise full faithfulness into full faithfulness on arrows over each base arrow. For each target object x choose y over the same base object and an isomorphism F(y) to x; full faithfulness lifts the conjugated target arrows uniquely to define the inverse functor and its two natural isomorphisms (Vistoli, Proposition 3.36 and Lemma 3.37). These objects, 1-morphisms and 2-morphisms form a strict 2-category: composition of 1-morphisms is strictly associative and the identity 1-morphisms act strictly; the coherence isomorphisms familiar from a pseudofunctor description appear only after choosing pullbacks.
The definition requires neither a cleavage nor a simultaneous choice of pullbacks. If one does choose, for every arrow , a single cartesian lift of each object , then the chosen lifts compose only up to the canonical isomorphism supplied by cartesian uniqueness, and this global choice may use AC; the fibred-in-groupoids definition requires no such choice. The equivalence criterion above has its separately stated choice hypothesis. In particular the empty category is fibred in groupoids over vacuously, and if is empty then the fibre categories are empty groupoids.
Depends on
- Category, object, morphism, domain, codomain, identity, composition, and hom-collection
- Covariant functor, identity functor, composite functor, and contravariant functor
- Natural transformation and its components
- Isomorphism, groupoid, and connected category
- Opposite category $\mathcal C^{\mathrm{op}}$
- The Axiom of Choice
Used by
- A quotient stack need not be a scheme Counterexample
- Algebraic stacks and their inertia stacks Definition
- Deformations of schemes and the infinitesimal deformation functor Definition
- Descent data, prestacks and stacks in groupoids over the fppf site Definition
- The classifying stack of a finite group Example
- The inertia of a stack in setoids is trivial Lemma
Dependency tree · two levels
9 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Angelo Vistoli, Notes on Grothendieck topologies, fibered categories and descent theory (arXiv:math/0412512) (standard reference, not scraped)
- The Stacks Project, Chapter 4 (Categories), Section 4.33 (Fibred categories) (standard reference, not scraped)