Relations. We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples.
|
|
- Kevin Manning
- 5 years ago
- Views:
Transcription
1 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 objects. Examples The parent relationship between specified persons can be described as a set of pairs. For instance, if Morris and Ria are the parents of Steve, then the relation would include the pairs, (M orris, Steve) and (Ria, Steve). The less-than relation on the integers consists of all pairs of integers (i,j), where i is less than j, e.g., (3,42) and (42,43). The relation that student number x is named y and majors in z is described by a set of triples, such as ( , M ary, CSE). Finally, the (unary) relation that k is an even integer corresponds to a subset of the integers. Relations are closely related to predicates and truth sets.
2 Binary Relations Let A and B are sets. A binary relation from A to B is a set R A B. In other words, a binary relation R is a set of ordered pairs (x,y) where x A and y B. If (x,y) R then we sometimes write xry. Example Take sets A = {2,6,7} and B = {1,2,5} and let R 1 be a binary relation defined by: i in A is an integer multiple of y in B. Then R 1 = {(2,1),(2,2),(6,1),(6,2),(7,1)}.
3 Presenting Binary Relations Binary relations have two kinds of compact visual representation, tables and graphs. The following table represents a binary relation of five pairs: R a b c 1 * * 2 * * 3 * Graphs are composed of vertices or nodes connected by edges or arcs. There is an arc from a to b if, and only if, (a,b) R. 1 A 2 B 3 C
4 The Parent-Of Relation The parent-of relation is a binary relation, described by pairs of names. Example Myrtle Ormonde William Joan Paula Gene Sue R G J W S M O P G[ene] J[oan] * * W[illiam] * * S[ue] M[yrtle] * O[rmonde] * * P[aula] Which representation is better for testing whether the pair (x,y) is in the relation? Which representation is better for capturing the overall structure?
5 Reflexive Relations A binary relation R on a set A is called reflexive if it contains all pairs (x,x) A A. Thus, if R is reflexive then the set I = {(x,x) x A} is a subset of R. A relation R on A is irreflexive if it contains no pair (x,x), i.e., the sets I and R are disjoint. In the table representation the difference between the two properties can be seen in the main diagonal of the table. R R *?? 1?? 2? *? 2?? 3?? * 3?? In a graph, the difference is in the (presence or absence of) self-loops. Is the parent-of relation reflexive, irreflexive, or neither? Is the relation reflexive, irreflexive, or neither?
6 Symmetric Relations A binary relation R on A is called symmetric if for all x,y A, whenever (x,y) R then (y,x) R. A relation R on A is antisymmetric if for all x,y A, if (x,y) R and (y,x) R, then x = y. The table of a symmetric relation is symmetric around the main diagonal, whereas for an antisymmetric relation there are no symmetric entries (except on the diagonal itself): R R ? A B 1? * 2 A? C 2 *? 3 B C? 3 *? Is the cousin-of relation symmetric, antisymmetric, or neither? Is the brother-of relation symmetric, antisymmetric, or neither?
7 Transitive Relations A binary relation R on A is said to be transitive if for all x, y, z in A, if xry and yrz, then xrz. If a graph represents a transitive relation and there is a path from node a to node b, then there is a single arc from a to b. Is the ancestor-of relation transitive or not? Is the friend-of relation transitive or not? The transitive closure of a relation R adds all the arcs to R necessary to make it transitive The ancestor relation is the transitive closure of the parent relation.
8 Special Binary Relations The universal relation U = A A. The empty relation R =. The identity relation I = {(x,x) x A} Which of the main properties - reflexivity, symmetry, transitivity - are satisfied by these relations?
9 Relational Databases Commercial database systems employ a relational model, meaning that data is stored in the form of tables of tuples, i.e., relations. A Shakespearian Killed relation would include the following entries: Killer Victim Brutus Caesar Hamlet Laertes Hamlet Polonius Laertes Hamlet Brutus Brutus Cassius Caesar Query languages like SQL can be used to extract information from a database. Example. Who killed Caesar? SELECT Killer FROM Killed WHERE victim= Caesar This reads select from relation Killed all tuples where the victim was Caesar, and report only the killer field from each. Example. Who was both a killer and a victim? (SELECT Killer FROM Killed) INTERSECT (SELECT Victim FROM Killed)
10 A powerful feature of relational databases is that one can combine different relations. For example, suppose there is a died-by relation: Victim Caesar Hamlet Laertes Polonius Brutus Method Daggers Sword Sword Sword Sword We can combine the two tables with a join operation, based on common fields. For example, the join of killed and died-by is: Killer Victim Method Brutus Caesar Daggers Hamlet Laertes Sword Hamlet Polonius Sword Laertes Hamlet Sword Brutus Brutus Sword Cassius Caesar Daggers Example. Which killers used daggers? SELECT Killer FROM Killed, Died-by WHERE Killed.Victim = Died-by.victim AND Method= Daggers
11 Equivalence Relations An equivalence relation is a binary relation that is reflexive, transitive, and symmetric. For example, the identity relation and the universal relation (on a nonempty set A) are equivalence relations. An equivalence relation defines clusters of elements of A: [x] = {y A : xry}. The sets [x] are called equivalence classes. For example, the relation on N, defined by m n iff m+n is even, is an equivalence that partitions the set of natural numbers into two subsets the sets of even and odd natural numbers, respectively.
12 Partitions Theorem If R is an equivalence relation on a nonempty set A, then the equivalence classes of R constitute a partition of A. Theorem If Π is a partition of A, then the relation {(x,y) : x and y belong to the same set in Π} is an equivalence relation. In other words, there is a one-to-one correspondence between equivalence relations and partitions. For example, {{a},{b},{c}} and {{a,c},{b}} are partitions of {a,b,c} and hence correspond to equivalence relations; whereas {{a},{b},{b,c}} is not a partition and does not correspond to an equivalence relation.
13 Congruence Modulo p Define binary relations on the integers, for all integers p greater than 1, as follows: m is congruent to n modulo p, written m n(mod p), if m n is an integer multiple of p. For example, if p = 3, Then 1 is congruent to 4 modulo p, but not congruent to 3. Let R p denote the corresponding set of pairs {(m,n) : m n(mod p)}. Are the relations R p reflexive, symmetric, and transitive?
14 Modular Arithmetic To visualize the relation R 12, think of grouping integers by counting around a clock Note that 23 = 11(mod 12). If you start at 0 and count to 23 you end up at 11. In other words, 11 and 23 have the same remainder when divided by 12. Note that if m = n(mod p) and x = y(mod p) then m+x = n+y(mod p) think about tracing out a path on the clock to prove it.
15 Equivalence of Strings We define a binary relation on strings as follows: Theorem Proof v w if and only if v = w. The relation is an equivalence relation. Reflexivity. We have w = w, and hence w w, for all strings w. Symmetry. If v w, then by definition v = w. By the symmetry of equality we thus have w = v, and hence w v. Transitivity. Suppose u v and v w. Then u = v and v = w and therefore, by the transitivity of equality, u = w, which implies u w. The equivalence classes for this relation are the sets Σ k of all strings of length k.
16 Partial Orders A binary relation on a set A is called a partial order if it is reflexive, transitive, and antisymmetric. The symbol (in infix notation) is often used to denote a partial order. We say that two elements x and y are comparable (with respect to a given partial order ) if either x y or y x. A partial order on a set A is said to be total if any two elements in A are comparable. Is the identity relation a partial order? Is the universal relation a partial order?
17 Partial Orders - Examples Examples of partial orders are the less-than-or-equalto relation, the divisibility relation (on the positive integers), subset relations, and ancestor relations. The following graph represents the divided-by relation on certain integers: The antisymmetry property ensures that the graph of a partial order has no cycles (other than selfloops). If a partial order is extended to a total one we speak of topological sorting. If the set A has n elements, there are n! total orders on A.
18 Lexicographic Orders The words in a dictionary are arranged in a lexicographic order, which we define next. Let x and y be strings of letters. Then x L y if, and only if, 1. x is a prefix of y, or 2. x and y are equal, or 3. x can be written as uσv and y as uτw, where the letter σ alphabetically precedes the letter τ. The string u is the longest common prefix of x and y. For example, aa L ab and aa L b. The lexicographic order is also called a dictionary order. In this order there are infinite ascending chains, a L aa L aaa L Interestingly, there are also infinite descending chains, b L ab L aab L aaab L
19 Predecessors and Successors Let be a partial order on a set A. We say that x is a predecessor of y (and y a successor of x) if x y and x y. For example, the integer k + j is a successor of k (with respect to ) if j is positive, and a predecessor of k if j is negative. The natural number 0 has no predecessor in the set of nonnegative integers (with respect to ). We say that x is an immediate predecessor of y (and y an immediate successor of x) if there is no third element z A, such that x is a predecessor of z and z a predecessor of y. The integer k + 1 is an immediate successor of k, whereas k 1 is an immediate predecessor. Note that a rational number has no immediate predecessor or immediate successor (with respect to ).
20 Hasse Diagrams The Hasse diagram of a partial order on A is a directed graph with set of nodes A and an arrow from a node x to a node y whenever x is an immediate predecessor of y. These diagrams allow for a concise graphical representation of many partial orders as reflexivity and transitivity are implicitly presented. Hasse diagrams are usually drawn with their edges directed upwards (and with arrow heads left off). {a,b,c} {a,b} {a,c} {b,c} {a} {b} {c} {}
21 Subsets by Inclusion The graphs representing subset relations are also called hypercubes. {1, 2, 3, 4} {1, 2, 3} {1, 3, 4} {2, 3, 4} {1, 2, 4} {1, 2} {2, 3} {1, 3} {3, 4} {2, 4} {1, 4} {1} {2} {3} {4} {} Note the recursive structure of a hypercube: a d- dimensional cube is composed by connecting two (d 1)-dimensional cubes.
22 Infinite Hasse Diagrams Many partial orders on infinite sets can be represented by Hasse diagrams, e.g., the less-than-orequal-to relation on integers. A partial order is said to be dense if it is the case that whenever x is a predecessor of y, then there is another element z such that x is a predecessor of z and z a predecessor of y. The less-than-or-equal-to relation on the rational numbers is an example of a dense order. Dense orders cannot be represented by Hasse diagrams.
23 Minima and Maxima Let be a partial order on a set A. We say that x is a minimal element if it has no predecessor in A. In other words, if x is a minimal element and y x, then y = x. We say that x is a maximal element if it has no successor in A. What are the minimal and maximal elements in the divided-by relation shown previously? Does every partial order have a minimal and/or a maximal element? Is it possible for an element to be minimal and maximal at the same time?
24 Least and Greatest Elements If a minimal element x is a predecessor of every other element of A, then it is called the least element of A. Similarly, a maximal element that is a successor of every other element of A, is called the greatest element. For example, if we consider the subset relation on a power set P(S), then the empty set is the least element, and the set S the greatest element. The integer 0 is the least element of N (with respect to ), but there is no maximal element (and hence no greatest element either). If the set A is finite, there must be a minimal and a maximal element.
Definition: 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 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. 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 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 information{a, b, c} {a, b} {a, c} {b, c} {a}
Section 4.3 Order Relations A binary relation is an partial order if it transitive and antisymmetric. If R is a partial order over the set S, we also say, S is a partially ordered set or S is a poset.
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 informationRelationships between elements of sets occur in many contexts. Every day we deal with
C H A P T E R 9 Relations 9.1 Relations and Their Properties 9.2 n-ary Relations and Their Applications 9.3 Representing Relations 9.4 Closures of Relations 9.5 Equivalence Relations 9.6 Partial Orderings
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 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 informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Section 9.1 Rela%onships Relationships between elements of sets occur in many contexts. Every day we deal with relationships such as those between a business and its telephone number, an employee and his
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 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 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 information3. R = = on Z. R, S, A, T.
6 Relations Let R be a relation on a set A, i.e., a subset of AxA. Notation: xry iff (x, y) R AxA. Recall: A relation need not be a function. Example: The relation R 1 = {(x, y) RxR x 2 + y 2 = 1} is not
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 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 informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
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 informationLecture 7: Relations
Lecture 7: Relations 1 Relation Relation between two objects signify some connection between them. For example, relation of one person being biological parent of another. If we take any two people at random,
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 informationFoundations of Mathematics
Foundations of Mathematics L. Pedro Poitevin 1. Preliminaries 1.1. Sets We will naively think of a set as a collection of mathematical objects, called its elements or members. To indicate that an object
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 informationWeek 4-5: Generating Permutations and Combinations
Week 4-5: Generating Permutations and Combinations February 27, 2017 1 Generating Permutations We have learned that there are n! permutations of {1, 2,...,n}. It is important in many instances to generate
More informationGenerating Permutations and Combinations
Generating Permutations and Combinations March 0, 005 Generating Permutations We have learned that there are n! permutations of {,,, n} It is important in many instances to generate a list of such permutations
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 informationEQUIVALENCE RELATIONS (NOTES FOR STUDENTS) 1. RELATIONS
EQUIVALENCE RELATIONS (NOTES FOR STUDENTS) LIOR SILBERMAN Version 1.0 compiled September 9, 2015. 1.1. List of examples. 1. RELATIONS Equality of real numbers: for some x,y R we have x = y. For other pairs
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
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 informationRelations --- Binary Relations. Debdeep Mukhopadhyay IIT Madras
Relations --- Binary Relations Debdeep Mukhopadhyay IIT Madras What is a relation? The mathematical concept of relation is based on the common notion of relationships among objects: One box is heavier
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric
More informationNotes on Sets, Relations and Functions
PURE MTH 3002 Topology & Analysis III (3246) 2002 Notes on Sets, Relations and Functions These are some notes taken from Mathematical Applications (now Mathematics for Information Technology (MIT)). They
More information1. To be a grandfather. Objects of our consideration are people; a person a is associated with a person b if a is a grandfather of b.
20 [161016-1020 ] 3.3 Binary relations In mathematics, as in everyday situations, we often speak about a relationship between objects, which means an idea of two objects being related or associated one
More informationEquivalence relations
Equivalence relations R A A is an equivalence relation if R is 1. reflexive (a, a) R 2. symmetric, and (a, b) R (b, a) R 3. transitive. (a, b), (b, c) R (a, c) R Example: Let S be a relation on people
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 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 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 informationMATH 433 Applied Algebra Lecture 14: Functions. Relations.
MATH 433 Applied Algebra Lecture 14: Functions. Relations. Cartesian product Definition. The Cartesian product X Y of two sets X and Y is the set of all ordered pairs (x,y) such that x X and y Y. The Cartesian
More informationHarvard CS121 and CSCI E-121 Lecture 2: Mathematical Preliminaries
Harvard CS121 and CSCI E-121 Lecture 2: Mathematical Preliminaries Harry Lewis September 5, 2013 Reading: Sipser, Chapter 0 Sets Sets are defined by their members A = B means that for every x, x A iff
More informationChapter VI. Relations. Assumptions are the termites of relationships. Henry Winkler
Chapter VI Relations Assumptions are the termites of relationships. Henry Winkler Studying relationships between objects can yield important information about the objects themselves. In the real numbers,
More informationDeviations from the Mean
Deviations from the Mean The Markov inequality for non-negative RVs Variance Definition The Bienaymé Inequality For independent RVs The Chebyeshev Inequality Markov s Inequality For any non-negative random
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationLecture Notes: Selected Topics in Discrete Structures. Ulf Nilsson
Lecture Notes: Selected Topics in Discrete Structures Ulf Nilsson Dept of Computer and Information Science Linköping University 581 83 Linköping, Sweden ulfni@ida.liu.se 2004-03-09 Contents Chapter 1.
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 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 informationOrders and Equivalences
and Equivalences Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 9, 2012 Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) and Equivalences Gazihan Alankuş (Based
More informationDiscrete Structures (2IT50)
Discrete Structures (2IT50) Rob Hoogerwoord & Hans Zantema August, 2016 1 2 Contents 0.1 Introduction................................. 5 0.2 Basic set theory............................... 5 0.3 The principle
More informationSEVENTH EDITION and EXPANDED SEVENTH EDITION
SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 10-1 Chapter 10 Mathematical Systems 10.1 Groups Definitions A mathematical system consists of a set of elements and at least one binary operation. A
More informationREVIEW QUESTIONS. Chapter 1: Foundations: Sets, Logic, and Algorithms
REVIEW QUESTIONS Chapter 1: Foundations: Sets, Logic, and Algorithms 1. Why can t a Venn diagram be used to prove a statement about sets? 2. Suppose S is a set with n elements. Explain why the power set
More informationFALL 07 CSE 213: HW4
FALL 07 CSE 213: HW4 1) R 1 is not a partial ordered relation, since it is not antisymmetric. Having (1,3) and (3,1) in the relation; does not imply that 1=3 because 1 3. R 2 is a partial order because
More informationDefinition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.
4 Functions Before studying functions we will first quickly define a more general idea, namely the notion of a relation. A function turns out to be a special type of relation. Definition: Let S and T be
More informationDynamic Programming. Shuang Zhao. Microsoft Research Asia September 5, Dynamic Programming. Shuang Zhao. Outline. Introduction.
Microsoft Research Asia September 5, 2005 1 2 3 4 Section I What is? Definition is a technique for efficiently recurrence computing by storing partial results. In this slides, I will NOT use too many formal
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 informationSet Basics. P. Danziger
- 5 Set Basics P. Danziger 1 Set Basics Definition 1 (Cantor) A set is a collection into a whole of definite and separate objects of our intuition or thought. (Russell) Such that given an object x and
More informationToday s topics. Binary Relations. Inverse Relations. Complementary Relations. Let R:A,B be any binary relation.
Today s topics Binary Relations Relations Kinds of relations n-ary relations Representations of relations Reading: Sections 7.-7.3 Upcoming Upcoming Minesweeper Let A, B be any sets. A binary relation
More informationNotation Index. gcd(a, b) (greatest common divisor) NT-16
Notation Index (for all) B A (all functions) B A = B A (all functions) SF-18 (n) k (falling factorial) SF-9 a R b (binary relation) C(n,k) = n! k! (n k)! (binomial coefficient) SF-9 n! (n factorial) SF-9
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
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 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 informationMath 42, Discrete Mathematics
c Fall 2018 last updated 12/05/2018 at 15:47:21 For use by students in this class only; all rights reserved. Note: some prose & some tables are taken directly from Kenneth R. Rosen, and Its Applications,
More informationHerbrand Theorem, Equality, and Compactness
CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Herbrand Theorem, Equality, and Compactness The Herbrand Theorem We now consider a complete method for proving the unsatisfiability of sets of first-order
More informationSets are one of the basic building blocks for the types of objects considered in discrete mathematics.
Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
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 informationBOOLEAN ALGEBRA INTRODUCTION SUBSETS
BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations
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 information9 RELATIONS. 9.1 Reflexive, symmetric and transitive relations. MATH Foundations of Pure Mathematics
MATH10111 - Foundations of Pure Mathematics 9 RELATIONS 9.1 Reflexive, symmetric and transitive relations Let A be a set with A. A relation R on A is a subset of A A. For convenience, for x, y A, write
More information14 Equivalence Relations
14 Equivalence Relations Tom Lewis Fall Term 2010 Tom Lewis () 14 Equivalence Relations Fall Term 2010 1 / 10 Outline 1 The definition 2 Congruence modulo n 3 Has-the-same-size-as 4 Equivalence classes
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 informationChapter 2 - Relations
Chapter 2 - Relations Chapter 2: Relations We could use up two Eternities in learning all that is to be learned about our own world and the thousands of nations that have arisen and flourished and vanished
More informationCS Discrete Mathematics Dr. D. Manivannan (Mani)
CS 275 - Discrete Mathematics Dr. D. Manivannan (Mani) Department of Computer Science University of Kentucky Lexington, KY 40506 Course Website: www.cs.uky.edu/~manivann/cs275 Notes based on Discrete Mathematics
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 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 informationMathematical Foundations of Logic and Functional Programming
Mathematical Foundations of Logic and Functional Programming lecture notes The aim of the course is to grasp the mathematical definition of the meaning (or, as we say, the semantics) of programs in two
More informationPreliminaries to the Theory of Computation
Preliminaries to the Theory of Computation 2 In this chapter, we explain mathematical notions, terminologies, and certain methods used in convincing logical arguments that we shall have need of throughout
More informationMathematical Preliminaries. Sipser pages 1-28
Mathematical Preliminaries Sipser pages 1-28 Mathematical Preliminaries This course is about the fundamental capabilities and limitations of computers. It has 3 parts 1. Automata Models of computation
More informationOutline. We will now investigate the structure of this important set.
The Reals Outline As we have seen, the set of real numbers, R, has cardinality c. This doesn't tell us very much about the reals, since there are many sets with this cardinality and cardinality doesn't
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 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 informationSets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth
Sets We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth century. Most students have seen sets before. This is intended
More informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 1. Arithmetic, Zorn s Lemma.
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 1 Arithmetic, Zorn s Lemma. 1. (a) Using the Euclidean division, determine gcd(160, 399). (b) Find m 0, n 0 Z such that gcd(160, 399) = 160m 0 +
More informationExercises for Discrete Maths
Exercises for Discrete Maths Discrete Maths Rosella Gennari http://www.inf.unibz.it/~gennari gennari@inf.unibz.it Computer Science Free University of Bozen-Bolzano Disclaimer. The course exercises are
More informationRelations MATH Relations. Benjamin V.C. Collins, James A. Swenson MATH 2730
MATH 2730 Benjamin V.C. Collins James A. Swenson among integers equals a = b is true for some pairs (a, b) Z Z, but not for all pairs. is less than a < b is true for some pairs (a, b) Z Z, but not for
More informationMathematics for Cryptography
Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1
More informationHL Topic. Sets, relations and groups. (Further Mathematics SL Topic 3) Sets Ordered pairs Functions Binary operations Groups Further groups
HL Topic (Further Mathematics SL Topic 3) 9 This topic explores the fundamental nature of algebraic structures and the relationships between them. Included is an extension of the work covered in the Core
More informationCS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati
CS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati Important 1. No questions about the paper will be entertained during
More informationEconomics 204 Summer/Fall 2017 Lecture 1 Monday July 17, 2017
Economics 04 Summer/Fall 07 Lecture Monday July 7, 07 Section.. Methods of Proof We begin by looking at the notion of proof. What is a proof? Proof has a formal definition in mathematical logic, and a
More informationAutomata Theory for Presburger Arithmetic Logic
Automata Theory for Presburger Arithmetic Logic References from Introduction to Automata Theory, Languages & Computation and Constraints in Computational Logic Theory & Application Presented by Masood
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 informationFinite Automata and Regular Languages
Finite Automata and Regular Languages Topics to be covered in Chapters 1-4 include: deterministic vs. nondeterministic FA, regular expressions, one-way vs. two-way FA, minimization, pumping lemma for regular
More informationChapter 2 - Basics Structures MATH 213. Chapter 2: Basic Structures. Dr. Eric Bancroft. Fall Dr. Eric Bancroft MATH 213 Fall / 60
MATH 213 Chapter 2: Basic Structures Dr. Eric Bancroft Fall 2013 Dr. Eric Bancroft MATH 213 Fall 2013 1 / 60 Chapter 2 - Basics Structures 2.1 - Sets 2.2 - Set Operations 2.3 - Functions 2.4 - Sequences
More informationSection 0. Sets and Relations
0. Sets and Relations 1 Section 0. Sets and Relations NOTE. Mathematics is the study of ideas, not of numbers!!! The idea from modern algebra which is the focus of most of this class is that of a group
More informationDiscrete Structures May 13, (40 points) Define each of the following terms:
Discrete Structures May 13, 2014 Prof Feighn Final Exam 1. (40 points) Define each of the following terms: (a) (binary) relation: A binary relation from a set X to a set Y is a subset of X Y. (b) function:
More informationChapter 2 - Basics Structures
Chapter 2 - Basics Structures 2.1 - Sets Definitions and Notation Definition 1 (Set). A set is an of. These are called the or of the set. We ll typically use uppercase letters to denote sets: S, A, B,...
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
More informationAdvanced Automata Theory 9 Automatic Structures in General
Advanced Automata Theory 9 Automatic Structures in General Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Advanced Automata
More informationChapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.
Chapter 2 Chapter Summary Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.6) Section 2.1 Section Summary Definition of sets Describing
More information1.2 Posets and Zorn s Lemma
1.2 Posets and Zorn s Lemma A set Σ is called partially ordered or a poset with respect to a relation if (i) (reflexivity) ( σ Σ) σ σ ; (ii) (antisymmetry) ( σ,τ Σ) σ τ σ = σ = τ ; 66 (iii) (transitivity)
More information