2024/05/01 by Martijn Caspers, Caspers, Martijn, Jesse Reimann +1 · 3 citations
Computer Science · Engineering · #Coding theory and cryptography #graph theory and CDMA systems #Wireless Communication Networks Research
paper · pdf · doi:10.48550/arxiv.2405.00464
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 ∈ C2(ℝ) and 1 < p, p1, p2 < ∞ with (1)/(p) = (1)/(p1) + (1)/(p2) we have \Vert Mf[2]: Sp1 × Sp2 → Sp \Vert \lesssim \Vert f'' \Vert_∞ D(p, p1, p2), where the constant D(p, p1, p2) is specified in Theorem 7.1 and D(p, 2p, 2p) ≈ p4 p^∗ with p^∗ the Hölder conjugate of p. We further show that for f(λ) = λ\vert λ\vert, λ∈ ℝ, for every 1 < p < ∞ we have p2 p^∗ \lesssim \Vert Mf[2]: S2p × S2p → Sp \Vert. Here f[2] is the second order divided difference function of f with Mf[2] the associated Schur multiplier. In particular it follows that our estimate D(p, 2p, 2p) is optimal for p \searrow 1.