Fixed Points Theorems for Non-Transitive Relations

09/28/2020
by   Jérémy Dubut, et al.
0

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 attractivity, a mild condition implied by either antisymmetry or transitivity. In particular, we generalize various theorems ensuring the existence of a quasi-fixed point of monotone maps over complete relations, and show that the set of (quasi-)fixed points is itself complete. This result generalizes and strengthens theorems of Knaster-Tarski, Bourbaki-Witt, Kleene, Markowsky, Pataraia, Mashburn, Bhatta-George, and Stouti-Maaden.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/17/2018

Fixed point theorems for precomplete numberings

In the context of his theory of numberings, Ershov showed that Kleene's ...
research
03/18/2021

Krasnoselskij-type algorithms for variational inequality problems and fixed point problems in Banach spaces

Existence and uniqueness as well as the iterative approximation of fixed...
research
01/29/2019

Representation theorems for extended contact algebras based on equivalence relations

The aim of this paper is to give new representation theorems for extende...
research
10/04/2018

On (weak) fpc generators

Corrado Böhm once observed that if Y is any fixed point combinator (fpc)...
research
10/01/2021

Substructural fixed-point theorems and the diagonal argument: theme and variations

This article re-examines Lawvere's abstract, category-theoretic proof of...
research
12/30/2017

Inverse Exponential Decay: Stochastic Fixed Point Equation and ARMA Models

We study solutions to the stochastic fixed point equation Xd=AX+B when t...

Please sign up or login with your details

Forgot password? Click here to reset