Dimensions of graphs of prevalent continuous maps

From MaRDI portal



Abstract: Let K be an uncountable compact metric space and let C(K,mathbbRd) denote the set of continuous maps fcolonKomathbbRd endowed with the maximum norm. The goal of this paper is to determine various fractal dimensions of the graph of the prevalent finC(K,mathbbRd). 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 finC(K,mathbbRd) are underlinedimBK+d and overlinedimBK+d, respectively. This generalizes a theorem of Gruslys, Jonuv{s}as, Mijovi`c, Ng, Olsen, and Petrykiewicz. We prove that the graph of the prevalent finC(K,mathbbRd) has packing dimension dimPK+d, generalizing a result of Balka, Darji, and Elekes. Balka, Darji, and Elekes proved that the Hausdorff dimension of the graph of the prevalent finC(K,mathbbRd) equals dimHK+d. We give a simpler proof for this statement based on a method of Fraser and Hyde.


A subset \(A\) of an abelian Polish group \(G\) is called shy if there exists a Borel set \(B\subset G\) and a Borel probability measure \(\mu\) on \(G\) so that \(A\subset B\) and \(\mu(B+x)=0\) for all \(x\in G\). It is called prevalent if its complement is shy. Let \(K\) be an uncountable compact metric space which has at most finitely many isolated points. The author proves upper and lower estimates for various fractal dimensions of the graphs of mappings of \(K\) into \({\mathbb R}^d\) which are valid for prevalent sets of that mappings.











This page was built for publication: Dimensions of graphs of prevalent continuous maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q509874)