Rational solutions to polynomials
by t0rajir0u, Mar 26, 2008, 1:39 AM
My apologies for not updating in quite awhile
Fortunately, I've been doing a fair bit of musing these days and I think I've got material for a bit more activity than before.
The basis for today's discussion is this reasonably innocuous problem:
Problem:
are odd integers. Prove that
has no rational roots.
Method 1: Suppose
is a rational root where
. Then
. Now, it cannot be the case that both
are even (and in fact RRT tells us that both
are odd), but if either (or both)
are odd then the above expression is odd; contradiction.
Method 2:
has no solutions in
.
Whoa, there! What exactly have we done in Method 2? As it turns out, this is a very slick rewording of Method 1, but the concepts it introduces are deep. To explain them rigorously, we will introduce a few tools.
Definition: The homogenization of a polynomial
of degree
is the polynomial
.
The homogenization of a polynomial is, well, a homogeneous polynomial in two variables
. In other words,
. When we homogenize our given polynomial, we see that to look for rational solutions to
is equivalent to looking for integer solutions to
, which is exactly what we did in the first solution.
Note, however, that as long as we're looking at the roots of
, homogenization means that we can identify any root
with
. This motivates a very powerful idea.
Definition: The projective line
over a field
is the set of equivalence classes of points
under the equivalence relation
. A projective point is denoted
. (We delete the origin because it is only equivalent to itself and has no particularly useful properties.)
We were initially looking at solutions to
in
, and now we're looking at solutions to
in
. Note that instead of treating
as two variables we are looking at the single variable
. (The notational change is to emphasize that what we are looking at is the ratio between the coordinates, not the coordinates themselves.)
This might be your first foray into projective geometry. Let's try to figure out more about the structure of
. When
, we can identify a point
with the point
; this is called an affine slice of the projective line, and since
can take on any value in
(here
) it is essentially (that is, isomorphic to)
(the affine line). When
, however, we have the single point
. This is called the point at infinity and is the reason the projective line has more structure than the affine line.
One way to understand the projective line, therefore, is as the affine line with a point of infinity "glued" onto it. In fact, this viewpoint generalizes when we consider higher-dimensional projective spaces (the projective plane, for example). But enough about that. For now, the important thing is that the projective (rational) line is our new domain for understanding the rational solutions of polynomials.
This was a long way to go to restate the first basic idea of Method 1: a solution to
on the rational affine line corresponds to a solution to
on the rational projective line.
Now we can go a step further and reduce everything
.
Since
, we are now looking at solutions to the polynomial
for
(the finite field with
elements; canonically isomorphic to the integers
). But wait! Doesn't everything we've said about homogeneous polynomials still apply?
What we're actually looking at now is the projective line
over a finite field. This line has three points:
. The first two are an affine slice corresponding to
while the last is a point at infinity.
Let's restate the second basic idea from Method 1 now: a solution to
on the rational affine line corresponds to a solution to
on the projective line over
. (In fact, this correspondence is a ring homomorphism known as the reduction-modulo-
map). We can describe this correspondence explicitly:
corresponds to
if
are both odd.
corresponds to
if
is even and
is odd.
corresponds to
if
is even and
is odd.
Note that the deletion of the origin we specified in defining the projective line has a natural interpretation here:
corresponds to a rational number not in lowest terms, so of course it has no meaning since we can reduce it until it is in lowest terms!
It is now extremely simple to check that none of the above three points is a solution to
.
Remark: The existence of a solution to
in
is a necessary, but not a sufficient, condition for the existence of a solution to
. See http://en.wikipedia.org/wiki/Hasse_principle .
The above has been something of an introduction to the rich field of algebraic geometry. So far, we have considered the rational roots of polynomials in one variable. From here, we can consider the set of rational points on curves defined by polynomials in two variables (after homogenization, a Diophantine equation), which will be the subject of the next post and is an important aspect of the study of elliptic curves. (I need somewhere to talk about my RSI/Intel research, don't I?
)
Practice Problem 1: Find all rational solutions to
. (Think homogenizing and dehomogenizing.)

The basis for today's discussion is this reasonably innocuous problem:
Problem:


Method 1: Suppose






Method 2:


Whoa, there! What exactly have we done in Method 2? As it turns out, this is a very slick rewording of Method 1, but the concepts it introduces are deep. To explain them rigorously, we will introduce a few tools.
Definition: The homogenization of a polynomial



The homogenization of a polynomial is, well, a homogeneous polynomial in two variables




Note, however, that as long as we're looking at the roots of



Definition: The projective line





We were initially looking at solutions to






This might be your first foray into projective geometry. Let's try to figure out more about the structure of










One way to understand the projective line, therefore, is as the affine line with a point of infinity "glued" onto it. In fact, this viewpoint generalizes when we consider higher-dimensional projective spaces (the projective plane, for example). But enough about that. For now, the important thing is that the projective (rational) line is our new domain for understanding the rational solutions of polynomials.
This was a long way to go to restate the first basic idea of Method 1: a solution to


Now we can go a step further and reduce everything

Since





What we're actually looking at now is the projective line



Let's restate the second basic idea from Method 1 now: a solution to















Note that the deletion of the origin we specified in defining the projective line has a natural interpretation here:

It is now extremely simple to check that none of the above three points is a solution to

Remark: The existence of a solution to



The above has been something of an introduction to the rich field of algebraic geometry. So far, we have considered the rational roots of polynomials in one variable. From here, we can consider the set of rational points on curves defined by polynomials in two variables (after homogenization, a Diophantine equation), which will be the subject of the next post and is an important aspect of the study of elliptic curves. (I need somewhere to talk about my RSI/Intel research, don't I?

Practice Problem 1: Find all rational solutions to
