Field theory and polynomials Definition
Irreducible polynomial
Builds on Irreducible elementPolynomial ring
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 .
Reading path
To understand this page from the ground up, read these 9 pages in order. The foundations come first.
Show the path as a graph
- 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
Where this leads
83 pages build on this one.
- Uniqueness of finite fields of a given order
- Existence of splitting fields
- Uniqueness of the algebraic closure
- Eisenstein's criterion
- Algebraically closed field
- Galois field
- Uniqueness of splitting fields
- K[x]/(f) is a field iff f is irreducible
- Order of the Galois group of a Galois extension equals its degree
- Normal extension
- Impossibility of doubling the cube
- Polynomial ring over a UFD is a UFD
- Galois extension
- Existence of an algebraic closure
- Impossibility of trisecting the angle
- Reduction modulo p test for irreducibility
- Adjoining a root of a polynomial
- Algebraic closure
- Degree of a simple extension is the degree of the minimal polynomial
- The minimal polynomial is irreducible
- Gauss's lemma
- Irreducibility of the cyclotomic polynomials over the rationals
- The degree of a constructible number is a power of two
- Fundamental theorem of Galois theory
- Existence of finite fields of every prime power order
- Every polynomial has a root in some extension field
- Polynomials of degree two or three are irreducible iff they have no roots
- Impossibility of squaring the circle
- Gauss–Wantzel theorem
- K(a) is isomorphic to K[x] modulo the minimal polynomial
- Primitive polynomial over a finite field
- Cohn's irreducibility criterion
- Galois group of a prime degree polynomial with two nonreal roots
- Artin–Schreier theorem
- Perron's irreducibility criterion
- Model theory of algebraically closed fields
- Weil conjectures
- Finite field arithmetic
- Moduli space
- Néron–Severi group
- Artin–Schreier theory
- Cyclotomic field
- Galois theory
- Cayley–Bacharach theorem
- Tropical variety
- Steinitz's theorem on algebraically closed fields
- Quasi-algebraically closed field
- Standard conjectures on algebraic cycles
- Factorization of polynomials
- Separably closed field
- Homotopy continuation for polynomial systems
- Complex p-adic numbers
- Krasner's lemma
- Pythagorean field
- Separable closure
- Normal closure
- Capelli's theorem
- Berkovich space dynamics
- Bézout's theorem
- Casus irreducibilis
- Galois group of a finite field extension
- Perfect field
- Hilbert's irreducibility theorem
- Infinite Galois theory
- Characterizations of Galois extensions
- Cyclic extension
- Normal basis theorem
- Hilbertian field
- Generic smoothness
- Categorical theory
- Quintic equation
- Shafarevich's theorem on solvable Galois groups
- Abelian extension
- Krull topology
- Perfect closure
- Tsen's theorem
- Impossibility of the classical construction problems
- Artin's theorem on fixed fields
- Separable degree
- Factorization of polynomials over finite fields
- Hilbert's Theorem 90
- Inverse Galois problem
- Newton–Puiseux theorem
Further reading
About this page
| Tag | 00X2A9G9W3 |
|---|---|
| URI | m2://00X2A9G9W3 |
| Kind | definition |
| Writing | W1 stated |
| MSC | 12E05 |
| Defines | Irreducible polynomial |
| Uses | Irreducible element, Polynomial ring |
Markdown · JSON · Edit on GitHub
What this page 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 page is. They do not measure its truth.
What links here
Used by
- Eisenstein's criterion
- Algebraically closed field
- K[x]/(f) is a field iff f is irreducible
- Normal extension
- Reduction modulo p test for irreducibility
- Adjoining a root of a polynomial
- The minimal polynomial is irreducible
- Gauss's lemma
- Irreducibility of the cyclotomic polynomials over the rationals
- Every polynomial has a root in some extension field
- Polynomials of degree two or three are irreducible iff they have no roots
- Primitive polynomial over a finite field
- Cohn's irreducibility criterion
- Galois group of a prime degree polynomial with two nonreal roots
- Perron's irreducibility criterion
- Finite field arithmetic
- Factorization of polynomials
- Capelli's theorem
- Casus irreducibilis
- Perfect field
- Hilbert's irreducibility theorem