Industry-relevant training in Business, Technology, and Design to help professionals and graduates upskill for real-world careers.
Fun, engaging games to boost memory, math fluency, typing speed, and English skillsβperfect for learners of all ages.
The chapter discusses operations on relations, including set-theoretic operations such as union, intersection, and composition. It explores the concepts of powers of relations and various closure properties, including reflexive, symmetric, and transitive closures. Through examples, it illustrates how relations can be manipulated and expanded to satisfy specific properties.
Enroll to start learning
Youβve not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
References
ch17.pdfClass Notes
Memorization
What we have learnt
Final Test
Revision Tests
Term: Union of Relations
Definition: The union of two relations R1 and R2 includes all ordered pairs that are in either R1 or R2.
Term: Composition of Relations
Definition: The composition of two relations R and S combines them such that if an element a is related to b through R, and b is related to c through S, then a is related to c in the composed relation.
Term: Reflexive Closure
Definition: The reflexive closure of a relation R is formed by adding all pairs of the form (a, a) for each element a in the set if they are not already included in R.
Term: Transitive Closure
Definition: The transitive closure of a relation R involves repeatedly adding pairs of the form (a, c) based on already existing pairs (a, b) and (b, c) until no new pairs can be added.