Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Extensions of Schoen–Simon–Yau and Schoen–Simon theorems via iteration à la De Giorgi

View through CrossRef
Abstract We give an alternative proof of the Schoen–Simon–Yau curvature estimates and associated Bernstein-type theorems (Schoen et al. in Acta Math. 134:275–288, 1975), and extend the original result by including the case of 6-dimensional (stable minimal) immersions. The key step is an ε-regularity theorem, that assumes smallness of the scale-invariant $L^{2}$ L 2 norm of the second fundamental form. Further, we obtain a graph description, in the Lipschitz multi-valued sense, for any stable minimal immersion of dimension $n\geq 2$ n ≥ 2 , that may have a singular set $\Sigma $ Σ of locally finite $\mathcal{H}^{n-2}$ H n − 2 -measure, and that is weakly close to a hyperplane. (In fact, if the $\mathcal{H}^{n-2}$ H n − 2 -measure of the singular set vanishes, the conclusion is strengthened to a union of smooth graphs.) This follows directly from an ε-regularity theorem, that assumes smallness of the scale-invariant $L^{2}$ L 2 tilt-excess (verified when the hypersurface is weakly close to a hyperplane). Specialising the multi-valued decomposition to the case of embeddings, we recover the Schoen–Simon theorem (Schoen and Simon 34:741–797, 1981). In both ε-regularity theorems the relevant quantity (respectively, length of the second fundamental form and tilt function) solves a non-linear PDE on the immersed minimal hypersurface. The proof is carried out intrinsically (without linearising the PDE) by implementing an iteration method à la De Giorgi (from the linear De Giorgi–Nash–Moser theory). Stability implies estimates (intrinsic weak Caccioppoli inequalities) that make the iteration effective despite the non-linear framework. (In both ε-regularity theorems the method gives explicit constants that quantify the required smallness.)
Springer Science and Business Media LLC
Title: Extensions of Schoen–Simon–Yau and Schoen–Simon theorems via iteration à la De Giorgi
Description:
Abstract We give an alternative proof of the Schoen–Simon–Yau curvature estimates and associated Bernstein-type theorems (Schoen et al.
in Acta Math.
134:275–288, 1975), and extend the original result by including the case of 6-dimensional (stable minimal) immersions.
The key step is an ε-regularity theorem, that assumes smallness of the scale-invariant $L^{2}$ L 2 norm of the second fundamental form.
Further, we obtain a graph description, in the Lipschitz multi-valued sense, for any stable minimal immersion of dimension $n\geq 2$ n ≥ 2 , that may have a singular set $\Sigma $ Σ of locally finite $\mathcal{H}^{n-2}$ H n − 2 -measure, and that is weakly close to a hyperplane.
(In fact, if the $\mathcal{H}^{n-2}$ H n − 2 -measure of the singular set vanishes, the conclusion is strengthened to a union of smooth graphs.
) This follows directly from an ε-regularity theorem, that assumes smallness of the scale-invariant $L^{2}$ L 2 tilt-excess (verified when the hypersurface is weakly close to a hyperplane).
Specialising the multi-valued decomposition to the case of embeddings, we recover the Schoen–Simon theorem (Schoen and Simon 34:741–797, 1981).
In both ε-regularity theorems the relevant quantity (respectively, length of the second fundamental form and tilt function) solves a non-linear PDE on the immersed minimal hypersurface.
The proof is carried out intrinsically (without linearising the PDE) by implementing an iteration method à la De Giorgi (from the linear De Giorgi–Nash–Moser theory).
Stability implies estimates (intrinsic weak Caccioppoli inequalities) that make the iteration effective despite the non-linear framework.
(In both ε-regularity theorems the method gives explicit constants that quantify the required smallness.
).

Related Results

On the Convergence Analysis of Yau–Yau Nonlinear Filtering Algorithm: From a Probabilistic Perspective
On the Convergence Analysis of Yau–Yau Nonlinear Filtering Algorithm: From a Probabilistic Perspective
Abstract. At the beginning of this century, a real time solution of the nonlinear filtering problem without memory was proposed in [S.-T. Yau and S. S.-T. Yau, Ma...
On pre-Calabi-Yau categories
On pre-Calabi-Yau categories
Sur les catégories de pre-Calabi-Yau Dans cette thèse, nous étudions les catégories de pré-Calabi-Yau et leurs morphismes.Nous développons pour cela un outil nous p...
“Dari Mata Turun ke Hati”: Penggunaan Eyelash Extensions di Kalangan Siswi Sekolah Menengah
“Dari Mata Turun ke Hati”: Penggunaan Eyelash Extensions di Kalangan Siswi Sekolah Menengah
Being attractive and beautiful has its own charm which will certainly increase self-confidence. For this reason, women try to improve their appearance, one of which is by doing fac...
Métriques de Calabi-Yau et valuations K-stables sur les variétés sphériques affines
Métriques de Calabi-Yau et valuations K-stables sur les variétés sphériques affines
La présente thèse constitue une première étape vers une classification en termes de valuations des métriques de Calabi-Yau complètes à croissance de volume maximale sur les espaces...
Positivity of the (co)tangent sheaf and of Chern classes
Positivity of the (co)tangent sheaf and of Chern classes
Positivité du faisceau (co)tangent et des classes de Chern Cette thèse participe à la description de certaines variétés complexes projectives à diviseur anticanoniq...
Relative Calabi-Yau structures in representation theory
Relative Calabi-Yau structures in representation theory
Structures relatives de Calabi-Yau en théorie des représentations La catégorie amassée généralisée (supérieure) associée à une dg-algèbre (n+1)-Calabi-Yau approprié...
Sound Policy Iteration
Sound Policy Iteration
Abstract Reachability probabilities and expected rewards are two main classes of properties that are needed in the fields of reinforcement learning and formal verif...
Generalized CR-Iteration Scheme with Application in Textile Designing
Generalized CR-Iteration Scheme with Application in Textile Designing
In this manuscript, we develop a new iteration method that is generalized CR-iteration method. We generate the Julia and Mandelbrot set fractals for a complex function where c ∈ ...

Back to Top