Conclusion

The finite incidence construction has an exact and useful interface: a prescribed parameter, installed codes and packets, accessible-input matching, residual–record separation, supplied source tokens, and guarded commands. During incidence the selected packet remains fixed. A source replacement is another command, not a derived backreaction equation.

Its complete finite channel realizations have a rigorous ceiling: scheduled ancestors bound Heisenberg support and actual influence. Equal ancestor snapshots determine complete output laws, including their reference extensions. A physical causal interpretation needs an independent embedding; a continuum interpretation needs a refinement and convergence theorem.

The decisive negative result is not merely the absence of a theorem name. Explicit constructions show that the missing data matter: the same finite channel can lead to different continuous-time limits, the same finite graph samples can have different intermediate rates, and the same classical record can leave different residual sources.

Here $\ne$ means non-identification of the declared objects, not a prohibition on every future connecting map.

The next continuum paper must supply the missing limit and its hypotheses. This paper names that obligation and stops.