Under construction! Comments welcome.
Ask your questions writing me an email. If I find your questions interesting, I will publish them here with answers.
Clic on a question to see the answer on scroll down the page.
Of course, a lot! Some examples:
I have a lot of answers.
Disclaimer: Of course I do not think that the teaching goals can be achieved only with this topic or active learning methodologies. But I think there are possibilities that are still not fully exploited in schools and the movie and the workshops are a proposal to make more experimentations.
Braid isotopy is:
No! Although these movements do not change your physical object but only rotate it, we want to keep track of the direction in which the strands ‘flow‘ and the order in which they start.
This is more natural if you think of a braid made combing the hair: its ends are attached to the head and the braid ‘flows‘ downwards.
Have a look at 7:47 to 8:00.
There is an artistic reason: colors help distinguish the strands and give more pleasant images.
But the main reason is that colors give a straightforward way to find the permutation associated with the braid: if you fix an order of colors on the left (say, RYBG: red, yellow, blue, green, from the bottom strand to the top one), then the order of colors on the right side gives the permutation associated to the braid.
For example, the left braid in the picture has RYBG on the left and YBRG on the right, while the right braid has RYBG on the left and BRYG on the right.
If you replace letters by numbers, you get one of the common ways to denote a permutation: for the first braid
1 2 3 4
2 3 1 4
and for the second
1 2 3 4
3 1 2 4
Note that if you want to compare two braids, it is not enough to compare the order of the colors on just one side of both braids! Rather we have to compare how the color are mixed going from one side to the other. For example, the two braids in chapter 1, 9:12 are equal, as is shown there, even if the colors of the strands do not match.
Using colors to emphasize permutations is also used in chapter 2, 4:10, to define pure braids.
Colors help recognize the permutation associated to a braid: it gives a way to recognize each strand. By convention I chose an order for the strand colors on the left side, namely red, yellow, blue, green starting from the bottom.
Composition means stacking braids, so if the first braid has a nontrivial permutation, then the colors at the end of the first braid will not match with those at the beginning of the second braid.
In the resulting braid I want each strand to have its own color, following the convention. So the strands of the second braid which is composed have to change colors (unless the permutation associated to the first braid is the identity).
One way is the following: assign a number to each strand end on the left, starting from the bottom strand. Copy the same numbers to the right, putting each number in the position of the corresponding strand. As an example, consider the braid in the picture.
The associated permutation will be
1 2 3 4 5 6
4 1 3 5 6 2
Another way is to describe permutation by cycles. In this case, assign a number to each vertical strand position, starting from the bottom strand. Then follow the ‘braid flow’ and write the 2-cycle (a,a+1) whenever the strand in position a crosses the strand in position a+1. In the example above it would start with
Yes! To prove it, you have to check that:
I wanted to use product and not sum because I write braid composition in a multiplicative way; for example, I denote the trivial braid by 1 and the inverse of a braid A by A-1.
The set of real numbers is not a group under multiplication since 0 has no inverse.
So I could choose real non-zero numbers but I thought just positive numbers would be easier.
Alternatively, I could choose integer numbers with the operation of product. Then the neutral element would be 0, the inverse of A would be -A and summing A and B would be A+B. Associativity reads (A+B)+C = A+(B+C) and commutativity A+B = B+A. This is completely analogous but does not mimic the way I write braid composition as close as multiplication of real numbers does.
Is 0 really a number? Even if it stands for ‘nothing’? Even if n+0=n for any n?
Is 1 really a number? Even if n·1=n for any n?
Yes! And I would say that the braid with all strands parallel is the most important one because it permits to define inverses.
Seen from an empirical viewpoint, in the definition of braids we fix the endpoints and draw strands to connect them. Nothing prevents us to draw unbraided strands!
Because composition is not commutative, so it is not obvious that a left inverse is also a right inverse.
Everyone has their favorite way to introduce and explain concepts. My choice comes from the fact that almost everybody recalls from primary school that ‘the sum and the product are associative and commutative’ while almost nobody has a clear mental image of neutral element and inverses (maybe they seem too obvious concepts?). I want to connect what I am explaining to what people usually know already. This is the reason for my choice.
Because 4 is the least number of strands for which the braids are general: the group of braids with 4 strands has both kinds of relations (the braid relation and the commutativity of crossings involving distinct pairs of strands).
In fact, braids with two strands form a group which is isomorphic to the group of integers (each braid is characterized by the number of crossings counted with sign: see next question) and braids with three strands have no crossings involving distinct pairs of strands.
Wonderful! You can ask to find a very short way to describe a two-strands braid. In fact, you only need an integer number, counting how many times the left strand passes in front of the right one. If the left strand passes behind the right one, you will use negative numbers. And if It passes once in front and once behind, you can simplify... And what braid will have the number 0?
Said in another way, there is an isomorphism between the group of braids with two strands (where the operation is composition) and integers (where the operation is the sum).
However, this is not a general example about braids: here the composition is commutative, while in braid groups with more strands it is not.
The main reason is that this is the standard notation used by mathematicians. Using a letter with a number as a subscript is very practical: you can describe braids with any number of strands, because you only need to use natural numbers.
Also the notation for inverses is very clear: you can simplify σ1-1σ1 σ2 σ2-1 σ1-1 to get σ1-1.
Another possibility would have been to use A instead of σ1, a instead of σ1-1, B instead of σ2, b instead of σ2-1, and so on. In this way, the word baAbBBb could be simplified to b. But we could not describe braids with more than 27 strands since there are 26 latin letters!
However, both are multiplicative notations: composition is written as juxtaposition and the neutral element (the trivial braid) is denoted 1.
A different way is given by additive notation! For example, use 0 for the neutral element, +1 instead of σ1, -1 instead of σ1-1, +2 instead of σ2, -2 instead of σ2-1, and so on. In this way, a word of the form +2-1+1-2+2 could be simplified to +2. Note that we keep even + signs! Only 0 is allowed to carry no sign. And we simplify whenever we find a pair of subsequent signed symbols of the form +n-n or -n+n.
Another reason for my choice of multiplicative notation is that with the additive one we would be tempted to forget + signs and to sum the numbers in a word, both of which are not allowed in our context.
We do not know whether a sequence exists, and if it exists how long it is.
Sure we could sistematically try all the possible sequences of moves, starting from the shortest ones and increasing the length.
But if we find none, at which point should we stop?
How can we know whether the sequence we were looking for was just a bit longer than the ones we tried?
In other words, the sistematic procedure may give an answer “Yes, a sequence exists” or give no answer at all.
I will answer as soon as possible.
This is just a joke! It means it is not feasible to use such an algorithm in practice, because it would require a very long time to end.
It would be wonderful if we could! But we have not yet found a suitable operation which plays the role of braid composition.
To be honest, there is a meaningful operation, called connected sum, which allows to join two knots in a similar way as braids are composed.
The problem with it is that knots can not be inverted that is, given a knot A, there is no knot B such that the connected sum of A and B produce the trivial knot, a knot with no crossings!
In other words, the set of knots with this operation is not a group.
A good account can be found on the site of the The MacTutor History of Mathematics.
I will answer as soon as possible.
I will answer as soon as possible.
I will answer as soon as possible.
I will answer as soon as possible.