Course contentsShow
← Computer Science
Lesson 69 of 2,8722. Discrete Mathematics for CSFree lesson

Properties of Relations: Reflexivity

Define reflexive and irreflexive relations; identify these properties in concrete examples.

Properties of Relations: Reflexivity

What You'll Learn

You'll learn to recognize when every element in a set is related to itself, and when no element relates to itself.

The Core Idea

Now that you know relations are sets of ordered pairs, we can examine their properties. The first property to understand is reflexivity.

A relation R on a set A is reflexive if every element relates to itself. In other words, for every element a in A, the pair (a, a) must be in R.

Think of it like a mirror rule: "Everyone must see themselves in the relation."

Example: Reflexive Relation

  • Set A = {1, 2, 3}
  • Relation R = {(1,1), (2,2), (3,3), (1,2)}
  • R is reflexive because all three pairs (1,1), (2,2), and (3,3) are present

Real-world analogy: "is the same height as" is reflexive—you're always the same height as yourself.

Example: NOT Reflexive

  • Set A = {1, 2, 3}
  • Relation R = {(1,1), (2,2), (1,3)}
  • R is not reflexive because (3,3) is missing

Irreflexive Relations

The opposite property is irreflexive: a relation where no element relates to itself. For every element a in A, the pair (a, a) must not be in R.

Example: Irreflexive Relation

  • Set A = {1, 2, 3}
  • Relation R = {(1,2), (2,3)}
  • R is irreflexive because none of (1,1), (2,2), or (3,3) appear

Real-world analogy: "is older than" is irreflexive—you cannot be older than yourself.

Note: A relation can be neither reflexive nor irreflexive if some (but not all) elements relate to themselves!

Key Takeaway: A relation is reflexive if every element relates to itself; it's irreflexive if no element relates to itself.