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.
Select generators witnessing the converse height theorem
Statement
Assume the Axiom of Choice.
Let be a Noetherian commutative ring and let be a proper ideal of height . Then there exist elements such that for every the ideal has height exactly .
Facts & Assumptions
Given: The Axiom of Choice, a Noetherian commutative ring , a proper ideal , and an integer .
A Noetherian ring has only finitely many minimal primes over a given ideal (A Noetherian ring has finitely many minimal prime ideals).
Finite prime avoidance lets us choose an element outside finitely many forbidden prime ideals (An ideal contained in a finite union of prime ideals lies in one of them).
Under the Axiom of Choice, the principal ideal theorem and the height theorem bound the height of a prime minimal over chosen generators by (Krull's principal ideal theorem, Krull's height theorem).
Proof
If , the empty list works.
Assume . The prime ideals of height are exactly the minimal primes of , hence are finite by [L1]. None of them contains , because . Therefore [L2] provides outside every height-zero prime. Any prime minimal over must then have height at least , while [L3] gives height at most . Thus has height exactly .
Suppose and have already been chosen so that has height exactly . The minimal primes over are finite by [L1]. Among them, collect those of height ; none can contain , because has height . By [L2], choose outside all of those primes. Any prime minimal over contains some minimal prime over . If , then and strict containment would force ; hence is one of the excluded height- primes, impossible since it contains . Thus every such has height at least . By [L3] it has height at most , so has height exactly .
Steps 1.1, 1.2, and 2.1 build the required list .
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.
Sources
- J. S. Milne, A Primer of Commutative Algebra, v4.03, §21 (standard reference, not scraped)
- Melvin Hochster, Dimension theory and systems of parameters (standard reference, not scraped)