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.
Link-surgery filtered complex for a double branched cover
Definition
Let be a finite regular diagram of a nonempty oriented link with ordered crossing set . The resolution cube has vertices , and is obtained by applying the indicated local smoothing at every crossing. The link-surgery filtered module associated to is the direct sum
with the summand for in increasing filtration degree . Choose the subordinate Heegaard multi-diagram, compatible perturbation data and top-generator cycles for successive attaching-curve systems. The diagonal component of the candidate differential is the ordinary hat disk differential. For coordinatewise, sum over every ordered path changing one coordinate at each step. Its summand counts the zero-dimensional holomorphic -gon spaces with input at the vertex, the selected top-generator cycles between each pair of successive attaching systems, and output at the vertex. The count includes the allowed source conformal parameters and imposes zero basepoint multiplicity. These are the surgery polygon maps; the component is zero if . Thus changing several crossings is a sum over paths and polygon counts, not an arbitrary direct edge map. The increasing filtration is , extended by zero below and by at and above . Thus a component increasing lowers its filtration degree and preserves every . The cube direction and the reduced Khovanov cochain degree remain separate indices. The polygon-count finiteness, square-zero, and total-homology identifications are justified by the surgery lemma, which labels its actual Ozsváth–Szabó construction and top-input/filling calculations as external inputs, separately from the retained local analytic theorem and finite filtration algebra.
The local smoothing labels are those of Ozsváth–Szabó Figure1: in the chart with northwest–southeast over-strand, 0 joins the two left and two right endpoints, and 1 joins the two top and two bottom endpoints. These become A and B on the mirror chart, respectively. This fixes the convention for the consumers without a diagram-invariance assertion. The general surgery lemma also applies to links in arbitrary closed connected oriented smooth three-manifolds; this definition is only its branched-cover instance.
Definition references
Depends on
Used by
Dependency tree · two levels
14 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
- Ozsváth and Szabó, On the Heegaard Floer homology of branched double-covers, §§2 and 4 (standard reference, not scraped)
- Lipshitz, Heegaard Floer Homologies, §5 (standard reference, not scraped)