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.
Incidence number of two CW cells
Definition
For and oriented cells and , collapse the complement of in and compose the attaching map of with the resulting quotient to . Its induced endomorphism of oriented is multiplication by a unique integer, denoted .
For , choose the characteristic parametrization so the interval from to represents the chosen generator of . Write the chosen zero-cell generator as , with and the canonical point class in . For set Indeed the singular boundary is and , so this is precisely its coefficient in the chosen cellular basis. Canonical positive vertex generators give the usual terminal-minus-initial formula. Equal endpoints cancel for either sign. The negative vertex choice is an algebraic basis change, not a based self-map of of degree .
Depends on
Used by
- Morse and cellular boundaries for a surface handle presentation Example
- Axiomatic cellular boundaries are integral incidence matrices with coefficients Lemma
- Cellular boundary coefficients are the signed trajectory counts Lemma
- Cellular homology of the one-polygon surface model Lemma
- Handle boundary coefficients are attaching-belt intersection numbers Lemma
- Homological AHSS exact couple from the skeletal filtration Lemma
- The AHSS first differential is the cellular coboundary Lemma
- Cellular boundary is the incidence degree matrix Theorem
- Homological Atiyah–Hirzebruch spectral sequence Theorem
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
- Allen Hatcher, Algebraic Topology, Section 2.2 (standard reference, not scraped)