MHB Integral Domains and Principal Ideal Domains (PIDs)

  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    domains Integral
Click For Summary
To prove that an integral domain R is a Principal Ideal Domain (PID), two conditions must be satisfied: any two non-zero elements must have a greatest common divisor (gcd) expressible as a linear combination of those elements, and a sequence of non-zero elements that divides each subsequent element must stabilize at a unit times a particular element. The proof begins by considering an ideal J in R and selecting an element a1 from J. If J is not already generated by a1, a second element b1 is chosen from J that is not in the ideal generated by a1, allowing the gcd a2 to be formed. This process continues, generating a sequence of elements whose ideals must eventually stabilize, leveraging the second condition to show that J is indeed a principal ideal.
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 am studying the mathematical formalism behind non-commutative geometry approach to quantum gravity. I was reading about Hopf algebras and their Drinfeld twist with a specific example of the Moyal-Weyl twist defined as F=exp(-iλ/2θ^(μν)∂_μ⊗∂_ν) where λ is a constant parametar and θ antisymmetric constant tensor. {∂_μ} is the basis of the tangent vector space over the underlying spacetime Now, from my understanding the enveloping algebra which appears in the definition of the Hopf algebra...

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K