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
Assume the Axiom of Choice. Let be a Noetherian commutative ring and let contract to of finite height . Then If , consequently every strict prime chain in has length at most , with the usual extended-integer interpretation if is infinite.
Facts & Assumptions
Given: The Axiom of Choice, a Noetherian commutative ring , and a prime of over of finite height . The Axiom of Choice is The Axiom of Choice; it is spent in [L1] and [L2].
Assuming the Axiom of Choice, the maximal ideal in the Noetherian local ring is minimal over an ideal generated by elements (Converse to Krull's height theorem in localised form, The height of a prime ideal, is local with unique maximal ideal , Every quotient and every localisation of a Noetherian ring is Noetherian).
Assuming the Axiom of Choice, a prime minimal over an ideal generated by elements in a Noetherian ring has height at most (Krull's height theorem). The polynomial ring is Noetherian when is Noetherian (Hilbert basis theorem: if is Noetherian then is Noetherian).
If is prime, then is a polynomial ring over the domain , 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 , is a principal ideal domain).
Proof
Put , , , and . Every prime below contracts into and is disjoint from , so localization preserves all chains below and . Contraction from also shows that exactly when . Likewise . Under the assumed Choice hypothesis, [L1] supplies such that is minimal over in . Because is local with maximal ideal , it is the only prime of containing .
If , any prime containing contracts to a prime of containing , hence to by step 1.1. Thus contains and equals it, proving that is minimal over . For , [L2] gives ; for , is a minimal prime of because is the only prime of , so its height is zero. Conversely a chain of length below extends coefficientwise to a chain of prime ideals below , giving . Therefore this case has height exactly .
If , its image is a nonzero prime of the PID . By [L3], choose lifting a generator of that prime. Any prime containing and contracts to by step 1.1, hence contains . Its image modulo contains the generator of , and containment in forces equality. So and is minimal over , which has generators. By [L2], . The extended coefficientwise chain below , followed by the strict inclusion , gives the reverse inequality. Hence .
For , consider any strict chain ending at a prime of . If is finite, steps 2.1–2.2 bound its length by . If the contraction has infinite height, then and the claimed extended-integer bound is automatic.
Thus the exact relative height formula and the original chain bound both hold under the stated Choice hypothesis.
Depends on
- The Axiom of Choice
- The height of a prime ideal
- Hilbert basis theorem: if $R$ is Noetherian then $R[x]$ is Noetherian
- Krull's height theorem
- Converse to Krull's height theorem in localised form
- $R_{\mathfrak p}$ is local with unique maximal ideal $\mathfrak pR_{\mathfrak p}$
- Every quotient and every localisation of a Noetherian ring is Noetherian
- For every field $F$, $F[x]$ is a principal ideal domain
- Prime ideals of a quotient ring are exactly the prime ideals containing the ideal
Used by
Dependency tree · two levels
34 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
- J. S. Milne, A Primer of Commutative Algebra, v4.03, §§18, 21 (standard reference, not scraped)
- Melvin Hochster, Dimension theory and systems of parameters (standard reference, not scraped)