Let be a field. A non-zero polynomial is irreducible over if and there is no factorization where with
Note that the field plays into whether or not a polynomial is irreducible, for example is irreducible over , but factors in
Degree One Polynomials are Irreducible
As per title.
Observer that the degree of any polynomial is bounded below by zero. Now let be a degree one polynomial, and suppose there were two polynomials such that where this means that both have degree zero, so then they are constant, so their product is constant, which is a contradiction, therefore is irreducible.
Polynomial of Degree 2 or 3 is Irreducible Iff It has no Roots
A polynomial of degree 2 or 3 is irreducible over if and only if contains no root of
Note that the above doesn't hold for degree 4 because the polynomial factors as in (and is thus not irreducible) but has no real roots.
Irreducible Either has GCD 1 or Divides any other Non-Constant Polynomial
Let be irreducible. If is not constant, then either or
Prime Ideal
An ideal in a ring is called a prime ideal if it is a proper ideal and implies that or
Irreducibility Criterion with Prime Ideals
If is a field, then a non-zero polynomial is irreducible iff is a prime ideal
A Proper Ideal is Prime iff the Quotient Ring is a Domain
Suppose that is a proper ideal of then is a prime ideal iff is a domain
Maximal Ideal
An ideal in a crone is a maximal ideal if it is a proper ideal and there is no ideal such that
Maximal iff Quotient Ring is a Field
A proper ideal in a crone is a maximal ideal if and only if is a field.
Maximal Implies Prime
Every maximal ideal in a crone is a prime ideal
In a PID every Non-Zero Prime Ideal is Maximal
If is a principal ideal domain then every non-zero prime ideal is a maximal ideal
Field Polynomials Mod an Irreducible Yields a Root
If is a field and is irreducible, then the quotient ring is a field containing (an isomorphic copy of) and a root of
Since is irreducible, then it has degree at least one, and therefore is non-zero thus we know that is a prime ideal, it is non-zero since .
Since is a field, then we know that is a PID, therefore since we've just seen that is a non-zero prime ideal then we know that is a maximal ideal.
Since is a maximal ideal, then we know that is a field. Observe that the map is an isomorphism from to . We finally show that contains a root.
Consider , and write , then Since is the zero element of then is a root of
Linear Factor
Suppose that is a field and , then we say that the polynomial is a linear factor.
Splits Over
A polynomial splits over if it is a product of linear factors in
Splits iff Roots
splits over if and only if contains all the roots of .
Prime Field
The prime field of a field is the intersection of all the subfields of
Characteristic
Suppose that is prime, and that is a field, then we say that has characteristic if its prime field is isomorphic to
Unique Roots in a Field of Characteristic p
Let be a finite field of characteristic , show that each element has a unique -th root in
Let's first observe that that map defined by is an injective mapping, suppose that then by the properties of a field of characteristic we have , so that is injective.
Recall that an injection over a finite set becomes a surjection, since then there exists some such that which is to say thus we know that there exists a root of . Let's prove that it's unique
Suppose that is another -th root of therefore we have that but then we have so we have that which is a contradiction, so therefore the root is unique.