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

Choose a parameter that misses the top-dimensional minimal components

Statement

Assume the Axiom of Choice. Let (R,m) be a Noetherian local ring of finite positive dimension d. Then there exists x∈m outside every minimal prime of R. For every such x one has dim⁡(R/(x))≤d−1. In particular x misses the top-dimensional minimal components.

Facts & Assumptions

Given: The Axiom of Choice (The Axiom of Choice) and a Noetherian local ring (R,m) with 0<d=dim⁡R<∞.

[L1]

Under Choice, a Noetherian ring has finitely many minimal primes (A Noetherian ring has finitely many minimal prime ideals).

[L2]

Finite prime avoidance chooses an element of m outside finitely many proper prime ideals (An ideal contained in a finite union of prime ideals lies in one of them).

[L3]

Under Choice, if a prime is minimal over a principal ideal generated by a nonzerodivisor, then it has height 1 (A minimal prime over a principal nonzerodivisor has height one).

[L4]

Prime ideals of a quotient correspond to primes upstairs containing the quotient ideal (Prime ideals of a quotient ring are exactly the prime ideals containing the ideal).

Proof

technique · direct
1.1L1L2given

By [L1], the minimal primes of R form a finite set; because d>0, none equals m. Hence [L2] provides x∈m outside every minimal prime.

2.1L3L4step 1.1given

Let p/(x) be a minimal prime of R/(x). By [L4], the prime p is minimal over (x) in R. Choose a minimal prime q⊆p. Since x∉q, its image in the domain R/q is a nonzerodivisor. The prime p/q is minimal over that image: an intervening prime would give a prime strictly below p containing x. Thus [L3] gives ht⁡R/q(p/q)=1. Every chain in R/p extends upward to a chain in R/q longer by one step.

3.1step 2.1given

Since dim⁡(R/q)≤d, step 2.1 implies dim⁡(R/p)≤d−1. Taking the supremum over all minimal primes p/(x) of R/(x) yields dim⁡(R/(x))≤d−1.

4.1step 1.1step 3.1∎

Thus one can choose a first parameter outside the minimal components, and every such choice lowers dimension by at least one.

Depends on

Used by

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