OctoInformBeta

OpenAI preprint, September 2026 · §2. A vanishing theorem for sparse simplicial cycles

Theorem 2.1: In high simplicial dimension, with an explicit graph degree threshold and an equivariant zero-stratum criterion

Invariant cocycles vanish on sparse cycles.

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 HH be a group acting on a vertex set YY. Simplicial chains on YY are ℂ[H]\mathbb C[H]-modules through the vertex action. The pairing under consideration is between their coinvariant cycles and HH-invariant complex exterior cocycles, with simplex supports constrained by a graph on YY.

The vertex vector space V=ℂ(Y)V=\mathbb C^{(Y)} consists of finitely supported complex functions on YY, with basis vectors eye_y.✦ Its exterior algebra is ⋀V\bigwedge V.✦ The exterior chain space EjE_j and the oriented vertex wedge have the notation (1), with E−1=ℂE_{-1}=\mathbb C in augmented degree −1-1. Ej=⋀j+1V,[y0,…,yj]=ey0∧⋯∧eyj.E_j=\bigwedge^{j+1}V,\qquad [y_0,\ldots,y_j]=e_{y_0}\wedge\cdots\wedge e_{y_j}.(1) For a module MM over a commutative ring RR and a linear functional α:M→R\alpha:M\to R, contraction ια\iota_\alpha is the antiderivation of ⋀RM\bigwedge_R M that lowers exterior degree by one and equals α\alpha on MM.✦ The augmentation ε:V→ℂ\varepsilon:V\to\mathbb C and the boundary ∂=ιε\partial=\iota_\varepsilon are given by (2); the graded boundary is its restriction Ej→Ej−1E_j\to E_{j-1}.✦ ε(∑yayey)=∑yay,∂[y0,…,yj]=∑i=0j(−1)i[y0,…,yˆi,…,yj].\varepsilon\left(\sum_y a_y e_y\right)=\sum_y a_y,\qquad \partial[y_0,\ldots,y_j] =\sum_{i=0}^{j}(-1)^i[y_0,\ldots,\widehat y_i,\ldots,y_j].(2) For a vertex map f:Y→Zf:Y\to Z, the linearized vertex map f*f_* sends eye_y to ef(y)e_{f(y)} and sums coefficients over fibers✦; its induced exterior map sends a vertex wedge to the wedge of its images.✦ Write h*h_* for these maps under the action of h∈Hh\in H.

An abstract simplicial complex KK on YY is a family of finite subsets of YY containing the empty set and closed under taking subsets.✦ The augmentation K+K^+ of a complex KK whose faces are nonempty is the complex obtained by adjoining the empty face to KK.✦ An HH-invariant simplicial complex KK on YY is a simplicial complex whose every face has a face as its translate under every element of HH.✦ For a simplicial complex KK on YY, the chain space Cj(K)C_j(K), the subspace Rj(K)R_j(K) of coinvariant relations, and the quotient chain space Cj(K)HC_j(K)_H are defined by (3). Cj(K)=span⁡ℂ{[y0,…,yj]:{y0,…,yj}∈K+},Rj(K)=span⁡ℂ{h*a−a:h∈H,a∈Cj(K)},Cj(K)H=Cj(K)/Rj(K).\begin{split} C_j(K)&=\operatorname{span}_{\mathbb C} \{[y_0,\ldots,y_j]:\{y_0,\ldots,y_j\}\in K^+\},\\ R_j(K)&=\operatorname{span}_{\mathbb C} \{h_*a-a:h\in H,\ a\in C_j(K)\},\qquad C_j(K)_H=C_j(K)/R_j(K). \end{split}(3) For a simplicial degree nn, an invariant cocycle ψ:En→ℂ\psi:E_n\to\mathbb C is a complex linear functional with ψ(h*u)=ψ(u)\psi(h_*u)=\psi(u) and ψ(∂v)=0\psi(\partial v)=0 for u∈Enu\in E_n and v∈En+1v\in E_{n+1}. A chain c∈Cn(K)c\in C_n(K) represents a coinvariant cycle when ∂c∈Rn−1(K)\partial c\in R_{n-1}(K).

Let Γ\Gamma be a connected simple graph on YY. The graph metric dΓ(u,v)d_\Gamma(u,v) of a connected simple graph Γ\Gamma on YY is the shortest path distance between its vertices uu and vv, regarded as a real number.✦

The set Σn(K)\Sigma_n(K) of top-dimensional simplices consists of faces σ\sigma with |σ|=n+1|\sigma|=n+1; its induced action is hσ={hy:y∈σ}h\sigma=\{hy:y\in\sigma\}.

Realization and Separating Filtrations

The real vertex vector space W=ℝ(Y)W=\mathbb R^{(Y)} has the Euclidean norm induced by its natural linear embedding into ℓ2(Y)\ell^2(Y), and the Borel measurable sets of this topology. Write δy\delta_y for its vertex basis vector. The standard simplex vertex set associated to a face σ\sigma is {δy:y∈σ}\{\delta_y:y\in\sigma\}.✦ The closed simplex Δσ\Delta_\sigma associated to a face σ\sigma of KK is the convex hull of its standard simplex vertex set in WW; the geometric realization 𝒦\mathcal K of KK has underlying space |K||K| equal to the union of these closed simplices.

A finitely supported probability pp on YY is a finitely supported real function with nonnegative coefficients and total mass one.✦ For finitely supported probabilities p,qp,q on YY and a real function ff on YY, their expectations and expectation difference are defined in (4). 𝔼p[f]=∑y∈Yp(y)f(y),gap⁡p,q(f)=𝔼p[f]−𝔼q[f].\mathbb E_p[f]=\sum_{y\in Y}p(y)f(y),\qquad \operatorname{gap}_{p,q}(f)=\mathbb E_p[f]-\mathbb E_q[f].(4) For such probabilities, the dual transportation distance W1W_1 and its normalized version ρ\rho are defined by (5), using dΓd_\Gamma to measure Lipschitz constants. W1(p,q)=supLip⁡(f)≤1gap⁡p,q(f),ρ(p,q)=W1(p,q)n.W_1(p,q)=\sup_{\operatorname{Lip}(f)\leq1} \operatorname{gap}_{p,q}(f),\qquad \rho(p,q)=\frac{W_1(p,q)}{\sqrt n}.(5) The barycentric probability pvp_v associated to v∈|K|v\in|K| has coefficient function vv.✦ The realization distance on WW is ρ(pv,pw)\rho(p_v,p_w) when both arguments lie in |K||K|, and zero otherwise.✦

For a geometric complex BB and a subset PP of its ambient vector space, the vertex restriction B|PB|_P is the geometric subcomplex of BB consisting of faces whose vertices lie in PP✦; the geometric restriction of BB to PP is the geometric subcomplex consisting of faces whose entire closed simplices lie in PP.✦ A geometric complex BB respects a subset PP of its ambient vector space if every face ss of BB satisfies [s]∩P=conv⁡(s∩P)[s]\cap P=\operatorname{conv}(s\cap P), where [s]=conv⁡(s)[s]=\operatorname{conv}(s).✦

A subdivision LL of BB is a geometric complex with the same underlying space, each of whose closed simplices lies in a closed simplex of BB, which respects every closed simplex of BB and has only finitely many faces with vertices in each such simplex.✦ The relation that LL refines BB means that LL is a subdivision of BB.✦ A locally constant subdivision family (Tx)x∈X(T_x)_{x\in X} of 𝒦\mathcal K, for a topological space XX, is a family of subdivisions whose vertex restrictions to each original closed simplex have locally constant face sets as functions of xx.✦

A marked subset PP of a geometric complex is a union of its closed simplices.✦ A marked family (Px)x∈X(P_x)_{x\in X} for (Tx)(T_x) consists of marked subsets of TxT_x for which the faces lying geometrically in PxP_x and having vertices in each original closed simplex form a locally constant family.✦ The action on real vertex vectors is (h*v)(y)=v(h−1y)(h_*v)(y)=v(h^{-1}y).✦ For an action of HH on the parameter space XX, subdivision equivariance means Thx=h*TxT_{hx}=h_*T_x, and marked equivariance means Phx=h*PxP_{hx}=h_*P_x; an equivariant marked subdivision pair has both properties.

A separating filtration QQ of 𝒦\mathcal K, of length nn and radius RR, is a sequence of equivariant marked subdivision pairs (Ti,x,Pi,x)i≥0(T_{i,x},P_{i,x})_{i\geq0} with Tn,x=𝒦T_{n,x}=\mathcal K and Pn,x=|K|P_{n,x}=|K|. For i<ni<n, the complex Ti,xT_{i,x} refines Ti+1,xT_{i+1,x} and Pi,x⊆Pi+1,xP_{i,x}\subseteq P_{i+1,x}. The dimension drop condition for a separating filtration QQ requires that, for a face FF of Ti+1,xT_{i+1,x} with [F]⊆Pi+1,x[F]\subseteq P_{i+1,x}, every face EE of Ti,xT_{i,x} with [E]⊆[F]∩Pi,x[E]\subseteq[F]\cap P_{i,x} satisfies |E|<|F||E|<|F|.✦ The component diameter condition for a separating filtration QQ of radius RR requires that every connected subset of Pi+1,x\Pi,xP_{i+1,x}\setminus P_{i,x} has diameter at most 2R2R for the realization distance.✦

The zero stratum P0,xP_{0,x} of a separating filtration QQ at xx is its marked subset at level zero. For a probability measure μ\mu on XX, the average count bQ(σ)b_Q(\sigma) of the zero stratum of a separating filtration QQ in a top simplex σ\sigma of KK is the integral in (6). Here count\operatorname{count} takes values in [0,∞][0,\infty], and tℝt_{\mathbb R} means tt for finite tt, with (∞)ℝ=0(\infty)_{\mathbb R}=0. bQ(σ)=∫X(count⁡(P0,x∩Δσ))ℝdμ(x).b_Q(\sigma)=\int_X \bigl(\operatorname{count}(P_{0,x}\cap\Delta_\sigma)\bigr)_{\mathbb R} \,d\mu(x).(6)

The volume threshold for a graph degree bound DD is the integer N(D)N(D) defined by (7). N(D)=(4D3+D+3)2.N(D)=(4D^3+D+3)^2.(7)✦

The Claim

Theorem 1. Let HH act by graph automorphisms on Γ\Gamma and freely on a compact probability parameter space (X,μ)(X,\mu), preserving μ\mu. Let KK be an HH-invariant complex generated by its nn-simplices, whose top simplex vertices span connected subgraphs. Let ψ:En→ℂ\psi:E_n\to\mathbb C be an invariant cocycle, and let c∈Cn(K)c\in C_n(K) satisfy ∂c∈Rn−1(K)\partial c\in R_{n-1}(K).

Suppose D≥2D\geq2, every vertex of Γ\Gamma has at most DD neighbors, and n≥N(D)n\geq N(D). Let FF be a finite family of faces of KK such that every face is hτh\tau for some h∈Hh\in H and τ∈F\tau\in F, and choose y0∈Yy_0\in Y. Then ψ(c)=0.\psi(c)=0.(8)✦

Alternatively, fix a radius RR and nonnegative constants C(σ)C(\sigma) for σ∈Σn(K)\sigma\in\Sigma_n(K). Suppose that for every ϵ>0\epsilon>0 there is a separating filtration QQ of length nn and radius RR such that bQ(σ)≤C(σ)ϵb_Q(\sigma)\leq C(\sigma)\epsilon for every σ∈Σn(K)\sigma\in\Sigma_n(K). Then ψ(c)=0.\psi(c)=0.(9)✦

In the paper, the result reads: for every integer D≥2D\geq2 there is an integer n0(D)n_0(D) such that, whenever a countable group HH acts by graph automorphisms freely on the vertices YY of a countable connected simple graph of degree at most DD, n≥n0(D)n\geq n_0(D), and KK is an HH-invariant subcomplex of the full simplex on YY, generated by its nn-simplices, with finitely many HH-orbits of simplices and connected subgraphs spanned by the vertices of each nn-simplex, every HH-invariant cocycle ψ:En→ℂ\psi:E_n\to\mathbb C, without a global boundedness hypothesis, evaluates to zero on the image in the coinvariant quotient (En)H(E_n)_H of every cycle of Cn(K)HC_n(K)_H.

What Is Checked

The claims (8) and (9) are stated over the augmented simplicial chain spaces and their coinvariant relations, with the graph degree and orbit data in the first case and equivariant marked subdivision families with a zero-stratum estimate in the second.

The boundary sends Cj(K)C_j(K) into Cj−1(K)C_{j-1}(K)✦, and the augmented complex K+K^+ is invariant under the vertex action.✦

Every realization point admits its barycentric probability with support a face of KK.✦

The graph metric statement (10) is stated over graph automorphisms.

Theorem 2. Let HH act by graph automorphisms on a connected simple graph Γ\Gamma. For every h∈Hh\in H, dΓ(hu,hv)=dΓ(u,v)(u,v∈Y).d_\Gamma(hu,hv)=d_\Gamma(u,v)\qquad(u,v\in Y).(10)✦