Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-27
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.

Braid isotopy relative to the top and bottom endpoints

Definition

Let n∈N and let Q=(q1,…,qn) be the base configuration of Geometric braids in the disc with setwise endpoints, so that braids based at Q are tuples of continuous maps zj ⁣:I→D∘ satisfying conditions (1)--(3) of that definition. Write I=[0,1] (Intervals of R: the nine order-convex forms, nondegeneracy, and length) and give I×I the product topology (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).

Let β=(z1,…,zn) and β′=(z1′,…,zn′) be braids based at Q. A braid isotopy from β to β′ relative to the top and bottom endpoints, or simply a braid isotopy, is an n-tuple

Z=(Z1,…,Zn),Zj ⁣:I×I⟶D∘,

of continuous maps (Continuity of a map of topological spaces at a point and globally) such that

  1. for every s∈I, the tuple Z(s,⋅):=(Z1(s,⋅),…,Zn(s,⋅)) is a braid based at Q, i.e. t↦Zj(s,t) is continuous into D∘, the n values Zj(s,t) are pairwise distinct for every t, the bottom condition Zj(s,0)=qj holds for every s and j, and {Z1(s,1),…,Zn(s,1)}={q1,…,qn} for every s;
  2. Zj(0,t)=zj(t) and Zj(1,t)=zj′(t) for all j and t.

The first variable s is the isotopy parameter and the second variable t is the height; a family of motions depending on s is a braid isotopy exactly when the map (s,t)↦Zj(s,t) is jointly continuous, not merely continuous in s for each fixed t. When such a Z exists we say that β and β′ are braid-isotopic and write β∼β′.

Relation to homotopy. A braid is a continuous map I→(D∘)n with additional properties, and a braid isotopy is a homotopy of such maps (Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints) that is relative to the bottom subset {0}⊆I, in the following sense: the homotopy condition Zj(s,0)=zj(0)=zj′(0) for all s says that the whole bottom point is fixed throughout the deformation. At the top, the condition is imposed setwise: {Z1(s,1),…,Zn(s,1)}={q1,…,qn}. Joint continuity then forces each individual top endpoint to remain constant as s varies, since a continuous map from an interval into this finite discrete set is constant.

Endpoint permutations of the slices. Let Z be a braid isotopy from β to β′. Each slice Z(s,⋅) is a braid and hence has an endpoint permutation π(Z(s,⋅))∈Sn (Geometric braids in the disc with setwise endpoints, The finite symmetric group Sn, one-line notation, and cycle notation). This definition does not separately impose that these slice permutations agree: it requires each slice to be a braid and the family to be jointly continuous. The slice permutations do agree, and therefore the endpoint permutation is an invariant of braid isotopy, with π(β)=π(β′); this is proved on this page, in the stacking proposition, by a connectedness argument for the height interval I.

Isotopy of the ambient cylinder is not enough. The definition constrains the deformation to the product D∘×I through height-preserving motions; it is neither an isotopy of an arbitrary embedded link nor a free homotopy of the tuple of paths. Deformations that make a strand meet a horizontal plane more than once, or that move bottom points, are not braid isotopies; a counterexample is recorded on the companion examples page.

Depends on

Used by

Dependency tree · two levels

25 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