|
Geometrically Finite
In geometry, a group (mathematics), group of isometry, isometries of hyperbolic space is called geometrically finite if it has a well-behaved fundamental domain. A hyperbolic manifold is called geometrically finite if it can be described in terms of geometrically finite groups. Geometrically finite polyhedra A convex polytope, convex polyhedron ''C'' in hyperbolic space is called geometrically finite if its closure in the conformal compactification of hyperbolic space has the following property: *For each point ''x'' in , there is a neighborhood (mathematics), neighborhood ''U'' of ''x'' such that all faces of meeting ''U'' also pass through ''x'' . For example, every polyhedron with a finite number of faces is geometrically finite. In hyperbolic space of dimension at most 2, every geometrically finite polyhedron has a finite number of sides, but there are geometrically finite polyhedra in dimensions 3 and above with infinitely many sides. For example, in Euclidean s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometry
Geometry (; ) is a branch of mathematics concerned with properties of space such as the distance, shape, size, and relative position of figures. Geometry is, along with arithmetic, one of the oldest branches of mathematics. A mathematician who works in the field of geometry is called a ''List of geometers, geometer''. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point (geometry), point, line (geometry), line, plane (geometry), plane, distance, angle, surface (mathematics), surface, and curve, as fundamental concepts. Originally developed to model the physical world, geometry has applications in almost all sciences, and also in art, architecture, and other activities that are related to graphics. Geometry also has applications in areas of mathematics that are apparently unrelated. For example, methods of algebraic geometry are fundamental in Wiles's proof of Fermat's Last Theorem, Wiles's proof of Fermat's ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group (mathematics)
In mathematics, a group is a Set (mathematics), set with an Binary operation, operation that combines any two elements of the set to produce a third element within the same set and the following conditions must hold: the operation is Associative property, associative, it has an identity element, and every element of the set has an inverse element. For example, the integers with the addition, addition operation form a group. The concept of a group was elaborated for handling, in a unified way, many mathematical structures such as numbers, geometric shapes and polynomial roots. Because the concept of groups is ubiquitous in numerous areas both within and outside mathematics, some authors consider it as a central organizing principle of contemporary mathematics. In geometry, groups arise naturally in the study of symmetries and geometric transformations: The symmetries of an object form a group, called the symmetry group of the object, and the transformations of a given type form a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isometry
In mathematics, an isometry (or congruence, or congruent transformation) is a distance-preserving transformation between metric spaces, usually assumed to be bijective. The word isometry is derived from the Ancient Greek: ἴσος ''isos'' meaning "equal", and μέτρον ''metron'' meaning "measure". If the transformation is from a metric space to itself, it is a kind of geometric transformation known as a motion. Introduction Given a metric space (loosely, a set and a scheme for assigning distances between elements of the set), an isometry is a transformation which maps elements to the same or another metric space such that the distance between the image elements in the new metric space is equal to the distance between the elements in the original metric space. In a two-dimensional or three-dimensional Euclidean space, two geometric figures are congruent if they are related by an isometry; the isometry that relates them is either a rigid motion (translation or rotati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hyperbolic Space
In mathematics, hyperbolic space of dimension ''n'' is the unique simply connected, ''n''-dimensional Riemannian manifold of constant sectional curvature equal to −1. It is homogeneous, and satisfies the stronger property of being a symmetric space. There are many ways to construct it as an open subset of \mathbb R^n with an explicitly written Riemannian metric; such constructions are referred to as models. Hyperbolic 2-space, H2, which was the first instance studied, is also called the hyperbolic plane. It is also sometimes referred to as Lobachevsky space or Bolyai–Lobachevsky space after the names of the author who first published on the topic of hyperbolic geometry. Sometimes the qualificative "real" is added to distinguish it from complex hyperbolic spaces. Hyperbolic space serves as the prototype of a Gromov hyperbolic space, which is a far-reaching notion including differential-geometric as well as more combinatorial spaces via a synthetic approach to negati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fundamental Domain
Given a topological space and a group acting on it, the images of a single point under the group action form an orbit of the action. A fundamental domain or fundamental region is a subset of the space which contains exactly one point from each of these orbits. It serves as a geometric realization for the abstract set of representatives of the orbits. There are many ways to choose a fundamental domain. Typically, a fundamental domain is required to be a connected subset with some restrictions on its boundary, for example, smooth or polyhedral. The images of a chosen fundamental domain under the group action then tile the space. One general construction of fundamental domains uses Voronoi cells. Hints at a general definition Given an action of a group ''G'' on a topological space ''X'' by homeomorphisms, a fundamental domain for this action is a set ''D'' of representatives for the orbits. It is usually required to be a reasonably nice set topologically, in one of several ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hyperbolic Manifold
In mathematics, a hyperbolic manifold is a space where every point looks locally like hyperbolic space of some dimension. They are especially studied in dimensions 2 and 3, where they are called hyperbolic surfaces and hyperbolic 3-manifolds, respectively. In these dimensions, they are important because most manifolds can be made into a hyperbolic manifold by a homeomorphism. This is a consequence of the uniformization theorem for surfaces and the geometrization theorem for 3-manifolds proved by Perelman. Rigorous definition A hyperbolic n-manifold is a complete Riemannian n-manifold of constant sectional curvature -1. Every complete, connected, simply-connected manifold of constant negative curvature -1 is isometric to the real hyperbolic space \mathbb^n. As a result, the universal cover of any closed manifold M of constant negative curvature -1 is \mathbb^n. Thus, every such M can be written as \mathbb^n/\Gamma where \Gamma is a torsion-free discrete group of isometries ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Polytope
A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n-dimensional Euclidean space \mathbb^n. Most texts. use the term "polytope" for a bounded convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others''Mathematical Programming'', by Melvyn W. Jeter (1986) p. 68/ref> (including this article) allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue. Yet other texts identify a convex polytope with its boundary. Convex polytopes play an important role both in various branches of mathematics and in applied areas, most notably in linear programming. In the influential textbooks of Grünbaum and Ziegler on the subject, as well as in many other texts in discrete geometry, convex polytopes are often simply called "polytopes". Grünbaum points out that this is solely to avoid ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polyhedron
In geometry, a polyhedron (: polyhedra or polyhedrons; ) is a three-dimensional figure with flat polygonal Face (geometry), faces, straight Edge (geometry), edges and sharp corners or Vertex (geometry), vertices. The term "polyhedron" may refer either to a solid figure or to its boundary surface (mathematics), surface. The terms solid polyhedron and polyhedral surface are commonly used to distinguish the two concepts. Also, the term ''polyhedron'' is often used to refer implicitly to the whole structure (mathematics), structure formed by a solid polyhedron, its polyhedral surface, its faces, its edges, and its vertices. There are many definitions of polyhedron. Nevertheless, the polyhedron is typically understood as a generalization of a two-dimensional polygon and a three-dimensional specialization of a polytope, a more general concept in any number of dimensions. Polyhedra have several general characteristics that include the number of faces, topological classification by Eule ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Neighborhood (mathematics)
In topology and related areas of mathematics, a neighbourhood (or neighborhood) is one of the basic concepts in a topological space. It is closely related to the concepts of open set and interior. Intuitively speaking, a neighbourhood of a point is a set of points containing that point where one can move some amount in any direction away from that point without leaving the set. Definitions Neighbourhood of a point If X is a topological space and p is a point in X, then a neighbourhood of p is a subset V of X that includes an open set U containing p, p \in U \subseteq V \subseteq X. This is equivalent to the point p \in X belonging to the topological interior of V in X. The neighbourhood V need not be an open subset of X. When V is open (resp. closed, compact, etc.) in X, it is called an (resp. closed neighbourhood, compact neighbourhood, etc.). Some authors require neighbourhoods to be open, so it is important to note their conventions. A set that is a neighbourhood ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean Space
Euclidean space is the fundamental space of geometry, intended to represent physical space. Originally, in Euclid's ''Elements'', it was the three-dimensional space of Euclidean geometry, but in modern mathematics there are ''Euclidean spaces'' of any positive integer dimension ''n'', which are called Euclidean ''n''-spaces when one wants to specify their dimension. For ''n'' equal to one or two, they are commonly called respectively Euclidean lines and Euclidean planes. The qualifier "Euclidean" is used to distinguish Euclidean spaces from other spaces that were later considered in physics and modern mathematics. Ancient Greek geometers introduced Euclidean space for modeling the physical space. Their work was collected by the ancient Greek mathematician Euclid in his ''Elements'', with the great innovation of '' proving'' all properties of the space as theorems, by starting from a few fundamental properties, called '' postulates'', which either were considered as evid ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finitely Generated Group
In algebra, a finitely generated group is a group ''G'' that has some finite generating set ''S'' so that every element of ''G'' can be written as the combination (under the group operation) of finitely many elements of ''S'' and of inverses of such elements. By definition, every finite group is finitely generated, since ''S'' can be taken to be ''G'' itself. Every infinite finitely generated group must be countable but countable groups need not be finitely generated. The additive group of rational numbers Q is an example of a countable group that is not finitely generated. Examples * Every quotient of a finitely generated group ''G'' is finitely generated; the quotient group is generated by the images of the generators of ''G'' under the canonical projection. * A group that is generated by a single element is called cyclic. Every infinite cyclic group is isomorphic to the additive group of the integers Z. ** A locally cyclic group is a group in which every finitely gen ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Density Theorem For Kleinian Groups
In the mathematical theory of Kleinian groups, the density conjecture of Lipman Bers, Dennis Sullivan, and William Thurston, later proved independently by and , states that every finitely generated Kleinian group In mathematics, a Kleinian group is a discrete subgroup of the group (mathematics), group of orientation-preserving Isometry, isometries of hyperbolic 3-space . The latter, identifiable with PSL(2,C), , is the quotient group of the 2 by 2 complex ... is an algebraic limit of geometrically finite Kleinian groups. History suggested the Bers density conjecture, that singly degenerate Kleinian surface groups are on the boundary of a Bers slice. This was proved by for Kleinian surface groups with no parabolic elements. A more general version of Bers's conjecture due to Sullivan and Thurston in the late 1970s and early 1980s states that every finitely generated Kleinian group is an algebraic limit of geometrically finite Kleinian groups. proved this for freely indecom ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
