This is the second (continued from Part 2) in a series of three blog posts. In the following we'll investigate a few properties of an object called Conway's topograph. John Conway conjured up a way to understand a binary quadratic form – a very important algebraic object – in a geometric context. This is by no means original work, just my interpretation of some key points from his The Sensual (Quadratic) Form that I'll need for some other posts.
For the form we define the discriminant as the value .
The base and take values and on the form in the Definition above and are part of a sequence with common difference . In fact, if we know the values and the difference at any base (edge in the topograph), the value is independent of the base and the direction (left or right) which determines the sign of and hence equal to the discriminant. To see this, first note the sign of is immaterial since it is squared. Also, consider the two other bases (edges) in the superbase. As in the proof of the climbing lemma, one base takes values and with common difference which gives
Similarly the other base in the given superbase gives
Having showed that there are no cycles when starting from a given superbase, our work in understanding the topographis not complete. We haven't actually showed that we can get from one superbase to any other superbases within the topograph. To show this, we'll use the discriminant and the following.
A superbase is called a well if all the edges at point away from .
Notice a well is dependent on the values, hence depends on the form . In a positive-valued topograph, we may find a well by traveling along the topograph in the opposite direction of the edges. Eventually, we must encounter a superbase where all arrows point out (as above), leaving us nowhere to travel and thus becoming our well. This is because, assuming the topograph is positive-valued, we can only decrease in value for so long (eventually the values must approach the minimum).
Lemma: (The Well Lemma)
For a positive-valued form and a well the three values takes on the faces in are the smallest values that takes on the topograph.
Using the labels from the well in the definition above, the Arithmetic Progression Rule for our differences gives
Let the superbase . Since is a superbase, we may write any vector as
for . Also due to the fact that is a superbase, and so we may also write
for . From this it is clear only the differences of the matter. With this as our inspiration we write
a formula discovered by Selling.
To verify this, notice both sides of the equation are quadratic forms in and
hence they must be equal since both sides are quadratics that agree on more than two points.
If two of the are equal, then must be an integral multiple of the third vector, hence the value will be at least as largeas the value of on the third vector. If not, all the differences must be non-zero (hence greater than or equal to in absolute value, since integers), thus
which is greater than or equal to each of and since all of and are non-negative.
The topograph is connected; one may travel along the topograph from any given superbase to any other.
Using the same quadratic form as we did to show the topograph had no cycles, we can show it is connected. Any arbitrary superbase is on the topograph, hence must be in some connected component of the topograph, but there may be more than one component. Since is positive-valued, we must have some well in this component. But, by the above, the values at a well must be the absolute lowest values takes on the topograph. This implies the well must take the values and shows all superbases must be in the same component.
From this point, we will concentrate on a special type of form relevant to our discussion. For a form which takes both positive and negative values, but never the topograph has a special path thatseparates the which separates the faces where takes a positive value and those where takes a negative value.
If a form takes both positive and negative values, but not zero, then there is a unique path of connected edges separating the positive and negative values. What's more, the values that occur on this river do so periodically.
Since the topograph is connected, there must be some edge where positive and negative values meet. As we proceed along adjacent edges, we can choose to follow a path of edges which will separate positive and negative (each subsequent value must be positive or negative, allowing us to "turn" left or right).
On first sight, there is no reason that this path should be unique. However, with the climbing lemma in mind, starting on the positive side of the path and moving away from the negative values, we must have only positive values. Using the logic of the climbing lemma instead with negative values, we similarly see that starting on the negative side and more away from the positive values will yield all negative numbers below the path. Hence nowhere above the path can positive and negative values meet and similarly below. Thus the path must be unique.
To show this path is periodic, we must utilize the discriminant. For each edge along the path, we have some positive value and a negative (by definition of the path) and the common difference . Thus the determinant must be negative since the product is, hence
Thus, both and are bounded by . So and are bounded by . Thus we have finitely many possible triples hence some value must be repeated in the path. This forces the path to be periodic since the triple starting from one triple determines next triple along the path and hence the entire path.
This path is so crucial that we give it it's own name.
If a form takes both positive and negative values, but not zero, we call the path separating the positive and negative values the river.
Thanks for reading, I'll make use of all this in a few days!
This material is intentionally aimed at an intermediate (think college freshman/high school senior) audience. One can go deeper with it, and I'd love to get more technical off the post.
All images were created with the
tikz LaTeX library and can be
compiled with native LaTeX if
pgf is installed.