Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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 one-point space and R are homotopy equivalent but not homeomorphic

Example

Let P={p} be a one-point space. The maps i:P→R, i(p)=0, and q:R→P exhibit P≃R, although the spaces are not homeomorphic.

Facts & Assumptions

Given: The one-point space P and the real line.

[L1]

The real line contracts to 0 by H(x,t)=(1−t)x (Every nonempty interval and every Rn with n≥1 contracts to any chosen point).

[L2]

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

[L4]

The refutation in FALSE: homotopy-equivalent spaces must be homeomorphic uses this same pair as its counterexample.

Verification

technique · direct
1.1

Both i and q are continuous, since the preimage of any open set is either empty or the entire one-point source or target preimage.

construct
1.2

No bijection exists from the finite set P to the uncountable set R, so no homeomorphism exists by [L3].

L3
2.1

One has q∘i=id⁡P and i∘q=c0≃id⁡R by [L1]. Hence i and q are homotopy inverses by [L2].

step 1.1L1L2
3.1

Steps 2.1 and 1.2 verify the claimed contrast, agreeing with [L4].

step 2.1step 1.2L4∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

31 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