Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

An arbitrary subspace inclusion need not be a cofibration

Statement refuted

Every subspace inclusion is a cofibration, even when the subspace is closed.

Facts & Assumptions

Counterexample

Given: The spaces, maps, and hypotheses in the statement above.

1.1

Take X={0}{1/n:n1}R and A={0}. The complement of A is open in X, since each point 1/n is isolated, so A is closed. Every path in X is constant: if two of its values differ, an irrational strictly between them would be a value of the composite real-valued path on the subinterval between those times by F3, but X contains only rational numbers.

F2F3
2.1

If A→X had HEP, use target S=X×{0}{0}×I, initial map x↦(x,0), and homotopy (0,t)↦(0,t). F1 would give R:X×IS fixing those prescribed points. Its first coordinate along {1/n}×I is a path in X starting at 1/n and therefore constant by step 1.1. The only point of S with first coordinate 1/n is (1/n,0); hence R(1/n,1)=(1/n,0) for every n.

F1F2step 1.1
3.1

But (1/n,1)(0,1) in X×I. Continuity would make the second coordinates of their R-images converge to the second coordinate of R(0,1)=(0,1), namely 1. They are all zero by step 2.1, a contradiction. Thus this explicit closed inclusion is not a cofibration.

F1F2step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

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