English

Dimensions of graphs of prevalent continuous maps

Classical Analysis and ODEs 2015-12-29 v3 Metric Geometry Probability

Abstract

Let KK be an uncountable compact metric space and let C(K,Rd)C(K,\mathbb{R}^d) denote the set of continuous maps f ⁣:KRdf\colon K \to \mathbb{R}^d endowed with the maximum norm. The goal of this paper is to determine various fractal dimensions of the graph of the prevalent fC(K,Rd)f\in C(K,\mathbb{R}^d). As the main result of the paper we show that if KK has finitely many isolated points then the lower and upper box dimension of the graph of the prevalent fC(K,Rd)f\in C(K,\mathbb{R}^d) are dimBK+d\underline{\dim}_B K+d and dimBK+d\overline{\dim}_B K+d, respectively. This generalizes a theorem of Gruslys, Jonu\v{s}as, Mijovi\`c, Ng, Olsen, and Petrykiewicz. We prove that the graph of the prevalent fC(K,Rd)f\in C(K,\mathbb{R}^d) has packing dimension dimPK+d\dim_P K+d, generalizing a result of Balka, Darji, and Elekes. Balka, Darji, and Elekes proved that the Hausdorff dimension of the graph of the prevalent fC(K,Rd)f\in C(K,\mathbb{R}^d) equals dimHK+d\dim_H K+d. We give a simpler proof for this statement based on a method of Fraser and Hyde.

Keywords

Cite

@article{arxiv.1503.00865,
  title  = {Dimensions of graphs of prevalent continuous maps},
  author = {Richárd Balka},
  journal= {arXiv preprint arXiv:1503.00865},
  year   = {2015}
}

Comments

16 pages