
TL;DR
This paper introduces a presheaf-based framework for fuzzy sets, demonstrating their categorical properties and linking to classical and data-driven structures like Vietoris-Rips complexes.
Contribution
It develops a presheaf-theoretic approach to fuzzy sets, showing their completeness, cocompleteness, and explicit limit and colimit descriptions, connecting to classical and data analysis contexts.
Findings
Fuzzy sets form a complete and cocomplete category.
Explicit descriptions of fuzzy sets as limits and colimits.
Vietoris-Rips complexes can be viewed as fuzzy sheaves.
Abstract
This note presents a presheaf theoretic approach to the construction of fuzzy sets, which builds on Barr's description of fuzzy sets as sheaves of monomorphisms on a locale. A presheaf-theoretic method is used to show that the category of fuzzy sets is complete and co-complete, and to present explicit descriptions of classical fuzzy sets that arise as limits and colimits. The Boolean localization construction for sheaves and presheaves on a locale L specializes to a theory of stalks if L approximates the structure of a closed interval in the real line. The system V(X) of Vietoris-Rips complexes for a data cloud X becomes both a simplicial fuzzy set and a simplicial sheaf in this general framework. This example is explicitly discussed in this paper, in stages.
Click any figure to enlarge with its caption.
Figure 1Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
††thanks: Supported by NSERC.
Fuzzy sets and presheaves
John F. Jardine
Department of Mathematics, University of Western Ontario, London, Ontario, Canada
Abstract
This paper presents a presheaf theoretic approach to the construction of fuzzy sets, which builds on Barr’s description of fuzzy sets as sheaves of monomorphisms on a locale. Presheaves are used to give explicit descriptions of limit and colimit descriptions in fuzzy sets on an interval. The Boolean localization construction for sheaves on a locale specializes to a theory of stalks for sheaves and presheaves on an interval.
The system of Vietoris-Rips complexes for a data set is both a simplicial fuzzy set and a simplicial sheaf in this general framework. This example is explicitly discussed through a series of examples.
1 Introduction
Fuzzy sets were originally defined to be functions that take values in the unit interval Dubois et al. (2000).
Michael Barr changed the game in his paper Barr (1986): he replaced the unit interval by a more general well-behaved poset, a locale , and redefined fuzzy sets to be functions
[TABLE]
These functions are the fuzzy sets over , and form a category that is described in various ways below.
Locales are complete lattices in which finite intersections distribute over all unions. The unit interval qualifies, but so does the poset of open subsets of a topological space, and locales are models for spaces in this sense.
Every locale has a Grothendieck topology, with coverings defined by joins, and so one is entitled to a presheaf category and a sheaf category for such objects. Presheaves on are contravariant set-valued functors on , and sheaves are presheaves that satisfy a patching condition with respect to the Grothendieck topology on .
Barr showed that, starting with a fuzzy set over , one can pull back over subobjects to define a sheaf , which is a sheaf for which all restriction maps are injections. Technically, one needs to adjoin a new zero object to to make this work, giving a new (but not so different) locale . The resulting object is a sheaf of monomorphisms on in the sense that all non-trivial restriction maps are injective functions.
Write for the category of sheaves of monomorphisms on . Barr showed Barr (1986) that his functor
[TABLE]
is part of a categorical equivalence. This result appears as Theorem 12 in the first section of this paper.
The inverse functor for on a sheaf is constructed by taking the generic fibre , and constructing a function . The set is the set of sections corresponding to the initial object of . Given an element , there is a maximum such that is in the image of the monomorphism , and one defines to be this element .
The first section of this paper is largely expository and self contained. We set notation and introduce the main examples in modern terms, and present a proof of the the Barr result (Theorem 12) that is expressed in this newer language.
Examples 6 and Example 10 show, respectively, that the Vietoris-Rips filtration corresponding to a data set has the structure of a simplicial fuzzy set and (through the Barr theorem) a simplicial sheaf.
To proceed with applications, for example if one wants to sheafify peristent homology theory or clustering and use fuzzy sets to do it, or to say anything about the homotopy types of simplicial objects, it is helpful to have more explicit information about how fuzzy sets are constructed. One needs, in particular, straightforward descriptions of basic constructions such as limits, colimits and stalks in the fuzzy set category, or rather in the associated category of sheaves of monomorphisms. The difficulties, such as they are, arise from the fact that the category of sheaves of monomorphisms is not quite a sheaf category, and constructing the fuzzy set from a sheaf can be a bit interesting.
These issues are dealt with in Sections 2 and 3 of this paper. There is a perfectly good category of presheaves of monomorphisms, and it turns out that if is sufficiently well behaved (as is the unit interval ), then the associated sheaf functor is easily described and preserves presheaves of monomorphisms. The upshot is that one can make constructions on the presheaf category, as a geometer or topologist would, and then sheafify.
Limits are formed as in the ambient sheaf category, meaning sectionwise, but colimits are more involved. The inclusion of sheaves of monomorphisms in all sheaves has a left adjoint , called the image functor, which is defined by taking images of sets of sections in the generic fibre — see Lemma 26. This observation allows one to define colimits of diagrams in : take the presheaf theoretic colimit , and then apply the image functor (sheafified) to get the colimit in .
The image functor and colimit constructions are described in Section 2. That section also contains the formal definitions and properties around presheaves of monomorphisms.
One has the nicest form of the associated sheaf functor for presheaves on a locale when one assumes that is an interval (Lemma 22). The interval assumption on is consistent with the classical theory of fuzzy sets and with the intended applications in Topological Data Analysis.
The general theory of Boolean localization for sheaves and presheaves on a locale is relatively straightforward to describe, and is the starting point for Section 3 of this paper.
Every locale has a standard imbedding into a complete Boolean algebra, by a rather transparent construction that is displayed here (see also Mac Lane and Moerdijk (1994), Jardine (1996), Jardine (2015), for example). This is the easier part of the general Boolean localization construction — the more interesting bit is the construction of the Diaconescu cover, which faithfully imbeds a Grothendieck topos in the topos of sheaves on a locale.
If the locale is an interval, then the corresponding Boolean algebra is the set of subsets of some set (Example 31), so that the sheaf category for has enough points, and therefore has a theory of stalks. The same is true for finite products of intervals (Example 33).
The description of stalks for sheaves of monomorphisms on an interval that arises from the general Boolean localization construction is fairly simple, and can be used as a starting point for a result (Lemma 32) that expresses what stalks are supposed to do in this instance, while avoiding the abstract Boolean localization machinery.
The final part of Section 3 consists of a description of stalks for presheaves on an interval . The construction of stalks for presheaves is a left Kan extension construction, by analogy with stalks for presheaves on a topological space or on the étale site of a scheme.
This paper was written to clear the air about the sheaf theoretic properties of fuzzy sets, and to set the stage for potential applications of the local homotopy theory of simplicial presheaves. See the Healy-McInnes paper McInnes and Healy (2018) for a recent discussion of applications of simplicial fuzzy sets in topological data analysis.
We see in Example 10 that the system of Vietoris-Rips complexes that is associated to a data set does form a simplicial fuzzy set, or a simplicial sheaf (of monomorphisms) on the locale , where is larger than all distances between points of . But we also see in Example 35 that this simplicial sheaf on has a rather awkward collection of stalks, which includes the full data set sitting as a discrete simplicial set in the generic fibre. It follows, for example, that an inclusion induces a stalkwise weak equivalence of simplicial sheaves if and only if .
This is quite like the situation that was encountered in the first attempt to give a sheaf theoretic context for topological data analysis Jardine (2008). The earlier paper uses a different topology on the underlying space of parameters, but produces essentially the same stalks and thus has the same problem with local weak equivalences that are too tightly defined to be useful.
A better option might be to use the metric space (Hausdorff metric) of finite subsets of a fixed metric space as the base topological object. This is the setting for modern stability results Carlsson and Mémoli (2010), Blumberg and Lesnick (2017), which roughly assert that if two data sets in are close in the sense that there is a specific bound on their Hausdorff distance, then the associated persistence invariants (homotopy types, hence clusters and persistent homology) have an interleaving distance with a specific upper bound, usually . In particular, if and are close in the Hausdorff metric, then the corresponding systems and are tightly interleaved as homotopy types. This is a local principle, and the present aim is to globalize it. The challenge is to interpret homotopy interleaving in terms of a local homotopy theoretic structure associated to the space .
2 Fuzzy sets and sheaves
This section gives a general introduction to Barr’s theory of fuzzy sets over a locale, in modern language and with multiple examples. We prove Barr’s Theorem that the category of fuzzy sets over a locale is equivalent to the category of sheaves of monomorphisms on a slightly augmented version of — this is Theorem 12 below.
Every closed interval is a locale, and we identify the Vietoris-Rips system with a simplicial fuzzy set over ( sufficiently large) in Example 10, or equivalently with a simplicial sheaf of monomorphisms, via Barr’s Theorem.
The section finishes with a discussion of completeness properties for the category of sheaves of monomorphisms on and hence of fuzzy sets over .
A frame is a complete lattice in which finite meets distribute over all joins. Examples include the poset of open subsets of a topological space .
According to this definition, has a terminal object (empty meet) and an initial object [math] (empty join) — see (Mac Lane and Moerdijk, 1994, p.471).
The completeness assumption means that every set of elements has a least upper bound . The set also has a greatest lower bound , which is the least upper bound of the elements which are smaller than all .
A morphism of frames is a poset morphism which preserves meets and joins, and hence preserves initial and terminal objects. The category of locales is the opposite of the frame category, and one uses the terms “frame” and “locale” interchangeably.
Example 1**.**
The interval of real numbers with , with the standard ordering, is a locale.
The poset imbeds in by the assignment . Then corresponds to the interval
[TABLE]
so that . Similarly,
[TABLE]
where is the least upper bound of the numbers .
Example 2**.**
The interval with the opposite ordering is also a locale. Here, in if and only if in .
In this case, imbeds in by the assignment . Then is the greatest lower bound of the and .
Observe that the posets and both have infinite meets, given by greatest lower bound and least upper bound, respectively.
Example 3**.**
The closed interval and its opposite are locales, and there are linear scaling isomorphisms and .
Example 4**.**
Suppose that are locales. Then the product poset
[TABLE]
is also a locale.
Suppose that is a locale. Following Barr (1986), a function is a fuzzy set over . These are the objects of a category , called the category of fuzzy sets over .
Suppose that is another such function. A morphism of consists of a function and a relation of functions taking values in the poset . The existence of the relation means precisely that in the poset for all .
There is a poset whose objects are the functions . If is another such function, then there is a relation if for all . Every function determines a restriction functor , so that there is a contravariant functor which is defined by associating the poset to the set .
Following Quillen (see Goerss and Jardine (2009), for example), a homotopy is a natural transformation between functors , which in the case at hand is given by the relations .
From this point of view, a morphism of is a morphism
[TABLE]
in the Grothendieck construction associated to the diagram of restriction functors, and the fuzzy set category is that Grothendieck construction.
Example 5**.**
All commutative diagrams
[TABLE]
correspond to morphisms of with identity homotopies in , but the full collection of fuzzy set morphisms is larger — these are the homotopy commutative diagrams.
Example 6**.**
Suppose that a finite set is a data set, and suppose that is a listing of the members of , where . Choose a number such that for all .
Here, is the distance between the points and in .
Let be an ordered set of points in . Write
[TABLE]
Suppose that is an ordinal number map. then , with equality if is surjective, or if is a degeneracy of . Further, if and only if is a degeneracy of a vertex.
The assignment defines a function
[TABLE]
on the set of -simplices of the simplicial set .
If is an ordinal number map, then the relation defines a homotopy commutative diagram
[TABLE]
or equivalently a morphism of fuzzy sets with values in the locale .
The ordering on the elements of the data set and the ambient distance function on combine to give the simplicial set the structure of a simplicial fuzzy set , with coefficients in the locale .
We shall write for henceforth to suppress notational dependence on the ordering . The homotopy types of the spaces are independent of the ordering on in any case. The simplicial fuzzy set associated to a data set therefore has the form .
A simplicial fuzzy set is a simplicial object in , meaning a contravariant functor on the category of finite ordinal numbers. This usage is standard: a simplicial object in a category is a functor . See Goerss and Jardine (2009).
The first appearance of simplicial fuzzy sets in the literature may be in Spivak’s preprint Spivak (2009) of 2009, where these objects are called fuzzy simplicial sets. The explicit interpretation of the Vietoris-Rips filtration as a simplicial fuzzy set that is presented in Example 6 seems to be new, but see the Healy-McInnes paper McInnes and Healy (2018).
Suppose that is a locale. Then is also a locale, where [math] is a new initial element.
Remark 7**.**
If then the object is no longer initial in . I normally write for the number (the original initial object of ) to distinguish this element from the initial object [math] of . Clearly, in .
Any locale has a Grothendieck topology, for which the covering families of are sets of objects such that . This relation is equivalent to the assertion that is the least upper bound in for all elements .
Given a family of elements , the associated sieve is the set of all elements such that for some . The sieve is covering if is a covering family.
Equivalently, an arbitrary sieve , i.e. a subset of the collection of elements which is closed under taking subobjects, is covering if .
Since has a Grothendieck topology, it has associated categories and of presheaves and sheaves on , respectively.
A presheaf is a functor , and a morphism of presheaves is a natural transformation.
One says that the presheaf is a sheaf if the map
[TABLE]
is an isomorphism for all covering sieves of all objects . This is equivalent to requiring that the diagram
[TABLE]
is an equalizer for all covering families of all objects . In other words, should be recovered from the values of by patching, for all coverings of .
Remark 8**.**
If [math] is an initial object of and is a sheaf on , then must be the one-point set. One writes to express this.
In effect, the empty sieve is covering, because [math] is an empty join. It follows that there is an isomorphism
[TABLE]
for any sheaf . Compare with (Jardine, 2015, p.35).
We are therefore entitled to categories and of presheaves and sheaves, respectively for the locale , and these are the examples that we will focus on.
Write for the full subcategory of the sheaf category , whose objects are the sheaves such that all restriction maps associated to relations in are monomorphisms. The requirement that the relation is in is important, because .
Barr constructs a functor Barr (1986)
[TABLE]
which defines an equivalence of categories. The existence of this equivalence of categories is the main result of Barr (1986) , and it appears as Theorem 12 below.
Explicitly, define
[TABLE]
If is a member of , define a presheaf by
[TABLE]
for , and set . Then the assignment defines a presheaf on such that every relation induces a monomorphism . The presheaf is a sheaf because if and only if for any covering family of .
If is a morphism of fuzzy sets (as above), then the relations in (i.e. the homotopy ) imply that if then , and so the function restricts to functions
[TABLE]
that are natural in , so that we have a sheaf homomorphism
[TABLE]
Remark 9**.**
is sometimes called the level cut description of the fuzzy set — see Dubois et al. (2000).
Example 10**.**
Suppose that the finite set is a data set, with ordering as in Example 6. Again, choose for all pairs of points .
Recall that the simplicial fuzzy set is defined for a simplex by
[TABLE]
Then, for ,
[TABLE]
which is the set of -simplices of such that . It follows that is the set of -simplices of the Vietoris-Rips complex for the data set .
The Vietoris-Rips complex functor is the simplicial sheaf that Barr’s construction associates to the simplicial fuzzy set .
There is an isomorphism
[TABLE]
for any sheaf , since is initial in . This colimit is filtered, and the canonical maps are monomorphisms.
The set of sections is the generic fibre of the object .
Lemma 11**.**
Suppose that is a sheaf of monomorphisms on and that . Then there is a unique maximum element such that .
Proof.
Consider all in such that , and let
[TABLE]
Then is covered by the elements , and so . ∎
Suppose again that . By Lemma 11, for each , there is a unique maximum such that . Define by setting . Then we have a function
[TABLE]
which is a fuzzy set.
To put it a slightly different way, the fuzzy set is defined by
[TABLE]
for , and .
Theorem 12** (Barr).**
The assignments and define an equivalence of categories
[TABLE]
Proof.
Suppose that is a sheaf of monomorphisms, and that , and let be the corresponding fuzzy set. Then
[TABLE]
as subsets of , so that there is a natural sheaf isomorphism
[TABLE]
Suppose that is a fuzzy set. Then and . If for some , then . It follows that . ∎
Example 13**.**
The representable functor on has the form
[TABLE]
Here, is the one-point set.
This presheaf is a sheaf, so the topology on is sub-canonical. The sheaf is a sheaf of monomorphisms. The corresponding fuzzy set, for , is the function which picks out the element .
The constant presheaf is defined to be a one-point set for all , with identity maps associated to all relations . This presheaf is a sheaf, and is a member of . This sheaf is represented by the terminal object , and so the corresponding fuzzy set is the function .
If in , then the induced sheaf map corresponds to the fuzzy set map from to which is given by the identity function on and the relation .
Example 14**.**
Suppose that is a simplicial set. The simplicial presheaf that is defined by
[TABLE]
is a simplicial sheaf of monomorphisms, and therefore represents a simplicial fuzzy set. There is a natural isomorphism
[TABLE]
for all simplicial sheaves (or presheaves) on . See also (Jardine, 2015, Sec. 2.3).
Lemma 15**.**
The category is complete. Limits are formed in the ambient sheaf category .
Proof.
This result follows from the fact that an inverse limit of monomorphisms is a monomorphism. ∎
Example 16**.**
Form the pullback diagram
[TABLE]
of sheaves on , with all in .
Take
[TABLE]
and suppose that .
Then and so that and . It follows that .
On the other hand, if , then there is a which restricts to and a which restricts to . Also, and in restrict to the same element of , so that , in and .
It follows that
[TABLE]
for all .
Another way of saying this is to assert that is the greatest lower bound of and .
Example 17**.**
Suppose that is a small diagram. For a fixed object , the -sections of are the -compatible families of elements in the various sets .
One can use the methods of the pullback case in Example 16 to show that is the greatest lower bound in of the elements .
3 Presheaves of monomorphisms
Suppose that is a locale. This section introduces the theory of presheaves of monomorphisms on the augmented locale .
If is an interval in a suitable sense, then all presheaves of monomorphisms on are separated, and the category of coverings for has a particularly simple form (Lemma 18). The associated sheaf for is a sheaf of monomorphisms in this case (Lemma 22).
Any presheaf on has an associated presheaf of monomorphisms , which is defined by taking images in a generic fibre (Lemma 26). This result immediately yields a colimit construction for sheaves of monomorphisms: take the usual presheaf-theoretic colimit, apply the image functor, and sheafify (Lemma 28). Examples of colimit constructions for fuzzy sets are discussed at the end of the section.
We now consider presheaves such that and all morphisms of induce monomorphisms . Such a presheaf is called a presheaf of monomorphisms.
Write for the category of presheaves of this form.
Most of the results of this section depend on the assumption that the locale is an interval in the sense that
has a total ordering, and
- 2)
the ordering is dense, meaning that if in , there is an such that .
The locales of immediate practical interest, such a closed interval and its opposite, are intervals in this sense.
Lemma 18**.**
Suppose that the locale is totally ordered. Then the covering sieves for are defined by the families of all such that or such that .
Proof.
Suppose that a covering sieve is generated by a set of elements , so that . Suppose that .
Suppose that . If is not bounded above by some then for all since is totally ordered, so that
[TABLE]
and we have a contradiction. It follows that for some , and so the relation is in . ∎
Remark 19**.**
The collection of all such that is the trivial covering sieve for , because it includes the identity relation on the object . Lemma 18 says that an element has at most two covering sieves if is totally ordered.
In order to be assured that has a non-trivial covering, or that the elements cover , we also need to know that satisfies condition 2) above, so that is an interval.
Example 20**.**
The total ordering on is necessary for the conclusion of Lemma 18.
The elements and define a covering of in , and the element is not bounded above by either or .
We shall assume that the locale is an interval for the rest of this section.
It follows from Lemma 18 that a presheaf on is a sheaf if and only if and the map
[TABLE]
is an isomorphism for all with not initial. There is no condition on for the initial object of is initial, and .
The assignment defines a presheaf on . Because has a total ordering and there are so few covering sieves for elements of , the presheaf is the universal separated presheaf associated to (Jardine, 2015, Lem 3.13).
In general, there is a canonical natural map for all presheaves , and is a sheaf if is separated. A presheaf is separated if the map is a sectionwise monomorphism.
Corollary 21**.**
If , then the map is a sectionwise monomorphism, so that is a separated presheaf and is its associated sheaf.
Lemma 22**.**
If , then . In particular, the associated sheaf functor
[TABLE]
restricts to a functor .
Proof.
Suppose that in . We show the restriction map
[TABLE]
is a monomorphism.
Given compatible families and for , if for , then and have the same image in for some , and so . ∎
Example 23**.**
Suppose that , let be a pointed set with base point . Define a presheaf by
[TABLE]
Set , where [math] is the new initial object of .
If the induced map is the inclusion of the base point of , and if in then is the identity on . Then is the set and not the base point in general, so that is a presheaf of monomorphisms, and is not a sheaf.
Example 24**.**
Suppose that is a list of objects in . Then the disjoint union is in . Note that we must set for this to work.
Example 25**.**
Suppose that are subobjects of a fixed object , so that all are in . Then the (sectionwise) union is a subobject of , and is also in .
It follows that the category of subobjects of an object is a locale.
Suppose that is a presheaf on . The epi-monic factorizations of the maps for determine subobjects with commutative diagrams
[TABLE]
for . Set .
If is in , then the maps are isomorphisms. These constructions are functorial in presheaves .
We therefore have the following:
Lemma 26**.**
There is a natural presheaf map such that is in . This map is initial among all maps with , and so there is a natural bijection
[TABLE]
so that the functor is left adjoint to the inclusion of in the presheaf category on .
Corollary 27**.**
Suppose that is a presheaf on . Then the morphism is initial among all presheaf maps such that is in .
Proof.
The object is the sheaf associated to and it is a sheaf of monomorphisms by Lemma 22. Use also the adjointness assertion of Lemma 26. ∎
Colimits of fuzzy sets can be described by the following result:
Lemma 28**.**
Suppose that is a small diagram in the category of sheaves with monomorphisms on . Form the colimit
[TABLE]
in , and let be the corresponding fuzzy set. Then
[TABLE]
where the index is over all pairs such that under a composite of the form
[TABLE]
Proof.
We have
[TABLE]
and it follows that every is in the image of some composite (3).
Suppose that under the composite (3). Then
[TABLE]
This is true for all such pairs so that
[TABLE]
Suppose that lifts to , where is maximal. The element is in the image of some composite
[TABLE]
for all . This means that there is an element which maps to under the composite above, and so for all . It follows that
[TABLE]
∎
Remark 29**.**
Colimits of fuzzy sets and the left adjoint of the inclusion functor
[TABLE]
are described in Lemma 1.3 of Spivak’s preprint Spivak (2009). In the present notation, that left adjoint is the functor . The cocompleteness of the category of fuzzy sets follows from the cocompleteness of the sheaf category and the existence of the left adjoint of the inclusion.
Example 30**.**
Form the union of two subsheaves of a sheaf . Then there is a pushout diagram
[TABLE]
in . Here, is the sheaf that is associated to the presheaf union , which is in . Note that
[TABLE]
by the construction of . It follows from Lemma 28 that
[TABLE]
4 Stalks
Again, suppose that is a locale. Boolean localization theory involves a poset monomorphism which takes values in a complete Boolean algebra, and induces a geometric morphism
[TABLE]
having an inverse image functor which is fully faithful.
The poset morphism is relatively easy to describe, and the construction is reprised at the beginning of this section.
If is an interval, then the Boolean algebra can be identified with the power set on the subset of that remains after removing the terminal object . This leads immediately to a theory of stalks for sheaves and presheaves on (Example 31, Lemma 32, Lemma 34). These stalks have a simple construction in this case, and the expected behaviour of this theory can be verified directly (Lemma 32).
This theory applies to the map of Vietoris-Rips systems that is associated to an inclusion of data sets — this is discussed in Example 35. The present theory of stalks is used to show that the map is a local weak equivalence of simplicial sheaves on the locale ( sufficiently large) if and only if as data sets.
Following (Jardine, 2015, p.51) and Mac Lane and Moerdijk (1994), for , write
[TABLE]
The subobject of is defined to be the set of all such that . There is a frame morphism which is defined by , since for all .
For , write (as above) for the sublocale of objects with . There is a homomorphism which is defined by .
Let denote the composite frame morphism
[TABLE]
Then one knows (see, for example, (Jardine, 2015, p.52)) that is a monomorphism and that
[TABLE]
is a complete Boolean algebra.
Note that and that the morphism is the identity.
The corresponding geometric morphism
[TABLE]
is a Boolean localization of . In particular, the inverse image functor
[TABLE]
is faithful, and is thus a fat point for the topos .
The fat point assertion means that a map of sheaves on is an monomorphism (respectively epimorphism, isomorphism) if and only if the induced map is a monomorphism (respectively epimorphism, isomorphism) of sheaves on . See (Jardine, 2015, Sec. 3.4) or Jardine (1996).
Example 31**.**
Suppose that is totally ordered. If and , then forces . Thus,
[TABLE]
The corresponding Boolean algebra
[TABLE]
is isomorphic to the power set of , so that the sheaf category has enough points.
The poset map takes to if and takes to if . It follows that the composite
[TABLE]
takes to if and takes to if . The poset map therefore has the form
[TABLE]
for .
For , the stalk of a sheaf on is defined by
[TABLE]
This colimit corresponds to the category of inclusions , and so is the evaluation of the sheaf at the set .
The locale has a total order if has a total order. For the object [math], the stalk is isomorphic to the generic fibre:
[TABLE]
since is the initial object of . The stalk
[TABLE]
is more “conventional”.
The following result is true by formal nonsense, given that we have a theory of stalks for sheaves on for a totally ordered locale in Example 31. The point of Lemma 32 (and its proof) is that it is easier to show directly that these stalks have the right properties in cases that one cares about for Data Science applications.
Lemma 32**.**
Suppose that the locale is an interval and that the map is a stalkwise epimorphism (respectively stalkwise monomorphism, stalkwise isomorphism) of sheaves of monomorphisms on . Then the map is an epimorphism (respectively monomorphism, isomorphism) of sheaves.
One says that a map of sheaves on is a stalkwise epimorphism if the induced functions are surjective for all . Similarly, stalkwise monomorphisms (respectively stalkwise isomorphisms) are defined by the requirement that all induced functions in stalks are injective (respectively bijective).
Proof of Lemma 32.
Suppose that the map is a stalkwise epimorphism.
By the observation in Example 31, there is a natural isomorphism for all sheaves on , so that the map is an epimorphism.
Suppose that . Then the collection of relations is a covering family. Take and let be its image under the restriction map , where . Then represents an element of , and the map is an epimorphism. It follows that there is an element such that . This means that the sheaf map is a local epimorphism (Jardine, 2015, Sec. 3.2), and it is therefore an epimorphism of sheaves.
If is a stalkwise monomorphism, then the map is a monomorphism. For each there is a commutative diagram
[TABLE]
The horizontal morphisms are monomorphisms since and are sheaves of monomorphisms, so the map is a monomorphism. This is true for all , and so the sheaf map is a monomorphism.
If the map is a stalkwise isomorphism, then it is both a stalkwise epimorphism and a stalkwise monomorphism, so that is an epimorphism and a monomorphism of sheaves by the previous paragraphs. It follows that is an isomorphism of sheaves. ∎
Example 33**.**
Suppose that the locale
[TABLE]
is a product of intervals .
The construction of the locale morphism (4) preserves products, so that the sheaf category again has enough points.
The poset map has the form
[TABLE]
and takes to the disjoint union .
If and is a sheaf on , then
[TABLE]
In effect, the collection of all -tuples with is cofinal in the collection of all -tuples with .
It follows that is the stalk at of the restriction of along the poset morphism
[TABLE]
which is defined by .
We now show that the category of presheaves of sets on an interval has a theory of stalks that specializes to the definition of stalks for sheaves on that we have from Example 31 and Lemma 32, and such that the associated sheaf map is a stalkwise isomorphism for all presheaves .
The theory of stalks for presheaves on and interval is analogous to the theory of stalks for presheaves on a topological space, and the theory of stalks for presheaves on the étale site of a scheme.
Lemma 34**.**
Suppose that the locale is an interval, and let be a presheaf on . Define
[TABLE]
for all . Then we have the following:
The set is the stalk at as in (5) if is a sheaf on .
- 2)
The associated sheaf map induces bijections for all .
- 3)
A map of presheaves induces bijections for all if and only if the map of associated sheaves is an isomorphism.
Proof.
Write so that the poset morphism of Example 31 has the form .
The direct image (restriction) functors and inclusion functors for the various presheaf and sheaf categories fit into a commutative diagram
[TABLE]
There is a natural isomorphism of left adjoint functors
[TABLE]
that is induced by the associated sheaf map . Here, is the left Kan extension of the restriction functor on the presheaf level.
By definition of the left Kan extension of , we have an isomorphism
[TABLE]
for all .
It follows that for all presheaves and . Observe also that is the stalk of at which is defined in (5) if is a sheaf, so that statement 1) holds.
For and a presheaf on the power set , the associated sheaf map induces a bijection
[TABLE]
It follows that the functions
[TABLE]
are bijections for all presheaves on and , giving statement 2).
Statement 3) follows from Lemma 32. Alternatively, statement 3) is a consequence of statements 1) and 2), and the fact that the inverse image functor is fully faithful. ∎
Example 35**.**
Suppose, as in Example 10, that is a data set, with ordering , and choose for all pairs of points .
The association for defines a simplicial sheaf (of Vietoris-Rips complexes) of monomorphisms on the totally ordered locale . The stalk for is defined by
[TABLE]
where the indicated ordering is that of .
Note that
[TABLE]
because we have chosen for all pairs of points .
Observe as well that for small numbers , the stalk is the discrete space on the set .
Suppose that are data sets and for all pairs of points (hence in ). Then the inclusion defines a map of simplicial sheaves (of monomorphisms) . This map is a local weak equivalence if and only if , because and are discrete for small numbers .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Barr [1986] Michael Barr. Fuzzy set theory and topos theory. Canad. Math. Bull. , 29(4):501–508, 1986. ISSN 0008-4395. https://doi.org/10.4153/CMB-1986-079-9 . · doi ↗
- 2Blumberg and Lesnick [2017] Andrew J. Blumberg and Michael Lesnick. Universality of the homotopy interleaving distance. ar Xiv , 1705.01690, 2017. ar Xiv:1705.01690 .
- 3Carlsson and Mémoli [2010] Gunnar Carlsson and Facundo Mémoli. Characterization, stability and convergence of hierarchical clustering methods. J. Mach. Learn. Res. , 11:1425–1470, 2010. ISSN 1532-4435.
- 4Dubois et al. [2000] Didier Dubois, Walenty Ostasiewicz, and Henri Prade. Fuzzy sets: history and basic notions. In Fundamentals of fuzzy sets , volume 7 of Handb. Fuzzy Sets Ser. , pages 21–124. Kluwer Acad. Publ., Boston, MA, 2000. https://doi.org/10.1007/978-1-4615-4429-6_2 . · doi ↗
- 5Goerss and Jardine [2009] Paul G. Goerss and John F. Jardine. Simplicial homotopy theory . Modern Birkhäuser Classics. Birkhäuser Verlag, Basel, 2009. ISBN 978-3-0346-0188-7. https://doi.org/10.1007/978-3-0346-0189-4 . Reprint of the 1999 edition. · doi ↗
- 6Jardine [1996] John F. Jardine. Boolean localization, in practice. Documenta Mathematica , 1:245–275, 1996. ISSN 1431-0635.
- 7Jardine [2008] John F. Jardine. Local persistence: homotopy theory of filtrations. Oberwolfach Reports , 5(3):1623–1625, 2008.
- 8Jardine [2015] John F. Jardine. Local Homotopy Theory . Springer Monographs in Mathematics. Springer-Verlag, New York, 2015. https://doi.org/10.1007/978-1-4939-2300-7 . · doi ↗
