Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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.

Homotopy relative to a fixed subspace, and path homotopy relative to endpoints, are equivalence relations

Statement

For fixed spaces X,YX,Y and a fixed subspace AXA\subseteq X, the relation A\simeq_A is an equivalence relation on the set of continuous maps XYX\to Y that have a prescribed restriction to AA. In particular ordinary homotopy is an equivalence relation on the continuous maps XYX\to Y.

For fixed endpoints y0,y1Yy_0,y_1\in Y, path homotopy relative to the endpoints is an equivalence relation on the set of paths from y0y_0 to y1y_1.

Facts & Assumptions

Given: Spaces X,YX,Y, a subspace AXA\subseteq X, and the relations defined in Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints.

[L1]

Homotopy rel AA is reflexive and symmetric (Homotopy relative to a subspace is reflexive and symmetric).

[L2]

Homotopy rel AA is transitive by the two-piece reparametrisation construction (Two homotopies relative to the same subspace concatenate after piecewise-linear reparametrisation).

[L3]

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

Proof

technique · direct
1.1

By [L1] and [L2], A\simeq_A is reflexive, symmetric and transitive, so it is an equivalence relation by [L3]. Taking A=A=\varnothing gives ordinary homotopy.

L1L2L3
2.1

Paths from y0y_0 to y1y_1 are continuous maps IYI\to Y with one prescribed restriction to the subspace {0,1}\{0,1\}, and their path homotopies are exactly homotopies rel {0,1}\{0,1\}. Hence step 1.1 applies to them.

step 1.1given

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 60 results over 18 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources