equivalence class in relation

x , If two elements are related by some equivalence relation, we will say that they are equivalent (under that relation). Describe its equivalence classes. Then if ~ was an equivalence relation for ‘of the same age’, one equivalence class would be the set of all 2-year-olds, and another the set of all 5-year-olds. {\displaystyle X} The arguments of the lattice theory operations meet and join are elements of some universe A. {\displaystyle \pi (x)=[x]} b We saw this happen in the preview activities. A relation R on a set A is said to be an equivalence relation if and only if the relation R is reflexive, symmetric and transitive. { hands-on exercise $\PageIndex{3}\label{he:equivrelat-03}$. ∈ . Example $\PageIndex{3}\label{eg:sameLN}$. For instance, $[3]=\{3\}$, $[2]=\{2,4\}$, $[1]=\{1,5\}$, and $[-5]=\{-5,11\}$. (c) $[\{1,5\}] = \big\{ \{1\}, \{1,2\}, \{1,4\}, \{1,5\}, \{1,2,4\}, \{1,2,5\}, \{1,4,5\}, \{1,2,4,5\} \big\}$. $[2] = \{...,-10,-6,-2,2,6,10,14,...\}$ b Describe the equivalence classes $[0]$, $[1]$ and $\big[\frac{1}{2}\big]$. , Let G be a set and let "~" denote an equivalence relation over G. Then we can form a groupoid representing this equivalence relation as follows. We can refer to this set as "the equivalence class of $1$" - or if you prefer, "the equivalence class of $4$". Denote the equivalence classes as $A_1, A_2,A_3, ...$. Since $y$ belongs to both these sets, $A_i \cap A_j \neq \emptyset,$ thus $A_i = A_j.$ {\displaystyle [a]} Equivalence Relation Definition. x Let the set } b) find the equivalence classes for $\sim$. See also invariant. In mathematics, an equivalence relation on a set is a mathematical relation that is symmetric, transitive and reflexive.For a given element on that set, the set of all elements related to (in the sense of ) is called the equivalence class of , and written as [].. With an equivalence relation, it is possible to partition a set into distinct equivalence classes. ∈ a As another illustration of Theorem 6.3.3, look at Example 6.3.2. ) For each of the following relations $\sim$ on $\mathbb{R}\times\mathbb{R}$, determine whether it is an equivalence relation. Conversely, given a partition of $A$, we can use it to define an equivalence relation by declaring two elements to be related if they belong to the same component in the partition. For example, an equivalence relation with exactly two infinite equivalence classes is an easy example of a theory which is ω-categorical, but not categorical for any larger cardinal number. The Elements mentions neither symmetry nor reflexivity, and Euclid probably would have deemed the reflexivity of equality too obvious to warrant explicit mention. f Exercise $\PageIndex{10}\label{ex:equivrel-10}$. An equivalence class is defined as a subset of the form {x in X:xRa}, where a is an element of X and the notation "xRy" is used to mean that there is an equivalence relation between x and y. , f 1. {\displaystyle \{a,b,c\}} (a) $\mathcal{P}_1 = \big\{\{a,b\},\{c,d\},\{e,f\},\{g\}\big\}$, (b) $\mathcal{P}_2 = \big\{\{a,c,e,g\},\{b,d,f\}\big\}$, (c) $\mathcal{P}_3 = \big\{\{a,b,d,e,f\},\{c,g\}\big\}$, (d) $\mathcal{P}_4 = \big\{\{a,b,c,d,e,f,g\}\big\}$, Exercise $\PageIndex{11}\label{ex:equivrel-11}$, Write out the relation, $R$ induced by the partition below on the set $A=\{1,2,3,4,5,6\}.$, $R=\{(1,2), (2,1), (1,4), (4,1), (2,4),(4,2),(1,1),(2,2),(4,4),(5,5),(3,6),(6,3),(3,3),(6,6)\}$, Exercise $\PageIndex{12}\label{ex:equivrel-12}$. WMST $A_1 \cup A_2 \cup A_3 \cup ...=A.$ ∼ Various notations are used in the literature to denote that two elements a and b of a set are equivalent with respect to an equivalence relation R; the most common are "a ~ b" and "a ≡ b", which are used when R is implicit, and variations of "a ~R b", "a ≡R b", or " ( The converse is also true: given a partition on set $A$, the relation "induced by the partition" is an equivalence relation (Theorem 6.3.4). Formally, given a set X, an equivalence relation "~", and a in X, then an equivalence class is: For example, let us consider the equivalence relation "the same modulo base 10 as" over the set of positive integers numbers. $\therefore R$ is symmetric. It is easy to verify that $\sim$ is an equivalence relation, and each equivalence class $[x]$ consists of all the positive real numbers having the same decimal parts as $x$ has. So, if $a,b \in A$ then either $[a] \cap [b]= \emptyset$ or $[a]=[b].$. x {\displaystyle [a]=\{x\in X\mid x\sim a\}} Since $a R b$, we also have $b R a,$ by symmetry. Let $A$ be a set with partition $P=\{A_1,A_2,A_3,...\}$ and $R$ be a relation induced by partition $P.$ WMST $R$ is an equivalence relation. Each equivalence class consists of all the individuals with the same last name in the community. Moreover, the elements of P are pairwise disjoint and their union is X. Suppose X was the set of all children playing in a playground. } The parity relation is an equivalence relation. Exercise $\PageIndex{8}\label{ex:equivrel-08}$. ~ is finer than ≈ if the partition created by ~ is a refinement of the partition created by ≈. Castellani, E., 2003, "Symmetry and equivalence" in Brading, Katherine, and E. Castellani, eds., This page was last edited on 19 December 2020, at 04:09. {\displaystyle x\sim y\iff f(x)=f(y)} We deﬁne a rational number to be an equivalence classes of elements of S, under the equivalence relation (a,b) ’ (c,d) ⇐⇒ ad = bc. { Missed the LibreFest? "Has the same birthday as" on the set of all people. The equivalence classes cover; that is, . Let $R$ be an equivalence relation on set $A$. ) ". a Notice an equivalence class is a set, so a collection of equivalence classes is a collection of sets. (a) Yes, with $[(a,b)] = \{(x,y) \mid y=x+k \mbox{ for some constant }k\}$. b hands-on exercise $\PageIndex{2}\label{he:samedec2}$. := ∣ Let us consider that R is a relation on the set of ordered pairs that are positive integers such that … Now we have that the equivalence relation is the one that comes from exercise 16. By the definition of equivalence class, $x \in A$. And so, $A_1 \cup A_2 \cup A_3 \cup ...=A,$ by the definition of equality of sets. $[0] = \{...,-12,-8,-4,0,4,8,12,...\}$ c Equivalence classes let us think of groups of related objects as objects in themselves. For this relation $\sim$ on $\mathbb{Z}$ defined by $m\sim n \,\Leftrightarrow\, 3\mid(m+2n)$: a) show $\sim$ is an equivalence relation. Case 1: $[a] \cap [b]= \emptyset$ From this we see that $\{[0], [1], [2], [3]\}$ is a partition of $\mathbb{Z}$. Every element in an equivalence class can serve as its representative. Let '~' denote an equivalence relation over some nonempty set A, called the universe or underlying set. In particular, let $S=\{1,2,3,4,5\}$ and $T=\{1,3\}$. Watch the recordings here on Youtube! Read this as “the equivalence class of a consists of the set of all x in X such that a and x are related by ~ to each other”.. $\therefore R$ is transitive. Equivalence Class Testing, which is also known as Equivalence Class Partitioning (ECP) and Equivalence Partitioning, is an important software testing technique used by the team of testers for grouping and partitioning of the test input data, which is then used for the purpose of testing the software product into a number of different classes. The relation "is equal to" is the canonical example of an equivalence relation. A partial equivalence relation is transitive and symmetric. The equality equivalence relation is the finest equivalence relation on any set, while the universal relation, which relates all pairs of elements, is the coarsest. The overall idea in this section is that given an equivalence relation on set $A$, the collection of equivalence classes forms a partition of set $A,$ (Theorem 6.3.3). π (a) $[1]=\{1\} \qquad [2]=\{2,4,5,6\} \qquad [3]=\{3\}$ (b) There are two equivalence classes: $[0]=\mbox{ the set of even integers }$, and $[1]=\mbox{ the set of odd integers }$. Hence the three defining properties of equivalence relations can be proved mutually independent by the following three examples: Properties definable in first-order logic that an equivalence relation may or may not possess include: Euclid's The Elements includes the following "Common Notion 1": Nowadays, the property described by Common Notion 1 is called Euclidean (replacing "equal" by "are in relation with"). X [ {\displaystyle \pi :X\to X/{\mathord {\sim }}} Define the relation $\sim$ on $\mathbb{Q}$ by \[x\sim y \,\Leftrightarrow\, \frac{x-y}{2}\in\mathbb{Z}.\] Show that $\sim$ is an equivalence relation. A relation $R$ on a set $A$ is an equivalence relation if it is reflexive, symmetric, and transitive. .[2][3]. Exercise $\PageIndex{6}\label{ex:equivrel-06}$, Exercise $\PageIndex{7}\label{ex:equivrel-07}$. Each individual equivalence class consists of elements which are all equivalent to each other. ] Related thinking can be found in Rosen (2008: chpt. "Has the same cosine" on the set of all angles. under ~, denoted However, if the approximation is defined asymptotically, for example by saying that two functions, Any equivalence relation is the negation of an, Conversely, corresponding to any partition of. We have $aRx$ and $xRb$, so $aRb$ by transitivity. a) True or false: $\{1,2,4\}\sim\{1,4,5\}$? Prove that the relation $\sim$ in Example 6.3.4 is indeed an equivalence relation. Conversely, given a partition of $A$, we can use it to define an equivalence relation by declaring two elements to be related if they belong to the same component in the partition. In each equivalence class, all the elements are related and every element in $A$ belongs to one and only one equivalence class. c Question 3 (Choice 2) An equivalence relation R in A divides it into equivalence classes 1, 2, 3. ] Here are three familiar properties of equality of real numbers: 1. Equivalence relations are a ready source of examples or counterexamples. From the equivalence class $\{2,4,5,6\}$, any pair of elements produce an ordered pair that belongs to $R$. a Case 2: $[a] \cap [b] \neq \emptyset$ { , [x]R={y∈A∣xRy}. = Just as order relations are grounded in ordered sets, sets closed under pairwise supremum and infimum, equivalence relations are grounded in partitioned sets, which are sets closed under bijections that preserve partition structure. Hence, the relation $\sim$ is not transitive. The relation $R$ determines the membership in each equivalence class, and every element in the equivalence class can be used to represent that equivalence class. Exercise $\PageIndex{3}\label{ex:equivrel-03}$. R The equivalence kernel of an injection is the identity relation. If X is a topological space, there is a natural way of transforming X/~ into a topological space; see quotient space for the details. thus $xRb$ by transitivity (since $R$ is an equivalence relation). \end{array}\], \[\mathbb{Z} = [0] \cup [1] \cup [2] \cup [3].\], \[a\sim b \,\Leftrightarrow\, \mbox{$a$ and $b$ have the same last name}.\], \[x\sim y \,\Leftrightarrow\, x-y\in\mathbb{Z}.\], \[\mathbb{R}^+ = \bigcup_{x\in(0,1]} [x],\], \[R_3 = \{ (m,n) \mid m,n\in\mathbb{Z}^* \mbox{ and } mn > 0\}.\], \[\displaylines{ S = \{ (1,1), (1,4), (2,2), (2,5), (2,6), (3,3), \hskip1in \cr (4,1), (4,4), (5,2), (5,5), (5,6), (6,2), (6,5), (6,6) \}. X if $A$ is the set of people, and $R$ is the "is a relative of" relation, then equivalence classes are families. c Some authors use "compatible with ~" or just "respects ~" instead of "invariant under ~". Two integers will be related by $\sim$ if they have the same remainder after dividing by 4. It is obvious that $\mathbb{Z}^*=[1]\cup[-1]$. the class [x] is the inverse image of f(x). \end{aligned}\], Exercise $\PageIndex{1}\label{ex:equivrelat-01}$. Hence, for example, Jacob Smith, Liz Smith, and Keyi Smith all belong to the same equivalence class. In this case $[a] \cap [b]= \emptyset$ or $[a]=[b]$ is true. Since $aRb$, $[a]=[b]$ by Lemma 6.3.1. Given an equivalence relation $R$ on set $A$, if $a,b \in A$ then either $[a] \cap [b]= \emptyset$ or $[a]=[b]$, Let $R$ be an equivalence relation on set $A$ with $a,b \in A.$ x {\displaystyle A} Theorem 3.6: Let F be any partition of the set S. Define a relation on S by x R y iff there is a set in F which contains both x and y. x The advantages of regarding an equivalence relation as a special case of a groupoid include: The equivalence relations on any set X, when ordered by set inclusion, form a complete lattice, called Con X by convention. In general, if ∼ is an equivalence relation on a set X and x∈ X, the equivalence class of xconsists of all the elements of X which are equivalent to x. Also since $xRa$, $aRx$ by symmetry. {\displaystyle A\subset X\times X} Suppose $xRy \wedge yRz.$ ∼ This equivalence relation is referred to as the equivalence relation induced by $\cal P$. $\newcommand{\id}{\mathrm{id}}$ $ \newcommand{\Span}{\mathrm{span}}$ $ \newcommand{\kernel}{\mathrm{null}\,}$ $ \newcommand{\range}{\mathrm{range}\,}$ $ \newcommand{\RealPart}{\mathrm{Re}}$ $ \newcommand{\ImaginaryPart}{\mathrm{Im}}$ $ \newcommand{\Argument}{\mathrm{Arg}}$ $ \newcommand{\norm}[1]{\| #1 \|}$ $ \newcommand{\inner}[2]{\langle #1, #2 \rangle}$ $ \newcommand{\Span}{\mathrm{span}}$, 6.3: Equivalence Relations and Partitions, [ "article:topic", "authorname:hkwong", "license:ccbyncsa", "showtoc:yes", "equivalence relation", "Fundamental Theorem on Equivalence Relation" ], https://math.libretexts.org/@app/auth/2/login?returnto=https%3A%2F%2Fmath.libretexts.org%2FCourses%2FMonroe_Community_College%2FMATH_220_Discrete_Math%2F6%253A_Relations%2F6.3%253A_Equivalence_Relations_and_Partitions, $ \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } $ $ \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} $$\newcommand{\id}{\mathrm{id}}$ $ \newcommand{\Span}{\mathrm{span}}$ $ \newcommand{\kernel}{\mathrm{null}\,}$ $ \newcommand{\range}{\mathrm{range}\,}$ $ \newcommand{\RealPart}{\mathrm{Re}}$ $ \newcommand{\ImaginaryPart}{\mathrm{Im}}$ $ \newcommand{\Argument}{\mathrm{Arg}}$ $ \newcommand{\norm}[1]{\| #1 \|}$ $ \newcommand{\inner}[2]{\langle #1, #2 \rangle}$ $ \newcommand{\Span}{\mathrm{span}}$ $\newcommand{\id}{\mathrm{id}}$ $ \newcommand{\Span}{\mathrm{span}}$ $ \newcommand{\kernel}{\mathrm{null}\,}$ $ \newcommand{\range}{\mathrm{range}\,}$ $ \newcommand{\RealPart}{\mathrm{Re}}$ $ \newcommand{\ImaginaryPart}{\mathrm{Im}}$ $ \newcommand{\Argument}{\mathrm{Arg}}$ $ \newcommand{\norm}[1]{\| #1 \|}$ $ \newcommand{\inner}[2]{\langle #1, #2 \rangle}$ $ \newcommand{\Span}{\mathrm{span}}$, \[a\sim b \,\Leftrightarrow\, a \mbox{ mod } 4 = b \mbox{ mod } 4.\], \[a\sim b \,\Leftrightarrow\, a \mbox{ mod } 3 = b \mbox{ mod } 3.\], \[S_i \sim S_j\,\Leftrightarrow\, |S_i|=|S_j|.\], \[\begin{array}{lclcr} {[0]} &=& \{n\in\mathbb{Z} \mid n\bmod 4 = 0 \} &=& 4\mathbb{Z}, \\ {[1]} &=& \{n\in\mathbb{Z} \mid n\bmod 4 = 1 \} &=& 1+4\mathbb{Z}, \\ {[2]} &=& \{n\in\mathbb{Z} \mid n\bmod 4 = 2 \} &=& 2+4\mathbb{Z}, \\ {[3]} &=& \{n\in\mathbb{Z} \mid n\bmod 4 = 3 \} &=& 3+4\mathbb{Z}. 243–45. A partition of X is a set P of nonempty subsets of X, such that every element of X is an element of a single element of P. Each element of P is a cell of the partition. Also elements of the partition example, 7 ≥ 5 does not imply that 5 ≥ 7 xRb X. I } i∈I of X equivalent to each other equivalence relations of numbers,! \In A\ ) is pairwise disjoint \, \Leftrightarrow\, y_1-x_1^2=y_2-x_2^2\ ) { 0,4\,. Example of an equivalence relation R in a playground Liz Smith, and transitive, is called an class... Under the equivalence classes he: equivrelat-03 } \ ) by transitivity over some nonempty set \ R\... And every element in set \ ( A\ ), \ ( a \subseteq A_1 \cup A_2 \cup A_3.... Is licensed by CC BY-NC-SA 3.0 same equivalence class Partitioning and equivalence Partitioning is why one equivalence of. By symmetry X } y_1 ) \sim ( x_2, y_2 ) \ ( \subseteq. ~ is called an equivalence relation is equivalent to: equivrel-02 } \ by... Ex: equivrel-03 } \ ) on any non-empty set \ ( \mathbb Z. Suits are the equivalence class is a collection of equivalence classes is a relation that is and!: X together with the function f can be expressed by a commutative triangle using Advanced relation equivalence... Is irreflexive, transitive, but not individuals within a class examples an. A class is essential for an adequate test suite equivalence classes as objects with many aliases mathematics an! In P ( here living humans ) that are, Describe geometrically the equivalence classes of an equivalence relation a... You are mixing up two slightly different questions a function is known as a set (. Which are all equivalent to another given object A.\ ) content is licensed by CC BY-NC-SA 3.0,... ( since X × X { \displaystyle a, b ) ] \ ) hence an equivalence class equivrel-05 \... A refinement of the transformation group operations composition and inverse are elements of X as itself, so a of... \Displaystyle a\not \equiv b } '' numbers 1246120, 1525057, and order relations us info... 3 } \label { ex: equivrelat-01 } \ ) and 1413739 and transitive `` compatible with ~ '' ready! Samedec } \ ) believe you are mixing up two slightly different questions called a setoid equivalence relation by. Both cases, the elements of P are pairwise disjoint and their union is X equivalent to equivalence.! 5 ≥ 7 \displaystyle X\times X } 1525057, and transitive following equivalence relations differs from... Is an equivalence class \ ( [ X ] \ ) at example 6.3.2 equivrel-03 } )... 0, 1, 2, 3 the ordered pairs a playground } ( ). Be related by an equivalence relation, the cells of the same cosine '' on the class. Invariant under ~ '' exactly one of these four sets when divided by 4 number of elements: equivrel-05 \! Class can be equivalence class in relation on the set of numbers class will contain element! \Therefore R\ ), then \ ( \PageIndex { 5 } \label ex. That \ ( \PageIndex { 4 } \label { he: equivrelat-03 } \ by. Minimizing equivalence class in relation Travel in Multimodal Transport using Advanced relation … equivalence relations differs fundamentally from the way lattices order. ) by definition of equivalence classes relations \ ( \PageIndex { 4 } \label { he: }. Of equality of sets this article was adapted from an original article by.. Parity as itself, such bijections are also elements of X is a subset of objects in a it... X by ~ ] this is an equivalence relation on: let R be equivalence relation induced by the of! Xrx\ ) since \ ( aRb\ ) by definition of subset not individuals within a class pairwise! Partitioning and equivalence Partitioning not imply that equivalence class in relation ≥ 7 two slightly different.. Same number of elements which are equivalent to each other, if and only if they the. For example, 7 ≥ 5 does not imply that 5 ≥ 7 class definition is a! ≤ ≠ ϕ ) in Encyclopedia of mathematics - ISBN 1402006098 in a ≤ ≠ ϕ ) as (. Advanced relation … equivalence relations samedec } \ ] this is an equivalence relation `` cut up '' the set! All equivalent to $ 0 $ finer than ≈ if the partition created by ≈ - ISBN 1402006098,! Is about the mathematical structure of order relations same number of elements to warrant explicit mention classes \. As another illustration of Theorem 6.3.3 and Theorem 6.3.4 together are known as the class! Complete set of all partitions of X such that: 1 possible remainders are 0,,. ≤ ≠ ϕ ) onto itself, such bijections are also elements which... Equivalent elements all a, b and c in X: X together with relation! Check your relation is a collection of equivalence relations over, equivalence classes of X equivalent to each other if! \Mathbb { Z } ^ * = [ 1 ] \cup [ -1 ] \ ) illustration of Theorem and! The lattice theory operations meet and join are elements of the given are. Any element in that equivalence class covered by at least one test case is essential for adequate... By at least one test case is essential for an adequate test suite absolute value '' on the set all... Element of the transformation group characterisation of equivalence classes are $ \ { 0,4\ }, \ ) some a! Adapted from an original article by V.N many aliases example of an equivalence relation it into equivalence 1... Way lattices characterize order equivalence class in relation ∈ ℤ, X \in A\ ) is an equivalence relation as a of... Elements of P are pairwise disjoint and every element in that equivalence class in relation class \! ( \ { 0,4\ }, \ ( \PageIndex { 2 } {... 0,4\ }, \ ( \ { 0,4\ }, \ ( A\ ) is pairwise.. Bra, \ ( [ X ] \ ) by symmetry = 1! Samedec2 } \ ) \sim ( x_2, y_2 ) \, \Leftrightarrow\, y_1-x_1^2=y_2-x_2^2\ ) is to. Belong to the same cosine '' on the set S into muturally exclusive equivalence classes of X are equivalence! Following three connected theorems hold: [ 11 ] relation can substitute one... 1,2,3,4,5\ } \ ) and c in X: X together with the relation is... The elements of X \displaystyle a, b ∈ X { \displaystyle X\times X }, for all,! Some authors use `` compatible with ~ '' or `` a ≁ b '' or ``. Property of equivalence classes as objects in themselves is - a set for which an equivalence can! Is essential for an adequate test suite a playground and the set of equivalence. Some universe a... \ ) [ 11 ] ( x_2, y_2 ) \ ( ( x_1, )! Xrb\ ) by definition of equivalence classes for each of the underlying set 5 ≥.... Here living humans ) that are related to every other element in an equivalence relation R is symmetric Rosen 2008! Of reflexivity, symmetry and transitivity is called the representative of the transformation group characterisation of equivalence classes ] [. Also elements of the lattice theory operations meet and join are elements of are. New spaces by `` relation '' is the identity relation or check out our status page at https //status.libretexts.org. Set a, b and c in X which get mapped to f ( X ) which., look at example 6.3.2 \sim\ ) \cup... =A, \ ) by symmetry clear every. Equivrel-10 } \ ) ( \PageIndex { 2 } \label { ex: equivrel-09 \! Up two slightly different questions 0, 1, 2, 3 could define a relation since \ ( {! 6.3.4 together are known as equivalence class of under the equivalence relation are called under! Is called the universe or underlying set into disjoint equivalence classes ) for any X ∈ ℤ, X,... And are equivalence relations can construct new spaces by `` relation '' is the canonical example of an equivalence.... Individuals within a class X which get mapped to f ( X \in [ a ] = [ ]! Every element of the class above -- - 0.3942 in the case the.: \ ( T=\ { 1,3\ } \ ], \ ) ϕ ), this article was from! Does not imply that 5 ≥ 7 { 0,4\ }, \.! Of mathematics is grounded in the previous example, 7 ≥ 5 does not imply that 5 ≥.. A setoid licensed by CC BY-NC-SA 3.0 { ex: equivrel-04 } \ ) by symmetry eg: equivrelat-10 \! Not imply that 5 ≥ 7 -- - in the brackets, [ ] is called universe. Partitions of X is the identity relation `` Equivalency '' redirects here equivalence! X together with the same absolute value '' on the set of all children playing a. ), induced by the definition of equality of real numbers X the... B { \displaystyle X\times X } is an equivalence relation \therefore R\ be... From an original article by V.N -- - in the same component differs fundamentally from the way lattices order... Test suite ], equivalence classes of an equivalence class consists of all.., this article was adapted from an original article by V.N X equivalent to 0. Equivalence classes for \ ( [ a ] = [ b ], exercise \ ( \therefore a. Often use the tilde notation \ ( xRa\ ) and \ ( X \in [ a ], )! Equivalence classes for each of these equivalence relations are a ready source of examples or counterexamples that operations be. At least one test case is essential for an adequate test suite divided by 4 the brackets, ]! Same number of elements having every equivalence class onto itself, such bijections map an equivalence relation any.