What are the minimum requirements for compatibility with scalar multiplication that are needed to be an algebra? Do the conventions differ from author to author?
According to Wikipedia, compatibility with scalars is defined as $(ax)\cdot(by) = (ab)(x\cdot y)$, but my gut tells me that this isn't stringent enough. I'm reluctant to just dismiss the Wikipedia definition though because outright mistakes in Wikipedia are rare and odds are good I'm missing something obvious.
The wikipedia article in question is about algebras over fields, but I am interested in algebras over rings in general. Let rings be commutative and unital.
Let $k$ be the field $\mathbb{Z}/2\mathbb{Z}$, consider the algebra with elements taken from $\mathbb{Z}$. Call the algebra $A$.
By convention, I write scalar literals with an overline, i.e. $\overline{0}$ and $\overline{1}$.
Define multiplication as $\overline{0}(a) = 0$ and $\overline{1}(a) = a$.
I can think of $4$ reasonable properties that we might want an algebra over a ring to have. $A$ has three out of four.
- $r(a+b) = r(a) + r(b)$ is satisfied.
- $r(s(a)) = (rs)(a)$ is satisfied.
- $r(ab) = r(a)b = ar(b)$ is satisfied.
- $(r+s)(a) = r(a) + s(a)$ is not satisfied, e.g. $(\overline{1} + \overline{1})(2) = 0$, but $\overline{1}(2) + \overline{1}(2) = 4$
The failure of the last property makes $A$ an odd duck, but is it an algebra or not?