Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

All-ones recipe search is complete for the 2.15 orbit criterion

Proved
SensitivityProfileWord.orbit_iff_word

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

block-sensitivitydiscrete-dynamicsfinite-certificatessensitivity

The positive-profile orbit criterion of SensitivityProfileSearch.exists_215_orbit is equivalent to the existence of a positive number of states and a finite recipe word satisfying SensitivityProfileWord.Crosses215.

Thus a certificate with arbitrary positive integer initial matrices, a positive period LLL, and an integer return factor R>1R>1R>1 satisfying

R43<1405520LR^{43}<14055^{20L}R43<1405520L

exists if and only if a nonempty admissible recipe sequence, started from the fixed all-ones upper-triangular profile, has terminal height HHH satisfying

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

The new sequence may be longer than the original period. The equivalence preserves the allowed state counts, recipes, and tolerance bounds. It removes all freely chosen initial profile entries and the freely chosen radius from the search, without requiring a new restriction on the family of constructions. This equivalence does not assert that either side has a witness.

Preamble
import Definitions.Def_SensitivityProfileWord
Formal statement
theorem SensitivityProfileWord.orbit_iff_word :
    (∃ (n p radius : ℕ)
      (recipes : Fin (p+1) → SensitivityProfileCycle.Recipe (n+1))
      (initial : SensitivityProfileSearch.Profile (n+1)),
      1 < radius ∧ radius^43 < (14055^(p+1))^20 ∧
      SensitivityProfileSearch.PositiveUpper initial ∧
      (∀ d, (recipes d).Valid ∧
        ∀ i, 3 ≤ i.val → 0 < (recipes d).tol i → (recipes d).tol i < 6) ∧
      SensitivityProfileSearch.ReturnsWithin recipes initial radius) ↔
    ∃ (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