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 Upsilon function from the filtered knot Floer complex
Definition
Let be a smooth oriented knot and a finitely generated free complex. Choose a finite homogeneous basis , with and Alexander filtration . The translate has Maslov grading and filtration coordinates . The total homology is ; use the standard normalization in which its Maslov-zero tower generator first appears at algebraic filtration level , and denote it by .
For and a nonzero finite chain , define Let be the set of Maslov-zero cycles representing . Set The minimum is over cycles representing the normalized homology generator, not over individual basis terms. For comparison, let be the -span of the chosen basis and form its -modified complex over the ring of formal sums whose support is well-ordered (every nonempty subset of has a least element). The coefficient extension uses . In the extended Laurent complex, lowers both filtration coordinates by and Maslov grading by one, so a diagonal -translation lowers the extended -grading by two. On arbitrary homogeneous Laurent terms this grading is ; the formula below is specified on the chosen generators at . A homogeneous generator has -grading , extended by . If a term occurs in , its -modified differential coefficient is ; thus for , define . This differential lowers -grading by one. The comparison between its non-torsion tower grading and the finite cycle minimum is the separate filtered tower-splitting claim.
Definition references
Facts & Assumptions
Given: A finitely generated free bifiltered knot Floer complex whose total homology has a normalized Maslov-zero generator, as stated in the definition.
The Alexander filtration and tau level: that item defines a diagram-specific hat threshold and does not itself prove diagram/surface independence or supply the Laurent filtration comparison. The current Grid homology is independent of the grid and computes knot Floer homology separately supplies a normalized grid-to-analytic filtered comparison; localization gives the Laurent comparison under its stated prerequisites. This Definition remains algebraic on a supplied normalized complex.
Proof
For each of the finitely many basis generators , at most one Laurent translate has Maslov grading zero, since determines uniquely when it has an integer solution. Thus the Maslov-zero chain group is finite-dimensional over . A finite chain represents , so is nonempty; being a subset of a finite vector space, it is finite. The minimum defining therefore exists for every . The algebraic argument here does not establish knot-model independence; the current grid comparison theorem supplies the normalized comparison for its stated grid and analytic models.
If is a bifiltered chain homotopy equivalence, then it sends every Maslov-zero cycle representing to one representing the normalized generator of . Each term of has both filtration coordinates no larger than the corresponding input term, so for . Hence . Applying the same argument to a filtered inverse gives the reverse inequality, so .
For a fixed cycle support, is the maximum of finitely many affine functions of . Since is finite, is the minimum of finitely many such finite maxima. A finite minimum or maximum of affine functions is continuous and piecewise linear with finitely many breakpoints. Therefore is continuous and piecewise linear on .
For a differential term in , the -filtration gives and the -filtration gives . The Maslov grading gives , so its exponent in is . For a two-step path , the two exponents sum to , independent of . Thus the coefficient of each in is the coefficient of in multiplied by the same power of ; since , .
Unresolved proof obligations
The diagramwise tau definition alone does not supply a normalized model. The current Grid homology is independent of the grid and computes knot Floer homology has an authored proof of the normalized grid-to-analytic comparison; localization gives the Laurent comparison under that supplier's stated prerequisites. The filtered tower-splitting item supplies the separate -modified grading identification. This definition makes no assertion that and does not itself prove model invariance.
Depends on
Used by
- A low-weight basis term does not define Upsilon Counterexample
- Grid Upsilon from the diagonal grid complex Definition
- Epsilon and Upsilon for the trefoil and its mirror Example
- Epsilon is stable-equivalence invariant but not a homomorphism Lemma
- Filtered tower splitting for the Upsilon minimax Lemma
- The auxiliary nu-minus threshold is bounded by smooth slice genus Lemma
- Epsilon and Upsilon concordance data Theorem
- The grid Upsilon function agrees with the original Upsilon invariant Theorem
- Upsilon additivity, mirror symmetry, and four-ball genus bound Theorem
Dependency tree · two levels
23 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
- Peter S. Ozsvath, Andras I. Stipsicz, and Zoltan Szabo, Concordance homomorphisms from knot Floer homology, §§3–5 (standard reference, not scraped)
- Charles Livingston, Notes on the knot concordance invariant Upsilon (standard reference, not scraped)