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.
Satake diagram
Definition
Assume the Axiom of Choice (The Axiom of Choice).
Let be a finite-dimensional real semisimple Lie algebra with Cartan involution and Cartan decomposition (Theta-stable Cartan subalgebras and their compact and split parts). Let be a -stable Cartan subalgebra of whose split part is a maximal abelian subspace of ; such an is maximally split, or maximally noncompact (Theta-stable Cartan subalgebras and their compact and split parts, Maximal split abelian subspace and real rank). Write for the complexification, and , so that , and let be the root system of , with root spaces ; the -linear extension of is again written .
Root types. By Cayley transform of a theta-stable Cartan subalgebra every root satisfies and , and is equivalently , , or neither, where . In particular an imaginary root is exactly a root whose restriction to vanishes, and permutes the three classes of roots. An imaginary root has -stable root space , which is one-dimensional (Root spaces of a complex semisimple Lie algebra are one-dimensional), so it lies either in the -eigenspace of or in the -eigenspace ; the imaginary root is compact in the first case and noncompact in the second. Because is maximally split, no noncompact imaginary root of exists: a noncompact imaginary root admits a noncompact-imaginary Cayley transform, which produces a -stable Cartan subalgebra whose noncompact dimension is larger by one (Cayley transforms connect theta-stable Cartans in the classification, assertion 2).
Compatible positive systems. A positive system of and its base are as in Positive systems and simple roots. Let be the finite set of restricted roots (Restricted root and restricted root space, Restricted root space decomposition). A restricted positive system means for a regular , with for all . This definition also applies when the restricted root system is nonreduced. The nonzero restrictions of complex roots are exactly : restriction of the complex root decomposition groups its weight spaces according to , while complexification of a real restricted-weight space gives the same joint eigenspace, since its eigenvalue equations have real coefficients (Root-space decomposition, Restricted root and restricted root space).
A positive system is compatible with if Given the specified , take a regular defining it. Choose with for every imaginary root; the finite-union lemma gives such a because those restrictions are nonzero (A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces). Use lexicographic positivity of . To see that this is a positive system in the stated Euclidean sense, choose so small that for every root with . There are only finitely many such inequalities, so they can all hold. The regular vector then gives exactly those signs, since . The real positive Killing space here is justified in step 2.1 of Cayley transforms connect theta-stable Cartans in the classification. If a relevant root family is empty, choose the corresponding vector to be zero and omit its inequalities.
The Satake diagram. Let be a positive system of compatible with a positive system of , with base . The Satake diagram of the quadruple is the Dynkin diagram of relative to (Dynkin diagram with edge multiplicity and arrow convention) together with the following two decorations of its vertices:
- Colouring. A vertex is black if it is an imaginary simple root, that is, if , and white otherwise, that is, if . Since is maximally split, every imaginary root of is compact, so the black vertices are exactly the compact imaginary simple roots.
- Arrows. Two distinct white vertices are joined by a Satake arrow when their restrictions to agree: In the standard drawing a Satake arrow is curved or drawn in a distinct style, so that it is not confused with the arrows attached to multiple edges of the underlying Dynkin diagram.
Here the equal-restriction relation really is a pairing. We give the linear-algebra verification. Put , , and on the real root space. The map is a root-system involution, acts as minus identity on , and preserves restrictions to . For a white simple root , is positive, since its nonzero restriction is the same positive restricted root as that of . The simple-root expansion theorem (Simple roots form a signed integral basis) therefore makes the induced matrix of on the quotient by nonnegative integral in the basis of white simple-root classes. Its inverse is itself and is also nonnegative. Such an invertible matrix permutes the extreme rays of the nonnegative coordinate cone: those rays are exactly the coordinate axes, since a vector with two positive coordinates splits into two nonproportional nonnegative vectors. Thus the matrix permutes axes up to positive scalars. The matrix and its inverse are integral, so each scalar and its reciprocal are positive integers, forcing the scalar to be one. Consequently there is an involution of the white simple roots such that .
It follows that and have equal restriction. Conversely, if white have equal restriction, then : half of either sum is the corresponding functional on , extended by zero on . Modulo , equality reads in the basis of white classes. This forces the two unordered orbits, with repetitions for a fixed point, to be the same. Hence a nonzero restriction is shared by at most two white simple roots, and the distinct pair is precisely a two-element orbit of this involution. This proves the assertion behind the arrow drawing, without identifying the pairing with the possibly base-nonpreserving map itself.
Isomorphism and equivalence. Two Satake diagrams are equivalent if they are isomorphic as decorated Dynkin diagrams: a vertex bijection preserves edge multiplicities, edge arrows, black and white colors, and Satake pairs. In based-root-system language the isomorphism preserves roots and Cartan integers; arbitrary absolute length scales on separate components are not part of these data.
A formally colored and paired finite-type Dynkin diagram is called admissible Satake data if it occurs from a quadruple as above; the word Satake diagram is reserved here for these admissible data. This definition does not assert that arbitrary black subsets and pairings are realizable. In particular the admissibility condition for Satake data differs from the unrestricted fixed-vertex painting in an abstract Vogan diagram (Vogan diagram).
A change of compatible positive system on a realized quadruple requires recomputing colors and pairs using the actual restriction map. It is not an operation specified by an arbitrary abstract decoration. Independence of the resulting equivalence class from the choices, and its relation to the Vogan classification, are the assertions of Vogan and Satake diagrams give equivalent real form classifications. They are not assumed in this definition. For all vertices are black and no Satake arrows occur; for the zero algebra the whole diagram is empty.
Depends on
- The Axiom of Choice
- Theta-stable Cartan subalgebras and their compact and split parts
- Maximal split abelian subspace and real rank
- Cayley transform of a theta-stable Cartan subalgebra
- Root spaces of a complex semisimple Lie algebra are one-dimensional
- Cayley transforms connect theta-stable Cartans in the classification
- Positive systems and simple roots
- Restricted root and restricted root space
- Restricted root space decomposition
- Root-space decomposition
- A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces
- Dynkin diagram with edge multiplicity and arrow convention
- Simple roots form a signed integral basis
- Vogan diagram
Used by
Dependency tree · two levels
59 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)