One-to-One and Onto, Inverse Functions

Slides:



Advertisements
Similar presentations
Rational Root Theorem.
Advertisements

Pigeonhole.
5-1 Transforming Quadratics in Function Notation and Converting to Standard Form.
f /(x) = 6x2 – 6x – 12 = 6(x2 – x – 2) = 6(x-2)(x+1).
Math 3121 Abstract Algebra I Lecture 3 Sections 2-4: Binary Operations, Definition of Group.
7.4 Generating Functions Definition 1: The generation function for the sequence a 0, a 1,...,a k,... of real numbers is the infinite series G(x) = a 0.
Chapter Relations & Functions 1.2 Composition of Functions
Finding Limits Analytically 1.3. Concepts Covered: Properties of Limits Strategies for finding limits The Squeeze Theorem.
In previous sections we have been using calculators and graphs to guess the values of limits. Sometimes, these methods do not work! In this section we.
Temperature Readings The equation to convert the temperature from degrees Fahrenheit to degrees Celsius is: c(x) = (x - 32) The equation to convert the.
Section 3.7 Proper Rational Functions Section 3.7 Proper Rational Functions.
O, , and  Notations Lecture 39 Section 9.2 Wed, Mar 30, 2005.
Functions Defined on General Sets Lecture 35 Section 7.1 Fri, Mar 30, 2007.
Basic Structures: Functions Muhammad Arief download dari
Section 8.4a. A flashback to Section 6.5… We evaluated the following integral: This expansion technique is the method of partial fractions. Any rational.
Cardinality with Applications to Computability Lecture 33 Section 7.5 Wed, Apr 12, 2006.
6.4 Inverse Functions Part 1 Goal: Find inverses of linear functions.
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
Inverse functions: if f is one-to-one function with domain X and range Y and g is function with domain Y and range X then g is the inverse function of.
Same Signs Different Signs 1) =+7 Objective- To solve problems involving operations with integers. Combining.
October 4, 2016Theory of Computation Lecture 9: A Universal Program I 1Minimalization Example 15: R(x, y) R(x, y) is the remainder when x is divided by.
Cardinality with Applications to Computability
Section 3.1 Power Functions.
Chapter 6 Differentiation.
Definition, Domain,Range,Even,Odd,Trig,Inverse
2.3 - Calculating Limits Using The Limit Laws
Copyright © Cengage Learning. All rights reserved.
CSE 20 – Discrete Mathematics
Section 6.6 The Fundamental Theorem of Algebra
Copyright © Cengage Learning. All rights reserved.
Great Theoretical Ideas In Computer Science
Radical Functions and Rational Exponents
Chapter 2 Sets and Functions.
6.1 One-to-One Functions; Inverse Function
Inverse Functions.
Finding Limits Analytically
Functions Section 2.3.
Exponential and Logarithmic Functions
Indirect Argument: Contradiction and Contraposition
One-to-One Functions and Inverse Functions
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Radicals and Rational Exponents
Countable and Countably Infinite Sets
Copyright © Cengage Learning. All rights reserved.
The Rational Zero Theorem
Direct Proof and Counterexample II
Unit 1. Day 2..
Functions Defined on General Sets
Copyright © Cengage Learning. All rights reserved.
Chapter 1 – Linear Relations and Functions
1.3 Evaluating Limits Analytically
4.1 One-to-One Functions; Inverse Function
One-to-One and Onto, Inverse Functions
Introduction to Relations and Functions
Rational Root Theorem.
Understanding Functions
Lecture 43 Section 10.1 Wed, Apr 6, 2005
6.1 One-to-One Functions; Inverse Function
Lecture 37 Section 7.2 Tue, Apr 3, 2007
Properties of Functions
Composition of Functions
Functions Rosen 2.3, 2.5 f( ) = A B Lecture 5: Oct 1, 2.
One-to-One and Onto, Inverse Functions
Counting Elements of Disjoint Sets: The Addition Rule
Lecture # 18 Types of Functions
CPSC 121: Models of Computation
Exponential Functions
Counting I: Choice Trees and Correspondences
Derivatives of Inverse Functions
THE WELL ORDERING PROPERTY
Presentation transcript:

One-to-One and Onto, Inverse Functions Lecture 36 Section 7.2 Mon, Apr 2, 2007

Four Important Properties Let R be a relation from A to B. R may have any of the following four properties. x  A,  at least one y  B, (x, y)  R. x  A,  at most one y  B, (x, y)  R. y  B,  at least one x  A, (x, y)  R. y  B,  at most one x  A, (x, y)  R.

One-to-one and Onto R is onto if R is one-to-one if y  B,  at least one x  A, (x, y)  R. R is one-to-one if y  B,  at most one x  A, (x, y)  R.

Combinations of Properties R is a function if x  A,  at exactly one y  B, (x, y)  R. R is one-to-one and onto if y  B,  at exactly one x  A, (x, y)  R.

Examples Consider the following “functions.” f : R  R by f(x) = 2x. g : R  R by g(x) = 1/x. h : R  R by h(x) = x2. k : R  R by m(x) = x. m : Q  Q by k(a/b) = a.

Examples Which of them are functions? Prove that g : R*  R is one-to-one, but not onto. Is it one-to-one and onto from R* to R*? Prove that h is neither one-to-one nor onto. What about k? What about m?

One-to-one Correspondences A function f : A  B is a one-to-one correspondence if f is one-to-one and onto. f has all four of the basic properties. f establishes a “pairing” of the elements of A with the elements of B.

One-to-one Correspondences One-to-one correspondences are very important because two sets are considered to have the same number of elements if there exists a one-to-one correspondence between them.

Example: One-to-one Correspondence Are any of the following functions one-to-one correspondences? f : R  R by f(x) = 2x. g : R*  R* by g(x) = 1/x. h : R  R by h(x) = x2. m : R  R by k(x) = x.

Inverse Relations Let R be a relation from A to B. The inverse relation of R is the relation R–1 from B to A defined by the property that (x, y)  R–1 if and only if (y, x)  R. If a function f : A  B is a one-to-one correspondence, then it has an inverse function f -1 : B  A such that if f(x) = y, then f -1(y) = x.

Example: Inverse Relation Let f : R  R by f(x) = 2x. Describe f –1.

Example: Inverse Relation Let g : R*  R* by g(x) = 1/x. Describe g–1.

Example: Inverse Relation Let k : R  R by k(x) = x. Describe k–1.

Example: Inverse Functions Let A = R – {1/3}. Let B = R – {2/3}. Define f : A  B by f(x) = 2x/(3x – 1). Find f –1. Let y = 2x/(3x – 1). Swap x and y: x = 2y/(3y – 1). Solve for y: y = x/(3x – 2). Therefore, f –1(x) = x/(3x – 2).

Example: Inverse Relation Let A = R and B = R. Let j : A  B by j(x) = (3x – 1)/(x + 1). Find j -1. What values must be deleted from A and B to make j a one-to-one correspondence? Verify that the modified j is one-to-one and onto.

Inverse Relations and the Basic Properties A relation R has the first basic property if and only if R–1 has the third basic property. x  A,  at least one y  B, (x, y)  R. y  B,  at least one x  A, (x, y)  R.

Inverse Relations and the Basic Properties A relation R has the second basic property if and only if R–1 has the fourth basic property. x  A,  at most one y  B, (x, y)  R. y  B,  at most one x  A, (x, y)  R.

Inverse Functions Theorem: The inverse of a function is itself a function if and only if the function is a one-to-one correspondence. Corollary: If f is a one-to-one correspondence, then f –1 is a one-to-one correspondence. The inverse of a function is, in general, a relation, but not a function.

Q and Z Theorem: There is a one-to-one correspondence from Z to Q. Proof: Consider only rationals in reduced form. Arrange the positive rationals in order First by the sum of numerator and denominator. Then, within groups, by numerator.

Q and Z The sequence is 1/1, 1/2, 2/1, 1/3, 3/1, 1/4, 2/3, 3/2, 4/1, … The first group: 1/1 The second group: 1/2, 2/1 The third group: 1/3, 3/1 The fourth group: 1/4, 2/3, 3/2, 4/1 Etc. The sequence is 1/1, 1/2, 2/1, 1/3, 3/1, 1/4, 2/3, 3/2, 4/1, …

Q and Z Let f : Z  Q be the function that Maps the positive integer n to the nth rational in this list. Maps the negative integer -n to the negative of the rational that n maps to. Maps 0 to 0. This is a one-to-one correspondence.

Q and Z What is f(20)? What is f –1(4/5)?