Find All Irreducible Monic Cubics over the Field with Three Elements
At a glance
- 1. Write a general cubic
Use x cubed plus a times x squared plus b times x plus c, with coefficients reduced modulo 3.
- 2. Exclude zero
The constant term must be nonzero, so c is either 1 or 2.
- 3. Test the residues
Evaluate each candidate at 1 and 2; a cubic is irreducible precisely when none of 0, 1, and 2 is a root.
- 4. List the survivors
The tests leave eight monic irreducible cubics.
Interpreting the coefficient ring as the field with three elements, the answer is a list of eight polynomials. The key simplification is that a cubic over a field is reducible exactly when it has a linear factor, and a linear factor corresponds to a root in the field.
The notation can also mean the 3-adic integers. This article uses the finite-field interpretation , often written . The distinction matters; see the notation note below if you meant the 3-adic integers.
Why checking roots is enough
Every monic cubic over has the form
where , and all arithmetic is modulo 3. If the cubic is reducible, its factor degrees must add to 3. At least one factor must therefore have degree 1, which means the polynomial has a root in . Conversely, any root gives a linear factor. Thus, the only possible roots to test are 0, 1, and 2.
Test the possible coefficients
First, . So a polynomial with has a root and is reducible. Only or need consideration.
For the other two field elements, the evaluations are
For a candidate to be irreducible, both values must be nonzero. Applying those two conditions gives the following surviving pairs :
| Constant term | |||
|---|---|---|---|
| 1 | |||
| 2 |
For example, when , the conditions are and , modulo 3. When , they are and . These rules give four pairs for each possible nonzero constant term.
The eight polynomials
Substituting the surviving coefficients gives all the irreducible monic cubics:
| Polynomial in | |
|---|---|
The coefficient 2 is the same field element as . You may therefore see the same polynomials written using minus signs; for instance, is over this field.
Worked check
Take . Its values at the three field elements are
None is zero, so the cubic has no linear factor over and is irreducible there.
Common mistakes
- Forgetting to reduce modulo 3. For example, the value 7 is 1 in , not 7.
- Testing only 0 and 1. The element 2 is also a possible root; missing it can incorrectly label a reducible cubic as irreducible.
- Including constant term 0. Such a polynomial is divisible by , so it is immediately reducible.
- Confusing irreducibility with having no repeated roots. The test here is that there are no roots at all in the field. A cubic can have repeated factors and still be reducible.
As a check on the number of results, the standard count of monic irreducible polynomials of degree 3 over a field with elements is . For , this is , matching the list.
If means the 3-adic integers
The 3-adic integers are not the field with three elements. Over the 3-adic integers, there are infinitely many irreducible monic cubics; for example, is Eisenstein at 3 for any 3-adic unit . The finite list above is for coefficients modulo 3, that is, for .
References
- Finite Fields, Rudolf Lidl and Harald Niederreiter
Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.