OctoInformBeta

OpenAI preprint, September 2026 · §4. Equivariant separating filtrations

Lemma 4.2: Generic levels and equivariant ball replacements for admissible steps

Compatible refinements for spherical filtration cuts.

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 XX be a topological space and KK a geometric simplicial complex in a real normed space VV. A separating filtration step concerns a marked subset P(x)P(x) of |K||K| and a smaller marked subset Z(x)Z(x), with dimension measured along the original simplices and component diameter measured on P(x)\Z(x)P(x)\setminus Z(x). Write ⟨F⟩\langle F\rangle for the convex hull of a finite vertex set FF.

A marked subset PP of KK is a union of convex hulls of faces of KK: every p∈Pp\in P belongs to some ⟨F⟩⊆P\langle F\rangle\subseteq P, with FF a face of KK.✦ For Q⊆VQ\subseteq V, the geometric restriction K[Q]K[Q] and the vertex restriction K|QK|_Q have the face sets in (1); compatibility of KK with QQ means the last equality there holds for every face FF of KK. Faces⁡(K[Q])={F∈Faces⁡(K):⟨F⟩⊆Q},Faces⁡(K|Q)={F∈Faces⁡(K):F⊆Q},⟨F⟩∩Q=conv⁡(F∩Q).\begin{aligned} \operatorname{Faces}(K[Q]) &=\{F\in\operatorname{Faces}(K):\langle F\rangle\subseteq Q\},\\ \operatorname{Faces}(K|_Q) &=\{F\in\operatorname{Faces}(K):F\subseteq Q\},\\ \langle F\rangle\cap Q&=\operatorname{conv}(F\cap Q). \end{aligned}(1)

A simplicial subdivision LL of KK is a geometric complex with |L|=|K||L|=|K| such that each simplex of LL lies in an original simplex, LL is compatible with every original simplex, and L|⟨F⟩L|_{\langle F\rangle} has finitely many faces for every face FF of KK.✦ Write L≼KL\preceq K when LL is such a subdivision.✦ A locally constant subdivision family TT over XX assigns a subdivision T(x)T(x) to each xx, with the face set of T(x)|⟨F⟩T(x)|_{\langle F\rangle} locally constant in xx for each original face FF; write 𝒮X(K)\mathscr S_X(K) for these families.✦ A marked family PP for TT assigns a marked subset P(x)P(x) of T(x)T(x) to each xx, with the face set of T(x)[P(x)]|⟨F⟩T(x)[P(x)]|_{\langle F\rangle} locally constant in xx for each original FF.✦

For complexes T,ST,S and subsets P,Z⊆VP,Z\subseteq V, dimension drop 𝖣(T,S;P,Z)\mathsf D(T,S;P,Z) is the condition in (2). For a subset QQ of VV, a real bound DD, and a function ρ:V×V→ℝ\rho:V\times V\to\mathbb R, the component diameter condition 𝖢ρ(Q;D)\mathsf C_\rho(Q;D) requires every preconnected subset of QQ to have pairwise ρ\rho-distance at most DD, as specified in (2).✦ 𝖣(T,S;P,Z)⇔F∈Faces⁡(T),⟨F⟩⊆P,E∈Faces⁡(S),⟨E⟩⊆⟨F⟩∩Z⇒|E|<|F|;𝖢ρ(Q;D)⇔ρ(p,q)≤Dfor all p,q∈C⊆Q with C preconnected.\begin{aligned} \mathsf D(T,S;P,Z)\quad&\Longleftrightarrow\quad \begin{gathered} F\in\operatorname{Faces}(T),\quad \langle F\rangle\subseteq P,\\ E\in\operatorname{Faces}(S),\quad \langle E\rangle\subseteq\langle F\rangle\cap Z \quad\Longrightarrow\quad |E|<|F|; \end{gathered}\\ \mathsf C_\rho(Q;D)\quad&\Longleftrightarrow\quad \rho(p,q)\leq D\quad \text{for all }p,q\in C\subseteq Q\text{ with }C\text{ preconnected}. \end{aligned}(2)

An admissible step 𝒜=(T′,Z)\mathcal A=(T',Z) for (T,P,ρ,R)(T,P,\rho,R) consists of a family T′∈𝒮X(K)T'\in\mathscr S_X(K) refining TT at each parameter, with P(x)P(x) still marked in T′(x)T'(x), and a marked family ZZ for T′T' satisfying Z(x)⊆P(x)Z(x)\subseteq P(x), 𝖣(T(x),T′(x);P(x),Z(x))\mathsf D(T(x),T'(x);P(x),Z(x)), and 𝖢ρ(P(x)\Z(x);2R)\mathsf C_\rho(P(x)\setminus Z(x);2R) for every xx.✦ Denote the set of these steps by Adm⁡ρR(T,P)\operatorname{Adm}_\rho^R(T,P).

Affine Cuts and Patch Triangulations

Universal cutting data dd on VV consist of linear forms aja_j and positive levels bjb_j indexed by a set JJ, and a finite set JFJ_F of relevant indices in JJ for every finite vertex set FF, such that aja_j vanishes throughout ⟨F⟩\langle F\rangle when j∉JFj\notin J_F.✦ Locally finite cutting data on KK impose this condition only for faces FF of KK.✦ Restricting universal data to KK gives such cutting data.✦ For a finite index set AA and Q⊆VQ\subseteq V, the closed halfspace patch QAQ_A and its level boundary ∂dQA\partial_d Q_A are defined by (3). QA=Q∩⋂j∈A{v:aj(v)≤bj},∂dQA=QA∩⋃j∈A{v:aj(v)=bj}.Q_A=Q\cap\bigcap_{j\in A}\{v:a_j(v)\leq b_j\}, \qquad \partial_d Q_A=Q_A\cap\bigcup_{j\in A}\{v:a_j(v)=b_j\}.(3)

A halfspace cell, or halfspace polyhedron, QQ in VV is a set {v:aj(v)≤bj for every j}\{v:a_j(v)\leq b_j\text{ for every }j\}. The signed cuts of a parent cell QQ are its intersections with the halfspaces defined by the signed forms ϵjaj\epsilon_j a_j and bounds ϵjbj\epsilon_j b_j, where ϵj∈{1,−1}\epsilon_j\in\{1,-1\}. The cut parent cells are these signed cuts of the original parent cells.✦ A supporting face FF of a cell QQ is an intersection Q∩{v:f(v)=b}Q\cap\{v:f(v)=b\} for a linear form ff bounded above by bb on QQ.✦ The nonempty supporting faces form a finite face family when their set is finite, and the face family is empty otherwise✦; closure of a finite cell family under supporting faces is the union of these face families.✦

The vertex mean m(A)m(A) of a finite set A⊆VA\subseteq V is the vector |A|−1∑v∈Av|A|^{-1}\sum_{v\in A}v in VV, with value zero for A=⌀A=\varnothing.✦ The canonical vertex set E(Q)E(Q) of a cell QQ is its set of extreme points when that set is finite, and is empty otherwise.✦ The canonical center c(Q)c(Q) of a cell QQ is the vertex mean of its canonical vertex set.✦ For a finite cell family ℱ\mathcal F in VV and chosen centers c(Q)c(Q), a face chain simplex σ\sigma in VV is the set of centers of a nonempty subfamily of ℱ\mathcal F linearly ordered by inclusion.✦ A compatible cell triangulation LL of a finite cell family ℱ\mathcal F is a finite geometric complex with underlying space ⋃Q∈ℱQ\bigcup_{Q\in\mathcal F}Q, compatible with each Q∈ℱQ\in\mathcal F, and with every simplex contained in a member of ℱ\mathcal F.✦

A finite simplex patch 𝒫\mathcal P of KK is a finite collection of faces of KK.✦ The complex K𝒫K_{\mathcal P} generated by a finite simplex patch 𝒫\mathcal P of KK is the simplicial complex whose faces are the nonempty subsets of members of 𝒫\mathcal P.✦ The simplex cells of K𝒫K_{\mathcal P} are the convex hulls of its faces.✦ The relevant patch indices are J𝒫=⋃F∈𝒫JFJ_{\mathcal P}=\bigcup_{F\in\mathcal P}J_F.✦ The canonical patch triangulation 𝒯𝒫\mathcal T_{\mathcal P} is the compatible cell triangulation selected for these simplex cells using the cutting forms in J𝒫J_{\mathcal P}.✦ The global cut complex ℛd(L)\mathcal R_d(L) of a complex LL is their directed union, whose faces are given by (4). Faces⁡(ℛd(L))=⋃𝒫 a finite simplex patch of LFaces⁡(𝒯𝒫).\operatorname{Faces}(\mathcal R_d(L)) =\bigcup_{\mathcal P\text{ a finite simplex patch of }L} \operatorname{Faces}(\mathcal T_{\mathcal P}).(4)✦ For a subdivision LL of KK, its cut subdivision refinement is the subdivision of KK whose underlying complex is ℛd(L)\mathcal R_d(L).

For subsets Ui,Si⊆VU_i,S_i\subseteq V and activation sets Bi⊆XB_i\subseteq X, the activated unions UB(x)U_B(x) and SB(x)S_B(x) include exactly the indices active at xx.✦ For marked subsets P,ZP,Z of KK, the marked replacement Rep⁡B(P,Z)(x)\operatorname{Rep}_B(P,Z)(x) at x∈Xx\in X is the subset of VV given in (5). UB(x)=⋃i:x∈BiUi,SB(x)=⋃i:x∈BiSi,Rep⁡B(P,Z)(x)=(Z\UB(x))∪(P∩SB(x)).U_B(x)=\bigcup_{i:\,x\in B_i}U_i, \qquad S_B(x)=\bigcup_{i:\,x\in B_i}S_i, \qquad \operatorname{Rep}_B(P,Z)(x) =(Z\setminus U_B(x))\cup(P\cap S_B(x)).(5)

Graph Balls and Translated Forms

Let Γ\Gamma be a connected locally finite graph on a vertex set YY, with graph metric dΓd_\Gamma equal to shortest-path distance, and let KK now be the geometric realization of a simplicial complex on YY. Its ambient space is ℝ(Y)\mathbb R^{(Y)}, the finitely supported real vertex vectors, with the Euclidean norm induced by the coordinate embedding into ℓ2(Y)\ell^2(Y). A finitely supported probability pp on YY is a nonnegative coefficient function with finite support and ∑ypy=1\sum_y p_y=1.✦ For finitely supported probabilities p,qp,q on YY and a real-valued function ff on YY, the expectation of ff under pp is 𝔼p[f]=∑ypyf(y)\mathbb E_p[f]=\sum_y p_yf(y), and the expectation gap of p,qp,q is 𝔼p[f]−𝔼q[f]\mathbb E_p[f]-\mathbb E_q[f].✦ For finitely supported probabilities p,qp,q on YY and n∈ℕn\in\mathbb N, the dual transportation distance W1(p,q)W_1(p,q) and its normalization ρn(p,q)\rho_n(p,q) are the distances given in (6). W1(p,q)=supLip⁡(f)≤1(𝔼p[f]−𝔼q[f]),ρn(p,q)=W1(p,q)n.W_1(p,q)=\sup_{\operatorname{Lip}(f)\leq1} \bigl(\mathbb E_p[f]-\mathbb E_q[f]\bigr), \qquad \rho_n(p,q)=\frac{W_1(p,q)}{\sqrt n}.(6)

A barycentric probability representation pvp_v of v∈|K|v\in|K| is a finitely supported probability on YY whose coefficient vector is vv.✦ The realization distance ρ(v,w)\rho(v,w) is ρn(pv,pw)\rho_n(p_v,p_w) when both vectors lie in |K||K|, and is zero otherwise.✦ For a probability center cc on YY, the distance function δc\delta_c on the ambient vertex vectors is given by δc(v)=ρn(c,pv)\delta_c(v)=\rho_n(c,p_v) on |K||K| and δc(v)=0\delta_c(v)=0 outside |K||K|.✦ The closed ball Ls(c)L_s(c), open ball Us(c)U_s(c), and sphere Ss(c)S_s(c) in the realization are the subsets specified by (7). Ls(c)={v∈|K|:δc(v)≤s},Us(c)={v∈|K|:δc(v)<s},Ss(c)={v∈|K|:δc(v)=s}.L_s(c)=\{v\in|K|:\delta_c(v)\leq s\},\qquad U_s(c)=\{v\in|K|:\delta_c(v)<s\},\qquad S_s(c)=\{v\in|K|:\delta_c(v)=s\}.(7)

For a vertex y∈Yy\in Y and m∈ℕm\in\mathbb N, the finite graph neighborhood Nm(y)N_m(y) is a subset of YY defined recursively by N0(y)={y}N_0(y)=\{y\} and Nm+1(y)={y}∪⋃z∼yNm(z)N_{m+1}(y)=\{y\}\cup\bigcup_{z\sim y}N_m(z).✦ For a finite family of probability centers (ci)i∈C(c_i)_{i\in C} on YY and a radius RR, the finite ball support AiA_i of cic_i is the subset of YY given in (8), for each i∈Ci\in C. Ai=supp⁡(ci)∪⋃y∈supp⁡(ci)N⌊Rn⌋≥0+n(y),A_i=\operatorname{supp}(c_i)\cup \bigcup_{y\in\operatorname{supp}(c_i)} N_{\lfloor R\sqrt n\rfloor_{\geq0}+n}(y),(8)✦ where ⌊u⌋≥0=max⁡(0,⌊u⌋)\lfloor u\rfloor_{\geq0}=\max(0,\lfloor u\rfloor).

For a finite subset AA of YY with the graph metric, the potential polytope 𝒬(A)\mathcal Q(A) is the set of real-valued functions ℓ\ell on AA specified by 𝒬(A)={ℓ:ℓ(y)−ℓ(z)≤dΓ(y,z),∑y∈Aℓ(y)=0}\mathcal Q(A)=\{\ell:\ell(y)-\ell(z)\leq d_\Gamma(y,z),\ \sum_{y\in A}\ell(y)=0\}. Its constraint forms are the differences ℓ(y)−ℓ(z)\ell(y)-\ell(z) and the two forms ±∑yℓ(y)\pm\sum_y\ell(y), with respective bounds dΓ(y,z)d_\Gamma(y,z) and zero. Write Vert⁡(𝒬(A))\operatorname{Vert}(\mathcal Q(A)) for its extreme points, also called its polyhedron vertices. Coordinate evaluation is the continuous linear form ey(v)=vye_y(v)=v_y.✦ For a potential ℓ\ell on the finite ball support AiA_i of a probability center cic_i, the expectation mi(ℓ)m_i(\ell) at cic_i is the real number in (9), and the ball branch form βi,ℓ\beta_{i,\ell} is the linear form on the ambient vertex vectors given there. mi(ℓ)=∑y∈Ai(ci)yℓ(y),βi,ℓ(v)=1n∑y∈Ai(mi(ℓ)−ℓ(y))ey(v),ℐ={(i,ℓ):i∈C,ℓ∈Vert⁡(𝒬(Ai))}.m_i(\ell)=\sum_{y\in A_i}(c_i)_y\ell(y), \qquad \beta_{i,\ell}(v)=\frac{1}{\sqrt n} \sum_{y\in A_i}\bigl(m_i(\ell)-\ell(y)\bigr)e_y(v), \qquad \mathcal I=\{(i,\ell):i\in C,\ \ell\in\operatorname{Vert}(\mathcal Q(A_i))\}.(9) The ball branch indices are the pairs (i,ℓ)(i,\ell) in ℐ\mathcal I, consisting of a center index ii and a vertex ℓ\ell of the potential polytope on AiA_i. A supported family of linear forms assigns a finite coordinate support to each form, which vanishes whenever all coordinates on that support vanish.✦ The ball branch data consist of the forms βi,ℓ\beta_{i,\ell} indexed by ℐ\mathcal I, with support AiA_i.✦

Let a group HH act on YY and XX. Probability pushforward along a bijection ee reindexes coefficients by e−1e^{-1}; the actions on probabilities and vertex vectors are thus (hp)y=ph−1y(hp)_y=p_{h^{-1}y} and (hv)y=vh−1y(hv)_y=v_{h^{-1}y}. For h∈Hh\in H, the translated branch form βh,i,ℓ\beta_{h,i,\ell} is the linear form on the ambient vertex vectors defined by βh,i,ℓ(v)=βi,ℓ(h−1v)\beta_{h,i,\ell}(v)=\beta_{i,\ell}(h^{-1}v).✦ A subdivision family TT is equivariant if hFhF is a face of T(hx)T(hx) for every face FF of T(x)T(x)✦; a marked family PP is equivariant if hP(x)⊆P(hx)hP(x)\subseteq P(hx) for every h,xh,x.✦ For activation sets BiB_i, write 𝒰t(x)=⋃(h,i):x∈hBiUt(hci)\mathcal U_t(x)=\bigcup_{(h,i):\,x\in hB_i}U_t(hc_i) and 𝒮t(x)=⋃(h,i):x∈hBiSt(hci)\mathcal S_t(x)=\bigcup_{(h,i):\,x\in hB_i}S_t(hc_i).

The Claim

Theorem 1. Let dd be universal cutting data and T∈𝒮X(K)T\in\mathscr S_X(K). The family cut refinement ℛdT\mathcal R_dT of TT by the universal cutting data dd is the locally constant subdivision family in (10): ℛdT=(x↦ℛd(T(x)))∈𝒮X(K).\mathcal R_dT=\bigl(x\longmapsto\mathcal R_d(T(x))\bigr) \in\mathscr S_X(K).(10)✦

Suppose KK has countably many faces and JJ is countable, and let aj:V→ℝa_j:V\to\mathbb R be arbitrary functions. The exceptional levels satisfy (11): ℰ(T,a)={aj(v):x∈X,F∈Faces⁡(T(x)),j∈J,v∈F}is countable.\mathcal E(T,a) =\{a_j(v):x\in X,\ F\in\operatorname{Faces}(T(x)),\ j\in J,\ v\in F\} \quad\text{is countable}.(11)✦

Let T,ST,S be geometric complexes, let P⊆VP\subseteq V, and let (Zi)(Z_i) be marked subsets of SS contained in levels {v:ai(v)=bi}\{v:a_i(v)=b_i\} of linear forms. Suppose every face FF of TT has, for each ii, a vertex v∈Fv\in F with ai(v)≠bia_i(v)\ne b_i. Then the level union satisfies (12): 𝖣(T,S;P,⋃iZi).\mathsf D\left(T,S;P,\bigcup_i Z_i\right).(12)✦

Let PP be a marked family for TT, let QiQ_i be marked subsets of KK, and let AiA_i be finite sets of cutting indices. Let fif_i be real-valued functions on |K||K|. Suppose all cutting levels are tt, and |K|∩{v:fi(v)=t}=∂d(Qi)Ai|K|\cap\{v:f_i(v)=t\}=\partial_d(Q_i)_{A_i}. Assume each fif_i is continuous on |K||K|, every point of |K||K| satisfies fi(v)<tf_i(v)<t for some ii, and ρ(v,w)≤fi(v)+fi(w)\rho(v,w)\leq f_i(v)+f_i(w) for every ii and v,w∈|K|v,w\in|K|. Suppose also that every face of every T(x)T(x) has, for each cutting form, a vertex off its level, and that t≤Rt\leq R. The sphere cutting step has the admissibility asserted in (13): 𝒜d(T,P;ρ,R,t,(fi),(Qi),(Ai))∈Adm⁡ρR(T,P).\mathcal A_d(T,P;\rho,R,t,(f_i),(Q_i),(A_i)) \in\operatorname{Adm}_\rho^R(T,P).(13)✦

For graph balls, let CC be finite, R>0R>0, and 0<t≤R0<t\leq R. Let 𝒜0=(T0′,Z0)∈Adm⁡ρR(T,P)\mathcal A_0=(T_0',Z_0)\in\operatorname{Adm}_\rho^R(T,P) have T0′T_0', PP, and Z0Z_0 equivariant, and suppose each BiB_i is clopen. Assume that for every xx, every face FF of T(x)T(x), and every translated ball branch βh,i,ℓ\beta_{h,i,\ell}, some v∈Fv\in F satisfies βh,i,ℓ(v)≠t\beta_{h,i,\ell}(v)\ne t. The equivariant ball replacement satisfies (14): ∃𝒜1=(T1,Z1)∈Adm⁡ρR(T,P),T1 and Z1 equivariant,Z1(x)=(Z0(x)\𝒰t(x))∪(P(x)∩𝒮t(x))(x∈X).\begin{gathered} \exists\,\mathcal A_1=(T_1,Z_1)\in\operatorname{Adm}_\rho^R(T,P), \qquad T_1\text{ and }Z_1\text{ equivariant},\\ Z_1(x)=\bigl(Z_0(x)\setminus\mathcal U_t(x)\bigr) \cup\bigl(P(x)\cap\mathcal S_t(x)\bigr) \qquad(x\in X). \end{gathered}(14)✦

In the paper, the result reads: given real numbers r<Rr<R, locally constant equivariant triangulation families T0,S0T_0,S_0 with S0≼T0S_0\preceq T_0, subcomplex families P0⊆T0P_0\subseteq T_0 and Z0⊆S0Z_0\subseteq S_0 with Z0⊆P0Z_0\subseteq P_0, and a countable equivariant family (cα,Bα)(c_\alpha,B_\alpha) with cα∈|K|c_\alpha\in|K|, Bα⊆XB_\alpha\subseteq X clopen, and only finitely many LR(cα)L_R(c_\alpha) meeting each original simplex, all t∈(r,R)t\in(r,R) outside a countable set admit a locally constant equivariant refinement of S0S_0 making P0(x)∩𝒮t(x)P_0(x)\cap\mathcal S_t(x) and (Z0(x)\𝒰t(x))∪(P0(x)∩𝒮t(x))(Z_0(x)\setminus\mathcal U_t(x))\cup(P_0(x)\cap\mathcal S_t(x)) subcomplexes, where 𝒰t(x)\mathcal U_t(x) and 𝒮t(x)\mathcal S_t(x) are the unions of the active Ut(cα)U_t(c_\alpha) and St(cα)S_t(c_\alpha), each inserted level meets every face FF of T0T_0 or S0S_0 in dimension at most dim⁡(F)−1\dim(F)-1, dimension drop of Z0Z_0 relative to T0T_0 passes to both sets, and a component diameter bound 2R2R for P0\Z0P_0\setminus Z_0 passes to the replacement.

What Is Checked

The affine statements concern geometric simplicial complexes in real normed spaces and locally constant subdivision families with marked subsets. The ball replacement concerns probability centers in a simplicial realization over a connected locally finite graph, with the indicated group actions.

A finite simplex patch generates a complex with finitely many faces.✦ The extreme points of a polyhedron defined by finitely many halfspaces form a finite set.✦ The coordinate embedding into ℓ2(Y)\ell^2(Y) is injective✦, and every realization point admits a probability representation whose support is a simplex.✦ A family of marked subsets with locally constant intersections with every original simplex defines a marked subdivision family.✦