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

The fork-noodle pairing detects essential intersections

Statement

Assume AC. Let N be a noodle and F a fork of Forks, noodles and the LKB intersection pairing. Then ⟨N,F⟩=0⟺T(F) can be isotoped relative to ∂D∪P to an arc disjoint from N.

Facts & Assumptions

Given: a noodle N and a fork F in the disk D with puncture set P, with the conventions of Forks, noodles and the LKB intersection pairing and The lexicographic order on fork-noodle deck monomials.

[F1]

For T(F) and N in transverse position with l intersection points, the pairing equals the finite geometric sum ⟨N,F⟩=∑i,j=1lϵi,jmi,j of the labelled intersections, and its value depends only on the isotopy classes of N and F relative to ∂D∪P; in particular any isotopic choice of representative of the tine edge gives the same pairing. This is The lexicographic order on fork-noodle deck monomials together with the representative-independence and equivariance proved in The fork-noodle pairing is well defined and equivariant.

[F2]

Extremal fork-noodle terms have one sign and cannot cancel: if T(F) and N are in minimal position with l≥1 intersection points, then every term of ⟨N,F⟩ carrying a maximal monomial has one sign and the maximal coefficient is nonzero, so ⟨N,F⟩≠0.

[F3]

Minimal-position representatives and the arc bigon criterion: T(F) admits a minimal-position representative, and T(F) is isotopic relative to its endpoints to an arc disjoint from N if and only if every minimal-position representative is disjoint from N.

Proof

1.1F1given

Assume first that T(F) is isotopic relative to ∂D∪P to an arc disjoint from N. Choose such a representative F′ of the isotopy class of F with T(F′)∩N=∅; the finitely many intersection points of T(F′) with N number l=0. Then the geometric sum of [F1] is empty, so ⟨N,F′⟩=0, and representative-independence in [F1] gives ⟨N,F⟩=0. This proves the implication from disjointness to vanishing.

2.1F1F2F3givenalgebra∎

For the converse, suppose T(F) cannot be isotoped relative to ∂D∪P to an arc disjoint from N. By [F3] every minimal-position representative of T(F) meets N; choose such a representative T∗ and let l≥1 be its number of intersection points with N; the corresponding fork is isotopic to F relative to ∂D∪P. The minimal position hypothesis of [F2] is satisfied, so the maximal monomial of the geometric sum occurs with a single sign and nonzero coefficient, whence ⟨N,F∗⟩≠0. By representative-independence in [F1] again, ⟨N,F⟩=⟨N,F∗⟩≠0. This proves the contrapositive.

Depends on

Used by

Dependency tree · two levels

22 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