Bishop–Gromov inequality

From Wikipedia, the free encyclopedia

(Redirected from Bishop-Gromov inequality)
Jump to: navigation, search

In mathematics, the Bishop–Gromov inequality is a classical theorem in Riemannian geometry, named after Richard L. Bishop and Mikhail Gromov. It is the key point in the proof of Gromov's compactness theorem.

Let us denote by S^m_k a complete simply connected m-dimensional Riemannian manifold of constant sectional curvature k, i.e. an m-sphere of radius 1/\sqrt{k} if k > 0, Euclidean m-space if k = 0 and hyperbolic m-space with curvature k if k < 0.

Let M be a complete m-dimensional Riemannian manifold with Ricci curvature \ge (m-1)k, p\in M.

Let us denote by vp(R) the volume of the ball with center p and radius R in M and by V(R) the volume of the ball of radius R in S^m_k.

Then function fp(R) = vp(R) / V(R) is nonincreasing for any p.

In particular this implies that for any p and R we have

v_p(R)\le V(R).

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.