Abstract
Let K be a compact set in ℝ d with positive Hausdorff dimension. Using a fractional Brownian motion, we prove that in a prevalent set of continuous functions on K, the Hausdorff dimension of the graph is equal to \(\dim _{\mathcal{H}}(K) + 1\). This is the largest possible value. This result generalizes a previous work due to J.M. Fraser and J.T. Hyde which was exposed in the conference Fractals and Related Fields II. The case of α-Hölderian functions is also discussed.
Access provided by Autonomous University of Puebla. Download chapter PDF
Similar content being viewed by others
Keywords
- Hausdorff Dimension
- Fractional Brownian Motion
- Multifractal Analysis
- Hurst Parameter
- Weierstrass Function
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
1 Introduction
Let d ≥ 1 and let K be a compact subset in \({\mathbb{R}}^{d}\). Denote by \(\mathcal{C}(K)\) the set of continuous functions on K with real values. This is a Banach space when equipped with the supremum norm, \(\|f\|_{\infty } =\sup _{x\in K}\vert f(x)\vert \). The graph of a function \(f \in \mathcal{C}(K)\) is the set
It is often difficult to obtain the exact value of the Hausdorff dimension of the graph Γ f K of a given continuous function f. For example, a famous conjecture says that the Hausdorff dimension of the graph of the Weierstrass function
where 0 < α < 1, satisfies
This is the natural expected value, but, to our knowledge, this conjecture is not yet solved.
If we add some randomness, the problem becomes much easier and Hunt proved in [12] that the Hausdorff dimension of the graph of the random Weierstrass function
where (θ k ) k ≥ 0 is a sequence of independent uniform random variables is almost surely equal to the expected value 2 − α.
In the same spirit we can hope to have a generic answer to the following question:
Curiously, the answer to this question depends on the type of genericity we consider. If genericity is relative to the Baire category theorem, Mauldin and Williams proved at the end of the 1980s the following result:
Theorem 1 ([14]).
For quasi-all functions \(f \in \mathcal{C}([0,1])\) , we have
This theorem was recently generalized to the case of a metric compact set K. In that situation, the Hausdorff dimension of the graph of quasi-all functions \(f \in \mathcal{C}(K)\) is equal to \(\dim _{\mathcal{H}}(K)\) (see [1]).
This statement on the Hausdorff dimension of the graph is very surprising because it seems to say that a generic continuous function is quite regular. Indeed it is convenient to think that there is a deep correlation between strong irregularity properties of a function and large values of the Hausdorff dimension of its graph.
This curious result seems to indicate that genericity in the sense of the Baire category theorem is not “the good notion of genericity” for this question. In fact, when genericity is related to the notion of prevalence (see Sect. 2 for a precise definition), Fraser and Hyde recently obtained the following result.
Theorem 2 ([7]).
Let \(d \in {\mathbb{N}}^{{\ast}}\) . The set
is a prevalent subset of \(\mathcal{C}({[0,1]}^{d})\) .
This result says that the Hausdorff dimension of the graph of a generic continuous function is as large as possible and is much more in accordance with the idea that a generic continuous function is strongly irregular.
The main tool in the proof of Theorem 2 is the construction of a fat Cantor set in the interval [0, 1] and a stochastic process on [0, 1] whose graph has almost surely Hausdorff dimension 2. This construction is difficult to generalize to a compact set K ≠ [0, 1]. Nevertheless, there are in the literature stochastic processes whose almost sure Hausdorff dimension of their graph is well known. The most famous example is the fractional Brownian motion. Using such a process, we are able to prove the following generalization of Theorem 2.
Theorem 3.
Let d ≥ 1 and let K ⊂ ℝ d be a compact set such that \(\dim _{\mathcal{H}}(K) > 0\) . The set
is a prevalent subset of \(\mathcal{C}(K)\) .
In this chapter, we have decided to focus to the notion of Hausdorff dimension of graphs. Nevertheless, we can mention that there are also many papers that deal with the generic value of the dimension of graphs when the notion of dimension is for example the lower box dimension (see [6, 10, 13, 17]) or the packing dimension (see [11, 15]).
The chapter is devoted to the proof of Theorem 3 and is organized as follows. In Sect. 2 we recall the basic facts on prevalence. In particular we explain how to use a stochastic process in order to prove prevalence in functional vector spaces. In Sect. 3, we prove an auxiliary result on fractional Brownian motion which will be the key of the main theorem. We finish the proof of Theorem 3 in Sect. 4. Finally, in a last section, we deal with the case of α-Hölderian functions.
2 Prevalence
Prevalence is a notion of genericity which generalizes to infinite-dimensional vector spaces, the notion of “almost everywhere with respect to Lebesgue measure.” This notion has been introduced by Christensen in [3] and has been widely studied since then. In fractal and multifractal analysis, some properties which are true on a dense G δ-set are also prevalent (see for instance [8, 9] or [2]), whereas some are not (see for instance [9] or [16]).
Definition 1.
Let E be a complete metric vector space. A Borel set A ⊂ E is called Haar-null if there exists a compactly supported probability measure μ such that, for any x ∈ E, \(\mu (x + A) = 0\). If this property holds, the measure μ is said to be transverse to A.
A subset of E is called Haar-null if it is contained in a Haar-null Borel set. The complement of a Haar-null set is called a prevalent set.
The following results enumerate important properties of prevalence and show that this notion supplies a natural generalization of “almost every” in infinite-dimensional spaces:
-
If A is Haar-null, then x + A is Haar-null for every x ∈ E.
-
If dim(E) < + ∞, A is Haar-null if and only if it is negligible with respect to the Lebesgue measure.
-
Prevalent sets are dense.
-
The intersection of a countable collection of prevalent sets is prevalent.
-
If \(\dim (E) = +\infty \), compacts subsets of E are Haar-null.
In the context of a functional vector space E, a usual way to prove that a set A ⊂ E is prevalent is to use a stochastic process. More precisely, suppose that W is a stochastic process defined on a probability space \((\Omega ,\mathcal{F}, \mathbb{P})\) with values in E and satisfies.
Replacing f by − f, we get that the law μ of the stochastic process W is such that
In general, the measure μ is not compactly supported. Nevertheless, if we suppose that the vector space E is also a Polish space (that is if we add the hypothesis that E is separable), then we can find a compact set Q ⊂ E such that μ(Q) > 0. It follows that the compactly supported probability measure \(\nu = {(\mu (Q))}^{-1}\mu _{\vert Q}\) is transverse to E ∖ A.
3 On the Graph of a Perturbed Fractional Brownian Motion
In this section, we prove an auxiliary result which will be the key of the proof of Theorem 3. For the definition and the main properties of the fractional Brownian motion, we refer to [5, Chap. 16].
Theorem 4.
Let K be a compact set in ℝ d such that \(\dim _{\mathcal{H}}(K) > 0\) and α ∈ (0,1). Define the stochastic process in ℝ d
where W 1 ,…,W d are independent fractional Brownian motions starting from 0 with Hurst parameter equal to α. Then, for any function \(f \in \mathcal{C}(K)\) ,
Let us remark that the conclusion of Theorem 4 is sharp. More precisely, suppose that f = 0 and let ε > 0. It is well known that the fractional Brownian motion is almost surely uniformly (α − ε)-Hölderian. It follows that the stochastic process W is also uniformly (α − ε)-Hölderian on K. It is then straightforward that the graph Γ W K satisfies
On the other hand, the function
is almost surely (α − ε)-Hölderian. It follows that
The proof of Theorem 4 is based on the following lemma.
Lemma 1.
Let s > 0, α ∈ (0,1) and W be the process defined as in Eq. (1). There exists a constant C := C(s) > 0 such that for any \(\lambda \in \mathbb{R}\) , for any x,y ∈ ℝ d ,
Proof.
Observe that W(x) − W(y) is a centered gaussian variable with variance
where \(h = (h_{1},\ldots ,h_{d}) = x - y\). Hölder’s inequality yields
Now,
Suppose that s > 1. We get
In the case when 0 < s < 1, we write
where \(\gamma = \lambda {\sigma }^{-1}\). On the other hand,
which is a constant C independent of γ and α.
We are now able to finish the proof of Theorem 4. We use the potential theoretic approach (for more details on the potential theoretic approach of the calculus of the Hausdorff dimension, we can refer to [5, Chap. 4]). Suppose first that \(\dim _{\mathcal{H}}(K) > \alpha \) and let δ be a real number such that
There exists a probability measure m on K whose δ-energy I δ(m), defined by
is finite. Conversely, to prove that the Hausdorff dimension of the graph \(\Gamma _{f+W_{\omega }}^{K}\) is at least \(\dim _{\mathcal{H}}(K) + 1 - \alpha \), it suffices to find, for any \(s <\dim _{\mathcal{H}}(K) + 1 - \alpha \), a measure m ω on \(\Gamma _{f+W_{\omega }}^{K}\) with finite s-energy.
Let \((\Omega ,\mathcal{F}, \mathbb{P})\) be the probability space where the fractional Brownian motions W 1, …, W d are defined. For any ω ∈ Ω, define m ω as the image of the measure m on the graph \(\Gamma _{f+W_{\omega }}^{K}\) via the natural projection
Set \(s = \delta + 1 - \alpha \) which is greater than 1. The s-energy of m ω is equal to
Fubini’s theorem and Lemma 1 ensure that
We deduce that for \(\mathbb{P}\)-almost all ω ∈ Ω, the energy I s (m ω) is finite. Since s can be chosen arbitrary close to \(\dim _{\mathcal{H}}(K) + 1 - \alpha \), we get
In the case where \(\dim _{\mathcal{H}}(K) \leq \alpha \), we proceed exactly the same way, except that we take any \(\delta <\dim _{\mathcal{H}}(K)\) and we set \(s = \frac{\delta } {\alpha }\) which is smaller than 1. We then get
4 Proof of Theorem 3
We can now prove Theorem 3. Let K be a compact set in ℝ d satisfying \(\dim _{\mathcal{H}}(K)>0\). Remark first that for any function \(f \in \mathcal{C}(K)\), the graph Γ f K is included in \(K \times \mathbb{R}\). It follows that
Define
Theorem 4 says that for any α such that \(0 < \alpha <\min (1,\dim _{\mathcal{H}}(K))\), the set G α of all continuous functions \(f \in \mathcal{C}(K)\) satisfying \(\dim _{\mathcal{H}}\left (\Gamma _{f}^{K}\right ) \geq \dim _{\mathcal{H}}(K) + 1 - \alpha \) is prevalent in \(\mathcal{C}(K)\). Finally, we can write
where (α n ) n ≥ 0 is a sequence decreasing to 0 and we obtain that G is prevalent in \(\mathcal{C}(K)\).
Remark 1.
It is an easy consequence of Ascoli’s theorem that the law of the process W is compactly supported in \(\mathcal{C}(K)\) (remember that W is almost surely (α − ε)-Hölderian). Then, we do not need to use that \(\mathcal{C}(K)\) is a Polish space to obtain Theorem 3.
Remark 2.
Let K = [0, 1] and \(f \in \mathcal{C}([0,1])\). Theorem 3 implies that the set G⋂(f + G) is prevalent. We can then write
where f 1 and f 2 are continuous functions.
On the other hand, it was recalled in Theorem 1 that the set
contains a dense G δ-set of \(\mathcal{C}([0,1])\). It follows that any continuous function \(f \in \mathcal{C}([0,1])\) can be written
where f 1 and f 2 are continuous functions.
We can then ask the following question: given a real number β ∈ (1, 2) can we write an arbitrary continuous function \(f \in \mathcal{C}([0,1])\) in the following way:
where f 1 and f 2 are continuous functions?
We do not know the answer to this question.
5 The Case of α-Hölderian Functions
Let 0 < α < 1 and let \({\mathcal{C}}^{\alpha }(K)\) be the set of α-Hölderian functions in K endowed with the standard norm
It is well known that the Hausdorff dimension of the graph Γ f K of a function \(f \in {\mathcal{C}}^{\alpha }(K)\) satisfies
(see, e.g., the remark following the statement of Theorem 4). It is then natural to ask if inequality (2) is an equality in a prevalent set of \({\mathcal{C}}^{\alpha }(K)\). This is indeed the case as said in the following result.
Theorem 5.
Let d ≥ 1, 0 < α < 1 and \(K \subset {\mathbb{R}}^{d}\) be a compact set with strictly positive Hausdorff dimension. The set
is a prevalent subset of \({\mathcal{C}}^{\alpha }(K)\) .
This result generalizes to arbitrary compact subsets of positive dimension in \({\mathbb{R}}^{d}\) a previous work of Clausel and Nicolay (see [4, Theorem 2]).
Proof.
Let α < α′ < 1 and let W be the stochastic process defined in Theorem 4 with Hurst parameter α′ instead of α. The stochastic process W | K takes values in \({\mathcal{C}}^{\alpha }(K)\). Moreover, if α < α′ < α′, the injection
is compact. It follows that the law of the stochastic process W | K is compactly supported in \({\mathcal{C}}^{\alpha }(K)\) (W is α′-Hölderian). Then, Theorem 4 ensures that the set
is prevalent in \({\mathcal{C}}^{\alpha }(K)\). Using a sequence (α n ) n ≥ 0 decreasing to α, we get the conclusion of Theorem 5.
References
Balka, R., Buczolich, Z., Elekes, M.: Topological Hausdorff dimension and level sets of generic continuous functions on fractals. arXiv:1108.5578 (2011)
Bayart, F., Heurteaux, Y.: Multifractal analysis of the divergence of Fourier series: the extreme cases. arXiv:1110:5478, submitted (2011)
Christensen, J.P.R.: On sets of Haar measure zero in Abelian Polish groups. Israel J. Math. 13, 255–260 (1972)
Clausel, M., Nicolay, S.: Some prevalent results about strongly monoHölder functions. Nonlinearity 23, 2101–2116 (2010)
Falconer, K.J.: Fractal geometry: Mathematical foundations and applications. Wiley, Hoboken (2003)
Falconer, K.J., Fraser, J.M.: The horizon problem for prevalent surfaces, Math. Proc. Cambridge Philos. Soc. 151, 355–372 (2011)
Fraser, J.M., Hyde, J.T.: The Hausdorff dimension of graphs of prevalent continuous functions. arXiv:1104.2206 Real Anal. Exchange 37, 333–352 (2012)
Fraysse, A, Jaffard S.: How smooth is almost every function in a Sobolev space?. Rev. Mat. Iboamericana 22, 663–682 (2006)
Fraysse, A., Jaffard, S., Kahane, J.P.: Quelques propriétés génériques en analyse. (French) [Some generic properties in analysis]. C. R. Math. Acad. Sci. Paris 340, 645–651 (2005)
Gruslys, V., Jonus̃as, J., Mijovic̀, V., Ng, O., Olsen, L., Petrykiewicz I.: Dimensions of prevalent continuous functions. Monash. Math. 166, 153–180 (2012)
Humke, P.D., Petruska, G.: The packing dimension of a typical continuous function is 2. Bull. Am. Math. Soc. (N.S.) 27, 345–358 (1988–89)
Hunt, B.R.: The Hausdorff dimension of graphs of Weierstrass functions. Proc. Am. Math. Soc. 126, 791–800 (1998)
Hyde, J.T., Laschos, V., Olsen, L., Petrykiewicz, I., Shaw, A.: On the box dimensions of graphs of typical functions. J. Math. Anal. Appl. 391, 567–581 (2012)
Mauldin, R.D., Williams, S.C.: On the Hausdorff dimension of some graphs. Trans. Am. Math. Soc. 298, 793–803 (1986)
McClure, M.: The prevalent dimension of graphs, Real Anal. Exchange 23, 241–246 (1997)
Olsen, L.: Fractal and multifractal dimensions of prevalent measures. Indiana Univ. Math. J. 59, 661–690 (2010)
Shaw, A.: Prevalence, M. Math Dissertation, University of St. Andrews (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bayart, F., Heurteaux, Y. (2013). On the Hausdorff Dimension of Graphs of Prevalent Continuous Functions on Compact Sets. In: Barral, J., Seuret, S. (eds) Further Developments in Fractals and Related Fields. Trends in Mathematics. Birkhäuser, Boston. https://doi.org/10.1007/978-0-8176-8400-6_2
Download citation
DOI: https://doi.org/10.1007/978-0-8176-8400-6_2
Published:
Publisher Name: Birkhäuser, Boston
Print ISBN: 978-0-8176-8399-3
Online ISBN: 978-0-8176-8400-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)