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.
Toroidal grid diagrams and gradings for oriented knots
Definition
Let be a smooth oriented knot, meaning one oriented component of a finite smooth oriented link in the standard oriented three-sphere . The grid orientation below fixes the sign convention for its Alexander grading.
For an integer , put , with horizontal circles and vertical circles for . A toroidal grid diagram of grid number is a pair of disjoint sets of cell centers , read modulo , such that every row and every column contains exactly one point of each set. In the fundamental square , join the two marks in each row and each column by the straight segment between their centers. At each crossing of the projected link, the vertical segment is over and the horizontal segment is under. Orient each horizontal segment from its -marking to its -marking and each vertical segment from its -marking to its -marking. The markings and these segments determine an oriented link. Following each component from an along its row to an and then along that column to the next defines a permutation of the -markings; its cycles are the link components. The grid represents a knot precisely when this permutation is one -cycle.
A grid state is a subset containing exactly one intersection on each horizontal and each vertical circle. After numbering the circles, grid states correspond bijectively to permutations of , so there are states. For states , a rectangle from to is an embedded torus rectangle whose sides lie in grid circles, whose northeast and southwest corners lie in , whose northwest and southeast corners lie in , and whose remaining state points agree. Rectangles are subsets of the torus, so their lifts may cross a chosen fundamental-domain edge. Such a rectangle is empty when its interior contains no point of ; write for the empty rectangles from to .
To define the gradings, fix the fundamental square . For finite signed point sets in this square, set and , extended bilinearly to signed point sets. Regard , , and as signed point sets and define
For a knot grid, define the rational Alexander value
The lemma establishing integrality and the rectangle-change formula is a well-definedness supplier for this grading. For any rectangle , let and be if the interior of contains the corresponding marking and otherwise; let and .
For illustration, this marking pattern has one marking of each type in every row and column; its cell centers are read modulo three on the torus.
Definition references
Oriented links, knots, and ambient isotopy in the standard three-sphere
Integrality and rectangle-change formula for the grid Alexander grading ↗
Ozsvath, Stipsicz, and Szabo, Grid Homology for Knots and Links, §§3.1–3.2 and 4.1–4.3
Manolescu, Ozsvath, and Sarkar, “A combinatorial description of knot Floer homology,” §§1 and 3
Depends on
Used by
- Finite grid complexes for knot Floer theory Algorithm
- Raw tilde grid homology depends on the unknot grid Counterexample
- Epsilon from the filtered knot Floer complex Definition
- Grid Upsilon from the diagonal grid complex Definition
- The Upsilon function from the filtered knot Floer complex Definition
- Tau of the unknot and trefoils from filtered staircases Example
- Worked grid-complex cases for the unknot Example
- A 3-by-3 unknot grid has tilde homology of rank four Lemma
- A genus-g knot cobordism bounds the tau difference Lemma
- A knot grid diagram is admissible Lemma
- Basepoint variables act chain homotopically on a knot grid Lemma
- Epsilon is stable-equivalence invariant but not a homomorphism Lemma
- Integrality and rectangle changes of the grid Alexander grading Lemma
- Rectangle-boundary pairings and grading changes in grid complexes Lemma
- The 2-by-2 unknot grid has tilde homology of rank two Lemma
- The Hedden–Ording t=2 positive Whitehead double has tau zero and s two Lemma
- The tau level is independent of the normalized Heegaard model Lemma
- Commutation and stabilization invariance of grid complexes Theorem
- Epsilon and Upsilon concordance data Theorem
- Grid homology is independent of the grid and computes knot Floer homology Theorem
- Grid moves generate isotopy of oriented knots Theorem
- Smooth concordance implies stable filtered equivalence of knot Floer complexes Theorem
- Termination and exact output of the grid-complex algorithm Theorem
- The grid Upsilon function agrees with the original Upsilon invariant Theorem
- Upsilon additivity, mirror symmetry, and four-ball genus bound Theorem
Dependency tree · two levels
6 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
- Peter S. Ozsvath, Andras I. Stipsicz, and Zoltan Szabo, Grid Homology for Knots and Links, §§3.1–3.2 and 4.1–4.3 (standard reference, not scraped)
- Ciprian Manolescu, Peter Ozsvath, and Sucharit Sarkar, A combinatorial description of knot Floer homology, §§1 and 3 (standard reference, not scraped)
- Ciprian Manolescu, An Introduction to Knot Floer Homology, §4.1 (standard reference, not scraped)