Rank of ordinary webs in codimension one. An effective method
Jean Paul Dufour, Daniel Lehmann

TL;DR
This paper introduces an effective method to compute the rank of ordinary holomorphic webs in complex manifolds, refining existing bounds and providing a sequence of invariants that stabilizes to the web's rank.
Contribution
It develops a practical approach to determine the rank of ordinary webs using a sequence of invariants and holomorphic vector bundles with connections, improving upon classical bounds.
Findings
The sequence of invariants $ ho_h$ stabilizes at the web's rank.
The method involves constructing vector bundles with holomorphic connections.
Curvature vanishes when the sequence stabilizes, allowing rank determination.
Abstract
We are interested by holomorphic -webs of codimension one in a complex -dimensional manifold . If they are ordinary, i.e. if they satisfy to some condition of genericity (whose precise definition is recalled), we proved in [CL] that their rank is upper-bounded by a certain number which, for , is stictly smaller than the Castelnuovo-Chern's bound . In fact, denoting by the dimension of the space of homogeneous polynomials of degree with unknowns, and by the integer such that is just the first number of a decreasing sequence of positive integers becoming stationary equal to after a finite number of steps. This sequence is an…
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.
Rank of ordinary webs in codimension one
An effective method
J.P. Dufour and D. Lehmann
Abstract :
We are interested by holomorphic -webs of codimension one in a complex -dimensional manifold . If they are ordinary, i.e. if they satisfy to some condition of genericity (whose precise definition is recalled below), we proved in [CL] that their rank is upper-bounded by a certain number \pi^{\prime}(n,d)\c{c}\bigl{(}which, for , is stictly smaller than the Castelnuovo-Chern’s bound \pi(n,d)\bigr{)}.
In fact, denoting by the dimension of the space of homogeneous polynomials of degree with unknowns, and by the integer such that
[TABLE]
is just the first number of a decreasing sequence of positive integers
[TABLE]
becoming stationary equal to after a finite number of steps. This sequence is an interesting invariant of the web, refining the data of the only rank.
The method is effective : theoretically, we can compute for any given ; and, as soon as two consecutive such numbers are equal (), we can construct a holomorphic vector bundle of rank , equipped with a tautological holomorphic connection whose curvature vanishes iff the above sequence is stationary from there. Thus, we may stop the process at the first step where the curvature vanishes.
Examples will be given.
Contents :
1- Introduction
2- Computation of
3- The connections
4- Algorithm
5- Examples
Keywords : ordinary webs, abelian relation, rank, connection, curvature.
AMS classification : 53A60 (14C21, 53C05, 14H45)
1 Introduction
Recall that a totally decomposable111More generally, the web is defined by one foliation on a covering space with sheets. On an open set of on which this covering space is trivial, the data of is equivalent to that of the ’s which are the projections of . All fiber bundles and connections studied below may be defined globally. But all computations being done locally, we shall recall the definitions only in the case of a totally decomposable web. holomorphic -web of codimension one without singularity on a complex -dimensional manifold is defined by the data of holomorphic regular foliations of codimension one on , , any one of them being transverse to each other at any point.
We assume and the web to be at least in weak general position222The web is said to be in weak (resp. strong) general position if, at any point , there exists at least of the foliations among the ’s, whose tangent spaces at are in general position (resp. if any family of foliations among the ’s have this property)..
An * abelian relation* on an open set ouvert (assumed to be connected and simply connected) of is then the data of a family of holomorphic f unctions on , , such that
-
for any , is a first integral of (maybe with singularities),
-
the sum is a constant on .
These first integrals being defined up to an additive constant, we are only interested by their differential , in such a way that we may still define an abelian relation as a family of holomorphic 1-forms on (maybe with singularities), which are
closed (hence locally exact) : ,
verifying ç ( at any point where doesn’t vanish),
such that .
The germs of abelian relations at a point constitute a vector space, whose dimension is called the rank of the web at this point333A. Hçnaut proved that this rank doesn’t depend on , as far as the web satisfies to the assumption of strong general position ([H2]). In case we have only weak general position, we shall define the rank of the web as being the highest of the rank at a point..
It will be useful to give an equivalent definition in words of differential operator. Denote by T{\cal F}_{i}\c{c}\bigl{(}\subset TM\bigr{)} the vector bundle of vectors tangent to , and A_{i}\c{c}\bigl{(}\subset T^{*}M\bigr{)} the dual vector bundle of (i.e. the vector bundle of holomorphic 1-forms vanishing on ). Let
[TABLE]
be the morphism of vector bundles (the Trace), defined by Tr\bigl{(}(\omega_{i})_{i}\bigr{)}=\sum_{i=1}^{d}\omega_{i}. The assumption of “at least weak general position” means that has maximal rank : its kernel
[TABLE]
is therefore a holomorphic vector bundle of rank . We define a linear differential operator of order one
[TABLE]
where , by mapping any section of onto the family of the differentials. Then, an abelian relation may be identified with a holomorphic section of such that .
The kernel is the vector bundle of formal abelian relations at order one. More generally, the space of formal abelian relations at order is the kernel of the -prolongation of the differential operator :
[TABLE]
For any (), abelian relations may still be identified with holomorphic sections of such that belong to .
Denoting by the natural projection, we shall see that the elements of which are mapped by onto a given element of are the solutions of a linear system of equations with unknowns, whose homogeneous part doesn’t depend on , with notation444We prefer this notation to the usual one for the binomial coefficient, mainly because it suggests explicitly the dimension of the vector space of homogeneous polynomials of degree with unknowns, and also because it needs less space.
[TABLE]
Then ordinary webs are those for which all of these systems have maximal rank {inf}\bigl{(}d,c(n,h+1)\bigr{)}. Denoting by the integer such that
[TABLE]
it is in fact sufficient that this rank be maximal for , for being maximal for any .
We proved in [CL] that the rank of an ordinary web is at most equal to the integer
[TABLE]
which, for , is strictly smaller than the Castelnuovo’s number555The Castelnuovo’s number
\pi(n,d):=\sum_{h\geq 1}\bigl{(}d-h(n-1)-1\bigr{)}^{+}\c{c},\hbox{\c{c}where a^{+}sup\c{c}(a,0)}
is the maximal arithmetical genus of irreducible algebraic curves of degree in the complex -dimensional projective space . It is also, after Chern ([C]), the maximal rank of the -webs in codimension one, verifying only the assumption of strong general position (but not necessarily ordinary for ). .
Since the linear system of equations with unknowns has rank for , the projection is then surjective, and is a holomorphic vector bundle of rank \sum_{h=1}^{k+1}\bigl{(}d-c(n,h)\bigr{)} for . In particular
[TABLE]
For , has rank , and has at most one solution (since it contains a cramerian sub-system), but may be no one (since it is overdetermined). In general, will still be a vector bundle (denoting by its rank), but it may happen that the projection be no more surjective, hence : .
When , , the projection is now an isomorphism of vector bundles. The inverse isomorphism composed with the natural inclusion defines a connection on , and abelian relations may be identified with sections of such that be a section of with vanishing covariant derivative : . Hence the rank of the web will be at most equal to the rank of , and equal iff the curvature of vanishes. This proves in particular the inequalities
[TABLE]
for . We shall see how to compute effectively and .
When (then, is said to be calibrated), , and is the connection defined in [CL], computed with Maple in [DL], generalizing to any the connection previously defined for planar webs () by Hçnaut ([H1]), and independently by Pirio ([Pi]) who related the corresponding curvature to invariants defined previously by Pantazi ([Pa]) (the curvature of which being the Blaschke-Dubourdieu curvature ([BB]) for ). In this case of planar webs, Ripoll ([R]) computed the rank of the web by another method (corank of some matrix deduced from , from the curvature and its derivatives).
Remark about non-ordinary webs : If the web is not ordinary, its rank may be bigger than , and we may not affirm anymore that the sequence of the ’s increases for and decreases for bigger. However, if -by chance- we can find some such that is an isomorphism of vector bundles of same rank , then we still can define the connection , and it is still true that the vanishing of the curvature implies the equality .
Notation : Denote by
an index from 1 to ,
an index from 1 to ,
a multi-index of integers, and its degree.
If , and , (resp. ) denotes (resp ).
In particular denotes the multi-index obtained with 1 at the place and 0 elsewhere.
Relatively to local coordinates in , we shall denote by or the partial derivative of a holomorphic function or of a matrix with holomorphic coefficients. More generally, or denotes the partial derivative of order .
2 Computation of
We assume each foliation defined by a first integral without singularity. The data of another first integral up to an additive constant is equivalent to the data of the derivative . Each vector bundle being now trivialized by , we set (such a 1-form is automatically closed). The data of an abelian relation is now equivalent to the data of a family of holomorphic functions of one variable () such that , or equivalently :
[TABLE]
which can still be written
[TABLE]
where denotes the jacobian matrix and the -vector \bigl{(}g_{1}\,{\raise 0.8pt\hbox{\scriptstyle\circ}}\,u_{1},\cdots,g_{d}\,{\raise 0.8pt\hbox{\scriptstyle\circ}}\,u_{d}\bigr{)}. [The functions are given, and the functions unknown].
Coefficients and matrices
For any , will denote the derivative of (with the convention ;
We set :
f_{i}:=g_{i}\,{\raise 0.8pt\hbox{\scriptstyle\circ}}\,u_{i} and f_{i}^{(h)}:=g_{i}^{(h)}\,{\raise 0.8pt\hbox{\scriptstyle\circ}}\,u_{i},
-vector , and -vector .
For any integer (), a -jet of abelian relation at a point of is defined by the family
[TABLE]
The partial derivatives of the relations will make us able to compute locally . In fact, the functions will be defined by iteration on so that
[TABLE]
as far as be an abelian relation.
Lemma 2-1 : For any holomorphic function of variables, and any holomorphic function of one variable,
* The derivatives \Bigl{(}(g\,{\raise 0.8pt\hbox{\scriptstyle\circ}}\,u)\c{c}u^{\prime}_{\lambda}\Bigr{)}^{\prime}_{L} are linear combinations*
[TABLE]
of the successive derivatives of we set : , whose coefficients depend only on and on the multi-index , and not on its decomposition under the shape .
* They can be computed by iteration on using the formula*
[TABLE]
This is due to the fact that the 1-form d\bigl{(}G(u)\bigr{)} is closed, denoting a primitive of .
For a web locally defined by the functions , we set :
[TABLE]
We check in particular
,
and C_{i,{L}}^{|L|-1}=\prod_{\lambda=1}^{n}\bigl{(}(u_{i})^{\prime}_{\lambda}\bigr{)}^{\ell_{\lambda}}\hbox{ for L=(\ell_{1},\ell_{2},\cdots,\ell_{n})}.
We set :
denotes the trivial holomorphic bundle of rank ,
\beta_{k}:=c(n+1,k)-1\c{c}\c{c}\bigl{(}=\sum_{h=1}^{k}c(n,h)\bigr{)},
denotes the matrix of size , , , (with for ),
.
denotes the matrix of size built with the blocks for and , where the block is on the right of , and below,
denotes the sub matrix of size in built with the blocks for :
[TABLE]
Theorem 2-2 :
* Locally, is the kernel of included into the trivial bundle . Hence, when the matrix has constant rank always true for , is a holomorphic vector bundle of rank*
[TABLE]
* If an element (imbedded into ) is defined by the family of -vectors , , the elements of which project onto are those whose the last component is solution of the linear system :*
[TABLE]
Proof : A -jet of abelian relation at a point is then represented by its components j_{m}^{h}(u_{i}\,{\raise 0.8pt\hbox{\scriptstyle\circ}}\,g_{i}) in , and each of them is completely defined by the family of the numbers
[TABLE]
Thus a family666Be careful not to confuse with the set of the -jets of the true abelian relations (which may be smaller). of numbers \bigl{(}w_{i}^{(h)}\bigr{)}_{i,h} belongs to if it satisfies to any of the equations
[TABLE]
QED
Estimation of the ranks
The assumption for the web to be ordinary means that the matrices have all maximal rank, that is for , and for .
Lemma 2-3
If has maximal rank for , it has maximal rank for any .
Proof : The meaning of the lemma not depending on the local coordinates, we may assume that all foliations are transversal to the -axis near a point ; therefore all derivatives are not zero. The formula
[TABLE]
proves that the rank of is at least equal to that of , thus is equal if is big enough for this rank to be stationary equal to .
QED
Let be the rank of .
Theorem 2-4 ([CL])
For , is a holomorphic vector bundle of rank
[TABLE]
In particular, .
Proof : In fact, the matrices , of size , are triangular by blocks, and the diagonal blocks are the ’s. Since the rank of is for , has maximal rank in this range. Thus has there rank .
QED
The sequence becomes decreasing for Then, for , it may be no more true that has maximal rank , so that the rank of may be now bigger than (but remains at most equal to ). Thus we get :
**Theorem 2-5 **
Assuming to have a constant rank for , the sequence is decreasing from to the rank of the web, and satisfies to the inequalities
[TABLE]
3 The connections
In this section, we assume :
,
and , ( being then an isomorphism of vector bundles).
If , then . If , we shall define a connection on , whose curvature vanishes iff .
We recall that is the intersection of and into :
[TABLE]
Denote by
the natural inclusion,
and by the isomorphism inverse777It can be explicitely computed by mean of the generalized inverse of ç, where and means the transposed matrix of . of the projection .
The composed map \xi_{h}:=\epsilon_{h}\,{\raise 0.8pt\hbox{\scriptstyle\circ}}\,v_{h} is a splitting of the exact sequence
[TABLE]
and defines consequently a holomorphic connection on , whose covariant derivative is :
[TABLE]
Since the abelian relations may be identified by the map to the sections of such that belong to , and since factorizes through , the following assertions are equivalent :
ç is an abelian relation,
ç.
Since the framework is holomorphic, , and we get therefore the
**Theorem 3-1 **
* ççA section of is an abelian relation iff is a section of and .*
* çThe rank of the web is at most equal to the rank of the bundle .*
* There exists an integer such that*
- or and then ,
*- or , the curvature vanishes , and then * **Remark : ** If the web is not-ordinary, we still may define the connection , as soon as we can find some for which the projection is an isomorphism of vector bundles, whatever be (no more necessarily ). And it remains true that the vanishing of its curvature implies .
4 Algorithm
Theoretically, the following algorithm always works for any ordinary web. But it may need a long time of computer. Practically, in some cases, considerations specific to each example may be used for shortening the process, some of them being sketched in the remark at the end of the section.
-
explicit ;
-
check :
[TABLE]
if this condition is not realized, is not ordinary ;
-
STOP ;
-
else, compute ;
Loop (h) from :
-
compute (and sub-matrix of ) ;
-
compute and ;
-
if , go to (h+1) ;
-
else (i.e. when ), compute and ;
-
if , go to (h+1) ;
-
else (i.e. when ),
[TABLE]
- STOP .
Thus, we have an effective procedure to compute the rank, even when it is not maximal, without having to exhibit explicit abelian relations.
Remarks :
1- When , it is often useful to check immediately if there would not be some , , such that . In this case, we know a priori that doesn’t vanish, without to have to compute it.
2- There are usually two ways for computing : the first one, used in the algorithm above, consists in computing the kernel of the matrix of size \bigl{(}c(n+1,h+1)-1\bigr{)}\times(h+1)d :
[TABLE]
This size increases more rapidly with than the size of the matrix of the linear system giving the elements of above a given element (essentially because the process uses the knowledge of that we got previously, which is not true for the first process). Thus, for big enough, knowing already and a trivialization of , the following process may need a shorter time of computer than the previous one, despite of the fact that there are more operations to be done :
-
choose a invertible sub-matrix of ,
-
solve the corresponding cramerian sub-system of ,
-
for each line among the deleted for getting from , and for each belonging to the trivialization of , build the characteristic determinant whose vanishing asserts the compatibility of the new equation with the cramerian sub-system,
-
then the kernel of the matrix of size \bigl{(}c(n,h+1)-d\bigr{)}\times\rho_{h-1} defines the projection of onto , which is an isomorphism, and
[TABLE]
5 Examples
The process described in the algorithm above works for any . However, most of our examples are relative to low values of these integers : in fact, the size of the involved matrices becomes very rapidly huge, and would need in practice more powerful computers than our small portable.
5.1 Case :
There is no hope to refine the classification of the non-hexagonal planar 3-webs by the order of the step from which the sequence of the ’s vanishes, In fact, we can prove easily that the sequence of the ’s becomes immediately stationary after the first step, and there are only two possibilities :
-
sequence if the Blaschke-Dubourdieu curvature vanishes hexagonal case,
-
sequence if .
5.2 Example d=4\c{c}$$\bigl{(}\pi^{\prime}(2,4)=3\bigr{)} :
We recall that all planar webs are ordinary, and calibrated with . Moreover is then equal to .
For the planar 4-web
[TABLE]
we have an obvious abelian relation f\,{\raise 0.8pt\hbox{\scriptstyle\circ}}\,u_{1}-u_{2}-u_{4}\equiv 0, with . Thus, we know already
[TABLE]
Computing , we get
[TABLE]
Since , we are sure that the curvature doesn’t vanish, without to have to compute it. We get . Thus the sequence of the ’s is necessarily stationary equal to 2 from :
[TABLE]
We are sure that there is another abelian relation independant on the obvious one, without to have to exhibit it.
5.3 Example \bigl{(}\pi^{\prime}(2,8)=21\bigr{)} :
Let be the planar -web
[TABLE]
We observed in [DL] that its curvature did not vanish, but that its connection form relative to some “adapted” trivialization (matrix of size , whose coefficients are scalar 1-forms) had only zero’s in the 19th first columns. Thus, we deduced that the rank of was at least 19, and at most 20 : in fact, and ç. Thus
[TABLE]
while the -sub-web defined by deleting has maximal rank 15 (see [Pi]).
5.4 Case , ç\bigl{(}\pi^{\prime}(n,n+1)=1\bigr{)} :
Denoting by local coordinates, we consider the -web defined by the functions
For a convenient order of the multi-indices , the matrix has the shape
[TABLE]
where
is the identity -matrix ,
is the column of the , (with rows),
is the column of the , (with rows),
is the column of the , (with rows),
is the column which has coefficients (, (with rows),
and is the column which has coefficients (, (with rows, same order of the pairs as in ).
The sub-matrix has always rank , hence , while has generally rank ; hence, in general \rho_{1}\c{c}\bigl{(}=\rho(W)\bigr{)}=0, and there is no abelian relation.
The exceptional case (Rank, and ) happens iff and are collinear. This means the set of relations
[TABLE]
for any and with and
We shall now study this case by mean of the connection . Then, a trivialization of is given by the -vector
[TABLE]
and a trivialization of is given by some -vector
[TABLE]
satisfying in particular to the identities
[TABLE]
Denoting by the diagonal matrix built on the -vector
[TABLE]
with as component, as component and 0 elsewhere, the connexion on is then defined by
[TABLE]
where (resp. ) means the partial derivative (resp. the covariant derivative) with respect to . Thus, we get :
[TABLE]
The curvature has then components
[TABLE]
Fix a pair and choose an index different from and We get :
[TABLE]
hence
[TABLE]
This gives . So, if we set
[TABLE]
we have proved the following proposition. Proposition 5-2 :
The web has a non-trivial abelian relation if and only iff
[TABLE]
for any triple of indices, each one different to each other.
Notice that, when is in strong general position, the existence of an abelian relation is equivalent to the fact that we can choose new coordinates such that
[TABLE]
Thus, the existence of an abelian relation is equivalent for the web to be “parallelisable”.
5.5 An example ç\bigl{(}\pi^{\prime}(3,5)=2\bigr{)} :
Denoting by local coordinates, and defining the web by the functions \bigl{(}x,y,z,x+y+z,F(x,y,z)\bigr{)}, assume that the function depends only on and :
[TABLE]
We set
.
We consider , , and as sub-matrices of the matrix described below for a convenient order of the multi-indices :
[TABLE]
We can check that , above have respectively rank 3, 8 ; thus
[TABLE]
In general has rank and . But it may happen that has rank and for exceptional ’s. This can be seen by computing the curvature .
A basis for is
[TABLE]
The lines 7 and 8 of being the same, we may ignore the line 8 in the computation of . We assume , in such a way that the sub-matrix of that we get in forgetting its line 5 is invertible. Thus, has rank , and we can lift , and in , defining , and . We get :
[TABLE]
where , and are solution of the cramerian linear system
[TABLE]
Denoting respectively by , , and , the diagonal matrices built with , , and , the connection on is then given by the formulae :
[TABLE]
where , and denote the covariant derivative with respect to , , and . The connection form relative to is then
[TABLE]
and the curvature writes
[TABLE]
If this curvature vanishes (according to ), . Otherwise, . (The rank may not be zero, due to the obvious non-trivial abelian relation ). For example, if , (ℂ), we can affirm that there is no other independant abelian relation if . If , we have a vanishing curvature, corresponding to the second abelian relation .
5.6 An example ç\bigl{(}\pi^{\prime}(3,11)=14\bigr{)} :
Let be the -web (quasi-parallel : all ’s except one are affine functions) :
[TABLE]
We get , and . Hence
[TABLE]
5.7 Parallelisable webs :
These are webs such that all ’s are affine functions relatively to some system of local coordinates. Then, with these coordinates, the only blocks which are not zero in the matrices are the diagonal blocks , and Thus
[TABLE]
In particular, if the web is ordinary, for . Hence888This has already been quoted in [CL] (theorem 6-5) by other considerations., all ordinary parallelisable webs have maximal rank \pi^{\prime}(n,d)\c{c}\bigl{(}=\rho_{h_{0}-2}\bigr{)}.
If they are not ordinary, and if there exists some () such that , then the sequence of the ’s is stationary from there because of the lemma 2-3 above, and then
[TABLE]
Such an example is given below.
5.8 Non ordinary example :
Let be the parallel 10-sub-web of the ordinary 11-web above, obtained by deleting . It is not ordinary (since has rank 9, not 10). We get :
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BB] W. Blaschke, G. Bol, Geometrie der Gewebe , Die Grundlehren der M athematik 49, Springer, 1938.
- 2[C] S.-S. Chern, Abzählungen für Gewebe, Abh. M ath. Hamb. Univ. 11, 1935, 163-170.
- 3[CL] V. Cavalier, D. Lehmann, Ordinary holomorphic webs of codimension one. ar Xiv 0703596 v 2 [maths DS], 2007, et Ann. Sc. Norm. Super. Pisa, cl. Sci (5), vol XI (2012), 197-214. .
- 4[DL] J. P. Dufour, D. Lehmann, Calcul explicite de la courbure des tissus calibrés ordinaires. ar Xiv 1408.3909 v 1 [maths DG], 18/08/2014.
- 5[H 1] A. Hénaut, Planar web geometry through abelian relations and connections Annals of M ath. 159 (2004) 425-445.
- 6[H 2] A. Hçnaut, Systçmes diffçrentiels, nombre de Castelnuovo, et rang des tissus de ℂ n , Publ. RI M S, Kyoto University, 31(4), 1995, 703-720.
- 7[Pa] A. Pantazi. Sur la détermination du rang d’un tissu plan. C.R. Acad. Sc. Roumanie 4 (1940), 108-111.
- 8[Pi] L. Pirio, Equations Fonctionnelles Abéliennes et Géométrie des tissus , Thèse de doctorat de l’Université Paris VI, 2004.
