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

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

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

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

The decorated knot Floer cobordism map

Definition

Let (W,Σ,A) be a decorated knot cobordism from (Y0,K0) to (Y1,K1), and fix s∈Spin⁡c(W). Choose a parametrized Kirby decomposition of W, together with finite balanced Heegaard data satisfying the strict strong-admissibility condition normalized at all w-marks for each specified Spin-c sector. For every positive-rank triangle piece first choose an arbitrarily small pointed Hamiltonian representative with no common intersection of three attaching families, following the pair generators and transporting the actual Spin-c label and strict admissibility. On that representative choose the divisor-compatible nearly symmetric regular end paths and generic source-dependent almost-complex perturbations used for the full-marked triangle counts; at rank zero use the empty-product point model. Intermediate pieces may contain links with several components or more than one pair of basepoints. Use the colored multipointed modules with g+n−1 attaching curves in Sym⁡g+n−1(S), and specialize all w-colors to U and all z-colors to V; the displayed doubly pointed formula is the n=1 case. For an elementary triangle piece with four-dimensional cobordism Wr represented by a subordinate Heegaard triple (S,α,β,γ,w,z), its triangle-count map has the form

x⟼∑y ∑ϕ∈π2(x,Θβγ+,y)μ(ϕ)=0, s(ϕ)=s∣Wr,nwi(ϕ),nzi(ϕ)≥0 for every marked point#2(M(ϕ))U∑inwi(ϕ)V∑inzi(ϕ)y,

where Θβγ+ denotes a chosen cycle representative of the distinguished top-degree homology class of the appropriate standard auxiliary Heegaard pair, s(ϕ) is the Spin-c structure determined by the triangle class on Wr, and all marked multiplicities in the sum are nonnegative. The restriction s∣Wr is taken under the identification of this elementary cobordism with its Kirby piece. The other symbols and coefficient ring are as in the two-color target definition. For a chosen auxiliary cycle with finite support Θ=∑jpjθj, with pj∈F2[U,V] and basis generators θj, interpret the displayed formula by F2[U,V]-linearity as ∑jpjF(x,θj) (or ∑jpjF(θj,x) for the alpha-triple convention). The elementary 2-handle maps and band maps are triangle-count maps; the 0-, 1-, 3-, and 4-handle maps use the corresponding stabilization or destabilization maps; cylindrical changes of the dividing set use basepoint and quasi-stabilization maps. Compose the elementary maps in the chosen decomposition to obtain a representative

F~W,Σ,A,s,K:CFLUV−(Y0,K0,s∣Y0)⟶CFLUV−(Y1,K1,s∣Y1).

The subscript K records the chosen decomposition and auxiliary data. This is one map for one Spin-c structure; maps for different Spin-c structures are not summed unless a sum is explicitly specified. Independence from K, regular data, and parametrization is a separate naturality assertion.

Facts & Assumptions

Given: The decorated knot cobordism (W,Σ,A), fixed s∈Spin⁡c(W), chosen decomposition and auxiliary data of the Definition, with its stated Countable Choice assumptions.

[F1]

External construction input. Zemke, Link cobordisms and functoriality in link Floer homology, arXiv:1610.05207v3, Theorem A (p.3), Definitions 2.1–2.4 (pp.7–8), Proposition 3.5 and §3.4 (p.14), and §12 (pp.85–97), constructs the fixed-Spin-c colored maps for the full decorated category, as filtered equivariant chain maps on transitive chain homotopy types. Boundary parametrizations are retained (Remark 2.6, p.8). Components need not meet both ends: §12.5, Definition 12.8, Lemma 12.9 and equation (55) (pp.95–97) supply puncturing and the 0/4-handle maps. This is an explicitly imported established theorem, not a reconstruction from the local triangle lemma. (Source)

[F2]

External elementary-input convention. For a two-handle use the standard auxiliary top homology class in Zemke §5. For band surgery the actual inputs are the classes Θw for a type-z band and Θz for a type-w band (§§6.2–6.3, pp.46–47; auxiliary unlink calculation Lemmas 3.7 and 6.4). Choose cycle representatives. Changing a representative by a boundary changes the triangle map by filtered equivariant chain homotopy (§6.2, p.46). There is no canonical chain generator on arbitrary triples. The displayed formula is the beta-triple convention; alpha-triples insert the auxiliary cycle in the other tensor factor. The dividing set chooses the band type. (Source)

[F3]

Two-color scope. Color every component of Σw by U and every component of Σz by V. This is a coloring in Definition 2.3 and induces exactly the given endpoint coloring. Remark 2.14 (p.10) gives zero curvature for this specialization, including intermediate links; §3.4 gives the colored polynomial modules and variable-power filtration.

[F4]

Countable-choice specialization of the imported construction. Use the retained Countable-Choice theorem on full-marked low-dimensional polygons at its stated coherent-relative-face scope, with finite balanced diagrams, fixed labels and all nonnegative marked multiplicities. It supplies regular perturbations, finite counts, compact one-manifolds and gluing for the disk/polygon boundary identities used here. Its permitted small pointed curve choices retain the Spin-c labels and admissibility. The general naturality/move identities, top-input calculations and geometric decomposition theorems remain the explicitly external parts of [F1]–[F2], not conclusions of polygon analysis alone. Their remaining choices are finite topological data and countably indexed analytic families for each specified input/comparison, as detailed below. (Strictly admissible triple-free polygons have full-marked low-dimensional counts, Regularity, compactness, and gluing for decorated knot Floer triangles)

Verification

1.1F1F2givenconstruct

Choice scope. Fix the actual compact smooth cobordism, decoration, Spin-c structure and, for a comparison, the two actual decompositions. A compact smooth input has finite atlas/handle data. A Morse decomposition has finitely many critical points; a generic Cerf comparison has finitely many exceptional times (Zemke Lemma 11.18, p.80, and Theorem 11.5, pp.74 and 84–85). Choosing a finite list of charts, gradient-like fields, band neighborhoods, puncturing balls and standard auxiliary classes uses finite choice only. No choice of one decomposition for every cobordism is required: existence and pairwise comparison are quantified separately for arbitrary given inputs.

1.2F1F3givenconstruct

The dividing surface and boundary data meet the source category in [F1]: basepoints alternate, the dividing set separates the two regions, every three-manifold component meets the link, and every four-manifold component meets the divided surface. Closed dividing curves are allowed by its properly embedded one-manifold definition. The two-color assignment in [F3] is compatible on every elementary piece, including multicomponent and multiply based intermediate links. Its curvature is zero, so the imported curved maps are genuine maps of complexes over F2[U,V].

1.3F1F2F3construct

Use the elementary maps of [F1] for the chosen parametrized Kirby decomposition, with [F2]'s actual auxiliary cycles and the fixed restricted Spin-c labels. Their finite polynomial counts, chain-map property and compatibility with the natural Heegaard transition maps are supplied by that external construction. Thus their composition is the displayed representative. If a component has an empty incoming or outgoing end, apply [F1]'s standard puncturing prescription before composing, not an undefined intermediate empty-link Heegaard diagram. No graph-TQFT reduction or hat-only construction is substituted for this two-variable map.

2.1F1F2F4step 1.1construct

For that finite list of diagrams, the homotopy and periodic-domain data are countably indexed: use the finite-cell models of the compact manifolds and finite products of circles, and integer words in their finite attaching data; Spin-c extensions form a subset of a finitely generated integral cohomology torsor. Integer degrees, multiplicities, polygon types and neck lengths in N are countable indices as well. The count theorem [F4] supplies coherent perturbations relative to faces and fixed ends, rather than making independent choices at every real parameter value. Model counts and the finite move identities of [F1] use such zero- and one-dimensional polygon families; the elementary top classes in [F2] are algebraic classes on specified standard diagrams. A cycle representative, if needed, may be selected as the first representative in the explicit enumeration of finite polynomial chains over the countable ring. Nonempty single choices and finite choices require no additional axiom; countably many choices are covered by the assumed Countable Choice.

3.1F1F2F4step 1.1step 2.1construct

The geometric generic functions and comparison families can be chosen in the separable smooth spaces on those finitely many compact charts, with their countable derivative seminorms. Their residual conditions are indexed by countable jet charts/exhaustions, the finite singularity types and the countable curve classes; the analytic regularity choices are already furnished by [F4]. For the geometric Baire choices one may recursively select the first basic ball whose closure lies in the preceding ball and in the next dense open set, with diameters tending to zero. Completeness supplies the limit, so this step requires no choice over an uncountable set of functions. Source model relations are imported as finite geometric/count identities, with these actual CC-regular counts; their use does not require a well-ordering of all diagrams or a full-Choice selection of a global transitive system. Consequently the external proof specializes to the declared CC setting. This is a bounded choice inventory of its use here; it is not a claim that the publication itself discusses foundational optimality.

4.1F1F2step 1.3∎

The distinguished class notation in the formula never selects a canonical cycle on every diagram: choose a representative on the actual standard auxiliary pair and carry it by the transition maps. Its boundary ambiguity is exactly the homotopy in [F2]. The local analytic triangle theorem supplies its own weighted bilinear identity, but the existence and correctness of the required elementary inputs come from [F1]–[F2]. Independence of all chosen decomposition data and the Spin-c extension sum are established in the separate naturality lemma by the external Theorems A and B.

Depends on

Used by

Dependency tree · two levels

18 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