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

Height is bounded by the minimal number of local generators

Statement

Assume the Axiom of Choice. Let R be a Noetherian commutative ring and let p∈Spec⁡(R). Then ht⁡(p)≤μRp(pRp), where μ denotes the minimal number of generators.

Facts & Assumptions

Given: The Axiom of Choice (The Axiom of Choice), a Noetherian commutative ring R, and a prime ideal p.

[L1]

The localization Rp is a Noetherian local ring with maximal ideal pRp (Every quotient and every localisation of a Noetherian ring is Noetherian, Rp is local with unique maximal ideal pRp).

[L2]

Under Choice, a prime minimal over an ideal generated by n≥1 elements has height at most n (Krull's height theorem).

[L3]

The height of p is the dimension of Rp (The height of a prime ideal).

Proof

technique · direct
1.1L1L2given

By [L1], the maximal ideal of the local ring Rp is pRp. Let n be its minimal number of generators, finite by Noetherianity. If n=0, the maximal ideal is zero and the local ring is a field, so its dimension is zero. If n≥1, the maximal ideal is minimal over the ideal generated by those same n elements. Applying the Choice-qualified [L2] inside Rp gives dim⁡Rp≤n.

2.1L3step 1.1

By [L3], ht⁡(p)=dim⁡Rp, so step 1.1 says ht⁡(p)≤μRp(pRp).

3.1step 2.1∎

This is the claimed local-generator bound on height.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

22 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