OctoInformBeta

OpenAI preprint, September 2026 · §4. Filtered local systems on surfaces

Lemma 4.3 [Two-flag reconstruction]: Intersection ranks and named quotients along a gallery with no repeated crossings

Two flags split into common blocks.

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

Two finite flags in a vector space determine subspaces at their intersections and identified quotients along their successive steps. A gallery records changes of an ordered decomposition through splitting vertices and adjacent interchanges, with merging given by reversing a splitting vertex.

Let KK be a field and VV a finite-dimensional KK-vector space. For increasing filtrations F•,H•F_\bullet,H_\bullet and a family of subspaces Wuv⊆VW_{uv}\subseteq V, the rectangular prefix sum Sij(W)S_{ij}(W) and the corner subspace CijC_{ij} are Sij(W)=∑0≤u<i,0≤v<jWuv,Cij=(Fi∩Hj+1)+(Fi+1∩Hj).\begin{aligned} S_{ij}(W)&=\sum_{0\leq u<i,\,0\leq v<j}W_{uv},\\ C_{ij}&=(F_i\cap H_{j+1})+(F_{i+1}\cap H_j). \end{aligned}(1) The indices in (1) start at zero.

Identified Flags

Let RR be a commutative ring, AA a finite set, and a:A→ℕa:A\to\mathbb N a coordinate grading. The coordinate prefix Pk(a)⊆RAP_k(a)\subseteq R^A consists of functions supported on grades strictly less than kk.✦ The named graded module Gk(a)G_k(a) is the module of functions on the indices of grade kk, and the coordinate grade projection πk\pi_k is restriction to those indices.✦ For a framing e:RA→∼Me:R^A\xrightarrow{\sim}M of an RR-module MM, the framed prefix and framed grade projection are Pk(a)={u∈RA:u(t)=0 whenever a(t)≥k},Gk(a)=Ra−1(k),Fk(a,e)=e(Pk(a)),γk(a,e)=πk∘e−1:M→Gk(a).\begin{aligned} P_k(a)&=\{u\in R^A:u(t)=0\text{ whenever }a(t)\geq k\}, &G_k(a)&=R^{a^{-1}(k)},\\ F_k(a,e)&=e(P_k(a)), &\gamma_k(a,e)&=\pi_k\circ e^{-1}:M\longrightarrow G_k(a). \end{aligned}(2) The restriction of γk(a,e)\gamma_k(a,e) in (2) gives the identification of Fk+1(a,e)/Fk(a,e)F_{k+1}(a,e)/F_k(a,e) with Gk(a)G_k(a). Two framings e,e′e,e' of the same graded coordinate module into an RR-module MM define the same identified flag when all their framed prefixes coincide and their framed grade projections agree on each common Fk+1F_{k+1}.✦

For finite sets A,BA,B, an invertible coordinate matrix from RAR^A to RBR^B is a matrix XX with an inverse YY satisfying XY=1XY=1 and YX=1YX=1; its coordinate isomorphism sends uu to XuXu. Coordinate isomorphisms admit identity matrices, composition and direct sums; reindexing changes the coordinate labels, and a bijection of labels gives a relabelling matrix. A framed flag comparison consists of two coordinate isomorphisms with the same source and target, together with a grading on the source.✦ A framed flag comparison holds when its two isomorphisms define the same identified flag.✦

Galleries and Atoms

A local vertex table has ports, one parent side occurrence and a family of child side occurrences at each port, endpoint orientations, and an involutive pairing of side occurrences that reverses their induced orientations.✦ A decoration of a local vertex table is an assignment of a facet label to each side occurrence, with equal labels on paired occurrences.✦ Distinct occurrences remain distinct when their labels agree. At an allowed vertex, the children at a port have a specified order, whose length is its arity. The reversed vertex table of a local vertex table has the same ports, child occurrences and pairing, with every endpoint orientation reversed.✦

For a permutation σ\sigma of the child positions, a passage table is a local vertex table with input and output ports, whose parent occurrences are paired and whose child jj at the input is paired with child σ(j)\sigma(j) at the output.✦ An allowed passage is a continuation, with σ=1\sigma=1, or an interchange of positions ii and i+1i+1.✦ A splitting table has ports before, after and branch.✦ The ordered child lists of a splitting table at its before, after and branch ports are respectively (L,Q,T)(L,Q,T), (L,B,T)(L,B,T) and BB, where L,B,TL,B,T are ordered lists and QQ is a single label.✦ The before and after parents are paired; the occurrence QQ is paired with the branch parent. Corresponding occurrences in L,TL,T are paired, as are the two occurrences of each child in BB. Reversing the endpoint orientations gives the merging table. Passage decorations transport labels by σ\sigma; splitting decorations use these ordered lists and their paired labels. The splitting endpoint orientations are incoming at the before and branch ports and outgoing at the after port.✦

An ordered gallery with parent pp is a finite sequence of decorated allowed vertices whose incoming and outgoing main parents have label pp, and whose successive ordered child lists agree.✦ Write 𝒢p(ℓ,ℓ′)\mathcal G_p(\ell,\ell') for the set of such galleries from ℓ\ell to ℓ′\ell'. The walk of an ordered gallery is the sequence of its child lists and the vertices between them.✦ A realized band is a nonempty finite sequence of decorated allowed vertices with matching consecutive arities and facet labels at every ordered position, including the parent, and with main parent pp and specified boundary child lists.✦ A walk has a band realization. The crossing list Cross\operatorname{Cross} of a gallery or band concatenates the pairs (y,x)(y,x) from interchanges with input children (x,y)(x,y); other vertices contribute no pair.

For a rank function on facets, a decoration is conservative when the parent rank at each port equals the sum of its child ranks.✦ A ranked gallery is an ordered gallery all of whose vertices are conservative.✦ An independent parent label ** extends a secondary rank function rr by giving ** a prescribed rank NN.✦ A fresh decoration uses ** for its main parents and secondary labels for its remaining occurrences.✦ A weighted reduced gallery is a fresh ranked gallery whose crossing pairs do not repeat and which is conservative also for each specified secondary weight function wλw_\lambda, extended by a specified parent weight MλM_\lambda.✦

A rank shape d=(dij)d=(d_{ij}) of size n×mn\times m and total rank rr is an array of nonnegative integers summing to rr.✦ The atom set AdA_d of a rank shape dd and its row and column gradings ad,bda_d,b_d are given in (3): Ad={(i,j,t):0≤i<n,0≤j<m,0≤t<dij},ad(i,j,t)=i,bd(i,j,t)=j.A_d=\{(i,j,t):0\leq i<n,\ 0\leq j<m,\ 0\leq t<d_{ij}\}, \qquad a_d(i,j,t)=i,\qquad b_d(i,j,t)=j.(3) The secondary facet labels are 𝗋i,𝖼j,𝗍ij\mathsf r_i,\mathsf c_j,\mathsf t_{ij}, for rows, columns and cells.✦ For a rank shape dd, the atom sets of the row, column and cell labels 𝗋i,𝖼j,𝗍ij\mathsf r_i,\mathsf c_j,\mathsf t_{ij} are the subsets of AdA_d with first index ii, second index jj, or both, respectively; the parent atom set is AdA_d. For a row, column, cell or parent facet label ff, write SfS_f for its atom set in AdA_d. The facet ranks rdr_d are rd(*)=r,rd(𝗋i)=∑jdij,rd(𝖼j)=∑idij,rd(𝗍ij)=dij.r_d(*)=r,\qquad r_d(\mathsf r_i)=\sum_jd_{ij},\qquad r_d(\mathsf c_j)=\sum_id_{ij},\qquad r_d(\mathsf t_{ij})=d_{ij}.(4) An atomic ranked gallery of a rank shape dd is a chosen weighted reduced gallery from the ordered row labels to the ordered column labels, for the ranks in (4) and the occupancy weights indexed by atoms t∈Adt\in A_d, with wt(f)=1w_t(f)=1 for t∈Sft\in S_f, and 00 otherwise, with parent rank rr and parent weight one for each atom.✦ The atomic band BdB_d of a rank shape dd is the realized band of its atomic ranked gallery.✦

A local atom decomposition of a local vertex table is an assignment of a subset of AdA_d to every side occurrence, equal on paired occurrences, such that the child subsets partition the parent subset at each port.✦ The atom fiber of a local atom decomposition at a side occurrence is the subset of AdA_d assigned to that occurrence, and its local rank at that occurrence is the cardinality of the fiber. Enumerating each atom fiber by consecutive integers gives a relabelling matrix. The resulting relabelling matrix at a port pp is its atom frame ϕp\phi_p.✦ A decoration is atom conserving when it is conservative for every occupancy weight wtw_t; its induced local atom decomposition assigns SfS_f to an occurrence labeled ff. For a local atom decomposition DD and a port pp, the child atom inclusion sends a child occurrence together with an atom in its fiber to the same atom in the parent fiber.✦ The child atom partition equivalence at a port pp identifies the disjoint union of its child atom fibers with its parent atom fiber, preserving each atom.✦

A system of local ranks on a local vertex table is an assignment of nonnegative integers to its side occurrences, constant on paired occurrences, with parent rank equal to the sum of child ranks.✦ They give parent coordinate sets and ordered disjoint unions of child coordinate sets. For local ranks ρ\rho and port frames ϕ\phi at a vertex of kind kk, the permitted local comparison 𝒞(k,ρ,ϕ)\mathcal C(k,\rho,\phi) is the corresponding passage, split or merging comparison.✦ At a passage, the parent identification and child permutation identify the two coordinate systems; the passage grading is the child position, except that positions i,i+1i,i+1 have the common grade ii at an interchange. At a split, the child coordinates separate into prefix, splitting block and suffix before the split, and prefix, subblocks and suffix after it. Pairing identifies the two prefixes, the two suffixes and the main parents, and identifies the splitting block and subblocks with the branch parent and children. The splitting refinement uses the branch frame between the subblocks and splitting block, together with the prefix and suffix identifications.✦ For local ranks and port frames at a split, the split flag comparison compares the after frame with the before frame refined in its splitting block by the branch frame, retaining the ordered prefix, subblock and suffix graded modules and their quotient identifications; a merging comparison uses the corresponding forward splitting ranks. For BdB_d, write ks,δs,csk_s,\delta_s,c_s for the kind, decoration and occurrence labels at vertex ss, and ρs,ϕs\rho_s,\phi_s for the induced atom ranks and frames. The vertex atom partition at a vertex ss of BdB_d is the local atom decomposition that assigns Scs(z)S_{c_s(z)} to each side occurrence zz.✦ For local ranks and port frames at a passage, the passage flag comparison compares the incoming and outgoing frames after the parent and child identifications.✦ It compares their full ordered identified flags at a continuation and their coarsened identified flags at an interchange, with precisely the two interchanged graded modules combined into one named direct sum.✦

A directed sorting gallery PP on a linearly ordered set EE is a sequence of adjacent exchanges (x,y)↦(y,x)(x,y)\mapsto(y,x) with y<xy<x.✦ The event list Ev⁡(P)\operatorname{Ev}(P) of a directed sorting gallery PP is the list that records (y,x)(y,x) at each exchange (x,y)↦(y,x)(x,y)\mapsto(y,x).✦ Write ℓ↑\ell^\uparrow for the increasing reordering of a finite list ℓ\ell of distinct elements of EE.

The Claim

Theorem 1. Let F•,H•F_\bullet,H_\bullet be increasing filtrations of a finite-dimensional KK-vector space VV, with F0=H0=0F_0=H_0=0 and Fn=Hm=VF_n=H_m=V. There are subspaces Wuv⊆VW_{uv}\subseteq V satisfying (5): Fi∩Hj=Sij(W)(i,j≥0),⨁0≤u<n,0≤v<mWuv→(wuv)↦∑u,vwuv∼V.\begin{gathered} F_i\cap H_j=S_{ij}(W)\quad(i,j\geq0),\\ \bigoplus_{0\leq u<n,\,0\leq v<m}W_{uv} \xrightarrow[\ (w_{uv})\mapsto\sum_{u,v}w_{uv}\ ]{\ \sim\ }V. \end{gathered}(5)✦

For increasing filtrations F•,H•F_\bullet,H_\bullet in any finite-dimensional KK-vector space, suppose that WijW_{ij} is a complement of CijC_{ij} in Fi+1∩Hj+1F_{i+1}\cap H_{j+1} for every i,ji,j. Then (6) holds: dim⁡(Fi+1∩Hj+1)+dim⁡(Fi∩Hj)=dim⁡(Fi∩Hj+1)+dim⁡(Fi+1∩Hj)+dim⁡Wij.\dim(F_{i+1}\cap H_{j+1})+\dim(F_i\cap H_j) =\dim(F_i\cap H_{j+1})+\dim(F_{i+1}\cap H_j)+\dim W_{ij}.(6)✦

Given a facet set, a parent label pp, ordered row labels 𝗋0,…,𝗋n−1\mathsf r_0,\ldots,\mathsf r_{n-1} and column labels 𝖼0,…,𝖼m−1\mathsf c_0,\ldots,\mathsf c_{m-1}, and cell labels 𝗍ij\mathsf t_{ij}, there is an ordered gallery as in (7): 𝒢p((𝗋0,…,𝗋n−1),(𝖼0,…,𝖼m−1))≠⌀.\mathcal G_p\bigl((\mathsf r_0,\ldots,\mathsf r_{n-1}), (\mathsf c_0,\ldots,\mathsf c_{m-1})\bigr)\ne\varnothing.(7)✦

For a finite list ℓ\ell of distinct elements of a linearly ordered set, there is a directed sorting gallery PP satisfying (8): P:ℓ→ℓ↑,Ev⁡(P) has no repetitions,Ev⁡(P)⊆{(x,y):x,y∈ℓ,x<y}.P:\ell\longrightarrow\ell^\uparrow,\qquad \operatorname{Ev}(P)\text{ has no repetitions},\qquad \operatorname{Ev}(P)\subseteq\{(x,y):x,y\in\ell,\ x<y\}.(8)✦

Let A,BA,B be finite sets with gradings a:A→{0,…,n−1}a:A\to\{0,\ldots,n-1\}, b:B→{0,…,m−1}b:B\to\{0,\ldots,m-1\}, and let f:KA→∼Vf:K^A\xrightarrow{\sim}V, h:KB→∼Vh:K^B\xrightarrow{\sim}V be framings. There are a rank shape dd of total rank dim⁡KV\dim_KV, a framing e:KAd→∼Ve:K^{A_d}\xrightarrow{\sim}V, and graded isomorphisms ηkF:Gk(ad)→∼Gk(a)\eta_k^F:G_k(a_d)\xrightarrow{\sim}G_k(a) and ηkH:Gk(bd)→∼Gk(b)\eta_k^H:G_k(b_d)\xrightarrow{\sim}G_k(b) satisfying (9), for every kk, vertex ss and side occurrence zz: Fk(ad,e)=Fk(a,f),Fk(bd,e)=Fk(b,h),ηkFγk(ad,e)(x)=γk(a,f)(x)(x∈Fk+1(ad,e)),ηkHγk(bd,e)(x)=γk(b,h)(x)(x∈Fk+1(bd,e)),Cross⁡(Bd) has no repetitions,δs is fresh and atom conserving,ρs(z)=rd(cs(z)),𝒞(ks,ρs,ϕs) holds.\begin{gathered} F_k(a_d,e)=F_k(a,f),\qquad F_k(b_d,e)=F_k(b,h),\\ \eta_k^F\gamma_k(a_d,e)(x)=\gamma_k(a,f)(x) \quad\bigl(x\in F_{k+1}(a_d,e)\bigr),\\ \eta_k^H\gamma_k(b_d,e)(x)=\gamma_k(b,h)(x) \quad\bigl(x\in F_{k+1}(b_d,e)\bigr),\\ \operatorname{Cross}(B_d)\text{ has no repetitions},\qquad \delta_s\text{ is fresh and atom conserving},\\ \rho_s(z)=r_d(c_s(z)),\qquad \mathcal C(k_s,\rho_s,\phi_s)\text{ holds}. \end{gathered}(9)✦

In the paper, the result reads: two flags F•,H•F_\bullet,H_\bullet in a complex vector space admit nonnegative block ranks dijd_{ij} and allowed operations which split F•F_\bullet into blocks in row-first order, sort them into column-first order, interchanging each inverted pair once, and merge to H•H_\bullet; the flags and all identified quotients in any such sequence admit a common splitting into labeled blocks; for two such pairs, prescribed FF-graded and HH-graded isomorphisms extend to an isomorphism of the whole spaces when they preserve the induced refinements and agree on the double-graded modules, and the extensions form an affine space; these common splitting and extension assertions also hold over RR when the labeled graded modules are free, with free integral parameters, and in fixed-rank families the extension spaces are locally affine bundles.

What Is Checked

The statements concern finite-dimensional vector spaces over an arbitrary field, finite coordinate gradings and framings, ordered facet occurrences, and directed sorting on a linearly ordered set; coordinate matrices and identified flag comparisons are defined over a commutative ring RR.

At every vertex of the atomic band of any rank shape, the decoration conserves each atom with respect to the facet atom sets.✦ For every local atom decomposition, the child atom inclusion at each port is bijective✦, and the cardinality of its parent atom fiber equals the sum of the cardinalities of its child atom fibers.✦