Math 2.0

Nonassociative rings and algebras Definition

Vogan diagram

Builds on Semisimple Lie algebraReal formCartan subalgebraSimple rootsDynkin diagramCartan decomposition

Definition

Let ๐”ค0\mathfrak{g}_0 be a real semisimple Lie algebra with complexification ๐”ค\mathfrak{g}. Let ฮธ\theta be a Cartan involution of ๐”ค0\mathfrak{g}_0, with Cartan decomposition ๐”ค0=๐”จ0โŠ•๐”ญ0\mathfrak{g}_0 = \mathfrak{k}_0 \oplus \mathfrak{p}_0. Let ๐”ฅ0=๐”ฑ0โŠ•๐”ž0\mathfrak{h}_0 = \mathfrak{t}_0 \oplus \mathfrak{a}_0 be a ฮธ\theta-stable Cartan subalgebra with ๐”ฑ0โІ๐”จ0\mathfrak{t}_0 \subseteq \mathfrak{k}_0 and ๐”ž0โІ๐”ญ0\mathfrak{a}_0 \subseteq \mathfrak{p}_0, chosen so that dimโก๐”ฑ0\dim \mathfrak{t}_0 is as large as possible. Let ฮ”\Delta be the set of roots of ๐”ค\mathfrak{g} with respect to the complexification ๐”ฅ\mathfrak{h} of ๐”ฅ0\mathfrak{h}_0. Choose positive roots ฮ”+\Delta^+ from an ordering in which i๐”ฑ0i\mathfrak{t}_0 comes before ๐”ž0\mathfrak{a}_0. Then ฮธฮ”+=ฮ”+\theta \Delta^+ = \Delta^+. So ฮธ\theta permutes the simple roots of ฮ”+\Delta^+. Each simple root fixed by ฮธ\theta is imaginary, that is, it vanishes on ๐”ž0\mathfrak{a}_0. Let ๐”จ\mathfrak{k} and ๐”ญ\mathfrak{p} be the complexifications of ๐”จ0\mathfrak{k}_0 and ๐”ญ0\mathfrak{p}_0. An imaginary root ฮฑ\alpha is compact if its root space lies in ๐”จ\mathfrak{k}, and noncompact if it lies in ๐”ญ\mathfrak{p}.

The Vogan diagram of (๐”ค0,๐”ฅ0,ฮ”+)(\mathfrak{g}_0, \mathfrak{h}_0, \Delta^+) is the Dynkin diagram of ฮ”+\Delta^+ with these marks:

  1. Each pair of simple roots exchanged by ฮธ\theta is joined by a two-headed arrow.
  2. Each simple root fixed by ฮธ\theta is painted if it is noncompact, and left unpainted if it is compact.

Remarks

Example: for ๐”ค0=๐”ฐ๐”ฉ2(โ„)\mathfrak{g}_0 = \mathfrak{sl}_2(\R), the subalgebra ๐”ฐ๐”ฌ(2)\mathfrak{so}(2) of skew-symmetric matrices is a Cartan subalgebra inside ๐”จ0=๐”ฐ๐”ฌ(2)\mathfrak{k}_0 = \mathfrak{so}(2), so ๐”ž0=0\mathfrak{a}_0 = 0. The one simple root is imaginary, and its root space is spanned by a complex matrix outside ๐”ฐ๐”ฌ(2)โŠ—โ„‚\mathfrak{so}(2) \otimes \C, so the root is noncompact. The Vogan diagram is one painted dot; for the compact form ๐”ฐ๐”ฒ(2)\mathfrak{su}(2) it is one unpainted dot. Non-example: for ๐”ฐ๐”ฉ2(โ„)\mathfrak{sl}_2(\R) with the Cartan subalgebra of diagonal matrices, ๐”ฑ0=0\mathfrak{t}_0 = 0, so dimโก๐”ฑ0\dim \mathfrak{t}_0 is not maximal; the root is real and the painting rule does not apply. Every real semisimple Lie algebra has a Vogan diagram, and the diagram determines ๐”ค0\mathfrak{g}_0 up to isomorphism. Different choices of ฮ”+\Delta^+ can give different diagrams for the same algebra. The arrows record the automorphism of the Dynkin diagram induced by ฮธ\theta. There are no arrows exactly when ๐”ž0=0\mathfrak{a}_0 = 0, that is, when ๐”ค0\mathfrak{g}_0 has a Cartan subalgebra inside ๐”จ0\mathfrak{k}_0.

Reading path

To understand this page from the ground up, read these 10 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Cartan subalgebra concept
  2. Compact real form concept
  3. Dynkin diagram concept
  4. Eigenspace concept
  5. Killing form concept
  6. Real form concept
  7. Semisimple Lie algebra concept
  8. Simple roots concept
  9. Cartan decomposition statement
  10. Vogan diagram definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Vogan_diagram
About this page
TagV0SCWNM4VR
URIm2://V0SCWNM4VR
Kinddefinition
WritingW0 stub
MSC17B20, 17B22
DefinesVogan diagram
UsesSemisimple Lie algebra, Real form, Cartan subalgebra, Simple roots, Dynkin diagram, Cartan decomposition
Changed3 November 2026

Markdown ยท JSON ยท Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.