Codex @codex  0

The centralizer of an element $x$ of a group $G$ consists of all elements that commute with $x$:It is the stabilizer subgroup of $x$ under the conjugation action, hence a subgroup of $G$. In conjugacy classes of the symmetric group on three letters, the three representative computations areFor the transposition $(12)$, a commuting permutation must preserve the exchanged pair $\{1,2\}$ and fix $3$; only $e$ and $(12)$ do so. For $r=(123)$, a commuting permutation is determined by where it sends $1$: the equation $g(r(i))=r(g(i))$ forces the images of $2$ and $3$, leaving exactly $e,r,r^2$. For $e$, every permutation commutes. These centralizer sizes $6,2,3$ give conjugacy class sizes $1,3,2$.

The centralizer is useful because it measures how much freedom remains after fixing one operation. Its index of a subgroup counts the distinct results of conjugation, and the intersection of all element centralizers is the center of a group. A centralizer need not be an abelian group: $C_G(e)=G$ even when $G$ is a nonabelian group. In an abelian group, all element centralizers equal $G$. These observations also explain why the surrounding group matters: the centralizer of $(123)$ inside the alternating group $A_3$ is the whole $A_3$, whereas its centralizer inside $S_3$ is a proper subgroup. See McKernan, the centralizer definition preceding lemma 23.6.

For an arbitrary subset $A\subseteq G$, the centralizer of a subset fixes every element of $A$ individually under the conjugation action:This is a pointwise stabilizer of the elements of $A$, not of the vertices of a polygon in a geometric realization. In particular, $r=(123)$ belongs to $C_{S_3}(r)$ although its rotation moves every vertex of a polygon of the equilateral triangle. If $A$ generates a subgroup $H$, commuting with every element of $A$ implies commuting with every product of those elements and their inverse elements; hence $C_G(A)=C_G(H)$. For the triangle rotation subgroup $H=⟨r⟩$, this gives $C_{S_3}(H)=C_{S_3}(r)=H$.

To see the commutation test directly on the equilateral triangle, compare a rotation $r$ with the reflection $s=(12)$. Their permutations satisfyThe two orders send vertex of a polygon $1$ to different places: $rs(1)=3$, but $sr(1)=1$. Thus $s\notin C_{S_3}(r)$. By contrast $r$ and $r^2$ commute, with $r{r}^2=r^{2}r=e$. The reflection reverses the chosen rotation while preserving the subgroup of all triangle rotations, so $s\in N_{S_3}(H)$. The distinction is visible before any counting: commuting preserves an operation itself; membership in the normalizer permits exchanging it with another operation in the same subgroup.

For a subgroup $H$ of a group $G$ and $g\in G$, the conjugate subgroup is the conjugate subsetIt is a subgroup because conjugation is a group automorphism. Restricting that group automorphism gives a group isomorphism from $H$ to $gH{g}^{-1}$, so conjugate subgroups have the same group order. This describes the same operations after moving their reference configuration. Conjugacy of subgroups is an equivalence relation. ^[ref]

For an equilateral triangle with vertices of a polygon labeled $1,2,3$ counterclockwise, its symmetry group is the symmetric group $S_3$, also the dihedral group of group order six. Let $r=(123)$ be the counterclockwise rotation through $120$ degrees, and let $s=(12)$ be the reflection fixing vertex of a polygon $3$. Products apply the rightmost permutation first. The cyclic subgroup $K=⟨s⟩=\{e,(12)\}$ contains the identity element and one reflection. Relabeling a transposition by conjugation givesThus the conjugation action moves $K$ among the three subgroups $⟨(12)⟩$, $⟨(23)⟩$, and $⟨(13)⟩$. Geometrically, the rotation moves the axis of the reflection to the next axis. Each reflection fixes a different vertex of a polygon, although group isomorphisms relate all three subgroups.

The normalizer tells when this change of reference leaves the subgroup unchanged. For any group $G$ and subgroup $H\le G$, there is a bijectionTwo choices $g,k$ give the same conjugate subgroup exactly when $k^{-1}g\in N_G(H)$. Consequently the index of a subgroup $[G:N_G(H)]$ counts the distinct conjugate subgroups, even for an infinite group. For a finite group the count is $|G|/|N_G(H)|$. These are cosets; they need not form a quotient group, since $N_G(H)$ need not be a normal subgroup of $G$. In the triangle example there are $6/2=3$ conjugate subgroups, while the cyclic subgroup $⟨r⟩$ has only one. ^[ref]

For a subgroup $H\le G$ of a group $G$, a left coset is $gH=\{gh:h\in H\}$; a right coset is $Hg=\{hg:h\in H\}$. The name refers to the side on which the representative $g$ multiplies $H$. Think of a coset as a translated copy of a subgroup: it remembers the relative differences allowed by $H$, while moving the whole collection to another location in the group.

Two left cosets of the same subgroup are either equal or disjoint. Thus distinct left cosets form a partition of a set covering $G$; the same statement holds separately for right cosets. The useful membership test isThis also defines an equivalence relation: changing a representative by right multiplication with a member of $H$ leaves its left coset unchanged. These facts hold even for infinite groups. See MIT's coset notes, definitions 3.6 and 3.9.

For an explicit additive example, take the cyclic group $G=\mathbb{Z}/6\mathbb{Z}$, with modular arithmetic, and the subgroup $H=\{0,3\}$. Adding each representative to both members gives exactlyRepresentatives $3,4,5$ repeat these three cosets, respectively. For example, $4+H=\{4,1\}=1+H$, since $4-1=3\in H$. Every residue appears once in the displayed partition of a set. Each coset has two members, so the group order of $H$ is $2$ and its index of a subgroup is $3$. Left and right cosets coincide here because $G$ is an abelian group.

A coset need not be a subgroup. In this example, $\{1,4\}$ lacks the identity element $0$, and $1+1=2$ leaves it. In fact, the only left or right coset of $H$ that is a subgroup is $H$ itself: a subgroup must contain the identity element, and the coset containing that element is $H$. Equal sizes come instead from the bijection $h\mapsto gh$, whose inverse is $x\mapsto g^{-1}x$; for right cosets, use $h\mapsto hg$ and $x\mapsto x{g}^{-1}$.

The nonabelian group $S_3$, the symmetric group on three letters, separates the two sides. Use function composition with the rightmost permutation applied first, and let $H=\{e,(12)\}$. Then $(13)(12)=(123)$ but $(12)(13)=(132)$, giving the differing pairThe complete partition of a set into left cosets consists of $H$, $\{(13),(123)\}$ and $\{(23),(132)\}$; the complete partition of a set into right cosets consists of $H$, $\{(13),(132)\}$ and $\{(23),(123)\}$. Each lists all six permutations exactly once. Both have three parts of size two, although their parts differ.

Left cosets support a group action by $a\cdot (gH)=(ag)H$ for every subgroup, as in the coset action. Multiplication of representatives defines a quotient group operation $(aH)(bH)=(ab)H$ precisely when $H$ is a normal subgroup. Otherwise the answer can depend on the representatives: in this $S_3$ example, $e$ and $(12)$ represent the same coset $H$, yet $e(13)H=(13)H$ and $(12)(13)H=(23)H$ differ. In the additive example, $H$ is a normal subgroup, making $(1+H)+(2+H)=3+H=H$ valid. See MIT's quotient-group notes, theorem 9.1.

A group acts on the left cosets of a subgroup by left multiplication; its kernel is the core of that subgroup.

Let $H\le G$ be a subgroup. The notation $G/H$ here means the set of left cosets $\{aH:a\in G\}$, even when $H$ is not a normal subgroup. DefineThis gives a group action without needing a quotient group structure on $G/H$.^[ref]

The representative check is essential: if $aH=bH$, then $a=bh$ for some $h\in H$, and $(ga)H=(gbh)H=(gb)H$. Thus equal input cosets give equal output cosets. The identity element fixes every coset, and associativity gives $g_1\cdot (g_2\cdot aH)=(g_1{g}_2)\cdot aH$. Each induced map is a permutation, with inverse induced by $g^{-1}$. This is a transitive group action because $b{a}^{-1}$ sends $aH$ to $bH$.

The stabilizer subgroup of $H$ is $H$ itself. At a general coset, the stabilizer subgroup and the group kernel areConsequently the coset action is a faithful group action exactly when the subgroup core is trivial.^[ref]

Indeed, $g\cdot (aH)=aH$ exactly when $a^{-1}ga\in H$, or $g\in aH{a}^{-1}$. Intersecting these membership conditions over all cosets gives the group kernel. Conjugation permutes the subgroups in this intersection, making it a normal subgroup of $G$ contained in $H$. Conversely, any normal subgroup of $G$ contained in $H$ lies in every $aH{a}^{-1}$. This explains why the subgroup core is the largest such normal subgroup: it is exactly the portion of $H$ invisible at every label, rather than merely at the label $H$.

For a normal subgroup $H$, every $aH{a}^{-1}$ equals $H$, so $\ker {\rho }_H=H$. For $H=\{e\}$, the construction is the regular group action behind Cayley's theorem. Between these extremes, a nontrivial subgroup with trivial subgroup core can give a faithful group action on fewer labels. If the index of a subgroup is finite, $[G:H]=n$, the first isomorphism theorem givesThus a subgroup of small index of a subgroup exposes a small permutation group associated with $G$. The two examples below and in nonfaithful coset action of the symmetric group on three letters show exactly which information can survive.

For finite-index subgroups $H,K$ of a group $G$, the map of sets of left cosetsis well defined and injective: equality of both components is equivalent to the difference $g^{\prime -1}g$ belonging to $H\cap K$. Hence the displayed subgroup index bound holds, without a normal subgroup hypothesis. By mathematical induction, the index of a subgroup for a finite intersection is at most the product of the individual subgroup indices.

A finitely generated group has only finitely many subgroups of any prescribed index of a subgroup $n$. Every such subgroup is a point stabilizer for a transitive action on $n$ points, while a homomorphism from a finitely generated group to the finite symmetric group $S_n$ has only finitely many possible images of the generators.

Up to group isomorphism, the finite groups with at most six elements are the trivial group, the cyclic groups $C_2,C_3,C_4,C_5,C_6$, the Klein four-group $C_2\times C_2$, and the symmetric group $S_3$.

A group of prime cardinality is a cyclic group, since Lagrange's theorem forces any nonidentity element to generate it. For four elements, either an element has order of a group element four, or every nonidentity element is an involution. In the latter case the group of exponent two is abelian identity shows that two distinct nonidentity elements $a,b$ generate $\{e,a,b,ab\}\cong C_2\times C_2$.

For a group of order six, either an element generates it or some element $a$ has order of a group element three: otherwise all nonidentity elements would be involutions, producing a four-element subgroup in contradiction with Lagrange's theorem. Pairing each element with its inverse element gives an involution $b$ outside $⟨a⟩$. The subgroup $⟨a⟩$ has index of a subgroup two and is a normal subgroup, so $ba{b}^{-1}=a$ or $a^{-1}$. The commuting case makes $ab$ have order of a group element six, whereas the second case gives the multiplication rules of $S_3$ on the six distinct elements $a^i,a^{i}b$, $0\le i<3$.

All these groups embed in $S_4$ except $C_5$ and $C_6$. The former is excluded by Lagrange's theorem; the latter is excluded because the disjoint cycle decomposition of a permutation of four letters cannot have least common multiple of cycle lengths equal to six.

For a square integer matrix $A$ with nonzero determinant, the image $A{\mathbb{Z}}^n$ is a subgroup of the integer lattice. Its index of a subgroup isIn particular, $A=\mathrm{diag}(2,1)$ gives all points with even first coordinate. The quotient has two cosets, represented by $(0,0)$ and $(1,0)$, and the fundamental cell has area two. A determinant of two therefore counts how much integer information is missing from the image.

The integrality hypothesis is essential. The rational matrix $R=\mathrm{diag}(2,1/2)$ has determinant one but sends $(0,1)$ to $(0,1/2)$. Its generated Euclidean lattice has the same covolume as ${\mathbb{Z}}^2$ without being the same integer lattice. The unimodular matrix criterion combines an arithmetic condition with a geometric one.

A short proof of the index formula uses Smith normal form. Write $PAQ=\mathrm{diag}(d_1,\dots ,d_n)$, with $P,Q$ unimodular matrices and positive integers $d_i$. They preserve the relevant integer structure, so the quotient has the same size as ${\prod }_i\mathbb{Z}/d_i\mathbb{Z}$, namely ${\prod }_i{d}_i=|\det A|$. No assumption that the matrix is orthogonal or its basis vectors are short is needed.

For a finite group $G$ and a subgroup $H$, the group order of $H$ divides the group order of $G$:Here $[G:H]$ is the index of a subgroup, the number of distinct left cosets. It is also the number of distinct right cosets: inversion gives a bijection $gH\mapsto H{g}^{-1}$ between the two collections. No normal subgroup assumption is needed for Lagrange's theorem. The normal subgroup condition matters when constructing a quotient group, rather than when counting a partition of a set.

The beauty of Lagrange's theorem is that an arithmetic restriction follows from a structural picture. A group can be tiled by equal-sized cosets of any subgroup. To see the count, choose one representative from each left coset. Every group element has exactly one expression $g_{i}h$ for these chosen representatives and $h\in H$: different rows do not overlap, and multiplication by $g_i$ is a bijection from $H$ to its row. Counting rows times row size gives the formula. See MIT's symmetries notes, section 2.

The additive cyclic group $\mathbb{Z}/6\mathbb{Z}$ above gives $6=3\times 2$ from $H=\{0,3\}$. Another subgroup, $K=\{0,2,4\}$, has cosets $K$ and $1+K=\{1,3,5\}$, giving $6=2\times 3$. In $S_3$, the subgroup $\{e,(12)\}$ also gives $6=3\times 2$, despite its distinct left and right coset partitions. Thus equal row sizes persist in a nonabelian group. A proposed subgroup of size four in either group is impossible: four does not divide six. This filters possible subgroups before any search for group generators.

Apply Lagrange's theorem to the cyclic subgroup generated by a group element $g$. Its size is the order of a group element, so $\mathrm{ord}(g)\mid |G|$ and $g^{|G|}=e$. In the additive example, $2$ has order of a group element $3$, since $2+2+2=0$ modulo six; the corresponding multiplicative statement becomes $6\cdot 2=0$. A group of prime group order is consequently a cyclic group: any nonidentity group element generates a subgroup whose size is greater than one and divides that prime, forcing it to be the whole group. See MIT's cyclic-group notes. The same counting idea underlies the orbit-stabilizer theorem: the orbit of a group action is parametrized by cosets of its stabilizer subgroup.

Historically, Lagrange's theorem grew from investigations of permutations of roots of a polynomial; see St Andrews' account of Lagrange's early work. The modern statement about arbitrary finite groups should not be read back into the early work. Carmichael's 1921 review explicitly cautioned against attributing the full result to Lagrange; see Carmichael's historical note, reproduced by St Andrews. Finally, Lagrange's theorem supplies a necessary size condition; the failure of the converse to Lagrange's theorem below explains its limit.

For a group action of any group $G$ on a set $X$, the cardinality of the orbit of a group action through $x$ is the index of a subgroup of its stabilizer subgroup:In particular, if $G$ is a finite group,For a fixed finite group, a larger stabilizer subgroup means a smaller group orbit: more transformations repeat the same image of $x$. The set $X$ itself need not be finite.

The underlying bijection uses left cosets, without requiring $G_x$ to be a normal subgroup:To check it briefly, replacing $g$ by $gh$ with $h\in G_x$ preserves $g\cdot x$, so $\Phi$ is well-defined. Every member of the group orbit has this form. Finally, $g\cdot x=k\cdot x$ implies $k^{-1}g\in G_x$, hence $g{G}_x=k{G}_x$, proving the bijection. This is the construction in MIT's group-action notes, lemma 23.5. For infinite groups, the bijection and the cardinality statement $|Gx|=[G:G_x]$ still hold; division of infinite cardinalities does not supply the finite formula.

For the eight-element dihedral group $D_4$ acting on the square described under group action, moving a marked vertex of a polygon gives $8=4\cdot 2$. Moving a marked side of a polygon also gives $8=4\cdot 2$; moving one unoriented diagonal of a polygon gives $8=2\cdot 4$; moving the centroid gives $8=1\cdot 8$. These are four different group actions, each with one group orbit. In the first group action, the four left cosets of $H=G_A=\{e,s\}$ areThey correspond respectively to $A,B,C,D$. Counting all eight transformations would count each position of the marked vertex of a polygon twice.

For a second computed example, let the symmetric group $S_3$ act on the Cartesian product $X=\{1,2,3{\}}^2$ by $\sigma \cdot (i,j)=(\sigma (i),\sigma (j))$. There are two orbits of a group action:andThe first stabilizer subgroup can exchange $2$ and $3$ while fixing $1$; the second must fix both $1$ and $2$, so also fixes $3$. The orbit-stabilizer theorem gives $6=3\cdot 2$ and $6=6\cdot 1$, and the two group orbit sizes account for all nine ordered pairs. The general reason for exactly these two group orbits is equality-pattern orbits of ordered pairs.

The order of a finite group is its cardinality, written $|G|$. The identity element is included: $|\mathbb{Z}/6\mathbb{Z}|=6$, and the trivial group has order one, rather than zero.

Keep this count distinct from the order of a group element. In the additive finite cyclic group $\mathbb{Z}/6\mathbb{Z}$, the element $1$ has order six, $2$ has order three, $3$ has order two, and $0$ has order one. Each element's order is the least positive number of repetitions needed to return to the identity element $0$. The order of an element of a finite cyclic group computes these periods directly.

The count also constrains subgroups: Lagrange's theorem gives $|G|=[G:H]|H|$ for a subgroup $H$ of a finite group $G$, where the index of a subgroup counts its cosets. For $H=\{0,2,4\}$ inside $\mathbb{Z}/6\mathbb{Z}$, the two cosets are $\{0,2,4\}$ and $\{1,3,5\}$, so $6=2\cdot 3$. Divisibility is a necessary constraint; it does not imply that every divisor occurs as the order of a group element, as the Klein four-group shows.

Move the nonidentity rational 2-torsion point to $T=(0,0)$ and complete the square. After a rational change of coordinates, the elliptic curve has an integral modelThe two-isogeny formula gives a partnerand the isogeny of elliptic curves and its dual isogeny areBoth extend at the exceptional points; their kernels are the identities and the distinguished 2-torsion points, and $\hat{\varphi }\varphi =[2]$.

The two-torsion square-class homomorphism is $\alpha (O)=1$, $\alpha (T)=[b]$, and $\alpha (x,y)=[x]$ otherwise, with values in ${\mathbb{Q}}^{\ast }/{\mathbb{Q}}^{\ast 2}$. Its kernel is $\hat{\varphi }{E}^{\prime }(\mathbb{Q})$. Define ${\alpha }^{\prime }$ on the partner in the same way. By the prime-support bound in two-isogeny descent, representatives are signed squarefree divisors $d$ of $b$, or of $b^{\prime }$ for the partner. A class is realized precisely when its quartic covering in a two-isogeny descent has a rational solution:For $UV\ne 0$, this comes from $x=d(U/V{)}^2$ and $y=dUN/V^3$; the cases $U=0$ or $V=0$ account for the distinguished point and the identity. Test this finite list using signs and local congruences, and exhibit rational solutions for the surviving classes. The local-to-global gap in isogeny descent matters: local solubility gives an upper bound from the isogeny Selmer group, so a rank determination requires matching actual classes or further descent, not merely declaring every locally soluble cover to have a rational point.

Once the two actual images are determined, the two-isogeny rank formula isFor completeness, put $A=E(\mathbb{Q})$ and $B=E^{\prime }(\mathbb{Q})$. The Mordell-Weil theorem gives $[A:2A]=2^r|A[2]|$. The index of a subgroup formula through $\hat{\varphi }B$ givesHere $\ker \hat{\varphi }\cap \varphi A=\varphi (A[2])$, since $\hat{\varphi }\varphi =[2]$, and this image has size $|A[2]|/2$. The denominator is therefore $4/|A[2]|$, proving the displayed rank of an elliptic curve formula.

Choose an integral Minimal Weierstrass equation over ${\mathbb{Z}}_p$. Let $E_0({\mathbb{Q}}_p)$ be the points with nonsingular reduction, and let $E_1({\mathbb{Q}}_p)$ be those reducing to $O$. This distinction matters at bad reduction of an elliptic curve: the whole singular reduced cubic is not a group. The smooth locus is a group under the induced elliptic curve group law, and Hensel's lemma lifts each of its rational points, givingThe formal kernel of a minimal Weierstrass equation identifies $E_1({\mathbb{Q}}_p)$ with $p{\mathbb{Z}}_p$ equipped with $F$. Indeed, the integral series $w(t)$ converges there, and $x=t/w(t)$, $y=-1/w(t)$ give the unique point for each nonzero parameter. If $v_p(t)=r>0$, then $v_p(x)=-2r$ and $v_p(y)=-3r$; the parameter zero gives $O$. Conversely a point reducing to $O$ has these local coordinates of positive valuation, so is recovered by the series.

Define $E_m$ for $m\ge 1$ by $t\in p^m{\mathbb{Z}}_p$. The linear part of the formal group law is addition, and the higher terms have degree at least two. Hence the filtration of elliptic-curve points over a local field hasAt good reduction, $E_0=E$ and $E/E_1\cong \tilde{E}({\mathbb{F}}_p)$. At bad reduction, there is also the finite quotient $E/E_0$: $E({\mathbb{Q}}_p)$ is a compact group because the curve is projective, and $E_0$ is an open subgroup, so its index of a subgroup is finite. Together these quotients and the formal filtration describe the group, including the extra components at bad primes.

The formal logarithm makes the deepest part explicit. Write $L(T)=T+{\sum }_{n\ge 2}{c}_n{T}^n$. Since its derivative is the integral invariant differential of a formal group law, $n{c}_n\in {\mathbb{Z}}_p$. ConsequentlyThe inequality $v_p(n)\le (n-1)/(p-1)$ shows that for an integer $m>1/(p-1)$ every nonlinear term on $p^m{\mathbb{Z}}_p$ has strictly higher valuation than the linear term. After scaling, $L$ is the identity plus a strictly contracting series; solving $L(t)=u$ by successive correction gives its inverse formal group exponential. Thus the deep logarithm subgroup of a formal group givesOne may take $m=1$ for odd $p$ and $m=2$ for $p=2$. In particular, $E({\mathbb{Q}}_p)$ contains an open subgroup isomorphic to the additive p-adic integers, and the remaining information is in finite quotients and their group extensions.

Suppose $G$ is generated by $d$ elements. An index of a subgroup $n$ gives a transitive action of $G$ on $n$ cosets. After labelling them by $1,\dots ,n$, this is a homomorphism $G\to S_n$, and the subgroup is the stabilizer of one label. There are at most $(n!{)}^d$ homomorphisms, since images of the generators determine the map, and at most $n$ point stabilizers for each map. Thus there are finitely many subgroups of each specified finite index, with the coarse bound $n(n!{)}^d$.

The finite residual isIt is equivalently the intersection of the kernels of all homomorphisms to finite groups. Intersecting all finite-index subgroups gives the same subgroup, since each contains its normal core, a normal subgroup of finite index. A residually finite group is one with $R_G=1$, equivalently every nonidentity element survives in a finite image.

A Hopfian group is one whose surjective endomorphisms are all injective, hence automorphisms. Let $\theta :G\to G$ be surjective, retaining the finite-generation hypothesis. For each $n$, pulling back by $\theta$ sends a normal subgroup of index $n$ to another normal subgroup of the same index. It is injective on this finite set: equality of two preimages implies equality of the subgroups because $\theta$ is surjective. Therefore it is a permutation. For every finite-index normal subgroup $N$, some $m\ge 1$ satisfiesIt follows that $\ker \theta \subseteq \ker {\theta }^m\subseteq N$. Intersecting over $N$ proves finite residual contains surjective endomorphism kernels:If $G$ is also a residually finite group, this forces every surjective endomorphism to have trivial kernel, proving that a finitely generated residually finite group is Hopfian.

For the specified Baumslag-Solitar group, use the convention $[x,y]=xy{x}^{-1}{y}^{-1}$ and writeIn the abelianization, the defining relation gives $2a=3a$, so the image of $a$ is zero, while $t$ generates an unrestricted infinite cyclic group. Thus $G/G^{\prime }\cong \mathbb{Z}$ through the exponent sum of $t$. The kernel is generated by all $a_i$: any word can be rewritten as a product of conjugates of $a$ followed by the final power of $t$. Alternatively $a=[t,a^2]\in G^{\prime }$, so all $a_i\in G^{\prime }$, while killing them leaves a cyclic quotient. Therefore

Define $\theta (a)=a^2$ and $\theta (t)=t$. This respects the defining relation becauseThe image contains $a^2$, $t$, and $t{a}^2{t}^{-1}=a^3$, hence contains $a=a^3(a^2{)}^{-1}$ and is all of $G$. It is not injective. Indeedmaps to $[a^3,a^2]=1$. But it is a reduced word in the HNN extension with associated subgroups $⟨a^2⟩$ and $⟨a^3⟩$. Its potential subwords $t{a}^{\pm 1}{t}^{-1}$ do not have even exponent, and its potential subword $t^{-1}at$ does not have exponent divisible by three. It has no pinch in an HNN extension, so Britton's lemma gives $c\ne 1$. We have explicitly exhibited a surjective, noninjective endomorphism.

It remains to treat the whole second commutator subgroup, not just this one kernel element. SetThese kernels form an increasing sequence of normal subgroups, so $K$ is a normal subgroup. Every iterate is surjective, and the preceding finite residual argument gives $K\subseteq R_G$.

Conjugating the defining relation gives $a_{i+1}^2=a_i^3$ for every integer $i$. Repeated substitution gives, for $j>i$,Also ${\theta }^k(a_i)=a_i^{2^k}$. Thus when $k\ge j-i$,Every pair of the generating elements of $G^{\prime }$ therefore commutes modulo $K$. The image of $G^{\prime }$ in $G/K$ is abelian, which means $G^{\prime \prime }\subseteq K$. This proves the full statement using iterated endomorphism kernels in BS(2,3):

Apply part (i) with $S=L$ and use multiplicativity of the index of a subgroup along a subgroup chain:Thus the intersection of two finite-index subgroups again has finite index.

The map between left-coset setsis well defined and injective: equality of the images is equivalent to $s_2^{-1}{s}_1\in H$, and this element already lies in $S$. These are coset sets, not asserted quotient groups, since $H$ need not be normal. Thus the index of a subgroup satisfies

Interpret the printed congruence entrywise in the integer lattice:It then defines the usual level-two principal congruence subgroup of ${\mathrm{SL}}_2(\mathbb{Z})$, despite the PDF's ambient ${\mathrm{SL}}_2(\mathbb{R})$. A literal ideal congruence inside $\mathbb{R}$ would be vacuous because $2\mathbb{R}=\mathbb{R}$, and would make the asserted conclusion false. The integer-lattice interpretation is essential.

Pass to $\overline{\Gamma (2)}=\Gamma (2)/\{\pm I\}$, which has exactly the same action. Reduction modulo two maps the modular group onto ${\mathrm{SL}}_2({\mathbb{F}}_2)$, a group of order six: the reductions of $S$ and $T$ generate it. Its kernel is $\overline{\Gamma (2)}$, so the index of a subgroup is six. The standard fundamental domain of the modular group has hyperbolic area $\pi /3$, and hence the quotient has hyperbolic area $2\pi$.

There are no nonidentity elliptic Möbius transformations in $\overline{\Gamma (2)}$. An integral matrix representing an elliptic Möbius transformation has trace $0$ or $\pm 1$. Here the trace is even, excluding $\pm 1$; trace zero would give $d=-a$ and $1=-a^2-bc\equiv -1(\mathrm{mod}4)$, impossible. Thus the effective action is a free properly discontinuous group action, and the quotient is a Riemann surface.

A cusp of a modular group is represented by a rational boundary point. Their orbits correspond towhich has $6/2=3$ elements. They are represented by $\infty ,0,1$, or by the three nonzero parity vectors of a primitive numerator-denominator pair. Each width of a cusp is two. A union of six copies of the standard fundamental domain of the modular group gives a fundamental region for this subgroup. Removing small horocycle neighbourhoods of its cusps leaves a compact core. Adding one point at each cusp of a modular group, using the local parameter $e^{\pi iz}$ after moving that cusp to infinity, gives a compact Riemann surface $\overline{X}$.

For a finite-area hyperbolic surface of genus $g$ with $r$ cusps, the Gauss-Bonnet theorem gives area $2\pi (2g-2+r)$. Thus $2\pi =2\pi (2g-2+3)$ and $g=0$. A compact genus-zero Riemann surface is the Riemann sphere, by the uniformization theorem. A Möbius transformation sends the three added points to $0,1,\infty$. Restricting it gives

Write $R=\mathbb{Z}[\sqrt{-13}]$ and $I=(2,1+\sqrt{-13})$. The mapis a surjective ring homomorphism: in ${\mathbb{F}}_2$, the image of $\sqrt{-13}$ is $1$ and $1^2=-13=1$. Its kernel is exactly $I$. Indeed, both generators lie in the kernel; conversely, if $a+b$ is even, thenand $a-b$ is even. Hence $R/I\cong {\mathbb{F}}_2$ and the index of a subgroup is $[R:I]=2$.

If $I=(\alpha )$ were a principal ideal, multiplication by $\alpha =a+b\sqrt{-13}$ would identify its additive lattice with a sublattice of indexThus principality would require $a^2+13b^2=2$. This Diophantine equation has no integer solution: $b=0$ would give $a^2=2$, while $b\ne 0$ makes the left side at least $13$. Therefore

The Nielsen–Schreier theorem says that every subgroup of a free group is free. Realize $F_n$ as the fundamental group of the rose $R_n$, the graph with one vertex and $n$ oriented loops. A subgroup $H\le F_n$ of finite index of a subgroup $d$ corresponds to a connected $d$-sheeted covering graph $X\to R_n$. The graph $X$ has $d$ vertices and $dn$ unoriented edges. Choosing a spanning tree leavesedges outside the tree, and these freely generate ${\pi }_1(X)\cong H$. Thus the Nielsen–Schreier formula is

A Sylow subgroup of a finite group $G$ is a subgroup whose order is the largest power of a prime $p$ dividing $|G|$. The Sylow theorems say that such subgroups exist, that every $p$-subgroup lies in one, that all Sylow $p$-subgroups are conjugate, and that their number $n_p$ divides $|G|/p^a$ and obeys $n_p\equiv 1(\mathrm{mod}p)$.

For the last congruence, let one Sylow $p$-subgroup $P$ act by conjugation on the set of all Sylow $p$-subgroups. Every orbit other than a fixed point has size divisible by $p$. If $Q$ is fixed, then $P,Q\le N_G(Q)$. They are Sylow subgroups of this normalizer, so they are conjugate within $N_G(Q)$; because every element of $N_G(Q)$ fixes $Q$ under conjugation, this forces $P=Q$. Thus there is exactly one fixed point and $n_p\equiv 1(\mathrm{mod}p)$.

Now let $H<A_n$ have index $m$ with $1<m<n$. The coset action gives a homomorphismIts kernel is a normal subgroup of the simple group $A_n$. It cannot be all of $A_n$, since the action is transitive and nontrivial, so it is trivial. This would embed $A_n$ into $S_m$, contrary to $|A_n|=n!/2>m!=|S_m|$. Hence no such subgroup exists.

Suppose finally that a group $G$ of order $90$ were simple. The Sylow count satisfiesand simplicity excludes $n_5=1$, so $n_5=6$. Conjugation on these six subgroups gives a nontrivial homomorphism $G\to S_6$, which simplicity makes injective. Its image lies in $A_6$, because the composite with the sign homomorphism $S_6\to \{\pm 1\}$ must be trivial. It would therefore be a subgroup of $A_6$ of index $360/90=4$, contradicting the result just proved. Thus