Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-07-31
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.

Every nonempty contractible space is path-connected

Statement

Every nonempty contractible topological space is path-connected.

Facts & Assumptions

Given: A nonempty contractible space X and points x,y∈X.

[L1]

The identity of X is homotopic to a constant map cx0 for some x0∈X (A nonempty space is contractible if and only if its identity map is nullhomotopic, Nullhomotopic maps and contractible spaces).

[A1]

Paths define an equivalence relation: paths may be reversed and concatenated, and X is path-connected exactly when every pair of points is joined by a path (Paths, path-connected spaces and path components).

Proof

technique · direct
1.1

Let H:X×I→X be a homotopy from id⁡X to cx0. For each z∈X, the map jz:I→X×I, jz(t)=(z,t), is continuous by [L2], its components being constant and the identity.

L1L2
2.1

The map γz:=H∘jz:I→X is continuous because (H∘jz)−1[V]=jz−1[H−1[V]] is open for every open V⊆X. It has γz(0)=z and γz(1)=x0, so it is a path from z to x0.

step 1.1L1L3A1
3.1

Step 2.1 gives a path from x to x0 and a path from y to x0. Reversing the latter and concatenating it with the former gives a path from x to y by [A1].

step 2.1A1
4.1

Since x,y∈X were arbitrary, X is path-connected.

step 3.1A1∎

Depends on

Used by

Dependency tree · two levels

28 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