MHB Rings Generated by Elements - Lovett, Example 5.2.1 .... ....

Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading Stephen Lovett's book, "Abstract Algebra: Structures and Applications" and am currently focused on Chapter 5 ...

I need some help with Example 5.2.1 in Section 5.2: Rings Generated by Elements ...
View attachment 6407
In the Introduction to Section 5.2.1 (see text above) Lovett writes:

" ... ... $$R$$ denotes the smallest (by inclusion) subring of $$A$$ that contains both $$R$$ and $$S$$ ... ... "Then, a bit later, in Example 5.2.1 concerning the ring $$\mathbb{Z} [ \frac{1}{2} ]$$ Lovett writes:" ... ... It is not hard to show that the set$$\{ \frac{k}{ 2^n} \ | \ k.n \in \mathbb{Z} \}$$is a subring of $$\mathbb{Q}$$. Hence, this set is precisely the ring $$\mathbb{Z} [ \frac{1}{2} ]$$ ... ... ... "BUT ...

How has Lovett actually shown that the set $$\{ \frac{k}{ 2^n} \ | \ k,n \in \mathbb{Z} \}$$ as a subring of $$\mathbb{Q}$$ is actually (precisely in Lovett's words) the ring $$\mathbb{Z} [ \frac{1}{2} ]$$ ... ... ?

... ... according to his introduction which I quoted Lovett says that the ring $$\mathbb{Z} [ \frac{1}{2} ]$$ is the smallest (by inclusion) subring of $$\mathbb{Q}$$ that contains $$\mathbb{Z}$$ and $$\frac{1}{2}$$ ... ...Can someone please explain to me exactly how Lovett has demonstrated this ... ...

... and ... if Lovett has not clearly proved this can someone please demonstrate a proof ...Just one further clarification ... is Lovett here dealing with ring extensions ... ... ?

Hope someone can help ...

Peter
 
Physics news on Phys.org
Let R be any subring of the rationals Q that contains both 1/2 and the integers. Let n be any positive integer; induct on n to show ${1\over 2^n}\in R$. (Inductive step: ${1\over 2^n}\in R$ implies ${1\over 2}{1\over 2^n}\in R$ since R is closed under products. Also if n is any non-positive integer, ${1\over 2^n}=2^{-n}$ is an integer and so belongs to R. Again since R is closed under products, $k{1\over 2^n}\in R$. So the given subring is a subset of R.
 
johng said:
Let R be any subring of the rationals Q that contains both 1/2 and the integers. Let n be any positive integer; induct on n to show ${1\over 2^n}\in R$. (Inductive step: ${1\over 2^n}\in R$ implies ${1\over 2}{1\over 2^n}\in R$ since R is closed under products. Also if n is any non-positive integer, ${1\over 2^n}=2^{-n}$ is an integer and so belongs to R. Again since R is closed under products, $k{1\over 2^n}\in R$. So the given subring is a subset of R.
Thanks for the help johng ...

But i am still a bit puzzled ... I think we have to show that $$\{ \frac{k}{ 2^n} \ | \ k.n \in \mathbb{Z} \}$$ is actually the smallest subring of $$\mathbb{Q}$$ that contains both $$\frac{1}{2}$$ and $$\mathbb{Z}$$ ... ... thus making it equal to or identified with $$\mathbb{Z} [ \frac{1}{2} ]$$ ... ...

How do we accomplish this explicitly and rigorously ...

Can you help further ...

Peter
 
You have to understand what is meant by the smallest element of a partially ordered set S. This is an element m of S such that $m\leq s$ for any $s\in S$. For example let S be the set of positive even integers ordered by $\leq$. Then 2 is the smallest element of S. How do you prove this?

Let s be any positive even integer. Then s=2q for some $q\geq 1$, and so $2\leq 2q=s$.

Then the above applies directly to the partially ordered set S of subrings of Q that contain 1/2 and the integers (the order on S is $\subseteq$). In my previous post, I said let R be any subring that contains 1/2 and the integers; i.e. let R be any element of S. I proved
$$\{{k\over 2^n}\,: k,n\in Z\}\subseteq R\}$$
 
Suppose \{\frac{k}{2^n}|k,n\in Z\} were not the smallest ring containing \frac{1}{2} and all integers. That is, there exist some ring, S, that is smaller. Then there must be some integers, k and n, such that \frac{k}{2^n} that is not in S. But, as johng showed, since \frac{1}{2} is in the set, by the multiplication is closed, and induction on n, \frac{1}{2^n} is in the set. And then, since k is an integer \frac{k}{2^n} is in the set, contradicting the statement that \frac{k}{2^n} is not in the set.
 
Last edited by a moderator:
HallsofIvy said:
Suppose \{\frac{k}{2^n}|k,n\in Z\} were not the smallest ring containing \frac{1}{2} and all integers. That is that, the exist some ring, S, that is smaller. Then there must be some integers, k and n, such that \frac{k}{2^n} that is not in S. But, as johng showed, since \frac{1}{2} is in the set, by the multiplication is closed, and induction on n, \frac{1}{2^n} is in the set. And then, since multiplication is closed and the integer k is closed, \frac{k}{2^n} is in the set, contradicting the statement that \frac{k}{2^n} is not in the set.
Well! ... that is a thoroughly convincing proof!

Thanks HallsofIvy ... really helpful ...

Peter
 
##\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