Alphabeta Math
Pipeline-generated
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.

Epsilon and Upsilon concordance invariants — Examples and Counterexamples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

A low-weight basis term does not define Upsilon

Statement refuted

Let C=CFK∞(T2,3) be the right-handed trefoil staircase on generators x0,x1,x2 with (M,A)(x0)=(0,1), (M,A)(x1)=(−1,0), (M,A)(x2)=(−2,−1) and differential ∂x1=Ux0+x2, ∂x0=∂x2=0. The claim that ΥT2,3(1) is obtained by minimizing F1(x) over the individual displayed basis terms x0,x1,x2, instead of over Maslov-zero cycles representing the normalized generator, is false. Assuming the Axiom of Countable Choice for the normalized grid/analytic comparison, under the diagonal-grid convention every grid diagram of the trefoil also has grid Upsilon value −1 at t=1.

Facts & Assumptions

Given: The explicitly displayed right-handed trefoil staircase and the definition of F1 on a finite chain.

[F1]

The Upsilon function from the filtered knot Floer complex: F1(z) is the maximum weight among terms in the support of z, and ν1 minimizes this value over Maslov-zero cycles representing the normalized generator.

[F2]

The grid Upsilon function agrees with the original Upsilon invariant now contains a proof of the grid-value comparison using the normalized grid/Heegaard supplier, whose own current Proof is present and whose [F1]–[F5] prerequisites remain explicit. MOS Proposition 2.3 supplies 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 comparison proof supplies the chain-level collapse factor and its absolute normalization argument.

Counterexample

1.1givenF1algebra

The only Maslov-zero basis terms in the displayed staircase are x0 and U−1x2; x1 has odd Maslov parity, so no integral U-translate of x1 has Maslov grading zero. Both even-degree terms are cycles, and ∂(U−1x1)=x0+U−1x2 shows they represent the same nonzero generator. Their coordinates are (0,1) and (1,0), each of F1-weight 1/2. The sum is a boundary, so every Maslov-zero cycle representing the normalized generator has filtration 1/2. Thus ν1=1/2 and Υ(1)=−2(1/2)=−1.

2.1givenF1step 1.1algebra

The displayed basis term x2 has coordinates (0,−1) and weight F1(x2)=−1/2, which is less than 1/2. It has Maslov grading −2, so it is excluded from the Maslov-zero representative set; although it is a cycle, its homology class is not the normalized degree-zero generator. The false rule would return −2(−1/2)=+1, contradicting step 1.1.

3.1givenF2step 1.1algebra∎

Under Countable Choice, [F2] gives that the diagonal grid complex has the same Upsilon value as the original invariant, so step 1.1 gives the stated grid value −1. The grid comparison uses the supplier prerequisites recorded in [F2].

Unresolved proof obligations

The finite staircase refutation is complete. Its right-handed trefoil identification is supplied by the signed three-crossing grid proof in Epsilon is stable-equivalence invariant but not a homomorphism, step 1.4, together with that item's finite staircase computation. The universal grid-value clause is supplied by [F2] under the comparison prerequisites it records; the earlier missing-comparison escalation is no longer current.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Epsilon and Upsilon for the trefoil and its mirror

Example

For the knot-level assertions, assume the Axiom of Countable Choice. Let T2,3 be the right-handed trefoil and −T2,3 its reverse mirror. A filtered basis for CFK∞(T2,3) is x0,x1,x2 with (M,A)(x0)=(0,1), (M,A)(x1)=(−1,0), (M,A)(x2)=(−2,−1) and differential ∂x1=Ux0+x2, ∂x0=∂x2=0. Under the conventions of this page, ϵ(T2,3)=1,ΥT2,3(t)={−t,0≤t≤1,t−2,1≤t≤2. The graph has its unique interior breakpoint at t=1. For the reverse mirror, ϵ(−T2,3)=−1 and Υ−T2,3(t)=−ΥT2,3(t).

Diagram

The horizontal and vertical coordinates are the algebraic and Alexander filtrations (i,j). Arrows point from x1 to the two terms in its differential, Ux0 and x2. The dotted vertex is the translated cycle U−1x2 used in the Upsilon minimax. All diagonal U-translates are omitted; the differential and filtration calculations in the proof use the displayed algebraic data, not the drawing.

ijx0x1x2Ux0U¡1x2

Facts & Assumptions

Given: The displayed staircase complex, the epsilon map convention, and the Upsilon cycle-minimax definition. 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]

Epsilon from the filtered knot Floer complex: at s=τ, epsilon is 1 when Fs=0, −1 when Gs=0, and 0 when both homology maps are nonzero. These are tests on the exact hook maps, not on an arbitrary representative of the vertical class.

[F2]

The Upsilon function from the filtered knot Floer complex: Υ=−2νt, where νt is the minimum Ft-level of a Maslov-zero cycle representing the normalized generator.

[F4]

Epsilon is stable-equivalence invariant but not a homomorphism steps 1.4 and 6.2 give a finite signed-code admission of the positive trefoil grid and compute its normalized three-generator staircase. Grid homology is independent of the grid and computes knot Floer homology supplies the stated normalized grid-to-analytic comparison; its current Proof includes the absolute Maslov and Alexander normalizations and has its [F1]–[F5] prerequisites recorded there.

[F3]

Knot Floer duality and exchange of the two filtrations: the reverse-mirror complex is filtered-chain-homotopy equivalent to the dual, which negates the two filtration coordinates; the actual analytic diagram identification and its absolute grading are supplied without requiring admission of this particular staircase.

[F5]

The grid Upsilon function agrees with the original Upsilon invariant now has a proof of the grid Upsilon comparison, using the normalized comparison in [F4] and the locally supplied t-modification and tower splitting. Its precise analytic prerequisites are those recorded by [F4].

Proof

1.1givenF1F4

In the vertical complex, the differential is x1↦x2, so its degree-zero homology generator is x0 and first appears at Alexander level 1. The normalized comparison in [F4], after quotient by the chosen U action, identifies this filtered hat complex with the specified-data complex in The Alexander filtration and tau level; hence τ(T2,3)=1. For the exact epsilon maps at s=1, the target of F1 contains U−1x1 with boundary x0: its other differential term U−1x2 has j<1 and is killed there. Thus F1=0. The source of G1 contains the degree-zero cycle x0, while U−1x1 has i>0 and is excluded, so that class survives and maps to the nonzero vertical class. Thus G1≠0 and the exact three-case definition gives epsilon 1 for this complex.

1.2givenF2algebra

A Maslov-zero cycle representing the normalized total generator is either x0 or U−1x2: the Maslov-zero chain group in the displayed basis is spanned by these two cycles, and ∂(U−1x1)=x0+U−1x2 makes their homology classes equal. Their coordinates are (0,1) and (1,0), so their filtration levels are t/2 and 1−t/2. Therefore νt=min⁡(t/2,1−t/2) and ΥT2,3(t)=−2νt, which gives the stated two linear pieces. They agree at t=1, where the slope changes.

2.1F1F2F3F4step 1.2algebra

The algebraic Laurent dual of the displayed complex has generators x0∗,x1∗,x2∗ at Maslov/Alexander values (0,−1),(1,0),(2,1) and differential ∂x0∗=Ux1∗, ∂x2∗=x1∗, ∂x1∗=0. In its vertical complex x2∗ maps to x1∗, leaving x0∗ as generator at Alexander level −1. At s=−1, the F−1 target kills Ux1∗ because i<0, so x0∗ becomes a cycle; its only degree-one basis vector is x1∗ with zero differential, so the class is not a boundary and F−1≠0. The G−1 source has only x0∗ in degree zero, and its differential Ux1∗ is retained; Ux2∗ lies above j=−1 and is excluded. Hence G−1=0 and the exact epsilon convention gives −1. The degree-zero chain space has basis x0∗,Ux2∗; their individual differentials are both Ux1∗, so the only nonzero cycle is x0∗+Ux2∗, and it represents the normalized generator. Its two terms have coordinates (0,−1) and (−1,0), giving νt∗=max⁡(−t/2,−1+t/2)=−min⁡(t/2,1−t/2). Thus its Upsilon is the negative of the value in step 1.2 by an explicit cycle computation. Fact [F3] identifies the dual of the admitted trefoil complex from [F4] with its actual reverse-mirror complex, establishing both knot-level values.

3.1givenF5step 1.2algebra∎

Under [F5], the same calculation is obtained from the diagonal grid complex after accounting for its W⊗(n−1) factors, whose nonzero t-grade shifts are nonpositive on [0,1]. The factor is retained and does not change the maximal non-torsion grading.

Unresolved proof obligations

The positive staircase is identified with the actual right-handed trefoil by the signed-code proof and finite staircase computation in [F4]. Its normalized grid-to-analytic comparison and the grid-Upsilon equality are supplied by [F4] and [F5], under their stated prerequisites; the reverse-mirror identification is supplied by [F3]. The previous missing-grid-comparison and missing-diagram qualifications are resolved.

Sources