Lagmental Vicfred

The Order of a Power in a Cyclic Group by Vicfred

tags: mathematics, abelian groups, cyclic groups, structure theorem

In a cyclic group of order n, the power g to k has order n divided by the gcd of n and k. The formulas are more useful when each symbol has a job rather than merely decorating the theorem.

Notation

Finite abelian groups become transparent after decomposing into \(p\)-primary components. For a cyclic group \(C_n\), element orders are controlled by \(\gcd(k,n)\) and direct products by least common multiples.

$$ G=\langle g\rangle,\qquad |G|=n $$

The typography mirrors the proof: first declare \(\mathsf D\), then state \(\mathsf C\). The symbol \(\Longrightarrow\) below is a logical dependency, not extra mathematical structure.

$$ |g^k|=\frac{n}{\gcd(n,k)} $$

Stress the formula

Now evaluate one representative case. The result should agree with the structural law above, but it is obtained without assuming the conclusion.

$$ \begin{array}{c|ccccc}k&0&1&2&3&4\\\hline|g^k|\text{ in }C_{12}&1&12&6&4&3\end{array} $$

Interpretation

The formula is reusable precisely because it says which pieces are structural and which belong only to the worked example.

$$ \begin{aligned} \mathsf{D}\;&:\quad G=\langle g\rangle,\qquad |G|=n,\\[5pt] \mathsf{C}\;&:\quad |g^k|=\frac{n}{\gcd(n,k)}. \end{aligned} $$

Limit of the argument

An invariant such as order, exponent, or rank can rule out an isomorphism, but matching one invariant never proves two groups are isomorphic.

$$ \boxed{\begin{gathered} \text{compact conclusion}\\[-2pt] |g^k|=\frac{n}{\gcd(n,k)} \end{gathered}} $$

The result is compact enough to reuse without pretending that the caveat has disappeared. The worked line remains the quickest consistency check.

This article was posted on Tue 01 January 2019. Facts and circumstances may have changed since publication.
Please contact me before jumping to conclusions if something seems wrong or unclear.