Outline Inverse of a Relation Properties of Relations. Relations. Alice E. Fischer. April, 2018
|
|
- Nicholas Reynolds
- 5 years ago
- Views:
Transcription
1 Relations Alice E. Fischer April, 2018
2 1 Inverse of a Relation 2 Properties of Relations
3 The Inverse of a Relation Let R be a relation from A to B. Define the inverse relation, R 1 from B to A as follows. R 1 = {(y, x) B A (x, y) R} All of the arrows in the mapping diagram of the inverse relation are reversed from those in the original relation.
4 Example: Inverse of a Finite Relation For example, let A = {2, 3, 4}, B = {2, 6, 8} and let D be the divides relation. Then D = {(2, 2), (2, 6), (2, 8), (3, 6), (4, 8)} D 1 = {(2, 2), (6, 2), (8, 2), (6, 3), (8, 4)} D D
5 Example: Inverse of an Infinite Relation Define a relation S from R to R for all (y, z) R R as: S is the set of all pairs, (y, z) such that z = 2 y S = {(y, z) z = 2 y } The inverse would then be: S 1 = {(z, y) z = 2 y } The diagram on the next page shows graphs of S and S 1.
6 Graph: Inverse of an Infinite Relation S = {(y, z) z = 2 y } S S 1 = {(z, y) z = 2 y } S -1 x x y y Is S a function? Is S 1 a function?
7 From Arrow Diagram to Directed Graph In many cases we choose the domain and co-domain of a relation to be the same set. This means that we map elements of a set onto itself in some way. When drawing the mapping, rather than having our arrows go between two distinct sets, these sets now overlap, and all the arrows for the arcs of a directed graph that relates elements of the same set. The three basic properties that a relation on a set can exhibit are that it be reflexive, symmetric and transitive. Looking at such a directed graph, it is easy to see whether certain properties of a relation exist.
8 A Pretty Directed Graph Consider the set A = {3, 4, 5, 6, 7, 8}. Define relation R = the set of pairs (x, y) where 2 (x y). That is, a pair is in the relation if the difference of the two values is even. The directed graph representing this relationship looks like:
9 Relation Properties - Reflexive A relation has the property of being reflexive if every element of the set is related to itself. That is, for all x A, (x, x) R. The relation on the previous page is reflexive. This can be easily seen by the fact that every element in the set has an arc directed back at itself. The relation S defined by (x, y) S when x y = 2 is not reflexive, because the difference between an element and itself is always 0.
10 Relation Properties - Symmetric A relation has the property of being symmetric if when any element of the set is related to another, then the second element is also related to the first. That is, for all x and y A, if (x, y) R then (y, x) R. A symmetric relationship in our graphs looks like a flower petal or a self-loop. The relation from the previous graph is symmetric. This can be easily seen by the fact that for every arc that is going from one element to another, there is a second arc coming back from the second element to the first. The relation S defined by (x, y) S when x y = 2 is not symmetric, because the difference between one element and another is the negative of the difference of the second element and the first. However, if S used x y, it would be symmetric.
11 Relation Properties - Transitive A relation has the property of being transitive if when any one element of the set is related to another, and that second element is related to a third, then the first element is also related to the third. That is, for all x, y and z A, if (x, y) R and (y, z) R then (x, z) R. The relation from the previous graph is transitive. This can be easily seen by the fact that for every arc that is going from one element to another, followed by a second arc from that element to a third element, there is a third arc going directly between the first and third elements. The relation S defined by (x, y) S when x y = 2 is also not transitive, because the difference between the first element and the third element will always be 4 rather than 2.
12 Relation Properties - Some Practice Consider the set A = {2, 3, 4, 6, 7, 9}. Define relation R as the set of (x, y) such that 3 (x y). That is, a pair is in the relation if the difference of the two values is divisible by 3. Draw the directed graph representing this relationship and determine if it is reflexive, symmetric or transitive.
13 Relation Properties - Some Practice Consider the set A = {2, 3, 4, 6, 7, 9}. Define relation R as the set of (x, y) such that 3 (x y). That is, a pair is in the relation if the difference of the two values is divisible by 3. Draw the directed graph representing this relationship and determine if it is reflexive, symmetric or transitive. The directed graph is given by:
14 Relation Properties - Some Practice Is the relation reflexive?
15 Relation Properties - Some Practice Is the relation reflexive? Yes. Every element has an arc from itself to itself. Is the relation symmetric?
16 Relation Properties - Some Practice Is the relation reflexive? Yes. Every element has an arc from itself to itself. Is the relation symmetric? Yes. Every time there is an arc from one element to another, another arc comes back. There does not need to be as many arcs between elements as in the previous example. Is the relation transitive?
17 Relation Properties - Some Practice Is the relation reflexive? Yes. Every element has an arc from itself to itself. Is the relation symmetric? Yes. Every time there is an arc from one element to another, another arc comes back. There does not need to be as many arcs between elements as in the previous example. Is the relation transitive? Yes. Every pair of linked arcs also has another arc between the two endpoints forming a triangle as between the elements 3, 6 and 9 or a petal, as between 4 and 7?
18 Relation Properties - More Practice Consider the set A = {0, 1, 2, 3}. Define a binary relation R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)} Draw the directed graph representing this relationship and determine if it is reflexive, symmetric or transitive.
19 Relation Properties - More Practice Consider the set A = {0, 1, 2, 3}. Define a binary relation R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)} Draw the directed graph representing this relationship and determine if it is reflexive, symmetric or transitive. The directed graph is given by:
20 Relation Properties - More Practice Is the relation reflexive?
21 Relation Properties - More Practice Is the relation reflexive? Yes. Every element has an arc from itself to itself. Is the relation symmetric?
22 Relation Properties - More Practice Is the relation reflexive? Yes. Every element has an arc from itself to itself. Is the relation symmetric? Yes. Every time there is an arc from one element to another, another arc comes back. Is the relation transitive?
23 Relation Properties - More Practice Is the relation reflexive? Yes. Every element has an arc from itself to itself. Is the relation symmetric? Yes. Every time there is an arc from one element to another, another arc comes back. Is the relation transitive? No. Some elements are involved in transitive groupings: 0 and 3, and 0 and 1. However, in order for this relation to be transitive, all such groupings must be transitive. There are pairs of arcs from 3 to 0 and 0 to 1, but not from 3 to 1, and also going back in the other direction.
24 Relation Properties - Closure It is often desirable for a relation to have the properties of reflexivity, symmetry and transitivity. If a relation does not have one of these properties, what would it take to give it that property? For a relation on a finite set, we can answer this question directly: add enough pairs to the relation so that every arc is part of a petal or a self-loop. For an infinite relation it is not always so clear what to do. This is the concept of closure. We would like to construct a new relation from the old relation by adding the minimal number of ordered pairs to the relation (or arcs to the directed graph) that produce the desired property.
25 Relation Properties - Closure Reflexive Closure - to make a relation reflexive, you simply need to add all of the pairs (x, x) that are not already in the relation, so that every element has an arc from itself to itself. This is equivalent to taking the union of the original set with the identity set, R closure = R I. Symmetric Closure - to make a relation symmetric, you simply need to add all of the pairs (y, x) for every pair (x, y) that is already in the set, so that a return arc now exists between two elements that had an arc between them already. This is equivalent to taking the union of the original set with its inverse, R closure = R R 1. Transitive Closure - to make a relation transitive is a little harder. If it already contains the connected pairs (x, y) and (y, z), we must add (x, z) if it does not already exist. However, we need an iterative process, since adding the pair (x, z) to the set may form another connected pairing that needs yet another pairing added.
26 Closure - An Example Consider a set A = {0, 1, 2, 3} on which a relation R is defined as given by the directed graph below. 0 1 R1 3 2 Determine the arcs (pairs) that you must add to this relation to make it reflexive, symmetric, or transitive.
27 Closure - An Example Reflexive Closure - add arcs for (1, 1) and (3, 3) Symmetric Closure - add arcs for (1, 0), (2, 1) and (3, 2)
28 Closure - An Example Transitive Closure - first add arcs for (0, 2) and (1, 3) Then on second iteration add arc for (0, 3).
29 Relation Properties - AntiSymmetric A relation is antisymmetric if when any element of the set is related to a different element, then the second element is not related to the first. An element can still relate to itself. x, y A, if (x, y) R then (y, x) R. The graph below defines an antisymmetric relation. 0 1 R1 3 2 Antisymmetric and also not symmetric.
30 Antisymmetric Not symmetric antisymmetric is not the same as not symmetric. Although R1 on the previous slide is antisymmetric and also not symmetric, R3, below is neither symmetric nor antisymmetric: 0 1 R3 3 2 This situation happens when SOME but not ALL elements have symmetric relationships.
31 Properties of Equality Many relations can be defined over an infinite set. One such is equality, which is defined as, (x, y) R if x = y. Equality is reflexive. Obviously, x = x. Equality is symmetric. If x = y, then obviously y = x. Equality is transitive. If x = y and y = z, then it is clear that x = z If a relation is reflexive, symmetric and transitive, it is called an equivalence relation. We will talk more about these later.
32 Properties of Less Than Another common relation on an infinite set is less than, which is defined as, (x, y) R if x < y. Less than is not reflexive. Obviously, since x = x, it is not true that x < x. Less than is not symmetric. If x < y, then y > x and therefore it is not true that y < x. Less than is transitive. If x < y and y < z, then it is clear that x < z
Section 7.1 Relations and Their Properties. Definition: A binary relation R from a set A to a set B is a subset R A B.
Section 7.1 Relations and Their Properties Definition: A binary relation R from a set A to a set B is a subset R A B. Note: there are no constraints on relations as there are on functions. We have a common
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationRelations Graphical View
Introduction Relations Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Recall that a relation between elements of two sets is a subset of their Cartesian
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More informationNotes. Relations. Introduction. Notes. Relations. Notes. Definition. Example. Slides by Christopher M. Bourke Instructor: Berthe Y.
Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 7.1, 7.3 7.5 of Rosen cse235@cse.unl.edu
More informationReading 11 : Relations and Functions
CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Reading 11 : Relations and Functions Instructor: Beck Hasti and Gautam Prakriya In reading 3, we described a correspondence between predicates
More informationRelations. Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations. Reading (Epp s textbook)
Relations Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations Reading (Epp s textbook) 8.-8.3. Cartesian Products The symbol (a, b) denotes the ordered
More informationChapter 9: Relations Relations
Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair
More informationCOMP 182 Algorithmic Thinking. Relations. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Relations Luay Nakhleh Computer Science Rice University Chapter 9, Section 1-6 Reading Material When we defined the Sorting Problem, we stated that to sort the list, the elements
More informationCHAPTER 1. Relations. 1. Relations and Their Properties. Discussion
CHAPTER 1 Relations 1. Relations and Their Properties 1.1. Definition of a Relation. Definition 1.1.1. A binary relation from a set A to a set B is a subset R A B. If (a, b) R we say a is Related to b
More information1.4 Equivalence Relations and Partitions
24 CHAPTER 1. REVIEW 1.4 Equivalence Relations and Partitions 1.4.1 Equivalence Relations Definition 1.4.1 (Relation) A binary relation or a relation on a set S is a set R of ordered pairs. This is a very
More informationSets. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing Spring, Outline Sets An Algebra on Sets Summary
An Algebra on Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing Spring, 2018 Alice E. Fischer... 1/37 An Algebra on 1 Definitions and Notation Venn Diagrams 2 An Algebra on 3 Alice E. Fischer...
More informationOutline Goals and Assumptions Real Numbers Rational and Irrational. L11: Numbers. Alice E. Fischer
L11: Numbers Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing March 5-8, 2018 1 Goals and Assumptions 2 Real Numbers 3 Rational and Irrational Assumptions We rely the following assumptions:
More informationCMPSCI 250: Introduction to Computation. Lecture #11: Equivalence Relations David Mix Barrington 27 September 2013
CMPSCI 250: Introduction to Computation Lecture #11: Equivalence Relations David Mix Barrington 27 September 2013 Equivalence Relations Definition of Equivalence Relations Two More Examples: Universal
More informationCSC Discrete Math I, Spring Relations
CSC 125 - Discrete Math I, Spring 2017 Relations Binary Relations Definition: A binary relation R from a set A to a set B is a subset of A B Note that a relation is more general than a function Example:
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
More informationMITOCW Lec 11 MIT 6.042J Mathematics for Computer Science, Fall 2010
MITOCW Lec 11 MIT 6.042J Mathematics for Computer Science, Fall 2010 The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high
More informationToday. Binary relations establish a relationship between elements of two sets
Today Relations Binary relations and properties Relationship to functions n-ary relations Definitions Binary relations establish a relationship between elements of two sets Definition: Let A and B be two
More informationRela%ons and Their Proper%es. Slides by A. Bloomfield
Rela%ons and Their Proper%es Slides by A. Bloomfield What is a rela%on Let A and B be sets. A binary rela%on R is a subset of A B Example Let A be the students in a the CS major A = {Alice, Bob, Claire,
More informationMath.3336: Discrete Mathematics. Chapter 9 Relations
Math.3336: Discrete Mathematics Chapter 9 Relations Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall 2018
More informationProblem 2: (Section 2.1 Exercise 10) (a.) How many elements are in the power set of the power set of the empty set?
Assignment 4 Solutions Problem1: (Section 2.1 Exercise 9) (a.) List all the subsets of the set {a, b, c, d} which contain: (i.) four elements (ii.) three elements (iii.) two elements (iv.) one element
More informationPractice Final Solutions. 1. Consider the following algorithm. Assume that n 1. line code 1 alg(n) { 2 j = 0 3 if (n = 0) { 4 return j
Practice Final Solutions 1. Consider the following algorithm. Assume that n 1. line code 1 alg(n) 2 j = 0 3 if (n = 0) 4 return j } 5 else 6 j = 2n+ alg(n 1) 7 return j } } Set up a recurrence relation
More informationBinary Relation Review Questions
CSE 191 Discrete Structures Fall 2016 Recursive sets Binary Relation Review Questions 1. For each of the relations below, answer the following three questions: Is the relation reflexive? Is the relation
More informationRelations. Relations. Definition. Let A and B be sets.
Relations Relations. Definition. Let A and B be sets. A relation R from A to B is a subset R A B. If a A and b B, we write a R b if (a, b) R, and a /R b if (a, b) / R. A relation from A to A is called
More informationAutomata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Mathematical Background Mathematical Background Sets Relations Functions Graphs Proof techniques Sets
More informationDiscrete Mathematics. 2. Relations
Discrete Mathematics 2. Relations Binary Relations Let A, B be any two sets. A binary relation R from A to B is a subset of A B. E.g., Let < : N N : {(n,m) n < m} The notation a R b or arb means (a,b)îr.
More informationRelations. P. Danziger. We may represent a relation by a diagram in which a line is drawn between two elements if they are related.
- 10 Relations P. Danziger 1 Relations (10.1) Definition 1 1. A relation from a set A to a set B is a subset R of A B. 2. Given (x, y) R we say that x is related to y and write xry. 3. If (x, y) R we say
More informationWeek 4-5: Binary Relations
1 Binary Relations Week 4-5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all
More informationQuestions From Old Exams
MATH 0 OLD EXAM QUESTIONS FOR EXAM 3 ON CHAPTERS 3 AND 4 PAGE Questions From Old Eams. Write the equation of a quadratic function whose graph has the following characteristics: It opens down; it is stretched
More informationWhat are relations? f: A B
What are relations? Ch 9.1 What are relations? Notation Informally, a relation is a set of pairs of objects (or in general, set of n-tuples) that are related to each other by some rule. We will focus first
More informationMAT335H1F Lec0101 Burbulla
Fall 2011 Q 2 (x) = x 2 2 Q 2 has two repelling fixed points, p = 1 and p + = 2. Moreover, if I = [ p +, p + ] = [ 2, 2], it is easy to check that p I and Q 2 : I I. So for any seed x 0 I, the orbit of
More informationChapter 1 Review of Equations and Inequalities
Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 5 CHAPTER 2 FINITE AUTOMATA 1. Deterministic Finite Automata DFA 2. Nondeterministic Finite Automata NDFA 3. Finite Automata
More informationWeek 4-5: Binary Relations
1 Binary Relations Week 4-5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all
More informationSupplement. Algebraic Closure of a Field
Supplement: Algebraic Closure of a Field 1 Supplement. Algebraic Closure of a Field Note. In this supplement, we give some background material which is used in the proof of Fraleigh s Theorem 31.17/31.22
More informationOn alternating products of graph relations
On alternating products of graph relations. Bodendiek Institut f. Mathematik und ihre Didaktik Christian-Albrechts-Universität Kiel.Lang Fachbereich Informatik Universität Hamburg Abstract It is well-known
More informationCSE 311: Foundations of Computing I Autumn 2014 Practice Final: Section X. Closed book, closed notes, no cell phones, no calculators.
CSE 311: Foundations of Computing I Autumn 014 Practice Final: Section X YY ZZ Name: UW ID: Instructions: Closed book, closed notes, no cell phones, no calculators. You have 110 minutes to complete the
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationDepartment of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination I (Spring 2008)
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination I (Spring 2008) Problem 1: Suppose A, B, C and D are arbitrary sets.
More information(1) Which of the following are propositions? If it is a proposition, determine its truth value: A propositional function, but not a proposition.
Math 231 Exam Practice Problem Solutions WARNING: This is not a sample test. Problems on the exams may or may not be similar to these problems. These problems are just intended to focus your study of the
More informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationIntroductory Analysis I Fall 2014 Homework #5 Solutions
Introductory Analysis I Fall 2014 Homework #5 Solutions 6. Let M be a metric space, let C D M. Now we can think of C as a subset of the metric space M or as a subspace of the metric space D (D being a
More informationLOGIC AND SET THEORY - HOMEWORK Question 1. n + 1 Unknown - either n or n 1, depending on whether { } A
LOGIC AND SET THEORY - HOMEWORK 1 OHAD LUTZKY, MAAYAN KESHET 1. Question 1 In the order A B, A B, A B =, Yes, no, yes No, yes, no Yes, no, yes Same as 1 Yes, no, yes No, yes, no 2. Question 2 n 0 n + 1
More informationPlanar Graphs (1) Planar Graphs (3) Planar Graphs (2) Planar Graphs (4)
S-72.2420/T-79.5203 Planarity; Edges and Cycles 1 Planar Graphs (1) Topological graph theory, broadly conceived, is the study of graph layouts. Contemporary applications include circuit layouts on silicon
More informationLECTURE 15: RELATIONS. Software Engineering Mike Wooldridge
LECTURE 15: RELATIONS Mike Wooldridge 1 Introduction We saw in earlier lectures that a function is just a set of maplets, for example: tel == {mikew 1531, eric 1489}. A maplet is just an ordered pair,
More informationFunctions and Relations II. CS2100 Ross Whitaker University of Utah
Functions and Relations II CS2100 Ross Whitaker University of Utah Infinitely Big Sets Counting and size: thought experiment How many elements does the following set have? How do we know? What do we mean
More information8.2 Graphs of Polar Equations
8. Graphs of Polar Equations Definition: A polar equation is an equation whose variables are polar coordinates. One method used to graph a polar equation is to convert the equation to rectangular form.
More informationLesson 5: The Graph of the Equation y = f(x)
Lesson 5: The Graph of the Equation y = f(x) Learning targets: I can identify when a function is increasing, decreasing, positive and negative and use interval notation to describe intervals where the
More information1. (B) The union of sets A and B is the set whose elements belong to at least one of A
1. (B) The union of sets A and B is the set whose elements belong to at least one of A or B. Thus, A B = { 2, 1, 0, 1, 2, 5}. 2. (A) The intersection of sets A and B is the set whose elements belong to
More informationRelations, Functions, and Sequences
MCS-236: Graph Theory Handout #A3 San Skulrattanakulchai Gustavus Adolphus College Sep 13, 2010 Relations, Functions, and Sequences Relations An ordered pair can be constructed from any two mathematical
More informationChapter 3.5: Rational Functions
Chapter.5: Rational Functions A rational number is a ratio of two integers. A rational function is a quotient of two polynomials. All rational numbers are, therefore, rational functions as well. Let s
More informationCS 455/555: Mathematical preliminaries
CS 455/555: Mathematical preliminaries Stefan D. Bruda Winter 2019 SETS AND RELATIONS Sets: Operations: intersection, union, difference, Cartesian product Big, powerset (2 A ) Partition (π 2 A, π, i j
More informationRelations. Definition 1 Let A and B be sets. A binary relation R from A to B is any subset of A B.
Chapter 5 Relations Definition 1 Let A and B be sets. A binary relation R from A to B is any subset of A B. If A = B then a relation from A to B is called is called a relation on A. Examples A relation
More informationEach element of the domain is paired with exactly one element of the range. So, the relation is a function.
CCSS STRUCTURE State the domain and range of each relation. Then determine whether each relation is a function. If it is a function, determine if it is one-to-one, onto, both, or neither. 1. The left side
More information1-1. Expressions and Formulas. Lesson 1-1. What You ll Learn. Active Vocabulary
1-1 Expressions and Formulas What You ll Learn Skim the lesson. Write two things you already know about expressions and formulas. 1. Active Vocabulary 2. Review Vocabulary Identify the four grouping symbols
More informationDiscrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009
Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we
More informationCLEP Precalculus - Problem Drill 15: Systems of Equations and Inequalities
CLEP Precalculus - Problem Drill 15: Systems of Equations and Inequalities No. 1 of 10 1. What are the methods to solve a system of equations? (A) Graphing, replacing, substitution and matrix techniques.
More informationSEVENTH EDITION and EXPANDED SEVENTH EDITION
SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 5-1 Chapter 5 Number Theory and the Real Number System 5.1 Number Theory Number Theory The study of numbers and their properties. The numbers we use to
More informationRelations. We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples.
Relations We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples. Relations use ordered tuples to represent relationships among
More informationRelations, Functions, Binary Relations (Chapter 1, Sections 1.2, 1.3)
Relations, Functions, Binary Relations (Chapter 1, Sections 1.2, 1.3) CmSc 365 Theory of Computation 1. Relations Definition: Let A and B be two sets. A relation R from A to B is any set of ordered pairs
More informationNotes for Science and Engineering Foundation Discrete Mathematics
Notes for Science and Engineering Foundation Discrete Mathematics by Robin Whitty BSc PhD CMath FIMA 2009/2010 Contents 1 Introduction 1 1.1 The Laws of Arithmetic....................... 2 2 Polynomial
More informationFINITE IRREFLEXIVE HOMOMORPHISM-HOMOGENEOUS BINARY RELATIONAL SYSTEMS 1
Novi Sad J. Math. Vol. 40, No. 3, 2010, 83 87 Proc. 3rd Novi Sad Algebraic Conf. (eds. I. Dolinka, P. Marković) FINITE IRREFLEXIVE HOMOMORPHISM-HOMOGENEOUS BINARY RELATIONAL SYSTEMS 1 Dragan Mašulović
More informationAnswers for Calculus Review (Extrema and Concavity)
Answers for Calculus Review 4.1-4.4 (Extrema and Concavity) 1. A critical number is a value of the independent variable (a/k/a x) in the domain of the function at which the derivative is zero or undefined.
More informationPreCalculus: Semester 1 Final Exam Review
Name: Class: Date: ID: A PreCalculus: Semester 1 Final Exam Review Short Answer 1. Determine whether the relation represents a function. If it is a function, state the domain and range. 9. Find the domain
More informationRELATIONS AND FUNCTIONS
For more important questions visit : www.4ono.com CHAPTER 1 RELATIONS AND FUNCTIONS IMPORTANT POINTS TO REMEMBER Relation R from a set A to a set B is subset of A B. A B = {(a, b) : a A, b B}. If n(a)
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 3 CHAPTER 1 SETS, RELATIONS, and LANGUAGES 6. Closures and Algorithms 7. Alphabets and Languages 8. Finite Representation
More informationChapter 6. Relations. 6.1 Relations
Chapter 6 Relations Mathematical relations are an extremely general framework for specifying relationships between pairs of objects. This chapter surveys the types of relations that can be constructed
More informationThe main limitation of the concept of a. function
Relations The main limitation of the concept of a A function, by definition, assigns one output to each input. This means that a function cannot model relationships between sets where some objects on each
More informationbc7f2306 Page 1 Name:
Name: Questions 1 through 4 refer to the following: Solve the given inequality and represent the solution set using set notation: 1) 3x 1 < 2(x + 4) or 7x 3 2(x + 1) Questions 5 and 6 refer to the following:
More information1.A Sets, Relations, Graphs, and Functions 1.A.1 Set a collection of objects(element) Let A be a set and a be an elements in A, then we write a A.
1.A Sets, Relations, Graphs, and Functions 1.A.1 Set a collection of objects(element) Let A be a set and a be an elements in A, then we write a A. How to specify sets 1. to enumerate all of the elements
More information3.4 Using the First Derivative to Test Critical Numbers (4.3)
118 CHAPTER 3. APPLICATIONS OF THE DERIVATIVE 3.4 Using the First Derivative to Test Critical Numbers (4.3) 3.4.1 Theory: The rst derivative is a very important tool when studying a function. It is important
More informationor 0101 Machine
Synchronous State Graph or Synchronous State Graph or Detector Design a state graph for a machine with: One input X, one output Z. Z= after receiving the complete sequence or Overlapped sequences are detected.
More information1 Partitions and Equivalence Relations
Today we re going to talk about partitions of sets, equivalence relations and how they are equivalent. Then we are going to talk about the size of a set and will see our first example of a diagonalisation
More informationOn the sum of tangle diagrams with certain symmetry
On the sum of tangle diagrams with certain symmetry Byeorhi Kim Department of Mathematics College of Natural Sciences Kyungpook National University Aug 25. 2014 Contents 1. REVIEWS 2. CONSTRUCTION Deformation
More informationThe Hurewicz Theorem
The Hurewicz Theorem April 5, 011 1 Introduction The fundamental group and homology groups both give extremely useful information, particularly about path-connected spaces. Both can be considered as functors,
More information5. Partitions and Relations Ch.22 of PJE.
5. Partitions and Relations Ch. of PJE. We now generalize the ideas of congruence classes of Z to classes of any set X. The properties of congruence classes that we start with here are that they are disjoint
More informationCLASS XII CBSE MATHEMATICS RELATIONS AND FUNCTIONS 1 Mark/2 Marks Questions
CLASS XII CBSE MATHEMATICS RELATIONS AND FUNCTIONS 1 Mark/ Marks Questions (1) Let be a binary operation defined by a b = a + b 3. Find3 4. () The binary operation : R R R is defined as a b = a + b. Find
More informationPart I Directions: MULTIPLE CHOICE Place your answer to each question on the space provided. 1. Which is equivalent to the equation y? 4.
Name: Date: Block: Algebra I Practice Midterm Exam Part I Directions: MULTIPLE CHOICE Place your answer to each question on the space provided. 3x z. Which is equivalent to the equation y? 4 3x z (a) x
More informationObjectives: Review open, closed, and mixed intervals, and begin discussion of graphing points in the xyplane. Interval notation
MA 0090 Section 18 - Interval Notation and Graphing Points Objectives: Review open, closed, and mixed intervals, and begin discussion of graphing points in the xyplane. Interval notation Last time, we
More informationMath 1051, Robertson, Exam 3 on Chapters 3 & 4 on Friday 12 November 2010 KEY page 1
Math, Robertson, Eam on Chapters & on Friday November 0 KEY page. You earned points out of. Ans: f 6 Write the equation of a quadratic function whose graph has the following characteristics: It opens down;
More informationMath 2534 Solution to Test 3A Spring 2010
Math 2534 Solution to Test 3A Spring 2010 Problem 1: (10pts) Prove that R is a transitive relation on Z when given that mrpiff m pmod d (ie. d ( m p) ) Solution: The relation R is transitive, if arb and
More information3-1 Graphing and Writing Inequalities. Warm Up Lesson Presentation Lesson Quiz
3-1 Graphing and Writing Inequalities Warm Up Lesson Presentation Lesson Quiz Holt Holt Algebra Algebra 1 1 Bell Quiz 3-1 Compare. Write , or =. 2 pts 1. 3 2 2 pts 2. 6.5 6.3 1 pt for putting your
More informationSeminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)
http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product
More informationASSIGNMENT 1 SOLUTIONS
MATH 271 ASSIGNMENT 1 SOLUTIONS 1. (a) Let S be the statement For all integers n, if n is even then 3n 11 is odd. Is S true? Give a proof or counterexample. (b) Write out the contrapositive of statement
More informationProblem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B.
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination III (Spring 2007) Problem 1: Suppose A, B, C and D are finite sets
More informationReductions. Example 1
Reductions We want to compare the complexity of different problems. A reduction from problem X to problem Y means that problem X is easier (or, more precisely, not harder) than problem Y. We write X Y
More informationRelations. Binary Relation. Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation. Let R A B be a relation from A to B.
Relations Binary Relation Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation Let R A B be a relation from A to B. If (a, b) R, we write a R b. 1 Binary Relation Example:
More informationGeneral Technical Remarks on PDE s and Boundary Conditions Kurt Bryan MA 436
General Technical Remarks on PDE s and Boundary Conditions Kurt Bryan MA 436 1 Introduction You may have noticed that when we analyzed the heat equation on a bar of length 1 and I talked about the equation
More informationDepartment of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Problem 1: Specify two different predicates P (x) and
More informationTheorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers
Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower
More informationDiscrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland
Discrete Mathematics W. Ethan Duckworth Fall 2017, Loyola University Maryland Contents 1 Introduction 4 1.1 Statements......................................... 4 1.2 Constructing Direct Proofs................................
More informationMultiple Choice Questions for Review
Equivalence and Order Multiple Choice Questions for Review In each case there is one correct answer (given at the end of the problem set). Try to work the problem first without looking at the answer. Understand
More informationMEP Pupil Text 13-19, Additional Material. Gradients of Perpendicular Lines
Graphs MEP Pupil Text -9, Additional Material.B Gradients of Perpendicular Lines In this section we explore the relationship between the gradients of perpendicular lines and line segments. Worked Example
More informationarb where a A, b B and we say a is related to b. Howdowewritea is not related to b? 2Rw 1Ro A B = {(a, b) a A, b B}
Functions Functions play an important role in mathematics as well as computer science. A function is a special type of relation. So what s a relation? A relation, R, from set A to set B is defined as arb
More informationPatterns and minimal dynamics for graph maps
Patterns and minimal dynamics for graph maps Lluís Alsedà Departament de Matemàtiques Universitat Autònoma de Barcelona http://www.mat.uab.cat/ alseda XV Encuentro de Topología Castellò de la Plana, September
More informationMath6100 Day 8 Notes 6.1, 6.2 & 6.3, Area
Math6100 Day 8 Notes 6.1, 6.2 & 6.3, Area 6.1 Area of Polygonal Regions Let's first derive formulas for the area of these shapes. 1. Rectangle 2. Parallelogram 3. Triangle 4. Trapezoid 1 Ex 1: Find the
More informationSum and Product Rules
Sum and Product Rules Exercise. Consider tossing a coin five times. What is the probability of getting the same result on the first two tosses or the last two tosses? Solution. Let E be the event that
More informationIntroduction to Turing Machines. Reading: Chapters 8 & 9
Introduction to Turing Machines Reading: Chapters 8 & 9 1 Turing Machines (TM) Generalize the class of CFLs: Recursively Enumerable Languages Recursive Languages Context-Free Languages Regular Languages
More informationPacket #5: Binary Relations. Applied Discrete Mathematics
Packet #5: Binary Relations Applied Discrete Mathematics Table of Contents Binary Relations Summary Page 1 Binary Relations Examples Page 2 Properties of Relations Page 3 Examples Pages 4-5 Representations
More information