图上的层及其同调不变量和Hanna Neumann猜想的证明
Sheaves on Graphs, Their Homological Invariants, and a Proof of the Hanna Neumann Conjecture
摘要:
本文建立了关于图上向量空间层及其不变量的一些基础,如同调群及其极限。然后,我们用这些想法来证明汉娜诺依曼猜想的1950年的,事实上,我们证明了一个加强形式的猜想。我们引入了一个概念的一层向量空间的图,并发展的基础同调论这样的层。一个层不变量,它的“最大过剩”,有许多显着的性质。它有一个简单的定义,没有提到同调论,类似于图的扩展。然而,它是贝蒂数的“极限”,因此有一个短/长正合序列理论,类似于阿蒂亚的$L^2$贝蒂数。此外,最大超额是通过一个超模函数定义的,它给出了比典型的贝蒂数更强的最大超额性质。我们的层理论可以被看作是代数图论的一个巨大的推广:每个层都有与之相关的不变量-如贝蒂数和拉普拉斯矩阵-这些不变量推广了经典图论中的不变量。我们将使用“伽罗瓦图论“来简化加强的汉娜·诺伊曼猜想,以表明我们称之为$ρ$ -核的某些层具有零最大过剩。我们使用伽罗瓦论中的对称性来论证,如果加强的汉娜·诺依曼猜想是假的,那么这些$ρ$ -核的“大多数”的最大过剩一定是大的。然后,我们给出一个归纳论证来证明这是不可能的。
英文摘要:
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$ 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 $ρ$-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 $ρ$-kernels must be large. We then give an inductive argument to show that this is impossible.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。