Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck 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.

A homotopy equivalence induces a bijection between path components

Statement

For a space X, write π0(X) for its set of path components. If f:X→Y is a homotopy equivalence, then

f∗:π0(X)⟶π0(Y),f∗(PX(x)):=PY(f(x)),

is a well-defined bijection. A homotopy inverse g:Y→X induces its inverse g∗.

Facts & Assumptions

Given: A homotopy equivalence f:X→Y with homotopy inverse g:Y→X.

[A1]

Path components are the equivalence classes for the relation “joined by a path” (Paths, path-connected spaces and path components).

[A2]

One has g∘f≃id⁡X and f∘g≃id⁡Y (Homotopy equivalences, homotopy inverses and spaces of the same homotopy type).

Proof

technique · direct
1.1

If a path γ:I→X joins x to x′, then f∘γ is continuous because (f∘γ)−1[V]=γ−1[f−1[V]] for every open V⊆Y; it joins f(x) to f(x′). Hence points in one path component of X have images in one path component of Y, so f∗ is well defined. The same argument defines g∗.

A1L2
1.2

If continuous maps u,v:X→Y are homotopic, then u(x) and v(x) lie in the same path component for every x∈X: precompose the homotopy by the continuous map from a one-point space selecting x, using [L3]; the resulting homotopy of two maps from a point is exactly a path from u(x) to v(x).

L1L3A1
2.1

Apply step 1.2 to g∘f≃id⁡X. For every x∈X, g(f(x)) and x lie in the same path component, so (g∗∘f∗)(PX(x))=PX(x). Thus g∗∘f∗ is the identity on π0(X).

step 1.2A2
2.2

Applying step 1.2 to f∘g≃id⁡Y similarly gives f∗∘g∗=id⁡π0(Y).

step 1.2A2
3.1

Therefore f∗ and g∗ are mutually inverse functions, so f∗ is a bijection.

step 2.1step 2.2∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

27 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