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.
Extremal fork-noodle terms have one sign and cannot cancel
Statement
Assume AC. Put the tine and the noodle in transverse position with the minimal number of intersection points, assume , and label the pairs by monomials and signs . If is maximal among the monomials, then , hence ; consequently every term of the pairing carrying a maximal monomial has the same sign and the maximal coefficient of is nonzero.
Facts & Assumptions
Given: a noodle and a fork , placed with the tine and in minimal position by Minimal-position representatives and the arc bigon criterion; the labelled intersections , the parallel points , the monomials and signs of The lexicographic order on fork-noodle deck monomials.
The exponent formula holds for all ; it is Bigelow 2001 Lemma 2.1, proved from the explicit computation of the arcs .
The sign formula is Bigelow 2001 equation (1), proved from the orientations of and .
Proof
Let be maximal in the lexicographic order. Then is maximal among the integers , hence and . By [F1], and the two inequalities must be equalities; this is possible only if .
To prove , suppose , the only possible strict inequality by maximality and step 1.1. Let run from to along , and let return along . If misses , lifting the loop with one point fixed at gives , where . If passes through , push it locally so lies to its left; this contributes one positive half twist, giving . In either case .
In the infinite cyclic cover lift , then from its endpoint. Choose a clockwise return loop at , winding times about , nullhomotopic in , and meeting only at its endpoints. It can be drawn in a thin puncture-free neighborhood of an access path to ; its lifted spiral is embedded and joins the endpoint of back to the start of . Let be the first intersection of with , and take the initial and final at this point. Then is a Jordan curve. Its bounded disk lies to its left: the clockwise spiral leaves a noncompact region on the right. The labelled-loop winding computation gives . Maximality forces this nonnegative integer to be zero. Hence the disk misses the lifted punctures and its projected boundary is nullhomotopic in . This is the disk calculation in Bigelow 2001's extremal-claim proof, printed p. 481 (the precise claim number is recorded in the source locator).
The projection of need not be embedded. If it is a Jordan curve, cancellation of the nullhomotopic shows it bounds a puncture-free digon. Otherwise the portions of entering are disjoint arcs with both endpoints on . Choose an innermost such arc and its corresponding side . The latter has no further intersections with , so its projection meets only at the two endpoints. Thus is an embedded loop. Its lifted disk is contained in the puncture-free , so the projected loop is nullhomotopic and bounds a puncture-free digon by Jordan separation. In both cases the parallel tine and cobound a digon, which transfers across the narrow parallel strip to and and contradicts minimality. Therefore .
For the other diagonal keep the second point fixed at and move the first point: let run from to along and let return from to along . Maximality and step 1.1 give . Suppose the inequality is strict. If misses , the lift of compares the lifts at and , giving with . If passes through , detour with on its left. This inserts a positive half turn of the moving point about the fixed point relative to the noodle return, so the same lift comparison gives . Hence in either case. Repeat steps 3.1–4.1 in the cyclic cover of , based at , using the clockwise nullhomotopic return near . At the first lifted intersection of and , now a lift of some unprimed , the oriented disk has puncture count . This follows from the same labelled-loop computation, with the first coordinate moving and the second fixed; no coordinate interchange changes the puncture-winding sum. The count is nonnegative and at most zero, since is globally maximal. The disk is therefore puncture-free, and the innermost-arc argument of step 4.1 gives a digon between and , contradicting minimality. Thus , and step 4.1 gives both diagonal monomial equalities. This comparison uses maximality of and the diagonal -exponents, without assuming maximality of .
By [F2] and step 5.1, if is maximal then ; the same holds for every pair whose monomial equals the maximal monomial . Hence all terms of carrying the maximal monomial have the same sign, and since monomials are compared in the lexicographic order, the coefficient of the maximal monomial in is, up to sign, the number of such terms, which is at least one. In particular .
Depends on
Used by
Dependency tree · two levels
43 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)