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 .
Counterexample
Given: , , , and . A bracketed vertex list denotes its polygonal arc. Use the noodle the tine and parallel tine and handles 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 .
The tine crossings are and ; their parallel crossings are and . Their order along is . The handle–tine–noodle loops go clockwise around respectively and only , so ; the noodle–lower-boundary loop has . The explicit labelled-loop formula of The lexicographic order on fork-noodle deck monomials gives
Parametrize each segment of each track by equal time within its stage of , and merge their rational breakpoints. The difference path is nonzero and piecewise affine. Counting crossings of the ray in direction is exact rational arithmetic: on a segment from to solve and retain the solution only when and the real coordinate in that ray direction is positive. The sign is that of . For each returning pair the closed difference path has total count ; for each exchanged pair followed by has count . Thus the sign matrix following from . The four projected intersections are distinct and transverse, and their signed count is .
The four monomial-weighted terms instead give 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 misses 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
- Bigelow, Braid groups are linear, J. Amer. Math. Soc. 14 (2001) 471-486 (standard reference, not scraped)