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 grid Upsilon function agrees with the original Upsilon invariant
Statement
For the knot-level assertions, assume the Axiom of Countable Choice. Let be any grid diagram representing a smooth oriented knot . Form the diagonal grid complex by setting every marking variable equal to a single variable , and define by the t-modified non-torsion grading on that complex for , extended by for . Then for every , where is the finite cycle-minimax invariant defined from . In this statement the quotient with all identified carries the factor , where has generators in Maslov/Alexander bidegrees and ; this factor is retained in the proof and is not counted as an improvement to the grid-state complexity bound.
Statement references
Diagonal grid quotient and its t-modified non-torsion grading
Original finite cycle-minimax convention
The current normalized grid/Heegaard comparison and its stated prerequisites
Filtered chain homotopy between marking-variable actions
Kubota, On the Upsilon invariant in grid homology, §§2.5 and 3
Ozsvath, Stipsicz, and Szabo, Grid Homology for Knots and Links, §13.2 and Lemma 14.1.11
Livingston, Notes on the knot concordance invariant Upsilon, §§4–7
Facts & Assumptions
Given: A knot grid with grid number , 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.
Basepoint variables act chain homotopically on a knot grid: for consecutive markings the rectangle homotopy satisfies and is Alexander-filtered; following the one-cycle marking route identifies any two variable actions by filtered chain homotopy.
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 , with reflection for .
The Upsilon function from the filtered knot Floer complex: the original invariant is times the minimum filtration of a Maslov-zero cycle representing the normalized generator.
Knot Floer duality and exchange of the two filtrations: exchanging the two knot Floer filtrations identifies the original Upsilon values at and . Its actual reflected/conjugate diagram maps preserve the normalized Maslov grading; no grid equality is a premise of that analytic symmetry.
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 factor, and the normalized Maslov and Alexander origins. MOS Proposition 2.3 states the chosen-variable filtered comparison and tilde-homology -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.
Filtered tower splitting for the Upsilon minimax proves the filtered projection and the exact regrading map identifying the maximal non-torsion degree with , using .
Basepoint cones, a single variable action, and ordinary collapse gives an explicit filtered deformation retraction from the cone to the ordinary quotient, including a polynomial-dependent differential. Its null-homotopy comparison supplies exactly one factor per marking identification over the surviving chosen-variable action.
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
Regard the full marking-variable complex first as a module over the surviving variable ; 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 . Its proof gives Alexander filtration degree at most , since every counted rectangle contains the distinguished , and Maslov degree . 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 over , where denotes the full grid complex restricted to the chosen action. It is not the original multivariable complex with its coefficient ring silently changed.
Under the normalized grid comparison [F8], is filtered-chain-homotopy equivalent over that chosen polynomial action to with the stated normalized gradings. Apply [F7] to the maps and their homotopies: a degree- term in a map on acquires exponent , 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 . This uses the actual comparison and the prerequisites listed in [F8], not an unproved formal reweighting assertion.
The two generators of have t-gradings and . For , the second grading is nonpositive. The tensor product with 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 . Therefore the maximum non-torsion grading is unchanged. By [F5], this maximum agrees with the finite cycle-minimax convention [F3], so for . For , 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 -factor, while the current in-run proof supplies the absolute normalization. The analytic filtration-swap symmetry used for is supplied by [F4]. The earlier proof-absence note is stale; this item's comparison obligation is closed subject to the declared suppliers.
Depends on
- Admissible multipointed Heegaard data for knot Floer complexes
- Toroidal grid diagrams and gradings for oriented knots
- Finite grid complexes for knot Floer theory
- Basepoint variables act chain homotopically on a knot grid
- Grid homology is independent of the grid and computes knot Floer homology
- Regularity, compactness, and gluing for pointed Heegaard disks
- The Alexander filtration and tau level
- The filtered knot Floer complex of a connected sum is a tensor product
- Epsilon from the filtered knot Floer complex
- The Upsilon function from the filtered knot Floer complex
- Grid Upsilon from the diagonal grid complex
- Filtered tower splitting for the Upsilon minimax
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Knot Floer duality and exchange of the two filtrations
- The Axiom of Choice
Used by
Dependency tree · two levels
36 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
- Hajime Kubota, On the Upsilon invariant in grid homology, §§2.5 and 3 (standard reference, not scraped)
- Peter S. Ozsvath, Andras I. Stipsicz, and Zoltan Szabo, Grid Homology for Knots and Links, §13.2 and Lemma 14.1.11 (standard reference, not scraped)
- Charles Livingston, Notes on the knot concordance invariant Upsilon, §§4–7 (standard reference, not scraped)