2000 character limit reached
Properties of nilpotent orbit complexification
Published 28 May 2015 in math.AG and math.RT | (1505.07729v1)
Abstract: We consider aspects of the relationship between nilpotent orbits in a semisimple real Lie algebra $\mathfrak{g}$ and those in its complexification $\mathfrak{g}{\mathbb{C}}$. In particular, we prove that two distinct real nilpotent orbits lying in the same complex orbit are incomparable in the closure order. Secondly, we characterize those $\mathfrak{g}$ having non-empty intersections with all nilpotent orbits in $\mathfrak{g}{\mathbb{C}}$. Finally, for $\mathfrak{g}$ quasi-split, we characterize those complex nilpotent orbits containing real ones.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.