Related papers: Some results related to the continuity problem
The most general definition of a continuous function requires that the preimage of any open set be open. Thus, to discuss continuity in the abstract, it is necessary to first define a topology, which tells us which sets in a space are open.…
Let us call a function $f$ from a space $X$ into a space $Y$ preserving if the image of every compact subspace of $X$ is compact in $Y$ and the image of every connected subspace of $X$ is connected in $Y$. By elementary theorems a…
In this paper, we study the deformation of the intersection of one compact set with a closed neighborhood of another compact set by changing the radius of this neighborhood. It is shown that in finite-dimensional normed spaces, in the case…
We show that if there exists a topologically expansive homeomorphism on a uniform space, then the space is always a regular space. Through examples we show that in general composition of topologically expansive homeomorphisms need not be…
A mixture preorder is a preorder on a mixture space (such as a convex set) that is compatible with the mixing operation. In decision theoretic terms, it satisfies the central expected utility axiom of strong independence. We consider when a…
Let $\precsim$ be a reflexive binary relation on a topological space $(X, \tau )$. A pair $(u,v)$ of continuous real-valued functions on $(X, \tau )$ is said to be a {\em continuous representation} of $\precsim$ if, for all $x,y \in X$,…
We prove that if $X$ is a topological space that admits Debreu's classical utility theorem (eg.\ $X$ is separable and connected, second countable, etc.), then order relations on $X$ satisfying milder completeness conditions can be…
We present some sufficient conditions for continuity of the mapping $f:\langle X,\tau_X^*\rangle \to \langle Y,\tau_Y^*\rangle$, where $\tau_X^*$ and $\tau_Y^*$ are topologies induced by the local function on $X$ and $Y$, resp. under the…
In this paper, we consider a model of classical linear logic based on coherence spaces endowed with a notion of totality. If we restrict ourselves to total objects, each coherence space can be regarded as a uniform space and each linear map…
In this paper we study the existence of continuous solutions and their constructions for a second order iterative functional equation, which involves iterate of the unknown function and a nonlinear term. Imposing Lipschitz conditions to…
We discuss topological versions of the closed graph theorem, where continuity is inferred from near continuity in tandem with suitable conditions on source or target spaces. We seek internal characterizations of spaces satisfying a closed…
We give a new proof of the Gibbard-Satterthwaite Theorem. We construct two topological spaces: one for the space of preference profiles and another for the space of outcomes. We show that social choice functions induce continuous mappings…
We prove the continuity of logarithmic capacity under Hausdorff convergence of uniformly perfect planar sets. The continuity holds when the Hausdorff distance to the limit set tends to zero at sufficiently rapid rate, compared to the decay…
We prove a criterion for continuity of bilinear maps on countable direct sums of topological vector spaces. As a first application, we get a new proof for the fact (due to Hirai et al. 2001) that the map taking a pair of test functions on…
In ergodic optimization theory, the existence of sub-actions is an important tool in the study of the so-called optimizing measures. For transformations with regularly varying property, we highlight a class of moduli of continuity which is…
In this oaper, we prove some fixed point theorems in metric vector spaces, in which the continuity is not required for the considered mappings to satisfy. We provide some concrete examples to demonstrate these theorems. We also give some…
The maintenance of cooperation in the presence of spatial restrictions has been studied extensively. It is well-established that the underlying graph topology can significantly influence the outcome of games on graphs. Maintenance of…
We develop a constructive theory of continuous domains from the perspective of program extraction. Our goal that programs represent (provably correct) computation without witnesses of correctness is achieved by formulating correctness…
We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…
Given two graphs, a mapping between their edge-sets is cycle-continuous, if the preimage of every cycle is a cycle. The motivation for this notion is Jaeger's conjecture that for every bridgeless graph there is a cycle-continuous mapping to…