Boolean prime ideal theorem
E1215846
UNEXPLORED
The Boolean prime ideal theorem is a set-theoretic principle weaker than the full axiom of choice that guarantees the existence of prime ideals in Boolean algebras and has important applications in topology, logic, and algebra.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Boolean prime ideal theorem canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T16474849 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Boolean prime ideal theorem Context triple: [Tychonoff theorem for products of compact spaces, relatedTo, Boolean prime ideal theorem]
-
A.
Krull’s principal ideal theorem
Krull’s principal ideal theorem is a fundamental result in commutative algebra that relates the height of prime ideals containing a principal ideal to the Krull dimension of the ring.
-
B.
Hilbert’s Nullstellensatz
Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
-
C.
Hausdorff maximal principle
The Hausdorff maximal principle is a foundational result in set theory and order theory stating that every partially ordered set contains a maximal totally ordered subset (a maximal chain), and it is equivalent to the axiom of choice.
-
D.
Tychonoff theorem for products of compact spaces
The Tychonoff theorem for products of compact spaces is a fundamental result in topology stating that any product of compact topological spaces is compact, a statement that is equivalent in strength to the axiom of choice.
-
E.
Lasker–Noether theorem on primary decomposition
The Lasker–Noether theorem on primary decomposition is a fundamental result in commutative algebra stating that every ideal in a Noetherian ring can be expressed as a finite intersection of primary ideals, generalizing the factorization of integers into prime powers.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Boolean prime ideal theorem Target entity description: The Boolean prime ideal theorem is a set-theoretic principle weaker than the full axiom of choice that guarantees the existence of prime ideals in Boolean algebras and has important applications in topology, logic, and algebra.
-
A.
Krull’s principal ideal theorem
Krull’s principal ideal theorem is a fundamental result in commutative algebra that relates the height of prime ideals containing a principal ideal to the Krull dimension of the ring.
-
B.
Hilbert’s Nullstellensatz
Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
-
C.
Hausdorff maximal principle
The Hausdorff maximal principle is a foundational result in set theory and order theory stating that every partially ordered set contains a maximal totally ordered subset (a maximal chain), and it is equivalent to the axiom of choice.
-
D.
Tychonoff theorem for products of compact spaces
The Tychonoff theorem for products of compact spaces is a fundamental result in topology stating that any product of compact topological spaces is compact, a statement that is equivalent in strength to the axiom of choice.
-
E.
Lasker–Noether theorem on primary decomposition
The Lasker–Noether theorem on primary decomposition is a fundamental result in commutative algebra stating that every ideal in a Noetherian ring can be expressed as a finite intersection of primary ideals, generalizing the factorization of integers into prime powers.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.