OctoInformBeta

OpenAI preprint, September 2026 · Homology and the finite quotients · §4

Proposition 4.2 (connectedness): For every prime qq, dimension parameter n≥2n\geq2 and quotient level m≥1m\geq1

The finite quotient coset complexes are connected.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Let qq be a prime and n≥1n\geq1 an integer. At a nonnegative level mm, write GmG_m for the finite congruence quotient in matrix size n+1n+1, and write Hi,m≤GmH_{i,m}\leq G_m, for 0≤i≤n0\leq i\leq n, for its reduced local subgroups.

A finite simplicial complex X=(V,ℱ)X=(V,\mathcal F) is a pair consisting of a finite vertex set VV and a family ℱ\mathcal F of subsets of VV that contains the empty set and every vertex singleton and is closed under taking subsets.✦

For a finite group GG and a family H=(H0,…,Hn)H=(H_0,\ldots,H_n) of subgroups of GG, the typed coset vertex set V(H)V(H) consists of the pairs in (1), retaining the type ii of each left coset: V(H)={(i,gHi):0≤i≤n,g∈G}.V(H)=\{(i,gH_i):0\leq i\leq n,\ g\in G\}.(1) The chamber CH(g)C_H(g) represented by g∈Gg\in G is the set in (2), with one vertex of each type: CH(g)={(i,gHi):0≤i≤n}.C_H(g)=\{(i,gH_i):0\leq i\leq n\}.(2)✦ The coset complex 𝒞(G,H)\mathcal C(G,H) has vertex set V(H)V(H) and the face family ℱH\mathcal F_H in (3): ℱH={σ⊆V(H):there exists g∈G with σ⊆CH(g)}.\mathcal F_H =\{\sigma\subseteq V(H):\text{there exists }g\in G \text{ with }\sigma\subseteq C_H(g)\}.(3)✦ The finite quotient coset complex TmT_m is the coset complex of GmG_m with its reduced local subgroups, as specified in (4): Tm=𝒞(Gm,(Hi,m)i=0n).T_m=\mathcal C\bigl(G_m,(H_{i,m})_{i=0}^{n}\bigr).(4)✦

The one-skeleton of a finite simplicial complex X=(V,ℱ)X=(V,\mathcal F) is the graph on VV in which distinct vertices a,ba,b are adjacent when {a,b}∈ℱ\{a,b\}\in\mathcal F. A finite simplicial complex X=(V,ℱ)X=(V,\mathcal F) is connected when its vertex set VV 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 qq be a prime, let n≥2n\geq2 be an integer, and let m≥1m\geq1 be an integer. Then Tm is connected.T_m\text{ is connected}.(5)✦

In the paper, the result reads: under the preceding construction and largeness assumptions, TmT_m is connected for m≥2m\geq2.

What Is Checked

The assertion (5) is stated over the finite congruence quotient GmG_m and its reduced local subgroups Hi,mH_{i,m}, with qq prime, n≥2n\geq2 and m≥1m\geq1. The face family in (3) satisfies the defining conditions of a finite simplicial complex.