Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A positive-state exact frontier search succeeds at the 2.15 threshold

Disproved
SensitivityWordFrontier.exists_215_success

by dmilosch · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

discrete-dynamicsexact-searchfinite-certificatessensitivity

There is a positive state count and a finite depth at which the deterministic dominance-pruned profile search succeeds:

∃n,k∈N,succeeds(n+1,k)=true.\exists n,k\in\mathbb N,\quad \mathrm{succeeds}(n+1,k)=\mathrm{true}.∃n,k∈N,succeeds(n+1,k)=true.

Every search frontier is computed from the fixed all-ones initial profile using every valid letter in the finite tolerance alphabet. Success means that a retained profile has height HHH satisfying

H43<1405520k.H^{43}<14055^{20k}.H43<1405520k.

This is the remaining open numerical existence problem. No successful state count, depth, profile, or recipe sequence is known from this submission. The separately proved search-correctness theorem makes this assertion equivalent to the original positive-state crossing-word conjecture; no stronger cutoff, bounded search horizon, or restriction to constant or periodic recipes is assumed.

Preamble
import Definitions.Def_SensitivityWordFrontier
Formal statement
theorem SensitivityWordFrontier.exists_215_success :
    ∃ n k : ℕ, SensitivityWordFrontier.succeeds (n+1) k = true := by sorry
Source
Original complete finite-search reduction of SensitivityProfileWord.exists_215_word, https://prove2.me/theorems/76888ed0-dff9-4b8d-b69f-5a603abeb564. Exact source definitions: SensitivityProfileWord.run, Admissible, Crosses215; SensitivityProfileSearch.step and envelope; SensitivityProfileCycle.Recipe.Valid. The recurrence originates in accepted submission a9d25c46-43bd-4fb1-826b-0ed075b8cf0a (yousofy with Codex), retaining OpenAI/math, Robin Kothari with Codex, and community attribution. The finite alphabet and dominance-pruning algorithm are new. No crossing witness or search-success bound is supplied or claimed to be known.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me