Unique Factorization Domain? Nature of Q_Z[x] - 2

In summary, the only two units in $\mathbb{Q}_{\mathbb{Z}}[x]$ are 1 and -1, as any other polynomials are not invertible and therefore not units.
  • #1
Math Amateur
Gold Member
MHB
3,998
48
Let [TEX] \mathbb{Q}_\mathbb{Z}[x][/TEX] denote the set of polynomials with rational coefficients and integer constant terms.

Prove that the only two units in [TEX] \mathbb{Q}_\mathbb{Z}[x][/TEX] are 1 and -1.

Help with this exercise would be appreciated.

My initial thoughts on this exercise are as follows:

1 and -1 are the units of \(\displaystyle \mathbb{Z} \). Further the constant terms of the polynomials are from \(\displaystyle \mathbb{Z} \) and so I suspect the units of [TEX] \mathbb{Q}_\mathbb{Z}[x][/TEX] are thus 1 and -1 - but this is not a rigorous proof - indeed it is extremely vague!

Can someone help with a rigorous formulation of these thoughts into a formal proof.

I suspect that such a proof would start as follows:

Units of [TEX] \mathbb{Q}_\mathbb{Z}[x][/TEX] would be those p(x) and q(x) such that

p(x)q(x) = 1

can you just assert now that the only possible polynomials in [TEX] \mathbb{Q}_\mathbb{Z}[x][/TEX] would be 1 and -1 - what reason would you give - is it obvious?

Hope someone can clarify.

Peter

[This exercise is also posted on MHF]
 
Last edited:
Physics news on Phys.org
  • #2
Yes, it's obvious.
In fact, you can't define the invers of a non-constant polynomial. How would you for example define the invers polynomial of $x^2-1$? Hence, the only invertible polynomials are the constant polynomials. Since the constant polynomials are integers and $-1$ and $1$ are the only invertible integers they are the only units in the set $\mathbb{Q}_{\mathbb{Z}}[X]$
 

FAQ: Unique Factorization Domain? Nature of Q_Z[x] - 2

1. What is a Unique Factorization Domain (UFD)?

A Unique Factorization Domain is a type of mathematical structure in which every non-zero, non-unit element can be uniquely factored into a product of irreducible elements (prime elements that cannot be factored any further). This means that different factorizations of the same element will always result in the same irreducible factors.

2. How does a UFD differ from other types of mathematical structures?

A UFD differs from other structures, such as integral domains and Euclidean domains, in that it guarantees unique factorization of all non-zero, non-unit elements. In other structures, such as integral domains, unique factorization is not always guaranteed.

3. What is the nature of Q_Z[x] - 2 in a UFD?

The nature of Q_Z[x] - 2 in a UFD is that it is not a unique factorization domain. This is because Q_Z[x] - 2 can be factored in multiple ways, resulting in different irreducible factors. For example, it could be factored as (x - 2)(x + 1) or (x - 1)(x - 1), among other possibilities.

4. Can UFDs be infinite or do they have a finite number of elements?

UFDs can be either infinite or finite, depending on the specific structure. For example, the set of all integers (Z) is a UFD with an infinite number of elements, while the set of all polynomials with integer coefficients (Z[x]) is also a UFD but with a countably infinite number of elements.

5. How are UFDs used in scientific research?

UFDs are used in a variety of scientific research fields, such as number theory, algebraic geometry, and cryptography. They provide a useful framework for studying and analyzing the properties of factorization in different mathematical structures, and their applications extend to fields such as coding theory and error-correcting codes.

Back
Top