Coxeter–Dynkin diagram

Coxeter–Dynkin diagrams for the fundamental finite Coxeter groups

Coxeter–Dynkin diagrams for the fundamental affine Coxeter groups

In geometry, a Coxeter–Dynkin diagram (or Coxeter diagram, Coxeter graph) is a graph with numerically labeled edges (called branches) representing a Coxeter group or sometimes a uniform polytope or uniform tiling constructed from the group.

A class of closely related objects is the Dynkin diagrams, which differ from Coxeter diagrams in two respects: firstly, branches labeled "Template:Math" or greater are directed, while Coxeter diagrams are undirected; secondly, Dynkin diagrams must satisfy an additional (crystallographic) restriction, namely that the only allowed branch labels are Template:Math and Template:Math Dynkin diagrams correspond to and are used to classify root systems and therefore semisimple Lie algebras.

Description

A Coxeter group is a group that admits a presentation: $$⟨r_0,r_1,\dots ,r_n\mid (r_i{r}_j{)}^{m_{i,j}}=1⟩$$ where the Template:Mvar are integers that are elements of some symmetric matrix Template:Mvar which has Template:Maths on its diagonal. (Thus each generator $r_i$ has order 2.)Template:Efn This matrix Template:Mvar, the Coxeter matrix, completely determines the Coxeter group.

Since the Coxeter matrix is symmetric, it can be viewed as the adjacency matrix of an edge-labeled graph that has vertices corresponding to the generators Template:Mvar, and edges labeled with Template:Mvar between the vertices corresponding to Template:Mvar and Template:Mvar. In order to simplify these diagrams, two changes can be made:

• Edges that are labeled with Template:Math can be omitted, with the missing edges being implied to be Template:Maths. A label Template:Math indicates that the corresponding two generators commute; Template:Math is the smallest number that can be used to label an edge.
• Edges labeled Template:Math can be left unlabeled, with the implication that an unlabeled edge acts as a Template:Math.

The resulting graph is a Coxeter-Dynkin diagram that describes the considered Coxeter group.

Schläfli matrix

Every Coxeter diagram has a corresponding Schläfli matrix (so named after Ludwig Schläfli), Template:Math with matrix elements Template:Math where Template:Mvar is the branch order between mirrors Template:Mvar and Template:Math that is, Template:Math is the dihedral angle between mirrors Template:Mvar and Template:Mvar As a matrix of cosines, Template:Mvar is also called a Gramian matrix. All Coxeter group Schläfli matrices are symmetric because their root vectors are normalized. Template:Mvar is closely related to the Cartan matrix, used in the similar but directed graph: the Dynkin diagram, in the limited cases of Template:Math and Template:Math which are generally not symmetric.

The determinant of the Schläfli matrix is called the Schläflian;Template:Cn the Schläflian and its sign determine whether the group is finite (positive), affine (zero), or indefinite (negative). This rule is called Schläfli's Criterion.Template:Failed verification Template:^

The eigenvalues of the Schläfli matrix determine whether a Coxeter group is of finite type (all positive), affine type (all non-negative, at least one is zero), or indefinite type (otherwise). The indefinite type is sometimes further subdivided, e.g. into hyperbolic and other Coxeter groups. However, there are multiple non-equivalent definitions for hyperbolic Coxeter groups. We use the following definitions:

• A Coxeter group with connected diagram is hyperbolic if it is neither of finite nor affine type, but every proper connected subdiagram is of finite or affine type.
• A hyperbolic Coxeter group is compact if all its subgroups are finite (i.e. have positive determinants), and paracompact if all its subgroups are finite or affine (i.e. have nonnegative determinants).

Finite and affine groups are also called elliptical and parabolic respectively. Hyperbolic groups are also called Lannér, after F. Lannér who enumerated the compact hyperbolic groups in 1950, and Koszul (or quasi-Lannér) for the paracompact groups.

Rank 2 Coxeter groups

The type of a rank Template:Math Coxeter group, i.e. generated by two different mirrors, is fully determined by the determinant of the Schläfli matrix, as this determinant is simply the product of the eigenvalues: finite (positive determinant), affine (zero determinant), or hyperbolic (negative determinant) type. Coxeter uses an equivalent bracket notation which lists sequences of branch orders as a substitute for the node-branch graphic diagrams. Rational solutions Template:Math Template:CDD, also exist, with [[Greatest common divisor|Template:Math]]Template:Math these define overlapping fundamental domains. For example, Template:Math and Template:Math

Type	Finite					Affine	Hyperbolic
Geometry					...
Coxeter diagram Bracket notation	Template:CDD [ ]	Template:CDD [2]	Template:CDD [3]	Template:CDD [4]	Template:CDD [p]	Template:CDD [∞]	Template:CDD [∞]	Template:CDD [iπ/λ]
Order	2	4	6	8	2p	∞
Mirror lines are colored to correspond to Coxeter diagram nodes. Fundamental domains are alternately colored.

Rank 2 Coxeter group diagrams
Order p	Group	Coxeter diagram		Schläfli matrix
				$\left[\begin{array}{cc}2& a_{12}\\ a_{21}& 2\end{array}\right]$	Determinant $(4-a_{21}{a}_{12})$
Finite (Determinant > 0)
2	I2(2) = A1×A1	Template:CDD	[2]	$\left[\begin{array}{cc}2& 0\\ 0& 2\end{array}\right]$	4
3	I2(3) = A2	Template:CDD	[3]	$\left[\begin{array}{cc}2& -1\\ -1& 2\end{array}\right]$	3
3/2		Template:CDD	[3/2]	$\left[\begin{array}{cc}2& 1\\ 1& 2\end{array}\right]$
4	I2(4) = B2	Template:CDD	[4]	$\left[\begin{array}{cc}2& -\sqrt{2}\\ -\sqrt{2}& 2\end{array}\right]$	2
4/3		Template:CDD	[4/3]	$\left[\begin{array}{cc}2& \sqrt{2}\\ \sqrt{2}& 2\end{array}\right]$
5	I2(5) = H2	Template:CDD	[5]	$\left[\begin{array}{cc}2& -\varphi \\ -\varphi & 2\end{array}\right]$	$(5-\sqrt{5})/2$ ≈ 1.38196601125
5/4		Template:CDD	[5/4]	$\left[\begin{array}{cc}2& \varphi \\ \varphi & 2\end{array}\right]$
5/2		Template:CDD	[5/2]	$\left[\begin{array}{cc}2& 1-\varphi \\ 1-\varphi & 2\end{array}\right]$	$(5+\sqrt{5})/2$ ≈ 3.61803398875
5/3		Template:CDD	[5/3]	$\left[\begin{array}{cc}2& \varphi -1\\ \varphi -1& 2\end{array}\right]$
6	I2(6) = G2	Template:CDD	[6]	$\left[\begin{array}{cc}2& -\sqrt{3}\\ -\sqrt{3}& 2\end{array}\right]$	1
6/5		Template:CDD	[6/5]	$\left[\begin{array}{cc}2& \sqrt{3}\\ \sqrt{3}& 2\end{array}\right]$
8	I2(8)	Template:CDD	[8]	$\left[\begin{array}{cc}2& -\sqrt{2+\sqrt{2}}\\ -\sqrt{2+\sqrt{2}}& 2\end{array}\right]$	$2-\sqrt{2}$ ≈ 0.58578643763
10	I2(10)	Template:CDD	[10]	$\left[\begin{array}{cc}2& -\sqrt{(5+\sqrt{5})/2}\\ -\sqrt{(5+\sqrt{5})/2}& 2\end{array}\right]$	$(3-\sqrt{5})/2$ ≈ 0.38196601125
12	I2(12)	Template:CDD	[12]	$\left[\begin{array}{cc}2& -\sqrt{2+\sqrt{3}}\\ -\sqrt{2+\sqrt{3}}& 2\end{array}\right]$	$2-\sqrt{3}$ ≈ 0.26794919243
p	I2(p)	Template:CDD	[p]	$\left[\begin{array}{cc}2& -2\cos (\pi /p)\\ -2\cos (\pi /p)& 2\end{array}\right]$	$4{\sin }^2(\pi /p)$
Affine (Determinant = 0)
∞	I2(∞) = ${\tilde{I}}_1$ = ${\tilde{A}}_1$	Template:CDD	[∞]	$\left[\begin{array}{cc}2& -2\\ -2& 2\end{array}\right]$	0
Hyperbolic (Determinant ≤ 0)
∞		Template:CDD	[∞]	$\left[\begin{array}{cc}2& -2\\ -2& 2\end{array}\right]$	0
∞		Template:CDD	[iπ/λ]	$\left[\begin{array}{cc}2& -2\cosh (2\lambda )\\ -2\cosh (2\lambda )& 2\end{array}\right]$	$-4{\sinh }^2(2\lambda )\le 0$

Geometric visualizations

The Coxeter–Dynkin diagram can be seen as a graphic description of the fundamental domain of mirrors. A mirror represents a hyperplane within a spherical, Euclidean, or hyperbolic space of given dimension. (In 2D spaces, a mirror is a line; in 3D, a mirror is a plane.)

These visualizations show the fundamental domains for 2D and 3D Euclidean groups, and for 2D spherical groups. For each, the Coxeter diagram can be deduced by identifying the hyperplane mirrors and labelling their connectivity, ignoring Template:Math-degree dihedral angles (order Template:Math see footnote [a] below).

Coxeter groups in the Euclidean plane with equivalent diagrams. Here, domain vertices are labeled as graph branches Template:Math etc., and are colored by their reflection order (connectivity). Reflections are labeled as graph nodes Template:Math etc. Reflections at Template:Math degrees are inactive in the sense that, together, they generate no new reflections;Template:Efn they are therefore not connected to each other by a branch on the diagram. Parallel mirrors are connected to each other by an Template:Math labeled branch. The square of the prismatic group ${\tilde{I}}_1$×${\tilde{I}}_1$ is shown as a doubling of the ${\tilde{C}}_2$ triangle around its Template:Math side*, but can also be created as a rectangular domain from doubling the ${\tilde{G}}_2$ triangle around its Template:Math side*. The ${\tilde{A}}_2$ triangle is a doubling of the ${\tilde{G}}_2$ triangle around its Template:Math side*. *(this side disappears by doubling around itself)
Many Coxeter groups in the hyperbolic plane can be extended from the Euclidean cases as a series of hyperbolic solutions.
Coxeter groups in 3-space with diagrams. Mirrors (triangle faces) are labeled by opposite vertex: Template:Math Branches are colored by their reflection order. ${\tilde{C}}_3$ fills Template:Math of the cube. ${\tilde{B}}_3$ fills Template:Math of the cube. ${\tilde{A}}_3$ fills Template:Math of the cube.	Coxeter groups in the sphere with equivalent diagrams. One fundamental domain is outlined in yellow. Domain vertices (and graph branches) are colored by their reflection order.

Application to uniform polytopes

In constructing uniform polytopes, nodes are marked as active by a ring if a generator point is off the mirror, creating a new edge between a generator point and its mirror image. An unringed node represents an inactive mirror that generates no new points. A ring with no node is called a hole.

Two orthogonal mirrors can be used to generate a square, Template:CDD, seen here with a red generator point and 3 virtual copies across the mirrors. The generator has to be off both mirrors in this orthogonal case to generate an interior. The ring markup presumes active rings have generators equal distance from all mirrors, while a rectangle can also represent a nonuniform solution.

Coxeter–Dynkin diagrams can explicitly enumerate nearly all classes of uniform polytope and uniform tessellations. Every uniform polytope with pure reflective symmetry (all but a few special cases have pure reflectional symmetry) can be represented by a Coxeter–Dynkin diagram with permutations of markups. Each uniform polytope can be generated using such mirrors and a single generator point: mirror images create new points as reflections, then polytope edges can be defined between points and a mirror image point. Faces are generated by the repeated reflection of an edge eventually wrapping around to the original generator; the final shape, as well as any higher-dimensional facets, are likewise created by the face being reflected to enclose an area.

To specify the generating vertex, one or more nodes are marked with rings, meaning that the vertex is not on the mirror(s) represented by the ringed node(s). (If two or more mirrors are marked, the vertex is equidistant from them.) A mirror is active (creates reflections) only with respect to points not on it. A diagram needs at least one active node to represent a polytope. An unconnected diagram (subgroups separated by order-2 branches, or orthogonal mirrors) requires at least one active node in each subgraph.

All regular polytopes, represented by Schläfli symbol Template:Math, can have their fundamental domains represented by a set of n mirrors with a related Coxeter–Dynkin diagram of a line of nodes and branches labeled by Template:Math with the first node ringed.

Uniform polytopes with one ring correspond to generator points at the corners of the fundamental domain simplex. Two rings correspond to the edges of simplex and have a degree of freedom, with only the midpoint as the uniform solution for equal edge lengths. In general k-ring generator points are on (k-1)-faces of the simplex, and if all the nodes are ringed, the generator point is in the interior of the simplex.

The special case of uniform polytopes with non-reflectional symmetry is represented by a secondary markup where the central dot of a ringed node is removed (called a hole). These shapes are alternations of polytopes with reflective symmetry, implying that every other vertex is deleted. The resulting polytope will have a subsymmetry of the original Coxeter group. A truncated alternation is called a snub.

• A single node represents a single mirror. This is called group A₁. If ringed this creates a line segment perpendicular to the mirror, represented as {}.
• Two unattached nodes represent two perpendicular mirrors. If both nodes are ringed, a rectangle can be created, or a square if the point is at equal distance from both mirrors.
• Two nodes attached by an order-n branch can create an n-gon if the point is on one mirror, and a 2n-gon if the point is off both mirrors. This forms the Template:Math group.
• Two parallel mirrors can represent an infinite polygon Template:Math group, also called Template:Math.
• Three mirrors in a triangle form images seen in a traditional kaleidoscope and can be represented by three nodes connected in a triangle. Repeating examples will have branches labeled as (3 3 3), (2 4 4), (2 3 6), although the last two can be drawn as a line (with the 2 branches ignored). These will generate uniform tilings.
• Three mirrors can generate uniform polyhedra; including rational numbers gives the set of Schwarz triangles.
• Three mirrors with one perpendicular to the other two can form the uniform prisms.

There are 7 reflective uniform constructions within a general triangle, based on 7 topological generator positions within the fundamental domain. Every active mirror generates an edge, with two active mirrors have generators on the domain sides and three active mirrors has the generator in the interior. One or two degrees of freedom can be solved for a unique position for equal edge lengths of the resulting polyhedron or tiling.

Example 7 generators on octahedral symmetry, fundamental domain triangle (4 3 2), with 8th snub generation as an alternation

The duals of the uniform polytopes are sometimes marked up with a perpendicular slash replacing ringed nodes, and a slash-hole for hole nodes of the snubs. For example, Template:CDD represents a rectangle (as two active orthogonal mirrors), and Template:CDD represents its dual polygon, the rhombus.

Examples with polyhedra and tilings

For example, the B₃ Coxeter group has a diagram: Template:CDD. This is also called octahedral symmetry.

There are 7 convex uniform polyhedra that can be constructed from this symmetry group and 3 from its alternation subsymmetries, each with a uniquely marked up Coxeter–Dynkin diagram. The Wythoff symbol represents a special case of the Coxeter diagram for rank 3 graphs, with all 3 branch orders named, rather than suppressing the order 2 branches. The Wythoff symbol is able to handle the snub form, but not general alternations without all nodes ringed. Template:Octahedral truncations

The same constructions can be made on disjointed (orthogonal) Coxeter groups like the uniform prisms, and can be seen more clearly as tilings of dihedrons and hosohedra on the sphere, like this [6]×[] or [6,2] family: Template:Hexagonal dihedral truncations

In comparison, the [6,3], Template:CDD family produces a parallel set of 7 uniform tilings of the Euclidean plane, and their dual tilings. There are again 3 alternations and some half symmetry version. Template:Hexagonal tiling table

In the hyperbolic plane [7,3], Template:CDD family produces a parallel set of uniform tilings, and their dual tilings. There is only 1 alternation (snub) since all branch orders are odd. Many other hyperbolic families of uniform tilings can be seen at uniform tilings in hyperbolic plane.

Very-extended Coxeter diagrams

One usage includes a very-extended definition from the direct Dynkin diagram usage which considers affine groups as extended, hyperbolic groups over-extended, and a third node as very-extended simple groups. These extensions are usually marked by an exponent of 1,2, or 3 + symbols for the number of extended nodes. This extending series can be extended backwards, by sequentially removing the nodes from the same position in the graph, although the process stops after removing branching node. The E₈ extended family is the most commonly shown example extending backwards from E₃ and forwards to E₁₁.

The extending process can define a limited series of Coxeter graphs that progress from finite to affine to hyperbolic to Lorentzian. The determinant of the Cartan matrices determine where the series changes from finite (positive) to affine (zero) to hyperbolic (negative), and ending as a Lorentzian group, containing at least one hyperbolic subgroup. The noncrystallographic H_n groups forms an extended series where H₄ is extended as a compact hyperbolic and over-extended into a lorentzian group.

The determinant of the Schläfli matrix by rank are:

• Template:Math
• Template:Math
• Template:Math
• Template:Math

Determinants of the Schläfli matrix in exceptional series are:

• Template:Math
• Template:Math
• Template:Math
• Template:Math
• Template:Math

Smaller extended series

Finite	$A_2$	$C_2$	$G_2$	$A_3$	$B_3$	$C_3$	$H_4$
Rank Template:Mvar	[3[3],3n−3]	[4,4,3n−3]	Gn=[6,3n−2]	[3[4],3n−4]	[4,31,n−3]	[4,3,4,3n−4]	Hn=[5,3n−2]
2	[3] A2 Template:CDD	[4] C2 Template:CDD	[6] G2 Template:CDD		[2] A12 Template:CDD	[4] C2 Template:CDD	[5] H2 Template:CDD
3	[3[3]] $A_2^{+}={\tilde{A}}_2$ Template:CDD	[4,4] $C_2^{+}={\tilde{C}}_2$ Template:CDD	[6,3] $G_2^{+}={\tilde{G}}_2$ Template:CDD	[3,3]=A3 Template:CDD	[4,3] B3 Template:CDD	[4,3] C3 Template:CDD	[5,3] H3 Template:CDD
4	[3[3],3] $A_2^{++}={\bar{P}}_3$ Template:CDD	[4,4,3] $C_2^{++}={\bar{R}}_3$ Template:CDD	[6,3,3] $G_2^{++}={\bar{V}}_3$ Template:CDD	[3[4]] $A_3^{+}={\tilde{A}}_3$ Template:CDD	[4,31,1] $B_3^{+}={\tilde{B}}_3$ Template:CDD	[4,3,4] $C_3^{+}={\tilde{C}}_3$ Template:CDD	[5,3,3] H4 Template:CDD
5	[3[3],3,3] A2+++ Template:CDD	[4,4,3,3] C2+++ Template:CDD	[6,3,3,3] G2+++ Template:CDD	[3[4],3] $A_3^{++}={\bar{P}}_4$ Template:CDD	[4,32,1] $B_3^{++}={\bar{S}}_4$ Template:CDD	[4,3,4,3] $C_3^{++}={\bar{R}}_4$ Template:CDD	[5,33] H5=${\bar{H}}_4$ Template:CDD
6				[3[4],3,3] A3+++ Template:CDD	[4,33,1] B3+++ Template:CDD	[4,3,4,3,3] C3+++ Template:CDD	[5,34] H6 Template:CDD
Det(Template:Mvar)	3(3−n)	2(3−n)	3−n	4(4−n)	2(4−n)

Middle extended series

Finite	$A_4$	$B_4$	$C_4$	$D_4$	$F_4$	$A_5$	$B_5$	$D_5$
Rank Template:Mvar	[3[5],3n−5]	[4,3,3n−4,1]	[4,3,3,4,3n−5]	[3n−4,1,1,1]	[3,4,3n−3]	[3[6],3n−6]	[4,3,3,3n−5,1]	[31,1,3,3n−5,1]
3		[4,3−1,1] B2A1 Template:CDD	[4,3] B3 Template:CDD	[3−1,1,1,1] A13 Template:CDD	[3,4] B3 Template:CDD		[4,3,3] C3 Template:CDD
4	[33] A4 Template:CDD	[4,3,3] B4 Template:CDD	[4,3,3] C4 Template:CDD	[30,1,1,1] D4 Template:CDD	[3,4,3] F4 Template:CDD		[4,3,3,3−1,1] B3A1 Template:CDD	[31,1,3,3−1,1] A3A1 Template:CDD
5	[3[5]] $A_4^{+}={\tilde{A}}_4$ Template:CDD	[4,3,31,1] $B_4^{+}={\tilde{B}}_4$ Template:CDD	[4,3,3,4] $C_4^{+}={\tilde{C}}_4$ Template:CDD	[31,1,1,1] $D_4^{+}={\tilde{D}}_4$ Template:CDD	[3,4,3,3] $F_4^{+}={\tilde{F}}_4$ Template:CDD	[34] A5 Template:CDD	[4,3,3,3,3] B5 Template:CDD	[31,1,3,3] D5 Template:CDD
6	[3[5],3] $A_4^{++}={\bar{P}}_5$ Template:CDD	[4,3,32,1] $B_4^{++}={\bar{S}}_5$ Template:CDD	[4,3,3,4,3] $C_4^{++}={\bar{R}}_5$ Template:CDD	[32,1,1,1] $D_4^{++}={\bar{Q}}_5$ Template:CDD	[3,4,33] $F_4^{++}={\bar{U}}_5$ Template:CDD	[3[6]] $A_5^{+}={\tilde{A}}_5$ Template:CDD	[4,3,3,31,1] $B_5^{+}={\tilde{B}}_5$ Template:CDD	[31,1,3,31,1] $D_5^{+}={\tilde{D}}_5$ Template:CDD
7	[3[5],3,3] A4+++ Template:CDD	[4,3,33,1] B4+++ Template:CDD	[4,3,3,4,3,3] C4+++ Template:CDD	[33,1,1,1] D4+++ Template:CDD	[3,4,34] F4+++ Template:CDD	[3[6],3] $A_5^{++}={\bar{P}}_6$ Template:CDD	[4,3,3,32,1] $B_5^{++}={\bar{S}}_6$ Template:CDD	[31,1,3,32,1] $D_5^{++}={\bar{Q}}_6$ Template:CDD
8						[3[6],3,3] A5+++ Template:CDD	[4,3,3,33,1] B5+++ Template:CDD	[31,1,3,33,1] D5+++ Template:CDD
Det(Template:Mvar)	5(5−n)	2(5−n)		4(5−n)	5−n	6(6−n)	4(6−n)

Some higher extended series

Finite	$A_6$	$B_6$	$D_6$	$E_6$	$A_7$	$B_7$	$D_7$	$E_7$	$E_8$
Rank Template:Mvar	[3[7],3n−7]	[4,33,3n−6,1]	[31,1,3,3,3n−6,1]	[3n−5,2,2]	[3[8],3n−8]	[4,34,3n−7,1]	[31,1,3,3,3,3n−7,1]	[3n−5,3,1]	En=[3n−4,2,1]
3									[3−1,2,1] E3=A2A1 Template:CDD
4				[3−1,2,2] A22 Template:CDD				[3−1,3,1] A3A1 Template:CDD	[30,2,1] E4=A4 Template:CDD
5		[4,3,3,3,3−1,1] B4A1 Template:CDD	[31,1,3,3,3−1,1] D4A1 Template:CDD	[30,2,2] A5 Template:CDD				[30,3,1] A5 Template:CDD	[31,2,1] E5=D5 Template:CDD
6	[35] A6 Template:CDD	[4,34] B6 Template:CDD	[31,1,3,3,3] D6 Template:CDD	[31,2,2] E6 Template:CDD		[4,3,3,3,3,3−1,1] B5A1 Template:CDD	[31,1,3,3,3,3−1,1] D5A1 Template:CDD	[31,3,1] D6 Template:CDD	[32,2,1] E6 * Template:CDD
7	[3[7]] $A_6^{+}={\tilde{A}}_6$ Template:CDD	[4,33,31,1] $B_6^{+}={\tilde{B}}_6$ Template:CDD	[31,1,3,3,31,1] $D_6^{+}={\tilde{D}}_6$ Template:CDD	[32,2,2] $E_6^{+}={\tilde{E}}_6$ Template:CDD	[36] A7 Template:CDD	[4,35] B7 Template:CDD	[31,1,3,3,3,30,1] D7 Template:CDD	[32,3,1] E7 * Template:CDD	[33,2,1] E7 * Template:CDD
8	[3[7],3] $A_6^{++}={\bar{P}}_7$ Template:CDD	[4,33,32,1] $B_6^{++}={\bar{S}}_7$ Template:CDD	[31,1,3,3,32,1] $D_6^{++}={\bar{Q}}_7$ Template:CDD	[33,2,2] $E_6^{++}={\bar{T}}_7$ Template:CDD	[3[8]] $A_7^{+}={\tilde{A}}_7$ * Template:CDD	[4,34,31,1] $B_7^{+}={\tilde{B}}_7$ * Template:CDD	[31,1,3,3,3,31,1] $D_7^{+}={\tilde{D}}_7$ * Template:CDD	[33,3,1] $E_7^{+}={\tilde{E}}_7$ * Template:CDD	[34,2,1] E8 * Template:CDD
9	[3[7],3,3] A6+++ Template:CDD	[4,33,33,1] B6+++ Template:CDD	[31,1,3,3,33,1] D6+++ Template:CDD	[34,2,2] E6+++ Template:CDD	[3[8],3] $A_7^{++}={\bar{P}}_8$ * Template:CDD	[4,34,32,1] $B_7^{++}={\bar{S}}_8$ * Template:CDD	[31,1,3,3,3,32,1] $D_7^{++}={\bar{Q}}_8$ * Template:CDD	[34,3,1] $E_7^{++}={\bar{T}}_8$ * Template:CDD	[35,2,1] E9=$E_8^{+}={\tilde{E}}_8$ * Template:CDD
10					[3[8],3,3] A7+++ * Template:CDD	[4,34,33,1] B7+++ * Template:CDD	[31,1,3,3,3,33,1] D7+++ * Template:CDD	[35,3,1] E7+++ * Template:CDD	[36,2,1] E10=$E_8^{++}={\bar{T}}_9$ * Template:CDD
11									[37,2,1] E11=E8+++ * Template:CDD
Det(Template:Mvar)	7(7−n)	2(7−n)	4(7−n)	3(7−n)	8(8−n)	2(8−n)	4(8−n)	2(8−n)	9−n

Geometric folding

Finite and affine foldings

φA : AΓ → AΓ' for finite types
Γ	Γ'	Folding description	Coxeter–Dynkin diagrams
I2(h)	Γ(h)	Dihedral folding
Bn	A2n	(I,sn)
	Dn+1, A2n-1	(A3,±ε)
F4	E6	(A3,±ε)
H4	E8	(A4,±ε)
H3	D6
H2	A4
G2	A5	(A5,±ε)
	D4	(D4,±ε)
φ: AΓ+ → AΓ'+ for affine types
${\tilde{A}}_{n-1}$	${\tilde{A}}_{kn-1}$	Locally trivial
${\tilde{B}}_n$	${\tilde{D}}_{2n+1}$	(I,sn)
	${\tilde{D}}_{n+1}$, ${\tilde{D}}_{2n}$	(A3,±ε)
${\tilde{C}}_n$	${\tilde{B}}_{n+1}$, ${\tilde{C}}_{2n}$	(A3,±ε)
	${\tilde{C}}_{2n+1}$	(I,sn)
${\tilde{C}}_n$	${\tilde{A}}_{2n+1}$	(I,sn) & (I,s0)
	${\tilde{A}}_{2n}$	(A3,ε) & (I,s0)
	${\tilde{A}}_{2n-1}$	(A3,ε) & (A3,ε')
${\tilde{C}}_n$	${\tilde{D}}_{n+2}$	(A3,−ε) & (A3,−ε')
${\tilde{C}}_2$	${\tilde{D}}_5$	(I,s1)
${\tilde{F}}_4$	${\tilde{E}}_6$, ${\tilde{E}}_7$	(A3,±ε)
${\tilde{G}}_2$	${\tilde{D}}_6$, ${\tilde{E}}_7$	(A5,±ε)
	${\tilde{B}}_3$, ${\tilde{F}}_4$	(B3,±ε)
	${\tilde{D}}_4$, ${\tilde{E}}_6$	(D4,±ε)

A (simply-laced) Coxeter–Dynkin diagram (finite, affine, or hyperbolic) that has a symmetry (satisfying one condition, below) can be quotiented by the symmetry, yielding a new, generally multiply laced diagram, with the process called "folding".

For example, in D₄ folding to G₂, the edge in G₂ points from the class of the 3 outer nodes (valence 1), to the class of the central node (valence 3). And E₈ folds into 2 copies of H₄, the second copy scaled by τ.

Geometrically this corresponds to orthogonal projections of uniform polytopes and tessellations. Notably, any finite simply-laced Coxeter–Dynkin diagram can be folded to I₂(h), where h is the Coxeter number, which corresponds geometrically to a projection to the Coxeter plane.

A few hyperbolic foldings

Complex reflections

Coxeter–Dynkin diagrams have been extended to complex space, Cⁿ where nodes are unitary reflections of period greater than 2. Nodes are labeled by an index, assumed to be 2 for ordinary real reflection if suppressed. Coxeter writes the complex group, p[q]r, as diagram Template:CDD.

A 1-dimensional regular complex polytope in ${ℂ}^1$ is represented as Template:CDD, having p vertices. Its real representation is a regular polygon, {p}. Its symmetry is _p[] or Template:CDD, order p. A unitary operator generator for Template:CDD is seen as a rotation in ${ℝ}^2$ by 2Template:Pi/p radians counter clockwise, and a Template:CDD edge is created by sequential applications of a single unitary reflection. A unitary reflection generator for a 1-polytope with p vertices is Template:Math. When p = 2, the generator is e^Template:Pii = –1, the same as a point reflection in the real plane.

In a higher polytope, _p{} or Template:CDD represents a p-edge element, with a 2-edge, {} or Template:CDD, representing an ordinary real edge between two vertices.

Regular complex 1-polytopes

Complex 1-polytopes, Template:CDD, represented in the Argand plane as regular polygons for p = 2, 3, 4, 5, and 6, with black vertices. The centroid of the p vertices is shown seen in red. The sides of the polygons represent one application of the symmetry generator, mapping each vertex to the next counterclockwise copy. These polygonal sides are not edge elements of the polytope, as a complex 1-polytope can have no edges (it often is a complex edge) and only contains vertex elements.

12 irreducible Shephard groups with their subgroup index relations. Subgroups index 2 relate by removing a real reflection: p[2q]2 → p[q]p, index 2. p[4]q → p[q]p, index q.

p[4]2 subgroups: p=2,3,4... p[4]2 → [p], index p p[4]2 → p[]×p[], index 2

A regular complex polygon in ${ℂ}^2$, has the form _p{q}_r or Coxeter diagram Template:CDD. The symmetry group of a regular complex polygon Template:CDD is not called a Coxeter group, but instead a Shephard group, a type of Complex reflection group. The order of _p[q]_r is $8/q\cdot (1/p+2/q+1/r-1{)}^{-2}$.

The rank 2 Shephard groups are: ₂[q]₂, _p[4]₂, ₃[3]₃, ₃[6]₂, ₃[4]₃, ₄[3]₄, ₃[8]₂, ₄[6]₂, ₄[4]₃, ₃[5]₃, ₅[3]₅, ₃[10]₂, ₅[6]₂, and ₅[4]₃ or Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD of order 2q, 2p², 24, 48, 72, 96, 144, 192, 288, 360, 600, 1200, and 1800 respectively.

The symmetry group _p1[q]_p2 is represented by 2 generators R₁, R₂, where:

Template:Math.

If q is even, (R₂R₁)^q/2 = (R₁R₂)^q/2. If q is odd, (R₂R₁)^(q-1)/2R₂ = (R₁R₂)^(q-1)/2R₁. When q is odd, p₁=p₂.

The ${ℂ}^3$ group Template:CDD or [1 1 1]^p is defined by 3 period 2 unitary reflections {R₁, R₂, R₃}:

R₁² = R₁² = R₃² = (R₁R₂)³ = (R₂R₃)³ = (R₃R₁)³ = (R₁R₂R₃R₁)^p = 1.

The period p can be seen as a double rotation in real ${ℝ}^4$.

A similar ${ℂ}^3$ group Template:CDD or [1 1 1]^(p) is defined by 3 period 2 unitary reflections {R₁, R₂, R₃}:

R₁² = R₁² = R₃² = (R₁R₂)³ = (R₂R₃)³ = (R₃R₁)³ = (R₁R₂R₃R₂)^p = 1.

See also

• Coxeter group
• Schwarz triangle
• Goursat tetrahedron
• Dynkin diagram
• Uniform polytope
  • Wythoff symbol
  • Uniform polyhedron
  • List of uniform polyhedra
  • List of uniform planar tilings
  • Uniform 4-polytope
  • Convex uniform honeycomb
  • Convex uniform honeycombs in hyperbolic space
• Wythoff construction and Wythoff symbol

Further reading

• James E. Humphreys, Reflection Groups and Coxeter Groups, Cambridge studies in advanced mathematics, 29 (1990)
• Kaleidoscopes: Selected Writings of H.S.M. Coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication, 1995, Template:ISBN [1], Googlebooks [2]
  • (Paper 17) Coxeter, The Evolution of Coxeter-Dynkin diagrams, [Nieuw Archief voor Wiskunde 9 (1991) 233-248]
• Coxeter, The Beauty of Geometry: Twelve Essays, Dover Publications, 1999, Template:ISBN (Chapter 3: Wythoff's Construction for Uniform Polytopes)
• Coxeter, Regular Polytopes (1963), Macmillan Company
  • Regular Polytopes, Third edition, (1973), Dover edition, Template:ISBN (Chapter 5: The Kaleidoscope, and Section 11.3 Representation by graphs)
• H.S.M. Coxeter and W. O. J. Moser, Generators and Relations for Discrete Groups 4th ed, Springer-Verlag, New York, 1980
• Norman Johnson, Geometries and Transformations, Chapters 11,12,13, preprint 2011
• N. W. Johnson, R. Kellerhals, J. G. Ratcliffe, S. T. Tschantz, The size of a hyperbolic Coxeter simplex, Transformation Groups, 1999, Volume 4, Issue 4, pp. 329–353 [3] [4]
• Norman W. Johnson and Asia Ivic Weiss Quadratic Integers and Coxeter Groups Template:Webarchive PDF Can. J. Math. Vol. 51 (6), 1999, pp. 1307–1336

External links

• Template:MathWorld
• October 1978 discussion on the history of the Coxeter diagrams by Coxeter and Dynkin in Toronto, Canada; Eugene Dynkin Collection of Mathematics Interviews, Cornell University Library.