Related papers: Fixpoint Theory -- Upside Down
We present a version of Krasnosel'skii fixed point theorem for operators acting on Cartesian products of normed linear spaces, under cone-compression and cone-expansion conditions of norm type. Our approach, based on the fixed point index…
We establish a maximum principle for a two-point function in order to analyze the convexity of level sets of harmonic functions. We show that this can be used to prove a strict convexity result involving the smallest principal curvature of…
There are several extensions of the classical Banach Fixed Point Theorem in technical literature. A branch of generalizations replaces usual contractivity by weaker but still effective assumptions. Our note follows this stream, presenting…
Tarski's theorem states that every monotone function from a complete lattice to itself has a fixed point. We analyze the query complexity of finding such a fixed point on the $k$-dimensional grid of side length $n$ under the $\leq$…
We investigate the continuous non-monotone DR-submodular maximization problem subject to a down-closed convex solvable constraint. Our first contribution is to construct an example to demonstrate that (first-order) stationary points can…
The famous Banach Contraction Principle holds in complete metric spaces, but completeness is not a necessary condition -- there are incomplete metric spaces on which every contraction has a fixed point. The aim of this paper is to present…
The purpose of this paper is to present some multidimensional fixed-point theorems and their applications. For this, we provide a multidimensional fixed point theorem and then using this theorem we prove the existence and uniqueness of a…
The main purpose of this paper is to find the fixed point in such cases where existing literature remain silent. In this paper we introduce partial completeness, a new type of contraction and many other definitions. Using this approach the…
Based on the idea of randomizing the traditional space theory of functional analysis, random functional analysis has been developed as functional analysis over random metric spaces, random normed modules and random locally convex modules.…
This study develops a fixed-time convergent saddle point dynamical system for solving min-max problems under a relaxation of standard convexity-concavity assumption. In particular, it is shown that by leveraging the dynamical systems…
Based on the recently developed theory of random sequential compactness, we prove the random Kakutani fixed point theorem in random normed modules: if G is a random sequentially compact L0-convex subset of a random normed module, then every…
The Lefschetz fixed point theorem follows easily from the identification of the Lefschetz number with the fixed point index. This identification is a consequence of the functoriality of the trace in symmetric monoidal categories. There are…
We adopt an operator-theoretic perspective to analyze a class of nonlinear fixed-point iterations and discrete-time dynamical systems. Specifically, we study the Krasnoselskij iteration - at the heart of countless algorithmic schemes and…
We introduce a new class of asymptotic contractions that employs two quasi-metrics defined directly in terms of the underlying mapping. The contraction condition compares these two quantities via a sequence of bounding functions that…
We propose to use Tarski's least fixpoint theorem as a basis to define recursive functions in the calculus of inductive constructions. This widens the class of functions that can be modeled in type-theory based theorem proving tool to…
It is well-known that in finite strategic games true common belief (or common knowledge) of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies. We…
In the context of abstract coinduction in complete lattices, the notion of compatible function makes it possible to introduce enhancements of the coinduction proof principle. The largest compatible function, called the companion, subsumes…
A sufficient condition is established for the existence of a solution to the equation $\mathcal{T}(u,\mathcal{C}(u))=u$, by considering a class of Kannan type equicontraction mappings $\mathcal{T}:\mathcal{A}\times…
We establish two fixed point theorems for certain mappings of contractive type. The first result is concerned with the case where such mappings take a nonempty, closed subset of a complete metric space $X$ into $X$, and the second with an…
Many trace inequalities can be expressed either as concavity/convexity theorems or as monotonicity theorems. A classic example is the joint convexity of the quantum relative entropy which is equivalent to the Data Processing Inequality. The…