Séminaires : Géométrie et Théorie des Modèles

Equipe(s) : lm,
Responsables :Zoé Chatzidakis, Raf Cluckers, Silvain Rideau.
Email des responsables : zoe.chatzidakis@imj-prg.fr
Salle :
Adresse :ENS
Description

http://gtm.imj-prg.fr/

 

Pour recevoir le programme par e-mail, écrivez à : zchatzid_at_dma.ens.fr.Retour ligne automatique
Pour les personnes ne connaissant pas du tout de théorie des modèles, des notes introduisant les notions de base (formules, ensembles définissables, théorème de compacité, etc.) sont disponibles ici : http://www.logique.jussieu.fr/~zoe/papiers/MTluminy.dvi. Ces personnes peuvent aussi consulter les premiers chapitres du livre Model Theory and Algebraic Geometry, E. Bouscaren ed., Springer Verlag, Lecture Notes in Mathematics 1696, Berlin 1998.Retour ligne automatique
Les notes de quelques-uns des exposés sont disponibles.


Orateur(s) Dmitry Novikov - Weizmann Institute,
Titre Complex Cellular Structures
Date16/10/2020
Horaire09:00 à 10:30
Diffusion
RésumeReal semialgebraic sets admit so-called cellular decomposition, i.e. representation as a union of convenient semialgebraic images of standard cubes. The Gromov-Yomdin Lemma (later generalized by Pila and Wilkie) proves that the maps could be chosen of C^r-smooth norm at most one, and the number of such maps is uniformly bounded for finite-dimensional families. This number was not effectively bounded by Yomdin or Gromov, but it necessarily grows as r → ∞. It turns out there is a natural obstruction to a naive holomorphic complexification of this result related to the natural hyperbolic metric of complex holomorphic sets. We prove a lemma about holomorphic functions in annulii, a quantitative version of the great Picard theorem. This lemma allowed us to construct an effective holomorphic version of the cellular decomposition results in all dimensions, with explicit polynomial bounds on complexity for families of complex (sub)analytic and semialgebraic sets. As the first corollary we get an effective version of Yomdin-Gromov Lemma with polynomial bounds on the complexity, thus proving a long-standing Yomdin conjecture about tail entropy of analytic maps. Further connection to diophantine applications will be explained in Gal's talk.
Salle
AdresseENS
© IMJ-PRG