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.

Compact CW images have finite cell support without choice

Statement

Let K be a compact topological space and f:KX continuous, where X is a CW complex with its characteristic maps supplied as part of the CW structure. Then f(K) lies in a finite CW subcomplex of X. No AC or countable choice is used, even when the cells of X form an arbitrary set and their dimensions are unbounded.

Facts & Assumptions

[F1]

CW complex with closure finiteness and weak topology supplies Hausdorffness, characteristic disks homeomorphic on their interiors to open cells, closure finiteness, and the test for closed sets on every closed cell. Skeleta, CW subcomplexes, and relative CW complexes specifies the subcomplex condition.

[F3]
[F5]

A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value gives an attained minimum for each continuous real coordinate on a nonempty compact metric space, without choice.

Proof

Given: K,f,X as in the statement. Let L=f(K). The empty CW subcomplex is permitted.

1.1

The image L is compact in the open-cover sense. Indeed, the inverse images of any open cover of L cover K; a finite subcover of K yields a finite subcover of L by the same covering members. This argument does not impose a metric on the target. Since X is Hausdorff, [F2] makes L closed in X.

F1F2given
1.2

Every nonempty compact subset TRd has a uniquely specified lexicographically least point. For d1, minimize its first coordinate using [F5] and restrict to the minimum level set. That set is nonempty, closed in T and compact by [F3]. Minimize the next coordinate on it and continue through the finite ordered coordinate set. After d steps all coordinates are fixed, and the nonempty final set is a singleton. Each minimum value and each level set is unique; no minimizing point is selected until the final singleton. For d=0, the sole possible nonempty subset of R0 is already a singleton. This is a finite prescription defined for every such T, not a family of arbitrary existential choices.

F3F4F5given
2.1

Let e be a positive-dimensional open cell meeting L, with characteristic map χe:DdX. For r0 let Bd,r be the concentric closed ball of radius 11/(r+2) in Dd. These balls exhaust its interior. Thus some Bd,r meets χe1(L); let re be the least such integer. The set Te=Bd,reχe1(L) is a nonempty compact subset of Rd: it is closed in the compact ball by step 1.1, continuity and [F3], [F4]. Let ve be its uniquely specified point from step 1.2 and set xe=χe(ve)Le. For an occupied zero-cell use that point itself. The least integer, the finite sequence of coordinate minima, and the supplied characteristic map specify xe uniquely for every occupied cell; the resulting function is defined by this formula on the set of occupied cells.

F1F3F4step 1.1step 1.2
3.1

Put S={xe:eL}. Distinct occupied cells give distinct points, since their interiors are disjoint. For every subset TS and every closed cell a, closure finiteness in [F1] says that a meets only finitely many open cells. Hence Ta is finite, with at most one point from each of those cells. A finite subset of a Hausdorff space is closed: singleton complements are open by the Hausdorff separation axiom, and finite unions of closed sets are closed. The weak topology in [F1] now makes T closed in X. In particular S is closed in X, hence closed in the compact L. By [F3], S is compact.

F1F3step 1.1step 2.1
4.1

For sS, the set S{s} is closed in X by step 3.1. Its complement intersects S in {s}, so S is discrete. Its singleton cover is an open cover of S and therefore has a finite subcover. Thus S is finite, without first extracting a countably infinite subset from an arbitrary infinite set. The bijection exe from occupied cells to S shows that only finitely many cells meet L.

step 2.1step 3.1
5.1

If there are occupied cells, start with their finite set. Add every cell meeting the boundary of a cell already in the set, and repeat downward in dimension. At each stage only finitely many cells are added by closure finiteness [F1]. A cell boundary lies in the preceding skeleton, so the dimensions strictly decrease along every newly required boundary chain. The finite starting set has a maximum dimension N, and after at most N such downward stages no more are required. The union of these cells contains the entire closure of each member, hence is a finite CW subcomplex by [F1]. It contains L, because every point of L belongs to an occupied open cell.

F1step 4.1
6.1

If K or L is empty, the empty subcomplex suffices and no minima are taken. For a point image, the closure process starts at its one occupied cell; it need not itself be a zero-cell. Zero-dimensional cells and the zero-dimensional Euclidean coordinate space were handled without a norm or empty-coordinate minimum. The radii in step 2.1 are strictly between zero and one and approach one, so all chosen preimages lie in cell interiors and no boundary point is mistaken for a point of that open cell. Nonregular characteristic maps cause no problem, since only their interior restrictions are used for the selected points. Steps 1.2 and 2.1 specify every selection uniquely, while steps 4.1 and 5.1 use compactness and finite closure operations; no AC is used anywhere.

step 1.2step 2.1step 4.1step 5.1

Depends on

Used by

Dependency tree · two levels

52 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