MHB Is Gauss' Lemma the Key to Non-UFDs in Polynomial Rings?

  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    Polynomial Rings
Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
Exercise 1, Section 9.3 in Dummit and Foote, Abstract Algebra, reads as follows:

Let R be an integral domain with quotient field F and let $$ p(x) \in R[x] $$ be monic. Suppose p(x) factors non-trivially as a product of monic polynomials in F[x], say $$ p(x) = a(x)b(x) $$, and that $$ a(x) \notin R[x] $$. Prove that R is not a unique factorization domain. Deduce that $$ \mathbb{Z}[2\sqrt{2}$$ is not a unique factorization domain.
=======================================================================================

I found a proof on Project Crazy Project which reads as follows:

Suppose to the contrary that R is a unique factorization domain. By Gauss’ Lemma, there exist $$ r, s \in F $$ such that $$ ra(x), sb(x) \in R[x] $$and $$ (ra(x))(sb(x)) = p(x) $$. Since p(x), a(x) and b(x) are monic, comparing leading terms we see that rs = 1. Moreover, since a(x) is monic and $$ra(x) \in R[x] $$, we have $$ r \in R $$. Similarly, $$s \in R $$, and thus $$ r \in R $$is a unit. But then $$ a(x) \in R $$, a contradiction. So R cannot be a unique factorization domain.

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

Question (1)

Consider the following statement in the Project Crazy Project Proof:

"Moreover, since a(x) is monic and $$ ra(x) \in R[x] $$, we have $$r \in R $$."

My reasoning regarding this statement is as follows:

Consider a(x) = x^n + a_{n-1}x^{n-1} + ... ... + a_1x + a_0 ... ... ... (a)

Then ra(x) = rx^n + ra_{n-1}x^{n-1} + ... ... + ra_1x + ra_0 ... ... ... (b)

In equation (b) r is the coefficient of x^n and coefficients of polynomials in R[x] must belong to R

Thus r \in R

Is this reasoning correct? Can someone please indicate any errors or confirm the correctness.

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


Question (2)
The last part of the Project Crazy Project (PCP) reads as follows:

Moreover, since a(x) is monic and $$ra(x) \in R[x] $$, we have $$r \in R $$ Similarly, $$s \in R $$, and thus $$ r \in R $$is a unit. But then $$ a(x) \in R $$, a contradiction. So R cannot be a unique factorization domain.Why does r and s being units allow us to conclude that a(x) \in R[x]? (I am assuming that the author of PCP has made an error in writing R in this expression and that he should have written R[x]

I would be very appreciative of some help.

Peter

[Please note that this set of questions is also posted on MHF]
 
Last edited:
Physics news on Phys.org
Since ##r## is a unit and ##ra(x)\in R[x]##, then the product ##r^{-1}(ra(x))\in R[x]##, that is, ##a(x)\in R[x]##.
 
  • Like
Likes Math Amateur and Greg Bernhardt
##\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