Mathematical Proof and the Principles of Mathematics/Sets/Power sets

From testwiki
Jump to navigation Jump to search

Power sets

Power sets allow us to discuss the class of all subsets of a given set A, i.e. {U|UA}. That this is a set is the subject of the Power Set Axiom.

Axiom

Given a set

A

there exists a set of sets

S

such that

US

iff

UA

.

Theorem Given a set A, there exists a unique set whose elements are the subsets of A.

Proof If S1 and S2 are two such sets of subsets then US1 if and only if UA. But the same is true of S2. Thus US1 iff US2, and so S1=S2 by the Axiom of Extensionality.

Definition Given a set A, the set of all subsets of A is called the power set of A. It is denoted 𝒫(A).

Example If A={a,b,c} then 𝒫(A)={,{a},{b},{c},{a,b},{a,c},{b,c},{a,b,c}}.

Cartesian products

Recall the Kuratowski definition of an ordered pair, (a,b)={{a},{a,b}} for a and b elements of a set A. Note that {a} and {a,b} are both subsets of A, i.e. they are elements of the power set 𝒫(A).

This means that (a,b) is a subset of 𝒫(A), i.e. (a,b)𝒫(𝒫(A)).

We can generalise this slightly with a simple trick. We can define (a,b) with aA and bB for sets A and B. In order to do this, we simply take the elements a and b from the union of sets AB.

In other words, we have (a,b)𝒫(𝒫(AB)) with aA and bB.

Theorem The class of all ordered pairs (a,b) of elements of AB with aA and bB, is a set.

Proof The set in question is given by {x𝒫(𝒫(AB))|x=(a,b),aAandbB}. This is a set by the axioms of Power Set, Union and the Axiom Schema of Comprehension.

Definition The set of ordered pairs (a,b) with aA and bB is called the cartesian product of A and B, and is denoted A×B.

Exercises

  • Show that for sets A,B,C,D we have (AB)×(CD)=(A×C)(B×D).
  • Show that for sets A,B,C we have A×(BC)=(A×B)(A×C).
  • Show that for sets A,B,C we have A×(BC)=(A×B)(A×C).
  • Show that for sets A,B,C with AB we have A×CB×C.

Template:Chapnav