Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Extremal fork-noodle terms have one sign and cannot cancel

Statement

Assume AC. Put the tine T(F) and the noodle N in transverse position with the minimal number l of intersection points, assume l>0, and label the pairs by monomials mi,j=qai,jtbi,j and signs ϵi,j=−(−1)bi,i+bj,j+bi,j. If mi,j is maximal among the monomials, then mi,i=mj,j=mi,j, hence ϵi,j=−(−1)bi,j; consequently every term of the pairing carrying a maximal monomial has the same sign and the maximal coefficient of ⟨N,F⟩ is nonzero.

Facts & Assumptions

Given: a noodle N and a fork F, placed with the tine and N in minimal position by Minimal-position representatives and the arc bigon criterion; the labelled intersections z1,…,zl, the parallel points z1′,…,zl′, the monomials mi,j and signs ϵi,j of The lexicographic order on fork-noodle deck monomials.

[F1]

The exponent formula ai,j=(ai,i+aj,j)/2 holds for all i,j; it is Bigelow 2001 Lemma 2.1, proved from the explicit computation of the arcs ξi.

[F2]

The sign formula ϵi,j=−(−1)bi,i+bj,j+bi,j is Bigelow 2001 equation (1), proved from the orientations of Σ(N) and Σ(F).

Proof

1.1F1givenalgebra

Let mi,j be maximal in the lexicographic order. Then ai,j is maximal among the integers ak,l, hence ai,i≤ai,j and aj,j≤ai,j. By [F1], ai,j=12(ai,i+aj,j)≤12(ai,j+ai,j)=ai,j, and the two inequalities must be equalities; this is possible only if ai,i=aj,j=ai,j.

2.1givenstep 1.1construct

To prove bi,i=bi,j, suppose bi,i<bi,j, the only possible strict inequality by maximality and step 1.1. Let α run from zi′ to zj′ along T(F′), and let β return along N. If β misses zi, lifting the loop with one point fixed at zi gives bi,j−bi,i=2w, where w=wind⁡(αβ,zi). If β passes through zi, push it locally so zi lies to its left; this contributes one positive half twist, giving 1+bi,j−bi,i=2w. In either case w>0.

3.1F1givenstep 2.1construct

In the infinite cyclic cover π:D~1→D∖{zi} lift α, then β from its endpoint. Choose a clockwise return loop γ at zi′, winding w times about zi, nullhomotopic in D∖P, and meeting α∪β only at its endpoints. It can be drawn in a thin puncture-free neighborhood of an access path to zi; its lifted spiral γ~ is embedded and joins the endpoint of β~ back to the start of α~. Let z~k′ be the first intersection of α~ with β~, and take the initial α~′ and final β~′ at this point. Then α~′β~′γ~ is a Jordan curve. Its bounded disk B~ lies to its left: the clockwise spiral leaves a noncompact region on the right. The labelled-loop winding computation gives ai,k−ai,i=#(B~∩π−1(P)). Maximality forces this nonnegative integer to be zero. Hence the disk misses the lifted punctures and its projected boundary δ=α′β′γ is nullhomotopic in D∖P. 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).

4.1step 3.1construct

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 π−1(α′) entering B~ are disjoint arcs with both endpoints on β~′. Choose an innermost such arc α~′′ and its corresponding side β~′′. The latter has no further intersections with π−1(α′), so its projection meets α′ only at the two endpoints. Thus α′′β′′ is an embedded loop. Its lifted disk is contained in the puncture-free B~, so the projected loop is nullhomotopic and bounds a puncture-free digon by Jordan separation. In both cases the parallel tine and N cobound a digon, which transfers across the narrow parallel strip to T(F) and N and contradicts minimality. Therefore bi,i=bi,j.

5.1F1step 1.1step 3.1step 4.1constructalgebra

For the other diagonal keep the second point fixed at zj′ and move the first point: let ρ run from zj to zi along T(F) and let η return from zi to zj along N. Maximality and step 1.1 give bj,j≤bi,j. Suppose the inequality is strict. If η misses zj′, the lift of {ρη,zj′} compares the lifts at {zj,zj′} and {zi,zj′}, giving bi,j−bj,j=2w with w=wind⁡(ρη,zj′). If η passes through zj′, detour with zj′ 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 1+bi,j−bj,j=2w. Hence w>0 in either case. Repeat steps 3.1–4.1 in the cyclic cover of D∖{zj′}, based at zj, using the clockwise nullhomotopic return near zj′. At the first lifted intersection of ρ and η, now a lift of some unprimed zk, the oriented disk has puncture count ak,j−aj,j. 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 aj,j=ai,j is globally maximal. The disk is therefore puncture-free, and the innermost-arc argument of step 4.1 gives a digon between T(F) and N, contradicting minimality. Thus bj,j=bi,j, and step 4.1 gives both diagonal monomial equalities. This comparison uses maximality of mi,j and the diagonal q-exponents, without assuming maximality of mj,i.

6.1F2step 1.1step 5.1algebra∎

By [F2] and step 5.1, if mi,j is maximal then ϵi,j=−(−1)bi,i+bj,j+bi,j=−(−1)bi,j; the same holds for every pair (i′,j′) whose monomial equals the maximal monomial mi,j. Hence all terms of ⟨N,F⟩ carrying the maximal monomial have the same sign, and since monomials are compared in the lexicographic order, the coefficient of the maximal monomial in ⟨N,F⟩ is, up to sign, the number of such terms, which is at least one. In particular ⟨N,F⟩≠0.

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