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.

Compactly supported cohomology is contravariant for every smooth map

Statement

False. Pullback makes compactly supported de Rham cohomology contravariant for every smooth map, without a properness condition.

Facts & Assumptions

[F1]

Proper smooth maps pull back compactly supported forms proves supp(Fω)F1(suppω) and uses properness exactly to make the right-hand set compact.

[F2]

A smooth bump between concentric Euclidean balls supplies a smooth ρ:R[0,1] equal to one near zero and supported in (1,1).

Refutation

Given: The smooth constant map F:RR, F(x)=0.

1.1

Take the bump ρ from [F2], with ρ(0)=1. Its support is closed and bounded, hence compact by [F3], so ρΩc0(R). Pullback in degree zero is composition, and therefore Fρ=ρF=1 on all of R.

F2F3given
2.1

The support of the constant-one function is R, which is not compact by [F3] (equivalently, the open cover {(n,n):n1} has no finite subcover). Hence FρΩc0(R). Pullback therefore fails even to define the proposed compact-support cochain map, so it cannot induce the claimed contravariant cohomology map.

F3step 1.1
3.1

Here F is nonproper because the compact singleton {0} has inverse image R; this is exactly the obstruction isolated by [F1]. The zero input still pulls back to compact support and an empty source would be vacuous, but neither repairs the universal assertion. The example is already in degree zero and dimension one, has no boundary endpoints, and uses one explicit bump with no choice principle.

F1F3step 1.1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

40 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