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.
Choice-free homology and longitude computation for a supplied knot tube
Statement
Let be a smooth oriented embedding and suppose a product tubular embedding is supplied, where . Define , , , and let be inclusion. Fix and . Let be the fibre meridian and let be the product section . Then is infinite cyclic generated by . The kernel of has a unique generator whose image under the product projection is , and is a basis of . The proof uses no choice axiom beyond the supplied tube.
Statement references
Mayer–Vietoris sequence in singular homology — exact sequence for the open cover used below.
Facts & Assumptions
Given: , the supplied product tube , and the sets and curves in the statement.
Oriented links in the three-sphere and ambient isotopy: is a smooth embedding of the oriented circle in the fixed oriented -sphere.
Mayer–Vietoris sequence in singular homology: for an open cover , the sequence is exact.
Short exact chain Mayer–Vietoris sequence: the chain map from the intersection sends to , so the homology map has the same opposite-sign convention.
Cellular homology computes singular homology: the finite product CW structures on , , and compute their singular homology.
Cellular homology and Cellular boundary is the incidence degree matrix: cellular groups are free on cells and their differentials are the signed incidence maps.
Homotopy equivalences induce isomorphisms on singular homology: a deformation retraction induces an isomorphism on singular homology.
Proof
Give its one-vertex, one-edge CW structure. By the oriented-knot convention [F1], the core circle has the specified positive orientation used for the section generator. The solid tube retracts radially to the core circle, whose cellular boundary is zero, so . The product torus has one -cell, two -cells and one -cell; the two endpoint incidences cancel in degree , and the attaching commutator of the -cell has total signed incidence zero on each -cell. Thus , with basis the fibre class and section class . The projection to the first sends to and to .
Set and . They are open and cover . Radial contraction in the disk coordinate retracts to the core circle and to . The homotopy for , fixed for , retracts onto . The intersection map in the Mayer–Vietoris sequence is therefore the map given by , where is product projection.
By exactness and [F3], this intersection map is an isomorphism. Its restriction to is an isomorphism onto : injectivity follows from the isomorphism, and any has a preimage with . Hence , generated up to sign by .
Write for the unique integer , and define . Then and its product projection is . Every class in has the form and satisfies , so it is exactly ; the projection condition forces . The change-of-basis matrix from to has determinant , so the latter pair is a basis. All choices were the supplied finite product data and integer operations; no choice axiom was used.
Remarks
This calculation is deliberately local to a supplied product tube. It does not use the separate batch-57 theorem whose proof assumes full AC.
Depends on
- Oriented links in the three-sphere and ambient isotopy
- Mayer–Vietoris sequence in singular homology
- Homology of spheres
- Cellular homology computes singular homology
- Cellular homology
- Cellular boundary is the incidence degree matrix
- Homotopy equivalences induce isomorphisms on singular homology
- Short exact chain Mayer–Vietoris sequence
Used by
Dependency tree · two levels
30 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
- Joel Hass, Jeffrey C. Lagarias, and Nicholas Pippenger, The Computational Complexity of Knot and Link Problems, Journal of the ACM 46 (1999) (standard reference, not scraped)
- Jeff Erickson, Normal Surfaces and Knots, Computational Topology lecture notes (2009) (standard reference, not scraped)