Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

High relative cells do not change lower homotopy

Statement

Let (X,A) be a CW pair all of whose cells outside A have dimension at least n1. For every 0i<n, every continuous u:IiX has a homotopy to a map into A that fixes u1(A) throughout. Consequently:

  • (X,A) is (n1)-connected.
  • π0(A)π0(X) is surjective, and is bijective if n2.
  • At every aA, the homomorphism πi(A,a)πi(X,a) is an isomorphism for 1i<n1 and is surjective for i=n11.

The basepoint need not be a vertex. No choice principle is used, regardless of the number or dimensions of the cells of A or X.

Facts & Assumptions

[F1]

Connectivity of a CW pair characterizes connectivity by full-boundary-fixed disk compression, including the zero-disk component clause.

[F2]

Compact CW images have finite cell support without choice puts the image of each specified compact-domain map into a finite CW subcomplex, without choosing such subcomplexes for all maps at once.

[F3]

A low-dimensional disk can be pushed off a higher cell pushes Ii off a higher-dimensional last cell of a finite CW complex, fixing its entire inverse image of the remaining subcomplex.

[F4]

Skeleta, CW subcomplexes, and relative CW complexes gives the subcomplex and cell-boundary conditions.

[F5]

Higher homotopy group by based cubes defines based classes and nullhomotopies with the whole cubical boundary fixed. Higher homotopy groups are functorial and based homotopy invariant gives induced homomorphisms.

Proof

Given: The CW pair, the integer n and a specified map u:IiX with i<n.

1.1

By [F6] the domain is compact, and [F2] supplies a finite subcomplex TX containing its image. If TA, the constant homotopy suffices. Otherwise take a cell e of largest dimension among the finitely many cells of T outside A. Its dimension k is at least n>i. The complement W=Te is a subcomplex: a cell in A has its entire closure in A and cannot meet e; any other remaining cell has dimension at most k, and its boundary consists of strictly lower-dimensional cells, so cannot meet the distinct k-cell e. Thus T is obtained from W by this one k-cell, even if TA has cells of dimension greater than k.

F2F4F6given
2.1

Apply [F3] to deform u into W. Since W contains TA, this deformation fixes every point of the original u1(A). Repeat with the current map and the smaller finite subcomplex W, each time choosing a cell of maximal dimension outside A. The number of such cells strictly decreases, so finitely many applications end in TA. At every stage the original points of u1(A) still have their original values in A, hence are fixed by every subsequent deformation. Concatenating the finite list gives the claimed homotopy. Its choices form only a finite sequence [F6]; no sequence over all maps or cells of X is selected. This proof also works for i=0.

F3F6step 1.1
3.1

A Euclidean disk and cube are homeomorphic as pairs: on the centered cube the radial map vvv/v2, with zero sent to zero, has inverse www2/w. Thus step 2.1 applies to each disk map of dimension less than n, fixing its boundary when that boundary maps into A. By [F1] the pair is (n1)-connected. In dimension zero it gives a path from any point of X into A, proving surjectivity on components. If n2, a path in X between two points of A has dimension one less than n; compress it by step 2.1 fixing both endpoints to obtain a path in A. Hence two A components cannot merge in X, proving component injectivity.

F1step 2.1
3.2

Let aA and 1i<n. A based i-cube in X has its boundary in A, so step 2.1 compresses it into A while fixing that boundary at a. The resulting based class maps to the original class; thus the inclusion is surjective on πi. If also i+1<n and a based cube in A represents an element of the kernel, take its based nullhomotopy Ii×IX. The entire boundary of this (i+1)-cube lies in A: the bottom is the given cube, the top is constant, and the side boundary is constantly a. Step 2.1 compresses this map into A fixing that whole boundary, giving a based nullhomotopy in A. Hence the induced homomorphism has trivial kernel and is injective. This works for the nonabelian degree-one group as well and uses no vertex restriction on a.

F5step 2.1
4.1

If there are no relative cells the compression is constant. If A is empty, the no-low-cell hypothesis forces X empty: a nonempty CW complex contains a zero-cell, since descending through the nonempty boundary image of any positive-dimensional characteristic disk eventually reaches dimension zero. Thus there is no map of a nonempty cube into X in this case, and the component map is the bijection of empty sets. The case n=1 asserts only the zero-disk compression and component surjectivity, with no positive-degree surjection at the undefined relative degree zero. At i=n11 surjectivity was proved, but injectivity would require a dimension-n compression, which was not assumed or claimed. Equal endpoints, constant maps and nonregular attaching maps retain their fixed inverse-image data in step 2.1. Steps 3.1 and 3.2 prove all the consequences, and every selection was finite.

F4step 1.1step 2.1step 3.1step 3.2

Depends on

Used by

Dependency tree · two levels

59 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