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.
A dualizable handle link gives two zero-trace descriptions
Statement
Assume countable choice. Let be a dualizable framed handle link and let be its associated handlebody. There are finite sequences of handle slides and cancellations, first sliding over and cancelling the -handle with the -handle , and then using the reversed roles, that leave single -framed attaching knots and , respectively. There are diffeomorphisms
Statement references
Facts & Assumptions
Given: Countable choice and a dualizable framed handle link .
Countable choice, written , is The Axiom of Countable Choice (). It is used only through the handle-slide and cancellation suppliers below.
Dualizable framed handle link: is a dotted -handle, are -framed -handles, each of and is a meridional two-component link, and .
Handle slide of one k handle over another and Handle slides preserve the relative diffeomorphism type: a slide of one -handle over another replaces its attaching circle by a band sum with a signed framed parallel copy and preserves the relative diffeomorphism type.
Handle cancellation: a -handle and -handle whose attaching and belt spheres meet transversely once cancel, preserving the diffeomorphism type relative to the incoming boundary and transporting all remaining attaching data.
The mixed crossing sum is even and defines linking number: the half-sum of mixed crossing signs is invariant under regular diagram changes and is symmetric in the two components.
A dualizable link can slide off a meridian disk: after finitely many slides and isotopies, the remaining attaching circle can be made disjoint from a spanning disk of the dotted circle. It constructs one framed slide and a product-bigon isotopy for each current intersection, reducing their finite count by one at every stage.
The diagram linking-number scan terminates and returns the stated integer and The mixed crossing sum is even and defines linking number: on a finite regular diagram of two oriented components, the scan returns the integer half-sum of mixed crossing signs, and that half-sum is invariant under orientation-preserving isotopy of the link. These suppliers do not identify the integer with a homology coordinate.
A knot exterior has first homology generated by its meridian: for a knot with the chosen tube and positive meridian, .
Meridian and preferred longitude: a preferred longitude has zero class in , and a degree-one parallel with zero class is a preferred longitude.
Proof
Fix disjoint oriented knots with a regular oriented diagram , and write in using [F7]. The inclusion is a homotopy equivalence: in the punctured tube , radial motion in each normal disk retracts onto its boundary torus. Thus the same coefficient is obtained in the open complement. Let be the half-sum of mixed crossing signs. At a mixed crossing where passes over with sign , switching the crossing changes by . In an oriented crossing ball straighten to the positive -axis. When , the old underpassing arc of runs in the positive direction, and the new arc above minus the old arc represents the negative positive-meridian class; when , reversing that tangent reverses the class. Hence the same switch changes by , so it changes by . After switching all mixed crossings, passes over at every projected intersection. Raise in the viewing-normal direction and move its projection into a disk disjoint from the projection of ; this is an isotopy in . The final lies in a -ball disjoint from , so its homology class is zero, and a regular diagram with separated projections has half-sum zero. By [F6] the half-sum is unchanged by this isotopy. Since every crossing switch changed the half-sum and meridian coefficient by the same integer, their initial values agree: . In particular, for any framed parallel of a knot , its framing integer measured by this half-sum is its meridian coefficient in ; it is zero exactly when . A degree-one parallel with zero class is a preferred longitude by [F8].
Choose a spanning disk for the unknotted dotted circle so that meets it once, as allowed by [F1]. Apply [F5] to obtain a finite sequence of slides of over and isotopies after which the remaining attaching circle is disjoint from . The supplier clears actual intersections one at a time; it does not infer geometric disjointness from a zero signed count.
At each slide of over , the oriented band sum represents in , where is the signed framed parallel of . By step 1.1, the meridian coordinate of is its framing integer . Thus the new linking number is . The initial framing pushoff of is its preferred longitude by [F1], so [F8] makes its class zero and step 1.1 gives . Therefore remains zero after every slide.
For the same band sum, expanding the linking of the new attaching circle with its transported pushoff gives The two self-pairings are the old framings and the two cross-pairings are equal by the symmetry in [F4]. The expansion is valid because the band and its pushoff are carried in disjoint product strips, so the four old pairings are unchanged outside the strips. Each framing integer is the meridian coordinate of its pushoff by step 1.1. All framing terms are zero initially by [F1], [F8] and step 1.1, and the mutual linking remains zero by step 2.1. Induction over the finite sequence in [F5] shows the final attaching framing is zero; isotopies preserve it.
The circle still goes geometrically once over the -handle , while the remaining attaching circle is disjoint from the cancellation disk. Therefore the attaching sphere of the -handle meets the belt sphere of the -handle once, and [F3] cancels this pair. Since the remaining attaching circle and its framing lie outside the cancellation neighborhood, the transported remaining handle is a single -framed -handle on a -ball. By [F1] this is . Slides preserve the handlebody by [F2], so .
Interchange and . The other meridional condition supplies the starting intersection for [F5], and the linking number remains zero by [F4]. The reversed slide sequence preserves both the zero mutual linking and zero framing by the calculations in steps 2.1 and 3.1. Cancel by the same one-intersection argument as in step 4.1. This gives ; combining with step 4.1 yields both trace descriptions.
Diagram
\begin{tikzpicture}[node distance=2.4cm,>=stealth]
\node (x) {$B^4\cup_R h^1\cup_B h^2_0\cup_G h^2_0$};
\node (kg) [below left of=x] {$B^4\cup_{K_G}h^2_0$};
\node (kb) [below right of=x] {$B^4\cup_{K_B}h^2_0$};
\draw[->] (x) -- node[left,align=center] {slide $G$ over $B$;\\cancel $(R,B)$} (kg);
\draw[->] (x) -- node[right,align=center] {slide $B$ over $G$;\\cancel $(R,G)$} (kb);
\draw[<->] (kg) -- node[below] {$X_0(K_G)\cong X_0(K_B)$} (kb);
\end{tikzpicture}
The diagram records the two handle reductions. The dotted label means a -handle, and each subscript means a zero-framed -handle. The proof establishes both reductions by framed slides and geometric cancellation; no handlebody conclusion is inferred from the diagram alone.
Depends on
- Smooth zero-trace of a knot
- Dualizable framed handle link
- Meridian and preferred longitude
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Handle slide of one k handle over another
- Handle slides preserve the relative diffeomorphism type
- The mixed crossing sum is even and defines linking number
- A dualizable link can slide off a meridian disk
- A knot exterior has first homology generated by its meridian
- The diagram linking-number scan terminates and returns the stated integer
- Handle cancellation
Used by
Dependency tree · two levels
43 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
- Lisa Piccirillo, The Conway knot is not slice (standard reference, not scraped)
- Jennifer Hom, Getting a handle on the Conway knot (standard reference, not scraped)