Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedverified 2026-09-24 (gpt-6-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 prime chains lift through module-finite domain extensions without Choice

Statement

Let B⊆A be an injective module-finite extension of commutative domains, and let p0⊊p1⊊⋯⊊pr be a supplied finite strict chain of primes of B. Then there are primes q0⊊⋯⊊qr of A with qi∩B=pi for every i. This finite-chain assertion uses no choice principle.

Facts & Assumptions

Given: An injective module-finite extension of domains B⊆A and a supplied finite strict prime chain in B.

[L1]

If M is a finite module over a commutative ring R and IM=M, the determinant trick gives a∈I such that (1−a)M=0 (Determinant trick for Nakayama).

[L2]

For a prime p⊂B, the localization Bp is local with maximal ideal pBp (Rp is local with unique maximal ideal pRp). Prime ideals of a localization and quotient pull back to primes upstairs with the stated contractions (Prime ideals of a localization are exactly the primes disjoint from the denominator set, Prime ideals of a quotient ring are exactly the prime ideals containing the ideal).

Proof

technique · direct
1.1

First establish finite-module lying over. Fix any prime p of B, put S=B∖p, R=Bp, M=S−1A, and m=pR. The module M is finite over R; it is a nonzero ring because B⊆A are domains and no element of S annihilates 1∈A. If mM=M, [L1] gives a∈m with (1−a)M=0. Write a=b/s with b∈p and s∉p. Then 1−a=(s−b)/s is an explicit unit of R, since s−b∉p. It would force M=0, a contradiction. Thus M/mM≠0.

L1L2givenalgebra
2.1

The quotient C=M/mM is a nonzero finite-dimensional algebra over the residue field κ(p)=R/m. Among its proper ideals, choose one J of maximal κ(p)-vector-space dimension; this is possible because the zero ideal is proper and the dimensions form a nonempty subset of the finite set {0,…,dim⁡κ(p)C−1}. A strictly larger proper ideal would have larger vector-space dimension, so J is a maximal, hence prime, ideal of C. The field map κ(p)→C is injective because C≠0, and therefore the preimage of J in M contracts to m in R. Pulling it back along the localization A→M gives a prime of A contracting to p in B.

L2step 1.1algebrachoose
3.1

Apply steps 1.1–2.1 to B⊆A at p0 to obtain q0 above p0. Suppose qi has been selected above pi. The induced inclusion B/pi⊆A/qi is again an injective module-finite extension of domains. Apply the finite-module lying-over construction to the prime pi+1/pi in the lower quotient. By [L2], its prime above pulls back to a prime qi+1⊇qi of A contracting to pi+1. The inclusion is strict because its contractions are strict.

L2step 2.1givenalgebra
4.1

Repeating step 3.1 for the supplied finite number r of links produces q0⊊⋯⊊qr with the required contractions. Only finite choices of witnesses occurred: the finite-dimensional ideal in step 2.1 is selected from a bounded set of integer dimensions, and the chain has a supplied finite length.

step 3.1∎

Depends on

Used by

Dependency tree · two levels

14 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.