Maximal lineability of the classes of functions in the algebra of Darboux-like maps that are Darboux but not connectivity (Q2116802)

From MaRDI portal





scientific article; zbMATH DE number 7493074
Language Label Description Also known as
default for all languages
No label defined
    English
    Maximal lineability of the classes of functions in the algebra of Darboux-like maps that are Darboux but not connectivity
    scientific article; zbMATH DE number 7493074

      Statements

      Maximal lineability of the classes of functions in the algebra of Darboux-like maps that are Darboux but not connectivity (English)
      0 references
      18 March 2022
      0 references
      A function \(f:\mathbb{R}\rightarrow\mathbb{R}\) has the intermediate value property provided that if \(p\) and \(q\) are real numbers such that \(p\neq q\) and \(f(p)<f(q)\), then for every \(y\in(f(p),f(q))\) there exists \(x\) between \(p\) and \(q\) satisfying \(f(x)=y.\) Nowadays these functions are called Darboux functions and the set of all such functions is denoted by \(\mathcal{D}.\) When the graph of \(f:\mathbb{R}\rightarrow\mathbb{R}\) is a connected subset of \(\mathbb{R} ^{2},\) \(f\) is called connectivity function and the set of all such functions is denoted by \(\mathrm {Conn}\). Denoting by \(\mathfrak{c}\) the cardinality of the continuum, the authors prove the \(2^{\mathfrak{c}}\)-lineability of all non-empty classes of functions in the algebra \(\mathcal{A}(\mathbb{D})\) of Darboux-like maps that are contained in \(\mathcal{D}\backslash \mathrm {Conn}.\) The techniques used in the paper are more delicate than the usual arguments found in this framework and rely on the existence of algebraically independent subsets of \(\mathbb{R}\) with suitable structures.
      0 references
      lineability
      0 references
      Darboux-like maps
      0 references
      algebraically independent sets
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

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