Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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.

Depends on

Used by

Dependency tree · two levels

49 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