English

How to Construct the Lattice of Submodules of a Multiplicity free Module from Partial Information

Representation Theory 2022-07-19 v2 Combinatorics

Abstract

In general it is a difficult problem to construct the lattice of submodules L(M)L(M) of a given module MM. In \cite{St} R. P. Stanley outlined a method for constucting a distributive lattice from a knowledge of its join irreducibles. However it is not an easy task to identify all join irreducible submodules of a given module. In the case of a multiplicity free module MM we present a modifiiction of Stanley's method based on the composition factors of MM. As input we require a set of submodules A1,,AnA_1,\ldots , A_n whose submodule lattices are known and which contain all composition factors of MM. From this we can reconstruct L(M)L(M). We illustrate the process for a family of Verma modules M(\gln)M(\gl_n), with nn a positive integer, for the Lie superalgebra \osp(3,2)\osp(3,2). We show that for n2n\ge 2, L(M(\gln))L(M(\gl_n)) is isomorphic to the (extended) free distributive lattice of rank 3.

Keywords

Cite

@article{arxiv.2112.15142,
  title  = {How to Construct the Lattice of Submodules of a Multiplicity free Module from Partial Information},
  author = {Ian M. Musson},
  journal= {arXiv preprint arXiv:2112.15142},
  year   = {2022}
}

Comments

The presentation in section 5.2 has been shortened because, as mentioned in the first version, the result was predictable in advance. At the same time some of the proofs have been clarified