Multiplicative Inverse of Polynomials with Integer Coeff.

In summary: I'm thinking this out.In summary, to find all the elements in ℤ[x] that have a multiplicative inverse, we must consider polynomials with a constant term in the integers. This is because the sum of the degrees of the polynomials must be 0 for the product to equal 1. Therefore, the only possibilities are 1 and -1, which are the only divisors of 1 in the integers.
  • #1
RJLiberator
Gold Member
1,095
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
  • #2
This is much easier than you think it is! First do you see that if a polynomial has [itex]a_0= a\ne 0[/itex] while [itex]a_i= 0[/itex] for i> 0, then the 'inverse polynomial" is the polynomial with [itex]a_0= \frac{1}{a}[/itex] and [itex]a_i= 0[/itex] for i> 0?

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

And use the fact that if one polynomial has a term [itex]x^n[/itex] with non-zero coefficient and the other has [itex]x^m[/itex] with non-zero coefficient, then their product has [itex]x^{n+m}[/itex] 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.
 
  • #5
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 RJLiberator
  • #6
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 RJLiberator
  • #7
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)
 
  • #8
RJLiberator said:
So the sum of degree must be = 1.
Why 1?
 
  • Like
Likes RJLiberator
  • #9
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 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 RJLiberator
  • #13
Indeed, I cannot make a counter argument to it.

This thread is solved.

Thank you guys for your help.
 

1. What is the multiplicative inverse of a polynomial with integer coefficients?

The multiplicative inverse of a polynomial with integer coefficients is a polynomial that, when multiplied by the original polynomial, results in a polynomial with a constant value of 1.

2. How do you find the multiplicative inverse of a polynomial with integer coefficients?

To find the multiplicative inverse of a polynomial with integer coefficients, you can use the extended Euclidean algorithm or the method of polynomial long division. Both methods involve manipulating the coefficients of the polynomial to find the inverse.

3. Can every polynomial with integer coefficients have a multiplicative inverse?

No, not every polynomial with integer coefficients has a multiplicative inverse. In order for a polynomial to have a multiplicative inverse, it must have a constant term (or coefficient) that is relatively prime to all other coefficients in the polynomial.

4. What is the significance of the multiplicative inverse of a polynomial with integer coefficients?

The multiplicative inverse of a polynomial with integer coefficients is useful in solving equations involving polynomials, as well as in simplifying expressions and performing division of polynomials. It also has applications in cryptography and coding theory.

5. Are there any limitations to using the multiplicative inverse of polynomials with integer coefficients?

Yes, there are some limitations to using the multiplicative inverse of polynomials with integer coefficients. It can only be used for polynomials with integer coefficients, and it may not always result in a polynomial with integer coefficients. Additionally, the process of finding the inverse can be complex and time-consuming for higher degree polynomials.

Similar threads

  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
1K
  • Calculus and Beyond Homework Help
Replies
13
Views
2K
  • Calculus and Beyond Homework Help
Replies
6
Views
2K
Replies
8
Views
993
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
2K
  • Calculus and Beyond Homework Help
Replies
1
Views
345
  • Calculus and Beyond Homework Help
Replies
9
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
2K
Back
Top