MAT 2720 Discrete Mathematics

Slides:



Advertisements
Similar presentations
Functions Reading: Epp Chp 7.1, 7.2, 7.4
Advertisements

MA10209 – Week 2 Tutorial B3/B4, Andrew Kennedy. Top Tips (response to sheet 1) Make sure you answer the question - requires a yes/no as well as an explanation.
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.
Functions Rosen 1.8.
Fall 2014 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.
(CSC 102) Lecture 21 Discrete Structures. Previous Lecture Summery  Sum/Difference of Two Functions  Equality of Two Functions  One-to-One Function.
The Engineering Design of Systems: Models and Methods
Functions Section 2.3 of Rosen Fall 2008
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.
Snick  snack CPSC 121: Models of Computation 2008/9 Winter Term 2 Functions Steve Wolfman, based on notes by Patrice Belleville and others.
Functions Goals Introduce the concept of function Introduce injective, surjective, & bijective functions.
Functions. A function between two sets is a relation between those sets that has a special property, namely that each member of the from-set is related.
L2 Supplementary Notes Page : Recap l Sum Principle n Applied to selection sort l Product Principle n Applied to matrix multiplication and.
CS 2210 (22C:019) Discrete Structures Sets and Functions Spring 2015 Sukumar Ghosh.
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.
2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations.
FUNCTION Discrete Mathematics Asst. Prof. Dr. Choopan Rattanapoka.
Relations and Functions Another Foundational Concept Copyright © 2014 – Curt Hill.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
February 12, 2015Applied Discrete Mathematics Week 2: Functions and Sequences 1Exercises Question 1: Given a set A = {x, y, z} and a set B = {1, 2, 3,
Discrete Maths Objectives to show the connection between relations and functions, and to introduce some functions with useful, special properties ,
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.
Part B Set Theory What is a set? A set is a collection of objects. Can you give me some examples?
1 Annoucement n Skills you need: (1) (In Thinking) You think and move by Logic Definitions Mathematical properties (Basic algebra etc.) (2) (In Exploration)
Discrete Mathematics CS 2610 September 12, Agenda Last class Functions  Vertical line rule  Ordered pairs  Graphical representation  Predicates.
Functions Section 2.3 of Rosen Spring 2012 CSCE 235 Introduction to Discrete Structures Course web-page: cse.unl.edu/~cse235 Questions: Use Piazza.
03 May 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
1 Discrete Structures – CNS 2300 Text Discrete Mathematics and Its Applications (5 th Edition) Kenneth H. Rosen Chapter 1 The Foundations: Logic, Sets,
Chapter 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs BY: MISS FARAH ADIBAH ADNAN IMK.
MAT 3749 Introduction to Analysis Section 1.3 Part I Countable Sets
CSE 2353 – October 1 st 2003 Functions. For Real Numbers F: R->R –f(x) = 7x + 5 –f(x) = sin(x)
Functions Definition: A relation ‘ f ’ from set X to set Y is a function if each element in set X is mapped to exactly one element in set Y
Agenda Week 10 Lecture coverage: –Functions –Types of Function –Composite function –Inverse of a function.
What is a set? A set is a collection of objects.
Functions. L62 Agenda Section 1.8: Functions Domain, co-domain, range Image, pre-image One-to-one, onto, bijective, inverse Functional composition and.
MAT 2720 Discrete Mathematics Section 3.1 Functions
CSC102 - Discrete Structures Functions
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 7 Functions Instructor: Hayk Melikyan Today we will review sections 7.3, 7.4 and 7.5.
1 Functions CS 202 Epp section ??? Aaron Bloomfield.
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.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
MAT 2720 Discrete Mathematics Section 3.3 Relations
Chapter 2 1. Chapter Summary Sets The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions and sequences.
Discrete Mathematics Functions
Functions Goals Introduce the concept of function
Function Hubert Chan (Chapter 2.1, 2.2) [O1 Abstract Concepts]
Properties of Functions
Cartesian product Given two sets A, B we define their Cartesian product is the set of all the pairs whose first element is in A and second in B. Note that.
Chapter 2 Sets and Functions.
Relation and function.
Function Hubert Chan (Chapter 2.1, 2.2) [O1 Abstract Concepts]
Lecture 7 Functions.
Yet another important mathematical concept
Propositional Logic Defining Propositional Logic
A Brief Summary for Exam 1
Functions.
Copyright © Cengage Learning. All rights reserved.
Ch 5 Functions Chapter 5: Functions
Functions Rosen 6th ed., §2.3.
MAT 3100 Introduction to Proof
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
Math/CSE 1019N: Discrete Mathematics for Computer Science Winter 2007
Unit 30 Functions Presentation 1 Functions, Mappings and Domains 1
Lecture # 18 Types of Functions
CPSC 121: Models of Computation
Copyright © Zeph Grunschlag,
Presentation transcript:

MAT 2720 Discrete Mathematics Section 3.1 Functions http://myhome.spu.edu/lauw

Goals 3.1 Functions – Applications in Counting 3.3 Relations – Extension of Functions 3.4 Equivalence Relation – A special type of relation

Goals Review and Renew the concept of functions How to show that a function is an One-to-one function (Injection) How to show that a function is an Onto function (Surjection) Typically, you have learned these in a pre-calculus class. And it was used in calculus II for the derivatives of the inverse functions

You Know a Lot About Functions You are supposed to know a lot… Domain, Range, Codomain Inverse Functions One-to-one, Onto Functions Composite Functions

Notations

From Continuous to Discrete Arrow Diagram Terminology:

Is this a Function? (I)

Is this a Function? (II)

One-to-One Functions

One-to-One Functions This is NOT an easy criteria to demo/prove a function is injective.

Equivalent Criteria

Example 1 Determine if the given function is 1-1. Prove your answer. Proof: Analysis

Example 2 Determine if the given function is 1-1. Prove your answer. Proof: Analysis

Example 2 Determine if the given function is 1-1. Prove your answer. KEY: Must spell out the precise reasons. Since ?≠??, but f(?)=f(??), f is not injective.

Onto Functions

Equivalent Criteria

Example 3 Determine if the given function is onto. Prove your answer. Proof: Analysis

Example 3 Determine if the given function is onto. Prove your answer. Proof: An counter example is difficult to explain in this case Use contradiction instead – which may have the same “feel” of a counter example Analysis

Example 4 Determine if the given function is onto. Prove your answer. Proof: Analysis

Template Analysis: Write down some cases to determine if a function is injective/surjective. To show injective/surjective, give a (direct) proof. To show NOT injective/surjective, use An counter example if it is easy to explain Use contradiction Other type of valid arguments

Counting Problems…

Counting Problems…

Bijection

Inverse Functions

Group Explorations Very fun to do. Keep the fun between you and your partner.