×

Imbedding of kernels by regular transformations. (English. Russian original) Zbl 0561.40005

Ukr. Math. J. 36, 500-503 (1984); translation from Ukr. Mat. Zh. 36, No. 5, 662-666 (1984).
The transformations in question are generalizations of the matrix transformations of summability theory. Let K(u) be the Knopp kernel of the function u, and say that an operator A generates an embedding of kernels (or embedding of bounded kernels) if for every x (or bounded x) K(A(x))\(\subset K(x)\). Theorem 1: a linear regular operator A generates an embedding of bounded kernels if and only if \(\| A\| =1\) (where \(\| A\| =\inf \{c\geq 0,\| A(x)\| \leq c\| x\| \}\) and \(\| x\| = \limsup| x(s)|)\). An operator A has property (K) if for every x such that \(0\in K(A(x))\) there is a function \(z(s)\to +\infty\) such that \(0\in K(A(zx))\). Theorem 2. Every regular matrix has property (K) on the space of sequences to which it applies. An operator A is strongly regular if \(K(x)=\{a\}\) implies \(K(A(x))=\{a\}\). Theorem 3. Every strongly regular operator A with property (K) generates an embedding of kernels.
Reviewer: R.P.Boas

MSC:

40C05 Matrix methods for summability
40C10 Integral methods for summability
40D09 Structure of summability fields
Full Text: DOI

References:

[1] N. Dunford and J. T. Schwartz, Linear Operators, Part I: General Theory, Interscience, New York (1958). · Zbl 0084.10402
[2] R. Jajte, ?General theory of summability. I,? Acta Sci. Math.,26, Nos. 1-2, 107-116 (1965). · Zbl 0192.21801
[3] G. H. Hardy, Divergent Series, Clarendon Press, Oxford (1949). · Zbl 0032.05801
[4] R. G. Cooke, Infinite Matrices and Sequence Spaces, Macmillan, London (1950). · Zbl 0040.02501
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.