
What Makes a Number System?
Great, that's exactly the result the animation gave. This is just an example,
以下正文同步自 Hacker News 最新,版权归原站所有,已转换为易读排版。
Great, that's exactly the result the animation gave. This is just an example, but everything works the same for any 2 vectors.
And we're done. This is how complex numbers work. The key was that multiplication is linear: brackets distribute and constants can be factored out, just like with ordinary numbers. This reduces the problem to figuring out how to multiply the chosen basis vectors.
We will borrow the fact that rotating and stretching is always linear for any dimension of (V). Brackets can therefore always be expanded exactly as before. Writing the components of (\mathbf{a}) and (\mathbf{b}) in some basis ({\mathbf{e}_i}), we get
And finding an algebraic system of this sort again comes down to finding the multiplication table (\mathbf{e}_i \mathbf{e}_j).
There is one more important consequence of . Multiplication is differentiable with respect to (a_i) and (b_j) ! That's very good. We didn't know that before. Until now, we have only considered fixed transformations ( \mathbf{r}_0 \rightarrow \mathbf{q} \mathbf{r}_0 ), but a time dependant motion is also possible.
If ( \mathbf{q}(t) ) is differentiable, then so is ( \mathbf{r}(t) ) by . By choosing a continous path ( \mathbf{q}(t) ), we set every other point in the space on a continous path ( \mathbf{r}(t) ). Let's make that motion into a rotation. If we choose ( \mathbf{q}(t) ), so that ( |\mathbf{q}(t)| = 1 ) for all ( t ), then the uniform stretching factor will be (1), because ( \mathbf{1} ) is sent to ( \mathbf{q} ) and it's length doesn't change. Thus, all distances are preserved throughout the continuous transformation. Here's how it could look like in 3 dimensions.
Having the multiplication differentiable, we can look for velocities of the moving points:
The last equation gives (\dot{\mathbf{q}}(t)) an additional role. It has to generate the entire velocity field of the rotation by applying it to the initial position (\mathbf{r}_0). This is a very restrictive additional requirement put on multiplication. Consider what does it mean for the example case in 3 dimensions.
Every nontrivial rotation in three dimensional space has an axis. A line of points that have ( \mathbf{0} ) velocity. For any point ( \mathbf{w} = \mathbf{q}(t) \mathbf{w}_0 ) on this axis,
[ \mathbf{0} = \dot{\mathbf{q}}(t)\mathbf{w}_0 ]
Thus multiplication by (\dot{\mathbf{q}}) would have to send a nonzero vector to zero. But multiplication by (\dot{\mathbf{q}}) must also rotate and uniformly stretch space. Such a transformation is invertible and cannot send a nonzero vector to zero. The 2 requirements are incompatible. We have therefore reached a contradiction, showing that no such number system is possible in dim ( 3).
Starting from 1830s, mathematicians spent decades trying to find a satisfactory way to "multiply triples", but it never worked out. This is one way to understand why.
Return to the general case. The velocity is currently expressed in terms of the initial position (\mathbf{r}_0), rather than the current position, which is a little bit annoying. A simple work around will be choosing a path that passes through (\mathbf{1}). Let that happen at (t=0).
Here, multiplication by (\dot{\mathbf q}(0)=\mathbf u) gives the instantaneous velocity ( \mathbf{v}_0 = \mathbf{u} \mathbf{r}_0 ) from the position at (t=0). You can see this geometrically in the previous plot. Importantly, you can also see that (\mathbf u\perp\mathbf 1), since the velocity of a rotating point is always perpendicular to its position.
[ \mathbf{u}\mathbf{r}\perp\mathbf{r} \quad \forall \mathbf{r} ]
Now the pieces are starting to come together. What looked like a coincidence in the complex plane has become a requirement. Given any (\mathbf{u}\perp\mathbf{1}), we can always find a path ( \mathbf{q}(t) ) with ( | \mathbf{q}(t) | = 1, \mathbf{q}(0)=\mathbf{1}) and (\dot{\mathbf{q}}(0)=\mathbf{u},) which means that ( \mathbf{u} ) has to generate the velocities for this rotation, while still only rotating and stretching space.
To see what this implies in general, first restrict to (|\mathbf{u}|=1). Multiplication by (\mathbf{u}) is then a pure rotation, with no stretching. In two dimensions, this forces multiplication by (\mathbf{i}) to be a quarter turn. Applying it twice reverses every direction, ( \mathbf{i}(\mathbf{i}\mathbf{r})=-\mathbf{r} ).
Does the same conclusion hold in higher dimensions? Let's apply (\mathbf{u}) twice. The vectors (\mathbf{r}), (\mathbf{u}\mathbf{r}), and (\mathbf{u}(\mathbf{u}\mathbf{r})) satisfy [ \mathbf{r}\perp\mathbf{u}\mathbf{r}, \qquad \mathbf{u}\mathbf{r}\perp\mathbf{u}(\mathbf{u}\mathbf{r}). ] Since multiplication by (\mathbf{u}) preserves lengths, there is also [ |\mathbf{u}\mathbf{r}|=|\mathbf{r}|, \qquad |\mathbf{u}(\mathbf{u}\mathbf{r})|=|\mathbf{r}|. ] These three vectors span at most a three dimensional subspace, so the entire situation can be visualized in three dimensions, regardless of the dimension of V.
The configuration of the 3 vectors has to be similar to one of the shown possibilities. So which one is it ? To figure it out, we'll add a few more vectors. The key observation is that once we know where (\mathbf{u}\mathbf{r}) is sent after another mutliplication by (\mathbf{u}), we know how the entire plane spanned by (\mathbf{r}, \mathbf{u}\mathbf{r}) transforms. Suppose some vector has coordinates ( ( s_0, s_1 ) ) in the ( ( \mathbf{r}, \mathbf{ur} ) ) basis, then
[ \mathbf{u}( s_0 \mathbf{r} + s_1 \mathbf{u}\mathbf{r}) = s_0 \mathbf{u} \mathbf{r} + s_1 \mathbf{u} ( \mathbf{u}\mathbf{r}). ]
Is the condition (\mathbf{s} \perp \mathbf{u}\mathbf{s}) satisfied for all points of the plane ? Look at the case for ( \mathbf{s} = \mathbf{r} + \mathbf{u}\mathbf{r} ).
Only one point on the circle gives (\mathbf{u}(\mathbf{r} + \mathbf{u}\mathbf{r}) \perp \mathbf{r} + \mathbf{u}\mathbf{r}). That's the one where
[ \mathbf{u}(\mathbf{u}\mathbf{r}) = -\mathbf{r}. ]
Since nothing was assumed about ( \mathbf{r} ), this has to be true in general. Multiplying by ( \mathbf{u} ) must be some strange higher dimensional quarter rotation, which if applied twice makes it to a half rotation which is an inversion. This is a more general version of the famous ( \mathbf{i}^2 = -\mathbf{1} ). Equivalently, there is also a corresponding right multiplication identity ((\mathbf{r}\mathbf{u})\mathbf{u} = -\mathbf{r}).
As a last step, let us extend the idea for non unit imaginary vectors. Take any ( \mathbf{u} \perp \mathbf{1} ). First normalize the vector and then apply it twice to ( \mathbf{r} ).
[ \mathbf{u} ( \mathbf{u} \mathbf{r} ) = | \mathbf{u} |^2 \frac{\mathbf{u}}{| \mathbf{u} | } \left( \frac{\mathbf{u}}{| \mathbf{u} | } \mathbf{r} \right) ]
Now use the previously found relation
[ \mathbf{u} ( \mathbf{u} \mathbf{r} ) = - | \mathbf{u} |^2 \mathbf{r}. ]
Now we have all the tools needed to start looking for a basis ({\mathbf{e}_i}). Relation will help in finding the products ( \mathbf{e}_i \mathbf{e}_j ) and once those are known bilinearity can be used to multiply any 2 vectors in the space . The process works for all solutions (V) at once. First, take (\mathbf{1}) as the first basis vector, then pick any unit vector (\mathbf{i}) perpendicular to (\mathbf{1}). gives (\mathbf{i}^2 = -\mathbf{1}), so the multiplication table is exactly the same as for complex numbers.
In fact, the whole subspace behaves exactly like complex numbers. The product of any two of its vectors is given by . Anything you know about them has to work here too, like Euler's formula, for example.
If the dimension of ( V ) is ( n = 2 ), we're done and we've found the complex numbers. If (n > 2), then continue. Pick any unit vector (\mathbf{j}) perpendicular to the plane of (\mathbf{1}) and (\mathbf{i}) and add it to the basis.
Here comes the first challenge. What should be done about (\mathbf{i}\mathbf{j}) ? Some things are known about it immediately. It is orthogonal to (\mathbf{j}) because (\mathbf{i}\mathbf{r}) is orthogonal to all (\mathbf{r}). There's also a broader argument. If initially the set ({\mathbf{1}, \mathbf{i}, \mathbf{j}}) is pairwise orthogonal, then after a rotation it remains that way.
This means that (\mathbf{i}\mathbf{j}) is also orthogonal to (-\mathbf{1}) and (\mathbf{i}). The way this manifests itself in the multiplication table is that all vectors in a row are orthogonal to each other. The same goes for columns, by multiplication from the right.
So we have proved that (\mathbf{i}\mathbf{j}) is orthogonal to the whole subspace spanned by ({\mathbf{1}, \mathbf{i}, \mathbf{j}}). It is also a unit vector, since multiplication by (\mathbf{i}) preserves lengths. If the dimension is (n = 3), this is a contradiction. No nonzero vector is orthogonal to the whole space, and (n = 3) is excluded once again. If (n > 3), then (\mathbf{k} = \mathbf{i}\mathbf{j}) serves as the next basis vector, no matter where it happens to land in the rest of the space. The remaining entries follow from iteratively using . See how much of the table you can complete yourself before revealing the hints.
After working through everything, it was possible to fill in the whole table. Multiplying any two vectors in this subspace produces another vector in the same subspace. Hooray ! We've found the quaternions . If (n = 4), then this is the only possible solution. The work is not complete, though. We've proved that this is the only possibility, but not that it works. Those are separate questions. That last step would have been to show that this table is in agreement with our definition and everything is consistent. We'll leave that part out.
William Rowan Hamilton discovered the quaternions in 1843, but his route was quite a bit different from ours. He arrived at them mostly through geometric intuition and trial and error. The day after the discovery, Hamilton wrote to his friend John T. Graves about the ideas that had led him there. The letter was later published in the Philosophical Magazine . You might find it extra interesting after reading through our derivation.
In Graves response, he was impressed by the boldness of the idea but uneasy about how freely one could invent new imaginaries and give them new properties. In his reply, he said “If with your alchemy you can make three pounds of gold, why should you stop there?”
We ask ourselves the same question. Let's keep on going in the case where (n > 4). First, the number of basis vectors will grow quickly here, so it's better to number them ({\mathbf{i}, \mathbf{j}, \mathbf{k}} \to {\mathbf{e}_1, \mathbf{e}_2, \mathbf{e}_3}). The process is otherwise the same. Without loss of generality, add a new basis vector randomly and see where the products lead. In the following interactive table, it's possible to add new columns as they are needed. Either step through the solution or try to come up with it on your own (it's not going to be as easy this time).
It was possible to exclude dimensions (n = 5, 6) and (7), but then we hit a wall. The simple deduction rule used up until now doesn't complete the table anymore. The system could be underdetermined for all we know. Still, looking at what was possible to resolve, there are clear patterns suggesting which numbers should go where. For instance, all the occurrences of (\mathbf{e}_3) seem to form 2 diagonals.
Can this be justified ? Yes, but we need one more identity first. Take any two vectors (\mathbf{u}, \mathbf{v} \perp \mathbf{1}). Since (\mathbf{u}+\mathbf{v} \perp \mathbf{1}), we can apply .
正文由 探How 从来源站点 RSS 同步,内容未经改写;遇到排版缺失或需要图片、视频时请以原文为准。