Next: Finite and Infinite
Up: Problems for Techniques of
Previous: Equivalence Relations
Definition 41
The powerset of a set
A is the set of all subsets of
A. Standard notations for this include
P(
A),

and 2
A.
Proposition 5.1

is partially ordered by

with largest element
A and smallest element

.
There are three ways to define functions on the powerset from a function
Definition 42
The inverse image functor

takes a subset
B' to the set
This is also sometimes (confusingly) written
f-1(
B').
Definition 43
The direct image functor

takes the subset
A' to the set
This functor is sometimes (again, somewhat confusingly) written as
f(
A').
Definition 44
The universal quantification functor

takes the subset
A' to the set
This functor is much less used than the inverse image and direct image functors.
Proposition 5.2
The function

is a functor; that is, if

then

.
Proposition 5.3
The function

is a functor; that is, if

then

.
Proposition 5.4
The function

is a functor; that is, if

then

.
Proposition 5.5
If f is an epimorphism then so is f*.
Proposition 5.6
If f is a monomorphism then so is f*.
Proposition 5.7
If
f is an epimorphism then so is

.
Proposition 5.8
If
f is a monomorphism then so is

.
Proposition 5.9
For any f, f* preserves intersection and union.
Proposition 5.10
For any
f,

preserves union, but need not preserve intersection.
Proposition 5.11
For any
f,

preserves intersection, but need not preserve union.
Proposition 5.12
For any

and

,

if and only if

.
Proposition 5.13
For any

and

,

if and only if

.
Next: Finite and Infinite
Up: Problems for Techniques of
Previous: Equivalence Relations
Larry Stout
2000-08-30