A dichotomy property for the graphs of monomials
Abstract
We prove that the graph of a discontinuous n-monomial function f: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:Rd are studied.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.