MHB Integral Domains and Principal Ideal Domains (PIDs)

  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    domains Integral
Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
Dummit and Foote, Section 8.2 (Principal Ideal Domains (PIDs) ) - Exercise 4, page 282.

Let R be an integral domain.

Prove that if the following two conditions hold then R is a Principal Ideal Domain:

(i) any two non-zero elements a and b in R have a greatest common divisor which can be written in the form ra + sb for some r, s \in R and

(ii) if a_1, a_2, a_3, ... are non-zero elements of R such that a_{i+1} | a_i for all i, then there is a positive integer N such that a_n is a unit times a_N for all n \ge N

I am somewhat overwhelmed by this exercise. I would appreciate it if someone could help me get started and indicate a strategy for formulating a proof.

Peter
 
Last edited:
Physics news on Phys.org
Peter said:
Dummit and Foote, Section 8.2 (Principal Ideal Domains (PIDs) ) - Exercise 4, page 282.

Let R be an integral domain.

Prove that if the following two conditions hold then R is a Principal Ideal Domain:

(i) any two non-zero elements a and b in R have a greatest common divisor which can be written in the form ra + sb for some r, s \in R and

(ii) if a_1, a_2, a_3, ... are non-zero elements of R such that a_{i+1} | a_i for all i, then there is a positive integer N such that a_n is a unit times a_N for all n \ge N

I am somewhat overwhelmed by this exercise. I would appreciate it if someone could help me get started and indicate a strategy for formulating a proof.
Start like this. Let $J$ be an ideal in $R$. We want to show that $J$ is a principal ideal. Choose $a_1\in J$. If $J = \langle a_1\rangle$ (the principal ideal generated by $a_1$), then $J$ is a principal ideal, and we are done. If not, choose $b_1\in J - \langle a_1\rangle$, and let $a_2 = \text{gcd}(a_1,b_1)\in J$. If $J = \langle a_2\rangle$, then $J$ is a principal ideal, and we are done. If not, ... .

Do you see how to continue? The idea should be to use (ii) to show that you can build up a sequence so that $J = \langle a_N\rangle$.
 
Opalg said:
Start like this. Let $J$ be an ideal in $R$. We want to show that $J$ is a principal ideal. Choose $a_1\in J$. If $J = \langle a_1\rangle$ (the principal ideal generated by $a_1$), then $J$ is a principal ideal, and we are done. If not, choose $b_1\in J - \langle a_1\rangle$, and let $a_2 = \text{gcd}(a_1,b_1)\in J$. If $J = \langle a_2\rangle$, then $J$ is a principal ideal, and we are done. If not, ... .

Do you see how to continue? The idea should be to use (ii) to show that you can build up a sequence so that $J = \langle a_N\rangle$.

=================================================================

Thanks Opalg ... the overall strategy for proving this is now clear but I do need some help on important aspects of the proof.

You write:

"Start like this. Let $J$ be an ideal in $R$. We want to show that $J$ is a principal ideal. Choose $a_1\in J$. If $J = \langle a_1\rangle$ (the principal ideal generated by $a_1$), then $J$ is a principal ideal, and we are done. ... ... "

I understand this since it is simple logic that something is the case or it is not - true and depends on nothing in the exercise conditions/givens.

Then you write:

"If not, choose $b_1\in J - \langle a_1\rangle$, and let $a_2 = \text{gcd}(a_1,b_1)\in J$. If $J = \langle a_2\rangle$, then $J$ is a principal ideal, and we are done. If not, ... . "When you say " choose $$ b_1\in J - \langle a_1\rangle $$ and let $$ a_2 = \text{gcd}(a_1,b_1)\in J $$ " ... ...

and then go on to say "if $$ J = \langle a_2\rangle $$ ... ... " ... ... I am assuming that there is some logical link between setting $$ a_2 = \text{gcd}(a_1,b_1) $$ and then making the statement " if $$ J = \langle a_2\rangle $$ ... ...

Can you clarify? Can you make the link between the gcd and the principal ideal clear?

Peter
 
Peter said:
=================================================================

Thanks Opalg ... the overall strategy for proving this is now clear but I do need some help on important aspects of the proof.

You write:

"Start like this. Let $J$ be an ideal in $R$. We want to show that $J$ is a principal ideal. Choose $a_1\in J$. If $J = \langle a_1\rangle$ (the principal ideal generated by $a_1$), then $J$ is a principal ideal, and we are done. ... ... "

I understand this since it is simple logic that something is the case or it is not - true and depends on nothing in the exercise conditions/givens.

Then you write:

"If not, choose $b_1\in J - \langle a_1\rangle$, and let $a_2 = \text{gcd}(a_1,b_1)\in J$. If $J = \langle a_2\rangle$, then $J$ is a principal ideal, and we are done. If not, ... . "When you say " choose $$ b_1\in J - \langle a_1\rangle $$ and let $$ a_2 = \text{gcd}(a_1,b_1)\in J $$ " ... ...

and then go on to say "if $$ J = \langle a_2\rangle $$ ... ... " ... ... I am assuming that there is some logical link between setting $$ a_2 = \text{gcd}(a_1,b_1) $$ and then making the statement " if $$ J = \langle a_2\rangle $$ ... ...

Can you clarify? Can you make the link between the gcd and the principal ideal clear?

Peter
The underlying idea is that you want to find an element that generates the whole of $J$. If you start with a random element $a_1\in J$, then $\langle a_1\rangle$ will be contained in $J$ but it might not be the whole of $J$. So you want to find an element $a_2\in J$ that generates a larger part of $J$. If you take $a_2 = \text{gcd}(a_1,b_1)$ then firstly $a_2\in J$ (by condition (i), because $a_2$ is a linear combination of $a_1$ and $b_1$), and hence $\langle a_2\rangle\subseteq J$; secondly, $\langle a_2\rangle$ contains $\langle a_1\rangle$ (because $a_1$ is a multiple of $a_2$); and thirdly, $\langle a_2\rangle$ is strictly larger than $\langle a_1\rangle$ (because $b_1$ is a multiple of $a_2$ and therefore $b_1\in\langle a_2\rangle$, whereas $b_1$ was not in $\langle a_1\rangle$).

Continuing in that way, you build up an increasing nest of sub-ideals of $J$, and then you need to use condition (ii) to show that this process cannot continue indefinitely without eventually encompassing the whole of $J$.
 
Opalg said:
The underlying idea is that you want to find an element that generates the whole of $J$. If you start with a random element $a_1\in J$, then $\langle a_1\rangle$ will be contained in $J$ but it might not be the whole of $J$. So you want to find an element $a_2\in J$ that generates a larger part of $J$. If you take $a_2 = \text{gcd}(a_1,b_1)$ then firstly $a_2\in J$ (by condition (i), because $a_2$ is a linear combination of $a_1$ and $b_1$), and hence $\langle a_2\rangle\subseteq J$; secondly, $\langle a_2\rangle$ contains $\langle a_1\rangle$ (because $a_1$ is a multiple of $a_2$); and thirdly, $\langle a_2\rangle$ is strictly larger than $\langle a_1\rangle$ (because $b_1$ is a multiple of $a_2$ and therefore $b_1\in\langle a_2\rangle$, whereas $b_1$ was not in $\langle a_1\rangle$).

Continuing in that way, you build up an increasing nest of sub-ideals of $J$, and then you need to use condition (ii) to show that this process cannot continue indefinitely without eventually encompassing the whole of $J$.

Thanks Opalg

Your post was extremely helpfulPeter
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
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