This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: P r e l i m i n a r y d r a f t o n l y : p l e a s e c h e c k f o r fi n a l v e r s i o n ARE211, Fall 2007 LECTURE #20: TUE, NOV 6, 2007 PRINT DATE: AUGUST 21, 2007 (CHARFUNCT) Contents 5. Characteristics of Functions. 1 5.1. Surjective, Injective and Bijective functions 1 5.2. Homotheticity 3 5.3. Homogeneity and Eulers theorem 4 5.4. Monotonic functions 5 5.5. Concave and quasiconcave functions; Definiteness, Hessians and Bordered Hessians. 5 6. Upper and Lower Hemi continuous correpondences 10 5. Characteristics of Functions. 5.1. Surjective, Injective and Bijective functions Definition: A function f : X A is onto or surjective if every point in the range is reached by f starting from some point in the domain, i.e., if a A , x X such that f ( x ) = a . Example: consider f : R R defined by f ( x ) = 5 for all x . This function is not surjective because there are points in the range (i.e., R ) that arent reachable by f (i.e., any point in R except 5 is unreachable). 1 2 LECTURE #20: TUE, NOV 6, 2007 PRINT DATE: AUGUST 21, 2007 (CHARFUNCT) Definition: A function f : X A is 11 or injective if for every point in the range, there is at most one point in the domain that gets mapped by f to that point. More precisely, f is injective if for all x,x prime such that x negationslash = x prime , f ( x ) negationslash = f ( x prime ) . Example: consider f : R R defined by f ( x ) = 5 for all x . This function is not injective because there is a point in the range (i.e., 5) that gets mapped to by f , starting from a large number of points in the domain. Definition: A function f : X A is bijective if it is surjective and injective. Definition: A function f : X A is invertible if there exists a function f 1 : A X such that for all a A , f ( f 1 ( a )) = a and for all x X , f 1 ( f ( x )) = x . (Well show below that you need both of these conditions to capture the notion of invertibility.) If such a function exists, it is called the inverse of f. Theorem: A function f : X A is invertible if and only if it is bijective. You need f to be surjective (onto): otherwise there would be points in the range that arent mapped to by f from any point in the domain: E.g., take f : [0 , 1] R defined by f ( x ) = 5: the image of [0 , 1] under f is { 5 } Now consider any point a negationslash { 5 } . Since f doesnt map anything to a , there cannot exist a function f 1 such that f ( f 1 ( a ) ) = a . You need f to be injective (11): otherwise the inverse couldnt be a function. E.g., take f : [0 , 1] [01 / 4] defined by f ( x ) = x x 2 and take a = 3 / 16; this point is reached from both 1 / 4 and 3 / 4, i.e., f (1 / 4) = f (3 / 4) = 3 / 16. Now apply the definition to both 1 / 4 and 3 / 4: it is required that for all x X , f 1 ( f ( x )) = x . In particular, it is required that f 1 ( f (1 / 4)) = f 1 (3 / 16) = 1 / 4. But it is also required that f 1 ( f (3 / 4)) = f...
View Full
Document
 Fall '07
 Simon

Click to edit the document details