Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

OAI.FixedClauseThreshold.properSATProbability_center_upper_sat: intermediate lemma from OpenAI, Limiting random SAT thresholds, sharp variance and computability (result family 235)

Proved
OAI.FixedClauseThreshold.properSATProbability_center_upper_sat

by dbenbenn · Oct 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

openai-math

An intermediate lemma of the split of OpenAI's proof of OAI.FixedClauseThreshold.Computability.main, carved from OpenAI's openai/math development for this platform. The statement and its proof are OpenAI's (OpenAI, Limiting random SAT thresholds, sharp variance and computability (result family 235), OpenAI Math Release, September 27, 2026, result family 235, github.com/openai/math, Apache License 2.0); in Lean it is the declaration OAI.FixedClauseThreshold.properSATProbability_center_upper of lean/OAI/Probability/RandomSAT/Concentration.lean at commit adc7f12, ported to Lean 4.33.1 and Mathlib 0df444a.

The statement, as published (namespace OAI.FixedClauseThreshold, with open Finset):

theorem properSATProbability_center_upper_sat {n k m : ℕ} (hk : 3 ≤ k) (hn : k + 1 ≤ n)
    (hm : m ≤ mainCap n k)
    (hgap : (n : ℝ) * center n k + fluctuationWindow n k ≤ m) :
    properSATProbability n k m ≤ concentrationError n k

Definitions. The statement is written with OAI.FixedClauseThreshold.center, OAI.FixedClauseThreshold.concentrationError, OAI.FixedClauseThreshold.fluctuationWindow and OAI.FixedClauseThreshold.mainCap (definitions bundle OAIQ067A000 of this split); OAI.FixedClauseThreshold.properSATProbability (the published bundle Def_SATComputability).

Used by. The proofs of OAI.FixedClauseThreshold.Computability.auxiliaryPoissonProbability_supercritical_sat, OAI.FixedClauseThreshold.Computability.main and OAI.FixedClauseThreshold.center_lower_of_auxiliary_probability_sat of this split import it.

Preamble
import Mathlib
import Definitions.Def_SATComputability
import Definitions.Def_OAIQ067A000
Formal statement
section

attribute [-instance] _root_.OAI.DilutedSpinGlass.ConcreteReservoir.siteNeZero _root_.OAI.RapidForcing.EffectiveArithmetic.ratPrimcodable
set_option linter.all false
set_option linter.unusedVariables false
set_option linter.unusedTactic false
set_option linter.unreachableTactic false

namespace OAI

namespace FixedClauseThreshold

open Finset

noncomputable section

attribute [local instance] Classical.propDecidable

theorem properSATProbability_center_upper_sat {n k m : ℕ} (hk : 3 ≤ k) (hn : k + 1 ≤ n)
    (hm : m ≤ mainCap n k)
    (hgap : (n : ℝ) * center n k + fluctuationWindow n k ≤ m) :
    properSATProbability n k m ≤ concentrationError n k := by
  sorry

end

end FixedClauseThreshold

end OAI
end
Source
OpenAI, Limiting random SAT thresholds, sharp variance and computability (result family 235), OpenAI Math Release, September 27, 2026, https://github.com/openai/math (result family 235; paper: https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Computing-the-Random-3-SAT-Threshold-September-27-2026/article.pdf; Apache License 2.0); Lean: https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/Probability/RandomSAT/Concentration.lean (declaration OAI.FixedClauseThreshold.properSATProbability_center_upper)

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