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

Geometric intersection numbers are isotopy invariants

Statement

Assume AC, used in the relative-isotopy input where homotopic arcs are replaced by isotopic ones through Homotopic simple proper arcs in the punctured disk are isotopic relative to their endpoints. For curves c0,c1 in (D,Δ) (Curves and geometric intersection numbers on the marked disk) the number I(c0,c1) does not depend on the chosen minimal-intersection representative c1′ of c1, and if ci′ is isotopic to ci for i=0,1 then I(c0′,c1′)=I(c0,c1). Consequently I is an invariant of isotopy classes of curves, and it is computed in the source's picture as well as in any curve system obtained from it by an ambient isotopy.

Facts & Assumptions

Given: The marked disk (D,Δ), the isotopy relation ≃ of Curves and geometric intersection numbers on the marked disk, its minimal-intersection condition, the half-weight formula for I with the exceptional value 2 for isotopic simple closed curves and the flow extension for pairs meeting on ∂D, and curves c0,c1.

[L1]

For curves with c0∩c1∩∂D=∅ the number I(c0,c1) is defined as ∣(c0∩c1′)∖Δ∣+12∣c0∩c1′∩Δ∣ for any minimal-intersection representative c1′ of c1, with the exceptional value 2 when c0,c1 are simple closed curves with c0≃c1; for pairs meeting on ∂D it is defined after pushing c0 by a small positive boundary flow (Curves and geometric intersection numbers on the marked disk).

[L2]

Assume AC. Simple proper arcs in the punctured disk with the same endpoints that are homotopic relative to endpoints are isotopic relative to endpoints as unoriented arc images (Homotopic simple proper arcs in the punctured disk are isotopic relative to their endpoints).

[L3]

Assume AC. Let N be a finite family of pairwise disjoint simple arcs in D with endpoints on ∂D and interiors avoiding the marked points, and let T be a simple arc with endpoints in Δ∪∂D. Then T is isotopic relative to endpoints to an arc meeting every member of N minimally, and T is isotopic relative to endpoints to an arc disjoint from N if and only if some minimal-position representative is disjoint from N (Minimal-position representatives and the arc bigon criterion).

[L4]

The relative minimal-position comparison is Khovanov–Seidel Lemma 3.2: if c1′,c1′′ are isotopic, both minimal with c0, and not isotopic to c0, a boundary-fixed ambient isotopy preserving Δ and c0 setwise carries one to the other. Lemma 3.3 says that an isotopic minimal pair is either closed or has all endpoints marked, and is carried, relative to c0, to one of the two configurations of Figure 5. For a two-marked-endpoint arc each configuration has precisely the two common marked endpoints. These are the source's relative comparison lemmas, not a claim that arbitrary isotopies preserve a fixed intersection set (Khovanov–Seidel, printed pp. 18–19).

[L5]

Simultaneous transport by a boundary-fixed diffeomorphism preserving Δ bijects intersection sets, preserves their marked subsets, and carries bigons and minimal positions to bigons and minimal positions. An identity-component isotopy gives isotopic transported curves (Boundary-fixed mapping class group of a punctured disk, Curves and geometric intersection numbers on the marked disk).

Proof

technique · direct
1.1L1L4

The exceptional cases. Suppose the pair has no common boundary endpoint and c0≃c1. For closed curves the prescribed value is 2. For arcs, isotopy preserves their endpoint set, so both endpoints must lie in Δ. Each relative minimal model in [L4] has just those two common marked endpoints, giving I=1. These values depend only on the isotopy classes.

2.1L2L3L4L5step 1.1

Other minimal representatives give the same count. Suppose c0≄c1 and let c1′,c1′′ be minimal representatives of c1 relative to c0. The relative comparison [L4] gives an ambient isotopy preserving c0 setwise and carrying c1′ to c1′′. Its endpoint map bijects intersections with c0 and preserves Δ, so the ordinary and marked intersection counts agree. With step 1.1 this proves representative independence away from boundary intersections. The AC-dependent arc inputs [L2] and [L3] retain their hypotheses; the stronger relative comparison is the source lemma [L4].

3.1L1L5step 1.1step 2.1

Isotopy invariance away from boundary intersections. An endpoint map F of an identity-component ambient isotopy carrying c0 to c0′ carries a minimal representative c1′ to a minimal representative of the same class of c1. Simultaneous transport preserves both counts. If the pair is isotopic and closed, both values instead equal the prescribed 2; otherwise the weighted formula applies. Hence I(c0′,c1)=I(c0,c1) by step 2.1. Representative independence gives invariance in the second argument as well.

4.1L1L5step 3.1

The boundary push is independent of its small positive choice. Interpolate between the two positive boundary fields and their extensions by convex combination, and between sufficiently small positive flow times; write gs for the resulting endpoint diffeomorphisms. Compactness of the parameter interval allows a common small-time bound, so each boundary endpoint of gs(c0) stays in one complementary interval of ∂D∖c1. Larger allowed times can first be decreased within those intervals. Choose a boundary isotopy hs, starting at the identity and fixing the endpoints of c1, which carries these moving endpoints back to those of g0(c0). Extend hs to Hs in a thin collar preserving c1 setwise and missing Δ: in collar coordinates straightening the endpoint germs of c1 to radial segments, extend the boundary velocity tangentially along these segments, with a cutoff. Then as:=Hsgs(c0) is a smooth isotopy of embedded arcs with fixed endpoints. It extends to a boundary-fixed ambient isotopy fixing Δ: extend the velocity along the moving arc over tubular charts with cutoffs; it vanishes at fixed endpoints, and transversality at boundary endpoints allows the extension to vanish on the boundary. Thus step 3.1 gives I(a0,c1)=I(a1,c1). Simultaneous transport by H1, which preserves c1, bijects intersections and marked subsets and preserves the Jordan-disk condition; therefore I(g1(c0),c1)=I(a1,c1)=I(g0(c0),c1). The comparison is between isotopy classes before minimization; no isotopy preserving c1 is asserted between the arbitrary pushed arcs themselves.

5.1L5step 3.1step 4.1

Invariance with the boundary convention. A boundary-fixed endpoint map F transports a positive field Z to F∗Z and conjugates their flows, so simultaneous transport identifies I(ft(c0),c1) with I(Fft(c0),F(c1)). Step 4.1 permits the transported push for F(c0). Since the pushed pair has disjoint boundary endpoints and F(c1)≃c1, step 3.1 identifies the latter count with the pushed count for (F(c0),c1). This proves invariance in the first argument. For an isotopy in the second argument, use the same fixed push of c0; its boundary endpoints are disjoint from the fixed endpoints of every curve in that isotopy, so step 3.1 applies directly.

6.1step 1.1step 2.1step 3.1step 5.1∎

Conclusion. The ordinary weighted formula, the exceptional closed value, and the positive-boundary extension all define numbers independent of minimal representatives and invariant under the stated isotopies. The AC-dependent arc inputs retain the hypothesis in the Statement; the finite counts and explicit collar comparison require no additional choice.

Depends on

Used by

Cited to discharge well-definedness by Curves and geometric intersection numbers on the marked disk.

Dependency tree · two levels

26 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