|Regular tetrahedron, a platonic solid|
|Type of side surfaces||equilateral triangles|
|Number of faces||4th|
|Number of corners||4th|
|Number of edges||6th|
in the picture one of two possible networks
|Number of different networks||2|
|Number of edges in a corner||3|
|Number of corners of a surface||3|
The (also, especially southern Germany , of ) tetrahedron [ tetraeːdər ] (from ancient Greek τετρα- tetra- "four" and ἕδρα HEDRA or transferred "seat", "chair", "back", "side face"), even tetrahedron or four flat , is a body with four triangular faces . It is the only convex polyhedron ( polyhedron , polyhedron ) with four faces .
- 4 congruent equilateral triangles as side surfaces
- 6 edges of equal length and
- 4 corners where three side surfaces meet
3 twofold symmetry axes
4 threefold symmetry axes
One of 6 levels of symmetry
One of 3 four-fold rotating mirror axes with rotating mirror plane
- 4 threefold axes of rotation (through the corners and the centers of the opposite side surfaces ),
- 3 fourfold rotating mirror axes and thus also three twofold rotation axes or three symmetry axes (through the centers of opposite edges) as well
- 6 planes of symmetry (each through an edge and perpendicular to the opposite edge).
In total, the symmetry group of the tetrahedron - the tetrahedron group - has 24 elements. It is the symmetrical group S 4 (the point group T d according to Schoenflies or 4 3m according to Hermann-Mauguin ) and causes all 4! = 24 permutations of the corners or the side surfaces . It is a subgroup of the octahedron group or cube group.
In detail belong to the tetrahedral group
- 12 rotations ( even permutations ), viz
- 12 odd permutations . This is obtained by performing the reflection on a fixed plane of symmetry after each of the 12 even permutations . 6 of these can also be described as a pure plane mirroring , the other six as rotational mirroring of a rotation by 90 ° around an axis that runs through the center points of two opposite edges, and a mirroring on the plane perpendicular to this axis , which is the center point between the two opposite edges.
The even permutations form a subgroup of the tetrahedral group , the so-called alternating group (the point group T or 23). Sometimes the term tetrahedron group is only used for these, excluding reflections .
Relationship to octahedron, cube, Archimedean solids
By connecting the center points of the area you get a tetrahedron again (see figure). One therefore says: the tetrahedron is dual to itself , in short: self-dual . The side length of the inscribed tetrahedron is one third of the original side length.
- the truncated tetrahedron with 4 hexagons and 4 triangles (see Archimedean solid ),
- the octahedron with 4 + 4 = 8 triangles and 6 corners (with higher symmetry ) as the intersection of two tetrahedra,
- the star tetrahedron (an octahedron with 8 attached tetrahedra) as a three-dimensional union of two tetrahedra
- the cube with 4 + 4 = 8 corners (and with higher symmetry) as the convex hull of this star body .
See also the example below.
The tetrahedron can be inscribed in a cube ( hexahedron ) in such a way that its corners are at the same time cube corners and its edges are diagonals of the cube surfaces (see illustration). The volume of this cube is three times the tetrahedral volume . The 8 corners of the cube form two disjoint sets of four corners each, which correspond to the two possible positions of the tetrahedron.
Dual to this, the tetrahedron of a cube can be described in such a way that four of the cube faces lie in the side faces of the tetrahedron and the six corners of the cube are the centers of the six tetrahedron edges . The 8 faces of the cube form two disjoint sets , which correspond to the two positions for the tetrahedron circumscribed by the cube.
Each edge forms an angle of 54.74 ° ( ) with the surface on which it stands .
The connecting lines between the center of the tetrahedron and two corners each enclose an angle of = 109.47 ° ( ).
The sizes of the specified angles can be determined by using trigonometric functions (see obtuse angle ). To do this, consider the sectional figure of the tetrahedron (see illustration) with one of its six planes of symmetry .
If the cutting plane through a regular tetrahedron is parallel to two opposite edges, then the cross-section results in a rectangle . If the cutting plane also has the same distance from these two edges, i.e. if it divides the remaining four edges exactly in half, then the cutting plan is a square. The square has an edge length that is exactly half the length of one edge of the tetrahedron.
Embedding the tetrahedron in a cube provides an easy way to construct a regular tetrahedron. If we denote the vertices of the cube at the base and as well as the overlying points with , and so form and and and respectively, the corners of a tetrahedron. If one considers z. If, for example, in a three-dimensional Cartesian coordinate system, the cube whose corners have the coordinates and , the corners are obtained for the first tetrahedron
- and .
The second tetrahedron has the corners
- and .
|Sizes of a regular tetrahedron with edge length a|
|Edge ball radius|
|Inc sphere radius|
Ratio of volume
to spherical volume
Interior angle of the
edge and face
|Solid angles in the corners|
Calculation of the regular tetrahedron
For pyramids and thus for the tetrahedron applies
therein is the base area (equilateral triangle)
and the height of the pyramid
with inserted variables
For the surface area of the tetrahedron (four equilateral triangles) applies
The height of the pyramid can be determined using the following right-angled triangle.
The side lengths of this triangle are (see picture in formulas ): side height as a hypotenuse, pyramid height as a large cathetus and a third of the side height as a small cathetus. This value is determined by the position of the foot point of (center of gravity of the base area). The geometric center of gravity divides the height of the triangle in a ratio of 2: 1.
The following applies to the height of the equilateral triangle
and according to the Pythagorean theorem
Angle between adjacent faces
This angle, marked with , has its apex at one edge of the tetrahedron. It can be determined using the following right triangle.
According to the Pythagorean theorem,
Angle between edge and face
This angle, marked with , has its apex at one corner of the tetrahedron. Angle can be determined using the following right triangle.
The following applies to the angle
This angle, marked with , has its apex at the center of the tetrahedron. The angle can be determined using the following right triangle.
The side lengths of this triangle are (see picture in formulas ): Umkugelradius as a hypotenuse, half the edge length as a large cathetus and half the edge distance as a small cathetus .
The following applies to the angle
Solid angles in the corners
With the number of edges / faces at a corner and the interior angle of the equilateral triangle, the following applies
because of it
used in and formed
Nets of the regular tetrahedron
The tetrahedron has two nets (see figures). That means there are two different ways to unfold a hollow tetrahedron by cutting open 3 edges and spreading it out in the plane . The other 3 edges connect the 4 equilateral triangles of the network. To color a tetrahedron so that no neighboring faces are the same color, you need 4 colors.
Graphs, dual graphs, cycles, colors
The tetrahedron has an undirected planar graph with 4 nodes , 6 edges and 4 regions assigned to it. This is the complete graph K 4 . It is 3- regular , that is, 3 edges proceed from each node, so that the degree is 3 for all nodes. In the case of planar graphs, the exact geometric arrangement of the nodes is not important. However, it is important that the edges do not have to intersect. The nodes of this tetrahedron graph correspond to the corners of the tetrahedron.
The nodes of the tetrahedral graph can be colored with 4 colors in such a way that neighboring nodes are always colored differently, because all nodes are neighboring. This means that the chromatic number of this graph is 4 (see node coloring ). In addition, the edges can be colored with 3 colors so that adjacent edges are always colored differently (see illustrations). This is not possible with 2 colors, so that the chromatic index for the edge coloring is 3 (the picture on the right illustrates this coloring).
The tetrahedral graph is self-dual .
To determine the number of colors required for the areas or areas, the dual graph is helpful, which in this case is itself a tetrahedral graph with 4 nodes , 6 edges and 4 areas. The nodes of this graph are assigned one-to-one (bijective) to the areas of the original tetrahedral graph and vice versa (see bijective function and figure above). As already mentioned, the nodes of the dual tetrahedron graph can obviously only be colored with 4 colors so that neighboring nodes are always colored differently. From this it can be concluded indirectly: Because the chromatic number is 4, 4 colors are necessary for such a surface coloring of the tetrahedron or a coloring of the areas of the tetrahedron.
The 3 cut edges of each network (see above) together with the corners ( nodes ) form a spanning tree of the tetrahedron graph . Each net corresponds exactly to a spanning tree and vice versa, so that there is a one-to-one ( bijective ) assignment between nets and spanning trees. If you consider a tetrahedron network without the outer area as a graph , you get a dual graph with a tree with 4 nodes and 3 edges and the maximum node degree 3. Each area of the tetrahedron is assigned to a node of the tree. The 2 graph-theoretic constellations (see isomorphism of graphs ) each occur once.
Room fillings with regular tetrahedra
The three-dimensional Euclidean space can be completely filled with Platonic solids or Archimedean solids of the same edge length. Such three-dimensional tiling is called room filling . The following space fills contain tetrahedra:
Room filling with octahedron and tetrahedron
In chemistry , the tetrahedron plays a major role in the spatial arrangement of atoms in compounds . Simple molecular shapes can be predicted with the VSEPR model . The four hydrogen atoms in the methane molecule are arranged tetrahedrally around the carbon atom , as this is how the bond angle is greatest. The carbon atoms in the diamond lattice are also arranged in a tetrahedral manner, each atom is surrounded by four other atoms. The carbon atom is then after the orbital model in sp 3 - hybridization .
The tetrahedron also gave the Tetra Pak its name because of its original shape.
Alexander Graham Bell experimented with multicellular box kites (kites), the individual cells of which have the shape of a tetrahedron. These mostly imposing dragons are called "Bell Tetrahedron". Usually 4 or 10 or 20 individual cells are put together to form a composite, which then also has the shape of a tetrahedron. However, other composite forms are also possible.
In many pen & paper role-playing games , tetrahedra are used as four-sided game dice (D4).
Further technical applications are based on the structure that results from the lines pointing from the tetrahedron center into the four corners of the room:
- Tetrapods used as breakwaters on coasts
- so-called crow's feet , a defensive weapon that is used by the police and military against cars in order to burst their tires.
Concrete tetrapod on Heligoland
Unit cell of the diamond lattice
A crow's foot of the Office of Strategic Services
Space framework made of tetrahedra
A tetrahedron in the general sense, i.e. a body with four sides , is always a three-sided pyramid , i.e. with a triangle as base and three triangles as sides, and therefore also has four corners and six edges. Since it has the smallest possible number of corners and sides for a body in space, it is called three-dimensional simplex or 3- simplex in technical terms . The two-dimensional simplices are the triangles.
- Every 3-simplex has an umkugel and an incugel .
- The center of gravity is the intersection of the connecting lines between the corners and the centers of gravity of the opposite triangles and divides them in the ratio 3: 1 ( Commandino's theorem ).
- Every 3-simplex is the convex hull of its four corners.
- It is the only known polyhedron besides the Szilassi polyhedron in which all sides are adjacent to each other.
In a tetrahedron can also by a point and the three vectors are described to adjacent points. If you denote these vectors with , then the volume of the tetrahedron is calculated with , i.e. the amount of the spat product .
Calculation of any tetrahedron
A tetrahedron has 6 edges. A triangle is defined by specifying three side lengths. Each additional edge can be freely selected within certain limits. If there are 6 independent pieces of information on the size of edges or angles , you can use them to calculate the remaining edges or angles that are missing.
The volume formula of the general tetrahedron was given by Leonhard Euler . With this formula the volume of the general tetrahedron can be calculated with the help of the 6 edge lengths of the tetrahedron. So the volume formula of the general tetrahedron is the same task for tetrahedral basis as for triangles of the formula of Heron .
The first determinant is called the Cayley – Menger determinant and is used to calculate the area of any triangle (see Heron's theorem ), the volume of any tetrahedron and generally the volume of any simplex in -dimensional space .
The area of a triangle with given side lengths can be calculated individually. The sum of the areas of the 4 triangles gives the area of the tetrahedron. For the area of the triangular base with the side lengths, for example, according to Heron's theorem :
The volume and area can be calculated using the formulas above and then used to determine the height . The other three heights can be calculated accordingly using the area of the triangle orthogonal to the height .
Interior angles of the triangles
Angle between adjacent faces
The dihedral angle at the edge is
Solid angles in the corners
The analogues of the tetrahedron in any dimension are called ( -dimensional) simplices . The -dimensional simplex has corners and is bounded by simplices of the dimension (as facets ). A zero-dimensional simplex is a point , a one-dimensional simplex is a segment , and a two-dimensional simplex is a triangle . The four-dimensional equivalent of the tetrahedron, the pentachoron , has 5 corners , 10 edges, 10 triangles as faces and 5 three-dimensional tetrahedra as facets.
- Heinz Schumann: Elementary tetrahedral geometry . Franzbecker, Hildesheim 2011, ISBN 978-3-88120-521-4
- Kurt Peter Müller: Spatial Geometry: Spatial Phenomena - Construct - Calculate . 2nd, revised and expanded edition. Vieweg + Teubner, 2004, ISBN 978-3-519-12397-2 , p. 81.
- Eric Weisstein, Frank Jackson: Regular Tetrahedron. Umkugelradius, formula (5). In: MathWorld Wolfram. A Wolfram Web Resource, accessed June 19, 2020 .
- Eric Weisstein, Frank Jackson: Regular Tetrahedron. Edge ball radius, formula (10). In: MathWorld Wolfram. A Wolfram Web Resource, accessed June 19, 2020 .
- Eric Weisstein, Frank Jackson: Regular Tetrahedron. In spherical radius, formula (4). In: MathWorld Wolfram. A Wolfram Web Resource, accessed June 19, 2020 .
- Harish Chandra Rajpoot: Solid angles subtended by the platonic solids (regular polyhedra) at their vertices. SlideShare, March 2015, accessed June 16, 2020 .
- Alternative expression for . WolramAlpha, accessed June 16, 2020 .
- Eric Weisstein, Frank Jackson: Regular Tetrahedron. 2 networks, above formula (1). In: Wolfram MathWorld. Wolfram Research, Inc., accessed June 19, 2020 .
- Wolfram MathWorld: Tetrahedral Graph
- Maximilian Miller: Stereometry. 1957, p. 41
- The title of the treatise E 231 reads roughly as follows in German: Presentation of some characteristic properties with which bodies enclosed by flat surfaces are equipped . In this treatise Euler gives the first proof of the polyhedron formula , which he already gave in an earlier treatise ( E 230 , printed under Elementa doctrinae solidorum , Novi commentarii academiae scientiarum Petropolitanae 4, pp. 109-140; cf. Introduction to the Commentationes geometricae ) mentioned but not yet proven.
- Andreas Speiser et al .: Leonhardi Euleri Opera omnia. Series great. Opera mathematica. Volume XXVI: Commentationes geometricae. Volume I. 1953, pp. 106-107
- IN Bronstein, KA Semendjajev et al .: Taschenbuch der Mathematik. 2008, p. 157
- György Hajós: Introduction to Geometry. 1970, p. 383
- Alexander Ostermann, Gerhard Wanner: Geometry by Its History. 2012, p. 297