Quasi-metric properties of complexity spaces (Q1807591)

From MaRDI portal
Revision as of 04:46, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Quasi-metric properties of complexity spaces
scientific article

    Statements

    Quasi-metric properties of complexity spaces (English)
    0 references
    3 August 2000
    0 references
    Recall that a quasi-uniform space \((X,{\mathcal U})\) is bicomplete iff the uniform space \((X,{\mathcal U}^s)\) is complete, where \({\mathcal U}^s:={\mathcal U}\vee{\mathcal U}^{-1}\); it is Smyth-completeable iff every left K-Cauchy filter on \((X,{\mathcal U})\) is a Cauchy filter on \((X,{\mathcal U}^s)\). The complexity space \(C:= \{f: \omega\to (0,+\infty]\); \(\sum (2^{-n} f(n)^{-1}< \infty\}\) with the quasi metric \(\rho(f,g):= \sum 2^{-n} \max\{ g(n)^{-1}- f(n)^{-1},0\}\) and its dual space \(C^*:= \{f:\to \mathbb{R}\); \(\sum 2^{-n} f(n)<+\infty\}\) with the quasi-metric \(\rho^*(f,g):= \sum 2^{-n} \max\{g(n)- f(n),0\}\) are discussed in this paper. It is shown that the quasi-uniform space associated with \((C^*, \rho^*)\) is Smyth-complete and consequently is a Baire space. For a closed \({\mathcal F}\subseteq C^*\) and for \(m\in C^*\) the space \({\mathcal F}_m:= \{f\in{\mathcal F}\); \(m\) is an upper bound for \(f\}\) with metric \(\rho^s(f,g):= \rho^*(f,g)+ \rho^*(g,f)\) turns out to be a compact metric space. The paper is nicely written, but the reader (like the reviewer) would have appreciated a little more self-containedness. The computational significance of the results are far from being clear and might have been pointed out in greater detail by the authors.
    0 references
    Smyth-completeness
    0 references
    quasi-uniform space
    0 references
    complexity space
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references