<p>We give a new proof of the boundedness of bilinear Schur multipliers of second order divided difference functions, as obtained earlier by Potapov, Skripka and Sukochev in their proof of Koplienko’s conjecture on the existence of higher order spectral shift functions. Our proof is based on recent methods involving bilinear transference and the Hörmander–Mikhlin–Schur multiplier theorem. Our approach provides a significant sharpening of the known asymptotic bounds of bilinear Schur multipliers of second order divided difference functions. Furthermore, we give a new lower bound of these bilinear Schur multipliers, giving again a fundamental improvement on the best known bounds obtained by Coine, Le Merdy, Potapov, Sukochev and Tomskova. More precisely, we prove that for <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="208_2025_3111_Article_IEq1.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="76" /> </InlineMediaObject> <EquationSource Format="TEX">\(f \in C^2({\mathbb {R}})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>f</mi> <mo>∈</mo> <msup> <mi>C</mi> <mn>2</mn> </msup> <mrow> <mo stretchy="false">(</mo> <mi mathvariant="double-struck">R</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="208_2025_3111_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="127" /> </InlineMediaObject> <EquationSource Format="TEX">\(1&lt; p, p_1, p_2 &lt; \infty \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>1</mn> <mo>&lt;</mo> <mi>p</mi> <mo>,</mo> <msub> <mi>p</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mn>2</mn> </msub> <mo>&lt;</mo> <mi>∞</mi> </mrow> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="208_2025_3111_Article_IEq3.gif" Format="GIF" Height="25" Rendition="HTML" Resolution="72" Type="Linedraw" Width="78" /> </InlineMediaObject> <EquationSource Format="TEX">\(\frac{1}{p} = \frac{1}{p_1} + \frac{1}{p_2}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mfrac> <mn>1</mn> <mi>p</mi> </mfrac> <mo>=</mo> <mfrac> <mn>1</mn> <msub> <mi>p</mi> <mn>1</mn> </msub> </mfrac> <mo>+</mo> <mfrac> <mn>1</mn> <msub> <mi>p</mi> <mn>2</mn> </msub> </mfrac> </mrow> </math></EquationSource> </InlineEquation> we have <Equation ID="Equ51"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="208_2025_3111_Article_Equ51.gif" Format="GIF" Height="23" Rendition="HTML" Resolution="72" Type="Linedraw" Width="332" /> </MediaObject> <EquationSource Format="TEX">\(\begin{aligned} \Vert M_{f^{[2]}}: S_{p_1} \times S_{p_2} \rightarrow S_p \Vert \lesssim \Vert f'' \Vert _\infty D(p, p_1, p_2), \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <mrow> <mo stretchy="false">‖</mo> </mrow> <msub> <mi>M</mi> <msup> <mi>f</mi> <mrow> <mo stretchy="false">[</mo> <mn>2</mn> <mo stretchy="false">]</mo> </mrow> </msup> </msub> <mo>:</mo> <msub> <mi>S</mi> <msub> <mi>p</mi> <mn>1</mn> </msub> </msub> <mo>×</mo> <msub> <mi>S</mi> <msub> <mi>p</mi> <mn>2</mn> </msub> </msub> <mo stretchy="false">→</mo> <msub> <mi>S</mi> <mi>p</mi> </msub> <mrow> <mo stretchy="false">‖</mo> <mo>≲</mo> <mo stretchy="false">‖</mo> </mrow> <msup> <mi>f</mi> <mrow> <mo>′</mo> <mo>′</mo> </mrow> </msup> <msub> <mrow> <mo stretchy="false">‖</mo> </mrow> <mi>∞</mi> </msub> <mi>D</mi> <mrow> <mo stretchy="false">(</mo> <mi>p</mi> <mo>,</mo> <msub> <mi>p</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mn>2</mn> </msub> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>where the constant <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="208_2025_3111_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="82" /> </InlineMediaObject> <EquationSource Format="TEX">\(D(p, p_1, p_2)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>D</mi> <mo stretchy="false">(</mo> <mi>p</mi> <mo>,</mo> <msub> <mi>p</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>p</mi> <mn>2</mn> </msub> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> is specified in Theorem&#xa0;7.1 and <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="208_2025_3111_Article_IEq5.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="138" /> </InlineMediaObject> <EquationSource Format="TEX">\(D(p, 2p, 2p) \approx p^4 p^*\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>D</mi> <mrow> <mo stretchy="false">(</mo> <mi>p</mi> <mo>,</mo> <mn>2</mn> <mi>p</mi> <mo>,</mo> <mn>2</mn> <mi>p</mi> <mo stretchy="false">)</mo> </mrow> <mo>≈</mo> <msup> <mi>p</mi> <mn>4</mn> </msup> <msup> <mi>p</mi> <mo>∗</mo> </msup> </mrow> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="208_2025_3111_Article_IEq6.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(p^*\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>p</mi> <mo>∗</mo> </msup> </math></EquationSource> </InlineEquation> the Hölder conjugate of <i>p</i>. We further show that for <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="208_2025_3111_Article_IEq7.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="91" /> </InlineMediaObject> <EquationSource Format="TEX">\(f(\lambda ) = \lambda \vert \lambda \vert ,\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>f</mi> <mo stretchy="false">(</mo> <mi>λ</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mi>λ</mi> <mo stretchy="false">|</mo> <mi>λ</mi> <mo stretchy="false">|</mo> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="208_2025_3111_Article_IEq8.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="48" /> </InlineMediaObject> <EquationSource Format="TEX">\(\lambda \in {\mathbb {R}},\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>λ</mi> <mo>∈</mo> <mi mathvariant="double-struck">R</mi> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> for every <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="208_2025_3111_Article_IEq9.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="83" /> </InlineMediaObject> <EquationSource Format="TEX">\(1&lt; p &lt; \infty \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>1</mn> <mo>&lt;</mo> <mi>p</mi> <mo>&lt;</mo> <mi>∞</mi> </mrow> </math></EquationSource> </InlineEquation> we have <Equation ID="Equ52"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="208_2025_3111_Article_Equ52.gif" Format="GIF" Height="25" Rendition="HTML" Resolution="72" Type="Linedraw" Width="236" /> </MediaObject> <EquationSource Format="TEX">\(\begin{aligned} p^2 p^*\lesssim \Vert M_{f^{[2]}}: S_{2p} \times S_{2p} \rightarrow S_p \Vert . \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <msup> <mi>p</mi> <mn>2</mn> </msup> <msup> <mi>p</mi> <mo>∗</mo> </msup> <mo>≲</mo> <mrow> <mo stretchy="false">‖</mo> <msub> <mi>M</mi> <msup> <mi>f</mi> <mrow> <mo stretchy="false">[</mo> <mn>2</mn> <mo stretchy="false">]</mo> </mrow> </msup> </msub> <mo>:</mo> <msub> <mi>S</mi> <mrow> <mn>2</mn> <mi>p</mi> </mrow> </msub> <mo>×</mo> <msub> <mi>S</mi> <mrow> <mn>2</mn> <mi>p</mi> </mrow> </msub> <mo stretchy="false">→</mo> <msub> <mi>S</mi> <mi>p</mi> </msub> <mo stretchy="false">‖</mo> </mrow> <mo>.</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>Here <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="208_2025_3111_Article_IEq10.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="25" /> </InlineMediaObject> <EquationSource Format="TEX">\(f^{[2]}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>f</mi> <mrow> <mo stretchy="false">[</mo> <mn>2</mn> <mo stretchy="false">]</mo> </mrow> </msup> </math></EquationSource> </InlineEquation> is the second order divided difference function of <i>f</i> with <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="208_2025_3111_Article_IEq11.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="36" /> </InlineMediaObject> <EquationSource Format="TEX">\(M_{f^{[2]}}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>M</mi> <msup> <mi>f</mi> <mrow> <mo stretchy="false">[</mo> <mn>2</mn> <mo stretchy="false">]</mo> </mrow> </msup> </msub> </math></EquationSource> </InlineEquation> the associated Schur multiplier. In particular it follows that our estimate <i>D</i>(<i>p</i>,&#xa0;2<i>p</i>,&#xa0;2<i>p</i>) is optimal for <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="208_2025_3111_Article_IEq12.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="51" /> </InlineMediaObject> <EquationSource Format="TEX">\(p \searrow 1.\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>↘</mo> <mn>1</mn> <mo>.</mo> </mrow> </math></EquationSource> </InlineEquation></p>

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

On the best constants of Schur multipliers of second order divided difference functions

  • Martijn Caspers,
  • Jesse Reimann

摘要

We give a new proof of the boundedness of bilinear Schur multipliers of second order divided difference functions, as obtained earlier by Potapov, Skripka and Sukochev in their proof of Koplienko’s conjecture on the existence of higher order spectral shift functions. Our proof is based on recent methods involving bilinear transference and the Hörmander–Mikhlin–Schur multiplier theorem. Our approach provides a significant sharpening of the known asymptotic bounds of bilinear Schur multipliers of second order divided difference functions. Furthermore, we give a new lower bound of these bilinear Schur multipliers, giving again a fundamental improvement on the best known bounds obtained by Coine, Le Merdy, Potapov, Sukochev and Tomskova. More precisely, we prove that for \(f \in C^2({\mathbb {R}})\) f C 2 ( R ) and \(1< p, p_1, p_2 < \infty \) 1 < p , p 1 , p 2 < with \(\frac{1}{p} = \frac{1}{p_1} + \frac{1}{p_2}\) 1 p = 1 p 1 + 1 p 2 we have \(\begin{aligned} \Vert M_{f^{[2]}}: S_{p_1} \times S_{p_2} \rightarrow S_p \Vert \lesssim \Vert f'' \Vert _\infty D(p, p_1, p_2), \end{aligned}\) M f [ 2 ] : S p 1 × S p 2 S p f D ( p , p 1 , p 2 ) , where the constant \(D(p, p_1, p_2)\) D ( p , p 1 , p 2 ) is specified in Theorem 7.1 and \(D(p, 2p, 2p) \approx p^4 p^*\) D ( p , 2 p , 2 p ) p 4 p with \(p^*\) p the Hölder conjugate of p. We further show that for \(f(\lambda ) = \lambda \vert \lambda \vert ,\) f ( λ ) = λ | λ | , \(\lambda \in {\mathbb {R}},\) λ R , for every \(1< p < \infty \) 1 < p < we have \(\begin{aligned} p^2 p^*\lesssim \Vert M_{f^{[2]}}: S_{2p} \times S_{2p} \rightarrow S_p \Vert . \end{aligned}\) p 2 p M f [ 2 ] : S 2 p × S 2 p S p . Here \(f^{[2]}\) f [ 2 ] is the second order divided difference function of f with \(M_{f^{[2]}}\) M f [ 2 ] the associated Schur multiplier. In particular it follows that our estimate D(p, 2p, 2p) is optimal for \(p \searrow 1.\) p 1 .