Alphabeta Math
CorollaryStatement: 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 weakly contractible CW complex is contractible

Statement

Assume the Axiom of Choice. Let X be a nonempty CW complex with one path component, and suppose πn(X,x)=0 for every n1 at a basepoint xX. Then X is contractible. Equivalently the homotopy-group hypothesis may be imposed at every basepoint. If X is finite CW, the conclusion holds without any choice principle.

Facts & Assumptions

[F1]

Whitehead theorem converts weak equivalences of CW complexes into homotopy equivalences, with a choice-free finite clause and an AC arbitrary-cell clause.

[F2]

Weak homotopy equivalence specifies all components and all source basepoints. Higher homotopy group by based cubes defines the groups via based maps and boundary-fixed homotopies.

[F3]

Homotopy equivalences, homotopy inverses and spaces of the same homotopy type supplies a continuous inverse and both composite homotopies. CW complex with closure finiteness and weak topology permits the CW structure on a singleton with one zero-cell.

[F4]

Higher homotopy basepoint transport and moving homotopies makes the homotopy groups at the endpoints of any specified path isomorphic.

[A1]

The Axiom of Choice is assumed only when using the arbitrary-cell clause of [F1].

Proof

Given: The nonempty one-component CW complex X and the stated vanishing at x.

1.1

For any zX, a path from x to z exists because there is one path component. By [F4], its transport identifies πn(X,z) with the trivial group πn(X,x) for each n1. Thus every basepoint has trivial positive homotopy groups. This is an argument for one arbitrary z, not a choice of paths for all points. Conversely vanishing at every basepoint includes the supplied x, proving the asserted equivalence of hypotheses. For a singleton there is exactly one based cube in each degree, so all its groups are trivial by [F2], and it has one component.

F2F4given
2.1

Let p:X be the unique map. The component map is the bijection of two singleton sets. At each source point its map on positive groups is the unique map between trivial groups, an isomorphism by step 1.1. Hence p is a weak homotopy equivalence [F2]. The target with one zero-cell is finite CW by [F3]. Apply [F1] to p: for finite X both spaces are finite, so its finite clause applies without AC; for arbitrary X use [A1]. Obtain a continuous q:X and a homotopy qpidX.

F1F2F3A1step 1.1
3.1

The map qp is constant at q(). Reversing the homotopy from step 2.1 gives a continuous H:X×IX with H(z,0)=z and H(z,1)=q(), a contraction. The second inverse identity pq=id is automatic for the singleton. Empty X is excluded explicitly and cannot provide such a point-valued inverse; a singleton X is covered by its constant homotopy. No assertion that this contraction fixes an arbitrary prescribed point is needed. The finite branch spends no choice, and the general branch uses it solely through [F1].

F3step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

21 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