How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Homotopy excision for a single relative cell layer
Statement
Let be a CW union with and a specified point . Suppose is obtained from by attaching finitely many cells of dimensions at least , each with its entire attaching boundary in . Suppose is obtained from by finitely many relative cells of dimensions at least . The map is an isomorphism for and a surjection for positive . In degree one, isomorphism means pointed bijection. The common subcomplex may be infinite or disconnected. No choice principle is required.
Facts & Assumptions
Relative homotopy classes and groups specifies with bottom face in the subspace and all other faces, denoted , fixed at . Relative homotopy operations are well defined in their valid degrees gives its equivalence relation and functoriality.
CW complex with closure finiteness and weak topology and Skeleta, CW subcomplexes, and relative CW complexes give the Hausdorff attachment quotients and characteristic-disk coordinates. Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide, A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact and In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones give the compactness and closedness used in the finite mesh construction. Interval exponential law and quotient homotopies makes every attachment quotient remain quotient after product with the interval. The interpolation, avoidance and punctured-disk deformation are constructed below for the dimensions actually used here.
Weak equivalences of pairs induce isomorphisms on relative homotopy compares arbitrary pairs when both ambient and subspace maps are weak equivalences, including pointed degree one.
Weak homotopy equivalence uses all basepoints. Higher homotopy basepoint transport and moving homotopies makes a deformation retraction a weak equivalence at arbitrary basepoints: its track conjugates the induced maps by transport isomorphisms.
Proof
Given: The CW union and the positive integers . We first suppose has a single relative cell, of dimension . Write the finitely many cells of as , where .
Each of these open cells is open in , since all its attaching boundary is in and no other relative cell attaches to its interior. Give it the coordinate chart from its supplied characteristic map, using on the open disk. Every closed coordinate ball is compact and hence closed in the Hausdorff CW space. For any map one can make the following local modification in a selected cell, without changing any point mapped outside that cell. Put and for its coordinate balls. If is empty, leave unchanged and take a small coordinate cube about zero missed by its image. Otherwise compactness separates from the closed complement of by a positive distance, and gives uniform continuity of the coordinate map on . These facts follow by the finite-subcover argument in [F2], without selecting an infinite family of neighborhoods.
Choose a finite cubical mesh of with diameter small enough that the union of cubes meeting cubes that meet lies in , and the coordinate oscillation of on each such cube is less than . Let be the union of cubes meeting . Triangulate the cubes by successively coning their faces from their centers. Let interpolate affinely on these simplices, and let be the affine function with value one on vertices in and zero at the other vertices of . Then on and zero on the relative boundary of . The homotopy on , unchanged elsewhere, is continuous by closed pasting, stays within the selected open cell, and is fixed outside its inverse image. Its endpoint is affine on each simplex of . Outside its image misses : on a simplex meeting the complement of , take a point whose original image has norm greater than one; all its vertex images, and their convex interpolations, are within of that image. This finite estimate makes no comparison between and .
For any finite choice of interior points in the indicated relative cells, radially deform each punctured characteristic disk onto its boundary as follows. If the removed point has disk coordinate , then for the ray meets the boundary at the unique positive parameter ; solving its quadratic equation gives a continuous function with and on the boundary. The formula stays in the punctured disk and fixes its boundary. Use it simultaneously on the finitely many selected disks and the identity on . The attachment prescriptions agree on every boundary, and [F2]'s quotient-times-interval theorem makes the descended deformation continuous. It gives deformation retractions , , and , fixing the named target subspaces. The target need not be finite: it is simply the unchanged summand of the attachment quotient. Finite point sets are closed in the Hausdorff CW space, so restricting the quotient over their open complement is valid. The deformation restricts on to a deformation retraction onto ; it fixes 's complement in throughout. Thus and are weak equivalences by [F4].
Among the finitely many affine maps on the simplices of , discard their images of rank less than by choosing a small closed coordinate cube with nonempty interior inside disjoint from all those images. Such a cube exists: each deficient image lies in a proper affine hyperplane. For the finitely many nonzero normals , choose with every , avoiding the finitely many roots of the resulting nonzero polynomials. A short line segment parallel to inside the ball meets each affine hyperplane at most once, so it contains a point outside their finite union. The positive distance from that point to the closed finite union permits the required small cube. On each remaining simplex , the restriction to its affine hull has rank . Therefore for every , is compact and convex, given by finitely many linear equations and inequalities, and lies in an affine space of dimension . The preimage of itself is also a finite union of compact convex polyhedra on which is affine. If all simplex images were deficient, so this preimage is empty. Apply steps 1.1–3.1 successively in the finitely many relative cells. Each modification stays inside its selected cell and fixes its complement, so the preceding other-cell data are retained. Denote the final map again by . These preliminary homotopies preserve every prescribed subcomplex-valued face and every face constant at .
It follows from [F3] and step 2.2 that the inclusions of pairs and induce bijections on every positive relative homotopy set, and isomorphisms in group degrees. The resulting square with horizontal inclusions commutes, since all four maps are inclusions. All deformations fix . These are the two vertical comparisons for the graph deformation.
Suppose , and let be any point of the interior of the cube selected in the -cell. Its inverse image is a finite union of compact convex sets contained in affine subspaces of dimension at most , by step 3.1; it is empty if . Let forget the last coordinate and set . Each of the finitely many pieces of is contained in an affine subspace of dimension at most ; projection cannot increase the dimension of an affine span, and restoring one coordinate increases it by at most one. On each affine simplex describing , the image of its intersection with lies in an affine subspace of dimension at most . There are finitely many such spans. The same finite-hyperplane argument as step 3.1 gives outside all these images. Consequently is disjoint from for every . This uses only the dimension of affine spans; no transversality theorem is assumed. Put and .
For a relative representative , the compact set misses . Thus its projection misses , and its last coordinates have a maximum less than one. Its projection is disjoint from the compact set by step 4.1. If is nonempty, choose larger than all those last coordinates and a continuous function equal to one on and zero on a neighborhood of . Explicitly the two compact sets have positive distance when the second is nonempty; choose a positive smaller than that distance and put . If the second set is empty any positive works. Set . If is empty set . Every -preimage lies strictly below the graph of ; every -preimage lies above it, because its projection has and its last coordinate is positive, the bottom face mapping to . Also on and everywhere.
Define The formula preserves the top and side faces at . On the bottom face it avoids for every , by the graph inequalities in step 5.1. At the whole image avoids . Therefore this is a homotopy of relative representatives in from the original representative to one lying in . It need not be a homotopy in ; the comparison in step 3.2 accounts for this change of subspace.
Now let and start with a representative of . Perform steps 1.1–6.1 with . The preliminary homotopies do stay in , and the final representative lies in the lower-left pair of step 3.2. Its class therefore comes from a unique class of under the left vertical bijection. Commutativity and the right vertical injectivity in step 3.2 show that this class maps to the original class in . This proves surjectivity throughout this range.
For injectivity let have a relative homotopy in , with parameter , and suppose . Regard this homotopy as a map of a -cube, ordered as with and the last relative coordinate. Apply steps 1.1–4.1 with . The preliminary homotopies can change , but only through relative maps in : modifications in the -cell fix their whole images, and modifications in the -cells fix their boundary images in . The -preimage projects in the coordinates away from and away from , since the endpoints lie in . Its -coordinate is bounded below one. Use the distance formula of step 5.1 with this additional closed endpoint set in the zero set to obtain at as well as on the side boundary. The same graph reparametrization in then leaves the two modified endpoint cubes unchanged, removes the -preimage, and keeps every bottom face outside . It produces a homotopy of the two modified endpoint cubes in . The left vertical bijection in step 3.2 implies their equality in , hence equality of the original classes as well. This argument proves injectivity even for pointed relative degree one.
This proves the one--cell result. For finitely many cells, remove a cell of maximum relative dimension and put , . The complement is a subcomplex: boundaries of other relative cells have smaller dimension, and boundaries of cells in stay in . Regard the new common subcomplex as , the new first side as , and the second side as . The first side's relative cell boundaries still lie in . The one-cell result says that is bijective for and surjective for positive . Since , this is a bijection throughout and a surjection at positive . Repeat finitely, stopping at . The composite is the required inclusion map, so composition gives the claimed ranges.
If there are no cells the map is the identity. If there are no cells, and , so both relative sets are singletons: a relative cube entirely in its subspace contracts to by increasing its last coordinate to one, preserving . In the argument, an empty -fibre permits , and empty -fibres cause no restriction. For the projected cube is a point, with empty boundary; the formulas still apply. If there is no positive endpoint degree and both asserted ranges are empty; no relative degree-zero object is used. Nonregular attaching maps are allowed because radial deformations fix their disk boundaries. Every chosen cube, point, mesh, cutoff and cell-removal order belongs to a finite collection; no selection is made on all of . The inequalities in steps 4.1 and 7.2 explain the surjective endpoint and the one-degree-smaller injective range. This proves all assertions choice-free.
Depends on
- Relative homotopy classes and groups
- Relative homotopy operations are well defined in their valid degrees
- CW complex with closure finiteness and weak topology
- Skeleta, CW subcomplexes, and relative CW complexes
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide
- A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact
- In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones
- Interval exponential law and quotient homotopies
- Weak equivalences of pairs induce isomorphisms on relative homotopy
- Weak homotopy equivalence
- Higher homotopy basepoint transport and moving homotopies
Used by
- Homotopy excision Theorem
Dependency tree · two levels
64 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.