A bound for certain bibasic sums and applications.
An inequality, which generalizes and unifies some recently proved Carlson type inequalities, is proved. The inequality contains a certain number of “blocks” and it is shown that these blocks are, in a sense, optimal and cannot be removed or essentially changed. The proof is based on a special equivalent representation of a concave function (see [6, pp. 320-325]). Our Carlson type inequality is used to characterize Peetre’s interpolation functor (see [26]) and its Gagliardo closure on couples of...