This preview shows page 1. Sign up to view the full content.
Unformatted text preview: tion and inverse relations oF Functions. The composition oF two Functions is always a Function. In contrast, we shall see that the inverse relation oF a Function need not necessarily be a Function. D EFINITION 4.14 (C OMPOSITION OF ± UNCTIONS ) Let A,B and C be arbitrary sets, and let f : A → B and g : B → C be arbitrary Functions oF these sets. The composition oF f with g , written g ◦ f : A → C , is a Function defned by g ◦ f ( a ) def = g ( f ( a )) For every element a ∈ A . In Haskell notation, we would write (g.f) a = g (f a) It is easy to check that g ◦ f is indeed a Function. Notice that the codomain oF f must be the same as the domain oF g For the composition to be welldefned. 36...
View
Full
Document
This note was uploaded on 01/23/2010 for the course MATH Math2009 taught by Professor Koskesh during the Spring '10 term at École Normale Supérieure.
 Spring '10
 Koskesh
 Math

Click to edit the document details