Graph sheaves, selected kernels and the boundary construction

An ordered graph records vertices and upward edges. A module-valued sheaf assigns a module to each vertex and edge, with a restriction map from each endpoint. In the graded construction these modules are finite graded module data with zero negative pieces, and the restrictions preserve degree.

A section is an assignment of stalk vectors whose two restrictions agree at every relevant edge. A selected kernel imposes vanishing along a chosen set of outgoing edges. Flabbiness is an extension property for compatible sections, while a minimal free cover supplies the next stalk from its boundary image. These definitions organize the construction of the normalized boundary sheaf.

The boundary sheaf supplies the actual modules used throughout the invariance proof. Its upper quotient identifies edge modules, its graded structure gives Hilbert values, and its localization admits a decomposition into dihedral structure models. The proof compares images of selected kernels inside those same edge modules and later recovers their freeness.

Reading sequence

  1. Ordered graphs, reflection edges, and labels — Define vertices, edges and order.
  2. Module-valued sheaves on an ordered graph — Define the module and restriction data.
  3. Finite nonnegatively graded module data — Read the grading and finiteness fields.
  4. Kernels of upward edge conditions — Define the selected equations.
  5. Flabbiness and closure under directed edges — Specify section extension.
  6. Minimal graded free covers — Introduce the stalk construction.
  7. Minimal-boundary sheaves and their normalized stalk — Assemble the boundary sheaf.
  8. Decomposition of the sheaf after root-plane localization — See its role after localization.

Entries for this keyword