Broken family sensitivity in transitive systems (Q2122199)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Broken family sensitivity in transitive systems
scientific article

    Statements

    Broken family sensitivity in transitive systems (English)
    0 references
    0 references
    0 references
    6 April 2022
    0 references
    Let \((X, T)\) be a dynamical system, \(n \geq 2\) and \(\mathcal F\) be a Furstenberg family of subsets of \(\mathbb Z_+\). A new kind of sensitivity is defined: Definition. \((X, T)\) is broken \(\mathcal F\)-\(n\)-sensitive if there exist \(\delta >0\) and \(F\in \mathcal F\) such that for every open nonempty subset \(U\subset X\) and every \(l\in \mathbb N\) there exist \( x^l_1, x^l_2,\dots, x^l_n \in U\) and \(m_l\in \mathbb Z_+\) with \[ \min_{1\leq i <j \leq n} d(T^k x^l_i, T^k x^l_j ) >\delta, \forall k\in m_l +F\cap [1,l]. \] Denote by \(\mathcal F_{inf}\) the family of all infinite subsets of \(\mathbb Z_+\), \(\mathcal F_{ps}\)-piecewise syndetic sets and \(\mathcal F_{pubd}\) all positive upper Banach density subsets, respectively. There are two main results for transitive \((X,T)\): (1) If \(\mathcal F =\mathcal F_{ps}\) or \(\mathcal F =\mathcal F_{pubd}\) then \((X, T)\) is broken \(\mathcal F\)-\(n\)-sensitive iff there exists an essential \(n\)-sensitive tuple which is an \(\mathcal F\)-recurrent point of \((X^n, T^{(n)})\); (2) \((X, T)\) is broken \(\mathcal F_{inf}\)-\(n\)-sensitive iff an essential \(n\)-sensitive tuple \((x_1,x_2,\dots,x_n)\) in \((X,T)\) such that \[ \limsup_{k\to \infty} \min_{1\leq i <j \leq n} d(T^kx_i,T^kx_j) >0. \] Some properties are obtained by analyzing the factor maps and their maximal equicontinuous factors. Relations to different notions of sensitivity are also discussed.
    0 references
    sensitivity
    0 references
    recurrent points
    0 references
    Furstenberg family
    0 references
    transitivity
    0 references
    sensitive tuples
    0 references
    maximal equicontinuous factor
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers