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.

Flat finite-presentation morphisms are open

Statement

Assume the Axiom of Choice (AC). Let f:X→S be a morphism of schemes that is flat (Flat morphism of schemes) and locally of finite presentation (Locally finite presentation morphisms). Then f is universally open (Open and universally open morphisms of schemes); in particular f is open. No further hypothesis is imposed on X, S or f.

Facts & Assumptions

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

[F1]

A morphism f:X→S is flat at x when OX,x is flat over OS,f(x) along the induced local homomorphism, and flat when this holds at every point; a morphism with empty source is flat (Flat morphism of schemes).

[F2]

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

[F3]

A morphism of schemes is open when its underlying map of topological spaces is an open map, and universally open when every base-changed projection X×ST→T over an arbitrary T→S is open (Open and universally open morphisms of schemes).

[F4]

For affine charts U=Spec⁡B, V=Spec⁡A with f(U)⊆V the morphism f is flat at every point of U if and only if B is flat over A; in particular Spec⁡B→Spec⁡A is flat if and only if A→B is flat (Affine-local flatness).

[F5]

Assume AC. If A→B is a finitely presented ring map and b∈B, then the image of the distinguished open D(b)⊆Spec⁡B under Spec⁡B→Spec⁡A is a constructible subset of Spec⁡A (Constructible images for finite-presentation affine maps).

[F6]

Assume AC. Let E⊆Spec⁡A be constructible. If E is stable under specialisation then E is closed, and if E is stable under generalisation then E is open (Constructible subsets stable under generalisation are open in an affine spectrum).

[F7]

Assume AC. A flat ring homomorphism R→S satisfies going down: given primes p1⊆p2 of R and q2∈Spec⁡S contracting to p2, there exists q1⊆q2 with q1∩R=p1 (Every flat ring map satisfies going down).

[F8]

Every localisation R→S−1R is flat, and a composite of flat ring homomorphisms is flat (Every localization is flat, and localizing a flat module preserves flatness, Flatness is transitive under a flat change of rings).

[F9]

Flatness of morphisms is stable under arbitrary base change, and so is local finite presentation (Flatness is stable under arbitrary base change, Local finiteness conditions under base change).

[F10]

For an S-scheme X and a morphism T→S the base change is the fibre product XT=X×ST with structure map the second projection (Base change of objects, morphisms and properties).

[F11]

For a ring B the distinguished opens D(b)={q:b∉q} form a basis of the topology of Spec⁡B (The underlying space of an affine spectrum).

[F12]

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

Proof

technique · direct
1.1given

We first prove the affine claim: if A→B is a flat homomorphism of finite presentation, then Spec⁡B→Spec⁡A is open. Fix b∈B and let Eb⊆Spec⁡A be the image of the distinguished open D(b)⊆Spec⁡B under the map of spectra.

1.2F1F2F4

Now let f:X→S be flat and locally of finite presentation. Cover X by affine opens Ui=Spec⁡Bi such that f(Ui)⊆Vi for affine opens Vi=Spec⁡Ai⊆S with Ai→Bi of finite presentation, as [F2] allows; by [F4] and flatness of f each Ai→Bi is flat.

2.1F8step 1.1

The homomorphism A→Bb is flat: A→B is flat by hypothesis, the localisation B→Bb is flat by [F8], and a composite of flat ring homomorphisms is flat by [F8].

2.2F5step 1.1

By [F5] the set Eb is constructible in Spec⁡A.

3.1F1F7step 2.1

The set Eb is stable under generalisation. Let p∈Eb and let p′⊆p be a prime of A. Choose q∈D(b) with q∩A=p. Since b∉q, the prime q determines a prime q2∈Spec⁡(Bb) contracting to p, and [F7] applied to the flat homomorphism A→Bb of step 2.1 produces q1⊆q2 with q1∩A=p′; as b∉q1 the prime q1 defines a point of D(b) lying over p′, so p′∈Eb.

4.1F6step 2.2step 3.1

By step 2.2 the set Eb is constructible and by step 3.1 it is stable under generalisation, so [F6] shows that Eb is open in Spec⁡A. Since b∈B was arbitrary, the image of every distinguished open of Spec⁡B is open.

5.1F11step 4.1

Every open subset of Spec⁡B is a union of distinguished opens by [F11], and the image of a union is the union of the images, so by step 4.1 the image of every open subset of Spec⁡B is open in Spec⁡A. This proves the affine claim that Spec⁡B→Spec⁡A is open.

6.1F3step 5.1step 1.2

For each i the affine claim of step 5.1 makes the restriction f∣Ui:Ui→Vi open, hence also the map Ui→S is open in the sense of [F3], since Vi is open in S.

7.1F3step 6.1

Consequently f is open: for an open W⊆X one has W=⋃i(W∩Ui), so f(W)=⋃if(W∩Ui), and each f(W∩Ui) is open in S by step 6.1 applied to the open subset W∩Ui⊆Ui, which is exactly the openness required of f by [F3].

8.1

Finally let T→S be an arbitrary morphism and form the base change fT:X×ST→T of [F10]. By [F9] the morphism fT is again flat and locally of finite presentation, so step 7.1 applies to fT and shows that fT is open. As T→S was arbitrary, f is universally open by the definition recorded in [F3]. The Axiom of Choice [F12] is used exactly through [F5], [F6] and [F7], each invoked above. [F3, F9, F10, F12, step 7.1] □

Depends on

Used by

Dependency tree · two levels

57 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