Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-27
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.

Minimal primes over a proper ideal exist

Statement

Assume the Axiom of Choice.

Let R be a commutative ring and let I⊴R be a proper ideal. Then there exists a prime ideal p of R containing I that is minimal with respect to inclusion among the prime ideals containing I.

Facts & Assumptions

Given: A commutative ring R, a proper ideal I⊴R, and the Axiom of Choice.

[L1]

If an ideal is disjoint from a multiplicative set, then some prime ideal contains it and stays disjoint from that set (A prime containing an ideal and avoiding a multiplicative set).

[L2]

Assuming the Axiom of Choice, every nonempty poset in which every chain has an upper bound has a maximal element (Zorn's lemma).

[L3]

Prime ideals are ordered by inclusion as ideals (Prime ideals and maximal ideals in a commutative ring).

Proof

technique · direct
1.1L1givenconstruct

The singleton set {1} is multiplicative and is disjoint from I because I is proper. Applying [L1] gives at least one prime ideal containing I. Let Σ be the set of all prime ideals containing I, ordered by reverse inclusion. Then Σ≠∅.

1.2L3choosealgebra

Let C⊆Σ be a chain. Put q=⋂p∈Cp. Then I⊆q. To see that q is prime, let ab∈q and assume a,b∉q. Choose pa,pb∈C with a∉pa and b∉pb. Since C is totally ordered by inclusion, either pa⊆pb or pb⊆pa. In the first case b∉pa because pa⊆pb; in the second case a∉pb. Either way one of the primes in the chain contains ab but neither factor, a contradiction. Thus q∈Σ, and it is an upper bound of C in the reverse-inclusion order.

2.1L2step 1.1step 1.2

By [L2], the poset Σ has a maximal element for reverse inclusion. Such an element is exactly a prime ideal minimal by ordinary inclusion among the primes containing I.

3.1step 2.1∎

Therefore every proper ideal lies under a minimal prime ideal.

Depends on

Used by

Dependency tree · two levels

12 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