Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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 G be a toroidal grid of grid number n representing one oriented knot, and let MO, MX, and AG be the functions defined from its finite point sets and the pair-counting function J. Then MO and MX are integer-valued, and every rectangle r from a grid state x to a grid state y satisfies MO(x)−MO(y)=1−2nO(r)+2#(x∩Int⁡r) and MX(x)−MX(y)=1−2nX(r)+2#(x∩Int⁡r). Consequently AG is integer-valued and AG(x)−AG(y)=nX(r)−nO(r).

Facts & Assumptions

Given: A knot grid G with grid number n and the functions in the preceding definition.

[F1]

Toroidal grid diagrams and gradings for oriented knots defines grid states as one point on each horizontal and vertical circle, defines J(P,Q)=(I(P,Q)+I(Q,P))/2 by a finite pair count, and sets MO(x)=J(x−O,x−O)+1 and MX(x)=J(x−X,x−X)+1.

[F2]

Toroidal grid diagrams and gradings for oriented knots requires one O and one X in each row and column, and a one-component grid has a single n-cycle in the induced O→X→O marking permutation.

Proof

1.1F1givenalgebra

Each I(P,Q) is an integer count. For P=Q, J(P,P)=I(P,P), so the two self-pair terms in the formulas for MO and MX are integers; the cross terms occur doubled. Hence both Maslov functions are integer-valued.

1.2F1constructalgebra

Suppose a rectangle r is contained in the chosen fundamental square. Write its southwest and northeast corners as x1,x2∈x and its northwest and southeast corners as y1,y2∈y; all other state points are common. In J(x,x)−J(y,y) the common-point terms cancel, the ordered corner pair contributes 1, and each point of x strictly inside r contributes twice, once against each changed corner. Thus this difference is 1+2#(x∩Int⁡r). In 2J(x,O)−2J(y,O) the same cancellation leaves twice the number of O-markings in r. Substituting these two counts into [F1] gives MO(x)−MO(y)=1−2nO(r)+2#(x∩Int⁡r). Replacing every O by X gives the stated formula for MX.

1.3F1F2constructalgebra

For a marking set P∈{O,X}, write MP(x)=J(x−P,x−P)+1 and let NW(Pi) denote the northwest grid vertex of the cell containing the ith mark, read on the bottom edge when that cell is in the top row. Let xNWP be the state consisting of these vertices. Expanding the J formula in [F1] gives MP(xNWP)=#{(i,j):NW(Pi)<NW(Pj)}−#{(i,j):NW(Pi)<Pj}−#{(i,j):Pi<NW(Pj)}+#{(i,j):Pi<Pj}+1. For distinct i,j with neither mark in the top row, all four inequalities are equivalent and their signed contributions cancel. If Pj is in the top row, the second and fourth inequalities are equivalent and the first and third are false; if Pi is in the top row, the first and second inequalities are equivalent and the third and fourth are false. These contributions also cancel. For i=j, the only inequality that can hold is NW(Pi)<Pi, and it holds exactly for the unique mark in the top row. The displayed count is therefore −1+1=0, proving MO(xNWO)=MX(xNWX)=0.

2.1F2step 1.2constructalgebra

For two complementary rectangles r and r′ with the same vertical edges, let v be their common width, counted in column strips. The one-O- and one-X-per-column conditions in [F2] give nO(r)+nO(r′)=v and nX(r)+nX(r′)=v. The state has one point on each of the v−1 vertical circles strictly between those two edges, so #(x∩Int⁡r)+#(x∩Int⁡r′)=v−1. If the formula of step 1.2 holds for r from x to y, these three equalities give the formula for r′ from y to x 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.

3.1step 1.2step 2.1algebra

Subtract the MX change from the MO change and divide by two. The constant terms and state-interior terms cancel, giving MO(x)−MX(x)2−MO(y)−MX(y)2=nX(r)−nO(r). The common normalization −(n−1)/2 in AG cancels, proving the rectangle-change formula and that all differences of AG are integers.

3.2F1F2step 1.2step 2.1step 1.3choosealgebra

The row and column connections from O to X and back form one n-cycle by [F2]. Equivalently, the relative permutation between xNWX and xNWO is an n-cycle. Factor that cycle into n−1 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 MX by an odd integer by steps 1.2 and 2.1, so MX(xNWO)≡n−1(mod2), using the zero normalization at xNWX from step 1.3. Since MO(xNWO)=0, the numerator MO−MX−(n−1) defining twice AG(xNWO) is even. Hence this value is integral.

4.1step 3.1step 3.2constructalgebra∎

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 AG 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

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