Paperlane

no. 17 · Wednesday 18 November 2026

Symplectic extension graphs and Ribet's lemma

Aniruddha Sudarshan

math.RT · v2 · 40 pp

Abstract

Let $p$ be an odd prime, and let $ρ\colon G\to \mathrm{GSp}_{2n}(\mathbb Z_p)$ be an irreducible symplectic residually multiplicity-free representation. We define the symplectic extension graph $Γ_ρ^{\mathrm{GSp}}$ associated with $ρ$ to be the directed graph whose vertices are the residual factors of $ρ$ and a directed edge between two vertices corresponds to a nonsplit extension between the vertices realized by a $G$-stable symplectic lattice. Using the Euclidean Bruhat–Tits building associated with $\mathrm{GSp}_{2n}(\mathbb Q_p)$, we prove, under suitable assumptions, the existence of certain paths in $Γ_ρ^{\mathrm{GSp}}$ and show that $Γ_ρ^{\mathrm{GSp}}$ is a disjoint union of nonempty strongly connected subgraphs. Moreover, we provide examples to show that the result we obtain is optimal.

comments
40 pages, 1 figure
fields
Representation Theory, Combinatorics, Number Theory
pdf ↗ page arXiv:2610.19434 ↗