Exact-sized graph checks preserve the sensitivity search result
ProvedSensitivityGraphLocal.succeeds_eqcombinatoricsfinite-certificatessensitivity
For every raw graph-and-labeling input , every state count , and every depth , the checker that tests only forbidden-size subsets returns the same Boolean result as the original checker:
All original graph conditions are retained. Only the ordinary, defect, and source labeling checks are restricted to subsets of exactly their forbidden cardinalities. The finite profile search is unchanged. This identifies an equivalent validation procedure, including rejection of invalid inputs. It does not assert that a successful input exists.
Preamble
import Definitions.Def_SensitivityGraphLocal
Formal statement
theorem SensitivityGraphLocal.succeeds_eq
(D : SensitivityGraphCheck.RawData) (n k : ℕ) :
SensitivityGraphLocal.succeeds D n k = SensitivityGraphCheck.succeeds D n k := by sorrySource
Original hereditary-subset reduction of SensitivityGraphCheck.RawData.Valid and SensitivityGraphCheck.exists_215_success, https://prove2.me/definitions/e1bc7543-e6c9-4767-be0c-1d4085276993 and https://prove2.me/theorems/6d9893d7-40bb-47ea-acc7-3d8575b5e246. Exact source clauses: coherence, each tolerance-indexed defect bound, and the source-set bound of RawData.Valid. The numerical recurrence and dominance pruning are unchanged from SensitivityVariableFrontier. The subset argument uses Mathlib Finset.exists_subset_card_eq and Finset.powersetCard. This contribution supplies no successful 2.15 witness; the local-check existence theorem is the explicitly open residual problem.