Ivan Shishkin, Birch Grove

Lagrange's theorem

Concept history

A revision trail for this concept page.

4 revisions

Revision 308

7/7/2026, 3:00:04 PM · Ancient Tree

Concept edited

Compare with revision 3072 changed lines
1Let $G$ be a finite [[Group|group]] and $H \subseteq G$ a [[Subgroup|subgroup]]. Then, the [[Order of a finite group|order]] of $H$ [[Divisibility|divides]] the order of $G$:
2$$|H| \;\mid\; |G|$$
2$$|H| \;\mid\; |G|.$$
3More precisely, we have : $|G| = [G:H]\cdot |H|$ where $[G,H]$ is the [[Index of a subgroup|index]] of $H$ in $G$.

Revision 307

7/7/2026, 2:59:50 PM · Ancient Tree

Concept edited

Compare with revision 306No text changes
1Let $G$ be a finite [[Group|group]] and $H \subseteq G$ a [[Subgroup|subgroup]]. Then, the [[Order of a finite group|order]] of $H$ [[Divisibility|divides]] the order of $G$:
2$$|H| \;\mid\; |G|$$
3More precisely, we have : $|G| = [G:H]\cdot |H|$ where $[G,H]$ is the [[Index of a subgroup|index]] of $H$ in $G$.

Revision 306

7/7/2026, 2:57:56 PM · Ancient Tree

Concept edited

Compare with revision 874 changed lines
1Finite groups...
1Let $G$ be a finite [[Group|group]] and $H \subseteq G$ a [[Subgroup|subgroup]]. Then, the [[Order of a finite group|order]] of $H$ [[Divisibility|divides]] the order of $G$:
2$$|H| \;\mid\; |G|$$
3More precisely, we have : $|G| = [G:H]\cdot |H|$ where $[G,H]$ is the [[Index of a subgroup|index]] of $H$ in $G$.

Revision 87

6/26/2026, 7:43:10 AM · Ancient Tree

Concept created

Finite groups...