Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 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.

The Alexander filtration and tau level

Definition

Let K be a smooth oriented knot in the standard oriented three-sphere. Let F be a compact connected oriented Seifert surface with boundary K, and let H=(Σ,α,β,w,z) be an admissible doubly pointed Heegaard diagram representing (K,F). The associated one-pointed hat chain complex CF^(H) is the finite-dimensional chain complex over F2 obtained from the minus complex by setting its basepoint variable to zero; its differential counts index-one disks with zero multiplicity at w. Assume for this specified data that the differential is nonincreasing in the Alexander filtration, that the absolute Alexander formula below takes integer values, and that H(CF^(H))≅F2. Give a generator x its absolute Alexander filtration AF(x)=12⟨c1(sw,z(x)),[F^]⟩, where sw,z(x) is the homology class of the nowhere-vanishing vector field assigned to x by the pointed Morse construction, with its prescribed boundary data near the two basepoints; c1 is the first Chern class of the oriented plane field perpendicular to that vector field. To form the zero-framed surgery, remove a tubular neighborhood of K and glue in a solid torus whose meridian is the longitude induced by F. The surface F^ is obtained by deleting a boundary collar of F and capping its longitude by the meridian disk of that solid torus. This is the standard integer normalization, with the one-generator diagram of the standard unknot at filtration zero. The subcomplex FsCF^(H) is spanned by generators of Alexander filtration at most s.

More generally, a finite integer-filtered chain complex is a finite-dimensional chain complex C over F2 with subcomplexes FsC such that FsC=0 for all sufficiently small integers s and FsC=C for all sufficiently large integers s. If H(C)≅F2, define τ(C):=min⁡{s∈Z:im⁡(H(FsC)⟶H(C))≠0}. For the fixed diagram and surface above, write τH,F(K)=τ(CF^(H),F∗CF^(H)). Once diagram and surface independence is proved, their common value is the knot invariant τ(K). Until that comparison is proved, τH,F(K) denotes only the value for the specified data.

Facts & Assumptions

Given: A finite integer-filtered chain complex C over F2 with H(C)≅F2.

[A1]

The filtration is exhaustive, bounded below, and each FsC is a subcomplex, as required in the Definition.

[A2]

The total homology is nonzero and one-dimensional, as required in the Definition.

[A3]

The Alexander levels are integers, as required in the Definition.

[F1]

The well-ordering principle: every nonempty subset of N0 has a least element.

Verification

1.1A1A2givenalgebra

Since FsC=0 for all sufficiently small s, the inclusion-induced map H(FsC)→H(C) is zero at those levels. Since FsC=C for all sufficiently large s, this map is the identity on H(C) at those levels and is nonzero by [A2].

2.1A1A3F1step 1.1constructalgebra∎

Let S={s∈Z:H(FsC)→H(C) has nonzero image}. Step 1.1 shows S is nonempty, and [A1] gives an integer lower bound m for S. Then S−m is a nonempty subset of N0; by [F1] it has a least element k. For every s∈S, s−m≥k, so m+k is the least element of S. This proves that τ(C) exists and is unique.

Depends on

Used by

Dependency tree · two levels

20 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