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 — Examples
1 · Prerequisites
- Abelian Categories
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Applications of the Fundamental Group
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Cartan Subalgebras and Root Space Decompositions
- Categories, Functors and Natural Transformations
- Chain Complexes and Homology
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- Constant Rank, Submersions, Immersions and Regular Level Sets
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Covering Spaces and Lifting
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Distributions Integral Manifolds and the Frobenius Theorem
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Exterior Powers, Orientation and Hodge Duality
- Filters and Ultrafilters
- Finite Averaging and Character-Theory Prerequisites
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Formal Power Series
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hereditary and Productive Behaviour of the Separation Axioms
- Homotopy and Homotopy Equivalence
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lie Algebra Representations, Enveloping Algebras, and PBW
- Lie Groups, Invariant Fields, and the Exponential Map
- Lie Subgroups, Actions, and Homogeneous Spaces
- Limits and Colimits
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Manifolds with Boundary Collars and Orientations
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Noetherian Rings and Hilbert Basis
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinals, Cardinals, and Transfinite Recursion
- Partitions of Unity and Paracompactness
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Preadditive and Additive Categories and Biproducts
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Rank Theorems and Embedded Submanifolds
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Root Systems, Dynkin Diagrams, and the Cartan-Killing Classification
- Roots, Rational Powers, and Classical Inequalities
- Semisimple Lie Algebras, Cohomology, and Levi Theory
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Smooth Vector Bundles and Sections
- Solvable and Nilpotent Lie Algebras
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- Tensor Products of Modules
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Group
- The Fundamental Theorem of Finite Abelian Groups
- The Fundamental Theorems of Calculus
- The Galois Correspondence
- The Group Algebra and Representations of Finite Groups
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Riemann Sphere and Möbius Transformations
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Trees, Forests and Spanning Trees
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Uniform Spaces: the Three Definitions
- Vector Fields Flows and Lie Derivatives
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These examples accompany root-systems-dynkin-diagrams-and-cartan-killing-classification. They compute the rank-one system , the rank-two systems from their plane pictures, the classical systems in coordinates, the simple roots and fundamental weights of , the Weyl groups of types , the diagram duality of and , the low-rank coincidences, the Serre presentation of , and the positive roots and highest root of . Two counterexamples show that a cycle graph fails positive definiteness and that and have the same Lie algebra and diagram but different centers, hence are not isomorphic.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The root system A_1
Example
Let be a Euclidean line and with . Then is the reduced crystallographic root system ; its Weyl group has order , its two bases are and , and relative to either base its Cartan matrix is the matrix .
Facts & Assumptions
Given: A Euclidean line with and the set .
A reduced crystallographic root system is a finite spanning set of nonzero vectors closed under its root reflections with integral Cartan integers and reducedness (Reduced crystallographic Euclidean root system).
The reflection negates , the Weyl group is the subgroup of generated by the root reflections, and the diagonal entry of the Cartan matrix relative to either one-element base is (Weyl group, Cartan matrix of a based root system).
Verification
is finite, spans , omits , and ; the reflection sends to and to , so ; the only Cartan integers are , which are integers. Hence is a reduced crystallographic root system.
Each positive system consists of one of the two roots, so the two bases are and . The Weyl group is of order , and relative to either one-element base the Cartan matrix is by [L2]. This is the rank-one system .
Rank-two systems A_2, B_2 and G_2
Example
The following configurations with six, eight and twelve roots in the plane realize and : for the six unit vectors spaced by , for the eight vectors , and for the twelve vectors of the explicit model. The off-diagonal Cartan products are respectively.
Facts & Assumptions
Given: The standard plane with orthonormal basis and the six unit vectors , .
The irreducible reduced crystallographic rank-two root systems are exactly , and for nonproportional roots the product of the two Cartan integers is with the corresponding length ratio (Rank-two root-system classification).
A reduced crystallographic Euclidean root system is a finite spanning set of nonzero vectors that is reduced, is preserved by every root reflection, and has integral Cartan integers; for a base its Cartan matrix has entries (Reduced crystallographic Euclidean root system, Cartan matrix of a based root system).
Verification
For take . This finite set spans the plane, is reduced, and each root reflection is a symmetry of the regular hexagon. Its Cartan integers are . Put and ; then is a positive system with base , and . Thus its Cartan matrix is and its off-diagonal Cartan product is .
For take . This finite set spans the plane, omits zero, and is reduced. The reflections in the coordinate roots change one sign, while those in interchange the coordinates with possible sign changes, so every root reflection preserves ; direct pairings give Cartan integers in . The roots and form a base, since the positive roots are . Moreover , , and , so the Cartan matrix for is and its off-diagonal Cartan product is .
For , choose with , , and put The Gram determinant is positive, so form a basis; the displayed coefficient pairs then show that is finite, spans the plane, omits zero, and is reduced. The reflection interchanges with and with , and fixes ; the reflection interchanges with and with , and fixes . Together with the images of and , these permutations show that the long and short roots are the two orbits of the simple reflections. Conjugating or therefore proves reflection closure for every root. Direct pairings give integral Cartan integers in . The six displayed unnegated roots are positive and have base , whose Cartan matrix is and whose off-diagonal Cartan product is .
By [L1] the three systems are exactly the irreducible rank-two reduced crystallographic systems, and the displayed Cartan products are those of respectively.
Simple roots and fundamental weights of A_n
Example
For realized in the sum-zero subspace the simple roots are , , and the fundamental weights are
Facts & Assumptions
Given: The model in the sum-zero subspace of , with simple roots and the vectors displayed.
In this model is a reduced crystallographic root system with simple roots (Classical root systems in coordinates, Existence of each classified root system).
The coroot of is and the fundamental weights are the vectors dual to the simple coroots, (Fundamental weights, Coroot and dual root system).
Verification
and , since has two nonzero coordinates equal to .
For every one has ; the vector has coordinates in positions and in positions , so the difference equals when and otherwise. Hence and the displayed vectors are the fundamental weights of ; they form a basis of the weight lattice by [L2].
The Weyl group of A_n is the symmetric group
Example
For , , acting on the sum-zero subspace of by permuting coordinates.
Facts & Assumptions
Given: An integer , the sum-zero subspace , and the model .
The coordinate model of consists of the roots in the sum-zero subspace (Classical root systems in coordinates).
The Weyl group is generated by the root reflections (Weyl group).
Verification
Let be the homomorphism obtained by restricting coordinate permutations to . For , the reflection formula gives . Hence [L2] and the fact that the transpositions generate give .
The homomorphism is injective. Indeed, if is the identity on , then for every it fixes , so ; uniqueness of the positive and negative coordinate positions gives and . Thus , and step 1.1 yields with the asserted action.
Dynkin duality of B_n and C_n
Example
For , the and diagrams have the same underlying chain and opposite arrows on the unique double edge; transposing the Cartan matrix exchanges them.
Facts & Assumptions
Given: An integer ; the simple roots of : ; and of : .
The Cartan matrix entry is , and the diagram has edges with the arrow toward the shorter root (Cartan matrix of a based root system, Dynkin diagram with edge multiplicity and arrow convention).
Coroot duality transposes the Cartan matrix, and the dual system of is (Duality exchanges B and C).
Verification
For : for and ; , so and ; all other off-diagonal entries of adjacent pairs are and the rest vanish. Thus the diagram is a chain with a double edge at the end, the arrow being governed by and pointing toward the shorter root .
For : for and ; , so and ; the diagram is again a chain with a double edge exactly at the end, and the arrow now points toward the shorter root .
The matrices of steps 1.1 and 1.2 are transposes of one another, which is exactly coroot duality by [L2]; so transposing the Cartan matrix exchanges and , reversing the arrow while keeping the chain and the double-edge position.
Low-rank Dynkin coincidences
Example
The low-rank coincidences among the classical types are
Facts & Assumptions
Given: The classical coordinate models.
The set in a Euclidean line is the root system (The root system A_1).
The coordinate root systems and are isomorphic: an explicit orthogonal transformation followed by a uniform rescaling carries one root set to the other (Root systems of the classical complex Lie algebras).
In the classical coordinate models, For , the roots form a simple system (Classical root systems in coordinates).
Proof
Extending the coordinate notation to rank one gives and . The linear maps and identify these systems with from [L1]. Thus up to root-system isomorphism.
The explicit similarity in [L2] identifies the eight roots of with those of and preserves every Cartan integer. Hence up to root-system isomorphism.
For , [L3] gives , the orthogonal disjoint union of two rank-one systems, so by [L1].
For the simple roots of in [L3], all squared lengths are , while and . Their Dynkin graph therefore has the three-vertex path , the diagram. Hence up to root-system isomorphism.
Serre relations for A_2 recover sl_3
Example
Assume the Axiom of Choice; it is inherited from the Serre presentation theorem used below.
For the Serre generators map to , , , , , in , and this assignment is an isomorphism .
Facts & Assumptions
Given: The Axiom of Choice; the Cartan matrix of , the Serre algebra and the matrices in .
The standing AC assumption is The Axiom of Choice; it is inherited through the Serre triangular-decomposition theorem in [L1].
is presented by the Serre generators and relations, and has the triangular decomposition , where is spanned by and is generated by while is generated by (Serre Lie algebra of a finite-type Cartan matrix, Serre presentation theorem).
is the Lie algebra of traceless matrices with the commutator (Classical complex matrix Lie algebras); direct multiplication of matrix units gives .
Verification
The images satisfy the Cartan and generator relations: ; , , , and the negatives on the 's; , , and the cross brackets and vanish.
Direct multiplication also gives , so all four Serre relations hold. Hence the assignment induces a Lie-algebra homomorphism .
The images generate : , , and . Thus the image contains all six off-diagonal matrix units and the independent diagonal matrices , which form a basis of the eight-dimensional space of traceless matrices. Hence is surjective.
Put . The positive Serre relations give , so is a Lie subalgebra containing the positive generators and contained in the subalgebra they generate; hence it equals . With , the negative Serre relations likewise give , so and each half has dimension at most three. Since is spanned by , the triangular decomposition in [L1] gives . Surjectivity from step 3.1 onto the eight-dimensional algebra gives the reverse inequality, so and . Thus is the asserted isomorphism.
Positive roots and highest root of G_2
Example
In the model with a short simple root and a long simple root , the positive roots are and the highest root is .
Facts & Assumptions
Given: The model with long root and short root . Rename the ordered base as , so is short and is long.
In the model the roots , , , occur, and the Cartan matrix relative to is the matrix (Rank-two systems A_2, B_2 and G_2, Existence of each classified root system).
In a reduced crystallographic root system, every positive root is a nonnegative integral combination of the chosen simple roots; if the finite root system is also irreducible, it has a unique highest root (Simple roots form a signed integral basis, Existence and uniqueness of the highest root).
Verification
Write for the long root and for the short root of the model, so that , . The twelve roots listed in the model become, in terms of : . Hence the positive roots with respect to the base are exactly the six nonnegative combinations displayed, of heights .
The root has height , the largest among the positive roots, and it is the unique highest root by [L2]. Directly, each of the other five coefficient pairs is coordinatewise at most and is not equal to it, so every other positive root is strictly below in the root order.
A cycle graph is not finite type
Statement refuted
Every finite connected graph is the Dynkin diagram of a finite-type Cartan matrix, so positive definiteness imposes no restriction on connected diagrams.
Facts & Assumptions
Given: An integer , the cycle graph on vertices, and the matrix .
A finite-type Cartan matrix is symmetrizable to a positive definite matrix: there is a diagonal with positive diagonal entries such that is symmetric positive definite (Properties of finite-type Cartan matrices).
The Cartan matrix of a based root system has on each simple edge and on nonedges, so the diagram of would be (Dynkin diagram with edge multiplicity and arrow convention).
Proof
The matrix is symmetric and satisfies , for adjacent and otherwise; its diagram, as in [L2], is the cycle on vertices.
The nonzero vector satisfies , because every row has diagonal entry and exactly two entries . Equivalently . Hence is not positive definite; moreover every diagonal conjugate has the nonzero null vector , so no symmetric diagonal conjugate can be positive definite.
By [L1] a finite-type Cartan matrix must be symmetrizable to a positive definite matrix; is not. Moreover, [L2] makes the only Cartan matrix with this unoriented simple-edge cycle: on each edge the nonpositive integral entries have product , so both are . Thus the cycle is not a finite-type Dynkin diagram even though it is finite and connected. This explicit family suffices to refute the claimed statement; no broader tree assertion is needed.
SL_2 and PGL_2 have the same Lie algebra but differ globally
Statement refuted
A connected Lie group is determined up to isomorphism by its Lie algebra, so two connected Lie groups with the same complex semisimple Lie algebra are isomorphic.
Facts & Assumptions
Given: Assume . The groups and , and their Lie algebras.
The Möbius group is , so is a quotient of by the normal subgroup (Möbius transformations form a group and identify with the projective linear quotient of GL_2(C), Invertible matrices and the general linear group ).
The traceless matrices form the complex Lie algebra under the commutator, with basis satisfying , , . The special linear Lie algebra sl_2.
Countable choice is assumed for the following differential-geometric interfaces. The Axiom of Countable Choice ().
Under , a closed normal subgroup of a finite-dimensional real Lie group has a quotient Lie group with tangent Lie algebra . Quotient by a closed normal subgroup is a Lie group.
Under , the tangent bracket is the value at the identity of the commutator of the left-invariant extensions. Lie bracket on the tangent space of a Lie group.
Proof
The open set is a complex Lie group: multiplication is polynomial and inversion is the adjugate divided by the nonzero determinant. The determinant-one subset is a complex submanifold: on the open set where the entry , the equation solves ; at any other matrix at least one entry is nonzero and one solves for its opposite entry in the same way. These charts cover the subset, and the restricted group operations are holomorphic. Differentiating the determinant at gives , and the chart at shows that every traceless is tangent to this subset. For either matrix group the left-invariant extension of is ; the field commutator with is . Thus their tangent Lie algebras are respectively and .
The algebra is simple, hence semisimple. Indeed a nonzero ideal is invariant under , whose distinct eigenvalues on are . Polynomial spectral projections show that the ideal contains a nonzero multiple of at least one of these basis vectors. Bracketing with the others then puts all three in the ideal. Moreover , so the whole algebra is not solvable; it therefore has no nonzero solvable ideal.
The group is path connected. Indeed, if has , then Each unipotent factor is joined to by multiplying its off-diagonal entry by , and the diagonal factor is joined to along for any path in from to . If , then , and the path joins to a matrix whose upper-left entry is , reducing to the preceding case.
: a central matrix commutes in particular with the unipotent one-parameter subgroups generated by and , hence with and ; it is therefore scalar, and determinant one leaves precisely .
is trivial: a central projective transformation commutes with every dilation , so it preserves their common fixed set ; commuting also with the inversion and translations forces it to fix , hence it is the identity Möbius transformation.
The scalar subgroup is closed in , being defined there by zero off-diagonal entries and equal diagonal entries. It is normal, and its tangent algebra is . Consequently [L3], applied to the underlying real groups, gives the quotient tangent algebra . The quotient is also a complex Lie group: on the set of classes with a selected matrix entry nonzero, normalize that entry to . The other three entries give an open subset of with determinant nonzero. Transition functions and the locally expressed group operations are rational with nonzero denominators, hence holomorphic. These charts agree with the smooth quotient charts since normalization is a smooth local section. The tangent quotient map is complex linear. Finally is a well-defined complex-linear bijection to preserving commutators, since scalar matrices commute and commutators have trace zero.
The group is path connected: for choose with ; then , and paths in and join to . Its quotient is therefore connected.
An isomorphism of groups carries the center onto the center, so and are not isomorphic, although steps 1.3 and 2.2 show both are connected and steps 1.1, 1.2, and 2.1 give both the complex semisimple Lie algebra . This witnesses the failure of the claim: the two groups are distinct global forms of the same Lie algebra.