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.
Homotopy-cardinality pushforward satisfies base change
Statement
Let a homotopy-cartesian square of locally finite homotopy types be given, with its lower map proper on components. Then the upper map is proper on components and on finite-support functions. The square's maps are displayed after the proof.
Facts & Assumptions
Given: The homotopy-cartesian square in the statement and .
For a map of locally finite homotopy types, is the finite sum over components of its homotopy fibers weighted by ; a proper map also has the pullback (Locally finite homotopy types and rational cardinality).
Proof
Fix a component and put . The homotopy fiber of over is the pullback of the homotopy fiber of over , hence is equivalent to it by the homotopy-cartesian condition. Since is proper, this fiber has finitely many components; therefore is proper on components.
Fix and put . The homotopy fiber of over is equivalent to the homotopy fiber of over , with its map to equal to the composite of the fiber map to and . Thus the summands, their higher homotopy groups, and the values of pulled back along agree term by term. Both sides evaluated at are the same finite sum from [F1].
Diagram
The square is homotopy cartesian. The lower map is proper by hypothesis and the pullback map is proper by step 1.1; the equation is the corresponding homotopy-cardinality base-change identity.
Depends on
Used by
Dependency tree · two levels
4 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
- Bertrand Toën, Derived Hall algebras, arXiv:math/0501343v4, §2, Lemma 2.6 (standard reference, not scraped)