• Ingen resultater fundet

ASYMPTOTICALLY SHARP DIMENSION ESTIMATES FOR k -POROUS SETS

N/A
N/A
Info
Hent
Protected

Academic year: 2022

Del "ASYMPTOTICALLY SHARP DIMENSION ESTIMATES FOR k -POROUS SETS"

Copied!
10
0
0

Indlæser.... (se fuldtekst nu)

Hele teksten

(1)

ASYMPTOTICALLY SHARP DIMENSION ESTIMATES FOR k -POROUS SETS

E. JÄRVENPÄÄ, M. JÄRVENPÄÄ, A. KÄENMÄKI and V. SUOMALA

Abstract

InRn, we establish an asymptotically sharp upper bound for the upper Minkowski dimension of k-porous sets having holes of certain size near every point inkorthogonal directions at all small scales. This bound tends tonkask-porosity tends to its maximum value.

1. Introduction and notation

The well-known results on dimensional properties of porous setsA⊂Rnhav- ing holes of certain size at all small scales deal with the Hausdorff dimension, dimH, and the following definition of porosity:

(1.1) por(A)= inf

x∈Apor(A, x), where

(1.2) por(A, x)=lim inf

r↓0 por(A, x, r) and

(1.3)

por(A, x, r)=sup{ρ: there isz∈Rnsuch thatB(z, ρr)B(x, r)\A}.

HereB(x, r)is a closed ball with centre at x and radiusr > 0. Mattila [8]

proved that if por(A)is close to the maximum value 12, then dimH(A)cannot be much bigger than n− 1. Salli [12], in turn, verified the corresponding fact for both the upper Minkowski dimension of uniformly porous sets and the packing dimension of porous sets, and in addition to this, confirmed the correct asymptotic behaviour for the dimension estimates when porosity tends

EJ and MJ acknowledge the support of the Academy of Finland (projects #208637 and

#205806), and VS is indebted to the Finnish Graduate School of Mathematical Analysis and to the Yrjö, Vilho, and Kalle Väisälä Fund.

Received January 3, 2005.

(2)

to 12. For other related results on porous sets and measures, see [1], [2], [4], [5], [7], [10], and [11].

Clearly,n−1 is the best possible upper bound for the dimension of a set having maximum porosity; any hyperplane serves as an example. Whilst a hyperplane has holes of maximum size in one direction which is perpendicu- lar to the plane, ak-dimensional plane hasnk orthogonal directions with maximum holes. Intuitively, it seems natural to expect that the more such dir- ections the set has, the smaller its dimension should be. For examples of Cantor sets, see [12] and [6]. This leads to the following generalisations of (1.1)–(1.3) introduced in [6]:

Definition1.1. Letkandnbe integers with 1≤kn. For allA⊂Rn, x∈Rn, andr >0, we set

pork(A, x, r)=sup{: there are z1, . . . , zk ∈Rn such that for every i B(zi, r)B(x, r)\A and (zix)·(zjx)=0 if j =i}.

Here·is the inner product. Thek-porosityofAat a pointxis defined to be pork(A, x)=lim inf

r0 pork(A, x, r), and thek-porosityofAis given by

pork(A)= inf

x∈Apork(A, x).

Note that por1(A)=por(A)for allA⊂ Rn. As verified by Käenmäki and Suomala in [6] as a consequence of a conical density theorem, Definition 1.1 gives necessary tools for extending Mattila’s result to the setting described heuristically above. Indeed, it turns out that the Hausdorff dimension of any set having k-porosity close to 12 cannot be much bigger thannk, see [6, Theorem 3.2]. In this paper we generalise this result for the upper Minkowski and packing dimensions using completely different methods. Our main res- ults, Theorem 2.5 and Corollary 2.6, may be viewed as extensions of Salli’s results tok-porosity as well. However, in the casek =1 the proof we give is somewhat simpler than that of Salli’s. The dimension estimates we establish are asymptotically sharp, see Remark 2.7.

We complete this section by introducing the notation we use. For integers 0 ≤ mn, letG(n, m)be the Grassmann manifold of allm-dimensional linear subspaces ofRn. WhenVG(n, m), the orthogonal projection ontoV is denoted by projV. If 0< α <1,VG(n, m), andx ∈Rn, we define

X(x, V, α)= {y∈Rn :|projV(yx)| ≤α|yx|},

(3)

whereVG(n, nm)is the orthogonal complement ofV. Furthermore, givenVG(n, m)and 0< α <1, we say that a setA⊂Rnis(V, α)-planar

if AX(x, V, α)

for allxA. The setAis called(m, α)-planarif it is(V, α)-planar for some VG(n, m).

LetSn−1be the unit sphere inRn. For the half-spaces we use the notation H (x, θ)= {y∈Rn:(yx)·θ >0},

whereθSn−1andx ∈Rn. Moreover,∂Ais the boundary of a setA⊂Rn andA(r)= {x ∈Rn: dist(x, A)r}for allr >0.

There are many equivalent ways to define the Minkowski dimension of a given bounded setA ⊂ Rn, see [9, §5.3]. For us it is convenient to use the following: Letting 0 < δ < 1 and i ∈ N, we denote byN(A, δ, i)the minimum number of balls of radiusδi that are needed to coverA. The upper Minkowski dimension ofAis defined by setting

dimM(A)=lim sup

i→∞

logN(A, δ, i) log−i) .

It is easy to see that this definition does not depend on the choice ofδ. The Hausdorff and packing dimensions, see [9, §4.8 and §5.9], are denoted by dimHand dimp, respectively.

2. Dimension estimates fork-porous sets

For the purpose of verifying our main results, Theorem 2.5 and Corollary 2.6, we need three technical lemmas. The first one, Lemma 2.1, dealing withk- porous sets, follows easily from the definitions. The remaining ones, Lem- mas 2.2 and 2.3, are related to(m, α)-planar sets.

For√

2−1< < 12, we define

(2.1) t()= 1

√1−2 and

(2.2) δ()= 1−

2+2−1

√1−2 . Notice that

(2.3) 0< δ() <4 1−2

(4)

and, in particular,δ()→0 as12.

The first lemma is a quantitative version of the following simple fact: As- suming that pork(A, x, R) > , there existszsuch thatB(z, R)B(x, R)\ A. IfRis much larger thanr, then∂B(z, R)B(x, r)is nearly like a piece of a hyperplane. Therefore one will not lose much ifAB(x, r)\B(z, R)is replaced byAB(x, r)\H, whereH is a suitable half-space. The advantage of this replacement is thatB(x, r)\H is convex, whilstB(x, r)\B(z, R)is not.

Lemma2.1. Given

2−1 < < 12 andr0 > 0, assume that A ⊂ Rn is such thatpork(A, x, r) > for allxAand0 < r < r0. Then, taking t =t()as in(2.1), for any0< r < r20t,xA, andyAB(x, r), there are orthogonal vectorsθ1, . . . , θkSn−1such that for alli∈ {1, . . . , k}

(2.4) AB(x, r)H(y+2δrθi, θi)= ∅, whereδ=δ()is as in(2.2).

Proof. The claim follows directly from Definition 1.1 and [6, Lemma 3.1].

Lemma2.2. For all0 < α < 1there is a positive integerM = M(n, α) such that ifC ⊂Rnis convex, then∂Ccan be decomposed intoM parts all of which are(n−1, α)-planar.

Proof. LetC ⊂ Rnbe convex. For anyx∂C, we may chooseθ(x)Sn−1such thatH (x, θ(x))∩C = ∅. This defines a mappingθ:∂CSn−1. Let θ˜ ∈Sn−1andB=B(θ,˜ α3)∩Sn−1. Now, ifx, yθ1(B), then|θ(y)−θ(x)| ≤

2

3α. Sincex /H (y, θ(y))andy /H(x, θ(x)), this yields to dist(yx, θ(x))= |(y−x)·θ(x)| ≤ 23α|yx|, see Figure 1, and soyX

x, θ(x),23α

. (Here we use the notationθ(x) for the orthogonal complement of the line spanned byθ(x).) Combining this with the fact that θ(x)X

0˜,α3

implies thatyX(x,θ˜, α), and henceθ1(B)is(n−1, α)-planar. CoveringSn−1withM =M(n, α)balls of radius α3 and taking their preimages underθ gives the claim.

The next lemma is used to give a quantitative estimate of how much one needs to translate a tilted half-space such that it will not intersect a given neighbourhood of a planar set provided that the untilted half-space does not meet the neighbourhood.

(5)

2 3

y

x q(y)

q(x)

a

Figure 1. Illustration for the proof of Lemma 2.2: The extreme positions ofxandy

Lemma2.3. Letting 0 < c < 1, 0 < α < sinπ

2 −arccosc

, and VG(n, m), suppose thatP ⊂ Rn is(V, α)-planar. If 0 < δβ,xP (β), θSn−1with|projV(θ)| ≥c, andθ =projV(θ)/|projV(θ)|, then

H(x+cβθ, θ)P (β)H (x+δθ, θ), wherec=c(α, c)= 2(sin(arccosc+arcsinα))1+1

sinπ

2 −arccosc−arcsinα .

Proof. We assume that |projV(θ)| = c. In the case|projV(θ)| > c one may use a similar argument and show that the numberccan be replaced by a smaller one. First observe thatP (β)X(x, V, α)(2β). Let

A=X(x, V, α)(2β)\H (x+δθ, θ), w=x+δθ,

and

z=x− 2βθ

sin(arccosc+arcsinα),

and takeyAwhich maximises(yx)·θ, see Figure 2. Now the angle ⱔwyzis π2 −arccosc−arcsinαand since

|z−w| ≤

2

sin(arccosc+arcsinα)+1

β,

we may estimate

|(y−x)·θ| ≤ |y−z| = |z−w|

sinπ

2 −arccosc−arcsinαcβ.

(6)

q q

2b

d

z y

x w

X(x,V,a)

(y x) q Figure2. Illustration for the proof of Lemma 2.3.

The following remark will be useful when proving Theorem 2.5.

Remark2.4. LetA⊂Rn, 0< α <1, andVG(n, m). ThenAis(V, α)- planar if and only if there is a Lipschitz mappingf: projV(A)V (we identifyRnwith the direct sumV +V) with Lipschitz constantα/

1−α2 such thatAis the graph off. It follows now from the Kirszbraun’s theorem, see [3, §2.10.43], thatAcan be extended, that is, there is a(V, α)-planar set A ⊂Rnsuch thatAAand projV(A)=V.

Now we are ready to verify our main result concerning the upper Minkowski dimension of sets which are uniformlyk-porous with respect to the scaler.

Theorem2.5. Let 0 < < 12 andr0 > 0. Assuming that A ⊂ Rn is a bounded set withpork(A, x, r) > for everyxAand0< r < r0, we have

dimM(A)nk+ c log112, wherec=c(n, k)is a constant depending only onnandk.

Proof. The idea of the proof is as follows: Assuming that all the points inAB(x, r)are porous and using Lemma 2.1, one finds half-spaces which do not meetAB(x, r). After removing these, one is left with a convex set CB(x, r)such that all the points inAB(x, r)are close to the boundary ofCand the distance is proportional tor

1

2. This implies the claim in the casek =1. Fork ≥2, we divide the boundary∂Cinto planar subsetsPi and repeat the above process for the projections of each of the setsPi intoRn−1. As the result we see thatAB(x, r)is close to a (n−2)-dimensional set.

This procedure may be repeatedktimes since there arekorthogonal directions with holes.

Since it is enough to prove the claim for sufficiently large, we may assume that

(2.5) log 1

4√

1−2 > 1

3log 1 1−2.

(7)

Let 0< α <sinπ

2−arccos1 k

, and lett =t()andδ=δ()be as in (2.2) and (2.2), respectively. For any positive integermwithnkmn−1, defineαm = 212(n−k−m+1)α. Moreover, lettingc1= c

α,1k

be the constant of Lemma 2.3, setc2=1+(c1+1)/

1−α2.

FixxAand 0 < r < r20t. Taking anyyAB(x, r), letθ(y)Sn−1 be one of the vectorsθ1, . . . , θkSn−1given by Lemma 2.1. Define

C =

y∈A∩B(x,r)

Rn\H

y+2δrθ(y), θ(y) .

Here we could replaceRnwithB(x, r). However, our choice makes the induct- ive step somewhat simpler. NowCis non-empty and convex, and furthermore by (2.4),AB(x, r)(∂C)(2δr). Using Lemma 2.2, we obtain

∂C=

M(n,αn−1) i=1

Pn−1,i,

where the constantM(n, αn−1)depends only onnandαn−1, and eachPn−1,i

is(n−1, αn−1)-planar. This, in turn, gives that AB(x, r)

M(n,αn−1) i=1

Pn−1,i(2δr).

Ifk≥2, then we continue inductively: Letn−k < mn−1 and suppose that we are given(m, αm)-planar setsPm,1, . . . , Pm,lm, where

lm=M(n, αn−1)

n−1 j=m+1

M(j, αj), such that

AB(x, r)

lm

i=1

Pm,i(cn−m−2 12δr).

Consider a positive integeri with 1 ≤ ilm. Abbreviating P = Pm,i, let VG(n, m)be such thatP is(V, αm)-planar. For everyyAB(x, r)P (c2n−m−12δr), choose orthogonal vectorsθ1, . . . , θkSn−1as in Lemma 2.1.

Sincem > n−k, there isθ ∈ {θ1, . . . , θk}for which|projV(θ)| ≥ 1k. Setting θ(y)=projV(θ)/|projV(θ)|, define

C =

y∈A∩B(x,r)∩P (cn−m−12 2δr)

V \H

projV(y)+c1c2n−m−12δrθ(y), θ(y) .

(8)

It follows from Lemmas 2.1 and 2.3 that projV

AB(x, r)P (cn−m−2 12δr)

(∂C)(c1cn−m−2 12δr).

Moreover,CV is convex, and by Lemma 2.2, its boundary∂C can be decomposed into M(m, αm) parts Pj all of which are (m− 1, αm)-planar.

Using Remark 2.4, we find a(V, αm)-planar set Psuch that PPand projV(P ) =V. The rôle ofPis to guarantee thatP∩projV1(Pj)= ∅for allj. For allj ∈ {1, . . . , M (m, αm)}the setsPj =P∩projV1(Pj)are(m−1, αm−1)- planar, and moreover,

AB(x, r)P (c2n−m−12δr)

M(m,αm) j=1

Pj(c2n−m2δr),

see Figure 3.

z

Pˆ

P

z projV(z)

d1 V d2 d4

d3

Figure3. A 2-dimensional illustration for the proof of Theorem 2.5:

How much one needs to enlarge the neighbourhood in the induction step?

HerezP (cn−m−12 2δr),zPj(c1c2n−m−12δr), andβ = c2n−m−12δr. Further,d1c1β,d2c1β/

1−α2,d3β/

1−α2, andd4β. As the result of this inductive process we may find(nk, αn−k)-planar sets Pn−k,1, . . . , Pn−k,ln−k, whereln−k=M(n, αn−1)n−1

j=n−k+1M(j, αj), such that (2.6) AB(x, r)

ln−k

i=1

Pn−k,i(ck−2 12δr).

It is not hard to verify that there is a constantC(α, n, k)depending only on α, n, and k such that each of the sets Pn−k,i(ck−2 12δr)B(x, r) can be covered with C(α, n, k)δk−n balls of radius δr, and therefore by (2.6),

(9)

C(α, n, k)ln−kδk−nsuch balls will cover the setAB(x, r). Iterating this and definingc0=C(α, n, k)ln−kgives for all positive integersithatN(A, δ, i)N0(c0δk−n)i−i0, where i0 is the smallest integer with δi0 < 2r0t and N0 is a positive integer such thatAN0

j=1AB(xj, δi0)for somexjA. Taking logarithms and using (2.3) and (2.5) gives

dimM(A)≤lim sup

i→∞

log

N0(c0δk−n)i−i0

ilog 1δ =nk+ logc0

log1δ

nk+ c log112

wherec=3 logc0is a constant depending only onnandk.

For the Hausdorff and packing dimensions we have the following immediate consequence:

Corollary2.6. Let0< < 12and suppose thatA⊂Rnwithpork(A) >

. Then

dimH(A)≤dimp(A)nk+ c log112, wherecis the constant of Theorem 2.5.

Proof. RepresentingAas a countable union of sets satisfying the assump- tions of Theorem 2.5 gives the claim.

Remark2.7. The estimates of Theorem 2.5 and Corollary 2.6 are asymp- totically sharp. In fact, for any 1≤kn−1 there is a constantc=c(n, k) with the following property: for all 0< < 12there existsA ⊂Rnwith

dimH(A) > nk+ c log112

and pork(A, x, r) > for allx ∈ Rn and r > 0. The setsCλk ×[0,1]n−k serve as natural examples. HereCλ⊂[0,1] is theλ-Cantor set, see [9, §4.10].

When k = 1, the straightforward calculation can be found from Salli [12, Remark 3.8.2(1)].

REFERENCES

1. Beliaev, D. B., and Smirnov, S. K.,On dimension of porous measures, Math. Ann. 323 (2002), 123–141.

2. Eckmann, J.-P., Järvenpää, E., and Järvenpää, M.,Porosities and dimensions of measures, Nonlinearity 13 (2000), 1–18.

(10)

3. Federer, H.,Geometric Measure Theory, Springer-Verlag, Berlin, 1969.

4. Järvenpää, E., and Järvenpää, M.,Average homogeneity and dimensions of measures, Math.

Ann. 331 (2005), 557–576.

5. Järvenpää, E., and Järvenpää, M.,Porous measures onRn: local structure and dimensional properties, Proc. Amer. Math. Soc. 130 (2001), 419–426.

6. Käenmäki, A., and Suomala, V.,Nonsymmetric conical upper density andk-porosity, preprint 299 http://www.math.jyu.fi/research/papers.html.

7. Koskela, P., and Rohde, S.,Hausdorff dimension and mean porosity, Math. Ann. 309 (1997), 593–609.

8. Mattila, P.,Distribution of sets and measures along planes, J. London Math. Soc. (2) 38 (1988), 125–132.

9. Mattila, P.,Geometry of sets and measures in euclidean spaces: Fractals and rectifiability, Cambridge University Press, Cambridge, 1995.

10. Mera, M. E., and Morán, M.,Attainable values for upper porosities of measures, Real Anal.

Exchange 26 (2000), 101–115.

11. Mera, M. E., Morán, M., Preiss, D., and Zajíˇcek, L.,Porosity,σ-porosity and measures, Nonlinearity 16 (2003), 247–255.

12. Salli, A.,On the Minkowski dimension of strongly porous fractal sets inRn, Proc. London Math. Soc. (3) 62 (1991), 353–372.

DEPARTMENT OF MATHEMATICS AND STATISTICS P.O. BOX 35 (MaD)

FIN-40014 UNIVERSITY OF JYVÄSKYLÄ FINLAND

E-mail:esaj@maths.jyu.fi, amj@maths.jyu.fi, antakae@maths.jyu.fi, visuomal@maths.jyu.fi

Referencer

RELATEREDE DOKUMENTER

We consider the following dynamic graph problem: Maintain, on a random access machine with word size O(log n), a data structure representing an n × k grid graph under insertions

The calculation of the ratio between the diameters of the lower and upper echinus at Oiniadai is used in the calculation of the reconstructed upper diameter of the echinus

At mezzo level, the recontextualizing rules lay down the principles for how external power relations and discourses are recontextualized and turned into pedagogic discourse in a

 FlexRay dynamic phase analysis ≠ ”classic” bin covering.  Bins have an upper limit: size of the

• Independent set problem: Given graph G and an integer k, is there a vertex cover of size ≤ k..

• Independent set problem: Given graph G and an integer k, is there a vertex cover of size ≤ k?.

• Independent set problem: Given graph G and an integer k, is there a vertex cover of size ≤ k..

Provide documents to check the condi- tion of electrical connection points for K custom- ers using distribution grid at 110 kV voltage level and customers have generator sets