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.
Affine finite locally free equivalence relations have finite locally free scheme quotients
Statement
Assume the Axiom of Choice. Let be a field, let and be affine finite-type -schemes, and let be finite locally free morphisms (Faithfully flat scheme morphism) such that is an equivalence relation. Put (Quotient sheaves and representable quotients for pre-relations and group actions for the quotient sheaf ). Then is a finite-type -algebra, the morphism is finite locally free and surjective, the canonical morphism is an isomorphism, and represents the fppf quotient sheaf .
Facts & Assumptions
Given: AC, the affine finite-type -schemes and , and finite locally free with an equivalence relation.
The published affine quotient theorem: for affine finite-type -schemes , with an equivalence-relation groupoid whose source and target maps are finite locally free, the ring is a finite-type -algebra, is finite locally free and onto, is an isomorphism, and represents the fppf quotient sheaf (Finite locally free affine equivalence relations have finite locally free scheme quotients).
The fppf quotient sheaf is the sheafification of the naive quotient presheaf in the fppf topology, and a scheme represents it when its functor is naturally isomorphic to it (Quotient sheaves and representable quotients for pre-relations and group actions).
Proof
Given: AC, , and finite locally free with an equivalence relation.
The equivalence-relation hypothesis includes that is a monomorphism. Reflexivity supplies the diagonal arrow with , symmetry supplies the unique arrow with for the factor swap , and transitivity supplies the unique composition arrow through ; these are exactly the groupoid-scheme arrows dual to the identities of the relation, so is an equivalence-relation groupoid with finite locally free source and target.
Applying [F1] to the groupoid produced in step 1.1 gives that is a finite-type -algebra, is finite locally free and surjective, and is an isomorphism; all hypotheses coincide because both statements use the comorphisms of on coordinate rings.
The representing claim is a claim about the same object: by [F2] the phrase " represents the fppf quotient sheaf " means that is naturally isomorphic to the sheafification of the naive quotient presheaf of in the fppf topology, which is exactly the conclusion recorded here; no further hypothesis is added and no step of the published proof is repeated.
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
- The Stacks Project, Groupoid Schemes, Sections 39.20 and 39.23 (tags 02VG, 03BD, 03C5, 03BM, 03BE) (standard reference, not scraped)
- The Stacks Project, Properties of Algebraic Spaces, Section 66.14 (tags 07S5, 07S6, 0BBM) (standard reference, not scraped)