|
Arrangement Of Lines
In geometry, an arrangement of lines is the subdivision of the Euclidean plane formed by a finite set of lines. An arrangement consists of bounded and unbounded convex polygons, the ''cells'' of the arrangement, line segments and rays, the ''edges'' of the arrangement, and points where two or more lines cross, the ''vertices'' of the arrangement. When considered in the projective plane rather than in the Euclidean plane, every two lines cross, and an arrangement is the projective dual to a finite set of points. Arrangements of lines have also been considered in the hyperbolic plane, and generalized to ''pseudolines'', curves that have similar topological properties to lines. The initial study of arrangements has been attributed to an 1826 paper by Jakob Steiner. An arrangement is said to be ''simple'' when at most two lines cross at each vertex, and ''simplicial'' when all cells are triangles (including the unbounded cells, as subsets of the projective plane). There are three kno ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Roberts's Triangle Theorem
Roberts's triangle theorem, a result in discrete geometry, states that every arrangement of n lines, with no parallel lines and no crossings of more than two lines, has at least n-2 triangular faces. Thus, three lines form a triangle, four lines form at least two triangles, five lines form at least three triangles, etc. It is named after Samuel Roberts, a British mathematician who published it in 1889. Statement and example The theorem states that every simple arrangement of n lines in the Euclidean plane has at least n-2 triangular faces. Here, an arrangement is simple when no two of its lines are parallel and no three lines pass through the same point. A face is one of the polygons formed by the arrangement, not crossed by any of its lines. Faces may be bounded or infinite, but only the bounded faces with exactly three sides count as triangles for the purposes of the theorem. One way to form an arrangement of n lines with exactly n-2 triangular faces is to choose the lines to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Cell Complex
In mathematics, and specifically in topology, a CW complex (also cellular complex or cell complex) is a topological space that is built by gluing together topological balls (so-called ''cells'') of different dimensions in specific ways. It generalizes both manifolds and simplicial complexes and has particular significance for algebraic topology. It was initially introduced by J. H. C. Whitehead to meet the needs of homotopy theory. (open access) CW complexes have better categorical properties than simplicial complexes, but still retain a combinatorial nature that allows for computation (often with a much smaller complex). The C in CW stands for "closure-finite", and the W for "weak" topology. Definition CW complex A CW complex is constructed by taking the union of a sequence of topological spaces \emptyset = X_ \subset X_0 \subset X_1 \subset \cdots such that each X_k is obtained from X_ by gluing copies of k-cells (e^k_\alpha)_\alpha, each homeomorphic to the open k- ball ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Vertex (geometry)
In geometry, a vertex (: vertices or vertexes), also called a corner, is a point (geometry), point where two or more curves, line (geometry), lines, or line segments Tangency, meet or Intersection (geometry), intersect. For example, the point where two lines meet to form an angle and the point where edge (geometry), edges of polygons and polyhedron, polyhedra meet are vertices. Definition Of an angle The ''vertex'' of an angle is the point where two Line (mathematics)#Ray, rays begin or meet, where two line segments join or meet, where two lines intersect (cross), or any appropriate combination of rays, segments, and lines that result in two straight "sides" meeting at one place. :(3 vols.): (vol. 1), (vol. 2), (vol. 3). Of a polytope A vertex is a corner point of a polygon, polyhedron, or other higher-dimensional polytope, formed by the intersection (Euclidean geometry), intersection of Edge (geometry), edges, face (geometry), faces or facets of the object. In a polygon, a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Connected Component (topology)
In topology and related branches of mathematics, a connected space is a topological space that cannot be represented as the union of two or more disjoint non-empty open subsets. Connectedness is one of the principal topological properties that distinguish topological spaces. A subset of a topological space X is a if it is a connected space when viewed as a subspace of X. Some related but stronger conditions are path connected, simply connected, and n-connected. Another related notion is locally connected, which neither implies nor follows from connectedness. Formal definition A topological space X is said to be if it is the union of two disjoint non-empty open sets. Otherwise, X is said to be connected. A subset of a topological space is said to be connected if it is connected under its subspace topology. Some authors exclude the empty set (with its unique topology) as a connected space, but this article does not follow that practice. For a topological space X the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Equivalence Class
In mathematics, when the elements of some set S have a notion of equivalence (formalized as an equivalence relation), then one may naturally split the set S into equivalence classes. These equivalence classes are constructed so that elements a and b belong to the same equivalence class if, and only if, they are equivalent. Formally, given a set S and an equivalence relation \sim on S, the of an element a in S is denoted /math> or, equivalently, to emphasize its equivalence relation \sim, and is defined as the set of all elements in S with which a is \sim-related. The definition of equivalence relations implies that the equivalence classes form a partition of S, meaning, that every element of the set belongs to exactly one equivalence class. The set of the equivalence classes is sometimes called the quotient set or the quotient space of S by \sim, and is denoted by S /. When the set S has some structure (such as a group operation or a topology) and the equivalence re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Equivalence Relation
In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric, and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. A simpler example is equality. Any number a is equal to itself (reflexive). If a = b, then b = a (symmetric). If a = b and b = c, then a = c (transitive). Each equivalence relation provides a partition of the underlying set into disjoint equivalence classes. Two elements of the given set are equivalent to each other if and only if they belong to the same equivalence class. Notation Various notations are used in the literature to denote that two elements a and b of a set are equivalent with respect to an equivalence relation R; the most common are "a \sim b" and "", which are used when R is implicit, and variations of "a \sim_R b", "", or "" to specify R explicitly. Non-equivalence may be written "" or "a \not\equiv b". Definitions A binary relation \,\si ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Half-plane
In mathematics, the upper half-plane, is the set of points in the Cartesian plane with The lower half-plane is the set of points with instead. Arbitrary oriented half-planes can be obtained via a planar rotation. Half-planes are an example of two-dimensional half-space. A half-plane can be split in two quadrants. Affine geometry The affine transformations of the upper half-plane include # shifts (x,y)\mapsto (x+c,y), c\in\mathbb, and # dilations (x,y)\mapsto (\lambda x,\lambda y), \lambda > 0. Proposition: Let and 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 to Then take \lambda=(\text\ B)/(\text\ A) and dilate. Then shift to the center of Inversive geometry Definition: \mathcal := \left\ . can be recognized as the circle of radius centered at and as the polar plot of \rho(\theta) = \cos \theta. Proposition: in and are collinear points. In ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Vertex (geometry)
In geometry, a vertex (: vertices or vertexes), also called a corner, is a point (geometry), point where two or more curves, line (geometry), lines, or line segments Tangency, meet or Intersection (geometry), intersect. For example, the point where two lines meet to form an angle and the point where edge (geometry), edges of polygons and polyhedron, polyhedra meet are vertices. Definition Of an angle The ''vertex'' of an angle is the point where two Line (mathematics)#Ray, rays begin or meet, where two line segments join or meet, where two lines intersect (cross), or any appropriate combination of rays, segments, and lines that result in two straight "sides" meeting at one place. :(3 vols.): (vol. 1), (vol. 2), (vol. 3). Of a polytope A vertex is a corner point of a polygon, polyhedron, or other higher-dimensional polytope, formed by the intersection (Euclidean geometry), intersection of Edge (geometry), edges, face (geometry), faces or facets of the object. In a polygon, a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Ray (geometry)
In geometry, a straight line, usually abbreviated line, is an infinitely long object with no width, depth, or curvature, an idealization of such physical objects as a straightedge, a taut string, or a ray of light. Lines are spaces of dimension one, which may be embedded in spaces of dimension two, three, or higher. The word ''line'' may also refer, in everyday life, to a line segment, which is a part of a line delimited by two points (its ''endpoints''). Euclid's ''Elements'' defines a straight line as a "breadthless length" that "lies evenly with respect to the points on itself", and introduced several postulates as basic unprovable properties on which the rest of geometry was established. ''Euclidean line'' and ''Euclidean geometry'' are terms introduced to avoid confusion with generalizations introduced since the end of the 19th century, such as non-Euclidean, projective, and affine geometry. Properties In the Greek deductive geometry of Euclid's ''Elements'', ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Thought Experiment
A thought experiment is an imaginary scenario that is meant to elucidate or test an argument or theory. It is often an experiment that would be hard, impossible, or unethical to actually perform. It can also be an abstract hypothetical that is meant to test our intuitions about morality or other fundamental philosophical questions. History The ancient Greek , "was the most ancient pattern of mathematical proof", and existed before Euclidean geometry, Euclidean mathematics, where the emphasis was on the conceptual, rather than on the experimental part of a thought experiment. Johann Witt-Hansen established that Hans Christian Ørsted was the first to use the equivalent German term . Ørsted was also the first to use the equivalent term in 1820. By 1883, Ernst Mach used in a different sense, to denote exclusively the conduct of a experiment that would be subsequently performed as a by his students. Physical and mental experimentation could then be contrasted: Mach asked hi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Shortest Path Problem
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. The problem of finding the shortest path between two intersections on a road map may be modeled as a special case of the shortest path problem in graphs, where the vertices correspond to intersections and the edges correspond to road segments, each weighted by the length or distance of each segment. Definition The shortest path problem can be defined for graphs whether undirected, directed, or mixed. The definition for undirected graphs states that every edge can be traversed in either direction. Directed graphs require that consecutive vertices be connected by an appropriate directed edge. Two vertices are adjacent when they are both incident to a common edge. A path in an undirected graph is a sequence of vertices P = ( v_1, v_2, \ldots, v_n ) \in V \times V \times \cdots \times V ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
