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 first Serre differential is the cellular boundary with local coefficients
Statement
Let and satisfy the preceding relative-cell lemma, and write for its orientation-compatible cellwise isomorphism. Then Thus has bidegree and includes both the cellular incidence signs and covariant strict-fiber transport from each -cell center to the incident -cell center. Consequently All assertions are choice-free.
Facts & Assumptions
Given: The preceding cellwise identifications, their fixed disk orientations and radial paths, and the singular skeletal filtration.
Relative homology over one base cell is shifted fiber homology constructs by natural pair connectors, hemisphere excision, radial transport, and cell additivity.
A filtered complex produces an exact couple identifies the initial page with relative skeletal homology. The comparison The exact couple and subquotient constructions of the filtered complex spectral sequence agree preserves signs and says that the page differential sends a representative to .
Elementwise formula for the connecting map in module categories gives the positive-sign chain formula for a homology connector.
Singular and cellular local chain complexes fixes the intrinsic transport convention and the universal-cover tensor model. Twisted boundaries square to zero and ignore lift bases gives its group-ring incidence formula, square-zero property, and invariance under changes of cell lifts and orientations.
Cellular chains compute local homology identifies the intrinsic consecutive-skeleton group with the direct sum of the oriented coefficient stalks and its differential with the signed group-ring incidence matrix acting through monodromy.
Compact CW images have finite cell support without choice places the image of each attaching sphere in a finite subcomplex.
Proof
Put . In the exact couple of the filtration, the first differential is : the connector is followed by the quotient map By [F2] this exact-couple differential is the filtered-complex with no extra sign. Concretely, [F3] sends a relative cycle represented by to the class represented by in the preceding relative layer.
Fix oriented cells and . Project the source and target of Step 1.1 to their - and -summands using the cell-excision maps of [F1]. Naturality of pair connectors and excision gives a commutative square whose upper map is the boundary contribution of the attaching map to , and whose vertical maps are the iterated hemisphere isomorphisms defining . Thus the component of is determined entirely by the oriented attaching incidence together with fiber transport along the path from through the attaching sphere to .
To calculate that component, temporarily supply lifts of these two cells to a universal cover of their base component. Write with the finite signed sum of deck transformations determined by the lifted attaching incidences. Finiteness follows from [F6]. For one orientation-preserving degree-one disk contribution, naturality of every connector and excision map in [F1] makes the fiber map exactly the transport along its incidence path. For an orientation-reversing contribution, reduce by naturality to a reflection of the one-dimensional disk. Its pair sequence has boundary kernel after transport identifies the two endpoint groups. Interchanging the endpoints therefore multiplies the suspension isomorphism by . Additivity now makes a degree- incidence contribute times its transport, and summing the finitely many terms gives exactly the action of fixed in [F4].
It follows for every supplied lift basis that where the action notation is precisely the balanced tensor convention of [F4], hence precisely its signed transport formula. Changing lifts conjugates the incidence matrices and coefficient coordinates by the same diagonal deck transformations; changing orientations conjugates them by the same diagonal signs. Therefore [F4] descends this equality to the intrinsic cellular local complex, without any global choice of lifts. By [F5], the right side is . This proves the asserted intertwining identity.
The next page is the homology of . Step 4.1 identifies this chain complex with , and [F5] identifies its homology with . Hence .
For both differentials out of the left edge are zero. For the reflection calculation in Step 3.1 is the whole sign calculation, and for the same formula acts on fiber components. An empty or zero stalk, the zero ring, no incident cells, and a zero incidence coefficient contribute zero. One incidence of either sign is explicit in Step 3.1; multiple and cancelling incidences use finite additivity. Degenerate singular simplices remain in the relative chain representative of Step 1.1. Both endpoints of every incidence path occur in the typed transport . A cellular chain has finite support, and [F6] makes each relevant attaching support finite, so only finite supplied lift data are ever used; the intrinsic conclusion uses no AC. The statement is not an iff.
Depends on
- Relative homology over one base cell is shifted fiber homology
- A filtered complex produces an exact couple
- The exact couple and subquotient constructions of the filtered complex spectral sequence agree
- Elementwise formula for the connecting map in module categories
- Singular and cellular local chain complexes
- Twisted boundaries square to zero and ignore lift bases
- Cellular chains compute local homology
- Compact CW images have finite cell support without choice
Used by
Dependency tree · two levels
41 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
- Hatcher, Algebraic Topology, proof of Theorem 5.3 (standard reference, not scraped)