Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-09-23 (gpt-6-sol)
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.

Continuously homotopic smooth maps are smoothly homotopic

Statement

Assume countable choice ACω (The Axiom of Countable Choice (ACω)). If two smooth maps f0,f1:M→N are continuously homotopic, then they are smoothly homotopic.

Facts & Assumptions

Given: Countable choice, smooth maps f0,f1:M→N, and a continuous homotopy H:M×I→N from f0 to f1.

[L1]

Products of smooth manifolds carry canonical smooth structures (Products of smooth manifolds have a canonical product smooth structure).

[L2]

Under countable choice, relative manifold-valued approximation can smooth a continuous map while fixing it on closed regions where it is already smooth (Relative Whitney approximation for manifold-valued maps).

Proof

technique · direct
1.1F1L1givenconstruct

Choose a smooth function λ:R→[0,1] with λ(t)=0 for t≤1/3 and λ(t)=1 for t≥2/3. Define H^(x,t):=H(x,λ(t)) on M×R. By [F1] and [L1], this is a continuous map on a smooth manifold; it is constant in t on the closed collar regions A0:=M×(−∞,1/3],A1:=M×[2/3,∞), so it is smooth on a neighbourhood of A0∪A1.

2.1L2step 1.1choose

Apply [L2] to the closed set A0∪A1⊆M×R. We obtain a smooth map H~:M×R→N that agrees with H^ on a neighbourhood of those collars.

3.1F1step 2.1algebra∎

Restrict H~ to M×I. Near t=0 it equals f0, and near t=1 it equals f1; after composing with a smooth reparameterization of I that fixes the endpoints, this restriction becomes a smooth homotopy from f0 to f1.

Depends on

Used by

Dependency tree · two levels

29 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