Math 143 Lecture Functions You have been exposed to functions in earlier math courses.

In ordinary language, the word function indicates the dependence of one varying quantity to another. Examples 1. When you look up a phone number in a directory, you are using a function whose inputs are names and whose outputs are phone numbers. (provided only one number is listed for each name) 2. When you type a document using word processing software, your computer uses a function whose keystrokes are the inputs and whose outputs are symbols displayed on the computer screen. 3. If your teacher tells you that your grade in a course is a function of your performance on the exam, you interpret this to mean that the teacher has some rule for translating exam scores (inputs) into grades (outputs). Definition The notation f : A B is used to illustrate a function (called f) with assert of inputs A (called the domain) and a set B (called the codomain) that includes all the outputs. The function must have the following properties : (i) For every x A, there is some y B such that ( x, y ) f . (ii) If ( x, y ) f and ( x, z ) f then y=z. Example

A function is an ordered triple { f , A, B} such that A and B are sets and f A B with the criteria stated earlier being held.

1 2 3 4

1 2 3

Examples Which of the relations are actually functions? 1. Domain The set of students of all Electrical and Computer Engineering students at UWI this semester. Codomain The set of all classes offered in Engineering this semester. Rule (x, y) in R1 if student x is enrolled in class y this semester. 2. Domain The set A = {1, 2, 3, 4, 5, 6} Codomain The same set A Rule (x, y) in R2 if x y is an even integer. 3. Domain - The set N of natural numbers. Codomain The set Z of integers.
2 2 Rule R3 = {( x, y ) N Z : x = y } or equivalently R3 = {( y , y ) : y Z }

4. Domain : The set Z of integers. Codomain : The set N of natural numbers. Rule

{x, y} N Z : y = x 2} or equivalently R4 = {(x, x 2 ) : x N}

Definitions 1. A function is onto (surjective) if everything in the codomain is an output of f. (codomain f = range f) F : X Y is onto if and only if for all y Y , there exists an x X such that F(x)=y. 2. A function is one to one (injective) if nothing in the codomain is an output via two different inputs. F : X Y is one to one if and only if for all x1 , x 2 X , if

F ( x1 ) = F ( x 2 ) then x1 = x 2
or if x1 x 2 then F ( x1 ) F ( x 2 ) . 3. A function f is a 1-1(one to one) correspondence (bijective) or invertible if it is both one to one and onto. Examples 1. A function f is given by f: R R such that f(x) = 2x. Determine if f is 1-1 and onto.

2. A function f is given by f : X Y such that f(x) = log e x where x is a positive real number and Y = R. Determine if f is 1-1 and onto.