prove that R* x R is a group under the operation * defined by (a,b) * (c,d) = (ac, bc + d)
is it \((a, b)\circ (c,d)=(ac, bc+d)\) ?
and i guess we need to know what \(R^*\) means in this context i take it \(R\) is a ring?
R is all real numbers
R* is a multiplicative group of all real numbers
R* is the nonzero reals
i think the biggest challenge will be to find the inverse first figure out what the identity is
(a,b) * (c,d) = (ac, bc + d) (ac, bc + d) * (x,y) = (acx, bcx+dx+y) is this associative?
i hate checking associativity, it is a pain used to get away with saying "in inherits it from the original group" but not in this case
(c,d) * (x,y) = (cx, dx + y) (a,b) * (cx, dx + y) = (acx, bcx + dx+y) yay! its associable
whew
(a,b) * (x,y) = (a,b) is identity
now for the identity, solve \[(x,y)(c,d)=(c,d)\] for \((x,y)\) you get \[(x,y)(c,d)=(xc,yc+d)=(c,d)\implies xc=c\implies x=1\] and \[yc+d=d\implies y=0\]
identity is \((1,0)\) now for inverses
can we assume commutability in groups?
no
but we could check to see if it is commutative i guess hmmm
oh seems unlikely since it is not symmetric in the second coordinate
and identity elements needs to be unique, correct?
biggest job i think it to find \((a,b)^{-1}\)
yeah identity is always unique
doesnt it only have to be commutative for abelian groups?
commutative is the definition of abelian yes
i doubt this is commutative you still have to show it contains inverses
I mean from what you have already done, haven't you proved that is it a group?
no amistre showed it was associative i found the identity element you still have to show it contains inverses
and i guess you have to show it is closed under the operation too
(a,b)*(1,0) = (a1,b1+0) = (a,b) (1,0)*(a,b) = (1a, 0a + b) = (a,b)
since R*xR does not contain the (0,n) element, we would have to see of this is possible
well, since 0 is not a first element in any of the cases, its closes
guess this is a good time to review the axioms 1) set must be closed under the operation 2) the operation must be associative 3) there must exist and identity element \(e\) such that \(ex=xe=x\) for all \(x\in G\) 4) it must contain inverses, i.e. if \(x\in G\) there must exist an \(x^{-1}\) with \[x^{-1}x=xx^{-1}=e\]
we got 1 through 3, now need 4
(a,b)*(x,y) = (1,0) :)
since we got reals and no zero firsts, ax = 1 is possible
bx+y = 0 when x=-y/b is possible
hmm, for b not= 0 tho
theres no reason why y=-bx is not possible tho
in fact it is \(y=-\frac{b}{a}\) i think
\[(a,b)*(\frac1a,-\frac ba)=(\frac aa,\frac ba-\frac ba)=(1,0)\]
sin ce a in R*, a not= 0
is that commutative? :)
\[(a,b)(x,y)=(ax,bx+y)=(1,0)\] \[ax=1\implies x=\frac{1}{a}\] \[bx+y=0\implies \frac{b}{a}+y=0\implies y=-\frac{b}{a}\] so inverse of \((a,b)\) is \[(a,b)^{-1}=(\frac{1}{a},-\frac{b}{a})\]
oh i am a little behind i see
must be the weather up there
the inverse as also communicable
still g od da mn cold!!
been nice here in florida :)
we had snow yesterday...
yeah will i will take to you in july when it is 102
lol, 102 is just a calm pleasant day :)
i appreciate all the help today! get excited for next week when I study for finals. ;)
well this was a fun exercise, time to do some work later all
my teacher gave me a real analysis and an abstract algebra book to read over the summer
I'm taking analysis 1 and 2 next year. get excited for that too
@urbanderivative i hope it is clear what you have to do to solve this write down the axioms check that it satisfies each one
@amistre64 what algebra book?
.... something old, prolly from when she was in college 20 years ago. i cant recall the title at the moment
so twenty years ago is old??
:) at todays ages, yes
if you can find a copy of "herstein" topics in algebra, i think that is still the gold standard, although i guess it is really really old
maybe from the 60's although how we call that "mid century"
or 'mad men era'
Join our real-time social learning platform and learn together with your friends!