OctoInformBeta

OpenAI preprint, September 2026 · §6. From separating filtrations to finite chains

Lemma 6.2: Component averages on subdivided simplices, controlled by the zero stratum and a finite vertex window

Flag counts bound sparse chain evaluations.

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 replacement of a subdivided simplex by component averages is an operation on exterior chains over complex vertex modules. Its evaluation by a complex linear functional depends on the flags of faces admitted by a separating filtration.

For a vertex set AA, let ℂ(A)\mathbb C^{(A)} be the finitely supported complex functions on AA, with coordinate vectors eae_a. For j≥−1j\geq-1, the exterior chain spaces and oriented vertex wedges are defined by (1). Ej(A)=⋀ℂj+1ℂ(A),[a0,…,aj]=ea0∧⋯∧eaj,E−1(A)=ℂ.E_j(A)=\bigwedge^{j+1}_{\mathbb C}\mathbb C^{(A)},\qquad [a_0,\ldots,a_j]=e_{a_0}\wedge\cdots\wedge e_{a_j},\qquad E_{-1}(A)=\mathbb C.(1) After fixing an order on the vertex set, the oriented simplex basis vector eFe_F of a finite vertex set FF is the wedge of its increasing enumeration. A vertex map f:A→Bf:A\to B has a linearization sending eae_a to ef(a)e_{f(a)}✦ and an induced map on each exterior power. An alternating function f:Ar→Bf:A^r\to B, where AA is a vertex set and BB is an abelian group, is a function that changes by the sign under a permutation and vanishes on repeated vertices.✦ For values in a complex vector space, its linear extension sends eFe_F to its value on the increasing enumeration of FF.✦

Let VV be a real normed vector space and KK a geometric simplicial complex in VV. Write [F]=conv⁡(F)[F]=\operatorname{conv}(F) for the convex hull of a finite vertex set and |K||K| for the realization. The vertex restriction L|PL|_P of a complex LL to P⊆VP\subseteq V keeps the faces whose vertices belong to PP✦; the geometric restriction L[P]L[P] keeps the faces whose convex hull lies in PP.✦ A complex LL respects PP if [F]∩P=conv⁡(F∩P)[F]\cap P=\operatorname{conv}(F\cap P) for every face FF of LL.✦

A subdivision of KK is a complex SS with |S|=|K||S|=|K| such that the convex hull of each face of SS lies in the convex hull of a face of KK, SS respects every [F][F] for FF a face of KK, and S|[F]S|_{[F]} has finitely many faces.✦ A complex LL refines a complex KK if LL is a subdivision of KK.✦ A marked subset ZZ of LL is a union of convex hulls of faces of LL.✦ Dimension drop from (T,P)(T,P) to (S,Z)(S,Z) means that whenever FF is a face of TT with [F]⊆P[F]\subseteq P, each face EE of SS with [E]⊆[F]∩Z[E]\subseteq[F]\cap Z has #E<#F\#E<\#F.✦

A marked point filtration Q=(Ti,Zi)Q=(T_i,Z_i) of KK of length nn is a sequence of pairs, indexed by 0≤i≤n0\leq i\leq n, in which TiT_i is a complex and ZiZ_i is marked in TiT_i, with Tn=KT_n=K and Zn=|K|Z_n=|K|. For i<ni<n, the complex TiT_i refines Ti+1T_{i+1}, the inclusion Zi⊆Zi+1Z_i\subseteq Z_{i+1} holds, and there is dimension drop from (Ti+1,Zi+1)(T_{i+1},Z_{i+1}) to (Ti,Zi)(T_i,Z_i).

A final triangulation face is a face FF of T0T_0.✦ For a face FF of the final triangulation T0T_0 of a marked point filtration Q=(Ti,Zi)Q=(T_i,Z_i), the vertex mean m(F)m(F), the least marked level ℓ(F)\ell(F), the filtration strata SiS_i, and the stratum component C(F)C(F) are given by (2); the vertex mean of the empty set is zero. m(F)=(#F)−1∑v∈Fv,ℓ(F)=min⁡{i:m(F)∈Zi},Si=Zi\⋃r<iZr,C(F)=the connected component of m(F) in Sℓ(F).\begin{aligned} m(F)&=(\#F)^{-1}\sum_{v\in F}v,& \ell(F)&=\min\{i:m(F)\in Z_i\},\\ S_i&=Z_i\setminus\bigcup_{r<i}Z_r,& C(F)&=\text{the connected component of }m(F)\text{ in }S_{\ell(F)}. \end{aligned}(2) Extend ℓ\ell to all finite subsets of VV by setting it to zero off the faces of T0T_0.✦ For a finite family Ω\Omega of finite vertex sets and z∈Z0z\in Z_0, a pointed flag in 𝒫k(Ω,z)\mathcal P_k(\Omega,z) is a chain F0⊂⋯⊂FkF_0\subset\cdots\subset F_k of faces of T0T_0 belonging to Ω\Omega, with F0={z}F_0=\{z\}, #Fi=i+1\#F_i=i+1, and [Fi]⊆Zi[F_i]\subseteq Z_i.✦ For z∉Z0z\notin Z_0, the pointed flag set is empty.

For a set FF of cardinality k+1k+1, its filtered flag count Nk(F)N_k(F) is defined by (3), where 𝟏\mathbf1 denotes an indicator. N0(F)=𝟏ℓ(F)=0,Nk+1(F)=𝟏ℓ(F)=k+1∑E⊂F#E=k+1Nk(E).N_0(F)=\mathbf1_{\ell(F)=0},\qquad N_{k+1}(F)=\mathbf1_{\ell(F)=k+1} \sum_{\substack{E\subset F\\\#E=k+1}}N_k(E).(3)✦ For a finite complex LL, let ℱr(L)\mathcal F_r(L) be its faces with rr vertices and put ν0(L)=#{F∈ℱ1(L):ℓ(F)=0}\nu_0(L)=\#\{F\in\mathcal F_1(L):\ell(F)=0\}.✦

Labeled Fundamental Chains

For a finite family ℱ\mathcal F of rr-vertex subsets and a coordinate map p:V→ℝrp:V\to\mathbb R^r, the fundamental chain c(ℱ,p)c(\mathcal F,p) is defined by (4); v0(F),…,vr−1(F)v_0(F),\ldots,v_{r-1}(F) is the increasing enumeration of FF. c(ℱ,p)=∑F∈ℱsgn⁡det⁡(p(vi(F))j)i,j=0r−1eF∈Er−1(V).c(\mathcal F,p)=\sum_{F\in\mathcal F} \operatorname{sgn}\det\bigl(p(v_i(F))_j\bigr)_{i,j=0}^{r-1}\,e_F \quad\in E_{r-1}(V).(4)✦ For a vertex set YY, a face labeling bb is a function assigning a vector of ℂ(Y)\mathbb C^{(Y)} to each finite subset of VV. The barycentric label map Bb:Ej(V)→Ej(Y)B_b:E_j(V)\to E_j(Y) associated to a face labeling bb is the complex linear map obtained by recursively coning the labeled boundary of a simplex with its label b(F)b(F); in degree −1-1 it is the identity.✦ The uniform vertex vector uAu_A of a finite set A⊆YA\subseteq Y is (#A)−1∑y∈Aey(\#A)^{-1}\sum_{y\in A}e_y, with value zero for A=⌀A=\varnothing.✦

Separating Families and Sparse Operators

Let Γ\Gamma be a connected locally finite graph on YY, with shortest-path metric dd, and fix n>0n>0 and R≥0R\geq0. Regard ℝ(Y)\mathbb R^{(Y)} as the coordinate-preserving subspace of ℓ2(Y)\ell^2(Y), with its induced Euclidean norm and Borel sets. A finitely supported probability measure pp on YY is a finitely supported real function with nonnegative coefficients summing to one.✦ For finitely supported probability measures p,qp,q on YY and a real function ff on YY, write Lip⁡(f)\operatorname{Lip}(f) for its Lipschitz constant with respect to dd; the expectation, expectation difference, dual transportation distance, and normalization are defined by (5). 𝔼p[f]=∑yp(y)f(y),Δp,q(f)=𝔼p[f]−𝔼q[f],W1(p,q)=supLip⁡(f)≤1Δp,q(f),ρn(p,q)=W1(p,q)n.\begin{aligned} \mathbb E_p[f]&=\sum_y p(y)f(y),& \Delta_{p,q}(f)&=\mathbb E_p[f]-\mathbb E_q[f],\\ W_1(p,q)&=\sup_{\operatorname{Lip}(f)\leq1}\Delta_{p,q}(f),& \rho_n(p,q)&=\frac{W_1(p,q)}{\sqrt n}. \end{aligned}(5) For a complex KYK_Y on YY, let KˆY\widehat K_Y be its standard realization in ℝ(Y)\mathbb R^{(Y)}. The barycentric probability measure pvp_v of v∈|KˆY|v\in|\widehat K_Y| has coefficients v(y)v(y) and support a face of KYK_Y. The realization distance ρ(v,w)\rho(v,w) is ρn(pv,pw)\rho_n(p_v,p_w) when both vectors belong to |KˆY||\widehat K_Y|, and zero otherwise.✦ For a finite set s⊆Ys\subseteq Y, its standard simplex has vertex set {ey:y∈s}\{e_y:y\in s\} and convex hull σs\sigma_s.✦

Let a group HH act on YY and a topological parameter space XX. Its vertex action on vectors is the linear reindexing h*ey=ehyh_*e_y=e_{hy}.✦ A locally constant subdivision family T(x)T(x) of KˆY\widehat K_Y over XX is a family of subdivisions indexed by x∈Xx\in X for which the face set of T(x)|σsT(x)|_{\sigma_s} is locally constant in xx for every face ss of KYK_Y.✦ A marked subdivision family Z(x)Z(x) for T(x)T(x) over XX is a family of subsets indexed by x∈Xx\in X such that Z(x)Z(x) is marked in T(x)T(x) and the face set of T(x)[Z(x)]|σsT(x)[Z(x)]|_{\sigma_s} is locally constant in xx.✦ Subdivision equivariance requires h*Fh_*F to be a face of T(hx)T(hx) whenever FF is a face of T(x)T(x)✦; marked equivariance requires h*Z(x)⊆Z(hx)h_*Z(x)\subseteq Z(hx).✦ An equivariant marked subdivision pair (T(x),Z(x))(T(x),Z(x)) over XX is a locally constant subdivision family T(x)T(x) of KˆY\widehat K_Y together with a marked subdivision family Z(x)Z(x) satisfying subdivision equivariance and marked equivariance.✦

A separating filtration 𝒬\mathcal Q of KˆY\widehat K_Y over XX of length nn and radius RR is a sequence of equivariant marked subdivision pairs whose evaluation Qx=(Ti(x),Zi(x))Q_x=(T_i(x),Z_i(x)) is a marked point filtration of KˆY\widehat K_Y. Each difference Zi+1(x)\Zi(x)Z_{i+1}(x)\setminus Z_i(x), for i<ni<n, has component diameter at most 2R2R for ρ\rho: any two points in any connected subset of that difference have distance at most 2R2R.

For the component averages, assume the stipulated simplicial hypothesis of the sparse chain construction. The vertex support of U⊆ℝ(Y)U\subseteq\mathbb R^{(Y)} is ⋃v∈Usupp⁡(v)\bigcup_{v\in U}\operatorname{supp}(v).✦ For a final face FF of QxQ_x, its component vertex set Ax(F)A_x(F) is the vertex support of Cx(F)C_x(F)✦, and its component weight is uAx(F)u_{A_x(F)}.✦ Choose a base vertex y0y_0. The extended face weight bxb_x is the face labeling on finite subsets of ℝ(Y)\mathbb R^{(Y)} whose value bx(F)b_x(F) is uAx(F)u_{A_x(F)} for faces of T0(x)T_0(x) and ey0e_{y_0} for other finite vertex sets.✦

For a subdivision TT of KˆY\widehat K_Y, its restricted simplex triangulation is LT(s)=T|σsL_T(s)=T|_{\sigma_s}.✦ The simplex coordinate chart χv\chi_v of a tuple v=(v0,…,vj)v=(v_0,\ldots,v_j) is the map from ℝ(Y)\mathbb R^{(Y)} to ℝj+1\mathbb R^{j+1} given by χv(a)=(a(v0),…,a(vj))\chi_v(a)=(a(v_0),\ldots,a(v_j)).✦ The ordered simplex subdivision associated to a tuple vv and a subdivision TT is the exterior chain c(ℱj+1(LT(s)),χv)c(\mathcal F_{j+1}(L_T(s)),\chi_v) when the image ss of vv is a face of KYK_Y, and zero otherwise.✦ The subdivision map DT:Ej(Y)→Ej(ℝ(Y))D_T:E_j(Y)\to E_j(\mathbb R^{(Y)}) is the linear extension of this alternating subdivision function; in degree −1-1 it is the induced exterior power map of y↦eyy\mapsto e_y.✦ The sparse chain operator family is the composition in (6). Px|Ej(Y)=Bbx∘DT0(x).P_x\big|_{E_j(Y)}=B_{b_x}\circ D_{T_0(x)}.(6)✦

The finite graph neighborhoods are defined recursively by 𝒩0(a)={a}\mathcal N_0(a)=\{a\} and 𝒩r+1(a)={a}∪⋃b∼a𝒩r(b)\mathcal N_{r+1}(a)=\{a\}\cup\bigcup_{b\sim a}\mathcal N_r(b).✦ The label window Wn,R(s)W_{n,R}(s) is the finite vertex set in (7). Wn,R(s)=⋃a∈s𝒩⌊2Rn⌋++n(a).W_{n,R}(s)=\bigcup_{a\in s}\mathcal N_{\lfloor2R\sqrt n\rfloor_++n}(a).(7)✦ Here ⌊t⌋+\lfloor t\rfloor_+ is the natural-number floor. Write νx(s)=μcount(Z0(x)∩σs)ℝ\nu_x(s)=\mu_{\mathrm{count}}(Z_0(x)\cap\sigma_s)_{\mathbb R}, where μcount\mu_{\mathrm{count}} is counting measure and its real value is zero at infinity.

The Claim

Theorem 1. Let QQ be a marked point filtration of KK of length nn, and suppose every face of KK has at most n+1n+1 vertices. For any finite family Ω\Omega, z∈Z0z\in Z_0, and k≤nk\leq n, the pointed flags satisfy (8). #𝒫k(Ω,z)≤2k.\#\mathcal P_k(\Omega,z)\leq2^k.(8)✦ Let LL be a finite geometric simplicial complex all of whose faces are faces of T0T_0. For k≤nk\leq n, the filtered flag count satisfies (9). ∑F∈ℱk+1(L)Nk(F)≤2kν0(L).\sum_{F\in\mathcal F_{k+1}(L)}N_k(F)\leq2^k\nu_0(L).(9)✦ Let W⊆YW\subseteq Y be finite, and let bb be a face labeling with b(E)=b(F)b(E)=b(F) whenever E⊆FE\subseteq F are faces of LL with ℓ(E)=ℓ(F)\ell(E)=\ell(F). Suppose every b(F)b(F) on LL is uAu_A for some nonempty A⊆WA\subseteq W. Let p:V→ℝn+1p:V\to\mathbb R^{n+1} and let ψ:En(Y)→ℂ\psi:E_n(Y)\to\mathbb C be complex linear. If M≥0M\geq0 and |ψ([w0,…,wn])|≤M|\psi([w_0,\ldots,w_n])|\leq M for all tuples with entries in WW, then (10) holds. |ψ(Bbc(ℱn+1(L),p))|≤M2nν0(L).\left|\psi\!\left(B_b\,c(\mathcal F_{n+1}(L),p)\right)\right| \leq M\,2^n\nu_0(L).(10)✦ Suppose every face of KYK_Y has at most n+1n+1 vertices. For the sparse operator family above, let x∈Xx\in X and let v=(v0,…,vn)v=(v_0,\ldots,v_n) be an injective tuple whose image ss is a face of KYK_Y. Let ψ:En(Y)→ℂ\psi:E_n(Y)\to\mathbb C be complex linear and M≥0M\geq0. If |ψ([w0,…,wn])|≤M|\psi([w_0,\ldots,w_n])|\leq M for every tuple with entries in Wn,R(s)W_{n,R}(s), then the sparse chain bound is (11). |ψ(Px[v0,…,vn])|≤M2nνx(s).\left|\psi\!\left(P_x[v_0,\ldots,v_n]\right)\right| \leq M\,2^n\nu_x(s).(11)✦

In the paper, the result reads: for every original top simplex σ\sigma and every parameter xx, at most 2n#(Z0(x)∩σ)2^n\#(Z_0(x)\cap\sigma) terms of its fundamental barycentric subdivision chain have nonzero images under the exterior replacement map.

What Is Checked

The flag estimates are stated over marked point filtrations with the face cardinality bound. The labeled chain estimate uses a finite subcomplex with uniform face labels; the sparse estimate uses the separating family over the graph realization with n>0n>0 and R≥0R\geq0. Every final face has its vertex mean in some marked stage of index at most nn.✦ The component vertex sets Ax(F)A_x(F) are finite.✦