<p>Suppose that <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\{A_{n}\}_{n=1}^{\infty }\)</EquationSource> <EquationSource Format="MATHML"><math> <msubsup> <mrow> <mo stretchy="false">{</mo> <msub> <mi>A</mi> <mi>n</mi> </msub> <mo stretchy="false">}</mo> </mrow> <mrow> <mi>n</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>∞</mi> </msubsup> </math></EquationSource> </InlineEquation> is a sequence of complex numbers, which is finitely supported on <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\mathbb {N}_{0}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">N</mi> <mn>0</mn> </msub> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(A_{0}=0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>A</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>. We prove that the power-type weighted discrete Hardy’s inequality <Equation ID="Equ33"> <EquationSource Format="TEX">\(\begin{aligned}&amp;\displaystyle \sum _{n=1}^{\infty }n^{\alpha }|A_{n}-A_{n-1}|^{3}\ge \Big (\frac{2-\alpha }{3}\Big )^{3}\displaystyle \sum _{n=1}^{\infty }\frac{|A_{n}|^{3}}{n^{3-\alpha }}, ~~\alpha \in [0, 2) \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd /> <mtd columnalign="left"> <mstyle displaystyle="true" scriptlevel="0"> <mrow> <munderover> <mo>∑</mo> <mrow> <mi>n</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>∞</mi> </munderover> <msup> <mi>n</mi> <mi>α</mi> </msup> <msup> <mrow> <mo stretchy="false">|</mo> <msub> <mi>A</mi> <mi>n</mi> </msub> <mo>-</mo> <msub> <mi>A</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo stretchy="false">|</mo> </mrow> <mn>3</mn> </msup> <mo>≥</mo> <mrow> <mo maxsize="1.623em" minsize="1.623em" stretchy="true">(</mo> </mrow> <mfrac> <mrow> <mn>2</mn> <mo>-</mo> <mi>α</mi> </mrow> <mn>3</mn> </mfrac> <msup> <mrow> <mo maxsize="1.623em" minsize="1.623em" stretchy="true">)</mo> </mrow> <mn>3</mn> </msup> <munderover> <mo>∑</mo> <mrow> <mi>n</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>∞</mi> </munderover> <mfrac> <mrow> <mrow> <mo stretchy="false">|</mo> </mrow> <msub> <mi>A</mi> <mi>n</mi> </msub> <msup> <mrow> <mo stretchy="false">|</mo> </mrow> <mn>3</mn> </msup> </mrow> <msup> <mi>n</mi> <mrow> <mn>3</mn> <mo>-</mo> <mi>α</mi> </mrow> </msup> </mfrac> <mo>,</mo> <mspace width="3.33333pt" /> <mspace width="3.33333pt" /> <mi>α</mi> <mo>∈</mo> <mrow> <mo stretchy="false">[</mo> <mn>0</mn> <mo>,</mo> <mn>2</mn> <mo stretchy="false">)</mo> </mrow> </mrow> </mstyle> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>with the sharp constant <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\big (\frac{2-\alpha }{3}\big )^{3}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mo maxsize="1.2em" minsize="1.2em" stretchy="true">(</mo> </mrow> <mfrac> <mrow> <mn>2</mn> <mo>-</mo> <mi>α</mi> </mrow> <mn>3</mn> </mfrac> <msup> <mrow> <mo maxsize="1.2em" minsize="1.2em" stretchy="true">)</mo> </mrow> <mn>3</mn> </msup> </mrow> </math></EquationSource> </InlineEquation> is not optimal. It is demonstrated that an improvement of the aforesaid inequality is possible for <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\alpha \in [0, 1]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>α</mi> <mo>∈</mo> <mo stretchy="false">[</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation>. More precisely, we establish the following inequality <Equation ID="Equ34"> <EquationSource Format="TEX">\(\begin{aligned}&amp;\displaystyle \sum _{n=1}^{\infty }n^{\alpha }|A_{n}-A_{n-1}|^{3}\ge \displaystyle \sum _{n=1}^{\infty }\rho _n(\alpha , \beta )|A_{n}|^{3}&gt;\Big (\frac{2-\alpha }{3}\Big )^{3}\displaystyle \sum _{n=1}^{\infty }\frac{|A_{n}|^{3}}{n^{3-\alpha }}, ~\beta =\frac{2-\alpha }{3}, \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd /> <mtd columnalign="left"> <mstyle displaystyle="true" scriptlevel="0"> <mrow> <munderover> <mo>∑</mo> <mrow> <mi>n</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>∞</mi> </munderover> <msup> <mi>n</mi> <mi>α</mi> </msup> <mrow> <mo stretchy="false">|</mo> </mrow> <msub> <mi>A</mi> <mi>n</mi> </msub> <mo>-</mo> <msub> <mi>A</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <msup> <mrow> <mo stretchy="false">|</mo> </mrow> <mn>3</mn> </msup> <mo>≥</mo> <munderover> <mo>∑</mo> <mrow> <mi>n</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>∞</mi> </munderover> <msub> <mi>ρ</mi> <mi>n</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>α</mi> <mo>,</mo> <mi>β</mi> <mo stretchy="false">)</mo> </mrow> <msup> <mrow> <mo stretchy="false">|</mo> <msub> <mi>A</mi> <mi>n</mi> </msub> <mo stretchy="false">|</mo> </mrow> <mn>3</mn> </msup> <mo>&gt;</mo> <mrow> <mo maxsize="1.623em" minsize="1.623em" stretchy="true">(</mo> </mrow> <mfrac> <mrow> <mn>2</mn> <mo>-</mo> <mi>α</mi> </mrow> <mn>3</mn> </mfrac> <msup> <mrow> <mo maxsize="1.623em" minsize="1.623em" stretchy="true">)</mo> </mrow> <mn>3</mn> </msup> <munderover> <mo>∑</mo> <mrow> <mi>n</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>∞</mi> </munderover> <mfrac> <mrow> <mrow> <mo stretchy="false">|</mo> </mrow> <msub> <mi>A</mi> <mi>n</mi> </msub> <msup> <mrow> <mo stretchy="false">|</mo> </mrow> <mn>3</mn> </msup> </mrow> <msup> <mi>n</mi> <mrow> <mn>3</mn> <mo>-</mo> <mi>α</mi> </mrow> </msup> </mfrac> <mo>,</mo> <mspace width="3.33333pt" /> <mi>β</mi> <mo>=</mo> <mfrac> <mrow> <mn>2</mn> <mo>-</mo> <mi>α</mi> </mrow> <mn>3</mn> </mfrac> <mo>,</mo> </mrow> </mstyle> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>where <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(\rho _n(\alpha , \beta )\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>ρ</mi> <mi>n</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>α</mi> <mo>,</mo> <mi>β</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is an improved weight such that <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(\rho _n(\alpha , \beta )&gt;\Big (\frac{2-\alpha }{3}\Big )^{3}n^{\alpha -3}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>ρ</mi> <mi>n</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>α</mi> <mo>,</mo> <mi>β</mi> <mo stretchy="false">)</mo> </mrow> <mo>&gt;</mo> <mrow> <mo maxsize="1.623em" minsize="1.623em" stretchy="true">(</mo> </mrow> <mfrac> <mrow> <mn>2</mn> <mo>-</mo> <mi>α</mi> </mrow> <mn>3</mn> </mfrac> <msup> <mrow> <mo maxsize="1.623em" minsize="1.623em" stretchy="true">)</mo> </mrow> <mn>3</mn> </msup> <msup> <mi>n</mi> <mrow> <mi>α</mi> <mo>-</mo> <mn>3</mn> </mrow> </msup> </mrow> </math></EquationSource> </InlineEquation> holds point-wise for each <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(n\in \mathbb {N}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>∈</mo> <mi mathvariant="double-struck">N</mi> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(\alpha \in [0, 1]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>α</mi> <mo>∈</mo> <mo stretchy="false">[</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation>.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

An improved power-type weighted discrete Hardy’s inequality

  • Bikram Das,
  • Atanu Manna

摘要

Suppose that \(\{A_{n}\}_{n=1}^{\infty }\) { A n } n = 1 is a sequence of complex numbers, which is finitely supported on \(\mathbb {N}_{0}\) N 0 with \(A_{0}=0\) A 0 = 0 . We prove that the power-type weighted discrete Hardy’s inequality \(\begin{aligned}&\displaystyle \sum _{n=1}^{\infty }n^{\alpha }|A_{n}-A_{n-1}|^{3}\ge \Big (\frac{2-\alpha }{3}\Big )^{3}\displaystyle \sum _{n=1}^{\infty }\frac{|A_{n}|^{3}}{n^{3-\alpha }}, ~~\alpha \in [0, 2) \end{aligned}\) n = 1 n α | A n - A n - 1 | 3 ( 2 - α 3 ) 3 n = 1 | A n | 3 n 3 - α , α [ 0 , 2 ) with the sharp constant \(\big (\frac{2-\alpha }{3}\big )^{3}\) ( 2 - α 3 ) 3 is not optimal. It is demonstrated that an improvement of the aforesaid inequality is possible for \(\alpha \in [0, 1]\) α [ 0 , 1 ] . More precisely, we establish the following inequality \(\begin{aligned}&\displaystyle \sum _{n=1}^{\infty }n^{\alpha }|A_{n}-A_{n-1}|^{3}\ge \displaystyle \sum _{n=1}^{\infty }\rho _n(\alpha , \beta )|A_{n}|^{3}>\Big (\frac{2-\alpha }{3}\Big )^{3}\displaystyle \sum _{n=1}^{\infty }\frac{|A_{n}|^{3}}{n^{3-\alpha }}, ~\beta =\frac{2-\alpha }{3}, \end{aligned}\) n = 1 n α | A n - A n - 1 | 3 n = 1 ρ n ( α , β ) | A n | 3 > ( 2 - α 3 ) 3 n = 1 | A n | 3 n 3 - α , β = 2 - α 3 , where \(\rho _n(\alpha , \beta )\) ρ n ( α , β ) is an improved weight such that \(\rho _n(\alpha , \beta )>\Big (\frac{2-\alpha }{3}\Big )^{3}n^{\alpha -3}\) ρ n ( α , β ) > ( 2 - α 3 ) 3 n α - 3 holds point-wise for each \(n\in \mathbb {N}\) n N and \(\alpha \in [0, 1]\) α [ 0 , 1 ] .