Properties of Relations
A binary relation on a set $A$ is a subset $R \subseteq A \times A$. Its properties impose conditions on every applicable ordered pair, not merely selected examples.
Summary
A binary relation on a set is a subset . Its properties impose conditions on every applicable ordered pair, not merely selected examples.
Reflexivity requires every self-pair; irreflexivity excludes every self-pair. Symmetry requires the reverse of each related pair. Antisymmetry forbids mutual relationships between distinct elements but permits self-pairs. Asymmetry forbids all reversed pairs, including self-pairs. Transitivity requires whenever and .
🧠 Key Concepts
- Reflexivity
- Irreflexivity
- Symmetry
- Antisymmetry
- Asymmetry
- Transitivity
- Equivalence Relations
- Partial Orders
- Total Orders
🧠 Quick Check
See what you remember from the summary.
A relation is used to partition data into equivalence classes. Which three properties must it satisfy? Select three.
🧠 Flashcards Preview
Tap a card to reveal the definition.
Ready to quiz yourself?
Test what you remember with a full practice quiz on this note. Create a free account and start in seconds.
Full Notes
Read the original note content before deciding whether to save or study from it.
Properties of Relations
📘 Overview A binary relation on a set is a subset , specifying which ordered pairs are related. Reflexivity, symmetry, antisymmetry, asymmetry, and transitivity describe structural constraints on those pairs.
🧠 Key Idea A relation satisfies a property only when every instance required by its definition holds. Symmetry requires reversed pairs, whereas antisymmetry forbids reversed pairs between distinct elements.
⚔️ Core Details: - Reflexive:
More ways to study when you copy this note
Copy this note into your library to unlock focused practice sessions and long-term review.
Answer all questions first, then see feedback at the end — the way real exams work.
Focuses each session on what you got wrong, not what you already know.
Full timed exam with all questions, no pausing, and results at the end. Built for board exam prep.
Part of 🌱 BSCS Year 1 — Computing & College Foundations
Browse this Review Set →More Computer Engineering notes
See all →More in Discrete Mathematics
See all →More from NoteLib
Browse NoteLib's public notes →Copy this note to your library and get the full Study Pack instantly — summary, key concepts, and practice quiz included.