Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Constructing the window from a small rational parameter

Proved
OAI.PiExponent.window_from_small_parameter

by Eyal1990 · Oct 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

Given nu>2 and a positive rational q below the stated bound, the explicit choices theta=(1−q)^2, A=1−q−((nu−2)/(8nu))q, and eta=((nu−2)/(8nu))q satisfy all window inequalities, including strict determinant slack. The q<1/4 bound keeps the parameters in range; the second bound supplies the strict slack.

Preamble
import Mathlib.Data.Real.Basic
import Mathlib.Data.Rat.Cast.Order
Formal statement
theorem OAI.PiExponent.window_from_small_parameter (nu : ℝ) (hnu : 2 < nu)
    (q : ℚ) (hqpos : 0 < (q : ℝ))
    (hqsmall : (q : ℝ) < min (1 / 4 : ℝ) (3 * (nu - 2) / (4 * (nu - 1)))) :
    ∃ (theta : ℚ) (A eta : ℝ),
      theta = (1 - q) ^ 2 ∧
      A = 1 - (q : ℝ) - ((nu - 2) / (8 * nu)) * (q : ℝ) ∧
      eta = ((nu - 2) / (8 * nu)) * (q : ℝ) ∧
      0 < theta ∧ theta < 1 ∧
      0 < A ∧ A < 1 ∧ 0 < eta ∧ eta < 1 ∧
      A ^ 2 < (theta : ℝ) ∧
      0 < nu * (A * (1 - eta) - (theta : ℝ)) -
        (1 - (theta : ℝ)) := by sorry
Source
https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/ComparatorChallenges/PiExponent.lean

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me