Packet #5: Binary Relations. Applied Discrete Mathematics
|
|
- Sharleen Walsh
- 6 years ago
- Views:
Transcription
1 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 Page 6 Composites Page 8 Closures Pages Equivalence Relations Pages Posets & Hasse Diagrams Pages CSC224 Packet 5 Binary Relations
2 Binary Relations Summary I. Definition: A binary relation is a set of points, or ordered pairs. The ordered pairs are of the form (a,b) where a is a member of a set A (a A) and b is a member of a set B (b B). Any subset R A x B is a binary relation. (Remember that A x B is the set of ordered pairs {(a,b) a A b B}) II. Properties: Consider the binary relation R A x A. A. Reflexive:R is reflexive if a A, (a,a) R B. Irreflexive: R is irreflexive if a A, (a,a) R. Is (R is reflexive) (R is irreflexive)? C. Non-reflexive: (R is reflexive) D. Symmetric: R is symmetric if a, b A, [ ((a,b) R) ((b,a) R) ] E. Antisymmetric: R is antisymmetric if a, b A, [(a,b) R (b,a) R] (b = a) F. Asymmetric: R is asymmetric if a, b A, [(a,b) R] [(b,a) R] Asymmetric = irreflexive AND antisymmetric G. Transitive: R is transitive if a, b A, [(a,b) R (b,c) R] (a,c) R Also: R 2 R if and only if R is transitive. III. IV. Representations A. Matrix: Form a matrix with the rows labeled with elements of A and the columns labeled with elements of B. Then place a 1 in position (a,b) if (a,b) R and a 0 in position (a,b) if (a,b) R. B. Digraph: Make a column of dots, label one for each element of A. Make another column of dots for the elements of B. Now, for every element (a,b) in R, draw an arrow from point a to point b. Inverse Relation V. Composite Relations VI. VII. Closure Properties (Reflexive, Symmetric, & Transitive closures) Special Types A. Equivalence Relations are reflexive, symmetric and transitive (RST) B. Partially Ordered Sets are reflexive, antisymmetric and transitive (RAT) 1
3 Binary Relations Definition 1. A binary relation is a set of ordered pairs. 2. Each ordered pair consists of elements taken from two sets. 3. The relation xry is an ordered pair, <x,y> R, with x taken from the set S 1, and y taken from the set S S 1 and S 2 can be finite or infinite. They do not have to be equal. Examples of Binary Relations A binary relation R on the set SxT. Example: S = {a, b, c} T = {1, 2, 3} R = {(a, 1), (a, 3), (b, 2), (c, 3)} A special binary relation R is a subset of SxS. Example: S = {a,b,c,d} R = {<a,a>, <a,b>, <a,c>, <b,a>, <b,d>, <c,a>, <c,b>, <d,b>} R is a factor relation on Ρ, where for x,y Ρ, xry x is a factor of y True or False? 3R6, 5R6, 6R3, 8R24, 5R5, 12R16 Define R on Ζ by xry x < y True or False? 2R3, 2R2, 5R10, 3R2, -1R1, 0R-1 Let R be the "congruent mod 5" relation on Ζ x Ζ for x,y Ζ, xry (x-y) is divisible by 5 x y (mod 5) True or False? 2R7, -2R2, 2R2, 23R3, 3R23, -1R4, 0R10, -1R5 Let R be the subset relation, P({1,2,3}), where for A,B P({1,2,3}), ARB A B True or False? R{1,2}, {1}R{2}, {1}R{1,2,3}, {2,3}R{2,3}, {1,2}R CSC224 Packet 5 Binary Relations 2
4 Properties of Binary Relations Relation R on set S (Universe of Discourse = S) Reflexive: Example: if, for all x in S, xrx exists, then R is said to be reflexive. x[xrx] S = {1,2,3,4} if <1,1>;<2,2>;<3,3>;<4,4> R, then R is reflexive. if S =, then R is also empty. Is R reflexive? Irreflexive: Note: Symmetric: if, for all x in S, there is no xrx, then R is said to be irreflexive. x[ (xrx)] To be irreflexive is different from being non-reflexive. x[ (xrx)] irreflexive x(xrx) = x[ (xrx)] non-reflexive If x y[xry yrx] then R is said to be symmetric. Antisymmetric: Note: If x y[(xry yrx) (x = y)] then R is said to be antisymmetric. To be antisymmetric is different from being asymmetric. x y[xry (yrx)] asymmetric Transitive: If x y[(xry yrz) xrz] then R is said to be transitive. Also: R 2 R if and only if R is transitive. CSC224 Packet 5 Binary Relations 3
5 Examples of Binary Relations Example 1: The real plane (R x R) is a binary relation, where points are of the form (x,y) where x R is on the real x-axis and y R is on the real y-axis. Example 2: The set of points on the graph y = x 2 forms a subset of R x R, so it is a binary relation. It can be written as a set as well as by a graph. The set notation is: {(x,f(x)) x R and f(x) = x 2 }. Some points in this binary relation are: (0,0), (- 1,1), (1,1), (2,4), (3,9). What are some points that are not in this binary relation? Example 3: Define a relation R A x B where A is the set of all dogs on the planet, and B is the set of all humans, and (a,b) R if dog a belongs to person b. If Tony is a boy and Sparky is a dog, can (Tony, Sparky) be in R? Notice that not all dogs have owners and not all people have dogs, so R A x B. Example 4: Let A = {1,3,4,6,7}. Here are some binary relations on A x A. For each of them, determine which properties the relations have. R1 = {(1,3),(7,4)} is a binary relation. R2 is defined by: (a A) (b A) a b (a,b) R R2 = {(1,1),(1,3),(1,4),(1,6),(1,7), (3,3),(3,4),(3,6),(3,7),(4,4),(4,6),(4,7),(6,6),(6,7),(7,7)} R3 is defined by: (a A) (b A) a > b (a,b) R R3 =? R4 is defined by: (a A) (b A) a b (mod 3) (a,b) R (Remember that a b (mod 3) means that a and b have the same remainder if you divide both of them by 3.) R4 = { (1,1),(1,4),(1,7),(3,3),(3,6),(4,1),(4,4),(4,7),(6,3),(6,6), (7,1),(7,4),(7,7)} CSC224 Packet 5 Binary Relations 4
6 Examples (Illustrated Under Examples of Binary Relations) CSC224 Packet 5 Binary Relations 5
7 Representations of Binary Relations A matrix can be used to represent the binary relation by using a 1 to indicate the pairs in the relationship and 0 elsewhere. If S 1 = S 2, a digraph (also called a directed graph) can be also used to represent the relation, xry. A digraph consists of vertices (elements of the set S) and directional branches indicating the connection in the ordered pair. example: S 1 = S 2 = S = {1,2,3,4} xry = {<1,2>,<1,4>,<2,3>,<4,4>} Matrix Representation: Digraph Representation It is easy to see if a relation is reflexive from the matrix representing the relation. If the relation is reflexive, M will have all 1's in its major diagonal. If the relation is irreflexive, M will have all 0's in its major diagonal. If the relation is non-reflexive, M will have a mixture of 0's and 1's in its major diagonal This matrix is reflexive. CSC224 Packet 5 Binary Relations 6
8 If the relation is symmetric, M is symmetric about the major diagonal. If the relation is antisymmetric, M will not have any symmetry about the major diagonal. If the relation is non-symmetric, M will have at least one set of elements that are symmetric about the major diagonal. (The matrix given below is symmetric.) Transitivity is a little more difficult to check. One can check element by element xry, yrz, and xrz for all x, y, and z. You must check EVERY pair xry and yrz and make sure that xrz is in the relation. Alternatively, you can compute R 2 and check: if R 2 R then R is transitive. Definition of R -1 R -1 is obtained by interchanging the x,y pair for each element in R. So if R A x B, then R -1 B x A. Example 1: R = {<1,2>, <3,4>, <2,3>, <4,1>} R -1 = {<2,1>, <4,3>, <3,2>, <1,4>} Using the Matrix to check for properties: If M is the matrix for R, then R -1 is represented by the transpose of M, where we interchange the rows and columns of M to get M T. if R M then R -1 M T. If R is symmetric: M = M T. If R is antisymmetric: (M M T ) is a subset of the identity matrix: i.e. the only 1s are on the major diagonal. If R is transitive: then R 2 R. Compute this using M ο M, the matrix composition. CSC224 Packet 5 Binary Relations 7
9 Example 2: R for this case is antisymmetric since: x y[(xry yrx) (x = y)] (only elements along major diagonal) Composite Relations Two relations (R 1 and R 2 ) might be composed with each other. However, the inner set between R 1 and R 2 must be the same set. R 1 ο R 2 is read as R 1 composed with R 2. Order is important. One starts with R 2 and looks for the connection to R 1. If R 1 is a relation from S 1 S 2 then R 2 must be a relation from S a x S 1 where S a can be any set. The resulting relation comes from S a x S 2. Example 1: R 1 = {<1,a>, <3,b>, <3,c>, <4,c>} S 1 = {1,2,3,4} R 2 = {<a,1>, <a,2>, <b,3>, <c,2>} S 2 = {a,b,c} S 3 = {1,2,3} R 2 composed with R 1 : R 2 = {<1,1>, <1,2>, <3,3>, <3,2>, <4,2>} R 1 R 2 R 2 <1,a> <a,1>, <a,2> <1,1>, <1,2> <3,b> <b,3> <3,3> <3,c>, <4,c> <c,2> <3,2>, <4,2> CSC224 Packet 5 Binary Relations 8
10 This function R 2 can be obtained from the matrices of R 1 and R 2, i.e. M 1 and M 2. M of R 2 = M 1 M 2. M 1 and M 2 are matrices of 1's and 0's only. M 1 M 2 is simply to multiply M 1 M 2 except multiply is, and add is. NOTE: R 2 = M 1 M 2!!!! Example: (R 2 ) M 1 M 2 is the same as the matrix of R 2. Note that R 2 gives all of the linkages between S 1 and S 3 through S 2 of exactly length 2. If S 1 = S 2 = S 3 (special relations), then R ο R gives all the linkages of exactly length 2 in S. Notice the comparison of that to the statement xry yrz (link y of length 2 between x and z). Therefore, if R is transitive, x y[(xry yrz) xrz] then x (R ο R) x R. Therefore the matrix of R ο R must be a subset of R. If R is reflexive, symmetric, and transitive, then R is an equivalence relation. (Discussed later.) If R is reflexive, antisymmetric, and transitive, then R is a partially ordered set (or poset for short). (Discussed later.) (R 1 ο R 2 ) ο R 3 = R 1 ο (R 2 ο R 3 ) Associative Law holds (R 1 ο R 2 ) -1 = R Inverse CSC224 Packet 5 Binary Relations 9
11 Class Lemma: If R 1 and R 2 are relations in S T and R 3 and R 4 are relations in T V, the following holds: if R 1 R 2 and R 3 R 4 then R 3 R 4 ο R 2 Proof: U ( ) <x,y> in R 3 = x, j R 1 Λ j,y R 3 n j =1 U ( ) <x,y> in R 4 ο R 2 = x, j R 2 Λ j,y R 4 n j =1 Since R 1 R 2 and R 3 R 4 all <x,j> in R 1 <x,j> in R 2 and <j,y> in R 3 <j,y> in R 4 Therefore, <x,y> in R 3 <x,y> in R 4 ο R 2 Therefore, R 3 R 4 ο R 2 Closure Properties The closure of a binary relation, R, with respect to a property, is the minimal relation that contains the relation R and exhibits the given property. Reflexive closure: R f = R E where E = {<x,x> x S} Symmetric closure: Rs = R R -1 Transitive closure: R t = U R i i=1 Reflexive and symmetric closures are easy to see. We shall now prove the transitive closure. CSC224 Packet 5 Binary Relations 10
12 Transitive closure of R is R t = R i U. Proof: i=1 1. R t must contain R and be transitive. 2. R t must be the minimal relation of that type. Since R t is as follows: R t = R i U i=1 it contains R 1 = R. To see if R t is transitive: x y[(xry yrz) xrz] if there is an xr t y, then <x,y> is an element in some R k since R t is R t = U R i i=1 and if there is an yr t z, <y,z> is an element in some R j. R k ο R j = R k+ j will have the element <x,z> from the definition of the composite of two relations, but the elements of R k+ j are also elements of R t. Therefore, R t = U R i is transitive. i=1 To show that R t is the minimal relation containing R that is transitive, assume that there is another relation R 1 that is (1) transitive, and (2) contains R. We will show by induction that R t R 1. We will do this by showing that R i R 1 for all i, since R t = U R i i=1 For i = 1, R R 1, true since R 1 contains R. Assume true for R i, ie R i R 1 Prove true for R i+1, must show that R i+1 R 1. R i+1 = R i R R i R 1 by assumption and R R 1 by basis R i ο R R 1 by class lemma proven earlier but R i ο R R 1 since R 1 is transitive. Therefore, R i ο R R 1 R 1 Therefore, R i ο R R 1 is true for all i. CSC224 Packet 5 Binary Relations 11
13 Equivalence Relations A relation is an equivalence relation if it is (reflexive, symmetric, transitive) Examples: 1. Define R on N by xry x = y. 2. Let S be the set of all triangles. Define R on S by T 1 RT 2 triangles T 1 and T 2 are similar. 3. Let S be the set of all finite state machines with input alphabet {0,1}. Define R on S by M 1 RM 2 triangles M 1 and M 2 accept the same language. 4. Let f be a function f: S T. Define R on S by xry f(x) = f(y). Show R is an equivalence relation: 1. Reflexive: ( x[xrx]?) Since f(x) = f(x) for all x S, xrx for all x S. 2. Symmetric: ( x y[xry yrx]?) For any x,y in S, if xry then f(x) = f(y). Thus f(y) = f(x), so yrx. 3. Transitive: ( x y[(xry yrz) xrz]?) For any x,y,z S, if xry and yrz then f(x) = f(y) and f(y) = f(z). Thus f(x) = f(z), so xrz. 5. Let p Ρ. (Congruence mod p) Define R p on Z by x R p y (x-y) is divisible by p Can show R p is an equivalence relation. If R is an equivalence relation on a set S, then R partitions S into equivalence classes. For any s S, [s] denotes the equivalence class containing s. [s] = {x S xrs} Consider R 2 : [7] = {...-5,-3,-1,1,3,5,7,9,11,13,...} [5] = {...-5,-3,-1,1,3,5,7,9,11,13,...} [2] = {...-4,-2,0,2,4,6,8,...} How many equivalence classes? 2 (evens and odds) CSC224 Packet 5 Binary Relations 12
14 Consider R 3 : What are the equivalence classes? [0] = [3] = multiples of three [1] = [4] = {...-8,-5,-2,1,4,7,10...} [2] = [5] = {...-4,-1,2,5,8,11,...} What about R 1? [0] = [1] = [2] =... (one equivalence class) 6. Define R on R 2 by <x,y>r<u,v> x 2 + y 2 = u 2 + v 2 Show R is an equivalence relation: (S = R 2 ) 1. Reflexive: For any <x,y> S, <x,y>r<x,y> since x 2 + y 2 = x 2 + y Symmetric: For any <x,y>, <u,v> S, if <x,y>r<u,v>, then x 2 + y 2 = u 2 + v 2. So, u 2 + v 2 = x 2 + y 2. Thus, <u,v>r<x,y>. 3. Transitive: For any <x,y>, <u,v>, <w,z> S, if <x,y>r<u,v> and <u,v>r<w,z>, then x 2 + y 2 = u 2 + v 2 and u 2 + v 2 = w 2 + z 2. So, x 2 + y 2 = w 2 + z 2. Thus, <x,y>r<w,z>. Equivalence classes of R? [<0,0>] =? {<0,0>} [<0,1>] =? [<-2,3>] =? {<x,y> R 2 x 2 + y 2 = 13} How many equivalence classes? infinitely many CSC224 Packet 5 Binary Relations 13
15 Partially Ordered Sets (Usually called a Poset) A relation is called a poset if it is reflexive, antisymmetric, and transitive. A subset of a poset P is a poset called a subposet of P. Hasse Diagrams Suppose R is a partial order on S. For elements s,t S, say "t covers s" if srt and there is no u S satisfying: srurt but u s and u t. A Hasse Diagram follows the rules given below: 1. has a point for each element of S. 2. whenever t covers s, point t should be higher than point s, and t and s should be joined by a line segment. Note: Do not connect an element to itself and do not connect transitive elements. An element x is maximal if there is no y in the poset so that xry. An element x is maximum if yrx for all y in poset. Note that maximum elements are also maximal. (Think about this). Maximal elements and maximums are covered by nothing. There is at most one maximum element in a poset. There can be many maximal elements in a poset. An element x is minimal if there is no y in the poset so that yrx. An element x is minimum if xry for all y in poset. Note that minimum elements are also minimal. (Think about this). Minimal elements and minimums cover nothing. There is at most one minimum in a poset. There can be many minimal elements in a poset. Examples Example 1: Define R as "is a factor of" with S = {1,2,3,4,...,16}. What covers 1? 2,3,5,7,11,13 3? 6,9,15 9? Nothing What is covered by 12? 4,6 Hasse Diagram: (Minimal elements are boxed and maximal elements are circled.) CSC224 Packet 5 Binary Relations 14
16 Example 1: Hasse diagram for the relation R=({1,2,3,4,..., 16}, ) ( = divides, or "is a factor of") Example 2: Hasse Diagram for the relation " " on P({1,2,3}) CSC224 Packet 5 Binary Relations 15
17 Upper Bounds and Lower Bounds ub({a}) = {z arz }, the set of elements z so that a relates to z. ub({a,b,c}) = the intersection of ub({a}), ub({b}), and ub({c}). lb({a}) = {z zra}, the set of elements z so that z relates to a. lb({a,b,c}) = the intersection of lb({a}), lb({b}), lb({c}). lub(x,y) is the least upper bound = "lowest" element z with xrz and yrz. glb(x,y) is the greatest lower bound = "highest" element w with wrx and wry. Examples Example 1: Hasse Diagram: lub(e,d) = a lub(h,c) = a lub(i,h) = h lub(e,h,g) = a lub(a,b) = does not exist glb(f,g) = h glb(a,b,d) = d glb(e,d) = i glb(i,h) = i Example 2: If R is the "is a divisor of" relation on Ρ, then for x,y Ρ lub(x,y) = least common multiple of x and y glb(x,y) = greatest common divisor of x and y. Lattice: A poset is a lattice if for every pair of elements x,y in the poset, both lub(x,y) and glb(x,y) exist and are in the poset. CSC224 Packet 5 Binary Relations 16
MATH 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 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 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 informationMAD 3105 PRACTICE TEST 2 SOLUTIONS
MAD 3105 PRACTICE TEST 2 SOLUTIONS 1. Let R be the relation defined below. Determine which properties, reflexive, irreflexive, symmetric, antisymmetric, transitive, the relation satisfies. Prove each answer.
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 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 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 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 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 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, 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationReal Analysis. Joe Patten August 12, 2018
Real Analysis Joe Patten August 12, 2018 1 Relations and Functions 1.1 Relations A (binary) relation, R, from set A to set B is a subset of A B. Since R is a subset of A B, it is a set of ordered pairs.
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
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 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 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 information(vi) xry iff x y 2 (see the previous exercise); (iii) xry iff xy 0;
Final: Practice problems Relations Properties Exercise: For the following relations on Z, investigate the four basic properties. (i) arb iff a = b ; (v) arb iff a = b+; (ii) arb iff a b; (vi) arb iff a
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 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 informationIn mathematics there are endless ways that two entities can be related
CHAPTER 16 Relations In mathematics there are endless ways that two entities can be related to each other. Consider the following mathematical statements. 5 < 10 5 5 6 = 30 5 5 80 7 > 4 x y 8 3 a b ( mod
More informationRelations and Equivalence Relations
Relations and Equivalence Relations In this section, we shall introduce a formal definition for the notion of a relation on a set. This is something we often take for granted in elementary algebra courses,
More informationIs g one-to-one? Is g onto? Why? Solution: g is not one-to-one, since for c A, g(b) = g(c) = c. g is not onto, since a / g(a).
Discrete Structures: Exam 2 Solutions to Sample Questions, 1. Let A = B = {a, b, c}. Consider the relation g = {(a, b), (b, c), (c, c)}. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one,
More informationExam 2. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one, since for c A, g(b) = g(c) = c. g is not onto, since a / g(a).
Discrete Structures: Exam 2 Solutions to Sample Questions, 1. Let A = B = {a, b, c}. Consider the relation g = {(a, b), (b, c), (c, c)}. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one,
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 informationMore on Finite Automata and Regular Languages. (NTU EE) Regular Languages Fall / 41
More on Finite Automata and Regular Languages (NTU EE) Regular Languages Fall 2016 1 / 41 Pumping Lemma is not a Sufficient Condition Example 1 We know L = {b m c m m > 0} is not regular. Let us consider
More informationMATH 145 LECTURE NOTES. Zhongwei Zhao. My Lecture Notes for MATH Fall
MATH 145 LECTURE NOTES Zhongwei Zhao My Lecture Notes for MATH 145 2016 Fall December 2016 Lecture 1, Sept. 9 Course Orientation and Organization About the Professor Stephen New MC 5419 Ext 35554 Email:
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 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 informationXMA2C011, Annual Examination 2012: Worked Solutions
XMA2C011, Annual Examination 2012: Worked Solutions David R. Wilkins 1. (a) Let A, B and C be sets. Prove that A (B \ C) = (A B) \ (A C). We show that every element of A (B \ C) is an element of (A B)
More informationDiscrete Mathematics. Chapter 4. Relations and Digraphs Sanguk Noh
Discrete Mathematics Chapter 4. Relations and Digraphs Sanguk Noh Table Product sets and partitions Relations and digraphs Paths in relations and digraphs Properties of relations Equivalence relations
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 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 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 informationReference Material /Formulas for Pre-Calculus CP/ H Summer Packet
Reference Material /Formulas for Pre-Calculus CP/ H Summer Packet Week # 1 Order of Operations Step 1 Evaluate expressions inside grouping symbols. Order of Step 2 Evaluate all powers. Operations Step
More informationModule 2: Language of Mathematics
Module 2: Language of Mathematics Theme 1: Sets A set is a collection of objects. We describe a set by listing all of its elements (if this set is finite and not too big) or by specifying a property that
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 informationRED. Fall 2016 Student Submitted Sample Questions
RED Fall 2016 Student Submitted Sample Questions Name: Last Update: November 22, 2016 The questions are divided into three sections: True-false, Multiple Choice, and Written Answer. I will add questions
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 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 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 informationRelations (3A) Young Won Lim 3/27/18
Relations (3A) Copyright (c) 2015 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More informationSets. A set is a collection of objects without repeats. The size or cardinality of a set S is denoted S and is the number of elements in the set.
Sets A set is a collection of objects without repeats. The size or cardinality of a set S is denoted S and is the number of elements in the set. If A and B are sets, then the set of ordered pairs each
More informationCCSU Regional Math Competition, 2012 Part I
CCSU Regional Math Competition, Part I Each problem is worth ten points. Please be sure to use separate pages to write your solution for every problem.. Find all real numbers r, with r, such that a -by-r
More informationDiscrete Structures: Sample Questions, Exam 2, SOLUTIONS
Discrete Structures: Sample Questions, Exam 2, SOLUTIONS (This is longer than the actual test.) 1. Show that any postage of 8 cents or more can be achieved by using only -cent and 5-cent stamps. We proceed
More informationMathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations
Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...
More informationCourse 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography
Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups
More informationDivisor Problems HAROLD B. REITER.
Divisor Problems HAROLD B REITER UNIVERSITY OF NORTH CAROLINA CHARLOTTE http://wwwmathunccedu/~hbreiter The purpose of this note is to find and study a method for determining and counting all the positive
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 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 informationSchool of Mathematics and Statistics. MT1003 Pure Mathematics. Handout 0: Course Information
MRQ 2006 School of Mathematics and Statistics MT1003 Pure Mathematics Handout 0: Course Information Lecturer: Martyn Quick, Mathematical Institute, Room 210. Recommended Texts: D. M. Burton, Elementary
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 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 information(4.2) Equivalence Relations. 151 Math Exercises. Malek Zein AL-Abidin. King Saud University College of Science Department of Mathematics
King Saud University College of Science Department of Mathematics 151 Math Exercises (4.2) Equivalence Relations Malek Zein AL-Abidin 1440 ه 2018 Equivalence Relations DEFINITION 1 A relation on a set
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 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 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 informationGROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION
Chapter-1 GROUPS 1.1. INTRODUCTION The theory of groups arose from the theory of equations, during the nineteenth century. Originally, groups consisted only of transformations. The group of transformations
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 information8. Find r a! r b. a) r a = [3, 2, 7], r b = [ 1, 4, 5] b) r a = [ 5, 6, 7], r b = [2, 7, 4]
Chapter 8 Prerequisite Skills BLM 8-1.. Linear Relations 1. Make a table of values and graph each linear function a) y = 2x b) y = x + 5 c) 2x + 6y = 12 d) x + 7y = 21 2. Find the x- and y-intercepts of
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 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 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 informationBoolean Algebra. Sungho Kang. Yonsei University
Boolean Algebra Sungho Kang Yonsei University Outline Set, Relations, and Functions Partial Orders Boolean Functions Don t Care Conditions Incomplete Specifications 2 Set Notation $09,3/#0,9 438 v V Element
More informationJust the Factors, Ma am HAROLD B. REITER.
Just the Factors, Ma am HAROLD B REITER UNIVERSITY OF NORTH CAROLINA CHARLOTTE http://wwwmathunccedu/~hbreiter The purpose of this note is to find and study a method for determining and counting all the
More informationBASIC MATHEMATICAL TECHNIQUES
CHAPTER 1 ASIC MATHEMATICAL TECHNIQUES 1.1 Introduction To understand automata theory, one must have a strong foundation about discrete mathematics. Discrete mathematics is a branch of mathematics dealing
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 informationSelected Solutions to Even Problems, Part 3
Selected Solutions to Even Problems, Part 3 March 14, 005 Page 77 6. If one selects 101 integers from among {1,,..., 00}, then at least two of these numbers must be consecutive, and therefore coprime (which
More informationSTRAND J: TRANSFORMATIONS, VECTORS and MATRICES
Mathematics SKE, Strand J STRAND J: TRANSFORMATIONS, VECTORS and MATRICES J4 Matrices Text Contents * * * * Section J4. Matrices: Addition and Subtraction J4.2 Matrices: Multiplication J4.3 Inverse Matrices:
More informationFoundations of algebra
Foundations of algebra Equivalence relations - suggested problems - solutions P1: There are several relations that you are familiar with: Relations on R (or any of its subsets): Equality. Symbol: x = y.
More information41st International Mathematical Olympiad
41st International Mathematical Olympiad Taejon, Korea, July 2000 1 Two circles Γ 1 and Γ 2 intersect at M and N Let l be the common tangent to Γ 1 and Γ 2 so that M is closer to l than N is Let l touch
More informationSystem of Linear Equations
CHAPTER 2 System of Linear Equations. Introduction Study of a linear system of equations is classical. First let s consider a system having only one equation: 2x+3y +4z = 5 (2.) Indeterminates x,y,z are
More informationChapter12. Relations, Functions, and Induction
. Relations. Functions. Seuences.4 Mathematical Induction.5 Recurrence Relations Chapter Review Chapter Relations, Functions, and Induction In this chapter we introduce the concepts of a relation and a
More informationLecture 3: Matrix and Matrix Operations
Lecture 3: Matrix and Matrix Operations Representation, row vector, column vector, element of a matrix. Examples of matrix representations Tables and spreadsheets Scalar-Matrix operation: Scaling a matrix
More informationCourse MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography
Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2000 2013 Contents 9 Introduction to Number Theory 63 9.1 Subgroups
More informationWorksheet on Relations
Worksheet on Relations Recall the properties that relations can have: Definition. Let R be a relation on the set A. R is reflexive if for all a A we have ara. R is irreflexive or antireflexive if for all
More informationCopyright c 2007 Jason Underdown Some rights reserved. statement. sentential connectives. negation. conjunction. disjunction
Copyright & License Copyright c 2007 Jason Underdown Some rights reserved. statement sentential connectives negation conjunction disjunction implication or conditional antecedant & consequent hypothesis
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 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 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 informationInternational Mathematics TOURNAMENT OF THE TOWNS
International Mathematics TOURNAMENT OF THE TOWNS Senior A-Level Paper Fall 2008. 1. A standard 8 8 chessboard is modified by varying the distances between parallel grid lines, so that the cells are rectangles
More informationTOPOLOGICAL ASPECTS OF YAO S ROUGH SET
Chapter 5 TOPOLOGICAL ASPECTS OF YAO S ROUGH SET In this chapter, we introduce the concept of transmissing right neighborhood via transmissing expression of a relation R on domain U, and then we study
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 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 informationDiscrete Structures: Solutions to Sample Questions, Exam 2
Discrete Structures: Solutions to Sample Questions, Exam 2 1. Let A = B = {a, b, c}. Consider the relation g = {(a, b), (b, c), (c, c)}. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one,
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 information2007 Shortlist JBMO - Problems
Chapter 1 007 Shortlist JBMO - Problems 1.1 Algebra A1 Let a be a real positive number such that a 3 = 6(a + 1). Prove that the equation x + ax + a 6 = 0 has no solution in the set of the real number.
More information