How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Filtered instanton complex from the cube of knot resolutions
Statement
Assume full AC. Let be a finite based diagram of a smooth knot with ordered crossings . The singular instanton resolution complex admits a finite filtration whose first page, with its first differential, is isomorphic to the reduced Khovanov cube of the reflected based diagram . Its spectral sequence converges to . The cube sign at the edge changing is , and the edge operation is multiplication for a merge or comultiplication for a split. Thus its page is the reduced integral Khovanov cohomology of . The claim includes coherent instanton orientations and the unlink group and saddle-map identifications; it asserts no diagram-invariance of intermediate pages.
Statement references
Facts & Assumptions
The actual based-link complexes, finite integral critical orientation modules, all-class cylindrical counts and continuation are Based-link earring complexes and resolution unlink groups are well-defined. Only its based-link invariant is used here, not a sutured closure or nonvanishing assertion.
Actual compatible backgrounds are Earring skein cobordisms admit marked orbifold backgrounds. Finite all-class oriented parameter counts and exhaustive collars are Admissible earring cobordisms have finite oriented family counts and gluing.
The integral skein maps, null homotopies, degree-one pentagon contribution and mapping-cone quasi-isomorphism, relative to the disjoint parameter families, are Earring skein cobordisms give integral exact triangles. This includes the genuine reducible-cap calculation, rather than assuming an exact triangle from the existence of cylindrical Floer homology.
The primitive integral unlink bases, their finite planar compatibility and actual merge/split maps are Integral earring unlink saddles are the reduced Frobenius operations. They use no unproved general split-link excision or arbitrary concordance formula.
The reduced Frobenius cube convention is Khovanov Frobenius algebra and cube of resolutions and Reduced Khovanov cohomology of a knot. Its signed differential is checked in The Khovanov cube differential squares to zero. The finite-filtration spectral sequence is Bounded filtered complex spectral sequence abuts to filtered homology.
Proof
Given: The finite based ordered diagram, full AC and the actual marked analytic data. Every parameter construction below is finite; the analytic suppliers carry their declared AC uses.
The multi-saddle parameter spaces and their entire boundary. Use the resolution labels of the reflected diagram, with an edge increasing one coordinate. Write for the actual based-link complex of that planar resolution. For , let be its set of changed crossings, . Put one standard saddle at time in each of its disjoint crossing balls; collisions of times are allowed, since the spatial balls are disjoint. Divide simultaneous translation out of , giving a parameter space of dimension . Its broken compactification is constructed as follows. A boundary chart is indexed by an ordered partition : retain the centered finite times within each block, and give successive block centers gaps , with boundary coordinate . At the corresponding cylinder is broken. Refining a block gives the corner charts. On chart overlaps centering changes a gap by a smooth bounded function of the retained block times, so changes by a smooth positive factor; two successive subdivisions give the same ordered gaps. These are manifold-with-corners charts. They cover a compact space: in any sequence normalize one time, pass to a fixed order of the finitely many labels, and select successive gaps which are bounded or diverge to positive infinity. The bounded clusters give finite centered limits after subdivision into their own bounded/divergent clusters, and there are at most labels. This proves sequential compactness in these finite partition charts; their countable coordinate basis and Hausdorff gap coordinates give compactness. Its facets are exactly the two nonempty ordered blocks. Such a facet is the product of the two smaller saddle parameter spaces, with the intermediate resolution as its cut; higher corners are their ordered iterates. Actual metrics are the fixed saddle metrics translated to these times, with product critical collars between separated blocks. Use their existing product metrics on every boundary chart and extend over the remaining compact interior by a finite partition in the convex cone of positive metrics. Here the background compatibility can be made literal. Put the planar resolution curves and the saddle surfaces in projection-plane times time; a local saddle has graph and normal coordinate . The constant viewing-normal vector is a nonzero normal section on every such panel and every unchanged planar strand strip. Fix the product normal model on the separate earring annulus. Thus the normal splitting in [F2] uses the SAME section on every cube face, rather than separately chosen graph-spine sections. The sheet cover is cut along the SAME vertical marking arcs, outside all crossing balls. Construct the exterior determinant line by the degree-one angular Thom clutch around the fixed marking rectangle; it is the fixed product line outside the crossing balls and the fixed trivial line inside each ball, since the rectangle misses them. On the normal tube use the explicit common sheet gluing of [F2], with these normal coordinates. Restriction at an intermediate resolution, and commuting two disjoint saddles, now preserve these very transition functions and their determinant trivializations. Hence all backgrounds and all corner identifications agree as actual gluing data. Relative perturbations from [F2], by induction on , therefore agree on all corners.
The total differential and the exact edge signs. Orient by the ordered crossing coordinates together with the positive simultaneous-translation direction. Retain the parameter orientation line instead of making separate arbitrary signs on its faces. At vertex tensor with the top exterior line , of parity . For an edge increasing , identify the line map with insertion of and reorder into increasing crossing order. Its sign is exactly . For a larger , use the analogous ordered exterior insertion and the parameter orientation line to define the signed zero-dimensional count . Include the vertex differential as . The relative grading shift makes each total map odd: its unshifted parity is , from its parameters and the even local saddle degree, whereas exterior insertion changes parity by . A one-dimensional parameter moduli space has only end-trajectory breaks and the two-block facets of step 1.1; it has no unlisted bubbles or extra class ends by [F2]. Ordered determinant excision identifies each boundary count with its corresponding composition . Its sign is precisely the exterior shuffle sign: move the ordered first block past the second in the exact sequence of their time-coordinate spaces, separating the positive gap and translation factors. For one element in each block this is the anticommutation ; for general blocks it is its repeated shuffle. Thus the algebraic boundary-zero identity is the coefficient of at every vertex pair. The finite direct sum with is an integral complex. Checkerboard boundary orientations of the planar regions orient all the surfaces consistently; their product determinant orientations are those of [F4]. If the skein labels are initially decreasing, reversing all labels contributes the fixed edge factor , removed by the vertex sign . The displayed increasing edge sign is therefore literal in [F5]'s convention.
Why this total complex is the original instanton complex. Leave one crossing unresolved and keep the other resolution parameters. The total complex obtained by resolving that crossing decomposes into its two face totals and their off-diagonal saddle-family map; by step 2.1 this is its actual mapping cone, with the indicated shifts. Use [F3]'s cone comparison on that crossing relative to every already fixed disjoint saddle family. Its components with other crossings changed are the counts over the same disjoint time families, with the local two-saddle homotopy and three-saddle pentagon inserted. Their boundary strata are exactly those already specified in [F3] and step 1.1. The relative perturbations agree on their common faces, and their boundary formulas are exactly the assertion that these components give a filtered chain map from the partially unresolved total to this cone. Filter both by the other crossings. On its associated graded this map is the vertexwise cone quasi-isomorphism of [F3]. A finite filtered comparison with quasi-isomorphic associated graded is itself a quasi-isomorphism: induct on the filtration length, use the short exact sequence of a final filtration piece and its quotient, and chase the long exact sequences in cohomology. No convergence of an infinite filtration is used. Resolve the crossings one at a time. This gives a composite quasi-isomorphism between and the original complex , including the zero-crossing case, which is the identity. Hence . This is an actual filtered-cone construction, not an inference that matching vertex ranks determines the abutment.
The first two pages. Filter by . Every count increases the number of resolved coordinates, so this is a bounded filtration by subcomplexes. On the associated graded the differential is just the vertex differential, hence . Its first differential is exactly the one-crossing saddle map, with the insertion sign computed in step 2.1; all larger saddle sets increase filtration by at least two. By [F4], the ordered planar unlink groups have the primitive reduced Frobenius bases and every one of these actual saddle maps is multiplication on a merge or comultiplication on a split, with the identity on the remaining factors. The marked circle uses the one-dimensional reduced factor. The local tetrahedral smoothing chart interchanges its two planar pairings when the over- and under-strands are reflected; these are precisely the A- and B-resolutions of the reflected diagram in [F5]. Thus the identified signed first-page complex is the reduced integral Khovanov cube of , not merely a vector space with the same rank. Its cohomology is the stated reduced integral page.
Convergence and exact scope. The filtration has only nonzero levels and the even and odd total chain groups are finite free abelian. Forget any finer instanton grading. To apply the ordinary integer-graded finite-filtration theorem literally, unroll this parity complex by , , with the repeated differential, and reverse cohomological indices if using [F5] in its chain convention. Every integer degree has the same finite filtration bounds. The cycles, boundaries and pages are two-periodic, so [F5] applies degreewise and the result folds back to the two parity degrees. The uniform finite filtration length makes every differential with filtration change greater than vanish. Thus it gives a finite spectral sequence with finite total pages and abutment the associated graded of the induced finite filtration on . Step 3.1 identifies this abutment with in the usual filtered-homology sense. All counts used their actual integral determinant orientations, exhaustive collars and all-class finiteness. Full AC is inherited from their analytic and bundle constructions; once these finite chain groups and maps exist, the filtration, exterior signs and finite exact-sequence arguments introduce no additional choice. The construction is for the fixed finite based diagram; neither an invariance theorem for its intermediate pages nor a sutured/KHI nonvanishing statement has been used or asserted. This proves every claim of the original Statement.
Depends on
- Instanton knot homology and its canonical isomorphism class
- Singular instanton knot and sutured closure data
- Analytic foundations for the singular instanton knot complex
- Khovanov Frobenius algebra and cube of resolutions
- Reduced Khovanov cohomology of a knot
- The Khovanov cube differential squares to zero
- Bounded filtered complex spectral sequence abuts to filtered homology
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
29 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
- P. B. Kronheimer and T. S. Mrowka, Khovanov homology is an unknot-detector, §§6–8.7 (standard reference, not scraped)
- P. B. Kronheimer and T. S. Mrowka, Knot homology groups from instantons, §1.2 and §§3.3–3.7 (standard reference, not scraped)
- Hongjian Yang, An Overview of Floer Homologies, §5.7 (standard reference, not scraped)