惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

WordPress大学
WordPress大学
H
Help Net Security
Jina AI
Jina AI
V
V2EX
G
Google Developers Blog
B
Blog
GbyAI
GbyAI
U
Unit 42
爱范儿
爱范儿
腾讯CDC
Engineering at Meta
Engineering at Meta
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 三生石上(FineUI控件)
宝玉的分享
宝玉的分享
小众软件
小众软件
D
DataBreaches.Net
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - Franky
博客园 - 聂微东
The Cloudflare Blog
I
InfoQ
Microsoft Azure Blog
Microsoft Azure Blog
Hugging Face - Blog
Hugging Face - Blog
大猫的无限游戏
大猫的无限游戏

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
The Unitarity of Arthur Packets for Real Reductive Groups
[Submitted on 1 Jun 2026] · 2026-06-02 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:Let $G$ be a connected reductive algebraic group defined over $\mathbb{R}$. In the 1980s, Arthur conjectured the existence of certain packets of irreducible admissible representations of $G(\mathbb{R})$ satisfying various remarkable properties. These packets were given a precise definition in the book of Adams, Barbasch, and Vogan in terms of microlocal geometry on a space of Langlands parameters. A longstanding conjecture, originally due to Arthur, is that all Arthur packets consist of $\textit{unitary}$ representations. In this paper, we prove this conjecture in general. The main new idea is a `Jordan decomposition' for Arthur packets: a canonical two-step process for realizing an arbitrary Arthur packet via real parabolic and cohomological induction from a unipotent Arthur packet for a certain Levi subgroup. This process is analogous to the decomposition of an element of a complex algebraic group as a (unique) commuting product of elliptic, hyperbolic, and unipotent parts. Using our Jordan decomposition, we reduce the question of unitarity to the case of unipotent Arthur packets, where the answer is already known (by work of Adams-Arancibia-Mezo, Adams-van Leeuwen-Miller-Vogan, Arthur, Barbasch, Barbasch-Ma-Sun-Zhu, and Davis-Mason-Brown). As an application of the same methods, we also give a proof of Jiang's conjecture for real reductive groups, which gives an upper bound on the wavefront sets of the members of an Arthur packet in terms of the Barbasch-Vogan dual of the Arthur $SL_2(\mathbb{C})$.

Submission history

From: Lucas Mason-Brown [view email]
[v1] Mon, 1 Jun 2026 02:59:56 UTC (81 KB)