Multiplication by q modulo m groups exponents whose roots share a minimal polynomial over F_q. The example is deliberately concrete; it is a test of the statement, not a substitute for it.
Start locally
For \(q=p^r\), the Frobenius map \(F(x)=x^q\) controls extensions of \(\mathbf F_q\). Its orbits determine minimal polynomials, trace, norm, and the Galois group.
There are two layers here: the object \(\mathsf D\) and the law \(\mathsf C\). Writing them separately makes the direction of \(\Longrightarrow\) visible and keeps an accidental converse from slipping in.
Compute before generalising
The middle display is intentionally dense: it is where signs, bounds, multiplicities, or normalising factors are most likely to be lost.
The global view
The aligned summary deliberately puts the datum and conclusion on different rows. Mathematically, this is the distinction between specifying an object and proving a property of it.
Edge conditions
Frobenius is \(\mathbf F_q\)-linear on an extension but not generally linear over a larger coefficient field. Exponents must match the chosen base.
The result is compact enough to reuse without pretending that the caveat has disappeared. The worked line remains the quickest consistency check.