This is an old revision of this page, as edited by OneWeirdDude(talk | contribs) at 04:22, 11 November 2022(Changed to n>=2, because it also works on quadratics - even though it's rather unnecessary to do so.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Revision as of 04:22, 11 November 2022 by OneWeirdDude(talk | contribs)(Changed to n>=2, because it also works on quadratics - even though it's rather unnecessary to do so.)
Simply, it is a method for transforming a polynomial equation of degree with some nonzero intermediate coefficients, , such that some or all of the transformed intermediate coefficients, , are exactly zero.
where is modulo . That is, any element of is a polynomial in , which is thus a primitive element of . There will be other choices of primitive element in : for any such choice of we will have by definition:
,
with polynomials and over . Now if is the minimal polynomial for over , we can call a Tschirnhaus transformation of .
Therefore the set of all Tschirnhaus transformations of an irreducible polynomial is to be described as running over all ways of changing , but leaving the same. This concept is used in reducing quintics to Bring–Jerrard form, for example. There is a connection with Galois theory, when is a Galois extension of . The Galois group may then be considered as all the Tschirnhaus transformations of to itself.
History
In 1683, Ehrenfried Walther von Tschirnhaus published a method for rewriting a polynomial of degree such that the and terms have zero coefficients.
In his paper, Tschirnhaus referenced a method by Descartes to reduce a quadratic polynomial such that the term has zero coefficient.
In 1786, this work was expanded by E. S. Bring who showed that any generic quintic polynomial could be similarly reduced.
In 1834, G. B. Jerrard further expanded Tschirnhaus' work by showing a Tschirnhaus transformation may be used to eliminate the , , and for a general polynomial of degree .[3]