Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

The lexicographic order on fork-noodle deck monomials

Definition

Let N be a noodle and F a fork of Forks, noodles and the LKB intersection pairing, and let Φ be the two-variable covering homomorphism of The two-variable covering homomorphism.

Order. The lexicographic order on the deck monomials qatb is qatb≤qa′tb′⟺a<a′, or a=a′ and b≤b′. The q-exponent is compared first. A monomial mi,j from a finite list is maximal if mi,j≥mi′,j′ for all pairs of the list.

Labelled intersections. Put the tine edge T(F) and the noodle N in transverse position and let z1,…,zl be the intersection points of N with T(F), ordered along N. Choose a parallel copy F′ so that the tine edge T(F′) meets N transversely at points z1′,…,zl′, where zi and zi′ are joined by a short arc of N lying in the narrow strip between T(F) and T(F′). For i,j∈{1,…,l} define δi,j={α1,α2}{β1,β2}{γ1,γ2}, the arc in C assembled from the following embedded arcs in D∖P: α1 from d1 to z along the handle of F; α2 from d2 to z′ along the handle of F′; β1 from z to zi along T(F); β2 from z′ to zj′ along T(F′); γ1 from zi to dk along N, where k∈{1,2} is such that γ1 does not pass through zj′; and γ2 from zj′ to dk′ along N, where k′∈{1,2} is such that γ2 does not pass through zi (necessarily k≠k′: the earlier point along N returns to d1 and the later point to d2).

Monomial and sign labels. The pair (zi,zj′) carries the deck monomial mi,j=qai,jtbi,j:=Φ(δi,j), which is a well-defined element of ±qZtZ⊂Λ; the exponent ai,j satisfies ai,j=(ai,i+aj,j)/2 by Bigelow 2001 Lemma 2.1. The pair also carries the sign ϵi,j=−(−1)bi,i+bj,j+bi,j∈{±1}, the sign of the transverse intersection of the surfaces Σ(N) and Σ(F) at the point over {zi,zj′}.

The list of labelled pairs (zi,zj′,ϵi,j,mi,j) is kept distinct from its sum: the unsummed labelled intersections are the geometric data just described, whereas the Laurent polynomial obtained after collecting equal monomials is the pairing value ⟨N,F⟩=∑i,j=1lϵi,jmi,j, whose representative-independence and finiteness are proved in The fork-noodle pairing is well defined and equivariant. This definition fixes the order, the labels and the distinction, as used by the extremal-term lemma and the geometric computation of the pairing.

Depends on

Used by

Dependency tree · two levels

7 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