Processing math: 100%
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

3.3: Approximation of CR Functions

( \newcommand{\kernel}{\mathrm{null}\,}\)

The following theorem (proved circa 1980) holds in much more generality, but we state its simplest version. One of the simplifications we make is that we consider only smooth CR functions here, although the theorem holds even for continuous CR functions where the CR conditions are interpreted in the sense of distributions.

Theorem 3.3.1

Baouendi–Trèves

Suppose MCn is a smooth real hypersurface, pM is a point, and z=(z1,,zn) are the holomorphic coordinates of Cn. Then there exists a compact neighborhood KM of p, such that for every smooth CR function f:MC, there exists a sequence {pj} of polynomials in z such that pj(z)f(z)uniformly in K.

A key point is that K cannot be chosen arbitrarily, it depends on p and M. On the other hand it does not depend on f. Given M and pM there is a K such that every CR function on M is approximated uniformly on K by holomorphic polynomials. The theorem applies in one dimension, although in that case the theorem of Mergelyan (see Theorem B.31) is much more general.

Example 3.3.1

Let us show that K cannot possibly be arbitrary. For simplicity n=1. Let S1C be the unit circle (boundary of the disc), then every smooth function on S1 is a smooth CR function. Let f be a nonconstant real function such as z. Suppose for contradiction that we could take K=S1 in the theorem. Then f(z)=z could be uniformly approximated on S1 by holomorphic polynomials. By the maximum principle, the polynomials would converge on D to a holomorphic function on D continuous on ¯D. This function would have nonconstant real boundary values, which is impossible. Clearly K cannot be the entire circle.

The example is easily extended to Cn by considering M=S1×Cn1, then z1 is a smooth CR function on M that cannot be approximated uniformly on S1×{0} by holomorphic polynomials.

The technique of the example above will be used later in a more general situation, to extend CR functions using Baouendi–Trèves.

Remark 3.3.1

It is important to note the difference between Baouendi–Trèves (and similar theorems in complex analysis) and the Weierstrass approximation theorem. In Baouendi–Trèves we obtain an approximation by holomorphic polynomials, while Weierstrass gives us polynomials in the real variables, or in z and ˉz. For example, via Weierstrass, every continuous function is uniformly approximable on S1 via polynomials in z and z, and therefore by polynomials in z and ˉz. These polynomials do not in general converge anywhere but on S1.

Exercise 3.3.1

Let z=x+iy as usual in C. Find a sequence of polynomials in x and y that converge uniformly to exy on S1, but diverge everywhere else.

The proof is an ingenious use of the standard technique used to prove the Weierstrass approximation theorem. Also, as we have seen mollifiers before, the technique will not be completely foreign even to the reader who does not know the Weierstrass approximation theorem. Basically what we do is use the standard convolution argument, this time against a holomorphic function. Letting z=x+iy we only do the convolution in the x variables keeping y=0. Then we use the fact that the function is CR to show that we get an approximation even for other y.

In the formulas below, given a vector v=(v1,,vn), it will be useful to write [v]2def=v21++v2n.

The following lemma is a neat application of ideas from several complex variables to solve a problem that does not at first seems to involve holomorphic functions.

Lemma 3.3.1

Let W be the set of n×n complex matrices A such that ||(A)x||<||(A)x|| for all nonzero xRn and A is positive definite. Then for all AW, Rne[Ax]2detAdx=πn/2.

Proof

Suppose A has real entries and A is positive definite (so A is also invertible). By a change of coordinates Rne[Ax]2detAdx=Rne[x]2dx=(Rex21dx1)(Rex2ndxn)=(π)n. Next suppose A is any matrix in W. There is some ϵ>0 such that ||(A)x||2(1ϵ2)||(A)x||2 for all xRn. That is because we only need to check this for x in the unit sphere, which is compact (exercise). By reality of A, A, and x we get [(A)x]2=||(A)x||2 and [(A)x]2=||(A)x||2. So |e[Ax]2|=e[Ax]2e[(A)x]2+[(A)x]2eϵ2[(A)x]2. Therefore, the integral exists for all A in W by a similar computation as above.

The expression Rne[Ax]2detAdx is a well-defined holomorphic function in the entries of A, thinking of W as a domain (see exercises below) in Cn2. We have a holomorphic function that is constantly equal to πn/2 on WRn2 and hence it is equal to πn/2 everywhere on W.

Exercise 3.3.2

Prove the existence of ϵ>0 in the proof above.

Exercise 3.3.3

Show that WCn2 in the proof above is a domain (open and connected).

Exercise 3.3.4

Prove that we can really differentiate under the integral to show that the integral is holomorphic in the entries of A.

Exercise 3.3.5

Show that some hypotheses are needed for the lemma. In particular, take n=1 and find the exact set of A (now a complex number) for which the conclusion of the lemma is true.

Given an n×n matrix A, let ||A|| denote the operator norm, ||A||=sup||v||=1||Av||=supvCn,v0||Av||||v||.

Exercise 3.3.6

Let W be as in Lemma 3.3.1. Let B be an n×n real matrix such that ||B||<1. Show that I+iBW.

We will be using differential forms, and the following lemma says that as far as the exterior derivative is concerned, all CR functions behave as restrictions of holomorphic functions.

Lemma 3.3.2

Let MCn be a smooth real hypersurface, f:MC be a smooth CR function, and (z1,,zn) be the holomorphic coordinates of Cn. Then at each point pM, the exterior derivative df is a linear combination of dz1,,dzn, thinking of z1,,zn as functions on M.Namely, d(fdz)=dfdz=0.

Recall the notation dz=dz1dz2dzn.

Proof

After a complex affine change of coordinates, we simply need to prove the result at the origin. Let ξ1,,ξn be the new holomorphic coordinates and suppose the T(1,0)0M tangent space is spanned by ξ1|0,,ξn1|0, and such that ξn|0 is tangent and ξn|0 is normal. At the origin, the CR conditions are fˉξk(0)=0 for all k, so df(0)=fξ1(0)dξ1(0)++fξn1(0)dξn1(0)+fξn(0)d(ξn)(0). Also, at the origin dξn(0)=d(ξn)(0)+id(ξn)(0)=d(ξn)(0). So df(0) is a linear combination of dξ1(0),,dξn(0). As ξ is a complex affine function of z, then each dξk is a linear combination of dz1 through dzn, and the claim follows. So if f is a CR function, then d(fdz)=dfdz=0 since dzkdzk=0.

Proof of the theorem of Baouendi–Trèves. Suppose MCn is a smooth real hypersurface, and without loss of generality suppose p=0M. Let z=(z1,,zn) be the holomorphic coordinates, write z=x+iy, y=(y,yn), and suppose M is given by yn=ψ(x,y), where ψ is O(2). The variables (x,y) parametrize M near 0: zj=xj+iyj, for j=1,,n1,andzn=xn+iψ(x,y). Define φ(x,y)=(y1,,yn1,ψ(x,y)). Write (x,y)z=x+iφ(x,y) as the parametrization. That is, think of z as a function of (x,y).

Let r>0 and d>0 be small numbers to be determined later. Assume they are small enough so that f and φ are defined and smooth on some neighborhood of the set where ||x||r and ||y||d.

There exists a smooth g:Rn[0,1] such that g1 on Br/2(0) and g0 outside of Br(0). See Figure 3.3.1. Explicit formula can be given. Alternatively we obtain such a g by use of mollifiers on a function that is identically one on B3r/4(0) and zero elsewhere. Such a g is commonly called a cutoff function.

clipboard_e48d352d953f1670e82981022cdfb1051.png

Figure 3.3.1

Exercise 3.3.7

Find an explicit formula for g without using mollifiers.

Let K={(x,y):||x||r4,||y||d}. Let K=z(K), that is the image of K under the mapping z(x,y).

Consider the CR function f a function of (x,y) and write f(x,y). For N, let α be a differential n-form defined (thinking of wCn as a constant parameter) by α(x,y)=(π)n/2e[wz]2g(x)f(x,y)dz=(π)n/2e[wxiφ(x,y)]2g(x)f(x,y)(dx1+idy1)(dxn1+idyn1)(dxn+idψ(x,y)).

The key is the exponential, which looks like the bump function mollifier, except that now we have w and z possibly complex. The exponential is also holomorphic in w, and that will give us entire holomorphic approximating functions.

Fix y with 0<||y||<d and let D be defined by D={(x,s)Rn×Rn1:||x||<r and s=ty for t(0,1)}. D is an (n+1)-dimensional “cylinder.” We take a ball in the x directions, then take a single fixed point y in the s variables and make a cylinder. See Figure 3.3.2.

clipboard_e0e31e30a9ea900a402d7ec2c9234962b.png

Figure 3.3.2

Orient D in the standard way as if it sat in the (x,t) variables in Rn×R. Stokes’ theorem says Ddα(x,s)=Dα(x,s). Since g(x)=0 if ||x||r, α is zero on the sides of the cylinder D, so the integral over D only needs to consider the top and bottom of the cylinder. And because of g, the integral over the top and bottom can be taken over Rn. As is usual in these sorts of arguments, we do the slight abuse of notation where we ignore that f and φ are undefined where g is identically zero:

Dα(x,s)=(π)n/2xRne[wxiφ(x,y)]2g(x)f(x,y)dx1dxn1(dxn+idxψ(x,y))(π)n/2xRne[wxiφ(x,0)]2g(x)f(x,0)dx1dxn1(dxn+idxψ(x,0)), where dx means the derivative in the x directions only. That is, dxψ=ψx1dx1++ψxndxn.

We will show that as , the left-hand side of (3.3.19) goes to zero uniformly for wK and the first term on the right-hand side goes to f(˜x,y) if w=z(˜x,y) is in M. Hence, we define entire functions that we will show approximate f: f(w)=(π)n/2xRne[wxiφ(x,0)]2g(x)f(x,0)dx1dxn1(dxn+idxψ(x,0)). Clearly each f is holomorphic and defined for all wCn.

In the next claim it is important that f is a CR function.

Claim 3.3.1

We have dα(x,s)=(π)n/2e[wz(x,s)]2f(x,s)dg(x)dz(x,s), and for sufficiently small r>0 and d>0, lim(π)n/2(x,s)De[wz(x,s)]2f(x,s)dg(x)dz(x,s)=0 uniformly as a function of wK and yBd(0) (recall that D depends on y).

Proof

The function (x,s)e[wz(x,s)]2 is CR (as a function on M), and so is f(x,s). Therefore, using Lemma 3.3.2, dα(x,s)=(π)n/2e[wz(x,s)]2f(x,s)dg(x)dz(x,s). Since dg is zero for ||x||r2, the integral Ddα(x,s)=(π)n/2De[wz(x,s)]2f(x,s)dg(x)dz(x,s) is only evaluated for the subset of D where ||x||>r2.

Suppose wK and (x,s)D with ||x||>r2. Let w=z(˜x,˜s). We need to estimate |e[wz(x,s)]2|=e[wz(x,s)]2. Then [wz]2=||˜xx||2+||φ(˜x,˜s)φ(x,s)||2. By the mean value theorem ||φ(˜x,˜s)φ(x,s)||||φ(˜x,˜s)φ(x,˜s)||+||φ(x,˜s)φ(x,s)||a||˜xx||+A||˜ss||, where a and A are a=sup||ˆx||r,||ˆy||d||[φx(ˆx,ˆy)]||,A=sup||ˆx||r,||ˆy||d||[φy(ˆx,ˆy))]||. Here [φx] and [φy] are the derivatives (matrices) of φ with respect to x and y respectively, and the norm we are taking is the operator norm. Because [φx] is zero at the origin, we pick r and d small enough (and hence K small enough) so that a14. We furthermore pick d possibly even smaller to ensure that dr32A. We have that r2||x||r, but ||˜x||r4 (recall wK), so r4||˜xx||5r4. Also, ||˜ss||2d by triangle inequality.

Therefore, [wz(x,s)]2||˜xx||2+a2||˜xx||2+A2||˜ss||2+2aA||˜xx||||˜ss||1516||˜xx||2+A2||˜ss||2+A2||˜xx||||˜ss||r264.

In other words, |e[wz(x,s)]2|er2/64, or |(π)n/2(x,s)De[wz(x,s)]2f(x,s)dg(x)dz(x,s)|Cn/2er2/64, for some constant C. Note that D depends on y. The set of all y with ||y||d, is a compact set, so we can make C large enough to not depend on the y that was chosen. The claim follows.

Claim 3.3.2

For the given r>0 and d>0, lim(π)n/2xRne[˜x+iφ(˜x,y)xiφ(x,y)]2g(x)f(x,y)dx1dxn1(dxn+idxψ(x,y))=f(˜x,y) uniformly in (˜x,y)K.

That is, we look at (3.3.19) and we plug in w=z(˜x,y)K. The g (as usual) makes sure we never evaluate f, ψ, or φ at points where they are not defined.

Proof

The change of variables formula implies dx1dxn1(dxn+idxψ(x,y))=dxz(x,y)=det[zx(x,y)]dx, where [zx(x,y)] is the matrix corresponding to the derivative of the mapping z with respect to the x variables evaluated at (x,y).

Let us change variables of integration via ξ=(x˜x): (π)n/2xRne[˜x+iφ(˜x,y)xiφ(x,y)]2g(x)f(x,y)det[zx(x,y)]dx=(1π)n/2ξRne[ξ+i(φ(˜x+ξ,y)φ(˜x,y))]2g(˜x+ξ)f(˜x+ξ,y)det[zx(˜x+ξ,y)]dξ. We now wish to take a limit as and for this we apply the dominated convergence theorem. So we need to dominate the integrand. The second half of the integrand is uniformly bounded independent of as xg(x)f(x,y)det[zx(x,y)] is a continuous function with compact support (because of g). Hence it is enough to worry about the exponential term. We also only consider those ξ where the integrand is not zero. Recall that r and d are small enough that

sup||ˆx||r,||ˆy||d||[φx(ˆx,ˆy)]||14, and as ||˜x||r4 (as (˜x,y)K) and ||˜x+ξ||r (because g is zero otherwise), then

||φ(˜x+ξ,y)φ(˜x,y)||14||˜x+ξ˜x||=||ξ||4.

So under the same conditions we have |e[ξ+i(φ(˜x+ξ,y)φ(˜x,y))]2|=e[ξ+i(φ(˜x+ξ,y)φ(˜x,y))]2=e||ξ||2+||φ(˜x+ξ,y)φ(˜x,y)||2e(15/16)||ξ||2.

And that is integrable. Thus, take the pointwise limit under the integral to obtain (1π)n/2ξRne[ξ+i[φx(˜x,y)]ξ]2g(˜x)f(˜x,y)det[zx(˜x,y)]dξ. In the exponent, we have an expression for the derivative in the ξ direction with y fixed. If (˜x,y)K, then g(˜x)=1, and so we can ignore g.

Let A=I+i[φx(˜x,y)]. Lemma 3.3.1 says (1π)n/2ξRne[ξ+i[φx(˜x,y)]ξ]2f(˜x,y)det[zx(˜x,y)]dξ=f(˜x,y).

That the convergence is uniform in (˜x,y)K is left as an exercise.

Exercise 3.3.8

In the claim above, finish the proof that the convergence is uniform in (˜x,y)K. Hint: It may be easier to use the form of the integral before the change of variables and prove that the sequence is uniformly Cauchy.

We are essentially done with the proof of the theorem. The two claims together with (3.3.19) show that f are entire holomorphic functions that approximate f uniformly on K. Entire holomorphic functions can be approximated by polynomials uniformly on compact subsets; simply take the partial sums of Taylor series at the origin.

Exercise 3.3.9

Explain why being approximable on K by (holomorphic) polynomials does not necessarily mean that f is real-analytic.

Exercise 3.3.10

Suppose MCn is given by zn=0. Use the standard Weierstrass approximation theorem to show that given a K⊂⊂M, and a smooth CR function f:MC, then f can be uniformly approximated by holomorphic polynomials on K.


This page titled 3.3: Approximation of CR Functions is shared under a CC BY-SA 4.0 license and was authored, remixed, and/or curated by Jiří Lebl via source content that was edited to the style and standards of the LibreTexts platform.

Support Center

How can we help?