Prove Beta is an isomorphism of groups

SqrachMasda
Messages
42
Reaction score
0
i can't grasp these concepts, 1-to-1 and onto have always annoyed me.

here's 1 question, (i don't know how to post symbols so Beta ..)
(C is Complex numbers)
Let Beta:<C,+> -> <C,+> by Beta(a+bi)=a-bi (that is, the image is a +(-b)i).
Prove Beta is an isomorphism of groups.


i have a lot of these problems but maybe a one may help me understand the rest
 
Physics news on Phys.org
1-1: f(a+bi)=y
f(c+di)=y ->
f(a+bi)=f(c+di)->a-bi=c-di
->a=c & -bi=-di
->-b=-d->b=d as inverse is unique in integers under addition
so if f(x)=f(n)->x=n

onto: if y is an element of f(x) then y=a-bi for some a,b element of integers. But, c+di is an element of <C,+> for all c, d elements of integers. a, b are integers so a+bi is an element of <C,+> so the function is onto.

f(a+bi + c+di) = a-bi + c-di = f(a+bi) + f(c+di)...
 
thanks nnnnnnnn
 
don't forget that since f has an obvious inverse map , namely itself, then it must be a bijection, so it suffices to prove it is a homomorphism of additive groups.
 
##\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