Codex @codex  0

The abelianization of a group $G$ is the quotient groupwhere $G^{\prime }$ is the commutator subgroup. Its elements are cosets, and its operation is $(g{G}^{\prime })(h{G}^{\prime })=gh{G}^{\prime }$. The result is an abelian group: the two products $gh$ and $hg$ differ by a group commutator, which disappears in the quotient group.

For the symmetric group $S_3$, the sign of a permutation realizes $S_3^{\mathrm{ab}}\cong C_2$, as shown in commutator subgroup of the symmetric group on three letters. For the dihedral group of a square, abelianization of the square symmetry group gives $C_2\times C_2$: two independent yes-or-no pieces of information survive. An abelian group already has $G^{\prime }=\{e\}$, so its abelianization is isomorphic to itself. At the other extreme, a perfect group has trivial abelianization.

Calling this the largest abelian quotient means that every group homomorphism into any abelian group factors uniquely through $q$. It does not require $G$ to be finite, or compare the sizes of unrelated abelian groups. The universal property of abelianization makes this precise. It lets us solve all such mapping problems in one simpler group: any invariant that respects multiplication and takes values in an abelian group sees only $G^{\mathrm{ab}}$.

Let $D_8$ denote the dihedral group of group order eight acting on a square. Here the subscript specifies group order; the same group is called $D_4$ in the convention that counts vertices of a polygon, as in the group action example. Let $r$ be a counterclockwise quarter-turn rotation and $s$ a reflection in a diagonal. ThenProducts act rightmost first. The group commutator of the generators of a group isIt is a half-turn rotation, so forcing $r$ and $s$ to commute must identify a half-turn with $e$.

More concretely, write each element uniquely as $r^i{s}^j$, with $0\le i<4$ and $j\in \{0,1\}$. The functionis a surjective group homomorphism. Indeed, $srs=r^{-1}$ giveswhere the exponents are reduced modulo four and two. Modulo two, $-k$ and $k$ agree, so $\varphi$ adds the two coordinates separately. Its group kernel is $N=\{e,r^2\}$. Since the target is an abelian group, $D_8^{\prime }\subseteq N$; since $[r,s]=r^2$, also $N\subseteq D_8^{\prime }$. ThusThe four cosets are $\{e,r^2\}$, $\{r,r^3\}$, $\{s,r^{2}s\}$, and $\{rs,r^{3}s\}$. Each coset forgets the difference of a half-turn. The quotient group still distinguishes rotations from reflections, and even from odd numbers of quarter-turns; the two surviving choices are independent. This is the Klein four-group, rather than the cyclic group $C_4$, because each nonidentity element squares to the identity element. For the general dihedral group calculation, see Conrad, Dihedral groups I, theorem A.1; that source uses the vertex-count convention and $xy{x}^{-1}{y}^{-1}$ for individual group commutators.

Use the coordinate conventionIn this convention the Heisenberg group over a prime field has the productThe subset $H=\{A(t,b,t):t,b\in {\mathbb{F}}_p\}$ is an Abelian subgroup of order $p^2$: the middle coordinate in a product is $b+b^{\prime }+t{t}^{\prime }$, which is symmetric in the factors. Also $A(t,b,t{)}^{-1}=A(-t,t^2-b,-t)$ lies in $H$. The map $A(a,b,c)\mapsto a-c$ is a surjective group homomorphism to the additive group of ${\mathbb{F}}_p$, with kernel of a group homomorphism $H$. Hence $H$ is a normal subgroup of subgroup index $p$, and its left cosets are exactly the level sets of $a-c$.

For odd $p$, an explicit group isomorphism from $H$ to the additive group ${\mathbb{F}}_p^2$ isThe term $t{t}^{\prime }$ in matrix multiplication cancels the cross term in $(t+t^{\prime }{)}^2/2$. Thus $H$ is an elementary abelian group, isomorphic to $C_p\times C_p$.

In the Heisenberg group over a commutative ring with $R=\mathbb{Z}/4\mathbb{Z}$, the subset $H=\{A(t,y,t):t,y\in R\}$ is an Abelian subgroup of group order 16. Its product has central coordinate $y+y^{\prime }+t{t}^{\prime }$, symmetric in the two factors. Its inverse element is $A(-t,t^2-y,-t)$. The map $A(x,y,z)\mapsto x-z$ is a surjective group homomorphism to the additive group of $R$, with kernel of a group homomorphism $H$. Thus $H$ is a normal subgroup and has four cosets in the 64-element group.

Unlike the odd-prime case, division by two is unavailable. In fact take $u=A(1,0,1)$ and $v=A(2,0,2)$. Then $u^n=A(n,(\genfrac{}{}{0ex}{}{n}{2}),n)$, where the binomial coefficient is computed as an integer before reduction modulo four. Hence $u^4=A(0,2,0)$ and $u$ has element order eight. The element $v$ has element order two and is not a power of $u$: the powers with outer coordinates two have central coordinates one or three. Their generated subgroups intersect trivially, so the 16-element Abelian group is the direct product of groups $C_8\times C_2$.

For every finite $K$-approximate group $A$ in a group $G$, there are subgroups $H⊴C<G$ such that$C/H$ is a nilpotent group of class $O_K(1)$, and $A$ is contained in the union of $O_K(1)$ left cosets of $C$.

The cokernel records output information that a linear map cannot produce. For $T:V\to W$, it is the quotient vector spaceIts elements are cosets $[b]=b+\mathrm{im}T$. Two vectors $b,c\in W$ represent the same class exactly when $b-c$ is in the image of a linear map. The zero class is the whole image of a linear map, soChanging $b$ by an attainable output does not change its obstruction. This is useful because one can test compatibility before trying to find an input. The quotient vector space construction is described in Axler's §3E. ^[ref]

For the linear map $T:{\mathbb{R}}^2\to {\mathbb{R}}^2$ given by $T(x,y)=(x+2y,0)$, the image of a linear map is the horizontal line. All outputs $(b_1,b_2)$ with the same second coordinate have the same cokernel class, because their difference is horizontal. Thus this cokernel is isomorphic to $\mathbb{R}$ via $[(b_1,b_2)]\mapsto b_2$. In particular, $(3,0)$ has zero class and is attainable, while $(3,1)$ has nonzero class and is unattainable.

If $W$ is finite-dimensional, the dimension rule for a quotient vector space givesCompare this with the rank-nullity theorem, $\dim V=\mathrm{rank}T+\dim \ker T$. The kernel counts invisible inputs; the cokernel counts missing output directions. They need not have the same dimension: $B(x,y,z)=(x+2y,0)$ has a two-dimensional kernel and a one-dimensional cokernel. A linear map is surjective exactly when its cokernel is zero.

The cokernel is a quotient, rather than a chosen perpendicular vector subspace. With a finite-dimensional inner product space as output, one may represent each class by its unique component in the orthogonal complement of the image of a linear map. That representation depends on the chosen inner product. For matrices over the complex numbers, this complement is $\ker A^{\ast }$, leading to the cokernel compatibility equations.

The same quotient definition applies to a group homomorphism of abelian groups. For $T:\mathbb{Z}\to \mathbb{Z}$ given by $T(n)=2n$, the cokernel is $\mathbb{Z}/2\mathbb{Z}$. The equation $2n=b$ is solvable exactly when $b$ is an even integer; the two cosets record integer parity. A quotient captures the obstruction here just as it captures a missing output coordinate for a linear map.

For the symmetric group $S_3$, take the transpositions $x=(12)$ and $y=(23)$. Products of permutations apply the rightmost factor first. ThenThe last permutation sends $1\mapsto 3$, $3\mapsto 2$, and $2\mapsto 1$: two swaps fail to commute by an entire three-cycle.

Every group commutator has sign of a permutation $+1$, so $S_3^{\prime }\subseteq A_3$, the alternating group of even permutations. Conversely, the displayed group commutator generates $A_3=\{e,(123),(132)\}$. Therefore $S_3^{\prime }=A_3$. The two cosets are the even permutations and the odd permutations, and their multiplication is just multiplication of signs:This is the first isomorphism theorem applied to the sign of a permutation. Once commutativity is forced, all three transpositions become indistinguishable, and both three-cycles become the identity element. The surviving information is exactly whether the permutation is even or odd. Compare the very different center of a group $Z(S_3)=\{e\}$.

Let $B(x)=\left(\begin{array}{cc}\cosh x& -\sinh x\\ -\sinh x& \cosh x\end{array}\right)$, $T=\mathrm{diag}(1,-1)$ and $P=\mathrm{diag}(-1,1)$. Every real matrix preserving $\mathrm{diag}(1,-1)$ has a unique form $B(x)S$ with $S\in \{I,T,P,TP\}$. The boost subgroup is normal because $TB(x)T=PB(x)P=B(-x)$. Its four cosets form the Klein four-group, giving the displayed quotient group. In contrast, the four-element subgroup generated by $T,P$ is not normal: $B(x)TB(-x)=B(2x)T$ is not diagonal for $x\ne 0$. This distinguishes the normal identity component from a chosen set of component representatives.

For an element $x$ of a group $G$, its conjugacy class is its orbit of a group action under the conjugation action:Thus conjugate group elements describe the same operation after a change of labels. In a symmetric group, conjugation renames the entries of every permutation cycle:For example, with $g=(123)$ and the transposition $t=(12)$, this gives $gt{g}^{-1}=(g(1)g(2))=(23)$. Products use function composition of permutations, with the rightmost factor applied first. The complete six-element example is conjugacy classes of the symmetric group on three letters.

The conjugacy classes form a partition of a set of $G$, since conjugacy is an equivalence relation. In a symmetric group, two permutations lie in the same conjugacy class precisely when they have the same cycle type: renaming preserves the lengths of permutation cycles, and matching equal-length permutation cycles constructs a renaming in the other direction. This compresses many labelled permutations into a few structural types. See McKernan, Conjugation in Sn, lemma 6.2 and proposition 6.6.

The stabilizer subgroup of $x$ under the conjugation action is its centralizer $C_G(x)$. Consequently the orbit-stabilizer theorem givesThe counting mechanism is the bijection $g{C}_G(x)\mapsto gx{g}^{-1}$ from left cosets onto the conjugacy class: two choices of $g$ give the same result exactly when they differ on the right by an element of the centralizer. A large centralizer means many choices of labels leave the operation unchanged, hence a small conjugacy class. A conjugacy class has size one precisely when its element belongs to the center of a group. The class equation counts these orbits of a group action together.

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.

If $N$ is a normal subgroup, changing representatives to $gn$ and $hm$, where $n,m\in N$, givesThe chosen representatives therefore give the same coset. Conversely, suppose the rule defines an operation on left cosets. Since $nN=N$ for $n\in N$, multiplying by $gN$ gives $ngN=gN$, hence $g^{-1}ng\in N$. Applying this inclusion for every $g$ and $g^{-1}$ proves $g^{-1}Ng=N$, so $N$ is a normal subgroup. This makes normality exactly the condition needed to carry group operation to these classes.

The cosets of the index-$m$ subgroup of the multiplicative group of a finite field are its cyclotomic classes of index $m$. For a character with $\chi (\gamma )={\zeta }_m$, their indicators are $1_{C_j}(x)=m^{-1}{\sum }_{h=0}^{m-1}{\zeta }_m^{-jh}{\chi }^h(x)$, with every character extended by zero at zero. Jacobi sums of finite-field characters imply $|C_i\cap (t+C_j)|=q/m^2+O_m(\sqrt{q})$ uniformly for $t\ne 0$.

Put $m=\left(\genfrac{}{}{0ex}{}{k}{2}\right)$, take odd $q\equiv 1(\mathrm{mod}2m)$, and let $H$ be the index-$m$ multiplicative subgroup. If a $k$-set $A$ has its unordered pair differences in distinct $H$-cosets, choose $S\subset H$ containing exactly one element from each pair $\{h,-h\}$. Then $\{sA:s\in S\}$ is a difference family for a Steiner 2-design. Indeed one unordered pair supplies each coset, and its two difference orientations multiplied by $S$ cover that coset once. Translations yield a $2$-$(q,k,1)$ Steiner system. The cyclotomic pattern extension by a second-moment bound supplies suitable $A$ for all sufficiently large $q$ in this progression.

A discrete additive subgroup of ${\mathbb{R}}^n$ is generated by real-linearly independent vectors. Indeed, isolation of zero gives uniform separation, so compact sets meet the subgroup finitely. Choose a real basis from the subgroup for its real span. Its integer span has finite index, since reduction into a compact fundamental parallelepiped gives finitely many coset representatives. The structure theorem for finitely generated abelian groups then gives a free integer basis, whose size is the dimension of the real span. Thus the subgroup is a Euclidean lattice in its span, although it need not have full rank in the ambient space.

For a generator of a group $g$ of order $M$ and $x=g^y$, the function $f(a,b)=g^a{x}^{-b}$ hides the subgroup $\{(yb,b):b\in {\mathbb{Z}}_M\}$ of ${\mathbb{Z}}_M^2$. Each fiber is an affine coset $\{(yb+k,b):b\in {\mathbb{Z}}_M\}$. Measuring the function register gives its normalized coset state. Applying the positive-exponent quantum Fourier transform to both input registers gives amplitudeThe finite geometric series vanishes off $c_2=-y{c}_1$ and equals $M$ on that line. Thus each allowed output pair has probability $1/M$, independently of the coset offset. If $\gcd (c_1,M)=1$, a modular inverse recovers $y=-c_2{c}_1^{-1}$.

For the order-eight dihedral group generated by $r$ of order four and $s$ of order two with $srs=r^{-1}$, let $H=K=⟨s⟩$. There are exactly three double cosets: $H$, $H{r}^{2}H$, and $HrH$, of sizes two, two, and four. Their number does not divide eight. This differs from the number of ordinary cosets, which divides group order by Lagrange's theorem.

The doubling constant of a nonempty finite set $S\subseteq G$ in an abelian group $G$ isIt measures the cardinality of the sumset relative to the original set. For the integer examples, $K(A)=7/4$ and $K(B)=10/4=5/2$. A nonconstant arithmetic progression with $n$ members has doubling constant $(2n-1)/n$, which stays below two as $n$ grows. This is the sense in which its sumset has small growth.

In any abelian group, $K(S)\ge 1$: fixing $s_0\in S$ puts a translated copy $s_0+S$ inside $S+S$. The stronger integer bound gives $K(S)\ge 2-1/|S|$ only in that setting. A finite subgroup $H$ has $K(H)=1$, as does every coset $x+H$, since its sumset is $2x+H$. In particular $H=\{0,2,4\}\subseteq \mathbb{Z}/6\mathbb{Z}$ has doubling constant one.

Small doubling constant is useful because it constrains repeated growth, as in the Plünnecke-Ruzsa inequality. It signals structure such as arithmetic progressions and subgroups; precise descriptions depend on the ambient abelian group and are the subject of the Freiman-Ruzsa theorem. The additive energy bound below gives a simpler immediate consequence: $E(S)\ge |S{|}^3/K(S)$.

A nonempty subset $B$ of any group $G$ is a left coset of a subgroup if and only if any two left translates $gB,hB$ are equal or disjoint. No finiteness assumption is needed.

For the forward direction, write $B=bH$ with $H$ a subgroup. Then $gB=gbH$, and distinct left cosets of $H$ are disjoint. For the converse, first assume $e\in B$. For every $b\in B$, $b\in B\cap bB$, so $bB=B$. This proves closure under multiplication. Since $e\in B=bB$, there is $c\in B$ with $bc=e$, showing $b^{-1}\in B$. Thus $B$ passes the subgroup test.

For a general nonempty $B$, choose $b\in B$ and set $H=b^{-1}B$. It contains $e$, and all its left translates have the assumed property because $gH=(g{b}^{-1})B$. The previous argument makes $H$ a subgroup, and $B=bH$ is a left coset. This gives a recognition criterion for cosets from their translate intersections alone.