Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

The smooth locus is open

Statement

Assume the Axiom of Choice (AC). Let f:X→S be a morphism locally of finite presentation (Locally finite presentation morphisms) and let Sm⁡(f)⊆X be its smooth locus (The smooth locus of a morphism). Then Sm⁡(f) is an open subset of X, and the restriction of f to this open subset is a smooth morphism.

Facts & Assumptions

Given: The data and hypotheses displayed in the Statement, with the conventions fixed there.

[F1]

For f:X→S locally of finite presentation the smooth locus Sm⁡(f)={x∈X:the morphism f is smooth at x} is a subset of X; f is smooth exactly when Sm⁡(f)=X, X=∅ gives Sm⁡(f)=∅, and smoothness at a point is a germ condition, so it is preserved by restricting the source to an open neighbourhood of the point (The smooth locus of a morphism).

[F2]

Assume AC. For f:X→S locally of finite presentation and x∈X with s=f(x), smoothness of f at x is equivalent to the following: there are affine opens U=Spec⁡C of x and V=Spec⁡A of s with f(U)⊆V and, writing q for the prime of x, a presentation of Ch for some h∈C∖q as Ch≅(A[t1,…,tm]/(f1,…,fr))g in which some r×r minor of the Jacobian matrix has image a unit of Ch (Relative Jacobian criterion with its presentation hypothesis).

[F3]

A morphism f:X→S is locally of finite presentation at x when there are affine opens U=Spec⁡C⊆X and V=Spec⁡A⊆S with x∈U, f(U)⊆V and A→C a finitely presented ring map (Locally finite presentation morphisms).

[F4]

For a ring C the distinguished opens D(h)={q:h∉q} are the basic opens of Spec⁡C (The underlying space of an affine spectrum, Principal distinguished subsets of the prime spectrum), and an open subset of a scheme carries its open subscheme structure (Affine open subschemes).

[F5]

The Axiom of Choice states that every family of nonempty sets has a choice function (The Axiom of Choice).

Proof

technique · direct
1.1F2F3

Fix x∈Sm⁡(f), write q for the prime of C corresponding to x in an affine chart, and put s=f(x). By [F2] there are affine opens U=Spec⁡C of x and V=Spec⁡A of s with f(U)⊆V and, for some h∈C∖q, a presentation Ch≅(A[t1,…,tm]/(f1,…,fr))g in which an r×r Jacobian minor has image a unit of Ch.

2.1F2step 1.1

Let x′∈D(h)⊆U and let q′∈Spec⁡C be the corresponding prime; then h∉q′. The same neighbourhoods U and V and the same element h with the same presentation satisfy the criterion of [F2] at x′, since the displayed presentation of Ch has its Jacobian minor invertible in Ch and h∈C∖q′; hence f is smooth at x′. As x′∈D(h) was arbitrary, D(h)⊆Sm⁡(f).

3.1F4step 1.1step 2.1

The set D(h) is open in U by [F4] and contains x by [F2]. Thus every point x∈Sm⁡(f) has an open neighbourhood D(h)⊆X contained in Sm⁡(f), so Sm⁡(f) is open in X.

4.1F1step 3.1

The restriction f∣Sm⁡(f) is smooth: at each x∈Sm⁡(f) the morphism f is smooth at x by the definition of the locus, and smoothness at a point is preserved by restricting the source to an open neighbourhood of that point, so the restriction is smooth at every point of Sm⁡(f), hence smooth.

5.1

If X=∅ then Sm⁡(f)=∅ is open and the empty restriction is smooth by [F1]; otherwise the argument of steps 1.1, 2.1, 3.1 and 4.1 applies at every point of the locus. The Axiom of Choice [F5] is assumed in the Statement and used exactly through the criterion [F2], invoked in steps 1.1 and 2.1. [F1, F2, F5, step 4.1] □

Depends on

Used by

Nothing in the library uses this result yet.

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