Halfplane
In geometry, a half-space is either of the two parts into which a plane divides the three-dimensional Euclidean space. If the space is two-dimensional, then a half-space is called a half-plane (open or closed). A half-space in a one-dimensional space is called a ''half-line'' or '' ray''. More generally, a half-space is either of the two parts into which a hyperplane divides an affine space. That is, the points that are not incident to the hyperplane are partitioned into two convex sets (i.e., half-spaces), such that any subspace connecting a point in one set to a point in the other must intersect the hyperplane. A half-space can be either ''open'' or ''closed''. An open half-space is either of the two open sets produced by the subtraction of a hyperplane from the affine space. A closed half-space is the union of an open half-space and the hyperplane that defines it. A half-space may be specified by a linear inequality, derived from the linear equation that specifies the defin ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Poincaré Half-plane Model
In non-Euclidean geometry, the Poincaré half-plane model is the upper half-plane, denoted below as H = \, together with a metric, the Poincaré metric, that makes it a model of two-dimensional hyperbolic geometry. Equivalently the Poincaré half-plane model is sometimes described as a complex plane where the imaginary part (the ''y'' coordinate mentioned above) is positive. The Poincaré half-plane model is named after Henri Poincaré, but it originated with Eugenio Beltrami who used it, along with the Klein model and the Poincaré disk model, to show that hyperbolic geometry was equiconsistent with Euclidean geometry. This model is conformal which means that the angles measured at a point are the same in the model as they are in the actual hyperbolic plane. The Cayley transform provides an isometry between the half-plane model and the Poincaré disk model. This model can be generalized to model an n+1 dimensional hyperbolic space by replacing the real number ''x'' by a v ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Nef Polygon
In mathematics Nef polygons and Nef polyhedra are the sets of polygons and polyhedra which can be obtained from a finite set of halfplanes ( halfspaces) by Boolean operations of set intersection and set complement. The objects are named after the Swiss mathematician Walter Nef (1919–2013), who introduced them in his 1978 book on polyhedra. Since other Boolean operations, such as union or difference, may be expressed via intersection and complement operations, the sets of Nef polygons (polyhedra) are closed with respect to these operations as well. In addition, the class of Nef polyhedra is closed with respect to the topological operations of taking closure, interior, exterior, and boundary. Boolean operations, such as difference or intersection, may produce non-regular sets. However the class of Nef polyhedra is also closed with respect to the operation of regularization. Convex polytopes are a special subclass of Nef polyhedra, being the set of polyhedra which are the intersec ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Geometry
Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is called a ''geometer''. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point, line, plane, distance, angle, surface, and curve, as fundamental concepts. During the 19th century several discoveries enlarged dramatically the scope of geometry. One of the oldest such discoveries is Carl Friedrich Gauss' ("remarkable theorem") that asserts roughly that the Gaussian curvature of a surface is independent from any specific embedding in a Euclidean space. This implies that surfaces can be studied ''intrinsically'', that is, as stand-alone spaces, and has been expanded into the theory of manifolds and Riemannian geometry. Later in the 19th century, it appeared that geometries ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Open Set
In mathematics, open sets are a generalization of open intervals in the real line. In a metric space (a set along with a distance defined between any two points), open sets are the sets that, with every point , contain all points that are sufficiently near to (that is, all points whose distance to is less than some value depending on ). More generally, one defines open sets as the members of a given collection of subsets of a given set, a collection that has the property of containing every union of its members, every finite intersection of its members, the empty set, and the whole set itself. A set in which such a collection is given is called a topological space, and the collection is called a topology. These conditions are very loose, and allow enormous flexibility in the choice of open sets. For example, ''every'' subset can be open (the discrete topology), or no set can be open except the space itself and the empty set (the indiscrete topology). In practice, however, ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Siegel Upper Half-space
In mathematics, the Siegel upper half-space of degree ''g'' (or genus ''g'') (also called the Siegel upper half-plane) is the set of ''g'' × ''g'' symmetric matrices over the complex numbers whose imaginary part is positive definite. It was introduced by . It is the symmetric space associated to the symplectic group . The Siegel upper half-space has properties as a complex manifold that generalize the properties of the upper half-plane, which is the Siegel upper half-space in the special case ''g=1''. The group of automorphisms preserving the complex structure of the manifold is isomorphic to the symplectic group . Just as the two-dimensional hyperbolic metric is the unique (up to scaling) metric on the upper half-plane whose isometry group is the complex automorphism group = , the Siegel upper half-space has only one metric up to scaling whose isometry group is . Writing a generic matrix ''Z'' in the Siegel upper half-space in terms of its real and imaginary parts as ' ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Upper Half-plane
In mathematics, the upper half-plane, \,\mathcal\,, is the set of points in the Cartesian plane with > 0. Complex plane Mathematicians sometimes identify the Cartesian plane with the complex plane, and then the upper half-plane corresponds to the set of complex numbers with positive imaginary part: :\mathcal \equiv \ ~. The term arises from a common visualization of the complex number as the point in the plane endowed with Cartesian coordinates. When the axis is oriented vertically, the "upper half-plane" corresponds to the region above the axis and thus complex numbers for which > 0. It is the domain of many functions of interest in complex analysis, especially modular forms. The lower half-plane, defined by 0. Proposition: Let ''A'' and ''B'' be semicircles in the upper half-plane with centers on the boundary. Then there is an affine mapping that takes ''A'' to ''B''. :Proof: First shift the center of ''A'' to (0,0). Then take λ = (diame ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Line (geometry)
In geometry, a line is an infinitely long object with no width, depth, or curvature. Thus, lines are one-dimensional objects, though they may exist in two, three, or higher dimension spaces. The word ''line'' may also refer to a line segment in everyday life, which has two points to denote its ends. Lines can be referred by two points that lay on it (e.g., \overleftrightarrow) or by a single letter (e.g., \ell). Euclid described a line as "breadthless length" which "lies evenly with respect to the points on itself"; he introduced several postulates as basic unprovable properties from which he constructed all of geometry, which is now called Euclidean geometry to avoid confusion with other geometries which have been introduced since the end of the 19th century (such as non-Euclidean, projective and affine geometry). In modern mathematics, given the multitude of geometries, the concept of a line is closely tied to the way the geometry is described. For instance, in analytic ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Inequality (mathematics)
In mathematics, an inequality is a relation which makes a non-equal comparison between two numbers or other mathematical expressions. It is used most often to compare two numbers on the number line by their size. There are several different notations used to represent different kinds of inequalities: * The notation ''a'' ''b'' means that ''a'' is greater than ''b''. In either case, ''a'' is not equal to ''b''. These relations are known as strict inequalities, meaning that ''a'' is strictly less than or strictly greater than ''b''. Equivalence is excluded. In contrast to strict inequalities, there are two types of inequality relations that are not strict: * The notation ''a'' ≤ ''b'' or ''a'' ⩽ ''b'' means that ''a'' is less than or equal to ''b'' (or, equivalently, at most ''b'', or not greater than ''b''). * The notation ''a'' ≥ ''b'' or ''a'' ⩾ ''b'' means that ''a'' is greater than or equal to ''b'' (or, equivalently, at least ''b'', or not less than ''b''). The re ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Linear Equation
In mathematics, a linear equation is an equation that may be put in the form a_1x_1+\ldots+a_nx_n+b=0, where x_1,\ldots,x_n are the variables (or unknowns), and b,a_1,\ldots,a_n are the coefficients, which are often real numbers. The coefficients may be considered as parameters of the equation, and may be arbitrary expressions, provided they do not contain any of the variables. To yield a meaningful equation, the coefficients a_1, \ldots, a_n are required to not all be zero. Alternatively, a linear equation can be obtained by equating to zero a linear polynomial over some field, from which the coefficients are taken. The solutions of such an equation are the values that, when substituted for the unknowns, make the equality true. In the case of just one variable, there is exactly one solution (provided that a_1\ne 0). Often, the term ''linear equation'' refers implicitly to this particular case, in which the variable is sensibly called the ''unknown''. In the case of two vari ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Convex Set
In geometry, a subset of a Euclidean space, or more generally an affine space over the reals, is convex if, given any two points in the subset, the subset contains the whole line segment that joins them. Equivalently, a convex set or a convex region is a subset that intersects every line into a single line segment (possibly empty). For example, a solid cube is a convex set, but anything that is hollow or has an indent, for example, a crescent shape, is not convex. The boundary of a convex set is always a convex curve. The intersection of all the convex sets that contain a given subset of Euclidean space is called the convex hull of . It is the smallest convex set containing . A convex function is a real-valued function defined on an interval with the property that its epigraph (the set of points on or above the graph of the function) is a convex set. Convex minimization is a subfield of optimization that studies the problem of minimizing convex functions over convex se ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Plane (geometry)
In mathematics, a plane is a Euclidean (flat), two-dimensional surface that extends indefinitely. A plane is the two-dimensional analogue of a point (zero dimensions), a line (one dimension) and three-dimensional space. Planes can arise as subspaces of some higher-dimensional space, as with one of a room's walls, infinitely extended, or they may enjoy an independent existence in their own right, as in the setting of two-dimensional Euclidean geometry. Sometimes the word ''plane'' is used more generally to describe a two-dimensional surface, for example the hyperbolic plane and elliptic plane. When working exclusively in two-dimensional Euclidean space, the definite article is used, so ''the'' plane refers to the whole space. Many fundamental tasks in mathematics, geometry, trigonometry, graph theory, and graphing are performed in a two-dimensional space, often in the plane. Euclidean geometry Euclid set forth the first great landmark of mathematical thought, an axiomatic ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Partition (set Theory)
In mathematics, a partition of a set is a grouping of its elements into non-empty subsets, in such a way that every element is included in exactly one subset. Every equivalence relation on a set defines a partition of this set, and every partition defines an equivalence relation. A set equipped with an equivalence relation or a partition is sometimes called a setoid, typically in type theory and proof theory. Definition and Notation A partition of a set ''X'' is a set of non-empty subsets of ''X'' such that every element ''x'' in ''X'' is in exactly one of these subsets (i.e., ''X'' is a disjoint union of the subsets). Equivalently, a family of sets ''P'' is a partition of ''X'' if and only if all of the following conditions hold: *The family ''P'' does not contain the empty set (that is \emptyset \notin P). *The union of the sets in ''P'' is equal to ''X'' (that is \textstyle\bigcup_ A = X). The sets in ''P'' are said to exhaust or cover ''X''. See also collectively exhaus ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |