Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedverified 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.

Krull's height theorem

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let R be a Noetherian commutative ring, let I=(x1,…,xn) be an ideal generated by n≥1 elements, and let p be a prime ideal minimal over I. Then ht⁡(p)≤n.

Facts & Assumptions

Given: The Axiom of Choice, a Noetherian commutative ring R, an n-generated ideal I=(x1,…,xn) with n≥1, and a prime ideal p minimal over I.

[L1]

The case n=1 is Krull's principal ideal theorem (Krull's principal ideal theorem).

[L2]

Under the assumed Axiom of Choice, for n≥2 and a positive-length chain, one may replace the first generator by an element b from p1 of a same-length chain so that p is minimal over (b,x2,…,xn) (Choose the first generator's minimal prime inside the target prime).

[L3]

Under the same Choice assumption, after quotienting by that chosen b, the image p/(b) is minimal over n−1 generators and a chain ending at p loses one step (Quotienting by the first minimal prime reduces the remaining height count).

Proof

technique · induction on the number of generators
1.1L1basegiven

If n=1, [L1] gives ht⁡(p)≤1.

1.2L2ihgiven

Assume n≥2 and that the theorem is known for (n−1)-generated ideals. Suppose for contradiction that ht⁡(p)≥n+1. Then there exists a strict prime chain p=pd⊋pd−1⊋⋯⊋p0 with d≥n+1≥3. Under the assumed AC, [L2] replaces x1 by a suitable element b∈p1 of a same-length chain for which p is minimal over (b,x2,…,xn).

2.1L3step 1.2ih

By [L3], the quotient prime p/(b) is minimal over the (n−1)-generated ideal generated by the images of x2,…,xn, and the above chain descends to a strict chain of length d−1≥n ending at p/(b) in R/(b). This contradicts the induction hypothesis for (n−1) generators.

3.1step 1.1step 2.1discharge-induction∎

Therefore the assumption ht⁡(p)≥n+1 is impossible, and ht⁡(p)≤n.

Depends on

Used by

Dependency tree · two levels

13 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