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

The closure of a geometric braid

Definition

Let n≥0 and let β=(z1,…,zn) be a geometric braid with the fixed real basepoints qj=((2j−n−1)/(4(n+1)),0) and endpoint permutation π, as in Geometric braids in the disc with setwise endpoints. Identify the disk with {x∈C:∣x∣<1} and put V=(D∘×[0,1])/((x,1)∼(x,0)). The quotient and its topology use The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space and the circle R/Z of The circle as S1=R/Z with basepoint [0]. The interval images sj={[(zj(t),t)]:0≤t≤1},cl⁡(β)=⋃j=1nsj are the closure in the open solid torus. In general an individual sj is an interval image, not a closed circle: its last point is the first point of sπ(j).

Components and orientation. For a cycle (j,π(j),…,πk−1(j)) concatenate these k strand maps in that order, with parameter in [0,k]. Their endpoints agree in V, so the concatenation factors through R/kZ. It is injective on this circle: points at distinct nonintegral heights can agree only when their parameters have the same fractional part, and the distinct strands at that height have distinct disk coordinates; at integral heights only the specified adjacent endpoints agree. Thus each cycle gives an embedded circle. Different cycles give disjoint circles, and every strand belongs to exactly one cycle. These circles are precisely the connected components of the closure. The orientation is increasing concatenation parameter. In particular the number of components equals the number of cycles of π.

The standard axis and fixed framing. In S3={(z,w)∈C2:∣z∣2+∣w∣2=1}, as in Euclidean spheres and closed balls as subspaces of Rn, set A={(0,w):∣w∣=1},Pθ={(z,w)∈S3:z≠0, arg⁡z=θ}. Fix the following particular diffeomorphism, including its disk framing: φ([(x,t)])=(1−∣x∣2 e2πit,x):V⟶S3∖A. Its inverse has disk coordinate x=w and circle coordinate [t]=[arg⁡z/(2π)]. Every Pθ is consequently an open disk. The raw topological oriented closure is β^top=φ(cl⁡(β)). This explicit φ is part of the construction; the definition does not allow an arbitrary page-preserving change of framing.

Page intersections and smooth representatives. The whole closure meets every page in exactly n points. A component belonging to a π-cycle of length k meets each page in exactly k points: at any fractional height it uses exactly those k distinct strands. The page coordinate of its concatenation is [t], for t∈R/kZ, so its oriented degree is +k. If all disk-coordinate strand maps are smooth and have all positive-order derivatives zero at their endpoints, their cycle concatenations have matching jets at every seam. The page coordinate has nonzero derivative, so the result is a smooth embedding of disjoint oriented circles, in the sense of Smooth embeddings. For an endpoint-flat smooth braid, its literal φ-image is therefore a smooth oriented link and is denoted β^.

Closure in the smooth oriented-link category. The raw image need not be smooth, even if individual strands are smooth but their endpoint jets fail to match at the cycle seams. For an arbitrary continuous braid, assume ACω (The Axiom of Countable Choice (ACω)) and choose a smooth representative βs by Every geometric braid is braid-isotopic to a smooth braid. Make it endpoint-flat by composing all disk-coordinate strands with a fixed smooth nondecreasing ψ:I→I, equal to 0 near 0 and 1 near 1. Interpolation of height maps (1−u)t+uψ(t) is an endpoint-fixed braid isotopy, because every strand is evaluated at the same height. The smooth-category closure of β is the oriented-link isotopy class of this chosen model's literal φ-image; when a subset is needed, use that chosen closed-braid representative. Independence of the representative is proved by The closure depends only on the braid isotopy class ↗. Page and cycle properties refer to the chosen constructed closed braid, with the same number of strands and endpoint permutation as β.

If β already has smooth strands with matching cycle-seam jets, in particular if it is endpoint-flat, its literal raw image is a smooth link and is retained as β^. The raw quotient, fixed φ, finite cycles, page counts and trivial closures remain choice-free. Finite elementary words have explicit smooth endpoint-flat models, so forming their literal closures also requires no choice assumption; ACω is used for the general continuous-representative convention and its independence theorem.

The trivial closure. For the constant braid its circles are {(1−qj2e2πit,qj):[t]∈R/Z}. They are latitudes of the sphere S={(z,w)∈S3:Im⁡w=0}, with Re⁡w=qj. Each northern cap Cj={p∈S:Re⁡w(p)≥qj} is a smooth disk: stereographic coordinates on S give radius (1−qj)/(1+qj) for this cap. To make their spanning disks disjoint, let e be the unit vector in the Im⁡w direction, set ε=π/16 and fj(p)=ε(Re⁡w(p)−qj) on Cj, and use Fj(p)=cos⁡(fj(p))p+sin⁡(fj(p))e. The boundary is fixed. The tubular parametrization (p,s)↦cos⁡(s)p+sin⁡(s)e is injective for ∣s∣<π/2, and 0≤fj<π/8. On overlapping caps, if qi<qj then fi−fj=ε(qj−qi)>0, so their graphs are disjoint. Thus these are pairwise disjoint smooth spanning disks. The trivial n-braid closes to the oriented n-component unlink; for n=1 this is the unknot.

At n=0 all strand and cycle unions are empty, every page has zero intersections, and the closure is the empty link. The basepoint list and disk constructions above then have no entries.

Depends on

Used by

Dependency tree · two levels

34 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