Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (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.

The inertia of a stack in setoids is trivial

Statement

Let X be a stack in groupoids over (Sch/S)fppf (Descent data, prestacks and stacks in groupoids over the fppf site) all of whose fibre categories are setoids, i.e. all of whose automorphism groups are trivial. Then the projection IX→X from the inertia stack (Algebraic stacks and their inertia stacks) is an equivalence of stacks in groupoids (Categories fibred in groupoids over a site); conversely, if this projection is an equivalence, then every fibre category of X is a setoid. In particular, for an algebraic space Z over S (Algebraic spaces over a scheme, defined as fppf sheaves), the fibre category of ISZ over T is the discrete groupoid on Mor⁡S(T,Z), so ISZ≅SZ.

Facts & Assumptions

Given: A stack in groupoids X over the fppf site, its inertia stack IX with projection π, and, in the last clause, the stack in setoids SZ of an algebraic space Z.

[F1]

IX has objects (x,α) with x∈XT and α∈Aut⁡(x), for f:T′→T, a morphism from (y,β) over T′ to (x,α) over T is a base arrow γ:y→x over f with γβ=αγ; in a fixed fibre this is exactly an isomorphism intertwining the two automorphisms; the projection π forgets α (Algebraic stacks and their inertia stacks).

[F2]

An equivalence of categories fibred in groupoids induces fully faithful, essentially surjective functors on every fibre; an explicit inverse over the base up to natural isomorphisms establishes equivalence without making choices; a stack in setoids has only identity automorphisms, and the stack in setoids of an algebraic space Z has fibre category the discrete groupoid on the set of morphisms T→Z (Categories fibred in groupoids over a site, Descent data, prestacks and stacks in groupoids over the fppf site, Algebraic spaces over a scheme, defined as fppf sheaves).

Proof

1.1F1

Full faithfulness in the setoid case. Suppose every fibre category of X is a setoid. Then the only objects of IX(T) are (x,idx). For any two such objects, every isomorphism γ ⁣:x→y in XT satisfies γidx=idyγ, so it lifts uniquely to a morphism (x,idx)→(y,idy). Thus the projection is fully faithful on each fibre.

1.2F1F2

Essential surjectivity in the setoid case. For every x∈XT, the object (x,idx) of IX(T) maps to x, so the projection is essentially surjective on every fibre. The functor x↦(x,idx), sending an arrow γ to the same arrow γ, is an explicit inverse over the base: the inertia condition holds for identity automorphisms, and both composites are identities because every automorphism is the identity. Thus π is an equivalence of stacks in groupoids, without using a choice-based converse to fibrewise essential surjectivity. Conversely, suppose π is an equivalence. For any x∈XT and α∈Aut⁡(x), full faithfulness applied to (x,idx) and (x,α) lifts the identity x→x to a morphism between them. The inertia-morphism condition in [F1] then gives idx=α, so every fibre category is a setoid.

2.1F2step 1.2∎

The stack in setoids of an algebraic space. If X=SZ then XT is the discrete groupoid on Mor⁡S(T,Z) by [F2], so its only automorphisms are identities and step 1.2 shows that ISZ→SZ is an equivalence; the fibre category of ISZ over T is therefore the discrete groupoid on Mor⁡S(T,Z), which is exactly the fibre category of SZ.

Depends on

Used by

Dependency tree · two levels

21 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