Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01
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.

A prime chain in R[x] has length at most one more than its contraction chain

Statement

Let R be a Noetherian commutative ring and let

P0P1Pn

be a strict prime chain in R[x]. Then the length n is at most dimR+1.

Facts & Assumptions

Given: A Noetherian commutative ring R and a strict prime chain P0Pn=P in R[x].

[L1]

In the local ring Rq, the maximal ideal qRq can be made minimal over ht(q) generators, where q=PR (Converse to Krull's height theorem in localised form, The height of a prime ideal, Rp is local with unique maximal ideal pRp, Every quotient and every localisation of a Noetherian ring is Noetherian).

[L2]

A prime minimal over an ideal generated by r elements has height at most r (Krull's height theorem).

[L3]

If q is prime, then (R/q)[x] is a polynomial ring over the domain R/q, and after localizing at the nonzero elements of that domain its nonzero prime ideals become nonzero prime ideals of a PID and hence are minimal over one generator (Prime ideals of a quotient ring are exactly the prime ideals containing the ideal, For every field F, F[x] is a principal ideal domain).

Proof

technique · direct
1.1

Let q=PR. Localizing the given chain at q preserves its length, so it is enough to bound the height of the prime PqRq[x]. By [L1], after relabelling ht(q)=r and choosing a1,,arq, the maximal ideal qRq is minimal over J=(a1/1,,ar/1).

L1given
2.1

If Pq=qRq[x], then Pq is minimal over JRq[x]: any prime of Rq[x] containing J contracts to a prime of Rq containing qRq, hence to qRq itself. Therefore [L2] gives ht(Pq)r.

L1L2step 1.1
2.2

Suppose now that PqqRq[x]. Then Pq/qRq[x] is a nonzero prime ideal of κ(q)[x], where κ(q)=Frac(R/q). By [L3], choose a lift fRq[x] whose image generates that nonzero prime of κ(q)[x]. Any prime QPq containing J and f has contraction containing J, hence equal to qRq by step 1.1; modulo qRq[x], the prime Q/qRq[x] contains the generator of Pq/qRq[x], so it equals that prime. Therefore Q=Pq, and Pq is minimal over the ideal (J,f) generated by r+1 elements.

L1L2L3step 1.1algebra
3.1

By [L2], step 2.2 gives ht(Pq)r+1=ht(q)+1dimR+1. Since the localized chain still has length n, we have nht(Pq)dimR+1. Steps 2.1 and 3.1 cover both cases.

L2step 2.1step 2.2algebra
4.1

Therefore every strict prime chain in R[x] has length at most dimR+1.

step 3.1

Depends on

Used by

Dependency tree · two levels

29 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