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.

A low-dimensional disk can be pushed off a higher cell

Statement

Let Z=WαDk be a finite CW complex obtained from its subcomplex W by attaching one k-cell e. If 0n<k, every continuous f:InZ, with I=[0,1], has a homotopy to a map into W that fixes f1(W) pointwise throughout. No choice principle is used. In particular, if f(In)W, the homotopy fixes the boundary. The attaching map need not be injective.

Facts & Assumptions

Proof

Given: Z,W,e,k,n,f as stated. Use the coordinate homeomorphism eRk obtained by sending uintDk to u/(1u) through the characteristic map. Let Ba denote the closed radius-a coordinate ball.

1.1

Each Bae is compact by [F2] and the coordinate homeomorphism, hence closed in Z. Its open-ball interior is open in Z: the preimage in the attachment disk is open away from its boundary and the preimage in W is empty. Consequently P=f1(B2) and A=f1(B1) are compact subsets of In, and C=Inf1(intB2) is closed and disjoint from A. If A is empty, f already misses the coordinate origin; retain f and proceed to the radial construction below.

F1F2given
2.1

Suppose A and n1. There is a positive d such that every point within distance d of A lies outside C. To see this without selecting a neighborhood at every point, take all pairs (a,r) with aA, r>0, and the relative ball B(a,2r) disjoint from C. Their balls B(a,r) cover A. Compactness gives finitely many such pairs, and the minimum of their radii is a suitable d: if x is within d of aA, choose a member containing a and use the triangle inequality. If C is empty any d>0 works. Likewise the coordinate map f:PRk is uniformly continuous. For all pairs (a,r), aP, whose relative radius-2r ball has images within 1/8 of f(a), the radius-r balls cover P. A finite subcover and the minimum radius give δ>0 such that x,yP and xy<δ imply f(x)f(y)<1/4. Only finite subcovers and finite minima were used.

F2step 1.1
3.1

Subdivide In into a finite uniform grid of closed cubes of diameter h<min(d/3,δ). Let K1 be the union of cubes meeting A and K2 the union of cubes meeting K1. Every point of K2 is within 2h<d of A, so K2P. A point on the relative boundary of K2 cannot belong to K1: otherwise a cube outside K2 containing that boundary point would meet K1 and would have been included. Triangulate the grid compatibly by first leaving its vertices, then coning each face from its center over the already triangulated boundary, in increasing dimension. The resulting finite simplices have diameter at most h and K1,K2 are subcomplexes of this triangulation.

step 2.1
4.1

On K2 let g be the affine interpolation of the coordinate values of f at these finitely many vertices. On every simplex barycentric coordinates are unique, are nonnegative and sum to one; the formulas agree on faces, hence define a continuous g. Define the piecewise affine function ϕ to be one at vertices in K1 and zero at the other vertices of K2. Then ϕ=1 on K1 and ϕ=0 on the relative boundary of K2, by step 3.1. The formula ft(x)=(1tϕ(x))f(x)+tϕ(x)g(x)(xK2) takes its values in the coordinate cell. Outside K2 retain f. The two prescriptions agree on the boundary and paste continuously on K2×I and InK2×I, a finite closed cover. Since K2f1(e), the homotopy fixes f1(W). Write F=f1; on K1 it is the finite piecewise affine map g.

step 1.1step 3.1
5.1

The image under F of InK1 misses the coordinate ball of radius 3/4. Outside K2 it misses B1 by definition of K1. For a point xK2K1, take a simplex σ containing it. This simplex is not contained in K1; fix a point zσK1. Then f(z)>1, while uniform continuity and the diameter bound in step 3.1 give f(y)f(z)<1/4 for all yσ. Convexity puts g(x) and F(x) in the same radius-1/4 ball about f(z), so F(x)>3/4. This estimate applies only to points mapped into e; points mapped to W already miss all its coordinate balls.

step 2.1step 3.1step 4.1
6.1

A finite union of affine subspaces of dimension at most n<k cannot fill a nonempty open ball in Rk. Here is a finite algebraic verification. For each subspace its spanning vectors have rank less than k; row elimination gives a nonzero vector a orthogonal to them, so the subspace lies in a hyperplane ax=b. For the finite list of nonzero normals, substitute v(t)=(1,t,,tk1). Each av(t) is a nonzero polynomial and has finitely many roots: division by tt0 at a root and induction on degree prove that assertion. Choose an integer t outside the finite union of root sets. The line ssv(t) meets each affine hyperplane in at most one point. An interval of sufficiently small s lies in the specified ball centered at zero and contains a point outside that finite list. Thus for the finitely many affine images of simplices of K1, some pintB1/2 is omitted by F(K1); step 5.1 shows that p is omitted by all of F. All the linear algebra and selections here are finite.

step 4.1step 5.1
7.1

The cases excluded from the mesh construction also give an omitted point. If A is empty use the coordinate origin, as in step 1.1. If n=0, the domain is one point; if its image lies in W, the constant homotopy already solves the problem. Otherwise choose one of two fixed distinct points of e unequal to that image, leaving f unchanged. Thus in every case there is a map F homotopic to f rel f1(W) and a point peF(In).

step 1.1step 4.1step 5.1step 6.1
8.1

Let qintDk be the unique characteristic preimage of p. For uDk{q} set v=uq and λ(u)=qv+(qv)2+(1q2)v2v2. This is the positive solution of q+λv=1, by expanding the square. Since q is interior and u is in the disk, λ1, with equality for u on its boundary. The homotopy Rt(u)=q+((1t)+tλ(u))(uq) lies on the ray segment between u and its boundary endpoint, stays in the convex disk, never equals q, and fixes the boundary. All formulas are continuous since v2>0.

F1step 7.1
9.1

The attachment quotient restricted over Z{p} is still quotient: this subset is open, its inverse image is saturated and open, and any set open in that inverse image is open upstairs, so the quotient test descends it. On its domain, the homotopy given by step 8.1 on the punctured disk and the identity on W agrees on the attaching identifications. It descends continuously even with the ordinary product topology on time. Indeed, for any quotient Q:EV, a map H:V×IT continuous after Q×id has a well-defined transpose; [F3] makes its composite with Q continuous, the quotient test makes the transpose continuous, and [F3] makes H continuous. Applied here, this proves a deformation retraction of Z{p} onto W. Compose it with F and concatenate with the first homotopy. The result ends in W and fixes f1(W).

F3step 7.1step 8.1
10.1

No infinite family of witnesses has been selected. The grid and its triangulation are finite; neighborhood families were taken in their entirety before finite subcovers; omitted-point linear algebra involves only finitely many hyperplanes. The cases n=0 and f1(B1)= were treated separately. The inequality n<k is used exactly to find proper affine hyperplanes; no equal-dimension claim is made. At times zero and one the stated endpoint maps follow from the explicit formulas. Boundary fibers of a nonregular attaching map remain fixed, so the quotient argument does not require their injectivity. This proves the claimed choice-free relative homotopy.

step 2.1step 3.1step 6.1step 7.1step 9.1

Depends on

Used by

Dependency tree · two levels

54 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