Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Filtered tower splitting for the Upsilon minimax

Statement

Let C=CFK∞(K) be the finite-rank free Λ=F2[U,U−1] knot Floer complex of a smooth oriented knot, with its Maslov grading, algebraic filtration i, Alexander filtration j, and weighted filtration Ft=(1−t/2)i+(t/2)j for a fixed t∈[0,2]. Assume its total homology is Λ generated in Maslov grading zero. Then the filtered graded complex (C,Ft) admits a filtered direct-sum decomposition C=T⊕A, where T=Λα, ∂α=0, α represents the normalized homology generator at filtration νt(C), and A is acyclic as a graded complex. In the t-modified complex, the non-torsion tower from T has maximal grading −2νt(C); hence this maximum equals the cycle-minimax definition of ΥK(t).

Facts & Assumptions

Given: A finite-rank free Λ complex with a homogeneous bifiltered basis as in the Statement, differential of Maslov degree −1, and total homology Λ generated in Maslov degree zero.

[F1]

The Upsilon function from the filtered knot Floer complex defines νt using the maximum weighted filtration of a finite cycle representing the normalized Maslov-zero class. Its Maslov-zero chain group, hence its candidate set over F2, is finite.

[F2]

The real-exponent coefficient series form a valuation domain proves the coefficient domain R and its field of fractions K, including the least-exponent criterion and that a common monomial clears the lower exponents of finitely many elements of K.

[F3]

Finite homogeneous complexes over the real-series ring have finite cyclic splittings proves finite homogeneous homology decomposition over R, so non-torsion homology generators and their maximal grading are justified without a Noetherian assumption.

Proof

1.1F1givenconstructalgebra

Put ν=νt(C) and choose a Maslov-zero representing cycle α with Ft(α)=ν, using [F1]. Let C0,C1 be the finite-dimensional chain groups in Maslov degrees zero and one. Set B0=∂C1 and L={z∈C0:Ft(z)<ν}, including zero. The maximum-filtration rule makes L a subspace. One has α∉B0+L: otherwise α=b+ℓ would make ℓ a cycle representing the same nonzero class at a smaller filtration. Finite-dimensional linear algebra therefore gives a functional λ:C0→F2 with λ(α)=1 and λ(B0+L)=0. Translate each homogeneous Laurent basis vector by the unique power of U putting its Maslov degree in {0,1}. Define a Λ-linear map P:C→Λα by P(x)=λ(x)α on these degree-zero basis vectors and P(y)=0 on the degree-one ones. Boundaries from degree one are annihilated by λ, and the differential of a degree-zero vector lies in UC1, on which P is zero. Thus P is a chain map and P(α)=α. If P(x)≠0, then Ft(x)≥ν because λ(L)=0; the U-translation rule gives the same inequality for every translate. Hence P preserves filtration.

2.1step 1.1givenconstructalgebra

Write α in the degree-zero basis and choose a term of largest filtration, which has filtration ν. Replacing that basis vector by α is invertible and preserves filtration in both directions, since all other terms in α have filtration at most ν. For every remaining degree-zero basis vector x, replace it by x+λ(x)α. When the extra term is present, Ft(x)≥ν, so this and its inverse preserve filtration. The degree-one basis is unchanged. The resulting basis consists of α and a basis of ker⁡P. Since P is a chain map, this is a filtered graded direct-sum decomposition C=T⊕A, with T=Λα and A=ker⁡P. Its total homology on T already maps isomorphically to H(C)=Λ, so H(A)=0. This proves the first assertion by an explicit filtered projection, without assuming that an arbitrary unfiltered acyclic complex is filtered contractible.

3.1F2step 2.1givenconstructalgebra

Return to the original basis xr at algebraic level zero, and put mr=M(xr) and ar=A(xr). Its differential has coefficients crsU(ms−mr+1)/2 with crs∈F2. Extend scalars to K by U=v2, and write er=vmrxr. The differential is then ∂er=v∑scrses. Let W be the finite F2-space on these formal er, with differential d0er=∑scrses. It squares to zero, since the two-step coefficient in the original differential has the same U exponent for every intermediate index. Separate W by the parity of mr. The even space identifies with C0 by er↦Umr/2xr, and the odd space with C1 by er↦U(mr−1)/2xr. The two matrices of d0 are respectively those of ∂:C1→C0 and U−1∂:C0→C1. Consequently H(W)even=F2 and H(W)odd=0, by the given total graded homology. Finite vector-space splittings extend to K; since v is invertible, ∂=vd0 has one-dimensional homology over K, detected by the same even homology functional.

4.1F1F2step 3.1givenalgebra

Let Ct be the exact t-modified polynomial-basis complex in the definition, and put gr=mr−tar. The K-linear map Φ(xr)=vtarxr from its scalar extension to the scalar extension of C is a grading-preserving chain isomorphism. Indeed, a differential term on the source has coefficient vms−mr+1−t(as−ar), and multiplying its target by vtas gives exactly vtarvms−mr+1, the differential of the image. The weighted filtration on the latter scalar extension is defined by Ft(vβxr)=tar/2−β/2, extended to a series by its least nonzero exponent and to a finite basis expansion by the maximum. Thus the image of Ct is exactly the lattice Ft≤0: its rth coefficient has least exponent at least tar. This is the explicit coordinate change, and it uses U=v2.

5.1F1F2step 3.1step 4.1givenalgebra

A cycle in Ct is non-torsion in homology exactly when its class remains nonzero over K. One direction follows by inverting a nonzero annihilating coefficient. Conversely, if the cycle becomes a boundary over K, the bounding chain has finitely many coefficients; a single monomial vc with c≥0 shifts all their least exponents into [0,∞) by [F2]. Multiplying the bounding equation by vc gives an annihilator of the original class over R. Now a homogeneous cycle of degree g in Ct has the form z=∑rϵrvgr−gxr, with ϵr∈F2, all occurring exponents nonnegative. Its image is v−g∑rϵrer, so the vector ζ=∑rϵrer is a d0-cycle. If z is non-torsion, step 3.1 shows that the even part of ζ represents the nonzero even homology class. Hence z0=∑mr evenϵrUmr/2xr is an original Maslov-zero cycle representing the normalized generator. For every term in z0, the nonnegative-exponent condition gives g≤mr−tar, and therefore Ft(z0)≤−g/2. It follows that every homogeneous non-torsion degree satisfies g≤−2ν.

6.1F1F2F3step 1.1step 2.1step 3.1step 4.1step 5.1givenalgebra∎

Conversely write a minimizing original Maslov-zero cycle as α=∑mr evenϵrUmr/2xr and put g=−2ν. Each exponent mr−tar−g in its support is nonnegative by the definition of Ft(α)=ν. Thus zt=∑rϵrvmr−tar−gxr is a homogeneous cycle in Ct, since its image under step 4.1 is v−gα and Φ is injective. Its scalar-extended homology class is nonzero by step 3.1, so it is non-torsion by step 5.1. Its degree is g=−2ν, attaining the upper bound. Finally the filtered projection and direct sum in steps 1.1–2.1 extend over K and restrict to the lattice Ft≤0. On T this lattice is Rv2να, with zero differential and generator degree −2ν; the complementary lattice has only torsion homology, since its scalar extension is acyclic. By step 4.1 this is precisely the non-torsion tower in the t-modified complex. This proves the complete tower/minimax identification, including irrational t and both endpoints.

Remarks

This is an algebraic theorem for a supplied normalized graded bifiltered complex. It proves no existence or invariance of analytic knot Floer complexes, no connected-sum identification, and no smooth cobordism genus estimate.

Depends on

Used by

Dependency tree · two levels

7 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