Alphabeta Math
PropositionStatement: AI-adaptedProof: 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 de Rham cohomology is contravariant for proper smooth maps

Statement

For proper smooth maps of smooth manifolds, possibly with boundary, compactly supported de Rham cohomology is contravariant. A proper smooth map F:MN induces a linear map Fc:Hck(N)Hck(M),Fc[ω]=[Fω], with (GF)c=FcGc and (idM)c=id in every integer degree. Forgetting compact support commutes with these pullbacks. No choice axiom is required.

Facts & Assumptions

[F1]

Proper smooth maps pull back compactly supported forms proves that proper smooth pullback preserves compact support, with the precise support containment.

[F2]

Pullback induces a well defined map on de rham cohomology gives the ordinary boundaryless quotient pullback by the same formula.

[F3]

The de Rham complex and pullback extend to manifolds with boundary gives linearity, dF=Fd, composition and identity laws, and ordinary quotient pullbacks also at a boundary.

[F4]

Compactly supported de Rham cohomology defines Hck and its compactly supported primitives.

Proof

Given: Proper smooth F:MN and G:NP, and closed compactly supported forms on their respective targets.

1.1

By [F1] and [F3], pullback restricts to a linear cochain map on compactly supported forms. If ω is closed, then d(Fω)=F(dω)=0. If another compactly supported closed representative is ω+dη with η compactly supported, [F1] makes Fη compactly supported and [F3] gives F(ω+dη)Fω=d(Fη). Thus the displayed rule is independent of representatives in precisely the quotient [F4], and real linearity follows by applying linear pullback to linear combinations of representatives.

F1F3F4given
2.1

The identity map is proper since its inverse image of a compact set is that set. The composite GF is proper since (GF)1(K)=F1(G1(K)), and each successive inverse image is compact by the respective hypothesis. Their smoothness and pullback equations follow from [F3]. On a representative class, (GF)c[ω]=[(GF)ω]=[FGω]=FcGc[ω]. The identity equality follows from idω=ω. Step 1.1 makes these equalities well defined on every class, proving the claimed contravariant functor.

F1F3step 1.1given
2.2

Inclusion of compactly supported forms into all forms commutes with d and sends every compactly supported primitive to an ordinary primitive. It therefore induces jM:Hck(M)HdRk(M), without claiming that jM is injective. Both jMFc[ω] and FjN[ω] are the ordinary class of the same form Fω, with ordinary pullback supplied by [F2] in the boundaryless case and [F3] in the boundary case. Hence jMFc=FjN.

F2F3F4step 1.1
3.1

Empty manifolds give zero cohomology. In degree zero no negative-degree primitive exists, and step 1.1 is ordinary composition of closed compactly supported functions. In degree one the changed representative uses a compactly supported function primitive; in top degree it still requires a compactly supported incoming primitive. Negative degrees are zero. Identity maps and constant maps are covered whenever they meet the stated properness hypothesis, and boundaries use [F3]. Only the given representatives and their given compact primitives occur, so there is no choice of a family of representatives or primitives and no AC.

F1F3F4step 1.1step 2.1step 2.2

Depends on

Used by

Dependency tree · two levels

19 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