Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Fork detection transports to arbitrary boundary crosscuts

Statement

Assume AC. Let F be a fork with compact absolute replacement cF, and let M be any simple proper crosscut of D∖P with two distinct endpoints on ∂D. Choose the closing neighborhoods of cF disjoint from M. Its triangle of unordered pairs defines an end-stable boundary-relative class yM, with any chosen lift. Then ⟨cF,yM⟩=0⟺T(F) is isotopic relative to P∪∂D to an arc disjoint from M. Here the pairing has an absolute first argument and an end-stable boundary-relative second argument. No pairing of two end-relative classes is asserted.

Facts & Assumptions

Given: the LKB cover and Laurent ring Λ=Z[q±1,t±1], the fork, its compact absolute replacement, and the crosscut; the replacement is chosen using closing neighborhoods disjoint from the compact image of M, which avoids all punctures.

[F1]

A multiple of a fork surface has a closed compact replacement supplies cF, supported away from the outer boundary and using closing neighborhoods disjoint from M, representing ΔF times the fork class, where ΔF=(1−q)2(1+qt)≠0.

[F2]

The fork-noodle pairing is well defined and equivariant supplies the exact absolute/end-stable pairing, finite-chain naturality, and the identity ⟨cF,yN⟩=ΔF⟨N,F⟩. The Laurent ring is an integral domain.

[F3]

The fork-noodle pairing detects essential intersections gives zero detection for the original fixed-boundary-endpoint noodle.

Proof

1.1F1givenconstruct

First choose the closing neighborhoods small enough to miss M; this is possible because its compact image misses P. Choose r0<1 enclosing P, the filled tine, the chosen closed closing neighborhoods, and the projection of the compact support of cF; all are compact in the interior of D. Write the two source boundary angles in positive cyclic order and likewise the two target angles of M; choose the ordering of the target endpoints accordingly. There is an increasing piecewise linear lift f:R→R with f(θ+2π)=f(θ)+2π taking the two source angles to those targets. Interpolate fs=(1−s)id⁡+sf. For a radial cutoff χ equal to zero on r≤r0 and one at r=1, set hs(reiθ)=rexp⁡(i[(1−χ(r))θ+χ(r)fs(θ)]). The angular maps are strictly increasing degree-one homeomorphisms; their inverses vary continuously by compactness. Thus hs is a filled-disk isotopy, identity on r≤r0, carrying the source endpoint pair to the target pair. Its configuration-space isotopy lifts from the identity, commutes with every deck transformation by uniqueness of lifts, and fixes cF pointwise since every track on its support is constant.

2.1F2F3step 1.1construct∎

The crosscut h1−1M is an original noodle with endpoints d1,d2. The closing neighborhoods are fixed by hs, hence also miss h1−1M. Its triangle class exists by the same parameter-gap truncation as any noodle: truncate 0≤u<v≤1 by v−u≥δ, with the new edge in a collision neighborhood by uniform continuity. Transport this class by the lifted isotopy to obtain yM. An arbitrary choice of its lift differs by a deck monomial unit. The finite intersection naturality in [F2] and step 1.1 give ⟨cF,yM⟩=u⟨cF,yh1−1M⟩=uΔF⟨h1−1M,F⟩, for a Laurent monomial unit u. Hence vanishing is equivalent to the last diagram polynomial vanishing, since uΔF≠0. By [F3] this means that the tine can be isotoped off h1−1M. Conjugate that isotopy by h1: it still fixes P and fixes the outer boundary pointwise at every time, while h1 fixes the tine. This is exactly disjoinability from M. The inverse conjugation proves the reverse implication.

Depends on

Used by

Dependency tree · two levels

19 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