Next Article in Journal
Kropina Metrics with Isotropic Scalar Curvature
Previous Article in Journal
A Fractional Analysis of Zakharov–Kuznetsov Equations with the Liouville–Caputo Operator
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Discrete Presheaf Monads

1
School of Mathematical Science, Nanjing Normal University, Nanjing 210046, China
2
School of Intelligence Science and Technology, Nanjing University, Nanjing 210023, China
*
Author to whom correspondence should be addressed.
Axioms 2023, 12(6), 610; https://doi.org/10.3390/axioms12060610
Submission received: 5 May 2023 / Revised: 6 June 2023 / Accepted: 11 June 2023 / Published: 20 June 2023

Abstract

:
For a quantale I , which is a unit interval endowed with a continuous triangular norm and the Barr extension β ¯ I of the ultrafilter monad to I - Rel , a characterization of the discrete presheaf monad associated to β ¯ I is given. It is also proved that, when & is the Łucasiewicz triangular norm, the discrete presheaf monad is isomorphic to the saturated prefilter monad, and when & is the product triangular norm, the prime functional ideal monad is isomorphic to a submonad of the discrete presheaf monad.

1. Introduction and Preliminaries

The lax-algebraic method is efficient in axiomatizing various types of spaces in terms of convergency, such as Barr’s relational presentation of topological spaces [1] and Lawvere’s characterization of generalized metric spaces as categories enriched over the Lawvere quantale P + = ( [ 0 , ] op , + , 0 ) [2]. In addition, Clementino and Hofmann [3] extended the ultrafilter monad to the category P + - Rel and obtained a lax-algebraic characterization of Lowen’s approach spaces [4]. More examples can be found in [5,6,7,8,9].
Given an associated lax extension T ^ of monad ( T , m , e ) to the category V - Rel of relations valued in a quantale V , a new monad ( Π , n , d ) named a discrete presheaf monad associated to T ^ arises. We have the following isomorphism:
( Ω , 2 ) - Cat Π - Mon ( T , V ) - Cat ,
where ( T , V ) - Cat is the category of lax algebras for T ^ , Π - Mon is the category of Kleisli monoids of the discrete presheaf monad and ( Π , 2 ) - Cat is the category of lax algebras for the Kleisli extension of ( Ω , n , d ) .
The above isomorphism provides different characterizations of the same object. When ( T , m , e ) is the ultrafilter monad and V = 2 , the discrete presheaf monad is isomorphic to the filter monad. Thus, the above isomorphism implies that topological spaces are the lax algebras for the filter monad [10], the Kleisli monoids of the filter monad [11] and the lax algebras for the ultrafilter monad; that is, we can characterize a topological space using the filter convergence, the neighborhood system and the ultrafilter convergence.
Furthermore, the discrete presheaf monad ( Ω , n , d ) is V-power-enriched [12]; hence, it satisfies that (i) the RegMono-injective separated Kleisli monoids are exactly the Eilenberg–Moore algebras for ( Ω , n , d ) ; (ii) there is a derived monad on the category V - Cat that has the same Eilenberg–Moore algebras with the original monad ( Ω , n , d ) . These two facts will be helpful in studying injective objects. For example, when the discrete presheaf monad is the filter monad, the derived monad on 2 - Cat = Ord is the composite monad of the ordered-filter monad and down-set monad on Ord ; thus, its Elenberg–Moore algebras are complete and continuous posets (continuous lattices). Therefore, by (i), we come to Scott’s result [13]: the injective T 0 spaces are continuous lattices endowed with their Scott topology.
The paper aims to study the discrete presheaf monad associated to the Barr extensions of the ultrafilter monad to I - Rel , where I is the unit interval endowed with a continuous triangular norm. When the continuous t-norm is a product t-norm, there is a characterization of the discrete presheaf monad, which is presented in [14] (Subsection IV.3.3). We present a similar characterization in this paper for a general continuous triangular norm. As for the Eilenberg–Moore algebras for these monads, it is clear only when the continuous t-norm is the Łukasiewicz triangular norm.
Some preparations about continuous triangular norms, monads and lax extensions are given in the remainder of this section. In Section 2, we extend the ultrafilter monad to the category I - Rel of I -relations, and we prove that these extensions are associated. For a general continuous triangular norm, a characterization of the discrete presheaf monad is presented in Section 2 too. Section 3 focuses on the case where the continuous triangular norm is Archimedean. It is proved that, when the continuous triangular norm is the Łucasiewicz triangular norm, the discrete presheaf monad is isomorphic to the saturated prefilter monad [15]; when the continuous triangular norm is the product triangular norm, the prime functional ideal monad [16,17] is isomorphic to a submonad of the discrete presheaf monad.

1.1. Continuous Triangular Norms and I - Rel

A triangular norm (t-norm for short) is a binary operation & on the unit interval I such that ( I , & , 1 ) is a commutative monoid and a & ( ) is monotone for all a I .
A t-norm & is said to be continuous if the function ( ) & ( ) : I × I I is continuous with respect to the standard topology. Given a continuous t-norm & , for every a I , since a & ( ) : I I preserves arbitrary joints, it admits a right adjoint a ( ) : I I that is determined by
a & b c b a c
for all b , c I . The map → is called the implication of & .
The following proposition is easy to check.
Proposition 1.
Let & be a continuous t-norm. Then, for any a , b , c I and { a i } i I , we have that
(1)
a b = 1 a b ;
(2)
( a & b ) c = a ( b c ) ;
(3)
a ( i a i ) = i ( a a i ) ;
(4)
( i a i ) a = i ( a i a ) .
Example 1.
There are three basic continuous t-norms.
1. 
The Łukasiewicz t-norm a & L b = max { a + b 1 , 0 } . Its implication is given by a b = min { 1 a + b , 1 } .
2. 
The product t-norm a & P b = a b . Its implication is given by a b = min { 1 , b a } .
3. 
The Gödel t-norm a & b = a b . Its implication is given by
a b = 1 , a b , b , a > b .
Since & is associated, we can denote by a n the
a & & a n .
An element a I is called idempotent if a 2 = a .
The Łukasiewicz t-norm and the product t-norm are Archimedean, which means that, for any a , b ( 0 , 1 ) , there is an n N such that a n < b . Moreover, the Łukasiewicz t-norm is nilpotent, which means that, for any a ( 0 , 1 ) , there is an n N such that a n = 0 .
Similarly, we can define a t-norm & on any closed interval [ a , b ] . Two t-norms ( [ a , b ] , & , b ) and ( [ a , b ] , & , b ) are said to be isomorphic if there exists an order isomorphism f : [ a , b ] [ a , b ] such that c & d = f ( c ) & f ( d ) holds for all c , d [ a , b ] .
Example 2.
The Lawvere quantale P + = ( [ 0 , ] op , + , 0 ) is isomorphic to the product t-norm ( I , & , 1 ) by
f : [ 0 , ] [ 0 , 1 ] , x e x .
Assumption 1.
From now on, we always give a t-norm by a triple ( [ a , b ] , & , b ) and assume that it is continuous. In particular, I denotes the unit interval endowed with a continuous t-norm ( I , & , 1 ) .
A continuous t-norm is Archimedean if and only if it is isomorphic either to the Łucasiewicz t-norm or to the product t-norm [18]. The following celebrated ordinal sum decomposition theorem gives a characterization of continuous t-norms.
Theorem 1
([18,19]). Let ( I , & , 1 ) be a continuous t-norm. Then, there exists a family of disjoint ( a n , b n ) I such that:
(1)
For any n , a n , b n are idempotent and ( [ a n , b n ] , & , b n ) is isomorphic to the unit interval endowed with a continuous Archimedean t-norm;
(2)
a & b = a b for any ( x , y ) n [ a n , b n ] 2 .
If a ( 0 , 1 ) lies in some above-mentioned ( a n , b n ) , we let a denote a n and a + denote b n .
An I -relation r : X Y is a map r : X × Y I . Given two I -relations r : X Y , s : Y Z , the composition s · r : X Z is given by
( s · r ) ( x , z ) = y Y r ( x , y ) & s ( y , z ) .
Sets and I -relations form a category
I - Rel .
Let f : X Y be a map. Then, there exist two I -relations f : X Y , f : Y X given by
f ( x , y ) = 1 , x = y , 0 , x y and f ( x , y ) = f ( y , x ) .
Usually, we simply write f as f .

1.2. Monads and Their Lax Extensions

1.2.1. Monad

A monad on a category A is a triple ( T , m , e ) consisting of an endfunctor T : A A and two natural transformations: the unit e :   id A T and the multiplication m : T 2 T , making the diagrams Axioms 12 00610 i001 commutative.
An adjunction F G : B A gives rise to a monad ( G F , G ϵ F , η ) on A , where η and ϵ are the unit and the counit, respectively. Many of the monads discussed in this paper are determined by adjunctions constructed as follows:
Proposition 2.
Let A be a locally small category and A be the object of A . The functor A ( , A ) : A op Set is right adjoint if and only if the product x X A x in A with A x = A for all x X exists for every set X .
Proof. 
Let B be an object in A . A map f : X A ( B , A ) is equivalent to a source ( B , f ( x ) : B A x ) with A x = A for all x X . In addition, f is universal from X to A ( , A ) ; that is, for any object C in A and map g : X A ( C , A ) , there is a morphism g : C B such that g = A ( , A ) ( g ) · f if and only if the source ( B , f ( x ) ) is universal. That means that B is the product of { A x } x X in which A x = A for all x X .
Since A ( , A ) is right adjoint if and only if, for each set X, there exist an object F 0 X in A and a universal map η X : X A ( F 0 X , A ) from X to A ( , A ) , the conclusion follows. In this case, the assignment X x X A x is functorial and left adjoint to A ( , A ) .     □
Example 3.
(1) 
Let 2 be the set { 0 , 1 } . Then, the functor Set ( , 2 ) : Set op Set , known as the contravariant powerset functor, is right adjoint, and the induced monad is called the double-powerset monad.
(2) 
Let 2 be the lattice ( { 0 , 1 } , ) , in which 0 1 . The functor Lat ( , 2 ) : Lat op Set is right adjoint, where Lat is the category lattices and lattice morphisms. For each set X , the product x X 2 x is exactly the power set P X endowed with the inclusion order. This adjunction induces the ultrafilter monad ( β , Σ , ( ) ˙ ) . We spell it out here: the functor β defined on objects by β X = { U U i s a n u l t r a f i l t e r o n X } on morphisms by β ( f ) : U { A Y f 1 ( A ) U } . The two natural transformations are given by:
( ) ˙ X : X β X , x { A X x A } ; Σ X : β 2 X β X , U { A X A β U } ,
where A β = { U β X A U } .
A morphism (isomorphism) κ : ( T , m , e ) ( T , m , e ) of monads is a natural transformation (isomorphism) κ : T T such that
m = m · ( κ κ ) and e = κ · e ,
where ∗ is the horizontal composition of natural transformations.
Let ( T , m , e ) be a monad on Set . If T is a subfunctor of T and the inclusion transformation i : T T satisfies that, for any x X , Φ T T X ,
e X ( x ) T X and ( m · ( i i ) ) X ( Φ ) T X ,
then ( T , m · ( i i ) , e ) is called a submonad of ( T , m , e ) . Usually, we simply write m for m · ( i i ) .

1.2.2. Lax Extension

A lax extension of a functor T : Set Set to I - Rel is an assignment T ^ : Set Set and a family of maps T ^ X , Y : I - Rel ( X , Y ) I - Rel ( X , Y ) ( X , Y run through all the sets, and we usually simply write T ^ X , Y as T ^ ) such that
(1)
T ^ X = X ;
(2)
T ^ ( r ) T ^ ( r ) and T ^ ( s · r ) T ^ ( s ) · T ^ ( r ) ;
(3)
T f T ^ ( f ) and ( T f ) T ^ ( f ) .
for any I -relations r r : X Y , s : Y Z and map f : X Y .
A lax extension of a monad ( T , m , e ) on Set to I - Rel is a triple ( T ^ , m , e ) such that T ^ is a lax extension of T and e , m are op-lax; that is,
(4)
m Y · T ^ T ^ r T ^ r · m X ;
(5)
e Y · r T ^ r · e X .
for any I -relations r : X Y .
A ( T , I ) -relation r : X Y is an I -relation r : T X Y . The Kleisli convolution of ( T , I ) -relations r : X Y , s : Y Z is a ( T , I ) -relation s r : X Z given by
s r = s · ( T ^ r ) · m X .
In general, sets with ( T , I ) -relations (composed with the Kleisli convolution) do not form a category. There are two problems: (i) in general, the Kleisli convolution is not associated; (ii) in general, the Kleisli convolution does not allow for identity morphisms.
For (ii), we take a subclass of ( T , I ) -relations: a ( T , I ) -relation r : X Y is unitary if it satisfies that
e Y r = r and r e X = r .
For every unitary ( T , I ) -relation r : X Y , the unitary ( T , I ) -relations 1 X = e X e X are identities of the Kleisli convolution; that is,
r 1 X = r and 1 Y r = r ;
see [14] (Subsection III.1.8) for more detail.
A lax extension is said to be associated if the Kleisli convolution of unitary ( T , I ) -relations is associated. In this case, we obtain a category
( T , I ) - URel .

2. The Barr Extension to I - Rel and Induced Monad

We consider the strata extensions of the Barr extension β ¯ along Rel I - Rel :
β ¯ I r : β X β Y , β ¯ I r ( F , G ) = { a F ( β ¯ r a ) G }
for any F β X , G β Y and r : X Y , where r a = { ( x , y ) r ( x , y ) a } and β ¯ is the Barr extension of the ultrafilter monad to Rel ; that is,
F ( β ¯ r a ) G A F , G r a ( A ) = { y Y x A , r ( x , y ) a } .
When r is dummy in one variable—that is X = { } or Y = { } —we simply write r ( x ) for r ( x , ) or r ( , x ) . In this case, it is easy to check that ([20] (1.1.5 Lemma))
β ¯ I r ( U ) = A U x A r ( x ) = A U x A r ( x ) .
Proposition 3.
For each relation μ , ν : { } X and a [ 0 , 1 ] , we have that
(1)
β ¯ I ( μ ν ) = β ¯ I ( μ ) β ¯ ( ν ) ;
(2)
β ¯ I ( a & μ ) = a & β ¯ I ( μ ) ;
(3)
β ¯ I ( μ ν ) = β ¯ I ( μ ) β ¯ I ( ν ) .
Proof. 
For (1), we have that
A U x A ( μ ν ) ( x ) = A U ( x A μ ( x ) ) ( x A ν ( x ) ) = β ¯ I ( μ ) β ¯ I ( ν ) ( U is a filter ) .
(2) results directly from the continuity of & . The proof of (3) is similar to that of (1).    □
Since the unit interval is a completely distributive lattice, the strata extensions β ¯ I are lax extensions of an ultrafilter monad to I - Rel [14] (IV.2.4.3 Propostion). We call these lax extensions Barr extensions to I - Rel and use the same notation β ¯ to denote them if no confusion would arise. These lax extensions also appeared in [6,8].
Next, we prove that the Barr extensions of the ultrafilter monad to I - Rel are associated. The proof for the case that ( I , & , 1 ) is the product t-norm is given in [14] (III.2.4.3 Proposition) and relies on the fact that the unit interval is completely distributive and the product t-norm is continuous. Thus, the proof also works well here with a slight modification.
Proposition 4.
The Barr extensions of an ultrafilter monad to I - Rel are associated.
Proof. 
Thanks to [14] (III.1.9.4 Proposition), it suffices to show that β ¯ preserves the composition of I-relations and that m : β ¯ β ¯ β ¯ is natural.
Let r : X Y , s : Y Z be I -relations, F be an ultrafilter on X and H be an ultrafilter on Z. For any a < a < ( β ¯ s · β ¯ r ) ( F , H ) , there exists some G 0 β Y such that a < a β ¯ s ( G 0 , H ) & β ¯ r ( F , G 0 ) . Since & is continuous, we can pick b , c such that G 0 ( β ¯ s b ) H , F ( β ¯ r c ) G 0 and b & c = a . For any A F , since s b ( r c ( A ) ) H and s b ( r c ( A ) ) ( s · r ) a ( A ) , we have that F β ¯ ( s · r ) a H . Thus, β ¯ ( s · r ) ( F , H ) a .
Since m is op-lax, we only need to show that β ¯ β ¯ r m Y · β ¯ r · m X . Let F β β X , G β β Y . Note that the Barr extension of an ultrafilter monad to Rel is associated. For any a < β ¯ r ( m X ( F ) , m Y ( G ) ) , we have that
m X ( F ) ( β ¯ r a ) m Y ( G ) F ( β ¯ β ¯ r a ) G F ( β ¯ ( β ¯ r ) a ) G F ( β ¯ β ¯ r ) a G ,
so β ¯ β ¯ r ( F , G ) a .     □
Since the Barr extensions of the ultrafilter monad to I - Rel are associated, there is a functor ( β , I ) - URel ( , { } ) : ( β , I ) - URel op Set . For each set X , the product x X { } x is given by
x X { } x = X , p x = ( c x ) = c x · e X : X { } x ,
where c x is the map from { } to X that maps * to x X . Thus, the left adjoint of ( β , I ) - URel ( , ) is identical on objects and maps every map f : X Y to the unitary ( β ¯ , I ) -relation f = f · e Y . We denote it by ( ) . The monad determined by this adjunction is referred to as the discrete presheaf monad associated to β ¯ . It is denoted as ( Π , n , d ) .
In order to characterize the discrete presheaf monad associated to β ¯ , we introduce some notions first. An I -category [21,22] ( X , r ) is a set X with an I -relation r : X X that satisfies
r ( x , x ) = 1 and r ( x , y ) & r ( y , z ) r ( x , z )
for any x , y , z X . For convenience, we denote by X ( , ) the I -relation r if no confusion would arise. The underlying order ≤ of X is defined by
x y X ( x , y ) = 1 .
Let X be an I -category. The tensor [21,22] x X a of x X and a I is an element of X such that, for any y X , it holds that
X ( x X a , y ) = a X ( x , y ) .
The subscript X of X is omitted if there is no danger of ambiguity. An I -category X is called tensored if, for any x X and a I , the tensor x a exists.
An I -category is a tensored I -category whose underlying order has all finite joins. An I -functor is a map between I -categories that preserves tensors and all finite joins. Since the composition of I -functors is again an I -functor, we obtain a category whose objects are I -categories and morphisms are I -functors and denote it by
I - Cat .
Example 4.
Let d L ( x , y ) = x y . Then, ( I , d L ) is an I -category tensored by x a = a & x for any a , x I . Given a set X , the product x X ( I , d L ) x in I - Cat is ( I X , sub X ) , where
sub X : I X I X , ( μ , ν ) x X μ ( x ) ν ( x ) .
The tensor of ( I X , sub X ) is given by
μ a = a & μ
for any a I , μ I X , and its underlying order is pointwise order, and hence is complete.
By the above example, the functor I - Cat ( , ( I , d L ) ) : I - Cat op Set is left adjoint. The right adjoint ( P I ) op : Set I - Cat op is given by
( P I ) op ( X ) = ( X , sub X ) , ( P I ) op ( f ) ( μ ) = μ · f
for any map f : X Y and μ I Y . We denote the induced monad by ( F , m , e ) and explicitly state its form here:
( e ) X ( x ) : I X I , μ μ ( x ) ; ( m ) X ( Φ ) : I X I , μ Φ ( μ ˜ )
for any x X and Φ ( F ) 2 X , where I F X μ ˜ : ϕ ϕ ( μ ) .
For the rest of this section, we prove that the discrete presheaf monad is isomorphic to ( F , m , e ) . At first, we show that each element of F X is determined by its effect on { 1 A A X } , where
1 A ( t ) = 1 , t A , 0 , t A .
This conclusion is proved in [14] (IV.3.3.1 Theorem) for the Lawvere quantale P + and hence for the product t-norm. Our strategy is that we prove the result for the Archimedean case first, and then, with the help of the ordinal sum decomposition theorem, we prove the result for general cases.
An element μ of I X is called bounded if μ > 0 .
Lemma 1.
Let ϕ : ( I X , sub X ) ( I , d L ) be an I -functor. Then, ϕ is determined by its effect on bounded elements.
Proof. 
If ϕ ( 1 X ) = 0 , we are finished. If ϕ ( 1 X ) > 0 , then, by the continuity of &,
ϕ ( μ ) = a > 0 ϕ ( μ ) a = b > 0 ϕ ( μ ) ( b & ϕ ( 1 X ) ) = b > 0 ϕ ( μ b X )
for any μ .     □
Lemma 2.
Let ϕ : ( I X , sub X ) ( I , d L ) be an I -functor. If ( I , & , 1 ) is Archimedean, then ϕ is fully determined by its effect on { 1 A A X } .
Proof. 
Case 1. ( I , & , 1 ) is isomorphic to the Łukasiewicz t-norm.
Let a n = 1 1 n , n N and μ I X . Fix n. Since ( I , & , 1 ) is the Łukasiewicz t-norm, there exists an M n N such that ( a n ) M n 1 > ( a n ) M n = 0 . Let
b n = i = 1 M n ( a n ) i & ϕ ( 1 A i ) and c n = i = 1 M n ( a n ) i 1 & ϕ ( 1 A i ) ,
where A 1 = { x a n μ ( x ) 1 } and A i = { x ( a n ) i μ ( x ) < ( a n ) i 1 } for i = 2 , 3 , , M n . Since ϕ preserves the tensors and all finite joins, it holds that
b n = i = 1 M n ( a n ) i & ϕ ( 1 A i ) ϕ ( μ ) i = 1 M n ( a n ) i 1 & ϕ ( 1 A i ) = c n .
Since ( I , & , 1 ) is the Łukasiewicz t-norm,
c n b n = ( i = 1 M n ( a n ) i 1 & ϕ ( 1 A i ) ) ( a n & i = 1 M n ( a n ) i 1 & ϕ ( 1 A i ) ) 1 a n
for any n N . Note that, for any n N , it holds that (i) b n , c n are determined by { ϕ ( 1 A ) A X } ; (ii) ϕ ( μ ) [ b n , c n ] . This completes the proof.
Case 2.  ( I , & , 1 ) is isomorphic to the product t-norm. The proof for the product t-norm case is in [14] (IV.3.3.1 Theorem). We sketch the proof here as follows: Step 1. use Lemma 1 to assume that μ is bounded; Step 2. since ( I , & , 1 ) is the product t-norm, there is an M n such that a n M n < μ . Then, the proof is similar to Case 1.    □
From the proof, we can see that, if the range of μ falls within some [ a , b ] for which ( [ a , b ] , & , b ) is a continuous Archimedean t-norm, then ϕ ( μ ) can be determined by μ and { ϕ ( 1 A ) A X } .
In order to prove the above conclusion for a general continuous t-norm, we introduce some notations and prove an easy lemma.
Let ϕ be an I -functor and μ an element of I X . For convenience, we denote by a the infimum of μ and by b the supremum of μ . For each t [ a , b ] , let A t = { x ϕ ( x ) > t } and
μ t ( x ) = μ ( x ) , x A t 0 , x A t .
It is easy to check that
μ = ( t μ ) μ t and t & 1 A t μ t b & 1 A t
for all t [ a , b ] . The following function α is determined by μ and { ϕ ( 1 A ) A X } :
α : [ a , b ] [ 0 , 1 ] , x ϕ ( 1 A x ) .
Lemma 3.
The function α satisfies the following statements:
(1)
α is decreasing and α ( b ) = 0 ;
(2)
For each idempotent t ( a , b ) , if α ( t ) t , then ϕ ( μ ) = ϕ ( t μ ) and ϕ ( μ ) t ;
(3)
For each idempotent t ( a , b ) , if α ( t ) < t , then ϕ ( μ ) = ϕ ( t μ ) and ϕ ( μ ) t .
Proof. 
Note that ϕ preserves the empty joint, (1) is trivial.
To see (2), since t = t α ( t ) ϕ ( μ t ) , we have that ϕ ( μ ) = ϕ ( t μ ) ϕ ( μ t ) = ϕ ( μ t ) . Then, we conclude that
ϕ ( t μ ) = ϕ ( t μ t ) = ( t ϕ ( 1 X ) ) ϕ ( μ t ) = t ϕ ( μ t ) = ϕ ( μ ) .
To see (3), since t α ( t ) = α ( t ) ϕ ( μ t ) α ( t ) , it holds that ϕ ( μ t ) = α ( t ) ( t ϕ ( μ ) ) = ϕ ( t μ ) . Hence, we have that ϕ ( μ ) = ϕ ( t μ ) ϕ ( μ t ) = ϕ ( t μ ) .     □
Now, we can prove the following proposition.
Proposition 5.
Let ϕ : ( X , sub X ) ( I , d L ) be an I -functor. Then, it is fully determined by its effect on { 1 A A X } .
Proof. 
Given an μ I X , we adopt the notation of Lemma 3 and let B = { x μ ( x ) = a } .
Case 1. a is not idempotent and α ( a ) a .
Since α ( a + ) < a + , by Lemma 3, we have that ϕ ( μ ) = ϕ ( a + μ ) . Then, as the range of a + ν is contained within [ a , a + ] , we can apply Lemma 2 to reach the desired conclusion.
Case 2. a is idempotent and α ( a ) a .
In this case, we have that α ( a ) = a α ( a ) ϕ ( μ a ) α ( a ) and μ = ( a 1 B ) μ a . Hence, the conclusion follows from
ϕ ( μ ) = ( a ϕ ( 1 B ) ) ϕ ( μ a ) = ( a ϕ ( 1 B ) ) α ( a ) .
Case 3.  α ( a ) > a .
As α ( a ) > a , α ( b ) = 0 < b and α is decreasing, one can find some c ( a , b ) such that
a t < c α ( t ) > t and b t > c α ( t ) < t .
By the ordinal sum decomposition theorem, we distinguish four subcases.
Subcase 1. α ( c ) c and there exists some d > c such that the elements of [ c , d ] are idempotent. In this case, ϕ ( μ ) = c .
By Lemma 3, we have that
ϕ ( μ ) c < t < d t = c and ϕ ( μ ) c .
Subcase 2. α ( c ) < c and there exists some d < c such that the elements of [ d , c ] are idempotent. In this case, ϕ ( μ ) = c .
By Lemma 3, we have that
ϕ ( μ ) d < t < c t = c and ϕ ( μ ) c .
Subcase 3. α ( c ) c and there exists some d > c such that the elements of ( c , d ] are non-idempotent.
In this case, we have that α ( d ) d and α ( d + ) < d + . Thus, one can use Lemma 3 twice to obtain that
ϕ ( μ ) = ϕ ( ( μ d + ) d ) .
It follows from Lemma 2 that ϕ ( ( μ d + ) d ) is determined by { ϕ ( 1 A ) A X } .
Subcase 4. α ( c ) < c and there exists some d < c such that the elements of [ d , c ) are non-idempotent.
The proof is similar to that of Subcase 3.    □
The unitariness of a ( β , I ) -relation r : { } X is trivial; thus, there is a bijection between ( β , I ) - URel ( { } , X ) and I X .
By endowing ( β , I ) - URel ( { } , X ) with the I -relation sub X , by Proposition 3, every unitary ( β ¯ , I ) -relation r : X Y gives an I -functor
r ( ) : ( β , I ) - URel ( { } , X ) ( β , I ) - URel ( { } , Y ) .
Thus, the functor K = ( β , I ) - URel ( { } , ) : ( β , I ) - URel Set can be lifted to
K : ( β , I ) - URel I - Cat .
For every map f : X Y , the I -functor K op ( f ) maps the unitary ( β ¯ , I ) -relation u : 1 Y to
f μ = f · e Y · β ¯ μ = ( P I ) op ( f ) ( μ ) .
Thus, we have the following commutative diagram:
Axioms 12 00610 i002
In addition, K op induces a monad morphism δ : Π F given by
δ X : ( β , I ) - URel ( X , { } ) I - Cat ( ( P I ) op ( X ) , ( I , d L ) ) : r r ( ) .
For every I -functor ϕ , let
r ϕ : X { } , ( U , ) A U ϕ ( 1 A ) .
Since, for every U β 2 X and A Σ ( U ) , it holds that
β ¯ ( r ϕ ) ( U ) = a U U a r ϕ ( U ) a U U ( a A β ) r ϕ ( U ) ϕ ( 1 A ) ,
r ϕ is unitary.
Theorem 2.
The monads ( F , m , e ) are isomorphic to the discrete presheaf monads associated to β ¯ .
Proof. 
It suffices to show that ϕ = r ϕ ( ) and r = r r ( ) hold for any I -functor ϕ and unitary ( β , I ) -relation r : X { } .
To see ϕ = r ϕ ( ) , by Proposition 5, we only need to prove that ϕ coincides with r ϕ ( ) on { 1 A A X } . Given an A 0 X , we have that
r ϕ 1 A 0 = U β X ( A U ϕ ( 1 A ) ) & β ¯ ( 1 A 0 ) ( U ) U A 0 β A U ϕ ( 1 A ) ϕ ( 1 A 0 ) .
If ϕ ( 1 A 0 ) = 0 , we are done. If ϕ ( 1 A 0 ) > 0 , the set { A ϕ ( 1 A ) < ϕ ( 1 A 0 ) } is directed because ϕ preserves finite joins; hence, there exists an ultrafilter U 0 that extends { A 0 } and excludes { A ϕ ( 1 A ) < ϕ ( 1 A 0 ) } . Thus,
r ϕ 1 A 0 A U 0 ϕ ( 1 A ) = ϕ ( 1 A 0 ) .
For r = r r ( ) , given an ultrafilter U 0 on X, it holds that
r r ( ) ( U 0 ) = A U 0 U β X β ¯ ( 1 A ) ( U ) & r ( U ) = A U 0 U A β r ( U ) r ( U 0 ) .
For the other direction, let a < A U 0 U A β r ( U ) ; then, the set
{ A β { U β X r ( U ) > a } A U 0 }
is a filter base. By the axiom of choice, there exists an ultrafilter U on β X that extends the aforementioned filter base. It is easy to check that Σ ( U ) = U 0 and there exists some a 0 U such that a 0 { U β X r ( U ) a } = . By the unitariness of r, we have that
r ( U 0 ) β ¯ r ( U ) = a U U a r ( U ) U a 0 r ( U ) > a .
Example 5.
A ( β , I ) -algebra is a pair ( X , c ) consisting of a set X and a ( β , I ) -relation c : X X satisfying
c ( x ˙ , x ) = 1 and β ¯ ( c ) ( U , U ) & c ( U , x ) c ( Σ ( U ) , x )
for any U β 2 X , U β X and x X . These objects were investigated in [8] under the name of I -valued topological spaces.
An element ϕ of F X is a map ϕ : ( I X , sub X ) ( I , d L ) subject to
(1)
ϕ ( 0 X ) = 0 ;
(2)
ϕ ( μ ν ) = ϕ ( μ ) ϕ ( ν ) for any μ , ν I X ;
(3)
ϕ ( a & μ ) = a & ϕ ( μ ) for any a I and μ I X .
The elements of F X play the role of many-valued filters.
An F -monoid is a pair ( X , n : X F X ) such that
n ( x ) ( e ) X ( x ) = ( ) ( x ) and n ( m ) X · F ( n ) · n .
Based on [14] (IV.3.2.2 Theorem), the maps
c o n v : Set ( X , F X ) I - Rel ( β X , X ) , c o n v ( n ) ( U , x ) = r n ( x ) ( U ) n b h d : I - Rel ( β X , X ) Set ( X , F X ) , n b h d ( c ) ( x ) = c ( , x ) ( )
are bijections between ( β , I ) -algebras and F -monoids. Therefore, with the help of Theorem 2, we can describe I -valued toplogical spaces in terms of their neighborhood systems.

3. When & Is Archimedean

In order to give another characterization of the discrete presheaf monad, we introduce a new type of I -category. Let X be an I -category. The cotensor a X x of a I and x X is an element of X such that, for any y X , it holds that
X ( y , a X x ) = a X ( y , x ) .
Usually, we omit the subscript X of X . An I -category X is called cotensored if, for any a I and x X , the cotensor a x exists.
An I -category is a cotensored I -category whose underlying order is closed under finite meets. An I -functor is a map between I -categories that preserves cotensors and all finite meets. I -categories and I functors assemble into a category
I - Cat .
The I -category ( I , d L ) is contensored by a x = a x for any a , x I . Given a set X , the product x X ( I , d L ) x in I - Cat is ( I X , sub X ) , which is cotensored by a μ = a μ for any a I and μ I X . Thus, the functor I - Cat ( , ( I , d L ) ) : ( I - Cat ) op Set is right adjoint. The induced monad is denoted as ( F , m , e ) .
The following lemma gives a useful characterization of I -functors.
Lemma 4
([23] (Proposition 2.11)). Let ϕ : X ( I , d L ) be an I -functor. Then,
ϕ = ϕ ( t ) = 1 X ( t , ) .
Furthermore, the implication → is continuous at the second variable and
X ( z , x y ) = X ( z , x ) X ( z , y )
holds for all x , y , z X . Given a filtered subset F X , the map ψ = t F X ( t , ) is an I functor.
Proof. 
That ϕ preserves all finite meets implies that { t ϕ ( t ) = 1 } is not empty. For every x , y such that ϕ ( x ) = 1 , note that X ( x , y ) y x ; then, it holds that
X ( x , y ) ϕ ( y ) = ϕ ( X ( x , y ) y ) ϕ ( x ) = 1 .
For the other direction, since ϕ ( ϕ ( y ) y ) = 1 , it holds that
ϕ ( y ) X ( ϕ ( y ) y , y ) = X ( ϕ ( y ) y , ϕ ( y ) y ) = 1 .
We can conclude the second statement from direct calculation:
ψ ( x y ) = t F X ( t , x y ) = t F X ( t , x ) X ( t , y ) = ψ ( x ) ψ ( y ) ; ( F is filtered ) ψ ( a x ) = t F X ( t , a x ) = t F a X ( t , x ) = a ψ ( x ) , ( a ( ) is continuous )
Therefore, when the continuous t-norm is Archimedean, the monad ( F , m , e ) is exactly the conical I -semifilter monad, and isomorphic to the saturated prefilter monad [15].

3.1. The Łucasiewicz t-Norm

The Łucasiewicz t-norm has nice properties such as the implication → of it being continuous,
( a 0 ) 0 = a and a & ( b c ) = ( a b ) c
for any a , b , c I .
Theorem 3.
We have the following isomorphism:
( Π , m , e ) ( F , m , e ) ( F , m , e ) .
Proof. 
Given a ϕ F X , ϕ ( ( ) 0 ) 0 is an I -functor because, for each μ , ν I X and a I ,
ϕ ( ( a μ ) 0 ) 0 = ϕ ( a & ( μ 0 ) ) 0 = ( a & ϕ ( μ 0 ) ) 0 = a ( ϕ ( μ 0 ) 0 ) ; ϕ ( ( μ ν ) 0 ) 0 = ϕ ( ( μ 0 ) ( ν 0 ) ) 0 = ( ϕ ( μ 0 ) 0 ) ( ϕ ( ν 0 ) 0 ) .
It is easy to check that { δ X } X give rise to an isomorphism of monads in which
δ X : F X F X , ϕ ϕ ( ( ) 0 ) 0 .
Example 6.
Combining Example 5 and the above Theorem, we describe I -valued topological spaces in terms of neighborhood systems via not only ( F , m , e ) but also ( F , m , e ) . In addition, it is shown in [24] that the algebras for ( F , m , e ) are exactly continuous I -lattices. Thus, by [14] (IV.4.6.5 Corollary), one can obtain that the injective I -valued topological spaces are exactly the continuous I -lattices.

3.2. The Product t-Norm

For the product t-norm, a ( ) is continuous for any a and ( ) b for any b 0 .
Recall that an element μ I X is called bounded if μ > 0 . The set B X of bounded elements endowed with sub X is an I -category but not an I -category since ( B X , ) does not admit a bottom element. ( B X , sub X ) is tensored and its underlying order admits all nonempty finite joints.
Denote by B X the set of maps ϕ : ( B X , sub X ) ( I , d L ) for which ϕ preserves tensors and all nonempty finite joints. For any f : X Y and ϕ B X , defining B ( f ) ( ϕ ) = ϕ ( · f ) establishes B as a functor. By Lemma 1, δ X : F X B X forms a natural isomorphism, where δ X ( ϕ ) = ϕ B X . Since F and B are isomorphic, we can obtain a monad ( B , m , e ) , where
( e ) X ( x ) : B X I , μ μ ( x ) ; ( m ) X ( Φ ) : B X I , μ Φ ( μ ˜ )
for any x X and Φ ( B ) 2 X , where B B X μ ˜ : ϕ ϕ ( μ ) .
Turn to the monad ( F , m , e ) . For each set X , we denote the set of I -functors from ( B X , sub X ) to ( I , d L ) by B X and let
B ( f ) : B X B Y , ϕ ϕ ( · f ) ; ( e ) X ( x ) : B X I , μ μ ( x ) ; ( m ) X ( Φ ) : B X I , μ Φ ( μ ˜ ) .
for any f : X Y , x X and Φ ( B ) 2 X , where B B X μ ˜ : ϕ ϕ ( μ ) . It is straightforward to verify that B is functorial and { ( m ) X } X , { ( e ) X } X give rise to natural transformations.
Proposition 6.
The triple ( B , m , e ) is a monad.
Proof. 
To keep the notation simple, we omit the subscripts ∧ of ( m ) X and ( e ) X . They give rise to a monad since
( m X · e B X ) ( ϕ ) = ( ˜ ) ( ϕ ) = ϕ ; ( m X · B e X ) ( ϕ ) = ϕ ( ( ˜ ) · e X ) = ϕ ; ( m X · B ( m X ) ) ( Φ ) ( μ ) = Φ ( ( μ ˜ ) · m X ) = Φ ( Φ Φ ( μ ˜ ) ) ; ( m X · m B X ) ( Φ ) ( μ ) = Φ ( μ ˜ ˜ ) = Φ ( Φ Φ ( μ ˜ ) ) .
This monad is isomorphic to the bounded I -semifilter monad [15], and hence is isomorphic to the functional ideal monad [16,17]; refer to [15] (Section 7) for more information.
An element of B X is called prime if it preserves all finite joints. 1 B X B X is prime. A prime ϕ B X is called proper if ϕ 1 B X . Since B ( f ) ( ϕ ) is prime for every prime ϕ B X and f : X Y , we obtain a subfunctor P .
Proposition 7.
Prime I -functors give rise to a submonad of ( B , m , e ) .
Proof. 
( e ) X ( x ) = ( ) ( x ) is prime obviously. Given a Φ ( P ) 2 X , since
( m · ( i i ) ) X ( Φ ) ( μ ν ) = Φ ( ( μ ν ˜ ) · i X ) = Φ ( ( μ ˜ · i X ) ( ν ˜ · i X ) ) = Φ ( μ ˜ · i X ) Φ ( ν ˜ · i X ) ,
the proof is finished.    □
The monad ( P , m , e ) is exactly the monad ( P π , m π , e π ) in [25], and hence is isomorphic to the prime functional ideal monad.
Combining [17] (Theorem 4.1) and [25] (Theorem 3.5), there is a bijection between proper elements of P X and β X × ( 0 , 1 ] . Given a pair ( U , a ) β X × ( 0 , 1 ] , the corresponding proper prime I -functor is given by
ϕ = A U 0 a > a 0 sub X ( a & 1 A , ) .
We further compute:
ϕ ( μ ) = A U 0 a > a 0 sub X ( a & 1 A , μ ) = A U 0 a > 0 a ( x A μ ( x ) ) = A U 0 ( a > a 0 a ) ( x A μ ( x ) ) ( μ is bounded ) = a 0 ( A U x A μ ( x ) ) = U β X r ( U ) β ¯ μ ( U ) ,
in which the ( β , I ) -relation r : X { } is given by
r ( U ) = a 0 , U = U 0 , 0 , U U 0 .
A ( β , I ) -relation r : X { } is called prime if it is of the above type, and we denote it by ( U 0 , a 0 ) . Then, there is a bijection between prime ( β , I ) -relations r : X { } and proper elements of P X .
It is easy to show that prime ( β , I ) -relations are unitary. An element of B X is called prime if it preserves all nonempty finite meets. 0 B X B X is prime. A prime ϕ B X is called proper if ϕ 0 B X . The proof of the following proposition is similar to that of Proposition 7.
Proposition 8.
Prime I -functors give rise to a submonad of ( B , m , e ) .
Lemma 5.
There is a bijection between prime ( β , I ) -relations r : X { } and proper elements ϕ of P X .
Proof. 
When transitioning from F X to B X , the bijections in Theorem 2 are modified as follows:
r r ( ) : B X I and B X ϕ r ϕ = A ( ) a > 0 ϕ ( 1 A a ) .
It suffices to prove that r ( ) is prime and r ϕ is prime whenever r and ϕ are prime.
That r ( ) is prime follows from Proposition 3. To see that r ϕ is prime, suppose that there are two ultrafilters U 1 , U 2 such that r ( U 1 ) > 0 and r ( U 2 ) > 0 . Since U 1 U 2 , there is a B U 1 and X B U 2 . Then, for any a > 0 , we have that
a & ϕ ( 1 X ) = ϕ ( 0 X a ) = ϕ ( ( 1 B a ) ( 1 X B a ) ) = ϕ ( 1 B a ) ϕ ( 1 X B a ) r ( U 1 ) r ( U 2 ) > 0 .
By the arbitrariness of a , we reach a contradiction.    □
With Lemma 5 at hand, we can prove the following results.
Theorem 4.
There is an isomorphism
( P , m , e ) ( P , m , e ) .
Proof. 
For each prime ( β , I ) -relation r : X { } , we denote by ι ( r ) and c ( r ) the correspondent ultrafilter on X and number in ( 0 , 1 ] , respectively. The corresponding I -functor and I -functor are given by
c ( r ) β ¯ ( ) ( τ ( r ) ) and c ( r ) & β ¯ ( ) ( τ ( r ) ) ,
respectively. For convenience, we use the notation r for the corresponding I -functor and I -functor as well.
Let R : ( β , I ) - PRel ( X , { } ) { } be a prime ( β , I ) -relation, where ( β , I ) - PRel ( X , { } ) denotes the set of prime ( β , I ) -relations from X to { } . By [17] (Propositon 5.3 5.4), we have that
c ( m ( R ) ) = c ( R ) & a ι ( R ) r a c ( r ) = c ( R ) & a ι ( R ) r a c ( r ) ,
and
ι ( m ( R ) ) = a ι ( R ) r a ι ( r ) .
Let a 0 = c ( m ( R ) ) and U 0 = ι ( m ( R ) ) . Then, for any μ B X , it holds that
a 0 & β ¯ ( μ ) ( U 0 ) = m ( R ) ( μ ) = R ( μ ˜ ) = c ( R ) & β ¯ ( μ ˜ ) ( ι ( R ) ) ,
where
μ ˜ : { } ( β , I ) - PRel ( X , { } ) , ( , r ) c ( r ) & β ¯ ( μ ) ( ι ( r ) ) .
It suffices to demonstrate that U 0 = ι ( m ( R ) ) and a 0 = c ( m ( R ) ) .
Suppose, on the contrary, that U 0 ι ( m ( R ) ) . It is routine to check that U = { { ι ( r ) r a } a ι ( R ) } is an ultrafilter on β X and Σ U = ι ( m ( R ) ) . Thus, there exists an A U 0 and an a ι ( R ) such that A β { ι ( r ) r a } = . Thus, for any a > 0 , it holds that
β ¯ ( 1 A a ˜ ) ( ι ( R ) ) r a 0 c ( r ) & β ¯ ( 1 A a ) ( ι ( r ) ) = a & r a 0 c ( r ) a .
By the arbitrariness of a , we conclude that a 0 & β ¯ ( μ ) ( U 0 ) = 0 , which leads to a contradiction.
For a 0 = c ( m ( R ) ) , we can compute directly as follows:
a 0 = m ( R ) ( 1 X ) = R ( 1 X ˜ ) = c ( R ) & β ¯ ( 1 X ˜ ) ( ι R ) = c ( R ) & a ι ( R ) r a c ( r ) & β ¯ ( 1 X ) ( ι ( r ) ) = c ( R ) & β ¯ ( 1 X ˜ ) ( ι R ) = c ( R ) & a ι ( R ) r a c ( r )
Corollary 1.
The prime functional ideal monad is isomorphic to a submonad of the discrete presheaf monad associated to β ¯ .
Proof. 
Follow from Proposition 8 and Theorem 4 directly.    □

4. Conclusions

In this paper, we extended the ultrafilter monad to the category I - Rel , where I is the unit interval endowed with a continuous t-norm. This lax extension is associated, and hence induces a new monad named the discrete presheaf monad ( Π , n , d ) .
For a general continuous t-norm, a characterization of the discrete presheaf monad is presented: ( Π , n , d ) ( F , m , e ) .
When ( I , & , 1 ) is the Łucasiewicz t-norm, with the help of the natural isomorphism
δ X : F X F X , ϕ ϕ ( ( ) 0 ) 0
, we obtain another characterization: ( Π , n , d ) ( F , m , e ) . The Eilenberg–Moore algebras of the latter have a good characterization.
When ( I , & , 1 ) is the product t-norm, the ( β , I ) -algebras are precisely Lowen’s approach spaces. It is shown that the approach spaces are lax algebras for the functional ideal monad and the prime functional ideal monad. A natural question arises: what is the relationship between them and the discrete presheaf monad? Here, we only proved that the prime functional ideal monad is isomorphic to a submonad of the discrete presheaf monad.
Problem 1.
Is the discrete presheaf monad isomorphic to the functional ideal monad?
As mentioned earlier, in this paper, we only provide a characterization of the Eilenberg–Moore algebras for the discrete presheaf monad when the t-norm used is the Łukasiewicz t-norm. However, for other continuous t-norms, further research is still needed to explore the Eilenberg–Moore algebras for the discrete presheaf monad.

Author Contributions

Conceptualization, G.Z. and S.Z.; Methodology, G.Z. and S.Z.; Investigation, G.Z. and S.Z.; Writing—original draft, G.Z. and S.Z.; Writing—review & editing, G.Z. and S.Z.; G.Z. and S.Z. contributed equally to this work. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by start-up funding for talent research grant number 16002203.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Data are contained in the body of the paper.

Acknowledgments

The authors are grateful to the anonymous reviewer for reading this paper carefully and providing valuable comments and suggestions.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Barr, M. Relational Algebras. In Reports of the Midwest Category Seminar IV; Lecture Notes in Mathematics; Mac Lane, S., Ed.; Springer: Berlin/Heidelberg, Germany, 1970; pp. 39–55. [Google Scholar]
  2. Lawvere, F.W. Metric Spaces, Generalized Logic, and Closed Categories. Rend. Semin. MatéMatico e Fis. Milano 1973, 43, 135–166. [Google Scholar] [CrossRef]
  3. Clementino, M.M.; Hofmann, D. Topological Features of Lax Algebras. Appl. Categ. Struct. 2003, 11, 267–286. [Google Scholar] [CrossRef] [Green Version]
  4. Lowen, R. Approach Spaces a Common Supercategory of TOP and MET. Math. Nachr. 1989, 141, 183–226. [Google Scholar] [CrossRef]
  5. Clementino, M.M.; Hofmann, D.; Tholen, W. One Setting for All: Metric, Topology, Uniformity, Approach Structure. Appl. Categ. Struct. 2004, 12, 127–154. [Google Scholar] [CrossRef] [Green Version]
  6. Clementino, M.M.; Tholen, W. Metric, Topology and Multicategory—A Common Approach. J. Pure Appl. Algebra 2003, 179, 13–47. [Google Scholar] [CrossRef] [Green Version]
  7. Hofmann, D. Topological Theories and Closed Objects. Adv. Math. 2007, 215, 789–824. [Google Scholar] [CrossRef] [Green Version]
  8. Lai, H.; Tholen, W. Quantale-Valued Topological Spaces via Closure and Convergence. Topol. Appl. 2017, 230, 599–620. [Google Scholar] [CrossRef]
  9. Yue, Y.; Yao, W.; Ho, W.K. Applications of Scott-closed Sets in Convex Structures. Topol. Appl. 2022, 314, 108093. [Google Scholar] [CrossRef]
  10. Seal, G.J. Canonical and Op-Canonical Lax Algebras. Theory Appl. Categ. 2005, 14, 221–243. [Google Scholar]
  11. Gähler, W. Monadic Topology—A New Concept of Generalized Topology. In Recent Developments of General Topology and Its Applications; Gähler, W., Herrlich, H., Preuß, G., Eds.; Akademie-Verlag: Berlin, Germany, 1992; Volume 67, pp. 136–149. [Google Scholar]
  12. Hofmann, D.; Seal, G.J. A Cottage Industry of Lax Extensions. Categ. Gen. Algebr. Struct. Appl. 2015, 3, 113–151. [Google Scholar]
  13. Scott, D. Continuous Lattices. In Toposes, Algebraic Geometry and Logic; Lecture Notes in Mathematics; Lawvere, F.W., Ed.; Springer: Berlin/Heidelberg, Germany, 1972; pp. 97–136. [Google Scholar]
  14. Hofmann, D.; Seal, G.J.; Tholen, W. (Eds.) Monoidal Topology: A Categorical Approach to Order, Metric, and Topology. In Encyclopedia of Mathematics and Its Applications; Cambridge University Press: Cambridge, UK, 2014. [Google Scholar]
  15. Lai, H.; Zhang, D.; Zhang, G. The Saturated Prefilter Monad. Topol. Appl. 2021, 301, 107525. [Google Scholar] [CrossRef]
  16. Colebunders, E.; Van Opdenbosch, K. Kleisli Monoids Describing Approach Spaces. Appl. Categ. Struct. 2016, 24, 521–544. [Google Scholar] [CrossRef]
  17. Lowen, R.; Vroegrijk, T. A New Lax Algebraic Characterization of Approach Spaces. Quad. Math. 2008, 22, 137–170. [Google Scholar]
  18. Klement, E.P.; Mesiar, R.; Pap, E. Triangular Norms; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2000. [Google Scholar]
  19. Mostert, P.S.; Shields, A.L. On the Structure of Semigroups on a Compact Manifold with Boundary. Ann. Math. 1957, 65, 117–143. [Google Scholar] [CrossRef]
  20. Lowen, R. Index Analysis: Approach Theory at Work; Springer: Berlin/Heidelberg, Germany, 2015. [Google Scholar]
  21. Kelly, G.M. Basic Concepts of Enriched Category Theory. Reprints Theory Appl. Categ. 2005, 10, 1–136. [Google Scholar]
  22. Stubbe, I. Categorical Structures Enriched in a Quantaloid: Tensored and Cotensored Categories. arXiv 2006, arXiv:math/0411366. [Google Scholar]
  23. Yu, J.; Zhang, D. A Hofmann-Mislove Theorem for Approach Spaces. Theory Appl. Categ. 2023, 39, 21–50. [Google Scholar]
  24. Zhang, G.; He, W. On Saturated Prefilter Monads. Categ. Gen. Algebr. Struct. Appl. 2023, 18, 19–41. [Google Scholar] [CrossRef]
  25. Colebunders, E.; Lowen, R.; Rosiers, W. Lax Algebras via Initial Monad Morphisms: APP, TOP, MET and ORD. Topol. Appl. 2011, 158, 882–903. [Google Scholar] [CrossRef] [Green Version]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zhang, G.; Zhang, S. On Discrete Presheaf Monads. Axioms 2023, 12, 610. https://doi.org/10.3390/axioms12060610

AMA Style

Zhang G, Zhang S. On Discrete Presheaf Monads. Axioms. 2023; 12(6):610. https://doi.org/10.3390/axioms12060610

Chicago/Turabian Style

Zhang, Gao, and Shaoqun Zhang. 2023. "On Discrete Presheaf Monads" Axioms 12, no. 6: 610. https://doi.org/10.3390/axioms12060610

APA Style

Zhang, G., & Zhang, S. (2023). On Discrete Presheaf Monads. Axioms, 12(6), 610. https://doi.org/10.3390/axioms12060610

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop