The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+2 votes

Let $G$ be a finite group and $H$ be a subgroup of $G$. For $a \in G$, define $aH=\left\{ah \mid h \in H\right\}$.

  1. Show that $|aH| = |H|$

  2. Show that for every pair of elements $a, b \in G$, either $aH = bH$ or $aH$ and $bH$ are disjoint

  3. Use the above to argue that the order of $H$ must divide the order of $G$

asked in Set Theory & Algebra by Veteran (59.5k points) | 281 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

37,996 questions
45,492 answers
48,590 users