How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Vogan and Satake diagrams give equivalent real form classifications
Statement
Assume the Axiom of Choice. For a finite-dimensional complex semisimple Lie algebra , the Vogan classes of its real forms and their realized Satake classes both classify the real forms up to real Lie isomorphism. In particular, for real forms , Thus is a bijection onto the realized Satake classes. Satake equivalence means isomorphism of decorated Dynkin diagrams, as in Satake diagram. Vogan equivalence is that of Vogan diagram. These decorations are different: Vogan uses a maximally compact Cartan and paints noncompact imaginary simple roots, whereas Satake uses a maximally split Cartan, blackens imaginary simple roots, and pairs white simple roots with equal nonzero restrictions to the split part.
Facts & Assumptions
Given: The algebra and real forms of the statement. For a real form write for a Cartan involution, for real conjugation, for a maximally split theta-stable Cartan, and for its black simple roots. Put and .
AC is assumed as The Axiom of Choice, including the structure-theory suppliers below.
Vogan classes classify real forms. Its proof constructs initial theta-stable Cartans and normalizes simple triples by , , where is compact conjugation (Classification of real forms by Vogan diagrams).
Cartan involutions are conjugate. The Cayley theorem supplies maximally split Cartans, their conjugacy by real inner automorphisms, and absence of noncompact imaginary roots. For a fixed Cartan involution, maximal abelian subspaces of are conjugate by the compact group (Conjugacy of Cartan involutions, Cayley transforms connect theta-stable Cartans in the classification, Maximal abelian subspaces of p are conjugate by K).
The Satake definition proves compatible bases exist. If denotes the root action of , then for black , and for each white simple there is a unique white with . The involution fixes unpaired white vertices and exchanges each arrow pair (Satake diagram). The integral assertion follows because these are integral simple-root expansions.
The complex root decomposition has one-dimensional nonzero spaces, root brackets add weights, opposite brackets are , and is invariant and pairs only opposite root spaces. Simple roots are a basis of the root lattice. The root metric is positive definite and preserved by automorphisms (Root-space decomposition, Root spaces of a complex semisimple Lie algebra are one-dimensional, Brackets of root spaces, The bracket of opposite root spaces is the root line, Orthogonality of root spaces and nondegeneracy on the Cartan subalgebra, Trace forms are symmetric and invariant, Simple roots form a signed integral basis, The roots form a reduced crystallographic Euclidean root system).
Serre presentations identify the algebras from normalized positive and negative simple generators, and assignments preserving the relations extend uniquely (Serre presentation theorem, Serre Lie algebra of a finite-type Cartan matrix). Smith normal form applies to an integer matrix (Every matrix over a PID has a Smith normal form).
For a Cartan decomposition, is positive, is negative on and positive on , with the standard bracket inclusions. Restricted spaces are real eigenspaces, , and their zero space is , where (Bracket relations and Killing signs in a Cartan decomposition, Restricted root space decomposition).
The automorphism group of a real semisimple algebra is a closed Lie group with Lie algebra , and the algebra has zero center. Closed subgroups are Lie groups; maximal tori of a compact connected group are conjugate (Lie algebra of the automorphism group, Semisimple Lie algebras are centerless and perfect, Cartan closed subgroup theorem, Conjugacy of maximal tori). Weyl chambers of a reduced root system are conjugate by root reflections (Simple transitivity on Weyl chambers).
Proof
We first justify choice independence for Satake diagrams. Use . This is compact and connected by [L7], has Lie algebra , and commutes with : preservation of both and is equivalent to that commutation. Differentiation, centerlessness and exponentiation give the Lie algebra assertion. Its elements are products of with , since an exponential identity neighborhood generates a connected group. Changes of involution can be absorbed by real automorphisms by [L2]. For fixed , the split part of a maximally split Cartan is maximal abelian in : [L6] gives with . Thus [L2] supplies aligning the split parts of two choices. After this alignment their compact parts are maximal abelian in , since any further commuting element would centralize the Cartan and hence belong to it by self-normalization. Maximal-torus conjugacy in then aligns those compact parts without moving . Hence the whole maximally split Cartans are -conjugate. It remains to compare compatible positive systems on one Cartan. [A1, L2, L6, L7, Cartan subalgebra, algebra]
The decorated diagram determines the full root involution . Its action on black roots is the identity. For a white simple root , write , with by [L3]. For every black , orthogonality and give . The Gram matrix on the independent black roots is positive definite, so these equations determine uniquely. The root metric can be chosen canonically from the Killing form on each simple component: the trace formula shows that a based root isomorphism preserves this normalization, including permuted isomorphic components. Thus a decorated diagram isomorphism intertwines the two root involutions.
Each reflection of a restricted-root hyperplane is realized in . Choose . By [L6], lies in , and pairing it with gives , where and . Rescale positively so this coefficient is , and put . Then is an triple. The automorphism belongs to , fixes in , and sends to : on and the adjoint generator gives a rotation through . Thus it induces the reflection and permutes restricted roots. These reflections act transitively on restricted chambers: a generic polygonal path between two regular points crosses one distinct root hyperplane at a time, and reflection in the crossing wall interchanges its two adjacent chambers while preserving the entire finite arrangement. Induction on the crossings proves transitivity. Coincident hyperplanes from and are a single wall, so nonreduced systems cause no problem.
Suppose two real forms have isomorphic Satake diagrams. In each choose normalized simple triples with compact conjugation : the argument in [L1] uses only theta-stability of the Cartan, not maximal compactness. Explicitly is compact, , and after positive rescaling satisfies . Match their based diagrams and use [L5] to identify all . This identifies the compact conjugations, since their actions are , , , antilinearly. Hence work in one complex algebra with one and two compact-preserving involutions having the same root action , by step 1.2.
Choose a product of these reflections to align the restricted positive systems. Its representative might move . Both and are maximal abelian in : any further commuting compact vector centralizes the Cartan and hence belongs to it. The compact group has Lie algebra . Applying maximal-torus conjugacy in , using the maximal-abelian/torus correspondence of [L2], gives aligning these compact parts. Thus normalizes the whole Cartan while still aligning restricted positives. After transport, the two compatible positive systems differ only on imaginary roots. Those roots form the reduced root subsystem : a positive root restricting to zero has no white coefficient, since each nonzero simple restriction is positive on a common regular split vector. Apply [L7] to this subsystem to align its positive systems. Each of its reflections fixes and commutes with , so preserves all nonzero root restrictions. Consequently it aligns the full positive systems and preserves the black vertices and pair relation. Their Satake diagrams are therefore isomorphic. Empty restricted or imaginary systems require no reflections. Real isomorphisms transport all these data, proving the Satake assignment is well defined.
The automorphism fixes the Cartan pointwise and multiplies each root line by a scalar . These scalars extend to a character . Indeed the simple scalars define a character on the free lattice; the corresponding diagonal assignment , , preserves all Serre relations and agrees with on the generators, so agrees everywhere. Compact preservation gives by pairing with . From follows . On every black simple root both involutions act as , because the root is compact imaginary, so is trivial on .
The character is trivial on . To prove it, reduce the simple-root coefficient vector of such a modulo . By [L3], acts on white classes by minus the permutation . A fixed vector has zero coefficient at every unpaired white vertex and opposite coefficients at the two vertices of each pair. For a chosen member of each pair, the invariant vector has white coefficient vector . Subtract the appropriate integral multiples of these invariant vectors from ; the remainder lies in . But by step 3.2 and , proving the claim. This uses the invariant lattice, not just its real span.
Define a character on by . It is well defined: two preimages differ by a member of , on which is one. It extends to a character . In fact Smith normal form in [L5] gives a basis of in which is generated by , with positive integers . Choose a -th root in of each prescribed value to define , and set the remaining basis values to one. Only finitely many roots are selected. Let be the diagonal Serre automorphism with root scalar . Unit modulus implies on all generators. On the root line, differs from by , exactly the factor in . The maps also agree on the Cartan, hence . Consequently intertwines with and restricts to an isomorphism of real forms. Satake classes are therefore injective on real isomorphism classes.
By [L1] Vogan classes classify the real forms. By step 3.1 and step 5.1 Satake classes do also, with surjectivity onto the realized classes by their definition. Composing these two classifications gives the asserted equivalences and bijection. The zero algebra has one empty diagram; all-black diagrams have , while all-white diagrams have , and the invariant-lattice proof treats both. Rank-one lattices and permuted components are covered by the same finite-basis argument. The stated difference between the decorations is their defining choice of Cartan and root labels, not an assertion that their drawings coincide.
Depends on
- Satake diagram
- Vogan diagram
- The Axiom of Choice
- Classification of real forms by Vogan diagrams
- Conjugacy of Cartan involutions
- Cayley transforms connect theta-stable Cartans in the classification
- Maximal abelian subspaces of p are conjugate by K
- Cartan subalgebra
- Root-space decomposition
- Root spaces of a complex semisimple Lie algebra are one-dimensional
- Brackets of root spaces
- The bracket of opposite root spaces is the root line
- Orthogonality of root spaces and nondegeneracy on the Cartan subalgebra
- Trace forms are symmetric and invariant
- Simple roots form a signed integral basis
- The roots form a reduced crystallographic Euclidean root system
- Serre presentation theorem
- Serre Lie algebra of a finite-type Cartan matrix
- Every matrix over a PID has a Smith normal form
- Bracket relations and Killing signs in a Cartan decomposition
- Restricted root space decomposition
- Lie algebra of the automorphism group
- Semisimple Lie algebras are centerless and perfect
- Cartan closed subgroup theorem
- Conjugacy of maximal tori
- Simple transitivity on Weyl chambers
Used by
Dependency tree · two levels
114 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed., Chapter VI (standard reference, not scraped)