Equivalence Classes

Definition 1.9 – Equivalence

An element gaG is equivalent to another element gbG (gagb) if there exists a third element gcG such that an equivalence transformation can be performed.

gagbgb=gcgagc1
Important Equivalence Properties

First property : every element is equivalent to itself.

gagaga=egae1=egae=ga

Second property : if gagb, then gbga.

gagbgb=gcgagc1gc1gb=gagc1gc1gbgc=ga(g1g=gg1)gcgbgc1=gagbga

Third Property : if gagb and gbgc, then gagc.

gagbgb=g1gag11andgbgcgc=g2gbg21

So, gc=g2gbg21=(g2g1)ga(g11g21)=g3gag31gagc with g3=(g2g1).

Definition 1.10 – Equivalence Class

An equivalence class is a maximal subset of mutually equivalent elements of some group G. We denote the k equivalence classes of a group: Ci, i={1,2,,k}.

Theorem 1.5

Consider C, an equivalence class of group G. For any gG,

g1Cg=C

Furthermore, any subgroup S of G, for which

g1Sg=SgG

Is composed of complete equivalence classes.

Proof
First Part

We know, through theorem 1.2, that, for a subset S of group G, the number of distinct elements in Sg or gS is equal to the order |S|.

So, the number of elements in g1Sg is the same as |S|.

Therefore, each element of g1Cg is also in C, implying that g1Cg=C.

Second Part

Consider some subset S, such that g1Sg=S gG, and that S is not composed of equivalence classes.

This means that there exists two equivalent elements g1,g2G such that g1S and g2S.

Consequently, g1g1g=g2 for some gG which implies that g2S since g1g1Sg. This contradicts g2S. Therefore, if g1Sg=S gG, S must be composed of complete equivalence classes.