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.
The rank map on a disconnected compact space
Example
Let be compact Hausdorff and let , where and are nonempty clopen subspaces. The bundle that is on and on has rank class
Thus the rank map on a disconnected compact space is genuinely a locally constant function and cannot in general be replaced by one integer.
Facts & Assumptions
Given: the stated compact Hausdorff space and clopen decomposition with both pieces nonempty.
The rank homomorphism sends a bundle to its integer-valued fiber-dimension function, viewed in , and respects virtual differences (Grothendieck ring structure and rank map).
Bundles of locally constant finite rank, including rank zero, are admitted componentwise in the Whitney-sum monoid (The Whitney-sum monoid of complex vector bundles).
Verification
Form with projection to . Since and are disjoint open subsets, these product charts make a complex vector bundle whose fiber dimension is on and on .
Degree-zero cohomology of a disjoint union is the product of the degree-zero groups, and the fiber-dimension function in step 1.1 corresponds to . Therefore [F1] gives the displayed rank class.
If this class came from one integer , its restrictions to both nonempty pieces would be the same constant . Step 2.1 would force simultaneously and , a contradiction. Hence a single global integer cannot encode rank in general.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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 24 §1 (standard reference, not scraped)
- Hatcher, Vector Bundles & K-Theory, beginning of §2.1 (standard reference, not scraped)