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 oriented boundary loop represents the ordered product of the standard meridians
Statement
With the conventions of Standard meridians of a punctured disk, the positively oriented boundary loop represents the ordered product in .
Facts & Assumptions
Given: the boundary loop and standard meridians of Standard meridians of a punctured disk.
The standard flower consists of the truncated tethers and the circles ; its tethers form a tree rooted at (The standard flower is a deformation retract with free meridian basis).
Path homotopy gives equality of loop classes and concatenation multiplies these classes (Based loops and the fundamental group, Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints, Loop classes form the group under concatenation).
Simple polygonal regions are disks; polygonal vertex disks and edge strips give compatible side coordinates, and prescribed PL boundary homeomorphisms extend over polygonal disks (Finite polygonal disk parametrizations and boundary surgery).
Proof
Constructing the cut disk. Suppose and put . We establish the needed cut geometry directly. Near , the top outer boundary is , whereas every nonvertical tether has . Use the collar between , which misses the tethers for small nonzero because . On each vertical fiber send to , where near zero and vanishes outside a small interval; fix the collar endpoints and interpolate linearly. The target lies strictly between those endpoints, so each fiber map is increasing. Extend by the identity outside the collar and on ; the displacement tends to zero there, proving continuity of the map and its inverse, including on the vertical tether if present. This flattens the outer boundary near and fixes all tethers. Away from this segment the outer boundary has positive distance from them, so finite circle collar charts replace it by polygonal chords. For each inner circle choose a fine inscribed polygon with as a vertex. If is its radial boundary function, map radius to and a slightly larger collar radius to itself by increasing linear interpolation. The collars can be disjoint and miss other tethers; on its own tether direction , so that tether stays fixed. Thus all boundaries become polygons while the tethers stay straight. Open each tether using the vertex-sector and edge-strip coordinates of [F3], separating the sectors at . The boundary trace follows the outer boundary once and makes one detour down and back along each slit and around its hole. This is a single simple polygon after the shores have been separated: distinct tethers have disjoint interiors, distinct holes are disjoint and meet only their own tether, and the finitely many sectors at are distinct. By [F3] its enclosed region is a disk. The side and sector coordinates identify this region with the zero-width cut surface , giving disk topology. Its boundary splits into the outer arc and the complementary arc ; contains all tether shores and all opened inner circles. Regluing the paired shores and sector copies of gives a continuous quotient , with .
The two boundary paths of the cut disk. Orient by the positive outer boundary traversal, from its initial sector copy of to its terminal sector copy. Orient the complementary arc in the same initial-to-terminal direction, opposite to its direction as a piece of the oriented boundary of . In a convex disk coordinate for , linear interpolation between these paths gives a homotopy relative to their endpoints. Composing with and the inclusion gives a based homotopy between and the image of .
Tracing after regluing. With this direction, runs out along the first tether, counterclockwise around its circle, back along its other shore, and repeats for each tether in order. The sign follows from boundary orientation: inner circles of the oriented holed disk are clockwise, whereas traverses them opposite to that boundary direction. Its order is : from the positive outer boundary starts toward the left, and the distinct downward tether rays to occur from left to right. After quotienting the paired shores, these successive paths are exactly . Hence the image of is the concatenation , up to harmless parametrization and constant intervals.
Conclusion. The based homotopy of step 2.1 and the traversal of step 3.1 imply the asserted identity by [F2]. For the straight-line homotopy from to contracts the boundary relative to its basepoint, giving the empty product; for the same cut-disk argument is the positive outer/inner circle homotopy in the annulus. All collar charts, polygonal subdivisions and strips are finite, so no choice principle is used.
Depends on
- Standard meridians of a punctured disk
- The standard flower is a deformation retract with free meridian basis
- Finite polygonal disk parametrizations and boundary surgery
- A retract induces an injection on fundamental groups, and a deformation retract induces an isomorphism
- Based loops and the fundamental group
- Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints
- Loop classes form the group $\pi_1(X,x_0)$ under concatenation
Used by
Dependency tree · two levels
33 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
- Juan Gonzalez-Meneses, Basic results on braid groups, section 1.6, printed pp. 9-10 (x_1...x_n corresponds to a loop parallel to the boundary) (standard reference, not scraped)
- Emil Artin, Theory of Braids, Annals of Mathematics 48 (1947), pp. 101-126, printed pp. 113-115 (the ordered product condition) (standard reference, not scraped)