10Ma5aHw1Soln

10Ma5aHw1Soln - M a 5a HW ASSIGNMENT 1 FALL 09 SOLUTIONS...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Ma 5 a HW ASSIGNMENT 1 FALL 09 SOLUTIONS The exercises are taken from the text, Abstract Algebra (third edition) by Dum- mitt and Foote. We have followed the book’s notation here for Z + as the set of all positive integers. (This is not standard, and many use N to denote this set, reserving Z + for the set of non-negative integers.) Page 4, 7 . Proof of Reflexivity: a a ⇐⇒ f ( a ) = f ( a ). Proof of Symmetry: a b ⇐⇒ f ( a ) = f ( b ) ⇐⇒ f ( b ) = f ( a ) ⇐⇒ b a . Proof of Transitivity: a b and b c ⇐⇒ f ( a ) = f ( b ) and f ( b ) = f ( c ) = f ( a ) = f ( c ) ⇐⇒ a c . These all follow from the fact that = is an equivalence relation. The equivalence class for a A is the set { x A : x a } ⇐⇒ { x A : f ( x ) = f ( a ) } , which is the fiber of f over f ( a ). Therefore the equivalence classes are the fibers of f . Page 8, 6 . First some philosophy. If a logical statement A = B needs to be proved, then it is enough to prove a statement equivalent to it, for example its
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

10Ma5aHw1Soln - M a 5a HW ASSIGNMENT 1 FALL 09 SOLUTIONS...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online