Past exam of the groups and representations course of the University of Oxford 2022 4 a Solution 2026-10-25
Use the A5 root system with simple roots for , in the hyperplane . The Dynkin diagram is the five-node chainIts Cartan matrix isDeleting the final node leaves the A4 root system, with simple roots . Concretely, the Lie algebra homomorphism sends to and preserves the Lie bracket. This realizes the required Lie subalgebra and fixes the embedding used below.
Past exam of the groups and representations course of the University of Oxford 2023 3 e Solution 2026-10-25
Number the simple roots of the root system consecutively along its Dynkin diagram. For a Young diagram with row lengths , its highest weight has Dynkin labels . The three irreducible representations have the following Young diagrams, which can be filled increasingly down the column to give Young tableaux:Here , , and . Contraction with the invariant alternating tensor identifies , giving the dual representation of . The dimensions follow from , , .
Use the centralizer and circle group normalization of solution. The first three components have U(1) charge and the last two have U(1) charge , so the branching of a representation isFor the dual representation, both U(1) charges reverse and the representation is conjugated; the doublet is equivalent to its conjugate. Taking the exterior square of the first decomposition gives three types of antisymmetric tensor components: , , and , where and . Their U(1) charges add, and , . HenceThe dimensions are . These product labels describe genuine representations of the quotient group in solution: every element of its kernel acts trivially on each summand.
Past exam of the groups and representations course of the University of Oxford 2023 4 a Solution 2026-10-25
For the A3 root system, take simple roots for in the hyperplane of an orthonormal . Its Dynkin diagram is the single-bond chain . The Cartan matrix has entries , givingFor a weight , use Dynkin labels . The four weights of the defining representation have labelsThey form the weight system with highest weight . Equivalently, subtract successive rows of from that highest weight. The dual representation negates every weight, so the weight system with highest weight isAll these weights have multiplicity one. The numbered Dynkin diagrams used in this solution and in solution are shown below.
Numbered Dynkin diagrams for the A3 root system and D5 root system, with deletion from the Extended Dynkin diagram
. All bonds are single. In the Extended Dynkin diagram of the D5 root system, deleting node 2 separates nodes 0 and 1 and leaves the three-node chain 4-3-5, giving the root subsystem . Details. Past exam of the groups and representations course of the University of Oxford 2023 4 b Solution 2026-10-25
For the D5 root system, take an orthonormal basis and simple roots for , together with . The Dynkin diagram has single bonds , , , , with the fork at node . Thus its Cartan matrix isThe fundamental weight has Dynkin labels . Its pairing with every positive coroot , , is zero or one. Hence its half-spin representation is a minuscule representation, so its weight system is a single Weyl group orbit with multiplicity one. The Weyl group of the D5 root system permutes coordinates and changes an even number of signs. Consequently its complete weight system isThere are such weights. Their Dynkin labels are , explicitlyHere the Lie algebra is , or its compact real form when discussing compact groups. Globally the half-spin representation is a representation of , and does not descend to ; the question only specifies the Lie algebra.
A reduced crystallographic root system in a real Euclidean space is a finite spanning subset not containing zero, with , closed under , and satisfying for all roots. A base of a root system is a vector-space basis such that every root has integer coefficients of one sign in that basis.
Choose not orthogonal to any root and call roots with positive. Let be the positive roots that cannot be written as a sum of two positive roots. Repeated decomposition terminates because each summand has strictly smaller positive -value in a finite set. Thus every positive root is a nonnegative integer combination of .
For distinct , : otherwise the allowed difference-root lemma would make either or positive, decomposing one of them. In a real linear relation among , move negative coefficients to the other side, obtaining as positive combinations with disjoint supports. Then , so . But a nonempty positive combination has , a contradiction. Thus the elements are linearly independent. They span every root and hence , proving existence of a base of a root system. The difference-root lemma is used only for distinct roots; that qualification excludes the zero difference.
For the displayed set, there are eight coordinate roots, twenty-four roots with two nonzero unit entries, and sixteen half-coordinate roots: forty-eight in total. It spans , is reduced, and has squared root lengths one and two. Signed coordinate permutations preserve it. Reflections in coordinate roots are sign changes, and reflections in roots are signed coordinate permutations. Every half-coordinate root is obtained by a signed permutation from , so it remains to check its reflectionIt sends to , a half-coordinate root; it fixes and sends to the negative sum of the other two coordinate vectors. For a half-coordinate root, the sum of its four signs is or ; the formula sends it, respectively, to itself, a coordinate root, or its negative when parallel to . Thus reflection closure holds. For a long root, the required Cartan integer is an integer dot product; for a coordinate root it is twice a half-integer; for it is . Symmetry gives the remaining cases. Therefore this is the F4 root system.
In the printed base order, the Gram matrix isUsing the convention , the Cartan matrix isThe row-coroot convention transposes this matrix. The Dynkin diagram is the chain , with the double bond pointing toward the shorter third root:
Equip the finite-dimensional real vector space with a positive-definite inner product. A reduced crystallographic root system is a finite set spanning such that, for every ,where is the orthogonal reflection in . The Weyl group is . It permutes the finite set . Its action is faithful because spans : an element fixing every root fixes every vector. Hence it embeds in the finite symmetric group of and is finite.
A Cartan subalgebra is a nilpotent self-normalizing Lie subalgebra. For a finite-dimensional complex semisimple Lie algebra it is equivalently a maximal toral subalgebra: a maximal abelian subalgebra whose elements have diagonalizable adjoint actions. The commuting semisimple operators give the root-space decompositionThe nonzero weights are the roots. Their real span inside the complex dual , with the positive-definite real inner product induced by the Killing form, is the Euclidean space in which they form a reduced crystallographic root system. In particular one uses this real span, rather than treating all of as a real vector space of twice the rank.
For the specified Special orthogonal Lie algebra, put . The matrix relation is . Thus its diagonal Cartan subalgebra consists ofLet . The matrix units satisfy , where . A basis of root vectors is supplied, for , byThese are twelve independent off-diagonal matrices. Together with the three diagonal generators, they account for the full dimension , so no further roots occur. ConsequentlyChoose the simple rootsThe six positive roots are , and every other root is their negative. In the standard orthonormal coordinates all roots have squared length , and their Cartan matrix isIts Dynkin diagram is the connected chain . A decomposition into mutually orthogonal nonempty root systems would separate this connected set of simple roots, which is impossible. Thus the root system is irreducible. The chain is also the diagram , which is the root system of . The classification of complex semisimple Lie algebras by their root systems yields the Lie algebra isomorphismAn explicit explanation of this coincidence uses the exterior-power Lie algebra representation of on , a six-dimensional space. After choosing a volume form, defines a nondegenerate symmetric bilinear form on that exterior square. The induced action preserves it because a traceless endomorphism acts trivially on the top exterior power. This gives a nonzero homomorphism . Its kernel is an ideal in the simple algebra , so it is zero; equal dimensions then make it an isomorphism. Over all nondegenerate symmetric forms in dimension six are equivalent, including the form with matrix .
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 4 3 Solution Created 2026-10-03 Updated 2026-10-14
Let be a nondegenerate alternating bilinear form on of dimension over . A symplectic basis has and all and pairings zero. Such bases are built by choosing a nonzero , finding with , and continuing in their nonsingular orthogonal complement for a sesquilinear form. In these coordinates the group preserving isIts action on symplectic bases is regular. There are choices for and for , so induction gives the finite symplectic group orderThe center of a group consists of with , and has order . To see there are no other central elements, a central element commutes with every symplectic transvection and hence fixes every symplectic transvection center line; a linear map fixing every line is scalar. Consequently the projective symplectic group over a finite field has this order divided by .
Here is a proof of the main ingredients in simplicity. The symplectic transvectionpreserves , has inverse , and fixes pointwise. These transformations generate . Indeed if , then sends to . If the pairing is zero, choose an intermediate vector having nonzero pairing with both, so two symplectic transvections suffice. This aligns the first vector of any symplectic basis. For partners of the same , their difference lies in . If a symplectic transvection centered at aligns them and fixes . If it is zero and the partners differ, pairs nontrivially with both and still pairs to one with ; two such symplectic transvections work. After fixing the pair, induction in its orthogonal complement for a sesquilinear form aligns the rest of the basis.
The projective action on one-spaces is faithful. For , a line stabilizer has three orbits: the line itself, the other lines perpendicular to it, and the lines not perpendicular to it. Witt's lemma proves transitivity within the latter two orbits by matching the two-dimensional restricted form. This action is primitive. A block containing distinct perpendicular lines is invariant under both stabilizers and therefore contains a line perpendicular to but not to . A block containing distinct nonperpendicular lines likewise contains a line perpendicular to but not to , by using the stabilizer. Such lines exist by nonsingularity in dimension at least four. Either possibility makes the block contain both nontrivial stabilizer orbits, hence every line. For the action on the projective line is two-transitive and thus primitive.
Symplectic transvections with one fixed center line form an Abelian normal subgroup of its stabilizer, and their conjugates generate the whole group. The Iwasawa simplicity lemma now reduces simplicity to being perfect. Its short proof is useful: any nontrivial normal subgroup of a faithful primitive group is transitive, since its orbits are blocks. Writing , where is a point stabilizer, shows that all conjugates of the specified Abelian subgroup have the same image modulo . Thus is Abelian. If is perfect, .
The groups can also be shown to be perfect concretely. For choose with and let scale by and by . Thenso every symplectic transvection is a group commutator. For , symplectic transvections of coefficient one are conjugate, have order three, and the four with centers in a two-dimensional totally isotropic subspace multiply to the identity. They commute, and the sum of their rank-one terms is zero modulo three. Their common class in the abelianization is therefore annihilated by both three and four, hence is zero. For , use the seven nonzero vectors of a three-dimensional totally isotropic subspace. The symplectic transvections commute and their product is the identity, because each diagonal coefficient occurs four times and each cross coefficient twice. Their common abelianized class is annihilated by two and seven, hence is zero. Generation now proves these groups are perfect.
It follows thatThe exceptions are , and respectively. For odd the full symplectic group over a finite field has nontrivial center of a group, so simplicity refers to its quotient group; for even the center of a group is trivial.
A symplectic parabolic subgroup stabilizes a flag of totally isotropic subspaces. The maximal such parabolic subgroups stabilize a single -space, . In an adapted basis their Levi subgroup is , with an arbitrary block of parameters and a remaining symmetric block of parameters. ThusThese are the single-member flag stabilizers, equivalently the standard maximal parabolic subgroups obtained by omitting one node of the symplectic Dynkin diagram. Two particular cases have transparent descriptions.
For the symplectic point stabilizer, write . Its unipotent radical consists ofAll pairings are preserved by direct substitution. The product law is , so this radical has order . With group commutator convention , its commutator has central parameter : it is Heisenberg-type in odd characteristic, but Abelian in characteristic two. A Levi subgroup scales inversely and acts as , givingThis index counts the one-spaces, all of which are isotropic for an alternating bilinear form.
For a Lagrangian subspace , the symplectic Lagrangian stabilizer has block formSubstituting into proves both the inverse-transpose lower block and symmetry of . The unipotent radical is the additive group of symmetric matrices, and acts by . ThereforeThe last identity follows by canceling -powers and factors in the two order formulas; it counts maximal totally isotropic subspaces.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 3 2 a Solution Created 2026-10-03 Updated 2026-10-14
Put and let denote a matrix unit. The antidiagonal matrix satisfies , so the orthogonal condition is , or entrywise . Consequently the diagonal Cartan subalgebra isWe first take . Since , the matrix root basis of the even orthogonal Lie algebra givesThe zero weight space is ; its basis is . No vector of weight occurs, because the corresponding matrix unit is forced to be its own negative. These spaces account for dimensions, exhausting the Special orthogonal Lie algebra. Thus its decomposition as a -module and its Dn root system areEach nonzero root space has dimension one; the zero weight has multiplicity .
The upper triangular root spaces are precisely those of weights and with . ThereforeThese roots form the simple roots. To check that they generate the chosen positive system with nonnegative coefficients, write . For ,and for use . Empty sums are zero. Their linear independence and these expansions identify the base of the root system.
Equip the real span of the roots in with the inner product making the orthonormal. All roots then have squared length two. The coroots of are , so the fundamental weights of Dn, characterized by , areTaking their pairings with and verifies the defining identities directly. For each pair , the sum of its two positive roots is . Hence the half-sum of positive roots is
The Dynkin diagram has a chain ending at , which is joined to both and . Every edge is a single bond because the root lengths agree; the nonzero off-diagonal simple-root pairings are minus one. The labelled Dn Dynkin diagram and its low-rank versions are shown below.
Labelled D-type Dynkin diagrams, including the low-rank cases
. Details. For , and are orthogonal, giving two disconnected A1 root systems. For , the diagram is the chain , of type A3 root system; the displayed weight formulas still apply. If is allowed, is one-dimensional and abelian: there are no roots or fundamental weights, and .
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 2 6 Solution Created 2026-10-03 Updated 2026-10-14
Work with a finite-dimensional complex semisimple Lie algebra. The Dynkin diagram is obtained from its intrinsic root system, with several structure theorems entering the construction.
First choose a Cartan subalgebra . The semisimple structure theory gives the root-space decompositionThe nonzero roots span , root spaces have dimension one, and every root has its negative. The rank is .
Next use the Killing form. Its nondegeneracy on and its positive-definite restriction to the real coroot span identify the real root span with a Euclidean space. Explicitly, if , put . The sl2 subalgebra associated with a root supplies its normalized coroot and the integral pairingThe root-string theorem makes the reflection permute . Together with the absence of multiples other than , this shows that is a finite reduced root system and a crystallographic root system. These properties come from semisimple Lie algebra theory, not from the diagram's definition.
Choose a vector in that is not perpendicular to any root. Define the positive roots by positive inner product with this vector. The simple roots are those positive roots that cannot be expressed as sums of two positive roots. Root-system theory shows that they form a basis , and each root is an integer combination of them with coefficients all of one sign. Distinct simple roots have nonpositive inner product.
Use the standard Cartan matrix conventionThere is one diagram vertex for each simple root. For , the integral off-diagonal entries are nonpositive andConnect the two vertices with respectively zero, one, two or three edges. The corresponding angles are . A multiple edge carries an arrow toward the shorter root. For joined vertices, the length ratio is determined by ; hence the diagram records both angle and relative length.
For example, has simple roots and , giving two equal-length vertices joined by one edge: type . For , take and . Thenso the two vertices have a double edge directed toward , the shorter root: type .
Finally, orthogonal irreducible components of the root system correspond to the simple ideals of a Lie algebra in the semisimple Lie algebra, so its diagram is the disjoint union of their connected diagrams. Conjugacy of Cartan subalgebras and the Weyl group action on choices of positive roots make the resulting diagram independent of these choices up to isomorphism. Thus the vertices, edge multiplicities, arrows and connected components encode the simple-root geometry and the simple-ideal decomposition.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 4 2 iv Solution Created 2026-10-03 Updated 2026-10-14
A Dynkin diagram has one vertex for each simple root. Vertices are joined by bonds, where are the off-diagonal Cartan integers. No bond means orthogonality; one, two and three bonds mean angles . A multiple-bond arrow points to the shorter root. Thus the Dynkin diagram determines the Cartan matrix, including the relative lengths inside each connected component.
An irreducible root system corresponds to a connected Dynkin diagram. The classification of finite crystallographic Dynkin diagrams givesHere is already represented by , and by . General systems are orthogonal direct sums of these, with separate component scales. The following diagrams specify all the types; dots denote a continued chain, not additional vertices.
Finite irreducible crystallographic Dynkin diagrams, with every arrow pointing toward the shorter root
. Details. For orientation, the An Dynkin diagram is a single chain, the Bn Dynkin diagram has a terminal double bond pointing to its terminal short root, and the Cn Dynkin diagram reverses that arrow. The Dn Dynkin diagram has arm lengths . The En Dynkin diagram has arm lengths ; ; or . The F4 Dynkin diagram has a central double bond and the G2 Dynkin diagram a triple bond.
The positivity behind this finite list is the positive-definite Gram matrix of the simple roots. In particular the underlying graph is a tree: if it contained a cycle, the sum of its normalized roots would have squared norm at most zero, since each bonded inner product is at most . This contradicts linear independence. Restricting the possible bonds and branches by positive definiteness gives precisely the listed chains and trees. Conversely their Cartan matrices are positive definite after symmetrization and their reflection-generated root sets give the indicated finite root systems.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 1 2 Solution Created 2026-10-03 Updated 2026-10-14
Work in finite dimension over ; the characteristic-zero real version follows by complexification. The Cartan solvability criterion isIts semisimplicity consequence, also often called Cartan's criterion, is is semisimple if and only if its Killing form is nondegenerate. We prove both forms.
The auxiliary results used are as follows. The Lie theorem simultaneously triangularizes every finite-dimensional representation of a complex solvable Lie algebra. The Engel theorem says that a matrix Lie algebra consisting entirely of nilpotent endomorphisms has a common annihilated nonzero vector and a basis making all its matrices strictly upper triangular; in particular it is a nilpotent Lie algebra. Nilpotent means that the lower central series terminates, which implies that the derived series terminates as well. Finally, the Additive Jordan decomposition writes any complex endomorphism uniquely as , where is diagonalizable, is nilpotent and they commute. On a generalized eigenspace , the two parts are and , and both are polynomials in . On endomorphisms, is diagonalizable, is nilpotent, and these are the Jordan parts of : the first assertion follows by splitting into maps between eigenspaces, and the second by expanding repeated commutators with the nilpotent .
First prove the linear trace version: if andthen is solvable. Fix and let be its generalized eigenspace decomposition. Define to act on by the scalar . We do not assume that , or belongs to .
On , has the form with nilpotent, whereas is multiplication by . Choose a polynomial with for every occurring eigenvalue difference , and with all its derivatives of positive order up to the relevant nilpotency index zero at . Such a polynomial exists by Hermite interpolation, or the Chinese remainder theorem for the pairwise coprime powers of . At its value is zero, so . Expanding now givesBecause and is an ideal, every positive power of sends into . The zero constant term therefore gives .
Express as a sum of commutators with . Cyclicity of trace and the hypothesis implyBut on , has trace , since the nilpotent part has trace zero. Henceforcing every eigenvalue of to vanish. Thus every member of the derived algebra is a nilpotent endomorphism. By the Engel theorem, is nilpotent and therefore solvable; its derived series terminates, and adjoining the initial term shows that is solvable.
Conversely, if is solvable, the Lie theorem makes it upper triangular. Commutators of upper-triangular matrices have zero diagonal, and multiplying such a commutator by an upper-triangular matrix still has zero diagonal. Therefore the trace condition holds. Apply this equivalence to . Its trace pairing is the Killing form, and solvability of its image is equivalent to solvability of : the kernel is its abelian centre, so a terminating derived series in the quotient terminates after at most one more step in . This proves the solvability criterion.
For the semisimplicity criterion, let be the radical of the Killing form. Invariance makes a Lie algebra ideal. For , their adjoint actions on vanish, so computing trace in a basis adapted to gives . The solvability criterion applied to shows it is a solvable ideal. Thus a semisimple Lie algebra has and a nondegenerate Killing form.
Conversely, any nonzero solvable ideal has a last nonzero term in its derived series; this is an abelian ideal of . For , , the map sends into and vanishes on , so has trace zero. Hence . A nondegenerate Killing form therefore rules out nonzero solvable ideals, exactly the definition of semisimplicity.
For classification, nondegeneracy of the Killing form provides the duality and root-space pairings used to extract a reduced crystallographic root system from a semisimple Lie algebra. Classification then reduces to the finite Dynkin diagrams and reconstruction of the Lie algebra from its root data.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 1 6 e Solution Created 2026-10-03 Updated 2026-10-14
The single bonds give equal simple-root lengths and inner products, after normalization,The positive roots of this A3 root system areThe first two sums are roots by the qualified obtuse-root lemma. The last is a root because . All have nonnegative simple-root coordinates, hence are positive.
To prove completeness, first note that every root is Weyl-conjugate to a simple root. For a nonsimple positive root , some , since . Reflection subtracts a positive integer multiple of , decreasing its integer height. The reflected root stays positive: it leaves the coefficients at all other simple roots unchanged, at least one of which is positive; a root has coordinates all of one sign. Repeating this height decrease reaches a simple root. Thus every root has squared length two in this connected single-bond system.
Write an arbitrary positive root as , with nonnegative integers . Its squared length condition isThus . For the equation gives ; for or it gives or ; for it gives . These are exactly the six coefficient triples in the displayed list. This proves completeness from the axioms, not merely from recognizing the Dynkin diagram.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 4 2 i Solution Created 2026-10-03 Updated 2026-10-14
Put and . A Cartan subalgebra isThe defining matrix condition says . Using the matrix units, the nonzero root spaces have the following generators:Commuting each generator with gives its stated weight. Together with , these matrices span the Special orthogonal Lie algebra; there are independent generators. Thus its decomposition as a Cartan subalgebra module isThis is the Bn root system. The upper-triangular generators select the positive rootsIts simple roots and highest root, for , areTo see the simplicity assertion, , while and . The coefficient pattern for dominates those of every positive root.
Normalize the inner product so the are orthonormal. The simple coroots are for and . Solving gives the fundamental weightsIn the half-sum of positive roots, the coordinate occurs with total coefficient . Hence the Weyl vector is
The Dynkin diagram is a chain , with single bonds up to and a double last bond pointing towards the short root . In the Extended Dynkin diagram, add . For , and its inner product with every other simple root is zero, so it attaches to by a single bond. For , both long nodes attach by double bonds to short node . These rules give the Bn Dynkin diagram and affine extension drawn below.
For rank one, , , , and . The finite diagram is one node; its affine extension has two equal-length nodes joined by a double bond, without a short-root arrow.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 3 4 iii Solution Created 2026-10-03 Updated 2026-10-14
In the finite-dimensional complex semisimple Lie algebra setting implicit in this root-system construction, the given Cartan subalgebra and root spaces determine a reduced crystallographic root system . The ordering divides into positive roots and their negatives. The simple roots are the positive roots that cannot be written as a sum of two positive roots; a standard root-system fact is that they form a basis and that every positive root is a nonnegative integral combination of them.
Index the simple roots as and form the Cartan matrixFor , these entries are nonpositive integers and . Construct one vertex per simple root and join distinct vertices by lines. If root lengths differ, direct the arrow toward the shorter simple root. This labelled and oriented graph is the Dynkin diagram. Its unoriented Coxeter graph is admissible: normalizing the simple roots to unit length gives . A general Lie algebra without the semisimple root-system hypotheses need not produce such a diagram.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 3 4 iv Solution Created 2026-10-03 Updated 2026-10-14
Let be distinct simple roots. Their difference is not a root, since its simple-root coefficients have opposite signs. The root string through in the direction therefore starts at and has the formHere we use the root-string theorem: if the full string runs from through , then ; in this case . Thus is a root exactly when , equivalently when the corresponding Dynkin diagram nodes are connected.
The root-space bracket facts are , with a zero space when the sum is not a root, and when the sum is a root and . Applying these stated structural facts proves
If the two names denote the same simple root, its one-dimensional root space has zero bracket with itself, and a Dynkin diagram has no self-edge. Thus the equivalence also holds in that case.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 3 4 v Solution Created 2026-10-03 Updated 2026-10-14
If the three simple roots are distinct and every pair of root spaces had nonzero Lie bracket, part (iv) would put all three connections in the Dynkin diagram. Their underlying Coxeter graph would contain a triangle, contradicting part (ii). Hence at least one pair satisfies . If two of the listed roots coincide, their common root space is one-dimensional, so its bracket with itself is already zero. Thus the conclusion also covers that case.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 6 3 i Solution Created 2026-10-03 Updated 2026-10-14
Write , and let denote a matrix unit. The diagonal Cartan subalgebra consists ofFor a diagonal matrix, . Substituting into the symplectic relation shows that the following are root vectors:The zero weight space is spanned by . The symplectic equation pairs the remaining entries exactly as in this table; the displayed vectors and the are independent and span the algebra. This proves the root-space decompositionThere are roots of a root system, each with one-dimensional root space, giving .
The upper triangular root vectors select preciselyThe simple roots of this Cn root system areIndeed, the positive roots of a root system have expansionsThese expansions also identify the highest root:Normalize the coordinate inner product by . The simple coroots are for and . Solving gives the fundamental weightsIn the sum of the positive roots of a root system, the pair contributes , and the long root contributes another . Therefore the Weyl vector isThese are the Positive-root data for Cn.
For , the finite Dynkin diagram is a chain of vertices. The bonds between and for are single. The last bond is double, with its arrow pointing from the long root toward the short root . For the Extended Dynkin diagram, add at the other end, doubly bonded to , with arrow toward . The following Cn Dynkin diagrams include both ends and the low-rank cases.
Finite and extended Cn Dynkin diagrams with arrows toward the short roots and separate rank-one and rank-two cases
. Details. At , there is just the root and one finite vertex. The affine Cartan matrix is ; its two vertices have equal root length, so the double bond has no arrow.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 1 5 Solution Created 2026-10-03 Updated 2026-10-14
Here root systems are finite, reduced and crystallographic, as for complex semisimple Lie algebras. For a base of a root system , the Dynkin diagram has one vertex for each simple root. Two distinct vertices have bonds, with the arrow on a multiple bond pointing toward the shorter root. The classification of finite crystallographic Dynkin diagrams consists of the following connected diagrams; the integers describing arms count vertices away from the unique branching vertex.
- (): a chain with only single bonds.
- (): a chain with one double bond at an end; that end is short.
- (): the same bond pattern, but that end is long. The rank-two system is ; .
- (): a simply laced tree with three arms of lengths .
- : simply laced trees with three arms respectively of lengths , and .
- : a four-vertex chain, with single, double, single bonds in order, and two long roots adjacent on one side of the middle bond and two short roots on the other.
- : two vertices joined by a triple bond, one long and one short.
This is classification up to diagram isomorphism and overall rescaling of the root system. It includes the conventional identifications and when those low-rank notations are used. The weighting here encodes root lengths and bonds; it is not the separate theory of vertex labels attached to nilpotent orbits. Dropping the crystallographic or reduced hypothesis changes the classification.
Precisely, a base of a root system is a vector-space basis such that each root has a unique expansion , with integer coefficients all nonnegative or all nonpositive. This defines the positive and negative roots. We use the column-coroot convention for the Cartan matrix:Some conventions transpose this matrix; specifying which index labels the coroot resolves that difference. The Weyl group is the subgroup of orthogonal transformations generated by the Weyl reflections
For the C3 root system, take an orthonormal basis of andThere are six long roots of squared length and twelve short roots of squared length . A base is , , . The Cartan matrix convention for C3 above givesThus the double bond connects to , with its arrow directed toward .
An explicit complex Lie algebra realizing this root system is the symplectic Lie algebraIt is closed under commutators, since the two identities , imply . Equivalently,so its dimension is . A Cartan subalgebra isWith denoting a matrix unit, the root spaces have generators for (), for (), and for ; the analogous lower-left generators give the negative roots. These are all eighteen root spaces, each one-dimensional, and together with they exhaust the algebra.
For an explicit semisimplicity check, let be an ideal. Simultaneous diagonalization of makes a sum of its intersections with and these root spaces. If it contains a nonzero , some root has , and supplies a root vector in . Thus always contains a root vector. Bracket it with its opposite root vector to obtain a nonzero coroot . Whenever , bracketing with either or puts both root spaces into . The graph of the roots with edges for nonzero inner products is connected: connects to , which connects to , and every short root connects to an axis root. Repeating the argument yields all root spaces and then all of from their brackets. Hence : the constructed algebra is simple, and therefore semisimple.
The reflections in and exchange adjacent coordinates, while reflection in changes the sign of the third coordinate. They generate every signed permutation. Conversely reflection in any displayed root is a signed permutation. ThusThe reflecting hyperplanes are and . A fundamental open Weyl chamber is . Every regular point has three nonzero coordinates of distinct absolute values; its signs and the ordering of those absolute values specify exactly one of the chambers. The closure of this chamber is generated by the rays through , and . This is the Weyl chamber geometry of C3.
C3 roots and the spherical tessellation into 48 Weyl chambers
. Details. The left panel retains the actual long and short root lengths. The right panel radially projects a hemisphere of the unit sphere, draws every visible reflecting great-circle arc, and highlights the chamber . Each spherical triangle is the section of a three-dimensional chamber by the sphere; opposite triangles on the rear hemisphere supply the remaining chambers. Roots of a root system are normal to the chamber walls, rather than generally lying along their edges.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 2 4 Solution Created 2026-10-03 Updated 2026-10-14
The appropriate abstract object is a finite reduced crystallographic root system in a real inner product space . Its axioms are: is finite, spans , and does not contain zero; for , ; each root reflectionpermutes ; and every Cartan integer is an integer. The restriction to a reduced root system and crystallographic integrality distinguishes roots of complex semisimple Lie algebras from more general reflection configurations.
For any two roots of a root system, the Cauchy-Schwarz inequality givesIf the inner product is zero, both Cartan integers vanish. Otherwise their signs agree, and the absolute value of each is a positive integer. Dividing their product by an integer of absolute value at least one provesFor nonproportional roots the product is strictly less than four. In a reduced root system, proportional roots are just and have Cartan integers , so the printed bound is intentionally looser than the resulting bound of three.
A fundamental system of a root system is a basis of made of roots, such that each root is an integer combination of with either all coefficients nonnegative or all nonpositive. Its members are the simple roots. Suppose distinct had . Thenhas a positive coefficient of and a negative coefficient of , contradicting the defining sign condition. Thus . Distinct simple roots are linearly independent, so their Cartan-integer product is strictly less than four. Combining integrality and the sign condition givesHere nonpositive is the intended sense of the printed convention that includes zero among “negative” numbers; orthogonal simple roots really do give zero.
To form a Dynkin diagram, place a vertex at each simple root. Join two vertices by bonds, hence zero, one, two or three. A multiple bond has an arrow toward the short root. Indeed determines the squared length ratio, and the diagram with the Cartan matrix reconstructs the angles and relative lengths. A single bond joins equal-length roots.
The connected finite Dynkin diagrams are the following. The descriptions include bond multiplicities and arrow directions, so distinguish dual diagrams:
- An Dynkin diagram, for : a chain of vertices with only single bonds.
- Bn Dynkin diagram and affine extension, for : a chain whose last bond is double, with its arrow toward the terminal short root; all earlier bonds are single. Only its finite diagram is used here.
- Cn Dynkin diagram, for : the same chain with the double-bond arrow toward the penultimate short root and away from the terminal long root. and describe the same rank-two type after relabelling.
- Dn Dynkin diagram, for : a simply laced tree with one trivalent vertex and arms of lengths , counting edges.
- En Dynkin diagram, : simply laced trees with a trivalent vertex and arms of lengths respectively , , .
- F4 Dynkin diagram, : a chain of four vertices, with a double central bond and two single outer bonds. Two consecutive vertices are long and two are short; the arrow goes from the long pair toward the short pair.
- G2 Dynkin diagram, : two vertices joined by a triple bond, with arrow toward the short root.
There are no other connected finite Dynkin diagrams. Low-rank conventions also identify and ; is disconnected, so introduces no further connected type. Affine diagrams are outside this finite classification.
Finally suppose the underlying graph contained a cycle on distinct simple roots . Put . Any bonded pair hasand all other distinct pairs have nonpositive inner products. The cycle contributes at least bonded pairs, soBut the simple roots, and hence these normalized vectors, are linearly independent, making the displayed sum nonzero. Positive definiteness gives a contradiction. Thus the underlying graph of a finite Dynkin diagram has no cycle. This acyclicity of a finite Dynkin diagram argument also excludes cycles with extra chords or multiple bonds; multiple bonds themselves are not treated as two-edge cycles.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 102 3 i Solution Created 2026-10-03 Updated 2026-10-14
The PDF's is the anti-diagonal identity matrix. Write and . Its diagonal Cartan subalgebra consists ofThe defining matrix identity says . The root spaces have the following root vectors, together with their opposites:The negative short root has vector . Hence the root-space decomposition is , each root space is one-dimensional, and the Bn root system isThere are roots and zero-weight dimensions, giving as a check. Upper triangular matrices giveFor , the highest root is . The fundamental weights and Weyl vector areThese weights pair to with the simple coroots; summing the positive roots gives the displayed .
The Dynkin diagram is the chain , with single edges except a double edge between and , whose arrow points to the short root . In the Extended Dynkin diagram, attaches by a single edge to when . For , both long nodes have a double edge to the short node . The Bn Dynkin diagram and affine extension below distinguishes these small-rank cases.
Ordinary and affine Dynkin diagrams of type B
. Details. For , the system is : , , . Its ordinary diagram is one node; its affine diagram has two equal-length nodes with the usual affine double bond.







