Alphabeta Math
TheoremStatement: 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.

Affine finite locally free equivalence relations have finite locally free scheme quotients

Statement

Assume the Axiom of Choice. Let k be a field, let U=Spec⁡A and R=Spec⁡B be affine finite-type k-schemes, and let s,t:R→U be finite locally free morphisms (Faithfully flat scheme morphism) such that j=(t,s):R→U×kU is an equivalence relation. Put C={a∈A:s♯(a)=t♯(a)} (Quotient sheaves and representable quotients for pre-relations and group actions for the quotient sheaf U/R). Then C is a finite-type k-algebra, the morphism U→M=Spec⁡C is finite locally free and surjective, the canonical morphism R→U×MU is an isomorphism, and M represents the fppf quotient sheaf U/R.

Facts & Assumptions

Given: AC, the affine finite-type k-schemes U=Spec⁡A and R=Spec⁡B, and finite locally free s,t:R→U with j=(t,s) an equivalence relation.

[F1]

The published affine quotient theorem: for affine finite-type k-schemes U=Spec⁡A, R=Spec⁡B with an equivalence-relation groupoid whose source and target maps are finite locally free, the ring C={a∈A:s∗(a)=t∗(a)} is a finite-type k-algebra, U→Spec⁡C is finite locally free and onto, R→U×MU is an isomorphism, and M represents the fppf quotient sheaf U/R (Finite locally free affine equivalence relations have finite locally free scheme quotients).

[F2]

The fppf quotient sheaf U/R 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, U=Spec⁡A, R=Spec⁡B and finite locally free s,t:R→U with j=(t,s) an equivalence relation.

1.1givenconstruct

The equivalence-relation hypothesis includes that j is a monomorphism. Reflexivity supplies the diagonal arrow e:U→R with j∘e=ΔU/k, symmetry supplies the unique arrow i:R→R with j∘i=σ∘j for the factor swap σ, and transitivity supplies the unique composition arrow through j; these are exactly the groupoid-scheme arrows dual to the identities of the relation, so (R⇉U) is an equivalence-relation groupoid with finite locally free source and target.

2.1F1step 1.1givenalgebra

Applying [F1] to the groupoid produced in step 1.1 gives that C={a∈A:s♯(a)=t♯(a)} is a finite-type k-algebra, U→M=Spec⁡C is finite locally free and surjective, and R→U×MU is an isomorphism; all hypotheses coincide because both statements use the comorphisms s♯,t♯ of s,t on coordinate rings.

3.1F1F2step 2.1∎

The representing claim is a claim about the same object: by [F2] the phrase "M represents the fppf quotient sheaf U/R" means that hM is naturally isomorphic to the sheafification of the naive quotient presheaf of s,t:R→U 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