Skip to content
Theorem

The inverse relation keeps reflexive, symmetric and transitive

Algebra • Relations and Functions

Statement

For a relation on , . If is reflexive, so is ; if is symmetric, so is (in fact ); if is transitive, so is .

How to use it

  1. 1Reflexive: reversed is still .
  2. 2Symmetric: already holds every pair both ways, so reversing changes nothing.
  3. 3Transitive: means , so , so .

Worked example

on . Is reflexive and transitive?

Step-by-step

  1. 1

    Why: Reverse each pair.

  2. 2
    Both and are in it: reflexive.
  3. 3
    The only chains are through or , which give pairs already present: transitive.

Answer

Yes, it is both.

Watch out

is not the complement of and not with its pairs removed: it holds the same pairs, each reversed.

Builds on

Also known as

inverse relation, R inverse, converse relation properties

Appears in past papers

2022 (I)

2016 (II)