Symplectic extension graphs and Ribet's lemma

arXiv:2610.19434 · math.RT, math.CO, math.NT · Submitted 2026-10-14 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: We're looking at the paper: "Symplectic extension graphs and Ribet's lemma".

Title and authors: Ada: So we're looking at this paper, "Symplectic extension graphs and Ribet's lemma," and it deals with how certain Galois representations behave when they are symplectic. It’s about taking the concept of a nonsplit extension—which is really important in number theory, especially when connecting modular forms to cohomology—and seeing how that translates into a graph structure on the residual factors.

Emmy: Exactly. The authors are focusing on this symplectic case, where we're working with representations into GSp2n(Zp), which is the general linear group of degree 2n with a non-degenerate alternating bilinear form <ref:2610.19434#pg1>. They're defining this symplectic extension graph, gamma GSp rho, based on whether there's a nonsplit extension between the residual factors of that representation.

Kolya: So, what's the main point they are trying to make about this graph structure? Is it just showing that it exists, or are they proving something about its connectivity? I'm thinking about what this implies for finding these extensions in practice.

Ada: They show that under certain assumptions—specifically, things like being "dist" and "rmf"—this symplectic extension graph has a very nice structure. They prove it’s a disjoint union of nonempty strongly connected subgraphs, which is a big step because it gives us control over the complexity of the extensions available.

Emmy: And they establish some key structural properties related to Ribet's lemma. This means they are connecting this graph theory directly to those deep results in modularity that deal with constructing unramified cohomology classes using congruences between modular forms, like what Ribet did back in one thousand nine hundred seventy-six.

Kolya: That sounds like it simplifies the search space for those extensions significantly. If you know the graph breaks down into these connected pieces, you don't have to check every pair of factors; you just need to check within each component. But what are those "certain assumptions" they mention?

Ada: Well, they rely on tools from algebraic geometry, specifically the Euclidean Bruhat–Tits building associated with GSp2n(Qp). They show that the set of G-stable vertices in this building lies in a specific sub-apartment when things are set up correctly. This geometric framework is what allows them to prove the existence of certain paths in gamma GSp rho and its decomposition into strongly connected graphs.

Emmy: It's interesting how they use the structure of the building to constrain where these residual factors can be, linking it back to the GLn version of results Bellaïche obtained earlier with GL2(Qp)

Bel03, Theorem one: <ref:2610.19434#pg1>. This suggests that this symplectic structure is deeply tied to the underlying geometry of p-adic groups.

Title and authors: Kolya: So, if we think about what this means for a researcher trying to find these extensions—say, for a specific Galois representation—does it give them a concrete way to look for one? Or are they just mapping out where the possibilities lie?

Ada: It gives them a roadmap. The main result is that you can characterize the structure of this graph based on properties of the representation itself. They show that assuming I zero is empty means there are actual neighboring symplectic vertices in that building, which translates to something about extensions between factors.

Emmy: And they're quite careful about how they define these relationships too. They introduce a skew symmetric property for gamma GSp rho with respect to a transposition sigma on the set of residual factors, and they show how this relates to the transpose operation on the representation itself, which is what you see in Definition one point five GK96 <ref:2610.19434#pg3>.

Kolya: That skew symmetry sounds like a powerful tool for organizing the information about which extensions are possible. But I'm curious about the examples they provide. Are those examples just theoretical constructs, or do they show how disconnected this graph can actually be?

Ada: They provide concrete examples to show that their result is optimal. They construct a situation where you have a symplectic irreducible p-adic representation where the symplectic extension graph is completely empty, but the corresponding GL graph is complete. This demonstrates that the structure they prove isn't just true in every case; it shows what happens when you push the conditions to their limits <ref:2610.19434#pg1>.

Emmy: And they also show that even when it is disconnected, it can still be a union of two strongly connected components, which supports the idea that this decomposition isn't always trivial. This shows the complexity inherent in these symplectic structures.

Kolya: So, for someone just listening to the show who isn't deep into representation theory, what does this ultimately change for them? Does it give a new way to think about how modularity and Galois representations interact?

Ada: It provides a way to organize the problem of nonsplit extensions. Instead of looking at an infinite set of potential connections, you can analyze the connectivity of these graphs and see where those connections are guaranteed to exist or where they are impossible under certain constraints. It’s a structural constraint on the existence of certain mathematical objects.

Title and authors: Emmy: And it connects this purely algebraic graph structure back to the geometric world of buildings, which is always satisfying when you can see the underlying space dictating the graph's behavior. It’s about seeing how local information in the representation dictates global connectivity in a very controlled way.

Kolya: I wonder if this framework could be used to analyze other types of representations besides symplectic ones, or if it's specific to this GSp2n setting? What are the limits of this approach?

Ada: The paper is specific to the symplectic case for now, but the methodology—using buildings and analyzing connectivity via group actions like tau and sigma —suggests a general strategy for studying these types of graphs associated with representations. They show that you can use tools from geometry to tackle problems rooted in number theory.

Emmy: And they've also pointed out a specific condition, relating the existence of G-stable symplectic neighbors to the condition I zero being empty, which is an equivalence <ref:2610.19434#pg3>. That’s a very precise statement connecting local geometry to global representation properties.

Kolya: That's a good piece of detail because it tells us exactly what structural condition on the representation leads to those neighbors appearing in the building. What happens if that condition isn't met?

Ada: If I zero is not empty, then you don't get those immediate symplectic neighbors in the building, which means there are no extensions between those residual factors realized by a G-stable lattice. This is a direct link between representation theory and geometric existence <ref:2610.19434#pg3>.

Emmy: So, to wrap up, the paper "Symplectic extension graphs and Ribet's lemma" shows us that the symplectic extension graph isn't just some abstract mess; it has a controllable structure—it decomposes into connected pieces—and this structure is governed by deep geometric constraints from Bruhat–Tits buildings.

Kolya: And the examples they give, especially where the GL graph is complete but the symplectic one isn't, really shows that even with strong theorems, there are still subtle cases where things are very different depending on whether you're looking at a general representation or a symplectic one.

Ada: Right. It’s about finding those precise conditions—the "dist" and "rmf"—that make the structure predictable enough to use for constructing things, which is exactly what Ribet's method is all about in the first place Rib76.

Emmy: So we see how algebraic topology and representation theory can be framed through these graph structures, providing a concrete visualization of deep arithmetic constraints. It’s a bridge between abstract algebra and geometry that’s worth paying attention to.

The paper's summary: Ada: So, to recap, this paper is about taking those complicated Galois representations that are symplectic—meaning they have an extra structure related to a kind of geometric form—and mapping out how those representations connect using graphs.

Emmy: Right. They define this symplectic extension graph, and they show that under the right conditions, this whole graph splits up into several smaller pieces, each one being strongly connected by itself.

Kolya: So what does that actually mean for us? If we can break a big problem down into these smaller connected components, is it easier to find the extensions we're looking for?

Ada: It is. Because they prove that if you know which component a representation belongs to, you only have to look at the connections within that specific piece. This gives us control over the complexity of finding those nonsplit extensions.

Emmy: And they tie this back to Ribet’s lemma, which is this really important idea about how modular forms connect to these cohomology classes in p-adic settings. It shows that the graph structure mirrors the constraints imposed by modularity theory.

Kolya: So if a representation falls into one of those strongly connected components, does that guarantee an extension exists? Or is it just saying the possibility is constrained?

Ada: It's showing that you can characterize exactly when those connections are possible based on the graph structure itself. They establish precise equivalences between certain conditions on the graph and properties of the representation, like whether or not there are neighboring symplectic vertices in their geometric space.

Emmy: And they showed that there are cases where this graph is totally empty, even when a related GL graph is completely connected. That shows the constraints imposed by being symplectic can be much stricter than what you see in the more general linear case.

Kolya: That’s interesting because it means we aren't just looking at one type of connection; we have to account for these different structural possibilities defined by that symplectic form.

Ada: Exactly. This work provides a roadmap for understanding these extensions by visualizing them as graph connectivity problems, using the language of geometry to define those connections.

Emmy: And they set up a way to analyze the "neighborhood" structure, where being next to a vertex in their geometric building tells you something concrete about whether an extension is nonsplit or split.

Kolya: So this moves us closer to understanding how these specific arithmetic objects behave when we introduce that extra symplectic geometry.

Ada: It really does. And this structural understanding is the foundation for what they are trying to prove next, which involves constructing those actual extensions using these geometric insights.

The paper's improvements: Ada: So, we're looking at how these researchers are already thinking about improving their own work on this paper, "Symplectic extension graphs and Ribet's lemma."

Emmy: They suggest that they should look more closely at the relationship between the geometric structure of those buildings and the exact conditions needed for those connections to exist.

Kolya: So what kind of improvements are we talking about? Is it just making the bounds tighter on how many components there can be, or is it something deeper?

Ada: It’s more about refining how they characterize the neighbors. They want a clearer link between checking if two vertices in that geometric space are near each other and whether you have a nonsplit extension between those corresponding residual factors.

Emmy: I think the key is making that condition explicit. If you can clearly state when that neighborhood exists, it helps prove why their graph decomposition holds up under those specific assumptions they're using for the representation.

Kolya: From a probabilistic standpoint, if you get a clearer characterization of those connections, does that help us predict the size or nature of the sets where these extensions are possible?

Ada: It helps us narrow down the space. If we know exactly what condition on the representation leads to a neighbor in that building, we can use that to make stronger statements about those tail probabilities they're interested in.

Emmy: And they seem to be focusing on making sure their construction of those examples is as general as possible, so it doesn't just work for one specific representation but truly captures the structural property of all symplectic representations under the given assumptions.

Kolya: That sounds useful because those constructed examples are what we use to test if the theory holds when you push it to its limits.

Ada: Exactly. They want to show that their method isn't just a trick for one case, but that it describes the general landscape of symplectic representations under those 'dist' and 'rmf' constraints.

Emmy: And they are also looking at how this applies beyond just the GSp2n setting, maybe seeing if the core idea of using skew symmetry and building structure can translate to other groups or forms.

Kolya: That’s a big question. If this geometric approach works for symplectic groups, could we adapt the ideas to study extensions in other areas, like those related to modular forms on different surfaces?

Ada: They are definitely pointing toward that expansion. The goal is to move from just describing the graph structure to actually using it as a tool for constructing those extensions themselves.

Conclusion: Ada: So we've seen how this paper, "Symplectic extension graphs and Ribet's lemma," uses geometric building theory to organize the connections between different parts of a Galois representation into these manageable pieces.

Emmy: Right. The main implication is that you can use this graph structure to rigorously define when those nonsplit extensions are possible based on the representation itself, not just by brute force checking every possibility.

Kolya: So what does that mean for someone working on finding those actual extensions? Does it give them a concrete way to search?

Ada: It gives them a constraint. If they know which component of the graph their representation belongs to, they only need to look within that piece for the connections. It simplifies the search space considerably.

Emmy: And this is important because it connects what we see in these abstract graphs directly back to the actual arithmetic constraints imposed by Ribet's lemma on modular forms.

Kolya: So it’s like saying, "If you are in component A, then there is a certain probability that an extension exists." Is that what it boils down to?

Ada: It’s closer. It moves the problem from an infinite search to a finite set of connected subgraphs where the structure is already understood.

Emmy: And they also showed that this decomposition works even in cases where the graph isn't fully connected, which is a real win because it shows the method is robust across different representation types.

Kolya: That robustness matters because we need to know when these structural properties hold true for all cases, not just some specific ones.

Ada: They are aiming for that general structure, showing how the symplectic geometry dictates the overall connectivity pattern.

Emmy: So this is a solid foundation for understanding the landscape of nonsplit extensions in this context.

Kolya: And it sets up a clear direction for where we go next, which is building those actual constructions using these new structural insights.

Ada: Right. We’ll keep an eye on how they use these graph properties to actually build those objects, that’s the next big step we need to watch.

math.RT, math.CO, math.NT

Submitted: 2026-10-14

Updated: 2026-11-17

Comments: 40 pages, 1 figure

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 82/100

The gist: Let p be an odd prime, and let ρ: G → GSp2n(Zp) be an irreducible symplectic residually multiplicity free representation.

Key concepts

Symplectic Extension Graph ($\Gamma_{GSp} \rho$)
This is a directed graph where vertices represent residual factors of the representation $\rho$. An edge exists between two vertices if there is a nonsplit extension between them realized by $\rho$. It helps visualize how different parts of the representation are connected via non-trivial extensions.
Euclidean Bruhat–Tits Building
This is a geometric structure associated with the group GSp2n(Qp). The paper uses this building to understand the set of G-stable vertices ($S_{GSp} \rho$). It shows that these vertices lie within specific sub-apartments, which helps determine the dimension and structure of the extension graph.
Residual Factors
These are the characters or representations obtained by reducing the Galois representation $\rho$ modulo $p$. The vertices of the extension graph correspond to these residual factors. Understanding their relationships (extensions) is key to mapping out connectivity in this graph.
$I_0 = \emptyset$
This condition relates to whether there are neighboring symplectic vertices in the set $S_{GSp} \rho$. The existence of such neighbors is equivalent to the condition $I_0 = \emptyset$, linking a structural property of the building's vertices directly to the connectivity within the graph.

Terminology

Summary

Let p be an odd prime, and let ρ: G → GSp2n(Zp) be an irreducible symplectic residually multiplicity free representation. p. 0 The paper proves that the symplectic extension graph ΓGSp ρ is a disjoint union of nonempty strongly connected subgraphs under certain assumptions, establishing key structural properties related to Ribet's lemma.

Definition and Context of the Graphs

The paper defines the symplectic extension graph ΓGSp ρ as a directed graph whose vertices are the residual factors of ρ, with a directed edge between two vertices corresponding to a nonsplit extension between the vertices realized by ρ. This graph is studied in analogy to Bellaïche's extension graph ΓGL ρ, which is defined based on G-stable lattices and nonsplit extensions between residual factors. The paper introduces the concept of a skew symmetric graph and shows that ΓGSp ρ is skew symmetric with respect to a transposition σ on the set of residual factors. p. 2

Structural Results on Connectivity

The main theorem states that under assumptions (dist) and (rmf), the directed graph ΓGSp ρ satisfies two conditions:

  1. For all 1 ≤ i ≤ d, ρi and ρσ(i) lie in the same strongly connected component. p. 2

  2. It is a disjoint union of at most d/2 strongly connected graphs. p. 2

Furthermore, Theorem 1. p. 08 asserts the existence of a group Gr and an irreducible symplectic representation ρ: Gr → GSp2n(Zp) satisfying (dist) and (rmf) such that the residual factors are characters and ΓGSp ρ is a disjoint union of r strongly connected graphs. p. 3

Geometric Interpretation via Buildings

The proof method heavily relies on the Euclidean Bruhat–Tits building associated with GSp2n(Qp) and GLn(Qp). The set of G-stable vertices in the symplectic building, S GSp ρ, is shown to lie in a sub-apartment of the building associated with GL(V, ϕ) under certain conditions. p. 5 The dimension of S GSp ρ is determined by d1 = I1, which relates to the structure of the graph. p. 2

Characterization and Optimality

The paper establishes equivalences between conditions on the graph structure and properties of the representation, such as assuming I0 = ∅ is equivalent to the existence of neighboring symplectic vertices in S GSp ρ. The result is shown to be optimal by constructing an example where ΓGSp ρ has an empty graph but ΓGL ρ is the complete graph. p. 3

Construction of Idempotents and Examples

The construction of orthogonal idempotents in Zp[G]/ ker ρ corresponding to a symplectic basis is used to show that every G-stable vertex in the symplectic building lies in an apartment. Examples are provided, such as Example 5. p. 06, where the symplectic extension graph is disconnected and a proper subgraph of Bellaïche’s connected extension graph. p. 0 The final example shows that ΓGSp ρ can be a union of two strongly connected components. p. 0

Conclusion and Future Directions

The paper concludes by demonstrating the existence of certain edges in the symplectic extension graph associated with an irreducible symplectic p-adic representation. This is presented as the main ingredient to proving Theorem 1. p. 37. Future directions suggest a pursuit of a symplectic analogue of Bellaïche–Chenevier's work on constructing nonsplit extensions between residual representations. The study focuses on extensions of representations realized by symplectic lattices. p. 4

References

[AB08] Peter Abramenko and Kenneth S. Brown, Buildings, Graduate Texts in Mathematics, vol. p. 0 248, Springer, New York, 2008

[BC04] Jo¨el Bella¨ıche and Ga¨etan Chenevier, Formes non temp´er´ees pour U(3) et conjectures de Bloch-Kato, Ann. Sci. Ecole Norm. Sup. (4) ´ 37 (2004), no. 4, 611–662

[BC09] Jo¨el Bella¨ıche and Ga¨etan Chenevier, Families of Galois representations and Selmer groups, Ast´erisque, no. 324, Soci´et´e math´ematique de France, 2009 (en)

[Bel03] Jo¨el Bella¨ıche, a propos d’un lemme de Ribet, Rend. Sem. Mat. Univ. Padova 109 (2003), 45–62

[Bel09] Jo¨el Bellaïche, Ribet’s lemma, generalizations, and pseudocharacters, Two lectures at the Clay Mathematical Institute Summer School, 2009

[Bel19] Jo¨el Bellaïche, Image of pseudo-representations and coefficients of modular forms modulo p, Adv. Math. 353 (2019), 647–721

[BG06] Jo¨el Bellaïche and Philippe Graftieaux, Repr´esentations sur un anneau de valuation discrɛte complet, Math. Ann. 334 (2006), no. 3, 465–488

[BK21] Tobias Berger and Krzysztof Klosin, Irreducibility of limits of Galois representations of SaitoKurokawa type, Res. Number Theory 7 (2021), no. p. 4 3, Paper No. p. 0 41, 25

[Che14] Ga¨etan Chenevier, The p-adic analytic space of pseudocharacters of a profinite group and pseudorepresentations over arbitrary rings, Automorphic forms and Galois representations. Vol. 1, London Math. p. 0 Soc. Lecture Note Ser. p. 1, vol. 414, Cambridge Univ. Press, Cambridge, 2014

[DK23] Samit Dasgupta and Mahesh Kakde, On the Brumer-Stark conjecture, Ann. of Math. (2) 197 (2023), no. 1, 289–388

[DKSW23a] Samit Dasgupta, Mahesh Kakde, Jesse Silliman, and Jiuya Wang, The Brumer–Stark conjecture over Z, 2023

[DKSW23b], The residually indistinguishable case of Ribet’s method for GL2, 2023

[Gar97] Paul Garrett, Buildings and classical groups, Chapman & Hall, London, 1997

[GK96] Andrew V. Goldberg and Alexander V. Karzanov, Path problems in skew-symmetric graphs, Combinatorica 16 (1996), no. p. 2 3, 353–382

[LS10] T. Y. Lam and R. G. Swan, Symplectic modules and von Neumann regular matrices over commutative rings, Advances in ring theory, Trends Math. p. 5, Birkh¨auser/Springer Basel AG, Basel, 2010

[MQ26] Mohamed Moakher and Julian Quast, Symplectic determinant laws and invariant theory, Journal of the Institute of Mathematics of Jussieu 25 (2026), no. 5, 2853–2918

[MW84] B. Mazur and A. Wiles, Class fields of abelian extensions of Q, Invent. p. 4 Math. 76 (1984), no. 2, 179–330

[Rib76] Kenneth A. Ribet, A modular construction of unramified p-extensions of Q(µp), Invent. p. 1 Math. 34 (1976), no.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Improved AI can determine if a symplectic extension graph is strongly connected by checking if there is a directed path between any two vertices, as described in Theorem 1.2: If ρ is irreducible, then ΓGL ρ is strongly connected.

  2. Improved AI can classify the structure of the symplectic extension graph when it is not strongly connected by identifying its disjoint union of strongly connected subgraphs, as stated in Theorem 1.7(b): It is a disjoint union of at most d/2 strongly connected graphs.

  3. Improved AI can construct specific examples where the extension graph is empty and the GL graph is complete, by utilizing the construction inspired by Bellaiche–Graftieaux mentioned in Theorem 1.8: We produce a symplectic irreducible p-adic representation ρ that is residually reducible with three absolutely irreducible residual factors such that ΓGSp ρ is an empty graph but ΓGL ρ is a complete graph.

  4. Improved AI can analyze the relationship between the existence of G-stable symplectic neighbours and the condition I0 = ∅, as stated in Proposition 4.27: There exists G-stable symplectic neighbours in ∆n if and only if I0 = ∅.

  5. Improved AI can determine whether a vertex in S GSp ρ lies within an apartment by checking if it satisfies the condition of Lemma 4.20: A vertex y = [a1,..., an, b1,..., bn] ∈ Σ if and only if there exists m ∈ Z such that ai + bi + 2m ∈ one, two.

  6. Improved AI can characterize the symplectic neighbours of a symplectic vertex by examining the Jordan-H¨older colouring and the condition JH(x, y) = P i epsilon i ρ i as stated in Proposition 4.33: The following statements are equivalent: (a) There does not exist a neighbour y ∈ S GSp ρ of x such that JH(x, y) = P i epsilon i ρi. (b) Λ/pΛ admits a nonsplit extension of some ρi by ρj with εi = 1 and εj = 0.

Related papers