Field generators in two variables and birational endomorphisms of $\mathbb{A}^2$
Pierrette Cassou-Nogu\`es, Daniel Daigle

TL;DR
This paper surveys the topics of field generators and birational endomorphisms of the affine plane in two variables, including new insights, originating from Abhyankar's seminar in the 1970s.
Contribution
It provides a comprehensive survey with significant new material on field generators and birational endomorphisms of the affine plane.
Findings
Introduction of new results on field generators in two variables.
In-depth analysis of birational endomorphisms of the affine plane.
Historical context from Abhyankar's seminar in the 1970s.
Abstract
This article is a survey of two subjects: the first part is devoted to field generators in two variables, and the second to birational endomorphisms of the affine plane. Each one of these subjects originated in Abhyankar's seminar in Purdue University in the 1970s. Note that the part on field generators is more than a survey, since it contains a considerable amount of new material.
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.
Taxonomy
TopicsAdvanced Differential Equations and Dynamical Systems · Algebraic Geometry and Number Theory · Polynomial and algebraic computation
††footnotetext: 2010 Mathematics Subject Classification. Primary: 14R10, 14H50.††footnotetext: Key words and phrases: Affine plane, birational morphism, plane curve, rational polynomial, field generator, dicritical.
Field generators in two variables
and birational endomorphisms of
Pierrette Cassou-Noguès
and
Daniel Daigle
In memory of Shreeram S. Abhyankar.
IMB, Université Bordeaux 1
351 Cours de la libération, 33405, Talence Cedex, France
Department of Mathematics and Statistics
University of Ottawa
Ottawa, Canada K1N 6N5
Abstract.
This article is a survey of two subjects: the first part is devoted to field generators in two variables, and the second to birational endomorphisms of the affine plane. Each one of these subjects originated in Abhyankar’s seminar in Purdue University in the 1970s. Note that the part on field generators is more than a survey, since it contains a considerable amount of new material.
Research of the first author partially supported by Spanish grants MTM2010-21740-C02-01 and MTM2010-21740-C02-02.
Research of the second author supported by grant RGPIN/104976-2010 from NSERC Canada.
This article is a survey of two subjects: the first part of the paper is devoted to field generators in two variables, and the second to birational endomorphisms of the affine plane. Each one of these subjects originated in Abhyankar’s seminar in Purdue University in the 1970s. The authors of the present article were introduced to these questions by Peter Russell, who participated in Abhyankar’s seminar and who made early contributions to both problems.
As explained in Section 1, the two subjects are entangled one into the other. It is therefore natural to present them together in a survey. Note that Part I is more than a survey, since it contains a considerable amount of new material (see Section 1); and that Part II is less than a survey, since it restricts itself to certain particular aspects of the subject under consideration (see Section 6).
Conventions
The symbol “” means strict inclusion of sets, “” means set difference, and .
If is a subring of a ring , the notation means that is -isomorphic to a polynomial algebra in variables over . If is a field extension, means that is a purely transcendental extension of , of transcendence degree . We write for the field of fractions of a domain .
If is a field and (i.e., is a polynomial ring in two variables over ) then a coordinate system of is an ordered pair satisfying . We define to be the set of coordinate systems of . A variable of is an element satisfying for some .
Consider . For each , we write for the total degree of as a polynomial in (let us agree that ). We set
[TABLE]
Given a field , we write for the affine plane over , i.e., for some . By a coordinate system of , we mean a coordinate system of . That is, a coordinate system of is an satisfying . The set of coordinate systems of is denoted or simply ; so .
By “curve” we mean “irreducible and reduced curve”.
Part I: Field generators
Throughout Part I, the following convention about the base field is in effect:
- •
In all examples, is tacitly assumed to be an algebraically closed field of characteristic zero.
- •
Everywhere else, denotes an arbitrary field unless the contrary is explicitly specified.
1. Introduction
1.1 Definition**.**
Let and . A field generator of is an satisfying for some . A good field generator of is an satisfying for some . A field generator which is not good is said to be bad.
The notions of good and bad field generators are classical. The two fundamental articles on this subject were written by Russell in 1975 and 1977 (cf. [Rus75] and [Rus77]). The main results of those two papers will be explained in the course of the present article. Bad field generators were once supposed not to exist, then two examples were given, the first one by Jan [Jan74] (unpublished) in 1974, of degree 25, and the second one by Russell [Rus77] in 1977 of degree 21. There were no more examples until 2005, when the first author showed [CN05] that for any there exists a bad field generator of such that .
It is an open question to classify field generators.
Throughout Part I we shall use the convention that the notation “” means that all of the following conditions are satisfied:
[TABLE]
Observe that if , then is a field generator of iff it is a field generator of . So the problem of classifying field generators is intertwined with that of describing all pairs , or equivalently, with the problem of classifying birational endomorphisms of . The latter problem is the subject of Part II of the present paper, and is a hard and interesting problem in its own right. It therefore seems reasonable to keep those two problems separated, i.e., if our aim is to classify field generators, then we should primarily try to classify those field generators that are not composed with a birational endomorphism. A polynomial that is not composed with a birational endomorphism is said to be “lean”:
1.2 Definition**.**
Let . We say that * is lean in * if, for each such that , there holds . We say that admits a lean factorization if there exists such that and is lean in .
The problem of classifying field generators contains the following subproblems:
- (i)
Determine which field generators do not admit a lean factorization, and classify them. 2. (ii)
Classify the field generators that are lean.
By composing the polynomials (ii) with all birational endomorphisms of one obtains precisely all field generators that admit a lean factorization; then adding the polynomials (i) to this set gives all field generators. We regard (i) and (ii) as the most interesting components of the problem of classifying field generators. There is, however, another aspect that is of crucial importance:
- (iii)
Describe how field generators behave under birational extensions .
In some sense, (iii) is a theme that underlies the whole paper. Results 2.13, 2.14, 5.3, 5.7 and 5.9 are good illustrations of the type of theory that (iii) calls for.
Before discussing (i) and (ii), we need to define the notions of very good and very bad field generators. We already noted that if , then is a field generator of iff it is a field generator of . Moreover, if is a good field generator of then it is a good field generator of (and consequently, if it is a bad field generator of then it is a bad field generator of ). However, it might happen that be a bad field generator of and a good field generator of . These remarks suggest the following:
1.3 Definition**.**
Let be a field generator of .
- (1)
is a very good field generator of if it is a good field generator of each satisfying . 2. (2)
is a very bad field generator of if it is a bad field generator of each satisfying .
Problem (i) is partially solved by 5.4, which asserts that the field generators that do not admit lean factorizations are precisely the very good field generators. This is in fact the reason why we became interested in the concept of very good field generator. The very good field generators are not yet classified, but Sections 4 and 5 give several results about them (4.1, 5.11 and various examples and remarks).
Problem (ii) is probably the hardest part of the whole question. Although Section 5 gives some results on this subject, our understanding is still very incomplete.
Most of the results given in Sections 2–4 can be found in the article [CND14a]. However, most of the examples never appeared in the literature before. All the material of Section 5 is new. Note in particular that 5.14 gives an example of a very bad field generator that is also lean, and that no such example was known before.
1.4 Remark**.**
If is an algebraically closed field of characteristic zero then is a field generator of if and only if it is a “rational polynomial” of . (By a rational polynomial of , we mean an element such that, for all but possibly finitely many , is irreducible and the plane curve “” is rational.) For this equivalence and analoguous results in positive characteristic, see [Dai14].
2. Dicriticals
2.1 Definition**.**
Given a field extension , let be the set of valuation rings satisfying , and .
Given a pair such that and , define
[TABLE]
Then is a nonempty finite set which depends only on the pair . For each , let be the maximal ideal of . Let be the distinct elements of and for . Then we define
[TABLE]
where is an unordered -tuple of positive integers.
Given and , we call the elements of the dicriticals of , or of in ; given , we call the degree of the dicritical .
Except for the notations, our definitions of “dicritical” and of “degree of dicritical” are identical to those given by Abhyankar in [Abh10] (see the last sentence of page 92). The following fact is very useful for determining the degree list of an explicit polynomial:
2.2 Lemma**.**
Assume that is algebraically closed, let and . Let be the morphism determined by the inclusion . Then there exists a (non unique) commutative diagram
[TABLE]
where is a nonsingular projective surface, the arrows “” are open immersions and is a morphism. Among the irreducible components of , let be the curves that satisfy , and for each , let be the degree of the surjective morphism . Then .
Proof.
We sketch the proof, and refer to [CND14a, 2.3] for details. For each , let be the generic point of . Then the local rings are valuation rings, \mathbb{V}^{\infty}(F,A)=\big{\{}\,\mathcal{O}_{X,\xi_{i}}\,\mid\,1\leq i\leq t\,\big{\}} and, for each , the degree of is equal to . ∎
We shall make tacit use of 2.2 in all examples of the present paper. In practice, we find a diagram (1) by resolving the base points of the linear system on defined as \Lambda(F)=\big{\{}\,V(aF^{*}(X,Y,Z)+bZ^{n})\,\mid\,(a:b)\in\mathbb{P}^{1}\,\big{\}}, where and is the standard homogenization of .
The following fact appears as “” in the proof of [Rus75, 3.8], and is also a special case of [CND14a, 2.5]:
2.3 Corollary**.**
If is a field generator of and , then .
2.4 Lemma**.**
Let , and . Then
[TABLE]
Proof.
Let ; let us prove that
[TABLE]
We first consider the case where is an infinite field. For each , let . Since , there exists a unique such that . Moreover,
[TABLE]
Consider the field . Since and is a root of the polynomial , (3) implies that
[TABLE]
Let . For each , let and let be the valuation such that ; note that at most one element satisfies . Since is infinite, we may choose satisfying
[TABLE]
We claim:
[TABLE]
Indeed, let and observe that . If then . If then and . This proves (4).
Since , for all valuations of over other than . This and (4) implies that the divisor of poles of is where for all . Consequently,
[TABLE]
so (2) is true whenever is an infinite field.
Now drop the assumption on (so is now an arbitrary field). Pick an indeterminate transcendental over , let and . Since , we may consider and . It is easy to see that
[TABLE]
Let us adopt the temporary notation where . It’s enough to show:
[TABLE]
Indeed, we have by the first part of the proof and the fact that is an infinite field, so if (6) is true then we are done. To prove (6), consider , let and consider the field extensions:
[TABLE]
Since is algebraic over and is purely transcendental over , is linearly disjoint from over ; thus . As this holds for each , (5) implies
[TABLE]
which is exactly (6). ∎
2.5 Observation** ([Rus75, Rem. after 1.3]).**
Let be a field generator of . Then is a good field generator of if and only if “” occurs in the list .
Remark**.**
Recall that in all examples of Part I, is assumed to be an algebraically closed field of characteristic zero (see the introduction to Part I). The terms “Newton polygon” and “Newton tree” are sometimes used in the examples below. The Newton polygon of a polynomial is the convex hull in of \{0\}\cup\big{\{}\,(i,j)\,\mid\,a_{ij}\neq 0\,\big{\}}; the sides of that polygon that are not included in the axes of coordinates are called the “faces” of the Newton polygon. See [CN11] for the notion of Newton tree. From the Newton tree at infinity of , one can deduce the genus of the curve “” for general ; however, readers not familiar with these notions may ignore Newton trees altogether, and use the well known genus formula (more is said about this in 2.6).
2.6 Example**.**
The first example of bad field generator was given by Jan (A. Sathaye kindly gave us the equation of that polynomial). Let and
[TABLE]
It has two points at infinity. The Newton polygon has two faces, one linking the point to the point with slope and the other one linking the point to with slope .
Let denote the standard homogenization of . At the point , we have
[TABLE]
After the blowups: and divide by , and divide by , and and divide by , the strict transform of is
[TABLE]
In view of 2.2, this shows that we have four dicriticals of degree , corresponding to the roots of (these four dicriticals are over the point ). At the point , we have
[TABLE]
After the blowups: and divide by , and divide by , and and divide by , we get
[TABLE]
After the change we have with , and is a polynomial in of degree . This proves that (over the point ) we have one dicritical of degree . Then
[TABLE]
From the above computations one deduces the configuration of singularities at infinity, from which one obtains the Newton tree at infinity of shown in Figure 1. From that Newton tree—or directly from the configuration of singularities at infinity and the genus formula—it follows that (for general ) the plane curve “” is rational. So is a rational polynomial and hence (1.4) a field generator of . By 2.5, is a bad field generator of .
The second example of bad field generator was given by Russell in [Rus77], and is the following polynomial of degree :111There were some misprints in the polynomial given in [Rus77]. The polynomial that is displayed here is the correct one.
[TABLE]
We shall refer to this polynomial as “Russell’s polynomial”. It is a bad field generator of , where is an arbitrary field. The same paper contains the following fact, valid for an arbitrary field (we use the notation \mathbb{Z}_{\leq 25}=\big{\{}\,x\in\mathbb{Z}\,\mid\,x\leq 25\,\big{\}}):
2.7**.**
Let , then
[TABLE]
2.8 Example**.**
We give an infinite family of bad field generators of degree . Given , let , and define by
[TABLE]
Let us sketch the proof of:
[TABLE]
For , consider the standard homogenization of and the corresponding local equations and at the points and respectively.
At the point , after the blowups dividing by , dividing by , dividing by , changing , blowup dividing by , again dividing by , changing , we get a dicritical of degree .
At the point , we apply dividing by and we get dicriticals of degree where is the number of distinct roots of .
So where “” occurs times. The genus formula shows that is a rational polynomial and hence a field generator of ; by 2.5, is a bad field generator of , proving (8).
Let us declare that are equivalent if there exists such that \theta\big{(}{\rm\bf k}[G]\big{)}={\rm\bf k}[F]. We shall now prove:222The meaning of “almost all” is made precise in (10).
[TABLE]
Let be the set of bad field generators of of degree satisfying:
- (i)
the support of with respect to is included in ; 2. (ii)
if we write () then
[TABLE]
See 3.1 for “support” and “”. The set of all polynomials satisfying (i) can be identified with , so we may view as a subset of . The appendix of [Rus77] proves, among other things, that (a) every bad field generator of of degree is equivalent to an element of ; and (b) is a locally closed subset of , and is an irreducible algebraic variety of dimension (isomorphic to the given there). We shall prove:
[TABLE]
We begin by enlarging the family . Let and, for each , define by
[TABLE]
Note that is the right-hand-side of Equation (7) and hence is a member of the family . One can check that, for every , and satisfying , one has
[TABLE]
and hence
[TABLE]
Taking and gives
[TABLE]
then taking and gives
[TABLE]
So, for every , is equivalent to a member of \big{\{}F_{R}\big{\}}. In particular, is a bad field generator. It follows that if we define , then . So we have the morphism of varieties
[TABLE]
and each element of the image of is equivalent to a member of \big{\{}F_{R}\big{\}}. Direct calculation shows that satisfies
[TABLE]
These equations show that if is an element of such that then at most one satisfies . Since the image of is not included in the zero-set of , and since , it follows that is a birational morphism. In particular, the image of contains a dense Zariski-open subset of . Since we have already established that each element of the image of is equivalent to a member of , (10) is proved. This also proves the first part of claim (9). We don’t know whether contains all bad field generators of degree up to equivalence.
The aforementioned appendix also describes the possible configurations of singularities at infinity, for a bad field generator of of degree . That analysis (from the last paragraph of p. 328 to the diagram at the top of p. 330) implies that must be one of , , . It is therefore interesting to note that these three lists are realized by the family .
To prove the second part of claim (9), consider elements and of and suppose that . We may write and with . There exists such that \theta\big{(}{\rm\bf k}[F]\big{)}={\rm\bf k}[G]; then for some and . The fact that the supports of and are included in implies that and for some . Then we must have . Write ; each is a polynomial expression in that can be computed explicitly, and we must have for all . Calculation gives , so . So there exists such that and where . After substituting these values in the expression of , we find , so . After substituting this value, we find , so and hence . It follows that and hence that . This completes the proof of (9).
Let us also point out that Russell’s polynomial is , which is equivalent to the member of , i.e., the member corresponding to . It has and its Newton tree is given in Figure 2.
The next example gives a new family of bad field generators that shows that neither the number of dicriticals nor their degrees are bounded (and we show in 5.15 that these bad field generators are lean). This family generalizes Jan’s polynomial.
2.9 Example**.**
Let where , and . Denote by
[TABLE]
the reciprocal polynomial of . Let
[TABLE]
Thus ; since
[TABLE]
we have . This polynomial has degree . The monomial with top degree is . The Newton polygon has two faces. One face links the point to the point and has slope . The other face links the point to the point and has slope . We shall now prove:
[TABLE]
Let
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Consider first
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Consider the map . Then:
, where ;
, where ;
, where
[TABLE]
, where .
Consider the map . Then:
;
, where ;
, where
[TABLE]
, where .
Finally, consider the map . Then:
, where ;
, where
[TABLE]
, where .
We have , then . Let . We get with . This proves that, over the point , we get one dicritical of degree .
Consider next
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Consider the map . Then:
, where
[TABLE]
, where ;
, where
[TABLE]
, where .
Consider the map . Then:
, where ;
, where ;
, where
[TABLE]
, where .
Consider the map . Then:
;
, where ;
, where
[TABLE]
, where .
One can write
[TABLE]
This implies that, over the point , there are dicriticals of degree where is the number of distinct roots of . The Newton tree of is in Figure 3. From that, or from the genus formula, we see that is a rational polynomial, hence a field generator of . So assertion (11) is proved.
Until the end of this section, is an arbitrary field.
2.10 Notation**.**
Let . Given , we let denote the set of prime ideals of such that the composite is an isomorphism. We also let \Gamma(F,A)=\big{\{}\,V({\mathfrak{p}})\,\mid\,{\mathfrak{p}}\in\operatorname{\Gamma_{\!\text{\rm alg}}}(F,A)\,\big{\}}, i.e., is the set of curves which have the property that the composite is an isomorphism. Note that is a bijection .
We shall now study how field generators behave under birational extensions.
2.11 Definition**.**
Let be a morphism of nonsingular algebraic surfaces over . Assume that is birational, i.e., that there exist nonempty Zariski-open subsets and such that restricts to an isomorphism . By a missing curve of we mean a curve such that is a finite set of closed points. A contracting curve of is a curve such that is a point. We write and for the sets of missing curves and contracting curves of , respectively. Note that and are finite sets.
2.12 Notation**.**
Consider morphisms where is birational and is dominant. Then we write
[TABLE]
We refer to the elements of as the “-horizontal” missing curves of .
Our next objective is to study how and behave under a birational extension of . This is accomplished by 2.13 and 2.14, which are respectively results 2.9 and 3.11 of [CND14a]. See the introduction for the notation “”.
2.13 Proposition**.**
Let and , and consider the morphisms
[TABLE]
determined by the inclusions . Let be the distinct elements of and, for each , let be the degree333Let be integral domains and the corresponding morphism of schemes. Assume that is a finite extension of . Then we define . of the morphism .
- (a)
\Delta(F,B)=\big{[}\Delta(F,A),\delta_{1},\dots,\delta_{h}\big{]}, i.e., is the concatenation of and . In particular, . 2. (b)
For each , .
2.14 Lemma**.**
Let and , and consider the morphisms
[TABLE]
determined by the inclusions . Then:
- (a)
For each , . 2. (b)
The set map , , is injective, and its image is the set of for which there exists a curve such that is an isomorphism .
3. The cardinality of for field generators
Proposition 2.13 shows the importance of for field generators. We will see two important features of that set: if is a field generator of then (i) for a suitable , all elements of are lines “ constant” or “ constant”; (ii) except for a very special case, the cardinality of is at most .
3.1 Definition**.**
Let .
- (1)
Given and a pair such that , write where for all ; then \operatorname{{\rm supp}}_{\gamma}(F)=\big{\{}\,(i,j)\in\mathbb{N}^{2}\,\mid\,a_{ij}\neq 0\,\big{\}} is called the support of with respect to . 2. (2)
Given a subset of , let denote its convex hull. 3. (3)
Given , we write for the set of ordered pairs satisfying and
[TABLE]
Let be the set of satisfying the additional condition “”. Clearly,
[TABLE] 4. (4)
By a rectangular element of we mean an satisfying .
See 3.6, below, to understand why the notion of rectangular element is relevant for studying field generators.
3.2 Lemma** ([CND14a, 3.4]).**
Let be a rectangular element of .
- (a)
If then
[TABLE] 2. (b)
Up to order, the pair in 3.1(3) depends only on , i.e., is independent of the choice of .
3.3 Definition**.**
For each rectangular element of we define
[TABLE]
By 3.2, is well defined and depends only on .
Moreover, if and then
[TABLE]
3.4 Remark**.**
Let be a rectangular element of and let . It follows from 3.2(b) that if then .
We shall now consider the set defined in 2.10. By the next fact, is easy to describe when is a rectangular element of .
3.5 Lemma** ([CND14a, 3.7]).**
Let be a rectangular element of , and . Recall that
[TABLE]
Write () and define
[TABLE]
- (a)
* is equal to*
[TABLE] 2. (b)
If then is included in
[TABLE]
The next result (3.6) is due to Russell, and has proved to be very useful in the study of field generators. Here, one should observe that no variable of is a rectangular element of , because any rectangular element has two points at infinity.
3.6 Theorem** ([Rus75, 3.7 and 4.5]).**
If is a field generator of which is not a variable of , then is a rectangular element of .
We now turn our attention to the cardinality of where is a field generator of . Note that there is no upper bound on for rectangular elements of and even for certain types of field generators:
3.7 Examples**.**
Let .
- (a)
Let , where ; then is a rectangular element of and 3.5 implies that equals the number of roots of . 2. (b)
Assume that is infinite and let where ; then 3.5 implies that . Since , is a good field generator of (of an especially simple type).
3.8 Theorem** ([CND14a, 4.11]).**
Let be a field generator of satisfying . Then there exists such that and for some .
The above theorem is one of the main results of [CND14a]. Its corollary (below) has interesting consequences in the classification of field generators (for instance, 3.9(a) is needed in the proof of 4.1(b)).
3.9 Corollary** ([CND14a, 4.12]).**
If is a bad field generator of then the following hold.
- (a)
** 2. (b)
* and the pair satisfies .* 3. (c)
There exists such that
[TABLE]
3.10 Examples**.**
Using 3.5, we see that and . We will see examples of bad field generators of satisfying , but we do not have examples such that
4. Very good and very bad field generators
The next proposition gives a partial characterization of very good field generators. For the moment, this is the best that we can say on that subject. (In part (a), let us agree that .)
4.1 Proposition** ([CND14a, 5.3]).**
Let be a field generator of and .
- (a)
If \gcd\big{(}\{d_{1},\dots,d_{t}\}\setminus\{1\}\big{)}>1 then is a very good field generator of . In particular, if at most one satisfies then is a very good field generator of . 2. (b)
If at least three satisfy then is a very good field generator of . 3. (c)
If is a good but not very good field generator of then
[TABLE]
where “” occurs either or times, , and
.
4.2 Remark**.**
By 4.1(a), the polynomials classified in [MS80], [NN02] and [Sas06] are special cases of very good field generators. This gives many complicated examples of very good field generators.
4.3 Example**.**
Let be a bad field generator of such that and . For example take for . Let and note that . Consider the morphisms determined by the inclusions . Then the missing curves of are and and these are -horizontal, so . In the notation of 2.13 we have (because ), so that result implies that . Note that * is not a very good field generator of * (because it is bad in ). This shows that, in 4.1(b), one cannot replace “at least three” by “at least two”; and in the second part of 4.1(a), one cannot replace “at most one” by “at most two”.
Another application of 2.13 shows that is a good field generator of which is not very good and which has .
4.4 Remark**.**
We shall give in 5.13 an example of a very good field generator of with . So the converse of 4.1(c) is not true. Moreover, noting that in 4.3, this will also show that
There exist good field generators of such that is very good, is not very good, and .
So the degree list does not characterize very good field generators among good field generators.
The set characterizes very bad field generators among bad field generators: result 4.5(a) gives such a characterization and, in fact, makes it easy to decide whether a given bad field generator is very bad.
4.5 Proposition** ([CND14a, 5.8]).**
Let be a bad field generator of .
- (a)
* is a very bad field generator of if and only if .* 2. (b)
Suppose that . Then there exists such that and . For any such pair , is a good field generator of .
4.6 Example**.**
Let be a bad field generator of such that (for instance, for any choice of ; see 3.10). By 4.5, is not a very bad field generator of . Let and note that ; so is a field generator of and we claim:
[TABLE]
To see this, consider as in 2.13. We have where and where . If is a point then and 2.13(a) implies that ; if is not a point then and 2.13(a) implies that where is the degree of , and where by 2.13(b) and because . Since “” does not occur in by 2.5, it follows (in both cases) that it does not occur in either; so (by 2.5 again) is a bad field generator of .
In view of 4.5, there only remains to show that . Suppose that there exists an element of . Then 2.14 implies that is an isomorphism. This is not the case, because (the maximal ideal is a point of but not of ). This proves (12).
Observe that the very bad field generators (of ) constructed in 4.6 are not lean in , due to the method of construction. All examples of very bad field generators given in [CND14a] are constructed by that same method, and hence are not lean. In 5.14, below, we give the first example of a very bad field generator that is also lean.
5. Lean field generators
See the introduction for the statement of the problems “(i)” and “(ii)”, that will occupy us in this section. See in particular 1.2 for the definition of the property of being lean. We immediately observe:
5.1 Lemma**.**
If is a good field generator of , then is not lean in .
Proof.
Since is a good field generator of , we may pick such that ; then and . ∎
The paper [CND] (in preparation) contains the following result:
5.2 Theorem**.**
For , the following are equivalent:
- (a)
* does not have a lean factorization.* 2. (b)
There exists a very good field generator of such that .
We shall now give the proof of the special case 5.4 of 5.2, because it is considerably simpler than that of the general case, and because we only need this special case in the present paper. The proof of the special case is based on simple minded degree considerations, an approach that does not seem to work in the general case. See the introduction for the notations regarding degree.
5.3 Lemma**.**
Let be a rectangular element of .
- (a)
* for any .* 2. (b)
* for every strict inclusion .*
Proof.
Consider an inclusion where , and is a rectangular element of . Choose such that . Choose ; then
[TABLE]
If we define and then and, for each , ; so
[TABLE]
Since , we have
[TABLE]
and consequently
[TABLE]
Assertion (a) follows from the special case of (14). To prove (b) we note that the condition implies (by (a) and (13)) that , so . ∎
5.4 Proposition**.**
For a field generator of , the following are equivalent:
- (a)
* has a lean factorization.* 2. (b)
* is not a very good field generator of .*
Proof.
Suppose that (b) holds. Then there exists such that and is a bad field generator of . Consider the set \Sigma=\big{\{}\,R\,\mid\,\text{F\in R\preceq A^{\prime}}\,\big{\}}, which is nonempty since . For each , is a bad field generator of and hence (by 3.6) a rectangular element of . So 5.3 implies that if is a strict inclusion with , then . It follows that has a minimal element . Then and is lean in , so (a) is true.
Conversely, suppose that (a) holds. Then there exists such that and is lean in . Then (by 5.1) is a bad field generator of , so (b) holds. ∎
Result 5.4 partially solves problem “(i)” stated in the introduction. To complete the solution of (i) there would remain to classify very good field generators, but this question is open.
We shall now make some modest contributions to the problem (called “(ii)” in the introduction) of classifying lean field generators. Recall (5.1) that if a field generator is lean then it is bad. Also observe that, by 5.4, it is a priori clear that lean field generators exist (we know that there exists a bad field generator of , and 5.4 implies that there exists satisfying and such that is lean in ; then is a bad field generator of that is lean in ). For specific examples, consider 2.8 with:
5.5 Corollary**.**
Every bad field generator of degree is lean.
Proof.
Let be a bad field generator of such that . By contradiction, assume that is not lean in . Then for some such that . Then is a bad field generator of , so 2.7 gives the first inequality in
[TABLE]
while the second inequality is 5.3. This contradicts the assumption. ∎
It is much more difficult to determine whether there exist very bad field generators that are lean. In fact this question remained open for several years. The very bad field generators exhibited in 4.6 are—by construction—not lean. In 5.14, below, we give an example of a very bad field generator that is lean. First, we need to develop some tools.
5.6 Notation**.**
Given a birational morphism and a coordinate system of , we write
[TABLE]
See 2.11 for the notation , and observe444This is well known and easy to show when is algebraically closed (e.g., [CND14b, 2.6(b)]), and it is straightforward to generalize this to arbitrary . that is empty if and only if is an automorphism of .
5.7 Lemma**.**
Assume that is algebraically closed. Let where is a rectangular element of and let be the morphism determined by the inclusion . Then
[TABLE]
Moreover, if then the above inequality is strict for all .
Proof.
Let . If then and the claim is an immediate consequence of 5.3. So we may assume throughout that . Under this assumption we shall prove that .
Choose such that ; let be an irreducible element of such that . Pick . Let us first prove that
[TABLE]
where we define and . Note that is given by the formula , where we use coordinates (resp. ) to identify the set of closed points of (resp. ) with . As maps to a point , we have . In particular,
[TABLE]
So (15) is proved. Since ,
[TABLE]
We have and, for each , ; so
[TABLE]
Since by 5.3, inequalities (15) and (17) imply
[TABLE]
Assume for a moment that equality holds in (18). Then equality must hold in (17) (so ) and in (16) (so ). As , it follows that are associates, so are algebraically dependent, a contradiction. So inequality (18) is strict, and the lemma is proved. ∎
5.8 Notation**.**
Let and . Write and let be the set of nonempty subsets of satisfying and \gcd\big{\{}\,d_{i}\,\mid\,i\in I\,\big{\}}=1. Define:
[TABLE]
5.9 Lemma**.**
Let be a field generator of . Then
[TABLE]
for every satisfying and such that is a bad field generator of .
Proof.
Suppose that and that is a bad field generator of . We have by 5.3. By 2.13, is a sublist of ; so we may write and where . Since is a bad field generator of , we have by 2.5 and by 2.3, so and hence . Since by 2.4, we are done. ∎
5.10 Notation**.**
Let , where . For each we define
[TABLE]
where denotes the set of irreducible elements of such that in for some .
5.11 Corollary**.**
Assume that is algebraically closed and let be a field generator of . If there exists satisfying
[TABLE]
then exactly one of the following conditions is satisfied:
- (a)
* is a bad field generator of and is lean in ;* 2. (b)
* is a very good field generator of .*
Proof.
Assume that there exists a as in the above statement and that condition (b) is not satisfied. Then , where we define
[TABLE]
We claim that . Indeed, assume the contrary. Because , there exists an satisfying . Then the birational morphism is not an isomorphism; so (cf. [CND14b, 2.6(b)]) and each element of is an irreducible component of a fiber of ; consequently, . By the assumption, it follows that . Note that is a rectangular element of , because it is a bad field generator of . So by 5.7 we get , so , which contradicts 5.9.
This contradiction shows that and hence that (a) holds. ∎
The following is a technical lemma that we need in 5.13, 5.14 and 5.15. We say that an element of a ring “is a power” if for some and .
5.12 Lemma**.**
Assume that is algebraically closed and that is a rational polynomial of . Let , let be distinct elements of and suppose that, for each , we have a factorization with . Moreover, assume that for each there exists such that one of the following conditions is satisfied:
- (i)
* and is not a power, and is not a power, and ;* 2. (ii)
, and is not a power, and is not a power, and .
Then \big{\{}\,t\in{\rm\bf k}\,\mid\,\text{F-tA}\,\big{\}}=\{t_{1},\dots,t_{d-1}\} and
[TABLE]
for each .
Proof.
For each , denote by the number of irreducible components of the closed subset “” of . Then (see, e.g., [Dai14, 1.11]), since is algebraically closed and is a rational polynomial of ,
[TABLE]
Let S=\big{\{}\,t\in{\rm\bf k}\,\mid\,\text{F-tA}\,\big{\}} and note that if then (otherwise would be a power, so would be reducible for all , which would contradict the definition of rational polynomial). Then formula (19) implies that and that for all .
Fix ; let us prove that are irreducible. Since , there exist irreducible such that and with and . Interchanging if necessary, we may arrange that . Choose such that (i) or (ii) holds. Given , write and . We have and similarly for , , .
Assume that (ii) holds. Then , , and , so:
[TABLE]
so and . Since and are not powers we get , so are irreducible (in case (ii)). The argument in case (i) is left to the reader. ∎
The following examples construct field generators and use 5.11 to establish their properties. The relevance of Example 5.13 is explained in 4.4.
5.13 Example**.**
Define by
[TABLE]
The polynomial is a rectangular polynomial of bidegree . We claim:
[TABLE]
First note that the Newton polygon of has faces with face polynomial , and . The last one produces a dicritical of degree . We study the two other.
Let .
We first consider and we apply the blowups divided by , divided by and divided by and then the change . We get
[TABLE]
with . Then the face with face polynomial produces a dicritical of degree .
Now consider and apply divided by , divided by and divided by . Apply the change . We get
[TABLE]
with , which proves that we have a dicritical of degree . So . The Newton tree at infinity of this polynomial is shown in Figure 4.
It is easy to check that is a rational polynomial (hence a field generator) of .
Two fibers of are reducible namely, let
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We have and ; then 5.12(ii) implies that these are the prime factorizations of and respectively, and that is irreducible for all . So (where ) and
[TABLE]
By 5.11, is a very good field generator of , so (20) is proved.
5.14 Example**.**
Let . Define by
[TABLE]
[TABLE]
Let
[TABLE]
Then is a rectangular polynomial of degree . Its Newton tree at infinity is in Figure 5.
It follows that is a rational polynomial (hence a field generator) of with . We claim:
[TABLE]
Indeed, we have by 3.5(b); as and , 3.5(a) gives . Then is a very bad field generator of by 4.5.
Lemma 5.12(i) implies that is irreducible for every and that is the prime factorization of ; thus (where ) and
[TABLE]
So 5.11 implies that is lean in , i.e., (21) is proved.
5.15 Example** (Continuation of 2.9).**
We showed in 2.9 that the polynomials are bad field generators of . We now prove:
[TABLE]
Let . Define We have
[TABLE]
[TABLE]
[TABLE]
Let be a root of the polynomial (observe that ). Then
[TABLE]
where and . Note that (). Also,
[TABLE]
By 5.12(ii), we find that \big{\{}\,t\in{\rm\bf k}\,\mid\,\text{F_{CND}-t is reducible}\,\big{\}} is the set of roots of and that, for each root , is the prime factorization of . Consequently, . Then
[TABLE]
so 5.11 implies that is lean in .
5.16 Remark**.**
Let . Given , let us use the temporary notation
[TABLE]
Then 2.9 and 5.15 show that the set
[TABLE]
is not bounded.
5.17 Remark**.**
The polynomial555Let be the element of the family of 2.8 obtained by setting ; then . is a bad field generator of degree in with . It has the same Newton tree as Russell’s polynomial. It is a lean bad field generator such that
[TABLE]
Now the same is a bad field generator of of degree , with , and which is not lean in . So there exist bad field generators with two dicriticals and which are not lean, and there exist lean field generators of satisfying
[TABLE]
One has to note that in those two cases the reducible fiber is not reduced.
Part II: Birational endomorphisms of the affine plane
Throughout Part II, denotes an algebraically closed field of arbitrary characteristic and is the affine plane over .
6. Introduction
By a birational endomorphism of , we mean a birational morphism from to (cf. 2.11). The set of birational endomorphisms of is a monoid under composition of morphisms,666In fact is a cancellative monoid, since it is included in the Cremona group of . and the group of invertible elements of this monoid is the automorphism group of . An element of is irreducible if it is not invertible and, for every factorization of with , one of is invertible.
The birational morphism , , is an example of a non-invertible element of . One can ask:
[TABLE]
That question was posed in Abhyankar’s seminar at Purdue University in the early 70s, and was given a negative answer by P. Russell, who gave an example (which appeared later in [Dai91a, 4.7]) of an irreducible element of which is not of the form with .
The above question and its answer eventually gave rise to further studies of the monoid . The reader is referred to [CND14b] for a summary of the state of knowledge and a bibliography of this subject. Our aim, here, is to briefly review some results of [CND14b] that are directly related to question . Section 7 gathers some observations that show that if is any subset of such that generates , then has to be large. Section 8 reviews what is known about the submonoid of generated by the set .
Let us give some definitions, notations, and facts.
Elements are said to be equivalent () if for some . This is indeed an equivalence relation on the set , but keep in mind that the conditions and do not imply that .
We write for the equivalence class of an element of .
Let . Recall from 2.11 that has finitely many contracting curves and missing curves. Let (resp. ) be the number of contracting (resp. missing) curves of . Clearly, if then and . By [Dai91a, 4.3(a)], for every .
Consider the map , from to , defined in [Dai91a, 1.2(a)] or [CND14b, 2.3]. Then [Dai91a, 2.12] shows that
[TABLE]
and it is pointed out in [CND14b, 2.6(b)] that
[TABLE]
Statements (22) and (23) immediately imply that each non-invertible element of is a composition of irreducible elements, i.e.,
[TABLE]
Facts (22–24) were known in the time of [Dai91a] and [Dai91b], but were not stated explicitly. Essentially nothing is known regarding uniqueness of factorizations.
In view of (24), it is natural to ask whether one can list all irreducible elements of up to equivalence. However, various examples and facts indicate that contains a great diversity of irreducible elements of arbitrarily high complexity, and this suggests that the task of finding all of them may be hopeless. In this regard, let us mention that [Dai91a, 4.12] implies in particular:
[TABLE]
The results reviewed in Section 7 strengthen the impression that there are too many irreducible elements to describe them. It therefore makes sense to turn our attention, as we do in Section 8, to other types of questions regarding the structure of the monoid .
7. Irreducible elements and generating sets
The results of this section show that question , stated in the introduction to Part II, has a “very negative” answer. The first three results are 4.1–4.3 of [CND14b]. The proof of the first one is based on Example 4.13 of [Dai91a], which constructs a family of irreducible elements of ; the proof shows that that family already contains nonequivalent irreducible elements of . The vertical bars denote cardinality (recall that is algebraically closed, so is an infinite cardinal).
7.1 Lemma** ([CND14b, 4.1]).**
\big{|}\big{\{}\,[f]\,\mid\,\text{f\operatorname{{\rm Bir}}(\mathbb{A}^{2})}\,\big{\}}\big{|}=|{\rm\bf k}|.
In the next result, (i) (ii) is clear and the converse easily follows from the fact that the monoid has factorizations into irreducibles.
7.2 Lemma** ([CND14b, 4.2]).**
For any subset of , the following are equivalent:
- (i)
* is a generating set for the monoid ;* 2. (ii)
for each irreducible , .
The next fact is an immediate consequence of 7.1 and 7.2:
7.3 Corollary** ([CND14b, 4.3]).**
Let be a subset of such that is a generating set for the monoid . Then .
A question posed by Patrick Popescu-Pampu asks whether one can find a set such that generates and the elements of have bounded degree. Result 7.5, below, gives a negative answer to that question. First, we define what we mean by the degree of an element of . See the general introduction for the notions of coordinate system of or , and for the degree(s) of an element of . Let denote the set of coordinate systems of .
7.4 Definition**.**
Let .
- (a)
Let . Using to identify with , we can consider that is given by for some unique polynomials . We define . 2. (b)
Define \operatorname{\text{\sc deg}}f=\min\big{\{}\,\deg_{\gamma}f\,\mid\,\gamma\in{\mathfrak{C}}\,\big{\}} and
[TABLE]
Note that , for every and .
7.5 Corollary**.**
Let be a subset of such that is a generating set for the monoid . Then \big{\{}\,\operatorname{\text{\text@underline{\sc deg}}}f\,\mid\,f\in S\,\big{\}} is not bounded.
Remark**.**
This is a slight improvement of Corollary 4.5 of [CND14b], which states that \big{\{}\,\operatorname{\text{\sc deg}}f\,\mid\,f\in S\,\big{\}} is not bounded. The following proof is a small modification of that of [CND14b, 4.5], and inequality (25) slightly improves [CND14b, 4.4].
Proof of 7.5.
Remark 4.4 of [CND14b] shows that for every , where is the number of contracting curves of . Given , we may choose such that ; since , it follows that . We showed:
[TABLE]
Now let be as in the statement, and let . By [Dai91a, 4.13], there exists an irreducible element satisfying . By 7.2, there exists satisfying ; then , so by (25). ∎
8. Some properties of in
Let denote the set of coordinate systems of .
Let , use to identify with , and define an element by . Then the equivalence class is independent of the choice of ; the elements of are called simple affine contractions (SAC).
By (22) and (23), all elements of \big{\{}\,f\in\operatorname{{\rm Bir}}(\mathbb{A}^{2})\,\mid\,n(f)=1\,\big{\}} are irreducible. Now [Dai91a, 4.10] implies:
[TABLE]
So SACs are irreducible and, in fact, SACs are the simplest irreducible elements and the simplest non-invertible elements of .
Let be the submonoid of generated by automorphisms and simple affine contractions. Equivalently, given any , we may describe by:
[TABLE]
One has by 7.3, or because question (in the introduction of Part II) has a negative answer.
8.1 Definition**.**
Let be a submonoid of a monoid . We say that is factorially closed in if the conditions and imply that .
For instance, note the following trivial fact:
8.2 Lemma**.**
Let be a monoid and a homomorphism of monoids. Then \big{\{}\,x\in\mathcal{M}\,\mid\,\delta(x)=0\,\big{\}} is factorially closed in .
By (22), (23) and 8.2, we see that is factorially closed in . However, the following question turns out to be much more difficult:
[TABLE]
There are several reasons why is a natural question, for instance its relation with the open question of uniqueness of factorizations in :
8.3 Lemma**.**
Suppose that has the following property:
[TABLE]
Then is factorially closed in .
Proof.
Suppose that (27) is true. Then we may define a homomorphism of monoids, , by stipulating that if are irreducible elements of then , and for all . Define for ; then (23) implies that for each irreducible , and that for each ; thus
[TABLE]
We have \big{\{}\,f\in\operatorname{{\rm Bir}}(\mathbb{A}^{2})\,\mid\,n(f)\leq 1\,\big{\}}\subseteq\mathcal{A}\subseteq\big{\{}\,f\in\operatorname{{\rm Bir}}(\mathbb{A}^{2})\,\mid\,\delta(f)=0\,\big{\}} by (23) and (26). If satisfies then either or for some irreducible elements of ; in the first case it is clear that , and in the second case we have (for each ) , so ; so in both cases, showing that \mathcal{A}=\big{\{}\,f\in\operatorname{{\rm Bir}}(\mathbb{A}^{2})\,\mid\,\delta(f)=0\,\big{\}}. The desired conclusion follows from 8.2. ∎
Because we don’t know whether has property (27), it is interesting to see that is indeed factorially closed in :
8.4 Theorem** ([CND14b, 4.8]).**
If satisfy , then .
We want to mention another result of [CND14b] related to . It is customary to define families of elements of by requiring that their missing curves (or sometimes their contracting curves) satisfy some condition or other. For instance, the introduction of Section 3 of [CND14b] defines three subsets of by that method. Let us consider in particular , which is defined to be the set of satisfying:
there exists a coordinate system of with respect to which all missing curves of have degree .
Note that \operatorname{{\rm Aut}}(\mathbb{A}^{2})\cup\big{\{}\,c_{\gamma}\,\mid\,\gamma\in{\mathfrak{C}}\,\big{\}}\subseteq S_{\text{\rm w}}.
8.5 Example**.**
Choose a coordinate system of and use it to identify with . Define by , and . As c\in\big{\{}\,c_{\gamma}\,\mid\,\gamma\in{\mathfrak{C}}\,\big{\}} and , we have and hence . The singular curve is a missing curve of , so and hence . As , this also shows that is not closed under composition of morphisms.
Remark**.**
Russell constructed an example (which appeared later in [Dai91a, 4.7]) of an element of with three missing curves , where (with respect to a suitable coordinate system of ) and are the lines and , and is the parabola . Note that for each , there exists a coordinate system of with respect to which has degree . However, since consists of two points, no coordinate system of has the property that . So . This shows that, in order for to belong to , it is not enough that each individual missing curve be isomorphic to a line; the correct condition is that the missing curves be “simultaneously rectifiable”.
As a consequence of Theorem 3.15 of [CND14b], one has:
8.6 Corollary**.**
The set is included in .
Note that Theorem 3.15 of [CND14b] gives a complete description of the three subsets of , and that it does so by describing which compositions of automorphisms and simple affine contractions give elements of each of these sets.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Abh 10] Shreeram S. Abhyankar. Dicritical divisors and Jacobian problem. Indian J. Pure Appl. Math. , 41:77–97, 2010.
- 2[CN 11] P. Cassou-Noguès. Newton trees at infinity of algebraic curves. In Affine algebraic geometry , volume 54 of CRM Proc. Lecture Notes , pages 1–19. Amer. Math. Soc., Providence, RI, 2011.
- 3[CN 05] P. Cassou-Noguès. Bad field generators. In Affine algebraic geometry , volume 369 of Contemp. Math. , pages 77–83. Amer. Math. Soc., Providence, RI, 2005.
- 4[CND] P. Cassou-Noguès and D. Daigle. Lean factorizations of polynomial morphisms. In preparation.
- 5[CND 14a] P. Cassou-Noguès and D. Daigle. Very good and very bad field generators. To appear in Kyoto J. of Math.
- 6[CND 14b] P. Cassou-Noguès and D. Daigle. Compositions of birational endomorphisms of the affine plane. To appear in Pacific J. of Math.
- 7[Dai 91a] D. Daigle. Birational endomorphisms of the affine plane. J. Math. Kyoto Univ. , 31(2):329–358, 1991.
- 8[Dai 91b] D. Daigle. Local trees in the theory of affine plane curves. J. Math. Kyoto Univ. , 31(3):593–634, 1991.
