Module 6: Inverse Functions

Similar documents
Unit 5: Inverse Functions

1. Show that f is a bijective

Relation: A relation is simply a set of ordered pairs.

2.5 Inverse Functions

Functions and Function Notation

Final Review Ch. 1 #1

FUNCTIONS OF ONE REAL VARIABLE

Algebraic, Exponential, and Logarithmic Functions

Midterm Review. Intermediate Algebra / MAT135 S2014 test (Mr. Porter)

Houghton Mifflin MATHEMATICS

Math Matters: Why Do I Need To Know This? 1 Logic Understanding the English language

15. Russell on definite descriptions

Midterm Review Part 1 #4

Georgia Quality Core Curriculum

1)Asher: create a handout for the week summing up LOGIC

McDougal Littell High School Math Program. correlated to. Oregon Mathematics Grade-Level Standards

Digital Logic Lecture 5 Boolean Algebra and Logic Gates Part I

MLLunsford, Spring Activity: Conditional Probability and The Law of Total Probability

2.1 Review. 2.2 Inference and justifications

Semantic Entailment and Natural Deduction

Curriculum Guide for Pre-Algebra

Grade 6 correlated to Illinois Learning Standards for Mathematics

Artificial Intelligence Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras

Minimal and Maximal Models in Reinforcement Learning

HP-35s Calculator Program Eccentrically Loaded Connections

Grade 7 Math Connects Suggested Course Outline for Schooling at Home 132 lessons

Artificial Intelligence Prof. P. Dasgupta Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur

HP-35s Calculator Program Triangle Solution (Program Based on Sine & Cosine Rules)

Jews For Yeshua. Time Line 2

SEVENTH GRADE RELIGION

Artificial Intelligence: Valid Arguments and Proof Systems. Prof. Deepak Khemani. Department of Computer Science and Engineering

Content Area Variations of Academic Language

Math 11 Final Exam Review Part 3 #1

Philosophical Logic. LECTURE SEVEN MICHAELMAS 2017 Dr Maarten Steenhagen

A Discussion on Kaplan s and Frege s Theories of Demonstratives

Philosophy 1100: Ethics

Final Exam (PRACTICE-2) #2

A Scientific Model Explains Spirituality and Nonduality

GOD IN NATURE: REVELATIONS OF THE DIVINE MATHEMATICIAN

Final Exam (PRACTICE-3) #3

Semantics and Pragmatics of NLP DRT: Constructing LFs and Presuppositions

Perry High School. Geometry: Week 5

Now consider a verb - like is pretty. Does this also stand for something?

Grade 6 Math Connects Suggested Course Outline for Schooling at Home

Artificial Intelligence. Clause Form and The Resolution Rule. Prof. Deepak Khemani. Department of Computer Science and Engineering

Surveying Prof. Bharat Lohani Department of Civil Engineering Indian Institute of Technology, Kanpur. Module - 7 Lecture - 3 Levelling and Contouring

MISSOURI S FRAMEWORK FOR CURRICULAR DEVELOPMENT IN MATH TOPIC I: PROBLEM SOLVING

Rationalizing Denominators

Articles THE ORIGINS OF THE PROPOSITIONAL FUNCTIONS VERSION OF RUSSELL S PARADOX. Philosophy / U. of Massachusetts

Johns Hopkins Math Tournament 2018 Proof Round: Fuzzy Knights and Knaves

P=NP Proved, Disproved, Varies Based on Problem or issue, and Indeterminate Based on Similarity between Checked and Find

Introduction...2. Solar Radiation...3 Solar Sensor...3. Components...4. System Operation...6

INTERMEDIATE LOGIC Glossary of key terms

1/19/2011. Concept. Analysis

Chapter 8 - Sentential Truth Tables and Argument Forms

Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples

Introduction Symbolic Logic

Proposal to encode svara markers for the Jaiminiya Archika. 1. Background

Getting the Word of God to Catholics has become a major problem in areas where the

EE-100 Engineering Laboratory Module1: PCB

SAMPLE MALCOLM ARCHER. A Harvest Anthem God in such love for us RSCM ANTHEMS

Genesis 1:1-13 King James Version September 2, 2018

The Kripkenstein Paradox and the Private World. In his paper, Wittgenstein on Rules and Private Languages, Kripke expands upon a conclusion

Genesis 1:1-13 English Standard Version September 2, 2018

CHAPTER ONE STATEMENTS, CONNECTIVES AND EQUIVALENCES

Knights of Columbus-Marist Poll January 2011

KEEP THIS COPY FOR REPRODUCTION Pý:RPCS.15i )OCUMENTATION PAGE 0 ''.1-AC7..<Z C. in;2re PORT DATE JPOTTYPE AND DATES COVERID

How many imputations do you need? A two stage calculation using a quadratic rule

Olivia Howie May 8th, 2017 Math 10X Teaching Project Script INTRODUCTION

Born Free and Equal? On the ethical consistency of animal equality summary Stijn Bruers

Hume s Missing Shade of Blue as a Possible Key. to Certainty in Geometry

Simultaneous Valuation vs. the Exploitation Theory of Profit: A summing up

~ecamber 24, 1905 Isa. 9:1-7. UNITY magazine.

The Question, the Answer & the Promise Psalm 15

Identifying Rational And Irrational Numbers

NPTEL NPTEL ONINE CERTIFICATION COURSE. Introduction to Machine Learning. Lecture-59 Ensemble Methods- Bagging,Committee Machines and Stacking

Writing Module Three: Five Essential Parts of Argument Cain Project (2008)

Year 4 Medium Term Planning

SMITH ON TRUTHMAKERS 1. Dominic Gregory. I. Introduction

LSIGNAG!J. Alan Davies

THIRD GRADE CURRICULUM RELIGION

6.041SC Probabilistic Systems Analysis and Applied Probability, Fall 2013 Transcript Lecture 3

Review for Test III #1

Introduction to Inference

Year 4 Medium Term Planning

Artificial Intelligence Prof. P. Dasgupta Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur

Muslim teachers conceptions of evolution in several countries

Potten End Church of England Primary School Curriculum Map. Year 6

E32-DE-IDM-32. Opto-Isolated I/O Board

CSSS/SOC/STAT 321 Case-Based Statistics I. Introduction to Probability

Exposition of Symbolic Logic with Kalish-Montague derivations

Friends and strangers

On the Aristotelian Square of Opposition

Ramsey s belief > action > truth theory.

Affirmation-Negation: New Perspective

Artificial Intelligence Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras

Bertrand Russell Proper Names, Adjectives and Verbs 1

Gateways DALIK v Programming manual

Pollock s Theory of Defeasible Reasoning

correlated to the Massachussetts Learning Standards for Geometry C14

Transcription:

Haberman MTH c Section I: Sets and Functions Module 6: Inverse Functions EXAMPLE: Consider the unction n ( ), which is graphed in Figure below Figure : Graph o n( ) Since n is a unction, each input corresponds to eactl one output In this case it is also true that each output corresponds to eactl one input For eample, i n ( ) 8 then must be There are no other values that correspond with the output 8 Similarl, i n ( ) 7 then must be Onl the value corresponds with the output 7 We sa that unctions like one-to-one, (sometimes denoted ) n ( ) are DEFINITION: A unction is one-to-one i each output corresponds to eactl one input, ie, i ( a) ( b) then a b

EXAMPLE: Now consider the unction p ( ), which is graphed in Figure below Figure : Graph o p( ) Here, it is not the case that each output corresponds to eactl one input, so p is not oneto-one (I anthing, p is two-to-one ) For eample, i be or p ( ) 4 then ou cannot be sure what is: could Similarl, i p ( ) 6 then could be 4 or 4 We can determine i a unction is one-to-one b appling the horizontal line test to the graph o the unction The Horizontal Line Test I a unction is one-to-one then no horizontal line intersects the graph o the unction more than once EXAMPLE: Which o the ollowing graphs represent one-to-one unctions? Figure Figure 4 Figure 5 SOLUTION: The onl graph that represents a one-to-one unction is the one in Figure The graphs in Figures 4 and 5 do not represent one-to-one unctions because the do not pass the horizontal line test

I a unction ( ) is one-to-one, then, in addition to having the outputs a unction o the inputs, it is also true that the inputs are a unction o the outputs, ie, is a unction o, ie, can pla the role o the independent variable and can pla the role o the dependent variable (This is equivalent to saing that i ou turn our head 90 when looking at the graph o, the graph ou see passes the vertical line test and is a unction Thus, we see that the horizontal line test is just the vertical line test ater reversing the roles o and ) Inverse Functions I a unction is one-to-one then its inverse is a unction The unction that reverses the roles o and is the inverse unction o and is denoted CAUTION: The notation eponent The notation represents the inverse o the unction The is NOT an does NOT mean EXAMPLE: I t and t are inverses o one another, then t () implies that t () Since the inverse o a unction reverses the role o the inputs and the outputs, to ind the inverse o a unction, all that we have to do is reverse the roles o and EXAMPLE: Find the inverse o the unction SOLUTION: n ( ) First we write n in equation orm: solving the equation or : We can then reverse the roles o and b

4 The equation represents the inverse, but we would like to use standard unction notation to represent the inverse Since usuall is used to represent the independent variable, we write n ( ) In Figure 6 below both see, the graph o n and n are graphed, along with the line n is the graph o n relected about the line As ou can Figure 6: n( ) is graphed in blue and n ( ) is graphed in green and the line is graphed in red KEY POINT: The graph o the inverse o a unction is the same as the graph o the original unction but relected about the line EXAMPLE: Find the inverse o the unction ( ) SOLUTION: To ind the inverse o solve or ( ) we irst write the unction as and then

5 ( ) ( ) + + Since we usuall use as our independent variable, we switch our and and obtain the inverse unction ( ) + Recall that the inverse o a unction reverses the roles o and Thus, i ou compose with its inverse ou take to and then to, so is sent to itsel, ie, the composition o a unction with its inverse is the identit unction Inverse Function Test I ( g)( ) and ( g )( ), then the unctions and g are inverses o one another

6 EXAMPLE: Check that ( ) and the unction that we ound in the eample above are in act inverses o one another b perorming the inverse unction test SOLUTION: In the eample above we determined that the inverse o ( ) is ( ) + To check this conclusion we can perorm the inverse unction test To perorm the test, we ( ) ( ) need to veri that ( ) and ( ) ( ) ( ) ( ) ( ) + + + + AND ( ) ( ) ( ( ) ) + + 6 + ( ) Since ( )( ) and ( ) ( ) ( ), + ( ) is in act the inverse o