‘Wunacademy Complete Course on Discrete Mathematics Fundamentals and Types of Relation - Part | Lesson § + July 26,2020 + Sanchit JoinDiscrete mathematics is a core subject of theoretical computer science. It is not a directly application-oriented subject, but it provides tolls and mathematical models, which are applied to different areas in computer science. GATE (10-12 MARKS) Has a good weightage in general all objective and subjective examination. Will be asked in Interview for M.Tech, PhD or other government jobs. Not that important in software industry.+ RELATIONS (2-3) + FUNCTIONS (1-2) * GROUP THEORY (1-2) PROPOSITIONS & FIRST ORDER * GRAPH THEORY (2-3)DISCRETE MATHEMATICS Bly ITs Luda heh Pay Books to be referred GRAPH ORY NARSINGH DEOWhat you can expect from me Will take care of theory and numerical both Will give more weightage to the topics that are asked more frequently in GATE Will not emphasize more than required, on a topic Will provide PDF of related books and my personal notesWhat i expect from you There is no hurry, feel free to ask questions any time through out the class, but first listen Please revise the entire lecture before and after the class Be regular, Consistency is most important More you practice, more clarity you will get If we follow all the above specified points Success in guaranteedWhat is a SET Set are the fundamental discrete structures on which all the discrete structures are built. Sets are used to group objects together, formally speaking “An unordered well-defined, collection of distinct objects (Called elements or members of a set) of same type”. Here the type is defined by the one who is defining the set. For e.g. A={0,2,4,6, -} B= {1,3,5, —} C= {x| x € Natural number}A Set is generally denoted usually by capital letter. The objects of a set called the elements, or members of the set. A set is said to contain its elements. Lower case letters are generally used to denote the elements of the set. x € A, means element x is a member of A x € A means x is not a member of A* Cardinality of a set— It is the number of elements present in a Set, denoted like |A]. * For e.g. A= {0,2,4,6}, |A] =4BreakRepresentation of set Tabular/Roster representation of set- here a set is defined by actually listing its members. E.g. A= {a, e, i, 0, u} B={1, 2, 3,4} C= {----4,-2, 0, 2,4, ——-}.Set Builder representations of set- here we specify the property which the elements of the set must satisfy. E.g. A= {x| xis an odd positive number less than 10}, A={x | xe English alphabet && x is vowel} B= {x | xe N && x <5} Set Builder Form C= {xk | xe€Z&&x%2 =0} ha { S = {x|criteria} \ element criteria for ins xto beinS name of the setBreak* Set of all Complex number(C) - A complex number is a number that can be expressed in the form ‘a + bi’, where ‘a’ and ‘b’ are real numbers and ‘i’ is the imaginary unit, that satisfies the equation i? = -1. In this expression, ‘a’ is the real part and ‘b’ is the imaginary part of the complex number. a+ bi q Real part Imaginary part* Set of all Real number(R) - A real number is a value that represents a quantity along a continuous line, containing all of the rational numbers and all of the irrational numbers.* Set of all Rational number (Q) - A rational number is any number that can be expressed as a fraction P/Q of two integers, a numerator P and a non-zero denominator Q.* Set of all Irrational number (R-Q or R/Q or P) - An irrational number is a real number that cannot be expressed as a fraction i.e. as a ratio of integers. Therefore, irrational numbers, when written as decimal numbers, do not terminate, nor do they repeat. E.g. root2.* Set of all Integer(Z) - An integer is a number that can be written without a fractional component. * Set of all Whole number(W) - A whole number is a science expanded natural number. Set of natural number and zero PFtitir tit ioe 78910 L_—- natural Numbers ———_——_> Whole Numbers ——————>* Set of all-Natural number(N) - A natural number is a number that occurs commonly and obviously in nature. The set of natural numbers, can be defined as N = {1,2,3, 4.... co} 0123456 78910 UL Natural Numbers —————_> Whole Numbers ——————_>Break* Finite set - If there are exactly ‘n’ elements in S where ‘n’ is a nonnegative integer, we say that S is a finite set. * i.e. ifa set contain specific or finite number of elements is called is called finite set. For e.g. A = {1,2,3,4}* Infinite set — A set contain infinite number of elements is called infinite set, if the counting of different elements of the set does not come to an end. For e.g. a set of natural numbers.Set L =) Empty Finite Countable qa Non-Empty qT Countable Countable Uncountable* Countable set — A set is said to be countable if there can be a one to one mapping between the elements of the set and natural numbers. E.g. Set of stars.* Uncountable set — A set is said to be uncountable if there cannot be a one to one mapping between the elements of the set and natural numbers. E.g. Set of real numbers.Q Which of the following is/are not true? (NET-Dec-2015) (a)The set of negative integers is countable. (b)The set of integers that are multiples of 7 is countable. (c)The set of even integers is countable. (d)The set of real numbers between 0 and % is countable. (A) (a) and (c) (B) (b) and (d) (C) (b) only (D) (d) onlyQLet N be the set of natural numbers. Consider the following sets, P: Set of Rational numbers (positive and negative) Q: Set of functions from {0, 1} to N R: Set of functions from N to {0, 1} S: Set of finite subsets of N Which of the above sets are countable? (GATE-2018) (2 Marks) (A) Qand S only (8) PandS only (C) Pand R only (D) P, Qand S onlyBreak* Null set / empty set - Is the unique set having no elements. its size or cardinality is zero i.e. || = 0. It is denoted by a symbol ¢ or {}. A set with one element is called singleton set.* Universal set — if all the sets under investigation are subsets of a fixed set, i.e. the set containing all objects under investigation, in Venn diagram it is represented by a rectangle, and it is denoted by U.BreakSubset of a set — If every element of set A is also an element of set B i.e. Vx(x € A~ x € B), then A is called subset of B and is written as A & B. Bis called the superset of A. E.g. A= {1,2,3} B = {1,2,3,4,5} Note that to show that A is not a subset of B we need only find one element x € Awith x € B. To show that A & B, show that if x €A, then x € B. Subset Set* A, Empty Set @ is a subset for every set * ACU, Every Set is a subset of Universal set U * ACA, Every Set is a subset of itself.* Proper subset — if A is a subset of B and A # B, then A is said to be a proper subset of B, i.e. there is at least one element in B which is not in A. denoted as A CB. Subset SetEquality of sets — If two sets A and B have the same element and therefore every element of A also belong to B and every element of B also belong to A, then the set A and B are said to be equal and written as A=B. if A & Band BEA, then A=B Vx(x EA <> x € B)Power set — let A be any set, then the set of all subsets of A is called power set of A and it is denoted by P(A) or 2°. If A= {1,2,3}, then P(A) = {6, {1}, {2}, {3}, {1,2}, {2,3}, {1,3}, (1,2,3} Cardinality of the power set of Ais n, |P(A)|=2"Venn Diagram * Sets can be represented graphically using Venn diagrams, named after the English mathematician John Venn, who introduced their use in 1881. In Venn diagrams the universal set U, Contains all the objects under consideration, is represented by a rectangle. + (Note that the universal set varies depending on which objects are of interest.) Inside this rectangle, circles or other geometrical figures are used to represent sets. Sometimes points are used to represent the particular elements of the set. Venn diagrams are often used to indicate the : relationships between sets. Trt... VikeBreakQ For any Set A, which of the following are true? Idea 2oEA 3) be 24 4) >= 24 5) Ae 2A 6)AC24QIf > is an empty set. Then | P(P(P(o))) | =___? a)1 b)2 c)4 d) none of aboveQThe ‘cardinality of the power set of ) (1 Marks) Che (a) 1024 (B) 1023 (c) 2048 + 10} is.QFor a set A, the power set of A is denoted by 24. If A = {5, {6}, {7}, which of the following options are True. (GATE-2015) (1 Marks) per I) po2 Mm) {5, {6)} € 24 IW){5, {6}} 5 2% (A) land tllonly (B)Ilandilionly (C)1, land Ill only (D) |, land IV onlyBreakQThe power set of the set {0} is: (NET-Dec-2012) a) {>} b) {0, {>} c) {0} d) {0, &, {}}Qlet A be a set with n elements. Let C be a collection of distinct subsets of A such that for any two subsets S, and S, in C, either S, is subset of S, or S, is subset of S, What is the maximum cardinality of C? (GATE-2005) (2 Marks) a)n b) n+1 2"4+1 d)n!Q Let P(S) denotes the power set of set S. Which of the following — (b) P(S) AP (PIS) = {4} (c) P(S) NS = P(S) (d) Ss €P(s)QThe number of elements in the power set P(S) of the set S= {{0},1, {2,3} is: (GATE-1995) (1 Mark) a)2 b)4 8 d) None of the aboveBreakOperation on sets * Complement of set — Set of all x such that x ¢ A, but x € U. © AS={x|xFA&xEU} U={1, 2, 3, 4, 5, 6} A= {2, 3, 6} Av={ }* Union of sets — Union of two sets A and B is a set of all those elements which either belong to A or B or both, it is denoted by AU B. * AUB={x| xeAorxe B} A={1, 2, 3, 4} B= {3, 4, 5, 6} AUB={ } JA|+|B|=| AUB | ?* Intersection of sets - Intersection of two sets A and B is a set of all those elements which belong to both A and B, and is denoted by ANB. * ANB={x| xeAand xe B} A={1, 2, 3, 4} B= {3, 4, 5, 6} ANB={ }* Disjoint sets -- Two sets are said to be disjoint if they do not have a common element, i.e. no element in A is in B and no element in B is in A. * ANB=o* Set difference — the set difference of two sets A and B, is the set of all the elements which belongs to A but do not belong to B. * A-B={x| xeAand x ¢ B} A={1,2, 3,4} “ B= {3, 4, 5, 6} A-B={ }Symmetric difference — the symmetric difference of two sets A and B is the set of all the elements that are in A or in B but not in both, denoted as. A® B= (AU B)-—(ANB) 5 A@® B= {x| (xe A and x ¢ B) or (x eB and x ¢ A)} GD A@®B=(A-B) U(B-A) A={1, 2, 3, 4} B = {3, 4, 5, 6} A@B={ }Q The power set of A U B, where A = {2, 3, 5, 7} and B = {2, 5, 8, 9} is (NET-Dec-2012) a) 256 b) 64 c) 16 d)4QifA,= (i, .... -2, -1, 0, 1, 2, ..... i} (NET-July-2018) then Uf2, Ai is a)Z b)Q c)R d)cBreakQ Consider the following statements? a) Finite union of finite sets is (finite/infinite) b) Finite union of Infinite sets is (finite/infinite) c) Infinite union of finite sets is (finite/infinite) ‘d) if after finite number of union result is infinite set, then at least of the input set is infinite (T / F) e) if after finite number of union result is infinite set, then all of the input set is infinite (T / F)f) Finite intersection of finite sets is (finite/infinite) g) Finite intersection of Infinite sets is (finite/infinite) h) Finite union of Infinite sets is (finite/infinite) i) If after finite number of intersection result is infinite set, then at least of the input set is infinite (T / F) j) If after finite number of intersection result is infinite set, then all of the ‘input set is infinite (T / F)QLet S be an infinite set $1, S,....1..0, S, be Sets such that (GATE-1993) (1 Marks) (a) At least one of the set S, is a finite set (b) Not more than one of the set S, can be finite (c) At least one of the sets S, is an infinite set (d) Not more than one of the sets S; can be infiniteBreakQwhich of the following is not true? a)A-B=AN Be b) A-(A-B)=ANB c)A-(ANB)=A-B d)A-(A-B)=BQIf ACB, then which of the following is not true? (a)AUB=B (b)ANB=A (c) BoC AC (d)B-A=oQ Which the following in not true? a) IfAS >, thenA=o b) (AN BS) U(AN B)=A c) BU(AN B)=B d) (AM BS) U (ANB) U (ASN B) U (ASN BY =ANBQWhich of the following is true? (i) (A-B)-C=A-(C-B) (ii) (A-B)-C=(A-C)-B (ili) (A-8)-C=A-(BNC) (iv) (AN B)-(B NC) = {A-(ANC)}-(A-B) a) i &iii b) ii &iv ¢)i, ii, iv d) ii & iiiBreakQIna college, there are three student clubs, Sixty students are only in the Drama club, 80 students are only in the Dance club, 30 students are only in Maths club, 40 students are in both Drama and Dance clubs, 12 students are in both Dance and Maths clubs, 7 students are in both Drama and Maths clubs, and 2 students are in all clubs. If 75% of the students in the college are not in any of these clubs, then the total number of students in the college is . (GATE-2019) (2 Mark)aq The number of integers between 1 and 500 (both inclusive) that are divisible by 3 or 5 or 7is___. (GATE-2017) (1 Marks)Q How many multiples of 6 are there between the following pairs of numbers? (NET-Jan-2017) 0 and 100 and -6 and 34 a) 16 and6 b) 17 and6 c)17 and7 d) 16 and7Q Let A and B be sets in a finite universal set U. Given the following: |A—B|, |A® BI, |A| + |B| and |A U B| Which of the following is in order of increasing size? (NET-Dec-2016) a) |A-—B| < |A@®B < |A| + |B] < |AUB| g b) |A@ BI < |A-B] < |AUBI [aUb| else what Is the elation ba them ete) jajsta = level ee ~ lel +) Alst~ = lav)Q Let E, F and G be finite sets. Let X = (ECF) — (F’0r6) and Y = (E- {E-(06)) —(E=F). ae ae ts Aste a yet#* Which one of the following is true? (GATE-2006) (2 Mark) (A)XcY (B)X>Y___MeyK=¥_(D)X-Y#pandY-x# vo PR ™Qwhat is the cardinality of the set of integers X defined below _ (GATE-2006) (2 Mark) X ={n| 1<=n<=123, nis not divisible by 2,3 or 5}? £22 8Q Let A, B and C be non-empty sets and let X=(A 2 peeQ The number of binary relations on a set with n elements is: (GATE-1999) (1 Marks) (A) n? ‘(B)2" (C) 24n? (D) None of the aboveRelation Relation: - Let A and B are sets then every possible subset of ‘AxB’ is called a relation from. A to B._ If |A] =m and |B] =n then total no of element(pair) will be m*n, every element will have two choice weather to present or not present in the subset(relation), therefore the total number of relation posse isi2m™ 6 1 2 3B x\/(%1) | (2) 3) xB y) WY 2) 3) 4 <= 9% Zz/\@1) | (2) | (3) Le* Largest relation possible will be * Smallest possible relation will be* Complement of a relation: - Let R be a relation from A to B, then the complement of relation will be denoted by R’, R°or R: R = {(a, b) (a, b) € AxB, (a, b) €! R} R’ = (AxB)-R RUR’=AxB RNR =o * For E.g. if AxB = {(a, 1), (a, 2), (a, 3), (b, 1), (b, 2), (b, 3)} R= {(a, 1), (a, 3), (b, 2)} R’ = {(a, 2), (b, 1), (b, 3)}Inverse of a relation: - Let R be a relation from A to B, then the inverse of relation will be a relation from B to A, denoted by R™. R* = {(b, a) | (a, b) € R} AxB = {(a, 1), (a, 2), (a, 3), (b, 1), (b, 2), (b, 3)} R = {(a, 1), (a, 3), (b, 2)} R*= {(1, a), (3, a), (2, b)} IR|=| R*|Diagonal relation: - A relation R on a set A is said to be diagonal relation if, Ris a set of all ordered pair (x, x), for every Vx € A, sometimes it is also denoted by a . R= {(x)x) | VxE A}Types of a Relation * To further study types of relations, we consider a set A with n elements, then a cartesian product AxA will have n? elements(pairs). Therefore, total number of relation possible is 2"""* Reflexive relation: - A relation R ona set A is said to be reflexive, + If VXEA * (x xXERQconsider a set A = {1,2,3}, find which of the following relations are reflexive and Irreflexive? Relation BS si AxA > {(1,1), (2,2), (3,3)} {(1,2), (2,3), (1,3)} {(1,1), (1,2), (2,1), (2,2)} {(2,4), (2,2), (3,3), (1,3), (2,1)} {(1,3), (2,1), (2,3), (3,2) So1. Smallest reflexive relation is 2. Largest reflexive relation is 3. Total number of reflexive relations will bePener Smallest reflexive relation is A , Largest reflexive relation is AxA Total number of reflexive relations will be 2") If two relations R1 and R2 are reflexive then their union and intersection will also be reflexive.possible number of reflexive relations on a set of 5 elements? (GATE- (B) 25 (c) 27 (D) 275* Irreflexive relation: - A relation R ona set A is said to be Irreflexive, 1. If VXxEA 2. (x, x) €RQconsider a set A = {1,2,3}, find which of the following relations are reflexive and Irreflexive? Relation BS sion AxA ¥ > {(1,1), (2,2), (3,3)} {(1,2), (2,3), (1,3)} {(1,1), (1,2), (2,1), (2,2)} {(2,1), (2,2), (3,3), (1,3), (2,1)} {(1,3), (2,1), (2,3), (3,2) Se z\<|z)2\<|2* Smallest irreflexive relation is + Largest irreflexive relation is * Total number of irreflexive relation will be * If two relations R1 and R2 are Irreflexive then their union and intersection will also be * Ifa relation R on aset A is reflexive, then R°is* Smallest irreflexive relation is b + Largest irreflexive relation is (AxA) - Ay * Total number of irreflexive relation will be 2-1) * If two relations R1 and R2 are Irreflexive then their union and intersection will also be Irreflexive. * If arelation R on aset A is reflexive, then RCis IrreflexiveQ Suppose that R1 and R2 are reflexive relations on a set A. Which of the following statements is correct? (NET-July-2016) a) R19 R2 is reflexive and R1 U R2 is irreflexive. b) R12 R2 is irreflexive and R1 U R2 is reflexive. c) Both R1n R2 and R1 U R2 are reflexive. d) Both R1 n R2 and R1 U R2 are irreflexive* Symmetric relation: - A relation R on a set A is said to be Symmetric, If Va,beEA (a,b) ER then (b, a) ERQconsider a set A = {1,2,3}, find which of the following relations are Symmetric, Anti-Symmetric and Asymmetric? Relation Symmetric Anti-Symmetric Asymmetric AxA > {(1,1), (2,2), (3,3)} {(1,2), (2,3), (1,3)} {(2,1), (1,2), (2,1), (2,2)} {(2,1), (2,2), (3,3), (1,3), (2,1)} {(2,3), (2,1), (2,3), (3,2)} SePenne Smallest symmetric relation is Largest symmetric relation is. Total number of symmetric relation will be If a relation on a set A is symmetric then R__ R™ If two relations R1 and R2 are symmetric then their and will also be symmetric.Penne Smallest symmetric relation is @ Largest symmetric relation is AxA Total number of symmetric relation will be 2[n(9+1))/2 If a relation on a set A is symmetric then R = R* If two relations R1 and R2 are symmetric then their union and intersection will also be symmetric.QLet R be a relation on the set of ordered pairs of positive integers such that ((p, q), (t, s)) and | only if p-s = q-r. Which one of the following is true about R? (GATE-2015) (2 Marks) (A) Both reflexive and symmetric (8) Reflexive but not symmetric t symmetric (0) Helier guffendce:narcpmmetiteQHow many relations are there on a set with n elements that are symmetric and a set with n elements that are reflexive and symmetric? (NET-Dec-2012) A) 2%°#21/2 and 2,30-1072 B) 3-12 and 200-1) €) 20(7+2)/2 and 3tr-a/2 D) 2000212 and 2aln-aV/2* Anti-Symmetric relation: - A relation R on a set A with cartesian product AxA is said to be Anti-Symmetric, If Va,beEA (a,b) ER (b,a)ER Conclusion: Symmetry is not allowed but diagonal pairs are allowedEel) Symmetric Anti-Symmetric Asymmetric AxA Ve C {(1,1), (2,2), (3,3)} {(1,2), (2,3), (1,3)} {(1,4), (1,2), (2,1), (2,2)} {(1,4), (2,2), (3,3), (1,3), (2,1)} {(1,3), (2,1), (2,3), (3,2)} Se z\z|<|z\|<|<QyuPwnr Smallest Anti-symmetric relation is Largest Anti-symmetric relation will contain elements Total number of Anti-symmetric relation will be Arelation R ona set A is Anti-Symmetric if (R MR) & Sub set of a Anti-Symmetric will also be If two relations R1 and R2 are Anti - symmetric then their need not to be Anti- symmetric but will also be Anti-symmetric.AuPpynr Smallest Anti-symmetric relation is @ Largest Anti-symmetric relation will contain n(n+1)/2 elements Total number of Anti-symmetric relation will be 2" *3ln(-11//2 Arelation R ona set A is Anti-Symmetric if (RM R7)& Ay Sub set of a Anti-Symmetric will also be Anti-Symmetric If two relations R1 and R2 are Anti - symmetric then their union need not to be Anti- symmetric but intersection will also be Anti-symmetric.Q Consider the binary relation R = {(x, y), (x, 2), (2, *), (z, y)} on the set {x, y, 2}. Which one of the following is TRUE? (GATE-2009) (1 Marks) (A) Ris symmetric but NOT antisymmetric (B) NOT symmetric but antisymmetric (C) Ris both symmetric and antisymmetric (D) Ris neither symmetric nor antisymmetric* Asymmetric relation: - A relation R ona set A is said to be Asymmetric, If Va,beA (a,b) ER (b, a) €R Conclusion: Symmetry is not allowed; even diagonal pairs are not allowedRelation Symmetric Anti-Symmetric Asymmetric AxA Y 2 Fy $ E (1), 2.2), 3,3) 4 (2.2), (2,3), (1,3) Ly i A {(1,1), (1,2), (2,1), (2,2)} {(1,1), (2,2), (3,3), (1,3), (2,4)} {(21,3), (2,1), (2,3), (3,2)} 2\<|2|<|<|<|z z\z\<|z|<|<PwWwNP . Every asymmetric relation is also . Smallest Asymmetric relation is . Largest Asymmetric relation will contain . Total number of Asymmetric relation will be elementsPwWNP . Every asymmetric relation is also anti-symmetric . Smallest Asymmetric relation is b . Largest Asymmetric relation will contain n(n-1)/2 elements . Total number of Asymmetric relation will be 3!"(n-1)1/2Q Consider a set A = {a, b, c} and R,, R,, R; and R, are relations on A which of the following is not true? A iat Anti-Symmetric R1 = {(a, a), (c, c)} R2 = {(a, b), (b, a), (a, ¢)} R2 = {(a, b), (b, c), (a, c)} R2 = {(a, b), (b, a), (c, c)} 212* Transitive relation: - A relation R on a set A is said to be Transitive, If Va,beA (a b)ER (b,c)ER (a JERRelation Bic vay o {(1,1), (2,2), (3,3)} (CeCe) CREE ae EY) {(1,1), (2,2), (3,3), (1,3), (2,1)} {(1,3), (2,4), (2,3), (3,2)} pee) eC) ert) {(2,3), (1,2)}1. Smallest Asymmetric relation is 2. Largest Asymmetric relation will contain elements 3. If two relations R1 and R2 are Transitive then their need not to be transitive but will also be transitive.1. Smallest Asymmetric relation is 2. Largest Asymmetric relation will contain AxA elements. 3. If two relations R1 and R2 are Transitive then their union need not to be transitive but intersection will also be transitive.No of transitive relationWarshall’s Algorithm: - QConsider a set A = {1,2,3} and a relation R = {(1,1), (1,3), (2,2), (3,4), (3,2)}?QConsider a set A = {1,2,3,4} and a relation R= {(1, 1), (2, 1), (2, 2), (2, 3), (2, 4), (3, 1), (3, 2), (3, 3), (3, 4)}?Warshall’s Algorithm: - QConsider a set A = {1,2,3} and a relation R = {(1,1), (1,3), (2,2), (3,1), (3,2)}? g 5 3 ry cordQ The transitive closure of the relation {(1,2), (2,3), (3,4), (5,4)} on the set {1,2,3,4,5} is (GATE-1989) (2 Marks)Q The binary relation R= {(1,1), (2,1), (2,2), (2,3), (2,4), (3,1), (3,2), (3,3), (3,4)} on the set A = 3,4} is (GATE-1998) (2 Marks) reflexive, symmetric and transitive (b) neither reflexive, nor irreflexive but transitive (¢) irreflexive, symmetric and transitive (d) irreflexive and antisymmetricQArelation R in {1, 2,3,4,5,6} is given by {(1,2), (2,3), (3,4), (4,4), (4,5)}. This relation is: (NET- Dec-2008) a) Reflexive b) Symmetric ¢) Transitive d) not reflexive, not symmetric and not transitiveQThe binary relation S = > (« s (GATE-2002) (2 Marks) (a) Neither reflexive nor symmetric (b) Symmetric and reflexive (c) Transitive and reflexive (d) Transitive and symmetricQ The relation “divides” on a set of positive integers is . (NET-June-2013) a) Symmetric and transitive b) Anti symmetric and transitive ¢) Symmetric only d) Transitive onlyQLet R be the relation on the set of positive integers such that a R b if and only if a and b are distinct and have « “¢ r other than 1. Which one of the following statements about R is True? (GATE-2015) ie) ric and reflexive but not transitive (B) Ris reflexive but not symmetric and not transitive : (D) Ris symmetric but not reflexive and not transitiveQA binary relation R on Nx Nis defined as follows:010 Q the transitive closure of a relation R on a set A whose relation matrixO 0 is: 100 (NET-June-2005) 010 20 ii @ Oa a ao o1 b)1 1 0 gii1i1 doi 1 1 00 110 111 o11* Equivalence Relation: - A relation R on a set A with cartesian product AxA is said to be Equivalence, if it is 1. Reflexive 2. Symmetric 3. Transitive If two relations R1 and R2 are Equivalence then their union need not to be equivalence but intersection will also be Equivalence.* If two relations R1 and R2 are Equivalence then their union need not to be equivalence but intersection will also be Equivalence.QWhich of the relations on {0, 1, 2, 3} is an equivalence relation? (NET-July-2018) a) {(0, 0) (0, 2) (2, 0) (2, 2) (2, 3) (3, 2) (3, 3)} b) {(0, 0) (1, 1) (2, 2) (3, 3)} €) {(0, 0) (0, 1) (0, 2) (1, 0) (1, 1) (1, 2) (2, 0} d) {(0, 0) (0, 2) (2, 3) (1, 1) (2, 2)}R, : (a, b) iff (a + b) is even over the set of integersR, : (a, b) iff (a + b) is odd over the set of integersR; : (a, b) iff a. b > 0 over the set of non-zero rational numbersR, : (a, b) iff |a—b] <2 over the set of natural numbersQLet S be a set of n elements. The number of ordered pairs in the largest and the smallest equivalence relations on S are (GATE-2007) (1 Marks) (A) nandn (B)n? and n (C) nando (D)nand1QSuppose A is a finite set with n elements. 1 umber of elements in the largest fn)? (1 (d)n+4Q Let R be a non-empty relation on a collection of sets defined by AR B if and only if AM B=. Then, (pick the true statement) (GATE-1996) (2 Marks) : (a) R is reflexive and transitive (b) R is symmetric and not transitive (c) Ris an equivalence relation (d) Ris not reflexive and not symmetricQThe number of equivalence relations of the set {1,2,3,4} is (GATE-1997) (1 Marks) a) 15 b) 16 ) 24 d)4 Will answer this question after functionsQHow many different equivalence relations with exactly three different equivalence classes are there ona set with five elements? (NET-July-2016) (a) 10 (8) 15 (c)25 (D) 30Let Rand S be any two equivalence relations on a non-empty set A. Which one of the following statements is TRUE? (GATE-2005) | (2 Marks) (A) RUS, Rf Sare both equivalence re (B) RU Sis an equivalence relation (C) Rn Sis an equivalence relation (D) Neither R US nor Rn Sis an equivalence relationQ Let R and S be any two equivalence | eis on, a non-empty set A. Which | one of the following statements is TRUE? (GATE-2005) | (2 Marks) (A) RUS, Rf Sare both equivalence re (B) RU Sis an equivalence relation (€) Rn Sis an equivalence relation (D) Neither R U S nor R 2 Sis an equivalence relation1. In mathematics, when the elements of some set 5 have a notion of equivalence (formalized as an equivalence relation) defined on them, then one may naturally split the set S into equivalence classes. 2. These equivalence classes are constructed so that elements a and b belong to the same equivalence class if and only if they are equivalent.* Equivalence Class: - of an element is denoted by [x]. Ix] = {y | y€ Aand (x, y) € R} for allx EA We can have [x] = [y], even if x != yQ Consider A = {1, 2, 3, 4, 5} an equivalence relation R on A, R = {(1,1),(2,2),(3,3),(4,4),(5,5),(1,4),(4,1),(2,5),(5,2)} find the partition of a ‘set A, defined by R. [1] = [2] = [BJ] = [4] = [5] =Partitions of a Set: - let A be a set, with n elements. Based on our understanding of equivalent classes, a subdivision of A into non-empty and non-overlapping subset is called a partition of A. A,UA,UA,U. UA, =A A,NA,NA;N NA,=oQ Consider A = {1, 2, 3, 4, 5} an equivalence relation R on A, R= {(1,1),(2,2),(3,3),(4,4),(5,5),(1,4),(4,1),(2,5),(5,2)} find the partition of a ‘set A, defined by R. [4] = {1, 4} [2] = {2, 5} [3] = {3} [4] = {1,4} [5] = {2, 5} so we have partitions =Q Let A = {1,2,3,4,5} is a set having partitions as {1, 4}, {2, 3, 5}, find the equivalence relation from which these partitions are created?QA relation R is defined on the set of integers as x “i (x+y) is even. Which of the following statements is true? (GATE-2000) (2 Mar! (a) Ris not an equivalence relation (b) an equivalence relation having 1 equivalence class (o 1 equivalence relation having 2 equivalence classes (d)R ‘an equivalence relation having 3 equivalence classes* Partial Order Relation: - A relation R on a set A with cartesian product AxA is said to be partial order, if it is 1. Reflexive 2. Anti - Symmetric 3. TransitiveIn mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary relation indicating that, for certain pairs of elements in the set, one of the elements precedes the other in the ordering. The relation itself is called a "partial order." The word partial in the names "partial order" and “partially ordered set" is used as an indication that not every pair of elements needs to be comparable. That is, there may be pairs of elements for which neither element precedes the other in the poset. Partial orders thus generalize total orders, in which every pair is comparable.* Partial ordering set (Poset): - a set A with partial ordering relation R defined on Ais called a POSET and is denoted by [A; R] For e.g. [A, /], [A, <=], [P(S), 5]* Total order rel: 1: - A Poset [A; R] is called a total order set, if every pair of elements are comparable i.e. either (a, b) or (b, a)x ER, forVa,bEA For e.g. A= {1, 2, 3, 6}, then Poset [A,/] is not a total order relation but A = {1,2,4,8} will beQArelation Ris ietned oa peters pairs of integers as follows: (x, y) R (u, v) ifxv. Then Ris (A) Neither a Partial Order annals Equivalence Relation (B) A Partial Order but not a Total Order (C) A Total Order (D) An Equivalence RelationQWhich of the following statements is true? (NET-July-2018) a) (Z, <) is not totally ordered b) The set inclusion relation C is a partial ordering on the power set of a set S c) (Z, #) is a Poset d) The directed graph is not a partial order Oo-OQA partial order P is — natural numbers as follows. Here x/y denotes integer (iii) (145,265) {iv) (0,153) iaiv iii RivQlet R, be a relation from A = {1,3,5,7} to B = {2,4,6,8} and R, be another relation from B to C = {1,2,3,4} as defined below (GATE-2004) (1 Marks} : (i) an element x in A is related to an element y in B if x + y is divisible by 3 (ii) an element x in B is related to an element y in C if x + y is even but not divisible by 3. Which is the composite relation R,R, from Ato C? a a) {(1,2), (1,4), (3,3), (5,4), (7,3)} 'b) {(2,2), (2,3), (3,2), (5,2), (7,3)} €) {(1,2), (3,2), (3,4), (5,4), (7,2) 4) {(3,2), (3,4), (5,1), (5,3), (7,10)Let R be a symmetric and transitive relation on a set A. Then (GATE-1995) (1 Marks) a) Ris reflexive and hence an equivalence relation b) Ris reflexive and hence a partial order Ris reflexive and hence not an equivalence relation ) None of the aboveBreak