Search arXiv⌕ Search

arXiv · 1903.01937

Returning functions with closed graph are continuous

Abstract

A function $f:X\to \mathbb R$ defined on a topological space $X$ is called returning if for any point $x\in X$ there exists a positive real number $M_x$ such that for every path-connected subset $C_x\subset X$ containing the point $x$ and any $y\in C_x\setminus\{x\}$ there exists a point $z\in C_x\setminus\{x,y\}$ such that $|f(z)|\le \max\{M_x,|f(y)|\}$. A topological space $X$ is called path-inductive if a subset $U\subset X$ is open if and only if for any path $γ:[0,1]\to X$ the preimage $γ^{-1}(U)$ is open in $[0,1]$. The class of path-inductive spaces includes all first-countable locally path-connected spaces and all sequential locally contractible space. We prove that a function $f:X\to \mathbb R$ defined on a path-inductive space $X$ is continuous if and only of it is returning and has closed graph. This implies that a (weakly) Świ\c atkowski function $f:\mathbb R\to\mathbb R$ is continuous if and only if it has closed graph, which answers a problem of Maliszewski, inscibed to Lviv Scottish Book.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Taras Banakh, Małgorzata Filipczak, Julia Wódka. 2019-03-05. Returning functions with closed graph are continuous. https://doi.org/10.1515/ms-2017-0352

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Explicit Witnesses at Every Gap of the Depth Filtration of $β\mathbb{N}$

Let $Σ_{1} = \mathbb{N}^*$ and $Σ_{k+1} = \overline{\mathbb{N}^* + Σ_{k}}$ be the cumulative depth filtration of $β\mathbb{N}$, the analogue for $(\mathbb{N},+)$ of a chain of closed ideals that Protasov and Protasova studied for discrete groups, where strict descent follows from a theorem of Lutsenko and Protasov. For every $k$ we give an explicit set whose closure meets $Σ_{k}$ but not $Σ_{k+1}$. Fix the doubly exponential sequence $e_{n} = 2^{2^{n}}$, partition it into $k$ subsequences $E_{0}, \dots, E_{k-1}$ by the residue of the index modulo $k$, and set $A_{k} = E_{0} + \cdots + E_{k-1}$. We prove that any sum $q_{0} + \cdots + q_{k-1}$ of free ultrafilters with $E_{t} \in q_{t}$ lies in $Σ_{k} \setminus Σ_{k+1}$. The engine is a master lemma, proved by induction on $j$: if a sum $F_{1} + \cdots + F_{j}$ of subsequences of $\{e_{n}\}$ with pairwise disjoint index sets belongs to a free ultrafilter $s$, then $s \notin Σ_{j+1}$. The proof rests on a single rigidity of the doubly exponential sequence: a fixed difference forces the largest index in any shift-intersection, once it is large, to cancel within its own subsequence, which makes every shift-intersection descend by at least one level. The same witnesses lie in the gaps of the pure filtration.

math.GN↗

Plasticity in graph metric spaces and their hyperspaces

A metric space is plastic if every bijective nonexpansive self-map is an isometry. We prove that the hyperspace of nonempty compact subsets of every connected, locally finite, regular graph, equipped with the Hausdorff metric associated with the path metric, is plastic. The proof identifies the sets with smallest unit balls as the nonempty subsets of adjacent-twin classes and shows that every nonexpansive bijection induces an automorphism of the quotient graph preserving the sizes of these classes. Singletons are preserved when there are no adjacent twins, but need not be preserved in general. We also prove that $\mathcal{K}(K\times G)$ is plastic for every compact connected metric space $K$ and every connected, locally finite, regular graph $G$, with the supremum metric on the product, and give a more general criterion for such products. Further results include a plastic metric space whose hyperspace is not plastic, plasticity of every tree, and plasticity of the hyperspace of a connected, locally finite graph with only finitely many vertices of minimum degree.

math.GN↗