Back to app index

Sheaves for tunnel concept

If you model a tunnel project’s WBS as a small site (poset/category + a chosen topology of “what counts as an overlap”), then “scope/schedule/state” becomes a multi-sheaf whose global sections are exactly the globally coherent plans you want, and whose H¹ (or more practically, a computable obstruction residual) localises which interfaces prevent gluing. The trick is to treat each department’s artefact as a stalk (risk sets, interval headcount functions, spec parameters), and each interface as a restriction map; then Γ(F) is your patched global view, and project metrics become honest functionals on Γ(F) (integrals for resource curves, expectations for risk). This is the same local-to-global mechanism as the textbook sheaf condition (matching families glue uniquely).

Download the interactive HTML prototype

What the prototype contains

It’s one self-contained page with three canvases, each instantiating a different “ways” route you listed:

1) Risk as a Set-valued sheaf on a task-dependency category

Why this is a genuine sheaf move (not just CSP cosplay): global sections are the “globally consistent fusions” the sheaf-on-graph exposition makes concrete: choose an element in each node stalk so that both node restrictions to each edge’s overlap agree.

2) Resource schedule as a function-valued sheaf over time-interval overlaps

The audit explicitly called out that the resource draft had manual adjustment but no algorithmic procedure; this prototype gives you an algorithmic “minimum viable sheafifier” (it’s not canonical in the Grothendieck sense, but it’s operational).

3) A cohomological obstruction demo (H¹ / “cycle-sum” witness)

This is the piece your “Čech cohomology detects contradictions” conjecture is gesturing at, but in a computationally cheap linear setting where the obstruction is visible as a residual/witness, not just a slogan.

The representation you asked for (clean formal core)

Base object: WBS as a site

Take a WBS as either:

The “less popular but useful” move is to treat the choice of covers as governance: picking a Grothendieck topology J on your WBS category says what families of local artefacts must be jointly reconcilable before you declare “the plan is coherent.”

Data: a multisorted sheaf of project state

Let State be a product of components (risk, resources, schedule, specs, etc.). Formally: a sheaf valued not in Set alone, but in a category that supports the structure you care about (Sets for discrete, Vect/Modules for linear constraints, Convex sets for LP‑feasible regions, etc.).

A simple archetype:

Metrics as continuous functionals on Γ(F)

Once Γ(F) is nonempty, define metrics as maps Γ(F) → ℝ:

The audit is correct that your earlier drafts stop one step short: they produce a global section but don’t explicitly wire it into a higher-level project fitness function (earned value, SLA conformance, etc.).

How an LLM actually fits (without “hand-waving oracle” failure)

The most robust role is: LLM as extractor + proposer, deterministic sheaf engine as judge.

Stretch target: “blueprint gradually filled in” as a sheaf over a state poset (domain-theoretic flavour)

  1. Let P be the poset of partial completions (states), ordered by information/refinement (“⊑”: you add constraints/decisions; you don’t retract).
  2. Put the Scott topology on P if you want convergence/limits of directed refinements (this is exactly where the sheaf text gestures that Scott topology is appropriate when the poset includes infinite elements; it’s the natural bridge to domain theory).
  3. Define a sheaf (or stack, if you want nontrivial automorphisms like alternative designs) of admissible local states over P; then “project execution” is literally a directed path in P, and “completion” is a maximal (or terminal) global section.

The geometric rhetoric (“manifold of project states”, “tangent bundle = admissible next moves”) becomes concrete if you use a combinatorial/poset analogue: the “tangent directions” are the immediate refinement moves from a state (covering relations), and a “policy” is a section of the corresponding cosheaf of allowable transitions; you can then ask for path-lifting, obstruction to extension, etc., exactly as in gluing problems. (If you want the more Grothendieckian twist: changing what counts as a cover/topology J is changing what counts as a legitimate local-to-global inference during execution—very close to the “creative preservation” sheafification story in the design paper.)

One angle: try enriching the WBS category in a Lawvere metric (time/cost “distance”) so that obstructions carry not just existence/nonexistence but a minimal repair cost.

Back to app index