Let $\Phi_n(x) \in \mathbb{Z}[x]$ denote the $n$-th cyclotomic polynomial, and let $\mathbb{F}_q$ be the finite field with $p^k = q$ elements ($p$ prime). Let $\Phi'_n(x)$ be the reduction of $\Phi_n(x)$ mod $p$ (i.e., $\Phi'_n(x)$ is the image of $\Phi_n(x)$ in $\mathbb{F}_q[x]$). Is it true that $\Phi'_n(x)$ is the $n$-th cyclotomic polynomial in $\mathbb{F}_q$; that is, are the roots of $\Phi_n'(x)$ precisely the primitive $n$-th roots of unity in $\mathbb{F}_q$? If so, I want to prove this is the case, but I'm not sure how I'd go about doing this.
2026-02-22 21:52:45.1771797165
Is the image of $\Phi_n(x) \in \mathbb{Z}[x]$ in $\mathbb{F}_q[x]$ still a cyclotomic polynomial?
501 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ABSTRACT-ALGEBRA
- Feel lost in the scheme of the reducibility of polynomials over $\Bbb Z$ or $\Bbb Q$
- Integral Domain and Degree of Polynomials in $R[X]$
- Fixed points of automorphisms of $\mathbb{Q}(\zeta)$
- Group with order $pq$ has subgroups of order $p$ and $q$
- A commutative ring is prime if and only if it is a domain.
- Conjugacy class formula
- Find gcd and invertible elements of a ring.
- Extending a linear action to monomials of higher degree
- polynomial remainder theorem proof, is it legit?
- $(2,1+\sqrt{-5}) \not \cong \mathbb{Z}[\sqrt{-5}]$ as $\mathbb{Z}[\sqrt{-5}]$-module
Related Questions in GALOIS-THEORY
- Fixed points of automorphisms of $\mathbb{Q}(\zeta)$
- A weird automorphism
- $S_3$ action on the splitting field of $\mathbb{Q}[x]/(x^3 - x - 1)$
- Question about existence of Galois extension
- Prove that K/L is a Galois extension
- discriminant and irreducibility of $x^p - (p+1)x - 1$
- galois group of irreducible monic cubic polynomial
- Proof of normal basis theorem for finite fields
- Regular inverse Galois problem for Q(t)
- When a certain subfield of $\mathbb{C}(x,y^2)$ is Galois
Related Questions in FINITE-FIELDS
- Covering vector space over finite field by subspaces
- Reciprocal divisibility of equally valued polynomials over a field
- Solving overdetermined linear systems in GF(2)
- Proof of normal basis theorem for finite fields
- Field $\mathbb{Q}(\alpha)$ with $\alpha=\sqrt[3]7+2i$
- Subfield of a finite field with prime characteristic
- Rank of a Polynomial function over Finite Fields
- Finite fields of order 8 and isomorphism
- Finding bases to GF($2^m$) over GF($2$)
- How to arrange $p-1$ non-zero elements into $A$ groups of $B$ where $p$ is a prime number
Related Questions in CYCLOTOMIC-POLYNOMIALS
- On multiplicative and additive properties of cyclotomic polynomials
- Pythagorean-like equation for generalized hyperbolic function
- Solving $x^2+x+1=7^n$
- Question related to N-th cyclotomic polynomial, principal N-th root of unity and residue class of X
- Question about the uniqueness of the $n^\text{th}$ cylclotomic polynomial?
- What does $\varphi (n)$ denote in the context 'the class of $q$ modulo $n$ has order $\varphi (n)$'?
- Is the image of $\Phi_n(x) \in \mathbb{Z}[x]$ in $\mathbb{F}_q[x]$ still a cyclotomic polynomial?
- Determine Minimal Polynomial of Primitive 10th Root of Unity
- Let $n \geq 3$ and let $p$ be prime. Show that $\sqrt[n]{p}$ is not contained in a cyclotomic extension of $\mathbb{Q}$
- Generalization of $x^n-1$ following Fermat's Little theorem
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
You need $\gcd(p,n)=1$ for otherwise there are no roots of unity of order $n$ in any field $\Bbb{F}_q,q=p^n$. Basically this is because $1$ is the only root of $x^p-1=(x-1)^p$.
But, assuming $\gcd(n,p)=1$, the claim is true. If $\alpha\in\Bbb{F}_q$ is a root of unity of order $n$ (implying $n\mid q-1$), then the powers $\alpha^k$, $0<k<n,\gcd(k,n)=1$ are also of order $n$. Therefore we can deduce that there are $\phi(n)$ such elements in $\Bbb{F}_q$. Because they all have order $n$, they are zeros of $x^n-1$, but they are not zeros of any $x^d-1, d\mid n$.
In the ring $\Bbb{Q}[x]$ we have the factorization $$ x^n-1=\prod_{d\mid n}\Phi_d(x), $$ and we know that $\gcd(\Phi_{d_1},\Phi_{d_2})=1$ whenever $d_1\neq d_2$. Because reduction modulo $p$ is a homomorphism of polynomial rings we get the factorization in $\Bbb{F}_p[x]$ $$ x^n-1=\prod_{d\mid n}\overline{\Phi_d}(x).\qquad(*) $$ Here I switched to using $\overline{\Phi_d}(x)$ for the polynomial gotten by reduction modulo $p$. The reason is that below I need to use the prime to denote a derivative also, and I want to avoid the possible confusion for future readers.
As we assumed $\gcd(n,p)=1$ we have, for $f_n(x)=x^n-1$, $$\gcd(f(x),f'(x))= \gcd(x^n-1,nx^{n-1})=1,$$ so we know that the zeros of $x^n-1$ in any field of characteristic $p$ are also simple. Therefore the factors of $x^n-1$ cannot have any common factos, and hence $\gcd(\overline{\Phi_{d_1}}(x),\overline{\Phi_{d_2}}(x))=1$ whenever $d_1\neq d_2$, $d_1,d_2\mid n$.
Any root of unity of $\alpha$ order $n$ in $\Bbb{F}_q$ is a zero of the left hand side of $(*)$, so it must also be a zero of one of the factors $\overline{\Phi_d}(x)$. Because $\overline{\Phi_d}(x)\mid x^d-1$ it follows that $\alpha$ cannot be a zero of $\overline{\Phi_d}(x)$ for any proper divisor $d\mid n$. Therefore $\overline{\Phi_n}(\alpha)=0$.
Because $\deg\Phi_n(x)=\phi(n)$ equals the number of roots of unity of order $n$ in $\Bbb{F}_q$, we can conclude that $$ \overline{\Phi_n}(x)=\prod_{\alpha\in\Bbb{F}_q\ \text{of order $n$}}(x-\alpha). $$
What changes from characteristic zero setting is that the polynomials $\Phi_n(x)$ are usually not irreducible. It remains irreducible after reduction modulo $p$ if and only if $p$ is a generator of the multiplicative group of residue classes $\Bbb{Z}_n^*$.