Cluster k1093
Acyclic cone complexes, plus bounds on cohomology of arithmetic groups
Two different jobs share this cluster. One job is geometric: building chains out of simplices (points, edges, triangles, and so on) over convex cones in a real vector space, showing the boundary of a boundary is zero and that certain nerve complexes have no holes ("acyclic"). The other job is arithmetic: bounding the size of the cohomology (a measure of group symmetry) of finite-index subgroups of GL_n over a number field, using adelic double cosets and orbit counts. Many files state or chain together partial bounds.
5 import steps from the main theorem.
Proof status: on 21 Nov 2026 the Lean FRO and the Mathlib Initiative certified the Lean statement and proof (latest check). Names and descriptions on this map are written by Claude from samples of the code and may be wrong.
Prerequisite concepts
Chain complexes, homology and exact sequencesTopology: open sets, closed sets, compact and connected setsFinite sets and countingLinear algebraGroup homology: measuring how a group acts on a vector space
References
Hatcher, Algebraic Topology · ch. 2, sect. 2.1 and 4G (nerve)Background reading suggested by the AI namer · unchecked
Uses
Used by
69 Lean files, main folder Development.AutomorphicArithmetic.AutomorphicVarieties.ConvexNerveComplexes.