A Priori Bounds for Co-dimension One Isometric Embeddings

نویسنده

  • YANYAN LI
چکیده

Let X : (S, g) → R be a C isometric embedding of a C 4 metric g of non-negative sectional curvature on S into the Euclidean space R. We prove a priori bounds for the trace of the second fundamental form H , in terms of the scalar curvature R of g, and the diameter d of the space (S, g). These estimates give a bound on the extrinsic geometry in terms of intrinsic quantities. They generalize estimates originally obtained by Weyl for the case n = 2 and positive curvature, and then by P. Guan and the first author for non-negative curvature and n = 2. Using C interior estimates of Evans and Krylov for concave fully nonlinear elliptic partial differential equations, these bounds allow us to obtain the following convergence theorem: For any ǫ > 0, the set of metrics of non-negative sectional curvature and scalar curvature bounded below by ǫ which are isometrically embedable in Euclidean space R is closed in the Hölder space C, 0 < α < 1. These results are obtained in an effort to understand the following higher dimensional version of the Weyl embedding problem which we propose: Suppose that g is a smooth metric of non-negative sectional curvature and positive scalar curvature on S which is locally isometrically embeddable in R. Does (S, g) then admit a smooth global isometric embedding X : (S, g)→ R?

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds for the dimension of the $c$-nilpotent multiplier of a pair of Lie algebras

‎In this paper‎, ‎we study the Neumann boundary value problem of a class of nonlinear divergence type diffusion equations‎. ‎By a priori estimates‎, ‎difference and variation techniques‎, ‎we establish the existence and uniqueness of weak solutions of this problem.

متن کامل

Random Tessellations, Restricted Isometric Embeddings, and One Bit Sensing

We obtain mproved bounds for one bit sensing. For instance, let Ks denote the set of s-sparse unit vectors in the sphere S in dimension n+1 with sparsity parameter 0 < s < n+1 and assume that 0 < δ < 1. We show that form & δs log n s , the one-bit map x 7→ [ sgn〈x, gj〉 ]m j=1 , where gj are iid gaussian vectors on R , with high probability has δ-RIP from Ks into the m-dimensional Hamming cube. ...

متن کامل

Nearly Isometric Embedding by Relaxation

Many manifold learning algorithms aim to create embeddings with low or no distortion (isometric). If the data has intrinsic dimension d, it is often impossible to obtain an isometric embedding in d dimensions, but possible in s > d dimensions. Yet, most geometry preserving algorithms cannot do the latter. This paper proposes an embedding algorithm to overcome this. The algorithm accepts as inpu...

متن کامل

h-PRINCIPLE AND RIGIDITY FOR C1,α ISOMETRIC EMBEDDINGS

In this paper we study the embedding of Riemannian manifolds in low codimension. The well-known result of Nash and Kuiper [21, 20] says that any short embedding in codimension one can be uniformly approximated by C isometric embeddings. This statement clearly cannot be true for C embeddings in general, due to the classical rigidity in the Weyl problem. In fact Borisov extended the latter to emb...

متن کامل

Lower bounds for projective designs, cubature formulas and related isometric embeddings

Yudin’s lower bound [21] for the spherical designs is generalized to the cubature formulas on the projective spaces over a field K ⊂ {R, C, H} and thus to isometric embeddings l 2;K → l p;K with p ∈ 2N. For large p and in some other situations this is essentially better than those known before. AMS Classification: 46B04, 05B30

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998