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.

Select generators witnessing the converse height theorem

Statement

Let R be a Noetherian commutative ring and let aR be a proper ideal of height r<. Then there exist elements a1,,ara such that for every 1ir the ideal (a1,,ai) has height exactly i.

Facts & Assumptions

Given: A Noetherian commutative ring R, a proper ideal aR, 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]

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

If r=0, the empty list works.

basegiven
1.2

Assume r1. 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)=r1. Therefore [L2] provides a1a 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.

L1L2L3given
2.1

Suppose 1<ir and a1,,ai1a have already been chosen so that (a1,,ai1) has height exactly i1. The minimal primes over that ideal are finite by [L1]. Among them, collect those of height i1; none can contain a, because a has height ri. By [L2], choose aia outside all of those primes. Then every prime minimal over (a1,,ai) has height at least i, because otherwise it would sit inside one of the excluded height-(i1) minimal primes. On the other hand [L3] bounds its height by i. Hence (a1,,ai) has height exactly i.

L1L2L3step 1.2ih
3.1

Steps 1.1, 1.2, and 2.1 build the required list a1,,ara.

step 1.1step 1.2step 2.1discharge-induction

Depends on

Used by

Dependency tree · two levels

12 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