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 be a field and a finite-dimensional -vector space. For increasing filtrations and a family of subspaces , the rectangular prefix sum and the corner subspace are (1) The indices in (1) start at zero.
Identified Flags
Let be a commutative ring, a finite set, and a coordinate grading. The coordinate prefix consists of functions supported on grades strictly less than .✦ The named graded module is the module of functions on the indices of grade , and the coordinate grade projection is restriction to those indices.✦ For a framing of an -module , the framed prefix and framed grade projection are (2) The restriction of in (2) gives the identification of with . Two framings of the same graded coordinate module into an -module define the same identified flag when all their framed prefixes coincide and their framed grade projections agree on each common .✦
For finite sets , an invertible coordinate matrix from to is a matrix with an inverse satisfying and ; its coordinate isomorphism sends to . 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 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 at the input is paired with child at the output.✦ An allowed passage is a continuation, with , or an interchange of positions and .✦ 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 , and , where are ordered lists and is a single label.✦ The before and after parents are paired; the occurrence is paired with the branch parent. Corresponding occurrences in are paired, as are the two occurrences of each child in . Reversing the endpoint orientations gives the merging table. Passage decorations transport labels by ; 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 is a finite sequence of decorated allowed vertices whose incoming and outgoing main parents have label , and whose successive ordered child lists agree.✦ Write for the set of such galleries from to . 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 and specified boundary child lists.✦ A walk has a band realization. The crossing list of a gallery or band concatenates the pairs from interchanges with input children ; 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 by giving a prescribed rank .✦ 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 , extended by a specified parent weight .✦
A rank shape of size and total rank is an array of nonnegative integers summing to .✦ The atom set of a rank shape and its row and column gradings are given in (3): (3) The secondary facet labels are , for rows, columns and cells.✦ For a rank shape , the atom sets of the row, column and cell labels are the subsets of with first index , second index , or both, respectively; the parent atom set is . For a row, column, cell or parent facet label , write for its atom set in . The facet ranks are (4) An atomic ranked gallery of a rank shape 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 , with for , and otherwise, with parent rank and parent weight one for each atom.✦ The atomic band of a rank shape 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 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 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 is its atom frame .✦ A decoration is atom conserving when it is conservative for every occupancy weight ; its induced local atom decomposition assigns to an occurrence labeled . For a local atom decomposition and a port , 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 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 and port frames at a vertex of kind , the permitted local comparison 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 have the common grade 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 , write for the kind, decoration and occurrence labels at vertex , and for the induced atom ranks and frames. The vertex atom partition at a vertex of is the local atom decomposition that assigns to each side occurrence .✦ 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 on a linearly ordered set is a sequence of adjacent exchanges with .✦ The event list of a directed sorting gallery is the list that records at each exchange .✦ Write for the increasing reordering of a finite list of distinct elements of .
The Claim
Theorem 1. Let be increasing filtrations of a finite-dimensional -vector space , with and . There are subspaces satisfying (5): (5)✦
For increasing filtrations in any finite-dimensional -vector space, suppose that is a complement of in for every . Then (6) holds: (6)✦
Given a facet set, a parent label , ordered row labels and column labels , and cell labels , there is an ordered gallery as in (7): (7)✦
For a finite list of distinct elements of a linearly ordered set, there is a directed sorting gallery satisfying (8): (8)✦
Let be finite sets with gradings , , and let , be framings. There are a rank shape of total rank , a framing , and graded isomorphisms and satisfying (9), for every , vertex and side occurrence : (9)✦
In the paper, the result reads: two flags in a complex vector space admit nonnegative block ranks and allowed operations which split into blocks in row-first order, sort them into column-first order, interchanging each inverted pair once, and merge to ; the flags and all identified quotients in any such sequence admit a common splitting into labeled blocks; for two such pairs, prescribed -graded and -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 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 .
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.✦