Math 2.0

Field theory and polynomials Definition

Separable polynomial

Builds on Formal derivative

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 ℚ\mathbb{Q}, because f′=2xf' = 2x and −12f+14xf′=1-\tfrac{1}{2} f + \tfrac{1}{4} x f' = 1. Over 𝔽p(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.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Group concept
  2. Ring definition
  3. Polynomial ring definition
  4. Formal derivative definition
  5. Separable polynomial definition

Where this leads

26 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Separable_polynomial, lead section
About this page
Tag03J8BS7FMV
URIm2://03J8BS7FMV
Kinddefinition
WritingW1 stated
MSC12F10
DefinesSeparable polynomial
UsesFormal derivative

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