Intereting Posts

An epimorphism from $S_{4}$ to $S_{3}$ having the kernel isomorphic to Klein four-group
Intersection of maximal subgroups isomorphic to $PGL_2(p)$ is of form $PGL_2(p_0)$
Is $2^{16} = 65536$ the only power of $2$ that has no digit which is a power of $2$ in base-$10$?
Is every irreducible operator unitary equivalent to a banded operator?
Why is $ (2+\sqrt{3})^n+(2-\sqrt{3})^n$ an integer?
Quadratic Integers in $\mathbb Q$
Multiple choice question – number of real roots of $x^6 − 5x^4 + 16x^2 − 72x + 9$
Category Theory usage in Algebraic Topology
Computing RSA Algorithm
Infinite recurrence relation which depends on subsequent sequence values
Global sections of a tensor product of vector bundles on a smooth manifold
Henkin vs. “Full” Semantics for Second-order Logic and Multi-Sorted First Order Interpretations
Projection of $z$ onto the affine set $\{x\mid Ax = b\}$
A converse of sorts to the intermediate value theorem, with an additional property
Let $a$ and $b$ be non-zero integers, and $c$ be an integer. Let $d = \gcd(a, b)$. Prove that if $a|c$ and $b|c$ then $ab|cd$.

In undergraduate course, the two groups which are most frequently used may be $$\{ 0, 1, 2, … , p-1\}$$ and $$\{ 1, 2, … , p-1\}$$ where $p$ is a prime.

The **first one** is a group under addition and in addition it is a cyclic group whose generator is $p-1$. Also we can describe it by the solution set of $x^p=1$ in ${\bf C}$.

The **latter** is a group under multiplication. Fermat’s theorem implies that $$a^{p-1} =1~~~ (\text{mod}\;\;p)$$ for $a\in \{ 1, … , p-1\}$. But this is not sufficient for $

\{ 1, … , p-1\}$ to be cyclic.

- Show that $G$ is cyclic
- How many different groups of order $15$ there are?
- The Rubik Square permutation groups
- $A_4$ has no subgroup of order $6$?
- Possible orders of normal subgroups using only the elements in $G$ and their orders
- Subgroups of Symmetric groups isomorphic to dihedral group

My question is :

$$ \{ 1, … , p-1\}$$ is cyclic ?

Thank you in advance.

- Prove or Disprove: If every nontrivial subgroup of a group $G$ is cyclic, then $G$ is cyclic.
- Normal subgroups of $S_4$
- If G is finite group with even number of elements and has identity e, there is a in G such that a*a=e
- Determining whether two groups are isomorphic
- How to prove for a finite group that $|\langle g \rangle|=o(g)$?
- Concrete examples of 2-categories
- Group of positive rationals under multiplication not isomorphic to group of rationals
- Index of a maximal subgroup in a finite group
- Prove that $N$ is normal
- $\phi \times \theta$ is faithful iff $(|Z(H)| ,|Z(K)|)=1$ for faithful characters $\phi \in Irr(H)$ and $\theta \in Irr(K)$ .

Here is the proof that $G=\mathbb{F}_p ^*$ is cyclic (in fact any finite subgroup of the multiplicative group of a field is cyclic). One needs to know that a finite abelian group is the direct product of its Sylow subgroups:

$$G \simeq G_{p_1} \times …\times G_{p_n}$$

where $p_j$ is a prime and $G_{p_j}$ has order $p_j^{n_j}$. So you can assume that the group’s order is a power of a prime, say $G$ has order $q^n$. But then, if $G$ does not contain an element of order $q^n$, the order of every element divides $q^{n-1}$, that is, for all $a\in G$,

$$a^{q^{n-1}}-1=0$$

in the field. But this cannot be true because the polynomial of order $q^{n-1}$ would have $q^n$ roots.

The group $\{1,2,\ldots,p-1\}$ under multiplication is indeed cyclic. It can be shown that there exists a primitive root $\pmod p$ for every prime $p$. This will now generate the multiplicative group $\{1,2,\ldots,p-1\}$.

It is a general theorem that every finite subgroup of the multiplicative group of a field is cyclic. That is, if $F$ is any field, the set $F^*$ of all non-zero elements in $F$ is always a group under the multiplication in the field. Any finite subgroup of $F^*$ is cyclic. Thus the group $\mathbb Z_p^*$ that you describe is cyclic, since $\mathbb Z_p$ is a field.

There are several proofs for this result, one of them uses a characterization of finite cyclic groups that can be applied directly to $Z_p^*$. The characterization of finite cyclic groups is that if $G$ is a finite group of order $n$ then $G$ is cyclic if, and only if, for very $d$ that divides $n$ the group $G$ has at most one subgroup of order $d$. The proof is not very hard and is classical. It should be noted that the proof does not point to any generator, but only proves the existence of a generator. Consequently, using this theorem to prove that $\mathbb Z_p^*$ is cyclic does not produce a generator (known as a primitive element). There are no trivial ways to produce such primitive elements.

A somewhat similar situation is the result from Galois theory that every finite separable extension is generated by one element (a primitive element again). The general proof is again non-constructive and finding primitive elements for any given field extension can be very hard.

It is cyclic. A generator $a \in \mathbb F_p^*$ would satisfy $|a| = p – 1$ where $|a|$ is the order of $a$. We can find the generator as follows. Factor $p – 1$ as $p – 1 = q_1^{a_1}q_2^{a_2}\ldots q_n^{a_n}$ where $q_i$ are distinct primes, and $a_i$ are all non-zero.

- We will try to find elements of $\mathbb F_p^*$ that have orders $q_i^{a_i}$. Since $x^{p-1} – 1 = 0$ has $p – 1$ roots (by Fermat’s theorem) and $x^{p-1} – 1$ factors, for any $i$, as

\begin{align*}

x^{p-1} – 1

& = \left(x^{q_i^{a_i}} – 1\right)\left(1 + x^{q_i^{a_i}} + \ldots + \left(x^{q_i^{a_i}}\right)^{(p-1)q_i^{-a_i} – 1}\right),

\end{align*}

we know that $x^{q_i^{a_i}} – 1$ has exactly $q_i^{a_i}$ roots by counting degrees. A similar argument can be made to conclude that $x^{q_i^{a_i – 1}} – 1$ has exactly $q_i^{a_i – 1}$ roots. Therefore, there exists some $g_i \in \mathbb F_p^*$ such that $g^{q_i^{a_i}} = 1$ and $g^{q_i^{a_i – 1}} \ne 1$. We see that $|g| \mid q_i^{a_i}$ but $|g| \nmid q_i^{a_i – 1} $, so $|g| = q_i^{a_i}$. - Let $g = g_1g_2\ldots g_n$. Obviously $|g| \mid p – 1$,
*i.e.*, $|g| = q_1^{b_1}q_2^{b_2}\ldots q_n^{b_n}$ with $b_n \le a_n$.

Write this as

$$

\prod_{i} g_i^{q_1^{b_1}q_2^{b_2}\ldots q_n^{b_n}} = 1.

$$

Fix $j \in \{1, 2, \ldots, n\}$.

Raise the above equation to the $q_k^{a_k – b_k}$-th power for all $k \ne j$ successively:

\begin{align*}

\prod_{i} g_i^{(p-1)q_j^{b_j-a_j}} & = 1.

\end{align*}

For $i \ne j$, the factor $g_i^{(p-1)q_j^{b_j-a_j}} = 1$ because $|g_i| = q_i^{a_i} \mid (p-1)q_j^{b_j – a_j}$. So the only non-identity factor is the term $i = j$:

$$

g_j^{(p-1)q_j^{b_j-a_j}} = 1.

$$

This means $|g_j| \mid (p-1)q_j^{b_j – a_j} = (p-1)q_j^{-a_j}q_j^{b_j}$, but $|g_j| = q_j^{a_j}$ and $q_j \nmid (p-1)q_j^{-a_j}$, we must have $b_j = a_j$.

Consider the field $\mathbb{F}_{p}$ – the field with $p$ elements.

The group $\{1,…p\}$ is $\mathbb{F}_{p}^{*}$, that is all the

invertible elements of $\mathbb{F}_{p}$.

This is a cyclic group as it is a finite subgroup of a field (with

respect to multiplication).

- Norm computation in number fields
- Origin of the dot and cross product?
- Prove that $\lim f(x) =0$ and $\lim (f(2x)-f(x))/x =0$ imply $\lim f(x)/x =0$
- Intuition behind looking at permutations of the roots in Galois theory
- Difference between Fourier series and Fourier transformation
- Simple Monte Carlo Integration
- Overlapping Polynomials
- What exactly is the difference between weak and strong induction?
- Prove that $F_n={n-1 \choose 0 }+{n-2 \choose 1 }+{n-3 \choose 2 }+\ldots$ where $F(n)$ is the $n$-th fibonacci number
- Is every subgroup of a normal subgroup normal?
- Is a sphere a closed set?
- Find the limit points of the set $\{ \frac{1}{n} +\frac{1}{m} \mid n , m = 1,2,3,\dots \}$
- with inequality $\frac{y}{xy+2y+1}+\frac{z}{yz+2z+1}+\frac{x}{zx+2x+1}\le\frac{3}{4}$
- Improper integrals with singularities on the REAL AXIS (Complex Variable)
- Are these two quotient rings of $\Bbb Z$ isomorphic?