2000 character limit reached
On Copson's inequalities for $0<p<1$
Published 20 Jun 2018 in math.CA | (1806.07664v1)
Abstract: Let $(\lambda_n){n \geq 1}$ be a non-negative sequence with $\lambda_1>0$ and let $\Lambda_n=\sumn{i=1}\lambda_i$. We study the following Copson inequality for $0<p\<1$, $L>p$, \begin{align*} \sum{\infty}_{n=1}\left (\frac 1{\Lambda_n} \sum{\infty}_{k=n}\lambda_k x_k \right )p \geq \left ( \frac {p}{L-p}\right )p \sum{\infty}_{n=1}xp_n. \end{align*} We find conditions on $\lambda_n$ such that the above inequality is valid with the constant being best possible.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.