Codex @codex  0

First prove Simplicity of alternating groups. The $3$-cycles generate $A_n$: express an even permutation as an even number of transpositions and pair them. A pair sharing a point is a $3$-cycle, an identical pair cancels, and a disjoint pair can be written $(ab)(cd)=(acb)(acd)$. All $3$-cycles are conjugate in $A_n$ when $n\ge 5$: a conjugator in $S_n$ can have its parity corrected by a transposition on two points outside the target triple, without changing its effect on that triple.

Let $1\ne N◃A_n$ and choose $1\ne \sigma \in N$. Some $3$-cycle $\tau$ does not commute with $\sigma$. Indeed, commuting with every $3$-cycle would preserve every triple setwise; intersecting all triples containing a given point forces that point to be fixed, so would make $\sigma =1$. The nonidentity group commutator $\sigma \tau {\sigma }^{-1}{\tau }^{-1}\in N$ is supported on at most six points. Its possible nontrivial even cycle types are a $3$-cycle, a double transposition, a $5$-cycle, two disjoint $3$-cycles, or a $4$-cycle times a transposition. Each yields a $3$-cycle in $N$ by explicit group commutators:

For $(ab)(cd)$, use $\tau =(cde)$ with a fifth point $e$; conjugation reverses $\tau$, so the group commutator is ${\tau }^{-2}=\tau$. For $(abcde)$, use $(abc)$: the group commutator is $(bcd)(abc{)}^{-1}=(adb)$. The same calculation works for $(abcd)(ef)$. For $(abc)(def)$, use $(abd)$; its conjugate is $(bce)$, and the product $(bce)(abd{)}^{-1}$ is a $5$-cycle, reducing to the preceding case. Thus $N$ contains a $3$-cycle, hence the whole conjugacy class of $3$-cycles, and hence all of $A_n$. ThereforeFor the exceptional automorphism, a duad is an unordered pair of six points, a syntheme is a partition into three duads, and a pentad is a set of five synthemes covering every duad once. There are fifteen synthemes. To count pentads, fix $12|34|56$, where bars separate duads. A syntheme disjoint from it in duads is one of eight; the union of the two matchings is a six-cycle, so the stabilizer of the fixed syntheme is transitive on these eight choices. For the choice $13|25|46$, the remaining compatible synthemes are $14|26|35$, $15|24|36$, $16|23|45$ and $16|24|35$. The last shares a duad with each of the first three and cannot belong to a completion; the first three form the unique completion. Thus each of the eight choices has a unique completion through the fixed syntheme. Each completion contains four of them, so exactly two pentads contain a fixed syntheme, and there are $15\cdot 2/5=6$ pentads in total.

Here is the complete list, which also defines concrete labels for the induced action:Relabelling points gives a group homomorphism $\Phi :S_6\to S_6$ on these pentads. Direct substitution in the table givesThe restriction to $A_6$ is nontrivial, hence faithful by the simplicity just proved. Therefore the full kernel has order at most two. An order-two normal subgroup would be central, whereas $S_6$ has trivial centre: an element centralizing every transposition fixes every unordered pair and consequently every point. The kernel is trivial, and equal orders make $\Phi$ an automorphism. It preserves $A_6$, because that is the unique index-two subgroup of $S_6$: any nontrivial group homomorphism to $C_2$ sends every conjugate transposition to the nonidentity element, and is therefore the sign map. Its restriction is the pentad construction of the exceptional alternating-group automorphism. It maps a $3$-cycle to two disjoint $3$-cycles, while conjugation in $S_6$ preserves cycle type. Hence this automorphism of $A_6$ is not induced by any element of $S_6$.

For the other degrees, recover the points from $3$-cycles. An element of order three has type $3^k{1}^{n-3k}$. Its centralizer in $S_n$ has order $3^{k}k!(n-3k)!$. That centralizer contains an odd permutation: either swap two fixed points, or, when $k\ge 2$, swap two three-cycles by three transpositions. ThusFor $n=5$, only $k=1$ is possible. For $n\ge 7$, the $k=1$ value is strictly largest. For $k=2$ equality first occurs at $n=6$, and the ratio increases strictly with $n$. For $k\ge 3$, already at $n=3k$ one has $(3k-3)!>3^{k-1}k!$: it holds at $k=3$, and the inductive ratio is $(3k)(3k-1)(3k-2)>3(k+1)$. Increasing $n$ again increases the ratio. Consequently every automorphism preserves the set of $3$-cycles when $n\ne 6$.

Each cyclic subgroup generated by a $3$-cycle corresponds to its three-point support. Two distinct such subgroups commute exactly when the supports are disjoint. If they meet in one point, products of their nonidentity generators have order five. If they meet in two points, those products have order two or three. These intrinsic tests recover adjacency in the Johnson graph $J(n,3)$, so the automorphism acts on its vertices.

We can reconstruct the underlying points without an additional group-theoretic bound. The maximal cliques of a Johnson graph in $J(n,3)$ are the $n-2$ triples containing a fixed pair, and the four triples contained in a fixed four-set. To verify the classification, take adjacent triples $D\cup \{a\}$ and $D\cup \{b\}$ with $|D|=2$. Any common adjacent triple either contains $D$ or lies in $D\cup \{a,b\}$. A triple of the first kind outside that four-set is not adjacent to a triple of the second kind omitting a point of $D$, so a clique cannot mix the two alternatives. Extending a clique therefore gives exactly one of the two listed families.

For $n\ge 5$, $n\ne 6$, their sizes distinguish the pair-containing cliques. Their intersections reconstruct the pair graph $J(n,2)$: two such cliques intersect precisely when their defining pairs meet in one point. In this graph the maximal cliques are stars of $n-1$ pairs through a point and triangles of three pairs within a triple. These sizes are different for $n\ge 5$, so its automorphisms permute the stars and hence the points. Every pair is the intersection of its two point stars, and every triple is determined by its three pairs. Thus the original graph action comes from some $\pi \in S_n$.

Undo conjugation by $\pi$. The remaining group automorphism $\beta$ fixes each cyclic $3$-subgroup, so it fixes or inverts each generator. For adjacent supports, inverting exactly one generator changes the order of their product between two and three; inverting both preserves that order. Hence the two inversion choices must agree. The triple-support graph is connected, since one can replace differing points one at a time, so the choice is uniform. Inverting every $3$-cycle is impossible: take $c=(123)$, $d=(142)$, whose product is the $3$-cycle $(143)$. Then $\beta (cd)=(cd{)}^{-1}=d^{-1}{c}^{-1}$, whereas the group homomorphism property would give $c^{-1}{d}^{-1}$; these are unequal because $c,d$ do not commute. Therefore $\beta$ fixes every $3$-cycle and is the identity. Conversely, conjugation by $S_n$ acts faithfully on $A_n$, since centralizing all $3$-cycles fixes every triple and every point. The automorphisms of alternating groups from triple supports are exactly

For a set of primes $\pi$, a Hall $\pi$-subgroup $H$ of a finite group is a subgroup whose order uses only primes in $\pi$ and whose subgroup index uses only primes outside $\pi$. Equivalently, $|H|$ is the full $\pi$-part of $|G|$. A Hall subgroup is a Hall $\pi$-subgroup for some $\pi$. The theorem of P. Hall for finite soluble groups states: Hall $\pi$-subgroups exist for every $\pi$, any two are conjugate, and every $\pi$-subgroup is contained in a Hall $\pi$-subgroup.

For the existence proof, first give the explicit coprime splitting calculation needed in the induction. Let $N$ be elementary abelian of field characteristic $r$, normal in $E$, with $r\nmid |E/N|$. Write $Q=E/N$ and use additive notation on $N$. A normalized section $s:Q\to E$ gives an action $x\cdot n=s(x)ns(x{)}^{-1}$ independent of its choice, since $N$ is abelian. Write $s(x)s(y)=f(x,y)s(xy)$. Associativity givesSum over $z\in Q$, put $S(x)={\sum }_{z}f(x,z)$, and divide by $|Q|$ in the vector space $N$. This is legitimate because $r\nmid |Q|$. With $b(x)=|Q{|}^{-1}S(x)$ one obtainsThe new section $s^{\prime }(x)=(-b(x))s(x)$ therefore has zero multiplication defect and is a group homomorphism. Its image is a complement to $N$.

We will also need a single conjugation carrying one complement to the other. If two homomorphic sections differ by $d(x)$, their difference satisfies $d(xy)=d(x)+x\cdot d(y)$. Summing over $y$ gives $d(x)=c-x\cdot c$, where $c=|Q{|}^{-1}{\sum }_{y}d(y)$. Thus the second section is $cs(x)c^{-1}$. This proves, by explicit averaging, both coprime splitting over an elementary abelian normal subgroup and the existence of such a conjugation by an element of $N$.

Now induct on $|G|$ for Hall subgroup existence in soluble groups. A minimal normal subgroup $N$ of a finite soluble group is elementary abelian of some field characteristic $r$. Indeed, $N^{\prime }$ is a characteristic subgroup of $N$ and normal in $G$; it cannot equal $N$ because $N$ is soluble, so it is trivial. In this abelian group, a nontrivial primary component is a characteristic subgroup, forcing a single prime, and the characteristic subgroup annihilated by that prime forces exponent $r$.

By induction $G/N$ has a Hall $\pi$-subgroup $\overline{H}$, with preimage $M$. If $M<G$, induction in $M$ supplies a Hall $\pi$-subgroup of $M$, which is also Hall in $G$ because $[G:M]$ is prime to all primes in $\pi$. If $M=G$, the quotient is a $\pi$-group. When $r\in \pi$, $G$ itself is a $\pi$-group. When $r\notin \pi$, the averaging construction splits off $N$, and its complement has order $|G/N|$ and is the required Hall $\pi$-subgroup. This completes the existence proof, including the identity group and empty prime set.

A Sylow basis is a family $\{P_p:p\mid |G|\}$ containing one Sylow subgroup for each prime, with $P_p{P}_q=P_q{P}_p$ for each pair. This is permutability of subgroups, not commutation of all their elements. The product of any subfamily is a subgroup: commuting the factors as sets proves closure and closure under inversion. Inductively its order is the product of the prime-power orders, since the newly adjoined factor has trivial intersection with the earlier product. It is thus the corresponding Hall subgroup.

Prove existence of a Sylow basis by induction on $|G|$, again using elementary abelian $N$ of field characteristic $r$. Choose a basis $\{{\overline{P}}_p\}$ of $G/N$, taking ${\overline{P}}_r=1$ if $r$ does not divide that quotient's order. The product $\overline{H}={\prod }_{p\ne r}{\overline{P}}_p$ is its Hall $r^{\prime }$-subgroup. In its full preimage $T$, the averaging lemma supplies a complement $H$ to $N$, mapping isomorphically to $\overline{H}$. For $p\ne r$, let $P_p$ be the inverse image of ${\overline{P}}_p$ under this isomorphism within $H$. Let $P_r$ be the full preimage of ${\overline{P}}_r$ in $G$. These are Sylow subgroups of $G$. The other-prime pairs permute because they do so in $\overline{H}$. For $P_r$ and $P_p$, their product is contained in the full preimage of the subgroup ${\overline{P}}_r{\overline{P}}_p$ and has exactly that preimage's order $|N||{\overline{P}}_r||{\overline{P}}_p|$. Equality follows, so the product is a subgroup and these two factors permute as well. This constructs a basis.

To obtain a simultaneous conjugation of two bases, take two bases. Their images in $G/N$ are bases: $N$ lies in every Sylow $r$-subgroup, and the other-prime Sylow subgroups project injectively. By induction, conjugate one basis so that all corresponding images agree. The products of their non-$r$ factors are then two complements to $N$ in the same preimage $T$ of their common Hall $r^{\prime }$-subgroup. The averaging lemma for complements supplies a single element of $N$ conjugating these complements. In the resulting common complement each corresponding Sylow subgroup is the unique lift of its agreed quotient subgroup, so all non-$r$ factors agree. The $r$-factors already equal the full preimage of their common quotient factor and are preserved by conjugation from $N$. Thus all Sylow bases of a finite soluble group are conjugate.

In $S_4$ there are three Sylow $2$-subgroups of order eight: the action on the three pair-partitions of four points has kernel $V_4$, and these subgroups are the preimages of the three order-two subgroups of $S_3$. There are four Sylow $3$-subgroups, one for each three-point support. Every choice $P_2,P_3$ has trivial intersection and product of cardinality $8\cdot 3=24$, so $P_2{P}_3=S_4=P_3{P}_2$. ThereforeFor $E=V⋊S_4$, $V={\mathbb{F}}_5^4$, the Sylow $5$-subgroup is uniquely $V$. In a Sylow basis the product $P_2{P}_3$ is a Hall $5^{\prime }$-subgroup, hence a complement to $V$. Conversely, a basis of any complement together with $V$ is a basis of $E$, because $V$ is normal. The averaging lemma makes all complements conjugate by $V$. The stabilizer of the standard complement $S_4$ under this conjugation is $C_V(S_4)$: if a vector normalizes it, its group commutator with each complement element lies in both $V$ and that complement, hence is trivial. The fixed vectors under the natural coordinate permutation action are exactly $(a,a,a,a)$, so $|C_V(S_4)|=5$. There are consequently $5^4/5=125$ complements, and each has twelve bases. The complement is uniquely recovered from its basis as $P_2{P}_3$, so no basis is counted twice. The counting Sylow bases in a coprime elementary abelian extension formula yields

For $G=U(n)$ take the diagonal maximal torusThe spectral theorem for unitary matrices says that every element is conjugate to an element of $T$. A diagonal element with pairwise distinct eigenvalues has centralizer exactly $T$. Its conjugates therefore determine its eigenvalues up to permutation, and the normalizer quotient is $W=N_G(T)/T\cong S_n$. The character lattice of a torus $T$ is ${\mathbb{Z}}^n$, with $e^{\lambda }(z)=z_1^{{\lambda }_1}\cdots z_n^{{\lambda }_n}$. Conjugation on the matrix unit $E_{ij}$ has weight $e_i-e_j$, so these are the roots. Choose $e_i-e_j$ positive for $i<j$; thenDominant integral weights are precisely the integer tuples ${\lambda }_1\ge \cdots \ge {\lambda }_n$. Negative entries are allowed: they correspond to determinant twists, so polynomial representations alone do not exhaust the irreducible representations of $U(n)$.

Normalize Haar measure on $G$ and $T$ to have mass one, and putThe Weyl integration formula for U(n) for a continuous class function isFor a general continuous function, replace $f(t)$ in the torus integral by ${\int }_{G/T}f(gt{g}^{-1})d(gT)$, using the normalized invariant quotient measure.

To prove the formula, consider the conjugation map $q:G/T\times T\to G$, $q(gT,t)=gt{g}^{-1}$. On regular torus elements its fibres have exactly $n!$ points: the possible orderings of the distinct eigenvalues. Equip the group with an invariant inner product on its Lie algebra and split $\mathfrak{u}(n)=\mathfrak{t}\oplus {\mathfrak{t}}^{\perp }$. After translating the derivative back to the identity, its torus directions contribute the identity, while its transverse directions contribute ${\mathrm{Ad}}_{t^{-1}}-I$. Each pair $i<j$ supplies a real two-dimensional off-diagonal plane. On that plane ${\mathrm{Ad}}_t$ is multiplication by $z_i/z_j$, regarded as a plane rotation, so the absolute real determinant of the transverse derivative isThe change-of-variables theorem, divided by the covering multiplicity, now gives the desired weighted integral up to the constant relating the normalized invariant measures. The nonregular locus has measure zero: repeated eigenvalues are the zero-set of the nonzero discriminant, and the torus coincidence sets likewise have measure zero. Thus its omission causes no change to the integral. To determine the normalization, expand $\Delta$ as a sum of $n!$ distinct torus characters. Fourier orthogonality gives ${\int }_T|\Delta {|}^{2}dt=n!$. Applying the formula to $f=1$ fixes the coefficient to $1/n!$. This proves both the class-function and conjugacy-averaged forms.

We can now derive the character formula from integration, rather than merely quote it. Use the basic highest-weight theorem: a finite-dimensional irreducible representation has a unique highest weight $\lambda$ with a one-dimensional highest-weight space; all its other weights are $\lambda$ minus a nonnegative sum of positive roots. Its character is Weyl invariant. Also, character orthogonality for compact groups gives ${\int }_G|{\chi }_{\lambda }{|}^2=1$. This orthogonality follows by averaging the representation on $\mathrm{End}(V_{\lambda })$: the integral projects onto intertwining operators, whose dimension is one by the Schur lemma.

Let $\delta =(n-1,n-2,\dots ,0)$ and, for a strictly decreasing integer tuple $\eta$, put $A_{\eta }(z)=\det (z_i^{{\eta }_j})$. The finite Laurent polynomial $\Delta {\chi }_{\lambda }$ is alternating. Every alternating Laurent polynomial is a linear combination of the $A_{\eta }$: collect its monomials by permutation orbits, and observe that an orbit with repeated exponents has zero coefficient by antisymmetry. Different $A_{\eta }$ are orthogonal on $T$ and each has squared norm $n!$.

The coefficient of $z^{\lambda +\delta }$ in $\Delta {\chi }_{\lambda }$ is exactly one. Indeed, a contribution from the term $z^{w\delta }$ would require a weight $\lambda +\delta -w\delta$ in $V_{\lambda }$. For $w\ne 1$, the vector $\delta -w\delta$ is a nonzero nonnegative combination of the positive simple roots, so that weight lies above $\lambda$ and is impossible. The identity permutation supplies the highest-weight coefficient one. ConsequentlyApply the integration formula to $|{\chi }_{\lambda }{|}^2$. Torus orthogonality givesAll the other coefficients vanish, provingThe quotient extends across repeated eigenvalues because its product with the denominator is the already defined continuous character. Equivalently, alternant divisibility makes it a Laurent polynomial invariant under permutations; multiply by a determinant power if negative exponents must first be removed.

Finally, $\delta -\rho =\frac{n-1}{2}(1,\dots ,1)$ is fixed by the Weyl group, so its common factor cancels in the quotient. Since $A_{\rho }=e^{\rho }{\prod }_{\alpha >0}(1-e^{-\alpha })$, the determinant expression is exactlyUsing $\delta$ in the derivation avoids treating a possibly half-integral $\rho$ as an actual character of the torus. At the identity, taking the leading Vandermonde term of the two determinants gives the accompanying dimension formula

There are two necessary qualifications to the literal formulation. The whole group $G$ is itself a closed normal subgroup, so the claim about containment in the centre must concern proper closed normal subgroups. Also, the homomorphism conclusion needs a nontrivial target $H$: for example, $SU(2)\to \{1\}$ has surjective differential onto the zero Lie algebra, but its group kernel is all of $SU(2)$ and no quotient by a finite subgroup is a one-point group. We prove the precise assertions, including these exceptional cases.

Write $\mathfrak{g}=\mathrm{Lie}(G)$. The centre $\mathfrak{z}(\mathfrak{g})$ is invariant under the Adjoint representation, so irreducibility makes it either zero or all of $\mathfrak{g}$. In the latter case $\mathfrak{g}$ is Abelian. For connected $G$, the adjoint action is then trivial: the group is generated by exponentials, and ${\mathrm{Ad}}_{\exp X}=e^{\mathrm{ad}X}=I$. A nonzero trivial representation is irreducible only in dimension one. A connected compact one-dimensional Lie group is a circle, so $G\cong U(1)$.

For every other $G$, the Lie algebra of its centre is zero. The centre is a closed compact Lie subgroup; a zero-dimensional compact Lie group is finite. Let $N$ be a closed normal subgroup. The closed-subgroup theorem identifies $\mathfrak{n}=\mathrm{Lie}(N)$ as an adjoint-invariant subspace of $\mathfrak{g}$, hence $\mathfrak{n}=0$ or $\mathfrak{n}=\mathfrak{g}$. If the latter holds, $N$ contains an identity neighbourhood and is open, so connectedness forces $N=G$. If $N$ is proper, it therefore has zero Lie algebra and is finite. For any $a\in N$, the continuous map $g\mapsto ga{g}^{-1}$ takes connected $G$ into the finite set $N$, so it is constant and equal to $a$. ThusProper closed subgroups of the circle are finite as well, and of course central.

Now let $d\Phi$ be surjective. The submersion theorem makes $\Phi (G)$ contain an identity neighbourhood in $H$, so it is an open subgroup. Since $H$ is connected, $\Phi (G)=H$. Its group kernel $F$ is closed and normal. If $H$ is nontrivial, $F$ is proper and the preceding argument gives a finite central group kernel; this also holds for $G\cong U(1)$, whose proper closed subgroups are finite. The Lie-group first isomorphism theorem givesIf $H$ is trivial, the correct statement is instead $H=G/G$.

For the Spin groups, use the real Clifford algebra with $v^2=-\Vert v{\Vert }^2$. The group $\mathrm{Spin}(m)$ consists of products of an even number of unit vectors inside its invertible even part. Conjugation on the embedded ${\mathbb{R}}^m$ defines the standard double covering $\mathrm{Spin}(m)\to SO(m)$ with group kernel $\{\pm 1\}$. The Clifford relations show that a unit-vector reflection, with the usual twisted conjugation, is a hyperplane reflection; the even products give orientation-preserving transformations. The Cartan–Dieudonné theorem states that every orthogonal transformation is a product of reflections, proving surjectivity. For $m\ge 3$ this connected covering group is simply connected; $\mathrm{Spin}(2)$ is a circle.

Here is an explicit exterior-square construction of the requested six-dimensional map. Put $E={\mathbb{C}}^4$ with its standard Hermitian form and volume $e_1\wedge e_2\wedge e_3\wedge e_4$. On ${\Lambda }^{2}E$, write $e_{ij}=e_i\wedge e_j$ and define an antilinear map $J$ byIt satisfies $J^2=1$. Intrinsically, if $u\wedge v=B(u,v)\mathrm{vol}$ and the Hermitian inner product $h$ is linear in its first variable, then $B(u,Jv)=h(u,v)$. Because $SU(4)$ preserves both $B$ and $h$, it commutes with $J$. This is the real structure of the SU4 exterior square.

The fixed space $W$ has the following real orthonormal basis, with all vectors divided by $\sqrt{2}$:Thus $W$ is six-dimensional over $\mathbb{R}$, its complexification is ${\Lambda }^{2}E$, and the exterior-square action restricts to an orthogonal representation on $W$. Its determinant is one because $SU(4)$ is connected. We obtain $R:SU(4)\to SO(W)\cong SO(6)$.

To compute the group kernel, diagonalize $g\in SU(4)$ with eigenvalues $z_1,\dots ,z_4$. If $R(g)=I$, its complexified exterior-square action is the identity, hence $z_i{z}_j=1$ for every $i<j$. Comparing pairs shows that all $z_i$ are equal, and their common value has square one. A unitary matrix with that single eigenvalue is scalar, so $\ker R=\{\pm I_4\}$. Conversely, those two scalar matrices plainly act trivially on the exterior square.

The differential of $R$ is injective because its group kernel is finite. Both Lie algebras have dimension $15$, so the differential is an isomorphism. Its image is consequently open in connected $SO(6)$, hence all of $SO(6)$. ThereforeThis also realizes $SU(4)$ as $\mathrm{Spin}(6)$, since $SU(4)$ is simply connected, by uniqueness of the connected simply connected covering group.

For $v=(v_1,v_2,v_3)$ define the skew-symmetric matrixThen $\hat{v}x=v\times x$. This is a linear isomorphism ${\mathbb{R}}^3\to \mathfrak{so}(3)$, with inverse $\varphi (\xi )=({\xi }_{32},{\xi }_{13},{\xi }_{21})$. Since rotations preserve the cross product,Thus $\varphi$ intertwines the Adjoint representation with the standard representation. The vector triple-product identity gives, for every $x$,Consequently $[\hat{v},\hat{w}]=\widehat{v\times w}$ and the chosen normalization satisfiesNo undetermined scale remains in this explicit matrix convention.

Identify $SU(2)$ with the unit quaternions usingThe relations $jz=\overline{z}j$ and $j^2=-1$ verify multiplication, and every matrix in $SU(2)$ has this form. If $v$ is imaginary, then $\overline{v}=-v$. Quaternionic conjugation reverses product order and $q^{-1}=\overline{q}$, soThus conjugation preserves $\mathrm{Im}\mathbb{H}\cong {\mathbb{R}}^3$. Multiplicativity of the quaternion norm shows that this action preserves the inner product. The unit quaternions form the connected three-sphere, so its determinant, equal to one at the identity, is always one. We obtain a homomorphism $C:SU(2)\to SO(3)$.

Its group kernel consists of unit quaternions commuting with every imaginary quaternion. Commuting with both $i$ and $j$ forces a quaternion to be real, so the group kernel is exactly $\{\pm 1\}$. To prove surjectivity explicitly, let $u$ be a unit imaginary quaternion and put $q=\cos (\theta /2)+u\sin (\theta /2)$. For imaginary $u,v$, multiplication satisfies $uv=-u\cdot v+u\times v$. Expanding $qv{q}^{-1}$ therefore givesThis is the Rodrigues rotation formula about axis $u$. Every element of $SO(3)$ has such an axis-angle description: an odd-dimensional orthogonal matrix of determinant one has an eigenvector of eigenvalue one, and its action on the perpendicular plane is a plane rotation. Hence $C$ is onto, andThis is the quaternionic form of the Adjoint double cover from SU(2) to SO(3). Its differential sends an imaginary quaternion $u$ to $2\hat{u}$, because $[u,v]=2u\times v$, consistent with the bracket normalization used above.

Write $g=(a,b)$ for the affine map $z\mapsto az+b$. Conjugation by $(a,0)$ sends translation by $b$ to translation by $ab$, so it permutes transitively the nontrivial characters of $U$. Since $U$ is normal, the induced character is zero outside $U$. On a translation by $b$ it is the sum of all conjugates of $\psi$, henceFor $b\ne 0$ the sum of the nontrivial additive characters is minus one, since the sum including the trivial character is zero. Its character norm isBy the irreducibility criterion for characters, $\rho ={\mathrm{Ind}}_U^G\psi$ is irreducible of dimension $p-1$. All choices of nontrivial $\psi$ give the same representation.

For any permutation $\tau$, conjugating a permutation cycle relabels its entries:Indeed, the conjugate sends $\tau (a_j)$ to $\tau (a_{j+1})$ and fixes the other relabeled entries exactly as the original permutation cycle does. Therefore conjugation preserves the multiset of permutation cycle lengths. Conversely, if two permutations have the same cycle type, pair their permutation cycles of each length and let $\tau$ carry the $j$th entry of each first permutation cycle to the $j$th entry of its partner. Include one-cycles for fixed points. This defines a bijection of all labels, and the displayed relabeling identity makes the permutations conjugate. ThusFor $n\ge 2$, the alternating conjugacy class splitting criterion says that an even permutation has the same class in $A_n$ and $S_n$ precisely when its type is not a collection of pairwise distinct odd lengths. Equivalently, there is an even-length permutation cycle or a repeated permutation cycle length, counting each fixed point as a length-one permutation cycle. Distinct odd lengths instead give two alternating-group classes. For $n=1$, $A_1=S_1$ and the sole class is the same; the index-two splitting criterion is not applicable.

Squaring an odd-length permutation cycle keeps one permutation cycle of that length, since advancing by two visits all of its entries. Squaring an even-length permutation cycle splits it into two permutation cycles, each of half that length. Thus any even-length permutation cycle strictly increases the total permutation cycle count on squaring, while odd permutation cycles leave that count unchanged. The cycle type can agree with its square exactly when every length is odd. This proves permutation conjugate to its square:The final equivalence follows because the order of a group element that is a permutation is the least common multiple of its permutation cycle lengths.

The possible even types on five labels are the identity, a three-cycle, a product of two disjoint transpositions and a five-cycle. The identity and the double transpositions are their own inverses. For a three-cycle $(abc)$ with unused labels $d,e$, the even permutation $(bc)(de)$ conjugates it to its inverse. For a five-cycle $(abcde)$, the even permutation $(be)(cd)$ reverses its order. Therefore every element of $A_5$ is conjugate to its inverse within $A_5$. Inverting a five-cycle uses two transpositions, in agreement with inversion of an odd cycle in an alternating group.

A small counterexample elsewhere isThe alternating group $A_3=\{e,(123),(132)\}$ is cyclic and therefore abelian. Every conjugacy class in an abelian group is a singleton, while $\sigma \ne {\sigma }^{-1}$. Thus these two elements are not conjugate in $A_3$.

A composition series is a subnormal chain whose nontrivial successive quotients are simple. The Jordan–Hölder theorem asserts that any two composition series of a finite group have the same length and the same multiset of simple factors, up to isomorphism. Existence follows by successively choosing maximal proper normal subgroups until the identity is reached.

For uniqueness, induct on the group order. Let $A,B$ be the penultimate terms of two series. If $A=B$, apply induction to that subgroup and add the common top factor. If $A\ne B$, their normality and maximality give $AB=G$. Put $C=A\cap B$. The isomorphism theorems giveBoth are simple. Take any composition series of $C$. Appending $A$ to it gives a series for $A$, so induction identifies the factors of the original series inside $A$ with the factors of $C$ together with $G/B$. Similarly the factors inside $B$ are those of $C$ together with $G/A$. Adding the respective top factors produces the same multiset in both cases. This proves uniqueness, including multiplicities and length.

A normal subgroup $K$ of order two is central because its automorphism group is trivial. By Jordan–Hölder, a composition series through $K$ leaves the simple quotient $G/K\cong A_5$. The image of $Z(G)$ in this quotient is central and hence trivial, since $A_5$ is nonabelian simple. ThusThe symmetric group $S_5$ has trivial group center: conjugation of each transposition by a central permutation must preserve its two-element support, forcing the permutation to fix every point. Since its Jordan–Hölder factors are $A_5$ and $C_2$, a normal subgroup of order two would equal that trivial group center, a contradiction.

Identify $C_2=\{1,-1\}$ and put $D=1\times A_5$ in $C_2\times S_5$. Its three maximal normal subgroups areThey are the three kernels of nonzero maps from the abelianization $C_2^2$ to $C_2$. There is no quotient $A_5$: a central $C_2$ must map trivially, while $S_5$ has no quotient $A_5$. The latter follows from its normal subgroups $1,A_5,S_5$, which can themselves be obtained by intersecting with the simple subgroup $A_5$ and using its trivial centralizer. The complete list of composition series isWithin $M_1$ the two direct factors are the only maximal normal subgroups; within each of $M_2,M_3\cong S_5$ the only such subgroup is its copy of $A_5$. Hence there are exactly four series.

For $S_5\times S_5$, put $D=A_5\times A_5$, $X=A_5\times 1$, $Y=1\times A_5$ andAgain these are exactly the maximal normal subgroups: they are the three cyclic quotient kernels, and there is no simple quotient $A_5$ of the whole product. All series aretogether withTo verify exhaustiveness, $M_L$ has maximal normal subgroups $D$ and $1\times S_5$, and $M_R$ has $D$ and $S_5\times 1$. A quotient $A_5$ of a direct product can receive a nontrivial image from only one simple factor, since the images commute and $A_5$ has trivial group center. The remaining maximal-normal possibility is $M_D$. Its derived subgroup is $D$, because both alternating factors are perfect. A hypothetical quotient $A_5$ would project one alternating factor isomorphically and kill the other, but conjugation by an odd diagonal element induces an outer automorphism on that surviving factor, impossible inside $A_5$. Odd conjugation is outer because otherwise an odd permutation times an even one would centralize $A_5$; a permutation commuting with every three-cycle fixes every three-element support and is the identity. Thus $D$ is the only maximal normal subgroup of $M_D$. Finally the only maximal normal subgroups of $D$ are $X,Y$: normal subgroups of a product of two centerless simple groups are products of the factors, as follows by commutating with each factor. This proves exactly eight series and the classification of composition chains in products with S5.

For $S{L}_2(5)$, commuting with both elementary upper and lower transvections forces a central matrix to be scalar. A scalar $\lambda I$ has determinant ${\lambda }^2$, soIf $g^2=I$, characteristic five makes $g$ diagonalizable with eigenvalues in $\{1,-1\}$. Determinant one rules out one of each, so the unique nonidentity involution is $-I$. An index-two subgroup would have order $60$ and, by the Cauchy theorem for groups, contain that involution and hence the group center. Its image in $PS{L}_2(5)$ would have index two. The simplicity and identification $PS{L}_2(5)\cong A_5$ are established by the independent matrix argument in Solution 4; a simple group has no proper index-two subgroup. Therefore $S{L}_2(5)$ has no subgroup of index two.

For $|G|=p^{a}m$ with $p\nmid m$, Sylow theorems assert existence of a subgroup of order $p^a$, containment of every p-subgroup in one, conjugacy of all these Sylow subgroups, andA group of order $20$ has $n_5\mid 4$ and $n_5\equiv 1(\mathrm{mod}5)$, so its Sylow 5-subgroup $P$ is unique. In $S_6$ it is generated by a five-cycle and has one fixed point. Its normalizer preserves that point and, on the other five points identified with ${\mathbb{F}}_5$, is the affine group $x\mapsto ax+b$. Every automorphism of the cyclic translation group is realized by a multiplier. Thus $|N_{S_6}(P)|=5\cdot 4=20$, forcing

Inside $S_5$ there are $120/20=6$ Sylow 5-subgroups. Conjugation gives a transitive action on them and a homomorphism into $S_6$. Its group homomorphism kernel is a normal subgroup of $S_5$, whose only possibilities are $1,A_5,S_5$. The latter two would leave an image of order at most two, incompatible with transitivity on six points. Hence it is faithful. Denote the resulting transitive copy of $S_5$ by $J\le S_6$.

The action of $S_6$ on the six cosets of $J$ is also faithful: its group homomorphism kernel cannot contain the simple subgroup $A_6$, since an image of order at most two is not transitive of degree six, and a normal subgroup disjoint from $A_6$ centralizes $A_6$ and is trivial. It therefore gives an automorphism $\tau :S_6\to S_6$ carrying $J$ to a natural point stabilizer. This automorphism is outer, because conjugation cannot carry a transitive subgroup to an intransitive one.

There are precisely two classes of copies of $S_5$ in $S_6$. A faithful intransitive copy must have an orbit of length five: all partitions of six into smaller orbits embed it in groups of order below $120$. Thus it is a natural point stabilizer. A transitive copy is a degree-six coset action of an abstract $S_5$, with an order-$20$ stabilizer. Every order-$20$ subgroup of $S_5$ is a Sylow-five normalizer, so these stabilizers are conjugate and the degree-six actions are permutation-equivalent. Hence all transitive copies form one class. The outer automorphism constructed above swaps these two classes; it cannot preserve the point-stabilizer class, since any automorphism preserving that class induces a relabeling of its six members, and equivariance of their faithful conjugation action then makes the automorphism inner.

Identify $S_6$ with its inner automorphism group inside $\overline{G}$. Every Sylow 5-subgroup of $\overline{G}$ is contained in $S_6$, since that normal subgroup has index two. There are $720/20=36$ of them. ConsequentlyTo prove maximality, first classify the proper overgroups of $N$ in $S_6$. The affine multiplier in $N$ of order four is a four-cycle and is odd. Within $H\cong S_5$, a proper overgroup larger than $N$ could only have order $60$, but the index-two subgroup is $A_5$ and cannot contain that odd element. Thus $N$ is maximal in $H$. A nontransitive overgroup of $N$ must fix its unique fixed point, so is $H$ if it is larger than $N$. A transitive overgroup $M$ has $M\cap H\ge N$; this point stabilizer is either $N$ or $H$. In the latter case $M=S_6$, and in the former $|M|=6\cdot 20=120$, making it a transitive copy of $S_5$.

There is exactly one such transitive copy containing $N$. There are six conjugates of $J$: applying the preceding overgroup argument to its own Sylow-five normalizer shows that $J$ is maximal, and $J$ is not normal. Each contains six Sylow 5-subgroups. Counting pairs of a conjugate copy and a Sylow subgroup gives $6\cdot 6=36$, with the same number through every one of the 36 Sylow subgroups of $S_6$. Thus each Sylow subgroup, and hence its normalizer $N$, is contained in exactly one transitive copy. In particular the only proper strict overgroups of $N$ are its natural $H$ and this $J$.

The subgroup $\overline{N}$ has an outer element, because it has twice the order of $N$. Such an element normalizes $P$ and swaps the unique overgroups $H,J$. If $\overline{N}\le U\le \overline{G}$, then $U\cap S_6$ is normalized by $\overline{N}$, so it cannot be just $H$ or just $J$. It is therefore $N$ or $S_6$. In the latter case $U=\overline{G}$. In the former $U$ normalizes $N$ and hence its unique Sylow 5-subgroup $P$, giving $U\le \overline{N}$. Therefore