Fixed point characterization of completeness on lattices for relatively isotone mappings
In this paper, we consider self-mappings defined on a metric space endowed with a finite number of graphs. Under certain conditions imposed on the graphs, we establish a new fixed point theorem for such mappings. The obtained result extends, generalizes and improves many existing contributions in the literature including standard fixed point theorems, fixed point theorems on a metric space endowed with a partial order and fixed point theorems for cyclic mappings.
The existence of fixed points for monotone maps on the fuzzy ordered sets under suitable conditions is proved.
Under suitable conditions we prove the existence of fixed points of fuzzy monotone multifunctions.
We prove the existence of a fixed point of non-expanding fuzzy multifunctions in -fuzzy preordered sets. Furthermore, we establish the existence of least and minimal fixed points of non-expanding fuzzy multifunctions in -fuzzy ordered sets.
Given a locale and a join semilattice with bottom element , a new concept called -slice is defined,where is as an action of the locale on the join semilattice . The -slice adopts topological properties of the locale through the action . It is shown that for each , is an interior operator on .The collection is a Priestly space and a subslice of -. If the locale is spatial we establish an isomorphism between the -slices and . We have shown that the fixed set of ,...
A lattice is said to satisfy (the lattice theoretic version of) Frankl’s conjecture if there is a join-irreducible element such that at most half of the elements of satisfy . Frankl’s conjecture, also called as union-closed sets conjecture, is well-known in combinatorics, and it is equivalent to the statement that every finite lattice satisfies Frankl’s conjecture. Let denote the number of nonzero join-irreducible elements of . It is well-known that consists of at most elements....