OctoInformBeta

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

The relative-chain shift in a codistance block: Exactness and relative exactness in the grading by face cardinality

Filling chains relative to an attaching family.

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

An attachment gives a filling problem in which a chain may leave a remainder on the attaching locus. The library defines absolute and relative exactness for families of finite faces, with chains graded by the number of vertices in a face.

Let VV be a vertex set and let ๐”ฝ2\mathbb F_2 be the field of integers modulo 22.โœฆ The space ๐’ž(V)\mathcal C(V) of finitely supported simplicial chains on VV is the vector space of finitely supported functions from finite subsets of VV to ๐”ฝ2\mathbb F_2.โœฆ For a finite subset sโІVs\subseteq V, the basis chain [s][s] takes value 11 at ss and 00 elsewhere. The support supp⁡(c)\operatorname{supp}(c) of a chain cc is the set of finite subsets on which its coefficient is nonzero.

For a family PP of finite subsets of VV, the subspace ๐’ž(P)\mathcal C(P) of chains supported on PP is defined by (1): ๐’ž(P)={cโˆˆ๐’ž(V):supp⁡(c)โІP}.\mathcal C(P)=\{c\in\mathcal C(V):\operatorname{supp}(c)\subseteq P\}.(1)โœฆ For a family PP of finite subsets of VV and nโˆˆโ„•n\in\mathbb N, the cardinality-nn subfamily PnP_n consists of the members of PP with nn vertices, and Cn(P)C_n(P) is the subspace of ๐’ž(V)\mathcal C(V) supported on PnP_n, as in (2): Pn={sโˆˆP:|s|=n},Cn(P)=๐’ž(Pn).P_n=\{s\in P:|s|=n\},\qquad C_n(P)=\mathcal C(P_n).(2) Raw degree nn corresponds to augmented simplicial degree nโˆ’1n-1.

The simplicial boundary โˆ‚\partial on ๐’ž(V)\mathcal C(V) is the linear map determined by the vertex deletion rule (3): โˆ‚[s]=โˆ‘vโˆˆs[s\{v}].\partial[s]=\sum_{v\in s}[s\setminus\{v\}].(3)โœฆ

The Definition

Definition 1. Let PP and QQ be families of finite subsets of VV, and let nโˆˆโ„•n\in\mathbb N. A family PP of finite subsets of a vertex set VV is exact in raw degree nโˆˆโ„•n\in\mathbb N if every chain cโˆˆCn(P)c\in C_n(P) with โˆ‚c=0\partial c=0 admits a filling as in (4): bโˆˆCn+1(P),โˆ‚b=c.b\in C_{n+1}(P),\qquad \partial b=c.(4)โœฆ For families PP and QQ of finite subsets of a vertex set VV and nโˆˆโ„•n\in\mathbb N, the family QQ is exact relative to PP in raw degree nn if every chain cโˆˆCn(Q)c\in C_n(Q) with โˆ‚cโˆˆ๐’ž(P)\partial c\in\mathcal C(P) admits a chain satisfying (5): bโˆˆCn+1(Q),cโˆ’โˆ‚bโˆˆCn(P).b\in C_{n+1}(Q),\qquad c-\partial b\in C_n(P).(5)โœฆ

In the paper, the result reads: for a nonidentity codistance ww with nonempty descent set DD in the type set SS and J=S\DJ=S\setminus D, the block is F*OF*O, where FF has |D||D| vertices and OO is the opposition complex in a spherical JJ-residue, the attaching locus is โˆ‚F*O\partial F*O, and the surviving relative faces contain all of FF, yielding the chain isomorphism (6): Ck(F*O,โˆ‚F*O;๐”ฝ2)โ‰…Cฬƒkโˆ’|D|(O;๐”ฝ2).C_k(F*O,\partial F*O;\mathbb F_2) \cong \widetilde C_{k-|D|}(O;\mathbb F_2).(6)

What Is Checked

The definitions (4) and (5) are stated over a vertex set VV, families P,QP,Q of finite subsets of VV, and a raw degree nโˆˆโ„•n\in\mathbb N, using finitely supported chains over ๐”ฝ2\mathbb F_2 and their simplicial boundary.