Question
Assume a vector space $V$ and a binary operation $*$ that satisfies for all $u, v, w \in V$:
- $u * v \in V,$
- $u * v = - v * u\,,$
- $u * (v * w) = (u * v) * w.$
Can this operation satisfy the Jacobi identity
$u * (v * w) + w * (u * v) + v * (w * u) = 0 \quad \forall u, v, w \in V$?
I believe the answer is no, but I cannot prove it.
Attempted solution
Assuming the Jacobi identity holds, I tried to arrive at a contradiction.
\begin{align} 0 &= \phantom{-} u * (v * w) + w * (u * v) + v * (w * u) \\ &= -(v * w) * u + w * (u * v) + v * (w * u) \\ &= -v * (w * u) + w * (u * v) + v * (w * u) \\ &= w * (u * v). \end{align}
I.e., we have $w * (u * v) = 0$ for all $u, v, w \in V$. This doesn't look like a contradiction to me. It is as far as I could get.
Maybe a different approach makes more sense?
You have lots of possibilities. In what follows I will assume that you want to product to be bilinear.
What you proved is that a product of $3$ elements is always zero. Let us write $U\subset V$ the subspace of elements $u\in V$ such that $u*v=0$ for all $v\in V$. Then for any $u,v\in V$, $u*v\in U$.
Conversely, to define a product which satisfies your conditions, choose a subspace $U\subset V$, and a basis $(e_1,\dots,e_n)$ such that $(e_1,\dots,e_r)$ is a basis of $U$. You can then define the product by $$ e_i*e_j = \sum_{k=1}^r a_{i,j,k}e_k$$ for all $1\leqslant i,j\leqslant n$ with the only conditions that $a_{i,j,k}=-a_{j,i,k}$, and $a_{i,j,k}=0$ if $i\leqslant r$.
This means you have to choose (freely) some scalars $a_{i,j,k}$ for $r<i<j\leqslant n$ and $1\leqslant k\leqslant r$ (if the charateristic of the base field is $2$, you also have to include $i=j$).