Argument shift method: Difference between revisions
Content deleted Content added
Added tags to the page using Page Curation (more footnotes) |
TakuyaMurata (talk | contribs) Undid revision 525983391 by MrNiceGuy1113 (talk) doesn't seem an issue |
||
| Line 1: | Line 1: | ||
{{more footnotes|date=December 2012}} |
|||
In mathematics, the '''argument shift method''' is a method for constructing functions in involution with respect to [[Poisson–Lie bracket]]s, introduced by {{harvs|txt|last1=Mishchenko|last2= |
In mathematics, the '''argument shift method''' is a method for constructing functions in involution with respect to [[Poisson–Lie bracket]]s, introduced by {{harvs|txt|last1=Mishchenko|last2= |
||
Fomenko|year=1978}}. They used it to prove that the [[Poisson algebra]] of a finite-dimensional [[semisimple Lie algebra]] contains a complete commuting set of polynomials. |
Fomenko|year=1978}}. They used it to prove that the [[Poisson algebra]] of a finite-dimensional [[semisimple Lie algebra]] contains a complete commuting set of polynomials. |
||
Revision as of 12:49, 2 December 2012
In mathematics, the argument shift method is a method for constructing functions in involution with respect to Poisson–Lie brackets, introduced by Mishchenko and Fomenko (1978). They used it to prove that the Poisson algebra of a finite-dimensional semisimple Lie algebra contains a complete commuting set of polynomials.