Findng a group between two groups

  • Thread starter Thread starter anugrah
  • Start date Start date
  • Tags Tags
    Group Groups
anugrah
Messages
2
Reaction score
0
we all know that set of rationals i a subgroup of set of reals. my question is whether there exsts a group between these tw groups. f yes what it can be? and if no, how to prve the non-existence?
 
Physics news on Phys.org
There exist uncountably many. (We assume that you mean addition as the group law.)
 
It will help your intuition if you notice that the reals form a 'very large' vector space over the rationals.
 
sorry, forgot to mention that the group law is multiplication. I wanted everything with respect to multiplication. And if there exists a subgroup between these two groups (even with respect to addition ) please give an example of the same.
 
anugrah said:
sorry, forgot to mention that the group law is multiplication. I wanted everything with respect to multiplication. And if there exists a subgroup between these two groups (even with respect to addition ) please give an example of the same.

Pick any irrational number k and consider the set Q'={qkn | q is a nonzero rational number, and n is an integer}

It is easy to show that this is a group under multiplication, and easy to show that the nonzero rationals are a subgroup of this group, but clearly since this group is countable it is proper subgroup of the reals.
 
anugrah said:
sorry, forgot to mention that the group law is multiplication.

The real numbers under multiplication are not a group.


I wanted everything with respect to multiplication. And if there exists a subgroup between these two groups (even with respect to addition ) please give an example of the same.

It would be better if you tried to work it out yourself.
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
##\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...
Back
Top