A sensitivity search with exact-sized graph checks reaches 2.15
OpenSensitivityGraphLocal.exists_215_successcombinatoricsfinite-certificatessensitivity
Find raw finite graph-and-labeling data , a positive state count , and a depth for which
The input must satisfy the original tournament, regularity, and parameter conditions, together with the absence of coherent, bounded-defect, and source configurations on subsets of exactly their forbidden cardinalities. The unchanged finite profile search must retain a profile of height satisfying
Here is the vertex count. This is the open witness-existence obligation after reducing graph validation to exact-sized subsets. No graph, labeling, numerical parameters, successful depth, or 2.15 separation is supplied or claimed to be known.
Preamble
import Definitions.Def_SensitivityGraphLocal
Formal statement
theorem SensitivityGraphLocal.exists_215_success :
∃ (D : SensitivityGraphCheck.RawData) (n k : ℕ),
SensitivityGraphLocal.succeeds D (n + 1) k = true := 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.