Sheaves on Graphs, Their Homological Invariants, and a Proof of the Hanna Neumann Conjecture: with an Appendix by Warren Dicks

Abstract for Chapters 1,2, and Appendix A. In this paper we establish some foundations regarding sheaves of vector spaces on graphs and their invariants, such as homology groups and their limits. We then use these ideas to prove the Hanna Neumann Conjecture of the 1950’s; in fact, we prove a strengthened form of the conjecture. We introduce a notion of a sheaf of vector spaces on a graph, and develop the foundations of homology theories for such sheaves. One sheaf invariant, its “maximum excess,” has a number of remarkable properties. It has a simple definition, with no reference to homology theory, that resembles graph expansion. Yet it is a “limit” of Betti numbers, and hence has a short/long exact sequence theory and resembles the L 2 L^2 Betti numbers of Atiyah. Also, the maximum excess is defined via a supermodular function, which gives the maximum excess much stronger properties than one has of a typical Betti number. Our sheaf theory can be viewed as a vast generalization of algebraic graph theory: each sheaf has invariants associated to it—such as Betti numbers and Laplacian matrices—that generalize those in classical graph theory. We shall use “Galois graph theory” to reduce the Strengthened Hanna Neumann Conjecture to showing that certain sheaves, that we call ρ \rho -kernels, have zero maximum excess. We use the symmetry in Galois theory to argue that if the Strengthened Hanna Neumann Conjecture is false, then the maximum excess of “most of” these ρ \rho -kernels must be large. We then give an inductive argument to show that this is impossible. Abstract for Appendix B. For a finite graph Z Z , r ¯ ( Z ) := e − v + t \bar {\mathrm {r}}(Z) := e-v+t , where e e , v v , and t t denote the number of edges, vertices, and tree components of Z Z , respectively. Let G G be a finite group, Z Z be a finite G G -free G G -graph, and X

Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.