Useful nucleus said:
Another difference that I can think of, for complex numbers one can define division while for 2-dimensional vectors it is not customary to define division (as it does not have a geometric meaning). Similarly, multiplication of two complex yields a complex , while in vector calculus the scalar multiplication yields a real number (the other possibility is "cross product" which yields a vector but it is not commutative).
Also the Cauchy-Schwartz inequality for complex numbers is a bit different than its counterpart of 2D vectors.
These are examples, but I do not have a general statement.
Yes, there is a division for 2-d vectors (indeed, arbitrary-D vectors) which does have geometric meaning. It requires the geometric
product, which unifies the dot product and the wedge product (the latter is somewhat like the cross product, but more general).
tl;dr: Pictures would help, I know! If you want them, section 6.1 of
Geometric Algebra for Computer Science explains it very nicely. This is just my recounting from memory of that explanation.
"Division" means inversion, basically. If we write
<br />
x = u/v<br />
what we really mean is
<br />
xv = u.<br />
The product xv is the
geometric product; for vectors, this is:
<br />
\begin{align}<br />
xv &= x \cdot v &+& x \wedge v \\<br />
&\equiv a &+& B<br />
\end{align}<br />
In other words, it's a scalar a plus a bivector B (just like a complex number is a real number plus an imaginary number).
Now to the
geometric meaning.
We'll suppose we know v, a, and B. (In other words, we'll suppose we know v and xv.) And we want to solve for x.
The dot product part alone can't do it. Imagine we find a candidate solution x_0 so that x_0 \cdot v = a. The problem is that this solution is not unique. We can add any vector x_\perp (such that x_\perp \cdot v = 0), and (x_0 + x_\perp) \cdot v will also be a.
In other words, you can't have a division for the dot product. Your candidate solutions form an (n-1)-dimensional subspace (in familiar 3D, this is just a plane). This plane is orthogonal to v.
The wedge product part alone can't do it either. Imagine we find a candidate solution x_0 so that x_0 \wedge v = B. The problem is that this solution is not unique. We can add any multiple of v to x_0, and (x_0 + \lambda v) \wedge v will also be B.
In other words, you can't have a division for the wedge product. Your candidate solutions form a line (parallel to v).
But the plane from your failed dot product division, and the line from your failed wedge product division, meet at a single point. This point is the unique vector x which satisfies x \cdot v = a and x \wedge v = B simultaneously.
So the geometric product of vectors
does have a division, and it
is geometrically meaningful.