ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let V1=V(a)⊕V(b)V_1=V(a)\oplus V(b) and V2=V(c)⊕V(d)V_2=V(c)\oplus V(d) be the socle decompositions of two uniserial sl(2)⋉V(m)\mathfrak{sl}(2)\ltimes V(m)-modules, as in the classification theorem, and assume that a<ca<c, or that a=ca=c and b≤db\le d. Let S1S_1 denote the corresponding first socle component. Socle tensor-product conjecture. Then S1=0S_1=0 except in the following cases:

  • If [a,b]=[0,m][a,b]=[0,m], then S1≃V(d)S_1\simeq V(d).
  • If a>0a>0 and a+b=c+d=ma+b=c+d=m with d−a=b−c≥0d-a=b-c\ge0, then S1≃V(d−a)S_1\simeq V(d-a).
  • If a>0a>0 and b−a=d−c=mb-a=d-c=m, then S1≃V(d+a)S_1\simeq V(d+a).
  • If a>0a>0 and b−a=c−d=mb-a=c-d=m with d−a=c−b≥0d-a=c-b\ge0, then S1≃V(d−a)S_1\simeq V(d-a).
  • If [c,d]=[b,a][c,d]=[b,a], then S1≃V(0)S_1\simeq V(0).

This gives the complete description of the first socle component in the length-two case; cases 2.2 and 2.3 were previously proved, while cases 1 and 2.1 are needed for the subsequent tensor-product socle theorems.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.