Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Suppose we have a non-constant polynomial $f(x,y)\in\mathbb{Q}[x,y]$ such that the following two conditions are satisfied:

1) For every $x_0\in\mathbb{Q}$, the polynomial $f(x_0, y)\in\mathbb{Q}[y]$ is irreducible.

2) For every $y_0\in\mathbb{Q}$, the polynomial $f(x,y_0)\in\mathbb{Q}[x]$ is irreducible.

My question is this:

Can we conclude from these two conditions that $f(x,y)$ is an irreducible polynomial in $\mathbb{Q}[x,y]$?

I am leaning on "yes" side. This was my unsuccessful attempt: Suppose $f(x,y)$ is reducible, then $f(x,y)=g(x,y)h(x,y)$ for some non-constant polynomials $g, h\in\mathbb{Q}$. Now, for each fixed $x_0\in\mathbb{Q}$, we have $f(x_0,y)=g(x_0, y)h(x_0,y)$. Since $f(x_0, y)$ is irreducible, it means $g(x_0,y)$ or $h(x_0,y)$ must be constant. I think from here we should be able to conclude either $g$ or $h$ does not depend on $y$. Is this approach correct? Or perhaps there is a counter-example?

Thanks!

share|improve this question
add comment

1 Answer 1

up vote 6 down vote accepted

No. Let $f(x, y) = (x^2 + 1)(y^2 + 1)$.

share|improve this answer
    
nice example :) –  Calvin Lin May 17 '13 at 4:33
    
Simply and nicely done. I have posted its dual here that you might be interested in. –  Prism May 17 '13 at 8:37
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.