Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Separable extension
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Informal discussion== An arbitrary polynomial {{math|''f''}} with coefficients in some field {{math|''F''}} is said to have ''distinct roots'' or to be [[square-free polynomial|square-free]] if it has {{math|deg ''f''}} roots in some [[extension field]] <math>E\supseteq F</math>. For instance, the polynomial {{math|1=''g''(''X'') = ''X''<sup> 2</sup> β 1}} has precisely {{math|1=deg ''g'' = 2}} roots in the [[complex plane]]; namely {{math|1}} and {{math|β1}}, and hence ''does have'' distinct roots. On the other hand, the polynomial {{math|1=''h''(''X'') = (''X'' β 2)<sup>2</sup>}}, which is the square of a non-constant polynomial ''does not'' have distinct roots, as its degree is two, and {{math|2}} is its only root. Every polynomial may be factored in linear factors over an [[algebraic closure]] of the field of its coefficients. Therefore, the polynomial does not have distinct roots if and only if it is divisible by the square of a polynomial of positive degree. This is the case if and only if the [[polynomial greatest common divisor|greatest common divisor]] of the polynomial and its [[formal derivative|derivative]] is not a constant. Thus for testing if a polynomial is square-free, it is not necessary to consider explicitly any field extension nor to compute the roots. In this context, the case of irreducible polynomials requires some care. A priori, it may seem that being divisible by a square is impossible for an [[irreducible polynomial]], which has no non-constant divisor except itself. However, irreducibility depends on the ambient field, and a polynomial may be irreducible over {{math|''F''}} and reducible over some extension of {{math|''F''}}. Similarly, divisibility by a square depends on the ambient field. If an irreducible polynomial {{math|''f''}} over {{math|''F''}} is divisible by a square over some field extension, then (by the discussion above) the greatest common divisor of {{math|''f''}} and its derivative {{math|''f''{{β²}}}} is not constant. Note that the coefficients of {{math|''f''{{β²}}}} belong to the same field as those of {{math|''f''}}, and the greatest common divisor of two polynomials is independent of the ambient field, so the greatest common divisor of {{math|''f''}} and {{math|''f''{{β²}}}} has coefficients in {{math|''F''}}. Since {{math|''f''}} is irreducible in {{math|''F''}}, this greatest common divisor is necessarily {{math|''f''}} itself. Because the degree of {{math|''f''{{β²}}}} is strictly less than the degree of {{math|''f''}}, it follows that the derivative of {{math|''f''}} is zero, which implies that the [[characteristic of a field|characteristic]] of the field is a prime number {{math|''p''}}, and {{math|''f''}} may be written :<math>f(x)= \sum_{i=0}^ka_ix^{pi}.</math> A polynomial such as this one, whose formal derivative is zero, is said to be ''inseparable''. Polynomials that are not inseparable are said to be ''separable''. A ''separable extension'' is an extension that may be generated by ''separable elements'', that is elements whose minimal polynomials are separable.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)