Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adapted
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.

Based loop spaces of CW complexes have CW homotopy type

Statement

Assume AC. If X is a nonempty connected CW complex and x∈X is any basepoint, the based loop space Ω(X,x) has the homotopy type of a CW complex. This holds for the ordinary compact-open loop topology and for its compactly generated refinement. There is no restriction on the cardinality, dimension or local finiteness of X, and the basepoint need not be a vertex.

Facts & Assumptions

Given: AC, a nonempty connected CW complex X and x∈X.

[A1]

The Axiom of Choice is assumed. It implies the form of DC in The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain: select one successor for each element of the set carrying the entire relation and iterate that selected function from the prescribed starting element. Thus both choice hypotheses of [F7] below hold. The local The well-ordering theorem also makes every set well-orderable under AC; this supplies the vertex ordering used in step 2.3.

[F1]

Finite relative homotopy lifting across a weak equivalence applies to weak equivalences of arbitrary spaces and finite relative source CW pairs. Its output extends the prescribed source map and replaces a prescribed boundary homotopy T(l,t) by T(l,min⁡(4t,1)).

[F2]

Relative CW inclusions are cofibrations gives HEP with arbitrary target. Interval exponential law and quotient homotopies gives the ordinary compact-open interval exponential law, its compactly generated version, and preservation of arbitrary quotient maps under product with I. A CW characteristic-disk quotient therefore still tests continuity after product with I.

[F3]

CW approximation of an arbitrary space provides a weak equivalence from a CW complex to any space. Whitehead theorem makes a weak equivalence between CW complexes a homotopy equivalence under AC.

[F4]

Compact CW images have finite cell support without choice puts each compact-source image in a CW complex inside a finite subcomplex. Finite simplicial approximation for homology comparison approximates maps of finite simplicial pairs by simplicial maps after finite subdivision.

[F5]

Cw homotopy equivalence inclusions are strong deformation retracts makes an inclusion of finite CW complexes that is a homotopy equivalence a strong deformation retract inclusion. Its adjunction argument uses the explicit disk-prism retractions fixing the side and one end.

[F6]

A simplicial realization with its weak topology is CW: its open simplices are cells, simplex closures have finitely many faces, and the closed-simplex weak topology is precisely the CW topology. Coordinate functions separate points, so the space is Hausdorff. These are the conventions in The geometric realization of an abstract simplicial complex and CW complex with closure finiteness and weak topology.

[F7]

Stone's theorem, under choice: every metric space is paracompact supplies a locally finite open refinement of any metric open cover under AC. Under choice and dependent choice, every open cover of a paracompact Hausdorff space admits a locally finite subordinate partition of unity supplies a subordinate locally finite partition of unity on a paracompact Hausdorff space under AC and DC.

Proof

Proof technique: Construct a metric simplicial homotopy model, put an explicit local convexity operation on its loop space, construct a CW homotopy domination by a nerve, and turn that domination into CW homotopy type by relative homotopy lifting. All auxiliary assertions are proved below.

1.1A1F1F2

We first extend [F1] to arbitrary relative CW source pairs under AC, retaining the exact prescribed boundary homotopy. For one relative disk (Dd,Sd−1), [F1] supplies w and J with boundary T(z,λ(t)), where λ(t)=min⁡(4t,1). On B=(Sd−1×I)∪(Dd×{0,1})⊂Dd×I change this boundary homotopy through T(z,(1−s)λ(t)+st), leaving the two end-disk maps unchanged. These prescriptions agree at their intersections. The finite CW inclusion B⊂Dd×I has HEP by [F2]; applying it with initial map J produces, at s=1, a homotopy with the same end maps and boundary exactly T(z,t). For a zero-cell [F1] simply chooses a source point and a path from its image to the prescribed target point, with the direction reversed if necessary. Now extend a given source map and target homotopy over all cells of a relative CW pair, in increasing dimension, using this corrected disk assertion on each cell. AC selects all disk witnesses at each stage; recursion on dimensions gives maps and homotopies agreeing literally on the preceding stage and on the prescribed subcomplex. The CW quotient test and its product with I in [F2] prove continuity of their unions. Thus for any weak equivalence f:P→Y and any CW pair (K,L), a source map on L, a target map on K and an exact boundary homotopy extend to a source map on K and a target homotopy with exactly that boundary homotopy.

1.2F2F5F6

We next construct a simplicial homotopy model of an arbitrary CW complex, with no finiteness hypothesis. Here is the finite building block, with its target triangulation retained. For a simplicial map f:P→Q of finite complexes, construct a simplicial complex M(f) inductively over source simplices. Start with the target Q. For each source simplex σ with image face τ=f(σ), the already constructed boundary part M(f∣∂σ:∂σ→τ) includes τ; adjoin the cone on that boundary part with a fresh apex bσ. Use the same previously constructed pieces on common faces. The cones on the subdivided source boundaries form a copy of sd⁡P, disjoint from Q. Each boundary part strongly deformation retracts onto τ, by induction, so both it and its cone are contractible. Its inclusion in its cone is a finite CW homotopy equivalence, and [F5] gives a strong deformation retraction of the cone onto its base. Apply these retractions in decreasing source simplex dimension, simultaneously on pieces of the same dimension; each fixes the shared boundary pieces. The result strongly deformation retracts M(f) onto Q. Each source simplex stays in its image face under the endpoint retraction r, so r∣sd⁡P is homotopic to f there by the straight-line homotopy in that face. Use finite HEP [F2] on the disjoint subcomplexes Q and sd⁡P to extend this endpoint adjustment over M(f), keeping Q fixed. Concatenating with the first retraction gives a strong deformation from id⁡M(f) to a retraction whose restriction to the source is exactly f. In particular the source inclusion is homotopic in M(f) to the map f into Q. Finally M(f)∪sd⁡PC(sd⁡P) is simplicial. Fresh apex and source vertices and the common-face construction make every intersection an actual subcomplex.

1.3A1F7

We begin a general metric-space domination argument, independent of the later loop-space construction. Let Z be a metric space, let UZ be an open neighborhood of its diagonal in Z×Z, and let ΛZ:UZ×I→Z be continuous with ΛZ(a,b,0)=a, ΛZ(a,b,1)=b and ΛZ(a,a,t)=a. Suppose V is an open cover such that V×V⊂UZ and ΛZ(V×V×I)⊂V for each V∈V; these are the convex sets for this argument. We will construct a CW domination in this general setting. Use any bounded compatible metric d. Define the positive 1-Lipschitz function ρ(z)=sup⁡V∈Vmin⁡(1,d(z,Z∖V)), where the contribution for V=Z is defined to be 1. The cover B={B(z,ρ(z)/8):z∈Z} has the property that the union of its members containing any fixed a lies in a convex set: if a∈B(z,ρ(z)/8), the Lipschitz inequality gives ρ(z)<8ρ(a)/7, so this ball lies in B(a,2ρ(a)/7). Some V∈V has d(a,Z∖V)>ρ(a)/2 (or is Z), by the definition of the supremum, and contains that larger ball. Take a locally finite open refinement W of B by [F7]. For every a, the union of all W∈W containing a still lies in one such convex V. Discard empty members. This supplies the precise refinement property needed below without invoking an unproved star-refinement theorem.

1.4F2

Separately, based loop homotopy type is preserved by an unbased homotopy equivalence between connected spaces, without any cofibration hypothesis on their basepoints. Here are the details needed for the possibly nonvertex basepoint x. Given f:X→Y, inverse g, homotopies H:gf≃id⁡X and T:fg≃id⁡Y, chosen basepoints x,y, and a path a:y→f(x), define L(γ)=a∗(fγ)∗a−1. Put b=Hx−1∗(ga)−1:x→g(y) and G(δ)=b∗(gδ)∗b−1. Use fixed lengths for finite path concatenations; reparametrizing between different parenthesizations gives continuous homotopies. The square H(γ(t),s) shows that Hx−1∗(gfγ)∗Hx is homotopic through loops to γ; insert or delete the backtracking paths ga∗(ga)−1 to conclude GL≃id⁡. The square T(δ(t),s) similarly gives LG≃Cc, where Cc(δ)=c∗δ∗c−1 and c=a∗(fb)∗Ty is a fixed loop at y. Backtracking cancellation makes Cc a homotopy equivalence with inverse Cc−1. Consequently R=GCc−1 is a right homotopy inverse of L, while G is a left homotopy inverse; the identities G≃GLR≃R show that either is a two-sided homotopy inverse. For completeness, a path followed by its reverse contracts by replacing its triangular traversal parameter min⁡(2t,2−2t) by (1−s)min⁡(2t,2−2t); this depends continuously on the path. The displayed squares, this formula and the interval exponential law [F2] make all these homotopies continuous in the variable loop.

2.1F2step 1.1

By step 1.1, postcomposition by a weak equivalence f:P→Y induces a bijection [K,P]→[K,Y] on unbased homotopy classes for every CW complex K. Surjectivity is step 1.1 with empty fixed subcomplex. For injectivity, given a homotopy K×I→Y between fa0 and fa1, use step 1.1 on the CW pair (K×I,K×{0,1}), the prescribed end maps a0,a1 and the constant end homotopies. The resulting map K×I→P is a homotopy between those end maps. The interval has its finite CW structure, so the cylinder pair is a CW pair; equivalently its cell prisms attach by the characteristic-disk quotient in [F2].

2.2A1F2F4step 1.2

Starting with K0=X0 and a common space Z0=X0, construct simplicial complexes Kd and common spaces Zd containing both Xd and ∣Kd∣, with strong deformation retractions onto each, whose endpoint retractions restrict to the preceding endpoint retractions on Zd−1. Suppose these data are available through d−1. For every d-cell of X, compose its attaching map ae:Sd−1→Xd−1⊂Zd−1 with the endpoint retraction to Kd−1. Its compact image lies in a finite subcomplex by [F4]. Give the sphere a finite triangulation and approximate this map by a simplicial fe:Pe→Qe⊂Kd−1 after a finite subdivision, using [F4]. AC selects this finite data for all cells. Attach the finite complexes M(fe) from step 1.2 to Zd−1 along their targets Qe; call the resulting space W. Their retractions onto their targets glue to a strong deformation retraction W→Zd−1 fixing Zd−1, because their interiors and source copies are disjoint and each homotopy fixes its target. The old retraction homotopy, the simplicial approximation homotopy and the source homotopy in step 1.2 concatenate to a homotopy in W from ae to the new source-sphere inclusion je.

2.3A1F6F7step 1.3

Continue the general metric-space argument of step 1.3, retaining its Z, UZ, ΛZ and W. Let N be the nerve of W, with its weak simplicial topology. Choose by [F7] a locally finite subordinate partition of unity (pW)W∈W on Z. If an initial partition is indexed by a refinement, group the functions according to their assigned W; local finiteness makes each grouped sum continuous and the grouped cozero family locally finite. The positive-coordinate members at a all contain a, so (pW(a))W defines a point p(a)∈∣N∣. Locally only finitely many coordinates occur, proving continuity to the weak realization. Select zW∈W for each W and well-order the vertices, using AC. Define q:∣N∣→Z recursively over simplices: on a vertex put q(W)=zW; if the ordered simplex has first vertex W0 and opposite face F, put q((1−t)W0+ty)=ΛZ(zW0,q(y),t) for y∈F. For a simplex choose just one point a in its nonempty intersection. Every representative zW of its vertices lies in the union of the cover members containing a, hence in a convex V from step 1.3. Induction therefore shows all expressions are defined and all face images stay in V. The formula agrees on faces by the vertex ordering. At the first vertex continuity follows from continuity of ΛZ on the compact opposite face times the interval and its value independent of y at t=0; thus the cone formula descends continuously. Continuity over all of ∣N∣ follows from its weak simplex topology.

3.1F3step 2.1

Any space Z homotopy dominated by a CW complex has CW homotopy type. Indeed, write the domination as p:Z→N, q:N→Z with qp≃id⁡Z and N CW. Choose a CW approximation c:C→Z by [F3]. By step 2.1 lift q up to homotopy to q′:N→C, so cq′≃q. Put r=q′p:Z→C. Then cr≃qp≃id⁡Z. Further, c(rc)≃c; injectivity in step 2.1, now with CW source C, gives rc≃id⁡C. These are both inverse identities, so c is a homotopy equivalence. This argument places no separation or CW hypothesis on the dominated target Z.

3.2F2F6step 1.2step 2.2

Continue the simplicial-model construction of step 2.2. Attach one Dd×I to W along each of these side homotopies Sd−1×I→W, retaining its bottom and top disks, and call the result Zd. The radial retraction of the disk prism onto its side and bottom, respectively side and top, fixes that subset throughout and descends through this attachment. Explicitly project from (0,−1) to the side and top of Dd×[0,1] and interpolate linearly; reflect the interval for the other end. The resulting retractions are continuous by the quotient product assertion [F2], also for an arbitrary disjoint family of prisms. On the bottom end, first retract the M(fe) pieces onto their targets, then use the old strong retraction Zd−1→Xd−1, extending both homotopies by the identity on the new bottom disks; their attaching boundaries lie in the fixed old Xd−1. This gives a strong retraction onto Xd. On the top end extend the old strong retraction Zd−1→Kd−1 by the identity on the M(fe) pieces and top disks; it fixes each attaching target Qe⊂Kd−1. This gives a strong retraction onto the simplicial complex Kd=Kd−1∪e(M(fe)∪C(sd⁡Pe)). These endpoint retractions restrict on Zd−1 to their old endpoints, as required. The common spaces Zd need not themselves be CW: only their explicit quotient homotopies, and the CW structures on the two retracts, are used.

4.1F3F4F6step 3.2

Each new finite piece in Kd has dimension at most d: in step 1.2 the piece over a source k-simplex is a cone on a complex of dimension at most k, since its image face has dimension at most k, and k≤d−1. Thus K=⋃dKd is a simplicial complex with Kd a subcomplex, using the weak realization topology. Restrict the retraction to Xd in step 3.2 to Kd to obtain compatible maps rd:∣Kd∣→Xd. They are homotopy equivalences, as both inclusions into Zd have strong retractions. Their union r:∣K∣→X is continuous by the weak simplex topology. It is a weak equivalence: any sphere, path or disk map into either CW complex has finite cell support by [F4] and hence lies in a finite stage; any nullhomotopy also has finite support and lies in some larger stage. Surjectivity and injectivity at every source basepoint therefore follow from the homotopy equivalence rd at a common sufficiently large stage. The same argument with points and paths gives component bijectivity. By [F3], r is a homotopy equivalence. This proves the simplicial-model assertion for arbitrary sets of cells and unbounded dimension.

5.1F2F6step 4.1

Give the same simplicial realization K the metric d(a,b)=∑v∣av−bv∣ on its finite barycentric coordinate vectors; write it as Ks, and write Kw for its weak realization. The identity i:Kw→Ks is continuous simplexwise. Put m(a)=max⁡vav and wv(a)=max⁡(av−m(a)/2,0), and define p(a)v=wv(a)/(∑uwu(a)). The denominator is positive since a maximal coordinate is retained. The functions m,wv are continuous in the metric (the maximum is 1-Lipschitz), and their nonzero sets form a locally finite family: at a point a its finite support S has m(a)>0, and in a sufficiently small metric neighborhood every coordinate outside S is smaller than half the nearby maximum. Thus p:Ks→Kw is continuous: locally it lands in the finite simplex on a subset of S and has continuous coordinates. Its support is contained in the support of a. The straight-line paths from a to p(a) therefore stay in that simplex. They give ip≃id⁡Ks by the metric formulas, and pi≃id⁡Kw by the weak simplex product test [F2]. Both maps and homotopies fix every vertex. Hence Ks is a metric simplicial homotopy model for X.

6.1step 5.1

On Ks let Vv={a:av>0} be the open vertex stars and U=⋃vVv×Vv. For (a,b)∈U put c(a,b)v=min⁡(av,bv)/(∑umin⁡(au,bu)). The denominator is positive. Coordinatewise minimum is Lipschitz in the ℓ1 norm, so c is continuous on U; its support lies in the intersection of the two supports and hence is a face of both simplices. Define Λ(a,b,t) by the line segment from a to c(a,b) during the first half-interval and from c(a,b) to b during the second half. This is continuous, starts at a, ends at b, and satisfies Λ(a,a,t)=a. Moreover if a,b∈Vv, then c(a,b)v>0, so the entire path stays in Vv. We call such sets convex for this operation: Vv×Vv⊂U and Λ(Vv×Vv×I)⊂Vv. No linear convexity across different simplices is being assumed.

7.1F2step 6.1

Fix a vertex b of K and let Z=Ω(Ks,b) with the ordinary compact-open topology. This topology is the uniform metric topology, for the bounded target metric of step 5.1: a uniform ball contains a finite intersection of compact-open neighborhoods, by a finite subdivision of the compact interval and continuity of the given loop; conversely each compact-open neighborhood contains a sufficiently small uniform ball by a finite subcover of its compact test set. Put UZ={(α,β):(α(t),β(t))∈U for every t∈I}. It is open: the adjoint evaluation map is continuous by [F2], and a tube about the compact parameter I gives the required neighborhood of any such pair. Define ΛZ(α,β,s)(t)=Λ(α(t),β(t),s). The interval exponential law [F2] proves continuity. The resulting path is based since Λ(b,b,s)=b, and it fixes equal loops. Every loop α has a finite subdivision into closed intervals J1,…,Jk with α(Ji)⊂Vvi: pull the stars back to an open cover of I, take a finite subcover and a sufficiently fine subdivision using the usual positive Lebesgue number for a finite interval cover (otherwise a sequence of uncovered shrinking intervals has a convergent subsequence and contradicts openness at its limit). The open neighborhood {β:β(Ji)⊂Vvi for all i} is convex for ΛZ, by the corresponding star property in step 6.1. Thus the metric space Z has an open cover by convex sets for a single continuous operation on a neighborhood of its diagonal.

8.1step 3.1step 7.1step 1.3step 2.3

First conclude the general metric-space argument of steps 1.3 and 2.3, with their Z, UZ, ΛZ and maps p,q. For each a∈Z, the simplex supporting p(a) uses only W that contain a. Choose the convex V from step 1.3 for that point. Its representatives and a lie in V; the recursive formula in step 2.3 therefore gives qp(a)∈V. Hence (a,qp(a)) lies in the domain of ΛZ, and H(a,t)=ΛZ(a,qp(a),t) is a continuous homotopy from id⁡Z to qp. The single continuous operation, rather than the pointwise choice of V, defines this homotopy; no continuous choice of cover members is needed. Thus Z is homotopy dominated by the CW complex ∣N∣. Step 3.1 makes it homotopy equivalent to a CW complex. Now apply this general conclusion to the metric loop space and its explicitly constructed operation in step 7.1. It proves CW homotopy type for Ω(Ks,b).

9.1A1F2step 4.1step 5.1step 7.1step 8.1step 1.4∎

The connected CW complex X is path connected: each characteristic closed disk has path connected image, so the inverse image of any path component under each characteristic map is either the entire disk or empty. The weak topology therefore makes every path component open. Connectedness forces there to be only one. Step 4.1 gives a bijection on path components, so Kw is also path connected; its surjective continuous identity map to Ks makes Ks path connected. Steps 4.1 and 5.1 give a homotopy equivalence between X and Ks. Pick a vertex b in the latter and a path from b to the image of x; path connectedness supplies the path. Step 1.4 compares their based loop spaces by a homotopy equivalence. Together with step 8.1 this proves the ordinary compact-open assertion. For the compactly generated refinement, all displayed loop maps and homotopies also lift to the refinements by [F2]. A metric space is already compactly generated: if a subset is not closed, choose a sequence in it converging to a point outside it, using balls of radii 1/n and AC; that convergent sequence with its limit is a compact Hausdorff test space and detects the failure of closedness. Thus the metric loop space in step 7.1 is unchanged by refinement. It follows that its CW-type conclusion also holds for the refined loop space of X. No countability or local finiteness of the original CW structure was used; AC was spent on cellwise lifts, finite approximations for arbitrary families, Whitehead, metric refinement and partition witnesses, and vertex representatives and ordering in the nerve.

Source notes

The source is Milnor's 1959 article, not an ANR theorem or a bare citation to Schön. The proof of Milnor's Theorem 3 uses Lemmas 2–4. Steps 6.1 and 7.1 construct their single-space and based-loop operations; steps 1.3, 2.3 and 8.1 prove the general metric-space nerve domination and apply it to those loops. Step 1.3 replaces Milnor's reference to full normality by a metric-radius construction and the already authored Stone and partition-of-unity suppliers. Steps 1.1, 2.1 and 3.1 replace the external domination theorem in Milnor's Theorem 2 by relative lifting using existing local suppliers. Steps 1.2, 2.2, 3.2 and 4.1 supply the arbitrary CW-to-simplicial replacement, rather than assuming a locally finite or countable simplicial model.

Depends on

Used by

Dependency tree · two levels

80 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.

Sources