Axiomatic set theory - PowerPoint PPT Presentation

1 / 26
About This Presentation
Title:

Axiomatic set theory

Description:

Jouko V n nen: Set theory. 4. Make them disjoint. Return to the ... Jouko V n nen: Set theory. 9. We need a function. which picks an ... Set theory. 11 ... – PowerPoint PPT presentation

Number of Views:108
Avg rating:3.0/5.0
Slides: 27
Provided by: Jou9
Category:
Tags: axiomatic | set | theory

less

Transcript and Presenter's Notes

Title: Axiomatic set theory


1
Axiomatic set theory
  • Jouko Väänänen

2
Axiom of Choice AC
x
y
3
Another formulation AC
x
f
4
AC? AC
Choose elements using AC
Make them disjoint
Return to the original sets
5
AC ? AC
x
f
AC gives f
Then take the range of f
You get the set required to exist in AC
6
Well-ordering principle
7
WO ?AC
Well-order the union
The choice set y is the set of points z in the
union such that in the particular unique (!) set
that z belongs to, it is lt-smallest.
8
A useful fact
  • If X is a set, there is no one-one class function
    fOn ? X.
  • Proof. Otherwise, by the Axiom of Subset
    Selection, Yf(On)?X is a set. Thus we can form
    the function f-1Y ? On. By the Axiom of
    Replacement, f-1(Y) is a set of ordinals. Let ?
    be an ordinal greater than all ordinals in
    f-1(Y). Then f(?) is in Y, so ?f-1(f(?)) is in
    f-1(Y), a contradiction.

9
AC ? WO
We need a function which picks an element like
this
From this non-empty set
The point is AC gives such a function
10
Zorns Lemma
A maximal element
.... an upper bound
Every chain has an ....
11
Intuitive proof of ZL
Starting from any element we keep picking larger
and larger elements until we hit a maximal
element. If we do not hit any such, we have
anyway built a chain. By assumption, this chain
has an upper bound. So we have to hit a maximal
element.
12
WO ?Zorns Lemma
P is first well ordered
g(?) is chosen to be the least (in the w.o.)
strict upper bound, if any
g(?)
g(?) ?lt?
Note that we use recursion on ordinals
13
An application of AC
  • We show that there is a non-measurable set of
    real numbers.
  • The collection of measurable sets of real numbers
    have the following properties
  • ? and all intervals a,b are measurable.
  • The complement of a measurable set is measurable.
  • The union of countably many measurable sets is
    always measurable.
  • If A is measurable, then Arxrx?A is
    measurable, what ever r is.

14
Lebesgue-measure
  • The Lebesgue-measure m(A) of a measurable set A
    is defined so that the following hold
  • m(?)0, m(a,b)b-a
  • If the measurable sets An are disjoint, then
    m(?nAn)?n m(An)
  • If A is measurable, then m(Ar)m(A) for all
    reals r.

15
A non-measurable set
  • Define on 0,1 x?y iff x-y is rational.
  • This is an equivalence relation.
  • By AC there is a set A which has exactly one
    element from each ?-equivalence class.
  • We show that A is non-measurable.
  • Assume otherwise. Let rm(A).

16
We derive a contradiction
  • 0,1? ?q(Aq) ?-1,2, where q ranges over
    Q?0,1.
  • 1?m(?q(Aq))?q m(Aq)?q r?3.
  • If r0, we cannot have 1 ? ?q r
  • If rgt0, we cannot have ?q r?3.
  • We have arrived at a contradiction.
  • So A is not measurable. QED

17
Banach-Tarski Paradox
  • Another application of AC
  • The unit sphere in the three dimensional
    Euclidean space can be divided into five pieces
    so that by reassembling the pieces in space we
    get two unit spheres of the same size as the
    original.
  • The trick the pieces are non-measurable, so we
    cannot say that e.g. volume has been doubled. The
    pieces (or at least some of them) simply do not
    have volume.

18
Ordinal addition
?
?
??
19
Ordinal addition formally
  • A(? x 0)?(? x 1)
  • (?,i)ltA(?,j) iff (iltj) v (ij ?lt?)

?
1
?
0
20
Non-commutativity
1 ? ? ? 1
?
1
has last element
does not have last element
?
1
21
Associativity
?
?
?
??
??
(??)?
?(??)
22
Cancellation laws??
? ? ? ? ? ? ? ?
Yes
? ? ? ? ? ? ? ?
No
23
Ordinal sum
?0
?1
?2
?0?1?2
24
Ordinal sum
?0
?1
??
...
...
??lt???
25
Example
1
1
1
...
...
?nlt?1 ?
26
Ordinal sum
??lt???
??
...
...
...
?
?
Write a Comment
User Comments (0)
About PowerShow.com