Higher Dimensions

Wechseln zu: Navigation, Suche

Looking for the next dimension Fig. 1: Illustration of a Calabi-Yau-manifold (Important for the description of higher dimensional models in superstring-theory)

Does our world really have more than three dimensions? If so, do objects in higher dimension have a relation to the world around us? Is it possible to get a perception of these objects or do they withdraw any representation? Questions like these will be posed by students if you talk about space dimensions in school. Students want to understand the meaning of a four-, five or even n-dimensional space. The relativity theory uses four dimensions to explain the concept of space-time, six dimensions are necessary to describe the bending of space-time and different string theories even use representations in up to 26 dimensions (e.g. L. Botelho, R. Botelho, 1999). Another current domain of application for higher dimensional objects and their three-dimensional representations is the study of non-periodic structures in modern crystallography. Within the concept of quasicrystals projections of higher dimensional point-sets (such as the integer-lattice in dimension 5) to three dimensional space are supposed to be good models for non-periodic crystalline structures (see section 5 below).

These examples show one of the main characteristics of mathematical thinking: If it is easier or helpful to describe real phenomena in higher dimensional space, the three spacial dimensions can be extended. This can easily be explained under formal aspects. Thus, linear equations with three variables may be interpreted as a plane in space, linear equations with four variables are interpreted as a three dimensional hyperplane in a four-dimensional space. Also, linear equations with n-variables are interpreted as an (n-1)-dimensional hyper-plane in an n-dimensional space. While using more than three variables, the advantage of such an expansion of the dimension-concept benefits from a simpler and more consistent description of mathematical relations. It is not necessary for formal calculations on an algebraic and numerical level to have illustrative perceptions in such a higher dimensional context. Nevertheless, on the one hand this leads to the question how to translate the results of such considerations into the real world. On the other hand there is a need to describe at least basic objects of higher dimensions in our three dimensional space.

In the following, thoughts dealing with the development of representations of higher dimensional objects will be discussed by exemplarily considering a four-dimensional object, the four-dimensional cube. It will be shown that the approach to four- and higher-dimensional cubes can be done in different ways. The extensive use of analogical considerations serves as a basis for understanding higher dimensional objects. In the following, three different approaches will be shown and analyzed (A detailed description of these approaches is found in Ruppert (2010)).

(1) Projections of higher-dimensional objects on (hyper)planes,
(2) Intersections of (hyper)cubes and a (hyper)plane,
(3) A systematic extension of the concept of coordinates.

Projections

In this section, the basic idea of describing higher dimensional objects by means of projection will be generalized in higher dimensions. Especially the orthogonal projection along a body diagonal of an n-dimensional hyper cube in an (n-1)-dimensional space can easily be generalized.

Example 1: Projections of square and cube

Fig. 2.1: Projection of a square (Author: Sebastian Hammer, University of Würzburg)

Fig. 2.2:Projection of a cube (Author: Sebastian Hammer, University of Würzburg)

For $1\le i \le 4$ let Ai be the vertices of the square. The projection of Fig. 2.1 is represented by the intersection of the straight lines $g_{i}: \ \vec{X}= \vec{A_{i}} + k \cdot \begin{pmatrix}1 \\ 1 \end{pmatrix} , \ \ (1\le i \le 4)$

with the line $h:\ x_{1}+x_{2}=0.$

This is an orthogonal projection. Similarly, the orthogonal projection of an n-dimensional hyper cube is fully described by the projection of the coordinates of the vertices $A_{i}(1\le i \le 2^{n})$. We look for the intersection points of the straight lines: $g_{i}: \ \vec{X}= \vec{A_{i}} + k \cdot \begin{pmatrix}1 \\ \vdots \\1 \end{pmatrix} , \ \ (1\le i \le 2^{n})$

and the (n-1)-hyper-plane $R:\ x_{1}+ \cdots +x_{2}=0.$

The vector $(1,1,...,1)$ is orthogonal to the hyperplane R, the lines gi are the orthogonal lines to the hyperplane R through the vertices Ai. After considering similarities of the projections above, such as vertices having the same image under these special mappings, we get Fig. 3.2 as representation for the corresponding orthogonal projection of a four-dimensional hypercube into the three-dimensional space.

Another possibility to describe orthogonal projections from n-dimensional into k-dimensional space $(k \le n)$ uses the linearity of orthogonal projections (as linear transformations). This property can be used to create and understand two-dimensional images of cubes of any dimension.

Example 2: Projection of a hypercube

Fig. 2.2 shows three generating vectors of the cube and their images under orthogonal projection along the body-diagonal. All vertices of the cube are linear combinations of these vectors with coefficients 0 and 1. The linearity of the projection leads to the same property for the images of all vertices.

While describing the n-dimensional cube with adequate linear combinations of n linear independent generating vectors, the following can be shown: For the n-dimensional cube, there is an orthogonal projection into R2 and an appropriate plane of projection, such that the images of the generating vectors point to the vertices of a regular n-sided polygon. According to additivity, the images of all the other vertices finally result in corresponding linear combinations. (For n=3 see Fig. 2.2 and Example 1, with the regular triangle as image of the generating vectors)

To understand how the projection of an n-dimensional hypercube on a k-dimensional subspace is obtained we first explain how a cube is projected onto a line in the three-dimensional space:
For each vertex of the cube take the plane orthogonal to the given line which contains this vertex. The intersection point of the plane and the line is the orthogonal projection of the vertex onto the line.

Analogously we project the n-dimensional hypercube on a k-dimensional hyperplane. For each vertex of the hypercube take the (n-k)-dimensional hyperplane orthogonal to the given k-dimensional plane which contains this vertex. The intersection point of these two hyperplanes is the orthogonal projection of the vertex onto the k-dimensional subspace.

So, a two-dimensional projection of the five-dimensional unit cube can be indicated: Based on the images of the generating vectors (pointing to the vertices of a regular pentagon), the images of any vertices can be found by appropriately adding those vectors (see Fig. 4.1).

Looking at the projection of the five-dimensional cube, the images of the edges of the cubes span the well-known Penrose-Rhombs (see Senechal 1995). Another remarkable phenomenon is shown in figure 4.2. Under the projection of the six-dimensional Hypercube along its body-diagonal – the line segment with the endpoints $(0, 0, 0, 0, 0, 0)$ to $(1, 1, 1, 1, 1, 1)$ – there are several vertices with the same projection. The number of preimages is also given in Fig. 4.2.

Intersections of cubes

A dynamic representation of a four-dimensional hypercube is given by considering the different shapes of intersection while intersecting it with a three-dimensional hyper plane. Initially, a cube (in a three-dimensional space), which intersects a plane will be regarded. It is assumed, that the objects move with (relative) velocity v. It is especially easy to describe the situation while considering the cube (edge length a) with its edges fixed on the axes of a coordinate system. The plane $E(t):\ x_{1}+x_{2}+x_{3}-\sqrt{3} \cdot v \cdot t = 0$

moves along a cube diagonal with velocity v through this cube. Since the cube is a convex body itself, it is sufficient to determine the points of intersection of the edges at any time. We get the cross section as the convex hull of these intersection points.

The intersection of a three-dimensional space while moving through a four-dimensional hypercube will be analogously represented as follows:

A four-dimensional hypercube with an edge length $a$ will be intersected with a space $R(t)$, which moves with a velocity of $v$ along the body diagonal of the hypercube. Therefore we define analogously: $R(t):\ x_{1}+x_{2}+x_{3}+x_{4}-2 \cdot v \cdot t = 0$.

Again, it is sufficient to know the intersection points of the hypercube with R.

An interactive simulation of these intersections in one to four dimensions is given in the following applet (Author: Rafael Losada, Instituto GeoGebra de Cantabria).

Geometry of coordinates

The unit line segment and the unit square can be considered as a one‐ or two‐dimensional analog of the unit cube. Looking at the coordinates of the vertices in a coordinate system, we get

 Vertices of the unit line-segment: $A_{1}= (0)$ $A_{2}= (1)$ Vertices of the unit square: $A_{1}= (0 \mid 0)$ $A_{2}= (1 \mid 0)$ $A_{3}= (0 \mid 1)$ $A_{4}= (1 \mid 1)$ Vertices of the unit cube: $A_{1}= (0 \mid 0 \mid 0)$ $A_{2}= (1 \mid 0 \mid 0)$ $A_{3}= (0 \mid 1 \mid 0)$ $A_{4}= (1 \mid 1 \mid 0)$ $A_{5}= (0 \mid 0 \mid 1)$ $A_{6}= (1 \mid 0 \mid 1)$ $A_{7}= (0 \mid 1 \mid 1)$ $A_{8}= (1 \mid 1 \mid 1)$

By successively adding additional coordinates with coefficients 0 and 1, the coordinates of the vertices and thus the number of vertices of a unit hypercube in a four‐ or five‐dimensional coordinate system are obtained. The transition to hypercubes in higher dimensions can exclusively be accomplished on a symbolical level and can be considered as a continuation of the concept of coordinates. Combinatorial considerations lead to the following relation for the number N(n;k) of the k‐dimensional “boundary cubes” of an n‐dimensional cube (see e. g. Graumann, 2009): $N(n;k)={n \choose k} \cdot 2^{n-k}$

This formula can be obtained by the following observations:

1. Every k‐dimensional “boundary‐cube” is parallel to a k‐dimensional hyperplane which is spanned by k generating vectors of the n‐dimensional cube (see also sec. 3). As a consequence, the coordinates of vertices belonging to one and the same k‐dimensional “boundary‐cube” differ in at most k coefficients (and all such vertices belong to this cube).
2. There are ${n \choose k}$ possibilities to choose k coefficients out of n.
3. There are 2n possibilities to choose a "starting vertex".
4. There are 2k starting vertices leading to the same boundary cube.

Example 3: The three‐dimensional cube (n = 3):

 Number of vertices (k= 0): $N(3;0)={3 \choose 0} \cdot 2^{3-0} = 8$ Number of edges (k= 1): $N(3;1)={3 \choose 1} \cdot 2^{3-1} = 12$ Number of faces (k= 2): $N(3;2)={3 \choose 2} \cdot 2^{3-2} = 6$ Number of cubes (k= 3): $N(3;3)={3 \choose 3} \cdot 2^{3-3} = 1$

This can be illustrated in the following table:

First of all, following the yellow highlights, the table allows the interpretation of a single point as a cube of dimension 0, so that the formula above is consistent even for n = 0. The number sequences highlighted in different colors lead to further conjectures, which can be proved by using the formula for N(n;k) above. For instance:

• $N(n;n-1)=2n$ (red color)

• $n \cdot N(n-1;0)=N(n;1)$ (green color)

• $For\ all\ t\ge 1:\ N(3t-1;t-1) = N(3t-1;t)$ (blue color)

Moreover, a recursive formula is given, to calculate the data of the n‐dimensional cube of the corresponding numbers for the (n-1)‐dimensional cube

• $N(n;k)= 2 \cdot N(n-1;k) + N(n-1;k-1)$.

Example 4: Proof of the recursive formula $N(n;k)= 2 \cdot N(n-1;k) + N(n-1;k-1)$ $=$ $2 \cdot {n-1 \choose k} \cdot 2^{n-1-k} + {n-1 \choose k-1} \cdot 2^{n-1-(k-1)}$ $=$ $\left[{n-1 \choose k}+{n-1 \choose k-1} \right] \cdot 2^{(n-k)}$ $=$ $N(n;k)={n \choose k} \cdot 2^{n-k}$ $=$ $N(n;k)$

Of course, these algebraic arguments can easily be reinterpreted geometrically and retransformed to the geometric situation.

Quasicrystals – Projections from higher dimensions

Starting with the assumption of the classical crystallography, that the characteristic of real crystallographic structures is their translational symmetry (i.e. invariance under three independent translations), mathematical representations of these structures lead to the well-known “crystallographic restriction”, which allows non-trivial rotational symmetries only of orders 2, 3, 4 and 6. This corresponds to physical observations, until Shechtman et al. (1984) found a non-periodic structure of crystals (without translational symmetry) inside an Al-Mn-alloy, which has fivefold rotational symmetry. Crystallographers call these structures quasicrystals. To be more precise:

Quasicrystals are structural forms that are ordered but not periodic. They form patterns that fill all the space though they lack translational symmetries.

But these quasicrystals can be very complicated: the lack of translational symmetries leads to a lack of rules to explain how the pattern develops far from a region we are observing. This represents a challenge for the mathematician to explain the pattern. A breakthrough has occurred by the observation that many quasicrystals that look aperiodic are simply projections on a lower dimensional affine subspace of a regular grid in a higher dimensional space. Indeed, let us look at a simple example...

Example 5: One-dimensional quasicrystals

For the line $g_{1}:\ y=(\tau -1) \cdot x$ in R2 and its orthogonal $g_{2}:\ y= {\frac{1}{1 - \tau}} \cdot x$ line through the origin with $\tau= \frac {1}{2} + \frac {1}{2} \sqrt{5}$ we consider the orthogonal projection of the unit square on g2 (red line segment). Further we look at all points of Z2 with images under this projection lying on the red line segment. These points are now projected orthogonally on g1 (green points).

The length of the line segments on the projection line can take only two values (corresponding to the projection of the edges of the unit square). Thus we can speak of an “ordered structure”. Moving along the lines, the sequence of these values looks more or less chaotic - there is no translational symmetry, but if we enlarge the universe to two dimensions, then everything becomes clear: our quasicrystal is just part of the projection of a regular square grid. Enlarging the dimension has allowed us to understand the hidden structure of the quasicrystal.
This process is quite general. Senechal (1995) for instance illustrates regularities and assumptions for projection methods and multigrid methods which lead to quasi-crystalline point-sets. Projecting, for example, parts of a five-dimensional cubic grid (Z5) to a certain plane, a point-set, like in the above sense, is obtained and can be regarded as a two-dimensional quasicrystal. The point-set itself shows all vertices of the Penrose-tiling of the plane (by the two characteristic rhombs, compare section 2 and image 4.1).

Conclusion

We have discovered one way how the mathematician works, which is sometimes summarized by the following sentence

"Mathematics makes the invisible visible"

When you don’t understand something, you try to change your point of view. It may happen that the new point of view gives an explanation of the hidden structure. This is already what you do when you try to understand a conic: you choose an appropriate system of coordinates in which the equation is simple and reveals the features of the conic.

The benefits students will get out of the working with objects in higher dimensions are manifold. They will especially

• get a first insight into the meaning of higher dimensions in science;
• get to know different possibilities of an access to objects in higher dimensions;
• use analogies to extend their knowledge of the well‐known three dimensional world;
• use the properties of the objects in this world as an abstract concept of a mental fictive world;
• refresh and repeat their knowledge about projections of three dimensional objects in a plane.