[Math] Is every axiom in the definition of a vector space necessary

abstract-algebraaxiomsdefinitionvector-spaces

Definition: A vector space over a field $K$ consists of a set $V$ and two binary operations $+: V \times V \to V$ and $\cdot: K \times V \to V$ satisfying the following axioms:

  1. Commutativity of $+$.
  2. Associativity of $+$.
  3. Existence of an identity element $\mathbf{0}$ for $+$.
  4. Existence of inverses for $+$.
  5. Compatibility of $\cdot$ with multiplication in $K$.
  6. Distributivity of $\cdot$ over $+$.
  7. Distributivity of $\cdot$ over addition in $K$.
  8. $1_K$ is a left identity of $\cdot$.

Question: Are all seven of the previous axioms necessary (in the sense that weakening any one of them permits a structure which is not a vector space)? If not, which can be weakened (or removed)?


EDIT: user7530 has quite cleverly shown that the commutativity of $+$ can be derived from axioms 2-8. Supposing we throw this out, can the remaining axioms all be proven necessary?


EDIT 2: It was pointed out that axiom 3 cannot simply be thrown out, as the definition of an inverse in axiom 4 depends on the existence of $\mathbf{0}$. What if we tweak the statement of axiom 4 to axiom 4': "For every $x \in V$, there exists $y \in V$ such that $(x+y)+x = x$ and $(y+x)+y = y$"? Is this weakened version equivalent to the original, and if so, does it allow the removal of axiom 3?

Best Answer

I think they are redundant after all! Here's a proof that axiom 1 is redundant. Let $a,b\in V$, and consider $(1+1)\cdot (a+b)$. By axiom 7 and 8, this is equal to $(a+b)+(a+b)$; on the other hand by axiom 6 it is $(1+1)\cdot a + (1+1)\cdot b$, or $(a+a)+(b+b)$ by axiom 7 and 8. We can then use axioms 2, 3, 4 to show that \begin{align*} a^{-1} + (a+b) + (a+b) + b^{-1} &= a^{-1} + (a+a) + (b+b) + b^{-1}\\ b + a &= a + b \end{align*} and $V$ is Abelian.


Necessity of some of the other axioms:

4: Take $V=[0,\infty)$ under multiplication, and $K=\mathbb{R}$, with $z\cdot x \mapsto \begin{cases} x^z, & x\neq 0\\0, &x=0.\end{cases}$

5: Consider $K=\mathbb{C}$, $V=\mathbb{R}$ with $z\cdot x = \Re(z)x$.

6: Necessary once you toss out commutativity. Take $K=F_3$, and $V$ the Heisenberg group over $F_3$, with $z\cdot x = x^z$. Since all elements of $V$ have order dividing 3, axiom 7 is satisfied, but $$\left(\left[\begin{array}{ccc}1 & 0 &0\\0 & 1 & 1\\0 & 0& 1\end{array}\right]\left[\begin{array}{ccc}1 & 1 & 0\\0 & 1 & 0\\0 & 0 &1\end{array}\right]\right)^2 \neq \left[\begin{array}{ccc}1 & 0 &0\\0 & 1 & 1\\0 & 0& 1\end{array}\right]^2\left[\begin{array}{ccc}1 & 1 & 0\\0 & 1 & 0\\0 & 0 &1\end{array}\right]^2.$$

7: Take $K=\mathbb{C}$, $V=\mathbb{R}$, and $z\cdot x = |z|x$.

8: See comment by Jyrki below.