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.

A flat equivalence relation with a suitable quasi-section has a scheme quotient

Statement

Assume the Axiom of Choice. Let R⇉X be a flat finite-type equivalence-relation groupoid on a separated finite-type k-scheme. Suppose a locally closed U⊂X satisfies: V=s−1(U)→tX is finite locally free and onto, and every orbit of the induced relation RU⇉U lies in an affine open of U. Then X/R is represented by a finite-type scheme Y; the quotient q:X→Y is faithfully flat of finite presentation, and R=X×YX.

Facts & Assumptions

[F1]

Finite locally free equivalence relations with affine-contained orbits have scheme quotients with finite locally free quotient maps. (Finite locally free equivalence quotients exist when orbits lie in affine opens)

[F2]

Compatible scheme morphisms descend along quasi-compact fppf covers; flatness descends under faithful flat base change. (Scheme morphisms satisfy fppf descent, Flatness descends along faithfully flat base change)

Proof

Given: AC, R,X,U,V satisfying the statement, with s source and t target.

1.1F1F2givenconstruct

The source and target projections of RU are finite locally free: its target projection is the base change of V→X by U⊂X, and inversion exchanges the two. By [F1] it has a scheme quotient Y, with U→Y finite locally free and onto. The morphism V→sU→Y has equal pullbacks along V×XV: two arrows with equal target determine, by composition and inverse, a relation arrow between their source points in U. Therefore [F2] descends it to a morphism q:X→Y.

2.1F1F2step 1.1algebra

As fppf sheaves, the quotient of X by R equals that of U by RU. Indeed every point of X lifts locally along V→X and is then related to its source point in U, proving local surjectivity of the latter quotient into the former. Two points of U are identified exactly when related by RU, by restriction of the original equivalence relation. Thus [F2] gives Y≅X/R. Since R is an equivalence relation, its arrows are unique when source and target are specified, so this equality of sheaves identifies R with the representable kernel pair X×YX. In particular X×YU≅V, by the arrow/source description.

3.1F1F2step 1.1step 2.1algebra∎

Base change of q by the finite locally free cover U→Y is V→U, which is flat as a base change of the original relation's source map. Thus [F2] makes q flat. It is onto since the composite U→X→Y is onto, and is of finite presentation: both X and Y are finite-type k-schemes, so any k-morphism between them is finite type, and over their Noetherian affine charts finite type implies finite presentation. Therefore q is faithfully flat of finite presentation with the asserted kernel pair and quotient. AC is inherited from [F1]–[F2].

Depends on

Used by

Dependency tree · two levels

15 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