MHB Proving r*r=q in S, a Ring with Identity

  • Thread starter Thread starter Achieve
  • Start date Start date
  • Tags Tags
    Identity Ring
Achieve
Messages
2
Reaction score
0
Let S={p,q,r} and S=(S,+,*) a ring with identity. Let p be the identity for + and q the identity for *. Use the equation
r*(r+q)=r*r+r*q to deduce that r*r=q.

Attempt of a solution
r*r=r*(r+q)- r*q
=r*r+r*q - r*q
But I'm not finding a clever way to deduce what is required.
Any type of help would be appreciated.
 
Physics news on Phys.org
Since S is closed under $+$, $r+q$ is either $p$, $q$, or $r$. If $r+q = q$ or $r+q = r$, then we get $r = p$ or $q = p$, which are both false. So $r+q = p$. Substituting $p$ for $r+q$ in the equation

$r * (r + q) = r * r + r * q$

gives

$r * p = r * r + r * q$.

Since $p$ is the additive identity in S, $r * p = p$; since $q$ is the multiplicative identity, $r * q = r$. Therefore

$p = r * r + r$.

Adding $q$ to both sides results in $q = r * r + p$, or, $q = r * r$.
 
"Since p is the additive identity in S, r∗p=p"
Can you please explain why. I understand if p is the identity then r+p=r but not that statement.
 
It's because $r * p = r * (p - p) = r * p - r * p = p$.
 
A basic fact about rings, is that under addition, they form an abelian group.

In this case, the abelian group has order 3, so either of $q$ or $r$ is a generator.

Since the map $a \mapsto -a$ is a group isomorphism for any abelian group (in particular it maps a generator to a generator), it must be the case that either:

$-q = r$, or $-q = q$.

If $-q = q$, then $q + q = p$, in which case $q$ has order 2. But 2 does not divide 3, so this violates Lagrange.

Therefore, $-q = r$, that is $r + q = p$.

So from our given equation:

$r\ast(r + q) = r\ast r + r\ast q$ we get:

$r \ast p = r\ast r + r \ast q$ (from the above)

$r \ast p = r\ast r + r$ (since $q$ is the multiplicative identity).

Now, to see that $r \ast p = p$, note that:

$r \ast p = r\ast(p + p)$ (since $p + p = p$, since it is the additive group identity)

$= r \ast p + r\ast p$. Hence:

$p = -(r \ast p) + r\ast p = -(r\ast p) + r\ast p + r\ast p = p + r\ast p = r\ast p$.

Thus (continuing our first argument):

$p = r\ast r + r$, so that $r\ast r$ is the additive inverse of $r = -q$.

So $r\ast r = -(-q) = q$ (in a group, the inverse of an inverse is the original element).

****************************

The above is tedious, and complicated by notation. In point of fact, there is no reason not to denote $p$ by $0$, and $q$ by $1$. Thus:

$S = \{0,1,r\}$.

It is plain to see we must have $r = 1 + 1$. Now we can just calculate:

$(1+1)(1+1) = (1+1)+(1+1) = [(1+1)+1] + 1 = 0 + 1 = 1$

because $(1+1)+1 = 3\cdot 1 = 0$ (the "3rd power" of 1, written additively) by Lagrange.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top