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
[
2]. In addition, Clementino and Hofmann [
3] extended the ultrafilter monad to the category
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
of monad
to the category
of relations valued in a quantale
a new monad
named a discrete presheaf monad associated to
arises. We have the following isomorphism:
where
is the category of lax algebras for
is the category of Kleisli monoids of the discrete presheaf monad and
is the category of lax algebras for the Kleisli extension of
The above isomorphism provides different characterizations of the same object. When
is the ultrafilter monad and
, 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
is
V-power-enriched [
12]; hence, it satisfies that (i) the RegMono-injective separated Kleisli monoids are exactly the Eilenberg–Moore algebras for
; (ii) there is a derived monad on the category
that has the same Eilenberg–Moore algebras with the original monad
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
is the composite monad of the ordered-filter monad and down-set monad on
thus, its Elenberg–Moore algebras are complete and continuous posets (continuous lattices). Therefore, by (i), we come to Scott’s result [
13]: the injective
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
where
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
of
-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
A triangular norm (t-norm for short) is a binary operation & on the unit interval I such that is a commutative monoid and is monotone for all
A t-norm & is said to be continuous if the function
is continuous with respect to the standard topology. Given a continuous t-norm
for every
since
preserves arbitrary joints, it admits a right adjoint
that is determined by
for all
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 and we have that
- (1)
- (2)
- (3)
- (4)
Example 1. There are three basic continuous t-norms.
- 1.
The Łukasiewicz t-norm Its implication is given by
- 2.
The product t-norm Its implication is given by
- 3.
The Gödel t-norm Its implication is given by
Since & is associated, we can denote by
the
An element is called idempotent if
The Łukasiewicz t-norm and the product t-norm are Archimedean, which means that, for any there is an such that Moreover, the Łukasiewicz t-norm is nilpotent, which means that, for any there is an such that
Similarly, we can define a t-norm & on any closed interval Two t-norms and are said to be isomorphic if there exists an order isomorphism such that holds for all
Example 2. The Lawvere quantale is isomorphic to the product t-norm by Assumption 1. From now on, we always give a t-norm by a triple and assume that it is continuous. In particular, denotes the unit interval endowed with a continuous t-norm
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 be a continuous t-norm. Then, there exists a family of disjoint such that:- (1)
For any , are idempotent and is isomorphic to the unit interval endowed with a continuous Archimedean t-norm;
- (2)
for any
If lies in some above-mentioned we let denote and denote
An
-relation
is a map
Given two
-relations
the composition
is given by
Sets and
-relations form a category
Let
be a map. Then, there exist two
-relations
given by
Usually, we simply write as
1.2. Monads and Their Lax Extensions
1.2.1. Monad
A monad on a category
is a triple
consisting of an endfunctor
and two natural transformations: the unit
and the multiplication
, making the diagrams
commutative.
An adjunction gives rise to a monad on 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 be a locally small category and A be the object of The functor is right adjoint if and only if the product in with for all exists for every set
Proof. Let B be an object in A map is equivalent to a source with for all In addition, f is universal from X to that is, for any object C in and map , there is a morphism such that if and only if the source is universal. That means that B is the product of in which for all
Since is right adjoint if and only if, for each set X, there exist an object in and a universal map from X to the conclusion follows. In this case, the assignment is functorial and left adjoint to □
Example 3. - (1)
Let be the set Then, the functor known as the contravariant powerset functor, is right adjoint, and the induced monad is called the double-powerset monad.
- (2)
Let be the lattice in which The functor is right adjoint, where is the category lattices and lattice morphisms. For each set the product is exactly the power set endowed with the inclusion order. This adjunction induces the ultrafilter monad We spell it out here: the functor β defined on objects by on morphisms by The two natural transformations are given by:where
A morphism (isomorphism)
of monads is a natural transformation (isomorphism)
such that
where ∗ is the horizontal composition of natural transformations.
Let
be a monad on
If
is a subfunctor of
T and the inclusion transformation
satisfies that, for any
,
then
is called a submonad of
Usually, we simply write
m for
1.2.2. Lax Extension
A lax extension of a functor to is an assignment and a family of maps ( run through all the sets, and we usually simply write as ) such that
- (1)
- (2)
and
- (3)
and
for any -relations and map
A lax extension of a monad on to is a triple such that is a lax extension of T and are op-lax; that is,
- (4)
- (5)
for any -relations
A
-relation
is an
-relation
The Kleisli convolution of
-relations
is a
-relation
given by
In general, sets with -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
-relations: a
-relation
is unitary if it satisfies that
For every unitary
-relation
the unitary
-relations
are identities of the Kleisli convolution; that is,
see [
14] (Subsection III.1.8) for more detail.
A lax extension is said to be associated if the Kleisli convolution of unitary
-relations is associated. In this case, we obtain a category
2. The Barr Extension to - and Induced Monad
We consider the strata extensions of the Barr extension
along
for any
and
where
and
is the Barr extension of the ultrafilter monad to
that is,
When
r is dummy in one variable—that is
or
—we simply write
for
or
In this case, it is easy to check that ([
20] (1.1.5 Lemma))
Proposition 3. For each relation and we have that
- (1)
- (2)
- (3)
Proof. (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
are lax extensions of an ultrafilter monad to
[
14] (IV.2.4.3 Propostion). We call these lax extensions Barr extensions to
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
are associated. The proof for the case that
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 are associated.
Proof. Thanks to [
14] (III.1.9.4 Proposition), it suffices to show that
preserves the composition of
I-relations and that
is natural.
Let be -relations, F be an ultrafilter on X and H be an ultrafilter on Z. For any there exists some such that Since & is continuous, we can pick such that and For any since and we have that Thus,
Since
m is op-lax, we only need to show that
Let
Note that the Barr extension of an ultrafilter monad to
is associated. For any
we have that
so
□
Since the Barr extensions of the ultrafilter monad to
are associated, there is a functor
For each set
the product
is given by
where
is the map from
to
X that maps * to
Thus, the left adjoint of
is identical on objects and maps every map
to the unitary
-relation
We denote it by
The monad determined by this adjunction is referred to as the discrete presheaf monad associated to
It is denoted as
In order to characterize the discrete presheaf monad associated to
we introduce some notions first. An
-category [
21,
22]
is a set
X with an
-relation
that satisfies
for any
For convenience, we denote by
the
-relation
r if no confusion would arise. The underlying order ≤ of
X is defined by
Let
X be an
-category. The tensor [
21,
22]
of
and
is an element of
X such that, for any
, it holds that
The subscript X of is omitted if there is no danger of ambiguity. An -category X is called tensored if, for any and , the tensor exists.
An
-category is a tensored
-category whose underlying order has all finite joins. An
-functor is a map between
-categories that preserves tensors and all finite joins. Since the composition of
-functors is again an
-functor, we obtain a category whose objects are
-categories and morphisms are
-functors and denote it by
Example 4. Let Then, is an -category tensored by for any Given a set the product in is where The tensor of is given byfor any and its underlying order is pointwise order, and hence is complete. By the above example, the functor
is left adjoint. The right adjoint
is given by
for any map
and
We denote the induced monad by
and explicitly state its form here:
for any
and
where
For the rest of this section, we prove that the discrete presheaf monad is isomorphic to
At first, we show that each element of
is determined by its effect on
where
This conclusion is proved in [
14] (IV.3.3.1 Theorem) for the Lawvere quantale
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 is called bounded if
Lemma 1. Let be an -functor. Then, ϕ is determined by its effect on bounded elements.
Proof. If
we are finished. If
then, by the continuity of &,
for any
□
Lemma 2. Let be an -functor. If is Archimedean, then ϕ is fully determined by its effect on
Proof. Case 1. is isomorphic to the Łukasiewicz t-norm.
Let
and
Fix
n. Since
is the Łukasiewicz t-norm, there exists an
such that
Let
where
and
for
Since
preserves the tensors and all finite joins, it holds that
Since
is the Łukasiewicz t-norm,
for any
Note that, for any
, it holds that (i)
are determined by
(ii)
This completes the proof.
Case 2. 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
is the product t-norm, there is an
such that
Then, the proof is similar to Case 1. □
From the proof, we can see that, if the range of falls within some for which is a continuous Archimedean t-norm, then can be determined by and
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
-functor and
an element of
For convenience, we denote by
a the infimum of
and by
b the supremum of
For each
let
and
It is easy to check that
for all
The following function
is determined by
and
Lemma 3. The function α satisfies the following statements:
- (1)
α is decreasing and
- (2)
For each idempotent if then and
- (3)
For each idempotent if then and
Proof. Note that preserves the empty joint, (1) is trivial.
To see (2), since
we have that
Then, we conclude that
To see (3), since it holds that Hence, we have that □
Now, we can prove the following proposition.
Proposition 5. Let be an -functor. Then, it is fully determined by its effect on
Proof. Given an we adopt the notation of Lemma 3 and let
Case 1. a is not idempotent and
Since by Lemma 3, we have that Then, as the range of is contained within , we can apply Lemma 2 to reach the desired conclusion.
Case 2. a is idempotent and
In this case, we have that
and
Hence, the conclusion follows from
Case 3.
As
and
is decreasing, one can find some
such that
By the ordinal sum decomposition theorem, we distinguish four subcases.
Subcase 1. and there exists some such that the elements of are idempotent. In this case,
Subcase 2. and there exists some such that the elements of are idempotent. In this case,
Subcase 3. and there exists some such that the elements of are non-idempotent.
In this case, we have that
and
Thus, one can use Lemma 3 twice to obtain that
It follows from Lemma 2 that is determined by
Subcase 4. and there exists some such that the elements of are non-idempotent.
The proof is similar to that of Subcase 3. □
The unitariness of a -relation is trivial; thus, there is a bijection between and
By endowing
with the
-relation
by Proposition 3, every unitary
-relation
gives an
-functor
Thus, the functor
can be lifted to
For every map
the
-functor
maps the unitary
-relation
to
Thus, we have the following commutative diagram:
In addition,
induces a monad morphism
given by
For every
-functor
let
Since, for every
and
it holds that
is unitary.
Theorem 2. The monads are isomorphic to the discrete presheaf monads associated to
Proof. It suffices to show that and hold for any -functor and unitary -relation
To see
by Proposition 5, we only need to prove that
coincides with
on
Given an
we have that
If
we are done. If
the set
is directed because
preserves finite joins; hence, there exists an ultrafilter
that extends
and excludes
Thus,
For
given an ultrafilter
on
X, it holds that
For the other direction, let
then, the set
is a filter base. By the axiom of choice, there exists an ultrafilter
on
that extends the aforementioned filter base. It is easy to check that
and there exists some
such that
By the unitariness of
r, we have that
Example 5. A -algebra is a pair consisting of a set X and a -relation satisfyingfor any and These objects were investigated in [8] under the name of -valued topological spaces. An element ϕ of is a map subject to
- (1)
- (2)
for any
- (3)
for any and
The elements of play the role of many-valued filters.
An -monoid is a pair such that Based on [14] (IV.3.2.2 Theorem), the mapsare bijections between -algebras and -monoids. Therefore, with the help of Theorem 2, we can describe -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
-category. Let
X be an
-category. The cotensor
of
and
is an element of
X such that, for any
, it holds that
Usually, we omit the subscript X of An -category X is called cotensored if, for any and , the cotensor exists.
An
-category is a cotensored
-category whose underlying order is closed under finite meets. An
-functor is a map between
-categories that preserves cotensors and all finite meets.
-categories and
functors assemble into a category
The -category is contensored by for any Given a set the product in is , which is cotensored by for any and Thus, the functor is right adjoint. The induced monad is denoted as
The following lemma gives a useful characterization of -functors.
Lemma 4 ([
23] (Proposition 2.11))
. Let be an -functor. Then,Furthermore, the implication → is continuous at the second variable andholds for all Given a filtered subset the map is an functor. Proof. That
preserves all finite meets implies that
is not empty. For every
such that
note that
then, it holds that
For the other direction, since
it holds that
We can conclude the second statement from direct calculation:
Therefore, when the continuous t-norm is Archimedean, the monad
is exactly the conical
-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,
for any
Theorem 3. We have the following isomorphism: Proof. Given a
is an
-functor because, for each
and
It is easy to check that
give rise to an isomorphism of monads in which
Example 6. Combining Example 5 and the above Theorem, we describe -valued topological spaces in terms of neighborhood systems via not only but also In addition, it is shown in [24] that the algebras for are exactly continuous -lattices. Thus, by [14] (IV.4.6.5 Corollary), one can obtain that the injective -valued topological spaces are exactly the continuous -lattices. 3.2. The Product t-Norm
For the product t-norm, is continuous for any a and for any
Recall that an element is called bounded if The set of bounded elements endowed with is an -category but not an -category since does not admit a bottom element. is tensored and its underlying order admits all nonempty finite joints.
Denote by
the set of maps
for which
preserves tensors and all nonempty finite joints. For any
and
defining
establishes
as a functor. By Lemma 1,
forms a natural isomorphism, where
Since
and
are isomorphic, we can obtain a monad
where
for any
and
where
Turn to the monad
For each set
we denote the set of
-functors from
to
by
and let
for any
and
where
It is straightforward to verify that
is functorial and
give rise to natural transformations.
Proposition 6. The triple is a monad.
Proof. To keep the notation simple, we omit the subscripts ∧ of
and
They give rise to a monad since
This monad is isomorphic to the bounded
-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 is called prime if it preserves all finite joints. is prime. A prime is called proper if . Since is prime for every prime and , we obtain a subfunctor
Proposition 7. Prime -functors give rise to a submonad of
Proof. is prime obviously. Given a
since
the proof is finished. □
The monad
is exactly the monad
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
and
Given a pair
the corresponding proper prime
-functor is given by
We further compute:
in which the
-relation
is given by
A -relation is called prime if it is of the above type, and we denote it by Then, there is a bijection between prime -relations and proper elements of
It is easy to show that prime -relations are unitary. An element of is called prime if it preserves all nonempty finite meets. is prime. A prime is called proper if . The proof of the following proposition is similar to that of Proposition 7.
Proposition 8. Prime -functors give rise to a submonad of
Lemma 5. There is a bijection between prime -relations and proper elements ϕ of
Proof. When transitioning from
to
the bijections in Theorem 2 are modified as follows:
It suffices to prove that is prime and is prime whenever r and are prime.
That
is prime follows from Proposition 3. To see that
is prime, suppose that there are two ultrafilters
such that
and
Since
there is a
and
Then, for any
, we have that
By the arbitrariness of we reach a contradiction. □
With Lemma 5 at hand, we can prove the following results.
Proof. For each prime
-relation
we denote by
and
the correspondent ultrafilter on
X and number in
respectively. The corresponding
-functor and
-functor are given by
respectively. For convenience, we use the notation
r for the corresponding
-functor and
-functor as well.
Let
be a prime
-relation, where
denotes the set of prime
-relations from
X to
By [
17] (Propositon 5.3 5.4), we have that
and
Let
and
Then, for any
, it holds that
where
It suffices to demonstrate that and
Suppose, on the contrary, that
It is routine to check that
is an ultrafilter on
and
Thus, there exists an
and an
such that
Thus, for any
, it holds that
By the arbitrariness of we conclude that which leads to a contradiction.
For
we can compute directly as follows:
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 where 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 .
For a general continuous t-norm, a characterization of the discrete presheaf monad is presented: .
When
is the Łucasiewicz t-norm, with the help of the natural isomorphism
, we obtain another characterization:
The Eilenberg–Moore algebras of the latter have a good characterization.
When is the product t-norm, the -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.