Least number of charts to describe a given manifold - MathOverflow most recent 30 from http://mathoverflow.net2013-05-24T12:39:40Zhttp://mathoverflow.net/feeds/question/2615http://www.creativecommons.org/licenses/by-nc/2.5/rdfhttp://mathoverflow.net/questions/2615/least-number-of-charts-to-describe-a-given-manifoldLeast number of charts to describe a given manifoldThomas Sauvaget2009-10-26T14:00:44Z2011-06-17T12:19:56Z
<p>Hello, I'm wondering if there is a standard reference discussing the least number of charts in an atlas of a given manifold required to describe it. </p>
<p>E.g. a circle requires at least two charts, and so on (I couldn't manage to get anything relevant neither on wikipedia nor on google, so I guess I'm lacking the correct terminology).</p>
<p><em>Edit</em>: in the case of an open covering of a topological space by n+1 contractible sets (in that space) then n is called the Lusternik-Schnirelman Category of the space, see Andy Putman's answer. The following book seems to be the standard reference <a href="http://books.google.fr/books?id=vMREfNN-L4gC&pg=PP1" rel="nofollow">http://books.google.fr/books?id=vMREfNN-L4gC&pg=PP1</a></p>
<p>Great, now I'm still interested by the initial question: does anybody know of another theory without this contractibility assumption (hoping that it allows more freedom)? e.g. would it lead to different numbers say for genus-g surfaces? </p>
<p><em>Final edit</em>: yes different numbers for genus-g surfaces (see answers below), but not sure there is a theory without contractibility. Right, really lots of interesting literature on the LS category nevertheless, hence the accepted answer. For example there are estimates for non-simply connected compact simple Lie groups like PU(n) and SO(n) in Topology and its Applications, Volume 150, Issues 1-3, 14 May 2005, Pages 111-123. </p>
http://mathoverflow.net/questions/2615/least-number-of-charts-to-describe-a-given-manifold/2616#2616Answer by Andy Putman for Least number of charts to describe a given manifoldAndy Putman2009-10-26T14:07:12Z2009-10-26T14:07:12Z<p>It's not quite the same thing, but a related object is the LyusternikâSchnirelmann category of a topological space. See</p>
<p><a href="http://en.wikipedia.org/wiki/Lyusternik-Schnirelmann_category" rel="nofollow">http://en.wikipedia.org/wiki/Lyusternik-Schnirelmann_category</a></p>
http://mathoverflow.net/questions/2615/least-number-of-charts-to-describe-a-given-manifold/2634#2634Answer by Sonia Balagopalan for Least number of charts to describe a given manifoldSonia Balagopalan2009-10-26T16:05:17Z2009-10-26T16:05:17Z<p>Orthogonal question: Does the (minimum) number of charts needed to describe a manifold tell you anything about the manifold?</p>
http://mathoverflow.net/questions/2615/least-number-of-charts-to-describe-a-given-manifold/2646#2646Answer by Reid Barton for Least number of charts to describe a given manifoldReid Barton2009-10-26T16:54:28Z2009-10-26T16:54:28Z<p>To answer your last question, the least number of charts needed to cover any orientable 2-manifold is 2. Consider the usual embedding of an orientable surface Σ in R<sup>3</sup> which is symmetric across the plane z = 0 (as shown <a href="http://en.wikipedia.org/wiki/Genus_(mathematics)" rel="nofollow">here</a>), and let ε > 0 be sufficiently small. The open subsets Σ ∩ {z > -ε}, Σ ∩ {z < ε} form a covering of Σ by charts: by Morse theory Σ ∩ {z > -ε} is diffeomorphic to Σ ∩ {z > ε}, which is diffeomorphic to an open subset of R<sup>2</sup> by projecting onto the xy-plane.</p>
http://mathoverflow.net/questions/2615/least-number-of-charts-to-describe-a-given-manifold/2664#2664Answer by Aaron Mazel-Gee for Least number of charts to describe a given manifoldAaron Mazel-Gee2009-10-26T19:18:18Z2009-10-26T19:18:18Z<p>I believe that <a href="http://en.wikipedia.org/wiki/Cech%5Fcohomology" rel="nofollow">Cech cohomology</a> could yield the sort of answer you're looking for (at least in the contractible case). The general idea is that it computes cohomology based on nothing but the so-called "incidence data" of a good cover (that is, which n-fold intersections of open sets in the cover are nonempty) -- in fact, a n-chain is nothing more than a formal sum of (nonempty) (n+1)-fold intersections, with <b>R</b> coefficients. Of course, this cohomology theory is usually isomorphic to singular cohomology, de Rham cohomology, et al. (in particular, they agree in the case of manifolds). So if your manifold has a high h<sup>1</sup>=rank(H<sup>1</sup>), for example, then there <i>must</i> be lots of different 2-fold intersections to generate H<sup>1</sup>, and also if your manifold has nonzero H<sup>k</sup> then there must exist a (k+1)-fold intersection of sets in the open cover, which means that you must have at least that many sets in <i>any</i> good cover. (Note that if M is a k-dimensional orientable manifold, then H<sup>k</sup>(M)=<b>R</b> by Poincare duality.)</p>
http://mathoverflow.net/questions/2615/least-number-of-charts-to-describe-a-given-manifold/54346#54346Answer by Giuseppe for Least number of charts to describe a given manifoldGiuseppe2011-02-04T19:25:40Z2011-02-04T19:25:40Z<p>I do not know if the following exactly answers your question.</p>
<p>I have found on the second page of Michor "Topics in Differential Geometry":
"Note finally that any manifold $M$ admits a finite atlas consisting of $\dim{M}+1$ not connected charts. This is a consequence of topological dimension theory [cf. Nagata, Modern Dimension Theory]; a proof for manifolds may be found in [cf. Greub, Halperin, Vanstone, Connections, curvature and cohomology.I]."</p>
<p>I hope to have been useful.</p>
http://mathoverflow.net/questions/2615/least-number-of-charts-to-describe-a-given-manifold/68049#68049Answer by Al-burcas for Least number of charts to describe a given manifoldAl-burcas2011-06-17T12:19:56Z2011-06-17T12:19:56Z<p>After "dimension" this is the most basic numerical invariant of a manifold and the least explored. I found this reference some years ago: I. Bernstein, "On Imbedding Numbers of Differentiable Manifolds", Topology, Vol. 7, pp. 95-109.</p>