Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

OAI.KServer.JointBudget.quota_bound: intermediate lemma from OpenAI, Squared-logarithmic randomized k-server on arbitrary metrics

Proved
OAI.KServer.JointBudget.quota_bound

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

openai-math

An intermediate lemma of the split of OpenAI's proof of OAI.KServer.main_theorem, carved from OpenAI's openai/math development for this platform. The statement and its proof are OpenAI's (OpenAI, Squared-logarithmic randomized k-server on arbitrary metrics, OpenAI Math Release, September 24, 2026, result family 110, github.com/openai/math, Apache License 2.0); in Lean it is the declaration OAI.KServer.JointBudget.quota_bound of lean/OAI/Combinatorics/KServer/KServer/JointBudget.lean at commit adc7f12, ported to Lean 4.33.1 and Mathlib 0df444a.

The statement, as published (namespace OAI.KServer.JointBudget, with open scoped BigOperators, open Finset, open JointExperiment JointAllocation HierarchicalQuota ActualCharges RankTracking):

lemma quota_bound {R τ:ℝ} (hR:0≤R) (hτ:2≤τ) (hrad:∀ d,r d=R/τ^(d.val+1)) (N:ℕ):
    total (weight law hr) N (stepQuota s law hr hk R τ)≤
      (12*τ*localConstant)*ActualCaps.ell k*total (weight law hr) N (stepKey s law hr)+
      2*localConstant*ActualCaps.ell k*treeInventory (LevelKeys.Key Y k) k (fun d=>R/τ^d) L

Definitions. The statement is written with OAI.KServer.FiniteDistribution, OAI.KServer.ActualCaps.ell, OAI.KServer.ActualCharges.localConstant, OAI.KServer.ActualCharges.total, OAI.KServer.HierarchicalQuota.treeInventory, OAI.KServer.JointBudget.stepKey, OAI.KServer.JointBudget.stepQuota, OAI.KServer.JointExperiment.Atom, OAI.KServer.JointExperiment.Raw, OAI.KServer.JointExperiment.Tape, OAI.KServer.JointExperiment.levelTapeFintype, OAI.KServer.JointExperiment.rawWeight, OAI.KServer.JointExperiment.weight, OAI.KServer.LevelKeys.Alphabet, OAI.KServer.LevelKeys.Key, OAI.KServer.LevelKeys.Structure, OAI.KServer.LevelKeys.Tape, OAI.KServer.LevelKeys.Tier, OAI.KServer.LevelKeys.alphabetFintype and OAI.KServer.TierDyadic.index (definitions bundle OAIQ17Ks000 of this split); OAI.KServer.Configuration (the published bundle Def_KServer).

Used by. The proof of OAI.KServer.main_theorem of this split imports it.

Preamble
import Mathlib
import Definitions.Def_KServer
import Definitions.Def_OAIQ17Ks000
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

noncomputable section
open scoped BigOperators
open Finset
namespace KServer.JointBudget
open JointExperiment JointAllocation HierarchicalQuota ActualCharges RankTracking
attribute [local instance] Classical.propDecidable Classical.decEq
variable {Y:Type} [MetricSpace Y] [Fintype Y] {k H L:ℕ} [NeZero k]
variable (s:Configuration k Y) (law:FiniteDistribution (Fin H→Y))
variable {r:Fin L→ℝ} (hr:∀ d,0 < r d) (hk:1≤(k:ℝ))

lemma quota_bound {R τ:ℝ} (hR:0≤R) (hτ:2≤τ) (hrad:∀ d,r d=R/τ^(d.val+1)) (N:ℕ):
    total (weight law hr) N (stepQuota s law hr hk R τ)≤
      (12*τ*localConstant)*ActualCaps.ell k*total (weight law hr) N (stepKey s law hr)+
      2*localConstant*ActualCaps.ell k*treeInventory (LevelKeys.Key Y k) k (fun d=>R/τ^d) L:= by
  sorry

end KServer.JointBudget

end

end OAI
end
Source
OpenAI, Squared-logarithmic randomized k-server on arbitrary metrics, OpenAI Math Release, September 24, 2026, https://github.com/openai/math (result family 110; paper: https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Squared-logarithmic-randomized-k-server-on-arbitrary-metrics-September-24-2026/Squared-logarithmic-randomized-k-server-on-arbitrary-metrics-September-24-2026.pdf; Apache License 2.0); Lean: https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/Combinatorics/KServer/KServer/JointBudget.lean (declaration OAI.KServer.JointBudget.quota_bound)

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