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 equivalence relations have saturated affine neighbourhoods around affine-contained orbits

Statement

Assume the Axiom of Choice. Let R⇉X be a finite locally free equivalence-relation groupoid on a separated finite-type k-scheme. If an orbit is contained in an affine open V⊂X, it is contained in a saturated affine open W⊂V.

Facts & Assumptions

[F1]

Characteristic polynomials and norms along finite locally free relation projections are invariant under the equivalence relation, by composition and inverse as in the finite affine quotient proof. (Finite locally free affine equivalence relations have finite locally free scheme quotients)

[F2]

An ideal not contained in any of finitely many prime ideals contains an element outside their union. (An ideal contained in a finite union of prime ideals lies in one of them)

Proof

Given: AC, X,R, its source and target maps s,t, and an orbit E⊂V.

1.1F2givenconstruct

The saturation s(t−1(X∖V)) is closed, since s is finite, and is a union of entire orbits by composition. Let V′ be its complement. It is the largest saturated open contained in V and contains E. Write V=Spec⁡A. The closed subset V∖V′ is defined by an ideal I. No prime of any point of the finite orbit E contains I, so [F2] gives f∈I nonzero at every point of E. Hence Vf⊂V′ and contains E.

2.1F1F2step 1.1algebra∎

On the saturated V′, the restricted relation is still finite locally free. Its norm N=Norm⁡s(t∗f) is a regular function on V′. Its nonvanishing locus consists exactly of the points all of whose relation targets lie in Vf: on a residue-field fibre the determinant is nonzero exactly when multiplication by t∗f is invertible in its finite algebra, equivalently when that element vanishes at none of the fibre's points. Thus this locus is saturated and contains E. It is contained in Vf, because the identity arrow is one of those targets. Therefore it equals the principal nonvanishing locus of the restriction N∣Vf in the affine scheme Vf, and is affine. It is the required W. The norm invariance in [F1] also verifies saturation scheme theoretically. AC is inherited from [F1]–[F2].

Depends on

Used by

Dependency tree · two levels

13 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