Strong Converse Inequality for a Spherical Operator
نویسندگان
چکیده
In the paper titled as “Jackson-type inequality on the sphere” 2004 , Ditzian introduced a spherical nonconvolution operator Ot,r , which played an important role in the proof of the wellknown Jackson inequality for spherical harmonics. In this paper, we give the lower bound of approximation by this operator. Namely, we prove that there are constants C1 and C2 such that C1ω2r f, t p ≤ ‖Ot,rf − f‖p ≤ C2ω2r f, t p for any pth Lebesgue integrable or continuous function f defined on the sphere, where ω2r f, t p is the 2rth modulus of smoothness of f .
منابع مشابه
The Direct and Converse Inequalities for Jackson-Type Operators on Spherical Cap
Approximation on the spherical cap is different from that on the sphere which requires us to construct new operators. This paper discusses the approximation on the spherical cap. That is, the so-called Jackson-type operator {Jm k,s }∞ k 1 is constructed to approximate the function defined on the spherical cap D x0, γ . We thus establish the direct and inverse inequalities and obtain saturation ...
متن کاملInequalities of Ando's Type for $n$-convex Functions
By utilizing different scalar equalities obtained via Hermite's interpolating polynomial, we will obtain lower and upper bounds for the difference in Ando's inequality and in the Edmundson-Lah-Ribariv c inequality for solidarities that hold for a class of $n$-convex functions. As an application, main results are applied to some operator means and relative operator entropy.
متن کاملStrong converse and Stein's lemma in quantum hypothesis testing
The hypothesis testing problem of two quantum states is treated. We show a new inequality between the error of the first kind and the second kind, which complements the result of Hiai and Petz to establish the quantum version of Stein’s lemma. The inequality is also used to show a bound on the first kind error when the power exponent for the second kind error exceeds the quantum relative entrop...
متن کاملArimoto Channel Coding Converse and Rényi Divergence
Arimoto [1] proved a non-asymptotic upper bound on the probability of successful decoding achievable by any code on a given discrete memoryless channel. In this paper we present a simple derivation of the Arimoto converse based on the dataprocessing inequality for Rényi divergence. The method has two benefits. First, it generalizes to codes with feedback and gives the simplest proof of the stro...
متن کاملStrong Converse and Stein’s Lemma in the Quantum Hypothesis Testing
The hypothesis testing problem of two quantum states is treated. We show a new inequality between the error of the first kind and the second kind, which complements the result of Hiai and Petz to establish the quantum version of Stein’s lemma. The inequality is also used to show a bound on the first kind error when the power exponent for the second kind error exceeds the quantum relative entrop...
متن کامل