Sheaf operations that retain the actual kernel and image maps
Restriction, pullback and scalar extension change the setting of a sheaf while keeping precise maps between its modules. Restriction to an upper interval retains the relevant outgoing conditions. Pullback along a graph map identifies selected equations when every surviving outgoing edge has a lift. Scalar extension replaces modules by tensor products and carries their restriction maps along.
The finite kernel-and-image results are central to localization. Flat scalar extension preserves the embedded selected kernels and their lower and upper images. After root-plane localization, edge modules with unit labels vanish; the remaining equations are exactly those represented on the relative coset graph.
These results make the local model calculation an equality about the original localized boundary sheaf. Both endpoint images are transported through the same edge module, and the correction scalar keeps its specified coefficient action. The reading route follows the operations first and then their actual kernel and image identities.
Reading sequence
- Tensor base change of a graph sheaf — Define tensor scalar extension of a sheaf.
- Sections commute with finite flat scalar extension — Transport finite section constraints.
- Sheaf properties under scalar extension — Retain the sheaf properties used later.
- Selected kernels under outgoing-complete graph pullback — Compare equations through a graph map.
- Stalk characters and selected kernels under upper-interval restriction — Identify kernels under upper-interval restriction.
- Selected kernels and edge images on the localized coset — Obtain the actual localized image identities.