Course contentsShow
← Mathematics
Lesson 2544 of 3,12151. Discrete Math — Sets, Relations, FunctionsFree lesson

Antisymmetric Relations

Define antisymmetry and distinguish it from symmetry by checking when both (a,b) and (b,a) can appear in a relation.

Antisymmetric Relations

What You'll Learn

You'll learn what makes a relation antisymmetric and how it differs fundamentally from symmetry by examining when pairs like (a,b) and (b,a) can coexist in a relation.

The Core Idea

An antisymmetric relation has a strict rule: if both (a,b) and (b,a) appear in the relation, then a and b must be the same element. In other words, the only way both directions of a relationship can exist is when you're relating something to itself.

Formally, a relation R on set A is antisymmetric if:

  • Whenever (a,b) ∈ R and (b,a) ∈ R, then a = b.

Think of the "less than or equal to" relation (≤) on numbers. If x ≤ y and y ≤ x both hold, what must be true? The numbers must be equal: x = y. That's antisymmetry at work.

Distinguishing from Symmetry

This is not the opposite of symmetry!

  • A symmetric relation requires: if (a,b) is in R, then (b,a) must also be in R.
  • An antisymmetric relation allows one-way pairs freely, but restricts two-way pairs to identical elements only.

A relation can even be both symmetric and antisymmetric (though such relations only contain pairs like (a,a)).

Example

Consider R = {(1,1), (2,3), (3,1)} on set {1,2,3}.

  • We have (2,3) but not (3,2) ✓
  • We have (3,1) but not (1,3) ✓
  • We have (1,1), which is fine since 1 = 1 ✓

This relation is antisymmetric because no forbidden "round trips" exist between distinct elements.

Key Takeaway: A relation is antisymmetric if the only pairs that can appear in both directions connect an element to itself—effectively preventing symmetric relationships between distinct elements.