(CSC 102) Lecture 21 Discrete Structures. Previous Lecture Summery  Sum/Difference of Two Functions  Equality of Two Functions  One-to-One Function.

Slides:



Advertisements
Similar presentations
1.6 Functions. Chapter 1, section 6 Functions notation: f: A B x in A, y in B, f(x) = y. concepts: –domain of f, –codomain of f, –range of f, –f maps.
Advertisements

Fall 2014 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Lecture 15 Functions CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
DEFINITION A function f : A  B is a one-to-one correspondence (called a bijection) iff f is one-to-one and onto B. We write f : A  B to indicate that.
Copyright © Cengage Learning. All rights reserved.
Discrete Structures Chapter 5 Relations and Functions Nurul Amelina Nasharuddin Multimedia Department.
Quiz April Sections 1.6,1.7,1.8. Quiz: Apr. 21 ’05: pm 1. Consider the following sets: Provide the following sets using set-builder.
Terminology Domain: set which holds the values to which we apply the function Co-domain: set which holds the possible values (results) of the function.
Discrete Mathematics Lecture 7 Alexander Bukharovich New York University.
Discrete Structures Chapter 5 Relations and Functions
Terminology Domain: set which holds the values to which we apply the function Co-domain: set which holds the possible values (results) of the function.
Functions f( ) = A B Lecture 15: Nov 4.
Inverse Functions Section 1.8.
Functions Goals Introduce the concept of function Introduce injective, surjective, & bijective functions.
1 Section 1.8 Functions. 2 Loose Definition Mapping of each element of one set onto some element of another set –each element of 1st set must map to something,
Discrete Mathematics Lecture 7 Harper Langston New York University.
CS 2210 (22C:019) Discrete Structures Sets and Functions Spring 2015 Sukumar Ghosh.
Domains and Inverse Functions
Table of Contents Inverse Functions Consider the functions, f (x) and g(x), illustrated by the mapping diagram f The function, f (x), takes.
Inverse Functions Consider the function f illustrated by the mapping diagram. The function f takes the domain values of 1, 8 and 64 and produces the corresponding.
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.
1 CMSC 250 Chapter 7, Functions. 2 CMSC 250 Function terminology l A relationship between elements of two sets such that no element of the first set is.
Section 1.8: Functions A function is a mapping from one set to another that satisfies certain properties. We will first introduce the notion of a mapping.
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.
Week 7 - Friday.  What did we talk about last time?  Set disproofs  Russell’s paradox  Function basics.
Combinations of Functions & Inverse Functions Obj: Be able to work with combinations/compositions of functions. Be able to find inverse functions. TS:
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFunctions.
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Copyright  The McGraw-Hill Companies, Inc. Permission required for reproduction.
Mathematics for Computing Lecture 8: Functions Dr Andrew Purkiss-Trew Cancer Research UK
1 Annoucement n Skills you need: (1) (In Thinking) You think and move by Logic Definitions Mathematical properties (Basic algebra etc.) (2) (In Exploration)
FUNCTIONS.
Discrete Mathematics CS 2610 September 12, Agenda Last class Functions  Vertical line rule  Ordered pairs  Graphical representation  Predicates.
Dr. Eng. Farag Elnagahy Office Phone: King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222.
MENU REVIEW GAME QUIZ RELATION AND FUNCTIONS >> DOMAIN, CODOMAIN, RANGE DOMAIN, CODOMAIN, RANGE THE NUMBER OF MAPPING TWO SETS THE NUMBER OF MAPPING TWO.
MAT 3749 Introduction to Analysis Section 1.3 Part I Countable 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.
Functions Reading: Chapter 6 (94 – 107) from the text book 1.
Basic Structures: Sets, Functions, Sequences, and Sums CSC-2259 Discrete Structures Konstantin Busch - LSU1.
CSE 2353 – October 1 st 2003 Functions. For Real Numbers F: R->R –f(x) = 7x + 5 –f(x) = sin(x)
Agenda Week 10 Lecture coverage: –Functions –Types of Function –Composite function –Inverse of a function.
Functions. L62 Agenda Section 1.8: Functions Domain, co-domain, range Image, pre-image One-to-one, onto, bijective, inverse Functional composition and.
Discrete Mathematics Relation.
11 DISCRETE STRUCTURES DISCRETE STRUCTURES UNIT 5 SSK3003 DR. ALI MAMAT 1.
11 DISCRETE STRUCTURES DISCRETE STRUCTURES UNIT 5 SSK3003 DR. ALI MAMAT 1.
Functions Discrete Structure. L62 Functions. Basic-Terms. DEF: A function f : A  B is given by a domain set A, a codomain set B, and a rule which for.
CSC102 - Discrete Structures Functions
1.4 Building Functions from Functions
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
CSNB 143 Discrete Mathematical Structures
1 Functions CS 202 Epp section ??? Aaron Bloomfield.
Chapter 7 – Radical Equations and Inequalities 7.2 – Inverse Functions and Relations.
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.
Relations and Functions ORDERED PAIRS AND CARTESIAN PRODUCT An ordered pair consists of two elements, say a and b, in which one of them, say a is designated.
Functions – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Functions Reading: Kolman, Section 5.1.
Functions CSRU1400 Spring 2008Ellen Zhang 1 CISC1400, Fall 2010 Ellen Zhang.
Discrete Mathematics 3. MATRICES, RELATIONS, AND FUNCTIONS Lecture 6 Dr.-Ing. Erwin Sitompul
Discrete Mathematics Lecture # 19 Inverse of Functions.
(CSC 102) Lecture 30 Discrete Structures. Graphs.
Group A set G is called a group if it satisfies the following axioms. G 1 G is closed under a binary operation. G 2 The operation is associative. G 3 There.
Functions Goals Introduce the concept of function
Discrete Mathematics Lecture 6
Chapter 2 Sets and Functions.
Combinations of Functions; Composite Functions
Functions Rosen 2.3, 2.5 f( ) = A B Lecture 5: Oct 1, 2.
Unit 30 Functions Presentation 1 Functions, Mappings and Domains 1
Example 1: Identifying Functions
Lecture # 18 Types of Functions
Warm Up Generate ordered pairs for the function
Copyright © Zeph Grunschlag,
Presentation transcript:

(CSC 102) Lecture 21 Discrete Structures

Previous Lecture Summery  Sum/Difference of Two Functions  Equality of Two Functions  One-to-One Function  Onto Function  Bijective Function (One-to-One correspondence)

Today’s Lecture  Inverse Functions  Finding an Inverse Function  Composition of Functions  Composition of Functions defined on finite sets  Plotting Functions

Inverse Functions Theorem The function F -1 is called inverse function.

Inverse Functions Given an arrow diagram for a function. Draw the arrow diagram for the inverse of this function

Finding an Inverse Function The function f : R → R defined by the formula f (x) = 4x − 1, for all real numbers x

Theorem

Composition of Functions

Composition of Functions defined on finite sets Let X = {1, 2, 3}, Y ’ = {a, b, c, d}, Y = {a, b, c, d, e}, and Z = {x, y, z}. Define functions f : X → Y’ and g: Y → Z by the arrow diagrams below. Draw the arrow diagram for g ◦ f. What is the range of g ◦ f ?

Composition of Functions defined on finite sets

To find the arrow diagram for g ◦ f, just trace the arrows all the way across from X to Z through Y. The result is shown below. Composition of Functions defined on finite sets Let X = {1, 2, 3}, Y ’ = {a, b, c, d}, Y = {a, b, c, d, e}, and Z = {x, y, z}. The range of g ◦ f is {y, z}.

Composition of Functions defined on Infinite Sets Let f : Z → Z, and g: Z → Z be two functions. s.t., f (n)=n + 1 for all n ∈ Z and g(n) = n 2 for all n ∈ Z. a. Find the compositions g◦f and f◦g. b. Is g ◦ f = f ◦g? Explain. a.The functions g ◦ f and f ◦g are defined as follows: (g ◦ f )(n) = g( f (n)) = g(n + 1) = (n + 1) 2 for all n ∈ Z, ( f ◦g)(n) = f (g(n)) = f (n 2 ) = n for all n ∈ Z.

Composition of Functions defined on Infinite Sets Let f : Z → Z, and g: Z → Z be two functions. s.t., f (n)=n + 1 for all n ∈ Z and g(n) = n 2 for all n ∈ Z. b. Is g ◦ f = f ◦g? Explain.

Composition with Identity Function Let X = {a, b, c, d} and Y = {u, v,w}, and suppose f : X → Y is given by the arrow diagram Find f ◦ I X and I Y ◦ f.

Composition with Identity Function

Composing a Function with its Inverse

In a similar way, we can show that Composing a Function with its Inverse

Composition of One-to-One Functions

Domain =Range =

Lecture Summery  One-to-One Function  Onto Function  Bijective Function (One-to-One correspondence)  Inverse Functions