Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge 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.

An arbitrary isotopy of arcs need not be a braid isotopy

Statement refuted

Refuted claim: the requirement in Braid isotopy relative to the top and bottom endpoints that every slice of the family be a braid is redundant, that is: if (αs)s∈I is a continuous family of injective parameterisations of arcs in D∘×I whose endpoints αs(0) and αs(1) are held fixed at the bottom and top points of the base configuration throughout, then the images As:=αs[I] are strands of geometric braids, so that the family is a braid isotopy as soon as its two boundary arcs are braids.

The witness deforms the single strand of the trivial one-strand braid. At the middle of the deformation its height coordinate has a horizontal shelf: two distinct points at one and the same height, so its image meets a horizontal slice in two points and is therefore not the strand of any braid. Since reparametrising an arc does not change its image, no choice of parameterisation repairs this; the family is a legitimate continuous deformation of arcs with fixed endpoints, but it is not a braid isotopy, and the definition's one-point-per-height condition is not redundant.

What is and is not claimed. The two boundary arcs A0 and A1 of the exhibited family are equal (both are the trivial braid), so nothing here asserts that two braids fail to be braid-isotopic; what is refuted is only the claim that an arbitrary arc deformation with braid boundary arcs is itself a braid isotopy. Nothing is claimed about closed links or about the classification of knots. The height function of the middle arc is not strictly increasing; the definition of braid isotopy requires each intermediate object to be a braid, which for a single strand means exactly that it meets each horizontal slice once.

Facts & Assumptions

Given: The natural number 1, so that h=14(1+1)=18 and the base configuration of Geometric braids in the disc with setwise endpoints is Q=(q1) with q1=(0,0), and the family of arc parameterisations αs ⁣:I→D∘×I, s∈I, defined by

λ(s):=14min⁡(2s, 2−2s),w(u):={4u,0≤u≤14,2−4u,14≤u≤34,4u−4,34≤u≤1,αs(u):=((λ(s)8w(u), 0),  u+λ(s)w(u)).

[F1]

For n=1 a braid based at Q is a continuous map z1 ⁣:I→D∘ with z1(0)=q1 and {z1(1)}={q1}, and its strand is the graph {(z1(t),t):t∈I}⊆D∘×I, which by construction meets each horizontal slice D∘×{t}, t∈I, in exactly one point; the trivial braid has the constant strand z1(t)=q1, whose graph is {(0,0)}×I, and a braid isotopy from β to β′ is a family of braids Z(s,⋅) depending jointly continuously on s, with each slice a braid (Geometric braids in the disc with setwise endpoints, Braid isotopy relative to the top and bottom endpoints, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[F2]

The closed unit disc is D={w∈R2:∥w∥2≤1} with interior D∘; the set D∘×I carries the product topology, and its points are written as (spatial point,height) (Euclidean spheres and closed balls as subspaces of Rn, 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).

[F3]

The functions s↦λ(s) and u↦w(u) are continuous, being piecewise linear with continuous gluing, and sums, products and composites of continuous maps are continuous; continuity of a function on I or on I×I follows from continuity on the finitely many closed pieces {s≤12}, {s≥12} and {u≤14}, {14≤u≤34}, {u≥34} (Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function, Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous, Continuity of a map of topological spaces at a point and globally, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Counterexample

technique · direct
1.1

The family is jointly continuous with the prescribed fixed endpoints. By [F3] the maps s↦λ(s) and u↦w(u) are continuous, hence (s,u)↦αs(u) is continuous by [F3]; at u=0 one has w(0)=0, so αs(0)=((0,0),0)=(q1,0) for every s, and at u=1 one has w(1)=0 and λ(s)w(1)=0, so αs(1)=((0,0),1)=(q1,1) for every s; thus the endpoints of the parameterised arcs are fixed at the bottom and top points of Q.

F1F2F3
1.2

Every slice lies in D∘×I. For every s∈I one has 0≤λ(s)≤14, and w takes the values w(0)=0, w(14)=1, w(12)=0, w(34)=−1, w(1)=0 with ∣w(u)∣≤1 for all u; hence the spatial coordinate satisfies ∣λ(s)8w(u)∣≤132<1, so each spatial point (λ(s)8w(u),0) lies in D∘; and the height u+λ(s)w(u) lies in I, because w(u)≥0 for u≤12 gives 0≤u≤u+λ(s)w(u)≤12+14≤1 there, while w(u)≤0 for u≥12 gives 12−14≤u+λ(s)w(u)≤u≤1 there.

F2F3
2.1

Each slice is a simple arc. Let s∈I and suppose αs(u)=αs(u′); comparing the spatial coordinates gives λ(s)w(u)=λ(s)w(u′) and comparing the heights gives u−u′=λ(s)(w(u′)−w(u))=0, so u=u′; hence every αs is injective, and its image As:=αs[I] is a simple arc with the endpoints (q1,0) and (q1,1).

step 1.1step 1.2
2.2

The middle slice is not the strand of a braid. At s=12 one has λ(12)=14, and the two parameters u=14 and u=34 are distinct while w(14)=1, w(34)=−1 give equal heights 14+14=12 and 34−14=12 and spatial coordinates 132 and −132; hence α1/2(14)=((132,0),12) and α1/2(34)=((−132,0),12) are two distinct points of A1/2 in the same horizontal slice D∘×{12}.

F2step 1.2
3.1

The boundary arcs are braids. For s∈{0,1} one has λ(s)=14min⁡(0,2)=0, so αs(u)=((0,0),u); the image A0=A1={(0,0)}×I is exactly the strand of the trivial braid of [F1], hence both boundary slices are geometric braids based at Q and the hypothesis of the refuted claim is satisfied.

F1step 1.1step 2.1
4.1

Conclusion. The family (αs) satisfies the hypotheses of the refuted claim by steps 1.1, 1.2, 2.1 and 3.1, but its slice at s=12 meets the horizontal slice at height 12 in two distinct points by step 2.2, whereas the strand of a braid based at Q meets each horizontal slice in exactly one point by [F1]; since a reparametrisation does not change the image A1/2, no choice of parameterisation makes that slice a braid, so the family is not a braid isotopy. Hence the one-point-per-height requirement in the definition of braid isotopy is not redundant, and the refuted claim is false. ∎

F1step 2.1step 3.1step 2.2

Remarks

  • At s=1/2 the height function is 2u on [0,1/4], constant 1/2 on [1/4,3/4], and 2u−1 on [3/4,1]. This horizontal shelf gives many distinct points at height 1/2; the height is nondecreasing, but not strictly increasing, and the arc is not a one-point-per-height graph.
  • The example is one-dimensional in the sense that a single strand suffices: no collision analysis between different strands arises, and the whole phenomenon is the failure of the height projection to restrict to a homeomorphism of the arc onto I.
  • The two boundary arcs being equal is what makes the point sharp: the deformation does not change the isotopy class of anything, and yet it leaves the class of braid isotopies, because braid isotopy is a relation between braids (tuples of one-point-per-height strands) and not between arcs.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

47 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