AI RESEARCH

Order-Sensitive Sequential Interventions on Ideal Lattices

arXiv CS.LG

ArXi:2604.26472v1 Announce Type: cross We study sequential interventions under prerequisite constraints. In this setting, admissible intervention sequences are paths in the ideal lattice of a finite prerequisite poset rather than unconstrained action strings. We give an exact local-to-global theory of order sensitivity on this state space. First, we prove that any two admissible paths with the same endpoints differ by a finite sequence of elementary diamond swaps.