2009.09952
CHARMENABILITY OF ARITHMETIC GROUPS OF PRODUCT TYPE
Uri Bader, Rémi Boutonnet, Cyril Houdayer, Jesse Peterson
correctmedium confidence
- Category
- Not specified
- Journal tier
- Strong Field
- Processed
- Sep 28, 2025, 12:55 AM
- arXiv Links
- Abstract ↗PDF ↗
Audit review
The paper’s Theorem A states exactly the two-part claim: (i) any S-arithmetic subgroup of product type is charmenable, and (ii) if there is a place v with G(K_v) having property (T) and unbounded Γ-projection, and either S is finite or G is simply connected, then Γ is charfinite. This is proved via Proposition 6.1 (charmenability), Proposition 7.1 (finiteness of finite-dimensional unitary representations), and a char-(T) criterion (Propositions 7.5–7.6), culminating in the proof of Theorem A (end of §7.2) . The candidate’s solution matches these statements and their logical structure. Differences are methodological: the paper derives Rad(Γ) finite from Margulis’s framework ([Ma91]) in the final proof of Theorem A, whereas the candidate appeals to Bader–Shalom’s normal subgroup theorem; for the finiteness of unitary d-dimensional representations the paper uses [Sh99] and Margulis (Prop. 7.1), while the candidate cites Lubotzky–Magid. These are compatible alternative routes. Overall, both are correct; the model’s route is close but not identical to the paper’s approach.
Referee report (LaTeX)
\textbf{Recommendation:} minor revisions
\textbf{Journal Tier:} strong field
\textbf{Justification:}
The paper proves robust structural results for arithmetic groups of product type using a novel synthesis of noncommutative boundary techniques and rigidity theory. The main theorems are clearly stated; proofs are careful and draw on a well-curated toolkit. A few expository clarifications (e.g., explicitly bridging char-(T) to the finiteness of amenable extremal characters) would further aid readers but do not affect correctness.