Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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 between proper maps is automatically proper

Statement

False. Every smooth homotopy whose two endpoint maps are proper is itself a proper map from the product with the parameter interval.

Facts & Assumptions

[F1]

Degree is invariant under proper smooth homotopy requires properness of the combined map H:M×[0,1]→N and explicitly does not replace it by endpoint properness.

Refutation

Given: Define H:R×[0,1]→R by H(x,t)=(2t−1)2x.

1.1given

This is smooth. At both endpoints, H(x,0)=x=H(x,1), so H0 and H1 are the identity of R. Each is proper because the inverse image of every compact set is that same compact set.

1.2F2given

The singleton {0}⊂R is compact, but H−1({0})=({0}×[0,1])∪(R×{1/2}). Its closed subspace R×{1/2} is homeomorphic to the noncompact real line from [F2]; more directly, the cover by (−n,n)×(1/4,3/4) together with the complement of that slice has no finite subcover. Hence H−1({0}) is not compact, and H is not proper.

2.1F1step 1.1step 1.2∎

Thus proper endpoint maps do not make the combined homotopy proper, and [F1]'s hypothesis cannot be deleted. The midpoint map is the constant zero map, which pinpoints the degeneration. Both endpoints, the compact singleton, and the noncompact inverse image are explicit; the source is nonempty and boundaryless in its spatial variable, and no choice principle is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

32 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