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.
Thom isomorphism extends over a finite numerable trivializing cover
Statement
For an -oriented metric bundle with a supplied finite numerable open trivializing cover, the normalized local Thom classes glue uniquely, and cup product with the resulting global class is a Thom isomorphism. No choice principle is required.
Facts & Assumptions
Given: An -oriented metric bundle and a supplied finite trivializing cover ; the enumeration witnesses finiteness.
Thom isomorphisms glue over two trivializing opens glues two compatible normalized Thom isomorphisms and proves uniqueness.
Proof
The base case has empty base: the unique zero relative class is normalized and the map between zero cohomology groups is an isomorphism. For , the trivial-bundle case contained in [F1] supplies the normalized class and isomorphism.
Assume as induction hypothesis that the claim holds on for some . It holds on because that restriction is trivial. On , the two restricted classes are both normalized for the same supplied orientation and are equal by the uniqueness clause of [F1]; their cup maps are isomorphisms by restriction to the trivializing open .
Apply [F1] to the two opens and . It gives a unique normalized Thom class and isomorphism on . Thus the induction hypothesis propagates, and after the finite final index it holds on .
The argument needs neither a shrink nor the numeration: openness and finite triviality suffice. Any finite cover comes with some finite enumeration as part of the witness that it is finite, and fixing that one witness is not AC. Repeated or empty members, empty intersections, , rank zero, the zero ring, and the first and last induction endpoints are covered by [F1] and steps 1.1–2.1. Uniqueness makes the output independent of the chosen enumeration.
Depends on
Used by
Dependency tree · two levels
9 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
- May, A Concise Course in Algebraic Topology, Chapter 23 §5 (standard reference, not scraped)