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 be a noodle and 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 is The -exponent is compared first. A monomial from a finite list is maximal if for all pairs of the list.
Labelled intersections. Put the tine edge and the noodle in transverse position and let be the intersection points of with , ordered along . Choose a parallel copy so that the tine edge meets transversely at points , where and are joined by a short arc of lying in the narrow strip between and . For define the arc in assembled from the following embedded arcs in : from to along the handle of ; from to along the handle of ; from to along ; from to along ; from to along , where is such that does not pass through ; and from to along , where is such that does not pass through (necessarily : the earlier point along returns to and the later point to ).
Monomial and sign labels. The pair carries the deck monomial which is a well-defined element of ; the exponent satisfies by Bigelow 2001 Lemma 2.1. The pair also carries the sign the sign of the transverse intersection of the surfaces and at the point over .
The list of labelled pairs 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 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
- Ordinary intersection number alone does not give the LKB pairing Counterexample
- A fork-noodle pairing computation Example
- An LKB kernel braid fixes every standard adjacent edge up to isotopy Lemma
- Extremal fork-noodle terms have one sign and cannot cancel Lemma
- The fork-noodle pairing detects essential intersections Lemma
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
- Bigelow, Braid groups are linear, J. Amer. Math. Soc. 14 (2001) 471-486 (standard reference, not scraped)
- Bigelow, The Lawrence-Krammer representation, arXiv:math/0204057v1 (standard reference, not scraped)