Rigidity for local holomorphic isometric embeddings from ${\BB}^n$ into ${\BB}^{N_1}\times... \times{\BB}^{N_m}$ up to conformal factors

Mathematics – Complex Variables

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

revised for the journal according to referees' comments

Scientific paper

In this article, we study local holomorphic isometric embeddings from ${\BB}^n$ into ${\BB}^{N_1}\times... \times{\BB}^{N_m}$ with respect to the normalized Bergman metrics up to conformal factors. Assume that each conformal factor is smooth Nash algebraic. Then each component of the map is a multi-valued holomorphic map between complex Euclidean spaces by the algebraic extension theorem derived along the lines of Mok and Mok-Ng. Applying holomorphic continuation and analyzing real analytic subvarieties carefully, we show that each component is either a constant map or a proper holomorphic map between balls. Applying a linearity criterion of Huang, we conclude the total geodesy of non-constant components.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Rigidity for local holomorphic isometric embeddings from ${\BB}^n$ into ${\BB}^{N_1}\times... \times{\BB}^{N_m}$ up to conformal factors does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Rigidity for local holomorphic isometric embeddings from ${\BB}^n$ into ${\BB}^{N_1}\times... \times{\BB}^{N_m}$ up to conformal factors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rigidity for local holomorphic isometric embeddings from ${\BB}^n$ into ${\BB}^{N_1}\times... \times{\BB}^{N_m}$ up to conformal factors will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-659618

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.