Next: Relations
Up: Sets and functions
Previous: Boolean Algebra and Boolean
Definition 28
The powerset of a set

is the set of all subsets of

. Standard notations for this include

,

and

.
Proposition 46

is partially ordered by

with largest element

and smallest element

.
(5 Points )
There are three ways to define functions on the powerset from a function
Definition 29
The inverse image functor

takes a subset

to the set
This is also sometimes (confusingly) written

.
Definition 30
The direct image functor

takes the subset

to the set
This functor is sometimes (again, somewhat confusingly) written as

.
Definition 31
The universal quantification functor

takes the subset

to the set
This functor is much less used than the inverse image and direct image functors.
Proposition 47
The function

is a functor; that is, if

then

.
(2 Points )
Proposition 48
The function

is a functor; that is, if

then

.
(2 Points )
Proposition 49
The function

is a functor; that is, if

then

.
(2 Points )
Proposition 50
For any

,

preserves intersection and union.
(4 Points )
Proposition 51
For any

,

preserves union, but need not preserve intersection.
(4 Points )
Proposition 52
For any

,

preserves intersection, but need not preserve union.
(4 Points )
Proposition 53
For any

and

,

if and only if

.
(4 Points )
Proposition 54
For any

and

,

if and only if

.
(4 Points )
Total for section: 141.
Next: Relations
Up: Sets and functions
Previous: Boolean Algebra and Boolean
Larry Stout
2001-08-17