In section 9.1 (page 198), why does it say that f3 is not a function from A to B because f3 is not equal to A? It seems like the function would never be equal to its sets because the function contains ordered pairs of elements in 2 different sets. So then wouldn't f3 always not be equal to A?
The little history connection was neat. The old definition of a function still holds today. The picture of mapping in the book was very effective in helping me picture what is actually going on. I'm an engineer and prefer things that are more concrete I suppose. It was also neat how functions that we've grown up with make sense with this definiton of a function.
No comments:
Post a Comment