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

Every geometric braid is braid-isotopic to a smooth braid

Statement

Assume ACω. Let β=(z1,…,zn) be a geometric braid on n strands based at Q. Then for every ρ>0 there is a braid β′=(z1′,…,zn′) all of whose strand maps zj′ ⁣:I→D∘ are smooth, together with a braid isotopy Z from β to β′ such that

∣Zj(s,t)−zj(t)∣<ρfor all j, s, t.

Moreover the isotopy is relative to the endpoints in the precise sense of Braid isotopy relative to the top and bottom endpoints: every slice Z(s,⋅) is a braid based at Q, so every bottom endpoint is the fixed point Zj(s,0)=qj, and the top endpoints may be taken individually fixed, Zj(s,1)=zj(1), so that the endpoint permutation is preserved. If the given braid is already smooth on a neighbourhood of t=0 and t=1, the construction below may be centred there and the isotopy may be taken trivial on a neighbourhood of the endpoints; for an arbitrary continuous braid the endpoint values remain fixed as above, and neighbourhood agreement cannot be required unless the original strands are smooth on such a neighbourhood.

Facts & Assumptions

Given: ACω, a geometric braid β=(z1,…,zn) based at Q (Geometric braids in the disc with setwise endpoints), and a real number ρ>0.

[F1]

ACω is the countable axiom of choice (The Axiom of Countable Choice (ACω)).

[F2]

Assume ACω. Let F ⁣:M→Rk be continuous on a smooth manifold M and let ε ⁣:M→(0,∞) be a positive continuous error function. Then there exists a smooth map F~ ⁣:M→Rk with ∥F~(p)−F(p)∥<ε(p) for all p∈M (Whitney approximation for Euclidean-valued maps).

[F3]

A geometric braid on n strands based at Q is an n-tuple of continuous maps zj ⁣:I→D∘ with zi(t)≠zj(t) for i≠j, zj(0)=qj for every j, and {z1(1),…,zn(1)}={q1,…,qn} (Geometric braids in the disc with setwise endpoints).

[F4]

A braid isotopy Z=(Z1,…,Zn) from β to β′ is an n-tuple of jointly continuous maps Zj ⁣:I×I→D∘ such that every slice Z(s,⋅) is a braid based at Q, and Zj(0,t)=zj(t), Zj(1,t)=zj′(t) (Braid isotopy relative to the top and bottom endpoints).

Proof

technique · direct
1.1F3givenalgebra

Empty, singleton and uniform margins. For n=0 choose the empty smooth braid and constant empty isotopy; every assertion is vacuous. Henceforth n≥1. The finite disk-boundary function t↦min⁡j(1−∣zj(t)∣) is positive and continuous on I, so has positive minimum. If n≥2, the finite collision function t↦min⁡i<j∣zi(t)−zj(t)∣ also has positive minimum. Choose m>0 at most both minima when n≥2, and at most the boundary minimum alone when n=1. Put η=min⁡{ρ/4,m/8}, so 3η<ρ and 3η<m/2. No minimum of an empty pair list is used.

2.1F1F2step 1.1construct

Approximate on a boundaryless domain. Extend the continuous tuple z:I→R2n to R by the constant tuple z(0) for t<0 and z(1) for t>1. This extension is continuous because its values agree at 0,1. Apply [F2] on the boundaryless smooth manifold R, with constant error η, and restrict the resulting smooth map to I. It gives g=(g1,…,gn) with ∣gj(t)−zj(t)∣<η for every j,t. Thus no boundaryless Whitney assertion is applied directly to I.

3.1F3step 2.1construct

Exact endpoint collars, including preserved smooth germs. Choose δ∈(0,1/2) so ∣zj(t)−qj∣<η on [0,δ] and ∣zj(t)−zj(1)∣<η on [1−δ,1] for all j. Take smooth cutoffs χ0,χ1 supported in these disjoint collars and equal to one on the half-sized endpoint collars. Ordinarily use the constant collar data aj0(t)=qj, aj1(t)=zj(1). If the original strands are smooth in an endpoint neighbourhood, shrink the corresponding collar into that neighbourhood and instead use aj0(t)=zj(t) or aj1(t)=zj(t) there. The products with their cutoffs extend smoothly by zero off the collars. Define hj=(1−χ0−χ1)gj+χ0aj0+χ1aj1. This is smooth with hj(0)=qj, hj(1)=zj(1). In the already-smooth case it agrees with zj throughout the smaller original endpoint neighbourhood, rather than replacing that neighbourhood by a constant.

4.1step 1.1step 2.1step 3.1algebra

All collar choices satisfy the same error bound. On either collar, the replacement error ∣ajℓ−zj∣ is less than η for constant data and zero for preserved original data. Since the cutoffs have disjoint supports and weights sum to one, ∣hj−zj∣≤(1−χ0−χ1)∣gj−zj∣+χ0∣aj0−zj∣+χ1∣aj1−zj∣<3η≤3m/8<m/2. This covers both arbitrary continuous endpoints and already-smooth endpoint neighbourhoods.

5.1F3step 1.1step 3.1step 4.1algebra

The repaired motion is a braid, with the same endpoints. For all i≠j and all t, ∣hi(t)−hj(t)∣≥∣zi(t)−zj(t)∣−∣hi(t)−zi(t)∣−∣hj(t)−zj(t)∣>m−3m8−3m8=m4>0, so the values h1(t),…,hn(t) are pairwise distinct; and ∣hj(t)∣≤∣zj(t)∣+3m8<1, so they lie in D∘. Together with hj(0)=qj and {hj(1)}={zj(1)}={qj} from [F3] and step 3.1, this shows that h is a braid based at Q, smooth by step 3.1, whose endpoint permutation equals that of β because hj(1)=zj(1) for every j.

6.1F4step 3.1step 5.1algebra

The straight-line isotopy. Define Zj(s,t):=(1−s)zj(t)+s hj(t) for (s,t)∈I×I. It is jointly continuous, Z(0,⋅)=β and Z(1,⋅)=h, and every slice is a braid based at Q: for all s,t,i≠j, ∣Zj(s,t)−zj(t)∣=s∣hj(t)−zj(t)∣<3m8,∣Zj(s,t)∣≤∣zj(t)∣+3m8<1, so the n values are pairwise distinct (their pairwise distances are at least m−3m8−3m8=m4>0) and lie in D∘; moreover Zj(s,0)=(1−s)qj+sqj=qj and Zj(s,1)=(1−s)zj(1)+s zj(1)=zj(1) for every s. Hence Z is a braid isotopy from β to the smooth braid h.

7.1F4step 1.1step 3.1step 6.1algebra∎

Conclusion. By step 6.1 the smooth braid h is braid-isotopic to β through the isotopy Z, whose deviation from β satisfies ∣Zj(s,t)−zj(t)∣=s∣hj(t)−zj(t)∣<3η<ρfor all j,s,t, by the choice of η in step 1.1. The isotopy keeps every bottom endpoint fixed pointwise and every individual top endpoint fixed, so the endpoint permutation is preserved by step 5.1. Where a smooth original collar was retained in step 3.1, h=z there, so the entire straight-line isotopy is also fixed there. Taking β′:=h proves the statement for the prescribed ρ, and ρ>0 was arbitrary.

Depends on

Used by

Dependency tree · two levels

27 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