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.

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.

Depends on

Used by

Dependency tree · two levels

51 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