Alphabeta Math
TheoremStatement: 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.

Krull's height theorem

Statement

Let R be a Noetherian commutative ring, let

I=(x1,,xn)

be an ideal generated by n1 elements, and let p be a prime ideal minimal over I. Then ht(p)n.

Facts & Assumptions

Given: A Noetherian commutative ring R, an n-generated ideal I=(x1,,xn) with n1, 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]

For n2, one may replace the first generator by an element b from the penultimate prime of a chain so that p is minimal over (b,x2,,xn) (Choose the first generator's minimal prime inside the target prime).

[L3]

After quotienting by that chosen b, the image p/(b) is minimal over n1 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.1

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

L1basegiven
1.2

Assume n2 and that the theorem is known for (n1)-generated ideals. Suppose for contradiction that ht(p)n+1. Then there exists a strict prime chain p=pdpd1p0 with dn+1. By [L2], after replacing x1 by a suitable element bp1, the prime p is minimal over (b,x2,,xn).

L2ihgiven
2.1

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

L3step 1.2ih
3.1

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

step 1.1step 2.1discharge-induction

Depends on

Used by

Dependency tree · two levels

10 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