A dichotomy property for the graphs of monomials

Abstract

We prove that the graph of a discontinuous n-monomial function f : R → R is either connected or totally disconnected. Furthermore, the discontinuous monomial functions with connected graph are characterized as those satisfying a certain big graph property. Finally, the connectedness properties of the graphs of additive functions f : R d → R are studied.