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

Standard meridians of a punctured disk

Definition

Let n∈N, let D2={z∈C:∣z∣≤1} and Qn=(q1,…,qn) be the closed unit disk and the base configuration of Boundary-fixed mapping class group of a punctured disk, so that q1<⋯<qn are distinct points of the real axis of int⁡D2. Fix the boundary basepoint d:=(0,1)∈∂D2. For 1≤i≤n let si ⁣:[0,1]→D2 be the straight stem si(t):=(1−t) d+t qi, the straight segment from d to qi, and choose a round circle Ci in D2∖Qn centred at qi, of radius 0<εi<d(qi,∂D2) so small that the closed disks Bi bounded by the circles are pairwise disjoint, that each circle meets only its own stem, and that it meets si exactly once, at pi:=si(1−εi/Li) where Li:=∣d−qi∣, and meets no other stem sj with j≠i. Write ci ⁣:[0,1]→D2∖Qn for Ci traversed once positively (counterclockwise), from pi back to pi. The standard meridian loops are the loops based at d xi:=si ci si−1,1≤i≤n, read as si from d to pi, then ci, then si from pi back to d (Based loops and the fundamental group). Further, ∂ denotes the positively oriented boundary loop ∂(t):=d e2πit,t∈[0,1], of D2 based at d: it traverses ∂D2 once counterclockwise, starting and ending at d.

Existence and independence of the choices. The straight segments si leave d in pairwise distinct directions (the points q1,…,qn are distinct and lie strictly below d) and meet one another only at d; the segments si meet the real axis only at their endpoints qi. An explicit choice-free family is given by εi=14min⁡({1−∣qi∣}∪{∣qi−qj∣,∣qi−qj∣1+qj2:j≠i}). The finite set inside the minimum is nonempty and contains only positive numbers. The distance from qi to the line through d,qj is ∣qi−qj∣/1+qj2, so Bi misses every other stem. Also εi+εj≤∣qi−qj∣/2<∣qi−qj∣, proving disjointness of the closed disks, and εi<1−∣qi∣ keeps each disk inside D2. The radius is less than ∣d−qi∣, giving exactly the displayed contact with its own stem. For n=1 the minimum has only its boundary-margin entry; for n=0 the family is empty. Any family satisfying these conditions may be fixed; this formula witnesses its existence without any choice axiom.

The class [xi]∈π1(D2∖Qn,d) is independent of all admissible radii, including the old broader convention requiring only avoidance of the other stems. Such a circle encloses no qj with j≠i: otherwise the other stem from d, which lies outside the circle, to qj would cross it (or have qj on it). Thus the larger disk of any two admissible concentric circles still contains no other puncture. Interpolate their radii and their tether contact points radially; this is a based lasso homotopy in D2∖Qn (Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints). It does not require the intermediate circle to be disjoint from the other circles, so the class argument does not circularly assume the newly explicit representative convention. Fix once and for all one such family of circles; every statement on this page uses that fixed family.

Frozen conventions of the page. The stems and the basepoint transport are fixed once and for all by the choices above; the stems are indexed so that the positively oriented boundary loop ∂, as seen from d, meets the directions of the stems in the order s1,s2,…,sn. Products of braid automorphisms use ordinary function composition: the leftmost factor is the outermost map, so the rightmost factor acts first. No relation of the braid presentation and no choice principle is used in this definition.

Remarks

  • The index convention is a property of the labelling of the punctures: the directions of the stems from d occur in the same cyclic order as the punctures on the real axis, so that tracing the counterclockwise boundary from d meets the angular positions of s1,…,sn in increasing index order.
  • The loops x1,…,xn are the loops denoted x1,…,xn in Figure 3 of Boundary-fixed mapping class group of a punctured disk's source (Gonzalez-Meneses, section 1.6) and correspond to Artin's generators t1,…,tn of the free group of the punctured disk.

Depends on

Used by

Dependency tree · two levels

20 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