Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact large-degree scalar cutoffs for the two-, three-, and four-pair bounds

Proved
DerivativeChainPrivate.rb5_thresholds

by labuka · Oct 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

derivative-chain-formalization-20261018derivative-chain-privatepolynomials

For c>=0, the scalar RB5 expression is strictly less than 3 when N>=10 and c<=4, strictly less than 7/2 when N>=13 and c<=6, and strictly less than 4 when N>=17 and c<=8. N corresponds to n-1 in the source. This does not assert that any polynomial satisfies the RB5 estimate.

Preamble
import Mathlib.Analysis.Real.Sqrt
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum

set_option autoImplicit false

namespace DerivativeChainPrivate
end DerivativeChainPrivate
Formal statement
theorem DerivativeChainPrivate.rb5_thresholds (N c : ℝ) (hc : 0 ≤ c) :
    (10 ≤ N → c ≤ 4 → 1 + Real.sqrt (1 + c ^ 2 / (N - c)) < 3) ∧
    (13 ≤ N → c ≤ 6 → 1 + Real.sqrt (1 + c ^ 2 / (N - c)) < (7 : ℝ) / 2) ∧
    (17 ≤ N → c ≤ 8 → 1 + Real.sqrt (1 + c ^ 2 / (N - c)) < 4) := by sorry
Source
Derivative-zero chains: public formalization reference, R35, DerivativeChainPrivate.rb5_thresholds. https://gist.github.com/Amal-David/d6612109c98595b12561cd638c60edf5/3883c57ddc7bf9d4c0e898c3d6bfd2ca0d7f9c95#file-notes-md
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

  • Endorsed by labuka · Oct 20, 2026

    Confirmed by the mission captain (proposal self-audit).

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