Symmetric Function Theorem

Theorem

Let $f$ be a polynomial in $n$ variables.

Let $f$ be of degree $r$ in each of its $n$ variables.

Then $f$ is equal to a polynomial of total degree $r$ with integer coefficients in the elementary symmetric functions:

$\ds \sum x_i, \sum x_i x_j, \dotsb, \prod x_j$

and the coefficients of $f$.

Proof

This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Sources

• 1994: H.E. Rose: A Course in Number Theory (2nd ed.) ... (previous) ... (next): Preface to first edition: Prerequisites: $\text {(ii)}$