Measures related to \((\varepsilon,n)\)-complexity functions (Q945427)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Measures related to \((\varepsilon,n)\)-complexity functions
scientific article

    Statements

    Measures related to \((\varepsilon,n)\)-complexity functions (English)
    0 references
    0 references
    0 references
    12 September 2008
    0 references
    Let \((X,d)\) be a compact metric space, \(S\subset X\) and \(f : X\setminus S\to X\) be a continuous map. Let \(D:=\bigcup_{i=0}^\infty f^{-i}S\) and define a sequence of distances \(d_n(x,y):=\max_{0\leq i\leq n-1} d(f^{i}x,f^{i}y)\), \(n\in\mathbb{N}\). Fix \(\varepsilon>0\) and \(n\in\mathbb{N}\). A set \(Y\subset X\setminus D\) is said to be \((\varepsilon,n)\)-separated if \(d_n(x,y)\geq\varepsilon\) for any pair \(x,y\in Y\) with \(x\neq y\). Given \(A\subset X\setminus D\), the quantity \(C_{\varepsilon,n}(A):=\max\{|Y|: Y\subset A\) is \((\varepsilon,n)\)-separated\}, where \(|Y|\) denotes the cardinality of \(Y\), is called the \((\varepsilon,n)\)-complexity of the set \(A\). An \((\varepsilon,n)\)-separated set \(Y\) is called \((\varepsilon,n)\)-optimal if \(|Y|=C_{\varepsilon,n}(X-D)\). The authors define measures reflecting the asymptotic behavior of the \((\varepsilon,n)\)-complexity as \(n\to\infty\) in the following way. Denote by \(C(X)\) the space of all continuous real-valued functions on \(X\). Consider an optimal \((\varepsilon,n)\)-separated set \(A_{\varepsilon,n}\) and introduce the functional \(I_{\varepsilon,n}(\varphi):=\frac{1}{C_{\varepsilon,n}} \sum_{x\in A_{\varepsilon,n}}\varphi(x)\) for any \(\varphi\in C(X)\). Fix an arbitrary non-proper ultrafilter \({\mathcal F}\). Using the limit of a sequence with respect to a filter, define a positive bounded linear functional \(I_\varepsilon(\varphi):=\lim_{{\mathcal F}}I_{\varepsilon,n}(\varphi)\) on \(C(X)\). The corresponding regular Borel measure \(\mu:=\mu_{\varepsilon,{\mathcal F},A_{\varepsilon,n}}\), which may depend on the choice of \(\varepsilon\), the ultrafilter \({\mathcal F}\), and optimal sets \(A_{\varepsilon,n}\), is called the measure related to the \((\varepsilon,n)\)-complexity. This paper is a continuation of the study that the authors started in their previous work~[Taiwanese J. Math. 9, 397--409 (2005; Zbl 1094.28008)], and contains some properties concerning the invariance and non-invariance of the above measure \(\mu\) related to the \((\varepsilon,n)\)-complexity.
    0 references
    0 references
    0 references
    topological entropy
    0 references
    complexity functions
    0 references
    separability
    0 references
    0 references
    0 references