Criterion for Irreducibility of a polynomial in several variables?

Click For Summary
The discussion centers on the criteria for determining the irreducibility of multivariate polynomials over algebraically closed fields, particularly the complex numbers. It is noted that if a specialization of the variables results in an irreducible polynomial in one variable, then the original multivariate polynomial is also irreducible. An example is provided with the polynomial x^2y + y, which is irreducible in one variable but reducible when considered as a multivariate polynomial. The conversation emphasizes the importance of treating the multivariate polynomial as a polynomial in one variable over the field of functions of the other variables. The zero polynomial is mentioned as reducible, but the relevance of constant polynomials is debated.
GargleBlast42
Messages
28
Reaction score
0
Is there any criterion for the irreducibility of a polynomial in several variables over an algebraically closed field (or specifically for the complex numbers)? For one variable, we know this is simply that only degree one polynomials are irreducible, is there anything similar for several variables?
 
Physics news on Phys.org
If you can show that some specialization of the variables gives an irreducible polynomial in one variable, then this implies that the multivariate polynomial is irreducible.

So suppose you have some polynomial in K[x_1,x_2,x_3,...], where K is a field, and the x_i are indeterminates. Then all you need to do is find elements: a_2, a_3, a_4,... in K such that substituting a_i for x_i (i>1) gives an irreducible polynomial in K[x_1].
 
Also, every polynomial in x and y over C is a polynomial in x over C(y).
 
mrbohn1 said:
If you can show that some specialization of the variables gives an irreducible polynomial in one variable, then this implies that the multivariate polynomial is irreducible.

So suppose you have some polynomial in K[x_1,x_2,x_3,...], where K is a field, and the x_i are indeterminates. Then all you need to do is find elements: a_2, a_3, a_4,... in K such that substituting a_i for x_i (i>1) gives an irreducible polynomial in K[x_1].

I'm not really sure if this works. Take for instance x^2 y+y over the reals. As a polynomial in x, it is irreducible for any y, but as a polynomial in x,y it is obviously reducible x^2 y+y= y(x^2+1)
 
GargleBlast42 said:
As a polynomial in x, it is irreducible for any y
I do believe the zero polynomial counts as reducible.

edit: true but irrelevant
 
Last edited:
I don't think that the constant polynomial does count. I should have been clearer: this only works if you consider your multivariate polynomial as a polynomial in one variable over the field of functions in the other variables. In your example, the field would be R(y), and reducible in this case would refer only to the x variable.
 
I am studying the mathematical formalism behind non-commutative geometry approach to quantum gravity. I was reading about Hopf algebras and their Drinfeld twist with a specific example of the Moyal-Weyl twist defined as F=exp(-iλ/2θ^(μν)∂_μ⊗∂_ν) where λ is a constant parametar and θ antisymmetric constant tensor. {∂_μ} is the basis of the tangent vector space over the underlying spacetime Now, from my understanding the enveloping algebra which appears in the definition of the Hopf algebra...

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
3K