Skip to main content
QUICK REVIEW

[Paper Review] A class of non-weight modules over the Schrödinger-Virasoro algebras

Yumei Wang, Honglian Zhang|arXiv (Cornell University)|Sep 14, 2018
Algebraic structures and combinatorial models8 references4 citations
TL;DR

This paper constructs and classifies free rank-1 modules over the Schrödinger-Virasoro algebra sv(0) using the universal enveloping algebra of the subalgebra generated by L0, M0, and Y0. It proves that such modules are parameterized by λ ∈ ℂ* and α ∈ ℂ, denoted Φ(λ, α), and further shows that no free rank-1 U(CL0 ⊕ CM0)-modules exist over sv(1/2), resolving a nonexistence question for this algebraic structure.

ABSTRACT

We construct and classify the free $U(\mathbb{C}L_0\oplus \mathbb{C}M_0\oplus\mathbb{C}Y_0)$-modules of rank $1$ over the Schrödinger-Virasoro algebra $\mathfrak{sv}(s)$ for $s=0$.Moreover, we show that the class of free $U(\mathbb{C}L_0\oplus\mathbb{C}M_0)$-modules of rank $1$ over the Schrödinger-Virasoro algebra $\mathfrak{sv}(s)$ for $s=\frac{1}{2}$ is nonexistent.

Motivation & Objective

  • To construct and classify free rank-1 modules over the Schrödinger-Virasoro algebra sv(0) with respect to the subalgebra generated by L0, M0, and Y0.
  • To determine whether free rank-1 modules over sv(1/2) exist for the subalgebra generated by L0 and M0.
  • To resolve the nonexistence of such modules in the sv(1/2) case, providing a complete classification for sv(0).
  • To extend the theory of non-weight modules to the Schrödinger-Virasoro algebra, particularly in the context of free modules over specific subalgebras.

Proposed method

  • Constructs a family of rank-1 free modules Φ(λ, α) over sv(0) by defining explicit actions of the basis elements Lm, Mm, and Ym on the polynomial algebra C[s, t, v].
  • Uses the structure of the universal enveloping algebra U(CL0 ⊕ CM0 ⊕ CY0) to define module actions via differential operators involving L0, M0, and Y0.
  • Applies commutation relations and induction to verify that the defined actions satisfy the Lie algebra relations of sv(0), ensuring the module structure is well-defined.
  • Employs a systematic classification argument using the action of Lm, Mm, and Ym on the generator 1, reducing the problem to determining polynomials in L0 and M0.
  • For sv(1/2), assumes existence of a free rank-1 U(CL0 ⊕ CM0)-module and derives a contradiction by analyzing the Yp action and the [Yp, Mm] = 0 relation.
  • Uses the non-vanishing of (q − p)Mp+q for p ≠ q in the [Yp, Yq] relation to show inconsistency when hp(L0, M0) is assumed to lie in C[M0], proving nonexistence.

Experimental results

Research questions

  • RQ1Are there free rank-1 modules over sv(0) that are free as modules over U(CL0 ⊕ CM0 ⊕ CY0)?
  • RQ2Can such modules be completely classified in terms of parameters λ ∈ ℂ* and α ∈ ℂ?
  • RQ3Does there exist a free rank-1 module over sv(1/2) that is free as a module over U(CL0 ⊕ CM0)?
  • RQ4What constraints do the Lie algebra relations impose on the possible actions of Yp and Mm in such modules?

Key findings

  • All free rank-1 modules over sv(0) that are free over U(CL0 ⊕ CM0 ⊕ CY0) are isomorphic to Φ(λ, α) for some λ ∈ ℂ* and α ∈ ℂ.
  • The classification is complete: any such module M satisfies M ≅ Φ(λ, α) for unique λ and α.
  • No free rank-1 U(CL0 ⊕ CM0)-modules exist over sv(1/2), as shown by contradiction from the Yp action and the [Yp, Yq] relation.
  • The action of Yp on the module generator 1 must lie in C[M0], but this leads to a contradiction with the non-vanishing of (q − p)Mp+q for p ≠ q.
  • The proof relies on the structure of the universal enveloping algebra and the nontrivial commutation relations, particularly [Yp, Mm] = 0 and [Yp, Yq] = (q − p)Mp+q.
  • The nonexistence result holds due to the incompatibility between the required form of hp(L0, M0) and the algebraic relations in sv(1/2).

Better researchstarts right now

From reading papers to final review, dramatically reduce your research time.

No credit card · Free plan available

This review was created by AI and reviewed by human editors.