# An Introduction to Set Theory by W. Weiss

By W. Weiss

Best pure mathematics books

Set Theory

Set idea has skilled a swift improvement in recent times, with significant advances in forcing, internal types, huge cardinals and descriptive set thought. the current ebook covers every one of those parts, giving the reader an figuring out of the tips concerned. it may be used for introductory scholars and is vast and deep sufficient to convey the reader close to the bounds of present learn.

Set Theory: Annual Boise Extravaganza in Set Theory

This ebook involves papers provided on the first 3 conferences of the Boise Extravaganza in Set idea (BEST) at Boise nation college (Idaho) in 1992, 1993, and 1994. Articles during this quantity current contemporary ends up in numerous parts of set theory.

Features: here's a sampling of coated topics.

clear out video games and combinatorial houses of successful thoughts (C. Laflamme).
Meager units and limitless video games (M. Scheepers).
Cardinal invariants linked to Hausdorff capacities (J. Steprans).

Basic Set Theory

The most notions of set conception (cardinals, ordinals, transfinite induction) are primary to all mathematicians, not just to people who concentrate on mathematical common sense or set-theoretic topology. easy set idea is mostly given a quick evaluation in classes on research, algebra, or topology, although it is satisfactorily vital, attention-grabbing, and easy to benefit its personal leisurely remedy.

Extra resources for An Introduction to Set Theory

Sample text

Let κ = sup {|a| : a ∈ X}. Using Exercise 20, for each a ∈ X there is a surjection fa : κ → a. Define a surjection f : X × κ → X by f ( a, α ) = fa (α). Using Exercise 20 and the previous corollary, the result follows. Define B A as {f : f : B → A} and [A]κ as {x : x ⊆ A ∧ |x| = κ}. Lemma. If κ is an infinite cardinal, then |κ κ| = |[κ]κ | = |P(κ)|. Proof. We have, κ 2⊆ κ κ ⊆ [κ × κ]κ ⊆ P(κ × κ). Using characteristic functions it is easily proved that |κ 2| = |P(κ)|. Since |κ × κ| = κ we have the result.

G. Cantor) ∀x |x| < |P(x)|. Proof. First note that if |x| ≥ |P(x)|, then there would be a surjection g : x → P(x). But this cannot happen, since {a ∈ x : a ∈ / g(a)} ∈ / g → (x). 61 For any ordinal α, we denote by α+ the least cardinal greater than α. This is well defined by Theorem 24. Exercise 21. Prove the following: 1. The supremum of a set of cardinals is a cardinal. 2. ¬∃z z = {κ : κ is a cardinal}. Theorem 25. For any infinite cardinal κ, |κ × κ| = κ. Proof. Let κ be an infinite cardinal.

For just such an n, choose m ∈ N with m ⊆ n, m = n, and m ∈ / n. Using Foundation, choose l ∈ n \ m such that l ∩ (n \ m) = ∅. Transitivity gives l ⊆ n, so we must have l ⊆ m. We have l = m since l ∈ n and m ∈ / n. Therefore we conclude that m \ l = ∅. Using Foundation, pick k ∈ m \ l such that k ∩ (m \ l) = ∅. Transitivity of m gives k ⊆ m and so we have k ⊆ l. Now, because l ∈ n we have l ∈ N and l ∈ / S so that either k = l or k ∈ l. However, k = l contradicts l ∈ / m and k ∈ l contradicts k ∈ m \ l.