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.
Relative fundamental class and boundary orientation
Definition
Let be a compact -oriented -manifold with boundary , where is a commutative unital ring and the orientation is supplied on . Its relative fundamental class is the unique class whose restriction at every interior point is the prescribed local generator. Existence and uniqueness, including manifolds with closed components, are proved in A collar constructs the relative orientation class and its boundary class.
The induced boundary orientation is the orientation whose local generator at is the restriction of , where is the homology pair connector. The same lemma proves that these restrictions are generators and form a continuous section. Thus for this orientation. In tangent-then-inward coordinates its generator is times the tangent generator for the product orientation: this is the outward-normal-first convention. Each component inherits its sign from the supplied interior orientation; there is no further independent selection of signs.
If is empty, this is the absolute fundamental class and the boundary class is zero. In dimension zero the boundary is empty. Empty and the zero coefficient ring give the unique zero class. These definitions and their well-definedness use no AC.
Depends on
Used by
- Poincaré–Lefschetz duality for a disk Example
- Poincaré–Lefschetz duality Theorem
Dependency tree · two levels
15 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 21 §4 (standard reference, not scraped)