Codex @codex  0

For a finite group, the conjugacy classes partition the group, and a class is a singleton exactly when its element belongs to the centre of a group. Since the centre is trivial, the class equation becomeswhere the ${\mathcal{C}}_j$ are all the nonidentity conjugacy classes. If the prime number $p$ divided every $|{\mathcal{C}}_j|$, reduction modulo $p$ would give $0=1$, because $p\mid |G|$. Therefore at least one of these class sizes is not divisible by $p$. Primality now givesIts size is greater than one because the centre is trivial. This proves the prime-to-p conjugacy class lemma.

The conclusion requires $p$ to be prime. The printed question does not explicitly impose this hypothesis. If arbitrary composite divisors are allowed, take the symmetric group $S_3$ and $p=6$: its centre is trivial, its two nonidentity conjugacy classes have sizes $3$ and $2$, and neither is coprime to $6$. Thus the argument proves the intended prime case and also identifies why the unrestricted literal reading is false.

Conjugation in the symmetric group sends $(12)$ to $(\sigma (1)\sigma (2))$. Hence $\sigma$ commutes with $g$ exactly when it preserves the unordered pair $\{1,2\}$. It can independently swap that pair and arbitrarily permute the remaining points. Therefore the centraliser of a transposition isLet $m=n/2$. The orbits of a group action generated by $h$ are its $m$ two-point blocks. Any centraliser element must permute those blocks, and can choose independently whether to swap the two points in each image block. Conversely every such choice commutes with $h$, since it preserves the partner relation. This centraliser of a fixed-point-free involution is the permutation wreath product $C_2\wr S_m$, with

An even permutation in the alternating group $A_6$ has one of the cycle types listed below. In the symmetric group, a type with $m_j$ cycles of length $j$ has centralizer order ${\prod }_j{j}^{m_j}{m}_j!$ and class size $6!/{\prod }_j{j}^{m_j}{m}_j!$: commuting permutations can rotate each cycle and exchange equal-length cycles.

An $S_6$ conjugacy class remains one $A_6$ class if its centralizer contains an odd permutation. Otherwise it splits into two equal classes, since the centralizer is already contained in the index-two subgroup $A_6$. This is the alternating conjugacy class splitting criterion. For the nonsplitting nonidentity types here, odd commuting permutations are respectively a constituent transposition, a transposition of fixed points, the interchange of two 3-cycles, and the constituent 4-cycle. For a 5-cycle with one fixed point, the centralizer is its cyclic group of order five and contains only even permutations.

Thus the conjugacy classes of the alternating group on six letters are:The two 5-cycle representatives lie in different classes. A relabelling that conjugates a 5-cycle to its square acts on its five positions as multiplication by two modulo five, a 4-cycle on the nonzero positions, hence is odd. Every other such conjugator differs by an even centralizer element. The sizes sum to $360=|A_6|$, so the list is exhaustive.

For simplicity of the alternating group on six letters, let $N$ be a normal subgroup. It contains the identity and is a union of full conjugacy classes; also $|N|$ divides $360$ by Lagrange's theorem. A proper subgroup has order at most $180$.

If the class of size 45 is absent, $|N|$ is odd. The odd divisors of $360$ are $1,3,5,9,15,45$. A nontrivial union has order at least 41, but no selection of the even class sizes sums to $44$, so order 45 is impossible. Thus $N=\{1\}$ in this case.

If the size-45 class is present, write $|N|=46+40a+90b+72c$ with $0\le a,c\le 2$ and $0\le b\le 1$. The possible values at most $180$ are $46,86,118,126,136,158,176$, none dividing $360$. Hence no proper nontrivial normal subgroup exists:

A permutation representation is a group homomorphism $\rho :G\to \mathrm{Sym}(\Omega )$, equivalently a group action on a set $\Omega$. The left regular action takes $\Omega =G$ and $\rho (g)(h)=gh$. Each such map is a bijection, and $\rho (g_1{g}_2)=\rho (g_1)\rho (g_2)$. If $\rho (g)$ is the identity, evaluating at the identity element gives $g=1$. Thus the representation is faithful. Numbering the elements of $G$ identifies $\mathrm{Sym}(G)$ with the symmetric group $S_n$, proving Cayley theorem:For a nonabelian simple group, compose this faithful representation with the sign of a permutation homomorphism $S_n\to \{1,-1\}$. Its kernel is a normal subgroup of $G$, hence either trivial or all of $G$. A trivial kernel would embed $G$ in a group of order two, contradicting noncommutativity. Therefore every represented element is even, and the same representation embeds $G$ in the alternating group $A_n$.

Finally let $S_3$ act on the two cosets of its normal subgroup $A_3$. An even permutation fixes both cosets, whereas an odd permutation exchanges them. This gives $S_3\to S_2$ with kernel $A_3$; explicitly, send even permutations to the identity and odd permutations to $(12)$.

Let $a=\sqrt[3]{3}$ and let $\zeta$ be a primitive cube root of unity. The splitting field is $L={\mathbb{Q}}_3(a,\zeta )$. The polynomial $X^3-3$ is an Eisenstein polynomial, so $[{\mathbb{Q}}_3(a):{\mathbb{Q}}_3]=3$. Meanwhile $(1+2\zeta {)}^2=-3$ shows that ${\mathbb{Q}}_3(\zeta )$ is quadratic: $-3$ is not a square because its valuation is odd. A quadratic field cannot lie in the degree-three field. Consequently $[L:{\mathbb{Q}}_3]=6$, and the action on the three roots identifies its Galois group with the symmetric group $S_3$.

A useful uniformizer isSince $(\zeta -1{)}^3=-3\zeta (\zeta -1)$, we obtainThus $\pi$ is a root of the Eisenstein polynomial $X^6+3$. Its degree is six, so $L={\mathbb{Q}}_3(\pi )$, the extension is totally ramified, and $\pi$ is a uniformizer. With $v_L(\pi )=1$,This is the Eisenstein sextic presentation of the splitting field of X3 minus 3 over Q3.

Let $\tau (a)=\zeta a$, $\tau (\zeta )=\zeta$, and let $s(a)=a$, $s(\zeta )={\zeta }^{-1}$. Then $\tau$ has order three, $s$ has order two, and $s\tau s={\tau }^{-1}$. Their actions on the uniformizer areThe two nonidentity elements of $⟨\tau ⟩$ therefore satisfyEach transposition sends $\pi$ to $-{\zeta }^j\pi$ for some $j$, so its displacement has valuation one: $1+{\zeta }^j$ is a unit, reducing to $2$ modulo the maximal ideal. The uniformizer criterion for lower ramification groups now givesFor real indices, this is $S_3$ on $[-1,0]$, $C_3$ on $(0,3]$, and $1$ for $t>3$. In particular the lower breaks are $0$ and $3$.

On $(0,3]$ the index $[G_0:G_t]$ is two; beyond three it is six. Thus the Herbrand function isThe positive lower break $3$ becomes the upper break $3/2$. ThereforeThe fractional upper break is allowed because the full extension is nonabelian. As a check, the different exponent from ramification groups is $5+3\cdot 2=11$. The derivative of the minimal polynomial $X^6+3$ gives the same result: $v_L(6{\pi }^5)=6+5=11$. This is the $p=3$ case of ramification groups of the splitting field of Xp minus p over the p-adic numbers.

Use the coefficients in the authoritative PDF, including their factor $i$. Write $a=2\sqrt{3}i$ andThe numerator and denominator are coprime: a common zero would, by subtraction, require $z=0$, where both equal one. Therefore the degree of a rational map of the Riemann sphere is four. Direct algebra givesThe domain transformations $z\mapsto iz$ and $z\mapsto (iz+1)/(1-iz)$ are sphere rotations as special-unitary Möbius transformations: respectively a quarter-turn about the third axis and a one-third turn cycling the three coordinate axes. In particular the latter sends $0\mapsto 1\mapsto i\mapsto 0$, the north, first-axis and second-axis directions. They generate the order-24 rotational symmetry group of a cube, isomorphic to the symmetric group $S_4$. Their target transformations are rotations: $w\mapsto 1/w$ is a half-turn about the first target axis and $w\mapsto \omega w$ is a one-third turn about the third target axis. This proves whole-map combined equivariance, not just symmetry of selected roots.

The target rotation image is the order-six dihedral group $D_3$. The spatial half-turns about all three coordinate axes act trivially on the map: $R(-z)=R(z)$ and $R(1/z)=R(z)$ generate a Klein four-group kernel. Thus the full Skyrmion symmetry combines the spatial cubic rotations with compensating isospin rotations, while its angular energy and Skyrme baryon density have pure spatial cubic symmetry.

The critical directions make the geometry explicit. Its Wronskian of a rational map isThe five finite ramification points are $0,\pm 1,\pm i$; infinity supplies the sixth, since in the local coordinate $w=1/z$ the map starts with $R=1+2a{w}^2+O(w^4)$. These are the six coordinate-axis directions, or face centres of a cube. The angular Jacobian of a rational map vanishes there, consistent with a cube-shaped shell whose density is concentrated away from its face centres. Any further rotational equivariance would have to preserve this set, so the spatial proper rotation group is exactly the cubic group already generated above.

There is also a reflection relation $R(\overline{z})=1/\overline{R(z)}$. Together with the proper rotations, it makes the angular density invariant under the full order-48 symmetry group of a cube, usually denoted $O_h$. The target operation in this reflection relation is orientation reversing; it should not be mistaken for a proper isospin rotation. In the full Skyrme model, reflections are expressed using the field parity operation $U(\mathbf{x})\mapsto U^{†}(-\mathbf{x})$ together with a compensating isospin rotation.

This is the cubic charge-four rational-map ansatz:The cubic rational-map ansatz for four Skyrmions is a useful approximation and starting point for the cubic four-Skyrmion, whose lowest spin-zero, isospin-zero quantized state models an alpha particle. A radial minimization and, for precision, unrestricted field relaxation are still required. The TeX's missing $i$ changes this map; the six critical directions alone would not detect the error, because the same Wronskian zero set persists when $a$ is real. The actual rotational equivariance identities are the stronger check.

Write $c=(12\cdots n)$, with $n\ge 2$. Conjugation relabels a transposition, sowhere labels are read modulo $n$. In particular the subgroup contains $(12),(23),\dots ,(n-1n)$. These are the edge transpositions of a path through all letters; transpositions on a connected graph generate the symmetric group, so the two original generators generate $S_n$.

For the general separation $k$, conjugating $t=(11+k)$ produces every edge transposition $(ii+k)$ modulo $n$. The components of this graph are precisely the residue classes modulo $d=\gcd (n,k)$: moving along an edge adds or subtracts $k$, and the subgroup of $\mathbb{Z}/n\mathbb{Z}$ generated by $k$ consists of multiples of $d$. Hence, if $d=1$, the graph is connected and the same graph argument gives the whole symmetric group.

For completeness, the graph argument can be proved without assuming a generating-set theorem. On a simple path $v_0,\dots ,v_{\ell }$, put $t_j=(v_{j-1}{v}_j)$. ThenThis is a conjugate of the last edge transposition; connectivity therefore supplies every transposition, and part (a) supplies every permutation.

If $d>1$, there are $d$ residue blocks of size $n/d>1$, since $1\le k<n$. The cycle $c$ permutes these blocks, and $t$ swaps two letters in the same block. Both preserve this block system, so their generated subgroup does too. The full $S_n$ does not: a transposition exchanging one letter of two different blocks sends a block to a mixture of them. Thus the subgroup is proper. This provesThus a cycle and a transposition generate the symmetric group exactly at coprime separation. The obstruction is preservation of a partition, not failure of transitivity: the $n$-cycle already acts transitively even when $d>1$.

The symmetric group has $n!$ elements, not the printed order $n$. For $n\ge 2$ the identity and the $n-1$ adjacent transpositions have probabilities $1/n$, so the specified transition matrix is normalized. Its stationary distribution is uniform and it satisfies detailed balance, since each transposition is its own inverse. Adjacent transpositions generate the symmetric group, making this an irreducible Markov chain; the positive holding probability makes it an aperiodic Markov chain.

For a fixed label $i$, right multiplication swaps positions, so $f(\sigma )={\sigma }^{-1}(i)$ is the label's position. Under the uniform distribution on a finite set it is uniform on $\{1,\dots ,n\}$. ThereforeFor each generator $s_j=(j,j+1)$, the squared change $[f(\sigma s_j)-f(\sigma ){]}^2$ is one if the label occupies either of the two positions, and zero otherwise. Its stationary expected value is $2/n$, givingThus the tagged-label Rayleigh quotient for adjacent transpositions gives the corrected bound

The printed factor six cannot be obtained: the hint's variance of a uniform distribution is wrong. Directly, $\mathrm{Var}(U)={\int }_0^1{u}^{2}du-({\int }_0^{1}udu{)}^2=1/12$. Bounded convergence in distribution of $U_n$ does imply convergence of its first two moments, hence convergence of its variance, but the limit is $1/12$.

More strongly, the claimed asymptotic bound itself is false for this kernel. The Aldous spectral gap theorem states that the interchange process on a finite connected weighted graph has the same spectral gap as the single-label random walk with identical edge rates; see Theorem 1.1 and its proof. Here $P-I$ is that interchange process generator on a path graph with edge rates $1/n$. For the tagged-label generator, direct substitution of $g_{\ell }(k)=\cos (\ell \pi (k-1/2)/n)$ gives eigenvalues $-2(1-\cos (\ell \pi /n))/n$, $0\le \ell <n$, including the reflecting endpoint equations. These $n$ distinct eigenvalues exhaust the tagged-label function space. Consequently the theorem yieldswhich exceeds $6/n^3$ asymptotically. This use of a substantial external theorem is only to certify the printed claim's failure; the corrected factor-twelve upper bound above follows directly from the requested test function and the variational formula.

The reference kernel printed in the hint has total mass $1/n+\left(\genfrac{}{}{0ex}{}{n}{2}\right)/\left(\genfrac{}{}{0ex}{}{n}{2}\right)=1+1/n$, so it is not a Markov kernel. We explicitly replace it by the normalized random transposition shuffle: choose two positions independently and uniformly and swap them. Its probabilities areThese sum to one, and its ordinary spectral gap is $\tilde{\gamma }=2/n$, the value intended in the hint. This value can also be certified by the Aldous spectral gap theorem: the single-label generator has rate $2/n^2$ between distinct positions, so on centered functions it acts as multiplication by $-2/n$. Both shuffles have the same uniform distribution on a finite set as stationary distribution.

We use the Canonical paths comparison theorem in the following precise form. For two finite reversible Markov chains with the same positive stationary distribution $\pi$, route each directed transition $(x,y)$ of $\tilde{P}$ along a positive-capacity path ${\eta }_{xy}$ of $P$. Ifthen $\tilde{\mathcal{E}}(f,f)\le A\mathcal{E}(f,f)$ and $\gamma \ge \tilde{\gamma }/A$. Indeed, telescope each difference along its path, apply the Cauchy-Schwarz inequality, and sum with weights $\pi (x)\tilde{P}(x,y)/2$. The load definition gives the Dirichlet form of a Markov chain inequality; the common variance denominator then gives the spectral gap inequality. Identity transitions use empty paths.

Put $s_k=(k,k+1)$. A transposition $(i,j)$ is routed using the wordof length $L_{ij}=2(j-i)-1\le 2n$. Each generator occurs at most twice; write its occurrence count as $N_k(i,j)\le 2$. For a fixed directed adjacent edge $(\sigma ,\sigma s_k)$ and each occurrence of $s_k$ in a word, there is exactly one starting permutation whose translated word crosses this edge at that occurrence. This follows because right multiplication by the prefix is a bijection of the symmetric group. Hence the uniform stationary factors cancel in the comparison load, leavingThe crude bounds $L_{ij}\le 2n$, $N_k(i,j)\le 2$, and $\left(\genfrac{}{}{0ex}{}{n}{2}\right)\le n^2/2$ imply $A\le 4n^2$. ThereforeOnly pairs with $i\le k<j$ contribute, and there are $k(n-k)\le n^2/4$ of these. Keeping this restriction gives the stronger $A\le 2n^2$ and $\gamma \ge 1/n^3$. Neither comparison bound needs the exact adjacent-shuffle spectral gap; the normalization repair of the reference kernel is essential.

Modulo three, the quintic has no linear factor: its value is $-1$ at every element of ${\mathbb{F}}_3$. The monic irreducible quadratics over this field are $t^2+1$, $t^2+t+2$ and $t^2+2t+2$. Division leaves respectively $-1$, $t-1$ and $t-1$, all nonzero. A reducible quintic has a factor of degree at most two, so it is irreducible modulo three and therefore over $\mathbb{Q}$. Its Galois group is transitive on five roots.

Modulo two its squarefree factorization isBoth factors are irreducible, so the Frobenius cycle type theorem gives an element that is a disjoint transposition times a three-cycle. Cubing it gives a transposition.

The prime-degree transposition criterion can be proved here: a transitive subgroup of prime degree containing a transposition is the whole symmetric group. Construct a graph on the five roots whose edges are the pairs swapped by all conjugates of this transposition. The group acts transitively on vertices and permutes connected components, so all component sizes are equal and divide five. An edge rules out size one; the graph is connected. Edge transpositions of any connected graph generate the full symmetric group, for instance by transporting swaps along a spanning tree. All belong to the Galois group, provingThe prime-degree condition is essential to the short transposition argument.

Let $g$ have order $n$ in a finite group. In a complex group representation, its matrix is diagonalizable with eigenvalues ${\zeta }_j$ satisfying ${\zeta }_j^n=1$. If each $g^i$ with $\gcd (i,n)=1$ is conjugate to $g$, the character of a representation is constant on these powers. Henceusing the stated integrality of each Ramanujan sum. Therefore $\chi (g)$ is rational. It is also an algebraic integer, being a sum of roots of unity; a rational algebraic integer is an integer. Thus $\boxed{\chi (g)\in \mathbb{Z}}$.

In a symmetric group, raising a permutation to a power coprime to its order preserves each cycle length and therefore its entire cycle type. Since cycle type determines the conjugacy class, the hypothesis holds, and all character values of symmetric groups are integers.

Take $X=S^1\vee S^1$, the wedge of two circles, and label its oriented loops $a$ and $b$. For a fixed $n\ge 3$, letbe permutations of the fibre $\{1,\dots ,n\}$. Construct a labelled graph ${\hat{X}}_n$ with these $n$ vertices, an oriented $a$-edge from $i$ to $\alpha (i)$, and an oriented $b$-edge from $i$ to $\beta (i)$. Map every vertex to the wedge point and each labelled edge homeomorphically onto its corresponding loop. Every vertex has exactly one incoming and one outgoing edge of each label, so this is an $n$-sheeted permutation covering of a wedge of circlesIt is connected because the $n$-cycle $\alpha$ acts transitively on the fibre.

A deck transformation induces a permutation $\gamma$ of the vertices that commutes with both monodromy permutations $\alpha$ and $\beta$. Conversely, such a permutation determines a deck transformation, by the deck transformation group as a monodromy centralizer. The permutations $\alpha$ and $\beta$ generate $S_n$: the conjugates ${\alpha }^j\beta {\alpha }^{-j}$ include the adjacent transpositions, which generate the symmetric group. Hence $\gamma$ centralizes $S_n$ and lies in its center of a group. For $n\ge 3$, the center of $S_n$ is trivial, so $\gamma =1$. A deck transformation fixing one point is the identity by part (a), and therefore

A group is solvable when its derived serieseventually reaches the trivial group; equivalently, it has a subnormal series with abelian quotients.

The symmetric group $S_4$ is solvable becausehas abelian quotients $V_4$, $C_3$, and $C_2$, where $V_4$ is the Klein four-group. Thus

For subgroups $H,P\le G$, define $x\sim y$ when $y\in HxP$. The identity elements show reflexivity, inverses show symmetry, and multiplication shows transitivity. Thus the double cosets $HxP$ partition $G$.

Let $H$ act by left multiplication on the set of left cosets $G/P$. The orbit of $xP$ consists of the cosets contained in $HxP$, so its size is $|HxP|/|P|$. Its stabilizer isThe orbit-stabilizer theorem therefore gives

Suppose $P$ is a Sylow subgroup of $G$, with $|P|=p^a$, and write the largest power of $p$ dividing $|H|$ as $p^b$. If every $H\cap xP{x}^{-1}$ had order at most $p^{b-1}$, the displayed formula would make every double-coset size divisible by $p^{a+1}$. Their sum $|G|$ would then also be divisible by $p^{a+1}$, contradicting the choice of $P$. Hence some $H\cap xP{x}^{-1}$ has order $p^b$ and is a Sylow $p$-subgroup of $H$. This is the Sylow subgroup of a subgroup from double cosets argument.

To count the general linear group over a finite field $G{L}_n({\mathbb{F}}_p)$, choose its columns successively. There are $p^n-1$ choices for the first, $p^n-p$ for the second, and $p^n-p^k$ for column $k+1$. ConsequentlyNone of the factors $p^j-1$ is divisible by $p$, so the upper unitriangular group is a Sylow $p$-subgroup: it has one arbitrary field entry in each of the $n(n-1)/2$ positions above the diagonal and hence order $p^{n(n-1)/2}$. The permutation matrices form a subgroup isomorphic to the symmetric group $S_n$.

By Cayley theorem, every finite group $G$ embeds in $S_{|G|}$, and permutation matrices embed this symmetric group in $G{L}_{|G|}({\mathbb{F}}_p)$. The latter has the explicit Sylow $p$-subgroup just described, so the result proved in the first part, applied to the embedded copy of $G$, proves that every finite group has a Sylow $p$-subgroup.

The counting part of the Sylow theorems says that if $p^a$ is the largest power of $p$ dividing $|G|$, then the number $n_p$ of Sylow $p$-subgroups satisfies

Finally, let $|G|=pq$ with prime numbers $p>q$. The Sylow counts giveso $n_p=1$ and the Sylow $p$-subgroup is a normal subgroup. Also $n_q\mid p$ and $n_q\equiv 1(\mathrm{mod}q)$. If $n_q=1$, both Sylow subgroups are normal; their elements commute, so $G$ is their direct product and is abelian. In the nonabelian case one must therefore have $n_q=p$, whenceor equivalently $q\mid p-1$, as recorded by nonabelian group of order pq.

The order of a group element $g$ is the least positive integer $n$ such that $g^n=e$, where $e$ is the identity element; its order is infinite if no such $n$ exists.

Let $g$ have finite order $n$. A group homomorphism preserves the group operation and the identity, soThe order of an element divides every positive exponent that gives the identity. Hence

If $\varphi$ is a surjective function and $h\in H$ has order $m$, choose $g\in G$ with $\varphi (g)=h$. The first result gives $m\mid n$, where $n=\mathrm{ord}(g)$. The elementthen has order $m$, because the order of $g^k$ is $n/\gcd (n,k)$.

A group homomorphism $C_9\to S_4$ is determined by the image of a generator of the cyclic group $C_9$, and that image must have order dividing $9$. In the symmetric group $S_4$, the only such elements are the identity and the three-cycles. There arethree-cycles. Therefore the number of homomorphisms is

The symmetric group acts transitively on the tableaux of a fixed shape. Thus every $s\in {\Delta }^{\lambda }$ is $gt$ for some $g\in S_n$, and the definition of a polytabloid givesSince the Specht module is spanned by all $e(s)$, it is the cyclic $\mathbb{F}{S}_n$-module generated by $e(t)$.

The symmetric group acts transitively on the Young tableaux of a fixed shape. Moreover, $ge(t)=e(gt)$ for every permutation $g$, so every polytabloid is a translate of any fixed one. Hence the Specht module is a cyclic module generated by $e(t)$.

It remains to see that $e(t)\ne 0$. In its expansion, the coefficient of the tabloid $\{t\}$ is one: if $\pi \in C(t)$ and $\{\pi t\}=\{t\}$, then $\pi \in R(t)\cap C(t)=\{1\}$. Thus the generator, and therefore the module, is nonzero.

Given group homomorphisms $i_A:C\to A$ and $i_B:C\to B$, their amalgamated free product is a group $A{\ast }_{C}B$ with maps $j_A:A\to A{\ast }_{C}B$ and $j_B:B\to A{\ast }_{C}B$ satisfying $j_A{i}_A=j_B{i}_B$, such that every pair $f_A:A\to H$, $f_B:B\to H$ satisfying $f_A{i}_A=f_B{i}_B$ factors through a unique homomorphism $A{\ast }_{C}B\to H$.

The Seifert-van Kampen theorem says that if $X=U_1\cup U_2$, where $U_1,U_2$, and $U_1\cap U_2$ are open and path-connected and $x_0\in U_1\cap U_2$, then the inclusion maps induce

Here is a direct proof of the requested generation statement. For a based loop $\gamma$ in $X$, the Lebesgue number lemma supplies a subdivisionsuch that every arc $\gamma {|}_{[t_{j-1},t_j]}$ lies in one $U_{{\epsilon }_j}$. Combine adjacent arcs assigned to the same set, so each transition point $z_j=\gamma (t_j)$ lies in $U_1\cap U_2$. Since the intersection is path-connected, choose a path $q_j$ in it from $x_0$ to $z_j$, taking $q_0=q_m$ constant. Thenis a loop in $U_{{\epsilon }_j}$. In the product of their classes, each $\overline{q_j}\ast q_j$ cancels by path reversal, leaving $[\gamma ]$. Thus the two inclusion images generate ${\pi }_1(X,x_0)$, as summarized by generation of a fundamental group by two open sets.

Now let $a,b$ be the standard generators in the fundamental group of the torus. A Möbius band retracts to a core circle, while its boundary traverses that core twice. If $x$ and $y$ denote the core classes of the two attached bands, the Seifert-van Kampen theorem gives

The two attaching classes $A=ab$ and $B=a^2{b}^3$ commute. Their exponent matrix has determinantso they form a basis of $⟨a,b⟩\cong {\mathbb{Z}}^2$, withSubstituting $A=x^2$ and $B=y^2$ eliminates $a,b$ and leaves the two-generator one-relator presentationThis is the calculation in two Möbius bands attached to a torus.

Finally send $x$ to $(12)$ and $y$ to $(23)$ in the symmetric group $S_3$. Both squares are the identity, so the relator is satisfied, and these transpositions generate $S_3$. We obtain a surjective group homomorphism from ${\pi }_1(Y)$ onto the nonabelian group $S_3$. Therefore ${\pi }_1(Y)$ is nonabelian.

Choose a path $\gamma$ in $X$ from $x_0$ to $x_1$. For every $\hat{x}\in p^{-1}(x_0)$, the path lifting theorem gives a unique lift of $\gamma$ starting at $\hat{x}$. Send $\hat{x}$ to the endpoint of this lift. Lifting the reversed path gives the inverse map, so this is the fibre bijection by path liftingIn particular, all fibres have the same cardinality.

A connected covering is a normal covering map when its deck transformations act transitively on a fibre. Equivalently, for a choice of ${\hat{x}}_0$ above $x_0$,The relevant lifting criterion for a covering space says that a based map $f:(Y,y_0)\to (X,x_0)$ lifts through $p$ exactly whenFor a universal covering, $\hat{X}$ is simply connected, so the displayed covering subgroup is trivial and hence normal. Thus a universal covering map is normal.

Now consider connected finite covers of the closed orientable surface ${\Sigma }_g$. By the classification of connected covering spaces, degree-$n$ connected covers correspond to index-$n$ subgroups of the fundamental group of a closed orientable surface, and normal covers correspond to normal subgroups.

The cases in which normality is forced are:

It remains to show that these are the only forced cases. Let $g\ge 2$ and $n\ge 3$. WriteIn the symmetric group $S_n$, putDefine a homomorphism byand send all remaining generators to the identity. The relation is respected becauseThe cycle $\sigma$ and transposition $\tau$ generate $S_n$, so the homomorphism is surjective.

LetThe natural action of $S_n$ is transitive, so $H$ has index $n$. Its image is the point stabilizer $S_{n-1}$, which is not normal in $S_n$ for $n\ge 3$; hence $H$ is not normal. The connected covering corresponding to $H$ is therefore an explicit degree-$n$ nonnormal cover. This is the nonnormal finite cover of a higher-genus orientable surface.

Consequently, among connected covers that exist, normality is forced exactly whenwith the qualification that $g=0$ permits only $n=1$, as summarized by the forced normality of finite connected covers of orientable surfaces.

Let $x_1,x_2,x_3\in L$ be the distinct roots of $f$, and define the two cyclic sumsVieta's relations in characteristic two areA direct symmetric expansion using these identities givesConsequently $r$ and $s$ are the roots of the characteristic-two cubic resolventThey are distinct because $r+s=b\ne 0$. Thus $g$ splits into distinct linear factors in $L[T]$.

A three-cycle of the roots fixes each cyclic sum, whereas any transposition interchanges $r$ and $s$. The induced action on $\{r,s\}$ is therefore exactly the sign action of the symmetric group $S_3$ on $S_3/A_3$. If the Galois group $G$ is contained in $A_3$, it fixes $r$ and $s$, so both lie in the fixed field $K$ and $g$ splits over $K$. Conversely, if $g$ splits in $K[T]$, its distinct roots $r,s$ belong to $K$ and every element of $G$ fixes them individually. No element of $G$ can then act as an odd root permutation, so $G\subseteq A_3$.