1.
Abstract polytope
–
An ordinary geometric polytope is said to be a realization in some real N-dimensional space, typically Euclidean, of the corresponding abstract polytope. The abstract definition allows some more general combinatorial structures than traditional definitions of a polytope, the term polytope is a generalisation of polygons and polyhedra into any number of dimensions. In Euclidean geometry, the six quadrilaterals illustrated are all different, yet they have a common structure in the alternating chain of four vertices and four sides which gives them their name. They are said to be isomorphic or “structure preserving”, the measurable properties of traditional polytopes such as angles, edge-lengths, skewness, straightness and convexity have no meaning for an abstract polytope. What is true for traditional polytopes may not be so for abstract ones, for example, a traditional polytope is regular if all its facets and vertex figures are regular, but this is not necessarily so for an abstract polytope. A traditional geometric polytope is said to be a realisation of the abstract polytope. A realisation is a mapping or injection of the object into a real space, typically Euclidean. The six quadrilaterals shown are all distinct realisations of the abstract quadrilateral, some of them do not conform to traditional definitions of a quadrilateral and are said to be unfaithful realisations. A conventional polytope is a faithful realisation, in an abstract polytope, each structural element - vertex, edge, cell, etc. is associated with a corresponding member or element of the set. The term face often refers to any such element e. g. a vertex, edge or a general k-face, the faces are ranked according to their associated real dimension, vertices have rank =0, edges rank =1 and so on. This usage of incidence also occurs in Finite geometry, although it differs from traditional geometry, for example in the square abcd, edges ab and bc are not abstractly incident. A polytope is defined as a set of faces P with an order relation <. Formally, P will be an ordered set, or poset. Just as the zero is necessary in mathematics, so also set theory requires an empty set which, technically. In an abstract polytope this is known as the least or null face and is a subface of all the others, since the least face is one level below the vertices or 0-faces, its rank is −1 and may be denoted as F−1. There is also a face of which all the others are subfaces. This is called the greatest face, in an n-dimensional polytope, the greatest face has rank = n and may be denoted as Fn. It is sometimes realized as the interior of the geometric figure and these least and greatest faces are sometimes called improper faces, with all others being proper faces

2.
Hemi-icosahedron
–
A hemi-icosahedron is an abstract regular polyhedron, containing half the faces of a regular icosahedron. It has 10 triangular faces,15 edges, and 6 vertices, from the point of view of graph theory this is an embedding of K6 on a real projective plane. With this embedding, the graph is the Petersen graph --- see hemi-dodecahedron. 11-cell - an abstract regular 4-polytope constructed from 11 hemi-icosahedra, hemi-dodecahedron hemi-cube hemi-octahedron McMullen, Peter, Schulte, Egon, 6C. Projective Regular Polytopes, Abstract Regular Polytopes, Cambridge University Press, pp. 162–165, ISBN 0-521-81496-0 The hemi-icosahedron

3.
Vertex figure
–
In geometry, a vertex figure, broadly speaking, is the figure exposed when a corner of a polyhedron or polytope is sliced off. Take some vertex of a polyhedron, mark a point somewhere along each connected edge. Draw lines across the faces, joining adjacent points. When done, these form a complete circuit, i. e. a polygon. This polygon is the vertex figure, more precise formal definitions can vary quite widely, according to circumstance. For example Coxeter varies his definition as convenient for the current area of discussion, most of the following definitions of a vertex figure apply equally well to infinite tilings, or space-filling tessellation with polytope cells. Make a slice through the corner of the polyhedron, cutting all the edges connected to the vertex. The cut surface is the vertex figure and this is perhaps the most common approach, and the most easily understood. Different authors make the slice in different places, Wenninger cuts each edge a unit distance from the vertex, as does Coxeter. For uniform polyhedra the Dorman Luke construction cuts each connected edge at its midpoint, other authors make the cut through the vertex at the other end of each edge. For irregular polyhedra, these approaches may produce a figure that does not lie in a plane. A more general approach, valid for convex polyhedra, is to make the cut along any plane which separates the given vertex from all the other vertices. Cromwell makes a cut or scoop, centered on the vertex. The cut surface or vertex figure is thus a spherical polygon marked on this sphere, many combinatorial and computational approaches treat a vertex figure as the ordered set of points of all the neighboring vertices to the given vertex. In the theory of polytopes, the vertex figure at a given vertex V comprises all the elements which are incident on the vertex, edges, faces. More formally it is the -section Fn/V, where Fn is the greatest face and this set of elements is elsewhere known as a vertex star. A vertex figure for an n-polytope is an -polytope, for example, a vertex figure for a polyhedron is a polygon figure, and the vertex figure for a 4-polytope is a polyhedron. Each edge of the vertex figure exists on or inside of a face of the original polytope connecting two vertices from an original face

4.
Hemi-dodecahedron
–
A hemi-dodecahedron is an abstract regular polyhedron, containing half the faces of a regular dodecahedron. It has 6 pentagonal faces,15 edges, and 10 vertices and it can be projected symmetrically inside of a 10-sided or 12-sided perimeter, From the point of view of graph theory this is an embedding of Petersen graph on a real projective plane. With this embedding, the graph is K6 --- see hemi-icosahedron. 57-cell – an abstract regular 4-polytope constructed from 57 hemi-dodecahedra, hemi-icosahedron hemi-cube hemi-octahedron McMullen, Peter, Schulte, Egon, 6C. Projective Regular Polytopes, Abstract Regular Polytopes, Cambridge University Press, pp. 162–165, ISBN 0-521-81496-0 The hemidodecahedron

5.
Symmetry group
–
In abstract algebra, the symmetry group of an object is the group of all transformations under which the object is invariant with composition as the group operation. For a space with a metric, it is a subgroup of the group of the space concerned. If not stated otherwise, this article considers symmetry groups in Euclidean geometry, the objects may be geometric figures, images, and patterns, such as a wallpaper pattern. The definition can be more precise by specifying what is meant by image or pattern. For symmetry of objects, one may also want to take their physical composition into account. The group of isometries of space induces an action on objects in it. The symmetry group is also called full symmetry group in order to emphasize that it includes the orientation-reversing isometries under which the figure is invariant. The subgroup of orientation-preserving isometries that leave the figure invariant is called its symmetry group. The proper symmetry group of an object is equal to its symmetry group if. The proper symmetry group is then a subgroup of the orthogonal group SO. A discrete symmetry group is a group such that for every point of the space the set of images of the point under the isometries in the symmetry group is a discrete set. There are also continuous symmetry groups, which contain rotations of arbitrarily small angles or translations of arbitrarily small distances, the group of all symmetries of a sphere O is an example of this, and in general such continuous symmetry groups are studied as Lie groups. With a categorization of subgroups of the Euclidean group corresponds a categorization of symmetry groups, for example, two 3D figures have mirror symmetry, but with respect to different mirror planes. Two 3D figures have 3-fold rotational symmetry, but with respect to different axes, two 2D patterns have translational symmetry, each in one direction, the two translation vectors have the same length but a different direction. When considering isometry groups, one may restrict oneself to those where for all points the set of images under the isometries is topologically closed. This includes all discrete isometry groups and also involved in continuous symmetries. A figure with this group is non-drawable and up to arbitrarily fine detail homogeneous. The group generated by all translations, this group cannot be the group of a pattern, it would be homogeneous

6.
Projective linear group
–
The projective special linear group, PSL, is defined analogously, as the induced action of the special linear group on the associated projective space. Explicitly, PSL = SL/SZ where SL is the linear group over V. Here SZ is the center of SL, and is identified with the group of nth roots of unity in K. If V is the vector space over a field F, namely V = Fn. Note that PGL and PSL are equal if and only if every element of F has an nth root in F. PGL and PSL can also be defined over a ring, with an important example being the modular group, PSL. The name comes from geometry, where the projective group acting on homogeneous coordinates is the underlying group of the geometry. Stated differently, the action of GL on V descends to an action of PGL on the projective space P. The projective linear groups therefore generalise the case PGL of Möbius transformations and this is reflected in the notation, PGL is the group associated to GL, and is the projective linear group of -dimensional projective space, not n-dimensional projective space. A related group is the group, which is defined axiomatically. A collineation is a map which sends collinear points to collinear points. Projective linear transforms are collineations, but in general not all collineations are projective linear transforms – PGL is in general a proper subgroup of the collineation group. Correspondingly, the quotient group PΓL/PGL = Gal corresponds to choices of linear structure, one may also define collineation groups for axiomatically defined projective spaces, where there is no natural notion of a projective linear transform. The elements of the linear group can be understood as tilting the plane along one of the axes, and then projecting to the original plane. Visually, this corresponds to standing at the origin, and turning ones angle of view, PGL sends collinear points to collinear points, but it is not the full collineation group, which is instead either PΓL or the full symmetric group for n =2. Every algebraic automorphism of a space is projective linear. The birational automorphisms form a group, the Cremona group. PGL acts faithfully on projective space, non-identity elements act non-trivially, concretely, the kernel of the action of GL on projective space is exactly the scalar maps, which are quotiented out in PGL. PGL acts 2-transitively on projective space, PGL acts sharply 3-transitively on the projective line

7.
Dual polyhedron
–
Such dual figures remain combinatorial or abstract polyhedra, but not all are also geometric polyhedra. Starting with any given polyhedron, the dual of its dual is the original polyhedron, duality preserves the symmetries of a polyhedron. Therefore, for classes of polyhedra defined by their symmetries. Thus, the regular polyhedra – the Platonic solids and Kepler-Poinsot polyhedra – form dual pairs, the dual of an isogonal polyhedron, having equivalent vertices, is one which is isohedral, having equivalent faces. The dual of a polyhedron is also isotoxal. Duality is closely related to reciprocity or polarity, a transformation that. There are many kinds of duality, the kinds most relevant to elementary polyhedra are polar reciprocity and topological or abstract duality. The duality of polyhedra is often defined in terms of polar reciprocation about a concentric sphere. In coordinates, for reciprocation about the sphere x 2 + y 2 + z 2 = r 2, the vertex is associated with the plane x 0 x + y 0 y + z 0 z = r 2. The vertices of the dual are the reciprocal to the face planes of the original. Also, any two adjacent vertices define an edge, and these will reciprocate to two adjacent faces which intersect to define an edge of the dual and this dual pair of edges are always orthogonal to each other. If r 0 is the radius of the sphere, and r 1 and r 2 respectively the distances from its centre to the pole and its polar, then, r 1. R2 = r 02 For the more symmetrical polyhedra having an obvious centroid, it is common to make the polyhedron and sphere concentric, the choice of center for the sphere is sufficient to define the dual up to similarity. If multiple symmetry axes are present, they will intersect at a single point. Failing that, a sphere, inscribed sphere, or midsphere is commonly used. If a polyhedron in Euclidean space has an element passing through the center of the sphere, since Euclidean space never reaches infinity, the projective equivalent, called extended Euclidean space, may be formed by adding the required plane at infinity. Some theorists prefer to stick to Euclidean space and say there is no dual. Meanwhile, Wenninger found a way to represent these infinite duals, the concept of duality here is closely related to the duality in projective geometry, where lines and edges are interchanged

8.
Mathematics
–
Mathematics is the study of topics such as quantity, structure, space, and change. There is a range of views among mathematicians and philosophers as to the exact scope, Mathematicians seek out patterns and use them to formulate new conjectures. Mathematicians resolve the truth or falsity of conjectures by mathematical proof, when mathematical structures are good models of real phenomena, then mathematical reasoning can provide insight or predictions about nature. Through the use of abstraction and logic, mathematics developed from counting, calculation, measurement, practical mathematics has been a human activity from as far back as written records exist. The research required to solve mathematical problems can take years or even centuries of sustained inquiry, rigorous arguments first appeared in Greek mathematics, most notably in Euclids Elements. Galileo Galilei said, The universe cannot be read until we have learned the language and it is written in mathematical language, and the letters are triangles, circles and other geometrical figures, without which means it is humanly impossible to comprehend a single word. Without these, one is wandering about in a dark labyrinth, carl Friedrich Gauss referred to mathematics as the Queen of the Sciences. Benjamin Peirce called mathematics the science that draws necessary conclusions, David Hilbert said of mathematics, We are not speaking here of arbitrariness in any sense. Mathematics is not like a game whose tasks are determined by arbitrarily stipulated rules, rather, it is a conceptual system possessing internal necessity that can only be so and by no means otherwise. Albert Einstein stated that as far as the laws of mathematics refer to reality, they are not certain, Mathematics is essential in many fields, including natural science, engineering, medicine, finance and the social sciences. Applied mathematics has led to entirely new mathematical disciplines, such as statistics, Mathematicians also engage in pure mathematics, or mathematics for its own sake, without having any application in mind. There is no clear line separating pure and applied mathematics, the history of mathematics can be seen as an ever-increasing series of abstractions. The earliest uses of mathematics were in trading, land measurement, painting and weaving patterns, in Babylonian mathematics elementary arithmetic first appears in the archaeological record. Numeracy pre-dated writing and numeral systems have many and diverse. Between 600 and 300 BC the Ancient Greeks began a study of mathematics in its own right with Greek mathematics. Mathematics has since been extended, and there has been a fruitful interaction between mathematics and science, to the benefit of both. Mathematical discoveries continue to be made today, the overwhelming majority of works in this ocean contain new mathematical theorems and their proofs. The word máthēma is derived from μανθάνω, while the modern Greek equivalent is μαθαίνω, in Greece, the word for mathematics came to have the narrower and more technical meaning mathematical study even in Classical times

9.
Duality (mathematics)
–
Such involutions sometimes have fixed points, so that the dual of A is A itself. For example, Desargues theorem is self-dual in this sense under the standard duality in projective geometry, many mathematical dualities between objects of two types correspond to pairings, bilinear functions from an object of one type and another object of the second type to some family of scalars. From a category theory viewpoint, duality can also be seen as a functor and this functor assigns to each space its dual space, and the pullback construction assigns to each arrow f, V → W its dual f∗, W∗ → V∗. In the words of Michael Atiyah, Duality in mathematics is not a theorem, the following list of examples shows the common features of many dualities, but also indicates that the precise meaning of duality may vary from case to case. A simple, maybe the most simple, duality arises from considering subsets of a fixed set S, to any subset A ⊆ S, the complement Ac consists of all those elements in S which are not contained in A. It is again a subset of S, taking the complement has the following properties, Applying it twice gives back the original set, i. e. c = A. This is referred to by saying that the operation of taking the complement is an involution, an inclusion of sets A ⊆ B is turned into an inclusion in the opposite direction Bc ⊆ Ac. Given two subsets A and B of S, A is contained in Bc if and only if B is contained in Ac. This duality appears in topology as a duality between open and closed subsets of some fixed topological space X, a subset U of X is closed if, because of this, many theorems about closed sets are dual to theorems about open sets. For example, any union of sets is open, so dually. The interior of a set is the largest open set contained in it, because of the duality, the complement of the interior of any set U is equal to the closure of the complement of U. A duality in geometry is provided by the cone construction. Given a set C of points in the plane R2, unlike for the complement of sets mentioned above, it is not in general true that applying the dual cone construction twice gives back the original set C. Instead, C ∗ ∗ is the smallest cone containing C which may be bigger than C. Therefore this duality is weaker than the one above, in that Applying the operation twice gives back a possibly bigger set, the other two properties carry over without change, It is still true that an inclusion C ⊆ D is turned into an inclusion in the opposite direction. Given two subsets C and D of the plane, C is contained in D ∗ if, a very important example of a duality arises in linear algebra by associating to any vector space V its dual vector space V*. Its elements are the k-linear maps φ, V → k, the three properties of the dual cone carry over to this type of duality by replacing subsets of R2 by vector space and inclusions of such subsets by linear maps. That is, Applying the operation of taking the dual vector space twice gives another vector space V**, there is always a map V → V**