Alphabeta Math
DefinitionDefinition: 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.

The Upsilon function from the filtered knot Floer complex

Definition

Let K⊂S3 be a smooth oriented knot and C=CFK∞(K) a finitely generated free F2[U,U−1] complex. Choose a finite homogeneous basis {xr}, with M(xr) and Alexander filtration A(xr). The translate Ukxr has Maslov grading M(xr)−2k and filtration coordinates (i,j)=(−k,A(xr)−k). The total homology is F2[U,U−1]; use the standard normalization in which its Maslov-zero tower generator first appears at algebraic filtration level i=0, and denote it by ξK.

For t∈[0,2] and a nonzero finite chain z, define Ft(Ukxr)=(1−t/2)(−k)+(t/2)(A(xr)−k),Ft(z)=max⁡{Ft(Ukxr):Ukxr has nonzero coefficient in z}. Let Z0(C) be the set of Maslov-zero cycles representing ξK. Set νt(C)=min⁡z∈Z0(C)Ft(z),ΥK(t)=−2νt(C). The minimum is over cycles representing the normalized homology generator, not over individual basis terms. For comparison, let C−(K) be the F2[U]-span of the chosen basis and form its t-modified complex over the ring R of formal sums ∑α∈Scαvα whose support S⊂[0,∞) is well-ordered (every nonempty subset of S has a least element). The coefficient extension uses U=v2. In the extended Laurent complex, v lowers both filtration coordinates by 1/2 and Maslov grading by one, so a diagonal U-translation lowers the extended t-grading by two. On arbitrary homogeneous Laurent terms this grading is M−t(j−i); the formula M−tA below is specified on the chosen generators at i=0. A homogeneous generator x has t-grading M(x)−tA(x), extended by gr⁡t(vαx)=gr⁡t(x)−α. If a term Uky occurs in ∂x, its t-modified differential coefficient is vgr⁡t(y)−gr⁡t(x)+1; thus for ∂x=∑ycxyU(M(y)−M(x)+1)/2y, define ∂tx=∑ycxyvgr⁡t(y)−gr⁡t(x)+1y. This differential lowers t-grading by one. The comparison between its non-torsion tower grading and the finite cycle minimum is the separate filtered tower-splitting claim.

Facts & Assumptions

Given: A finitely generated free bifiltered knot Floer complex C whose total homology has a normalized Maslov-zero generator, as stated in the definition.

[A1]

The Alexander filtration and tau level: that item defines a diagram-specific hat threshold and does not itself prove diagram/surface independence or supply the Laurent filtration comparison. The current Grid homology is independent of the grid and computes knot Floer homology separately supplies a normalized grid-to-analytic filtered comparison; localization gives the Laurent comparison under its stated prerequisites. This Definition remains algebraic on a supplied normalized complex.

Proof

1.1givenA1algebra

For each of the finitely many basis generators xr, at most one Laurent translate has Maslov grading zero, since M(xr)−2k=0 determines k uniquely when it has an integer solution. Thus the Maslov-zero chain group is finite-dimensional over F2. A finite chain represents ξK, so Z0(C) is nonempty; being a subset of a finite vector space, it is finite. The minimum defining νt therefore exists for every t∈[0,2]. The algebraic argument here does not establish knot-model independence; the current grid comparison theorem supplies the normalized comparison for its stated grid and analytic models.

2.1givenstep 1.1algebra

If f:C→C′ is a bifiltered chain homotopy equivalence, then it sends every Maslov-zero cycle representing ξK to one representing the normalized generator of C′. Each term of f(z) has both filtration coordinates no larger than the corresponding input term, so Ft(f(z))≤Ft(z) for 0≤t≤2. Hence νt(C′)≤νt(C). Applying the same argument to a filtered inverse gives the reverse inequality, so νt(C′)=νt(C).

3.1givenstep 1.1step 2.1algebra

For a fixed cycle support, Ft(z) is the maximum of finitely many affine functions of t. Since Z0(C) is finite, νt is the minimum of finitely many such finite maxima. A finite minimum or maximum of affine functions is continuous and piecewise linear with finitely many breakpoints. Therefore ΥK(t)=−2νt(C) is continuous and piecewise linear on [0,2].

4.1givenstep 3.1algebra∎

For a differential term Uky in ∂x, the i-filtration gives k≥0 and the j-filtration gives A(y)−A(x)≤k. The Maslov grading gives M(y)−M(x)+1=2k, so its exponent in ∂tx is gr⁡t(y)−gr⁡t(x)+1=2k−t(A(y)−A(x))≥(2−t)k≥0. For a two-step path x→y→z, the two exponents sum to gr⁡t(z)−gr⁡t(x)+2, independent of y. Thus the coefficient of each z in ∂t2x is the coefficient of z in ∂2x multiplied by the same power of v; since ∂2=0, ∂t2=0.

Unresolved proof obligations

The diagramwise tau definition alone does not supply a normalized CFK∞ model. The current Grid homology is independent of the grid and computes knot Floer homology has an authored proof of the normalized grid-to-analytic comparison; localization gives the Laurent comparison under that supplier's stated prerequisites. The filtered tower-splitting item supplies the separate t-modified grading identification. This definition makes no assertion that s=2τ and does not itself prove model invariance.

Depends on

Used by

Dependency tree · two levels

23 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