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

Slides:



Advertisements
Similar presentations
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 3.1 Chapter 3.
Advertisements

Getting Ready: Addition and Subtraction Concepts by: Nicole Lamons
0 - 0.
CS4026 Formal Models of Computation Running Haskell Programs – power.
1.3 W ORKING WITH F UNCTION N OTATION. The math department has looked into purchasing new textbooks for this course. The best deal is at a cost of $94.
Extensible Networking Platform CSE 240 – Logic and Discrete Mathematics Review: Mathematical Induction Use induction to prove that the sum of the.
Logarithmic Functions
Difference, Product and Quotient Functions
Solving Addition and Subtraction Inequalities
Lecture 15 Functions CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Lecture 11 Mathematical Induction CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Equivalence Relations
Copyright © Cengage Learning. All rights reserved.
(CSC 102) Lecture 21 Discrete Structures. Previous Lecture Summery  Sum/Difference of Two Functions  Equality of Two Functions  One-to-One Function.
Copyright © Cengage Learning. All rights reserved. CHAPTER 1 SPEAKING MATHEMATICALLY SPEAKING MATHEMATICALLY.
Discrete Structures Chapter 5 Relations and Functions
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 12 Number theory Mathematical induction Proof by induction Examples.
Functions Goals Introduce the concept of function Introduce injective, surjective, & bijective functions.
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.
Fall 2015 COMP 2300 Discrete Structures for Computation
Mathematical Induction. F(1) = 1; F(n+1) = F(n) + (2n+1) for n≥ F(n) n F(n) =n 2 for all n ≥ 1 Prove it!
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.
Functions. Copyright © Peter Cappello2 Definition Let D and C be nonempty sets. A function f from D to C, for each element d  D, assigns exactly 1 element.
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.
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 2002CMSC Discrete Structures1 … and the following mathematical appetizer is about… Functions.
Mathematics for Computing Lecture 8: Functions Dr Andrew Purkiss-Trew Cancer Research UK
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
FUNCTIONS.
Chapter 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs BY: MISS FARAH ADIBAH ADNAN IMK.
Agenda Week 10 Lecture coverage: –Functions –Types of Function –Composite function –Inverse of a function.
April 14, 2015Applied Discrete Mathematics Week 10: Equivalence Relations 1 Properties of Relations Definition: A relation R on a set A is called transitive.
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.
Discrete Mathematics Relation.
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.
Math 344 Winter 07 Group Theory Part 2: Subgroups and Isomorphism
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.
Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 1 Regular Languages Some slides are in courtesy.
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
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.
Chapter 7 – Radical Equations and Inequalities 7.2 – Inverse Functions and Relations.
Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 0 Introduction Some slides are in courtesy of Prof.
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.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central University 1 Chapter 4 Decidability Some slides are in courtesy.
Discrete Mathematics Lecture # 19 Inverse of Functions.
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
Discrete Mathematics Lecture 6
Relations and Functions
Applied Discrete Mathematics Week 2: Functions and Sequences
Great Theoretical Ideas In Computer Science
MAT 2720 Discrete Mathematics
Copyright © Cengage Learning. All rights reserved.
Unit 30 Functions Presentation 1 Functions, Mappings and Domains 1
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Composition & Inverses Review
Presentation transcript:

Fall 2014 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 7.3 Composition of Functions

Fall 2014 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Composition of Two Functions Let and be functions with the property that the range of f is a subset of the domain of g and Define a new function as follows: where is read g circle f and is read g of f of x. The function is called the composition of f and g. 2

Fall 2014 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Composition of Functions Defined by Formulas Suppose two functions and defined as below: a. Find the compositions and. b. Is ? Explain. 3

Fall 2014 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Composition of Functions Defined by Formulas Suppose two functions and defined as below: a. Find the compositions and. b. Is ? Explain. 4

Fall 2014 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Composition of Functions Defined by Formulas Suppose two functions and defined as below: a. Find the compositions and. b. Is ? Explain. 5

Fall 2014 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Composition of Functions Defined on Finite Sets Let and. Define two functions and by the arrow diagram below. Draw the arrow diagram for. What is the range of ? 6 fg Y’

Fall 2014 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Composition of Functions Defined on Finite Sets – cont’ Let and. Define two functions and by the arrow diagram below. Draw the arrow diagram for. What is the range of ? Range is { y, z } 7 Fall 2010 COMP 4605/5605 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University fg Y’

Fall 2014 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Composition with the Identity Function If f is a function from a set X to a set Y, and is the identity function on X, and is the identity function on Y, then 8 Roughly, this is because More formal proof is given in the textbook.

Fall 2014 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Composing a Function with Its Inverse If is a one-to-one and onto function with inverse function then 9 Roughly, this is because More formal proof is given in the textbook.

Fall 2014 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Composition of One-to-One Functions Suppose we have two one-to-one functions f and g. Is their composite function one-to-one? 10

Fall 2014 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Composition of One-to-One Functions Suppose we have two one-to-one functions f and g. Is their composite function one-to-one? Yes! Proof Suppose we have we two different elements such that Since we have Also, since f is one-to-one has to be true. Since g is also one-to one, has to be true. (Contradiction!) 11

Fall 2014 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Composition of Onto Functions Suppose we have two onto functions and. Is their composite function still onto? 12

Fall 2014 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Composition of Onto Functions Suppose we have two onto functions and. Is their composite function still onto? Yes 13

Fall 2014 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Composition of Onto Functions Suppose we have two onto functions and. Is their composite function still onto? Yes Proof Since g is onto, there has to be such that. Also, since f is onto, there has to be some such that. Therefore, it is true. 14