Not signed in (Sign In)

Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

  • Sign in using OpenID

Site Tag Cloud

2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry book bundles calculus categorical categories category category-theory chern-weil-theory cohesion cohesive-homotopy-type-theory cohomology colimits combinatorics complex complex-geometry computable-mathematics computer-science constructive cosmology deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry digraphs duality elliptic-cohomology enriched fibration foundation foundations functional-analysis functor gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck group group-theory harmonic-analysis higher higher-algebra higher-category-theory higher-differential-geometry higher-geometry higher-lie-theory higher-topos-theory homological homological-algebra homotopy homotopy-theory homotopy-type-theory index-theory integration integration-theory internal-categories k-theory lie-theory limits linear linear-algebra locale localization logic mathematics measure measure-theory modal modal-logic model model-category-theory monad monads monoidal monoidal-category-theory morphism motives motivic-cohomology nlab noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory pages pasting philosophy physics pro-object probability probability-theory quantization quantum quantum-field quantum-field-theory quantum-mechanics quantum-physics quantum-theory question representation representation-theory riemannian-geometry scheme schemes set set-theory sheaf simplicial space spin-geometry stable-homotopy-theory stack string string-theory superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory tqft type type-theory universal variational-calculus

Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.

Welcome to nForum
If you want to take part in these discussions either sign in now (if you have an account), apply for one now (if you don't).

nLab > Latest Changes: convergence space

Bottom of Page

1 to 14 of 14

  1.  

  1. Added section on Cluster spaces, which generalize Convergence spaces.

    Anonymous

    diff, v29, current

    • CommentRowNumber2.
    • CommentAuthorGuest
    • CommentTimeDec 1st 2019
    In the definition of "continuous" it says:

    f(F) is the filter generated by the filterbase {F(A)|A∈F},

    but it seems to me that it should be {f(A)|A∈F}, (note lower case).

    -- Keith (Programmer in Chief, Free Computer Shop, www.free-comp-shop.com)
    • CommentRowNumber3.
    • CommentAuthorTodd_Trimble
    • CommentTimeDec 2nd 2019

    Thanks, Keith – I’ve made the correction.

    diff, v30, current

    • CommentRowNumber4.
    • CommentAuthorGuest
    • CommentTimeDec 14th 2019

    I don’t actually know the correct definition, but my spider sense tells me that in

    “2. Isotone: If F⊇GF \supseteq G and F⇝xF \rightsquigarrow x, then G⇝xG \rightsquigarrow x;”

    the ⊇\supseteq should be ⊆\subseteq.

    – Keith again

    • CommentRowNumber5.
    • CommentAuthorGuest
    • CommentTimeDec 14th 2019
    Sorry, I'm already starting to doubt my previous comment.

    If the definition is, in fact, correct as written, then take it as a
    request for some explanation of why isotone in a cluster space
    is backward from that in the definition of convergence space.

    -- Keith
    • CommentRowNumber6.
    • CommentAuthorTobyBartels
    • CommentTimeDec 15th 2019

    It's hard to converge to a point but easy to cluster to it. One way to phrase isotony for convergence is that a filter FF converges to a point xx iff every refinement of FF converges to xx. Now, by definition (in a convergence space), FF clusters to xx iff some proper refinement of FF converges to xx; but because refinement is transitive, it follows that FF clusters to xx iff some refinement of FF clusters to xx. So that's reverse isotony for clustering.

    For a specific example, let FF be the filter generated by the tails of the constant sequence (0,0,0,0,…)(0,0,0,0,\ldots) and let GG be the filter generated by the tails of the sequence (0,1,0,1,…)(0,1,0,1,\ldots). (Specifically, A∈FA \in F iff 0∈A0 \in A, and A∈GA \in G iff 0,1∈A0, 1 \in A.) We have G⊆F→0G \subseteq F \to 0 but not G→0G \to 0, so isotony can't run that way for convergence. But we have F⊇G⇝1F \supseteq G \rightsquigarrow 1 but not F⇝1F \rightsquigarrow 1, so isotony can't run that way for clustering.

    • CommentRowNumber7.
    • CommentAuthorTobyBartels
    • CommentTimeDec 15th 2019

    The definition of cluster space seems to be ignoring the improper filter, so I added a missing axiom to take care of that.

    diff, v31, current

    • CommentRowNumber8.
    • CommentAuthorTobyBartels
    • CommentTimeDec 16th 2019

    I tried to make cluster spaces work constructively, but I haven't managed to do so yet. (The directedness axiom is the problem.)

    diff, v34, current

    • CommentRowNumber9.
    • CommentAuthorFreeChief
    • CommentTimeDec 16th 2019
    It's me again, I got an account.

    I don't know what "Isotone" means. Google and Wikipedia say stuff about nuclear physics and cell biology. The mathematical use of the word seems to be a pointless variant of "Monotone".

    I suggest changing the word "Isotone" to "Upper" in the definition of convergence space, and "Lower" in the definition of cluster space. The set of filters converging to "x" is an Upper Set in the poset of filters over "S" ordered by inclusion (and Lower in a cluster space).

    These terms are semi-standard [1,2], more accurate, and easier to understand.

    -- Keith (Programmer in Chief)

    [1] Johnstone, Stone spaces
    [2] Gierz, et.al. Scott, Continuous Lattices and Domains
    • CommentRowNumber10.
    • CommentAuthorTobyBartels
    • CommentTimeDec 18th 2019

    DOI for Muscat

    diff, v35, current

    • CommentRowNumber11.
    • CommentAuthorTobyBartels
    • CommentTimeDec 18th 2019

    Hi Keith!

    There are two meanings of ‘isotone’ in the literature (as far as I've seen):

    • for a map between any two p(r)osets, a synonym of ‘monotone’ or ‘monotone increasing’: f(x)≤f(y)f(x) \leq f(y) if x≤yx \leq y,
    • for a map from a p(r)oset to itself, the condition that the map has a unit: x≤f(x)x \leq f(x) always.

    Either way, ‘antitone’ means the opposite (montone decreasing, or with a counit). This gives ‘antitone’ two meanings as well, although I think that this word gets more usage (mostly in its first meaning).

    As a synonym of ‘monotone’, it's not entirely useless, since people sometimes use ‘monotone’ to meaning either increasing or decreasing, while ‘isotone’ only means increasing. (Compare why ‘monotone’ itself is not a useless synonym of ‘increasing’: sometimes people use that to mean strictly increasing.) With the other meaning, it's not useless at all; unfortunately, the two meanings clash. (They are related; given f:X→Xf\colon X \to X, you get a map from ℕ\mathbb{N} to X→XX \to X that takes nn to f nf^n; this map is monotone increasing iff ff has a unit.) You can see both ‘monotone’ and ‘isotone’ (with the second meaning) used together at Moore closure#InTermsOfClosureOperators.

    In this case, the meaning is the first, so why not say ‘monotone’? My only answer is that the literature on convergence spaces says ‘isotone’ (at least as far as I've seen1). It seems particularly perverse to use it in the axioms for clustering spaces, since this is actually decreasing, so we should say ‘antitone’. (Muscat, the original reference on cluster spaces, does not use any term for this; it was introduced by whoever made the anonymous edit putting this subject on the Lab). And since we're thinking of these more as relations between ℱX\mathcal{F}X and XX rather than as maps from ℱX\mathcal{F}X to 𝒫X\mathcal{P}X, ‘upper’ and ‘lower’ might be even better, as you said.

    And all of this terminology can be especially problematic here, because people don't always agree on the natural order on the set of filters! Subset inclusion is the most obvious, but there is a case to be made that refinement is more appropriate, and this is containment, the reverse of inclusion. I believe that I've even seen literature that defined F≤GF \leq G (for filters FF and GG) to mean F⊇GF \supseteq G (although I might be thinking of something else). That's actually a case for using ‘monotone’, because it allows for this ambiguity.

    For now, I'll change ‘isotone’ to ‘antitone’ in the definition of cluster spaces. You can make the case that it's isotone, because filters should be ordered by refinement, but then you shouldn't use that word for convergence spaces as well. But I could easily see using ‘monotone’ for both of them, especially if we can find some literature on convergence spaces that already does this. I think that ‘lower’ and ‘upper’ would be more confusing than ‘monotone’ without context, so I really wouldn't want to use them unless, again, we have some literature on convergence spaces that already uses ‘upper’ in this way.

    1. Or are you citing Johnstone and Gierz as using ‘upper’ and ‘lower’ in a discussion of convergence spaces? If you're simply citing them for ‘upper set’ and ‘lower set’, then I agree, that's standard, and we use those terms on the Lab. But if they use them as a term for this condition in a convergence space, then that would be even better. Even the intermediate case, as terminology for a property of a relation between a p(r)oset and a set, would be good. ↩

    • CommentRowNumber12.
    • CommentAuthorFreeChief
    • CommentTimeDec 21st 2019

    Hi,

    for a map between any two p(r)osets, a synonym of ‘monotone’

    I guess that p(r)oset means either poset or proset, and that proset means pre-ordered set. I definitely approve of that term; I thought I invented it myself after reading some category theorist who wanted to re-define “poset” on the grounds that it is un-categorical to force iso to be equal. I never published, or even told anyone, so it’s good to see that others heve thought of it too.

    On the other hand, why do we need a synonym of monotone? Every child knows what monotone means. Say “increasing” once for clarity, and then drop it.

    for a map from a p(r)oset to itself, the condition that
the map has a unit: $x \leq f(x)$ always.

    I would call such a map ’inflationary’. I think I read that somewhere, but I don’t have a reference handy.

    But what do either of those meanings have to do with axiom 2?

    Or are you citing Johnstone and Gierz as using ‘upper’
and ‘lower’ in a discussion of convergence spaces?
If you're simply citing them for ‘upper set’ and ‘lower set’,

    The later. Specifically, let S xS_x be the set of filters that converge to xx, S x={F|F→x}S_x = \{F | F \to x \}. For every xx, S xS_x is an upper set in the poset of filters ordered by inclusion (or refinement). That is exactly part 2. of the definition.

    Where is the monotone function?

    Subset inclusion is the most obvious, but there is a case
to be made that refinement is more appropriate, and this
is containment, the reverse of inclusion.

    Why do you say that? For both a topology (set of open sets) and a filter (subset of P(X)P(X)) the finer includes the coarser as a subset[1]. Do you have some reason to want to say fine ≤\le coarse? I think more refined is greater.

    [1] Steen \& Seebach, Counterexamples in Topology

    • CommentRowNumber13.
    • CommentAuthorTobyBartels
    • CommentTimeJan 7th 2020

    But what do either of those meanings have to do with axiom 2?

    Where is the monotone function?

    The convergence relation defines a map from ℱX\mathcal{F}X (the sets of filters on XX) to the 𝒫X\mathcal{P}X (the power set of XX), and this is the map that (2) says is monotone.

    Do you have some reason to want to say fine ≤\leq coarse?

    In ordinary language, something fine is smaller than something coarse. For fine and coarse filters, it's really that the fine filter is made of smaller sets than the coarse filter. But that's what this convention is meant to achieve: the lattice of filters behaves like the sets inside the filters. For example, the improper filter is the bottom element, rather than the top, and this matches that it owns the empty set, which is the bottom subset; in other words, a proper filter, one in which each element is positive (inhabited, nonempty), is itself positive (not the bottom) in the lattice of filters. Conversely, the top filter is the one that owns only the top subset. Similarly, the meet of FF and GG is {A∩B|A∈F,B∈G}\{A \cap B \;|\; A \in F,\; B \in G\}, while the join is generated by {A∪B|A∈F,B∈G}\{A \cup B \;|\; A \in F,\; B \in G\}. (Thus, both of these have been written as F∨GF \vee G; and both of them have also been written as F∩GF \cap G. Having different conventions can certainly be confusing!)

    I think that it's even nicer for filterbases. If FF and GG are filterbases, and FF is a refinement of GG, then it's not necessarily true that F⊇GF \supseteq G, but it is true that for each AA in FF, for some BB in GG, A⊆BA \subseteq B, and this is reflected in writing F≤GF \leq G. FF is positive (not a bottom, proper) iff for each AA in FF, AA is positive (inhabited, not empty); FF is a bottom (improper) iff for some AA in FF, AA is empty. The meet of FF and GG is still {A∩B|A∈F,B∈G}\{A \cap B \;|\; A \in F,\; B \in G\}, and now the join of FF and GG is precisely {A∪B|A∈F,B∈G}\{A \cup B \;|\; A \in F,\; B \in G\}. (Of course, filterbases form a proset rather than a poset, so meets and joins are only defined up to equivalence, but these operations give one a canonical meet and join that work.)

    • CommentRowNumber14.
    • CommentAuthorFreeChief
    • CommentTimeJan 16th 2020

    OK, that makes sense. I’m not sure I will adopt the terminology, but I am done discussing it for a while.

    I came to this web page while reading a paper [1] which defines a filter space in terms of an operation which associates, to each point, a collection of filters. This page uses the equivalent formulation in terms of a relation between filters and points.

    But a relation R⊆A×BR \subseteq A \times B can be seen as a function in two ways: R +1:𝒫A←BR^{+1}: \mathcal{P}A \leftarrow B and R −1:A→𝒫BR^{-1}: A \rightarrow \mathcal{P}B. If AA is a p(r)oset then the range of R +1R^{+1} comprises only upper sets iff R −1R^{-1} is monotone. It seems that I was thinking of one of those functions while you were thinking of the other.

    I wonder if it would help to be more idealistic (instead of filteristic) or whether we are doomed by the extended Yoneda Lemma:

    A category embeds covariantly into a contravariant functor category, and contravariantly into a covariant functor category, and furthermore, no matter how you bang on it to try to straighten it out, it will be contra-something.

    [1] Hyland, Filter Spaces and Continuous Functionals, Ann. Math. Logic 16 (1979)

    — Keith Wright

1 to 14 of 14

  1.