Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.

Slides:



Advertisements
Similar presentations
Functions.
Advertisements

Fall 2014 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
TH EDITION LIAL HORNSBY SCHNEIDER COLLEGE ALGEBRA.
Discrete Mathematics Lecture 7 Alexander Bukharovich New York University.
Discrete Structures Chapter 5 Relations and Functions
CS 2210 (22C:019) Discrete Structures Sets and Functions Spring 2015 Sukumar Ghosh.
Chapter 7 Functions Dr. Curry Guinn. Outline of Today Section 7.1: Functions Defined on General Sets Section 7.2: One-to-One and Onto Section 7.3: The.
Fall 2014 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Section 10.1 The Algebra of Functions. Section 10.1 Exercise #1 Chapter 10.
Uniqueness Theorem and Properties of Log Functions
Fall 2015 COMP 2300 Discrete Structures for Computation
2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations.
Chapter 4.3 Logarithms. The previous section dealt with exponential function of the form y = a x for all positive values of a, where a ≠1.
Logarithmic Functions
Foundations of Discrete Mathematics Chapter 3 By Dr. Dalia M. Gil, Ph.D.
Copyright © 2009 Pearson Education, Inc. CHAPTER 5: Exponential and Logarithmic Functions 5.1 Inverse Functions 5.2 Exponential Functions and Graphs 5.3.
Slide Copyright © 2009 Pearson Education, Inc.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Copyright © Cengage Learning. All rights reserved. Logarithmic, Exponential, and Other Transcendental Functions.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Slide Copyright © 2012 Pearson Education, Inc.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
1 Copyright © 2015, 2011, 2007 Pearson Education, Inc. Chapter 9-1 Exponential and Logarithmic Functions Chapter 9.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFunctions.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
FUNCTIONS.
1 Discrete Structures – CNS 2300 Text Discrete Mathematics and Its Applications (5 th Edition) Kenneth H. Rosen Chapter 1 The Foundations: Logic, Sets,
1.4 Sets Definition 1. A set is a group of objects . The objects in a set are called the elements, or members, of the set. Example 2 The set of positive.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
MAT 2720 Discrete Mathematics Section 3.1 Functions
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Logarithmic Functions & Their Graphs
10.2 Logarithms and Logarithmic Functions Objectives: 1.Evaluate logarithmic expressions. 2.Solve logarithmic equations and inequalities.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 4 Inverse, Exponential, and Logarithmic Functions Copyright © 2013, 2009, 2005 Pearson Education,
Logarithms The previous section dealt with exponential functions of the form y = a x for all positive values of a, where a ≠ 1. The horizontal.
Exponential and Logarithmic Functions Logarithms Exponential and Logarithmic Functions Objectives Switch between exponential and logarithmic form.
Chapter 4 – Exponential and Logarithmic Functions Logarithmic Functions.
4.3 Logarithmic Functions Logarithms Logarithmic Equations
Discrete Mathematics CS 2610 February 10, Agenda Previously Functions And now Finish functions Start Boolean algebras (Sec. 11.1)
Lecture 4 Infinite Cardinals. Some Philosophy: What is “2”? Definition 1: 2 = 1+1. This actually needs the definition of “1” and the definition of the.
Functions (Mappings). Definitions A function (or mapping)  from a set A to a set B is a rule that assigns to each element a of A exactly one element.
Spring 2016 COMP 2300 Discrete Structures for Computation
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
Math 1304 Calculus I 1.6 Inverse Functions. 1.6 Inverse functions Definition: A function f is said to be one-to- one if f(x) = f(y) implies x = y. It.
FUNCTIONS COSC-1321 Discrete Structures 1. Function. Definition Let X and Y be sets. A function f from X to Y is a relation from X to Y with the property.
1 Discrete Mathematical Functions Examples.
Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central University 1 Chapter 4 Decidability Some slides are in courtesy.
Introduction Previously, you learned how to graph logarithmic equations with bases other than 10. It may be necessary to convert other bases to common.
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
Properties of Functions
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
General Logarithmic and Exponential Functions
Relations between Exponential and Logarithmic Functions
5.4 Logarithmic Functions and Models
Copyright © Cengage Learning. All rights reserved.
Exponential and Logarithmic Functions
Exponential and Logarithmic Functions
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Copyright © Zeph Grunschlag,
Presentation transcript:

Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 7.2 One-to-One and Onto, Inverse Functions

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University One-to-One Functions Let F be a function from a set X to a set Y. F is one-to- one (or injective) if, and only if, for all elements and in X, or equivalently, Symbolically, 2

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Examples 3 Not one-to-one One-to-one

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University One-to-One Functions on Infinite Sets Now suppose f is a function defined on an infinite set X. By definition, f is one-to-one if, and only if, the following universal statement is true: Thus, to prove f is one-to-one, you suppose and are elements of X such that and need to show To show that f is not one-to-one, you need to show a counter example in which there are two elements and in X so that but 4

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Example Define: and by the rules and Q) Is f one-to-one? Prove or give a counterexample. 5

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Example – cont’ Define: and by the rules and Q) Is f one-to-one? Prove or give a counterexample. A) If not, there have to be two and such that and However, and this is a contradiction! 6

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Example – cont’ Define: and by the rules and Q) Is g one-to-one? Prove or give a counterexample. 7

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Example – cont’ Define: and by the rules and Q) Is g one-to-one? Prove or give a counterexample. A) 8

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Onto Functions Let F be a function from a set X to a set Y. F is onto (or subjective) if, and only if, given any element y in Y, it is possible to find an element x in X with the property that y = F ( x ). Symbolically: 9

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Examples 10 Not one-to-one Not onto One-to-one and onto Not one-to-one but onto

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Onto Functions on Infinite Sets Now suppose f is a function defined on an infinite set X. By definition, f is one-to-one if, and only if, the following universal statement is true: Thus, to prove f is onto, you suppose that is any element of Y and need to show there is an element x of X with To show that f is not onto, you need to show a counter example in which there is an elements y of Y such that for any x in X. 11

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Example Define: and by the rules and Q) Is f onto? Prove or give a counterexample. A) For any f(x), we have 12

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Example – cont’ Define: and by the rules and Q) Is h onto? Prove or give a counterexample. A) Let h(n) = 6. Then, there is no n such that 13

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Relations between Exponential and Logarithmic Functions For positive number, the exponential function with base b, denoted, is the function from R to defined as follows: For all real number x, where and. 14

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Law of Exponents If b and c are any positive real numbers and u and v are any real numbers, the following laws of exponents hold true: 15

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Logarithmic Function The logarithmic function with base b was defined for any positive number to be the function from to R with the property that for each positive real number x, the exponent to which b must be raised to obtain x. 16

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Properties of Logarithms For any positive real numbers b, c and x with and : 17

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University One-to-One Correspondences A one-to-one correspondence (or bijection) from a set X to a set Y is a function that is both one- to-one and onto. 18 Not one-to-one Not onto One-to-one and onto Not one-to-one but onto

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Inverse Function Suppose is a one-to-one correspondence; that is, suppose F is one-to-one and onto. Then there is a function that is defined as follows: Given any element y in Y, = that unique element x in X such that F ( x ) equals y. In other words, Such is called the inverse function for F. 19

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Inverse Function 20 Not one-to-one Not onto One-to-one and onto Not one-to-one but onto

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Inverse Function 21

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Inverse Function 22 Not a function

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Inverse Function Theorem If X and Y are two sets and is one-to-one and onto, then is also one-to-one and onto. Example