A separation theorem and Serre duality for the Dolbeault cohomology

Christine Laurent-Thiébaut UMR 5582 CNRS-UJF Institut Fourier, Université Grenoble I Jürgen Leiterer Institut für Mathematik, Humboldt-Universität zu Berlin

TBD mathscidoc:1701.332986

Arkiv for Matematik, 40, (2), 301-321, 2000.5
Let$X$be a complex manifold with finitely many ends such that each end is either$q$-concave or ($n−q$)-convex. If $$q< \tfrac{1}{2}n$$ , then we prove that$H$^{p$n−q$}$(X)$is Hausdorff for all$p$. This is not true in general if $$q \geqslant \tfrac{1}{2}n$$ (Rossi’s example with$n$=2 and$q$=1). If all ends are$q$-concave, then this is the classical Andreotti-Vesentini separation theorem (and holds also for $$q \geqslant \tfrac{1}{2}n$$ ). Moreover the result was already known in the case when the$q$-concave ends can be ‘filled in’ (again also for $$q \geqslant \tfrac{1}{2}n$$ ). To prove the result we first have to study Serre duality for the case of more general families of supports (instead of the family of all closed sets and the family of all compact sets) which is the main part of the paper. At the end we give an application to the extensibility of CR-forms of bidegree ($p, q$) from ($n−q$)-convex boundaries, $$q< \tfrac{1}{2}n$$ .
No keywords uploaded!
[ Download ] [ 2017-01-08 20:36:05 uploaded by arkivadmin ] [ 154 downloads ] [ 0 comments ] [ Cited by 5 ]
@inproceedings{christine2000a,
  title={A separation theorem and Serre duality for the Dolbeault cohomology},
  author={Christine Laurent-Thiébaut, and Jürgen Leiterer},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20170108203605034848795},
  booktitle={Arkiv for Matematik},
  volume={40},
  number={2},
  pages={301-321},
  year={2000},
}
Christine Laurent-Thiébaut, and Jürgen Leiterer. A separation theorem and Serre duality for the Dolbeault cohomology. 2000. Vol. 40. In Arkiv for Matematik. pp.301-321. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20170108203605034848795.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved