In geometric topology and differential topology, an (n + 1)-dimensional cobordism W between n-dimensional manifolds M and N is an h-cobordism (the h stands for homotopy equivalence) if the inclusion maps
are homotopy equivalences.
The h-cobordism theorem gives sufficient conditions for an h-cobordism to be trivial, i.e., to be C-isomorphic to the cylinder M × [0, 1]. Here C refers to any of the categories of smooth, piecewise linear, or topological manifolds.
The theorem was first proved by Stephen Smale for which he received the Fields Medal and is a fundamental result in the theory of high-dimensional manifolds. For a start, it almost immediately proves the generalized Poincaré conjecture.
Before Smale proved this theorem, mathematicians became stuck while trying to understand manifolds of dimension 3 or 4, and assumed that the higher-dimensional cases were even harder. The h-cobordism theorem showed that (simply connected) manifolds of dimension at least 5 are much easier than those of dimension 3 or 4. The proof of the theorem depends on the "Whitney trick" of Hassler Whitney, which geometrically untangles homologically-tangled spheres of complementary dimension in a manifold of dimension >4. An informal reason why manifolds of dimension 3 or 4 are unusually hard is that the trick fails to work in lower dimensions, which have no room for entanglement.
Let n be at least 5 and let W be a compact (n + 1)-dimensional h-cobordism between M and N in the category C=Diff, PL, or Top such that W, M and N are simply connected, then W is C-isomorphic to M × [0, 1]. The isomorphism can be chosen to be the identity on M × {0}.
This means that the homotopy equivalence between M and N (or, between M × [0, 1], W and N × [0, 1]) is homotopic to a C-isomorphism.
For n = 4, the h-cobordism theorem is true topologically (proved by Michael Freedman using a 4-dimensional Whitney trick) but is false PL and smoothly (as shown by Simon Donaldson).
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
In mathematics, specifically in geometric topology, surgery theory is a collection of techniques used to produce one finite-dimensional manifold from another in a 'controlled' way, introduced by . Milnor called this technique surgery, while Andrew Wallace called it spherical modification. The "surgery" on a differentiable manifold M of dimension , could be described as removing an imbedded sphere of dimension p from M. Originally developed for differentiable (or, smooth) manifolds, surgery techniques also apply to piecewise linear (PL-) and topological manifolds.
In mathematics, a 4-manifold is a 4-dimensional topological manifold. A smooth 4-manifold is a 4-manifold with a smooth structure. In dimension four, in marked contrast with lower dimensions, topological and smooth manifolds are quite different. There exist some topological 4-manifolds which admit no smooth structure, and even if there exists a smooth structure, it need not be unique (i.e. there are smooth 4-manifolds which are homeomorphic but not diffeomorphic).
In mathematics, a manifold is a topological space that locally resembles Euclidean space near each point. More precisely, an -dimensional manifold, or -manifold for short, is a topological space with the property that each point has a neighborhood that is homeomorphic to an open subset of -dimensional Euclidean space. One-dimensional manifolds include lines and circles, but not lemniscates. Two-dimensional manifolds are also called surfaces. Examples include the plane, the sphere, and the torus, and also the Klein bottle and real projective plane.
We give a constant factor approximation algorithm for the Asymmetric Traveling Salesman Problem on shortest path metrics of directed graphs with two different edge weights. For the case of unit edge weights, the first constant factor approximation was give ...
We give a constant factor approximation algorithm for the Asymmetric Traveling Salesman Problem on shortest path metrics of directed graphs with two different edge weights. For the case of unit edge weights, the first constant factor approximation was give ...