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
Ring of symmetric functions
(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!
=== A principle relating symmetric polynomials and symmetric functions === For any symmetric function ''P'', the corresponding symmetric polynomials in ''n'' indeterminates for any natural number ''n'' may be designated by ''P''(''X''<sub>1</sub>,...,''X''<sub>''n''</sub>). The second definition of the ring of symmetric functions implies the following fundamental principle: :If ''P'' and ''Q'' are symmetric functions of degree ''d'', then one has the identity <math>P=Q</math> of symmetric functions [[if and only if]] one has the identity ''P''(''X''<sub>1</sub>,...,''X''<sub>''d''</sub>) = ''Q''(''X''<sub>1</sub>,...,''X''<sub>''d''</sub>) of symmetric polynomials in ''d'' indeterminates. In this case one has in fact ''P''(''X''<sub>1</sub>,...,''X''<sub>''n''</sub>) = ''Q''(''X''<sub>1</sub>,...,''X''<sub>''n''</sub>) for ''any'' number ''n'' of indeterminates. This is because one can always reduce the number of variables by substituting zero for some variables, and one can increase the number of variables by applying the homomorphisms ''Ο''<sub>''n''</sub>; the definition of those homomorphisms assures that ''Ο''<sub>''n''</sub>(''P''(''X''<sub>1</sub>,...,''X''<sub>''n''</sub>)) = ''P''(''X''<sub>1</sub>,...,''X''<sub>''n''+1</sub>) (and similarly for ''Q'') whenever ''n'' β₯ ''d''. See [[Newton's identities#Derivation of the identities|a proof of Newton's identities]] for an effective application of this principle.
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)