Frameworks for two-dimensional Keller maps
Alexander Borisov

TL;DR
This paper discusses frameworks for analyzing two-dimensional Keller maps, which are potential counterexamples to the Jacobian Conjecture, by translating the problem into combinatorial conditions on Picard groups.
Contribution
It introduces and discusses multiple frameworks for understanding Keller maps in dimension two, expanding on previous work with more complex examples.
Findings
Several frameworks for Keller maps are described.
New, more complex frameworks are introduced.
The frameworks facilitate combinatorial analysis of Keller maps.
Abstract
A Keller map is a counterexample to the Jacobian Conjecture. In dimension two every such map, if exists, leads to a complicated set of conditions on the map between the Picard groups of suitable compactifications of the affine plane. This is essentially a combinatorial problem. Some solutions to it, that we call frameworks, are described and discussed. This second version of the paper includes several more frameworks than the first version, including one substantially more complicated framework.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Frameworks for two-dimensional Keller maps
Alexander Borisov
(Date: July 2019)
Abstract.
A Keller map is a counterexample to the Jacobian Conjecture. In dimension two every such map, if exists, leads to a complicated set of conditions on the map between the Picard groups of suitable compactifications of the affine plane. This is essentially a combinatorial problem. Several solutions to it (“frameworks”) are described in detail. Each framework corresponds to a large system of equations, whose solution would lead to a Keller map.
1. Introduction
Suppose and are two polynomials with complex coefficients. The classical Jacobian Conjecture (due to Keller, [10]) asserts the following.
Conjecture. (Jacobian Conjecture in dimension two) If the Jacobian of the pair of two-variable complex polynomials is a non-zero constant, then the map is invertible. Note that the opposite is clearly true, because the Jacobian of any polynomial map is a polynomial, and, when the map is invertible, it must have no zeros, so it is a constant.
This conjecture has a long history. See an excellent survey of Miyanishi [12] for some references. For the more algebraic approaches see the survey of van den Essen [8]. The term “Jacobian Conjecture” was coined by Abhyankar (cf. [1]).
The approach of this paper is based on the birational geometry of complete surfaces and combinatorial properties of the graphs of curves at infinity, as in the papers [4] and [5]. All varieties are over
From the point of view of a birational geometer, the most natural approach to the two-dimensional Jacobian Conjecture is the following. Suppose a counterexample, called a Keller map, exists. It gives a rational map from to After a sequence of blowups of outside of , we can get a surface with two morphisms: (projection onto the source ) and (the lift of the original rational map).
Note that contains a Zariski open subset isomorphic to , and that its complement, , is a tree of smooth rational curves. We will call these curves exceptional, or curves at infinity. The structure of this tree is easy to understand inductively, as it is built from a single curve on by a sequence of two operations: blowing up a point on one of the curves or blowing up a point of intersection of two curves. It is important to note that the exceptional curves on may behave very differently with respect to the map . More precisely, there are four types of curves .
type 1) is a curve, (i.e., )
type 2) is a point, not in
type 3) is a curve, (i.e., )
type 4) is a point in
The curves of type are known as di-critical components (cf., e.g. [2], [14]). A trivial topological argument implies that such curve must exist in any counterexample to the Jacobian Conjecture. A slightly stronger result, that the map must be ramified in at least one di-critical component, was proved (possibly, reproved) in [4], Theorem 3.1.
As was already done before, in particular by Orevkov, we are going to apply a sequence of blowups at infinity to the target surface, in the attempt to “get a closer view” of the Keller map. After adjusting the target, we again resolve the map. Slightly abusing the notation, we will call the new target surface and the new resolution surface . In this new situation, the classification of the exceptional curves on the new surface into four types still makes sense, just skip the parts in parentheses for types 1 and 3. Note that some of the curves that were classified as type 2 when the target was may now be of type . No other type changes can occur.
We can consider the Stein factorization of the morphism That is, we factor it into a composition of two morphisms, birational and finite: . Here the first morphism is birational and will be denoted by , and the second one is finite and will be denoted by The surface is algebraic and normal. In what follows, we will use the intersection theory for complete normal surfaces due to Mumford. Suppose is the canonical class of , as the Weil divisor class modulo numerical equivalence. The augmented canonical class is, by definition, , where are the images of all exceptional curves of types 1 and 3 (cf. [11]). All the curves of types 2 and 4 are contracted by .
Keller Map Adjunction Formula The two conditions of being a Keller map, is mapped to and no ramification on can be combined in one formula in the Mumford Picard group on (cf. [4]):
[TABLE]
where where is the ramification index of at .
It was proven in [4] that when the curve on is of type 2. Moreover, the surface has a rather simple structure, apart from one possibly complicated point, . Therefore, it makes sense to start modifying the target, by blowing up , until it becomes a curve. There are several restrictions on this process, some more complicated than the others. In particular, on all labels are non-positive, and all determinant labels are positive (cf. [5] for the definitions). This is how all our frameworls were constructed, by hand. It should be stressed that the existence of these frameworks is no miracle: the obstructions seem to be of the “inequality” type rather than “congruence” type, or anything trickier. One should expect infinitely many frameworks similar to the ones presented in this paper.
The paper is organized as follows. In section 2 some preliminaries are discussed and the first framework is constructed. Section 3 discusses it in further details, as well as the attempts to construct a Keller map based on it. Section 4 contains the second framework. Section 5 describes some frameworks that are related to the first framework, and a more complicated framework. Section 6 discusses the origins of these frameworks and some natural next steps for attacking the two-dimensional Jacobian Conjecture from this direction.
2. Preliminaries, Notation, and First Framework
Throughout the paper, we will be dealing primarily with smooth compactifications of , obtained from by a sequence of blowups of points and contractions of -curves outside of . To every such surface we can associate a graph of curves “at infinity” (i.e. outside of ). The vertices of this graph are the “curves at infinity”, i.e. the irreducible components of the complement of . The two vertices are joined by an edge whenever the two curves intersect. Here we assume that the curves are in simple normal crossing. This will be automatically achieved, as long as we never contract a -curve that intersects three or more other curves at infinity. Note also that this graph is a tree.
Because every divisor on is a divisor of a function, the classes of curves at infinity generate the Picard group of our compactified surface. Moreover, they form its basis (the fact that can be easily proven by induction). Therefore the graph of exceptional curves together with the self-intersection numbers of the curves completely determine the structure of the intersection form on our surface. Note that the self-intersection numbers change under blowups and contractions, so they are not the invariants of the divisorial valuations defined by the curves at infinity. To get around that, two other labels for these curves were introduced in [4] and [5]: the label and the determinant label. These labels are invariant under polynomial automorphisms of . Modulo that, the valuations with given labels form finitely many families (cf. [5]). We will not use the determinant labels until section 5, and will define and discuss them there. Here is the definition of the labels, that will be used a lot throughout the paper.
Definition 2.1**.**
The label of a curve at infinity is the coefficient in the expansion of in the basis of the Picard group of our surface. Here is the canonical class, and the is the augmented canonical class, which is the sum of and the “boundary”, that is, naturally, the sum of all curves at infinity.
The labels are easier to work with than the self-intersection labels, because once a curve is created its label no longer changes. When a curve is created by blowing up a point on one of the curves at infinity, its label is obtained by adding to the label of its “parent” curve. If it is obtained by blowing up the point of intersection of two curves, its label is simply the sum of the labels of its two “parents”. On the original the line at infinity has label
The following observation is easy but very important.
Lemma 2.1**.**
Suppose is the Keller map (in the notation of the Introduction), and is a type 1 curve at infinity on Suppose that is and the ramification index of at is . Then the label of is times the label of .
Proof.
This follows directly from the formula . ∎
As was noted in [4], for every curve at infinity with non-zero label one can recover its self-intersection index from its label and the labels of its neighbors. Indeed, suppose has neighbors, with labels , and the label of is . By the adjunction formula for
[TABLE]
[TABLE]
In particular, when , we get .
On the other hand, for curves with label [math] it is not possible to recover from the labels, and this is significant. In general, the curves with label [math] seem to play an important and somewhat mysterious role in the subject (see section 6 for more on that). As a result, in our figures we will note the labels for all curves (under the corresponding vertices of the graph) and the self-intersections of the curves with label [math] (in parentheses) under their zero labels.
Now we are ready to construct the first framework. We will start with the construction of the target surface , because it is easier, then construct the source surface , and then write down and .
Starting with the projective plane, we first blow up a point on the line at infinity, then the intersection of the newly created exceptional curve with the strict pullback of the line at infinity, then again the intersection of the newly created curve and the pullback of the line at infinity. As a result, we get a surface with the following graph:
Fig. 1\circ$$\circ$$\circ$$\circ----2$$2$$3$$4$$1
Here the integers below the vertices are the labels, and the natural numbers above them simply stand for the order in which the curves were constructed.
Now we blow up a point on the curve that was last constructed, then a point on the newly constructed curve, and again, and again, until we get to the curve with the label [math]:
Fig. 2\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ-------math
2$$3$$4$$5$$6$$7$$8$$9
-2$$1
As mentioned before, the number inside the parentheses indicates the self-intersection of the curve with the label [math].
Next, we blow up the point of intersection of the last two curves, and the point of intersection of the two curves with labels (-1). Finally, we blow up a point on the newly created curve to get another curve with label (-1), and a point on that curve, to get our surface :
Surface Fig. 3\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ---------math
2$$3$$4$$5$$6$$7$$8$$11$$10$$9
-2$$1
\circ$$\circ$$12$$13-math
Now we will construct the surface which is considerably more complicated. We start with and blow up a point on the line at infinity, and then a point on the last curve, to get a curve with label [math]. Then we blow up the intersection of the last two curves and then the intersection of the two curves with labels (-1), to get a curve with label Here is the resulting graph:
Fig. 4\circ$$\circ$$\circ$$\circ$$\circ----math
1$$2$$5$$4$$3
Next, we blow up a point on the last curve, then the intersection of the last two curves, and then the intersection of the curves with labels (-3) and (-2):
Fig. 5\circ$$\circ$$\circ$$\circ----
6$$7$$8$$5
\circ$$\circ-math4$$3
\circ$$\circ--2$$2$$1
Now we blow up another point on the original line at infinity, and then a point on the new curve, and again a point on the new curve, and again:
Fig. 6\circ$$\circ$$\circ$$\circ----2$$6$$7$$8$$5
\circ$$\circ-math4$$3
\circ$$\circ$$\circ$$\circ$$\circ$$\circ---[math]1$$2(-)
2$$1$$9$$10$$11$$12
Then, we blow up the intersection of the last two curves, and then the intersection of the curves with labels 3 and 2:
Fig. 7\circ$$\circ$$\circ$$\circ----2$$6$$7$$8$$5
\circ$$\circ-math4$$3
\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ---[math]1$$3$$5$$2(-)
2$$1$$9$$10$$11$$13$$14$$12
In what follows, we will stop keeping track of the order of creation: it is already not unique. We will now create some branches from the curve with label (-5) and the curve with label (-2), adjacent to it. Specifically, we will do the following.
- •
Create 8 branches of length 1 from the (-5)-curve, by blowing up 8 distinct points on it.
- •
Create 5 branches of length 3 from the (-5)-curve by blowing up a point, then the point of intersection of the new curve and the (-5)-curve, and then another point on the (-4)-curve.
- •
Create 3 forked branches from the (-5)-curve, identical to the forked branch on .
- •
Create 8 branches of length 2 from the (-2)-curve, by blowing up a point, and then a point on the new curve.
- •
Create 4 branches of length 3 from the (-2)-curve, by blowing up a point, then the point of intersection of the new curve and the (-2)-curve, and then another point on the (-1)-curve.
We also blow up the intersection of the curves that are indicated on the last picture by the creation numbers 2 and 5, and then the intersection of the resulting curve and the curve with the creation number 5. Finally, we contract the strict pullback of the original line at infinity, and then contract the curve with the creation number 9 on the last picture. The resulting surface has the following graph of curves at infinity:
Fig. 8\circ$$\circ$$\circ$$\circ$$\circ$$\circ-----math
\circ$$\circ-math
\circ$$\circ$$\circ--math
\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ---[math]1$$3$$5$$2(-)
\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ------math\circ$$\circ-math
-2$$\times 8
\circ$$\circ$$\circ---3$$\times 5
Finally, to get the surface , we blow up some points of intersection of curves “between” the forked (-5)-curve and (-2)-curve as on the picture below. Here the numbers above the vertices again indicate the (possible, not unique) order of creation of the new curves.
Fig.9\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ------------------
10987654113212131141516
Clearly, the graphs for and describe some families of smooth compactifications of . Note that the curves at infinity provide a basis of the Picard group, and our labels allow us to completely describe the intersection forms. One can construct two maps between the Picard groups, and that satisfy the projection formula and all other immediately necessary conditions for an actual Keller map .
Here is the general description of the map. The picture and the details for the specific branches will follow. We will generally denote the curves on by and the curves on by , where will be the label of the curve. For all curves of type 2 ; for all curves of of type , where is some natural number, understood as the degree of the restriction of to . In this case the label must be a multiple of the label : . The product is the degree of in the neighborhood of the generic point on .
General description of the map . The generic degree of is 16, so The curve with label 5 is of type 3, and the curve with label 2 is of type 4. All other curves are of type 1 or 2. The forked (-5)-curve on is sent by to the (-5)-curve of , with the degree of the restriction All forked (-2)-curves on are sent to the forked (-2)-curve on . The multi-forked (-2)-curve has and the other three (-2)-curves are mapped 1-to-1.
The eight length 1 branches from the (-5)-curve are sent to the length 1 branch from the (-5)-curve on with degree 2. The five length 3 branches from the (-5)-curve are sent to the length 2 branches from the (-5)-curve on with degree 3. (Note that the degrees are constant on the branches). The three forked branches from the (-5)-curve are sent to the forked branch from the (-5)-curve on with degree 1. The chain between the multi-forked (-5)-curve and (-2)-curve is sent to the chain between the (-5)-curve and the (-2)-curve on , with degree 13. The branch of length 2 from the multi-forked (-2)-curve, that ends in the curve with the label [math] and self-intersection (-2) is sent to the branch from the (-2)-curve on that ends in the curve with label [math] and the self-intersection (-2), with degree 1. The four branches of length 3 from the multi-forked (-2)-curve are also sent there, but with degree 3. The eight branches of length 2 are sent to the branch from the (-2)-curve on that ends in the curve with the label [math] and self-intersection (-1), with degree 1. Finally, the long branch that ends with the curve of type 4 is sent to the branch from (-2)-curve on that ends in the curve with the label [math] and self-intersection (-1), with degree 5. The curve with the label 0 on it goes to the curve with the label 0, the curves with the labels 1 and 3 go to some point on that curve, that the image of the curve with the label 5 intersects.
The following picture represents the map . To avoid overcrowding, not all arrows are drawn.
First Framework\circ$$\circ$$\circ$$\circ$$\circ$$\circ
.........-----math
\circ$$\circ-math
\circ$$\circ$$\circ--math
\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ---[math]1$$3$$5$$2(-)type\ 3$$\swarrow
\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ------math
\circ$$\circ-math
-4$$\times 8
\circ$$\circ$$\circ---3$$\times 5
\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ
---------math
-
\circ$$\circ-math
\triangleleft$$\triangledown
\triangle$$\triangledown$$\triangle
\triangle$$\triangledown$$\triangle$$\triangleleft
deg\ 3$$deg\ 16$$deg\ 2$$deg\ 13$$deg\ 13$$deg\ 3$$deg\ 5
Close-up of the (-5)…(-2) map (light blue arrow)\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ------------------
\circ$$\circ$$\circ$$\circ$$\circ$$\circ------
\triangle$$\triangle$$\triangledown$$\triangledown$$\triangle$$\triangleright
Fig. 10
We now need to fill in some details, providing and for the maps between branches of degrees more than 1. Checking the projection formula for all pairs of curves and , where is a multiple of , a point on or a curve intersecting , is left to the reader. Clearly, this would be sufficient for the projection formula, since the curves at infinity form the basis of the Picard groups of their surfaces, and for all other pairs the projection formula is trivially true.
Detailed description of
- •
For the forked (-5)-curves on and :
- •
For the multi-forked (-2)-curve on and the forked (-2)-curve on
- •
For the length 1 branches from the (-5)-curve:
- •
For the length 3 branches from the (-5)-curve:
The following picture shows where all the curves go, as well as the self-intersections of all curves, in parentheses above or below the vertices.
Fig. 11\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ
----(-)(-)(-)(-)
---(-)(-)(-)
\triangleleft$$\triangleleft$$\triangledown$$\triangledown
- •
For the length 3 branches from the (-2)-curve:
Fig. 12\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ
---math(-)(-)(-)
--math(-)(-)
\triangledown$$\triangledown$$\triangleright$$\triangleright
- •
For the long branch from the (-2)-curve:
Fig. 13\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ----[math]1$$3$$5$$2
(-)(-)(-)(-)(-)(-)(-)(-)(-)
\circ$$\circ$$\circ--math(-)(-)
\triangledown$$\triangleleft$$\triangleleft$$\triangledown$$\triangledown$$\triangledown$$\triangledown$$\triangledown
is a curve, generically in
is a point in
- •
Finally, for the chain between the (-5)-curve and the (-2)-curve:
Fig. 14\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ
\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ
------------------
(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)
\circ$$\circ$$\circ$$\circ$$\circ$$\circ
------
(-)(-)(-)(-)(-)(-)
\triangle$$\triangle$$\triangledown$$\triangledown$$\triangle$$\triangleright
\triangle$$\triangleleft
\triangleleft$$\triangledown$$\triangledown$$\triangledown
\triangledown$$\triangledown$$\triangledown
\triangleright$$\triangleright$$\triangleright
,
3. First Framework, Continued
We will now dig deeper into our framework. For the rest of this section, we will assume that it corresponds to the actual map (even though it probably does not).
First, you may have noticed that we have two Belyi maps: the red arrows in the main picture, above the forked (-5)-curve and (-2)-curve. One can draw the corresponding rational dessin d’enfants and, furthermore, write down the explicit rational functions that define them. (Thanks to Maple for their Gröbner basis implementation and more!) Then we will find the degrees of the polynomials that define . Finally, we will write down explicitly the coordinates on some open subsets of and and explain how to use them to search for .
Belyi map of (-5)-curves, the First Framework
The degree of the map is 16. The map is ramified above three points: intersection with the (-2)-curve, (-3)-curve, and (-4)-curve, that we will identify with , and respectively. Above , we have 8 ramification points of order 2, so the corresponding dessin is “clean”. Above we have 5 points of order 3 and 1 point of order 1, and above we have one point of order 13 and 3 points of order 1. A simple combinatorial analysis leads to the following clean dessin d’enfant (unique as a graph, but not as a dessin):
Fig. 15\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet
If we parametrize the (-5)-curve on by some parameter that equals [math] at the unique point of order 1 above and equals at the point of order above , we will only have one degree of freedom left: multiplying by a non-zero number. Up to that, our Belyi map is given (thanks to Maple) as where the polynomials and can be chosen as follows:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Note that .
Belyi map of (-2)-curves, the First Framework
The degree of the map is 13. The map is ramified above three points. They correspond to the branches that end with the 0-curve with the self-intersection (-2), with the 0-curve with the self-intersection (-1), and with the forked (-5)-curve. We will identify them as , , and respectively. On the (-2)-curve on we will identify with the unique point that is sent to , so that the Belyi map is given by a polynomial. Then above we have one point of order 1, that we will call , and 4 points of order 3. Above we have one point of order 5, that we will call and 8 points of order 1. The corresponding unique dessin d’enfant is the following:
Fig. 16\bullet$$\bullet$$\bullet$$\circ$$\circ$$\circ$$\circ$$\circ$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet
The Belyi map, for our choice of , is given by
[TABLE]
In what follows, we will use as the pair of coordinates on the source and as the coordinates on the target So and are rational functions on , while and are rational functions on . Linear transformations of the source and target planes give us some freedom on what points to blow up, so our first blowup on will be the point of intersection of the line at infinity and the line On the (-1)-curve created by that blowup has a pole of order and is a parameter, its valuation is [math]. On the next curve, with label (-3), the valuations of and are (-2) and (-1); on the (-5)-curve they are (-3) and (-2). So is a parameter on the (-5)-curve. By scaling the coordinates, we may assume that the next blowup in the creation of was at the point Valuations of and with respect to this (-4)-curve are also (-3) and (-2). The same will be true all the way to the curve with the valuation 0. Then for the (-1)-curve next to it the valuations are (-6) and (-4), and for the forked (-2)-curve and the remaining two curves on they are (-9) and (-6).
From our description of we can get the valuations of and . Specifically, from the formulas under Figure 13, the valuations of and with the respect to the 0-curve are (-45) and (-30). The valuations of and with respect to the (-1)-curve are (-27) and (-18) (note that and have poles at and and they both contribute). Now recall that to get back to the original line at infinity on we need to blow up twice. First, we get a curve with label (-1), for which the valuations are (-72) and (-48), and then the original line at infinity on with valuations (-99) and (-66). If we choose the coordinates on the source judicially, will be a polynomial in and of separate degrees 27 and 72 and total degree 99. And will be a polynomial in and of separate degrees 18 and 48 and total degree 66.
Remark 3.1**.**
Back in 1983 T.-T. Moh published a proof that there are no Keller maps of degrees up to 100 (cf. [13]). In fact, the (99,66) pair of degrees was the last troublesome case that he had to discard. Unfortunately, Moh’s paper does not give full details of his proof for that case. Only a reduction to an easier problem is presented, and the argument is sketchy: it seems that in order to understand it, one has to fully understand the argument for some smaller pairs of degrees, - something that I was unable to do. To complicate the matter further, in 2016 Yansong Xu, a 1993 Ph.D. student of Moh, posted a preprint in which he claimed that Moh’s proof had a gap, that he just managed to patch. According to Christian Valqui, Yansong Xu’s argument had a mistake, that he acknowledged (cf. [7]), but Rodrigo Horruitiner essentially proved it in his Master’s thesis. Finally, my own calculations, using Maple, based on the ideas below, led to the same result: no map. So, in all likelihood, there is no map that satisfies our framework, but we currently do not have a simple reason for this.
In order to fully understand the structure of (and ), we need some notation for the local coordinates of some Zariski open subsets.
Definition 3.1**.**
Suppose and are two intersecting curves at infinity. This means that on the graph of curves, we have an edge connecting and . We will call a pair of rational functions on our surface a local coordinate system for that edge if
[TABLE]
Note that the coordinate system of an edge is far from unique, and that may have other zeros and poles, possibly intersecting , and the same for and On the other hand, a local coordinate system exists for every edge of our graph of curves, which can be proven by induction. We will keep track of this notationally as follows:
Fig. 17\circ$$\circ$$(f_{i}\ \ \ ,\ \ \ f_{j})$$E_{i}$$E_{j}
When an edge is “broken” by the blowup of to create we get the following:
Fig. 18\circ$$\circ$$\circ$$(f_{i}\ \ \ ,\ \ \ \frac{f_{j}}{f_{i}})$$(\frac{f_{i}}{f_{j}}\ \ \ ,\ \ \ f_{j})$$E_{i}$$E_{k}$$E_{j}
When a non-intersection point is blown up on a curve at infinity, the procedure is more complicated. Since at this time we must have some parameter on the curve (a rational function, identifying it with ), subtracting a constant from that parameter will give us a function that has a zero of order one on some curve intersecting our curve transversally at any given point. We also need, however, a function that equals zero on our curve, and has no other zeros or poles passing through the point to be blown up. For our purposes this can be done by hand, but it would be nice to automatize this. Non-uniqueness of the pair of coordinates is part of the problem here.
As an illustration, below are (some possible) coordinate systems for the surface in Figure 7. Here and are arbitrary parameters.
Fig. 19\circ$$\circ$$\circ$$\circ----
\circ$$\circ-math
\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ---[math]1$$3$$5$$2
(\frac{1}{x_{2}},\frac{x_{2}}{x_{1}})$$(\frac{x_{1}}{x_{2}},\!\frac{1}{x_{1}})$$(\!x_{1},\!\!\frac{1}{x_{1}x_{2}}\!)$$(\frac{1}{x_{1}x_{2}^{3}},x_{2})$$\downarrow
(x_{1}x_{2}^{2},\!\frac{1}{x_{1}x_{2}})$$(x_{1}x_{2}^{3},\frac{1}{x_{1}x_{2}^{2}})$$\uparrow
(\frac{x_{2}}{(x_{1}x_{2}^{3}-1)^{3}},x_{1}x_{2}^{3}-1)$$\searrow
(\!\frac{x_{2}}{(x_{1}x_{2}^{3}-1)^{2}},\!\!\frac{1}{x_{2}}(x_{1}x_{2}^{3}-1)^{3}\!)$$\uparrow
(\!\frac{x_{2}}{x_{1}x_{2}^{3}-1},\!\!\frac{1}{x_{2}}(x_{1}x_{2}^{3}-1)^{2}\!)$$\nearrow
(\!x_{1}x_{2}\!-\!e_{1},\!\!\frac{1}{x_{1}x_{2}^{2}-e_{1}x_{2}}\!)$$\nearrow
(x_{1}x_{2}^{2}\!-\!e_{1}x_{2}\!-\!e_{2},\frac{x_{2}}{(x_{1}x_{2}^{3}-e_{1}x_{2}^{2}-e_{2}x_{2})^{2}})$$\searrow
(\!\frac{(x_{1}x_{2}^{3}-e_{1}x_{2}^{2}-e_{2}x_{2})^{2}}{x_{2}},\!\frac{x_{2}}{(x_{1}x_{2}^{3}-e_{1}x_{2}^{2}-e_{2}x_{2})^{3}}\!)$$\nearrow
(\!\frac{(x_{1}x_{2}^{3}-e_{1}x_{2}^{2}-e_{2}x_{2})^{3}}{x_{2}},\!\frac{1}{(x_{1}x_{2}^{3}-e_{1}x_{2}^{2}-e_{2}x_{2})}\!)$$\uparrow
These edge coordinate systems can be used to search for a map as follows. Suppose , Take, for example, an edge between the curves with labels 0 and 1:
[TABLE]
We can solve for in terms of
[TABLE]
Plugging that into the formulas for and and using the known valuations of and we get many equations on coefficients and . These equations are linear in the coefficients, but non-linear in and Altogether, there are hundreds of variables and hundreds of equations. In actuality, I was writing and as Laurent polynomials in and that are parameters on the (-2)-curve and (-5)-curve respectively. After solving, using Maple, the hundreds of linear equations on hundreds of variables, I got down to just a dozen or so coefficients, and with a bit more work figured out that no map can exist. It should be stressed that one careless mistake anywhere in the process would likely lead to a missed solution, and I cannot trust my own bookkeeping abilities to claim that I actually have a proof that no exists.
Not that we are too far off target: here is a rather interesting map. If and are the two polynomials from the degree 16 Belyi map, consider , where
[TABLE]
Note that this map is polynomial, and the polynomials have the correct degrees. It has a rather simple Jacobian, a constant multiple of . It is generically 16:1. It has some other required properties for a Keller map, for example it is not proper (there are curves of type 3 and 4, in fact exactly those that our framework predicts, for ). Unfortunately, there does not seem to be a way to modify it to get a Keller map.
4. Second Framework
Since we seem to be out of luck with the above framework, it makes sense to look for more sophisticated ones. Indeed, one can be obtained if when constructing we create one more (-1)-curve from the 0-curve. Specifically, here is a graph for :
Surface Fig. 20\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ----------math
2$$3$$4$$5$$6$$7$$8$$10$$12$$11$$9
-2$$1
\circ$$\circ$$13$$14-math
The surface is constructed similarly to the surface in the first framework. Specifically, here is a new version of Figure 7:
Fig. 21\circ$$\circ$$\circ$$\circ----2$$7$$8$$9$$6
\circ$$\circ-math5$$3
\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ----[math]1$$3$$5$$7$$2$$1(-)
4$$2$$1$$10$$11$$13$$15$$16$$17$$14$$12
We will now create some branches from the (-5)-curve (creation number 9) and (-2)-curve (creation number 6) on the above graph. Specifically, from the (-5)-curve we will create 14 length 1 branches, 9 length 3 branches and 5 long forked branches, the same way as in the First Framework. They will be mapped to the branches on in the same fashion as in the First Framework (so the total degree of the map is ). From the forked (-2)-curve we will create 16 branches of length 2, to be mapped 1-to-1 to the branch on that ends with the 0-curve with self-intersection (-1). We will also construct 2 branches of length 4 and 4 branches of length 6, to be mapped to the branch on that ends with the 0-curve with self-intersection (-2) with degrees 5 and 3 respectively (see below). Finally, we will modify the long branch from the (-2)-curve by contracting, in order, the curves numbered 1, 10, and 2, and blowing up the intersection of the (-2)-curve with the branch three times to get (-3)-curve, (-5)-curve, and (-7)-curve. This branch will be sent to the branch on that ends with the 0-curve with self-intersection (-1) with degree 7. Finally, like in the First Framework, we will break the edge between the two multi-forked curves, this time by creating 31 new curves, with the following labels, from left to right: -92, -87, -82, -77, -72, -67, -62, -57, -52, -47, -42, -37, -69, -32, -27, -22, -17, -46, -29, -12, -7, -23, -16, -9, -11, -13, -15, -17, -19, -21, -23.
The following picture shows the general outline of the map, similar to Figure 10 for the First Framework.
Second Framework\circ$$\circ$$\circ$$\circ$$\circ$$\circ
.........-----math
\circ$$\circ-math
\circ$$\circ$$\circ$$\circ---math
\circ$$\circ$$\circ$$\circ$$\circ$$\circ--[math]1$$2$$3$$\nwarrow$$type\ 3(-)
\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ----[math]1$$3$$5$$7$$2$$1(-)\nwarrow$$type\ 3
\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ------math
\circ$$\circ-math
-4$$\times\!14
\circ$$\circ$$\circ---3$$\times 9
\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ
----------math
-
\circ$$\circ-math
\triangleleft$$\triangledown
\triangle$$\triangledown$$\triangle
\triangle$$\triangledown$$\triangle
deg\ 3$$deg\ 28$$deg\ 2$$deg\ 23$$deg\ 23$$deg\ 3$$deg\ 5$$deg\ 7
Close-up of the (-5)…(-2) map (light blue arrow)
\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ................(every 5)(every 2)
-----------------
\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ-------
\triangle$$\triangle$$\triangle$$\triangleleft$$\triangledown$$\triangleright$$\triangle
Fig. 22
We now look at the maps on the branches in more detail. We skip the branches from the (-5)-curve, as they are identical to those from the First Framework.
- •
For the length 4 branches from the (-2)-curve:
Fig. 23\circ$$\circ$$\circ$$\circ$$\circ----[math]
(-)(-)(-)(-)(-)
\circ$$\circ$$\circ--math(-)(-)
\triangledown$$\triangledown$$\triangledown$$\triangledown$$\triangleright
- •
For the length 6 branches from the (-2)-curve:
Fig. 24\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ---[math]1$$2$$3
(-)(-)(-)(-)(-)(-)(-)
\circ$$\circ$$\circ--math(-)
\triangledown$$\triangleleft$$\triangleleft$$\triangledown$$\triangledown$$\triangledown$$\triangledown
is a curve, generically in
- •
For the long branch from the (-2)-curve:
Fig. 25\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ-----[math]1$$3$$5$$7$$2$$1
(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)
\circ$$\circ$$\circ--math(-)
E_{1}$$E_{1}^{\prime}
\triangleleft$$\triangleleft$$\triangledown$$\triangledown$$\triangledown$$\triangledown$$\triangledown$$\triangledown$$\triangledown$$\triangledown
is a curve, generically in is a point in
- •
Finally, for the chain between the (-5)-curve and the (-2)-curve:
Fig. 26\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ
\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ
................every 5, all (-)every 2, all (-)\downarrow$$\downarrow
-----------------2$$E_{-17}^{\prime}$$E_{-23}^{\prime}$$E_{-23}
(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)
\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ
-------
(-)(-)(-)(-)(-)
F_{-1}^{\prime}$$F_{-1}
\triangle$$\triangle$$\triangle$$\triangleleft$$\triangledown$$\triangleright
On the above picture it is shown where the curves of type 1 go. The curves of type 2 go to the intersections of the “neighboring” curves of type 1. Note that we have several pairs of curves with the same label, including the curve , hidden between and . For all curves of type 1 (not including the (-5)-curve and the (-2)-curve) we have and . The is given by the following formulas.
Again, it is tedious but not hard to check that the projection formula is true. Like in the First Framework, we can also calculate the degrees of the corresponding polynomials. With the same choice of coordinates on and the initial blowup, we get that the valuations of and on the curves numbered 12, 13, and 14 on Figure 20 are (-15) and (-10) respectively. From the formulas below Figure 25, and have poles of orders 60 and 40 respectively on and 105 and 70 on . These are the curves numbered 4 and 11 on Figure 21. Reconstructing the curves numbered 2, 10, and 1 on Figure 21, we get the following orders of poles: (165,110), (270,180), and, finally, . So with the suitable choice of coordinates on the source and the target planes, our map should be given by a pair of polynomials of degrees . We conclude our discussion of the Second Framework by the dessins for the two red arrow Belyi maps.
Belyi map of (-5)-curves, the Second Framework
The degree of the map is 28. The map is ramified above three points: intersection with the (-2)-curve, (-3)-curve, and (-4)-curve, that we will identify with , and respectively. Above , we have 14 ramification points of order 2, so the corresponding dessin is “clean”. Above we have 9 points of order 3 and 1 point of order 1, and above we have one point of order 23 and 5 points of order 1. A simple combinatorial analysis leads to the following clean dessin d’enfant (not unique, there are some options):
Fig. 27\bullet$$\bullet$$\bullet$$\bullet
\bullet$$\bullet$$\bullet$$\bullet$$\bullet
Belyi map of (-2)-curves, the Second Framework
The degree of the map is 23. The map is ramified above three points. They correspond to the branches that end with the 0-curve with the self-intersection (-2), with the 0-curve with the self-intersection (-1), and with the forked (-5)-curve. We will identify them as , , and respectively. On the (-2)-curve on we will identify with the unique point that is sent to , so that the Belyi map is given by a polynomial. Then above we have one point of order 1, 4 points of order 3, and 2 points of order 5. Above we have one point of order 7 and 16 points of order 1. A corresponding dessin d’enfant (unique as a graph, but not as a dessin) is the following:
Fig. 28\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet
5. More Frameworks
We will first construct several frameworks that are closely related to the First Framework. In fact, they will have the same target graph. We will call these frameworks “isotopes” of the First Framework.
Besides the length 3 branches from (-2)-curve that are sent down with degree 3, as in Picture 12, there can also be branches that are sent down with degree 1, with a curve of type 3 at the end of the branch:
Fig. 29\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ
--[math](-)(-)(-)
--math(-)(-)
\triangledown$$\triangledown$$\triangledown$$\triangleright
Here intersects transversally at one point, all other maps are 1-to-1.
Additionally, the map on Figure 13 can be generalized to odd ramification higher than 5, as follows.
Fig. 30\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ…………
--(2+1)-(2-1)--[math]1$$3(2-1)(2+1)
(-)(-)(-)(-)(-)(-)(-)(-)(-)(-)
\circ$$\circ$$\circ--math(-)(-)
\triangleleft$$\triangle$$\triangleleft$$\triangledown$$\triangledown$$\triangledown$$\triangledown$$\triangledown$$\triangledown$$\triangleright
is a curve, generically in intersecting at one point; is a point in
This gives us some options for the Belyi map between the (-2)-curves. Specifically, for every we can have a Belyi map with the following ramification data:
- •
above : 1 point with ramification 13 (this point can be chosen to be );
- •
above : points with ramification 3 and points with ramification 1.
- •
above : 1 point with ramification and points with ramification 1.
Note that when we get the Belyi map described in Figure 16. When this map can be given by the polynomial function . It is not hard to draw the possible dessins for all , this is left to the reader as a pleasant exercise. The corresponding framework is similar to the First Framework, but the long branch from the (-2)-curve on is replaced by the long branch from Figure 30, the number of green branches of length 2 is instead of 8, the number of blue branches of length 3 is instead of 4, and there are also blue branches like in Figure 29.
It is not hard to calculate the degrees of the corresponding polynomials. Wih the same convention for and as for the First Framework, we get that has degrees and in and respectively, while has degrees and respectively. The total degrees are , that is the following:
[TABLE]
Finally, here is a sketch of a more complicated framework. It also has some commonalities with the First Framework, but it has three rational Belyi maps instead of two. Interestingly, it has no curves of type 4.
Three-dessin Framework\circ$$\circ$$\circ$$\circ$$\circ$$\circ.........\circ$$\circ-------math
\circ$$\circ-math
\circ$$\circ$$\circ--math
\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circmath
-----[math]1$$2(-)type\ 3$$\nearrow$$\downarrow
\circ$$\circ…1-to-1 to Y--3$$\times 3
-4$$\times 8
\circ$$\circ$$\circ---3$$\times 5
\circ$$\circ$$\circ$$\circ[math]1$$2(-)math
\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ
---------math
-
\circ$$\circ$$\circ
\circ$$\circ
\triangleleft$$\triangledown
\triangle$$\triangledown
\triangle$$\triangle
\triangle$$\triangle
\triangle$$\triangledown
deg\ 3$$deg\ 16$$deg\ 2$$deg\ 13$$deg\ 13$$deg\ 3$$deg\ 5$$deg\ 5$$deg\ 5$$deg\ 2$$deg\ 3$$deg\ 2
Close-up of the (-5)…(-2) map (light blue arrow)\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\color[rgb]{1,0,0}\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ$$\circ------------------
\circ$$\circ$$\circ$$\circ$$\circ$$\circ------
\triangle$$\triangle$$\triangledown$$\triangledown$$\triangle$$\triangleright
Fig. 31
It is a routine exercise to write down the exact maps between the branches. Most of them are the same as for the First Framework, and the rest are left to the reader. This framework has three rational Belyi maps, above the three forked vertices on the graph of . Two of them, for the (-5)-curves and the (-2)-curves are the same as those in the First Framework. The third one, for the (-1)-curves, has degree 5 and the following ramification data:
- •
above : 1 point with ramification 5 (this point can be chosen to be );
- •
above : 1 point with ramification 3 and 1 point with ramification 2;
- •
above : 1 point with ramification 2 and 3 points with ramification 1.
This Belyi map can be given by the function .
Like in the previously considered frameworks, it is not hard to figure out the pair of degrees of the possible Keller map: .
6. Explanations and Comments
As you have undoubtedly realized, the above frameworks are far from random. So I will first describe where they came from, and then briefly discuss some open questions that may help us solve the Jacobian Conjecture in dimension 2. Some of the proofs in this section are only sketched, and certain degree of familiarity with the papers [4] and [5] is required.
A lot of the discussion in this section will revolve around the curves with label 0. They seem to be of great significance for the problem. We already know that for all other curves the labels are sufficient to reconstruct their self-intersection numbers. It is also clear from the Keller Map Adjunction Formula that 0-curve on is either of type 2 or is sent by to a 0-curve on .
As noted in the Introduction, our frameworks basically come from repeatedly blowing up a point on until becomes of type 1. I say “basically”, because in some cases it more natural to use not the line at infinity at but to a Hirzebruch curve, which is a curve defined as follows:
Definition 6.1**.**
A Hirzebruch curve is the exceptional section of some Hirzebruch surface , considered as a compactification of . This is a curve that is obtained after one blowup at infinity from .
The Hirzebruch curve has label (-1) and determinant label 0 (to be described below). In our first two frameworks (Figures 10 and 22), this is the curve with the label (-1) on the long branch from the (-2)-curve. It is because we use this curve and not that at the end of the construction of we contracted a couple of curves on . And we also stopped a little short of making this a type 1 curve, we just went until all curves of type 3 do not go through its image. In the Three-dessin Framework (Figure 31) this is the curve on on which the third Belyi map is defined, but there we did use and then contracted a couple of curves.
Suppose on is a Hirzebruch curve. Then it cannot be of type 3 or 4, because then a generic fiber on the Hirzebruch surface would be mapped entirely into which is clearly impossible. So the procedure described above makes sense and must terminate.
Since we are resolving one divisorial valuation on , the graph of will only have vertices (curves) with 1, 2, or 3 neighbors (i.e. with valency 1, 2, or 3). One can show, using the Keller condition and some adjunction inequalities, that all curves above the curves with valency 1 also have valency 1, and (cf. [6], Theorem 4.7). Likewise, all curves above curves with valency 2 must have valency 2. And above curves with valency 3 we have rational Belyi maps.
From the rules for the labels, we can easily deduce that if in the process of constructing we create a curve with a positive label, all our future curves must have a positive label. So since the image of the Hirzebruch curve, once it is of type 1, must have negative label, all labels on must be non-positive.
The other restriction to this process comes from the determinant labels. We recall their definition from [5].
Definition 6.2**.**
Suppose and are as above. Then the determinant label of the divisorial valuation corresponding to is the determinant of the Gram matrix of minus-intersection form on all curves at infinity of except . That is,
[TABLE]
The determinant labels are much harder to deal with than the labels. In particular, in order to have recursive formulas for them, we need to introduce determinant labels of edges of the graph, and the formulas are somewhat more complicated. Please see [5] for the details.
If the determinant label of a curve is positive, then one can contract all other curves in the analytic category. If it is negative, then there exists an effective divisor with support in the union of all other curves and positive self-intersection.
Theorem 6.1**.**
Suppose on is a Hirzebruch curve, and it is of type 1. Then must have label (-1) and a positive determinant label.
Proof.
Suppose By Lemma 2.1, the label of must divide the label of , so it has to be (-1).
As for the determinant label of , suppose first that it is negative. Then there is a divisor supported on all other curves at infinity on such that Then which contradicts the fact that the determinant label of is nonnegative.
Suppose now that the determinant label of is 0. Then itself must by a Hirzebruch curve on (this can be proven similar to Theorem 4.4 of [5]). One of the fibers of the corresponding fibration consists entirely of curves at infinity. So its full pullback to consists of curves at infinity that do not include and thus it intersects trivially with , a generic fiber of the Hirzebruch fibration that corresponds to . So intersects trivially with the fiber of the fibration on , thus it is a fiber itself. This map from a fiber to a fiber is clearly 1-to-1. Therefore by [9] is not a Keller map. ∎
Corollary 6.1**.**
All curves on have non-negative determinant labels.
Proof.
One can see (cf. [5]) that once we create a curve with a negative determinant label, all determinant labels afterwards will be also negative. ∎
Theorem 6.2**.**
The curves at infinity on generate the Mori cone of effective curves of .
Proof.
Suppose is an irreducible curve on that is not a curve at infinity. It is equivalent to We just need to show that all are nonnegative. Suppose the opposite. Then in the Picard group of where are effective, supported outside of , have no common support, and . Multiplying by we get that So with equality if and only if and . Take any curve in the support of If has positive determinant label, we get a contradiction right away. If it has determinant label 0, then one of its branches (the irreducible components of its complement in the graph of curves at infinity) can support a divisor with self-intersection 0. However, so . Thus, there is a curve at infinity that intersects positively with So for a small a contradiction. ∎
Corollary 6.2**.**
Suppose is an irreducible curve on that is not a curve at infinity. Then either or and is a fiber of some Hirzebruch fibration.
Proof.
Because is linearly equivalent to an effective divsor at infinity, If recall that all labels are nonpositive, so is a linear combination of curves at infinity with negative coefficients. Thus, From the adjunction formula for , this implies that is rational and smooth, and . This means that either intersects transversally one curve with label (-1), or it intersects transversally two curves with labels 0, or it has intersection of multiplicity 2 with one curve with label 0. In the first case, is a fiber of a Hirzebruch fibration; the other two cases can be ruled out as follows. From [5], the sum of the label and the determinant label of any curve at infinity is always odd. So the determinant labels of 0-curves are strictly positive. The linear combination of curves at infinity that is equivalent to cannot contain the curve(s) with label 0 that intersects, so it must have negative self-intersection, a contradiction. ∎
Moreover, similarly to the main idea of [4], one can prove the following theorem.
Theorem 6.3**.**
Suppose on is a Hirzebruch curve, and it is of type 2 (i.e. is a point). Recall the Stein factorization with the middle surface . Then for every curve of type 3 on either contains or intersects a curve with label 0 and no other curve at infinity. (Recall that has exactly one point at infinity (cf. [4]).
Proof.
Suppose that are the exceptional curves of type on , and are the corresponding ramification indices. The Keller Map Adjunction Formula asserts that
[TABLE]
Following [4], we call the di-critical log-ramification divisor.
For each we have the following adjunction inequality (like in [4], proof of Theorem 3.2):
[TABLE]
where the valency of , is the number of points on , that lie on other curves at infinity on As a corollary,
[TABLE]
If intersects on one or more curves with negative labels, So
[TABLE]
Given that is of type suppose Consider the set of di-critical curves on that do not contain but do intersect some curve of type 1 with negative label. Consider the divisor . Then does not intersect with any not in its support, so Therefore, and does not contain . But this implies that the support of is a union of one or more full fibers of the Hirzebruch fibration corresponding to . If that is is not empty, this implies that so support of contains , a contradiction. ∎
The proof above also implies that once is a curve, all images of a type 3 (di-critical) curves can only intersect curves with labels 0. Therefore, during the process of creation of the point initially has all images of the curves of type 3 passing through it, and it is “losing them” along the way, by creating a curve with label 0 and then going back into the “negative territory”. The following picture shows the curves on . The red curves are of images of the curves of type 3, the blue dot is :
Fig. 32...-1$$\downarrow$$\varphi(\pi^{-1}_{*}(\infty))-1$$\varphi(type\ 3)$$\bullet
...\circ$$\circ-[math]\downarrow$$\varphi(\pi^{-1}_{*}(\infty))-[math]\varphi(type\ 3)$$\varphi(type\ 3)
...\circ$$\circ$$\circ--[math]\swarrow$$\downarrow$$\searrow$$\varphi(\pi^{-1}_{*}(\infty))
\searrow$$\searrow$$\searrow$$\searrow
It makes sense to stop the process after all curves of type 3 are sent to intersect exclusively with curves with labels 0; this is how our frameworks were obtained.
Another feature of our frameworks has to do with a certain 0-curve on Z. It is the first 0-curve that was created on Z, the curve number 3 on Figure 7 for the First Framework and Figure 21 for the Second Framework. It was proven in [5], Theorems 4.1 and 4.2, that every curve on with a negative and negative determinant label must have such curve as an ancestor. All type 1 curves that are mapped to the original line at infinity on the (the curve number 1 on ) have this property. Moreover, they are “simultaneously determinant-negative”: removing them all from the graph of produces negative-definite minus-self-intersection form. These collections of curves were discussed in section 5 of [5]. It can actually be shown that they all must lie “outside of a single Hirzebruch curve” (curve number 2 on Figure 7 for the First Framework and Figure 21 for the Second Framework).
It is important to understand that while some parts of our frameworks may appear random or miraculous, they are not. In particular, the degrees of the maps on the chain of curves between the forked curves with labels (-5) and (-2) (13 and 23, depending in the framework) can be calculated as the index of the cyclic quotient singularity obtained by contracting the chain of the curves on between the two forked curves there. The possible types of maps from the branches also have toric origin. The number of various branches can be calculated from the total ramification of the Belyi maps.
Several questions, some more concrete than the others, naturally appear in relation to our frameworks.
Question 6.1**.**
Is there a simple reason why in the First Framework there is no map ? If so, it would be really helpful, as it might help pre-screen any further framework examples, before embarking on tedious and time-consuming computer calculations.
Question 6.2**.**
Can one construct an explicit infinite series of frameworks? This definitely seems possible, even with just two Belyi maps.
Question 6.3**.**
Can one formalize the notion of a framework, and to actually find ALL solutions to this combinatorial problem (or, more realistically, all “small” solutions, in some reasonable sense)?
Question 6.4**.**
There are several questions regarding the notion of the isotope. Are there any more isotopes of the First Framework? Do the Second Framework and the Three-dessin Framework have other isotopes, and can they be classified? Does every framework have only finitely many isotopes?
Question 6.5**.**
Do our frameworks actually provide maps from the tubular neighborhood of the union of curves at infinity on , without the curves of type 3 and 4, to the tubular neighborhood of the union of curves at infinity on ? It seems like we get maps between the abelianizations of the fundamental groups, but is it enough?
Question 6.6**.**
The smallest topological degree of the Keller maps that would come from our frameworks is 16. The current best lower bound for a topological degree of a Keller map is 6 ([16]). Can one use some ideas from Section 6 to greatly improve this bound?
Question 6.7**.**
(The biggest question of all). Can one actually use our frameworks to contruct a Keller map? If you have some time and knowledge in computing, I am very open to collaboration, and will be glad to share with you many further details beyond the discussion at the end of section 3.
Acknowledgments. The author is forever indebted to Vasilii Alekseevich Iskovskikh, who introduced him, and many others, to the beauty of birational geometry. The author is also indebted to David Wright, Ed Formanek, and Adrian Vasiu for stimulating discussions related to the Jacobian Conjecture. Additionally, the author wants to thank his colleagues at Binghamton University and University of Pittsburgh, in particular Marcin Mazur, Bogdan Ion, and Thomas Hales, for their interest and patient support.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S.S. Abhyankar. Lectures on expansion techniques in algebraic geometry. Notes by Balwant Singh. Tata Institute of Fundamental Research Lectures on Mathematics and Physics , 57 . Tata Institute of Fundamental Research, Bombay, 1977. iv+168 pp.
- 2[2] S.S. Abhyankar. Dicritical divisors and Jacobian problem. Indian J. Pure Appl. Math. 41 (2010), no. 1, 77–97.
- 3[3] A. Borisov. Boundedness theorem for Fano log-threefolds. J. Algebraic Geom. 5 (1996), no. 1, 119–133.
- 4[4] A. Borisov. On the Stein factorization of resolutions of two-dimensional Keller maps. Beitr. Algebra Geom. 56 (2015), no. 1, 299–312.
- 5[5] A. Borisov. On two invariants of divisorial valuations at infinity. J. Algebraic Combin. 39 (2014), no. 3, 691–710.
- 6[6] A. Borisov. On resolution of compactifications of unramified planar self-maps. Preprint (2012). Web address: http://front.math.ucdavis.edu/1110.5118
- 7[7] Jorge Alberto Guccione, Juan José Guccione, Rodrigo Horruitiner, Christian Valqui. The Jacobian Conjecture: Approximate roots and intersection numbers, peprint (2017, 2018). Web address: https://arxiv.org/abs/1708.09367
- 8[8] Arno van den Essen. Polynomial automorphisms and the Jacobian conjecture. Progress in Mathematics , 190. Birkhauser Verlag, Basel, 2000.
