The Setting
Let be a prime and an integer. At a nonnegative level , write for the finite congruence quotient in matrix size , and write , for , for its reduced local subgroups.
A finite simplicial complex is a pair consisting of a finite vertex set and a family of subsets of that contains the empty set and every vertex singleton and is closed under taking subsets.✦
For a finite group and a family of subgroups of , the typed coset vertex set consists of the pairs in (1), retaining the type of each left coset: (1) The chamber represented by is the set in (2), with one vertex of each type: (2)✦ The coset complex has vertex set and the face family in (3): (3)✦ The finite quotient coset complex is the coset complex of with its reduced local subgroups, as specified in (4): (4)✦
The one-skeleton of a finite simplicial complex is the graph on in which distinct vertices are adjacent when . A finite simplicial complex is connected when its vertex set is nonempty and every pair of vertices is joined by a finite path in its one-skeleton, allowing a path of length zero.✦
The Claim
Theorem 1. Let be a prime, let be an integer, and let be an integer. Then (5)✦
In the paper, the result reads: under the preceding construction and largeness assumptions, is connected for .
What Is Checked
The assertion (5) is stated over the finite congruence quotient and its reduced local subgroups , with prime, and . The face family in (3) satisfies the defining conditions of a finite simplicial complex.