Math 2.0

definition

Irreducible polynomial

Definition

Let RR be an integral domain. A polynomial f∈R[x]f \in R[x] is irreducible over RR if it is an irreducible element of the integral domain R[x]R[x]. That is, ff is nonzero and not a unit, and if f=ghf = g h with g,h∈R[x]g, h \in R[x], then gg or hh is a unit of R[x]R[x].

Remarks

Over a field KK, the units of K[x]K[x] are the nonzero constants. So ff is irreducible if and only if deg⁡f≥1\deg f \ge 1 and ff is not a product of two polynomials of smaller degree. The polynomial x2−2x^2 - 2 is irreducible over Q\mathbb{Q} but not over R\mathbb{R}, where x2−2=(x−2)(x+2)x^2 - 2 = (x - \sqrt{2})(x + \sqrt{2}). The polynomial x2+1x^2 + 1 is irreducible over R\mathbb{R} but not over C\mathbb{C}. Over Z\mathbb{Z}, the polynomial 2x+2=2(x+1)2x + 2 = 2(x + 1) is not irreducible, because 22 is not a unit of Z[x]\mathbb{Z}[x].

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: x2+1x^2 + 1 factors over C\mathbb{C} but not over R\mathbb{R}.

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.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Group concept
  2. Ring definition
  3. Commutative ring definition
  4. Polynomial ring definition
  5. Unit of a ring definition
  6. Zero divisor definition
  7. Integral domain definition
  8. Irreducible element definition
  9. Irreducible polynomial definition

What depends on this

30 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Irreducible_polynomial, Definition