Consider a product αβ where
α=a1g1+⋯+amgm,g1<⋯<gm,ai=0 (1≤i≤m),β=b1h1+⋯+bnhn,h1<⋯<hn,bj=0 (1≤j≤n).
Choose i0,j0 such that gi0hj0 is least among {gihj}.
Then i0=1 (for otherwise g1<gi0⇒g1hj0<gi0hj0).
In particular, gi0hj0=gihj implies i=i0=1 and hence j=j0.
This shows that, in the product αβ, a1bj0g1hj0 cannot be “canceled out” by any other term, so αβ=0.
Thus, it has to be a domain, and for the J-semisimplicity of A (when G in non {1}) we are done since any domain is J-semisimple.
Comments