Papers
Topics
Authors
Recent
AI Research Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 83 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 30 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 174 tok/s Pro
GPT OSS 120B 462 tok/s Pro
Claude Sonnet 4 39 tok/s Pro
2000 character limit reached

A Hörmander-Mikhlin theorem for high rank simple Lie groups (2201.08740v4)

Published 21 Jan 2022 in math.FA

Abstract: We establish regularity conditions for $L_p$-boundedness of Fourier multipliers on the group von Neumann algebras of higher rank simple Lie groups. This provides a natural H\"ormander-Mikhlin criterion in terms of Lie derivatives of the symbol and a metric given by the adjoint representation. In line with Lafforgue/de la Salle's rigidity theorem, our condition imposes certain decay of the symbol at infinity. It refines and vastly generalizes a recent result by Parcet, Ricard and de la Salle for $\SL$. Our approach is partly based on a sharp local H\"ormander-Mikhlin theorem for arbitrary Lie groups, which follows in turn from recent estimates by the authors on singular nonToeplitz Schur multipliers. We generalize the latter to arbitrary locally compact groups and refine the cocycle-based approach to Fourier multipliers in group algebras by Junge, Mei and Parcet. A few related open problems are also discussed.

Citations (3)

Summary

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube