Computational support and independent causal containment

This is the computational content of VIII-C's C5 and the partitioned-locality comparisons CheungVIIIC,CheungLocality. An identity block can overestimate influence, and two independent SWAPs can cancel. Scheduled ancestry need not be minimal influence.

For a general finite directed acyclic circuit, conservative dependency edges connect every input of a gate to every output. The same reverse induction bounds every joint terminal observable by its complete scheduled ancestor set. A reduced dependency graph needs a joint-output support proof; single-output marginal tests are insufficient.