Intereting Posts

Integrating $ \int_0^2 \int_0^ \sqrt{1-(x-1)^2} \frac{x+y}{x^2+y^2} dy\,dx$ in polar coordinates
Can one come to prove Cantor's theorem (existence of higher degree of infinities) FROM Russell's paradox?
Show that series converge or diverge
The fix points of the Möbius transformations are the eigenspace of a certain matrix.
Problem with $Pullback$ Calculation
Radius of convergence of power series
To what extent can you manipulate differentials like dy and dt like actual values?
explaining the derivative of $x^x$
If $f \in L^{p_1}(E) $ is bounded then $f\in L^{p_2}$ for any $p_2>p_1$
All groups where underlying set has at most 4 elements
Can every finite-dimensional associative $\mathbb{C}$-algebra be equipped with a submultiplicative norm?
Examples of bijective map from $\mathbb{R}^3\rightarrow \mathbb{R}$
Class Group of $\mathbb{Q}(\sqrt{-47})$
Continuous function from $(0,1)$ onto $$
Counting permutations, with additional restrictions

I don’t understand left coset and Lagrange’s theorem… I’m working on some project so please write me anything what could help me understand it better

- $\mathbb Z^n/\langle (a,…,a) \rangle \cong \mathbb Z^{n-1} \oplus \mathbb Z/\langle a \rangle$
- Is there a simple way to distinguish between group homomorphisms?
- There exists only two groups of order $p^2$ up to isomorphism.
- Can every torsion-free nilpotent group be ordered?
- What groups are semidirect products of simple groups?
- $A_4$ has no subgroup of order $6$?
- Homomorphism between cyclic groups
- Classify orbits of conjugating action on $GL_2(\mathbb{C})$
- polish groups and open subgroups
- How to find the quotient group $Z_{1023}^*/\langle 2\rangle$?

Suppose $G$ is a group, and $H$ is any subgroup of $G$. I would like to try to define something similar to “congruence modulo $n$” for integers, but for this arbitrary group $G$ and subgroup $H$.

In the integers, we say that $a\equiv b\pmod{m}$ if and only if $a-b$ is an element of the subgroup $m\mathbb{Z}$. So we are going to try something similar for $H$ and $G$, taking into account that $G$ need not be abelian.

I’m not going to assume the group is finite until I say so explicitly.

**Definition.** Let $G$ be a group and let $H$ be a subgroup. If $x,y\in G$, we say that $x$ and $y$ are *congruent on the right modulo* $H$ if and only if $xy^{-1}\in H$. We write this $x\equiv_H y$.

**Proposition.** $\equiv_H$ is an equivalence relation on $G$.

*Proof.* We need to show that the relation is reflexive, symmetric, and transitive. Let $x\in G$. Then $xx^{-1} = e\in H$ (since $H$ is a subgroup, hence contains $e$), so $x\equiv_H x$.

Now let $x,y\in G$, and suppose that $x\equiv_H y$; we want to show that $y\equiv_H x$ holds as well. Since $x\equiv_H y$, then $xy^{-1}\in H$. Since $H$ is a subgroup, it is closed under taking inverses, so $(xy^{-1})^{-1} = (y^{-1})^{-1}x^{-1} = yx^{-1}\in H$. By defintion, this means that $y\equiv_H x$, as desired.

Finally, suppose that $x,y,z\in G$ and that $x\equiv_H y$ and $y\equiv_Hz$. We want to show that $x\equiv_H z$. The first congruence implies $xy^{-1}\in H$; the second that $yz^{-1}\in H$. Since $H$ is a subgroup, it is closed under products, so $(xy^{-1})(yz^{-1})=xz^{-1}\in H$, hence $x\equiv_H z$, as desired. **QED**

Notice that the three basic properties of a subgroup are precisely needed for the three basic properties of an equivalence relation: $H$ contains the identity is used for reflexivity; $H$ is closed under inverses is used for symmetry; and $H$ is closed under products is used for transitivity.

Now, since $\equiv_H$ is an equivalence relation on $G$, by the Fundamental Theorem of Equivalence Relations, $\equiv_H$ induces a partition on $G$; that is, $G$ is broken up into disjoint parts, one for each equivalence class. Our next goal is to figure out if we have some description of the equivalence classes that is independent of the equivalence relation (this is very useful in general). Indeed, we do:

**Theorem.** Let $G$ be a group and let $H$ be a subgroup; let $x\in G$. The equivalence class of $x$ under the relation $\equiv_H$ is equal to the set $Hx = \{hx\mid h\in H\}$. That is,

$$[x]_H = \{y\in G\mid x\equiv_Hy\} = \{hx\mid h\in H\} = Hx.$$

*Proof.* We need to show that each element in $Hx$ is in $[x]_H$, and that each element in $[x]_H$ is in $Hx$.

Let $z\in Hx$; that means that $z = hx$ for some $h\in H$. Then

$$xz^{-1} = x(hx)^{-1} = x(x^{-1}h^{-1}) = h^{-1}\in H,$$

so by definition we have that $x\equiv_H z$. Thus, if $z\in Hx$, then $z\in[x]_H$. So $Hx\subseteq[x]_H$.

Conversely, let $y\in [x]_H$. Then $x\equiv_H y$, so $xy^{-1}\in H$. Thus, there exists $h\in H$ such that $xy^{-1}=h$. Multiplying on the right by $y$ we get $x=hy$, and multiplying on the left by $h^{-1}$ we get $h^{-1}x = y$. Since $h^{-1}\in H$, we get $y = h^{-1}x \in Hx$. Thus, if $y\in[x]_H$ then $y\in Hx$, so $[x]_H\subseteq Hx$.

Putting the two inclusions together, we conclude that $[x]_H = Hx$ for each $x\in G$. **QED**

**Corollary.** Let $G$ be a group, $H$ a subgroup. Then:

- $Hx$ is nonempty for each $x\in G$.
- $\displaystyle G = \mathop{\cup}_{x\in G} Hx$.
- For all $x,y\in G$, if $Hx\cap Hy\neq\emptyset$, then $Hx=Hy$.

*Proof.* This follows from the fact that since the sets of the form $Hx$ are exactly the equivalence classes of the equivalence relation $\equiv_H$, they form a partition of $G$. **QED**

**Corollary.** Let $G$ be a group, $H$ a subgroup. For all $x,y\in G$, $x\equiv_H y$ if and only if $Hx = Hy$.

We give the sets of the form $Hx$ a name:

**Definition.** Let $G$ be a group, $H$ a subgroup, and $x\in G$. The set

$$Hx = \{ hx\mid h\in H\}$$

is called the **right coset of** $x$ **modulo** $H$.

“Coset” is short for “congruence set”, because the right coset is exactly the set of all things that are congruent on the right to $x$ modulo $H$.

In general, when you have an equivalence relation, the equivalence classes can have different sizes. But not so with these equivalence relation: because they are obtained by taking all possible products with elements of $H$, all equivalence classes are bijectable.

**Theorem.** Let $G$ be a group and $H$ a subgroup. Let $x,y\in G$ be any two elements. Then there is a bijection between the sets $Hx$ and $Hy$, given by

\begin{align*}

\psi\colon Hx &\to Hy\\

hx&\mapsto hy

\end{align*}

*Proof.* To show that $\psi$ is one-to-one, let $hx,h'x\in Hx$ be such that $\psi(hx)=\psi(h'x)$. Then $hy = h'y$. Multiplying on the right by $y^{-1}$, we get $h=h'$, so $hx=h'x$. Thus, $\psi$ is one-to-one.

To show $\psi$ is onto, let $hy\in H$. Then $hx\in Hx$, and $\psi(hx)=hy$. Thus, $\psi$ is one-to-one and onto, so it is a bijection. **QED**

**Now,** let’s assume that $G$ is finite, and $H$ is a subgroup. Then the equivalence relation $\equiv_H$ partitions $G$ into equivalence classes; each equivalence class is of the form $Hx$ for some $x\in G$, and by the previous theorem, they are all bijectable with one another, so they all have the same size, $k$. If there are $m$ distinct equivalence classes, each of size $k$, and they partition $G$, then the size of $G$ is the sum of the sizes of the distinct equivalence classes; that is, $|G|=mk$.

But what is $k$? $k$ is the size of the equivalence classes; they are all the same size. In particular, the equivalence class $He$ has size $k$. But what is $He$? Well,

$$He = \{ he\mid h\in H\} = \{h\mid h\in H\} = H.$$

That is, $He = H$, so that $H$ itself has size $k$.

Since $|G|=mk = m|H|$, that means that $|H|$ divides $|G|$. That is:

**Corollary [Lagrange’s Theorem].** If $G$ is a finite group, and $H$ is a subgroup, then the size of $H$ divides the size of $G$.

You might ask if you can define a “congruence on the left”; yes, you can. We say $x$ and $y$ are congruent on the left modulo $H$ if $x^{-1}y\in H$, and we write $x{}_H\equiv y$. If we proceed as above, then we get that the equivalence class of $x$ modulo $H$ on the left is $xH$ (instead of $Hx$); the process is completely analogous; these are called **left** cosets of $H$. Turns out that there is a bijection between left and right cosets. One is tempted to define the bijection by sending the coset $xH$ to the coset $Hx$, but it turns out that this is not well defined (you can have $xH = yH$, but also have $Hx\neq Hy$). However, mapping $xH$ to the coset $Hx^{-1}$ works out (I’ll leave it to you to work it out), so that the number of left cosets and the number of right cosets of $H$ in $G$ are the same, and the size of any left coset is the same as the size of any right coset of $H$. In general, the equivalence relation “congruent on the left modulo $H$” is **not the same** as the equivalence relation “congruent on the right modulo $H$”; the case when they *are* the same is interesting in its own right, and corresponds to the case when $H$ is a *normal subgroup*, which has a lot of important consequences all of its own that you will no doubt discover soon.

I cannot yet write comments, so I’ll write an answer.

Have you tried reading:

http://en.wikipedia.org/wiki/Lagrange%27s_theorem_(group_theory)

Maybe what you find confusing is that left cosets are not subgroups, just subsets of the group. You don’t give many clues about your actual concerns…

- Pointwise limit of convolution
- Proof that a perfect set is uncountable
- Which rings containing the complex field are, as vector spaces over that field, isomorphic to $\mathbb{C}^2$?
- Expected number of rolls
- Show that $f$ is uniformly continuous if limit exists
- How to calculate relative error when true value is zero?
- Why does the sign have to be flipped in this inequality?
- What does insolvability of the quintic mean exactly?
- Finding minimal form — Velleman exercise 1.5.7a
- combinatorial geometry: covering a square
- Good Number Theory books to start with?
- Why can we use the division algorithm for $x-a$?
- Why is $e^\pi – \pi$ so close to $20$?
- Can we create a measure for infinitely countable sets with respect to eachother?
- Is there a more efficient method of trig mastery than rote memorization?