Dominance-pruned finite search is sound and complete at every depth
ProvedSensitivityWordFrontier.search_correctFor every natural state count and depth , the exact finite search succeeds if and only if there is an admissible crossing recipe word of exactly that length:
The search enumerates bounded letters and retains only profiles undominated in the componentwise order at each depth. This equivalence states both that every reported success has a single realizable admissible recipe sequence, and that pruning cannot discard all successful sequences. The finite alphabet preserves arbitrary admissible words by canonicalizing only unused tolerance fields.
No bound on the necessary depth or state count is imposed. At depth zero the search cannot succeed because height is clamped below by two. The theorem does not assert that any positive-state search succeeds.
import Definitions.Def_SensitivityWordFrontier
theorem SensitivityWordFrontier.search_correct (n k : ℕ) :
SensitivityWordFrontier.succeeds n k = true ↔
∃ word : List (SensitivityProfileCycle.Recipe n),
word.length = k ∧ SensitivityProfileWord.Crosses215 word := by sorry