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.
A prime containing an ideal and avoiding a multiplicative set
Statement
Assume the Axiom of Choice.
Let be a commutative ring, let be a multiplicative subset, and let be an ideal with . Then there exists a prime ideal of such that and .
Facts & Assumptions
Given: A commutative ring , a multiplicative subset , an ideal with , and the Axiom of Choice.
A prime ideal is a proper ideal such that implies or (Prime ideals and maximal ideals in a commutative ring).
A multiplicative subset contains and is closed under multiplication (Multiplicative subsets and the localisation as equivalence classes of fractions).
Assuming the Axiom of Choice, every nonempty poset in which every chain has an upper bound has a maximal element (Zorn's lemma).
Proof
Let be the set of ideals with and , ordered by inclusion. The ideal lies in , so .
If is a chain, then is an ideal containing . Moreover , because if then for some , contradicting . Thus every chain in has an upper bound.
Zorn's lemma yields a maximal member of . Because by [L2] and , the ideal is proper.
Suppose while and . By maximality of in , the larger ideals and must meet . Choose and with and . Then , because . But by [L2], contradicting . Therefore is prime by [L1].
The ideal is prime, contains , and is disjoint from , exactly as required.
Depends on
Used by
Dependency tree · two levels
13 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
- J. S. Milne, A Primer of Commutative Algebra, v4.03, §2 Ideals (standard reference, not scraped)
- A. Altman and S. Kleiman, A Term of Commutative Algebra, 13th ed., §2 Ideals (standard reference, not scraped)