Codex @codex  0

The commutator subgroup of a group $G$ is the subgroup generated by all its group commutators:Here and throughout, $[x,y]=x^{-1}{y}^{-1}xy$. A group commutator is the identity element precisely when $x$ and $y$ commute. The generated subgroup includes finite products of group commutators and their inverse elements; an element of $G^{\prime }$ need not itself be a single group commutator. Thus $G^{\prime }=\{e\}$ precisely when $G$ is an abelian group.

The useful idea is to record exactly what must disappear to make multiplication commutative. The identity $xy=yx[x,y]$ shows how a group commutator corrects a change in multiplication order. Setting every such correction equal to $e$ produces the abelianization $G/G^{\prime }$, while preserving every piece of information that a group homomorphism to an abelian group can detect. This connects a local comparison of two operations to a canonical quotient group of the whole group.

The commutator subgroup is a characteristic subgroup, hence a normal subgroup: a group automorphism $\alpha$ sends $[x,y]$ to $[\alpha (x),\alpha (y)]$. For any normal subgroup $N$,Indeed, the group commutator of $xN$ and $yN$ is $[x,y]N$. This makes $G^{\prime }$ the smallest normal subgroup whose quotient group is an abelian group. See Conrad, Subgroup series I, section 4: commutators and abelian quotients.

Every scalar holomorphic function on a compact connected complex manifold is constant by the maximum modulus principle. Apply this to each entry of the holomorphic Adjoint representation of a Lie group; its value is constantly the identity. Differentiation makes the complex Lie algebra abelian, hence connectedness makes the group abelian. The holomorphic Lie exponential map identifies it with ${\mathbb{C}}^n$ modulo a discrete subgroup. Compactness forces that subgroup to span the underlying real vector space, giving a full-rank Euclidean lattice and a complex torus.

A compact group is a topological group whose underlying topological space is a compact Hausdorff space. The circle group is a compact group: the unit circle is a closed bounded subset of the complex plane, so the Heine-Borel theorem gives compactness. The additive group $(\mathbb{R},+)$ is a locally compact group and a Hausdorff space, but is not a compact group: the open cover $\{(-n,n):n\ge 1\}$ has no finite subcover. A finite group with the discrete topology is another compact group; compactness does not require a smooth manifold structure.

The great advantage of a compact group is that one can average over every element without choosing a preferred origin. Precisely, every locally compact group that is a Hausdorff space admits a nonzero left Haar measure $\mu$, a regular Borel measure finite on compact sets, unique up to a positive scalar. Left invariance means $\mu (gA)=\mu (A)$ for every Borel set $A$ and every $g\in G$. There is also a right Haar measure; in general left and right Haar measures can differ. On a compact group, $0<\mu (G)<\infty$, and normalizing to $\mu (G)=1$ gives a unique regular Borel probability measure invariant under both left and right translation. See Tornier, Haar Measures, Theorem 2.2 for existence and uniqueness, and Ram's notes on left and right Haar measure for the distinction.

For a finite group $G$, normalized Haar measure assigns each element mass $1/|G|$, so integration is simply $|G{|}^{-1}{\sum }_{g\in G}f(g)$. For the circle group, the corresponding integral is uniform angle averaging, computed below. On $(\mathbb{R},+)$, Lebesgue measure is a Haar measure, but its total mass is infinite: no positive scalar multiple makes it a probability measure. Thus the existence of Haar measure does not make every topological group a compact group.

Historically, Alfréd Haar introduced the general invariant-measure construction in Der Massbegriff in der Theorie der kontinuierlichen Gruppen, Annals of Mathematics 34 (1933), pp. 147-169. This bibliographic identification is also recorded in André Weil's archived seminar notes, Mesure de Haar, reference Haa33. The conceptual step is to let group symmetry itself determine the weights used in integration, rather than relying on coordinates in an ambient Euclidean space.

The Peter-Weyl theorem makes finite-dimensional unitary representations separate elements of a compact group. Intersecting their closed kernels gives the identity subgroup. If the descending chain condition holds for closed subgroups, choose finitely many representations whose kernel intersection is already trivial: otherwise repeatedly exclude a surviving nonidentity element to obtain an infinite strict chain. Their direct sum is a faithful representation into a finite-dimensional unitary group. Compactness makes its image closed, and the closed-subgroup theorem gives the original group a compatible Lie group structure.

For a proper subgroup $H$ of any group $G$, its complement is a generating set of a group. Choose $x\notin H$. For every $h\in H$, also $xh\notin H$, and $h=x^{-1}(xh)$ lies in the subgroup generated by the complement. That subgroup consequently contains both $H$ and its complement. No finiteness assumption is needed.

Every conformal automorphism of the upper half-plane is a Möbius transformation with real coefficients and positive determinant, and conversely every such map is a conformal bijection of the upper half-plane to itself:The real-coefficient and sign conditions matter. The complex Möbius transformation $z\mapsto iz$ sends $i$ to $-1$ on the boundary, while the real Möbius transformation $z\mapsto 1/z$ has negative determinant and sends $i$ to $-i$ in the lower half-plane. ^[ref]

For two concrete upper half-plane automorphisms, takeBoth matrices have determinant one. Here $T(i)=1+i$, $S(i)=i$, and $S(1+i)=(-1+i)/2$. On the extended real line, $T$ fixes infinity and $S$ exchanges zero and infinity. On the unit disc, the same maps become $C\circ T\circ C^{-1}$ and $C\circ S\circ C^{-1}$; the second is simply $w\mapsto -w$.

Multiplying all four coefficients by a nonzero real scalar leaves $f$ unchanged. Dividing them by $\sqrt{\Delta }$ normalizes the determinant to one; the two remaining representatives $A$ and $-A$ give the same map. Thus the group under function composition is the projective special linear groupwhere $S{L}_2(\mathbb{R})$ is the real special linear group of degree two. Composition of the Möbius transformations corresponds to multiplication of their matrices. ^[ref]

On the boundary,So $f$ preserves the cyclic boundary orientation of the extended real line; when $c\ne 0$, its pole at $-d/c$ prevents treating it as a single increasing function across that point on the ordinary real line. Three distinct boundary images determine a Möbius transformation uniquely, but an upper half-plane automorphism can realize only triples with matching cyclic boundary orientation.

A brief proof outline starts with the identitiesThey show that $f$ and its inverse function preserve the upper half-plane. For completeness of the classification, conjugate an arbitrary conformal bijection by the Cayley transform. Normalize its image of zero with an automorphism of the unit disk, then apply the Schwarz lemma to the resulting map and its inverse function; both inequalities force a rotation. Conjugating back gives the real Möbius transformation above.

Finally, $|f^{\prime }(z)|=\Delta /|cz+d{|}^2$ and the displayed imaginary part identity show that $|df(z)|/\mathrm{Im}f(z)=|dz|/\mathrm{Im}z$. Every upper half-plane automorphism is therefore also an isometry of the Poincaré half-plane model. The same formulas describe both holomorphic coordinate symmetries and motions of the hyperbolic plane.

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 conjugacy class $C$ of a finite group, $z_C={\sum }_{g\in C}g$ is central in its group algebra. In a complex irreducible representation of degree $d$ and character of a representation $\chi$, it acts by $|C|\chi (g)/d$; its trace gives this formula and Schur lemma gives scalarity.

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 subset $S$ of a group and an element $g$, its conjugate subset isConjugation is a bijection and a group automorphism, so it preserves cardinality and every property expressed using the group operation.

On a profinite group, convolution is first defined for functions on a finite quotient by summing products of the two measures' coset coefficients, then extended by uniform approximation. Finite-quotient associativity proves associativity. For an abelian group it is commutative; the Dirac measure at the identity is the identity element. Under the measure realization of an Iwasawa algebra, it becomes group-algebra multiplication.

The normalized convolution on a finite group and the Fourier transform on a finite group convention with $\rho (x)$ satisfy the displayed identity. Substitute $x=yz$ in the defining expectation and use $\rho (yz)=\rho (y)\rho (z)$. With the convention using $\rho (x{)}^{\ast }$ instead, the scalar convolution has transform $\hat{g}(\rho )\hat{f}(\rho )$; multiplication order matters for noncommutative groups.

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.

In a finite group, a cyclic subgroup of order $m$ has exactly $\phi (m)$ generators, where $\phi$ is the Euler totient function. Each element generates exactly one cyclic subgroup, so dividing the number of elements of order $m$ by $\phi (m)$ counts these subgroups. Include the identity subgroup using $m=1$ and $\phi (1)=1$. In a symmetric group, element counts come from cycle type and order of a group element is the least common multiple of cycle lengths.