Math 55a Pset1
Math 55a Pset1
Math 55a Pset1
Note: the first three problems are warm-up problems on set theory; if you don’t know how to
do them, ask us!
1. Prove the pigeon-hole principle: if A is a finite set, then any injective map f : A → A is also
surjective.
2. Let N = {0, 1, 2, . . .} denote the set of natural numbers. Give an explicit bijection between N
and N × N.
3. Let F denote the set of all functions f : R → R, and let C ⊂ F denote the subset of all
continuous functions. Prove that |R| = |C| < |F |.
4. Let x1 , x2 , . . . , xn ∈ G be any elements of a group G. Show that
−1 −1 −1
(x1 x2 · · · xn )−1 = x−1
n · xn−1 · · · x2 · x1 .