Irreducible polynomial
Definition
Let be an integral domain. A polynomial is irreducible over if it is an irreducible element of the integral domain . That is, is nonzero and not a unit, and if with , then or is a unit of .
Remarks
Over a field , the units of are the nonzero constants. So is irreducible if and only if and is not a product of two polynomials of smaller degree. The polynomial is irreducible over but not over , where . The polynomial is irreducible over but not over . Over , the polynomial is not irreducible, because is not a unit of .
Explanations
L1 human
Irreducible polynomials are the prime numbers of polynomial rings. Over a field, they are the polynomials that you cannot factor into polynomials of smaller degree. Irreducibility depends on the field: factors over but not over .
What this node needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 9 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Group concept
- Ring definition
- Commutative ring definition
- Polynomial ring definition
- Unit of a ring definition
- Zero divisor definition
- Integral domain definition
- Irreducible element definition
- Irreducible polynomial definition
What depends on this
30 nodes use this node, directly or through other nodes.
- Uniqueness of finite fields of a given order 010PKCQPXP
- Existence of splitting fields 01441KDGBY
- Uniqueness of the algebraic closure 01VQ7C4FTB
- Eisenstein's criterion 02BPKD7TMD
- Algebraically closed field 02SJG1HC32
- Galois field 04SGPNT8R9
- Uniqueness of splitting fields 069A3BC3EP
- K[x]/(f) is a field iff f is irreducible 0AWMPX35CW
- Order of the Galois group of a Galois extension equals its degree 0BDJBH8B4Z
- Normal extension 0CBRFQ7DVZ
- Impossibility of doubling the cube 0CQ357M0QS
- Polynomial ring over a UFD is a UFD 0D6KH8Y59N
- Galois extension 0DS2F7GK05
- Existence of an algebraic closure 0ETGBAK2CC
- Impossibility of trisecting the angle 0EWXPZCSZ0
- Reduction modulo p test for irreducibility 0KWWEXW0RN
- Adjoining a root of a polynomial 0M893X7YY7
- Algebraic closure 0MCXX29HWY
- Degree of a simple extension is the degree of the minimal polynomial 0N5QW9K7MH
- The minimal polynomial is irreducible 0NFEG48RDR
- Gauss's lemma 0QFV5Y1Z5X
- Irreducibility of the cyclotomic polynomials over the rationals 0SK1VHZ5R2
- The degree of a constructible number is a power of two 0SSSM1D475
- Fundamental theorem of Galois theory 0T1Q8D0FW8
- Existence of finite fields of every prime power order 0T8M3YC5RG
- Every polynomial has a root in some extension field 0VG02M1FEZ
- Polynomials of degree two or three are irreducible iff they have no roots 0VNE161QCK
- Impossibility of squaring the circle 0X7CVDE3BG
- Gauss–Wantzel theorem 0Y34JMJNE9
- K(a) is isomorphic to K[x] modulo the minimal polynomial 0ZN39QDTP9
Sources
What links here
Used by
- Eisenstein's criterion 02BPKD7TMD
- Algebraically closed field 02SJG1HC32
- K[x]/(f) is a field iff f is irreducible 0AWMPX35CW
- Normal extension 0CBRFQ7DVZ
- Reduction modulo p test for irreducibility 0KWWEXW0RN
- Adjoining a root of a polynomial 0M893X7YY7
- The minimal polynomial is irreducible 0NFEG48RDR
- Gauss's lemma 0QFV5Y1Z5X
- Irreducibility of the cyclotomic polynomials over the rationals 0SK1VHZ5R2
- Every polynomial has a root in some extension field 0VG02M1FEZ
- Polynomials of degree two or three are irreducible iff they have no roots 0VNE161QCK