• In mathematics, the Boolean prime ideal theorem states that ideals in a Boolean algebra can be extended to prime ideals. A variation of this statement...
    15 KB (2,256 words) - 13:54, 6 April 2025
  • unions and subsets Semigroup ideal Boolean prime ideal theorem – Ideals in a Boolean algebra can be extended to prime ideals Taylor (1999), p. 141: "A directed...
    13 KB (1,762 words) - 08:42, 16 June 2025
  • In mathematics, the prime ideal theorem may be the Boolean prime ideal theorem the Landau prime ideal theorem on number fields This disambiguation page...
    187 bytes (53 words) - 19:51, 29 December 2019
  • (Boolean algebra) Conjunctive normal form Disjunctive normal form Formal system And-inverter graph Logic gate Boolean analysis Boolean prime ideal theorem...
    6 KB (271 words) - 23:18, 23 July 2024
  • the theorem is equivalent to the Boolean prime ideal theorem, a weakened choice principle that states that every Boolean algebra has a prime ideal. An...
    6 KB (727 words) - 08:29, 24 June 2025
  • Boolean formula Boolean prime ideal theorem, a theorem which states that ideals in a Boolean algebra can be extended to prime ideals Binary (disambiguation)...
    2 KB (254 words) - 17:45, 24 May 2025
  • Thumbnail for Boolean algebra (structure)
    However, the theory of Boolean rings has an inherent asymmetry between the two operators, while the axioms and theorems of Boolean algebra express the symmetry...
    49 KB (3,372 words) - 02:25, 17 September 2024
  • Thumbnail for Krein–Milman theorem
    ideal theorem (BPI), which is equivalent to the Banach–Alaoglu theorem. Conversely, the Krein–Milman theorem KM together with the Boolean prime ideal...
    20 KB (2,957 words) - 19:03, 30 July 2025
  • two-sided ideal coincide, and the term ideal is used alone. Modular arithmetic Noether isomorphism theorem Boolean prime ideal theorem Ideal theory Ideal (order...
    38 KB (6,312 words) - 05:55, 3 August 2025
  • Thumbnail for Axiom of choice
    choice). Stone's representation theorem for Boolean algebras needs the Boolean prime ideal theorem. The Nielsen–Schreier theorem, that every subgroup of a free...
    59 KB (7,909 words) - 23:43, 28 July 2025
  • some form of the axiom of choice; the Boolean prime ideal theorem is known to be sufficient. The proof of the theorem uses geometric features of Hilbert...
    5 KB (652 words) - 03:53, 19 August 2024
  • continuity Lindenbaum algebra Zorn's lemma Hausdorff maximality theorem Boolean prime ideal theorem Ultrafilter Ultrafilter lemma Tree (set theory) Tree (descriptive...
    5 KB (396 words) - 23:32, 16 April 2025
  • Thumbnail for Monotonic function
    be proven optimal provided that the heuristic they use is monotonic. In Boolean algebra, a monotonic function is one such that for all ai and bi in {0...
    19 KB (2,475 words) - 06:23, 2 July 2025
  • Thumbnail for Ultrafilter on a set
    The Boolean prime ideal theorem (BPIT). Stone's representation theorem for Boolean algebras. Any product of Boolean spaces is a Boolean space. Boolean Prime...
    47 KB (7,379 words) - 19:30, 5 June 2025
  • In mathematics, Kruskal's tree theorem states that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered under...
    15 KB (2,017 words) - 09:37, 5 August 2025
  • compactness theorem and to the Boolean prime ideal theorem) may be used instead. Hahn–Banach can also be proved using Tychonoff's theorem for compact...
    77 KB (12,649 words) - 15:49, 23 July 2025
  • of perfect graphs can provide an alternative proof of Dilworth's theorem. The Boolean lattice Bn is the power set of an n-element set X—essentially {1...
    18 KB (2,445 words) - 18:06, 31 December 2024
  • theorem follows. In fact, the compactness theorem is equivalent to Gödel's completeness theorem, and both are equivalent to the Boolean prime ideal theorem...
    14 KB (1,931 words) - 02:43, 16 June 2025
  • topological approach to the ultrafilter lemma (equivalently, the Boolean prime ideal theorem), which is a weak form of the axiom of choice. In some ways,...
    15 KB (2,288 words) - 20:07, 21 January 2025
  • Indeed, it is not hard to see that it is equivalent to the Boolean prime ideal theorem (BPI), a well-known intermediate point between the axioms of...
    15 KB (2,102 words) - 12:10, 17 July 2025
  • compactness theorem) rely on the axiom of choice, and is in fact equivalent over Zermelo–Fraenkel set theory without choice to the Boolean prime ideal theorem. Other...
    63 KB (9,064 words) - 09:00, 2 July 2025
  • of sets. However, the proofs of both statements require the Boolean prime ideal theorem, a weak form of the axiom of choice. The free distributive lattice...
    17 KB (2,061 words) - 16:03, 7 May 2025
  • Zeilberger–Bressoud theorem (combinatorics) Birkhoff's representation theorem (lattice theory) Boolean prime ideal theorem (mathematical logic) Bourbaki–Witt theorem (order...
    78 KB (6,296 words) - 20:31, 6 July 2025
  • Thumbnail for Functional analysis
    Many theorems require the Hahn–Banach theorem, usually proved using the axiom of choice, although the strictly weaker Boolean prime ideal theorem suffices...
    20 KB (2,496 words) - 09:16, 17 July 2025
  • Thumbnail for Ultrafilter
    ultrafilter does not imply AC. Indeed, it is equivalent to the Boolean prime ideal theorem (BPIT), a well-known intermediate point between the axioms of...
    20 KB (2,961 words) - 10:34, 22 May 2025
  • axiom of choice). The principle is also called the Hausdorff maximality theorem or the Kuratowski lemma (Kelley 1955:33). The Hausdorff maximal principle...
    13 KB (2,424 words) - 02:29, 14 July 2025
  • interior operator and closure operator to be modal operators on the power set Boolean algebra of an Alexandroff-discrete space, their construction is a special...
    12 KB (1,604 words) - 17:27, 20 July 2025
  • Boolean algebras are the same thing. This result depends on the Boolean prime ideal theorem, a choice principle slightly weaker than the axiom of choice...
    75 KB (9,571 words) - 10:59, 18 July 2025
  • the Boolean algebra of regular open sets in the Stone space of prime ideals of A. Each element x of A corresponds to the open set of prime ideals not...
    10 KB (1,349 words) - 00:48, 15 July 2025
  • p} . Every prime ideal is a maximal ideal in a Boolean ring, i.e., a ring consisting of only idempotent elements. In fact, every prime ideal is maximal...
    11 KB (1,862 words) - 22:41, 30 July 2025