Alphabeta Math
TheoremStatement: 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.

Having the same homotopy type is an equivalence relation on topological spaces

Statement

The relation “has the same homotopy type as” is reflexive, symmetric and transitive on topological spaces, hence is an equivalence relation.

Facts & Assumptions

Given: Topological spaces X,Y,Z and homotopy equivalences f:X→Y and p:Y→Z with homotopy inverses g:Y→X and q:Z→Y.

[A1]

A homotopy equivalence has a continuous homotopy inverse whose two composites are homotopic to the appropriate identity maps (Homotopy equivalences, homotopy inverses and spaces of the same homotopy type).

[L1]

Precomposition and postcomposition by continuous maps preserve homotopies (Precomposition and postcomposition by continuous maps preserve homotopies, including their relative form).

[L3]

A relation is an equivalence relation exactly when it is reflexive, symmetric and transitive (Equivalence relation, equivalence class, and the quotient set A/∼).

Proof

technique · direct
1.1

The identity id⁡X:X→X is a homotopy equivalence with itself as homotopy inverse, since both composites equal, and hence are homotopic to, id⁡X.

A1L2
1.2

If f:X→Y has homotopy inverse g:Y→X, the same two homotopies show that g has homotopy inverse f. Thus the relation is symmetric.

A1
1.3

For transitivity, the composite p∘f:X→Z has candidate homotopy inverse g∘q:Z→X. By [A1], q∘p≃id⁡Y and g∘f≃id⁡X.

A1
1.4

Similarly, f∘g≃id⁡Y gives p∘(f∘g)∘q≃p∘q, and p∘q≃id⁡Z then gives (p∘f)∘(g∘q)≃id⁡Z.

A1L1L2
2.1

Applying [L1] to q∘p≃id⁡Y gives g∘(q∘p)∘f≃g∘f, and [L2] with g∘f≃id⁡X gives (g∘q)∘(p∘f)≃id⁡X.

step 1.3L1L2
3.1

Steps 2.1 and 1.4 make g∘q a homotopy inverse of p∘f, so the relation is transitive. With steps 1.1 and 1.2, [L3] makes it an equivalence relation.

step 1.1step 1.2step 2.1step 1.4A1L3∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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