Peak functions in C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {C}$$\end{document}-convex domains

In this paper, we show the existence of different types of peak functions in classes of C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {C}$$\end{document}-convex domains. As one of the tools used in this context is a result on preserving the regularity of C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {C}$$\end{document}-convex domains under projection.


Introduction
A domain D ⊂ C n is called C-convex if for any affine complex line l passing through the domain D, the intersection D ∩ l is connected and simply connected. The notion of C-convexity may be seen as a complex analog of the notion of convexity. However, as it is well known and as we shall also see below, the geometry and regularity of different natural phenomena are in the case of C-convex domains much more complicated than for the convex ones.
It is trivial that the C-convexity is preserved under complex affine isometries. On the other hand, the fact that the image under projection of a bounded C-convex domain remains C-convex is much harder to prove (see, e.g., Theorem 2.3.6 in [2])-recall that the analogous property in the case of convex domains is trivial. This invariance of C-convexity will be crucial in the subsequent considerations. Another fact that will be used quite often by us is the fact that C-convex domains are necessarily linearly convex-i.e. for any point p ∈ C n \D, there is a complex affine hyperplane passing through p, which is disjoint from D. A good reference for properties of C-convex domains is [6] or [2].
In this paper, we try to see to what extent some of the properties that are satisfied by convex domains may be transferred to C-convex domains. The problems discussed involve the following general ones that are quite well understood in the case of convex domains.
• To what extent is the smoothness of the domain preserved under projections? • Find general assumptions on a domain sufficient for the existence of different types of peak functions.
In Sect. 2, we introduce two classes of domains (extreme and strictly) C-convex. When restricted to C-convex domains, the extreme C-convex domains admit (global) holomorphic peak functions (Proposition 3). Trying to get the peak points in boundaries of C-convex domains, we follow the ideas from the convex situation, which makes us recall the results on the regularity of shadows of convex domains (Sect. 3). Thus, we are led to results on the regularity of shadows of sufficiently regular C-convex domains (strictly C-convex and normal) and as a simple corollary, we get the proof of the existence of A(D)-peak functions in a wide variety of C-convex domains (Theorem 6 and Corollary 9). It is worth noting that both notions of strict C-convexity and normality seem quite natural. The first one is an analog of strict convexity, and the other one a generalization of a regularity of a plane domain which appeared in the theory of regularity of the Riemann mapping. In Sect. 5, we show invariance of the strong linear convexity under projection, which is in contrast to the situation of the strong pseudoconvexity.
2 Preliminary results on the existence of peak functions: case of extreme C-convex domains Recall that in the paper [9], a notion of a weak peak function (and a weak peak point) was introduced. For a domain D ⊂ C n , p ∈ ∂ D, the holomorphic function f : D → D is called a weak peak function if f extends continuously to D ∪ {p} with f ( p) = 1; in this situation, p is called a weak peak point. It was proven in Theorem 2.2 in [9] that any boundary point of a bounded C-convex domain admits a weak peak function. It turns out that under some additional assumption on the domain, the peak function may be chosen to be a little more regular. However, at this point, we do not yet prove the existence of peak functions from the algebra A(D)-the space of all continuous function on D that are holomorphic on D. We start with a discussion on different possibilities of defining a geometric notion of some kind of strict (or extreme) C-convexity.

Extreme (strict) C-convexity: a general discussion
Below, we discuss briefly different approaches to a phenomenon of complex geometric extremality (extreme or strict). The different notions, as we shall see, allow different classes of peak functions.
Let D be a bounded domain in C n . We call a point p ∈ ∂ D extremeC-convex if there are a complex affine hyperplane H and a neighborhood U of p such that H ∩ D ∩ U = {p}. In case U may be chosen to be C n , the point p is called globally extreme C-convex. The domain D is called (globally) extreme C-convex if any of its boundary point is (globally) extreme C-convex.
Note that all planar domains are extreme C-convex.
In [14], the Author introduced in the class of convex domains the notion of C-strict convexity. We adopt the notion to a more general class of C-convex domains. But let us begin without restriction to C-convex domains.
Let D ⊂ C n be a bounded linearly convex domain. We call the boundary point p ∈ ∂ D C-strictly C-convex or shortly strictly C-convex if there is a neighborhood U of p such that U ∩ D ∩ H = {p} for any supporting hyperplane H of D at p (i.e., H is a complex affine hyperplane with p ∈ H , H ∩ D = ∅). In case the neighborhood U is chosen to be the whole C n , the point p is called globally strictly C-convex. The domain D is called (globally) strictly C-convex if any of its boundary point is (globally) strictly C-convex.
Certainly, if p is strictly C-convex, then it is extreme C-convex. In the class of C 1 -smooth C-convex domains, both notions are equivalent.
The (purely geometric) notion of strict C-convexity is an intermediate one between the general C-convexity and the strong linear convexity (to be discussed later). In the convex case, we have analogous notions: strict convexity (geometric condition) and strong convexity (differential condition).

Remark 1
We have the following simple property. The proof of the property below needs only the definition of the C-convexity. Therefore, we omit details of it.
Let D be a bounded C-convex domain in C n , p ∈ ∂ D. Then, • p is extreme C-convex iff p is globally extreme C-convex; • p is strictly C-convex iff p is globally strictly C-convex.
Remark 2 Note that one may consider the following (formally) stronger condition than the strict C-convexity: For any boundary point p ∈ ∂ D and any complex affine line l passing through p and disjoint from D, we have l ∩ D = {p}. In the class of C-convex domains, both notions are in fact equivalent. In fact, assume that for some strictly C-convex domain, there are points p, q ∈ ∂ D, p = q and a complex line l connecting p and q disjoint from D. Composing with affine complex isomorphisms, we may assume that l = {0} n−1 × C, p = 0. Then, one can easily see that the projection of D on C n−1 gives a C-convex domain with 0 ∈ ∂π(D). Let H be a supporting hyperplane at 0 to π(D). Then, one may easily see that H := H × C is a supporting hyperplane to D and p, q ∈ H -contradiction with the strict C-convexity of D.
Below, we shall make use of the above property of strict C-convex domains.

Peak functions in extreme C-convex domains
Then, we have the following.

Proposition 3 Let D be a bounded C-convex domain in C n , and let p ∈ ∂ D be extreme C-convex. Then, p is a holomorphic peak point.
Proof Let l be a complex line intersecting D and passing through p, and let H be a hyperplane such that H ∩ D = {p}. Let π be the projection on l (treated later as the complex plane) in the direction of the hyperplane H ; in particular, p = π( p) and H = π −1 ( p). Then, l ∩ D ⊂ π(D) and π(D) is simply connected (use C-convexity of D-see [2]). Take a sequence p j ∈ D which converges to p. Then, l ∩ π(D) π( p j ) also converges to p implying that p ∈ π(D). To conclude that p ∈ ∂π(D), it is sufficient to note that from the definition of the projection π, we get that p = π( p) / ∈ π(D). Let f : π(D) → D be a function as in Theorem 2.2 in [9] (recall f (λ) := exp(−1/ log(diam π(D)/(λ − π( p)))))note that it is in particular a holomorphic peak function for π(D) at p). We put F := f • π. We claim it is a holomorphic peak function for D at p.
In fact, let U be a neighborhood of p. Then, because of extreme C-convexity at p, we find Remark 4 Recall that a domain D ⊂ C n has the (P) property at p ∈ ∂ D if for any neighborhood U of p (see [5]) Here, g D ( p, ·) denotes the pluricomplex Green function with the pole at p ∈ D. The existence of a holomorphic peak function at p implies that p has the property (P) (see [5]). Therefore, any extreme C-convex point of a bounded C-convex domain D has the property (P). Consequently, it follows from [10] that the localization property of invariant metrics holds. In particular, for any neighborhood U of p, we have the following (uniform) convergence: where κ D denotes the Kobayashi metric.

Regularity of shadows: a general discussion
Having proven a result on the existence of peak points, one could try to get positive results on the existence of peak functions for the function algebra A(D) for more regular C-convex domains.
Recall that in the case of convex domains, a general idea of constructing such peak functions often relies upon projecting the domain in the direction of the supporting hyperplane onto the plane and then making use of the fact that projections of convex domains are convex too and then applying the existence of peak function in convex planar domains. Therefore, it is natural from that point of view to study the regularity of projections of C-convex domains. Recall that C-convexity is preserved under such mappings; however, unlike in the convex case, not all C-convex planar domains have all the points being A(D)-peak points (consider D\[0, 1)). Thus, it is natural that one has to impose some regularity condition on a C-convex domain to have the image to be regular enough to admit peak functions.
The (well-understood) problem of the regularity of shadows of convex domains will be the basis of our subsequent considerations. Let π : R n+m → R n be the projection onto the first n coordinates. Let D ⊂ R n+m be convex. The domainD := π(D) is called shadow.
We should make several remarks here.

Remark 5
The problem of preserving the regularity of convex sets under projections has been studied intensively.
The results known include for instance the following: • The shadow of a C 1,1 -smooth convex domain is C 1,1 -smooth. This follows easily from the description of C 1,1 -regularity with the aid of the ball condition, a well-known folklore that can be found (with proof) for instance in [1]. • For three-dimensional convex domains (n = 2, m = 1), we have the following regularity results for the shadows. The shadow of a C 1 -smooth convex domain is C 1 -smooth, the shadow of a C 2,1 -smooth convex domain is C 2 , and the shadow of a real analytic convex domain is C 2,α -smooth for some α > 0. All these results are essentially sharp (see [8]). • In higher dimensional cases, the previous regularities of the shadow of smooth convex domains are essentially weaker than in dimension three (see [4,13]).
The above results show that even in the class of convex domains, a very small relaxation of regularity properties of the domain leads to a decisive change in the regularity of the shadow. Therefore, it is reasonable to suspect that in the case of C-convex domains, the situation may even be more complicated and difficult. As we shall see in the subsequent section, this is actually the case.

Peak functions in strictly C-convex domains
In addition to earlier introduced notions of extreme and strict C-convexity, we introduce another natural geometrical condition. Let D be a bounded domain in C n . We say that the point p ∈ ∂ D is normal if for any neighborhood U of p, there is a neighborhood V ⊂ U of p such that any two points w, z ∈ V ∩ D may be connected by a curve lying entirely in U ∩ D.
In the case n = 1 if p ∈ ∂ D is normal, then it is "ein normaler Randpunkt" as it is defined in [3] (definition on p. 359). Consequently, if all the boundary points of a bounded C-convex domain in C are normal, then the Riemann mapping extends homeomorphically onto the closures and the boundary is a Jordan curve (Theorems 41 and 42 in [3]). Therefore, if all boundary points of a simply connected domain are normal, then all the boundary points are peak points for the algebra A(D). Moreover, planar simply connected normal domains, i.e., each of its boundary point is a normal one, are fat.
It turns out that the above properties behave well under projections.

Theorem 6
Let D be a bounded strictly C-convex domain in C n+m that is normal (i.e., any boundary point of D is normal). Then,D := π(D) ⊂ C n is a strictly C-convex normal domain.
To prove the normality ofD, let p ∈ ∂D and letŨ be a neighborhood of p and ( p, q) ∈ ∂ D. Choose a neighborhood U of ( p, q) such that π(U ) ⊂Ũ . The normality of D allows us to choose a neighborhood V 1 ⊂ U of ( p, q) such that any two points from V 1 ∩ D may be connected by a curve lying entirely in U ∩ D. The strict C-convexity of D allows us to find a neighborhood V ⊂ V 1 of ( p, q) such that π −1 (π(V ) ∩D) ∩ D ⊂ V 1 . Otherwise, we could find a sequence ( p j , q j ) j ⊂ D such that p j → p, q j →q = q, which would imply that the line connecting ( p, q) and ( p,q), which is disjoint from D, would contain two different points-a contradiction.

Remark 7
Note that bounded C 1 -smooth strictly C-convex domains are normal.

Remark 8
Another, even stronger notion of normality may also be considered. Namely, the point p ∈ ∂ D, where D is a bounded domain, is called strongly normal if for any neighborhood U of p there is a neighborhood V ⊂ U of p such that the set V ∩ D is connected. Then, as we shall see below, the above theorem would remain true if the notion 'normal' would be replaced by 'strongly normal.' Since we are mainly interested in the fact that (strong) normal points satisfy the notion of a 'ein normaler Randpunkt,' we present the proof of that (formally different) fact below only as an observation.
Assume that the assumption in the above theorem of the normality of D is replaced by the strong normality. To prove the strong normality ofD, let p ∈ ∂D and letŨ be a neighborhood of p and ( p, q) ∈ ∂ D. Choose a neighborhood U of ( p, q) such that π(U ) ⊂Ũ . The strong normality of D allows us to choose V ⊂ U such that V ∩ D is connected. We claim that there is an > 0 such that B( p, ) ∩D ⊂ π(V ∩ D) which would finish the proof sinceṼ := π(V ∩ D) ∪ B( p, ) would be the desired neighborhood of p (note that V ∩D = π(V ∩ D) is connected). To prove the claim, suppose the opposite. Then, there is a sequence (z k ) ⊂D tending to p such that for some w k , we have (z k , w k ) ∈ D\V . Without loss of generality, w k → w = q. But then, ( p, w) ∈ ∂ D and the complex affine line l ⊂ {p} n × C m that connects ( p, q) and ( p, w) disjoint from D contains two points ( p, q) and ( p, w) from D, which contradicts the strict C-convexity of D.
Recall that for p ∈ ∂ D, the function f ∈ A(D) is called A(D)-peak function if f ( p) = 1 and | f (z)| < 1, z ∈ D\{ p}; the point p is then an A(D)-peak point.

Corollary 9 Let D be a bounded strictly C-convex domain in C n . Assume that D is normal (for instance, D is C 1 -smooth). Then, any boundary point of D is an A(D)-peak point.
Remark 10 It would be desirable to try to extend the previous results to a wider class of domains by relaxing some of the assumptions. However, one should be aware of some limits of possible extensions. Namely, the example of a Hartogs domain in C 2 from [7] (3.2.4, pp. 55-58) shows that the fat C-convex domain may have some of its boundary not being A(D)peak points and the image under projection may be nonfat. Certainly, our results above give also the fatness of the image of a projection of the strictly C-convex normal domain. That kind of property is another one projections of C-convex domains can have (see the results on spiral connectedness in, e.g., Corollary 2.6.7 in [2] or [15]).

Remark 11
At this point, it should be recalled that M. Range introduced in [12] the notion of a totally pseudoconvex domain, which may be seen as a generalization of strict C-convexity in which the supporting hyperplane is replaced by a kind of a supporting hypersurface. M. Range showed the existence of local peak points in such domains with C 1 -boundary. In the case the domain is C ∞ -smooth, the peak functions are in fact global ones. Our results therefore extend partially Range's results with much simpler methods.

Projection of strongly linearly convex domains
We now move to the study of the regularity of the shadow in a much more regular class of C-convex domains. Let D ⊂ C n+m be a strongly linearly convex C 2 -domain. In other words, there is a C 2 -defining function ρ defined on a neighborhood U of ∂ D, which, in particular, satisfies the following properties ∂ D = {z ∈ U : ρ(z) = 0}, ρ = 0 on U , and Recall that any strongly linearly convex domain is strongly pseudoconvex and moreover strictly C-convex. The other implication does not hold, even in the class of C 2 smooth C-convex domains.
Let π be the projection onto C n . Similarly as earlier, we may consider the C-convex domain (called shadow)D := π(D) ⊂ C n . Then, we may define the homeomorphism onto its image : ∂D → ∂ D such that π • is the identity. In fact, note that over any point z ∈ ∂D, there lies exactly one point (z) ∈ ∂ D. Moreover, it easily seen that is continuous.

Theorem 12 Let D be a C k -smooth strongly linearly convex domain in
and is a C k -diffeomorphism onto the image.
Note that S := (∂D) = (z, w) ∈ U : ∂ρ ∂w (z, w) = 0, ρ(z, w) = 0 ⊂ ∂ D. Additionally, note that for (z, w) ∈ S, we have T C (z,w) ∂ D ⊃ {0} n × C m . Consider the equation (actually the formula below represents 2m real equations) We shall below solve the above equation near the points (z, w) ∈ S. Let us calculate the derivative of the above equation with respect to (real) variables: Re w 1 , Im w 1 , . . . , Re w m , Im w m . Note that the Jacobi matrix of the system of equations with respect to the variables is (part of) the Hesse matrix of ρ. This part consists of derivatives with respect to the same systems of 2m variables. Denote that square (2m) × (2m) matrix byH. Note that for all Y ∈ C m , we have (0, Y ) ∈ T C (z,w) ∂ D. Thus, we get the following inequality: c||Y which implies that detHρ(z, w) > 0. In other words, we may apply the implicit mapping theorem to get near (z, w) ∈ S the solution of the equation ∂ρ ∂w = 0 as a C k−1 mapping ϕ : U (z) → U (w). In particular, ∂ρ ∂w (z, ϕ(z)) = 0. Now we arrive at the final part of the proof. Define locallyρ(z) := ρ(z, ϕ(z)). Then,ρ is C k−1 smooth. Note that for z ∈ ∂ D, we have ∂ρ ∂z (z) = ∂ρ ∂z (z, ϕ(z)), which does not vanish (remember that ∂ρ ∂w (z, ϕ(z)) = 0, z ∈ ∂D). Moreover, the last formula implies that ∂ρ ∂z is C k−1 , which implies thatρ is C k .
The Hesse matrix of ρ on the vectors X ∈ T C z ∂ D satisfies (remember that (X, 0) ∈ T C (z,ϕ(z)) ∂ D) Hρ(z)(X ) = Hρ(z, ϕ(z))(X, 0) ≥ c||X || 2 (7) from which we get the positive definiteness of the Hesse matrix on the complex tangent hyperplane. We should also see whetherρ satisfies the properties:ρ < 0 onD andρ > 0 on C n \D. But shrinking if necessary the neighborhood of the point where we defineρ, we may assume that the infimum of ρ when restricted to {z} × C m is attained in the neighborhood of the point from ∂ D ⊂ C n+m where the implicit function theorem is solved. But at the point where the infimum is attained, the equality ∂ρ ∂w = 0 is satisfied (this is a consequence of C-strict convexity). This implies the desired property and finishes the proof of the strong linear convexity ofD.

Remark 13
We should point out the following phenomenon showing that the situation of the C-convex case differs from the case of pseudoconvex domains. Recall that the projections of pseudoconvex domains (even strongly pseudoconvex ones) need not be pseudoconvex (see [11]). The above result shows that strongly linearly convex domains behave much more like the convex domains rather than the pseudoconvex ones. Recall also that the idea of the above proof is actually the same as the one in the analogous result in the convex case (see Lemma 7.1.5 in [6]). In case of a (real) strongly convex domain, the same method also applies and gives the invariance of the corresponding notion under projections.
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.