Dimensions of graphs of prevalent continuous maps

Abstract

Let K be an uncountable compact metric space and let C(K,Rd) denote the set of continuous maps f K Rd 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). As the main result of the paper we show that if K has finitely many isolated points then the lower and upper box dimension of the graph of the prevalent f∈ C(K,Rd) are B K+d and B K+d, respectively. This generalizes a theorem of Gruslys, Jonusas, Mijovi\`c, Ng, Olsen, and Petrykiewicz. We prove that the graph of the prevalent f∈ C(K,Rd) has packing dimension 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) equals H K+d. We give a simpler proof for this statement based on a method of Fraser and Hyde.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…