English
Related papers

Related papers: A Fixed Point Theorem for Non-Monotonic Functions

200 papers

Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotone function over a complete lattice as the largest post-fixpoint, naturally leads to the so-called coinduction proof principle for showing that some element is below…

Logic in Computer Science · Computer Science 2024-02-14 Paolo Baldan , Richard Eggert , Barbara König , Tommaso Padoan

Recently, a novel fixed point operation has been introduced over certain non-monotonic functions between stratified complete lattices and used to give semantics to logic programs with negation and boolean context-free grammars. We prove…

Logic in Computer Science · Computer Science 2015-12-11 Zoltan Esik

The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursive specifications in Denotational Semantics. In this paper we discuss whether the hypothesis of the aforementioned result can be weakened. An…

Information Theory · Computer Science 2024-01-25 Asier Estevan , Juan-José Minãna , Oscar Valero

We prove a fixed point theorem that combines the contraction mapping principle and some Knaster-Tarski-like theorem. As a consequence we obtain an existence theorem to initial value problem for ordinary differential equation with…

Classical Analysis and ODEs · Mathematics 2023-01-18 Oleg Zubelevich

The Knaster-Tarski theorem, also known as Tarski's theorem, guarantees that every monotone function defined on a complete lattice has a fixed point. We analyze the query complexity of finding such a fixed point on the $k$-dimensional grid…

Computational Complexity · Computer Science 2025-07-16 Simina Brânzei , Reed Phillips , Nicholas Recker

We study weak and strong solutions of nonlinear non-compact operator equations in abstract spaces of adapted random points. The main result of the paper is similar to Schauder's fixed-point theorem for compact operators. The illustrative…

Probability · Mathematics 2022-08-02 Arcady Ponosov

We present new criteria on the existence of fixed points that combine some monotonicity assumptions with the classical fixed point index theory. As an illustrative application, we use our theoretical results to prove the existence of…

Classical Analysis and ODEs · Mathematics 2014-12-12 Alberto Cabada , José Ángel Cid , Gennaro Infante

We establish a fixed point theorem for mappings of square matrices of all sizes which respect the matrix sizes and direct sums of matrices. The conclusions are stronger if such a mapping also respects matrix similarities, i.e., is a…

Functional Analysis · Mathematics 2012-10-22 Gulnara Abduvalieva , Dmitry S. Kaliuzhnyi-Verbovetskyi

This note points out a lemma on closures of monotonic increasing functions and shows how it is applicable to decomposition and modularity for semantics defined as the least fixedpoint of some monotonic function. In particular it applies to…

Logic in Computer Science · Computer Science 2020-08-04 Michael J. Maher

In this paper, we develop an Isabelle/HOL library of order-theoretic fixed-point theorems. We keep our formalization as general as possible: we reprove several well-known results about complete orders, often with only antisymmetry or…

Logic in Computer Science · Computer Science 2023-06-22 Jérémy Dubut , Akihisa Yamada

We introduce and study a new class of nonlinear monotone operators acting in normal cones of real Banach spaces and possessing the property of strong concavity. We establish new constructive principles for the existence of nonzero fixed…

Functional Analysis · Mathematics 2026-04-27 Khachatur A. Khachatryan

We introduce a new fixed point theorem of Krasnoselskii type for discontinuous operators. As an application we use it to study the existence of positive solutions of a second-order differential problem with separated boundary conditions and…

Classical Analysis and ODEs · Mathematics 2017-03-14 Rubén Figueroa , Rodrigo López Pouso , Jorge Rodríguez-López

The design of fixed point algorithms is at the heart of monotone operator theory, convex analysis, and of many modern optimization problems arising in machine learning and control. This tutorial reviews recent advances in understanding the…

Optimization and Control · Mathematics 2022-07-19 Francesco Bullo , Pedro Cisneros-Velarde , Alexander Davydov , Saber Jafarpour

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$…

Computational Complexity · Computer Science 2025-07-15 Simina Brânzei , Reed Phillips , Nicholas Recker

In this paper, we prove common fixed point results for a self-mappings satisfying an implicit function which is general enough to cover a multitude of known as well as unknown contractions. Our results modify, unify, extend and generalize…

Functional Analysis · Mathematics 2017-01-03 Mohammad Imdad , Rqeeb Gubran , Md Ahmadullah

We prove a fixpoint theorem for contractions on Cauchy-complete quantale-enriched categories. It holds for any quantale whose underlying lattice is continuous, and applies to contractions whose control function is sequentially…

Category Theory · Mathematics 2022-11-04 Arij Benkhadra , Isar Stubbe

By iterative techniques,we present two fixed point theorems, whose modular formulations are relatively close to the Banach's fixed point theorem in the normed spaces.The first result concerns the fixed point of the strongly contraction…

Functional Analysis · Mathematics 2016-09-07 Hanebaly Elaidi

In this paper we study the existence and uniqueness of fixed points of a class of mappings defined on complete, (sequentially compact) cone metric spaces, without continuity conditions and depending on another function.

Functional Analysis · Mathematics 2009-06-12 José R. Morales , Edixon Rojas

Tarski's theorem states that every monotone function from a complete lattice to itself has a fixed point. We specifically consider the two-dimensional lattice $\mathcal{L}^2_n$ on points $\{1, \ldots, n\}^2$ and where $(x_1, y_1) \leq (x_2,…

Computational Complexity · Computer Science 2026-04-10 Reed Phillips

We consider constrained Horn clause solving from the more general point of view of solving formula equations. Constrained Horn clauses correspond to the subclass of Horn formula equations. We state and prove a fixed-point theorem for Horn…

Logic in Computer Science · Computer Science 2021-09-13 Stefan Hetzl , Johannes Kloibhofer
‹ Prev 1 2 3 10 Next ›