Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Toroidal grid diagrams and gradings for oriented knots

Definition

Let K⊂S3 be a smooth oriented knot, meaning one oriented component of a finite smooth oriented link in the standard oriented three-sphere S3=R3∪{∞}. The grid orientation below fixes the sign convention for its Alexander grading.

For an integer n≥2, put Tn=R2/(nZ)2, with horizontal circles αi={y=i} and vertical circles βj={x=j} for i,j∈Z/nZ. A toroidal grid diagram of grid number n is a pair of disjoint sets O,X of cell centers (j+12,i+12), read modulo n, such that every row and every column contains exactly one point of each set. In the fundamental square [0,n)×[0,n), 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 O-marking to its X-marking and each vertical segment from its X-marking to its O-marking. The markings and these segments determine an oriented link. Following each component from an O along its row to an X and then along that column to the next O defines a permutation of the n O-markings; its cycles are the link components. The grid represents a knot precisely when this permutation is one n-cycle.

A grid state is a subset x⊂⋃i,j(αi∩βj) containing exactly one intersection on each horizontal and each vertical circle. After numbering the circles, grid states correspond bijectively to permutations of {1,…,n}, so there are n! states. For states x,y, a rectangle from x to y is an embedded torus rectangle whose sides lie in grid circles, whose northeast and southwest corners lie in x, whose northwest and southeast corners lie in y, 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 x; write Rect⁡∘(x,y) for the empty rectangles from x to y.

To define the gradings, fix the fundamental square [0,n)×[0,n). For finite signed point sets P,Q in this square, set I(P,Q)=#{(p,q):p1<q1, p2<q2} and J(P,Q)=(I(P,Q)+I(Q,P))/2, extended bilinearly to signed point sets. Regard x, O, and X as signed point sets and define

MO(x)=J(x−O,x−O)+1,MX(x)=J(x−X,x−X)+1.

For a knot grid, define the rational Alexander value

AG(x)=MO(x)−MX(x)2−n−12.

The lemma establishing integrality and the rectangle-change formula is a well-definedness supplier for this grading. For any rectangle r, let Oi(r) and Xi(r) be 1 if the interior of r contains the corresponding marking and 0 otherwise; let nO(r)=∑iOi(r) and nX(r)=∑iXi(r).

For illustration, this 3×3 marking pattern has one marking of each type in every row and column; its cell centers are read modulo three on the torus.

OXOXOX123

Depends on

Used by

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