PAIBOTLearn
Sign inSign up

Equivalence relations

Functions & relations

Japanese school year: University year 1

What you learn

You will learn about relations satisfying reflexivity, symmetry, and transitivity, and how equivalence classes partition a set into disjoint subsets. This forms the foundation for modern algebraic concepts such as modular arithmetic and quotient structures. A solid grasp of Cartesian products and logical deductions will be advantageous.

Go to practice

Key points

This is the reflexive property of an equivalence relation ∼\sim. It means every element aa must always be related to (in the same group as) itself.

a∼aa \sim a

This is the symmetric property of an equivalence relation. If element aa is related to bb, then bb must also be related to aa, showing that the relation works both ways.

a∼b  ⟹  b∼aa \sim b \implies b \sim a

This is the transitive property of an equivalence relation. It means if aa relates to bb, and bb relates to cc, then aa automatically relates to cc.

a∼b∧b∼c  ⟹  a∼ca \sim b \land b \sim c \implies a \sim c

This defines the equivalence class [a][a], which gathers all elements xx related to aa within set AA. It is used to partition a set into non-overlapping groups.

[a]={x∈A∣x∼a}[a] = \{ x \in A \mid x \sim a \}

Choose a set to practice.