Bourbaki ’ s Fixpoint Lemma reconsidered
نویسنده
چکیده
A constructively valid counterpart to Bourbaki’s Fixpoint Lemma for chaincomplete partially ordered sets is presented to obtain a condition for one closure system in a complete lattice L to be stable under another closure operator of L. This is then used to deal with coproducts and other aspects of frames.
منابع مشابه
Tychonoff’s theorem as a direct application of Zorn’s lemma
A simple proof of Tychonoff’s theorem (the compactness of the product of compact spaces) as a direct application of Zorn’s lemma is given. In contrast to the classical Cartan-Bourbaki proof which uses Zorn’s lemma twice, our proof uses it only once.
متن کاملReconciliation of Elementary Order and Metric Fixpoint Theorems
We prove two new fixed point theorems for generalized metric spaces and show that various fundamental fixed point principles, including: Banach Contraction Principle, Caristi fixed point theorem for metric spaces, Knaster-Tarski fixed point theorem for complete lattices, and the Bourbaki-Witt fixed point theorem for directed-complete orders, follow as corollaries of our results.
متن کاملA Note on Strong Dinaturality, Initial Algebras and Uniform Parameterized Fixpoint Operators
I show a basic Yoneda-like lemma relating strongly dinatural transformations and initial algebras. Further, I apply it to reprove known results about unique existence of uniform parameterized fixpoint operators.
متن کاملHomomorphisms on Topological Groups from the Perspective of Bourbaki-boundedness
In this note we study some topological properties of bounded sets and Bourbaki-bounded sets. Also we introduce two types of Bourbaki-bounded homomorphisms on topological groups including, n$-$Bourbaki-bounded homomorphisms and$hspace{1mm}$ B$-$Bourbaki-bounded homomorphisms. We compare them to each other and with the class of continuous homomorphisms. So, two topologies are presented on them a...
متن کاملProof Methods for Corecursive Programs
Recursion is a well-known and powerful programming technique, with a wide variety of applications. The dual technique of corecursion is less well-known, but is increasingly proving to be just as useful. This article is a tutorial on the four main methods for proving properties of corecursive programs: fixpoint induction, the approximation (or take) lemma, coinduction, and fusion.
متن کامل