Jet vanishing orders and effectivity of Kohn's algorithm in dimension $3$
Sung-Yeon Kim, Dmitri Zaitsev

TL;DR
This paper introduces jet vanishing orders as geometric invariants to improve Kohn's algorithm for subelliptic estimates in dimension 3, providing explicit bounds, stability under perturbations, and demonstrating sharpness through examples.
Contribution
It develops a new selection algorithm using jet vanishing orders, achieving effective termination with explicit bounds and enhanced stability, advancing the understanding of subelliptic multipliers in complex analysis.
Findings
Effective bounds for algorithm steps and subellipticity order
Stability under high order perturbations demonstrated
Complete procedure illustrated for perturbations of known examples
Abstract
We propose a new class of geometric invariants called jet vanishing orders, and use them to establish a new selection algorithm in the Kohn's construction of subelliptic multipliers for special domains in dimension , inspired by the work of Y.-T. Siu [S10]. In particular, we obtain effective termination of our selection algorithm with explicit bounds both for the steps of the algorithm and the order of subellipticity in the corresponding subelliptic estimates. Our procedure possesses additional features of certain stability under high order perturbations, due to deferring the step of taking radicals to the very end of the algorithm. We further illustrate by examples the sharpness in our technical results and demonstrate the complete procedure for arbitrary high order perturbations of the Catlin-D'Angelo example [CD10] in Section 5. Our techniques here may be of broader interest…
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.
Jet vanishing orders and effectivity
of Kohn’s algorithm in dimension
Dedicated to Professor Ngaiming Mok on the occasion of his th birthday
Sung-Yeon Kim* and Dmitri Zaitsev
S.-Y. Kim: Center for Mathematical Challenges, Korea Institute for Advanced Study, 85 Hoegiro, Dongdaemun-gu, Seoul, Korea
D. Zaitsev: School of Mathematics, Trinity College Dublin, Dublin 2, Ireland
Abstract.
We propose a new class of geometric invariants called jet vanishing orders, and use them to establish a new selection algorithm in the Kohn’s construction of subelliptic multipliers for special domains in dimension , inspired by the work of Y.-T. Siu [S10]. In particular, we obtain effective termination of our selection algorithm with explicit bounds both for the steps of the algorithm and the order of subellipticity in the corresponding subelliptic estimates. Our procedure possesses additional features of certain stability under high order perturbations, due to deferring the step of taking radicals to the very end, see Remark 1.2 for more details.
We further illustrate by examples the sharpness in our technical results (in Section 3) and demonstrate the complete procedure for arbitrary high order perturbations of the Catlin-D’Angelo example [CD10] in Section 5.
Our techniques here may be of broader interest for more general PDE systems, in the light of the recent program initiated by the breakthrough paper of Y.-T. Siu [S17].
Key words and phrases:
Finite type, Multiplier ideals, Jacobian, subelliptic estimates, jets, germs of holomorphic functions, order of contact, -Neumann problem
1991 Mathematics Subject Classification:
32T25, 32T27, 32W05, 32S05, 32B10, 32V15, 32V35, 32V40
*This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning (grant number NRF-2015R1A2A2A11001367)
Contents
-
1.1 Kohn’s algorithm for special domains and subelliptic estimates
-
4.1 Step 1; selecting a multiplier with minimal vanishing order
1. Introduction
In his seminal paper [K79], J.J. Kohn invented a purely algebraic construction of ideals of subelliptic multipliers for the -Neumann problem. The goal of this note is to propose a new class of geometric invariants, called jet vanishing orders, that permits us to obtain a fine-grained control of the effectiveness in the Kohn’s construction procedure of subelliptic multipliers for the so-called special domains of finite D’Angelo type [D79, D82] in .
Since this paper is dedicated to Professor Ngaiming Mok, we would like to mention a striking parallel between the Kohn’s subelliptic multipliers ideals and the varieties of minimal rational tangents (VMRT) pioneered by N. Mok and J.-M. Hwang [HM98]. Both theories connect global PDE or algebraic-geometric structures with local differential-geometric objects that can be treated by local geometric and analytic methods, subsequently leading to important consequences of global nature. For more details on the VMRT, see the articles and lecture notes by Hwang and Mok [Mo08, H14]. Another important parallel is historical. The VMRT theory was developed to study deformation rigidity problems originated from the celebrated Kodaira-Spencer’s work on deformation of complex structures, with an important ingredient coming from D. Spencer’s program to generalize the Hodge theory of harmonic integrals. And it was the same program that led Spencer to formulate the -Neumann problem, for which Kohn invented his multiplier ideals approach to tackle the problem of local regularity (see [K-etal04] for a more detailed account).
Note that Kohn’s original procedure in [K79] gives no effective bound on the order of subellipticity in subelliptic estimates, as illustrated by examples of G. Heier [He08] and D.W. Catlin and J.P. D’Angelo [CD10], see §1.2 and §5 below. On the other hand, Y.-T. Siu [S10, S17] obtained a new effective procedure for special domains and outlined an extension of the special domain approach to general real-analytic and smooth cases. Also note that for the special domains of the so-called triangular form in , a different effective procedure in Kohn’s algorithm was given by Catlin-D’Angelo [CD10, Section 5]. Triangular systems were first introduced by D’Angelo [D95] under the term regular coordinate domains, where also an effective procedure for obtaining subelliptic estimates was provided. See also D.W. Catlin and J.-S. Cho [CC08] and T.V. Khanh and G. Zampieri [KhZa14] for subelliptic estimates for triangular systems by a different method, and A. Basyrov, A.C. Nicoara and the second author [BNZ17] for an approximation of general smooth pseudoconvex boundaries by triangular systems of sums of squares matching the Catlin multitype. We next mention that A.C. Nicoara [N14] proposed a construction for the termination of the Kohn algorithm in the real-analytic case with an indication of the ingredients needed for the effectivity. We further refer to [K79, K84, D95, DK99, S01, S02, K04, S05, S09, CD10, S10, S17] for more profound and extensive discussion of subelliptic multipliers (see also [Ch06] for an algebraic approach), as well as surveys [Si91, BSt99, FS01, M03, St06, MV15] and books [Mr66, FK72, Tr80, Ho90, D93, CS01, O02, Za08, St10, Ta11, Ha14, O15] for the -Neumann problem in broader context.
In relation to Kohn’s foundational work on the subelliptic multipliers, we would like to mention a remarkable new development in the field due to Siu [S17] providing new techniques of generating multipliers for general systems of partial differential equations, including, as a special case, a new procedure even for the case of the -Neumann problem.
Finally we mention the related important Nadel’s multiplier ideal sheaves [Na90] that were originally motivated by the ones defined by Kohn [K79] and are in some sense dual to them. See [S01, §4], [S09, 1.4.6] for more detailed discussions of the relation between both types of multipliers, and the expository articles and books [S01, S02, De01, L04, S05, S09] for further information.
1.1. Kohn’s algorithm for special domains
and subelliptic estimates
We shall consider so-called special domains as introduced by Kohn in [K79], defined locally near the origin by holomorphic functions in the first variables:
[TABLE]
where is any collection of holomorphic functions vanishing at the origin in (and defined in its neighborhood).
Understanding Kohn’s multipliers for the special domains is important, on the one hand, due to their link with local analytic and algebraic geometry, and on the other hand, through their connection with more general cases via D’Angelo’s construction of associated families of holomorphic ideals [D93, Chapter 3] and Siu’s program relating special domains approach with general real-analytic and smooth cases [S10, II.3, II. 4].
Next recall the Kohn’s algorithm or, more precisely, its holomorphic variant for special domains (1.1) (corresponding to in the notation of [K79] and to algebraic geometric formulation in [S17, 2.9.4]). For any set of germs of holomorphic functions at [math] in , consider the ideal generated by all function germs satisfying
[TABLE]
i.e. by all Jacobian determinants
[TABLE]
Then the Kohn’s [math]th multiplier ideal for (1.1) is defined as the radical
[TABLE]
and for any , the Kohn’s th multiplier ideal is defined inductively by
[TABLE]
The obtained increasing sequence of ideals is said to terminate at if contains the unit .
Kohn proved in [K79] that the necessary and sufficient condition for the ideal termination for special domains (in fact, for his more general algorithm applied to domains with real-analytic boundaries) is the finiteness of the D’Angelo type of at [math]. Note that Kohn’s algorithm is actually defined for domains with arbitrary smooth boundaries, in which generality, however, the corresponding termination remains a major open problem. For a special domain (1.1), the type equals , where is given by (1.3) and
[TABLE]
is the type of the set of holomorphic function germs, where the supremum is taken over all nonconstant germs of holomorphic curves and denotes the vanishing order of a smooth vector function at [math], given by the lowest order of its nonvanishing partial derivative at [math]. We refer to [D82, D93] for more detailed discussions of finite type and [M92b, BSt92, FIK96, D17, MM17, Z17] for equivalent characterizations in various particular cases, see also [FLZ14].
It follows from Kohn’s work [K79] that ideal termination at a boundary point leads to a subelliptic estimate of some order of subellipticity at that point, namely
[TABLE]
where and are respectively the tangential Sobolev norm of the (fractional) order and the standard norm on , is any form in the domain of the adjoint operator (with respect to the standard product on ), smooth up to the boundary and with compact support in a fixed neighborhood of in the closure , such that both and the real constant are independent of , see [K79, Definition 1.11] for more details. (Note that Kohn obtained his results for forms with arbitrary .) We mention that, even though the estimate (1.6) depends on the choice of local coordinates (or the metric used in the product), the subellipticity property (i.e. the existence of an estimate (1.6) for given ) is invariant [Sw72, Ce08, CeSt09].
In the same paper, Kohn further proved that his algorithm does terminate for pseudoconvex domains with real-analytic boundaries of finite type, leading to subelliptic estimates, based on a result of K. Diederich and J.E. Fornæss [DiF78] (see also E. Bedford and J.E. Fornæss [BF81], Siu [S10, Part IV] and Kohn [K10]). For pseudoconvex domains with smooth boundaries of D’Angelo finite type, subelliptic estimates are due to D.W. Catlin [C87] by a different method, whereas the termination of Kohn’s algorithm in that generality remains a major open problem (see e.g. the first problem in [DK99, Section 14]). Note that the finite type condition is also necessary for subelliptic estimates due to the work of P. Greiner [Gr74] in and D.W. Catlin [C83] in .
It is crucial to point out the particularly remarkable feature of Kohn’s procedure that allows us to study functional-analytic estimates such as (1.6) with purely geometric methods applied to ideals of holomorphic functions. Consequently, our approach here is accessible to any geometer without familiarity with the functional-analytic aspect of the problem.
1.2. Multipliers and effectivity
Recall [K79] that a germ at of a smooth function on the closure is a subelliptic multiplier with order of subellipticity if, for some representative of the germ, the estimate similar to (1.6) with replaced by holds under the same assumptions, namely
[TABLE]
where both and may depend on . It follows from Kohn’s work [K79, Section 4 and 7] that the ideals as defined in (1.4) consist of subelliptic multipliers, i.e. satisfy (1.7) with some order of subellipticity that may depend on the actual multipliers. More precisely, Kohn showed that taking a Jacobian determinant in (1.2) reduces the order of subellipticity by , whereas taking a root of order in the radical reduces it by . It is the last step where an effective control of may get lost, as it is a priori not clear what root order is required in order to obtain the full radical. In fact, examples of Heier [He08, Section 1.1] and Catlin-D’Angelo [CD10, Proposition 4.4] illustrate precisely that, i.e. the lack of control of as the parameter in the example goes to infinity, whereas the type remains bounded (see Section 5 below). See also Siu [S17, 4.1] for a more elaborate and detailed explanation of this important phenomenon. A perturbation of Catlin-D’Angelo’s example is treated in Section 5 below.
In order to regain the effectiveness, one needs to restrict the the number of steps and the root orders allowed in the radicals in terms of only the type and dimension, leading to an effective Kohn algorithm in the terminology of Siu [S17, 2.6]). In addition, it is desired to have algorithmic selection rules for constructing sequences of the actual multipliers ending with . Our goal here is to obtain a fine effectiveness control in terms of our new invariants (that are in turn controlled by the type) and a new selection procedure for the multipliers leading to an effective termination. In particular, we are going to the extreme to avoid taking radicals until the very last step, see Remark 1.2 below for details.
1.3. Applications and further directions
Among notable applications of subelliptic estimates (1.6), J.J. Kohn and L. Nirenberg [KN65] proved that the latter imply local boundary regularity of the Kohn’s solution of the -Neumann problem , i.e. the solution is smooth at those boundary points where is. See [K72, DK99] and the references therein for more detailed discussions of this and many other applications.
Another important application of subelliptic estimates, specifically demonstrating the importance of the effectivity, is a lower bound on the Bergman metric directly related to the order of subellipticity, due to J.D. McNeal [M92a]. The effective control in subelliptic estimates also plays important role in the construction of peak functions by J.E. Fornæss and J.D. McNeal [FM94] and in other results.
It should be noted that applications of Kohn’s algorithm and its effectiveness are not limited to subelliptic estimates. In their remarkable paper [DiF79], K. Diederich and J.E. Fornæss discovered a direct way of using Kohn’s multipliers to construct so-called plurisubharmonic “bumping” functions for arbitrary domains with real-analytic boundaries of finite type. The bumping functions are subsequently applied in the same paper for Kobayashi metric estimates and Hölder regularity of proper holomorphic maps. However, the exponents in the crucial estimates could not be effectively controled (in terms of the type and dimension) due to some steps involving Lojasiewicz inequality. Here effective procedures for generating multipliers would allow for more explicit quantitative conclusions.
In a more recent work, Kohn [K00, K02, K04] has demonstrated some new use of subelliptic multipliers by relating them to certain new microlocal subelliptic multipliers on real hypersurfaces, and establishing hypoellipticity of the and the -Neumann operator. In [K05] Kohn introduced an analogue of his theory of subelliptic multipliers for new classes of differential operators. See also L. Baracco [Ba15] and L. Baracco, S. Pinton and G. Zampieri [BaPZa15] for recent related results.
Inspired by Kohn’s original subelliptic multipliers, analogous notion of multiplier ideals for the compactness estimate were studied by M. Çelik [Ce08], E.J. Straube [St08], in their joint work [CeSt09] and by M. Çelik and Y.E. Zeytuncu [CeZ17]. Finally, we mention results by D. Chakrabarti and M.-C. Shaw [ChS11] connecting properties of the Kohn’s solution for individual domains with corresponding properties for to their products, with some of their results recently used by X.-X. Chen and S.K. Donaldson [ChD13] to study rigidity properties of complex structures.
1.4. Main results
Our main new tool is the following invariant number associated to a set of germs of holomorphic functions at [math] in , a germ of analytic subvariety in and an integer :
[TABLE]
where is the vector of all partial derivatives up to order , and the supremum is taken over the set of all nonconstant germs of holomorphic maps , and the vanishing order is as above. We call the -jet type of along . In particular, for , we obtain the D’Angelo type (1.5). It is easy to see that the -jet types form a non-increasing sequence for , and become equal to [math] whenever is greater or equal the minimum vanishing order of a germ in . Note that, even though the space of curves in (1.8) is infinite-dimensional, the computation of the -jet type in can be reduced to certain finite number of curves by a result of J.D. McNeal and A. Némethi [MN05] (see also [He08, LT08] for further results in this direction).
Since the effective termination is well-known if at least one function has order (see e.g. [CD10]), we shall assume that all functions vanish of order at [math]. The following is a simplified version (with rougher bounds) of the main result of the paper:
Theorem 1.1**.**
In the context of Kohn’s algorithm for special domains (1.1) in of D’Angelo finite type at [math], there is an effective algorithmic construction of a sequence of multipliers
[TABLE]
with , based on the invariants (1.8). Every is obtained by taking a Jacobian determinant of a linear combination of elements in the set
[TABLE]
except the two multipliers , that are in the radical of the ideal with a root order , i.e. .
Remark 1.2*.*
We would like to point out the following particular features in our multiplier construction in comparison to other known procedures. From the three different procedures in Kohn’s construction, namely (1) taking Jacobian determinants, (2) forming ideals and (3) taking the radicals, only the first one is used in our process to obtain a pair of multipliers generating an ideal of finite (effectively controlled) multiplicity. Only then the ideal is formed and the radical is taken to obtain the linear multipliers, leading to the termination.
In particular, our procedure possesses certain stability under high order perturbations, as illustrated in §5. Such stability is generally not available in procedures based on taking radicals. For instance, in the ring of germs of holomorphic functions at [math] in , is in the radical of the ideal generated by , but any perturbation with odd generates an ideal having no other germs in its radical, i.e. (since the zero variety of is locally irreducible at [math]). This problem does not occur in our construction because we only take radicals from ideals of finite codimension, where any germ vanishing at [math] is in the radical.
Corollary 1.3**.**
*For special domains (1.1) of finite type at [math] in , a subelliptic estimate (1.6) at [math] holds with the order of subellipticity *
[TABLE]
where is the number of multipliers in (1.9) and is the radical root order in Theorem 1.1.
Proof.
It follows from Kohn’s work [K79, Sections 4 and 7], that in the context of Theorem 1.1, a Jacobian determinant of the has the order of subellipticity (see [K79, (4.29, 4.64)] and [S17, 2.9.2]), and taking any further Jacobian determinant reduces the order of subellipticity by (see [K79, (4.42, 4.64)]), whereas taking a root of order reduces it by (see [K79, 4.36]). Applying these calculations to the construction in Theorem 1.1, we obtain the desired conclusion. ∎
Note that we obtained more refined bounds than those given in Theorem 1.1 and Corollary 1.3 in terms of our new invariants (1.8). Also we illustrate in Section 5 how our procedure can be applied to the Catlin-D’Angelo’s example as well as its higher order perturbations.
1.5. Overview of our procedure
Following [S10, S17], we call the functions in (1.1) pre-multipliers, to distinguish them from the multipliers obtained via the algorithm. It is important to emphasize that the pre-multipliers are only used inside the Jacobian determinants (1.2) but are never added to the ideals directly.
On a large scale, there are * major steps*, each reducing the dimension of the variety defined by the multipliers (resembling Kohn’s original algorithm for real-analytic hypersurfaces [K79]).
The first step consists of constructing the first multiplier as Jacobian determinant from the pre-multipliers with effectively bounded vanishing order at [math]. Our method gives a bound of at most . In fact, a finer bound is given in terms of the -jet types (as defined by (1.8)) of the pre-multipliers along their zero curves, see (4.1). Note that other bounds are known from the work of D’Angelo [D82, D93], Siu [S10, S17] and Nicoara [N12]. Any known effective bound can be used at this step to proceed with our construction.
The second major step aims to reduce the dimension of the variety
[TABLE]
from to [math]. Our method here is based on a sequence of minor steps constructing new multipliers that gradually reduce the jet order for which the -jet type along can be effectively bounded. The construction starts with (the vanishing order of ), and at every minor step, the order is reduced from to , where the new -jet type along gets an effective bound equal to the previous bound for the -jet type plus at most . In other words, lowering the jet order by a number increases the type bound by . In fact, the method gives a finer bound with replaced by the vanishing order of pre-multipliers only along curves in . Based on the configuration of the -jet types, multiple possible choices for are available (see Section 3 for details), where fewer Jacobian determinant iterations can be traded for possibly higher vanishing order bound and vice versa. At the end of this major step, we obtain a multiplier whose type (i.e. the ([math]-jet) type as defined for in (1.8)) along is effectively bounded by an estimate no worse than (where is the vanishing order of ). The proof is based on the core technical results in Section 3 with examples given illustrating the sharpness of the assumptions.
Finally, the third major step consists of taking the coordinate functions and in the radical of the finite type ideal , and subsequently their Jacobian determinant . The corresponding radical root order can be effectively bounded by
[TABLE]
in terms of the vanishing order of and the type of along . See Lemma 4.3 for the bound .
2. Vanishing orders, contact orders and jets
2.1. Normalised vanishing order
We write for a germ at [math] of a holomorphic function in (without specifying the value ), and
[TABLE]
for the vanishing order of , also called multiplicity in the literature, (the minimum is if the set is empty), where
[TABLE]
is a multiindex and
[TABLE]
is the corresponding partial derivative with respect to chosen coordinates . Clearly does not depend on the choice of local holomorphic coordinates.
More generally, for any set of germs of holomorphic maps (on the same ), define its vanishing order to be the minimum vanishing order for its elements:
[TABLE]
It is clear that , where is the ideal generated by . In particular, for any holomorphic map germ
[TABLE]
define its vanishing order to be the vanishing order of the set of its components, i.e.
[TABLE]
It is again easy to see that also does not depend on the choice of local holomorphic coordinates in in a neighborhood of .
Now following D’Angelo [D82, D93], for every germ of a holomorphic map
[TABLE]
define its normalized vanishing order of along by
[TABLE]
In case (considered here), the normalized vanishing order is invariant under singular parameter changes , where is any nonconstant germ of a holomorphic map. Similarly, for a set of holomorphic map germs, define its normalized vanishing order along by
[TABLE]
and again for the ideal generated by .
Note that in general, the normalized vanishing order may not be an integer, and, in fact, can be any rational number as the example
[TABLE]
shows.
It is easy to see that given , one has for a generic linear map . In general, can only become larger:
Lemma 2.1**.**
The normalized vanishing order of along any map is always greater or equal than the vanishing order:
[TABLE]
Proof.
Expanding into a power series with , and substituting , we conclude as desired. ∎
2.2. Contact order and finite type
Let be a set of germs of holomorphic functions . Then in view of Lemma 2.1 (and the remark before it), the vanishing order satisfies
[TABLE]
At the opposite end, define (as in [D82] and [D93, 2.3.2, Definition 9]) the contact order or the type of by
[TABLE]
(Note that the minimum in the right-hand side is always achieved, since the denominator in (2.1) is fixed.) We say that the set is of finite type if the latter number is finite. Since for the ideal generated by , we also have
[TABLE]
2.3. Contact order along subvarieties.
Let be a germ of a holomorphic map as before and any complex-analytic subvariety passing through [math]. Then the contact order of along is defined by
[TABLE]
where the supremum is taken over all non-constant germs of holomorphic maps .
In particular, if is (a germ of) an irreducible curve at [math], the right-hand side in (2.3) is independent of , since in this case, any two nonzero germs are related by a sequence of singular reparametrizations. In general, the contact order along is the maximum contact order along the irreducible components of at [math].
2.4. Jet vanishing orders
The main new tool in this paper is the following notion of jet vanishing order.
For every integer , and a germ of a holomorphic map , consider its -jet , which in local coordinates can be regarded as a germ of a holomorphic map
[TABLE]
(for suitable integer dependent on , and ) given by all partial derivatives of the components of up to order . Then define the -jet vanishing order of by
[TABLE]
which is also equal to .
Further, define the -jet normalized vanishing order of along a nonzero germ by
[TABLE]
(which are the minimum vanishing orders of the partial derivatives up to order along ), and the -jet contact order of along a subvariety by
[TABLE]
where as in (2.3), the supremum is taken over all non-constant germs of holomorphic maps . Note that again, this definition is independent of holomorphic local coordinates, and we have the monotonicity:
[TABLE]
As consequence of (2.4) and the definitions, we have the stabilisation property
[TABLE]
for any and any .
Similarly, for any set of germs of holomorphic maps , define the numbers
[TABLE]
that, in fact, depend only on the ideal generated by , where denotes the set of all -jets of elements in .
3. Control of jet vanishing orders for Jacobian determinants
This section is the technical core of the paper. Our goal is to obtain fine control of how the jet vanishing orders along curves change under taking Jacobian determinants. The main idea is to have a control of certain “good” terms in the multiplier expansion and to avoid possible cancellations with other terms. This is achieved via certain technical conditions comparing jet vanishing orders for different jet orders. We also illustrate by examples that our technical conditions are sharp.
For a holomorphic curve germ , we can always change coordinates to achieve
[TABLE]
We first give a comparison condition between jet vanishing orders and of a function germ along to guarantee that the minimum vanishing order along among partial derivatives of is achieved for its transversal derivatives.
Lemma 3.1**.**
Given satisfying (3.1) and a germ of a holomorphic map
[TABLE]
assume that the jet vanishing orders of along satisfy
[TABLE]
for some .
Then
[TABLE]
i.e. the minimum vanishing order among all partial derivatives of order is achieved for the th derivative transversal to (the image of) :
[TABLE]
Proof.
Assume on the contrary that
[TABLE]
for some and . We can choose and such that the minimum vanishing order is achieved, i.e.
[TABLE]
In view of (3.2), we must have the top order here, in particular, . Then
[TABLE]
as we have assumed . Differentiating in the parameter of , we obtain
[TABLE]
from which, using (3.5), we conclude
[TABLE]
Since our definition of the -jet vanishing order implies
[TABLE]
we have in view of (3.4) and (3.6),
[TABLE]
On the other hand, by our assumption (3.2), we have
[TABLE]
which contradicts (3.7) completing the proof. ∎
Example 3.2*.*
For
[TABLE]
compute
[TABLE]
Hence (3.2) is violated and the conclusion of Lemma 3.1 fails. This shows the sharpness of our assumption (3.2).
The following is our main technical result. Again, we need to assume a comparison condition between different jet vanishing orders to guarantee that the terms from lower order jets do not cancel with the terms providing the needed vanishing order control. Here we use different letters and for the function germs to emphasize their different roles. The role of is to provide the jet vanishing orders , whereas for , only the usual vanishing order is used.
Lemma 3.3**.**
Given germs of holomorphic maps
[TABLE]
suppose that
[TABLE]
and for some ,
[TABLE]
where is the -jet vanishing order along . Then the Jacobian determinant
[TABLE]
satisfies
[TABLE]
Proof.
By definition, we have
[TABLE]
and hence
[TABLE]
where the error terms are bilinear expressions in and .
After a coordinate change if necessary, we may assume that the assumptions of Lemma 3.1 are satisfied, in particular
[TABLE]
and .
Next our assumption (3.9) implies that the (normalized) vanishing order of the error terms in (3.10) along is strictly bigger than
[TABLE]
Therefore, to prove the lemma, it is enough to show that
[TABLE]
Since
[TABLE]
and
[TABLE]
substituting these into the first two terms in the right-hand side of (3.10), we obtain
[TABLE]
Since for ,
[TABLE]
we obtain by (3.9), (3.8) and Lemma 2.1,
[TABLE]
On the other hand, we have
[TABLE]
where in view of (3.3), the minimum of the vanishing order of the last expression for is achieved for and equals to
[TABLE]
Together with (3.13), this implies that the minimum for of the right-hand side in (3.12) equals (3.14). This gives the desired relation (3.11), completing the proof. ∎
Example 3.4*.*
Let
[TABLE]
Then
[TABLE]
In particular, our comparison assumption (3.9) is violated if and only if . Then for the Jacobian determinant as Lemma 3.3, we have
[TABLE]
and hence for and , the terms with cancel and we obtain
[TABLE]
failing the conclusion (3.9) of Lemma 3.3. Hence our assumption (3.9) is sharp.
As first direct consequence in combination with Lemma 2.1, we obtain an estimate for the (total) vanishing order of the Jacobian determinant:
Corollary 3.5**.**
Under the assumptions of Lemma 3.3,
[TABLE]
As next immediate consequence of Lemma 3.3, we obtain:
Corollary 3.6**.**
Given germs of holomorphic maps
[TABLE]
suppose that
[TABLE]
Then
[TABLE]
where either or .
Repeatedly applying Corollary 3.6, we obtain:
Corollary 3.7**.**
Given germs of holomorphic maps
[TABLE]
suppose that , and define inductively by
[TABLE]
Then for every , there exists such that
[TABLE]
In particular, for ,
[TABLE]
holds for some .
Proof.
Setting , we obtain from the definition of the -jet vanishing order that
[TABLE]
Then Corollary 3.6 implies that there exist such that
[TABLE]
Next let and repeat the argument for , to conclude that there exist such that
[TABLE]
We repeat this process to show inductively that for any positive integer , there exists such that
[TABLE]
as desired. ∎
4. Selection algorithm and Proof of Theorem 1.1
We shall write for the set of nonzero germs of holomorphic maps . Let be a set of holomorphic function germs with minimal vanishing order
[TABLE]
and the finite type
[TABLE]
4.1. Step 1; selecting a multiplier with minimal vanishing order
Choose any with minimal (total) vanishing order
[TABLE]
Then choose any in the zero set of (i.e. ). Finally choose any with
[TABLE]
and set
[TABLE]
Since , it is easy to see that
[TABLE]
where
[TABLE]
Then the multiplier
[TABLE]
satisfies for some ,
[TABLE]
in view of Lemma 3.3. In particular, it follows that the vanishing order
[TABLE]
Thus we have found a multiplier (as defined in §1.1) whose vanishing order is bounded by any of the above estimates.
Remark 4.1*.*
The main outcome of this step is to construct a multiplier with controlled vanishing order. Our method gives an explicit estimate for this order. Note that the initial function (pre-multiplier) is only used in this step. Once a multiplier is constructed, it will be used in the sequel for the curve selection and the computation of jet vanishing orders.
4.2. Step 2; selecting a multiplier with effectively bounded order along a zero curve of another multiplier
Now choose any multiplier with vanishing order
[TABLE]
Note that Step 1 yields such , however, any other with a sharper estimate can be chosen. Let be germs of curves parametrizing irreducible components of the zero set of . Choose with
[TABLE]
which can be any generic linear combination of elements in . Then Corollary 3.7 implies that
[TABLE]
where depending on , and
[TABLE]
Lemma 4.2**.**
Let , be two sets of germs of holomorphic maps and define inductively
[TABLE]
Write
[TABLE]
for the minimum vanishing order of functions in and assume that the type
[TABLE]
is finite. Assume further that
[TABLE]
Then for , the -jet type of satisfies
[TABLE]
In particular, for , we obtain
[TABLE]
Proof.
Choose with
[TABLE]
and let parametrize a curve in . By the definition of type, there exists with
[TABLE]
Then Corollary 3.7 implies that there exists a sequence such that
[TABLE]
which completes the proof. ∎
4.3. Step 3; selecting a pair of multpliers with
effectively bounded multiplicity and taking the radical
Let be the set of pre-multipliers and let
[TABLE]
Then Step 2 implies that there exists an integer such that
[TABLE]
Choose such that
[TABLE]
Then by the definition of , for each irreducible component of , there exists such that
[TABLE]
Choose a generic linear combination of . Then is a multiplier satisfying
[TABLE]
Lemma 4.3**.**
Let be the ideal generated by and . Let be the vanishing order and the contact order of along the zero curve of (i.e. the maximal vanishing order along an irreducible component). Then the multiplicity
[TABLE]
satisfies .
Proof.
The proof can be obtained by following the arguments of D’Angelo’s proof of Theorem 2.7 in [D82], more precisely, by combining [D82, (2.12)] with [D82, Lemma 2.11]. ∎
Remark 4.4*.*
A pair satisfying the assumptions of Lemma 4.3 can be an called an effective regular sequence. Recall that a regular sequence (see e.g. [D93, 2.2.3, Definition 6]) is any sequence in a local ring , if each is a non-zero-divisor in the quotient for any (for , the quotient needs to be interpreted as itself). In our case, the additional effectiveness of the regular sequence condition comes from the estimates of the two orders – the vanishing order of and the contact order of along the zero curve of . Note that for the conclusion of Lemma 4.3 to hold, we need to estimate the contact order (the maximum order over irreducible components of ) for rather than its vanishing order along (the minimum order over the irreducible components).
Corollary 4.5**.**
Under the assumptions of Lemma 4.3, for , one has for any germ of holomorphic function with , i.e. contains the -th power of the maximal ideal.
Proof.
The statement follows directly from the inequality in [D82, Theorem 2.7], see also [D93, 2.1.6, Page 57], where is the minimal power of the maximal ideal contained in and is the multiplicity. ∎
Proof of Theorem 1.1.
By Corollary 4.5, we have as multipliers, where
[TABLE]
implying, in particular,
[TABLE]
Taking the th roots of , and taking their Jacobian determinant, we obtain the last multiplier leading to the algorithm termination. Furthermore, taking generic linear combinations at each step, we obtain a single sequence of multipliers with satisfying (4.2), and hence satisfying the desired properties as in the statement of Theorem 1.1. This completes the proof. ∎
5. Perturbations of Heier’s and Catlin-D’Angelo’s examples
Heier [He08] and Catlin and D’Angelo [CD10] gave examples of special domains in , where the original Kohn’s procedure [K79] of taking full radicals at every step does not lead to an effective estimate (in terms of the type and the dimension) for the order of subellipticity in subelliptic estimate. The main reason is the lack of control of the root order in the radical. Heier’s example is
[TABLE]
where the set of pre-multipliers is and a calculation of Kohn’s multiplier ideals yields, in the notation of Section 1.1:
[TABLE]
where the last radical requires taking elements of the root order that can be arbitrarily high in comparison with the D’Angelo type . As consequence, the corresponding order of subellipticity in the subelliptic estimate (1.6) obtained this way is not effectively controlled by the type. Note that since , , it is easy to regain the effectivity by taking another Jacobian determinant instead of the radical to obtain
[TABLE]
leading to an effective subelliptic estimate with . In particular, the step of taking radicals for this example can be avoided completely, due to the presence of the linear pre-multiplier .
A similar lack of effectivity phenomenon is exhibited in the Catlin-D’Angelo’s example as explained in [CD10, Section 4] and [S17, Section 4] (where, however, it is not possible to avoid taking radicals when there is no pre-multiplier of vanishing order ). Furthermore, the same lack of control with the same argument also applies to higher order perturbations of that example (that may not be of a triangular form).
More precisely, consider perturbations of the Catlin-D’Angelo’s example given by
[TABLE]
[TABLE]
where we use the notation
[TABLE]
Then for sufficiently large, the explicit calculations in [CD10, Proposition 4.4] and [S17, Section 4.1] show that the root order required for the radical of (in the notation of §1.1) is at least , i.e. . As consequence, the order of subellipticity obtained this way is not effectively controlled by the type.
We now illustrate how our selection procedure modifying the original Kohn’s algorithm applies to this case. For simplicity, we shall assume sufficiently large but effectively bounded from below by the type (i.e. for suitable function that can be directly computed), and being sufficiently large (when the above non-effectivity occurs). The first multiplier generating is
[TABLE]
where the perturbation error estimate is only rough for the sake of simplicity. Then a monodromy argument implies that the zero set of is the union of the (possibly reducible) curves
[TABLE]
For any parametrisation of an irreducible component of the first curve, we take in our Step 2
[TABLE]
and compute
[TABLE]
where we write for the equality up to a constant factor. The corresponding jet vanishing orders of are
[TABLE]
Then our comparison condition (3.10) holds for , and hence Lemma 3.3 gives the desired control of the next lower jet vanishing order
[TABLE]
Next, continuing as in Step 2 in the previous section, we obtain the sequence of multipliers
[TABLE]
where the last multiplier
[TABLE]
has the finite order along .
Similarly, for any curve in the variety defined by the second equation (5.2), we take in our Step 1 the other pre-multiplier
[TABLE]
Then following our Step 2 procedure, we obtain the sequence of multipliers
[TABLE]
where the last multiplier
[TABLE]
has the finite order along .
Finally, in Step 3, we take
[TABLE]
[TABLE]
such that
[TABLE]
and the ideal generated by and has the multiplicity which bounds the root order in the radical, to obtain the multipliers and , and hence their Jacobian determinant, leading to the desired termination. Furthermore, the number of steps and the root order when taking the radical, and hence the order of subellipticity in Corollary 1.3 are explicitly controlled in terms of the type .
Acknowledgements. We would like to thank Professor Joseph J. Kohn for suggesting the topic and encouragement, and Professor John P. D’Angelo for careful reading of the manuscript and numerous helpful remarks as well as many inspiring discussions. We are also grateful to Professor Yum-Tong Siu for his interest and encouragement and for kindly sending us his paper [S17] containing the most recent account on the subject and setting future development perspectives. We finally would like to thank the anonymous referee for careful reading and numerous helpful suggestions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Ba 15] Baracco, L.; A multiplier condition for hypoellipticity of complex vector fields with optimal loss of derivatives. J. Math. Anal. Appl. 423 (2015), no. 1, 318–325.
- 2[Ba P Za 15] Baracco, L.; Pinton, S.; Zampieri, G. Hypoellipticity of the Kohn-Laplacian □ b subscript □ 𝑏 \square_{b} and of the ∂ ¯ ¯ \bar{\partial} -Neumann problem by means of subelliptic multipliers. Math. Ann. 362 (2015), no. 3-4, 887–901.
- 3[BNZ 17] Basyrov, A.; Nicoara, A.C.; Zaitsev, D. Sums of squares in pseudoconvex hypersurfaces and torsion phenomena for Catlin’s boundary systems. Preprint 2017.
- 4[BF 81] Bedford, E.; Fornæss, J.E. Complex manifolds in pseudoconvex boundaries. Duke Math. J. 48 (1981), no. 1, 279–288.
- 5[B St 92] Boas, H.P.; Straube, E.J. On equality of line type and variety type of real hypersurfaces in ℂ n superscript ℂ 𝑛 {\mathbb{C}}^{n} . J. Geom. Anal. 2 (1992), no. 2, 95–98.
- 6[B St 99] Boas, H.P.; Straube, E.J. Global regularity of the ∂ ¯ ¯ \bar{\partial} -Neumann problem: a survey of the L 2 superscript 𝐿 2 L^{2} -Sobolev theory. Several complex variables (Berkeley, CA, 1995–1996), 79–111, Math. Sci. Res. Inst. Publ., 37, Cambridge Univ. Press, Cambridge, 1999.
- 7[C 83] D. Catlin. Necessary conditions for subellipticity of the ∂ ¯ ¯ \bar{\partial} -Neumann problem. Ann. of Math. (2) 117 (1983), no. 1, 147–171.
- 8[C 87] D. Catlin. Subelliptic estimates for the ∂ ¯ ¯ \bar{\partial} -Neumann problem on pseudoconvex domains. Ann. of Math. (2) , 126 (1): 131–191, (1987).
