Math 2.0

definition

Primitive polynomial

Definition

Let RR be a commutative ring. A polynomial f∈R[x]f \in R[x] is primitive if every r∈Rr \in R that divides ff in R[x]R[x] is a unit. Here rr divides ff when rr divides each coefficient of ff.

Remarks

If RR is a unique factorisation domain, then ff is primitive if and only if its content is a unit. In Z[x]\mathbb{Z}[x], 3x2+2x−13x^2 + 2x - 1 is primitive and 6x2+4x−26x^2 + 4x - 2 is not. Every monic polynomial is primitive. The word primitive polynomial has another meaning over a finite field: a polynomial whose root is a primitive element.

Explanations

L1 human

A primitive polynomial has coefficients with no common factor. Over the integers, this means that the gcd of the coefficients is 11.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (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 13 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. Unit of a ring definition
  5. Zero divisor definition
  6. Divisibility in a commutative ring definition
  7. Integral domain definition
  8. Associate elements definition
  9. Irreducible element definition
  10. Greatest common divisor in an integral domain definition
  11. Unique factorisation domain definition
  12. Content of a polynomial definition
  13. Primitive polynomial definition

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Primitive_part_and_content, lead section