What this Triangle check establishes
The wider enquiry asks how a project account can be assembled from local scope, work, schedule or risk records. Here everyone already uses one site coordinate system. A passing point witnesses agreement on a location. It leaves open how teams would translate their own records into shared coordinates or combine their measures across the project. The original Triangle experiment computed five signed margins on a grid. It correctly left open continuous feasibility and warned against blaming the canal for the failure of one preferred point. This trial uses the same site, boundaries, presets and nonnegative-margin convention. It changes how the answer is established. The scope-consolidation note distinguishes a finite interface check, the mathematical requirements for gluing, and the empirical question of who can act on a result. Here that last distinction determines the second trial: what can the road and rail parties change when canal and mine are held fixed?
Solve the site
The road imposes a lower x bound. The canal imposes an upper y bound. The rail imposes a rising lower y bound. The power corridor permits left or right; the mine permits low or high. That gives four closed regions. Within any one, the lowest permitted rail height occurs at its leftmost possible x. Checking that x against the upper x bound, and its lowest allowed y against the upper y bound, decides the whole continuous region. Equality is feasible.
In the blocked preset the road requires x ≥ 195, the canal y ≤ 445, and the rail y ≥ x/2 + 220. The mine requires y ≤ 245 or y ≥ 455. The high side misses the canal ceiling by 10. Even the leftmost admissible rail height is 317.5, above the low side. Thus the original preset is empty throughout the modelled site.
Who actually has to talk?
Keeping the basic site boundary, test all 32 subsets of the five extra buffer rules. Two and only two inclusion-minimal obstructions remain. They are road, canal, mine and rail, canal, mine. In the first, the site's own sloping edge plus the road excludes the low side. In the second, rail alone does so at the site's left edge. Both require the canal and the mine to exclude the high side. Removing power alone cannot resolve either obstruction. An inclusion-minimal obstruction says all its members matter jointly; it assigns no fault or authority.
Here are the partial agreements behind each obstruction. Each coordinate satisfies the named pair and the original site boundary. Adding the third rule invalidates that coordinate. All three pairs can therefore produce an acceptable point of their own, while the triple has no common one.
| Rules in the obstruction | Pair witnesses, with the third rule set aside |
|---|---|
| Road, canal, mine | Canal and mine (100, 200) · road and mine (195, 455) · road and canal (195, 247.5) |
| Rail, canal, mine | Canal and mine (100, 200) · rail and mine (100, 455) · rail and canal (100, 270) |
This distinction also appears in the Gimån bridge trial. Pairwise existence permits a different point in each meeting. Gluing would start from specified local choices whose restrictions actually agree on all their overlaps. This example concerns the earlier task of finding such choices.
Which agreements could unlock the site?
| Change from the blocked preset | First continuous witness | Grid points at that change | First whole-unit reduction seen by grid |
|---|---|---|---|
| Reduce canal buffer by 10 | (195, 455) | 0 | 11 |
| Reduce mine buffer by 10 | (195, 445) | 0 | 15 |
| Reduce both by 5 | (195, 450) | 0 | — |
| Keep canal and mine fixed; reduce road by 5 and rail by 70 | (190, 245) | 0 | — |
In the canal-only case an entire horizontal segment from x = 195 to 330 is feasible at y = 455. The grid skips that height. At a reduction of 11, nine sampled points appear. The continuous method finds an actual witness before the sampled display changes its verdict. The first witness is a boundary case with zero margin and zero area. A positive clearance or a building footprint would pose a different question.
There is also a repair when both canal and mine must stand. Try Road + rail. The first fit shown is a single point at (190, 245). The road still requires x ≥ 190 and the mine requires y ≤ 245 on the low side. Even after releasing the full extra rail buffer, the site's own diagonal requires y ≥ x/2 + 150. The three boundaries meet at exactly that point.
For any reductions from the blocked setting, write C, M, R, T for the amounts by which the canal, mine, road and rail buffers are reduced, each between zero and its original value. The whole set of possible repairs has two branches.
- High side: C + M ≥ 10. The canal ceiling is 445 + C and the upper mine boundary is 455 − M.
- Low side: R + 2T + 2M ≥ 145. At the leftmost allowed x = 195 − R the rail needs y ≥ 317.5 − R/2 − T. The lower mine boundary permits y ≤ 245 + M.
Either inequality suffices. Every choice of x farther right only raises the rail requirement. The leftmost x always clears the original power buffer; reducing that buffer cannot open a third route. On the high side the rail stays below the mine boundary at this x, while on the low side the canal always leaves room. These inequalities therefore cover fractional and whole reductions alike. If only road and rail can move, rail buys twice as much movement towards the threshold per diagram unit. Its entire allowance is 70, so the smallest sum of reductions is 75, from road 5 and rail 70. The model supplies no prices, permissions or exchange rate between agreements.
Check the certificate
A second algorithm intersects every pair of boundary lines and tests the resulting vertices with the published page's own predicates. A nonempty bounded closed polygon, segment or singleton contains such a vertex. The two algorithms agree in 538 comparisons spanning all five presets, all rule subsets, all whole-unit single-buffer relaxations and the split repair. The rerun also checks the six one-rule deletions above and 26 boundary and endpoint cases for the repair equations, including fractional reductions and both ends of the power allowance. The inherited grid was regenerated through the page's own candidate constructor; the balanced control returned 91 of 462.
The set-intersection question comes from the foray's treatment of restriction and compatibility. The additional work here is elementary planar geometry. Neither a stronger sheaf axiom nor an engineering clearance is needed to certify a point in this declared model. These are arbitrary diagram units. The toy has no survey uncertainty, building footprint or authority to relax a requirement.
Earlier Triangle experiment · Foray sources and scope · Rosiak, Sheaf Theory through Examples
Reproduce
Run node research/between-the-points/run.cjs from the project root to regenerate the certificate. It includes the four regions, minimal obstructions, repair thresholds and sample counts.