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.
Geometric Braids and Artin Generators — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Braided and Symmetric Monoidal Categories
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Covering Spaces and Lifting
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Fundamental Trigonometric Identities
- Geometric Braids and Artin Generators
- Group Homomorphisms and the Isomorphism Theorems
- Homotopy and Homotopy Equivalence
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sine, Cosine, and the Definition of Pi
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Fundamental Group of the Circle
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These four worked entries make the abstract items of the companion page concrete, and each one is a computation or a witness rather than a restatement. The first example handles the case completely without assuming completeness of the Artin presentation: for and , , the relative motion of a two-strand braid is a nowhere-zero path in ending at one of , whose argument class lifts uniquely to with , and is an integer. The example proves that is a braid-isotopy invariant, that , that , and , and hence that : every two-strand braid is braid-isotopic to exactly one integer twist, via , and the twist exponent is the total argument change of the relative motion divided by . The parity of records the endpoint permutation, which is exactly the ingredient that makes additivity of under stacking work.
The second example takes , and , so that the three base points are on the horizontal axis, and writes out the two words and strand by strand, in the six explicit windows dictated by the stacking formula; the windows glue at and both words end at , giving the endpoint permutation . The example checks the two products in , , computes the separation of the two moving strands and the clearance from the frozen base point, exhibits the rotation braid and the linear interpolation between and , whose slice at is , and concludes in .
The two counterexamples record the two places where the geometric definitions could be misread. Setwise endpoints do not make a braid pure: the half twist on two strands has top endpoint set but ends at , so no strand returns to its own starting point, and since the endpoint permutation is an isotopy invariant is not braid-isotopic to the trivial braid. And an arbitrary isotopy of arcs with fixed endpoints need not be a braid isotopy: the explicit family with and the piecewise linear with consists of simple arcs with the fixed endpoints and whose boundary arcs are the trivial braid, yet at the arc passes through the two distinct points at the single height , so it is not the graph of a strand of any braid; the one-point-per-height requirement in the definition of braid isotopy is therefore not redundant. Nothing in these four entries uses a choice principle.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Geometric two strand braids are integer twists
Example
Let , let with , and , let be a braid based at (Geometric braids in the disc with setwise endpoints), and let and be the two half twists at (The elementary geometric half twist, its support disc, and its opposite), with classes (The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism). Write
for the relative motion of the two strands, and write for the stacking of copies of when , of copies of when , and for the trivial braid when .
The invariant. There is a unique continuous with whose class is the argument class of , that is, the unique with , where ( is a homeomorphism from to the unit circle). The number
is then an integer, and it is an invariant of the braid isotopy class of . The example proves:
- is a group homomorphism, with ;
- , and , hence for every ;
- in . Consequently is a group isomorphism , every two-strand braid is braid-isotopic to exactly one of the integer twists (), and two two-strand braids are braid-isotopic if and only if they have the same invariant .
Thus a two-strand braid is exactly an integer number of half twists, counted with sign, and the composition of such twists adds the numbers. The calculation is independent of any presentation of : it uses only the generation of by from The Artin presentation surjects onto the geometric braid group together with the argument lift constructed below.
Facts & Assumptions
Given: The natural number , the base configuration with , , , two-strand braids , and based at , and the half twists based at .
A braid based at is a pair of continuous maps with for all , and , with endpoint permutation defined by ; here and , and the two-element group consists of the identity and the transposition of and ; a braid isotopy from to is a pair of jointly continuous maps whose every slice is such a braid based at and whose boundary slices are and (Geometric braids in the disc with setwise endpoints, Braid isotopy relative to the top and bottom endpoints, The finite symmetric group , one-line notation, and cycle notation, Intervals of : the nine order-convex forms, nondegeneracy, and length, Continuity of a map of topological spaces at a point and globally, The product set 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).
The half twists are , and , with , where for and for , and ; both are braids based at , is the transposition of and , and in (The elementary geometric half twist, its support disc, and its opposite, The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism).
Stacking is for and for , where are the strands of ; and is constant on braid isotopy classes, so is an invariant of the class (Stacking of geometric braids is a well-defined associative operation on isotopy classes, The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism).
Every element of is a finite product of the elements and ; more precisely the classes generate for every (The Artin presentation surjects onto the geometric braid group).
is a covering map; for a covering , a path and with there is a unique path lift with and , and for a homotopy together with a lift of there is a unique lift of with for all ; consequently two lifts of one path into to continuous maps differ by a constant integer, since their difference is continuous and takes values in ( is a covering map with translated interval sheets, Existence and uniqueness of path lifts through a covering map, Existence and uniqueness of homotopy lifts through a covering map).
The map , , is a homeomorphism onto the unit circle , and ; moreover for every real , because and ( is a homeomorphism from to the unit circle, Quarter-turn values and shifts by pi/2 and pi, Euclidean spheres and closed balls as subspaces of ).
The radial normalisation , , is continuous, and for every ; so the composite is continuous, and for every by [F6] (Radial normalisation is continuous on , Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).
Sums, differences and scalar multiples of continuous maps are continuous, composites of continuous maps are continuous, continuity of a map into may be checked on the coordinate functions, and the continuous image of a connected subset is connected; since is connected and the connected subsets of are the intervals, a continuous map from into is constant (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, A continuous image of a connected space is connected, and connectedness is a topological property, The connected subspaces of with its usual topology are exactly the order-convex subsets, the published characterisation transported by the identification of the two descriptions of "open in ", Intervals of : the nine order-convex forms, nondegeneracy, and length).
Verification
The relative motion and its endpoint values. Assume and let be a braid based at ; then is continuous and for every by [F1] and [F8], since distinct strands do not meet; the endpoint condition of [F1] gives , and by the convention of [F1] the value occurs exactly when is the identity, while occurs exactly when is the transposition of and .
The argument class and its lift. By [F7] the class map is continuous, so is continuous by [F8]; its value at is because and by [F6]; hence [F5] applied to the covering and the path gives a unique continuous with and , that is for every .
The invariant, and its parity against the endpoint permutation. By step 2.1 the class equals , and by [F6] and [F7] one has and ; so step 1.1 gives when is the identity and when is the transposition. In the first case is odd and in the second it is even, so in both cases is an integer, and it is even exactly when is the identity and odd exactly when is the transposition.
Isotopy invariance. Let be a braid isotopy from to and put , a continuous and nowhere vanishing map by [F1] and [F8]; then is a homotopy by [F7] and [F8], and for every by [F1], so the constant map is a continuous lift of ; hence [F5] provides a unique lift of with for all . For each the slice is a braid based at by [F1], so its relative motion is , and is the unique lift of with value at ; step 3.1 applied to that slice therefore gives for every . The map is continuous, so is a continuous map from the connected interval into and is constant by [F8]; moreover by the uniqueness in [F5] applied to and step 2.1, and is the corresponding lift for the relative motion of ; therefore , and is constant on braid isotopy classes.
Additivity under stacking. Let be two-strand braids based at , let be their argument lifts of step 2.1, and let when is the identity and when is the transposition, so that by step 3.1; by [F3] the relative motion of the stacking is for and for . Let be the unique lift of with , granted by [F5]. On the map is a lift of with value at , so there by uniqueness of path lifts, and , because by step 3.1. On , since for by [F6] and [F7], the maps and are two lifts of the same path, so by [F5] the second is the first plus a constant integer: for some and all . Evaluating at gives , that is , which is an integer precisely because . Hence , and therefore .
The values on the trivial braid and on the two half twists. The relative motion of the trivial braid , whose strands are the constant maps by [F1], is the constant path , whose argument lift with value at is the constant ; so . For the relative motion is , that is for and for , by [F2], and it vanishes nowhere: on the first half runs through the closed third quadrant from to and on the second half through the closed fourth quadrant from to , in each case with a direction that turns strictly monotonically; hence the lift with value at satisfies and , and . For the relative motion is the reflection in the horizontal axis of the previous one, running through the second and then the first quadrant, and the same computation gives and , so . By the additivity of step 4.2 and induction on this gives for every .
Every two-strand braid is an integer twist. Let be any braid based at ; by [F4] the class is a finite product of the elements and , that is for the integer which is the sum of the exponents of that product, and by steps 4.2 and 5.1 the invariant of is ; hence , and braid-isotopic braids have equal invariants by step 4.1. Consequently descends to a well-defined map by step 4.1, that map is a group homomorphism by step 4.2, it is surjective because for every by step 5.1, and it is injective because forces by the identity above; so via , the twists represent pairwise distinct classes, and each class of is exactly one of them. ∎
Remarks
- The invariant is the total argument change of the relative motion, divided by : the lift measures the angle of the vector from the second strand to the first in units of full turns, and the half twists contribute and . The factor in converts turns into half turns. Step 3.1 also records the parity dictionary used in step 4.2: is even exactly for the braids with the identity, and odd exactly for those whose endpoint permutation is the transposition; this is what makes the correction in the second half of a stacking an integer.
- Only the relative motion of the pair is used, and the endpoint set condition makes its argument change an integer multiple of half a turn: a pure two-strand braid returns the two labels, so the vector comes back to itself after an even number of half turns, while a transposition reverses it after an odd number.
- The example does not use any presentation of , and in particular it does not use The two-strand braid group is infinite cyclic: generation comes from The Artin presentation surjects onto the geometric braid group and completeness of the presentation is never assumed.
The three strand geometric braid relation
Example
Take and , so that and the base configuration is
with and , and with and for . Let be the elementary half twists (The elementary geometric half twist, its support disc, and its opposite) and set
with respect to the stacking of Stacking of geometric braids is a well-defined associative operation on isotopy classes. Write for the rotation of the plane about the origin, and let be the three-strand tuple whose -th strand is at height at the point , the strands outside being constant (here , so there are none). The example verifies:
- and are braids based at whose strand coordinates are the explicit windows displayed below, and both have endpoint permutation the transposition ;
- is a braid based at with endpoint permutation , and its strands move through the explicit positions and ;
- the linear interpolation has bottom value and top value for every , and its slices at are collision-free with the displayed values;
consequently, by the isotopies exhibited in The geometric three strand braid relation, the two words are braid-isotopic and
holds in .
Facts & Assumptions
Given: The natural number , the index , the base configuration with , the half twists based at , and the words and .
For and one has ; the proof exhibits the intermediate braid , the rotation of about by the angle at height with the remaining strands fixed, and shows that the bracketing is braid-isotopic to , which is a braid based at with endpoint permutation the transposition of and , while the point reflection followed by the relabelling of and turns that bracketing into , so that bracketing is braid-isotopic to as well (The geometric three strand braid relation).
The base points are , here , , ; the half twist at is , and otherwise, where and the diamond path satisfies , , ; is the transposition of and ; stacking places the right factor below: for and for , with and in (Geometric braids in the disc with setwise endpoints, The elementary geometric half twist, its support disc, and its opposite, Stacking of geometric braids is a well-defined associative operation on isotopy classes, The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism).
A braid based at is a tuple of continuous maps with pairwise distinct values, and , its endpoint permutation being the unique with ; a braid isotopy is a jointly continuous family whose every slice is such a braid and whose boundary slices are the two given braids; the group is written in cycle notation with (Geometric braids in the disc with setwise endpoints, Braid isotopy relative to the top and bottom endpoints, The finite symmetric group , one-line notation, and cycle notation).
, , , , , , and for every real ; hence is the identity, , and for all (The derivatives of sine and cosine are cosine and minus sine, Quarter-turn values and shifts by pi/2 and pi, Parity and the Pythagorean identity for sine and cosine, The -norms for rational , and ).
Sums, scalar multiples and composites of continuous maps are continuous, and a function on the interval whose restrictions to the finitely many closed pieces , , are continuous is continuous; the same pasting applies in the isotopy parameter (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 : the nine order-convex forms, nondegeneracy, and length).
Verification
The explicit strand windows of the two words. Applying the stacking formula of [F2] twice, with , and the transposition couplings , , gives for the strands for , for and for , and for the strands for , for and for . The two windows of agree at , where the first gives and the second gives , and at , where the second gives and the third gives ; the same two checks apply verbatim to the three windows of , so by [F5] the formulas define continuous tuples , and each value of each of the six windows is one of or one of .
The rotation braid. By [F4] the motion is continuous for each and satisfies at and at , so the strands of run from to , that is from to ; at height the three positions are , whose mutual distances are those of the distinct points because preserves the norm and is linear and injective; and every value lies in , since ; hence is a braid based at with endpoint permutation .
Collision bounds for the windows. For the diamond path satisfies for and for ; the first is with equality at and the second is with equality at , and both are . Hence in each window the two moving strands, which are and (or and ), are separated by , and the frozen base point of that window, namely in the first and third windows and in the second, is at distance exactly from that window's midpoint and therefore at distance at least from each moving point; moreover every window value has norm at most , so all values lie in . Consequently each of the two window tuples is a collision-free tuple, and together with steps 1.1 and 1.2 this shows that and are braids based at .
The endpoint permutations. By [F2] and step 1.1, and ; evaluating the first composite, , at gives , and , that is the transposition , and evaluating the second, , at gives , and , which is again ; the same conclusion is read off at , where the windows of step 1.1 give for both words.
The interpolation and its values at sample heights. Put for , a jointly continuous map by [F5] and step 1.1; for the collision equation with is equivalent, by the linearity of , the identities and , to the statement that is a positive multiple of . At the three strand positions of are , whose differences are negative multiples of , so no collision occurs for , and ; at the positions of are , whose differences are horizontal and nonzero while is vertical, so no collision occurs, and ; at the positions of are , whose differences are positive multiples of while , so no collision occurs, and for every .
Conclusion. By [F1] the bracketing is braid-isotopic to , and the reflection followed by the relabelling of and turns into , so is braid-isotopic to as well; step 1.2 identifies as a braid based at , and step 2.2 gives ; step 2.3 exhibits the explicit intermediate values of the deformation, and steps 2.1 and 1.1 record the numerical facts and behind its collision-freeness. Hence and, passing to isotopy classes in the group of [F2], . ∎
Remarks
- The numbers are the smallest case of the relation: with the three base points are on the horizontal axis, so the local picture of the lemma is the picture of three points spaced apart, and the whole isotopy happens inside the closed ball of radius around the middle point, well inside .
- The rotation is the geometric meaning of the relation: performing the three half twists on the outer pair and the middle pair alternately is the same as rotating the three-point configuration rigidly by the angle , and the point reflection in the middle point exchanges the two outer strands, which is why the two words have the same endpoint permutation .
Setwise endpoints do not make a braid pure
Statement refuted
Refuted claim: a geometric braid based at whose top endpoint set is returns every strand to its own starting point, that is for every ; in other words, the setwise endpoint condition of Geometric braids in the disc with setwise endpoints forces a braid to be pure.
The witness is the elementary half twist on two strands (The elementary geometric half twist, its support disc, and its opposite, Geometric braids in the disc with setwise endpoints): its top endpoint set is , exactly the base configuration, but its first strand starts at and ends at , and its second strand starts at and ends at , so no strand returns to its own starting point and the endpoint permutation of is the transposition of and , not the identity.
What is and is not claimed. What is refuted is only the implication "top endpoint set equal to each label returns to its own starting point". Nothing here asserts that some other braid fails to be pure, and nothing here computes any invariant beyond the endpoint permutation. The example is the definitional point recorded in the definition of the endpoint permutation: labels are transported continuously from the bottom, so a braid may permute them, and the setwise condition is exactly the condition that this permutation be defined. It also shows that the failure is not an artefact of the choice of representative: since is constant along braid isotopies (Stacking of geometric braids is a well-defined associative operation on isotopy classes), cannot be braid-isotopic to the trivial braid, whose endpoint permutation is the identity (The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism).
Facts & Assumptions
Given: The natural number , the base configuration with , , , and the elementary half twist based at .
A braid based at is a tuple of continuous maps with , and ; its endpoint permutation is the unique with , and a braid is called pure when this permutation is the identity; (Geometric braids in the disc with setwise endpoints, The finite symmetric group , one-line notation, and cycle notation, Intervals of : the nine order-convex forms, nondegeneracy, and length, Continuity of a map of topological spaces at a point and globally).
The half twist is , with and , ; is a braid based at and is the transposition of and (The elementary geometric half twist, its support disc, and its opposite, Geometric braids in the disc with setwise endpoints).
The endpoint permutation is constant along braid isotopies, so equal values of are necessary for two braids to be braid-isotopic; in particular the transposition of and differs from the identity permutation of , and the trivial braid has the identity endpoint permutation (Stacking of geometric braids is a well-defined associative operation on isotopy classes, Braid isotopy relative to the top and bottom endpoints, The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism, The finite symmetric group , one-line notation, and cycle notation).
Counterexample
The witness and its endpoint values. Take and ; by [F2] its strands are and , so , , and at the top while , since and , by [F2].
The setwise condition holds. The top endpoint set of is by step 1.1, so satisfies the hypothesis of the refuted claim; the endpoint permutation of is the unique with for , which by step 1.1 is the transposition , of [F2].
The pointwise conclusion fails. By step 1.1 the first strand ends at and the second strand ends at , since by [F1]; hence for both labels , so the conclusion of the refuted claim fails for this braid.
The failure is isotopy invariant. By step 2.1 the endpoint permutation of is the transposition of , which is not the identity permutation of , whereas the trivial braid has the identity endpoint permutation; by [F3] the endpoint permutation is constant along braid isotopies, so is not braid-isotopic to the trivial braid, and in particular it is not pure in the sense of [F1].
Conclusion. Steps 1.1, 2.1 and 2.2 exhibit a braid whose top endpoint set equals the base configuration while no strand returns to its own starting point, so the refuted claim is false; step 3.1 shows moreover that this braid is not braid-isotopic to the trivial braid. ∎
Remarks
- The distinction is exactly the one the definition records: the top matching of a braid is an arbitrary permutation of the labels, the setwise condition only says that this matching is defined at all, and the pure braids are the special case in which the matching is the identity.
- The witness is minimal: with two strands the only non-identity permutation is the transposition, and the half twist realises it with the smallest possible support, the disc containing exactly the two base points.
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 is a continuous family of injective parameterisations of arcs in whose endpoints and are held fixed at the bottom and top points of the base configuration throughout, then the images 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 and 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 , so that and the base configuration of Geometric braids in the disc with setwise endpoints is with , and the family of arc parameterisations , , defined by
For a braid based at is a continuous map with and , and its strand is the graph , which by construction meets each horizontal slice , , in exactly one point; the trivial braid has the constant strand , whose graph is , and a braid isotopy from to is a family of braids depending jointly continuously on , with each slice a braid (Geometric braids in the disc with setwise endpoints, Braid isotopy relative to the top and bottom endpoints, Intervals of : the nine order-convex forms, nondegeneracy, and length).
The closed unit disc is with interior ; the set carries the product topology, and its points are written as (Euclidean spheres and closed balls as subspaces of , The product set 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).
The functions and are continuous, being piecewise linear with continuous gluing, and sums, products and composites of continuous maps are continuous; continuity of a function on or on follows from continuity on the finitely many closed pieces , and , , (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 : the nine order-convex forms, nondegeneracy, and length).
Counterexample
The family is jointly continuous with the prescribed fixed endpoints. By [F3] the maps and are continuous, hence is continuous by [F3]; at one has , so for every , and at one has and , so for every ; thus the endpoints of the parameterised arcs are fixed at the bottom and top points of .
Every slice lies in . For every one has , and takes the values , , , , with for all ; hence the spatial coordinate satisfies , so each spatial point lies in ; and the height lies in , because for gives there, while for gives there.
Each slice is a simple arc. Let and suppose ; comparing the spatial coordinates gives and comparing the heights gives , so ; hence every is injective, and its image is a simple arc with the endpoints and .
The middle slice is not the strand of a braid. At one has , and the two parameters and are distinct while , give equal heights and and spatial coordinates and ; hence and are two distinct points of in the same horizontal slice .
The boundary arcs are braids. For one has , so ; the image is exactly the strand of the trivial braid of [F1], hence both boundary slices are geometric braids based at and the hypothesis of the refuted claim is satisfied.
Conclusion. The family satisfies the hypotheses of the refuted claim by steps 1.1, 1.2, 2.1 and 3.1, but its slice at meets the horizontal slice at height in two distinct points by step 2.2, whereas the strand of a braid based at meets each horizontal slice in exactly one point by [F1]; since a reparametrisation does not change the image , 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. ∎
Remarks
- At the height function is on , constant on , and on . This horizontal shelf gives many distinct points at height ; 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 .
- 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.
Sources
- Juan Gonzalez-Meneses, Basic results on braid groups, sections 1.2-1.3, printed pp. 4-6
- Joan S. Birman and Tara E. Brendle, Braids: A Survey, section 1.2, author manuscript pp. 5-6
- Juan Gonzalez-Meneses, Basic results on braid groups, sections 1.5 and 3.2, printed pp. 7-8 and 23-26
- Juan Gonzalez-Meneses, Basic results on braid groups, sections 1.2-1.3, printed pp. 4-5
- Joan S. Birman and Tara E. Brendle, Braids: A Survey, section 1.1, author manuscript pp. 3-5