Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Basic arcs, admissible curves and the standard normal form

Definition

Let (D,Δ) be the marked disk of Curves and geometric intersection numbers on the marked disk with m+1≥2 marked points, and let G=π0Diff⁡(D,∂D;Δ) be its boundary-fixed mapping class group (Boundary-fixed mapping class group of a punctured disk). Write D:=Diff⁡(D,∂D;Δ) for the actual diffeomorphism group, so G=π0(D). Actual curve images below use members of D, and mapping classes act on curve-isotopy classes. All curves below are curves in (D,Δ) in the sense of that definition.

Basic sets. Fix the boundary endpoint d of the standard drawn chain of source Figure 2, and label its marked points q0,…,qm along that chain. The standard basic arcs are b0 from d to q0 and bi from qi−1 to qi for 1≤i≤m. Their interiors are pairwise disjoint and avoid Δ∪∂D; consecutive arcs meet only at their common marked endpoint, and all other arcs are disjoint. A basic set of curves is an actual image of this fixed chain under a member of D. The marked labels are transported with it. Under AC, the preferred identification of the Artin-presentation group Bm+1 with G sends σi to the half twist about bi, 1≤i≤m. Presentation completeness is supplied by The Artin presentation is complete for geometric braids; the geometric-to-topological comparison is Braid group as boundary-fixed punctured-disk mapping classes. For the smooth group G used here, use the smooth configuration-space comparison and generator convention of Khovanov–Seidel, Section 3b, equation (3.1) and Figure 6, printed pp. 19–20 (The Axiom of Choice, The elementary geometric half twist, its support disc, and its opposite). Admissible curves. A curve c is admissible if c=f(bi) for some f∈D and some i, that is, if it lies in the D-orbit of the actual basic set. The endpoints of an admissible curve lie in Δ∪(b0∩∂D), and conversely every arc with such endpoints is admissible; G acts on the set of isotopy classes of admissible curves.

Vertical curves and normal form. Fix arcs d0,…,dm as in Figure 11, pairwise disjoint embedded arcs dividing D into regions D0,D1,…,Dm+1 in that order, chosen so that dk meets the spine in the prescribed way of the standard picture. An admissible curve c is in normal form if it has minimal intersection with every dk. Every admissible curve can be isotoped into normal form, and the normal form is unique up to isotopy preserving each dk setwise and fixing the marked points and ∂D (the source's Lemma 3.15); consequently the combinatorial data below are invariants of the isotopy class of c.

Crossings, segments, strings. For an admissible curve c in normal form put cr⁡(c):=c∩(d0∪⋯∪dm), the set of crossings of c; a crossing lying on dk is a k-crossing. The connected components of c∩Dk are the segments of c; a segment is essential when both its endpoints are crossings, and inessential otherwise (it then ends at a point of Δ∪∂D). The connected components of c∩(Dk∪Dk+1), for 0≤k≤m with Dm+1 interpreted as the region across dm in the standard picture, are the k-strings of c; write st⁡(c,k) for their set. By the uniqueness of normal form, the number and relative position of the segments and of the strings are invariants of c.

String types. Up to isotopy of Dk∪Dk+1 fixing the boundary arcs and the marked points, each k-string belongs to one of the following families or exceptional types. For 1≤k<m there are five infinite families Iu, IIu, IIu′, IIIu, IIIu′(u∈Z) and five exceptional types IV,IV′,V,V′,VI (Figures 15-16); the type Iu+1 is obtained from Iu by applying the half twist about bk, and likewise for the other families. For k=m the list consists of the two families IIu,IIIu and the two exceptional types V,VI (Figure 17), and for k=0 of the five exceptional types VII,VIII,IX,X,XI (Figure 18). The members u=0 of the families and the exceptional types are the drawn models of those figures; each type is an isotopy class of arcs in Dk∪Dk+1 with the prescribed endpoints on dk−1,dk,dk+1 and Δ∪∂D.

Segments types. A segment of c∩Dk for 1≤k≤m is, up to the analogous isotopy, of one of the six types labelled 1,1′,2,2′,3,3′ of Figure 12; for k=m+1 there are the two types analogous to 2 and 3 (Figure 13), and for k=0 the single type of Figure 14. The essential segments are precisely those of type 1,1′,2,2′; the basic curves b0,…,bm themselves have no essential segments.

The nested twists. Fix the pairwise disjoint nested curves l0,…,lm−1 of Figure 7. The disk bounded by lj contains exactly the suffix of marked points {qj,…,qm}. Choose a small closed annular neighbourhood of lj, disjoint from all marks and from the other support annuli; among the basic arcs it meets only bj, in one transverse crossing. Let τj be a positive Dehn twist supported in that annulus. Its class lies in G, the classes commute by disjoint support, and the chosen representative fixes every bk with k≠j. They generate the standard twist subgroup used in the detector lemma below. Standing convention. All the data above — the basic set b0,…,bm, the vertical curves d0,…,dm, the regions D0,…,Dm+1 and the nested curves l0,…,lm−1 — are fixed once and for all in the standard picture, and every statement invoking them names this fixed picture. When a statement is applied to an arbitrary basic set, it is transported by an actual diffeomorphism in D carrying the standard basic set to the given one; the transport is part of the statement.

Depends on

Used by

Dependency tree · two levels

48 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