Prime and Semi-prime Algebras
Definition
We call algebra prime if for any such that , either or .
An ideal is called prime if is prime.
Definition
Let be an algebra. Denote the prime radical of by .
Definition
We call algebra semi-prime if and , then .
An ideal is called semi-prime if is semi-prime.
Characterization via m-sequences
Definition
A sequence of elements is called -sequence if . We say that element annihilates -sequence if any -sequence started with contains zero, i.e. any -sequence which contains also contains .
Lemma
Let be an element which annihilates all -sequence, then belongs to all semi-prime ideals of .
\begin{proof}
Assume that is an element which annihilates all -sequence, and there exists semi-prime ideal such that .
If , then by semi-prime, there is and so , which is impossible.
Hence .
Then there exists .
Repeat this procedure, then we build , which is a -sequence and does not contain , leading to a contradiction.
\end{proof}
Theorem
.
\begin{proof}
Let .
By ^4a83a1, .
To show that , it is enough to prove that if , then there exists prime ideal such that . As , there exists a -sequence with . Define . Notice that is a inductive set, as for any , . Thus contains a maximal ideal with .
Next we show that is prime. Let , and suppose . WLOG we may suppose that and (if necessary substitute and ). Then maximality of implies that there exists and with .
Suppose .
Since and then , leading to a contradiction.
Therefore, is a prime ideal and so the proof is complete.
\end{proof}
Structure of Semi-prime Algebras
Corollary
is the minimal semi-prime ideal. Furthermore, if is semi-prime, then .
Exercise. Show that .
\begin{proof}
By ^4a83a1 and ^34q5nm, we know is contained in all semi-prime ideals.
Now we prove that is semi-prime.
For any ideal such that , there is for all prime ideals and so .
It follows that and so is semi-prime.
It remains to show that if is semi-prime, then .
Otherwise, assume that there exists non-zero .
Take and .
Since is semi-prime, yields that and so there exists non-zero .
Repeat this procedure, then does not annihilate -sequence, which is impossible.
Therefore, .
\end{proof}
Proposition
An algebra is semi-prime iff is subdirect product of prime algebras.
\begin{proof}
Assume that is semi-prime.
Then by ^da3su8, .
Define , then and so is injective.
Since is prime, the algebra is prime.
Therefore, is a subdirect product of prime algebras.
Assume that is a subdirect product of prime algebras.
Hence , where are prime and so semi-prime.
If there exists such that , then and so .
It deduces that .
Now we finish the proof.
\end{proof}
Theorem
If is a homogeneous variety of algebras, with the property that locally nilpotent algebras is radical class. Define
then
Furthermore, we have .