Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (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.

Ordinary intersection number alone does not give the LKB pairing

Statement refuted

The LKB fork–noodle polynomial is determined by the ordinary total algebraic intersection number of the projected surfaces in C.

Counterexample

Given: p1=(−0.4,0), p2=(0,0), p3=(0.4,0), d1=(−0.8,−0.6) and d2=(0.8,−0.6). A bracketed vertex list denotes its polygonal arc. Use the noodle N=[d1,(0.2,−0.3),(0.2,0.3),(0.7,0.3),(0.7,−0.3),d2], the tine and parallel tine T=[p1,(−0.3,0.1),(0.5,0.1),(0.5,−0.15),(−0.1,−0.15),p2],T′=[p1,(−0.3,0.08),(−0.28,0.08),(0.48,0.08),(0.48,−0.13),(−0.08,−0.13),p2], and handles H=[d1,(−0.3,−0.3),(−0.3,0.1)],H′=[d2,(−0.28,−0.35),(−0.28,0.08)]. These give embedded forks with disjoint tine interiors and the standard parallel-copy orientation of Forks, noodles and the LKB intersection pairing. Each handle stays on the right of its oriented tine. The noodle and lower boundary arc enclose only p3.

1.1givenconstructalgebra

The tine crossings are z1=(15,−320) and z2=(15,110); their parallel crossings are z1′=(15,−13100) and z2′=(15,225). Their order along N is z1,z1′,z2′,z2. The handle–tine–noodle loops ξ1,ξ2 go clockwise around respectively p2,p3 and only p2, so (a1,a2)=(−2,−1); the noodle–lower-boundary loop has A0=−1. The explicit labelled-loop formula of The lexicographic order on fork-noodle deck monomials gives (ai,j)=(−5−4−4−3).

2.1givenstep 1.1constructalgebra

Parametrize each segment of each track by equal time within its stage of δi,j, and merge their rational breakpoints. The difference path D is nonzero and piecewise affine. Counting crossings of the ray in direction 1+i/10 is exact rational arithmetic: on a segment from (x,y) to (X,Y) solve y+u(Y−y)=(x+u(X−x))/10 and retain the solution only when 0<u<1 and the real coordinate in that ray direction is positive. The sign is that of (Y−X/10)−(y−x/10). For each returning pair the closed difference path has total count −1; for each exchanged pair D followed by −D has count −1. Thus (bi,j)=(−2−2−1−1),(ϵi,j)=(−11−11), the sign matrix following from ϵi,j=−(−1)bi,i+bj,j+bi,j. The four projected intersections are distinct and transverse, and their signed count is −1+1−1+1=0.

3.1step 1.1step 2.1algebra∎

The four monomial-weighted terms instead give ⟨N,F⟩=−q−5t−2+q−4t−2−q−4t−1+q−3t−1=q−5t−2(q−1)(1+qt)≠0. The four exponent vectors are distinct, so this Laurent polynomial is nonzero without any specialization. For comparison, a fork tine placed to the left of x=15 misses N and has both ordinary count and pairing zero. The two configurations have the same ordinary count, zero, and different LKB values. Hence the proposed determination by ordinary intersection number alone fails.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 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