Math 2.0

definition

Separable polynomial

Definition

Let RR be a commutative ring and let f∈R[x]f \in R[x]. The polynomial ff is separable if there are a,b∈R[x]a, b \in R[x] with af+bf′=1a f + b f' = 1, where f′f' is the formal derivative of ff.

Remarks

Over a field KK, ff is separable if and only if ff has no repeated root in an algebraic closure of KK. The polynomial f=x2−2f = x^2 - 2 is separable over Q\mathbb{Q}, because f′=2xf' = 2x and −12f+14xf′=1-\tfrac{1}{2} f + \tfrac{1}{4} x f' = 1. Over Fp(t)\mathbb{F}_p(t), the irreducible polynomial xp−tx^p - t is not separable, because its derivative is 00. Some older texts call an irreducible polynomial separable when it has distinct roots, and extend this to other polynomials factor by factor.

Explanations

L1 human

A separable polynomial has distinct roots, in a field that is large enough to contain all of them. Over the rational numbers, every irreducible polynomial is separable. Inseparable irreducible polynomials only appear in prime characteristic.

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 5 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. Polynomial ring definition
  4. Formal derivative definition
  5. Separable polynomial definition

What depends on this

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

Sources

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