Newton identities

from Wikipedia, the free encyclopedia

In mathematics , especially in algebra , the Newton identities combine two fundamental types of symmetric polynomials in a number n of variables , the elementary symmetric polynomials

,

and the power sums

,

These identities are generally traced back to the considerations of Isaac Newton around 1666, but they can also be found by Albert Girard in 1629. Applications of these identities can be found in Galois theory , invariant theory , group theory , combinatorics , but also outside of mathematics, for example in general relativity .

Derivation by means of formal power series

Let T be the variable in the ring of the formal power series . Then, analogously to Vieta's theorem ,

.

Since the polynomial p (T) has a constant coefficient 1 , it can be inverted in the ring of formal power series. For the logarithmic derivation results

.

The quotients on the right also exist as formal power series; they result as geometric series . Thus applies

.

This can now be transformed into

.

By comparing equal powers of T on both sides, a system of equations results for determining the elementary symmetric polynomials from the power series and vice versa,

These relationships can be solved by performing the division of formal power series in p '(T) / p (T) according to the power sums, the following applies

Conversely, the quotient of derivative and function is the derivative of the logarithm, so after integration and application of the exponential function , the following relationships result after coefficient comparison.

literature

  • Jean-Pierre Tignol: Galois's theory of algebraic equations . World Scientific, Singapore 2001, ISBN 981-02-4541-6 , doi : 10.1142 / 9789812384904 (historically oriented introduction to Galois theory).
  • Peter J. Cameron: Permutation Groups . Cambridge University Press, 1999, ISBN 0-521-65378-9 (Introduction to Permutation Groups, Including Pólya's Cycle Index, Oligomorphic Permutation Groups, and Their Relationship to Mathematical Logic).
  • Alan Tucker: Applied Combinatorics . Wiley, New York 1984, ISBN 0-471-86371-8 (one of the most elementary and understandable textbooks describing the Pólya enumeration formula and cycle index polynomials).