Alphabeta Math
LemmaStatement: 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.

Constructible images for finite-presentation affine maps

Statement

Assume the Axiom of Choice. Let A→B be a finitely presented ring map and let b∈B. Then the image of the basic open D(b)⊆Spec⁡B under the induced map Spec⁡B→Spec⁡A is a constructible subset of Spec⁡A (Constructible subsets of a scheme).

Facts & Assumptions

Given: A finitely presented ring map A→B and an element b∈B; the reduction Spec⁡B→Spec⁡A of spectra.

[F1]

For a ring A, the points of Spec⁡A are the prime ideals, the basic opens are D(f)={p:f∉p}, and V(f1,…,fm)={p:f1,…,fm∈p} is the complement of D(f1)∪⋯∪D(fm); for A=0 the spectrum is empty. (The underlying space of an affine spectrum)

[F2]

For a topological space X an open U⊆X is retrocompact when U∩V is quasi-compact for every quasi-compact open V, and a subset is constructible when it is a finite union of sets U∩(X∖V) with U,V retrocompact open. On Spec⁡A the retrocompact opens are exactly the quasi-compact opens, so a subset there is constructible exactly when it is a finite union of sets D(f)∩V(g1,…,gm). (Constructible subsets of a scheme)

[F3]

A commutative R-algebra A is finitely presented when there are n∈N and a finitely generated ideal a⊆R[x1,…,xn] with A≅R[x1,…,xn]/a as R-algebras. (Finitely presented modules and finitely presented algebras)

[F4]

A morphism f:X→S is locally of finite presentation if it admits affine charts as in the locally finite-type definition for which A→B is a finitely presented A-algebra. (Locally finite presentation morphisms)

[F5]

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

[F6]

Let R be a commutative ring and let g∈R[x] be monic. For every f∈R[x] there are unique q,r∈R[x] with f=qg+r and r=0 or deg⁡r<deg⁡g. (Division by a monic polynomial over a commutative ring)

[F7]

For a commutative ring R and n≥1 the determinant of a square matrix over R is given by the Leibniz formula, so it is a polynomial with integer coefficients in the matrix entries. (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix)

[F8]

For A∈Mn(F) over a field and n≥1, the characteristic polynomial is χA(x)=det⁡(xIn−A), and for the unique 0×0 matrix it is 1. (For A∈Mn(F), the characteristic polynomial is χA(x)=det⁡(xIn−A) when n≥1, with χA(x)=1 for the unique 0×0 matrix)

[F9]

Let N be an endomorphism of a nonzero n-dimensional vector space over a field. Then N is nilpotent if and only if its characteristic polynomial is xn; in dimension zero the unique endomorphism is nilpotent with characteristic polynomial 1=x0. (Characterisations of a nilpotent endomorphism)

[F10]

Assume AC. If r is a nonnilpotent element of a commutative ring R, then Rr≠0: the multiplicative set {1,r,r2,…} omits 0, so the localization is nonzero by Equality, vanishing, and the kernel of the localisation map. The proper zero ideal of Rr is contained in a maximal ideal by In a nonzero commutative ring, every proper ideal is contained in a maximal ideal, and that maximal ideal is prime by Every maximal ideal of a commutative ring is prime. Its contraction to R is a prime avoiding r, since r is a unit in Rr.

Proof

technique · direct. Reduce the claim to the affine Chevalley theorem for polynomial rings, prove the one-variable case by a well-founded induction on the number and degrees of the equations, and settle the one-equation case with the characteristic polynomial of multiplication by $f$ on $R[x]/(g)$, exactly as in the cited Stacks argument
1.1F1F2F3F4

By [F3] and [F4] write B≅P/I with P=A[x1,…,xn] and I=(h1,…,hm) a finitely generated ideal, and choose f∈P mapping to b. Let T=D(f)∩V(h1,…,hm)⊆Spec⁡P. Then T is constructible in Spec⁡P by [F2], because D(f) is retrocompact open and V(h1,…,hm) is the complement of the retrocompact open D(h1)∪⋯∪D(hm). Let π:Spec⁡P→Spec⁡A be the induced map.

1.2F2

We prove the following claim by induction on k≥0: for every commutative ring R and every constructible subset E⊆Spec⁡R[x1,…,xk], the image of E under the structure map Spec⁡R[x1,…,xk]→Spec⁡R is constructible. For k=0 the structure map is the identity, so the claim is immediate.

1.3F2

One-variable claim: for every commutative ring R, every f∈R[x] and all g1,…,gm∈R[x], the image of D(f)∩V(g1,…,gm) under Spec⁡R[x]→Spec⁡R is constructible. We prove this by well-founded induction on the pair μ=(m;δ1≤⋯≤δm), where δ1,…,δm are the degrees of the nonzero polynomials among g1,…,gm arranged in increasing order, ordered lexicographically with the empty tuple smallest. Dropping a zero polynomial decreases m, and replacing a polynomial by one of strictly smaller degree decreases the tuple of degrees with m fixed, so μ strictly decreases in the reductions below.

1.4F1F2

Base case m=0: write f=∑i=0Naixi. For p∈Spec⁡R the fibre of Spec⁡R[x]→Spec⁡R over p is Spec⁡κ(p)[x], and the fibre of D(f) is D(f‾), which is nonempty exactly when some coefficient ai has nonzero image in κ(p), that is, when ai∉p. Hence the image of D(f) is ⋃i=0ND(ai), a constructible set; for f=0 all the basic opens are empty and the image is empty.

1.5F1F2

Fix c∈R and a constructible set T⊆D(f)∩V(g1,…,gm) built from f and the gi. The space Spec⁡R is the disjoint union of the closed subspace V(c)=Spec⁡R/(c) and the open subspace D(c)=Spec⁡Rc. Accordingly the image of T is the union of its parts over V(c) and over D(c): over V(c) one computes in R/(c)[x], over D(c) in Rc[x], and the images of these two parts are the corresponding subsets of Spec⁡R because Spec⁡R/(c)→Spec⁡R is a closed immersion onto V(c) and Spec⁡Rc→Spec⁡R is an open immersion onto D(c). A subset of V(c) of the form ⋃jD(f‾j)∩V(g‾j1,… ) corresponds in Spec⁡R to ⋃jD(fj)∩V(gj1,…,c), and similarly on D(c) the images are themselves constructible subsets of Spec⁡R described by the same expressions read in R[x].

1.6F6F7F8

Base case of the induction: m=1, g∈R[x] with invertible leading coefficient u, and f∈R[x]. Multiplying g by u−1 we may assume g monic of degree d≥0. Let S=R[x]/(g), a free R-module with basis the classes of 1,x,…,xd−1 by [F6]; let M be the matrix of multiplication by f on S in this basis, and put P(T)=det⁡(TId−M)=∑i=0driTi∈R[T], a monic polynomial of degree d with rd=1, with the convention P=1 when d=0.

2.1F1step 1.1

The quotient map P→B induces a closed immersion Spec⁡B→Spec⁡P whose image is exactly V(I), and for the reduction f‾ of f the preimage of D(f‾)⊆Spec⁡B is D(f)∩V(I)=T. Hence the image of D(b) under Spec⁡B→Spec⁡A equals π(T).

2.2step 1.2

For the induction step from k−1 to k, put R′=R[x1,…,xk−1], so that R[x1,…,xk]=R′[xk]. By the one-variable claim of steps 1.3-3.1, applied over the ring R′, the image E′ of E under Spec⁡R′[xk]→Spec⁡R′ is a constructible subset of Spec⁡R′. By the induction hypothesis for k−1 applied to the ring R and the constructible subset E′, the image of E′ in Spec⁡R is constructible. Since the image of E in Spec⁡R is the image of E′, this proves the claim for k.

2.3F1step 1.3

For the induction step assume m≥1 and that the claim is known for all smaller μ. If some gj=0 then V(g1,…,gm)=V(the remaining gi), the pair's first entry drops, and the claim follows from the induction hypothesis. Hence assume all gi≠0, and reorder the gi so that g1 has minimal degree d, with leading coefficient c∈R, c≠0.

2.4step 1.3step 1.5

Over V(c): in R/(c)[x] the image of g1 has degree <d or is zero, while the images of g2,…,gm have degrees at most their original degrees. Hence the pair μ′ of the tuple in R/(c)[x] is strictly smaller than μ: either a polynomial has disappeared, or the smallest of the degrees strictly decreased. By the induction hypothesis applied over the ring R/(c), the image of the part of T over V(c) inside Spec⁡(R/(c))[x] is constructible, and by step 1.5 its image in Spec⁡R is constructible.

2.5F2step 1.5

Over D(c): the element c becomes a unit, so after multiplying g1 by the unit c−1 we may assume g1 is monic of degree d; this does not change the ideal (g1) nor its zero set. If m=1 the claim over D(c) is the one-equation case treated below, whose constructibility is then moved back to Spec⁡R by step 1.5. If m≥2 and d=0, then g1=c is a unit in Rc[x], so V(g1)=∅ over D(c) and the part of the image over D(c) is empty.

2.6F6step 1.3step 1.5

Over D(c) with m≥2 and d≥1, apply [F6] to each gi, i≥2, and g1: there are qi,ri∈Rc[x] with gi=qig1+ri and ri=0 or deg⁡ri<d. Then (g1,g2,…,gm)=(g1,r2,…,rm) as ideals, hence V(g1,…,gm)=V(g1,r2,…,rm) over D(c). Every nonzero ri has degree <d, so the new pair μ′′ is strictly smaller than μ: its smallest degree is <d or the tuple is shorter. The induction hypothesis over the ring Rc makes the image of this part constructible in Spec⁡Rc, and step 1.5 moves it to a constructible subset of Spec⁡R.

2.7F7F8F9step 1.6

Claim: for p∈Spec⁡R, the element f is nilpotent in S⊗Rκ(p) if and only if p⊇(r0,…,rd−1). Indeed S⊗Rκ(p)≅κ(p)[x]/(g‾) has κ(p)-basis the classes of 1,x,…,xd−1, and multiplication by the image of f has matrix M‾ obtained by reducing the entries of M; since the determinant is given by the Leibniz formula [F7], the characteristic polynomial of that multiplication is the reduction P‾(T)=Td+r‾d−1Td−1+⋯+r‾0 of P over κ(p), in the sense of [F8]. When d≥1 and the fibre algebra is nonzero, [F9] says that this multiplication is nilpotent exactly when P‾=Td, that is, exactly when all r‾i=0, i.e. p⊇(r0,…,rd−1); when d=0 the multiplication acts on the zero ring, is nilpotent, and the condition p⊇∅ holds.

3.1F2F10step 1.6step 2.7

Claim: the image of D(f)∩V(g) in Spec⁡R is ⋃i=0d−1D(ri). For the inclusion ⊆, let q∈D(f)∩V(g) lie over p. Then q is a prime of the fibre algebra S⊗Rκ(p) containing the image of g and avoiding the image of f, so multiplication by f on that fibre algebra is not nilpotent: a nilpotent element lies in every prime ideal of its ring. By step 2.7 some ri∉p, that is, p∈D(ri) for some i. Conversely, if ri∉p for some i<d, then by step 2.7 f is not nilpotent in the fibre algebra S⊗Rκ(p). Fact [F10] supplies a prime ideal of that fibre algebra avoiding f. Its preimage under R[x]→S⊗Rκ(p) is a prime of R[x] lying in D(f)∩V(g) over p.

4.1F5step 1.1step 2.1step 1.2step 1.3step 3.1∎

This completes the induction of step 1.3 and hence the one-variable claim, which supplies step 2.2 and proves the induction claim of step 1.2 for every k. Applying step 1.2 with R=A, k=n and the constructible set T of step 1.1, the image π(T) is constructible in Spec⁡A. By step 2.1 the image of D(b) under Spec⁡B→Spec⁡A equals π(T), so it is constructible. The Axiom of Choice [F5] is used only in step 3.1, to choose a prime ideal avoiding a non-nilpotent element; all other selections are finite.

Depends on

Used by

Dependency tree · two levels

60 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