Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Vogan and Satake diagrams give equivalent real form classifications

Statement

Assume the Axiom of Choice. For a finite-dimensional complex semisimple Lie algebra g, 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 g0,g0, V(g0)=V(g0)g0g0S(g0)=S(g0). Thus V(g0)S(g0) 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, h0=t0a0 for a maximally split theta-stable Cartan, and Δ0Δ for its black simple roots. Put Q=ZΔ and Q0=ZΔ0.

[A1]

AC is assumed as The Axiom of Choice, including the structure-theory suppliers below.

[L1]

Vogan classes classify real forms. Its proof constructs initial theta-stable Cartans and normalizes simple triples by fi=κei, [ei,fi]=hi, where κ=θσ is compact conjugation (Classification of real forms by Vogan diagrams).

[L2]

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 p0 are conjugate by the compact group K (Conjugacy of Cartan involutions, Cayley transforms connect theta-stable Cartans in the classification, Maximal abelian subspaces of p are conjugate by K).

[L3]

The Satake definition proves compatible bases exist. If t denotes the root action of θ, then tδ=δ for black δ, and for each white simple α there is a unique white ϵα with tαϵαQ0. The involution ϵ fixes unpaired white vertices and exchanges each arrow pair (Satake diagram). The integral assertion follows because these are integral simple-root expansions.

[L4]

The complex root decomposition has one-dimensional nonzero spaces, root brackets add weights, opposite brackets are [E,F]=B(E,F)Hα, and B 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).

[L5]

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).

[L6]

For a Cartan decomposition, Bθ is positive, B is negative on k0 and positive on p0, with the standard bracket inclusions. Restricted spaces are real eigenspaces, θg0λ=g0λ, and their zero space is ma0, where m=Zk0(a0) (Bracket relations and Killing signs in a Cartan decomposition, Restricted root space decomposition).

[L7]

The automorphism group of a real semisimple algebra is a closed Lie group with Lie algebra adg0, 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

technique · direct
1.1

We first justify choice independence for Satake diagrams. Use K=(Aut(g0)O(Bθ))0. This is compact and connected by [L7], has Lie algebra adk0, and commutes with θ: preservation of both B and Bθ is equivalent to that commutation. Differentiation, centerlessness and exponentiation give the Lie algebra assertion. Its elements are products of exp(adX) with Xk0, 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 a0 of a maximally split Cartan is maximal abelian in p0: [L6] gives Zg0(a0)=ma0 with mk0. Thus [L2] supplies kK aligning the split parts of two choices. After this alignment their compact parts are maximal abelian in m=Zk0(a0), since any further commuting element would centralize the Cartan and hence belong to it by self-normalization. Maximal-torus conjugacy in ZK(a0)0 then aligns those compact parts without moving a0. Hence the whole maximally split Cartans are K-conjugate. It remains to compare compatible positive systems on one Cartan. [A1, L2, L6, L7, Cartan subalgebra, algebra]

1.2

The decorated diagram determines the full root involution t. Its action on black roots is the identity. For a white simple root α, write tα=ϵα+v, with vspanRΔ0 by [L3]. For every black δ, orthogonality and tδ=δ give (v,δ)=(α+ϵα,δ). The Gram matrix on the independent black roots is positive definite, so these equations determine v uniquely. The root metric can be chosen canonically from the Killing form on each simple component: the trace formula B(H,H)=γΦγ(H)γ(H) shows that a based root isomorphism preserves this normalization, including permuted isomorphic components. Thus a decorated diagram isomorphism intertwines the two root involutions.

L3L4algebra
2.1

Each reflection of a restricted-root hyperplane is realized in K. Choose 0Eg0λ. By [L6], [E,θE] lies in a0, and pairing it with Ha0 gives [E,θE]=B(E,θE)Hλ, where B(Hλ,H)=λ(H) and B(E,θE)<0. Rescale E positively so this coefficient is 2/λ2, and put h=2Hλ/λ2. Then (E,θE,h) is an sl2 triple. The automorphism k=exp((π/2)ad(E+θE)) belongs to K, fixes kerλ in a0, and sends h to h: on h and EθE 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 2λ are a single wall, so nonreduced systems cause no problem.

L6step 1.1algebra
2.2

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 u=k0ip0 is compact, B(Z,κZ)>0, and after positive rescaling fi=κei satisfies [ei,fi]=hi. Match their based diagrams and use [L5] to identify all ei,fi,hi. This identifies the compact conjugations, since their actions are eifi, fiei, hihi, antilinearly. Hence work in one complex algebra with one κ and two compact-preserving involutions θ,θ having the same root action t, by step 1.2.

L1L4L5L6step 1.2algebra
3.1

Choose a product of these reflections to align the restricted positive systems. Its representative kNK(a0) might move t0. Both kt0 and t0 are maximal abelian in m: any further commuting compact vector centralizes the Cartan and hence belongs to it. The compact group M=ZK(a0) has Lie algebra adm. Applying maximal-torus conjugacy in M0, using the maximal-abelian/torus correspondence of [L2], gives mM0 aligning these compact parts. Thus mk 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 ΦspanRΔ0: 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 a0 and commutes with t, 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.

L2L3L4L7step 1.1step 2.1algebra
3.2

The automorphism A=θθ1 fixes the Cartan pointwise and multiplies each root line by a scalar c(α). These scalars extend to a character c:QU(1). Indeed the simple scalars define a character on the free lattice; the corresponding diagonal assignment eiciei, fici1fi, hihi preserves all Serre relations and agrees with A on the generators, so agrees everywhere. Compact preservation gives ci=1 by pairing ei with κei. From θ2=1 follows c(tλ)=c(λ)1. On every black simple root both involutions act as +1, because the root is compact imaginary, so c is trivial on Q0.

L2L4L5step 2.2algebra
4.1

The character c is trivial on Qt={λQ:tλ=λ}. To prove it, reduce the simple-root coefficient vector of such a λ modulo Q0. By [L3], t 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 α+tα has white coefficient vector [α][ϵα]. Subtract the appropriate integral multiples of these invariant vectors from λ; the remainder lies in Q0. But c(α+tα)=c(α)c(tα)=1 by step 3.2 and c(Q0)=1, proving the claim. This uses the invariant lattice, not just its real span.

L3step 3.2algebra
5.1

Define a character on (t1)Q by b((t1)λ)=c(tλ). It is well defined: two preimages differ by a member of Qt, on which c is one. It extends to a character b:QU(1). In fact Smith normal form in [L5] gives a basis q1,,qr of Q in which (t1)Q is generated by d1q1,,dsqs, with positive integers dj. Choose a dj-th root in U(1) of each prescribed value to define b(qj), and set the remaining basis values to one. Only finitely many roots are selected. Let D be the diagonal Serre automorphism with root scalar b(α). Unit modulus implies Dκ=κD on all generators. On the α root line, DθD1 differs from θ by b(tα)/b(α)=c(tα), exactly the factor in θ=Aθ. The maps also agree on the Cartan, hence DθD1=θ. Consequently D intertwines σ=θκ with σ=θκ and restricts to an isomorphism of real forms. Satake classes are therefore injective on real isomorphism classes.

L5step 2.2step 3.2step 4.1algebra
6.1

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 Q0=Q, while all-white diagrams have Q0=0, 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.

A1L1L3step 3.1step 5.1

Depends on

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