Alphabeta Math
Pipeline-generated
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.

Root Systems, Dynkin Diagrams, and the Cartan-Killing Classification

1 · Prerequisites

2 · Summary

This page develops abstract root systems and the Cartan-Killing classification of complex semisimple Lie algebras. It introduces reduced crystallographic root systems, their Weyl groups, positive systems and simple roots, chambers, heights and highest roots, root and weight lattices, Cartan matrices and Dynkin diagrams, and proves the rank-two classification together with the unique irreducible decomposition. The classification of connected finite-type Dynkin diagrams is then completed, every type is realized by explicit Euclidean root systems, and coroot duality is proved to exchange the types Bn and Cn and to fix all others up to isomorphism. The second half constructs the Serre Lie algebra of a finite-type Cartan matrix, proves the Serre presentation theorem via the triangular decomposition, integrable sl2-actions and height induction, and derives the isomorphism theorem, the existence theorem and the Cartan-Killing classification of complex simple Lie algebras, with the classical matrix realizations sln+1, so2n+1, sp2n and so2n identified. Remarks and false statements record the limits of the classification: it does not extend to real forms or to connected global Lie groups.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Reduced crystallographic Euclidean root system

Definition

Let E be a finite-dimensional real inner product space with inner product (,) (Real and complex inner product spaces, with the inner product linear in the first argument), and let ΦE{0} be a finite subset which spans E over R. For αΦ define sα:EE,sα(x)=x2(x,α)(α,α)α. Since (α,α)>0 for α0, the scalar 2(x,α)/(α,α) is well defined, and substitution gives sα(α)=α,sα(x)=xwhenever (x,α)=0. A reduced crystallographic root system in E (equivalently, a reduced abstract root system) is such a pair (E,Φ) satisfying:

  1. sα(Φ)=Φ for every αΦ;
  2. 2(β,α)(α,α)Z for all α,βΦ (the crystallographic, or integrality, condition);
  3. RαΦ={α,α} for every αΦ (the reducedness condition).

The elements of Φ are its roots, and sα is the reflection in the hyperplane orthogonal to α: it fixes α pointwise and negates α.

Every root α satisfies αΦ: taking β=α in condition 2 gives 2Z, and condition 1 gives sα(α)=αΦ. The integer 2(β,α)/(α,α) is the Cartan integer attached to the ordered pair (β,α); condition 2 is the crystallographic axiom recorded above.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Rank and isomorphism of root systems

Definition

Let ΦE be a reduced crystallographic root system (Reduced crystallographic Euclidean root system).

Its rank is rankΦ=dimRE. Since Φ spans E, the rank is determined by Φ; it is the number of simple roots of any base of Φ.

Let ΦE be a second reduced crystallographic root system. An isomorphism of root systems φ:ΦΦ is a linear isomorphism φ:EE with φ(Φ)=Φ that preserves every Cartan integer: for all α,βΦ, 2(φ(β),φ(α))(φ(α),φ(α))=2(β,α)(α,α).

Because 2(β,α)(α,α)=2cosθ  βα,θ the angle between α,β, a map as above preserves the angle of every pair of nonproportional roots and the ratio of their lengths whenever the two roots lie in the same irreducible component; conversely, a linear isomorphism carrying Φ onto Φ that preserves the angle and the length ratio of every pair of nonproportional roots preserves all Cartan integers and is therefore an isomorphism of root systems. An isomorphism need not preserve the given inner products on the nose, but within each irreducible component it preserves the common scale, hence all angles between roots and all ratios β/α formed by two roots of the same irreducible component; ratios of lengths of roots taken from different irreducible components need not be preserved.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Coroot and dual root system

Definition

Let ΦE be a reduced crystallographic root system in the real inner product space E (Reduced crystallographic Euclidean root system). For αΦ put α=2α(α,α)E. The vector α is the coroot of α, and the set Φ={α:αΦ} is the dual root system.

The definitions are well posed because (α,α)>0 for α0. Two elementary identities, obtained by substituting the definition and using bilinearity of the inner product, are (α,β)=2(β,α)(α,α),2α(α,α)=α, for all α,βΦ; in particular α=α, and the Cartan integer 2(β,α)/(α,α) equals the inner product (α,β). Also α is a positive real multiple of α, so Rα=Rα and RαΦ={±α}.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Weyl group

Definition

Let ΦE be a reduced crystallographic root system (Reduced crystallographic Euclidean root system) with coroots α=2α/(α,α) (Coroot and dual root system). For αΦ the associated reflection is sα(x)=x(x,α)α=x2(x,α)(α,α)α, which is an orthogonal transformation of E with sα(α)=α and sα(x)=x for (x,α)=0. The Weyl group of Φ is the subgroup W(Φ)=sα:αΦO(E) of the orthogonal group generated by all root reflections.

Since sα(Φ)=Φ for every αΦ by the root-system axioms, every element of W(Φ) permutes Φ. The Weyl group depends on Φ and its inner product; rescaling the inner product does not change it, because the reflections sα are unchanged.

PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

The Weyl group is finite and faithful

Statement

Let Φ be a reduced crystallographic root system. Then its Weyl group W(Φ) is finite, and the action of W(Φ) on Φ by restriction is faithful: the homomorphism W(Φ)Sym(Φ) that sends w to its restriction to Φ is injective.

Facts & Assumptions

Given: A reduced crystallographic root system Φ in a finite-dimensional real inner product space E, with reflections sα and Weyl group W(Φ).

[L1]

Φ is finite, spans E, and sα(Φ)=Φ for all αΦ (Reduced crystallographic Euclidean root system).

[L2]

The reflection sα is orthogonal, sα(α)=α, and sα(x)=x for (x,α)=0 (Weyl group, Coroot and dual root system).

[L3]

W(Φ)=sα:αΦ is the subgroup of O(E) generated by the reflections (Weyl group).

Proof

technique · direct
1.1

Each generator sα lies in O(E) and satisfies sα(Φ)=Φ by [L1]. Consequently every wW(Φ), being a finite product of generators and their inverses, restricts to a bijection w:ΦΦ.

L1L2L3algebra
2.1

The assignment ρ:W(Φ)Sym(Φ), ρ(w)=wΦ, is a group homomorphism: the restriction of a composition of linear maps is the composition of the restrictions. Hence ρ(W(Φ)) is a subgroup of the finite group Sym(Φ).

L1step 1.1algebra
3.1

If ρ(w)=id then w(α)=α for every αΦ; since Φ spans E and w is linear, w=idE. Thus kerρ={1}: the restriction action on the finite set Φ is faithful, and ρ identifies W(Φ) with the finite subgroup ρ(W(Φ))Sym(Φ). In particular W(Φ) is finite and W(Φ)=ρ(W(Φ))Φ!.

L1step 2.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Reducible and irreducible root systems

Definition

Let ΦE be a reduced crystallographic root system in the finite-dimensional real inner product space E (Reduced crystallographic Euclidean root system).

Then Φ is reducible if there are linear subspaces E1,E2E with E=E1E2, (E1,E2)=0, both Ei nonzero, and Φ=(ΦE1)(ΦE2), the union being disjoint. Otherwise Φ is irreducible.

Equivalently, Φ is reducible if it is the disjoint union of two nonempty subsets Φ1,Φ2 with (Φ1,Φ2)=0, in which case one may take Ei=spanΦi: indeed if Φ=(ΦE1)(ΦE2) then Φ spans E1 and E2 separately, because otherwise a nonzero vector of Ei orthogonal to ΦEi and to E3i would be orthogonal to all of Φ and hence zero. Consequently both ΦEi are nonempty, and each of them is itself a reduced crystallographic root system in Ei whose roots are those of Φ lying in Ei.

A one-element root system is impossible: if αΦ, reflection in α sends α to the distinct root α, because α0. The zero vector space carries the empty root system under the stated root-system axioms; it is irreducible by the definition above, since the zero space has no orthogonal direct-sum decomposition into two nonzero subspaces. Every rank-one root system {±α} is likewise irreducible.

PropositionStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Unique irreducible decomposition

Statement

Let ΦE be a reduced crystallographic root system. Then Φ is the disjoint union Φ=Φ1Φm of nonempty root systems ΦiEi:=spanΦi that are irreducible, pairwise orthogonal, and span E as an orthogonal direct sum E=E1Em. More generally, if Φ=Ψ1Ψk is any decomposition into pairwise orthogonal root systems Ψj spanning pairwise orthogonal subspaces Fj with E=jFj, then each Ψj is a union of some of the Φi, and each Φi is contained in some Ψj. If the Ψj are also irreducible, deleting their empty terms makes the two decompositions agree up to order. Thus the decomposition into nonempty irreducible components is unique up to order. For Φ= and E=0, this is the empty decomposition (m=0); the empty root system remains irreducible under the definition, but is not counted as a component.

Facts & Assumptions

Given: A reduced crystallographic root system Φ in the finite-dimensional real inner product space E.

[L1]

Φ is finite, spans E, 0Φ, sα(Φ)=Φ for all αΦ, every Cartan integer 2(β,α)/(α,α) is an integer, and RαΦ={±α} (Reduced crystallographic Euclidean root system).

[L2]

Φ is reducible when Φ=(ΦE1)(ΦE2) for an orthogonal direct decomposition E=E1E2 with both Ei nonzero, and irreducible otherwise; each part of such a decomposition spans its subspace (Reducible and irreducible root systems).

[L3]

For a linear subspace VE with ΦV, the set ΦV is a reduced crystallographic root system in span(ΦV): it is finite, 0 it, reducedness and integrality are inherited, and for α,βΦV one has sα(β)ΦV because sα preserves Φ and maps V into V. (Reduced crystallographic Euclidean root system)

Proof

technique · direct
1.1

Define a graph G with vertex set Φ, two distinct vertices α,β being joined by an edge exactly when (α,β)0. Let C1,,Cm be the connected components of G, with m=0 if Φ is empty, so that Φ=C1Cm and every Ci is nonempty.

givenalgebra
2.1

If αCi and βCj with ij, then (α,β)=0, since otherwise an edge would join the two vertices and they would lie in one component. Consequently spanCispanCj for ij, and E=spanΦ=spanC1spanCm is an orthogonal direct sum.

L1step 1.1algebra
2.2

For uniqueness, let Φ=Ψ1Ψk with each Ψj a reduced crystallographic root system in Fj=spanΨj, the Fj pairwise orthogonal, and E=jFj. If αΨj and βΨj with jj then (α,β)=0 because FjFj; hence no edge of G joins distinct parts, and each connected component Ci of G is contained in a single Ψj.

givenstep 1.1algebra
3.1

For each i one has Ci=ΦspanCi. Indeed, if γΦspanCi then γ=αCicαα; if γCi then (γ,α)=0 for every αCi by step 2.1 applied to the components, whence (γ,γ)=αcα(γ,α)=0 and γ=0, contradicting 0Φ.

L1step 2.1algebra
4.1

Each Ci is a reduced crystallographic root system in Ei=spanCi: this is [L3] applied to V=Ei, whose intersection with Φ is Ci by step 3.1, and Ci spans Ei by definition. Moreover Ci is irreducible: if Ci=(CiU)(CiV) came from an orthogonal decomposition Ei=UV with both summands nonzero, then no edge of G would join a vertex in CiU to a vertex in CiV, so the graph G restricted to Ci would be disconnected, contradicting that Ci is a component of G.

L2step 1.1step 3.1algebra
4.2

Conversely each Ψj is a union of components: if γΨj then by the argument of step 3.1 applied inside the subsystem Ψj, the whole component Ciγ of the graph G lies in Ψj, since a root of Φ nonorthogonal to γ must lie in Fj (it is orthogonal to every other Fj). Hence Ψj={Ci:CiΨj}.

step 2.1step 3.1step 2.2algebra
5.1

Steps 3.1 and 4.1 exhibit Φ as the disjoint union of the irreducible root systems C1,,Cm, whose spans are pairwise orthogonal and span E; this is the asserted decomposition.

step 3.1step 4.1
6.1

If each Ψj is irreducible, discard all empty Ψj (whose spans are zero). Each remaining Ψj is by step 4.2 a nonempty union of components, and by step 4.1 each component is irreducible; an irreducible root system cannot be the orthogonal disjoint union of two nonempty root subsystems, so Ψj contains exactly one component. Therefore the components C1,,Cm are a permutation of the nonempty parts Ψj, and the decomposition into nonempty components is unique up to order. If Φ=, every Ψj is empty and deleting them leaves exactly the empty decomposition with E=0.

L2step 4.1step 2.2step 4.2
TheoremStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Rank-two root-system classification

Statement

Let ΦE be a reduced crystallographic root system, and let α,βΦ be nonproportional roots. Write nαβ=2(β,α)(α,α),nβα=2(α,β)(β,β) for the two Cartan integers, and let θ(0,π) be the angle between α and β.

(i) nαβnβα=4cos2θ{0,1,2,3}. With αβ the possibilities are exactly: nαβ=nβα=0 and θ=90; α2=β2 and either nαβ=nβα=1 with θ=60 or nαβ=nβα=1 with θ=120; α2=2β2 and either (nαβ,nβα)=(1,2) with θ=45 or (nαβ,nβα)=(1,2) with θ=135; and α2=3β2 and either (nαβ,nβα)=(1,3) with θ=30 or (nαβ,nβα)=(1,3) with θ=150.

(ii) If (α,β)>0 then αβΦ; if (α,β)<0 then α+βΦ.

(iii) If α,β are distinct simple roots of Φ relative to some positive system, then (α,β)0 and αβΦ.

(iv) If E has dimension two and {α,β} is a base of Φ, then (α,β)0, so the angle is nonacute: it is one of 90, 120, 135, 150. The irreducible reduced crystallographic rank-two root systems are exactly A2 (three positive roots), B2C2 (four positive roots) and G2 (six positive roots), while the reducible case is A1A1.

Facts & Assumptions

Given: A reduced crystallographic root system Φ in the finite-dimensional real inner product space E, nonproportional roots α,βΦ, and the notation nαβ, nβα, θ of the statement.

[L1]

Φ is finite, spans E, 0Φ, sγ(Φ)=Φ, 2(δ,γ)/(γ,γ)Z, and RγΦ={±γ} for all roots (Reduced crystallographic Euclidean root system).

[L2]

sγ(x)=x(x,γ)γ=x2(x,γ)(γ,γ)γ is orthogonal, equals the identity on γ, and sends γ to γ (Weyl group, Coroot and dual root system).

[L3]

Cauchy-Schwarz: (x,y)xy for all x,y with equality if and only if x,y are linearly dependent (Cauchy–Schwarz: u,vuv, with equality exactly for linearly dependent vectors).

[L4]

A reducible rank-two system is the orthogonal disjoint union of root systems spanning pairwise orthogonal subspaces that span E, uniquely up to order (Unique irreducible decomposition).

[L5]

A finite-dimensional vector space over an infinite field is not a finite union of proper linear subspaces (A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces).

Proof

technique · direct
1.1

For a linear subspace VE with ΦV, the set ΦV is a reduced crystallographic root system in span(ΦV): it is finite, contains no zero vector, inherits integrality and reducedness, and sγ(ΦV)ΦV for γΦV because sγ preserves Φ and maps V into V. In particular the plane subsystem Φspan(α,β) is a rank-two reduced crystallographic root system.

L1L2algebra
1.2

Both nαβ and nβα are integers, and nαβnβα=4(α,β)2(α,α)(β,β)=4cos2θ. Since α,β are nonproportional, Cauchy-Schwarz gives (α,β)<αβ, so 04cos2θ<4; being a product of integers, 4cos2θ is a nonnegative integer, hence lies in {0,1,2,3}. If αβ then nαβ=2cosθβα2cosθαβ=nβα, and both absolute values cannot be at least 2, since then their product would be at least 4. Hence nαβ{0,1}; moreover nαβ0 if and only if nβα0, and then nαβ=±1, nβα=±(nαβnβα) with the same sign, and α2/β2=nβα/nαβ, because nβα/nαβ=(α,α)/(β,β).

L1L2L3algebra
1.3

Fix a vector vE with (v,γ)0 for every γΦ, which exists because Φ is finite and E is not a finite union of the proper subspaces γ [L5]. Call γ positive when (v,γ)>0 and negative otherwise, so that Φ is the disjoint union of its positive and negative roots and the negative roots are the negatives of the positive ones; call a positive root simple when it is not a sum of two positive roots. If a positive root is not simple, write it as a sum of two positive roots; the value of v on each summand is strictly smaller than on the sum, so iterating the decomposition and always decomposing a summand that is not simple terminates after finitely many steps (the values of v on positive roots form a finite set and strictly decrease along the iteration). The terminal summands are simple, so every positive root is a sum of simple roots.

L1L2L5algebra
1.4

(Reducible case) If Φ is a reducible rank-two root system then Φ=Φ1Φ2 with Φi root systems spanning pairwise orthogonal nonzero subspaces Ei with E=E1E2 [L4]; hence dimEi=1, and a rank-one reduced crystallographic root system is {±γ} for its unique positive root γ, since every root lies on the line Rγ and reducedness excludes proper multiples. Thus the reducible rank-two system is A1A1.

L1L4algebra
2.1

With αβ, the identity of step 1.2 enumerates the possibilities. If nαβnβα=0 then (nαβ,nβα)=(0,0) and θ=90. If the product is 1 then nαβ=nβα=±1, so α2=β2, 4cos2θ=1, and θ=60 if cosθ>0, θ=120 if cosθ<0. If the product is 2 then nαβ=±1, nβα=±2 with the same sign, α2=2β2, 4cos2θ=2, and the angle is 45 or 135 according to the sign of cosθ. If the product is 3 then nαβ=±1, nβα=±3, α2=3β2, and the angle is 30 or 150.

step 1.2algebra
2.2

Assume (α,β)>0. Then both Cartan integers are positive, so by step 1.2 the one attached to the longer of the two roots equals 1: if αβ then nβα=1 and sβ(α)=αnβαβ=αβΦ; if αβ then nαβ=1 and sα(β)=βnαβα=βαΦ, so that αβ=(βα)Φ. Applying this to α gives the companion statement: if (α,β)<0 then α+βΦ.

L2step 1.2algebra
3.1

If α,β are distinct simple roots and (α,β)>0, then αβΦ by step 2.2, and this root is positive or negative: if it is positive then α=(αβ)+β exhibits α as a sum of two positive roots, and if it is negative then β=(βα)+α exhibits β as a sum of two positive roots, contradicting simplicity in either case. Hence (α,β)0. The same reasoning shows αβΦ, since a root αβ is positive, giving the first contradiction, or negative, giving the second.

step 2.2step 1.3algebra
3.2

(Root strings) Let αΦ and βΦ with β±α. Then the set of integers k with β+kαΦ is a nonempty interval {p,p+1,,q} of consecutive integers with p0, q0, no gaps, and pq=nαβ; moreover p+q3. Indeed, the set is nonempty because k=0 occurs, and is invariant under knαβk because sα(β+kα)=β(nαβ+k)αΦ, so it is finite and symmetric about nαβ/2. If it had a gap, there would be r<s1 with β+rαΦ, β+sαΦ and β+(r+1)α,β+(s1)αΦ; then (β+rα,α)0, since otherwise step 2.2 applied to α would give β+(r+1)αΦ, and similarly (β+sα,α)0; subtracting gives (sr)(α,α)0, a contradiction. Hence there are no gaps, and the symmetry of an interval about nαβ/2 gives pq=nαβ. Finally, replacing β by β+qα reduces to the case q=0 and p=nαβ, and nαβ3 by steps 1.2 and 2.1 applied to the nonproportional pair (β+qα,α); if that pair is proportional then reducedness gives at most three elements.

L1L2step 2.2step 1.2step 2.1algebra
4.1

In a rank-two root system the simple roots are linearly independent, hence exactly two; explicitly, if iIciαi=jJcjαj with disjoint finite index sets and positive real coefficients ci,cj (which is the shape of every nontrivial linear relation), then for γ=iIciαi0 one computes 0<(γ,γ)=(iIciαi,jJcjαj)=iI,jJcicj(αi,αj)0, because the two index sets are disjoint and distinct simple roots have nonpositive inner product by step 3.1. Therefore the simple roots are independent; since they span E by step 1.3, a rank-two system has exactly two simple roots α1,α2, every root is ±(mα1+nα2) with m,n0 integers, and the Cartan matrix is one of (2002), (2112), (2212), (2122), (2312), (2132), because both off-diagonal entries are nonpositive integers whose product is one of 0,1,2,3.

L1step 1.3step 3.1step 1.2algebra
4.2

(Descent and constraints for a base) Let α1,α2 be the simple roots of a rank-two system in the ordering of step 1.3, and let γ=mα1+nα2 be a positive root, m,n0 integers. Write c=nα1α2=2(α1,α2)/(α1,α1) and c=nα2α1=2(α1,α2)/(α2,α2); both are nonpositive integers with product in {0,1,2,3} by steps 3.1 and 1.2. Then: (a) nα1γ=2m+nc and nα2γ=2n+mc, and the reflected roots sα1γ=(m+nc)α1+nα2 and sα2γ=mα1(n+mc)α2 again have coefficients of one sign; hence if n1 then (m+nc)0, that is mnc, and if m1 then nmc. (b) The string bounds of step 3.2 give 2m+nc3 and 2n+mc3. (c) Reducedness gives: if n=0 then m=1, and if m=0 then n=1. (d) If γα1 and 2m+nc1, then the α1-string through γ contains (m1)α1+nα2, so this vector lies in Φ and m1; and if γα2 and 2n+mc1, then mα1+(n1)α2Φ and n1.

L2step 3.1step 3.2step 1.2algebra
5.1

(The three irreducible cases) Let Φ be an irreducible rank-two root system with simple roots α1,α2 and Cartan matrix as in step 4.1; exclude the first matrix, which gives a reducible system by step 1.4 (no positive root has both coefficients nonzero by (a) of step 4.2). For the five remaining cases define K={mα1+nα2: (m,n)S},S={{(1,0),(0,1),(1,1)},(c,c)=(1,1),{(1,0),(0,1),(1,1),(2,1)},(c,c)=(2,1),{(1,0),(0,1),(1,1),(1,2)},(c,c)=(1,2),{(1,0),(0,1),(1,1),(2,1),(3,1),(3,2)},(c,c)=(3,1),{(1,0),(0,1),(1,1),(1,2),(1,3),(2,3)},(c,c)=(1,3). Every element of K is a root: α1,α2 are simple; α1+α2, α1+2α2, α1+3α2 are the images of α1 under the reflections sα2, and α1+α2, 2α1+α2, 3α1+α2 are the images of α2 under sα1; for (c,c)=(3,1) one has 2α1+α2=sα1(α1+α2) and 3α1+2α2=sα2(3α1+α2), and the last case is its mirror image. In each case K has 3, 4, 4, 6, 6 elements and spans E.

L1L2step 3.1step 4.1step 1.4step 4.2algebra
6.1

(Exhaustiveness) In each of the five cases of step 5.1, every positive root lies in K. Suppose not, and choose a positive root γ=mα1+nα2 of least height among the positive roots outside K; it is not simple, so by step 1.3 it is a sum of two positive roots of smaller heights, and by minimality of h=m+n both summands lie in K. Hence γ is a sum of two elements of K, and each such sum is either an element of K, or violates one of conditions (a)-(c) of step 4.2, or descends by (d) to such a sum, or is excluded by reducedness [L1]; the following complete lists of the coordinate pairs of the sums of two elements of K verify this case by case. For (c,c)=(1,1) the sums are (2,0),(1,1),(2,1),(0,2),(1,2),(2,2): (2,0) and (0,2) violate (c), (2,1) violates mnc=n and (1,2) violates nmc=m in (a), and (2,2)=2(α1+α2) is excluded by reducedness because α1+α2K is a root. For (c,c)=(2,1) the sums with n1 are (2,0),(1,1),(2,1),(3,1),(0,2),(1,2),(2,2),(3,2),(4,2): (2,0) and (0,2) violate (c), (3,1) violates m2n and (1,2) violates nm in (a), (2,2)=2(α1+α2) and (4,2)=2(2α1+α2) are excluded by reducedness, and (3,2) satisfies (a)-(c) but (d) applied to α1 gives (2,2)Φ, already excluded. The case (c,c)=(1,2) is the mirror image with the two coordinates and the two simple roots interchanged. For (c,c)=(3,1) the sums of two elements of K are (2,0),(1,1),(2,1),(3,1),(4,1),(4,2),(0,2),(1,2),(2,2),(3,2),(3,3),(4,3),(5,2),(5,3),(6,2),(6,3),(6,4): (2,0) and (0,2) violate (c), (4,1) violates m3n and (1,2) violates nm in (a), (5,2) and (6,2) violate 2m3n3 in (b), (3,3)=3(α1+α2), (2,2)=2(α1+α2), (4,2)=2(2α1+α2) and (6,3)=3(2α1+α2) are excluded by reducedness because α1+α2 and 2α1+α2 lie in K and are roots, (5,3) descends by (d) applied to α1 to (4,3), and (4,3) and (6,4) descend by (d) applied to α2 to (4,2) and (6,3), all already excluded, while (1,1),(2,1),(3,1),(3,2) lie in K. The mirror case (c,c)=(1,3) is handled by the same interchange of coordinates and simple roots. Thus no positive root lies outside K, so Φ=K(K) in each of the five cases, and the irreducible rank-two root systems are exactly the systems with 3, 4, 4, 6, 6 positive roots.

L1step 1.3step 4.2step 5.1algebra
7.1

The systems of 3, 4 and 6 positive roots are the root systems traditionally called A2, B2C2 and G2: for (c,c)=(1,1) the roots are ±α1,±α2,±(α1+α2) with α1=α2 and angle 120; for (c,c)=(2,1) they are ±α1,±α2,±(α1+α2),±(2α1+α2) with α22=2α12 and angle 135; and for (c,c)=(3,1) they are the six positive roots listed in K with α22=3α12 and angle 150. The two middle cases are isomorphic as root systems: the linear map that rotates the plane by 45 and then rescales uniformly sends the four short root directions and the four long root directions of the (2,1) system onto those of the (1,2) system, and Cartan integers are unchanged by a uniform rescaling. Combining with steps 2.1, 3.1, 1.4 and 6.1 gives the full rank-two classification, and the angle statement of (iv) is step 3.1.

step 2.1step 3.1step 1.4step 6.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Positive systems and simple roots

Definition

Let ΦE be a reduced crystallographic root system (Reduced crystallographic Euclidean root system). A vector vE is regular (for Φ) if (v,α)0 for every αΦ; such vectors exist because Φ is finite, the finitely many hyperplanes α are proper subspaces of the finite-dimensional real vector space E, and E is not the union of finitely many proper subspaces (A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces).

Fix a regular vE. A root αΦ is positive (with respect to v) if (v,α)>0, and negative if (v,α)<0. Write Φ+={αΦ:(v,α)>0},Φ={αΦ:(v,α)<0}, so that Φ=Φ+Φ and Φ=Φ+; every root is positive or negative, since v is regular. A positive root αΦ+ is simple if it is not a sum α=β+γ of two positive roots β,γΦ+; we write Δ for the set of simple roots.

The set Δ depends on the choice of the regular vector v; the subsequent theorem proves that Δ is a basis of E and that every root is an integral combination of Δ whose nonzero coefficients all have one sign.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Simple roots form a signed integral basis

Statement

Let ΦE be a reduced crystallographic root system with positive system Φ+ and simple roots ΔΦ+ (Positive systems and simple roots). Then Δ is a basis of E; more precisely:

  1. Δ is linearly independent and spans E, so Δ=dimE;
  2. every positive root is a sum of simple roots with nonnegative integer coefficients, and every negative root is a sum of simple roots with nonpositive integer coefficients.

Consequently every root is a unique integral combination αΔnαα of the simple roots in which the nonzero coefficients all have the same sign, positive for positive roots and negative for negative roots.

Facts & Assumptions

Given: A reduced crystallographic root system ΦE with a regular vector vE, the positive system Φ+={α:(v,α)>0}, and the set Δ of simple roots, a root being simple when it is not a sum of two positive roots.

[L1]

Φ is finite, spans E, 0Φ, sα(Φ)=Φ, all Cartan integers are integral, and RαΦ={±α} (Reduced crystallographic Euclidean root system).

[L2]

Φ+={α:(v,α)>0} and Φ=Φ+ are disjoint and cover Φ; a positive root is simple when it is not a sum of two positive roots (Positive systems and simple roots).

[L3]

If α,β are nonproportional roots with (α,β)>0 then αβΦ (Rank-two root-system classification).

Proof

technique · direct
1.1

Every positive root is a nonnegative integral sum of simple roots: if αΦ+ is not simple, it is a sum α=β+γ of two positive roots, and (v,β),(v,γ) are positive and add up to (v,α); iterating this decomposition and always choosing a summand that is not simple cannot continue forever, since the finitely many values (v,δ), δΦ+, strictly decrease along each branch, so the process terminates and exhibits α as a sum of simple roots.

L1L2algebra
1.2

Distinct simple roots α,β satisfy (α,β)0. Indeed, if (α,β)>0 then αβΦ by [L3]; this root is positive or negative, and if it is positive then α=(αβ)+β is a nontrivial sum of two positive roots, while if it is negative then β=(βα)+α is a nontrivial sum of two positive roots, contradicting the simplicity of α or of β.

L2L3algebra
2.1

The simple roots are linearly independent. Suppose iIciαi=jJcjαj with disjoint nonempty index sets and all ci,cj>0; this is the shape of every nontrivial real linear relation, after moving negative coefficients to the other side. The common vector γ=iIciαi is nonzero, so (γ,γ)>0; on the other hand, expanding one side against the other gives (γ,γ)=iI,jJcicj(αi,αj)0, because IJ= and distinct simple roots have nonpositive inner product by step 1.2. This contradiction shows all coefficients vanish, so Δ is linearly independent.

L1step 1.2algebra
3.1

The simple roots span E: every root is a simple-root combination by step 1.1 or its negative, and Φ spans E. Together with step 2.1 the set Δ is a basis of E, and with step 1.1 every root is an integral combination whose coefficients all have the sign of the root. Uniqueness of the coefficients is basis uniqueness, and no choice-theoretic input is used.

L1step 1.1step 2.1algebra
PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Distinct simple roots have nonpositive inner product

Statement

Let ΦE be a reduced crystallographic root system with positive system Φ+ and simple roots Δ (Positive systems and simple roots). If α,βΔ are distinct, then (α,β)0; moreover αβ is not a root.

Facts & Assumptions

Given: Distinct simple roots α,βΔ of a reduced crystallographic root system Φ with positive system Φ+.

[L1]

A simple root is a positive root that is not a sum of two positive roots; Φ+ and Φ=Φ+ partition Φ (Positive systems and simple roots).

[L2]

If γ,δΦ are nonproportional with (γ,δ)>0 then γδΦ (Rank-two root-system classification).

Proof

technique · direct
1.1

Assume (α,β)>0. Then αβΦ by [L2], and since Φ is the disjoint union of its positive and negative roots, αβ is either positive or negative.

L1L2algebra
2.1

The two alternatives of step 1.1 are impossible: if αβ is positive, then α=(αβ)+β exhibits the simple root α as a sum of two positive roots; if αβ is negative, then β=(βα)+α exhibits the simple root β as a sum of two positive roots.

L1step 1.1algebra
3.1

Hence (α,β)0. If αβ were a root, the same dichotomy would apply verbatim and contradict simplicity, so αβΦ.

L1step 1.1step 2.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Height and highest root

Definition

Let ΦE be a reduced crystallographic root system with a chosen positive system Φ+ and base Δ={α1,,αr} of simple roots (Positive systems and simple roots). By Simple roots form a signed integral basis every root is a unique integral combination of Δ whose nonzero coefficients all have one sign.

For β=i=1rniαiΦ the height of β is ht(β)=i=1rni. This is well defined because the simple roots form a basis, and simple roots are exactly the roots of height one. The root order on Φ is defined by βγγβ=i=1rmiαiwith miZ0. It restricts to a partial order on the positive roots, in which every comparison chain is finite because heights strictly increase. A positive root θΦ+ is a highest root if it is maximal for this order, that is, if θγ for no positive root γθ. The existence and uniqueness of a highest root for an irreducible system are proved in Existence and uniqueness of the highest root.

PropositionStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Existence and uniqueness of the highest root

Statement

Let ΦE be a nonempty irreducible reduced crystallographic finite root system with a chosen positive system and base Δ (Positive systems and simple roots). Then Φ has a unique highest root θ relative to this base (Height and highest root): a positive root θ such that θγ for no positive root γθ. Moreover θ is dominant: (θ,γ)0 for every positive root γ.

Facts & Assumptions

Given: A nonempty irreducible reduced crystallographic root system ΦE with positive system Φ+, base Δ={α1,,αr}, height function and root order.

[L1]

Φ is finite and spans E; 0Φ; the Cartan integers are integral, reflections preserve Φ, and the only proportional roots on a root line are a root and its negative (Reduced crystallographic Euclidean root system).

[L2]

Δ is a basis of E, every root is a unique integral combination of Δ whose nonzero coefficients have one sign, positive roots have nonnegative coefficients, and βγ means γβ is a nonnegative integral combination of simple roots (Simple roots form a signed integral basis, Height and highest root).

[L3]

If γ,δΦ are nonproportional and (γ,δ)<0 then γ+δΦ; if (γ,δ)>0 then γδΦ (Rank-two root-system classification).

[L4]

Distinct simple roots satisfy (α,β)0 (Distinct simple roots have nonpositive inner product).

[L5]

An irreducible root system admits no decomposition into two orthogonal nonempty parts spanning nonzero orthogonal subspaces that span E; the decomposition into nonempty pairwise orthogonal irreducible root systems is unique (Reducible and irreducible root systems, Unique irreducible decomposition).

Proof

technique · direct
1.1

The set Φ+ is finite and nonempty: since Φ is nonempty, choose a root and its negative, exactly one of which is positive. Hence the root order is a partial order, and a comparison chain of positive roots is finite because heights strictly increase along it; hence Φ+ has a maximal element θ, i.e. a positive root such that θγ for no positive root γθ.

L1L2algebra
1.2

Let W0 be the subgroup of the orthogonal group generated by the simple reflections; every root is in its orbit of a simple root. The generators are sα for αΔ. Let γ=iniαi, ni0, be a positive root that is not simple. Then 0<(γ,γ)=ini(γ,αi) produces an index i with (γ,αi)>0; put k=2(γ,αi)(αi,αi)>0, so that the reflected root sαi(γ)=γkαi lies in Φ by [L1]. Its simple-root coordinates are those of γ except the i-th, which is nik. If nik<0, the one-sign assertion of [L2] forces every other coordinate, which is unchanged and nonnegative, to vanish. Thus sαi(γ) is a negative multiple of αi, hence equal to αi by the reducedness clause of [L1]; applying sαi again would then give sαi(αi)=αi=γ, contrary to the choice of γ. Therefore sαi(γ) is a positive root, of height ht(γ)k<ht(γ). Iterating this strict descent, which stays at height 1 while the root is positive, must end at a simple root, since the argument would strictly lower the height of any nonsimple positive root; a simple root has height 1. Hence γ=w(δ) for a simple root δ and a product w of simple reflections. Negative roots are negatives of positive ones, and δ=sδ(δ).

L1L2algebra
2.1

The maximal root θ is dominant: (θ,αi)0 for every simple root αi. Indeed, if (θ,αi)<0, then the positive roots θ,αi cannot be proportional: reducedness would force equality, giving a positive pairing. Thus θ+αiΦ by [L3] applied to the nonproportional pair (αi,θ); this root is positive (a sum of positive roots) and θ+αi>θ because the difference is the simple root αi, contradicting maximality of θ.

L2L3step 1.1algebra
2.2

The Dynkin diagram of Φ, with vertices Δ and an edge between αi,αj when (αi,αj)0, is connected. Otherwise Δ=ST with (αi,αj)=0 for all iS, jT; then each sαi, iS, fixes every αj, jT, and vice versa, so the subgroup generated by the two families is their commuting product WSWT and W0Δ=(WSS)(WTT) by step 1.2; the spans of WSSspanS and WTTspanT are nonzero, orthogonal, and span E, so Φ would be reducible, contradicting [L5].

L5step 1.2algebra
3.1

The support of θ is all of Δ: write θ=iniαi with ni0. If ni=0 for some i, then by step 2.1 and [L4] 0(θ,αi)=j:nj>0nj(αj,αi)0, so (αj,αi)=0 for every j with nj>0, that is, no vertex outside the nonempty support of θ is adjacent in the diagram to any vertex of the support; this contradicts the connectedness of step 2.2.

L4step 2.1step 2.2algebra
4.1

At least one simple root pairs strictly positively with θ. Indeed step 3.1 writes θ=iniαi with every ni>0, while step 2.1 gives (θ,αi)0 for every i. Since 0<(θ,θ)=ini(θ,αi), not all these nonnegative pairings can vanish.

step 2.1step 3.1algebra
5.1

Uniqueness: let θ be a second highest root. Steps 2.1 through 3.1 apply equally to θ, so θ=iciαi with every ci>0. Together with steps 2.1 and 4.1 this gives (θ,θ)=ici(θ,αi)>0. If θ and θ were proportional, reducedness and positivity would already force θ=θ. Otherwise [L3] gives θθΦ; this root is positive, in which case θ<θ and θ is not maximal, or negative, in which case θ<θ and θ is not maximal. Both alternatives are impossible, so θ=θ.

L1L2L3step 2.1step 3.1step 4.1algebra
6.1

The dominance statement for all positive roots follows because (θ,γ)=ici(θ,αi)0 whenever γ=iciαi is positive with ci0, using step 2.1. Every positive root lies below a maximal root by finiteness; uniqueness makes that maximal root θ, so θ is also the greatest positive root. In rank one Φ={α,α}, and θ=α. The empty system in E=0 remains irreducible under the library definition but is expressly excluded here; it has no highest root. Dominance need not be strict on every simple root: in A3, θ=ε1ε4 pairs to zero with α2=ε2ε3. This completes the proof.

step 2.1step 5.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Root, coroot, weight, and coweight lattices

Definition

Let ΦE be a reduced crystallographic root system with base Δ={α1,,αr} (Positive systems and simple roots, Simple roots form a signed integral basis) and coroots α=2α/(α,α)E (Coroot and dual root system). The root lattice, coroot lattice, weight lattice, and coweight lattice are Q=αΦZα=i=1rZαi,Q=αΦZα=i=1rZαi, P={λE:(λ,α)Z for all αΦ},P={μE:(α,μ)Z for all αΦ}. All four sets are additive subgroups of E, since the integrality conditions are preserved by addition and negation; they are free abelian groups of rank r, for Q and Q because the simple roots and the simple coroots are bases of E, and for P and P because the simple coroots are again a basis so the dual lattice is generated by the dual basis. The chain QP,QP holds because the Cartan integers α,β=2(α,β)/(β,β) are integers for all roots (Reduced crystallographic Euclidean root system).

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Fundamental weights

Definition

Let ΦE be a reduced crystallographic root system with simple roots Δ={α1,,αr} (Positive systems and simple roots) and lattices Q,Q,P,P (Root, coroot, weight, and coweight lattices). The fundamental weights ω1,,ωr are the vectors of E dual to the simple coroots: (ωi,αj)=δij(1i,jr). They are well defined and unique because the αj form a basis of E, the inner product is nondegenerate, and the linear functionals αjδij extend uniquely. The fundamental weights form a basis of P, called the fundamental weight basis: indeed (ωi,αj)=δij shows ωiP, and for λP the coefficients ci=(λ,αi)Z in λ=iciωi are integers, so P=iZωi. Symmetrically, the fundamental coweights ωi, dual to the simple roots, form a basis of P.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Open and closed Weyl chambers

Definition

Let ΦE be a reduced crystallographic root system (Reduced crystallographic Euclidean root system). For a root α the root hyperplane is Lα={xE:(x,α)=0}. The complement EαΦLα is a finite union of open convex cones, and its connected components are the open Weyl chambers of Φ. Each chamber is open and convex. A root hyperplane Lα is a wall of a chamber D when DLα contains a nonempty relatively open subset of Lα—equivalently, when it is the supporting hyperplane of a codimension-one face of D. In rank at least two, merely meeting the boundary at the common vertex 0 does not make a root hyperplane a wall. Every chamber is the set of solutions of a system of strict homogeneous linear inequalities ±(x,α)>0.

Fix a positive system Φ+ with simple roots Δ={α1,,αr} (Positive systems and simple roots). The fundamental chamber is C={xE:(x,αi)>0 for i=1,,r}, and its closure C is defined by the same inequalities with in place of >. The set C is a chamber because it is a nonempty open convex cone on which no root vanishes: a positive root is a nonnegative integral combination of the αi (Simple roots form a signed integral basis), so (x,α)>0 for xC and every positive root α. The Weyl group W(Φ) (Weyl group) permutes the root hyperplanes and therefore permutes the open chambers; each wW(Φ) sends the closure of a chamber to the closure of its image chamber.

TheoremStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Simple transitivity on Weyl chambers

Statement

Let ΦE be a reduced crystallographic root system and let W=W(Φ) be its Weyl group (Weyl group). Then W acts simply transitively on the set of open Weyl chambers of Φ (Open and closed Weyl chambers): for any two open chambers C,C there is exactly one wW with w(C)=C.

Facts & Assumptions

Given: A reduced crystallographic root system ΦE, a positive system with base Δ={α1,,αr}, and its fundamental open chamber C+.

[F1]

Root reflections preserve Φ, are orthogonal involutions, and generate the finite group W (Weyl group, The Weyl group is finite and faithful, Reduced crystallographic Euclidean root system).

[F2]

The simple roots form a basis; every root has integral coordinates all of one sign in that basis, and the positive roots have nonnegative coordinates (Simple roots form a signed integral basis, Positive systems and simple roots).

[F3]

Chambers are the nonempty regions of constant signs of all root pairings. They are connected components of the root-hyperplane complement. The fundamental chamber is C+={x:(x,αi)>0 for all i}; every positive root pairs positively there. The Weyl group permutes chambers (Open and closed Weyl chambers).

Proof

technique · simple-root descent, finite-orbit maximization and deletion in a shortest word
1.1

Write si=sαi. If β is a positive root other than αi, reducedness and [F2] imply that some coefficient of β at an αj with ji is positive. Reflection si changes only the αi coefficient; hence siβ, which is a root, still has a positive coefficient and so has all coefficients nonnegative by [F2]. Thus si permutes Φ+{αi} and sends αi to αi. Consequently C+ and siC+ have opposite signs only on the root hyperplane Lαi, using (six,β)=(x,siβ).

F1F2F3algebra
1.2

Choose aC+. For any regular x (a point in a chamber), the finite orbit Wx has a point y maximizing (y,a). If (y,αi)<0, then (siy,a)(y,a)=2(y,αi)(αi,a)(αi,αi)>0, contradicting maximality. Regularity excludes zero pairings, so all (y,αi)>0 and yC+. Since W permutes chambers and y=wx, the element w sends the chamber of x onto C+. Thus the action on chambers is transitive. This chooses one maximum in a finite set, not a choice function on an arbitrary family.

F1F3algebra
2.1

Every positive root is carried to a simple root by a product of simple reflections. Indeed, if β=jbjαj is positive and nonsimple, then 0<(β,β)=jbj(β,αj) gives an i with (β,αi)>0. By step 1.1 the root siβ is positive, and its height (the sum of its nonnegative integer coefficients) is strictly smaller: the decrease is the positive integer 2(β,αi)/(αi,αi). Repetition terminates because height is a positive integer, and a terminal root must be simple. Negative roots have the same reflections as their positives. Orthogonality gives suβ=usβu1 by the reflection formula, so every root reflection is a conjugate, by a word in simple reflections, of a simple reflection. Hence simple reflections generate W.

F1F2step 1.1algebra
3.1

Let w=si1sim be an expression with the smallest possible number of simple factors, which exists by step 2.1 and the well-ordering of the nonnegative integers. Put u0=1, uk=si1sik, Ck=ukC+, and Hk=uk1Lαik. Step 1.1 shows that Ck1 and Ck have opposite signs only across Hk. No two Hk can coincide. To prove this, if Hp=Hq for p<q, their orthogonal reflections are equal. Write s=sip, t=siq, and B=sip+1siq1 (the identity if q=p+1). Conjugating the equality up1sup11=uq1tuq11 by up11 gives s=sBtB1s. Multiplying gives sBt=B. Thus the two factors at positions p,q can be deleted without changing w, contradicting minimality.

F1step 1.1step 2.1algebra
4.1

If wC+=C+ and m>0, then the sign across H1 changes at the first transition of the chain in step 3.1 and must change back before its last chamber, since the endpoints coincide. Each transition changes exactly the sign of its own Hk, so Hk=H1 for some k>1, contrary to step 3.1. Therefore m=0 and w=1. This proves triviality of the stabilizer of C+, without identifying a word from its chamber image.

F3step 3.1algebra
5.1

Transitivity makes every chamber stabilizer conjugate to the trivial stabilizer of C+. Hence if wC=vC=C, then v1w stabilizes C, giving w=v; existence follows from step 1.2. If Φ=, the spanning axiom gives E=0, W={1} and the sole chamber is {0}, so the conclusion also holds. In rank one the two half-lines are interchanged by the single reflection, consistently with the argument.

F1F3step 1.2step 4.1algebra
PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Positive systems, bases, and chambers

Statement

Let ΦE be a reduced crystallographic root system. The assignment to an open Weyl chamber C of the set of roots positive on C and the assignment to a positive system Φ+ of the chamber {x:(x,α)>0 for all αΦ+} are mutually inverse bijections between the open chambers and the positive systems of Φ. Consequently positive systems, bases, and chambers are in bijection, and the Weyl group W(Φ) acts simply transitively on each of these three sets.

Facts & Assumptions

Given: A reduced crystallographic root system Φ with Weyl group W, its open chambers, and its positive systems.

[L1]

A chamber is a connected component of the complement of the finitely many root hyperplanes Lα; it is an open convex cone, and for a root α the sign of (x,α) is constant on C (Open and closed Weyl chambers).

[L2]

A positive system is a set Φ+={αΦ:(v,α)>0} defined by a regular vector v, its simple roots are the indecomposable elements, and they form a basis whose nonnegative integral combinations give exactly the positive roots (Positive systems and simple roots, Simple roots form a signed integral basis).

[L3]

W acts simply transitively on the open chambers (Simple transitivity on Weyl chambers).

Proof

technique · direct
1.1

Each chamber C determines a positive system: by [L1] the sign of (x,α) is constant on C, so the set Φ+(C)={α:(x,α)>0 for xC} is well defined independently of the chosen xC; it contains exactly one of ±α, hence arises from any xC viewed as a regular vector via the inner product, and is a positive system in the sense of [L2].

L1L2algebra
1.2

Conversely each positive system Φ+ determines a chamber C(Φ+)={x:(x,α)>0 for all αΦ+}: it is nonempty because it contains the regular vector defining Φ+; it is an open convex cone defined by finitely many strict linear inequalities, hence is contained in a single chamber; and it equals that chamber because no root changes sign strictly inside it and every boundary point lies in some root hyperplane.

L1L2algebra
1.3

Positive systems correspond bijectively to their simple-root bases: a base Δ determines the positive system {βΦ:β=αΔnαα with all nαZ0}, and the positive system determines the base as its indecomposable elements, by [L2]; these are inverse constructions.

L2algebra
2.1

The two assignments are inverse: Φ+(C(Φ+))=Φ+ because the roots positive on C(Φ+) are exactly those in Φ+, one sign being constant on the cone; and C(Φ+(C))=C because both are open convex sets defined by the same sign conditions and the sign pattern determines the chamber.

step 1.1step 1.2algebra
3.1

The Weyl group acts on chambers, hence by steps 1.1 and 2.1 on positive systems and bases, and the action is simply transitive by [L3]. Explicitly, wΦ+(C)=Φ+(wC) and a chamber has a unique Weyl image, so each positive system and base has exactly one Weyl translate, giving simple transitivity on all three sets.

L3step 1.1step 1.3algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Length and longest Weyl-group element

Definition

Let ΦE be a reduced crystallographic root system with positive system Φ+ and simple roots Δ (Positive systems and simple roots), and let W=W(Φ) be its Weyl group (Weyl group). For wW define the inversion set N(w)={αΦ+:w(α)Φ} and the length (w)=N(w), the number of positive roots sent by w to negative roots.

A longest element of W is an element w0W with (w0)(w) for all wW. The next proposition identifies (w) with the minimum length of an expression of w as a product of simple reflections sαi, and proves that a longest element exists, is unique, and is characterized by w0(Φ+)=Φ; its length is Φ+. The length depends on the chosen positive system, hence on the chamber; replacing Φ+ by Φ+ replaces the length function by ()1 with respect to the new positive system.

PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Weyl length equals inversion number

Statement

Let ΦE be a reduced crystallographic root system with positive system Φ+, simple roots Δ={α1,,αr} and Weyl group W, with inversion sets N(w) and lengths (w)=N(w) (Length and longest Weyl-group element). Then:

  1. for every wW, the length (w) equals the minimum number of simple reflections occurring in an expression of w as a product of simple reflections;
  2. there is a unique longest element w0W; it satisfies w0(Φ+)=Φ and (w0)=Φ+.

Facts & Assumptions

Given: A reduced crystallographic root system Φ with positive system Φ+, simple roots Δ, simple reflections si=sαi, Weyl group W, inversion sets and lengths.

[L2]

The chambers are the connected components of the complement of the root hyperplanes; W acts simply transitively on them; each chamber has exactly r walls, and the walls of C+ are the hyperplanes Lαi (Open and closed Weyl chambers, Simple transitivity on Weyl chambers).

[L3]

A positive-root hyperplane Lα separates C+ from w(C+) exactly when w1αΦ, so the number of separating hyperplanes is N(w1)=N(w)=(w); here αwα is a bijection from N(w) to N(w1). The negative chamber is C=C+={x:(x,α)<0 αΦ+} (Length and longest Weyl-group element, Open and closed Weyl chambers).

[L4]

Every positive root is a nonnegative integral combination of the simple roots, and every root is ± such a combination (Simple roots form a signed integral basis).

Proof

technique · direct
1.1

A generic segment from a point of C+ to a point of w(C+) meets exactly the hyperplanes separating the two chambers, each once, and produces a chain C+=C0,,Cm=w(C+). Inductively, if Ck1=uk1(C+), the crossed wall is uk1(Lαik) for some simple root αik, and the adjacent chamber is Ck=uk1sik(C+). Thus Cm=um(C+) for um=si1sim; simple transitivity and Cm=w(C+) give um=w, while [L3] gives m=(w). Conversely, given any expression w=si1sil, the chain Ck=si1sik(C+) crosses one wall at each step, so at most l hyperplanes separate its endpoints and (w)l. Hence (w) is the minimum number of simple reflections in an expression of w.

L2L3algebra
1.2

The simple transitivity of W on chambers applied to the pair (C+,C) gives a unique element w0W with w0(C+)=C.

L2algebra
2.1

For every positive root α, w0(α) is negative: if xC+ then w0xC and (w0x,w0α)=(x,α)>0; a root β satisfying (y,β)>0 for all yC=C+ is negative, because writing y=x with xC+ gives (x,β)=(y,β)>0 and hence βΦ+ by [L4] and the definition of C+. Hence w0(Φ+)Φ; since w0 is a bijection of the finite set Φ and Φ+=Φ, equality holds, N(w0)=Φ+, and (w0)=Φ+.

L3L4step 1.2algebra
3.1

Every wW satisfies N(w)Φ+, hence (w)Φ+=(w0); so w0 is a longest element. If w is also longest then (w)=Φ+ forces N(w)=Φ+, that is w(Φ+)=Φ; then for every xC+ and every positive root α one has (wx,α)=(x,w1α)<0, because w1αΦ and xC+ has negative inner product with every negative root; hence wxC, that is w(C+)=C; simple transitivity of W on chambers then gives w=w0, so the longest element is unique.

L2L3step 2.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-22Open item page →

Cartan matrix of a based root system

Definition

Let ΦE be a reduced crystallographic root system with base Δ={α1,,αr} (Positive systems and simple roots) and coroots αi=2αi/(αi,αi) (Coroot and dual root system). The Cartan matrix of Φ relative to Δ is the r×r matrix A=(aij) with rows indexed by coroots, aij=(αj,αi)=2(αj,αi)(αi,αi). Thus aij is the Cartan integer of the ordered pair (αj,αi), that is, the coefficient of αi subtracted from αj in the reflection sαi(αj)=αjaijαi; it is not in general an eigenvalue of αj. All entries are integers by the root-system axioms, aii=2 for every i, and aij0 for ij (Distinct simple roots have nonpositive inner product). The Cartan matrix depends on the numbering of the simple roots: renumbering conjugates it by the corresponding permutation matrix. The indexing convention here is the row-coroot convention: the entries of row i record the action of the coroot αi on the other simple roots.

PropositionStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Properties of finite-type Cartan matrices

Statement

Let A=(aij) be the Cartan matrix of a reduced crystallographic root system Φ relative to a base (Cartan matrix of a based root system). Then:

  1. aii=2 for all i, and aij is a nonpositive integer for ij;
  2. aij=0 if and only if aji=0;
  3. aijaji{0,1,2,3} for ij;
  4. there is a diagonal matrix D with positive diagonal entries such that DAD1 is symmetric and positive definite.

Facts & Assumptions

Given: A reduced crystallographic root system Φ with base Δ={α1,,αr}, base entries aij=2(αj,αi)/(αi,αi), and the inner product (,) on E.

[L1]

aii=2 and aij=2(αj,αi)/(αi,αi) is an integer (Cartan matrix of a based root system, Reduced crystallographic Euclidean root system).

[L2]

For distinct simple roots, (αi,αj)0 (Distinct simple roots have nonpositive inner product).

[L3]

For nonproportional roots α,β the product of Cartan integers is 4cos2θ{0,1,2,3} and the angle is 90, 60/120, 45/135 or 30/150 (Rank-two root-system classification).

[L4]

The simple roots form a basis of E, so their Gram matrix G=((αi,αj)) is symmetric and positive definite, and any symmetric matrix representing the inner product in a basis is positive definite (Simple roots form a signed integral basis).

Proof

technique · direct
1.1

aii=2(αi,αi)/(αi,αi)=2 and aijZ; for ij one has aij0 because (αi,αj)0 by [L2] and (αi,αi)>0.

L1L2algebra
1.2

aij=0 if and only if aji=0: both entries are nonzero exactly when (αi,αj)0, since the denominators (αi,αi),(αj,αj) are positive.

L1algebra
1.3

For ij, the simple roots αi,αj are nonproportional, so aijaji=4cos2θ{0,1,2,3} by [L3], giving the third assertion.

L3algebra
1.4

Let D=diag(α1,,αr); then DAD1 has entries αiaijαj1=2(αj,αi)/(αiαj), which is symmetric in i,j because the inner product is symmetric.

L1algebra
2.1

The matrix in step 1.4 is positive definite: it is twice the Gram matrix ((αi/αi,αj/αj)) of the normalized simple roots, and those vectors are a basis of E, so their Gram matrix is positive definite by [L4]. Discarding the factor 2 preserves positive definiteness.

L4step 1.4algebra
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-22Open item page →

Dynkin diagram with edge multiplicity and arrow convention

Definition

Let ΦE be a reduced crystallographic root system with base Δ={α1,,αr} and Cartan matrix A=(aij) (Properties of finite-type Cartan matrices). The Dynkin diagram of Φ relative to Δ is the graph with vertex set {1,,r}, with aijaji edges joining the vertices i and j for ij, and with a decoration of the edges when aijaji0: if aijaji=1 no decoration is used; if aijaji=2 the two parallel edges carry a single arrow pointing from the longer root to the shorter root, that is, toward the vertex j with αj<αi; if aijaji=3 the three parallel edges carry the same arrow toward the shorter root. The numbers aijaji{0,1,2,3} are determined by the Cartan matrix and the arrow direction is determined by which of aij,aji is larger in absolute value, since αi2/αj2=aji/aij whenever aijaji0 (Rank-two root-system classification); hence the diagram, with its multiplicities and arrows, is determined by A. Isolated vertices, that is, simple roots orthogonal to all others, are allowed and correspond to one-dimensional direct summands.

Conversely the Cartan matrix is recovered from the diagram: a pair with no edge has aij=aji=0; a pair joined by m=aijaji edges has aij,aji<0 with product m, and the arrow, which records which of aij,aji is larger, fixes aij and aji uniquely.

TheoremStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

The Cartan matrix determines a based root system

Statement

Let ΦE and ΦE be reduced crystallographic root systems with bases Δ={α1,,αr} and Δ={α1,,αr} and Cartan matrices A=(aij) and A=(aij) (Cartan matrix of a based root system). If A=A then the linear map φ:EE with φ(αi)=αi for all i is an isomorphism of root systems; in particular φ(Φ)=Φ.

Facts & Assumptions

Given: Based reduced crystallographic root systems (Φ,Δ) and (Φ,Δ) with the same Cartan matrix A=A, and the linear map φ sending αi to αi.

[L1]

Δ and Δ are bases of E and E, and every root is a unique integral combination of its base with coefficients of one sign (Simple roots form a signed integral basis, Positive systems and simple roots).

[L2]

sαi(αj)=αjaijαi, and the same formula with primes holds in Φ because A=A (Cartan matrix of a based root system).

[L3]

The Gram matrix G=((αi,αj)) of the simple roots satisfies aij=2Gij/Gii, and G is positive definite; the numbers aij determine G up to one positive scalar on each connected component of the graph with edges aij0 (Properties of finite-type Cartan matrices).

Proof

technique · direct
1.1

Every root of Φ is Weyl-conjugate to a simple root. Indeed, let γ=iniαi be positive and not simple. Since 0<(γ,γ)=ini(γ,αi), some i satisfies (γ,αi)>0. Put m=2(γ,αi)/(αi,αi)>0. Crystallographic integrality gives mZ, and reflection invariance gives sαi(γ)=γmαiΦ. Its height is ht(γ)m<ht(γ). It cannot be negative: if it were, then all its simple-root coefficients would be nonpositive by [L1], whereas its coefficient at every ji is nj0; hence all nj for ji would vanish, making γ a positive scalar multiple of αi, and reducedness would force γ=αi, contrary to assumption. Thus successive simple reflections strictly lower positive height until a simple root is reached. Inverting those reflections proves the claim.

L1algebra
1.2

With the row index first and column index second, the matrix of sαi in the basis Δ has entries (sαi)jk=δjkaikδji by [L2]; it is therefore determined by A, and the corresponding matrix for sαi in the basis Δ is the same. Hence φsαiφ1=sαi for all i, because both sides are linear and agree on the basis Δ: φsαiφ1(αj)=φ(αjaijαi)=αjaijαi=sαi(αj).

L2algebra
2.1

Consequently φ carries the Weyl orbit of Δ onto the Weyl orbit of Δ, and by step 1.1 (applied to Φ and to Φ) it carries Φ onto Φ; in particular φ is a linear isomorphism, since it maps the basis Δ onto the basis Δ.

step 1.1step 1.2algebra
3.1

It remains to check that φ preserves Cartan integers. By [L3] the Gram matrices G and G satisfy aij=2Gij/Gii=2Gij/Gii and are positive definite; for indices i,j joined by an edge one has aij,aji<0 and aijGii=2Gij=2Gji=ajiGjj, so Gii/Gii=Gjj/Gjj; by connectivity along edges the ratios Gii/Gii are constant on each connected component of the graph on Δ with edges aij0. Define a second inner product on E by (x,y)1=(φx,φy)E. Its Gram matrix in the basis Δ is G, which differs from G by a positive scalar on each connected component; therefore for roots γ,δ of Φ the Cartan integers computed with (,) and with (,)1 agree, because scaling an inner product on a component by λ>0 multiplies both (γ,δ) and (δ,δ) by λ when γ,δ lie in that component and gives 0 otherwise. Since φ(Φ)=Φ by step 2.1, φ is an isomorphism of root systems.

step 2.1L3algebra
PropositionStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Irreducibility and connected Dynkin diagrams

Statement

Let ΦE be a reduced crystallographic root system with base Δ and Dynkin diagram Γ (Dynkin diagram with edge multiplicity and arrow convention). Then Φ is irreducible (Reducible and irreducible root systems) if and only if Γ is empty or connected. In particular, for a nonempty root system irreducibility is equivalent to connectedness of the diagram. The empty alternative follows the local convention that the rank-zero root system is irreducible.

Facts & Assumptions

Given: A reduced crystallographic root system Φ with base Δ={α1,,αr} and its Dynkin diagram Γ, whose vertex set is Δ and in which αi,αj are joined exactly when (αi,αj)0.

[L1]

Φ is the disjoint union of irreducible root systems spanning pairwise orthogonal nonzero subspaces, and this decomposition is unique up to order for its nonempty components (Unique irreducible decomposition, Reducible and irreducible root systems).

[L2]

The simple roots form a basis of E; every root is an integral combination of simple roots with all nonzero coefficients of one sign (Simple roots form a signed integral basis).

[L3]

The Cartan matrix entry aij vanishes exactly when (αi,αj)=0 (Cartan matrix of a based root system).

[L4]

A positive root is simple exactly when it is not a sum of two positive roots; every root reflection preserves Φ (Positive systems and simple roots, Reduced crystallographic Euclidean root system).

Proof

technique · direct
1.1

Suppose first that Φ. If Γ is disconnected, partition its vertices as Δ=ST into two nonempty unions of connected components. Then (S,T)=0 by [L3], and U=spanS, W=spanT are nonzero orthogonal subspaces with E=UW by [L2]. Every root has support in just one side. Otherwise, after replacing a root by its negative if necessary, choose a positive root β of least height whose support meets both S and T. It is not simple, so [L4] writes β=γ+δ for positive roots γ,δ. Minimality makes each summand supported on one side, and because β is mixed they lie on opposite sides; hence (γ,δ)=0. Reflection in γ then gives sγ(β)=β2(β,γ)(γ,γ)γ=δγΦ, but δγ has nonzero simple-root coefficients of both signs, contradicting [L2]. Thus Φ=(ΦU)(ΦW) is an orthogonal splitting with both parts nonempty, and Φ is reducible.

L2L3L4algebra
1.2

If Φ is reducible, write Φ=Φ1Φ2 as an orthogonal union of nonempty subsystems spanning orthogonal nonzero subspaces by [L1]. Put Δi=ΔΦi. Every simple root belongs to exactly one Φi, so Δ=Δ1Δ2. Each Δi is nonempty: choose a positive root βΦi and expand it in the basis Δ using [L2]; orthogonal projection to the other component, together with linear independence of the simple roots there, forces all coefficients from Δ3i to vanish, while β0 leaves a coefficient from Δi. Since (Φ1,Φ2)=0, no edge of Γ joins Δ1 to Δ2, and Γ is disconnected.

L1L2L3algebra
2.1

For Φ, steps 1.1 and 1.2 prove the two implications by contraposition, so irreducibility is equivalent to connectedness of Γ. For Φ=, the spanning axiom gives E=0 and the base and diagram are empty; the zero space has no splitting into two nonzero subspaces, so this root system is irreducible by [L1]. Conversely an empty diagram gives E=0 by [L2], hence Φ=. Thus in all ranks irreducibility is equivalent to the diagram being empty or connected.

L1L2step 1.1step 1.2algebra
LemmaStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Shape restrictions on Dynkin diagrams

Statement

Let Φ be an irreducible reduced crystallographic root system with connected Dynkin diagram Γ (Dynkin diagram with edge multiplicity and arrow convention). Then:

  1. the underlying unoriented simple graph of Γ is a tree;
  2. no vertex is adjacent to more than three other vertices;
  3. at most one vertex is adjacent to three other vertices;
  4. in the simply-laced case (all edges simple) with exactly one trivalent vertex, if p1,q1,r1 are the numbers of edges in the three arms and 2pqr, then 1/p+1/q+1/r>1;
  5. if Γ has a multiple edge, its underlying graph is a path; positivity permits only a double edge at an end of the path, a double edge in the middle of a four-vertex path, or a two-vertex triple edge.

Facts & Assumptions

Given: A finite-type Cartan matrix A=(aij) of an irreducible based root system as in the statement, with aii=2, aij0, aij=0aji=0, aijaji{0,1,2,3} for ij, and a diagonal matrix D=diag(di), di>0, with P=DAD1=2Q where Q is symmetric positive definite.

[L1]

These are the properties of a finite-type Cartan matrix, and Qii=1, Qij=Qji=12aijaji<0 for adjacent ij, and Qij=0 otherwise (Properties of finite-type Cartan matrices).

[L2]

For every nonzero real vector x of finite support one has xTQx>0; equivalently ixi2>ijaijajixixj, where the sum runs over unordered adjacent pairs. In particular ixi2>ijxixj for x0, because aijaji1 for adjacent pairs. (Properties of finite-type Cartan matrices)

[L3]

The diagram is connected, with vertex set Δ, and ij are adjacent exactly when aij0 (Irreducibility and connected Dynkin diagrams, Dynkin diagram with edge multiplicity and arrow convention).

[L4]

A finite connected graph is a tree exactly when it has no cycle, and then it has V1 edges and a unique path between any two vertices; in a simply-laced diagram the inner product of adjacent simple roots is 12α2 when both roots have the same length (Equivalent characterisations of a nonempty tree by unique paths, edge count, minimal connectivity and maximal acyclicity, Rank-two root-system classification).

Proof

technique · direct
1.1

The graph has no cycle: if i1,,im with m3 formed a cycle, set xik=1 and xj=0 otherwise; then jxj2=m and the adjacency sum equals m, since each of the m cycle edges contributes 1, so x2ijxixj, contradicting [L2] (a multiple edge in the cycle only increases the right side). Since the graph is connected by [L3], it is a tree by [L4].

L2L3L4algebra
1.2

No vertex has four neighbours: if v had distinct neighbours n1,,n4, set xv=2, xnk=1 and xj=0 otherwise; then x2=4+4=8 and the four edges at v contribute at least 4(21)=8, so x2ijxixj, contradicting [L2].

L2algebra
1.3

(Simply-laced trivalent case.) Suppose all edges are simple and δ is the unique trivalent vertex, its arms having p1,q1,r1 edges with p,q,r2; all simple roots then have a common squared length d2 by [L4], and adjacent simple roots have inner product 12d2. Let α=i=1p1iαi, where α1,,αp1 are the roots of the first arm ordered from its free end toward δ, and define β,γ similarly for the other two arms; the three vectors are mutually orthogonal because their supports are disjoint, and direct expansion using the adjacent inner products gives α2=12p(p1)d2, β2=12q(q1)d2, γ2=12r(r1)d2 and (α,δ)=12(p1)d2, with the analogous formulas for β,γ. The set {α,β,γ} is orthogonal, and δ is not in its span (the supports are disjoint from δ), so Bessel's inequality with the nonzero residual component gives δ2>u{α,β,γ}(u,δ)2u2=(p1)d22p+(q1)d22q+(r1)d22r; dividing by d2=δ2 and multiplying by 2 gives 2>3(1p+1q+1r), that is 1p+1q+1r>1.

L1L4algebra
1.4

(Path with a unique double edge.) Suppose the underlying graph is a path with exactly one multiple edge, that edge is double, and its deletion splits the vertices into arms of p and q vertices. Every edge within either arm is then simple, so the roots on an arm have one common length by [L4]. Let α=i=1piαi, β=j=1qjβj with the vertices ordered from the free ends toward the double edge. From the double edge one has aαpβqaβqαp=2, so 2(αp,βq)2=αp2βq2, while the simple-arm expansions give α2=12p(p+1)αp2, β2=12q(q+1)βq2 and (α,β)=pq(αp,βq). Substituting into the strict Schwarz inequality (α,β)2<α2β2 for the nonproportional vectors α,β gives 12p2q2<14p(p+1)q(q+1), hence 2pq<(p+1)(q+1) and (p1)(q1)<2. Therefore either p=1 or q=1, giving a double edge at an end of the path, or p=q=2, giving a four-vertex path with central double edge.

L1L2L4algebra
2.1

At most one vertex is trivalent: if uv both had degree at least three, let v0=u,v1,,vk=v be the unique path between them (existing by step 1.1 and [L4]) and set x=2 at the path vertices and x=1 at every other neighbour of u or v; the numbers eu=deg(u)12 and ev=deg(v)12 of such extra neighbours satisfy x2=4(k+1)+eu+ev and ijxixj4k+2(eu+ev) (the k path edges contribute 4 each, the edges from u,v to the extra neighbours contribute 2 each, and the edge uv, when k=1, contributes 4), so x2=4k+4+eu+ev4k+2(eu+ev)ijxixj because eu+ev4; this contradicts [L2].

L2L4step 1.1algebra
3.1

(Multiple edges and the conclusion.) First exclude two multiple edges. If Γ had two multiple edges, choose such a pair joined by a path with the fewest edges; every internal edge of that path is then simple, by minimality. Label only the vertices of that path and give 0 to every other vertex: every edge of Γ not on the path then has a vertex labelled 0 and contributes nothing to either side, so a violation of [L2] on the labelled sub-path is a violation for Γ. Let the path be y0,,yn, with the multiple edges {y0,y1} and {yn1,yn} and with ay0y1ay1y0,ayn1ynaynyn1{2,3}. If n=2, take xy1=1, xy0=xy2=22 when both factors are 2, and x=1 at all three vertices as soon as one factor is 3. If n3, take xy0=xyn=22, x=1 at the remaining path vertices when both factors are 2, and x=1 at all path vertices as soon as one factor is 3. In the two double-edge cases both sides of [L2] equal n (with n=2 in the first case), and in the mixed and triple cases ixi2=n+1<2+3+n2ijaijajixixj; either way [L2] fails for a nonzero label vector. Hence Γ has at most one multiple edge. If Γ has a multiple edge {u,v} and is not a path, then it has exactly one trivalent vertex w by steps 1.1, 1.2 and 2.1, and the path w=w0,w1,,wk=u to the endpoint u of that edge consists of simple edges. Label xw=1, xb=xc=12 at the two neighbours b,c of w outside that path, xwi=1 for 1ik, xv=t, and x=0 at every other vertex. Then ixi2=k+32+t2 and ijaijajixixj=k+1+mt with m=auvavu{2,3}, so the difference of the two sides is t2mt+12; this vanishes at t=22 for m=2 and equals 14 at t=32 for m=3. Again [L2] fails, so Γ is a path. Finally, a path with a multiple edge has exactly one such edge. If its multiplicity is 3 and the path has a third vertex adjacent to the triple edge, the label vector 32,1,12 on the far endpoint of the triple edge, its other endpoint and that third vertex satisfies ixi2=ijaijajixixj, contradicting [L2]; so a triple edge fills the whole path, which is then the two-vertex system G2. If the multiple edge is double, step 1.4 gives (p1)(q1)<2 for the two arms of p and q vertices, so either one arm is a single vertex (a double edge at an end of the path) or p=q=2 (a four-vertex path with central double edge). This completes the verification of all five assertions.

L1L2step 1.1step 1.2step 1.4step 2.1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Classification of irreducible root systems

Statement

Let Φ be an irreducible reduced crystallographic root system (Reducible and irreducible root systems). If Φ is empty, its ambient space is zero; this is irreducible under the local convention. Otherwise Φ is isomorphic, as a root system, to exactly one of An (n1),Bn (n2),Cn (n3),Dn (n4),E6, E7, E8, F4, G2, with the low-rank identifications B1=C1=A1, B2=C2, D2=A1A1 and D3=A3, where the subscript denotes the number of simple roots. Here An is the type whose Dynkin diagram is a path on n vertices with simple edges, Bn and Cn have path diagrams differing by the direction of the arrow on the double edge, Dn is the simply-laced trivalent diagram with arms of lengths 1,1,n3, and E6,E7,E8,F4,G2 have, respectively, simply-laced trivalent arms (1,2,2), (1,2,3), (1,2,4); a four-vertex path with central double edge; and two vertices joined by a triple edge. Type names here specify these diagram types; their coordinate realizations are constructed in the following existence theorem.

Facts & Assumptions

Given: A nonempty irreducible reduced crystallographic root system Φ with base Δ and Dynkin diagram Γ.

[L1]

Γ is connected, and its underlying simple graph is a tree with at most one trivalent vertex and maximum degree at most three; in the simply-laced trivalent case with arms p1,q1,r1 and 2pqr one has 1/p+1/q+1/r>1; if Γ has a multiple edge its underlying graph is a path, with the double edge at an end, a central double edge on four vertices, or a two-vertex triple edge (Shape restrictions on Dynkin diagrams, Irreducibility and connected Dynkin diagrams).

[L2]

A based root system is determined up to isomorphism by its Cartan matrix, and its Cartan matrix is determined by its Dynkin diagram (The Cartan matrix determines a based root system, Dynkin diagram with edge multiplicity and arrow convention).

[L3]

For a double edge the squared-length ratio (long to short) of the two simple roots is 2, and for a triple edge it is 3; the arrow points to the shorter root (Rank-two root-system classification, Dynkin diagram with edge multiplicity and arrow convention).

[L4]

A root-system isomorphism is linear, carries the root set onto the root set, and preserves every Cartan integer; every root has signed integral coordinates in a base, and the Weyl group acts transitively on the bases of a root system (Rank and isomorphism of root systems, Simple roots form a signed integral basis, Positive systems, bases, and chambers).

[L5]

Roots are nonzero and span the ambient space; root reflections preserve the root set and Cartan integers are integral (Reduced crystallographic Euclidean root system). The local definition allows the empty root system and calls it irreducible (Reducible and irreducible root systems).

Proof

technique · direct
1.1

Suppose first that all edges of Γ are simple and there is no trivalent vertex. Then by [L1] the graph is a path on n1 vertices, and the Cartan matrix is the An matrix aii=2, ai,i+1=ai+1,i=1, aij=0 for ij2; the corresponding root system is An.

L1L2algebra
1.2

If Γ is simply laced with exactly one trivalent vertex, write its arms as p1,q1,r1 edges with 2pqr; by [L1] 1/p+1/q+1/r>1. If p3 then 1/p+1/q+1/r313=1, so p=2; then 1/q+1/r>1/2, so q3: for q=2 every r2 occurs, giving the diagrams Dr+2 with arms 1,1,r1, and for q=3 the condition 1/r>1/6 gives r=3,4,5, the diagrams E6,E7,E8. No other simply-laced trivalent diagrams occur.

L1algebra
1.3

If Γ has a multiple edge, then by [L1] its underlying graph is a path and the possibilities are: a double edge at an end, which gives the two orientation choices Bn and Cn on n2 vertices (the double edge being the end edge of the path); a central double edge on exactly four vertices, which is F4; or a two-vertex triple edge, which is G2.

L1L2L3algebra
1.4

The diagram types are distinguished by rank, edge multiplicities and positions, and, for a simply-laced branch, the unordered arm lengths. At rank n4 the Dn arms (1,1,n3) differ from the exceptional arms, which all have just one arm of length 1. Reversing the path interchanges the two orientations for F4 and for G2, so these introduce no extra types. To check unbased uniqueness it remains to explain why isomorphisms preserve diagram types. In particular Bn and Cn for n3 are non-isomorphic even as unbased root systems. If an isomorphism φ:BnCn existed, the image of a chosen base ΔB would be a base. Indeed it is a basis of roots, every root has integral coefficients of one sign relative to it because this is true relative to ΔB and φ is linear, and a vector pairing positively with every member of φ(ΔB) therefore defines the corresponding positive system, whose indecomposable roots are precisely those basis vectors. By [L4] a Weyl element of Cn carries φ(ΔB) to the standard base ΔC. After ordering the bases, the composite based isomorphism would identify their Cartan matrices up to a simultaneous row-and-column permutation, because it preserves every Cartan integer. But for n3 the Bn and Cn matrices are transposes and no vertex permutation identifies them: the unique double edge fixes its end of the path, while its arrow is reversed. This contradiction proves non-isomorphism. For n=2 the two orientations of the single double edge are interchanged by permuting the two vertices, so [L2] gives B2C2; and for n=1 the unique reduced rank-one system {±α} is simultaneously A1, B1 and C1.

L2L3L4algebra
1.5

For the low-rank D coincidences, use the coordinate set Dn={±ei±ej:i<j} at n=2,3. These are root systems: a reflection in eiej exchanges coordinates i,j, and one in ei+ej exchanges them and negates both, preserving this set. Every root has squared norm 2, pairwise inner products are integers, reducedness is immediate, and the displayed roots span. For D3 put a=e1e2, b=e2e3, c=e2+e3. Its roots are exactly the positives and negatives of a, b, c, a+b, a+c, a+b+c. The vector (2,1,0) pairs positively with all three basis vectors, and this list shows they are exactly the simple positive roots. Their squared lengths are 2, with (a,b)=(a,c)=1 and (b,c)=0, so the diagram is the three-vertex path bac, giving D3A3 by [L2]. In D2, the two root lines generated by e1+e2 and e1e2 are orthogonal, each containing just a pair of opposite roots, giving A1A1. In particular arms (1,1,1) describe D4, not D3.

L2L5algebra
2.1

Combining steps 1.1, 1.2 and 1.3, every irreducible system has one of the listed diagrams, and by [L2] its isomorphism class is determined by the Cartan matrix, hence by that diagram; so the classification list is complete, and steps 1.4–1.5 give the stated low-rank coincidences and uniqueness. Finally, if Φ= then E=0 by [L5], and no decomposition into two nonzero orthogonal spaces exists, so it is the additional irreducible rank-zero case under the local definition. It is not one of the positive-rank types in the display.

step 1.1step 1.2step 1.3step 1.4step 1.5L2L5algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Existence of each classified root system

Statement

Every type of the classification list of Classification of irreducible root systems is realized by a reduced crystallographic Euclidean root system with the indicated Dynkin diagram: for every n1 there are root systems An,Bn (n2),Cn (n3),Dn (n4) in Euclidean space, and there are root systems E6,E7,E8,F4,G2 whose Dynkin diagrams are the diagrams of the classification list.

Facts & Assumptions

Given: The standard Euclidean spaces Rn with their standard inner products, unit coordinate vectors e1,,en, and the classification list with its diagram conventions.

[L1]

A reduced crystallographic root system is a finite spanning set Φ of nonzero vectors with sα(Φ)=Φ, integral Cartan integers 2(β,α)/(α,α), and RαΦ={±α} (Reduced crystallographic Euclidean root system). For a positive system, its simple roots form a basis and every root has integral coordinates of one sign in that basis (Simple roots form a signed integral basis); their Cartan matrix determines the Dynkin diagram (Dynkin diagram with edge multiplicity and arrow convention).

[L2]

Every nonempty irreducible root system has one of the listed diagram types, and each diagram type determines its isomorphism class (Classification of irreducible root systems). In particular, isomorphic root systems have the same number of roots.

[L3]

Reducibility means a partition into two nonempty mutually orthogonal root subsets (Reducible and irreducible root systems). Thus roots joined by a chain of nonzero inner products must belong to the same part of any such partition.

Proof

technique · direct
1.1

(Type An.) In E={xRn+1:ixi=0} put Φ={eiej:ij}; it is finite, nonempty, spans E, and contains no zero vector. For α=eiej the reflection sα sends ei to ej, ej to ei and fixes every other coordinate vector, so it permutes Φ and ΦRα={±α}; the Cartan integers are 2(ekel,eiej)/2{0,±1,±2}. For the regular functional x(x,(n+1,n,,1)), the positive roots are eiej with i<j; each is k=ij1(ekek+1), and only the adjacent differences are indecomposable. Thus the simple roots are eiei+1 for 1in, whose Cartan matrix is An.

L1algebra
1.2

(Types Bn and Cn.) In Rn put ΦB={±ei}{±ei±ej:i<j} and ΦC={±2ei}{±ei±ej:i<j}. Both are finite, span Rn, omit 0, and are reduced. Reflections: sei negates the i-th coordinate, s2ei does the same, and sei±ej permutes or changes the signs of coordinates i,j and fixes the others, so each reflection permutes ΦB and ΦC. Integrality is checked directly from (ek,el)=δkl: for ΦB the Cartan integers lie in {0,±1,±2}, and for ΦC the values 2(β,2ei)/(2ei,2ei)=βi and 2(β,α)/(α,α) with α of the second kind are likewise integers in {0,±1,±2}. For a regular vector with t1>>tn>0, direct expansion of the positive roots eiej,ei+ej,ei for Bn, and eiej,ei+ej,2ei for Cn, shows that their simple roots are respectively e1e2,,en1en,en and e1e2,,en1en,2en; their Cartan matrices are Bn and Cn.

L1algebra
1.3

(Type Dn.) In Rn put ΦD={±ei±ej:i<j} for n4. It is finite, spans, is reduced, and each reflection sei±ej fixes the other coordinates or changes their signs, so it permutes ΦD; the Cartan integers are 0,±1,±2. For a regular vector with t1>>tn>0, direct expansion of the positive roots eiej,ei+ej shows that the simple roots are e1e2,,en2en1,en1en,en1+en; their Cartan matrix is Dn.

L1algebra
1.4

(Type G2.) In R2 let α,β satisfy (α,α)=6, (β,β)=2, (α,β)=3 and put ΦG={±α,±β,±(α+β),±(α+2β),±(α+3β),±(2α+3β)}; the twelve vectors are distinct and nonzero. Direct computation gives (α,α+β)=3, (α,α+2β)=0, (α,α+3β)=3, (α,2α+3β)=3, (β,α+β)=1, (β,α+2β)=1, (β,α+3β)=3, (β,2α+3β)=0, from which the Cartan integers with denominator root α or β are seen to lie in {0,±1,±2,±3} and every root is reduced; the same formulae show sα permutes ΦG (it sends βα+β, α+ββ, α+3β2α+3β, 2α+3βα+3β, and fixes α+2β) and sβ permutes ΦG (it sends αα+3β, α+βα+2β, α+2βα+β, α+3βα, and fixes 2α+3β). These permutations put every root in the orbit of α or β: the long positive roots are α,α+3β,2α+3β and the short ones are β,α+β,α+2β; their negatives are reached by the corresponding simple reflection and conjugation. Since these permutations are orthogonal, swδ=wsδw1 proves reflection invariance for every root, and invariance of inner products reduces all Cartan integers to the two denominator roots already checked. Choosing a regular vector positive on the six displayed unnegated roots makes α,β the only indecomposable positive roots, since the other four roots have the decompositions α+β, (α+β)+β, (α+2β)+β, and α+(α+3β) into two positive roots. The coefficient pairs show that α,β cannot so decompose. Their Cartan matrix is (2132), which is the G2 diagram.

L1algebra
2.1

(Type F4.) In R4 put ΦF={±ei}{±ei±ej:i<j}{12i=14ϵiei:ϵi=±1}. It has 8+24+16=48 roots, spans, and is reduced by inspection of the coordinate supports and absolute values. Reflections in coordinate roots and in two-coordinate roots are signed coordinate permutations, hence preserve the set. For a half-root h=12ϵiei, of squared norm 1, use sh(x)=x2(x,h)h. A coordinate root maps to a half-root. For x=uei+vej, u,v{±1}, the inner product is 0 or ±1; in the latter case the reflection cancels the two occupied coordinates and leaves coefficients ±1 in the other two coordinates. For another half-root k, let m be the number of agreeing signs. Then (h,k)=(m2)/2. If m=0,4 the roots are opposite or equal and reflection negates k; if m=2 it fixes k; if m=1,3 it gives a coordinate root. Thus all reflections preserve ΦF. For a denominator root of norm 1, all inner products are half-integers, so its Cartan integers are integral. For a denominator root of norm 2 (a two-coordinate root), all inner products are integers, including those with half-roots; this checks the other denominators. The coordinate roots all lie in one part of any orthogonal partition, since ei+ej connects ei to ej. Every other root pairs nontrivially with a coordinate root. Hence the system is irreducible. By [L2], rank four permits A4,B4,C4,D4,F4; the first four constructions have respectively 20,32,32,24 roots. Thus the 48-root system has diagram F4.

L1L2L3step 1.1step 1.2step 1.3algebra
2.2

(Type E8.) Put Φ8={±ei±ej:i<j}{12i=18ϵiei:ϵi=±1, iϵi=1}. All roots have squared norm 2; the D8 subset spans, and reducedness is immediate. Reflections in its integer roots permute coordinates and change either zero or two signs, preserving both subsets. For two half-roots h,k, the number m of agreeing signs is even and (h,k)=(m4)/2. For m=0,8 reflection negates k; for m=4 it fixes k; for m=2,6 the vector k(k,h)h has exactly two nonzero entries, both ±1, hence is an integer root. For a half-root h and integer root x=uei+vej, (x,h) is 0 or ±1. If it is zero reflection fixes x. Otherwise x(x,h)h is a half-root: its signs differ from those of h in six positions when (x,h)=1, and in two positions when (x,h)=1, so the parity remains even. All pairwise inner products are integers by these formulas and the integer-root calculation; with norm squared 2 this is crystallographic integrality. The integer roots form an irreducible spanning subset: their displayed D8 base has a connected chain with a fork, so all its members lie in one part of any orthogonal partition; spanning then excludes a root in the other part. Thus Φ8 is irreducible. It has 4(82)+27=240 roots. Equal root lengths force every diagram edge to be simple by [L1], so [L2] leaves A8,D8,E8. The first two have 72 and 112 roots by their explicit constructions; hence the diagram is E8.

L1L2L3step 1.1step 1.3algebra
3.1

(The two restrictions.) Let V7=(e7+e8), V6=V7(e6+e8), and Φi=Φ8Vi. Reflection in a root of Vi preserves Vi, so reflection closure, integrality and reducedness are inherited. In Φ7 the integer roots are the 60 roots ±ei±ej on the first six coordinates and ±(e7e8). Half-roots have ϵ7=ϵ8, giving two choices for the last pair and 32 odd-parity choices on the first six coordinates: 64 half-roots, thus 126 roots in all. The integer roots span V7. In Φ6, the last three coordinates obey x6=x7=x8. The integer roots are precisely the 40 two-coordinate roots on the first five coordinates. The half-roots have last signs (+,+,) or (,,+), with respectively odd or even parity among the first five signs: 16+16=32 choices. Thus there are 72 roots. The integer roots span the first five coordinate directions, and any half-root adds the remaining direction of V6, proving spanning and rank six.

L1step 2.2algebra
4.1

(Irreducibility and identification of the restrictions.) The D6 integer roots on the first six coordinates of Φ7 cannot split between orthogonal parts: their connected standard base spans those six coordinates. Every half-root has nonzero projection on that span, so pairs nontrivially with at least one such root and lies in the same part. Each of ±(e7e8) pairs nontrivially with each half-root. Thus all roots lie in one part. The same argument for Φ6 uses the connected spanning D5 base on the first five coordinates, and the nonzero projection there of every half-root. Both restrictions are therefore irreducible. Their roots have equal length, so their diagrams are simply laced. In rank six [L2] leaves A6,D6,E6; the first two have 42,60 roots, whereas Φ6 has 72, giving E6. In rank seven the possibilities are A7,D7,E7, with the first two counts 56,84, whereas Φ7 has 126, giving E7.

L1L2L3step 1.1step 1.3step 3.1algebra
5.1

These constructions realize every positive-rank type stated, with the classical and G2 diagrams computed from simple roots and the exceptional diagrams identified using the independently established classification and explicit root counts. The additional empty rank-zero system allowed by the local convention is realized in E=0, where the spanning and reflection axioms hold vacuously. No unsolved source exercise is used as a proof premise.

L1L2step 1.1step 1.2step 1.3step 1.4step 2.1step 2.2step 3.1step 4.1algebra
PropositionStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Duality exchanges B and C

Statement

Let Φ be a reduced crystallographic root system with dual root system Φ={α=2α/(α,α)} (Coroot and dual root system). Then Φ is again a reduced crystallographic root system, its Cartan matrix is the transpose of that of Φ, and its Dynkin diagram is the diagram of Φ with every arrow reversed. Consequently, up to isomorphism, duality exchanges Bn and Cn and fixes An,Dn,E6,E7,E8,F4,G2 with long and short roots exchanged for F4 and G2.

Facts & Assumptions

Given: A reduced crystallographic root system Φ with base Δ={α1,,αr} and Cartan matrix A=(aij), aij=2(αj,αi)/(αi,αi), together with the coroots α=2α/(α,α).

[L1]

(α,β)=2(β,α)/(α,α) and (α)=α (Coroot and dual root system).

[L2]

A base Δ is the set of simple roots of a positive system defined by a regular vector, and every positive root is a nonnegative integral combination of the elements of Δ; the simple roots form a basis of the ambient space (Positive systems and simple roots, Simple roots form a signed integral basis).

[L3]

The irreducible root systems and their Dynkin diagrams are classified as An,Bn,Cn,Dn,E6,E7,E8,F4,G2, with Bn and Cn having path diagrams that differ only by the direction of the arrow on the double edge, and with the simple-laced types having symmetric Cartan matrices (Classification of irreducible root systems, Existence of each classified root system).

Proof

technique · direct
1.1

Φ is a reduced crystallographic root system: it is finite, contains no zero vector, and spans E because the αi are positive multiples of the vector-space basis Δ. If β=cα, then β is parallel to α, so reducedness of Φ gives β=±α and hence β=±α; thus the dual is reduced. Moreover 2(β,α)/(α,α)=2(α,β)/(β,β)Z, and direct substitution gives sα(β)=(sαβ), so integrality and reflection stability hold.

L1L2algebra
2.1

It remains to justify that Δ={αi} is a base, rather than merely a vector-space basis. Choose a regular vector v whose positive system has base Δ. Since every β is a positive scalar multiple of β, the same v is regular for Φ and makes β positive exactly when β is positive. Let ω1,,ωr be the inner-product dual basis to α1,,αr, and for each i put xi=jiωj. If β=jnjαj is positive, [L2] gives nj0, and (xi,β)=jinj0; equality holds only when β lies on the positive ray of αi, hence only when β=αi by reducedness. The same vanishing criterion holds for β because it is a positive multiple of β. If αi were a sum of two positive dual roots, pairing with xi would force both summands to equal αi, an impossibility. Thus every αi is simple in the dual positive system. By [L2] the complete set of dual simple roots is a basis and has r=dimE elements; it therefore equals the r-element linearly independent set Δ. Its Cartan matrix has entries aij=2(αj,αi)/(αi,αi)=aji, so it is AT. The Dynkin diagram consequently reverses every arrow and keeps each edge multiplicity, since the multiplicity is aijaji=ajiaij.

L1L2step 1.1algebra
3.1

Inspecting the classified diagrams: the simply-laced types An,Dn,E6,E7,E8 have symmetric Cartan matrices, so they are self-dual; the triple-edge diagram G2 and the double-edge path F4 are each isomorphic to their arrow-reversed diagrams (interchanging the two G2 vertices, and reversing the F4 path), so those types are self-dual up to isomorphism with long and short roots exchanged; and for n3 the transpose of the Bn matrix is the Cn matrix and conversely, while B2 and C2 have isomorphic diagrams and B1=C1=A1.

L3step 2.1algebra
4.1

Combining steps 1.1-3.1 gives the assertions: duality is an involution on reduced crystallographic root systems, transforms the Cartan matrix by transposition and the diagram by arrow reversal, and therefore exchanges Bn with Cn and fixes every other classified type up to isomorphism.

step 1.1step 2.1step 3.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Free Lie algebra on a vector space

Definition

Let V be a complex vector space and let T(V)=n0Vn be its tensor algebra (Tensor algebra of a vector space). The commutator bracket [x,y]=xyyx makes T(V) a Lie algebra whose underlying vector space is T(V). The free Lie algebra on V, written L(V), is the Lie subalgebra of T(V) (Lie subalgebras, ideals, and center) generated by the image of V=V1, that is, the smallest Lie subalgebra of T(V) containing V. Elements of L(V) are finite linear combinations of iterated commutators of elements of V.

The terminology "free" refers to the universal property proved in Universal property of the free Lie algebra: every linear map from V to a complex Lie algebra extends uniquely to a homomorphism of Lie algebras from L(V). The construction is licensed by the Poincaré-Birkhoff-Witt theorem, which identifies T(V) with the universal enveloping algebra of the free Lie algebra and shows in particular that V embeds in L(V) and that L(V)=0 when V=0, L(V)=V when dimV=1, and L(V) is infinite-dimensional when dimV2.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Universal property of the free Lie algebra

Statement

Let V be a complex vector space and let g be a complex Lie algebra (Lie algebras over a field). Every linear map f:Vg extends uniquely to a homomorphism of Lie algebras L(V)g. Assume the Axiom of Choice for the basis used below.

Facts & Assumptions

Given: A complex vector space V, a complex Lie algebra g, and a linear map f:Vg.

[L1]

L(V) is the Lie subalgebra of the tensor algebra T(V) generated by V (Free Lie algebra on a vector space).

[L2]

Every linear map VA into a unital associative algebra A extends uniquely to a unital algebra homomorphism T(V)A (Universal property of the tensor algebra).

[L3]

The canonical map ιg:gU(g) satisfies ιg([x,y])=ιg(x)ιg(y)ιg(y)ιg(x) (The canonical map to U(g) is a Lie homomorphism).

[L4]

Under the Axiom of Choice, g has a basis; after ordering it, the degree-one PBW corollary makes ιg injective (Every vector space has a basis, No hidden linear relations in degree one).

Proof

technique · direct
1.1

By [L2] applied to the composition of f with the injective canonical map ιg:gU(g), there is a unique unital algebra homomorphism f^:T(V)U(g) extending ιgf.

L2L4algebra
2.1

The restriction of f^ to L(V) takes values in the image of g and is a Lie-algebra homomorphism: for x,yL(V) one has f^([x,y])=f^(x)f^(y)f^(y)f^(x), and by induction on the generation of L(V) each f^(x) lies in the image of g, where the bracket of two images is the image of the bracket by [L3]; hence the composite g:L(V)g obtained by restricting f^ and inverting the injective canonical map from [L4] is a Lie homomorphism L(V)g extending f.

L1L3L4step 1.1algebra
3.1

Uniqueness: if g1,g2:L(V)g are Lie homomorphisms agreeing on V, then the set of xL(V) with g1(x)=g2(x) is a Lie subalgebra containing V; since L(V) is generated as a Lie algebra by V, it is all of L(V).

L1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Lie algebra presented by generators and relations

Definition

Let V be a complex vector space and let RL(V) be a subset of the free Lie algebra (Free Lie algebra on a vector space). The Lie ideal generated by R is the smallest Lie ideal I(R)L(V) containing R, namely the intersection of all ideals containing R; it exists because L(V) itself is such an ideal. The Lie algebra presented by the generators V and the relations R is the quotient Lie algebra L(V)/I(R) (Quotient Lie algebras). The bracket on the quotient is well defined by The quotient Lie-algebra bracket is well-defined. The images of the elements of V generate L(V)/I(R) as a Lie algebra, and a Lie algebra homomorphism out of L(V)/I(R) corresponds to a Lie algebra homomorphism L(V)g that annihilates R, by the universal property of the free Lie algebra (Universal property of the free Lie algebra) together with the universal property of the quotient. In particular, to define a homomorphism from a presented Lie algebra it suffices to prescribe the images of the generators and to verify that all relations are satisfied.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-22Open item page →

Serre Lie algebra of a finite-type Cartan matrix

Definition

Let A=(aij) be a finite-type Cartan matrix of size r (Properties of finite-type Cartan matrices) and let V be the complex vector space with basis e1,,er,f1,,fr,h1,,hr. The Serre Lie algebra g(A) is the Lie algebra presented by the generators ei,fi,hi and the relations [hi,hj]=0,[hi,ej]=aijej,[hi,fj]=aijfj,[ei,fj]=δijhi, together with the Serre relations (adei)1aijej=0,(adfi)1aijfj=0(ij), in the sense of Lie algebra presented by generators and relations. The exponents are positive integers because aij0, and for aij=0 the Serre relations reduce to [ei,ej]=0 and [fi,fj]=0. The relations express the standard presentation of a complex semisimple Lie algebra relative to simple-root sl2 triples; the algebra g(A) is shown to be finite-dimensional semisimple with Cartan matrix A in Serre presentation theorem.

TheoremStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Serre presentation theorem

Statement

Assume the Axiom of Choice. Let A be a finite-type Cartan matrix of size r, meaning the Cartan matrix of a based reduced crystallographic root system Φ(A) as in Properties of finite-type Cartan matrices, and let g(A) be its Serre Lie algebra (Serre Lie algebra of a finite-type Cartan matrix). Then g(A) is finite-dimensional and semisimple, has a Cartan subalgebra h spanned by the images of the hi, has root system Φ(A) with Cartan matrix A, and has the triangular decomposition g(A)=nhn+, where n± is generated by the ei respectively fi. If r>0 and A is the Cartan matrix of an irreducible root system, then g(A) is simple. Conversely, if g is a finite-dimensional complex semisimple Lie algebra with base Δ={α1,,αr} and root sl2 triples (ei,fi,hi) (The root sl_2 triple), then the ei,fi,hi generate g and satisfy exactly the relations of Serre Lie algebra of a finite-type Cartan matrix, so that gg(A).

Facts & Assumptions

Given: A finite-type Cartan matrix A=(aij) and its presented algebra g(A)=F~/R in the sense of its definition; and, for the converse direction, a finite-dimensional complex semisimple Lie algebra g with a Cartan subalgebra h, root system Φ, base Δ={α1,,αr} and root sl2 triples (ei,fi,hi).

[A1]

The Axiom of Choice is assumed (The Axiom of Choice). It supplies ordered bases for PBW and the free-Lie construction and is also assumed in the cited semisimple root-space theory.

[L1]

The presentation is the quotient of the free Lie algebra by the ideal of the displayed relations (Serre Lie algebra of a finite-type Cartan matrix).

[L2]

PBW gives the ordered-monomial basis and injectivity of a Lie algebra into its enveloping algebra (Poincaré–Birkhoff–Witt theorem). The free-Lie and enveloping-algebra universal properties are Universal property of the free Lie algebra and Universal property of the enveloping algebra.

[L3]

Every finite-dimensional complex sl2-module is completely reducible; its irreducible constituents have weights m,m2,,m, each of multiplicity one, for integers m0 (Finite-dimensional representations of sl_2).

[L4]

In a finite-dimensional complex semisimple algebra, root triples satisfy the sl2 relations, root spaces are one-dimensional, and the root-space decomposition has zero space h (The root sl_2 triple, Root spaces of a complex semisimple Lie algebra are one-dimensional, Root-space decomposition). The roots span h and form a reduced crystallographic root system (Roots of a complex semisimple Lie algebra form a reduced crystallographic root system). By [L5], the simple roots form a basis and their Cartan matrix is nonsingular; since αj(hi)=aij (Cartan matrix of a based root system), the simple coroots hi are therefore a basis of h. Its dimension is dimh+Φ (Dimension formula from roots).

[L5]

A base is linearly independent, and every root has integral coefficients of one sign in it (Simple roots form a signed integral basis). Root reflections preserve the finite reduced root set (Reduced crystallographic Euclidean root system). The Cartan matrix is nonsingular and satisfies aij=0 iff aji=0, with nonpositive off-diagonal entries (Properties of finite-type Cartan matrices).

[L6]

A Cartan subalgebra is nilpotent and self-normalizing (Cartan subalgebra).

Proof

technique · direct
1.1

Let g~ be the Lie algebra with generators ei,fi,hi and all relations of [L1] except the Serre relations. It is Z-graded by degei=1, degfi=1, deghi=0, and Jacobi and the mixed relations reduce every bracket to a linear combination of brackets only in the e's, only in the f's, or single h's. More explicitly, [ei,n~]n~+h~ follows by induction on bracket length; induction on positive bracket length then reduces [n~+,n~] to the same three summands. Their nonzero degrees have opposite signs, so the sum is direct. Thus g~=n~+h~n~, where n~± is the subalgebra generated by the ei respectively the fi and h~ is spanned by the hi. We claim that n~ is free on the fi, that n~+ is free on the ei, and that the hi are linearly independent. For the first claim let a=hFL(f1,,fr) be the semidirect product of the abelian Lie algebra with basis h1,,hr and the free Lie algebra on f1,,fr, with [hi,hj]=0 and [hi,fj]=aijfj; the universal properties in [L2] identify the enveloping algebra of the free Lie algebra with the free associative algebra (both represent arbitrary choices of the generator images in a unital associative algebra). PBW, with a basis of the free Lie ideal placed before the hi, then identifies multiplication U(FL(fi))U(h)U(a) as a vector-space isomorphism, so U(a) is identified with Cf1,,frC[h1,,hr]. Write αj(hi)=aij for the simple roots and put α=αj1++αjs for the weight of a word w=fj1fjs, so that α(hi) is the sum of the aijk. Define endomorphisms of U(a) by hi(wP)=w(hiα(hi))P,fi(wP)=fiwP, ei(fj1fjsP)=k:jk=ifj1fjk^fjs(hi(αjk+1++αjs)(hi))P, the hat marking an omitted letter. These satisfy the relations of g~: the operators hi are multiplications by commuting polynomials, and passing from w to fjw lowers the weight by αj, so [hi,fj]=aijfj; each summand of ej has its left factor (hiα(hi)) replaced by (hi(ααj)(hi)), which differs by aij, giving [hi,ej]=aijej; and eifj and fjei differ only by the summand in which the leading letter is removed, present exactly when i=j, where it equals w(hiα(hi))P, giving [ei,fj]=δijhi. Hence g~ acts on U(a). Let ψ:FL(fi)n~ be the Lie homomorphism with fifi, which is surjective, and let Θ be the inclusion of FL(fi) into CfiU(a), which exists by [L2]. The maps z (action of ψ(z)) and z (left multiplication by Θ(z)) are Lie homomorphisms that agree on the generators fi, hence on FL(fi); evaluating both at 1 gives ψ(z)(1)=Θ(z)=z. So ψ(z)=0 forces z=0, and ψ is an isomorphism: n~ is free on the fi. Applying the same construction with the roles of ei and fi exchanged, that is, to the automorphism eifi, fiei, hihi of the presentation, which preserves the listed relations, shows that n~+ is free on the ei. Finally hi(1)=hi for every i, and the hi are linearly independent in U(a); a relation icihi=0 in g~ therefore yields icihi=0, hence ci=0 for all i.

L1L2algebra
1.2

For later use, every root of a based root system is carried to a simple root by a product of simple reflections. For a positive nonsimple root γ=kiαi, positivity of (γ,γ)=ki(γ,αi) supplies i with γ(hi)>0. Reflection subtracts the positive integer γ(hi) from the i-th coefficient. Another coefficient is positive, since reducedness excludes a nonsimple root on a simple-root line. By the one-sign property the reflected root stays positive and has smaller height. Induction reaches a simple root; negative roots are reduced to positive ones by a final sign-changing simple reflection.

L5algebra
2.1

Write Ei=adei, Fi=adfi, Hi=adhi in the algebra before the Serre quotient. For ij put m=aij and N=1m. The relations and induction give FiEinej=n(m+n1)Ein1ej, since Fiej=0. Hence [fi,Sij+]=0 for Sij+=EiNej. For k{i,j} the commutator with fk vanishes termwise. For k=j it equals EiNhj, which is zero for N2, and for N=1 because then aij=aji=0. The involution exchanging e,f and negating h gives [ek,Sij]=0. Let I± be the ideals generated by these elements within the free positive and negative subalgebras. These are stable under h, since the generators and their iterated brackets are weight vectors. Jacobi induction on the number of positive generators bracketing Sij+ proves [fk,I+]I+: the base commutator is zero, and every new term [fk,el]=δklhk preserves the ideal. Similarly [ek,I]I. Thus I++I is an ideal in the full algebra and is exactly the Serre ideal. It has no zero-degree part, so g(A)=nhn+ and the hi remain independent. The simple generators remain nonzero because [ei,fi]=hi.

L1L5step 1.1algebra
3.1

For fixed i the three generators give a copy of sl2, since their nonzero distinct weights and independent hi exclude linear relations. For ji, the span of ej,Eiej,,Eiaijej is a finite-dimensional module: Ei kills its last vector by the Serre relation, Hi acts by weights aij+2n, and the commutator formula in step 2.1 describes Fi. The analogous span generated by fj is also finite-dimensional. The span of ei,fi,hi,hj is stable for every j. Every bracket of vectors in finite-dimensional modules is in a finite-dimensional module, because the bracket is an equivariant image of their tensor product. Since all elements are finite sums of iterated brackets, every element is in a finite-dimensional module for this triple. By [L3], Ei,Fi act locally nilpotently.

L1L3step 2.1algebra
3.2

The root-lattice grading assigns degrees αi,αi,0 to ei,fi,hi. Each homogeneous bracket has that h-weight by the defining relations. Nonsingularity of A makes different lattice elements distinct functionals on h. The triangular decomposition implies that the only possible weights are Q+ and Q+, where Q+=iZ0αi, and that g0=h. Each nonzero weight space is finite-dimensional: it is spanned by the finitely many bracket words with its fixed multidegree. Furthermore gmαi=0 for m>1, because a Lie algebra on a single generator has no bracket of length greater than one; gαi=Cei and gαi=Cfi.

L1L5step 2.1algebra
4.1

The finite sums exp(Ei) and exp(Fi) are automorphisms: for any derivation D, induction gives Dn[x,y]=k=0n(nk)[Dkx,Dnky], so exponentiation preserves brackets when D is locally nilpotent, with inverse exp(D). Define wi=exp(Ei)exp(Fi)exp(Ei). On the triple, direct substitution using Eifi=hi, Eihi=2ei, Fiei=hi, Fihi=2fi gives wi(hi)=hi. It fixes every h with αi(h)=0, so wi(h)=hαi(h)hi for all hh. Consequently wi maps gλ bijectively to gsiλ, where siλ=λλ(hi)αi. It also preserves every ideal, because such an ideal is preserved by Ei,Fi and their exponentials.

step 3.1step 3.2algebra
5.1

Suppose gλ0 with λ=kiαiQ+{0}. If only one coefficient is positive, step 3.2 makes λ a simple root. Otherwise (λ,λ)=ki(λ,αi)>0 supplies an i with c=λ(hi)=2(λ,αi)/(αi,αi)>0. Here c is an integer, not in general ki. Step 4.1 gives a nonzero space at siλ=λcαi. At least one coefficient other than the i-th stays positive, so this weight is not in Q+. Step 3.2 therefore forces it into Q+; its height is strictly smaller. Induction proves siλΦ(A) and hence λΦ(A). Negative weights follow by the same reflection argument or the presentation involution. Conversely every root occurs: step 1.2 carries it to a simple root, whose space is nonzero, and the automorphisms in step 4.1 carry that space back. The same isomorphisms show every root space has dimension one. Thus dimg(A)=r+Φ(A).

L5step 1.2step 3.2step 4.1algebra
6.1

Suppose the diagram of A is connected. If J0 is an ideal, invariance under adh makes it a sum of weight spaces: projections onto the finitely many joint eigenspaces are polynomials in the commuting diagonal operators (choose an h separating their finitely many weights and use interpolation). A nonzero root component, by steps 1.2 and 4.1, puts ei in J for some i. A nonzero component hJh instead gives eiJ from [h,ei]=αi(h)ei for some αi(h)0, by nonsingularity of A. Then hi=[ei,fi]J and fi=[hi,fi]/2J. If aij0, [hi,ej]=aijej puts the next generator in J. Connectedness propagates this to all generators, so the algebra is simple and nonabelian. For disconnected A, generators in distinct blocks commute: mixed e,f brackets and h brackets vanish by the initial relations, and the zero Cartan entries give [ei,ej]=[fi,fj]=0 by the Serre relations. Jacobi extends this to the block subalgebras. The block inclusions and projections supplied by the presentations are mutually inverse maps with their direct sum, proving semisimplicity. Finally h is abelian, and its normalizer equals itself: a nonzero root component of a normalizing vector would give a nonzero root component in its bracket with some h, contrary to normalization. Hence it is a Cartan subalgebra by [L6], with precisely the root system and Cartan matrix already established.

L1L5L6step 1.2step 4.1step 5.1algebra
7.1

Conversely let g be finite-dimensional complex semisimple with the given base and triples. For ij, [ei,fj]=0 since αiαj has mixed signs and is not a root. The vector fj is killed by Ei and has weight aij0. In a finite-dimensional irreducible sl2-module a vector killed by e is a highest-weight vector: for a vector of weight m, the commutator formula efnv=n(mn+1)fn1v proves this and gives fm+1v=0. Complete reducibility therefore gives Fi1aijfj=0; exchange e,f to get the other Serre relation. All other presentation relations follow from [L4]. The generated subalgebra contains h, since the simple coroots form a basis. It is preserved by the exponentials of Ei,Fi, which are nilpotent on this finite-dimensional adjoint module by [L3]. The calculation in step 4.1 therefore applies to the actual algebra too. Step 1.2 and one-dimensionality of its root spaces show that the generated subalgebra contains every root space. By the root-space decomposition it is all of g, giving a surjection g(A)g. Both dimensions equal r+Φ by step 5.1 and [L4], so the map is an isomorphism. For r=0 the presentation has no generators and is the zero algebra, with zero Cartan subalgebra and empty root system; the converse follows from [L4] as well.

L1L3L4step 1.2step 4.1step 5.1algebraA1
TheoremStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Isomorphism theorem for complex semisimple Lie algebras

Statement

Assume the Axiom of Choice. Two finite-dimensional complex semisimple Lie algebras are isomorphic if their based root systems, equivalently their Cartan matrices, are isomorphic.

Facts & Assumptions

Given: Finite-dimensional complex semisimple Lie algebras g,g with Cartan subalgebras h,h, root systems Φ,Φ and bases Δ,Δ whose Cartan matrices are equal, A=A.

[A1]

AC is assumed; it is used through the Serre presentation theorem and the root-system theorem (The Axiom of Choice).

[L1]

The root system of a complex semisimple Lie algebra is a reduced crystallographic root system, and the Cartan matrix of a base is aij=αj(hi) (Roots of a complex semisimple Lie algebra form a reduced crystallographic root system, Cartan matrix of a based root system).

[L2]

Every root α admits elements eαgα and fαgα such that (eα,fα,hα) is a root sl2 triple (The root sl_2 triple).

[L3]

Once root sl2 triples have been chosen for the simple roots, every finite-dimensional complex semisimple Lie algebra with Cartan matrix A is isomorphic to the Serre algebra g(A) via its canonical generators (Serre presentation theorem).

[L4]

Two based root systems with equal Cartan matrices are isomorphic by the map carrying corresponding simple roots to one another (The Cartan matrix determines a based root system).

Proof

technique · direct
1.1

An isomorphism of based root systems of g and g means that, after numbering the simple roots compatibly, the Cartan matrices agree, and conversely equality of the matrices gives a root-system isomorphism by [L4]; so the hypothesis is equivalent to A=A for suitable numberings.

L1L4algebra
2.1

By [L2], choose root sl2 triples (ei,fi,hi) and (ei,fi,hi) for every simple root in the two algebras. Let Ei,Fi,Hi denote the canonical generators of g(A). By [L3], the assignments (Ei,Fi,Hi)(ei,fi,hi) and (Ei,Fi,Hi)(ei,fi,hi) define isomorphisms g(A)g and g(A)g, because both chosen families satisfy the presentation for the common matrix A=A.

L2L3step 1.1algebra
3.1

Composing one isomorphism with the inverse of the other gives an isomorphism gg.

step 2.1A1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Existence theorem for complex semisimple Lie algebras

Statement

Assume the Axiom of Choice. For every reduced crystallographic root system Φ there are a finite-dimensional complex semisimple Lie algebra g, a Cartan subalgebra of g, and an isomorphism from Φ onto the resulting root system. If Φ is nonempty and irreducible, g may be taken simple. For the empty root system, g may be taken to be the zero Lie algebra.

Facts & Assumptions

Given: A reduced crystallographic root system Φ.

[A1]

AC is assumed and is used through the Serre presentation theorem (The Axiom of Choice).

[L1]

The irreducible components Φj are reduced crystallographic root systems with pairwise orthogonal spans whose sum is the ambient space; the decomposition is unique (Unique irreducible decomposition).

[L2]

A regular vector determines a positive system and its simple roots; those simple roots form a basis, and every root has integral coordinates of one sign in that basis (Positive systems and simple roots, Simple roots form a signed integral basis).

[L3]

For a finite-type Cartan matrix A the Serre algebra g(A) is finite-dimensional and semisimple, with Cartan matrix A and root system Φ(A). If A is the Cartan matrix of an irreducible component of a reduced crystallographic root system, then g(A) is simple (Serre presentation theorem).

[L4]

Two based reduced crystallographic root systems with the same Cartan matrix are isomorphic by the linear map that matches their ordered bases (The Cartan matrix determines a based root system).

[L5]

The zero Lie algebra is semisimple but not simple (Simple, semisimple, and reductive Lie algebras).

Proof

technique · direct
1.1

If Φ=, then its ambient space is zero because Φ spans it. Taking g=0 gives the empty root system and a semisimple algebra by [L5], proving the empty case. Henceforth suppose Φ.

L5algebra
1.2

Choose a regular vector and the resulting base Δ by [L2]. By [L1], write Φ=Φ1Φm. The restriction of the regular vector to Ej=spanΦj is regular for Φj, and positivity is tested componentwise, so Δ is the disjoint union of the bases Δj=ΔΦj. Let Aj be the Cartan matrix of (Φj,Δj); the Cartan matrix of Φ is the block diagonal matrix diag(A1,,Am).

L1L2algebra
1.3

For each j, [L3] gives a finite-dimensional semisimple Serre algebra g(Aj) with based root system Ψj having Cartan matrix Aj. By [L4], the base-matching map is a root-system isomorphism φj:ΦjΨj. Since Aj is the Cartan matrix of the irreducible component Φj, [L3] also makes g(Aj) simple.

L1L3L4algebra
2.1

Put g=j=1mg(Aj) and take the direct sum of the Cartan subalgebras supplied by [L3]. Brackets between distinct summands vanish, so the roots of g are exactly the roots of the summands, extended by zero on the other Cartan summands; hence its root system is the orthogonal disjoint union Ψ1Ψm. The disjoint union of the maps φj from step 1.3 is therefore an isomorphism from Φ onto this root system. The direct sum is finite-dimensional and semisimple, and if Φ is irreducible then m=1 and g=g(A1) is simple.

L1L3step 1.3algebraA1
TheoremStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Cartan-Killing classification of complex simple Lie algebras

Statement

Assume the Axiom of Choice. The finite-dimensional complex simple Lie algebras are classified up to isomorphism by the connected Dynkin diagrams An (n1),Bn (n2),Cn (n3),Dn (n4),E6, E7, E8, F4, G2.

Facts & Assumptions

Given: A finite-dimensional complex simple Lie algebra g with Cartan subalgebra h, root system Φ and base Δ; and the classification of irreducible reduced crystallographic root systems.

[A1]

AC is assumed and is used through the isomorphism and existence theorems (The Axiom of Choice).

[L1]

A complex semisimple Lie algebra has a Cartan subalgebra, all such subalgebras are conjugate, and its roots with respect to one form a reduced crystallographic root system; the root decomposition and spanning property hold (Existence of Cartan subalgebras, Conjugacy of Cartan subalgebras, Roots of a complex semisimple Lie algebra form a reduced crystallographic root system). A nonempty root system is irreducible exactly when its Dynkin diagram is connected (Irreducibility and connected Dynkin diagrams).

[L2]

The nonempty irreducible reduced crystallographic root systems are exactly those of the listed types, with the standard low-rank identifications; the supplier's local convention also regards the empty rank-zero system as irreducible (Classification of irreducible root systems).

[L3]

Every type in the classification list is realized by a reduced crystallographic root system with the indicated Dynkin diagram (Existence of each classified root system).

[L4]

Two finite-dimensional complex semisimple Lie algebras with isomorphic based root systems are isomorphic, and every reduced crystallographic root system is realized by a finite-dimensional complex semisimple algebra, simple when the system is nonempty and irreducible (Isomorphism theorem for complex semisimple Lie algebras, Existence theorem for complex semisimple Lie algebras).

[L5]

The root Weyl group acts simply transitively on the chambers and on the corresponding positive systems and bases (Simple transitivity on Weyl chambers).

[L6]

A complex semisimple algebra is generated by its simple-root triples with precisely the Serre relations. Generators at indices in distinct Cartan-matrix blocks commute (Serre presentation theorem, Serre Lie algebra of a finite-type Cartan matrix). Simple means nonabelian with no nonzero proper ideals; semisimple means vanishing solvable radical (Simple, semisimple, and reductive Lie algebras).

Proof

technique · direct
1.1

A simple g is semisimple: its radical is an ideal, hence zero or all of g, while [g,g]=g by nonabelianness and simplicity, so its derived series cannot reach zero. Choose a Cartan and a base by [L1]. Its root set is nonempty: otherwise the root spanning property gives h=0 and then the root decomposition gives g=0, contrary to simplicity. If the Dynkin diagram were disconnected, split its indices into two nonempty blocks I,J. The subalgebras generated by the triples in each block commute: [L6] gives this for generators, and repeated Jacobi identities extend it to all bracket words. Their sum is a subalgebra containing all generators, hence all of g. Both subalgebras are nonzero ideals. They cannot both equal g, since then their commutation would make g abelian; but simplicity would force just that. Thus the diagram is connected and Φ irreducible.

L1L6algebra
1.2

An algebra isomorphism carries a Cartan subalgebra to a Cartan subalgebra, since nilpotence and the self-normalizer condition are invariant under isomorphism. It carries root spaces to the corresponding root spaces, preserving the Killing form since adjoint matrices are conjugated. By Cartan conjugacy in [L1] one may compare with any Cartan chosen in the target. Choices of positive systems give isomorphic based systems by [L5]. Thus the Dynkin type does not depend on these choices and is invariant under algebra isomorphism.

L1L5algebra
1.3

If two complex simple algebras have root systems of the same classified type, [L2] supplies an unbased root-system isomorphism f. The image f(Delta) of the first base is a base in the second system: f carries the defining regular vector and positive half-space to those of a positive system. By [L5], compose f with a target Weyl element carrying that positive system to the one whose base was chosen there. The resulting based-root-system isomorphism satisfies exactly the hypothesis of [L4], so the algebras are isomorphic.

L2L4L5algebra
1.4

For every diagram in the list, [L3] supplies a nonempty irreducible root system. Its realization in [L4] is a finite-dimensional complex simple algebra. In particular rank one gives A_1; B_2=C_2 is represented only by B_2 and D_3=A_3 only by A_3, as in [L2].

L2L3L4algebra
2.1

By step 1.1 and [L2], every simple algebra has a type in the displayed list. Step 1.2 makes type well-defined on isomorphism classes and ensures distinct types cannot be isomorphic; step 1.3 proves injectivity within a type; step 1.4 proves existence for every type. This establishes the asserted bijection. The zero and one-dimensional abelian algebras are excluded by the nonabelian simple convention of [L6].

A1L2L6step 1.1step 1.2step 1.3step 1.4algebra
CorollaryStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Semisimple algebras and disjoint unions of diagrams

Statement

Assume the Axiom of Choice. Finite-dimensional complex semisimple Lie algebras are classified up to isomorphism by finite disjoint unions of connected finite-type Dynkin diagrams, with multiplicity: a semisimple algebra corresponds to the multiset of connected diagrams of its simple ideals.

Facts & Assumptions

Given: A finite-dimensional complex semisimple Lie algebra g.

[A1]

AC is assumed and is used through the Cartan-Killing classification (The Axiom of Choice).

[L1]

A finite-dimensional complex semisimple Lie algebra is a finite direct sum of simple ideals (Semisimple Lie algebras decompose into simple ideals).

[L2]

Finite-dimensional complex simple Lie algebras are classified up to isomorphism by the connected finite-type Dynkin diagrams (Cartan-Killing classification of complex simple Lie algebras).

[L3]

Relative to any decomposition of a semisimple algebra into simple ideals, every ideal is the sum of a subfamily of the simple factors (Ideals and quotients of semisimple Lie algebras).

Proof

technique · direct
1.1

The simple-ideal decomposition is unique up to order. Indeed, given decompositions g=i=1mgi=j=1nhj, [L3] writes each ideal gi as a sum of a subfamily of the hj. Simplicity and nonzeroness force that subfamily to consist of exactly one factor, so gi=hj for a unique j. Distinct i give distinct j, and every hj occurs because the gi span g. Thus m=n and the two families agree after a permutation.

L1L3algebra
1.2

Conversely, a finite multiset of connected finite-type diagrams determines a semisimple algebra up to isomorphism: take the direct sum of the simple Lie algebras attached to the diagrams by [L2]; any two semisimple algebras with the same multiset of simple-ideal diagrams are isomorphic factor by factor by [L2].

L1L2algebra
2.1

By [L1] write g=g1gm as a direct sum of simple ideals. Each gj is a finite-dimensional complex simple Lie algebra, so by [L2] it has a connected finite-type Dynkin diagram, well defined up to isomorphism, and step 1.1 makes the resulting multiset depend only on the isomorphism class of g.

L1L2step 1.1algebra
3.1

Steps 1.2 and 2.1 give inverse assignments between isomorphism classes of finite-dimensional complex semisimple Lie algebras and finite multisets of connected finite-type Dynkin diagrams, which is the asserted classification with multiplicity.

step 1.2step 2.1A1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Classical complex matrix Lie algebras

Definition

All matrix spaces below carry the commutator bracket [A,B]=ABBA and are Lie subalgebras of glm(C)=Mm(C) in the sense of Lie algebras over a field; closure under the bracket is verified in each case by the computation displayed.

  • The general linear Lie algebra gln(C)=Mn(C), for n1. The special linear Lie algebra sln(C)={AMn(C):trA=0} is a Lie subalgebra because tr(ABBA)=0, and sl2(C) agrees with The special linear Lie algebra sl_2.
  • The symplectic Lie algebra sp2n(C) is the set of AM2n(C) with AJ+JAT=0, for n1, where J=(0InIn0).
  • The orthogonal Lie algebras so2n(C) and so2n+1(C) are the sets of AMm(C) with AJ+JAT=0, for n1, where J=(0InIn0) for m=2n and J=(10000In0In0) for m=2n+1.

Solving AJ+JAT=0 blockwise gives A=(abcaT) for the symplectic and even orthogonal cases, with b,c symmetric for sp2n(C) and b,c skew-symmetric for so2n(C), and gives A=(0uwTwabuTcaT),uM1×n(C),wMn×1(C),b,c skew-symmetric, for so2n+1(C). In particular dimsp2n(C)=n(2n+1)=dimso2n+1(C) and dimso2n(C)=n(2n1). Each set is closed under the bracket: if AJ=JAT and BJ=JBT, then [A,B]J+J[A,B]T=ABJBAJ+JBTATJATBT, and substituting AJ=JAT and BJ=JBT (equivalently JAT=AJ and JBT=BJ) makes the four terms cancel in pairs. For n1, each symplectic or orthogonal family is a nonzero proper subspace of Mm(C) closed under the commutator, hence a Lie subalgebra.

PropositionStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Split Cartan subalgebras of classical matrix Lie algebras

Statement

Let g be one of sln(C), sp2n(C), so2n(C), so2n+1(C) (Classical complex matrix Lie algebras). Then the matrices whose a-part is a diagonal matrix diag(x1,,xn) (in the sln case, with ixi=0) and whose remaining blocks vanish form a Cartan subalgebra h (Cartan subalgebra); it is abelian and hCn1 for sln while hCn for each symplectic or orthogonal algebra; it is maximal toral and equals its own centralizer in g.

Facts & Assumptions

Given: One of the matrix Lie algebras above, its diagonal subalgebra h, and the matrix units Eab.

[L1]

The algebras are the sets described in Classical complex matrix Lie algebras, with the block forms A=(abcaT) (a diagonal in h, b=c=0) and the analogous odd orthogonal form. In all cases [H,Eab]=(HaaHbb)Eab when H is diagonal.

[L2]

A Cartan subalgebra is a nilpotent Lie subalgebra equal to its own normalizer; the normalizer and torality conventions are those of Cartan subalgebra, Normalizer of a Lie subalgebra and Toral and maximal toral subalgebras.

Proof

technique · direct
1.1

h is abelian, hence nilpotent, and the linear map sending a diagonal matrix to its diagonal vector is an isomorphism of h with the sum-zero hyperplane of Cn (respectively with Cn in the non-special-linear cases); the relevant dimensions are n1 for sln and n otherwise.

L1L2algebra
1.2

Choose H0h whose full ambient diagonal entries are pairwise distinct: in sln take hi=i(n+1)/2; in the even symplectic and orthogonal cases take the diagonal entries 1,,n,1,,n; and in the odd orthogonal case insert 0 before those 2n entries. If XNg(h), then [X,H0]h is diagonal. On the other hand every diagonal entry of a commutator with a diagonal matrix is zero, so [X,H0]=0. Its (a,b) entry is (H0,bbH0,aa)Xab; distinctness therefore makes every off-diagonal entry of X vanish. Intersecting the ambient diagonal matrices with the defining trace or form-preservation equations in [L1] gives exactly h. Thus Ng(h)=h, and consequently Cg(h)=h as well.

L1L2algebra
2.1

The adjoint action of h on the ambient matrix algebra is simultaneously diagonalizable: the matrix units Eab are common eigenvectors with eigenvalue HaaHbb by [L1]. Since g is invariant under every adH, their restrictions to g are simultaneously diagonalizable, so h is toral. Any toral subalgebra containing h is abelian and hence lies in Cg(h)=h by step 1.2; therefore h is maximal toral.

L1L2step 1.2algebra
3.1

By steps 1.1 and 1.2 the subalgebra h is nilpotent and equal to its normalizer, hence is a Cartan subalgebra; by step 2.1 it is maximal toral and equals its centralizer. This proves all the assertions.

L2step 1.1step 1.2step 2.1algebra
PropositionStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Root systems of the classical complex Lie algebras

Statement

Let h be the diagonal Cartan subalgebra of one of sln(C), sp2n(C), so2n(C), so2n+1(C) (Split Cartan subalgebras of classical matrix Lie algebras), where n2 in the special-linear and even-orthogonal cases and n1 in the symplectic and odd-orthogonal cases, and let ε1,,εnh be the coordinate functionals, εi(H)=xi, where the a-block is diag(x1,,xn). Thus the full diagonal of H is (x1,,xn) in the special-linear case, (x1,,xn,x1,,xn) in the even cases, and (0,x1,,xn,x1,,xn) in the odd case. Here a root means a nonzero simultaneous adjoint weight: its root space is {X:[H,X]=α(H)X for every Hh}. Then the roots and root spaces are:

  1. sln(C): the roots εiεj, ij, with root spaces CEij;
  2. sp2n(C): the roots ±εi±εj, i<j, with difference-root spaces from the a-block and sum-root spaces from the symmetric b- and c-blocks, as specified below, and the roots ±2εi, with root spaces CEi,n+i and CEn+i,i;
  3. so2n(C): the roots ±εi±εj, i<j, with root spaces spanned by the corresponding block matrix units;
  4. so2n+1(C): the roots ±εi±εj, i<j, together with the roots ±εi, with root spaces spanned by the corresponding block matrix units.

In every case every root space is one-dimensional, and the listed root sets are reduced crystallographic Euclidean root systems in their real spans, of types An1, Cn, Dn, Bn respectively, with the low-rank identifications B1=C1=A1, C2=B2, D2=A1A1, and D3=A3.

Remarks

The low-rank identifications are checked directly in step 5.1. The later example collecting those coincidences is therefore explanatory rather than a logical prerequisite, which breaks the former circular dependency.

Facts & Assumptions

Given: One of the classical matrix Lie algebras g, its diagonal subalgebra h, the coordinate functionals εi, and the matrix units Eab.

[L1]

The algebras and their block decompositions are as in Classical complex matrix Lie algebras; for diagonal H and matrix units Eab one has [H,Eab]=(HaaHbb)Eab, and the off-diagonal block units satisfy the symmetry conditions b=bT (symplectic), b=bT (orthogonal), with the odd case adding the u and w blocks.

[L2]

The diagonal a-block with the other blocks zero gives a Cartan subalgebra; for sln its diagonal coordinates sum to zero (Split Cartan subalgebras of classical matrix Lie algebras, Cartan subalgebra). The simultaneous eigenbasis needed below is constructed explicitly, without a semisimplicity premise.

[L3]

A regular vector determines a positive system whose indecomposable positive roots form its base; the Cartan matrix and Dynkin diagram of a base are computed from the simple-root inner products, and the classified type names have their indicated diagrams (Positive systems and simple roots, Cartan matrix of a based root system, Dynkin diagram with edge multiplicity and arrow convention, Existence of each classified root system).

[L4]

A root system in the sense used here is a reduced crystallographic root system (Reduced crystallographic Euclidean root system).

Proof

technique · direct
1.1

In sln, take the off-diagonal units Eij and a basis of the trace-zero diagonal space. The former have weights εiεj and the latter weight zero, because [H,Eij]=(xixj)Eij. These form a basis. Distinct differences remain distinct on the sum-zero hyperplane: a difference of their coefficient vectors has coordinate sum zero, and if it vanishes on that hyperplane it is a constant vector, hence zero. No such difference weight is zero for n2.

L1L2algebra
1.2

For the even cases, write Aij for the full block matrix with a=Eij, b=c=0, hence lower diagonal block Eji. It has weight εiεj; Aii has weight zero. In the symplectic case let Bij and Cij have respectively only b=Eij+Eji or c=Eij+Eji nonzero, for i<j. Their weights are εi+εj and εiεj. Also allow b=Eii or c=Eii, with weights 2εi and 2εi. In the even orthogonal case replace the plus sign in the off-diagonal block units by minus and omit the diagonal b,c units. Each assertion follows entry by entry from [H,X]rs=(HrrHss)Xrs, since the paired entries have equal weights. These matrices are a basis by the independent a,b,c block parameters in [L1].

L1L2algebra
2.1

In the odd orthogonal case embed the even orthogonal basis of step 1.2 in the last 2n rows and columns. Add Wi with w=ei, u=0, and Ui with u=eiT, w=0, all a,b,c zero, with their forced negative-transpose entries as in [L1]. The two nonzero entries of Wi have weight xi and those of Ui weight xi, because the first full diagonal entry of H is zero. Together with the embedded even basis these form a basis of the odd algebra.

L1L2step 1.2algebra
3.1

The bases in steps 1.1–2.1 are simultaneous eigenbases. Their nonzero weights are exactly the lists in the statement and are pairwise distinct. For the non-special-linear cases this follows by comparing coefficient vectors in the independent xi coordinates; in the special-linear case it was checked in step 1.1. If a linear combination is an eigenvector of weight α, comparison of each basis coefficient for every H makes every nonzero coefficient have weight α. Thus each listed nonzero weight space is exactly its displayed line, and there are no other nonzero weight spaces. The zero weight space is precisely the diagonal Cartan. This also treats sp2 and so3, where the i<j lists are empty but the two single-coordinate root vectors remain.

step 1.1step 1.2step 2.1algebra
4.1

Give the real weight span the standard Euclidean realization: for type A, identify the difference functionals with eiej in ti=0Rn; otherwise identify εi with the orthonormal ei in Rn. The lists are finite, omit zero and are reduced. They span: adjacent differences span the type A hyperplane, the coordinate roots span types B,C, and eiej,ei+ej span every coordinate direction in type D for n2. Reflection in eiej exchanges coordinates i,j; reflection in ei+ej exchanges and negates them; reflection in ei or 2ei negates coordinate i. Each operation preserves the appropriate list. For denominator roots of squared length two, the Cartan integer is the integer dot product. For denominator ei it is 2βi and for denominator 2ei it is βi, again integral. These computations verify every axiom of [L4], including the smallest allowed ranks. In particular, the squared norm four of a long type C root is included in the denominator calculation.

L4step 3.1algebra
5.1

The type labels can be verified from the displayed sets rather than imported from an existence interface. Choose positives eiej and ei+ej for i<j, together with ei in type B or 2ei in type C. The proposed bases are αi=eiei+1 for type A; the same αi for i<n followed by αn=en for Bn or αn=2en for Cn; and αi=eiei+1 for i<n followed by αn=en1+en for Dn. They are bases in the sense of [L3]: for example eiej=k=ij1αk; in type B, ei=k=inαk and ei+ej=k=ij1αk+2k=jnαk; in type C, 2ei=2k=in1αk+αn and ei+ej=k=ij1αk+2k=jn1αk+αn. In type D, the same difference formula holds, while ei+ej=k=ij1αk+2k=jn2αk+αn1+αn for j<n, and ei+en=k=in2αk+αn; hence every positive root has nonnegative integral coordinates and each height-one αi is indecomposable. All A and D simple roots have squared length two; their nonzero off-diagonal inner products are 1, giving the A chain and, for n4, the Dn fork at αn2. For Bn the last pair has Cartan entries an1,n=1, an,n1=2, while for Cn they are 2,1; all other adjacent pairs give 1,1. By [L3] these are exactly the stable-range diagrams An1,Bn,Cn,Dn, with the required double-edge directions, so no coordinate information is borrowed from [L3]'s supplier proof. For the small ranks, B1={±e1} and C1={±2e1} are A1 up to scale. The map e1e1+e2, e2e1e2 carries B2 to C2 and scales the inner product by two. The two orthogonal pairs ±(e1e2),±(e1+e2) give D2=A1A1. For D3, the orthogonal vectors u1=(1,1,1,1)/2, u2=(1,1,1,1)/2, u3=(1,1,1,1)/2 form an orthonormal basis of the sum-zero hyperplane in R4. The isometry eiui maps its twelve roots ±ei±ej onto the twelve differences of coordinate vectors in R4, which are A3. Thus all stable and low-rank type identifications follow from explicit Cartan matrices and maps.

L3step 3.1step 4.1algebra
PropositionStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Classical types correspond to sl, so and sp

Statement

Assume the Axiom of Choice. The simple Lie algebras of classical type are An:sln+1(C) for n1, Bn:so2n+1(C) for n2, Cn:sp2n(C) for n3, and Dn:so2n(C) for n4. The low-rank coincidences are so3sl2 and sp2sl2, sp4so5, so4sl2sl2, and so6sl4.

Facts & Assumptions

Given: The classical matrix Lie algebras and their diagonal Cartan subalgebras, with the root systems computed in Root systems of the classical complex Lie algebras.

[A1]

AC is assumed and is used through the isomorphism theorem (The Axiom of Choice).

[L1]

The root systems of sln,sp2n,so2n,so2n+1 with respect to the diagonal Cartan subalgebra are the standard coordinate models of types An1,Cn,Dn,Bn, with one-dimensional root spaces (Root systems of the classical complex Lie algebras).

[L2]

In the simple ranges, the Killing forms of slm, som and sp2m are respectively the nonzero multiples 2mtr(XY), (m2)tr(XY) and 2(m+1)tr(XY), and are nondegenerate (Classical simple Lie algebras and their Killing forms).

[L3]

Two finite-dimensional complex semisimple Lie algebras with isomorphic based root systems are isomorphic, and the connected classical diagrams occur in the ranges An for n1, Bn for n2, Cn for n3, and Dn for n4 (Isomorphism theorem for complex semisimple Lie algebras, Cartan-Killing classification of complex simple Lie algebras).

[L4]

Remark 23.18 of the cited Etingof notes records the root-system coincidences D2A1A1, D3A3, and B2C2; the rank-one coordinate models give B1=C1=A1.

Proof

technique · direct
1.1

In the ranges n1 for An, n2 for Bn, n3 for Cn, and n4 for Dn, the algebras in the Statement have the asserted root systems by [L1], are semisimple by [L2], and have connected diagrams by [L3]; hence they are simple and have the asserted classical types.

L1L2L3algebra
1.2

The algebras so3,sp2,so5,sp4,so6 and sl4 are in the nondegenerate Killing-form ranges of [L2]. Their based root systems agree in the pairs prescribed by [L4], so [L3] gives so3sl2sp2, so5sp4, and so6sl4.

L1L2L3L4A1algebra
1.3

For the remaining D2 case, let V,W be two-dimensional complex vector spaces with nondegenerate alternating forms. Their product defines a nondegenerate symmetric form on VW. Since sl(V)=sp(V) and likewise for W, the map (A,B)AI+IB is a homomorphism sl(V)sl(W)so(VW). It is injective: taking the partial trace over W in AI+IB=0 gives 2A=0, and similarly 2B=0. Both sides have dimension 6, so it is an isomorphism sl2sl2so4.

algebra
2.1

For each type in the stable ranges, the complex simple Lie algebra with that based root system is unique up to isomorphism by [L3]. Thus sln+1(C), so2n+1(C), sp2n(C) and so2n(C) realize An,Bn,Cn,Dn, respectively.

L3step 1.1algebra
3.1

Apart from the coincidences in [L4], the connected classical diagrams in [L3] are distinct. Therefore the classification gives no further isomorphisms among these four classical families.

L3L4step 2.1step 1.2step 1.3algebra
PropositionStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-22Open item page →

Dimensions of exceptional simple Lie algebras

Statement

Assume the Axiom of Choice. The dimensions of the complex simple Lie algebras of types G2,F4,E6,E7,E8 are respectively 14,52,78,133,248.

Facts & Assumptions

Given: The explicit reduced crystallographic root systems of types G2,F4,E6,E7,E8 described in the cited source.

[A1]

AC is assumed and is used through the existence and classification theorems (The Axiom of Choice).

[L1]

In the explicit models of the cited source, G2 has the twelve roots listed in Example 21.9 and rank 2; Definitions 23.8, 23.11, 23.14 and 23.15 give respectively 48,240,126,72 roots for F4,E8,E7,E6, whose ranks are respectively 4,8,7,6.

[L2]

For a finite-dimensional complex semisimple Lie algebra g with Cartan subalgebra h and root system Φ one has dimg=dimh+Φ. Moreover the real root span is identified with the real dual of a real form of h, so dimCh=dimRspanRΦ=rankΦ (Dimension formula from roots, Roots of a complex semisimple Lie algebra form a reduced crystallographic root system, Rank and isomorphism of root systems).

[L3]

Every reduced crystallographic root system is the root system of a finite-dimensional complex simple Lie algebra when irreducible, and the type determines the isomorphism class (Existence theorem for complex semisimple Lie algebras, Cartan-Killing classification of complex simple Lie algebras).

Proof

technique · direct
1.1

For each of the five irreducible root systems, let g be the corresponding finite-dimensional complex simple Lie algebra, which exists by [L3]. The root-system isomorphism in [L3] preserves the real ambient dimension by the definition of isomorphism, and [L2] identifies that rank with the complex dimension of a Cartan subalgebra. Therefore dimg=rankΦ+Φ.

L1L2L3algebra
2.1

Substituting the counts of [L1] gives dimg(G2)=2+12=14, dimg(F4)=4+48=52, dimg(E6)=6+72=78, dimg(E7)=7+126=133 and dimg(E8)=8+240=248, as asserted.

L1step 1.1algebraA1
RemarkRemark: Literature-sourcedProof: Not applicableaudited 2026-09-22Open item page →

Dynkin diagrams do not classify global Lie groups

Remark

Assume the Axiom of Choice (The Axiom of Choice); it is inherited from the classification theorem cited below.

A connected Dynkin diagram classifies a finite-dimensional complex simple Lie algebra, and finite disjoint unions of connected Dynkin diagrams classify finite-dimensional complex semisimple Lie algebras. Neither classifies a real form or a connected Lie group with that Lie algebra (Cartan-Killing classification of complex simple Lie algebras, Semisimple algebras and disjoint unions of diagrams). Global classification of connected Lie groups requires isogeny or lattice data: connected groups with a given semisimple Lie algebra are classified by discrete central subgroups of the corresponding simply connected group, and that covering and lattice information is not visible in the diagram. Real semisimple Lie algebras require real-form data, namely an involution or a Satake diagram, because the diagram of the complexification does not distinguish the real forms. Both points are the subject of the following false statements and their refutations on this page; the classification of real forms and of global groups belongs to later pages and is not claimed here.

False statementConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Every finite reflection-invariant set of vectors is crystallographic

Statement

False: a finite set of nonzero vectors spanning a Euclidean space that is invariant under all of its root reflections need not be crystallographic; reflection invariance alone does not force the Cartan integers 2(β,α)/(α,α) to be integers.

Facts & Assumptions

Given: The regular pentagon and the notation of the root-system axioms.

[L1]

A reduced crystallographic root system requires sα(Φ)=Φ and integrality of all Cartan integers (Reduced crystallographic Euclidean root system).

Proof

technique · counterexample
1.1

Let Φ={±(cos(2πk/5),sin(2πk/5)):k=0,1,2,3,4}R2; it is a finite subset of R2{0} spanning R2, and its ten elements lie on five distinct lines, so RαΦ={±α} for each αΦ.

givenalgebra
1.2

The set Φ consists exactly of the unit vectors whose angles are mπ/5, mZ/10Z. If α has angle mπ/5, then sα is reflection in the perpendicular line at angle mπ/5+π/2. It therefore sends the vector at angle nπ/5 to the vector at angle 2(mπ5+π2)nπ5=(2m+5n)π5, which again belongs to Φ. Hence sα(Φ)=Φ for every αΦ.

L1algebra
1.3

The integrality axiom fails. Take α=(1,0) and β=(cos(2π/5),sin(2π/5)); then 2(β,α)/(α,α)=2cos(2π/5)=:y. With ζ=e2πi/5 one has y=ζ+ζ1 and 1+ζ+ζ2+ζ3+ζ4=0, so dividing by ζ2 gives 0=ζ2+ζ+1+ζ1+ζ2=(y22)+y+1, that is y2+y1=0 and y(y+1)=1. If y were an integer, the integer factor pair (y,y+1) would have to be (1,1) or (1,1), neither of which consists of consecutive integers. Hence yZ.

givenalgebra
2.1

Thus Φ is a finite, spanning, reduced, reflection-invariant set of nonzero vectors whose Cartan integer y is not an integer, so Φ is not a crystallographic root system by [L1]; this refutes the claim that reflection invariance alone suffices.

L1step 1.1step 1.2step 1.3
False statementConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-22Open item page →

Simple roots are pairwise orthogonal

Statement

False: distinct simple roots of a reduced crystallographic root system are generally not orthogonal; their inner product is nonpositive and can be nonzero.

Facts & Assumptions

Given: The standard model of A2 and the notion of a simple root.

[L1]

For the root system A2={eiej:1ij3} in the sum-zero subspace of R3, the roots e1e2 and e2e3 are simple with respect to the regular functional x(x,(3,2,1)) (Existence of each classified root system, Positive systems and simple roots).

[L2]

Distinct simple roots satisfy (α,β)0 (Distinct simple roots have nonpositive inner product).

Refutation

technique · counterexample
1.1

In the model of [L1] take α=e1e2, β=e2e3; the coordinates are (1,1,0) and (0,1,1) in the standard orthonormal basis of R3, so (α,β)=01+(1)1+0(1)=10.

L1algebra
2.1

Both α and β are simple roots by [L1], and they span a rank-two subsystem, so they are distinct simple roots that are not orthogonal; the negative value of their inner product is consistent with [L2]. This refutes the claim that simple roots are pairwise orthogonal.

L1L2step 1.1
False statementConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-22Open item page →

Every connected finite graph is Dynkin

Statement

False: a connected finite graph need not be the Dynkin diagram of a crystallographic root system; positive definiteness and the edge restrictions exclude most connected graphs.

Facts & Assumptions

Given: A cycle graph on m3 vertices and the conventions of the Dynkin diagram.

[L1]

The Dynkin diagram of a based root system has aijaji edges between vertices i,j and no others; a finite-type Cartan matrix is symmetrizable to a positive definite matrix. When the root system is irreducible, equivalently when its diagram is connected, that diagram is a tree (Dynkin diagram with edge multiplicity and arrow convention, Properties of finite-type Cartan matrices, Shape restrictions on Dynkin diagrams).

Proof

technique · counterexample
1.1

Let m3 and let G be the cycle graph on m vertices. A root system whose Dynkin diagram were G would have Cartan matrix A=2IAdj(G), since every edge corresponds to the single relation aij=aji=1 and nonedges to 0; this matrix is symmetric.

L1algebra
1.2

The nonzero vector x=(1,,1) satisfies xTAx=i2xi2+2i<jaijxixj=2m2m=0, because each vertex has exactly two neighbours in a cycle; hence A is not positive definite.

givenalgebra
2.1

Since a finite-type Cartan matrix must be symmetrizable to a positive definite matrix by [L1], no root system has the cycle G as its Dynkin diagram, although G is connected and finite. This refutes the claim that every connected finite graph is a Dynkin diagram.

L1step 1.1step 1.2
False statementConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-22Open item page →

B and C are always isomorphic

Statement

False for n3: Bn and Cn are dual to one another but are not isomorphic root systems; only n2 gives an isomorphism.

Facts & Assumptions

Given: The standard coordinate models Bn={±εi,±εi±εj:i<j} and Cn={±2εi,±εi±εj:i<j} in Rn.

[L1]

These are the root systems of types Bn and Cn, with the squared lengths 1 and 2 in Bn and 2 and 4 in Cn (Existence of each classified root system, Root systems of the classical complex Lie algebras).

[L2]

An isomorphism of root systems preserves all Cartan integers, hence preserves angles and the ratios of lengths; in an irreducible system it therefore maps roots of maximal length to roots of maximal length and roots of minimal length to roots of minimal length (Rank and isomorphism of root systems, Rank-two root-system classification).

[L3]

B2C2, while for n3 the types are distinct in the classification list (Duality exchanges B and C, Classification of irreducible root systems).

Refutation

technique · counterexample
1.1

In Bn the roots of squared length 2 are the ±εi±εj with i<j, of which there are 2n(n1), and the roots of squared length 1 are the ±εi, of which there are 2n. In Cn the roles are exchanged: the roots of squared length 4 are the ±2εi, of which there are 2n, and the roots of squared length 2 are the ±εi±εj, of which there are 2n(n1).

L1algebra
2.1

An isomorphism BnCn would preserve the length classes by [L2], so it would carry the 2n(n1) long roots of Bn bijectively onto the 2n long roots of Cn and the 2n short roots of Bn onto the 2n(n1) short roots of Cn; for n3 these cardinalities differ, since 2n(n1)>2n. Hence Bn≇Cn for n3. For n=1, the coordinate models in [L1] are B1={±ε1} and C1={±2ε1}, and the linear map x2x carries one onto the other and preserves their sole Cartan integer 2. For n=2 the systems are isomorphic by [L3]. Therefore the isomorphism holds exactly for n2.

L1L2L3step 1.1algebra
False statementConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Dynkin diagrams classify real semisimple Lie algebras

Statement

False: the Dynkin diagram of the complexification does not distinguish real forms; there are non-isomorphic real semisimple Lie algebras with the same complexification.

Facts & Assumptions

Given: The real Lie algebras sl2(R)={XM2(R):trX=0} and su(2)={XM2(C):X=X, trX=0}, both with the commutator bracket.

[L1]

A finite-dimensional Lie algebra over a characteristic-zero field is semisimple if and only if its Killing form is nondegenerate (Cartan's semisimplicity criterion, Killing form).

[L2]

The split algebra sl2(R) has Killing form K(X,Y)=4tr(XY), which is nondegenerate on traceless matrices (Classical simple Lie algebras and their Killing forms, Killing form).

[L3]

The real Lie algebra su(2) has the basis A1=(0ii0), A2=(0110), A3=(i00i) with [Aa,Ab]=2εabcAc.

[L4]

Specializing the diagonal-Cartan computation for sln(C) to n=2 gives the two roots ±(ε1ε2), hence the rank-one root system A1 with Cartan matrix [2] (Diagonal Cartan subalgebra and roots of sl_n).

Proof

technique · counterexample
1.1

Both algebras are three-dimensional over R and are semisimple. The split algebra has the basis e=E12,f=E21,h=diag(1,1), and its form in [L2] is nondegenerate because for nonzero traceless X one has K(X,XT)=4tr(XXT)>0. For su(2), let Ma be the matrix of adAa in the basis of [L3]. The displayed brackets give K(Aa,Ab)=tr(MaMb)=8δab, so its Killing form is negative definite and nondegenerate. Cartan's criterion [L1] gives semisimplicity in both cases.

L1L2L3algebra
1.2

The element e=E12sl2(R) is nonzero and ade is nilpotent: ade(e)=0, ade(h)=2e, ade(f)=h, ade2(f)=2e, ade3(f)=0. In su(2), if X=axaAa0 then adX=axaMa is a nonzero real skew-symmetric operator in the basis (A1,A2,A3); a nonzero skew-symmetric operator is not nilpotent, because a nilpotent operator S satisfies tr(S2)=0 while tr(S2)=i,jsij2<0 for real skew S0. Hence su(2) has no nonzero element with nilpotent adjoint.

L3algebra
2.1

An isomorphism of Lie algebras carries elements with nilpotent adjoint to elements with nilpotent adjoint, since adφ(X)=φadXφ1; by step 1.2 the algebras sl2(R) and su(2) are therefore not isomorphic.

step 1.2algebra
3.1

The real basis e,f,h of sl2(R) is a complex basis of sl2(C). For the compact algebra, A3=ih, A2=ef, and A1=i(e+f), so conversely h=iA3, e=(A2iA1)/2, and f=(A2iA1)/2; hence A1,A2,A3 are also a complex basis of sl2(C). Complexifying either inclusion therefore gives sl2(C). By [L4] both complexifications have diagram A1, while step 2.1 shows the real algebras are not isomorphic. This is the required counterexample.

L3L4step 1.1step 2.1algebra
False statementConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

The same Dynkin diagram forces isomorphic connected Lie groups

Statement

False: connected Lie groups with the same Dynkin diagram need not be isomorphic. Assume countable choice; the assumption is inherited from the covering-group supplier used in the refutation (The Axiom of Countable Choice (ACω)).

Facts & Assumptions

Given: The connected Lie groups SU(2) and SO(3) and their Lie algebras.

[L1]

Conjugation on imaginary quaternions defines a twofold covering homomorphism SU(2)SO(3) whose differential is an isomorphism su(2)so(3); the groups are connected and are not isomorphic, because SU(2) is simply connected while π1(SO(3))Z/2 (SU(2) and SO(3): same local Lie theory, different groups).

[L2]

Specializing the diagonal-Cartan computation for sln(C) to n=2 gives the two roots ±(ε1ε2) and hence the rank-one root system A1 (Diagonal Cartan subalgebra and roots of sl_n).

Proof

technique · counterexample
1.1

By [L1] the groups SU(2) and SO(3) are connected Lie groups with isomorphic Lie algebras, namely su(2)so(3), and they are not isomorphic.

L1algebra
2.1

Put h=(1001), e=(0100), and f=(0010). The matrices ih,ef,i(e+f) form a real basis of su(2) and a complex basis of sl2(C), because h=i(ih), e=((ef)i(i(e+f)))/2, and f=((ef)i(i(e+f)))/2. Thus complexifying the inclusion gives su(2)RCsl2(C). The isomorphism in step 1.1 gives the same complexification for so(3), and [L2] identifies the Dynkin diagram of both as A1.

L2step 1.1algebra
3.1

Thus the two connected groups have the same Dynkin diagram A1 but are not isomorphic, which refutes the claim; the missing global information is the lattice data of the simply connected form, here the central subgroup {±I}. The proof uses countable choice only through the covering-group supplier of [L1], and introduces no further choice.

step 1.1step 2.1algebra

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-22Open item page →

Classical root systems in coordinates

Example

For n2, in the standard coordinates ε1,,εn of Rn (and the sum-zero hyperplane for type A): An1={εiεj:ij},Bn={±εi}{±εi±εj:i<j}, Cn={±2εi}{±εi±εj:i<j},Dn={±εi±εj:i<j}. Each is a reduced crystallographic Euclidean root system with the standard simple roots and Dynkin diagram, and each is the root system computed from the corresponding classical matrix Lie algebra.

Facts & Assumptions

Given: An integer n2, the standard orthonormal basis ε1,,εn of Rn, and the four displayed sets.

[L1]

A reduced crystallographic root system is a finite spanning set of nonzero vectors that is closed under its root reflections, has integral Cartan integers, and meets each root line in exactly the two signs (Reduced crystallographic Euclidean root system).

[L2]

The root systems of the classical matrix Lie algebras with diagonal Cartan subalgebras are these same sets, with one-dimensional root spaces (Root systems of the classical complex Lie algebras).

[L3]

In the cited coordinate models, the standard simple roots are εiεi+1 for An1; ε1ε2,,εn1εn,εn for Bn; ε1ε2,,εn1εn,2εn for Cn; and, for Dn with n3, ε1ε2,,εn2εn1,εn1εn,εn1+εn. For D2 the two simple roots are ε1ε2 and ε1+ε2.

Verification

technique · direct
1.1

Each set is finite, omits 0, and is reduced. The differences εiεn span the sum-zero hyperplane for An1; Bn and Cn contain a nonzero multiple of every coordinate vector; and in Dn, (εi+εj)+(εiεj)=2εi for any ji, which exists because n2. Thus each set spans its stated Euclidean space.

L1algebra
1.2

Reflection closure: sεi and s2εi negate the ith coordinate and preserve Bn,Cn,Dn; sεiεj swaps coordinates i,j and preserves all four sets; and sεi+εj swaps and negates those two coordinates and preserves Bn,Cn,Dn. These are precisely the root reflections that occur in the displayed sets.

L1algebra
2.1

Integrality: proportional pairs give Cartan integer ±2. For nonproportional pairs, roots of squared length 2 pair by 0 or ±1; a short root of squared length 1 in Bn pairs by 0 or ±1; and a long root 2εi of squared length 4 in Cn pairs with a mixed root by 0 or ±2. Hence every Cartan integer is in {0,±1,±2}. Together with steps 1.1 and 1.2, [L1] proves that all four displayed sets are reduced crystallographic root systems.

L1step 1.1step 1.2algebra
3.1

The listed simple roots of [L3] have the standard Cartan matrices of An1,Bn,Cn,Dn (with D2=A1A1), giving the stated Dynkin diagrams; and [L2] identifies these coordinate sets as the root systems of sln,so2n+1,sp2n,so2n respectively.

L2L3step 2.1algebra
ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-22Open item page →

Weyl groups of B_n and D_n

Example

For n1, W(Bn) is the full group of signed permutations of the coordinates, of order 2nn!. For n2, W(Dn) is the subgroup of signed permutations with an even number of sign changes, of order 2n1n!.

Facts & Assumptions

Given: The coordinate model Bn={±εi}{±εi±εj} in Rn for n1, and the coordinate model Dn={±εi±εj} in Rn for n2.

[L1]

The coordinate sets in the Given data are the classical reduced crystallographic root systems, including B1=A1 and D2=A1A1 (Root systems of the classical complex Lie algebras).

[L2]

For a root α, sα(x)=x2(x,α)α/(α,α), and the Weyl group is generated by these reflections (Weyl group).

Verification

technique · direct
1.1

Substituting the orthonormal coordinate vectors into [L2] shows that sεi negates coordinate i, sεiεj exchanges coordinates i,j, and sεi+εj sends (xi,xj) to (xj,xi), fixing all other coordinates. Negating the root leaves the reflection unchanged. Thus every reflection of either system is a signed permutation.

L1L2algebra
2.1

A signed permutation is uniquely specified by a permutation of the coordinate axes and a sign on each image axis. In type Bn, all individual sign changes occur by step 1.1, as do all transpositions. Transpositions generate every permutation (move the desired entry to each position successively), so these reflections generate every signed permutation. Conversely every generating root reflection is such a permutation. Hence W(Bn) is exactly the full signed permutation group.

L1L2step 1.1algebra
2.2

For a signed permutation define its sign parity as the product of its n signs. Under composition this product multiplies, because permuting signs does not change their product. Each Dn root reflection has sign parity +1. Conversely, the product sεi+εjsεiεj negates exactly coordinates i,j and fixes the rest, by step 1.1. Any even set of coordinates can be partitioned into pairs, so products of these two-reflection operations realize every even sign pattern. The difference-root reflections also generate every permutation. Hence all and only signed permutations with an even number of negative signs occur in W(Dn). This uses a pair of different types of reflections, rather than the unsupported assertion that an even number of sum-root reflections alone produces every even pattern.

L1L2step 1.1algebra
3.1

There are n! permutations and 2n sign choices, independently, so W(Bn)=2nn!. For Dn, the first n1 signs are arbitrary and the last is forced by their product, giving 2n1n!. At n=1 the B1 group is {1,1} of order two. At n=2 the D2 group consists of the identity and coordinate swap, each with either both signs positive or both negative, of order four. No assertion is made for the excluded D0,D1.

step 2.1step 2.2algebra

Sources