Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-09-22
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 g0 be a finite-dimensional real semisimple Lie algebra with Cartan involution θ and Cartan decomposition g0=k0p0 (Theta-stable Cartan subalgebras and their compact and split parts). Let h0=t0a0 be a θ-stable Cartan subalgebra of g0 whose split part a0 is a maximal abelian subspace of p0; such an h0 is maximally split, or maximally noncompact (Theta-stable Cartan subalgebras and their compact and split parts, Maximal split abelian subspace and real rank). Write h=h0ih0 for the complexification, t=t0it0 and a=a0ia0, so that h=ta, and let Φ=Φ(g,h) be the root system of (g,h), with root spaces gα; the C-linear extension of θ is again written θ.

Root types. By Cayley transform of a theta-stable Cartan subalgebra every root αΦ satisfies α(t0)iR and α(a0)R, and α is real if αt0=0,imaginary if αa0=0,complex otherwise; equivalently θα=α, θα=α, or neither, where θα=αθ1. In particular an imaginary root is exactly a root whose restriction to a0 vanishes, and θ permutes the three classes of roots. An imaginary root has θ-stable root space gα, which is one-dimensional (Root spaces of a complex semisimple Lie algebra are one-dimensional), so it lies either in the +1-eigenspace k of θ or in the 1-eigenspace p; the imaginary root is compact in the first case and noncompact in the second. Because h0 is maximally split, no noncompact imaginary root of (g,h) 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 Σ=Σ(g0,a0) be the finite set of restricted roots (Restricted root and restricted root space, Restricted root space decomposition). A restricted positive system means Σ+={λΣ:λ(H)>0} for a regular Ha0, with λ(H)0 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 αa0, 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 αΦ+,αa00αa0Σ+. Given the specified Σ+, take a regular H defining it. Choose Tt0 with α(T)0 for every imaginary root; the finite-union lemma gives such a T 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 (α(H),Imα(T)). To see that this is a positive system in the stated Euclidean sense, choose ϵ>0 so small that ϵImα(T)<α(H) for every root with α(H)0. There are only finitely many such inequalities, so they can all hold. The regular vector HiϵTa0it0 then gives exactly those signs, since α(HiϵT)=α(H)+ϵImα(T). 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 (g0,h0,Σ+,Φ+) 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 αa0=0, and white otherwise, that is, if αa00. Since h0 is maximally split, every imaginary root of (g,h) 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 a0 agree: αa0=βa0(0). 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 Δ0={δΔ:δa0=0}, V0=spanRΔ0, and s=θ on the real root space. The map s is a root-system involution, acts as minus identity on V0, and preserves restrictions to a0. For a white simple root α, sα 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 s on the quotient by V0 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 sααV0.

It follows that α and α have equal restriction. Conversely, if white α,β have equal restriction, then α+sα=β+sβ: half of either sum is the corresponding functional on a0, extended by zero on it0. Modulo V0, 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 a0=0 all vertices are black and no Satake arrows occur; for the zero algebra the whole diagram is empty.

Depends on

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