Papers
Topics
Authors
Recent
Search
2000 character limit reached

A straightforward construction of $\Bbb Z$-graded Lie algebras of full-fledged nonlocal symmetries via recursion operators

Published 30 Jun 2024 in nlin.SI, math-ph, math.MP, and math.RA | (2407.00622v1)

Abstract: We consider the reduced quasi-classical self-dual Yang-Mills equation (rYME) and two recently found (Jahnov\'{a} and Voj\v{c}\'{a}k, 2024) invertible recursion operators $\mathcal{R}q$ and $\mathcal{R}m$ for its full-fledged (in a given differential covering) nonlocal symmetries. We introduce a $\mathbb{Z}$-grading on the Lie algebra $\mathrm{sym}{\mathcal{L}}{\tauW} (\mathcal E)$ of all nonlocal Laurent polynomial symmetries of the rYME and prove that both the operators $\mathcal{R}q$ and $\mathcal{R}m$ are $\mathbb{Z}$-graded automorphisms of the underlying vector space on the set $\mathrm{sym}{\mathcal{L}}{\tauW} (\mathcal E)$. This inter alia implies that all its vector subspaces formed by all homogeneous elements of a given fixed degree (i.e. a weight in the context below) are mutually isomorphic, and thus each of them can be uniquely reconstructed from the vector space of all homogeneous symmetries of the zero degree. To the best of our knowledge, such a result is unparalleled in the current body of literature. The obtained results are used for the construction of a Lie subalgebra $V$ of $\mathrm{sym}_{\mathcal{L}}{\tauW} (\mathcal E)$ which contains all known to us nonlocal Laurent polynomial symmetries of the rYME. The Lie algebra $V$ is subsequently described as the linear span of the orbits of a set of selected zero-weight symmetries - we refer to them as to the seed generators of $V$. Further, we study the hierarchies of symmetries related to the seed generators under the action of the group of recursion operators generated by $\mathcal{R}q$ and $\mathcal{R}m$. Finally, the linear dependence/independence of the (sub)set of generators of $V$ is discussed.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.