English
Related papers

Related papers: Fixpoint Theory -- Upside Down

200 papers

This paper discusses a general and useful stability principle which, roughly speaking, says that given a uniformly continuous function defined on an arbitrary metric space, if the function is bounded on the constraint set and we slightly…

Optimization and Control · Mathematics 2020-09-04 Daniel Reem , Simeon Reich , Alvaro De Pierro

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…

Functional Analysis · Mathematics 2025-09-10 Babu G. V. R. , Alemayehu Negash , Sandhya M. L. , Meaza Bogale

In this work, we reveal a rich combinatorial structure underlying exact minimax optimal algorithms for classical nonexpansive fixed-point problems. This viewpoint unifies all extremal optimal methods and provides a systematic and practical…

Optimization and Control · Mathematics 2026-05-05 TaeHo Yoon , Benjamin Grimmer

We construct a version of kneading theory for families of monotonous functions on the real line. The generality of the setup covers two classical results from Milnor-Thurston's kneading theory: the first one is to dynamically characterise…

Dynamical Systems · Mathematics 2022-11-17 Ermerson Araujo , Alex Zamudio Espinosa

Kakutani's fixed point theorem is a generalization of Brouwer's fixed point theorem to upper semicontinuous multivalued maps and is used extensively in game theory and other areas of economics. Earlier works have shown that Sperner's lemma…

Dynamical Systems · Mathematics 2018-11-22 Yitzchak Shmalo

This paper provides a canonical construction of a Noetherian least fixed point topology. While such least fixed point are not Noetherian in general, we prove that under a mild assumption, one can use a topological minimal bad sequence…

Logic in Computer Science · Computer Science 2022-10-18 Aliaume Lopez

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

The main purpose of this note is to prove an upper bound on the number of lattice points of a centrally symmetric convex body in terms of the successive minima of the body. This bound improves on former bounds and narrows the gap towards a…

Metric Geometry · Mathematics 2007-05-23 Martin Henk

We establish some new common fixed point theorems of single-valued and multivalued mappings operating between complete ordered locally convex spaces under weaker assumptions. As an application, we prove a new minimax theorem of existence of…

Functional Analysis · Mathematics 2021-09-21 Driss Mentagui , Azennar Radouane

We formalise the self-referential definition of physical laws using monotone operators on a lattice of theories, resolving the pathologies of naive set-theoretic formulations. By invoking Tarski fixed point theorem, we identify physical…

History and Philosophy of Physics · Physics 2026-02-04 Eren Volkan Küçük

We investigate the stability of maximizing measures for a penalty function of a two-dimensional subshift of finite type, building on the work of Gonschorowski et al. \cite{GQS}. In the one-dimensional case, such measures remain stable under…

Dynamical Systems · Mathematics 2025-07-22 Chihiro Oguri , Mao Shinoda

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

A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…

Logic in Computer Science · Computer Science 2008-02-03 Lawrence C. Paulson

We study the convex-concave bilinear saddle-point problem $\min_x \max_y f(x) + y^\top Ax - g(y)$, where both, only one, or none of the functions $f$ and $g$ are strongly convex, and suitable rank conditions on the matrix $A$ hold. The…

Optimization and Control · Mathematics 2025-04-22 Colin Dirren , Mattia Bianchi , Panagiotis D. Grontas , John Lygeros , Florian Dörfler

We introduce a coinductive version of the well-foundedness of N that is used in our proof within minimal logic of the constructive counterpart CLNP to the standard least number principle LNP. According to CLNP, an inhabited complemented…

Logic · Mathematics 2025-07-02 Iosif Petrakis

We isolate a normal-form mechanism underlying Bourbaki--Witt fixed-point arguments and least-upper-bound versions of Zorn-type maximality principles. Given a progressive self-map on a partially ordered set, we define a Bourbaki tower as a…

Logic · Mathematics 2026-05-13 You-Chang Liu

We provide a type theoretic treatment of the paper "On Tarski's fixed point theorem" by Giovanni Curi. There are benefits to having a type theoretic formulation apart from routine implementation in a proof assistant. By taking advantage of…

Logic · Mathematics 2024-02-21 Ian Ray

The key element of the approach to the theory of necessary conditions in optimal control discussed in the paper is reduction of the original constrained problem to unconstrained minimization with subsequent application of a suitable…

Optimization and Control · Mathematics 2019-06-26 A. D. Ioffe

In this paper we consider Kakutani's extension of the Brouwer fixed point theorem within the framework of Bishop's constructive mathematics. Kakutani's fixed point theorem is classically equivalent to Brouwer's fixed point theorem. The…

Logic · Mathematics 2016-11-09 Matthew Hendtlass

Assume that $X$ is a Banach space of measurable functions for which Koml\'os' Theorem holds. We associate to any closed convex bounded subset $C$ of $X$ a coefficient $t(C)$ which attains its minimum value when $C$ is closed for the…

Functional Analysis · Mathematics 2017-09-12 T. Domínguez Benavides , M. A , Japón