Citation for published version (APA): Nutma, T. A. (2010). Kac-Moody Symmetries and Gauged Supergravity Groningen: s.n.

Similar documents
Chapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations

Twenty-fourth Annual UNC Math Contest Final Round Solutions Jan 2016 [(3!)!] 4

On the isomorphism problem of Coxeter groups and related topics

MAS336 Computational Problem Solving. Problem 3: Eight Queens

Permutation group and determinants. (Dated: September 19, 2018)

17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.

28,800 Extremely Magic 5 5 Squares Arthur Holshouser. Harold Reiter.

Jordan Algebras and the Exceptional Lie algebra f 4

Cartan Involutions and Cartan Decompositions of a Semi-Simple Lie Algebra

Permutation Groups. Definition and Notation

NON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday

(Refer Slide Time: 01:45)

RIGIDITY OF COXETER GROUPS AND ARTIN GROUPS

On the isomorphism problem for Coxeter groups and related topics

Game Theory and Randomized Algorithms

Constructions of Coverings of the Integers: Exploring an Erdős Problem

1 = 3 2 = 3 ( ) = = = 33( ) 98 = = =

Permutations. = f 1 f = I A

Launchpad Maths. Arithmetic II

The Sign of a Permutation Matt Baker

EFFECTS OF PHASE AND AMPLITUDE ERRORS ON QAM SYSTEMS WITH ERROR- CONTROL CODING AND SOFT DECISION DECODING

Quotients of the Malvenuto-Reutenauer algebra and permutation enumeration

Supporting medical technology development with the analytic hierarchy process Hummel, Janna Marchien

Know how to represent permutations in the two rowed notation, and how to multiply permutations using this notation.

Two-person symmetric whist

On uniquely k-determined permutations

Computational aspects of two-player zero-sum games Course notes for Computational Game Theory Section 3 Fall 2010

Sets. Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 6, Outline Sets Equality Subset Empty Set Cardinality Power Set

Multiple Input Multiple Output (MIMO) Operation Principles

Error-Correcting Codes

Non-overlapping permutation patterns

Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility

Mathematics of Magic Squares and Sudoku

Problem 2A Consider 101 natural numbers not exceeding 200. Prove that at least one of them is divisible by another one.

A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP

Convexity Invariants of the Hoop Closure on Permutations

Lesson 16: The Computation of the Slope of a Non Vertical Line

It is important that you show your work. The total value of this test is 220 points.

Lecture 2.3: Symmetric and alternating groups

MATH302: Mathematics & Computing Permutation Puzzles: A Mathematical Perspective

The Fano Plane as an Octonionic Multiplication Table

37 Game Theory. Bebe b1 b2 b3. a Abe a a A Two-Person Zero-Sum Game

Permutation groups, derangements and prime order elements

Recovery and Characterization of Non-Planar Resistor Networks

A theorem on the cores of partitions

Hybrid Halftoning A Novel Algorithm for Using Multiple Halftoning Techniques

Final Practice Problems: Dynamic Programming and Max Flow Problems (I) Dynamic Programming Practice Problems

Counting Cube Colorings with the Cauchy-Frobenius Formula and Further Friday Fun

Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings

MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups.

and problem sheet 7

Permutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors.

arxiv: v2 [cs.cc] 18 Mar 2013

Examples: Find the domain and range of the function f(x, y) = 1 x y 2.

Topic 1: defining games and strategies. SF2972: Game theory. Not allowed: Extensive form game: formal definition

2.1 Partial Derivatives

Community Detection and Labeling Nodes

Aesthetically Pleasing Azulejo Patterns

Caltech Harvey Mudd Mathematics Competition February 20, 2010

How to divide things fairly

Introduction to Computational Manifolds and Applications

University of Groningen. On vibration properties of human vocal folds Svec, Jan

Outline. Sets of Gluing Data. Constructing Manifolds. Lecture 3 - February 3, PM

The meaning of a good safe port and berth in a modern shipping world Kharchanka, Andrei

Generalized DC-link Voltage Balancing Control Method for Multilevel Inverters

Latin Squares for Elementary and Middle Grades

MATH 12 CLASS 9 NOTES, OCT Contents 1. Tangent planes 1 2. Definition of differentiability 3 3. Differentials 4

A variation on the game SET

A Group-theoretic Approach to Human Solving Strategies in Sudoku

Solution: This is sampling without repetition and order matters. Therefore

arxiv: v1 [cs.cc] 21 Jun 2017

GOLDEN AND SILVER RATIOS IN BARGAINING

arxiv: v3 [math.co] 4 Dec 2018 MICHAEL CORY

THE SIGN OF A PERMUTATION

SF2972: Game theory. Introduction to matching

University of Groningen. Synergetic tourism-landscape interactions Heslinga, Jasper

Combinatorics and Intuitive Probability

Modular Arithmetic. Kieran Cooney - February 18, 2016

ORTHOGONAL space time block codes (OSTBC) from

PD-SETS FOR CODES RELATED TO FLAG-TRANSITIVE SYMMETRIC DESIGNS. Communicated by Behruz Tayfeh Rezaie. 1. Introduction

Wythoff s Game. Kimberly Hirschfeld-Cotton Oshkosh, Nebraska

Contents. MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes. 1 Wednesday, August Friday, August Monday, August 28 6

ARRAY PROCESSING FOR INTERSECTING CIRCLE RETRIEVAL

The Place of Group Theory in Decision-Making in Organizational Management A case of 16- Puzzle

Generalized PSK in space-time coding. IEEE Transactions On Communications, 2005, v. 53 n. 5, p Citation.

CIS 2033 Lecture 6, Spring 2017

University of Groningen. The social impacts of large projects on Indigenous Peoples Hanna de Almeida Oliveira, Philippe

Lecture 4 : Monday April 6th

8.EE. Development from y = mx to y = mx + b DRAFT EduTron Corporation. Draft for NYSED NTI Use Only

Quarter Turn Baxter Permutations

G 1 3 G13 BREAKING A STICK #1. Capsule Lesson Summary

NSCAS - Math Table of Specifications

Citation for published version (APA): Huitsing, G. (2014). A social network perspective on bullying [Groningen]: University of Groningen

Bit Error Probability Computations for M-ary Quadrature Amplitude Modulation

Crossing Game Strategies

EXPLAINING THE SHAPE OF RSK

Nonuniform multi level crossing for signal reconstruction

Rotational Puzzles on Graphs

A PageRank Algorithm based on Asynchronous Gauss-Seidel Iterations

TILING RECTANGLES AND HALF STRIPS WITH CONGRUENT POLYOMINOES. Michael Reid. Brown University. February 23, 1996

Transcription:

University of Groningen Kac-Moody Symmetries and Gauged Supergravity Nutma, Teake IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please check the document version below. Document Version Publisher's PDF, also known as Version of record Publication date: 2010 Link to publication in University of Groningen/UMCG research database Citation for published version (APA): Nutma, T. A. (2010). Kac-Moody Symmetries and Gauged Supergravity Groningen: s.n. Copyright Other than for strictly personal use, it is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license (like Creative Commons). Take-down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Downloaded from the University of Groningen/UMCG research database (Pure): http://www.rug.nl/research/portal. For technical reasons the number of authors shown on this cover page is limited to 10 maximum. Download date: 23-11-2018

3 Visualizations From time to time, it is convenient to draw a picture of a Lie algebra or one of its representations. Besides from looking nice, a picture can display their structure at a glance. For instance, both the symmetry of the root system and the height of the roots of A 2 are immediately clear from Figure 3.1, which displays the projection we already encountered in chapter 2. In fact, Figure 3.1 preserves the structure of A 2 exactly. This is possible because the root space of A 2 is two-dimensional. When the rank of the algebra is bigger than two, projections onto two dimensions of the root or weight space loose some of the information. It is then no longer possible to capture both the ordering in height and the full symmetry into one image. What one can do, however, is do one projection that preserves the ordering in height, and another that preserves (some part of) the symmetry. The former can be achieved with a Hasse diagram, and the latter with a Coxeter projection. 3.1 Hasse diagrams A Hasse diagram is a graph that displays the ordering between the different elements of a set [12, 33], which in our case are the roots of a root system. An example of

54 Chapter 3 Visualizations α 1 + α 2 α 1 α 2 α 2 α 1 α 1 α 2 Figure 3.1: The root system of A 2. a Hasse diagram is given in Figure 3.2. Below I will give the precise definition of a Hasse diagram, and a procedure for drawing them. The root system can be promoted to an ordered set (, ) if we introduce the following partial ordering. A root α is said to be bigger than β if their difference is positive: α β if α β Q +. (3.1) Thus α β has to be a non-negative combination of simple roots. If it is not, the two roots are incomparable. In addition to the partial ordering we need to introduce a so-called cover relation. A root α is said to cover β if there is no root γ smaller than α and bigger than β: α β if γ : α γ β. (3.2) For roots this means that one root covers the other only if their difference is one single simple root. With these two relations, a Hasse diagram of can now be drawn according to the following rules: If α β the vertical coordinate for β is less than that for α. If α β there is a straight line connecting α and β. Because α β implies ht(α) > ht(β), the first criterion is satisfied if we assign the vertical coordinate according to the height of the roots. The second criterion is equivalent to drawing straight lines for every fundamental Weyl reflections, as these are used to construct the root system in the first place (see subsection 2.1.6). What remains to be done is to determine the horizontal coordinate for each root. Although there are various algorithms with varying degree of complexity available (see for example [33]), the following simple recipe works fairly well for root systems.

3.1 Hasse diagrams 55 (1,1) (1,0) (0,1) Figure 3.2: Hasse diagram of the positive roots of A 2. The numbers (m 1, m 2 ) denote the root vector. The first step is to distribute the simple roots evenly on a horizontal line around the origin. This is achieved by the following horizontal projection P x of the simple roots α i : P x (α i ) = i 1 n 1 1 2 x i, (3.3) where n is the rank of the Lie algebra. The horizontal position of a generic root α = m i α i can now be defined as P x (α) = m i P x (α i ) = m i x i. (3.4) Note that the explicit summation of the index i has been dropped. From now on, any contracted index will be summed over. We can formalize the above a bit by introducing a projection vector ϕ that satisfies (α i ϕ) = x i. (3.5) Expanded in the basis of simple co-roots, the projection vector ϕ explicitly reads ϕ = (A 1 ) ij x j α i. (3.6) When we take its inner product with a generic root α, we see that it indeed gives us the desired projection (3.4): (α ϕ) = m i x i. The complete projection P = (P x, P y ) can then be written as P x (α) = (α ϕ), P y (α) = (α ρ ), (3.7a) (3.7b) where the projection in the vertical coordinate y is just the height of the root. Note that the horizontal coordinate (3.3) of a simple root α i strongly depends on its number i. If the order of the simple roots is changed, the Hasse diagram changes shape too. The best looking diagrams are produced when the ordering of nodes in the Dynkin diagram (and thus the ordering of simple roots) matches the connections between the nodes. See also Figure 3.3.

56 Chapter 3 Visualizations (1,1,1,1) (1,1,1,1) (1,1,1,0) (0,1,1,1) (1,1,1,0) (1,1,0,1) (0,1,1,0) (1,1,0,0) (0,0,1,1) (1,1,0,0) (1,0,1,0) (0,1,0,1) (1,0,0,0) (0,0,0,1) (1,0,0,0) (0,0,0,1) (0,1,0,0) (0,0,1,0) (0,1,0,0) (0,0,1,0) 1 2 3 4 3 1 2 4 Figure 3.3: Two Dynkin diagrams (below) and Hasse diagrams (above) of the same Lie algebra, A 4. The ordering of nodes in the left Dynkin diagram, indicated with numbers below the nodes, is canonical. The ordering of nodes in the right Dynkin diagram does not match the connections between them, resulting in a Hasse diagram with crossing lines. The lines drawn in a Hasse diagram represent the Weyl reflections in the simple roots. Say there is a root α projected to the point (x, y). Then the root α + α i connected to it by the line of the fundamental Weyl reflection w i gets projected to the point (x + x i, y + 1). The line of a fundamental reflection is therefore drawn at an angle φ given by φ wi = tan 1 1 x i. (3.8) Because x i is unique for all i, the n distinct fundamental reflections w i all are drawn at different angles, and reflections in the same simple root are drawn parallel. To distinguish between them even further they will get drawn in different colors, ranging from blue (the first fundamental reflection) to red (the n th ). The Hasse diagram of the full root system is symmetric around the origin, because of the Chevalley involution (2.21). It is therefore customary to draw only the positive roots in a Hasse diagram. Following the above procedure it is straightforward, though sometimes tedious, to draw a Hasse diagrams of any root system. Figure 3.4 displays for example the Hasse diagrams of various root systems.

3.1 Hasse diagrams 57 (a) (b) (c) (d) Figure 3.4: Hasse diagram of the positive roots of (a) E 8, (b) E 7, (c) E 6, and (d) D 5. The last three are subdiagrams of the E 8 diagram. The colors of the Weyl reflections are chosen such that they match their embedding within E 8.

58 Chapter 3 Visualizations ad e1 ad e2 ad e3 ad e4 (a) Legend [e 1, e 2] [e 2, e 3] [e 3, e 4] [e 1, [ee 12, e 3]] e 2 e 3 [e 2, [ee 43, e 4]] (b) Positive Chevalley generators (c) Single commutators [e 1, [e 2, [e 3, e 4]]] [e 1, [e 2, e 3]] [e 2, [e 3, e 4]] [e 1, e 2] [e 3, e 4] (d) Double commutators (e) Triple commutators Figure 3.5: The Serre construction for A 4. 3.1.1 Visualizing the Serre construction Hasse diagrams can serve as a neat tool to visualize the results of the Serre construction, the step-by-step construction of the full algebra from the Cartan matrix (see Example 2.2). One then has to interpret the points in the diagram not as roots, but as the generator they belong to. Furthermore, the lines can then be interpreted as the adjoint action of the respective positive Chevalley generators. Starting at the bottom, the vertical steps in the diagram then represent the steps of the Serre construction. Figure 3.5 displays the Serre construction for the Lie algebra A 4. One starts out with just the positive Chevalley generators (Figure 3.5b). The first step is to take all (single) commutators [e i, e j ] of the positive Chevalley generators that are consistent with the Chevalley relations (2.16), the Serre relations (2.17), and the Jacobi identity (2.3), which results in Figure 3.5c. This procedure is then iterated (Figure 3.5d and 3.5e) until it no longer yields new generators. The analogy presented above is only valid up to a certain point. The Serre

3.2 Coxeter projections 59 construction can give you all the Lie brackets of the algebra, whereas the Hasse diagram does not contain this information. Also, if the multiplicity of a root α is greater than one, Hasse diagrams do not distinguish between the different generators of the root space g α. 3.2 Coxeter projections Where Hasse diagrams try to visualize the ordering of the root system, Coxeter projections try to visualize its symmetry. The problem is that the full symmetry of a root system is only revealed in a space of dimension n, which is the rank of the algebra. What one can do for finite-dimensional Lie algebras, however, is project this n-dimensional space onto a carefully chosen 2-dimensional hyperplane such that the projection preserves a part of the full symmetry. The hyperplane in question is known as a Coxeter plane [47, 84, 16]. 3.2.1 The Coxeter plane The Coxeter plane can only be defined for finite-dimensional Lie algebras. In order to introduce it, we must first define a distinguished element of the Weyl group, known as the Coxeter element, w c. It is given by the product of all fundamental Weyl reflections: n w c = w i. (3.9) i=1 The Coxeter element is not unique, but depends on the choice of basis of the root system and the ordering of the above product. However, all Coxeter elements are conjugate to each other in the Weyl group, which implies they share the same properties. In particular, the order of the Coxeter element is always equal to the Coxeter number g of the Lie algebra (2.61a). Thus g is the smallest possible integer such that (w c ) g = 1. (3.10) Furthermore, it can be shown that w c has exactly one eigenvalue equal to e 2πi g [16]. The corresponding (complex) eigenvector will be denoted by z: w c (z) = e 2πi g z (3.11) Recall that the inner product is associative with respect to Weyl reflections, that is, (w(α) β) = (α w(β)). So upon considering the inner product between z and the action of w c on a generic root, it follows that (w c (α) z) = (α w c (z)) = e 2πi g (α z). (3.12)

60 Chapter 3 Visualizations Thus when projected onto z, the Coxeter element acts as ( 1 g )th of a rotation on all roots. This leads us to the concept of a Coxeter plane C, which is spanned by the real and imaginary parts of z: where C = Rx c + Ry c, (3.13) x c = Re z, y c = Im z. (3.14a) (3.14b) A Coxeter projection is the projection of a root system onto its Coxeter plane. Its horizontal and vertical components are respectively given by P x (α) = (α x c ), P y (α) = (α y c ). (3.15a) (3.15b) Following [84] we will draw lines between roots that are nearest neighbors. That is, we will draw a line between roots α and β if their distance (α β α β) is minimal. The coloring of the lines depends only on their maximal distance from the origin in the projected graph. Coxeter projections preserve the g-fold rotational symmetry of the root system, which is generically only a small part of its complete symmetry. Nonetheless the resulting graph can display a rich structure, as for example the E 8 Coxeter plane does (Figure 3.6). Note that the Coxeter projection is always mirror symmetric in the origin, because the negative roots project as P( α) = P(α). This effectively doubles the rotational symmetry from g-fold to 2g-fold for Lie algebras whose Coxeter number is odd. For more Coxeter projections, see Appendix B.

3.2 Coxeter projections 61 Figure 3.6: Coxeter projection of the roots of E 8.

62 Chapter 3 Visualizations Example 3.1: Coxeter projection of A 2 When acting on a root vector m i, the Weyl reflections can be written as n n matrices. By equation (2.69), the two fundamental Weyl reflections of A 2 are ( ) 1 1 w 1 =, (3.16a) 0 1 ( ) 1 0 w 2 =. (3.16b) 1 1 The Coxeter element w c is the product of the two, ( ) 0 1 w c = w 1w 2 =. (3.17) 1 1 We re looking for an eigenvector of w c that has an eigenvalue of e 2πi 3, since the Coxeter number of A 2 is g = 1 + (ρ α 1 + α 2) = 3. The eigenvector z is ( ) 1 + i 3 z =. (3.18) 2 Expanded in terms of components, the horizontal and vertical projections of a root α with root vector m i then respectively read P x(α) = A ijm i x j c = 3m 2, P y(α) = A ijm i y j c = 3(2m 1 m 2 ). Doing this projection for all roots of A 2 results in the following picture: (3.19a) (3.19b) α 1 α 2 α 1 + α 2 α 1 α 2 α 2 α 1 Not surprisingly, this is the same old picture of the root system we have seen before, but now rotated over an angle of 60 degrees. The lines between the roots indicate the nearest neighbour pairs.

3.2 Coxeter projections 63 3.2.2 Projections to subalgebras The discussion in subsection 3.2.1 is only valid for finite-dimensional Lie algebras. Although the Coxeter element can be defined for infinite-dimensional Lie algebras in a similar way, it no longer has the nice properties its finite-dimensional counterpart has. For instance, it does not have an eigenvalue of e 2πi g. One reason for this is that the Coxeter number is ill-defined, because infinite Lie algebras do not have a highest root. A notable exception are the affine Lie algebras: despite the fact that they are infinite, one is still able to define a Coxeter number and do a Coxeter projection. More on this in section 4.1. However, it is possible to project the root system of an infinite-dimensional Lie algebra onto the Coxeter plane of a finite subalgebra s. The finite subalgebra can be specified by picking a subset α s (s = 1,..., n m) of the simple roots α i such that α s generate a finite root system. The Coxeter element of s, denoted by w sub is then c, n m wc sub = w s. (3.20) Its order is equal to g sub, the Coxeter number of s. The rest of analysis follows the same lines as that of subsection 3.2.1. A projection onto a Coxeter plane of a subalgebra can be viewed as a level decomposition of the whole Coxeter projection. For more on level decompositions, see section 4.3. The resulting graph consists of Coxeter projections of representations of the subalgebra, stacked on top of each other. This procedure is of course not limited to infinite Lie algebras, but can also be done for finite cases. For example, in Figure 3.7 the root system of E 8 is projected onto the Coxeter plane of an A 7 subalgebra. Subalgebra projections display the g sub -fold rotational symmetry of the subalgebra. As g > g sub, the resulting picture is less symmetric than the full projection. s=1

64 Chapter 3 Visualizations (a) The full subalgebra projection. (b) Level 0 (c) Level 1 (d) Level 2 (e) Level 3 Figure 3.7: Projection of E 8 onto the Coxeter plane of an A 7 subalgebra, split into the contributions of A 7 representations at different levels.