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.

A knot grid diagram is admissible

Statement

Every toroidal grid diagram representing a knot is an admissible 2n-pointed Heegaard diagram in the stated knot Floer convention: each nonzero periodic domain with zero local multiplicity at every O-marking has both positive and negative region coefficients.

Facts & Assumptions

Given: A grid diagram of grid number n representing one oriented knot.

[F1]

Toroidal grid diagrams and gradings for oriented knots identifies the O-to-X row matching followed by the X-to-O column matching as a single n-cycle, and every row and column has exactly one marking of each type.

[F2]

Admissible multipointed Heegaard data for knot Floer complexes defines admissibility by requiring every nonzero periodic domain with zero multiplicity at all w-basepoints to have both positive and negative region coefficients; in a grid, w=O and z=X.

Proof

1.1F1F2givenconstruct

Regard the grid torus as the standard Heegaard torus separating the two solid tori of S3, with horizontal circles meridians of the first and vertical circles meridians of the second. The n parallel meridian disks in either solid torus cut it into n balls, one for each row or column annulus. Push the row O-to-X arcs into the first solid torus and the column X-to-O arcs into the second. Their pushing disks lie in disjoint row or column annuli and are disjoint from the compression disks, so each arc system is simultaneously boundary parallel as required by [F2]. The over/under convention is vertical over horizontal, exactly [F1]'s link. Thus these data represent the same oriented knot and satisfy the topological part of the multipointed definition; it remains to prove its admissibility condition.

1.2F1F2construct

Let pij be the coefficient of cell Rij in a periodic domain P. Because ∂P is a sum of whole horizontal and vertical circles, the coefficient jump across a vertical circle is independent of the row, and the jump across a horizontal circle is independent of the column. Fix reference indices i0,j0 and set ai=pi,j0 and bj=pi0,j−pi0,j0. Summing the constant jumps from the reference row and column gives pij=ai+bj for every cell. Since the marking permutation in [F1] is one cycle, number its basepoint pairs in reverse order of knot travel so that row region Ai contains wi,zi and column region Bi contains wi,zi+1, as allowed by the convention in [F2]. Then P=∑iaiAi+∑ibiBi, with local multiplicities nwi(P)=ai+bi and nzi(P)=ai+bi−1.

2.1step 1.2algebra

Suppose P is periodic and all nwi(P)=0. Then bi=−ai, so nzi(P)=ai−ai−1 and ∑inzi(P)=0. If one nzi(P) is nonzero, these integer multiplicities include both a positive and a negative value; each is a region coefficient at the corresponding X-cell, so P has both signs.

3.1F2step 1.2step 2.1algebra∎

If all nzi(P) also vanish, then all ai are the same integer c and all bi=−c. Hence P=c(∑iAi−∑iBi)=0, because each of the two sums is the whole torus with coefficient one. Thus a nonzero periodic domain with zero O-multiplicity cannot have all X-multiplicities zero, and step 2.1 proves it has both signs. By [F2], the grid diagram is admissible.

Depends on

Used by

Dependency tree · two levels

3 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