Characterizing bounded orthogonally additive polynomials on vector lattices (Q1721764)

From MaRDI portal
Revision as of 10:55, 17 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129216905, #quickstatements; #temporary_batch_1723888233194)
scientific article
Language Label Description Also known as
English
Characterizing bounded orthogonally additive polynomials on vector lattices
scientific article

    Statements

    Characterizing bounded orthogonally additive polynomials on vector lattices (English)
    0 references
    12 February 2019
    0 references
    Let $E$ be a uniformly complete Archimedean vector lattice and $Y$ a convex bornological vector space. The authors improve results of \textit{Z. A. Kusraeva} [Vladikavkaz. Mat. Zh. 16, No. 4, 49--53 (2014), \url{http://www.vmj.ru/articles/2014_4_6.pdf}] by showing that, for a bounded, orthogonally additive $n$-homogeneous polynomial $P:E \to Y,$ not only the following equalities are valid but, in fact, these two equalities characterize such polynomials: \[ P(\mathfrak{S}_n)(f_1,\dots,f_r)) = P(f_1) + \cdots + P(f_r), \] \[ P(\mathfrak{G}_n(f_1,\dots,f_n)) = \check{P}(f_1,\dots,f_n). \] Here, $r \in \mathbb{N}$, $f_1, f_2,\dots \in E^+$, $\mathfrak{S}_n$ (resp., $\mathfrak{G}_n$) denotes the $n^{th}$ root mean power (resp., $n^{th}$ geometric mean), and $\check{P}$ denotes the unique symmetric $n$-linear map associated to $P$. In addition, by using the complexification of $\check{P}$, they provide new formulae for bounded orthogonally additive polynomials. \par Reviewer's remark: The reader may be interested in a related work by \textit{C. Boyd} et al. [``Geometry of spaces of orthogonally additive polynomials on $C(K)$'' (to appear; \url{arXiv:1807.02713})].
    0 references
    vector lattice
    0 references
    orthogonally additive polynomial
    0 references
    geometric mean
    0 references
    root mean power
    0 references
    complexification
    0 references
    0 references
    0 references

    Identifiers

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