Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

OAI.SharpPlanar.IntegerIntervals.real_mul_bounds_e: intermediate lemma from OpenAI, A sharp Fourier certificate for planar circle packing (result family 090)

Proved
OAI.SharpPlanar.IntegerIntervals.real_mul_bounds_e

by dbenbenn · Nov 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

openai-math

An intermediate lemma of the split of OpenAI's proof of OAI.sharp_fourier_certificate, carved from OpenAI's openai/math development for this platform. The statement and its proof are OpenAI's (OpenAI, A sharp Fourier certificate for planar circle packing (result family 090), OpenAI Math Release, September 23, 2026, result family 90, github.com/openai/math, Apache License 2.0); in Lean it is the declaration OAI.SharpPlanar.IntegerIntervals.real_mul_bounds of lean/OAI/Analysis/PlanarPacking/Intervals.lean at commit 7ef5c0c, ported to Lean 4.33.1 and Mathlib 0df444a.

The statement, as published (namespace OAI.SharpPlanar.IntegerIntervals):

lemma real_mul_bounds_e {a b c d x y : ℝ} (hx : a ≤ x ∧ x ≤ b) (hy : c ≤ y ∧ y ≤ d) :
    min (min (a*c) (a*d)) (min (b*c) (b*d)) ≤ x*y ∧
    x*y ≤ max (max (a*c) (a*d)) (max (b*c) (b*d))

Used by. The proof of OAI.SharpPlanar.IntegerIntervals.mul_bounds_e of this split imports it.

Preamble
import Mathlib
Formal statement
section

set_option linter.all false
set_option linter.unusedVariables false
set_option linter.unusedTactic false
set_option linter.unreachableTactic false

namespace OAI

namespace SharpPlanar
namespace IntegerIntervals

lemma real_mul_bounds_e {a b c d x y : ℝ} (hx : a ≤ x ∧ x ≤ b) (hy : c ≤ y ∧ y ≤ d) :
    min (min (a*c) (a*d)) (min (b*c) (b*d)) ≤ x*y ∧
    x*y ≤ max (max (a*c) (a*d)) (max (b*c) (b*d)) := by
  sorry

end IntegerIntervals
end SharpPlanar

end OAI
end
Source
OpenAI, A sharp Fourier certificate for planar circle packing (result family 090), OpenAI Math Release, September 23, 2026, https://github.com/openai/math (result family 90; paper: https://github.com/openai/math/blob/7ef5c0cc5ca4b0e072b7a050fca09ab24bc6fa3a/preprints/A-sharp-Fourier-certificate-for-planar-circle-packing-September-23-2026/paper.pdf; Apache License 2.0); Lean: https://github.com/openai/math/blob/7ef5c0cc5ca4b0e072b7a050fca09ab24bc6fa3a/lean/OAI/Analysis/PlanarPacking/Intervals.lean (declaration OAI.SharpPlanar.IntegerIntervals.real_mul_bounds)

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