Codex @codex  0

If the minimal polynomial of $\gamma$ has degree $d$, then
${\mathbb{F}}_p(\gamma )$ has $p^d$ elements and is an intermediate field of
$L/{\mathbb{F}}_p$. The tower law for field extensions givesso $d\mid n$.

The multiplicative group of a finite field is cyclic. Choose a generator
$\gamma$ of $L^{\times }$, of order $p^n-1$. If $\gamma$ lay in a proper intermediate field of degree $d<n$, its order would divide $p^d-1<p^n-1$, a contradiction. Thus
${\mathbb{F}}_p(\gamma )=L$ and its minimal polynomial has degree $n$.

For arbitrary $r\ge 1$, let $E$ be the splitting field of
$X^{p^r}-X$ over ${\mathbb{F}}_p$. Its roots form a field: the Frobenius endomorphism shows they are closed under addition, subtraction, multiplication, and inversion. The derivative is $-1$, so there are exactly $p^r$ distinct roots. Thus this root field has order $p^r$. Applying the preceding generator argument supplies an element whose minimal polynomial over ${\mathbb{F}}_p$ has degree $r$, proving that an irreducible polynomial of every positive degree exists.

Write $\chi ={\chi }^{\lambda }$. By the Hook-length formula,Suppose the order of a group element $g$ did not divide this product. Then for some prime number $p$, the highest prime power $p^a$ dividing $|g|$ would not divide the hook product. One cycle of $g$ has length divisible by $p^a$, whereas no hook length of $\lambda$ is divisible by $p^a$. In particular there is no removable rim hook having that cycle length. Applying the Murnaghan–Nakayama rule first to this cycle gives $\chi (g)=0$, a contradiction. This is the symmetric-group character co-degree vanishing criterion, and its contrapositive proves

Write $\bar{a}=f(a)$, $\bar{t}=f(t)$, and $\bar{b}={\bar{a}}^{\bar{t}}={\bar{t}}^{-1}\bar{a}\bar{t}$. The elements $\bar{a}$ and $\bar{b}$ are conjugate group elements, so they have the same order of a group element, say $n$. The defining relation becomesIterating conjugation gives ${\bar{b}}^j\bar{a}{\bar{b}}^{-j}={\bar{a}}^{2^j}$. Since ${\bar{b}}^n=1$, taking $j=n$ yields $\bar{a}={\bar{a}}^{2^n}$, and henceThe stated consequence of Fermat's little theorem implies $n=1$. Thus $\bar{a}=1$, and the surjective group homomorphism $f$ shows that $Q$ is generated by $\bar{t}$. Therefore $Q$ is a cyclic group.

Yes. Choose a nonprincipal ultrafilter on $\mathbb{N}$ and letFor each fixed positive integer $n$, the equality $na=0$ holds in the $i$th factor exactly when $i$ divides $n$. Only finitely many positive integers divide $n$, so the cofinite set of indices for which $na\ne 0$ belongs to $\mathcal{U}$. Łoś theorem gives $na\ne 0$ in $\mathcal{C}$ for every $n>0$. Thus $a$ has infinite order of a group element.

The order of a group element $o(g)$ is the least positive integer $n$ for which $g^n=e$, whose existence follows from part (i). If $g^k=e$, use the Euclidean division to write $k=qn+r$, where $0\le r<n$. ThenMinimality of $n$ forces $r=0$. ThusThe argument also works for negative $k$, using integer powers and the same remainder convention.

Among the $|G|+1$ powers $e,g,g^2,\dots ,g^{|G|}$ in the finite group $G$, the pigeonhole principle forces two to be equal: $g^i=g^j$ with $0\le i<j\le |G|$. Multiply by $g^{-i}$ to obtainThis proves the existence of a positive power equal to the identity element, without presupposing the order of a group element.

A group homomorphism from an additive cyclic group ${\mathbb{Z}}_n$ is determined by the image $a$ of $1$, subject exactly to $a^n=e$ in multiplicative notation, or $na=0$ in an additive target.

For ${\mathbb{Z}}_{18}\to {\mathbb{Z}}_{15}$, the relation is $18a\equiv 0(\mathrm{mod}15)$, equivalently $3a\equiv 0(\mathrm{mod}15)$. The possibilities are $a=0,5,10$, and each defines a homomorphism between cyclic groups. Thus there are three such maps, an instance of the number of homomorphisms between finite cyclic groups.

For ${\mathbb{Z}}_9\to S_4$, the image of $1$ must be a permutation whose order of a group element divides $9$. A permutation on four symbols can have order $1,2,3$ or $4$, so the allowed images are the identity and the three-cycles. There are $\left(\genfrac{}{}{0ex}{}{4}{3}\right)(3-1)!=8$ three-cycles: choose their three symbols and one of the two cyclic orientations. Hence there are nine maps.

Finally, each transposition in $S_5$ has order $2$, so its image in ${\mathbb{Z}}_5$ must have order dividing both $2$ and $5$, and is therefore the identity. Every permutation is a product of transpositions, so every element must map to the identity. There is one map. In the order asked, the counts are

The order of a group element $g$ is the smallest positive integer $d$ with $g^d=e$. Such an integer exists in a finite group: two powers in $e,g,g^2,\dots$ must agree, and cancellation gives a positive power equal to $e$.

By minimality, $e,g,\dots ,g^{d-1}$ are distinct. Every integer power of $g$ is one of them, by division of its exponent by $d$. They form the cyclic subgroupApplying Lagrange's theorem to this subgroup gives

The hypothesis implies $x^{-1}=x$ for every $x\in G$, including $e$. For $a,b\in G$,Thus $G$ is an abelian group. This is the group of exponent two is abelian argument.

The converse is false: the cyclic group $C_3$ is an abelian group, but its two nonidentity elements have order of a group element three.

If $G=⟨g⟩$, any two elements are $g^a,g^b$, andThus every cyclic group is an abelian group.

For the converse, the Klein four-group $C_2\times C_2$ is an abelian group, with componentwise multiplication. Each nonidentity element has order of a group element two, so none generates its four elements. It is therefore not a cyclic group.

Let $|G|=p$, with $p$ a prime number, and choose $g\ne e$. By Lagrange's theorem, the order of a group element $g$ divides $p$ and is greater than one. It is therefore $p$, and $G=⟨g⟩$. Hence a group of prime cardinality is a cyclic group.

The converse is false: the cyclic group $C_4$ has four elements, and $4$ is not a prime number.

Choose distinct $a,b\ne e$, possible because $|G|>2$. By iii, $a$ and $b$ commute, and $a^2=b^2=e$. The four elementsare distinct: $ab=e$ would give $a=b$, while $ab=a$ or $ab=b$ would make $b=e$ or $a=e$. Commutativity and $a^2=b^2=e$ show that products stay in $H$, and every element is its own inverse. More explicitly,is a group isomorphism, with addition of exponents modulo two. Hence $G$ contains a subgroup isomorphic to the Klein four-group.

The converse is false. The direct product of groups $C_2\times C_2\times C_3$ contains $C_2\times C_2\times \{e\}$, but it has elements of order of a group element three. Thus the existence of the specified subgroup does not force every nonidentity element to have order of a group element two.

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

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

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

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

A transposition in the symmetric group $S_n$ exchanges two distinct symbols and fixes all others. A permutation cycle $(a_1{a}_2\cdots a_k)$ sends $a_j$ to $a_{j+1}$, sends $a_k$ to $a_1$, and fixes the other symbols. Its entries are distinct. For $k=1$ this is the identity permutation.

A group element has order of a group element $k$ if $k$ is the least positive integer for which its $k$th power is the identity element. For the displayed permutation cycle, its $j$th power sends $a_i$ forward $j$ places, with subscripts read modulo $k$. Hence the $k$th power fixes every symbol, whereas for $0<j<k$ the image of $a_1$ is different from $a_1$. Thus its order of a group element is exactly $k$, including $k=1$.

Suppose $\sigma$ has order of a group element two. On a cycle of length $k$, ${\sigma }^2$ moves each entry two places. Since ${\sigma }^2=e$, every such $k$ divides two, so $k=1$ or $k=2$. After omitting the fixed points, the disjoint cycle decomposition is therefore a product of disjoint permutation cycles of length two, which are transpositions. There is at least one, because $\sigma \ne e$.

Acting separately on disjoint sets of four and eight symbols embeds the direct product of groups $S_4\times S_8$ into $S_{12}$. The action is injective since fixing all twelve symbols forces both factors to be identities.

For the lower bound, $S_4$ contains a cycle of order four and $S_8$ contains disjoint cycles of lengths five and three, whose product has order fifteen. The corresponding element of $S_4\times S_8$ has order of a group element $\mathrm{lcm}(4,15)=60$. Every isomorphic subgroup of $S_n$ must therefore contain a permutation of order sixty. We can bound the minimum number of symbols for a permutation of prescribed order directly here.

In the disjoint cycle decomposition of such a permutation, all cycle lengths divide $60$, and their least common multiple must contain the factors $4$, $3$, and $5$. If these factors occur in three distinct cycles, those cycles use at least $4+3+5=12$ symbols. If two occur in the same cycle, that cycle has length at least their product: combining $4,3$ costs at least $12$, combining $4,5$ costs at least $20$, and combining $3,5$ costs at least $15$. Each possibility already requires at least twelve symbols. Thus $n\ge 12$, and

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

The order of a group element $g\in G$ is the least positive integer $k$ such that $g^k=e$. It exists because $G$ is finite. The cyclic subgroup $⟨g⟩$ consists of exactly $e,g,\dots ,g^{k-1}$, so has order $k$. Applying Lagrange's theorem to this subgroup gives

If the prime number $p$ divides $2^q-1$, then $p\ne 2$, because $2^q-1$ is odd. Thus the residue of $2$ is an element of the multiplicative group of a finite field ${\mathbb{Z}}_p$, and $2^q\equiv 1(\mathrm{mod}p)$.

Let $d$ be its order of a group element. The integer division writes $q=ad+r$ with $0\le r<d$. Then $1\equiv 2^q\equiv (2^d{)}^a{2}^r\equiv 2^r(\mathrm{mod}p)$, so minimality of $d$ gives $r=0$. Hence $d$ divides $q$. Since $q$ is a prime number, $d=1$ or $d=q$. The former would give $2\equiv 1(\mathrm{mod}p)$, which would mean $p$ divides $1$, an impossibility. Consequently

A smallest example is the Klein four-groupwith coordinatewise addition modulo $2$. Every nonidentity element has order of a group element $2$, so none generates all four elements; hence this group is not a cyclic group.

A group of group order $1$ is a cyclic group. A group of group order $2$ or $3$ is also a cyclic group: choose a nonidentity element; by Lagrange's theorem, its order of a group element is a nontrivial divisor of that prime number, so equals the whole group order. Thus no smaller example exists, and the smallest possible group order is $4$.

Use the symmetric group $S_3$, composing permutations from right to left. Set $x=(12)$ and $y=(23)$. Each is a transposition, so $x^3=x$ and $y^3=y$, whereas $xy=(123)$ has order of a group element three. ConsequentlyThus the cubing map on $S_3$ is not a group homomorphism.