Alphabeta Math
Pipeline-generated
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.

Epsilon and Upsilon concordance invariants

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Epsilon from the filtered knot Floer complex

Definition

Work over F2=Z/2Z. Let K⊂S3 be a smooth oriented knot and let C=CFK∞(K) be its finitely generated free F2[U,U−1] chain complex with Maslov grading M and bifiltration coordinates (i,j). Multiplication by U lowers each filtration coordinate by one and lowers M by two; the differential lowers M by one and does not increase either filtration. The total homology is F2[U,U−1] with its generator normalized in Maslov grading zero.

For a filtration region R, write C{R} for the corresponding subquotient of the bifiltered complex; in particular C{i=0} is the vertical complex, C{j=s} is the horizontal complex at Alexander level s, and C{i=0,j≤s} is the subcomplex of the vertical complex at levels at most s. Define τ(C)=min⁡{s∈Z:H∗(C{i=0,j≤s})⟶H∗(C{i=0}) is nonzero}. For each integer s, let Fs be the homology map induced by the chain map from C{i=0} to C{min⁡(i,j−s)=0} obtained by quotienting by C{i=0,j<s} and then including the quotient. Let Gs be the homology map from C{max⁡(i,j−s)=0} to C{i=0} obtained by quotienting by C{i<0,j=s} and then including. The epsilon invariant is ϵ(C)={1,Fτ(C)=0,−1,Gτ(C)=0,0,Fτ(C)≠0 and Gτ(C)≠0. Here zero and nonzero refer to the induced homology maps. This definition fixes the sign convention; invariance under stable equivalence is a separate claim.

Facts & Assumptions

Given: A finitely generated bifiltered knot Floer complex C with the grading, filtration, and rank-one vertical homology conventions stated above.

[A1]

The Alexander filtration and tau level: that item defines the threshold for specified normalized filtered hat data and does not itself prove diagram/surface independence or state the Laurent subquotient interface used here. 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 an algebraic definition on a supplied complex.

[F1]

The two bifiltered hook maps cannot both kill the threshold class proves that a vertical class represented at j≤s and killed by Fs is in the image of Gs, by explicit northeast/southwest hook projections. It uses no simultaneous horizontal simplification theorem.

Proof

1.1givenF1algebra

The quotient and inclusion constructions defining Fs,Gs are chain maps between the stated subquotient complexes, since the differential cannot increase either coordinate. The vertical complex is finite-dimensional: translate each of the finitely many homogeneous Laurent basis generators to algebraic level zero. Its remaining basis has finitely many integer Alexander levels. Since its homology is one-dimensional by the Given data, some finite cycle represents its nonzero class. Below the least basis level the filtered subcomplex is zero, and above the greatest level it is the whole vertical complex. Thus the minimum defining τ(C) exists.

2.1givenF1step 1.1algebra∎

Let s=τ(C) and let ξ be the nonzero vertical homology class, with a cycle representative supported at j≤s. If Fs=0, [F1] produces a southwest-hook cycle whose image under Gs is ξ, so Gs≠0. Hence the two maps cannot both vanish. Their remaining zero/nonzero possibilities are exactly the three displayed cases, proving the algebraic trichotomy and the value set {−1,0,1}. This argument assumes no horizontal-representative equivalence, and supplies no model independence.

Unresolved proof obligations

The diagramwise tau definition alone does not supply an analytic 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. This Definition's two-hook proof establishes only the algebraic trichotomy for a supplied finite based bifiltered complex with rank-one vertical homology. It does not prove stable-equivalence or concordance invariance, nor the simultaneous horizontal-representative normal form supplied separately by Finite filtered splittings preserve the epsilon maps under total-acyclic stabilization.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

A smooth slice knot has a knot Floer complex stably equivalent to the unknot

Statement

Assume the Axiom of Countable Choice. Let K⊂S3 be a smooth oriented knot smoothly concordant to the unknot. Then there are finite-rank free F2[U,U−1] bifiltered chain complexes A and B, each having zero total homology, such that CFK∞(K)⊕A≃Λ⊕B, where Λ=F2[U,U−1] is the normalized unknot complex with zero differential and generator in Maslov grading and both filtration coordinates zero, and ≃ is a Maslov-graded filtered chain homotopy equivalence whose maps and homotopies do not increase either filtration. The acyclic summands are acyclic only after the filtrations are forgotten; no acyclicity of their associated-graded complexes is asserted.

Facts & Assumptions

Given: A smooth concordance from K to the unknot, the accepted normalized knot complex over Λ=F2[U,U−1], and ACω.

[F1]

Smooth concordance is represented by the actual annulus in the Statement. Smooth knot concordance

[F2]

The accepted normalized knot/grid and analytic comparisons identify the finite homogeneous bifiltered complex, total generator and both grading origins. Grid homology is independent of the grid and computes knot Floer homology, Regularity, compactness, and gluing for pointed Heegaard disks

[F3]

External Floer input under CLAUDE.md §12: a smoothly slice knot has CFK∞(K)≃CFK∞(U)⊕D as a graded bifiltered Laurent chain complex, with D finite-rank free and totally acyclic. The finite homogeneous filtered-basis splitting and the concordance-to-slice application are Hom, A survey on Heegaard Floer homology and concordance, Theorem1, Proposition3.11 and its proof, and proof of Theorem1, printed1–2,12–14. Coefficients are F2; acyclicity concerns total homology and not associated gradeds. The unknot factor has the usual Maslov-zero and (0,0) origin. This is an external established input, not a completed local decorated-annulus/movie construction. The cited statements and finite splitting proof on printed1–2,12–14 were read; no complete reading of the survey or its upstream surgery references is claimed.

[F4]

Choice scope of the external input: use it for the fixed knot diagram and finite smooth concordance/surface under consideration, not for a simultaneous choice of data for every knot. Integer domains and Spin-c labels form countable sets; all coefficient matrices and final graded basis changes are finite. Compact source charts give separable Sobolev and almost-complex parameter spaces with countable bases. Their fixed Fredholm problems admit a countable family of finite-cokernel perturbation charts, selected using ACω; the usual finite-dimensional Sard reduction and least-basis nested-ball Baire construction select one datum regular for the countable list. Compactness/gluing is used pointwise for these data, with finite covers of the compact low-index moduli and least-integer shrinking thresholds, not an arbitrary family of choices. Thus the imported fixed-data construction has a finite/countable specialization; full AC is not substituted for the declared ACω branch. The cited papers are not claimed to contain an explicit foundational choice audit.

Proof

1.1givenF1F2F3F4construct

The given annulus makes K smoothly slice in exactly the sense of [F3]. Use [F2] to identify the input with its normalized finite homogeneous model. Apply [F3] at these fixed data, with the finite/countable specialization [F4], to obtain C(K)≃Λ⊕D with all maps and homotopies preserving both filtrations and Maslov grading. Its displayed unknot factor has the same origins as the Statement; no Alexander translation or positive U-power is inserted.

2.1F3step 1.1algebra∎

Set A=0 and B=D. The zero complex is finite-rank free and totally acyclic, as is D by [F3]. The equivalence in step1.1 is therefore the exact stable equivalence requested. No associated-graded acyclicity or filtration-preserving contraction of D is claimed. This closes the original Statement by the explicit external slice-splitting input; the earlier locally attempted movie admission is not represented as a proof.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

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.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Grid Upsilon from the diagonal grid complex

Definition

Let G be an n×n toroidal grid diagram representing a knot. Let GC−(G) be the finite grid complex over F2[U1,…,Un] with its Maslov grading M and Alexander filtration A. Form the diagonal quotient DG=GC−(G)/(U1−U2,…,U1−Un), regarded as a finitely generated F2[U] complex with U=U1=⋯=Un.

For a finitely generated Maslov-graded, Alexander-filtered complex D over F2[U] with a fixed finite homogeneous basis, its t-modified complex for t∈[0,2] is the free R-module on that basis, where R is the ring of formal F2-series ∑α∈Acαvα with support A⊂[0,∞) such that every nonempty subset of A has a least element. A homogeneous generator x has t-grading gr⁡t(x)=M(x)−tA(x), extended by gr⁡t(vαx)=gr⁡t(x)−α. The coefficient extension uses U=v2; this action lowers the extended t-grading by two. The formula M−tA is specified on the chosen polynomial generators. On Laurent translates, the extended grading is M−t(j−i), with v lowering both filtration coordinates by 1/2. If ∂x=∑ycxyU(M(y)−M(x)+1)/2y, then the modified differential is ∂tx=∑ycxyvgr⁡t(y)−gr⁡t(x)+1y. A homogeneous homology class is non-torsion if no nonzero element of R annihilates it. For 0≤t≤1, define ΥG(t) to be the maximum t-grading of a homogeneous non-torsion class in H∗(DGt). For 1<t≤2, define ΥG(t)=ΥG(2−t). This is the grid convention compared with the original cycle-minimax invariant.

Facts & Assumptions

Given: A finite grid diagram G for a knot, its finite grid complex, and the coefficient and grading conventions specified in the definition.

[F1]

Toroidal grid diagrams and gradings for oriented knots: a knot grid has one O and one X in each row and column, with the induced oriented component permutation a single cycle.

[F2]

Finite grid complexes for knot Floer theory: the grid construction returns a finite state complex with the displayed marking-variable differential; its identification with knot Floer homology is a separate theorem.

[F3]

The Upsilon function from the filtered knot Floer complex: t-grading is M−tA, multiplication by vα lowers it by α, and the modified differential is reweighted to have degree −1.

[F4]

Grid homology is independent of the grid and computes knot Floer homology now has an authored Proof section. Its Statement supplies the chosen-variable filtered comparison and the simultaneous-collapse CFK−(K)⊗V⊗(n−1) factor needed here. MOS Proposition 2.3 states the chosen-variable filtered comparison and the tilde-homology V-factor, and Theorem 3.3 identifies the grid filtered complex with the knot filtration; the current in-run proof supplies the chain-level ordinary-collapse factor and the absolute normalization under its stated prerequisites. Under that comparison, the normalized CFK− tower gives a non-torsion summand in the diagonal quotient's t-modified homology.

Proof

1.1givenF2F3algebra

Every term in ∂t2x corresponding to a two-step path x→y→z has exponent (gr⁡t(y)−gr⁡t(x)+1)+(gr⁡t(z)−gr⁡t(y)+1)=gr⁡t(z)−gr⁡t(x)+2, which is independent of the intermediate generator y. Its coefficient is therefore the coefficient of z in ∂2x, multiplied by that common power of v. Since ∂2=0, ∂t2=0. For every differential term the exponent is nonnegative: writing its U-power as k, the Maslov relation gives M(y)−M(x)+1=2k, and the Alexander filtration gives A(y)−A(x)≤k, hence 2k−t(A(y)−A(x))≥0 for 0≤t≤2. Thus DGt is a chain complex over R.

2.1givenF1F2F3F4step 1.1algebra

The quotient identifies finitely many marking variables in a complex with finitely many grid states, so DG has a finite polynomial basis. Its t-modification is a finite homogeneous complex over the coefficient ring proved in The real-exponent coefficient series form a valuation domain. The explicit finite matrix reduction of Finite homogeneous complexes over the real-series ring have finite cyclic splittings gives a finite sum of free homology generators and cyclic torsion summands, and proves that, if a free summand is present, its largest homogeneous non-torsion grading exists. Thus the asserted maximum is justified without a Noetherian assumption on R. The current grid comparison [F4] supplies a nonzero free tower for this actual diagonal quotient.

3.1givenF1F2step 2.1∎

The quotient convention and the symmetric extension for t>1 are part of the definition, not consequences of the comparison theorem. No grid-independence or agreement with the knot Floer Upsilon invariant is asserted here; those are theorems on this page.

Unresolved proof obligations

The current grid-homology comparison theorem now has an authored proof and supplies the non-torsion tower needed to make this maximum well-defined, under its stated analytic and normalization prerequisites. This definition itself still makes no grid-independence or Upsilon-agreement claim; those are supplied by the theorem on the assigned page.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

The auxiliary nu-minus threshold is bounded by smooth slice genus

Statement

For the knot-level assertions, assume the Axiom of Countable Choice. Let K⊂S3 be a smooth oriented knot and let C(K)=CFK∞(K) have a finite homogeneous basis x1,…,xm with Maslov grading M(xr) and Alexander filtration A(xr). Let C−(K) be the subcomplex spanned over F2[U] by Unxr for n≥0, with M(Unxr)=M(xr)−2n and A(Unxr)=A(xr)−n, and assume H∗(C−(K))≅F2[U] with generator in Maslov degree zero. For each integer s, let A(K,s) be the subcomplex spanned over F2 by those terms Unxr with n≥0 and A(xr)−n≤s. For any Z-graded F2[U] complex D that is finitely generated as an F2[U]-module, with U of Maslov degree −2, let δ(D) be the maximal Maslov grading of a homogeneous non-torsion class in H∗(D), with δ(D)=−∞ if no such class exists. Define ν−(K) to be the least integer s for which δ(A(K,s))=0. Then 0≤ν−(K)≤g4sm(K), where g4sm(K) is the minimum genus of a smooth compact connected oriented properly embedded surface in the four-ball bounded by K.

Facts & Assumptions

Given: A smooth oriented knot, its normalized minus complex, and the smooth four-ball genus. Countable Choice is assumed for the knot-level constructions and geometric comparisons; finite algebra on the stated supplied complexes and maps requires no further choice.

[F1]

The Upsilon function from the filtered knot Floer complex: the finite bifiltered complex has a finite homogeneous basis, multiplication by U lowers both filtration coordinates by one and Maslov grading by two, and its total localized homology has a normalized Maslov-zero generator.

[F2]

The accepted normalized grid-to-analytic comparison identifies the knot complexes, with all marked-variable and stabilization factors accounted for. It is reused at that exact knot scope. Grid homology is independent of the grid and computes knot Floer homology

[A6]

Regularity, compactness, and gluing for pointed Heegaard disks supplies actual full-filtered chosen disk counts and compactification for knots in S3, without the grid/Heegaard identification or the absolute large-surgery normalization.

[A7]

The Axiom of Countable Choice (ACω): the declared analytic cobordism branch uses countable choice; no full choice is inferred.

[F3]

The accepted normalized analytic coordinate-swap equivalence is Maslov-zero and Laurent-linear, exchanges both filtrations, and preserves the normalized total generator, with its filtered inverse and homotopies. Knot Floer duality and exchange of the two filtrations

[F4]

External genus input under CLAUDE.md §12: for the normalized F2[U] knot complex, the least s with δ(A(K,s))=0 is at most the smooth four-ball genus. Its module, Maslov and Alexander conventions are exactly Definitions2.11–2.12 and Theorem2.14 of Ozsváth–Stipsicz–Szabó, printed10–11. Proposition2.13 identifies this threshold with Hom–Wu's ν+; Hom–Wu, Proposition2.4, printed5 supplies the smooth genus inequality. This imports the established large-surgery/cobordism bound, not just a formal triangle identity or a localized nonzero map. The exact OSS §2.3 statement and plus/minus proof on printed10–11 and Hom–Wu definition/propositions on printed3–5 were read; Rasmussen’s upstream proof is not represented as read or locally reconstructed.

[F5]

Choice scope of the external input: use it for the fixed knot diagram and finite smooth concordance/surface under consideration, not for a simultaneous choice of data for every knot. Integer domains and Spin-c labels form countable sets; all coefficient matrices and final graded basis changes are finite. Compact source charts give separable Sobolev and almost-complex parameter spaces with countable bases. Their fixed Fredholm problems admit a countable family of finite-cokernel perturbation charts, selected using ACω; the usual finite-dimensional Sard reduction and least-basis nested-ball Baire construction select one datum regular for the countable list. Compactness/gluing is used pointwise for these data, with finite covers of the compact low-index moduli and least-integer shrinking thresholds, not an arbitrary family of choices. Thus the imported fixed-data construction has a finite/countable specialization; full AC is not substituted for the declared ACω branch. The cited papers are not claimed to contain an explicit foundational choice audit.

Proof

1.1givenF1algebra

A finite homogeneous generating set bounds the Maslov degrees of D, and hence of H∗(D), above. Therefore the integer degrees of homogeneous non-torsion classes, if nonempty, have a maximum, so δ(D) is well-defined on the stated domain. Write Mr=M(xr) and Ar=A(xr). The terms of A(K,s) on the rth U-tower are Unxr with n≥max⁡(0,Ar−s), so their Maslov gradings are at most Mr−2max⁡(0,Ar−s). By [F1], this bound tends to −∞ as s tends to −∞; since the basis is finite, choose s0 so that it is strictly negative for every r when s≤s0. Then H∗(A(K,s)) has no class of degree zero and δ(A(K,s))≠0. For all s≥max⁡rAr, A(K,s)=C−(K) and its normalized tower gives δ=0. Thus the set defining ν− is nonempty and bounded below, and its least element exists. This argument does not prove that the least element is nonnegative.

1.2givenF1algebra

Put R=F2[U], B=C−(K) and As=A(K,s). The latter has finite free basis Umax⁡(0,Ar−s)xr. Its actual inclusion vs:As→B becomes the identity of C(K) after localization. Therefore the kernel of its homology map is U-torsion and its image is a nonzero homogeneous ideal UVsR, with Vs≥0. A homogeneous polynomial-torsion class is U-torsion: the different powers of U have distinct Maslov degrees, so a polynomial annihilator implies a monomial annihilator for that class. Consequently homogeneous non-torsion classes are exactly the homogeneous classes having nonzero image in the localized tower. Their maximal grading is the top grading of the image ideal, and hence δ(As)=−2Vs.

2.1F3step 1.2constructalgebra

Reuse the supplied Maslov-zero Laurent-linear analytic coordinate-swap equivalence Φ:C(K)→C(K), preserving the normalized total generator and swapping the two filtrations, with its swap-filtered inverse and homotopies. For s∈Z, hs=ΦUs:As→B is an actual polynomial-target map: a point with i≤0,j≤s goes to (j−s,i−s), whose first coordinate is at most zero. Its Maslov degree is −2s. It localizes to an isomorphism, so its homology image is UHsR, Hs≥0. The same non-torsion-domain calculation gives −2Hs=δ(As)−2s, and thus Hs=Vs+s. This argument permits negative s in the Laurent intermediate complex and proves that the final target lies in the polynomial subcomplex; it does not treat Us alone as an endomorphism of B for negative s.

3.1givenstep 1.1step 1.2step 2.1algebra

If s<0, Vs=Hs−s≥−s>0. Therefore δ(As)≠0 for every negative s. Together with step1.1 this proves existence of the threshold and ν−(K)≥0. A direct local alternative for the upper inequality would require an actual surface input. Sufficient would be an R-linear Maslov-zero map from the unknot tower to B, with image in Ag, sending the homology generator to the normalized generator1. Its image cycle would force Vg=0 and ν−(K)≤g. A map with value a positive U-power, a localized nonzero map, or a tau inequality does not suffice.

4.1givenF4F5step 1.2step 3.1algebra∎

The finite free basis of As in step1.2 is exactly the basis in the external Definition2.12, since its exponent condition is n≥max⁡(0,Ar−s), and the normalized top minus grading is zero in both conventions. Thus [F4] applies to the SAME threshold, not to a shifted plus invariant. It gives ν−(K)≤g4sm(K) at the fixed data with [F5]. Combine this with step3.1 to obtain both original inequalities. The upper bound is explicitly external; the local exponent/nonnegativity argument is retained.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Smooth concordance implies stable filtered equivalence of knot Floer complexes

Statement

For the knot-level assertions, assume the Axiom of Countable Choice. Let K,J⊂S3 be smooth oriented knots that cobound a smooth properly embedded annulus in S3×[0,1]. Then there are finite-rank free F2[U,U−1] bifiltered chain complexes A and B with zero total homology such that CFK∞(K)⊕A≃CFK∞(J)⊕B, where ≃ denotes a Maslov-graded chain homotopy equivalence whose maps and chain homotopies do not increase either filtration. The complexes A and B are acyclic after the filtrations are forgotten; they need not be acyclic in either associated-graded complex.

Facts & Assumptions

Given: A smooth annulus concordance from K to J, the filtered connected-sum tensor convention, and the normalized knot Floer complex of each boundary knot. Countable Choice is assumed for the knot-level constructions and geometric comparisons; finite algebra on the stated supplied complexes and maps requires no further choice.

[F1]

Smooth and topological knot concordance classes form abelian groups: the smooth concordance classes form an abelian group with inverse represented by reverse mirror; the smooth proof branch is present and complete. The topological branch is not used.

[F5]

The slice-complex stable-splitting lemma supplies exactly the finite-rank free totally acyclic stabilizations and filtered graded equivalence needed below. Its geometric slice input is explicitly external Hom, with the fixed finite/countable specialization stated there; no local movie theorem is inferred. A smooth slice knot has a knot Floer complex stably equivalent to the unknot

[F2]

The supplied full connected-sum comparison is a Maslov-graded bifiltered Laurent chain homotopy equivalence, with inverse and filtered homotopies, and yields the actual tensor complex. The filtered knot Floer complex of a connected sum is a tensor product

[F3]

The full normalized grid/analytic filtered comparison is supplied. Grid homology is independent of the grid and computes knot Floer homology

[F4]

The actual chosen-data full-filtered disk analysis is supplied on its stated knot scope. Regularity, compactness, and gluing for pointed Heegaard disks

Proof

1.1givenF1

In the smooth concordance group, the annulus gives [K]=[J], so K#(−J) is smoothly slice. Also J#(−J) is slice by the group inverse law.

2.1givenF5F3F4step 1.1algebra

Apply the exact stable form of [F5] to the slice knots K#(−J) and J#(−J). Write CL=CFK∞(L). It gives acyclic complexes A0,B0,A1,B1 with CK#(−J)⊕A0≃Λ⊕B0 and CJ#(−J)⊕A1≃Λ⊕B1. It does not supply an unstabilized direct-sum splitting of either slice complex, and none is assumed. These equivalences are supplied by the exact slice stable-splitting input [F5]. The supplied model and disk comparisons [F3]–[F4] do not replace the geometric slice input.

3.1givenF5F2step 2.1algebra

Tensor the first equivalence with CJ and the second with CK. Under the supplied geometric tensor comparison [F2], their three-factor terms are filtered-equivalent to the same complex X=CK⊗C−J⊗CJ, by associativity and the graded flip, which is sign-free over F2. Put P=A0⊗CJ, Q=B0⊗CJ, P′=A1⊗CK and Q′=B1⊗CK. Then X⊕P≃CJ⊕Q and X⊕P′≃CK⊕Q′. Each of P,Q,P′,Q′ has zero total homology. Indeed a finite free graded acyclic Laurent complex, after translating generators to degrees zero and one, has a finite acyclic parity matrix over F2. Splitting its cycles and boundaries in these finite vector spaces gives a contraction; inserting the required U or U−1 degree shifts gives a Laurent-linear contraction. Tensoring with any free complex is still a contraction, because the cross terms cancel in characteristic two. No filtration-preserving contraction is claimed or required.

4.1givenF5F2step 3.1algebra∎

Add P′ to the first equivalence of step 3.1 and P to the second. The common middle term is X⊕P⊕P′, so composing and permuting direct summands gives CJ⊕(Q⊕P′)≃CK⊕(Q′⊕P). All added factors are finite-rank free and totally acyclic by step 3.1, and every equivalence preserves both filtrations and Maslov grading. This proves exactly the original stable Statement, without strengthening the slice supplier or cancelling a common complex by an unjustified cancellation law.

External-input boundary

The original Statement is proved using the explicitly external Hom slice splitting recorded in [F5], together with the preserved accepted tensor/model interfaces and local finite stabilization algebra. No whole decorated-map or movie-invariance construction is claimed. The original ACω branch uses the fixed finite/countable specialization stated in the slice supplier.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Epsilon is stable-equivalence invariant but not a homomorphism

Statement

For the knot-level assertions, assume the Axiom of Countable Choice. Let K and J be smooth oriented knots, and use the epsilon sign convention from the preceding definition. If their knot Floer complexes are stably filtered equivalent, meaning that there are totally acyclic bifiltered complexes A and B with CFK∞(K)⊕A filtered-chain-homotopy equivalent to CFK∞(J)⊕B, then ϵ(K)=ϵ(J). The acyclic summands here need not be acyclic after taking either associated-graded filtration.

The invariant satisfies ϵ(−K)=−ϵ(K), ϵ(K)=0⇒τ(K)=0, and the tensor rules ϵ(K)=ϵ(J)⇒ϵ(K#J)=ϵ(K),ϵ(K)=0⇒ϵ(K#J)=ϵ(J). The converse of ϵ(K)=0⇒τ(K)=0 fails: the knot T2,5#−T4,5#T2,3;2,5 has τ=0 and ϵ=1, where Tp,q is the positive (p,q) torus knot and T2,3;2,5 is the (2,5) cable of the right-handed trefoil with longitudinal winding two. Epsilon is not an integer-valued homomorphism on the smooth concordance group: the right-handed trefoil has ϵ=1 and its connected sum with itself also has ϵ=1, not 2.

Facts & Assumptions

Given: The actual normalized finite free Maslov-graded bifiltered complexes of the knots, with the supplied geometric tensor and duality identifications. Every newly used finite operation below is over F2. Countable Choice is assumed for the knot-level constructions and geometric comparisons; finite algebra on the stated supplied complexes and maps requires no further choice.

[F1]

Epsilon from the filtered knot Floer complex defines Fs,Gs and epsilon. Its supplied two-hook argument proves the three cases are exhaustive and the two maps cannot both vanish.

[F2]

Knot Floer duality and exchange of the two filtrations supplies actual reverse-mirror duality, conjugation and normalized horizontal homology. The vertical and horizontal homologies at level zero are each one-dimensional, in Maslov degree zero.

[F3]

The filtered knot Floer complex of a connected sum is a tensor product supplies the actual normalized filtered tensor identification and additive vertical threshold; the finite field-complex Kunneth calculation also follows by splitting boundary pairs.

[F4]

Finite filtered splittings preserve the epsilon maps under total-acyclic stabilization supplies stable-core invariance of the vertical threshold and both hook-map zero patterns, allowing arbitrary totally acyclic stabilizers without assuming their vertical or associated-graded complexes acyclic.

[F5]

Grid homology is independent of the grid and computes knot Floer homology supplies the actual normalized grid comparison. In particular tilde homology is hat knot Floer homology tensored with V⊗(n−1), where V has degrees (0,0),(−1,−1). Its grid, differential, scalar and analytic suppliers are reused as proved interfaces.

[F6]

Valid codes reconstruct the declared link diagram identifies oriented decorated diagrams with the same signed rotation/strand code and selected outer face. Coprime torus knot fixes the positive Clifford-torus convention. The five-grid with O=[4,3,2,1,0] and X=[2,1,0,4,3] is identified with the positively oriented right-handed trefoil in step 1.4 below; its three crossing signs are all positive.

[F7]

The grid coordinate and orientation conventions are Toroidal grid diagrams and gradings for oriented knots; the finite signed visit, crossing-rotation and face-selector data are Planar-diagram, Gauss, and signed Dowker–Thistlethwaite codes.

Proof

1.1givenF1F4algebra

In the finite-rank free Maslov-graded knot Floer category, [F4] proves the stable-equivalence conclusion directly. Its finite endomorphism matrices strictify homotopy idempotents and give a unique non-acyclic indecomposable core up to filtered homotopy. The rank-one vertical homology of each original knot complex forces its internal acyclic complementary summands to have acyclic vertical complexes. Consequently its vertical threshold and the zero/nonzero patterns of Fτ,Gτ are precisely those of that core. Stable equivalence identifies the two cores even if the externally added acyclic summands have nonzero vertical or associated-graded homology. Thus the three-case epsilon values in [F1] agree. This argument does not apply the epsilon definition to the stabilized complexes themselves.

1.2givenF1constructalgebra

First reduce a finite based Laurent complex by explicit filtered contractions. If a differential coefficient preserves both coordinates, homogeneity makes it a single Laurent monomial; translate its target so that it is 1. Write da=b+r with a,b at the same bifiltration and replace b by b′=da. This is a filtered homogeneous basis change with inverse b=b′+r. For every other basis element c, subtract the coefficient of b′ in dc times a from c; this is filtered since the relevant copy of a has the coordinates of the corresponding copy of b′. The new differentials contain no b′, and their a coefficients vanish by d2=0. Thus the pair a→b′ splits off. Inclusion I, projection P and H(b′)=a, zero on all other generators, satisfy PI=1 and IP+1=dH+Hd, with H preserving both filtrations and of Maslov degree +1. Finitely many repetitions give a reduced complex with no equal-bifiltration arrow. Tensoring these identities with another complex preserves them: the extra differential terms cancel over F2. Dualizing likewise preserves them. This supplies all reduction inverse maps and homotopies used below, including their tensor compatibility.

1.3F6givenconstructalgebra

We next admit the actual complexes used for the geometric examples. Use the following marking-cell arrays, rows ordered bottom to top: for positive T2,5 take n=7, O=[6,5,4,3,2,1,0], X=[4,3,2,1,0,6,5]; for positive T4,5 take n=9, O=[8,7,6,5,4,3,2,1,0], X=[4,3,2,1,0,8,7,6,5]. The first has five positive crossings and oriented over/under word A+B−C+D−E+A−B+C−D+E−, where superscripts indicate over/under and all crossing signs are positive. The explicit positive torus curve (re2it,se5it), r=s=1/2, has this identical code in stereographic projection: its planar angle is 2t, radius r/(1−ssin⁡5t), height scos⁡5t/(1−ssin⁡5t), and crossing parameters t/(2π)=0,1/10,…,9/10. Equal projections force parameter difference π and sin⁡5t=0. At the overparameter the radial derivative is positive and at the underpartner negative, so the oriented crossing determinant is positive. The angular derivative is nonzero, and there are no triple points. Thus [F6] admits this grid as the actual positive T2,5.

1.4F6F7algebra

Verify the trefoil grid in [F6] directly. Use row indices 0,1,2,3,4 from bottom to top and column indices from left to right, as in Toroidal grid diagrams and gradings for oriented knots, and draw the standard planar grid realization using the in-square mark-to-mark intervals. Following the grid orientation gives the single cycle O0,4→X0,2→O2,2→X2,0→O4,0→X4,3→O1,3→X1,1→O3,1→X3,4→O0,4. The horizontal and vertical intervals meet away from their endpoints at exactly three crossings: c1=(row 1,column 2), c2=(row 2,column 1), and c3=(row 3,column 3). Traversing the component from O0,4 encounters c1 over, c2 under, c3 over, c1 under, c2 over, and c3 under. At c1 and c2 the oriented projected tangents (vover,vunder) are ((0,1),(−1,0)); at c3 they are ((0,−1),(1,0)). Each determinant is +1 by Planar-diagram, Gauss, and signed Dowker–Thistlethwaite codes. Thus its signed oriented Gauss code is 1O,2U,3O,1U,2O,3U with crossing-sign vector (+1,+1,+1). This code is also obtained by traversing the closure of the positive two-strand braid σ13: its first braid strand encounters the three positive half twists over, under, over, and the returning strand encounters them under, over, under. The signed visit data determine the same crossing rotation and strand code, hence identify the face-permutation cycles. Retain the grid diagram's outer-face cycle and choose the corresponding face of the braid-closure diagram. To make this chosen face outer, compactify the projection plane to the oriented sphere S2 and choose a point q in that face, away from the diagram. An orientation-preserving rotation of S2 sending q to the projection point at infinity makes precisely this face outer. Realize the diagram lift in a product collar of the equatorial S2 in S3; the rotation extends by the same rotation on the first three coordinates and the identity on the normal coordinate. Its path of rotations is an orientation-preserving ambient isotopy of S3 preserving the crossing heights and oriented strand data. The two resulting plane codes now have the same selected outer face, so Valid codes reconstruct the declared link diagram identifies their diagrams up to planar isotopy. Thus the original grid and braid closure represent the same oriented knot even if their initially chosen planar outer faces differ. The braid closure lies on the standard unknotted torus with slope 2α+3β (equivalently the swapped slope 3α+2β under the orientation-preserving torus-coordinate swap), so it is T(2,3) by Coprime torus knot. The grid therefore represents the right-handed trefoil with its positive orientation, and its writhe is +3.

2.1F1step 1.2constructalgebra

Let s=τ(C) and choose a Maslov-zero vertical cycle z at j≤s representing its distinguished class. Its corner part zc is nonzero, or the threshold would be smaller. If Fs=0, choose a Maslov-one northeast-hook chain b with dNb=zc and split it into strictly upper, corner and strictly right parts b+,b0,br. The strictly upper part of dvb+ is zero, since the other parts cannot reach it. Hence z′=z+dvb+ is another distinguished vertical cycle supported at j≤s. Put q=b0+br. Its horizontal boundary h=dhq has no strictly right component, and its corner is zc′, by the corner equation of dNb=zc. Then x=z′+hleft is supported in i≤0,j≤s, its vertical projection represents the distinguished class, and its horizontal projection is the boundary h. Conversely, if such an x has horizontal part dhq, project q to the northeast hook: its strictly left part cannot reach the corner or right ray, and the remaining boundary is precisely xc, with no upper component. Thus Fs=0. This proves the exact boundary-representative alternative, rather than assuming a simultaneous simplification theorem.

2.2F1F2step 1.2constructalgebra

The dual vertical threshold is −s. Indeed, if B is the vertical boundary space, the distinguished cycle z is not in B+V≤s−1, since such an expression would give a lower-level cycle representing it. Finite-dimensional basis extension gives a cocycle functional annihilating that subspace and taking z to 1; its dual filtration is at most −s. A dual cocycle at level at most −s−1 vanishes on every cycle at level s and hence on the one-dimensional vertical homology, so it is a dual boundary. The finite perfect pairing identifies the dual of the northeast hook at s with the southwest hook of C∗ at −s. The transpose of Fs(C) is G−s(C∗), and the transpose of Gs(C) is F−s(C∗): quotient/inclusion maps reverse under this pairing. Duality of finite-dimensional homology preserves zero/nonzero. Thus ϵ(C∗)=−ϵ(C); [F2] identifies this with ϵ(−K)=−ϵ(K).

2.3F6step 1.3constructalgebra

Following oriented strands in the nine-grid gives fifteen positive crossings and the full signed rotation/strand code of the closure of the four-strand positive word 121321321121321, after a cyclic starting-point change and reversal of the knot orientation. This is an explicit finite code equality: enumerate crossings in each row and column interval, then follow each row O→X and column X→O; on the braid follow the strand permutation through each listed crossing, taking the top-right strand over to bottom-left. The exact words and crossing correspondence are recorded in the finite certificate named in Remarks. Commutations 13=31 and braid relations 121=212, 232=323 give the successive words 123121321121321, 123123121121321, 123123121212321, 123123121213231, 123123121231231, 123123121231213, 123123121232123, 123123121323123, 123123123123123. Each is a local disjoint-strand isotopy or oriented R3, so their closures are equivalent. The last is (123)5. To identify its torus embedding, cut the Clifford curve (re4it,se5it) by the disk coordinate arg⁡(z1)=θ: its four disk points have arguments 5(θ+2πk)/4. A generic phase makes one quarter-turn's braid 132, which becomes 321 by moving the first generator past the closure cut, and then 123 by reversing the four disk positions via the half-turn conjugation. Five quarter-turns give the last closure. Finally simultaneous complex conjugation is an ambient SO(4) isotopy endpoint and sends this curve to its orientation reverse: rotate its two imaginary axes through π. Thus the code reversal preserves oriented knot type, and [F6] proves the actual positive T4,5 admission.

2.4F6step 1.4givenconstructalgebra

For the cable take n=10, O=[8,9,7,6,4,5,3,2,1,0], X=[4,5,2,3,0,1,8,9,6,7]. Here is an explicit preferred-framing admission independent of any Floer calculation. Double each row and column of the admitted positive trefoil five-grid in [F6]. At an old corner let h,v∈{±1} be the directions toward its horizontal and vertical partner. A diagonal two-mark block for hv=1 and an antidiagonal block for hv=−1 give exactly two crossing-free parallel corners; checking the four quadrants verifies this and the oriented attachments. Only at the O corner (row 0,column 4), where h=−1,v=1, use the opposite diagonal block. It introduces one crossing of sign hv=−1. The listed ten-grid is precisely these ten corner blocks, and its component cycle visits rows 0,4,9,2,7,1,5,8,3,6,0, hence it is one knot. Away from the exceptional block it follows two blackboard parallel copies of the trefoil. The blackboard longitude has linking number equal to writhe +3, so λbb=λpref+3μ. The one negative half-twist therefore gives slope 2λbb−μ=2λpref+5μ, with longitudinal orientation inherited from the original trefoil. This is exactly T2,3;2,5 in the Statement; it is not identified from a polynomial or a candidate matrix.

3.1F1step 1.2step 2.1constructalgebra

If Gs≠0, choose a Maslov-zero southwest-hook cycle mapping to the distinguished vertical class. In the reduced complex it is x=z+ℓ, with z on the lower vertical ray, including the corner, and ℓ strictly left at j=s. The two retained boundary equations are exactly dvz=0 and dh(zc+ℓ)=0: a lower ray cannot reach the other ray, and the corner has no equal-bifiltration differential. Conversely these two equations give a southwest-hook cycle mapping to the vertical class. Therefore Gs≠0 is exactly the existence of this simultaneous vertical/horizontal cycle representative. If also Fs≠0, its horizontal cycle is not a boundary, by step 2.1. Each constructed x extends to a homogeneous filtered Laurent basis: choose a nonzero original corner coordinate e, whose coefficient is 1, and replace e by x. Homogeneity excludes any other power of that same basis element, and all other terms are no higher in either filtration, so the inverse is the same filtered elementary substitution. These are the needed distinguished representative normal forms. A chosen horizontal noncycle alone is not used as an epsilon test.

3.2F5step 1.3step 2.3step 1.4step 2.4constructalgebra

Compute the tilde groups of these three new grids by the following finite exact procedure. Enumerate the n! state permutations p. For each ordered pair a≠b, take the positive cyclic row interval a→b and column interval p(a)→p(b). Its initial corners are southwest and northeast, and the two row orders give the two directed rectangles for each unordered pair. Retain the rectangle exactly when its cell support contains no O or X, and no state point lies in the product of its strict interior intervals. Its target swaps p(a),p(b); equal targets cancel over F2. Compute each state's degrees directly from MO=I(p,p)+I(O,O)−I(p,O)−I(O,p)+1 and A=(MO−MX−(n−1))/2. In a column, use the largest target permutation index as pivot. If that pivot has an existing stored column, take symmetric difference with it; otherwise store the column there. A replacement is an invertible field-column operation and strictly lowers the pivot, so distinct stored pivots give precisely the rank. For each grade, homology dimension is basis count minus outgoing rank minus incoming rank. The completed exact computation over all 5040, 362880, 3628800 states respectively gives tilde dimensions 320, 1792, 2560 and the graded polynomials recorded in Remarks. The implementation and full pivot checkpoints are finite arithmetic certificates of this explicit calculation; its square-zero input is the already supplied grid differential, not an unproved reconstruction theorem.

4.1F3step 1.2step 2.1step 3.1constructalgebra

Normalize Laurent bases at i=0. The vertical slice of C⊗D is the ordinary field tensor of the vertical slices, with differential dv⊗1+1⊗dv; no term lowering algebraic level can survive there. Similarly horizontal slices at levels s,t tensor to the horizontal slice at s+t. Splitting a finite field complex into boundary pairs and homology representatives proves the field Kunneth assertion directly: a boundary pair tensored with anything is contractible by its pair homotopy. In particular the tensor of distinguished vertical cycles represents the distinguished tensor class. Its threshold is s+t by [F3]. All representatives used in steps 2.1, 3.1 are supported southwest, so their vertical and horizontal projections tensor exactly to the projections of their tensor.

4.2F5step 1.2step 3.2constructalgebra

By [F5], divide only the tilde HOMOLOGY dimension polynomial by (1+m−1a−1)n−1. Its quotient is unique by successively subtracting the largest-Maslov nonzero monomial times this factor. For T2,5 the normalized hat degrees, each of rank one, are (M,A)=(0,2),(−1,1),(−2,0),(−3,−1),(−4,−2); for T4,5 they are (0,6),(−1,5),(−2,2),(−5,0),(−6,−2),(−11,−5),(−12,−6); for the cable they are (0,4),(−1,3),(−2,0),(−7,−3),(−8,−4). Now reduce the actual singly pointed CFK-infinity model supplied by [F5] using the contractions in step 1.2. Its Laurent basis at i=0 has exactly these reduced hat groups: every canceled equal-bifiltration pair is a graded boundary pair, and the reduced corner differential is zero. This step does not cancel V in a chain category or tensor homology through a nonflat quotient.

5.1F1F2F3step 2.1step 3.1step 2.2step 4.1constructalgebra

If both epsilon values are 1, choose the boundary representatives of step 2.1. Both horizontal parts are cycles; if xh=dha, then (x⊗y)h=dh(a⊗yh). Its vertical part is the distinguished tensor class, so the converse in step 2.1 gives Fs+t=0, and epsilon of the tensor is 1. The same proof works when one factor has epsilon zero and the other has epsilon 1, using a cycle representative from step 3.1 for the zero factor. If both factors have epsilon zero, tensor their southwest-hook lifts to obtain Gs+t≠0. Their duals also have epsilon zero by step 2.2; applying the same lift construction to the dual tensor gives its G−(s+t)≠0, hence Fs+t≠0 on the original tensor. Its epsilon is therefore zero. Dualizing the already proved positive cases proves the negative/negative and zero/negative cases. Together with [F3], these are exactly both tensor rules in the Statement, with actual representatives and compatible homotopies.

5.2step 4.2constructalgebra

These exact degree profiles determine the full differential; no general inference from hat ranks to a full staircase is needed. List their generators in the displayed order as e0,e1,…. A possible term Ukej in dei must satisfy k=(Mj−Mi+1)/2∈Z≥0 and Aj−k≤Ai. Exhausting these inequalities gives the following COMPLETE lists, with v(i,j) denoting coefficient 1 and h(i,j;k) coefficient Uk preserving horizontal level. For T2,5: v(0,1),v(1,2),v(2,3),v(3,4) and h(1,0;1),h(2,1;1),h(3,2;1),h(4,3;1). For T4,5: v(0,1),v(1,2),v(3,4),v(5,6) and h(1,0;1),h(3,2;2),h(5,4;3),h(6,5;1). For the cable: v(0,1),v(1,2),v(3,4) and h(1,0;1),h(3,2;3),h(4,3;1). Every allowed arrow is axial; there is no diagonal term. Homogeneity fixes each monomial, and its remaining coefficient is zero or one.

6.1F2step 1.2step 4.2step 5.2constructalgebra

The normalized vertical homology in [F2] is one-dimensional in Maslov degree zero. Thus the only degree-zero candidate e0 survives and v(0,1)=0. In the first list, absence of degree −1 homology forces v(1,2)=1, square-zero forces v(2,3)=0, and absence of degree −3 homology forces v(3,4)=1. In the other lists the remaining disjoint vertical pairs must all be present. At horizontal level zero use generators UAiei, whose Maslov degrees are Mi−2Ai, the reverse displayed vertical list. The same normalized argument from the opposite end forces every odd-to-previous-even horizontal coefficient to be 1 and all listed reverse arrows to be zero. Hence the ACTUAL reduced complexes are T2,5:de1=Ue0+e2, de3=Ue2+e4; T4,5:de1=Ue0+e2, de3=U2e2+e4, de5=U3e4+e6; cable: de1=Ue0+e2, de3=U3e2+e4. All even differentials vanish, so these matrices square to zero. The reductions already supply filtered inverse maps and homotopies. This proves the three geometric staircase admissions with all scalar factors handled, without any L-space or unproved cabling/reconstruction theorem.

6.2F1F2F5F6step 5.1step 3.2step 5.2constructalgebra

For the right-handed trefoil, reuse the geometric five-grid admission in [F6] and perform the new, previously missing 120-state tilde-rank operation of step 3.2. Its tilde dimension is 48; division of its graded homology polynomial by the supplied V4 factor gives degrees (0,1),(−1,0),(−2,−1), each rank one. The inequalities in step 5.2 allow only v(0,1),v(1,2),h(1,0;1),h(2,1;1). Normalized vertical and horizontal degree-zero homology forces exactly dx1=Ux0+x2, with even differentials zero. At s=τ=1, the northeast-hook boundary of U−1x1 is x0, since U−1x2 lies below its retained horizontal ray. Thus F1=0 and ϵ(T2,3)=1 for the actual admitted knot complex. Step 5.1 gives ϵ(T2,3#T2,3)=1, whereas any integer homomorphism taking the trefoil to 1 would take its double to 2. Hence epsilon is not an integer homomorphism on the concordance group. This is failure of additivity under connected sum; it uses no missing theorem identifying concordant complexes.

7.1F1F2F3step 6.1constructalgebra

Write A,B,C for the actual staircases of T2,5,T4,5,T2,3;2,5 just admitted, and let ai,bi,ci denote their bases, with bi now dual to the T4,5 basis. The vertical thresholds are 2,−6,4, so [F3] gives threshold zero for E=A⊗B∗⊗C. Its distinguished vertical class is a0b0c0 at (M,A)=(0,0). In its northeast hook the Maslov-one chain q=U−1a0b0c1+a0b2c1+U−1a1b2c2 is supported at (i,j)=(1,0),(0,3),(1,0). Its three boundaries, after discarding terms outside the hook, are respectively a0b0c0+a0b1c1, a0b1c1+a0b2c2, and a0b2c2. Here db0=Ub1, db2=b1+U2b3. The discarded terms from the first boundary have (i,j)=(1,−3); those from the second have i=−1 or −2; those from the third have (i,j)=(1,−1),(1,−3) or i=−1. Thus dNq=a0b0c0 exactly. Consequently F0(E)=0 and ϵ(E)=1 by [F1]. The actual tensor and reverse-mirror identifications [F2]–[F3] now give precisely the knot T2,5#−T4,5#T2,3;2,5 in the Statement, with τ=2−6+4=0 and epsilon 1. The previously completed 175-generator calculation supplies the identical finite boundary certificate; it has not been rerun or used as a substitute for the geometric admissions.

8.1givenF1F2constructalgebra∎

The implication ϵ=0⇒τ=0 uses the normalized horizontal homology supplied by [F2]. Set s=τ and use Gs≠0 to choose a Maslov-zero southwest-hook cycle y=z+ℓ mapping to the normalized vertical class, where z is on the lower vertical ray and ℓ is strictly left at j=s. Homogeneity is available by projecting a preimage to Maslov degree zero. Its horizontal projection h=zc+ℓ, with zc its corner part, is a horizontal cycle. If it were a horizontal boundary, write a bounding chain as a++a−, splitting strictly right support from support at i≤0. The right component of its boundary is zero; the corner is zc=(∂a+)c+(∂a−)c. In the northeast hook, the chain a++(a−)c then has boundary exactly zc: the left part of a− cannot reach the corner, and differential from the corner toward the left is killed in that hook. But Fs([z]) is represented by zc, so this would give Fs=0, contrary to ϵ=0. Thus h is a nonzero horizontal homology class in Maslov degree zero. Multiplication by Us takes it to horizontal level zero and Maslov degree −2s. Actual normalized conjugation [F2] identifies that horizontal homology with the vertical homology generated in Maslov degree zero, giving s=0. The geometric conjugation and absolute normalization used here are supplied by [F2]; thus this implication no longer has a separate conjugation hold.

Remarks

The new exact finite admission evidence is under research/inverse-problems-knot-theory-all-109-2026-10-19-supervision-20261020/epsilon/: new-torus-grid-code-result.json and torus45-braid-certificate.json give the new oriented geometric code certificates; positive-cable-grid.json gives every cable marking block and preferred-framing construction; grid-tilde-ranks.cpp, the four .input files, completed .checkpoint.bin carriers and .result.json files give the finite tilde-rank computation; normalized-hat-ranks.json, trefoil-new-profile.json and allowed-edge-reconstruction.json give the exact reconstruction data. The earlier staircase-hook-result.json records the already completed three-term tensor-boundary computation. These are arithmetic and geometric authoring evidence, not native independent-review or certification receipts.

The stable-core and geometric grid/tensor/duality suppliers are reused as supplied interfaces; no repaired source was reread or revalidated for this completion. Concordance descent still uses the separate geometric stable-slice/concordance result. It is not inferred from the finite algebra here.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

The grid Upsilon function agrees with the original Upsilon invariant

Statement

For the knot-level assertions, assume the Axiom of Countable Choice. Let G be any n×n grid diagram representing a smooth oriented knot K⊂S3. Form the diagonal grid complex by setting every marking variable Ui equal to a single variable U, and define ΥG(t) by the t-modified non-torsion grading on that complex for 0≤t≤1, extended by ΥG(t)=ΥG(2−t) for 1<t≤2. Then for every t∈[0,2], ΥG(t)=ΥK(t), where ΥK is the finite cycle-minimax invariant defined from CFK∞(K). In this statement the quotient with all Ui identified carries the factor W⊗(n−1), where W has generators in Maslov/Alexander bidegrees (0,0) and (−1,−1); this factor is retained in the proof and is not counted as an improvement to the grid-state complexity bound.

Facts & Assumptions

Given: A knot grid G with grid number n, its full filtered grid complex, the diagonal quotient, and the two Upsilon conventions just defined. Countable Choice is assumed for the knot-level constructions and geometric comparisons; finite algebra on the stated supplied complexes and maps requires no further choice.

[F1]

Basepoint variables act chain homotopically on a knot grid: for consecutive markings the rectangle homotopy Hℓ satisfies ∂Hℓ+Hℓ∂=(Ui+Uj)id⁡ and is Alexander-filtered; following the one-cycle marking route identifies any two variable actions by filtered chain homotopy.

[F2]

Grid Upsilon from the diagonal grid complex: the grid invariant is the maximal grading of a homogeneous non-torsion class in the t-modified diagonal quotient on [0,1], with reflection for t>1.

[F3]

The Upsilon function from the filtered knot Floer complex: the original invariant is −2 times the minimum Ft filtration of a Maslov-zero cycle representing the normalized generator.

[F4]

Knot Floer duality and exchange of the two filtrations: exchanging the two knot Floer filtrations identifies the original Upsilon values at t and 2−t. Its actual reflected/conjugate diagram maps preserve the normalized Maslov grading; no grid equality is a premise of that analytic symmetry.

[F8]

Grid homology is independent of the grid and computes knot Floer homology now has an authored Proof section. Its Statement gives the chosen-variable filtered comparison, the simultaneous-collapse CFK−(K)⊗V⊗(n−1) factor, and the normalized Maslov and Alexander origins. MOS Proposition 2.3 states the chosen-variable filtered comparison and tilde-homology V-factor, and Theorem 3.3 identifies the grid filtered complex with the knot filtration; the current in-run proof supplies the chain-level ordinary-collapse factor. Its absolute shifts are fixed in steps 4.1–6.1 under that item's listed [F1]–[F5] prerequisites. We use exactly this stated comparison, not an unproved claim that the citation alone fixes the absolute shifts.

[F5]

Filtered tower splitting for the Upsilon minimax proves the filtered projection and the exact regrading map identifying the maximal non-torsion degree with −2νt, using U=v2.

[F6]

Basepoint cones, a single variable action, and ordinary collapse gives an explicit filtered deformation retraction from the Ui+Uj cone to the ordinary quotient, including a polynomial-dependent differential. Its null-homotopy comparison supplies exactly one W factor per marking identification over the surviving chosen-variable action.

[F7]

The t-modification preserves graded filtered maps, homotopies and tensor products proves the exact coefficient reweighting for maps and homotopies, including column-finite polynomial modules and tensor products.

Proof

1.1givenF1F6algebra

Regard the full marking-variable complex first as a module over the surviving variable U=U1; restriction of scalars does not identify any other variables. For each additional marking variable, [F1] supplies a polynomial-linear null-homotopy of its difference from U. Its proof gives Alexander filtration degree at most −1, since every counted rectangle contains the distinguished X, and Maslov degree −1. These are exactly the degree hypotheses in [F6]. That supplier compares the ordinary quotient with the cone even when the differential depends on the variable being removed, and compares the cone of the null-homotopic multiplication map with the zero-map cone. Successively quotienting the independent marking variables therefore yields DG≃CG⊗W⊗(n−1) over F2[U], where CG denotes the full grid complex restricted to the chosen U1 action. It is not the original multivariable complex with its coefficient ring silently changed.

2.1givenF2F7F8step 1.1algebra

Under the normalized grid comparison [F8], CG is filtered-chain-homotopy equivalent over that chosen polynomial action to CFK−(K) with the stated normalized gradings. Apply [F7] to the maps and their homotopies: a degree-d term Uky in a map on x acquires exponent gt(y)−gt(x)−d≥0, and all composition and homotopy identities are preserved coefficientwise. The tensor compatibility in [F7] consequently identifies the diagonal quotient's modified homology with that of tCFK−(K)⊗Wt⊗(n−1). This uses the actual comparison and the prerequisites listed in [F8], not an unproved formal reweighting assertion.

3.1givenF2F3F4F5step 2.1algebra∎

The two generators of W have t-gradings 0 and t−1. For 0≤t≤1, the second grading is nonpositive. The tensor product with Wt⊗(n−1) contains a copy of each original non-torsion class with no grading shift, while every other copy is shifted down by a sum of nonnegative numbers 1−t. Therefore the maximum non-torsion grading is unchanged. By [F5], this maximum agrees with the finite cycle-minimax convention [F3], so ΥG(t)=ΥK(t) for 0≤t≤1. For 1<t≤2, the grid function is symmetric by definition and the original function is symmetric by [F4], so equality follows from the already established range.

Unresolved proof obligations

The cone/quotient comparison, coefficient restrictions, finite reweighting functor and tower/minimax calculation are supplied locally by [F5]–[F7]. The normalized grid-to-analytic comparison is supplied by [F8] under its stated [F1]–[F5] prerequisites; MOS Proposition 2.3 and Theorem 3.3 support the filtered multipointed comparison and V-factor, while the current in-run proof supplies the absolute normalization. The analytic filtration-swap symmetry used for t>1 is supplied by [F4]. The earlier proof-absence note is stale; this item's comparison obligation is closed subject to the declared suppliers.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Upsilon additivity, mirror symmetry, and four-ball genus bound

Statement

For the knot-level assertions, assume the Axiom of Countable Choice. For every smooth oriented knot K⊂S3, the function ΥK:[0,2]→R defined by the finite cycle minimax is continuous and piecewise linear with finitely many breakpoints, satisfies ΥK(0)=0 and ΥK(t)=ΥK(2−t), and has right derivative ΥK′(0+)=−τ(K). For smooth oriented knots K,J and t∈[0,2], ΥK#J(t)=ΥK(t)+ΥJ(t),Υ−K(t)=−ΥK(t), where −K is the reverse mirror, the inverse under connected sum in the smooth concordance group. If g4sm(K) is the minimum genus of a smooth properly embedded compact connected oriented surface in the four-ball with boundary K, then ∣ΥK(t)∣≤t g4sm(K)(0≤t≤1).

Facts & Assumptions

Given: A smooth oriented knot Floer complex with its finite bifiltered basis, normalized Maslov-zero total-homology generator, and the Ft cycle-minimax convention. Countable Choice is assumed for the knot-level constructions and geometric comparisons; finite algebra on the stated supplied complexes and maps requires no further choice.

[F1]

The Upsilon function from the filtered knot Floer complex: νt is the minimum of Ft(z) over Maslov-zero cycles representing the normalized generator, and ΥK(t)=−2νt; its finite candidate set makes the function piecewise linear.

[F5]

The full geometric connected-sum comparison supplies the actual Maslov-graded bifiltered Laurent tensor equivalence, inverse and homotopies. The filtered knot Floer complex of a connected sum is a tensor product

[F9]

The auxiliary threshold exists and is nonnegative by its local Vs,Hs exponent proof. Its smooth genus upper bound uses the explicitly external OSS/Hom–Wu theorem in the exact same delta-threshold convention, with fixed finite/countable choice scope. The auxiliary nu-minus threshold is bounded by smooth slice genus

[A3]

Smooth and topological slice genus: the intended bound is the smooth four-ball genus branch; no locally flat/topological surface branch is used.

[F6]

The supplied normalized doubly pointed polynomial complex B=C{i≤0} has quotient B/UB equal to the ordinary normalized hat model, whose total homology is F2 in degree zero. The differential retains every positive z multiplicity as filtration. These are the accepted marked-variable/analytic knot interfaces, not arbitrary-link or cobordism assertions. The Alexander filtration and tau level, Grid homology is independent of the grid and computes knot Floer homology, Regularity, compactness, and gluing for pointed Heegaard disks

[F2]

Knot Floer duality and exchange of the two filtrations: mirror duality negates both filtration coordinates, and conjugation exchanges the algebraic and Alexander filtrations. Its actual generator/class maps and absolute Seifert/Maslov origins are supplied without grid comparison.

[F3]

Reverse mirror of an oriented knot: the reverse mirror is the reflected knot with its knot orientation reversed, using the fixed orientation-reversing reflection from the connected-sum convention.

[F7]

The actual normalized model comparison supplies knot-level invariance of the two filtrations and hat threshold. The small-t calculation below uses that threshold directly and does not use the still-held four-ball genus theorem. The tau level is independent of the normalized Heegaard model

[F8]

The full normalized grid/analytic filtered equivalence is supplied, with the actual ordinary marked factors and absolute grading origins. Grid homology is independent of the grid and computes knot Floer homology

[F4]

Filtered tower splitting for the Upsilon minimax proves a filtered projection onto a minimizing rank-one tower and the exact real-series regrading comparison with maximal non-torsion degree −2νt, for a supplied normalized complex.

Proof

1.1givenF1F8F2algebra

By [F1], each fixed Maslov-zero cycle has filtration equal to the maximum of finitely many affine functions of t, and there are finitely many such cycles. Thus ΥK is piecewise linear with finitely many breakpoints. The supplied model comparison [F8] makes this calculation a knot invariant. At t=0, F0 is the algebraic filtration; the normalization in [F1] says the tower generator first appears at level zero, so ν0=0 and ΥK(0)=0. Exchanging the two bifiltration coordinates sends Ft to F2−t; [F2] therefore gives ΥK(t)=ΥK(2−t).

1.2givenF1F5F4algebra

Under the supplied geometric tensor comparison [F5], the connected-sum complex is the convolution-filtered Laurent tensor product. For a fixed t, apply the proved filtered splitting [F4] separately to the two factors. Their rank-one summands tensor to a zero-differential tower whose normalized generator has filtration νt(K)+νt(J). Every other tensor summand contains an acyclic Laurent factor and is acyclic. To justify that last assertion without a filtered contraction assumption, normalize the factor's basis to Maslov degrees zero and one: its differential is given by finite binary matrices from degree one to zero and from degree zero to U times degree one. Acyclicity makes the resulting finite parity complex acyclic, so finite vector-space complements give a contracting homotopy; the Laurent degree shifts insert only powers of U or U−1 to make it a chain homotopy. Tensoring this contraction with any other complex is a contraction, since the two cross terms cancel over F2. Thus only the displayed tower carries total homology. The splitting is filtered, so no representative of its nonzero class can have a smaller filtration than that tower generator. This proves νt(K#J)=νt(K)+νt(J) and Upsilon additivity.

1.3givenF1F6F7F8algebra

First derive the actual minus normalization from [F6]. Since B is finite free over F2[U] with homogeneous generators, its chain groups vanish above a fixed Maslov degree. The exact sequence 0→UB→B→B/UB→0 and H(B/UB)=F2 in degree zero imply that multiplication by U is an isomorphism between adjacent even-degree homology groups below zero and between adjacent odd-degree groups; boundedness above gives H>0(B)=0, H0(B)=F2, and all odd groups zero. Thus H(B)=F2[U] generated in degree zero. Every normalized minus cycle projects to the hat generator. Conversely, lift a Maslov-zero hat generator cycle to c∈B. Write ∂c=Ud; then ∂d=0 and M(d)=1. Since H1(B)=0, write d=∂e. The polynomial cycle c+Ue lifts the SAME hat cycle and has the same leading i=0 terms. Therefore the least Alexander level among the i=0 parts of normalized minus cycles is exactly τ(K). Every normalized minus representative has a nonzero i=0 part, since a representative wholly in UB would make the top homology generator U-divisible. The finite Maslov-zero Laurent cycle set admits a common positive t interval in which any term with i≥1 excludes a cycle from minimizing, and the maximum on a cycle with i≤0 comes only from its i=0 terms. Hence νt(K)=tτ(K)/2 on that interval and ΥK′(0+)=−τ(K). No genus estimate is used.

2.1givenF1F2F4step 1.2algebra

By the actual normalized geometric duality [F2], the reverse-mirror complex is the filtered dual. Dualize the fixed-t filtered splitting in [F4]. A filtration-preserving change of basis with filtration-preserving inverse has the same property after dualizing and negating the basis filtrations. The dual of the minimizing tower has normalized generator at filtration −νt(K). The dual complementary factor is acyclic, because the unfiltered finite Laurent contraction in step 1.2 dualizes to a contraction. Therefore the dual minimax equals −νt(K), and Υ−K(t)=−ΥK(t). This uses no unproved identification of the homology of a dual torsion module.

3.1givenF9A3F3step 2.1algebra∎

Let s=ν−(K) as defined in [F9], and put g=g4sm(K). Since δ(A(K,s))=0, there is a non-torsion homology class of Maslov grading zero represented by a cycle z in A(K,s). For every finite basis generator xr, all sufficiently large powers Unxr satisfy A(xr)−n≤s; hence localizing the inclusion A(K,s)↪C−(K) gives the full CFK∞(K) complex and induces an isomorphism on localized homology. The non-torsion class [z] therefore maps to a nonzero degree-zero element of H∗(C−(K))⊗F2[U]F2[U,U−1]=F2[U,U−1], whose only nonzero degree-zero element is the normalized generator. Thus z represents that generator in C−(K) and in C(K). Each term of z has i≤0 and j≤s, so Ft(z)=(1−t/2)i+(t/2)j≤ts/2 for 0≤t≤1. Therefore νt(K)≤ts/2≤tg/2 by [F9], and ΥK(t)≥−tg. A linear reflection extending the fixed reflection of S3 to B4 sends any smooth genus-g surface bounded by K to a genus-g surface bounded by its mirror; reversing the surface orientation changes that boundary to the reverse mirror. Applying this diffeomorphism in both directions gives g4sm(−K)=g. Apply the same threshold argument to −K and use step 2.1 to obtain ΥK(t)≤tg. Combining both inequalities proves the bound, using the externally supplied genus upper estimate in [F9].

External-input boundary

Every original clause follows from the displayed local minimax, derivative, tensor and dual arguments and the accepted normalized interfaces. The genus clause uses the explicitly external OSS/Hom–Wu smooth bound in [F9]; it is not inferred from a tau estimate or presented as a completed local surface-map construction. Its fixed finite/countable choice specialization is stated in that supplier.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Epsilon and Upsilon concordance data

Statement

For the knot-level assertions, assume the Axiom of Countable Choice. Let Csm be the smooth knot concordance group, with addition induced by oriented connected sum and inverse represented by reverse mirror. The function ϵ:Csm→{−1,0,1} is well-defined and concordance-invariant, but it is not a homomorphism to Z. The map Υ:Csm⟶PL([0,2],R),[K]⟼ΥK, is a group homomorphism, where PL([0,2],R) is the abelian group of continuous piecewise-linear real-valued functions under pointwise addition. For every representative K and 0≤t≤1, its value satisfies ∣ΥK(t)∣≤t g4sm(K).

Facts & Assumptions

Given: The smooth concordance group, the epsilon invariant, the Upsilon function, and the smooth four-ball genus with the conventions stated above. Assume the Axiom of Countable Choice for the supplied geometric knot Floer and concordance/genus interfaces; the ensuing finite deductions require no further choice.

[F1]

Smooth and topological knot concordance classes form abelian groups: in the smooth branch, the operation is oriented connected sum, the inverse is reverse mirror, and a class is zero precisely when represented by a smoothly slice knot. The smooth proof branch was inspected; the topological branch is not used.

[F2]

The Upsilon supplier proves its model invariance, finite piecewise linearity, reflection, tensor additivity, mirror sign and initial slope. Its smooth four-ball genus clause uses the explicitly external OSS/Hom–Wu nu-minus bound recorded there. Upsilon additivity, mirror symmetry, and four-ball genus bound

[F3]

The completed epsilon supplier gives its actual stable-core/hook trichotomy, stable-equivalence invariance, normalized conjugation/dual sign and tensor rules, and admitted trefoil and torus/cable witnesses. In particular the trefoil and its double both have epsilon1, proving integer nonadditivity. This does not itself prove smooth-concordance descent. Epsilon is stable-equivalence invariant but not a homomorphism

[F4]

Smooth concordance implies stable filtered equivalence using the explicitly external Hom slice splitting and the preserved local finite tensor-stabilization argument. Its actual normalized model and tensor interfaces are supplied. Smooth concordance implies stable filtered equivalence of knot Floer complexes

Proof

1.1givenF1F2

If K and J represent the same smooth concordance class, then K#(−J) is smoothly slice by [F1], so g4sm(K#(−J))=0. The genus bound in [F2] gives ΥK#(−J)(t)=0 for 0≤t≤1; reflection gives the same for all t∈[0,2].

1.2givenF3F4

If K and J are smoothly concordant, [F4] gives stable filtered equivalence of their knot Floer complexes. Stable-equivalence invariance in [F3] then gives ϵ(K)=ϵ(J), so epsilon is well-defined on Csm. The trefoil witness in [F3] shows that it is not additive as a Z-valued function.

2.1givenF1F2step 1.1algebra∎

By additivity and reverse-mirror antisymmetry in [F2], 0=ΥK#(−J)(t)=ΥK(t)−ΥJ(t), so ΥK=ΥJ and the function is well-defined on smooth concordance classes. The same additivity identity on arbitrary representatives shows that [K]↦ΥK is a homomorphism to PL([0,2],R).

External-input boundary

The exact epsilon algebra and admitted nonadditivity witness are preserved local inputs. Concordance descent uses [F4]'s explicitly external Hom slice splitting; the Upsilon genus clause uses [F2]'s explicitly external OSS/Hom–Wu bound. The remaining group and finite minimax deductions are the displayed local argument. No full-AC assumption is inferred from ACω, and no new local movie-map construction is claimed.

4 · Examples, counterexamples and false statements

None yet.

Sources