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.

Finite field descent is effective for schemes with affine-contained descent orbits

Statement

Assume the Axiom of Choice. Let K/k be a finite field extension, and let Y be a separated finite-type K-scheme with a descent datum over K⊗kK satisfying its cocycle condition over K⊗kK⊗kK. Suppose every orbit of the resulting finite locally free equivalence relation on the underlying k-scheme Y lies in an affine open. Then the datum descends to a separated finite-type k-scheme Y0, with Y≅Y0×kK. Compatible morphisms descend uniquely. This includes inseparable extensions and their nonreduced tensor products.

Facts & Assumptions

[F1]

Finite locally free equivalence relations with affine-contained orbits have separated finite-type scheme quotients and the prescribed kernel pair. (Finite locally free equivalence quotients exist when orbits lie in affine opens)

[F2]

Compatible morphisms descend along fppf covers. (Scheme morphisms satisfy fppf descent)

Proof

Given: The schemes, maps, and hypotheses in the statement, and AC.

1.1F1givenconstructalgebra

The datum makes D=Y×Spec⁡kSpec⁡K into a relation on the underlying k-scheme Y: its first map is projection, and its second map uses the given isomorphism between the two K⊗kK base changes. Both projections are finite locally free of rank [K:k]. The cocycle gives composition, and the diagonal and exchange of the two scalar factors give identity and inverse. The map D→Y×kY is a monomorphism: the source point together with the scalar structure of the target uniquely determines the scalar point in the second factor, and the datum then uniquely determines the target. Thus [F1] gives p:Y→Y0=Y/D, finite locally free, onto, with kernel pair D.

2.1F1F2step 1.1algebra∎

The map (p,structure):Y→Y0×kK becomes an isomorphism after the faithfully flat cover Y→Y0: its pullback is Y×Y0Y=D, which is exactly Y×kK, with the isomorphism supplied by the datum. Its inverse descends by [F2], so the map itself is an isomorphism. The same morphism descent gives uniqueness and descent of compatible morphisms. This uses the entire cocycle over the tensor algebras; automorphism invariance alone is insufficient for inseparable K/k. AC is inherited from [F1]–[F2].

Depends on

Used by

Dependency tree · two levels

10 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