Controls
Plan: BaselineVisual model
Cover U = {phases…}On a small screen, scroll each chart sideways. The selectors show the same values in a table.
Construction, sources and limits
The days 0–16 form a finite discrete space. A local account is a nonnegative integer booking count on a phase’s days. Restriction keeps its values on fewer days. If every account agrees wherever it overlaps another, these functions join uniquely on their covered days. A missing day would remain unknown, not silently become zero.
The maximum policy changes the accounts. It takes the largest estimate on each day, then copies that value into every active phase. The revised accounts agree by construction; the original disagreements remain in the chart and inspection tables. This is a choice of booking allowance, not formal sheafification or a proof that the chosen number is right.
These are competing estimates of one shared service, not separate cargo demands. Independent loads would need allocation, summation and capacity checks. The 17 labelled days compress the example; they are not a construction programme. The £1,500 allowance per booking is illustrative.
Daniel Rosiak, Sheaf Theory through Examples (2022), chapter 5, definitions 122–124 (pp.148–149), supplies the matching-family and unique-gluing distinction. See the foray’s source trail and the associated-sheaf construction. The maximum here is an independently declared rule.
The Triangle’s spatial compatibility lab checks a different question: whether selected exclusion rules admit a location. This essai checks agreement between daily estimates.