Difference between revisions of "Polyhedron, abstract"
(Importing text file) |
Ulf Rehmann (talk | contribs) m |
||
Line 1: | Line 1: | ||
+ | {{DEF}} | ||
+ | {{TEX|want}} | ||
+ | |||
The union of a locally finite family of convex polytopes in a certain <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736701.png" />. By a convex polytope one understands the intersection of a finite number of closed half-spaces if this intersection is bounded. Local finiteness of the family means that each point in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736702.png" /> has a neighbourhood that intersects only with a finite number of the polytopes. A compact polyhedron is the union of a finite number of convex polytopes. The dimension of a polyhedron is the maximum dimension of the constituent polytopes. Any open subset of an (abstract) polyhedron, in particular any open subset of a Euclidean space, is a polyhedron. Other polyhedra are: the [[Cone|cone]] and the [[Suspension|suspension]] over a compact polyhedron. Simple examples (a cone over an open interval) show that the join of a compact and a non-compact polyhedron need be not a polyhedron. The name subpolyhedron of a polyhedron <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736703.png" /> is given to any polyhedron <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736704.png" /> lying in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736705.png" />. Sometimes one restricts the consideration to closed subpolyhedra. Each point <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736706.png" /> in a polyhedron <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736707.png" /> has in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736708.png" /> a neighbourhood that is a cone in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736709.png" /> with vertex <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p07367010.png" /> and with a compact base. This property is characteristic: Any subset in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p07367011.png" /> each point of which has a conical neighbourhood with a compact base is a polyhedron. | The union of a locally finite family of convex polytopes in a certain <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736701.png" />. By a convex polytope one understands the intersection of a finite number of closed half-spaces if this intersection is bounded. Local finiteness of the family means that each point in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736702.png" /> has a neighbourhood that intersects only with a finite number of the polytopes. A compact polyhedron is the union of a finite number of convex polytopes. The dimension of a polyhedron is the maximum dimension of the constituent polytopes. Any open subset of an (abstract) polyhedron, in particular any open subset of a Euclidean space, is a polyhedron. Other polyhedra are: the [[Cone|cone]] and the [[Suspension|suspension]] over a compact polyhedron. Simple examples (a cone over an open interval) show that the join of a compact and a non-compact polyhedron need be not a polyhedron. The name subpolyhedron of a polyhedron <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736703.png" /> is given to any polyhedron <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736704.png" /> lying in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736705.png" />. Sometimes one restricts the consideration to closed subpolyhedra. Each point <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736706.png" /> in a polyhedron <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736707.png" /> has in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736708.png" /> a neighbourhood that is a cone in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p0736709.png" /> with vertex <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p07367010.png" /> and with a compact base. This property is characteristic: Any subset in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p073/p073670/p07367011.png" /> each point of which has a conical neighbourhood with a compact base is a polyhedron. | ||
Revision as of 12:24, 25 April 2012
This page is deficient and requires revision. Please see Talk:Polyhedron, abstract for further comments.
The union of a locally finite family of convex polytopes in a certain . By a convex polytope one understands the intersection of a finite number of closed half-spaces if this intersection is bounded. Local finiteness of the family means that each point in has a neighbourhood that intersects only with a finite number of the polytopes. A compact polyhedron is the union of a finite number of convex polytopes. The dimension of a polyhedron is the maximum dimension of the constituent polytopes. Any open subset of an (abstract) polyhedron, in particular any open subset of a Euclidean space, is a polyhedron. Other polyhedra are: the cone and the suspension over a compact polyhedron. Simple examples (a cone over an open interval) show that the join of a compact and a non-compact polyhedron need be not a polyhedron. The name subpolyhedron of a polyhedron is given to any polyhedron lying in . Sometimes one restricts the consideration to closed subpolyhedra. Each point in a polyhedron has in a neighbourhood that is a cone in with vertex and with a compact base. This property is characteristic: Any subset in each point of which has a conical neighbourhood with a compact base is a polyhedron.
Any compact polyhedron can be split up into a finite number of closed simplices in such a way that any two simplices either do not intersect or else intersect in a common face. In the case of a non-compact polyhedron it is required that the family of simplices should be locally finite. This decomposition is called a rectilinear triangulation of the polyhedron. Any two triangulations of a given polyhedron have a common subdivision. If is a closed subpolyhedron of a polyhedron , then any triangulation of can be extended to a certain triangulation of . In that case it is said that the resulting pair of geometrical simplicial complexes triangulates the pair . A mapping of a polyhedron into a polyhedron is called a piecewise-linear mapping (or a pl-mapping) if is simplicial with respect to certain triangulations of and (cf. Simplicial mapping). An equivalent definition is that is piecewise linear if is locally conical, i.e. if each point has a conical neighbourhood such that for any and , . For a mapping to be piecewise linear it is necessary and sufficient that its graph is a polyhedron.
A superposition of piecewise-linear mappings is piecewise linear. The inverse mapping of an invertible piecewise-linear mapping is piecewise linear. In that case is called a pl-homeomorphism.
The category whose objects are polyhedra (and polyhedral pairs) and whose morphisms are pl-mappings is denoted by PL or by (see also Piecewise-linear topology). The category PL is one of the basic objects and tools of research in topology. The role of the category PL is particularly great in algebraic topology and in the topology of manifolds, because the class of polyhedra is fairly wide.
For example, each differentiable manifold can be represented in a natural way as a polyhedron. Each continuous mapping of one polyhedron into another can be approximated arbitrary closely by a pl-mapping. Therefore the category PL is a good approximation to the category of all topological spaces and continuous mappings. On the other hand, the triangulation of a polyhedron enables one to use methods from combinatorial topology. Many algebraic invariants (for example, the homology group or cohomology ring) can be constructed and effectively calculated by decomposition into simplices. The question whether all homeomorphic polyhedra are pl-homeomorphic is called the Hauptvermutung and the answer is negative: For there exist homeomorphic -dimensional polyhedra that are not pl-homeomorphic [3]. There also exist different pl-structures on certain closed -manifolds. For , homeomorphic -dimensional polyhedra are pl-homeomorphic. A polyhedron is called an -dimensional pl-manifold if each point in it has a neighbourhood that is pl-homeomorphic to or . Any rectilinear triangulation of a pl-manifold is combinatorial. This means that the star at each of its vertices is combinatorially equivalent to a simplex. The Hauptvermutung for polyhedra that are -dimensional topological manifolds naturally splits up into two hypotheses: the hypothesis that any triangulation of such a polyhedron is combinatorial and the Hauptvermutung for pl-manifolds. One of the major achievements in modern topology is that a negative answer has been obtained to both hypotheses for [4], [5]. The two hypotheses are true for .
Let be a compact subpolyhedron of a polyhedron and let the pair of geometrical simplicial complexes triangulate the pair in such a way that is a complete subcomplex. This means that each simplex of with vertices in also lies in ; this can always be achieved by passing to a derived subdivision. The polyhedron consisting of all closed simplices of a derived subdivision having vertices in is called a regular neighbourhood of in , and the same applies to its image under any pl-homeomorphism of into itself that leaves invariant. For any two regular neighbourhoods and of there exists a pl-isotopy that leaves invariant, namely , which deforms to , i.e. is such that and . One says that the polyhedron is obtained by an elementary polyhedral collapse of a polyhedron if for some the pair is pl-homeomorphic to the pair . The polyhedron polyhedrally collapses to its subpolyhedron (denoted by ) if one can pass from to by a finite sequence of elementary polyhedral collapses. If , then in a certain triangulation of the pair the polyhedron can be obtained from by a sequence of elementary combinatorial collapses each of which consists in deleting a principal simplex along with its free face. If is an -dimensional pl-manifold, then any regular neighbourhood of a compact polyhedron is an -dimensional pl-manifold and collapses polyhedrally to . This property is characteristic: If the -dimensional pl-manifold is such that and , then is a regular neighbourhood in . Any regular neighbourhood of the boundary of a compact pl-manifold is pl-homeomorphic to .
Let and be closed subpolyhedra of an -dimensional pl-manifold , , . It is said that and are in general position if . Any closed subpolyhedra may be moved into general position by an arbitrarily small isotopy (cf. Isotopy (in topology)) in . This means that for any there exists an (-pl)-isotopy such that the polyhedra and are in general position. Sometimes one includes conditions of transversality type in the definition of general position. For example, if , one can ensure that for each point and a certain neighbourhood of the point in , the triple will be pl-homeomorphic to the triple .
A curved or topological polyhedron is a topological space equipped with a homeomorphism , where is a polyhedron. The images of the simplices in some triangulation of form a curvilinear triangulation of . It is also said that the homeomorphism defines a pl-structure on . Two pl-structures , , coincide if the homeomorphism is piecewise linear, and they are isotopic if the homeomorphism is isotopic to a piecewise-linear one, while they are equivalent if and are pl-homeomorphic. For any differentiable manifold there exists a pl-structure compatible with the differentiable structure on . This means that for each closed simplex of some triangulation of the polyhedron the mapping is differentiable and does not have singular points. Any two such pl-structures in are isotopic. All the concepts defined for a polyhedron (triangulation, subpolyhedron, regular neighbourhood, and general position) can be transferred by means of the homeomorphism to the curvilinear polyhedron .
References
[1] | P.S. Aleksandrov, "Combinatorial topology" , Graylock , Rochester (1956) (Translated from Russian) |
[2] | C.P. Rourke, B.J. Sanderson, "Introduction to piecewise-linear topology" , Springer (1972) |
[3] | J. Milnor, "Two complexes which are homeomorphic but combinatorially distinct" Ann. of Math. , 74 : 3 (1961) pp. 575–590 |
[4] | R.C. Kirby, L.C. Siebenmann, "Foundational essays on topological manifolds, smoothings, and triangulations" , Princeton Univ. Press (1977) |
[5] | R.D. Edwards, "The double suspension of a certain homology 3-sphere is " Notices Amer. Math. Soc. , 22 : 2 (1975) pp. A-334 |
Comments
Recent developments include: imbedding of topological manifolds as polyhedra with convex (or non-convex) faces in a Euclidean , in particular in (e.g., polyhedral realizations of regular mappings (i.e. analogues of the regular polyhedra)); polyhedra of given genus with minimal number of vertices or edges or faces; colouring problems; and polyhedral realizations of famous configurations in geometry or topology.
References
[a1] | U. Brehm, W. Kühnel, "A polyhedral model for Cartan's hypersurfaces in " Mathematika , 33 (1986) pp. 55–61 |
[a2] | B. Grünbaum, "Regular polyhedra - old and new" Aequat. Math. , 16 (1977) pp. 1–20 |
[a3] | P. McMullen, Ch. Schulz, J.M. Wills, "Polyhedral -manifolds in with unusually large genus" Israel J. of Math. , 46 (1983) pp. 127–144 |
[a4] | E. Schulte, J.M. Wills, "A polyhedral realization of Felix Klein's map on a Riemann surface of genus 3" J. London Math. Soc. , 32 (1985) pp. 539–547 |
[a5] | U. Brehm, "Maximally symmetric polyhedral realizations of Dyck's regular map" Mathematika , 34 (1987) pp. 229–236 |
[a6] | J.R. Munkres, "Elementary differential topology" , Princeton Univ. Press (1963) |
[a7] | L.C. Glaser, "Geometrical combinatorial topology" , 1–2 , v. Nostrand (1970) |
Polyhedron, abstract. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Polyhedron,_abstract&oldid=25374