OctoInformBeta

OpenAI preprint, September 2026 ยท The infinite coset complex ยท ยง3

Proposition 3.2: The simplex join projection commutes with boundary, and exactness descends through an increasing filtration

Relative exactness controls attachments and descent.

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

The chain problems concern attachment along the boundary of a simplex and descent from an increasing union of face families. Coefficients are in ๐”ฝ2\mathbb F_2. An abstract simplicial complex OO on a vertex set VV is a family โ„ฑ(O)\mathcal F(O) of finite subsets of VV containing the empty set and closed under taking subsets.โœฆ

A finite chain cc on a vertex set VV is a finitely supported ๐”ฝ2\mathbb F_2-valued function on the finite subsets of VV.โœฆ For a finite subset ฯƒ\sigma of VV, write eฯƒe_\sigma for the chain with coefficient one at ฯƒ\sigma and zero elsewhere. For a family PP of finite subsets of VV and a nonnegative integer rr, the chain space C(P)C(P) is the space of finite chains on VV supported on PP, and the grade rr chain space Cr(P)C_r(P) is the space of such chains supported on faces of cardinality rr, as in (1): R(V)=โจฯƒโІV,|ฯƒ|<โˆž๐”ฝ2eฯƒ,Pr={ฯƒโˆˆP:|ฯƒ|=r},C(P)={cโˆˆR(V):supp⁡(c)โІP},Cr(P)=C(Pr).\begin{aligned} R(V)&=\bigoplus_{\sigma\subseteq V,\ |\sigma|<\infty} \mathbb F_2 e_\sigma,\\ P_r&=\{\sigma\in P:|\sigma|=r\},\\ C(P)&=\{c\in R(V):\operatorname{supp}(c)\subseteq P\}, \qquad C_r(P)=C(P_r). \end{aligned}(1) Grade rr corresponds to augmented simplicial degree rโˆ’1r-1. The simplicial boundary โˆ‚\partial is the linear map on R(V)R(V) defined by (2): โˆ‚eฯƒ=โˆ‘vโˆˆฯƒeฯƒ\{v}.\partial e_\sigma=\sum_{v\in\sigma}e_{\sigma\setminus\{v\}}.(2)โœฆ

Exactness Er(P)E_r(P) in grade rr for a family PP of finite subsets of VV is the condition that every grade rr cycle supported on PP is the boundary of a grade r+1r+1 chain supported on PP.โœฆ Relative exactness Er(P,Q)E_r(P,Q) in grade rr for two families PP and QQ of finite subsets of VV is the condition that every grade rr chain supported on QQ whose boundary is supported on PP differs from a boundary in QQ by a grade rr chain supported on PP.โœฆ Er(P):cโˆˆCr(P),โˆ‚c=0โ‡’โˆƒbโˆˆCr+1(P),โˆ‚b=c,Er(P,Q):cโˆˆCr(Q),โˆ‚cโˆˆC(P)โ‡’โˆƒbโˆˆCr+1(Q),cโˆ’โˆ‚bโˆˆCr(P).\begin{aligned} E_r(P):\quad& c\in C_r(P),\ \partial c=0 \ \Longrightarrow\ \exists b\in C_{r+1}(P),\ \partial b=c,\\ E_r(P,Q):\quad& c\in C_r(Q),\ \partial c\in C(P) \ \Longrightarrow\ \exists b\in C_{r+1}(Q),\ c-\partial b\in C_r(P). \end{aligned}(3)

The Attachment

Let WW be a vertex set disjoint from VV, and let FโІWF\subseteq W be finite. The simplex join F*OF*O is the family of faces whose WW part is contained in FF and whose VV part is a face of OO.โœฆ The boundary attachment โˆ‚F*O\partial F*O of the simplex join F*OF*O is the family of faces of F*OF*O whose WW part is a proper subset of FF.โœฆ For a subset AA of WW and a finite subset ฯƒ\sigma of VV, write AโŠ”ฯƒA\sqcup\sigma for their union in the disjoint union of the vertex sets; these families are given by (4): F*O={AโŠ”ฯƒ:AโІF,ฯƒโˆˆโ„ฑ(O)},โˆ‚F*O={AโŠ”ฯƒ:AโŠŠF,ฯƒโˆˆโ„ฑ(O)}.\begin{aligned} F*O&=\{A\sqcup\sigma:A\subseteq F,\ \sigma\in\mathcal F(O)\},\\ \partial F*O&=\{A\sqcup\sigma:A\subsetneq F,\ \sigma\in\mathcal F(O)\}. \end{aligned}(4)

The relative join projection pF:R(WโŠ”V)โ†’R(V)p_F:R(W\sqcup V)\longrightarrow R(V) is the linear map that retains the coefficient of each face containing the whole FF block and removes that block, as specified in (5): pF(eAโŠ”ฯƒ)={eฯƒ,A=F,0,Aโ‰ F.p_F(e_{A\sqcup\sigma})= \begin{cases} e_\sigma,&A=F,\\ 0,&A\ne F. \end{cases}(5)โœฆ

The Claim

Theorem 1. Let OO be an abstract simplicial complex on VV, and let FF be a finite subset of a disjoint vertex set WW. For every cโˆˆC(F*O)c\in C(F*O), the projection and boundary satisfy (6): pF(โˆ‚c)=โˆ‚(pFc).p_F(\partial c)=\partial(p_Fc).(6)โœฆ

Let rโ‰ฅ0r\geq0. Assume Erโˆ’|F|(โ„ฑ(O))E_{r-|F|}(\mathcal F(O)) whenever |F|โ‰คr|F|\leq r. Then the attachment has the relative exactness in (7): Er(โˆ‚F*O,F*O).E_r(\partial F*O,F*O).(7)โœฆ

Let (Pm)mโ‰ฅ0(P_m)_{m\geq0} be an increasing sequence of families of finite subsets of a vertex set. Assume Er+1(Pm,Pm+1)E_{r+1}(P_m,P_{m+1}) for every mโ‰ฅ0m\geq0 and Er(โ‹ƒmโ‰ฅ0Pm)E_r(\bigcup_{m\geq0}P_m). Then exactness descends as in (8): Er(P0).E_r(P_0).(8)โœฆ

In the paper, the result reads: for the infinite coset complex L=CC⁡(U;(Hi))L=\operatorname{CC}(U;(H_i)) of a group UU relative to subgroups HiH_i, with construction parameter nn, with qq chosen as in the construction and qโ‰ฅ2nโˆ’1q\geq2^{n-1} for the spherical opposition input, Hฬƒj(L;๐”ฝ2)=0\widetilde H_j(L;\mathbb F_2)=0 for 0โ‰คj<nโˆ’10\leq j<n-1.

What Is Checked

The claims are stated over finitely supported ๐”ฝ2\mathbb F_2-chains on abstract simplicial complexes for the attachment statements, and over arbitrary increasing families of finite subsets for filtration descent.