Multiplicative Inverse of Polynomials with Integer Coeff.

Click For Summary

Homework Help Overview

The discussion revolves around identifying the elements in the ring of polynomials with integer coefficients, ℤ[x], that possess a multiplicative inverse. The original poster expresses confusion regarding the requirements for a polynomial to have an inverse and seeks initial guidance on the topic.

Discussion Character

  • Exploratory, Assumption checking, Conceptual clarification

Approaches and Questions Raised

  • Participants explore the nature of polynomials with integer coefficients and their inverses, questioning the implications of having a constant term and the degree of polynomials. There is discussion about whether certain forms, like x^(-3), qualify as polynomials and the conditions under which polynomials can multiply to yield 1.

Discussion Status

Multiple interpretations of the conditions for multiplicative inverses are being explored. Some participants suggest that only constant polynomials can have inverses in ℤ[x], while others question the implications of polynomial degrees and the nature of integer coefficients. Guidance has been offered regarding the relationship between degrees of polynomials and their products.

Contextual Notes

Participants note that the problem may be constrained by the definitions of polynomials and the properties of integers, particularly regarding the degrees of polynomials and the requirement for their products to equal 1.

RJLiberator
Gold Member
Messages
1,094
Reaction score
63

Homework Statement


If ℤ[x] denotes the commutative ring consisting of all polynomials with integer coefficients, list all the elements in ℤ[x] that have a multiplicative inverse in ℤ[x].

Homework Equations


Multiplicative inverse if rs = 1 where rs ∈ R (rs are elements of the ring).

Polynomials are of the form a_n*x^n+a_(n-1)*x^(n-1)+...+a_1*x+a_0
in this case, the a coefficients are all integers.

The Attempt at a Solution



At first glance, this is an overwhelming question. They want me to list ALL the elements that have a multiplicative inverse?
This fact leads me to believe that there is, in fact, a very special rule for this to occur which limits the amount that can be inverses OR they just want a general rule.

Yeah, I'm really lost on this one.
I realize I don't have much of an answer here, so I am not looking for a big hint yet. I know PF policy is to show your work prior to help.

Just give me something to get me going...
 
Physics news on Phys.org
This is much easier than you think it is! First do you see that if a polynomial has a_0= a\ne 0 while a_i= 0 for i> 0, then the 'inverse polynomial" is the polynomial with a_0= \frac{1}{a} and a_i= 0 for i> 0?

And use the fact that if one polynomial has a term x^n with non-zero coefficient and the other has x^m with non-zero coefficient, then their product has x^{n+m} with non-zero coefficient.
 
  • Like
Likes   Reactions: RJLiberator
HallsofIvy said:
This is much easier than you think it is! First do you see that if a polynomial has a_0= a\ne 0 while a_i= 0 for i> 0, then the 'inverse polynomial" is the polynomial with a_0= \frac{1}{a} and a_i= 0 for i> 0?
I think this part is misleading.
And use the fact that if one polynomial has a term x^n with non-zero coefficient and the other has x^m with non-zero coefficient, then their product has x^{n+m} with non-zero coefficient.
But this part should help.
 
  • Like
Likes   Reactions: RJLiberator
HallsofIvy said:
This is much easier than you think it is! First do you see that if a polynomial has a_0= a\ne 0 while a_i= 0 for i> 0, then the 'inverse polynomial" is the polynomial with a_0= \frac{1}{a} and a_i= 0 for i> 0?

And use the fact that if one polynomial has a term x^n with non-zero coefficient and the other has x^m with non-zero coefficient, then their product has x^{n+m} with non-zero coefficient.

As for the first line, regarding 1/a, this number is no longer in the integers. I would think this would not work, correct? (perhaps this is what mfb is alluding to)

As for the second line, I'm not sure how this helps. It kinds puts me in the same position that I have been in.

I can have all these polynomials in my head, but now I observe multiplication over them.
Is it that we need m+n = 0 so that x^0 = 1 ?

In which case x^3*x^(-3) would be an inverse.
So that would be all the polynomials with opposite degrees to themselves.
 
if ##RS = 1##, then both are non-zero and ##0 = \text{deg}(1) = \text{deg}(RS) = \text{deg}(R) + \text{deg}(S) ##.
So what is the degree of ##R## and ##S## ?
What is the only possibility (EDIT: 2 possibilities) left so that ##R,S\in \mathbb{Z}[X]##?
 
  • Like
Likes   Reactions: RJLiberator
RJLiberator said:
In which case x^3*x^(-3) would be an inverse.
So that would be all the polynomials with opposite degrees to themselves.
Is x^(-3) a polynomial?

Note: this is a matter of definition.
 
  • Like
Likes   Reactions: RJLiberator
mfb said:
Is x^(-3) a polynomial?

Note: this is a matter of definition.

Damn, good call. x^(-3) is NOT a polynomial.

geoffrey159 said:
if ##RS = 1##, then both are non-zero and ##0 = \text{deg}(1) = \text{deg}(RS) = \text{deg}(R) + \text{deg}(S) ##.
So what is the degree of ##R## and ##S## ?
What is the only possibility (EDIT: 2 possibilities) left so that ##R,S\in \mathbb{Z}[X]##?

So the sum of degree must be = 1.
deg(r)+deg(s) = 1.
2 possibilities: Either r is 0 and s = 1 or s is 0 and r is 1?

You are saying that the degree must be = 1? How is this so? If we have a degree of 1, I can't imagine a situation where x^1*s = 1. (where s is an element of polynomials, in this case a constant integer)
 
RJLiberator said:
So the sum of degree must be = 1.
Why 1?
 
  • Like
Likes   Reactions: RJLiberator
That's what I initially was thinking.
That the sum of the degrees must actually be 0.

This kinda threw me off that direction:
geoffrey159 said:
if ##RS = 1##, then both are non-zero and ##0 = \text{deg}(1) = \text{deg}(RS) = \text{deg}(R) + \text{deg}(S) ##.
So what is the degree of ##R## and ##S## ?
What is the only possibility (EDIT: 2 possibilities) left so that ##R,S\in \mathbb{Z}[X]##?

But I understand now that if the sum of the degrees must be = 0.
Then degree of r and s must both be 0.

Giving that he said that there were 2 possibilities, hmmm...

1. either r and s must both be 0.
2. Or either they do not have degrees?

1 and 2 are the same tho, hm.

Is this the right train of thought?
 
  • #10
OK so both are constant polynomials of ##\mathbb{Z}[X]##.
So ##R = a ## and ##S = b##, ##(a,b) \in \mathbb{Z}## such that ##ab = 1##
What are the divisors of 1 in ##\mathbb{Z}## ?
 
  • Like
Likes   Reactions: RJLiberator
  • #11
geoffrey159 said:
OK so both are constant polynomials of ##\mathbb{Z}[X]##.
So ##R = a ## and ##S = b##, ##(a,b) \in \mathbb{Z}## such that ##ab = 1##
What are the divisors of 1 in ##\mathbb{Z}## ?

So we have 1*1=1
and -1*-1=1

as the two possibilities?

That's really all there is over the polynomials?

I understand your argument here. Where degree has to be 0 because anything more will not result in 1 being a possible answer. This makes sense to me.
And as we stated, there can't be negative degrees, so that means they have to be constant in the integers.
And since we have a*b = 1 where a and b are integers, then the only possibilities are 1 and -1.
 
  • #12
Correct.
RJLiberator said:
They want me to list ALL the elements that have a multiplicative inverse?
As you now see, the list is short enough to make that reasonable.
 
  • Like
Likes   Reactions: RJLiberator
  • #13
Indeed, I cannot make a counter argument to it.

This thread is solved.

Thank you guys for your help.
 

Similar threads

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