Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 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.

Select generators witnessing the converse height theorem

Statement

Assume the Axiom of Choice.

Let R be a Noetherian commutative ring and let a⊊R be a proper ideal of height r<∞. Then there exist elements a1,…,ar∈a such that for every 1≤i≤r the ideal (a1,…,ai) has height exactly i.

Facts & Assumptions

Given: The Axiom of Choice, a Noetherian commutative ring R, a proper ideal a⊊R, and an integer r=ht⁡(a)<∞.

[L1]

A Noetherian ring has only finitely many minimal primes over a given ideal (A Noetherian ring has finitely many minimal prime ideals).

[L2]

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

[L3]

Under the Axiom of Choice, the principal ideal theorem and the height theorem bound the height of a prime minimal over i chosen generators by i (Krull's principal ideal theorem, Krull's height theorem).

Proof

technique · induction on the target height
1.1basegiven

If r=0, the empty list works.

1.2L1L2L3given

Assume r≥1. The prime ideals of height 0 are exactly the minimal primes of R, hence are finite by [L1]. None of them contains a, because ht⁡(a)=r≥1. Therefore [L2] provides a1∈a outside every height-zero prime. Any prime minimal over (a1) must then have height at least 1, while [L3] gives height at most 1. Thus (a1) has height exactly 1.

2.1L1L2L3step 1.2ih

Suppose 1<i≤r and a1,…,ai−1∈a have already been chosen so that J=(a1,…,ai−1) has height exactly i−1. The minimal primes over J are finite by [L1]. Among them, collect those of height i−1; none can contain a, because a has height r≥i. By [L2], choose ai∈a outside all of those primes. Any prime q minimal over J+(ai) contains some minimal prime p over J. If ht⁡q≤i−1, then ht⁡p≥i−1 and strict containment p⊊q would force ht⁡q≥i; hence q=p is one of the excluded height-(i−1) primes, impossible since it contains ai. Thus every such q has height at least i. By [L3] it has height at most i, so J+(ai) has height exactly i.

3.1step 1.1step 1.2step 2.1discharge-induction∎

Steps 1.1, 1.2, and 2.1 build the required list a1,…,ar∈a.

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