This preview shows page 1. Sign up to view the full content.
Introduction to Mathematical Reasoning
Fall 2009
Assignment #8: Due Friday, 12/4/09 (NEW DUE DATE)
(CORRECTED VERSION)
Part II:
4. Eccles, pages 113–114, Exercises 9.3, 9.5.
5. Let
f
:
X
→
Y
be a function. A function
g
:
Y
→
X
is called a
left inverse
This is the end of the preview. Sign up
to
access the rest of the document.
Unformatted text preview: for f if g ◦ f = Id X , and it is called a right inverse for f if f ◦ g = Id Y . (a) If there exists a right inverse for f , prove that f is surjective. (b) If there exists a left inverse for f , prove that f is injective....
View
Full
Document
This note was uploaded on 12/08/2009 for the course MATH 300 taught by Professor Staff during the Spring '08 term at University of Washington.
 Spring '08
 Staff
 Math

Click to edit the document details