MHB Why Does p|aby' in Theorem 7.2.14?

Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading The Basics of Abstract Algebra by Paul E. Bland ...

I am focused on Section 7.2 Euclidean, Principal Ideal, Unique Factorization Domains ... ...

I need help with the proof of Theorem 7.2.14 ... ... Theorem 7.2.14 and its proof reads as follows:
View attachment 8275In the above proof by Bland we read the following:

"... ... But then $$a = apx' + aby' $$, so $$p|apx'$$ and $$p|aby'$$. ... ... "Can someone please explain exactly how/why $$p|aby'$$... ... ?

Peter
 
Physics news on Phys.org
Hi Peter,

That comes from the assumption that $p\mid ab$ (on line 3 of the proof).
 
castor28 said:
Hi Peter,

That comes from the assumption that $p\mid ab$ (on line 3 of the proof).
Thanks castor28 ...

Peter
 
This is a very important theorem in the study of rings. There are some definitions not mentioned in the OP and it is worth filling them in.

Let $D$ be an integral domain. An element $x\in D$, $x\ne0,e$, is said to be prime iff for any elements $a,b\in D$, if $x\mid ab$ then either $x\mid a$ or $x\mid b$. It is irreducible iff whenever $x=ab$ then either $a$ or $b$ is a unit (divisor of the multiplicative identity $e$). It easily follows from these definitions that in any domain $D$ every prime element is irreducible. The theorem says that when $D$ is a PID, the converse is also true.

This may not be how we are used to thinking of primes when dealing with the integers $\mathbb Z$. When we say that an integer $p\ne0,1$ is prime, we tend to think of $p$ as having no divisors other than $\pm1,$ and $\pm p$. Furthermore, $\mathbb Z$ is an ordered ring (i.e. has positive and negative elements) and so saying that $p\in\mathbb Z$ is prime usually means $p>1$ and has no factors other than $1$ and $p$. Strictly speaking, this is only thinking of $p$ as an irreducible rather than prime. However, as $\mathbb Z$ is a PID, the two definitions coincide and so the distinction is immaterial.

The distinction in the two definitions becomes important in the study of ideals and UFDs (unique-factorization domains) in algebraic-number theory. This branch of mathematics was initially developed to tackle Fermat’s last theorem: that the equation $x^n+y^n=z^n$ has no nonzero integer solutions in $x,y,z$ if $n$ is an integer greater than 2. The theory culminated in Kummer’s proof that the result holds if $n$ is a regular prime – which was the furthest the theory could go. The general proof continued to elude mathematicians until 1995, when Andrew Wiles succeeded in proving a special case of the Taniyama–Shimura conjecture relating elliptic curves and modular forms.
 
Last edited:
Olinguito said:
This is a very important theorem in the study of rings. There are some definitions not mentioned in the OP and it is worth filling them in.

Let $D$ be an integral domain. An element $x\in D$, $x\ne0,e$, is said to be prime iff for any elements $a,b\in D$, if $x\mid ab$ then either $x\mid a$ or $x\mid b$. It is irreducible iff whenever $x=ab$ then either $a$ or $b$ is a unit (divisor of the multiplicative identity $e$). It easily follows from these definitions that in any domain $D$ every prime element is irreducible. The theorem says that when $D$ is a PID, the converse is also true.

This may not be how we are used to thinking of primes when dealing with the integers $\mathbb Z$. When we say that an integer $p\ne0,1$ is prime, we tend to think of $p$ as having no divisors other than $\pm1,$ and $\pm p$. Furthermore, $\mathbb Z$ is an ordered ring (i.e. has positive and negative elements) and so saying that $p\in\mathbb Z$ is prime usually means $p>1$ and has no factors other than $1$ and $p$. Strictly speaking, this is only thinking of $p$ as an irreducible rather than prime. However, as $\mathbb Z$ is a PID, the two definitions coincide and so the distinction is immaterial.

The distinction in the two definitions becomes important in the study of ideals and UFDs (unique-factorization domains) in algebraic-number theory. This branch of mathematics was initially developed to tackle Fermat’s last theorem: that the equation $x^n+y^n=z^n$ has no nonzero integer solutions in $x,y,z$ if $n$ is an integer greater than 2. The theory culminated in Kummer’s proof that the result holds if $n$ is a regular prime – which was the furthest the theory could go. The general proof continued to elude mathematicians until 1995, when Andrew Wiles succeeded in proving a special case of the Taniyama–Shimura conjecture relating elliptic curves and modular forms.
Thanks Olinguito ...

The above is a most interesting and helpful post ...

Thanks again,

Peter
 
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