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.

The grid Upsilon function agrees with the original Upsilon invariant

Statement

For the knot-level assertions, assume the Axiom of Countable Choice. Let G be any n×n grid diagram representing a smooth oriented knot K⊂S3. Form the diagonal grid complex by setting every marking variable Ui equal to a single variable U, and define ΥG(t) by the t-modified non-torsion grading on that complex for 0≤t≤1, extended by ΥG(t)=ΥG(2−t) for 1<t≤2. Then for every t∈[0,2], ΥG(t)=ΥK(t), where ΥK is the finite cycle-minimax invariant defined from CFK∞(K). In this statement the quotient with all Ui identified carries the factor W⊗(n−1), where W has generators in Maslov/Alexander bidegrees (0,0) and (−1,−1); this factor is retained in the proof and is not counted as an improvement to the grid-state complexity bound.

Facts & Assumptions

Given: A knot grid G with grid number n, 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.

[F1]

Basepoint variables act chain homotopically on a knot grid: for consecutive markings the rectangle homotopy Hℓ satisfies ∂Hℓ+Hℓ∂=(Ui+Uj)id⁡ and is Alexander-filtered; following the one-cycle marking route identifies any two variable actions by filtered chain homotopy.

[F2]

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 [0,1], with reflection for t>1.

[F3]

The Upsilon function from the filtered knot Floer complex: the original invariant is −2 times the minimum Ft filtration of a Maslov-zero cycle representing the normalized generator.

[F4]

Knot Floer duality and exchange of the two filtrations: exchanging the two knot Floer filtrations identifies the original Upsilon values at t and 2−t. Its actual reflected/conjugate diagram maps preserve the normalized Maslov grading; no grid equality is a premise of that analytic symmetry.

[F8]

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 CFK−(K)⊗V⊗(n−1) factor, and the normalized Maslov and Alexander origins. MOS Proposition 2.3 states the chosen-variable filtered comparison and tilde-homology V-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.

[F5]

Filtered tower splitting for the Upsilon minimax proves the filtered projection and the exact regrading map identifying the maximal non-torsion degree with −2νt, using U=v2.

[F6]

Basepoint cones, a single variable action, and ordinary collapse gives an explicit filtered deformation retraction from the Ui+Uj cone to the ordinary quotient, including a polynomial-dependent differential. Its null-homotopy comparison supplies exactly one W factor per marking identification over the surviving chosen-variable action.

[F7]

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

1.1givenF1F6algebra

Regard the full marking-variable complex first as a module over the surviving variable U=U1; 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 U. Its proof gives Alexander filtration degree at most −1, since every counted rectangle contains the distinguished X, and Maslov degree −1. 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 DG≃CG⊗W⊗(n−1) over F2[U], where CG denotes the full grid complex restricted to the chosen U1 action. It is not the original multivariable complex with its coefficient ring silently changed.

2.1givenF2F7F8step 1.1algebra

Under the normalized grid comparison [F8], CG is filtered-chain-homotopy equivalent over that chosen polynomial action to CFK−(K) with the stated normalized gradings. Apply [F7] to the maps and their homotopies: a degree-d term Uky in a map on x acquires exponent gt(y)−gt(x)−d≥0, 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 tCFK−(K)⊗Wt⊗(n−1). This uses the actual comparison and the prerequisites listed in [F8], not an unproved formal reweighting assertion.

3.1givenF2F3F4F5step 2.1algebra∎

The two generators of W have t-gradings 0 and t−1. For 0≤t≤1, the second grading is nonpositive. The tensor product with Wt⊗(n−1) 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 1−t. Therefore the maximum non-torsion grading is unchanged. By [F5], this maximum agrees with the finite cycle-minimax convention [F3], so ΥG(t)=ΥK(t) for 0≤t≤1. For 1<t≤2, 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 V-factor, while the current in-run proof supplies the absolute normalization. The analytic filtration-swap symmetry used for t>1 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

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