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.
Krull Dimension and Height Theorems — Examples
1 · Prerequisites
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Finite Counting, Factorials and Binomial Coefficients
- Finite Fields and Cyclotomic Extensions
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Integral Extensions and Going Up
- Krull Dimension and Height Theorems
- Linear Independence, Bases and Dimension
- Localisation of Modules and Support
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Noether Normalisation and Nullstellensatz
- Noetherian Rings and Hilbert Basis
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Prime Spectra and Radicals
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Simple Field Extensions and the Construction of the Complex Numbers
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Field of Fractions and Localisation
- The ZFC Axioms and the Basic Set Constructions
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These examples compute the abstract height and dimension formulas on explicit rings. They also separate the exact hypotheses from the merely sufficient ones: zero divisors can force height-zero minimal primes over principal ideals, localization can strictly lower dimension, and systems of parameters need not minimally generate the maximal ideal.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Relative height in a quotient of k[x,y,z]
Example
Let , let , and let . Then in the prime has height .
Facts & Assumptions
Given: A field , the polynomial ring , and the primes .
Height in a quotient is the relative chain length between the two primes upstairs (Height in a quotient measures chains between two primes).
In the quotient , the prime is the principal ideal ; a prime strictly below must be zero by cancellation in the polynomial domain.
Verification
In , let be prime. If contained a nonzero polynomial , write with and . Primality would give or ; the latter is impossible because , while the former contradicts . Hence . By [L1], the only strict chain from to is and .
The quotient correspondence identifies the chain from step 1.1 with in , confirming its length is one.
Therefore the relative height in the stated quotient is one.
A principal ideal generated by a zero divisor can have a minimal prime of height zero
Example
In the ring the element is a zero divisor, and the prime ideal is minimal over the principal ideal while having height .
Facts & Assumptions
Given: A field and the ring .
Minimal primes are exactly the primes of height zero (Minimal primes are exactly the primes of height zero).
Verification
In , one has with both factors nonzero, so is a zero divisor. Also is a domain, hence is a prime ideal minimal over the principal ideal .
The ideal is one of the two minimal primes of , so [L1] gives . Therefore the exact-height-one conclusion fails for a zerodivisor generator.
So a principal ideal generated by a zero divisor can indeed have a minimal prime of height zero.
Coordinate ideals show the height bound is sharp
Example
In , the coordinate ideal is maximal, hence minimal over itself, and has height exactly .
Facts & Assumptions
Given: A field and the polynomial ring .
The polynomial ring has dimension , so every prime height in is at most (A polynomial ring in n variables over a field has dimension n).
The quotient by is the field by direct evaluation.
Verification
The quotient is a field, so is maximal and therefore prime.
For , the chain consists of primes, since each quotient is a polynomial domain over ; it gives . Fact [L1] gives the opposite bound. When , and has height zero. Thus in all cases.
Therefore the height bound in Krull's height theorem is sharp.
A system of parameters need not minimally generate the maximal ideal
Example
Let Then has dimension , the ideal is a parameter ideal, but the maximal ideal is not generated by one element.
Facts & Assumptions
Given: A field and the cusp local ring with maximal ideal .
By definition, a one-element tuple in a one-dimensional local ring is a system of parameters when its generated ideal has maximal radical (Systems of parameters and parameter ideals).
For a finite-type -domain, dimension equals fraction-field transcendence degree (Affine-domain dimension equals transcendence degree), and localization does not increase dimension (Localisation does not increase Krull dimension).
Verification
Put . Division by the monic polynomial in writes every element uniquely as ; substituting , maps this to , whose even and odd powers cannot cancel. Thus embeds in and is a domain. Its fraction field is algebraic over because , so [L2] gives ; localizing at gives . Also is Artinian local, so has radical .
If were principal, then would be one-dimensional over the residue field. But the classes of and are linearly independent modulo , so is not principal. In particular , so is not a field.
The ring is a domain by step 1.1, so is prime. Its nonzero maximal ideal from step 1.2 gives a strict prime chain , hence directly. Together with from step 1.1, this forces . Then [L1] makes a parameter ideal.
Therefore is a parameter ideal while is not principal, so a system of parameters need not minimally generate the maximal ideal.
Localisation can strictly lower dimension
Example
Let and let . Then has dimension , strictly smaller than .
Facts & Assumptions
Given: A field , the polynomial ring , and the multiplicative set .
Localization does not increase dimension (Localisation does not increase Krull dimension).
The polynomial ring has dimension (A polynomial ring in n variables over a field has dimension n).
The quotient is a domain, so is prime. Any polynomial in factors as with .
By definition, the height of a prime equals the dimension of the localization at that prime (The height of a prime ideal).
Verification
By [L2], . If a prime contained a nonzero with , primality would imply or . The former contradicts strict containment, and the latter contradicts . Thus , and the chain proves . By [L4], .
Fact [L1] independently gives , so the computed value is compatible with the general one-sided inequality. Since , this localization strictly lowers dimension.
So localization can strictly lower Krull dimension.
The polynomial-dimension formula at fields, Artinian rings, and the zero-ring boundary
Example
The theorem behaves as expected for fields and nonreduced Artinian rings, and it deliberately excludes the zero ring.
Facts & Assumptions
Given: A field , the Artinian ring , and the zero ring .
A polynomial ring in one variable over a field has dimension one (A polynomial ring in n variables over a field has dimension n).
Krull dimension is defined by prime chains, with the zero ring convention recorded separately (Krull dimension of a nonzero ring).
Primes of a quotient correspond to primes containing the quotient ideal (Prime ideals of a quotient ring are exactly the prime ideals containing the ideal).
Verification
For the field , one has and [L1] gives .
The ring is Artinian local with the single prime , so . Every prime of contains the nilpotent , and [L3] identifies its prime chains with those of . Hence [L1] gives . The nilpotent element does not change the one-step dimension jump.
The zero ring is excluded from the statement because it has no prime ideals at all. Its polynomial ring is again the zero ring, so the expression does not describe its behavior. Thus the theorem is intentionally stated only for ordinary Noetherian rings with the established zero-ring convention left separate.
The affine dimension formula on a plane curve domain
Example
Let Then is a one-dimensional affine domain. For the prime ideals and , the affine dimension formula reads
Facts & Assumptions
Given: A field , the domain , and the primes and .
Under , the ring is a PID: nonzero prime ideals are maximal, while is prime (For every field , is a principal ideal domain).
The evaluation quotient is a field, while .
Verification
Substituting gives . By [L1], any nonzero prime of this PID is maximal, and the chain shows that its dimension is exactly one. The zero prime has height zero and quotient of dimension one.
By [L2], has dimension zero. The chain and [L1] give . Thus ; at the corresponding sum is .
Both displayed instances hold by direct computation in , without invoking the general affine dimension formula.