Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A finite recipe sequence from all ones crossing the 2.15 threshold

Disproved
SensitivityProfileWord.exists_215_word

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

block-sensitivitydiscrete-dynamicsfinite-certificatessensitivity

Find a positive number of states and a nonempty finite sequence of valid recipes. Every positive tolerance used on an ordinary state must be at most five. Start from two matrices having ones on and above the diagonal and zeros below it; apply the fixed interval-envelope transfer map for the recipes in sequence.

If the sequence has length LLL and the largest terminal matrix entry, clamped below by two, is HHH, the required condition is the exact integer inequality

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

All graph parameters and defect cutoffs remain fixed at those of SensitivityProfileSearch. No initial matrices, intermediate profiles, interval witnesses, or radius need be guessed: the sequence determines them. The all-ones characterization proves that this search is complete for SensitivityProfileSearch.exists_215_orbit, allowing repetition of a successful cycle.

The existence of a crossing sequence remains open. No witness reaching 2.15 is supplied, and no bound on the necessary state count or word length is asserted.

Preamble
import Definitions.Def_SensitivityProfileWord
Formal statement
theorem SensitivityProfileWord.exists_215_word :
    ∃ (n : ℕ) (word : List (SensitivityProfileCycle.Recipe (n+1))),
      SensitivityProfileWord.Crosses215 word := by sorry
Source
Original complete all-ones normalization of the deterministic recurrence in https://prove2.me/theorems/c3770ecd-d493-4b1b-8809-72b030b1f260 (SensitivityProfileSearch.exists_215_orbit), based on monotonicity, integer homogeneity, repeated recipe words, and absorption of fixed overhead by a strict power gap. The raw recurrence is from accepted submission a9d25c46-43bd-4fb1-826b-0ed075b8cf0a, SensitivityNQ.rawOne and rawZeroSourceCombined, by yousofy with Codex, retaining OpenAI/math, Robin Kothari with Codex, and community attribution. No crossing word 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