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.
De rham cohomology is a contravariant functor
Statement
De Rham cohomology is contravariant: for smooth and , , and .
Facts & Assumptions
Given: Composable smooth maps , and an integer .
Pullback induces a well defined map on de rham cohomology: For a smooth , the formula defines a linear map for every integer .
Pullback of forms is smooth functorial and preserves wedges: For a smooth map , pullback sends smooth differential forms on to smooth differential forms on , is functorial, and satisfies
Homology respects identities and composition: For every : 1. for every chain complex . 2. If and are chain maps, then
Proof
On forms, pullback satisfies and . These are identities between cochain maps, with arrows from to .
Using , apply homology at degree to these identities. Homology preserves identities and composition; the induced maps are those already defined on de Rham classes. This gives both identities in the statement.
Source locator
Lee, Introduction to Smooth Manifolds, 2nd ed., Chapter 17, pp.441–443, Proposition 17.2 and Corollary 17.3; local quotient calculations below.
Depends on
Used by
- The pullback on cohomology reverses composition order Counterexample
- De rham cohomology is a covariant functor False statement
- Pullback is a homomorphism of de rham cohomology algebras Proposition
- De rham cohomology is smooth homotopy invariant Theorem
Dependency tree · two levels
11 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
- John M. Lee, Introduction to Smooth Manifolds, second edition (standard reference, not scraped)