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 delves into various types of binary relations, including irreflexive, symmetric, asymmetric, antisymmetric, and transitive relations, outlining their definitions and characteristics. It also discusses matrices representing these relations and explores their implications in terms of directed graphs. Moreover, the chapter emphasizes the distinctions and potential overlaps between reflexivity and irreflexivity, as well as the absence of direct relationships among symmetric, asymmetric, and antisymmetric 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
ch16 - part B.pdfClass Notes
Memorization
What we have learnt
Final Test
Revision Tests
Term: Irreflexive Relation
Definition: A relation is irreflexive if no element in the set is related to itself.
Term: Symmetric Relation
Definition: A relation is symmetric if whenever (a, b) is in the relation, (b, a) must also be in the relation.
Term: Asymmetric Relation
Definition: A relation is asymmetric if for (a, b) in the relation, (b, a) cannot be in the relation.
Term: Antisymmetric Relation
Definition: A relation is antisymmetric if both (a, b) and (b, a) can only exist if a equals b.
Term: Transitive Relation
Definition: A relation is transitive if whenever (a, b) and (b, c) are in the relation, then (a, c) must also be in the relation.