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 the first generator's minimal prime inside the target prime

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let R be a Noetherian commutative ring, let n≥2, let I=(x1,…,xn), and let p be a prime ideal minimal over I. Let p1′,…,pr′ be the minimal prime ideals over (x2,…,xn). If p is not one of the pi′ and if d≥1 and p=pd⊋pd−1⊋⋯⊋p0 is a strict prime chain, then there exists a strict prime chain of the same length ending at p whose prime p1 (the first above p0) is not contained in any pi′. For such a chain one can choose b∈p1∖⋃i=1rpi′, and then p is minimal over (b,x2,…,xn).

Facts & Assumptions

Given: The Axiom of Choice, a Noetherian commutative ring R, an integer n≥2, the ideal I=(x1,…,xn), a prime ideal p minimal over I, the minimal primes p1′,…,pr′ over (x2,…,xn), and a strict chain p=pd⊋⋯⊋p0 of length d≥1.

[L1]

Under the assumed Axiom of Choice, a Noetherian ring has finitely many minimal primes over any ideal, and the radical of the ideal is their intersection. AC supplies the minimal-prime existence premise and includes the Dependent Choice used by the finite decomposition (A Noetherian ring has finitely many minimal prime ideals, A radical ideal in a Noetherian ring is a finite intersection of minimal primes, Minimal primes over a proper ideal exist).

[L2]

Finite prime avoidance lets us choose an element outside a finite union of prime ideals once the ambient ideal is not contained in that union (An ideal contained in a finite union of prime ideals lies in one of them).

[L3]

Every prime minimal over a principal ideal has height at most 1 (Krull's principal ideal theorem).

Proof

technique · direct
1.1L1L2given

Write J=(x2,…,xn). By [L1], the family {p1′,…,pr′} is finite. Every pi′ is minimal among primes containing J. Since p contains J but is not one of them, p⊈pi′ for every i. Finite prime avoidance [L2] therefore supplies an element of p outside their union. The given chain has d≥1, so its p1 exists.

2.1L1L2L3step 1.1choose

Starting at j=d−1 and descending to j=1, keep the current strict chain and the invariant that pj+1 is contained in none of the pi′. If pj already has this property, leave it unchanged. Otherwise choose c∈pj+1∖⋃ipi′ by [L2]. Since pj−1⊊pj⊆pi′ for at least one i, the element c is outside pj−1. In the Noetherian quotient A=R/pj−1, the radical of (cˉ) is the finite intersection of its minimal primes by [L1]. The prime pj+1/pj−1 contains this intersection, so by primality it contains one of those minimal primes; call its inverse image q. Then pj−1⊊q because c∈q but c∉pj−1. By [L3] the selected prime has height at most 1 in A, whereas pj+1/pj−1 has the two-step chain through pj/pj−1. Thus q⊊pj+1. It also contains c, so it is contained in none of the pi′. Replacing pj by q preserves the chain length and establishes the invariant one level lower.

3.1step 1.1step 2.1

After the finite descent in step 2.1, p1 is contained in none of the pi′. When d=1, this says p1=p, as already established in step 1.1.

4.1L2step 3.1

Since p1 is not contained in the finite union ⋃ipi′, [L2] gives b∈p1∖⋃ipi′. In particular b∈p, so p contains (b,x2,…,xn).

5.1L3step 4.1given

Let q⊆p be prime minimal over (b,x2,…,xn). Because q contains (x2,…,xn), it contains one of the minimal primes pi′. By the choice of b, one has b∉pi′, so q≠pi′. If q≠p, then p⊋q⊋pi′ is a strict chain in the quotient ring R/(x2,…,xn), so the prime p/(x2,…,xn) has height at least 2. But p is minimal over (x1,…,xn), hence p/(x2,…,xn) is minimal over the principal ideal generated by the image of x1, contradicting [L3]. Therefore q=p.

6.1step 5.1∎

Hence p is minimal over (b,x2,…,xn), with b chosen from p1 of a chain of the same length.

Depends on

Used by

Dependency tree · two levels

17 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