Marcel Ern\'e
Prime Ideal Theorems and systems of finite character

Comment.Math.Univ.Carolinae 38,3 (1997) 513-536.

Abstract:We study several choice principles for systems of finite character and prove their equivalence to the Prime Ideal Theorem in ZF set theory without Axiom of Choice, among them the Intersection Lemma (stating that if $\text {\jeden S}$ is a system of finite character then so is the system of all collections of finite subsets of $\bigcup \text {\jeden S}$ meeting a common member of $\text {\jeden S}$), the Finite Cutset Lemma (a finitary version of the Teichm\"uller-Tukey Lemma), and various compactness theorems. Several implications between these statements remain valid in ZF even if the underlying set is fixed. Some fundamental algebraic and order-theoretical facts like the Artin-Schreier Theorem on the orderability of real fields, the Erd\"os-De Bruijn Theorem on the colorability of infinite graphs, and Dilworth's Theorem on chain-decompositions for posets of finite width, are easy consequences of the Intersection Lemma or of the Finite Cutset Lemma.

Keywords: axiom of choice, compact, consistent, prime ideal, system of finite character, subbase
AMS Subject Classification: 03E25, 13B25, 13B30

PDF