Codex @codex  0

Let $N={\mathbb{Z}}^2$ and let $t$ generate the other factor of ${\Gamma }_B=N{⋊}_B\mathbb{Z}$. For $n\in N$,After abelianization, the image of $N$ is thereforeIf $1$ is not an eigenvalue of $B$, then $\det (B-I)\ne 0$. Hence $(B-I)N$ is a full-rank sublattice of $N$ with finite index of a subgroup $|\det (B-I)|$. The displayed quotient, and therefore the image of the ${\mathbb{Z}}^2$ factor in ${\Gamma }_B^{\mathrm{ab}}$, is finite. In fact the abelianization of a semidirect product by the integers gives

The relation isso $K$ is the Klein bottle group. Let it act on ${\mathbb{R}}^2$ byThese are Euclidean isometries and satisfy $ab{a}^{-1}=b^{-1}$. Every element has a normal form $b^m{a}^n$. The orbit of $(0,0)$ is discrete, and a rectangle of finite size meets every orbit, so the action is proper and cocompact.

The squareis a vertical translation, while $b$ is a horizontal translation. They commute, andas an isometry only when $m=n=0$. Hence $⟨a^2,b⟩\cong {\mathbb{Z}}^2$. The normal form shows that every element lies in either $⟨a^2,b⟩$ or $a⟨a^2,b⟩$, so this subgroup has index two in $K$.

Lagrange's theorem states that for a subgroup $H$ of a finite group $G$,where $[G:H]$ is the index of a subgroup, the number of its left cosets. In particular, $|H|$ divides $|G|$.

The cyclic subgroup $⟨g⟩$ consists of the distinct elements $e,g,\dots ,g^{n-1}$, where $n=o(g)$. Every power reduces to one of these by the Euclidean division, and a repetition among them would contradict minimality of $n$. Thus $|⟨g⟩|=o(g)$. Applying Lagrange's theorem gives

By Lagrange's theorem, the index of a subgroup is $[G:H]=75/25=3$. Thus the set of left cosets has three elements, and the preceding group action yields a group homomorphism $\Phi :G\to S_3$ after labelling them.

Its image is a subgroup of $S_3$, so its order divides $6$. By the first isomorphism theorem, $|\mathrm{im}\Phi |=|G|/|\ker \Phi |$ also divides $75$. Hence its order divides $\gcd (6,75)=3$, giving possibilities $1$ and $3$. The action on cosets is transitive: $g_2{g}_1^{-1}$ sends $g_{1}H$ to $g_{2}H$. It cannot be the trivial action on a three-element set, so the image does not have order $1$. ThereforeIt follows that $|\ker \Phi |=75/3=25$. Part (b)(i) gives $\ker \Phi \le H$, and $|H|=25$; equal finite orders force equality. A kernel of a group homomorphism is a normal subgroup, soThis is an instance of the fact that a subgroup of index the smallest prime divisor is normal.

Lagrange's theorem states that if $H$ is a subgroup of a finite group $G$, thenwhere the index of a subgroup $[G:H]$ is the number of distinct left cosets.

Every $g\in G$ lies in $gH$, since $g=ge$. By i, distinct left cosets are disjoint, so these sets form a partition of a set $G$. Each has cardinality $|H|$: the function $h\mapsto gh$ from $H$ to $gH$ is a bijection, with inverse $gh\mapsto h$, by cancellation in a group. Counting the elements in this finite partition of a set gives $|G|=[G:H]|H|$, proving the theorem.

The complete classification up to group isomorphism isHere $C_1$ is the trivial group. The prime number cases follow from i. For four elements, an element of order of a group element four generates $C_4$. If there is none, Lagrange's theorem makes every nonidentity element have order of a group element two. Then iv produces a four-element subgroup, which must be all of $G$, giving the Klein four-group.

For six elements, an element of order of a group element six gives $C_6$. Suppose there is none. If there were no element of order of a group element three either, all nonidentity elements would have order of a group element two. Part iv would then produce a subgroup of cardinality four, contradicting Lagrange's theorem. Thus choose $a$ of order of a group element three. There is also an involution $b$: otherwise the five nonidentity elements could be paired into distinct pairs $\{g,g^{-1}\}$, impossible for an odd number of elements.

The subgroup $H=⟨a⟩$ has index of a subgroup two, so it is a normal subgroup. Indeed, for $g\notin H$, both $gH$ and $Hg$ are the complement of $H$, and for $g\in H$ both equal $H$. Consequently $ba{b}^{-1}$ is either $a$ or $a^{-1}$. The first possibility makes $a,b$ commute, and $ab$ then has order of a group element six: $(ab{)}^k=e$ forces $a^k=b^{-k}\in ⟨a⟩\cap ⟨b⟩=\{e\}$, so both $3$ and $2$ divide $k$. This contradicts our assumption. ThereforeEvery element is uniquely $a^i$ or $a^{i}b$, with $0\le i<3$, and the relation $ba=a^{-1}b$ determines all their products. Sending $a$ to $(123)$ and $b$ to $(12)$ gives a group isomorphism with the symmetric group $S_3$. This completes the classification of groups of order at most six.

Of these groups, exactly $C_1,C_2,C_3,C_4,C_2\times C_2,S_3$ embed in $S_4$. Concrete subgroups areThere is no $C_5$ subgroup, since $5$ does not divide $24$. There is no $C_6$ subgroup either: the order of a group element in a symmetric group is the least common multiple of the lengths in its disjoint cycle decomposition, and on four letters the only possibilities are $1,2,3,4$.

Every left coset $kH$ with $k\in K$ is also a left coset of $H$ in $G$. Moreover equality of two such cosets means the same thing in $K$ and in $G$:Thus the map from the set of left cosets of $H$ in $K$ to the set of left cosets of $H$ in $G$, taking $kH$ to itself, is injective. Consequently the index of a subgroup satisfiesThese are sets of cosets; no normal subgroup assumption is needed.

For an odd prime $p$, a nonzero congruence class $a$ is a quadratic residue when $a\equiv x^2(\mathrm{mod}p)$ for some integer $x$. Here "quadratic residue" excludes zero: zero is a square of a number, but is neither a quadratic residue nor a quadratic nonresidue under this convention. Some treatments include zero among quadratic residues; the distinction matters when counting them or discussing their subgroup.^[ref]

Modulo seven, squaring the six nonzero congruence classes givesThus the set of quadratic residues is $Q_7=\{1,2,4\}$, and the quadratic nonresidues are $\{3,5,6\}$. In particular, $x^2\equiv 2(\mathrm{mod}7)$ has exactly the two solutions $x\equiv 3,4(\mathrm{mod}7)$: $3^2=9\equiv 2$ and $4^2=16\equiv 2$. Modulo eleven the quadratic residues are instead $Q_{11}=\{1,3,4,5,9\}$. Two is therefore a quadratic residue modulo seven and a quadratic nonresidue modulo eleven: being a quadratic residue depends on the modulus.

Why do the square roots come in pairs? If $x^2\equiv y^2(\mathrm{mod}p)$, the prime number $p$ divides $(x-y)(x+y)$, so it divides one factor: $y\equiv x$ or $y\equiv -x(\mathrm{mod}p)$. For nonzero $x$ these are distinct, because $p$ is an odd prime. Every nonempty nonzero fiber of a function of $s(x)=x^2$ therefore contains exactly two inputs. Pairing the $p-1$ nonzero congruence classes gives exactly $(p-1)/2$ quadratic residues and $(p-1)/2$ quadratic nonresidues. Including zero gives $(p+1)/2$ different squares, with one rather than two square roots for zero.

The quadratic residues form a subgroup of the multiplicative group of a finite field ${\mathbb{F}}_p^{\times }$, with index of a subgroup two. Indeed, one is a square, $(u^2)(v^2)=(uv{)}^2$, and $(u^2{)}^{-1}=(u^{-1}{)}^2$; the inverses exist because the inputs are nonzero in the prime field. Equivalently, the squaring group homomorphism has kernel of a group homomorphism $\{1,-1\}$ and image of a function $Q_p$. The apparent loss of a sign in squaring becomes a precise division of the nonzero arithmetic into two equal parts.

This structure turns a search for square roots into a yes-or-no test: Euler's criterion detects quadratic residues through modular exponentiation, and the Legendre symbol records the result as a sign. For a general integer modulus, the modular congruence $x^2\equiv a(\mathrm{mod}n)$ still makes sense, but the two-root count and the prime field argument need not survive. For example, $x^2\equiv 1(\mathrm{mod}15)$ has four solutions $1,4,11,14$; the Chinese remainder theorem separates the sign choices modulo three and five.

A subgroup $H\le G$ is a subset of a group $G$ that is itself a group under the same group operation. It must contain the identity element of $G$ and be closed under products and inverse elements. Associativity is inherited from $G$, so it needs no new proof. The whole group and the trivial group $\{e\}$ are always subgroups. A proper subgroup satisfies $H\ne G$.

A useful single-condition test isTo see why it works, choose $a\in H$; then $a{a}^{-1}=e\in H$. Taking $a=e$ gives every inverse element $b^{-1}\in H$. Applying the test to $a$ and $b^{-1}$ then gives $ab\in H$. Conversely, every subgroup satisfies the test by closure under products and inverse elements. This also makes the additive version memorable: a nonempty subset of an additive group is a subgroup exactly when it is closed under differences. See McKernan's MIT lecture 2, Proposition 2.3, for the equivalent closure criterion.

For the square dihedral group $D_4$ above, $R=\{e,r,r^2,r^3\}$ is a cyclic subgroup: products add exponents modulo four, and $(r^k{)}^{-1}=r^{-k}$. The smaller collections $\{e,r^2\}$ and $\{e,s\}$ are subgroups of group order two. But $\{e,r\}$ is not a subgroup, since $r\cdot r=r^2$ lies outside it. A plausible-looking list of symmetries therefore need not constitute a complete collection of reversible operations.

Inside $(\mathbb{Z},+)$, the even numbers $2\mathbb{Z}$ form a subgroup: $2m-2n=2(m-n)$ is an even number. Its two cosets consist of the even numbers and the odd numbers, so its index of a subgroup is two. The parity group homomorphism $k\mapsto k\mathrm{mod}2$ has $2\mathbb{Z}$ as its kernel of a group homomorphism. A subgroup can thus identify exactly which information a composition-preserving map forgets.

Subgroups also describe residual symmetry. In the group action of $D_4$ on the four vertices, the stabilizer subgroup of $(1,1)$ is $\{e,sr\}$: the diagonal reflection $sr$ fixes that vertex, and the other six motions move it. Requiring a feature to stay fixed still leaves a group, because both composition and reversal preserve that requirement. This is why subgroups are useful for studying a group action one feature at a time.