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.
Integrality and rectangle changes of the grid Alexander grading
Statement
Let be a toroidal grid of grid number representing one oriented knot, and let , , and be the functions defined from its finite point sets and the pair-counting function . Then and are integer-valued, and every rectangle from a grid state to a grid state satisfies and . Consequently is integer-valued and .
Statement references
Facts & Assumptions
Given: A knot grid with grid number and the functions in the preceding definition.
Toroidal grid diagrams and gradings for oriented knots defines grid states as one point on each horizontal and vertical circle, defines by a finite pair count, and sets and .
Toroidal grid diagrams and gradings for oriented knots requires one and one in each row and column, and a one-component grid has a single -cycle in the induced marking permutation.
Proof
Each is an integer count. For , , so the two self-pair terms in the formulas for and are integers; the cross terms occur doubled. Hence both Maslov functions are integer-valued.
Suppose a rectangle is contained in the chosen fundamental square. Write its southwest and northeast corners as and its northwest and southeast corners as ; all other state points are common. In the common-point terms cancel, the ordered corner pair contributes , and each point of strictly inside contributes twice, once against each changed corner. Thus this difference is . In the same cancellation leaves twice the number of -markings in . Substituting these two counts into [F1] gives . Replacing every by gives the stated formula for .
For a marking set , write and let denote the northwest grid vertex of the cell containing the th mark, read on the bottom edge when that cell is in the top row. Let be the state consisting of these vertices. Expanding the formula in [F1] gives For distinct with neither mark in the top row, all four inequalities are equivalent and their signed contributions cancel. If is in the top row, the second and fourth inequalities are equivalent and the first and third are false; if is in the top row, the first and second inequalities are equivalent and the third and fourth are false. These contributions also cancel. For , the only inequality that can hold is , and it holds exactly for the unique mark in the top row. The displayed count is therefore , proving .
For two complementary rectangles and with the same vertical edges, let be their common width, counted in column strips. The one-- and one--per-column conditions in [F2] give and . The state has one point on each of the vertical circles strictly between those two edges, so . If the formula of step 1.2 holds for from to , these three equalities give the formula for from to by subtraction. The same argument applies to complementary rectangles sharing horizontal edges, counting rows instead of columns. Of the four torus rectangles for the two states, one lies in the fundamental square; successive horizontal or vertical complementations reach each of the other three, so the formulas hold for every torus rectangle.
Subtract the change from the change and divide by two. The constant terms and state-interior terms cancel, giving . The common normalization in cancels, proving the rectangle-change formula and that all differences of are integers.
The row and column connections from to and back form one -cycle by [F2]. Equivalently, the relative permutation between and is an -cycle. Factor that cycle into transpositions and apply them successively to obtain grid states between the two states. Two states that differ by one transposition have four intersection corners: the two row circles and two column circles cut the torus into four rectangles, and one of those rectangles has the first state at its southwest and northeast corners and the second state at its northwest and southeast corners. Thus each transition is realized by a torus rectangle, whether empty or not. Each rectangle changes by an odd integer by steps 1.2 and 2.1, so , using the zero normalization at from step 1.3. Since , the numerator defining twice is even. Hence this value is integral.
Any two grid states correspond to permutations, and a finite product of transpositions carries one to the other. Each transposition gives a rectangle transition. Step 3.1 shows that changes by an integer at every transition; since one state has integral Alexander value by step 3.2, all grid states do.
Depends on
Used by
- Finite grid complexes for knot Floer theory Algorithm
- Basepoint variables act chain homotopically on a knot grid Lemma
- Rectangle-boundary pairings and grading changes in grid complexes Lemma
- Grid homology is independent of the grid and computes knot Floer homology Theorem
Cited to discharge well-definedness by Toroidal grid diagrams and gradings for oriented knots.
Dependency tree · two levels
2 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, §4.3 (standard reference, not scraped)