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

Proper endpoint maps joined by a nonproper combined homotopy

Statement refuted

Properness of the endpoint maps does not imply properness of the combined homotopy. There are proper smooth maps F0,F1:RR and a smooth homotopy between them whose combined map R×[0,1]R is not proper.

Facts & Assumptions

Given: Define H:R×[0,1]R by H(x,t)=(2t1)2x, and write Ft(x)=H(x,t).

[F1]

Degree is invariant under proper smooth homotopy requires the combined map H to be proper and explicitly warns that proper endpoint maps alone do not suffice.

Counterexample

1.1

The displayed polynomial formula is smooth. At both parameter endpoints, F0(x)=H(x,0)=x=H(x,1)=F1(x). Thus both endpoint maps are the identity, and each is proper because its inverse image of any compact set is that same compact set.

given
1.2

The compact singleton {0} has inverse image H1({0})=({0}×[0,1])(R×{1/2}). This inverse image is not compact: for n1, let Un=H1({0})((n,n)×(1/4,3/4)), and let V=H1({0})(R×([0,1]{1/2})). These sets are open in the inverse-image subspace and {V,U1,U2,} covers it, but any finite subfamily misses (x,1/2) once x exceeds every selected index. Hence H is not proper.

F2given
2.1

The two proper endpoint maps are therefore joined by a nonproper combined homotopy, so the endpoint-only inference fails and [F1]'s hypothesis is indispensable. At t=1/2 the slice is the constant zero map, which pinpoints the degeneracy; at t=0,1 it is the identity. The source and compact test set are nonempty, all endpoints and the zero fibre are explicit, and the countable cover is specified by a formula rather than selected, so no choice principle is used.

F1step 1.1step 1.2

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