# Borel equivalence relations by Vladimir Kanovei

###############################################################################################################################################################################################################################################################

Best pure mathematics books

Set Theory and Metric Spaces

This booklet is predicated on notes from a path on set idea and metric areas taught via Edwin Spanier, and likewise comprises along with his permission various routines from these notes. The quantity comprises an Appendix that is helping bridge the space among metric and topological areas, a specific Bibliography, and an Index.

Introduction to the Theory of Sets

Set idea permeates a lot of up to date mathematical inspiration. this article for undergraduates deals a traditional creation, constructing the topic via observations of the actual international. Its innovative improvement leads from finite units to cardinal numbers, limitless cardinals, and ordinals. routines seem during the textual content, with solutions on the finish.

Set Theory-An Operational Approach

Provides a unique method of set idea that's totally operational. This technique avoids the existential axioms linked to conventional Zermelo-Fraenkel set conception, and offers either a origin for set conception and a pragmatic method of studying the topic.

Extra info for Borel equivalence relations

Example text

Hence m ∈ n. These theorems show that “∈” behaves on N just like the usual ordering “<” on the natural numbers. In fact, we often use “<” for “∈” when writing about the natural numbers. We also use the relation symbols ≤, >, and ≥ in their usual sense. 34 CHAPTER 4. THE NATURAL NUMBERS The next theorem scheme justifies ordinary mathematical induction. For brevity let us write w for w1 , . . , wn . For each formula Φ(v, w) of the language of set theory we have: Theorem 8. Φ For all w, if ∀n ∈ N [(∀m ∈ n Φ(m, w)) → Φ(n, w)] then ∀n ∈ N Φ(n, w).

This is possible since κ is a limit ordinal. It now suffices to prove that type <← { δ, δ }, < < κ. By Theorem 23 it suffices to prove that |<← { δ, δ }| < κ and so it suffices to prove that |δ × δ| < κ. Since |δ × δ| = ||δ| × |δ||, it suffices to prove that |λ × λ| < κ for all cardinals λ < κ. If λ is infinite, this is true by inductive hypothesis. If λ is finite, then |λ × λ| < ω ≤ κ. 62 CHAPTER 7. CARDINALITY Corollary. If X is infinite, then |X × Y | = max {|X|, |Y |}. Theorem 26. For any X we have | X| ≤ max {|X|, sup {|a| : a ∈ X}}, provided that at least one element of X ∪ {X} is infinite.

The fact that N ∈ ON now follows immediately from Theorem 6. , ω = N. Theorems 6 and 12 now show that the natural numbers are the smallest ordinals, which are immediately succeeded by ω, after which the rest follow. The other ordinals are generated by two processes illustrated by the next lemma. Lemma. 1. ∀α ∈ ON ∃β ∈ ON β = succ(α). 2. ∀S [S ⊆ ON → ∃β ∈ ON β = S]. Exercise 7. Prove this lemma. For S ⊆ ON we write sup S for the least element of {β ∈ ON : (∀α ∈ S)(α ≤ β)} if such an element exists.