The field of constructible lengths, part 3
October 10, 2011 5 Comments
One of the rules for is that it is a field and it contains all of its positive square roots (though allowing complex numbers wouldn’t hurt, we won’t do so). We are going to show now that this is all it has.
If we have a quadratic equation which has a real solution, by the quadratic formula, the solution is
So what? What’s so special about that? Well, notice that if , , and are in our field , then so is , since is closed under square roots, as we showed last week.
This is an important fact, because, this is exactly how we construct . Each time we mark an intersection point, it is either the intersection of two lines, a line and a circle, or two circles. For each one, we can set up a linear, or quadratic equation.
This is a big step to answering our questions. For example, given a cube, can we build a cube with double the volume? Well, if we could, it would mean that was constructible. This doesn’t look like it can be achieved via square roots to me! The answer is “no,” but we need to prove that can’t be written with only rationals and square roots. How will we do this?
We’ll look at the smallest field containing and . In a nice way, we can view it as a vector space over , so we can see what its dimension is. It will turn out to have dimension 3, and that will turn out to be bad/impossible to construct.