MHB Prove Unique Identity in Ring: Solution Explained

  • Thread starter Thread starter Fantini
  • Start date Start date
  • Tags Tags
    Identity Ring
Fantini
Gold Member
MHB
Messages
267
Reaction score
0
Hello everybody. Here's the problem:

$$\text{Let } R \text{ be a ring with identity. Let }a \in R \text{ and suppose that exists an unique } a' \in R \text{ such that }a a' =1. \text{ Prove that } a'a=1.$$

My solution:

Since we have an identity, it has an inverse (itself), which means we can do

$$(a a')^{-1} = 1^{-1} = 1,$$

but $(a a')^{-1} = (a')^{-1} a^{-1} = 1$. From this, we can multiply once through the right by $a$ getting $(a')^{-1} a^{-1} a = 1 a = a$ and from that $(a')^{-1} = a$. Finally, multiplying through the left by $a'$ we get $a' (a')^{-1} = 1 = a' a$.

Am I correct? I am particularly uneasy about stating that $(aa')^{-1} = (a')^{-1} a^{-1}$.
 
Physics news on Phys.org
Fantini said:
Hello everybody. Here's the problem:

$$\text{Let } R \text{ be a ring with identity. Let }a \in R \text{ and suppose that exists an unique } a' \in R \text{ such that }a a' =1. \text{ Prove that } a'a=1.$$

My solution:

Since we have an identity, it has an inverse (itself), which means we can do

$$(a a')^{-1} = 1^{-1} = 1,$$

but $\color{red}{(a a')^{-1} = (a')^{-1} a^{-1}} = 1$. From this, we can multiply once through the right by $a$ getting $(a')^{-1} a^{-1} a = 1 a = a$ and from that $(a')^{-1} = a$. Finally, multiplying through the left by $a'$ we get $a' (a')^{-1} = 1 = a' a$.
Am I correct? I am particularly uneasy about stating that $(aa')^{-1} = (a')^{-1} a^{-1}$.
The relation coloured red is only true if the elements $a$ and $a'$ are invertible. By applying that relation here, you are essentially assuming what you are trying to prove. So you are quite right to be uneasy about it.

To prove this result, start by using the uniqueness of the right inverse $a'$ to show that $ax=0$ implies $x=0.$ Then use the relation $aa'a=a$ to deduce that $a'a-1=0.$
 
Thank you, Opalg. Clarifying something: to prove that $ax=0$ implies $x=0$ would it suffice to multiply by $a'$ through the middle? This means $a \cdot (a') \cdot x = 1 \cdot x = x = 0$. If this step is correct, the problem is done.
 
no, you can't just "multiply through the middle".

here is what you CAN do:

ax = 0

ax + 1 = 1

ax + aa' = 1

a(x + a') = 1

now use the uniqueness of a' as a right-inverse.
 
You can multiply both sides of an equation on the left, and you can multiply both sides of an equation on the right, but multiplying "through the middle" is not a well-defined concept. To see why not, suppose that $a$ and $b$ are elements in a ring with identity $1$. Then $1a = a1.$ If you could multiply both sides of that equation "in the middle" by $b$ then you would get $1ba = ab1$, so that $ba=ab.$ That would "prove" that every ring is commutative, which certainly is not the case.
 
##\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...

Similar threads

Back
Top