Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An arithmetic profile orbit at known labeling parameters crossing 2.15

Disproved
SensitivityProfileSearch.exists_215_orbit

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

block-sensitivitydiscrete-dynamicsfinite-certificatessensitivity

Find a positive integer number of states, a positive period ℓ\ellℓ, a natural number R>1R>1R>1, a periodic list of valid recipes, and two positive upper-triangular integer input matrices such that the deterministic profile orbit in SensitivityProfileSearch returns within factor RRR after ℓ\ellℓ steps and

R43<1405520ℓ.R^{43}<14055^{20\ell}.R43<1405520ℓ.

Every positive tolerance used by a recipe must be at most five. The orbit uses the fixed parameters

d=7027,t=24,w=22,(v0,…,v5)=(24,31,38,44,50,55).d=7027,\quad t=24,\quad w=22,\quad (v_0,\ldots,v_5)=(24,31,38,44,50,55).d=7027,t=24,w=22,(v0​,…,v5​)=(24,31,38,44,50,55).

No graph or labeling must be constructed here: the simultaneous labeling theorem for the regular cyclic tournament at these parameters is already proved. No intermediate profile matrices, interval witnesses, or compatibility inequalities are supplied by the solver; all profiles are computed using the interval-minimum recurrence, and those obligations follow automatically from the recurrence and recipe validity.

This is an open sufficient-condition conjecture for SensitivityProfileCycle.exists_215_certificate. Neither a 2.15 orbit nor the adequacy of this fixed-parameter class is asserted to be known. The cited accepted construction achieves approximately 2.13082558; it does not establish this conjecture.

Preamble
import Definitions.Def_SensitivityProfileSearch
Formal statement
theorem SensitivityProfileSearch.exists_215_orbit :
    ∃ (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 := by sorry
Source
Original deterministic interval-envelope reduction of the recursive profiles in accepted Prove2Me submission a9d25c46-43bd-4fb1-826b-0ed075b8cf0a, https://prove2.me/theorems/46659a00-722d-4dc9-b28e-ef02d6a0c9c2. Exact source components: SensitivitySourceLabeling14055Q5.shared_labeling_source_below_14055_q5_lll and SensitivityNQ.rawZeroSourceCombined/rawOne. Authors: yousofy with Codex; retains OpenAI/math, Robin Kothari with Codex, and earlier community attribution. The arithmetic 2.15 orbit conjecture is new and is not proved by that source.

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