By W. Weiss

Show description

Read Online or Download An Introduction to Set Theory PDF

Similar pure mathematics books

Fractals

Explaining Mandelbrot's fractal geometry, and describing a few of its purposes within the wildlife, this ebook steers a center direction among the formality of many papers in arithmetic and the informality of picture-oriented ebook on fractals. Fractal geometry exploits a attribute estate of the genuine international - self-similarity - to discover basic ideas for the meeting of complicated typical items.

Advanced Engineering Mathematics

Sleek and finished, the hot 6th variation of award-winning writer, Dennis G. Zill’s complex Engineering arithmetic is a compendium of issues which are generally coated in classes in engineering arithmetic, and is very versatile to fulfill the original wishes of classes starting from usual differential equations, to vector calculus, to partial differential equations.

Study Guide for Applied Finite Mathematics

Sensible and proper functions from quite a few disciplines aid encourage company and social technology scholars taking a finite arithmetic direction. a versatile company permits teachers to tailor the booklet to their direction

Set Theory-An Operational Approach

Provides a singular method of set idea that's fullyyt operational. This method avoids the existential axioms linked to conventional Zermelo-Fraenkel set thought, and gives either a beginning for set thought and a pragmatic method of studying the topic.

Extra info for An Introduction to Set Theory

Example text

X| ≥ |y| iff ∃ surjection f : x → y. Assume here that y = ∅. Theorem 24. (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 κ, |κ × κ| = κ.

Show that ω + 1 is not a cardinal and that, in fact, each other cardinal is a limit ordinal. Theorem 23. The following are equivalent. 1. κ is a cardinal. 2. , |κ| = κ. 3. (∀α < κ)(¬∃ injection f : κ → α). 59 60 CHAPTER 7. CARDINALITY Proof. We prove the negations of each are equivalent: ¬(1) (∀x)[(∃ bijection g : x → κ) → (∃α < κ)(∃ bijection h : x → α)] ¬(2) ∃α < κ ∃ bijection f : κ → α ¬(3) ∃α < κ ∃ injection f : κ → α ¬(2) ⇒ ¬(1) Just take h = f ◦ g. ¬(1) ⇒ ¬(3) Just consider x = κ. ¬(3) ⇒ ¬(2) Suppose α < κ and f : κ → α is an injection.

A relation R on X with the property that f (x) < f (y) whenever x, y ∈ R must be a well founded relation. In fact, this turns out to be a characterisation. Theorem 19. Let R be a relation on a set X. R is well founded iff there is an ordinal δ and a surjection f : X → δ such that f (x) < f (y) whenever x, y ∈ R. Proof. We treat only the forward implication. Using recursion on ON we define g : ON → P(X) by g(β) = x : x is a minimal element of X \ {g(α) : α < β} . From g we obtain f : X → ON by f (x) = the unique α ∈ ON with x ∈ g(α), if possible; 0, otherwise.

Download PDF sample

Rated 4.32 of 5 – based on 44 votes