English
Related papers

Related papers: Continuous Representations of Preferences by Means…

200 papers

A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…

Logic · Mathematics 2015-03-19 Arno Pauly , Martin Ziegler

A function $f:X\to Y$ between topological spaces is called {\em compact-preserving} if the image $f(K)$ of each compact subset $K\subset X$ is compact. We prove that a function $f:X\to Y$ defined on a strong Frechet space $X$ is…

General Topology · Mathematics 2013-05-28 Taras Banakh , Artur Bartoszewicz , Marek Bienias , Szymon Glab

This article presents an elementary proof of the Implicit Function Theorem for differentiable maps F(x,y), defined on a finite-dimensional Euclidean space, with $\frac{\partial F}{\partial y}(x,y)$ only continuous at the base point. In the…

Classical Analysis and ODEs · Mathematics 2022-02-15 Oswaldo R. B. de Oliveira

In most contemporary approaches to decision making, a decision problem is described by a sets of states and set of outcomes, and a rich set of acts, which are functions from states to outcomes over which the decision maker (DM) has…

Computer Science and Game Theory · Computer Science 2021-09-07 Lawrence Blume , David Easley , Joseph Y. Halpern

Given a strictly positive measure, we characterize inner semicontinuous solid convex-valued mappings for which continuous functions which are selections almost everywhere are selections. This class contains continuous mappings as well as…

Optimization and Control · Mathematics 2013-08-23 Ari-Pekka Perkkiö

Let $G$ be a discrete group and let $\mathcal A$ and $\mathcal B$ be two subgroups of $G$-valued continuous functions defined on two $0$-dimensional compact spaces $X$ and $Y$. A group isomorphism $H$ defined between $\mathcal A$ and…

General Topology · Mathematics 2014-12-19 María V. Ferrer , Margarita Gary , Salvador Hernández

For ordered normed vector spaces $X, Y$, we consider the space $\mathcal{L}(X,Y)$ of bounded linear operators and characterize when its cone of positive operators has non-empty interior. When this is satisfied, we give a functional…

Functional Analysis · Mathematics 2025-03-10 Onno van Gaans , Jochen Glück , Anke Kalauch

We describe the supports of a class of real-valued maps on $C*(X)$ introduced by Radul. Using this description, a characterization of compact-valued retracts of a given space in terms of functional extenders is obtained. For example, if…

General Topology · Mathematics 2011-05-23 Robert Alkins , Vesko Valov

Any continuous piecewise-linear function $F\colon \mathbb{R}^{n}\to \mathbb{R}$ can be represented as a linear combination of $\max$ functions of at most $n+1$ affine-linear functions. In our previous paper [``Representing piecewise linear…

Discrete Mathematics · Computer Science 2024-06-05 Christoph Koutschan , Anton Ponomarchuk , Josef Schicho

We provide an axiomatic system modeling conditional preference orders which is based on conditional set theory. Conditional numerical representations are introduced, and a conditional version of the theorems of Debreu on the existence of…

Economics · Quantitative Finance 2016-01-19 Samuel Drapeau , Asgar Jamneshan

In this paper, we introduce a study of prolongations of representations of Lie groups. We obtain a faithful (one-to-one) representation of TG where G is a finite-dimensional Lie group and TG is the tangent bundle of G, by using (not…

Differential Geometry · Mathematics 2013-10-09 Hulya Kadioglu , Erdogan Esin

We provide an axiomatic characterization of lexicographic preferences over the set of all random availability functions using two assumptions. The first assumption is strong monotonicity, which in our framework is equivalent to the strong…

Theoretical Economics · Economics 2025-11-03 Somdeb Lahiri

The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…

Logic · Mathematics 2020-05-13 Emil Jeřábek

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…

Logic in Computer Science · Computer Science 2023-06-22 Dirk Pattinson , Mina Mohammadian

We consider a real random variable X represented through a random pair of real random variables (R,T) and a deterministic function u as X=Ru(T). Under some additional assumptions, we prove a limit theorem for (R,T) given X>x, as x tends to…

Probability · Mathematics 2013-11-05 Ph. Barbe , Miriam Isabel Seifert

Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…

Programming Languages · Computer Science 2015-02-05 Mauro Jaskelioff , Russell O'Connor

Let $(X,\tau)$ be a Hausdorff space and $n\in\omega$. We prove that if $X$ admits a continuous selection over $\mathcal{F}_{n}(X)$ (nonempty subsets of $X$ of cardinality at most $n$), then for every $n\leq m\leq 2n$ such that $m$ is not a…

General Topology · Mathematics 2020-04-21 Jorge Antonio Cruz Chapital

We prove that convex functions of finite order on the real line and subharmonic functions of finite order on finite dimensional real space, bounded from above outside of some set of zero relative Lebesgue density, are bounded from above…

Complex Variables · Mathematics 2020-09-04 Bulat N. Khabibullin

Let the metric space $\mathbb R^n \setminus \sim$ be the metric space of $n$-sized unordered tuples of real numbers. In the following, it will be shown that if a function $\varphi: \mathbb R^m \to \mathbb R^n \setminus \sim$ is continuous,…

Metric Geometry · Mathematics 2014-06-24 Adrian Fellhauer

By the sometimes so-called 'Main Theorem' of Recursive Analysis, every computable real function is necessarily continuous. We wonder whether and which kinds of HYPERcomputation allow for the effective evaluation of also discontinuous…

Logic in Computer Science · Computer Science 2010-05-10 Martin Ziegler