Question. Let $G = \{a,b,c,d,f\}$. Given that $(G, \cdot)$ is a cyclic group with $G=\langle d \rangle$ and Cayley table:
\begin{array}{c|cc}
\cdot & a & b & c & d & f\\
\hline
a& c & a & f & b & d \\
b& a & b & c & d &f \\
c& f& c& d& a& b \\
d& b & d& a& f & c \\
f& d& f& b& c & a
\end{array}
I need to complete this table. I know that the generator will be all the powers of d such that $d^1 … d^4 ∈ G$, where $n ∈ Z$. My understanding of that statement is each row and column of d will contain each element of G only once.
I know cyclic groups are abelian, but I only used the commutative property thus far to fill in 2 cells.
What else do I need to know in order to fill in the table?
Thank you.
Best Answer
Note that $G$ has order $5$, hence all elements of $G$, other than $1$, have order $5$, and consequently, $x^5=1$, for all $x\in G$.
You have $d^2=f$, and $f^2=a$, hence $d^4=a$.
Then from $ad=b$, we get $a^5=b$, but $a^5=1$, hence $b=1$.
Since $b=1$, we have $d\ne 1$, so the order of $d$ must be $5$.
Hence, the elements $1,d,d^2,d^3,d^4$ are distinct, and comprise all the elements of $G$.
The only unidentified one is $d^3$, which must be equal to $c$.
Note: The table shows $df=c$, so we could have found $d^3=c$ from that information, but as the above argument shows, that information is actually superfluous. In other words, if the two entries of $c$ in the table of products were erased, we could still have deduced them.
To fill in the rest of the table, products can be evaluated as follows . . .