Dimensions of graphs of prevalent continuous maps

preprint2015arXivOpen access

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 ⁣:K→Rdf\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 f∈C(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 f∈C(K,Rd)f\in C(K,\mathbb{R}^d) are dim⁡‾BK+d\underline{\dim}_B K+d and dim⁡‾BK+d\overline{\dim}_B K+d, respectively. This generalizes a theorem of Gruslys, Jonušas, Mijovic, Ng, Olsen, and Petrykiewicz. We prove that the graph of the prevalent f∈C(K,Rd)f\in C(K,\mathbb{R}^d) has packing dimension dim⁡PK+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 f∈C(K,Rd)f\in C(K,\mathbb{R}^d) equals dim⁡HK+d\dim_H K+d. We give a simpler proof for this statement based on a method of Fraser and Hyde.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.