Cost of the state compatibility predicate on one candidate

Proved

OAI.ThreeMachine.StackCompiler.Costs.statesP

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

complexityschedulingthree-machine

Throughout, a routine R : Uniform f is a program in the compiler's while-language Code, with a charge function, that computes the function family $f_i$ on encoded data. R.time i x is the charge of $R$ on the encoding of $x$ , a natural number that bounds the number of evaluation steps of the program on that input. For $s,f:I\to\mathbb{N}$ , the predicate Poly s f d means that there is a constant $C$ with $f(i)\le C\,(s(i)+2)^d$ for all $i\in I$ . The routine Uniform.statesP decides whether a state is compatible with a precedence relation given as a Boolean matrix and with a set $W$ , that is State.Compatible (matrixRel M) W. Its running time satisfies Poly of degree $5$ in the number $n$ of jobs.

Formalization Note The statement is reproduced verbatim from upstream TransitionCosts.lean (openai/math, Apache-2.0, credit OpenAI). It feeds the bound requestRawBound_poly and the running-time statement of main_theorem.

Preamble

import Mathlib
import Definitions.Def_OAIThreeMachineSched02

set_option maxHeartbeats 2000000
set_option maxRecDepth 100000
set_option linter.all false
set_option Elab.async false

namespace OAI

universe u1 u2 u3 u4 u5 u6 u7

section
namespace ThreeMachine.StackCompiler.Uniform

end ThreeMachine.StackCompiler.Uniform
namespace ThreeMachine.StackCompiler.Costs

Formal statement

theorem statesP : Poly (fun x : Σ n, Algorithm.State (Fin n) ×
    (Universe n × (Matrix n × Finset (Fin n))) => x.1)
    (fun x => Uniform.statesP.time x.1 x.2) 5 := by
  sorry

end ThreeMachine.StackCompiler.Costs
end
end OAI

Source

OpenAI, "A Polynomial-Time Algorithm for Three-Machine Unit-Job Scheduling" (September 24, 2026), openai/math, cost bounds of the stack compiler. Lean: https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/Computability/Scheduling/TransitionCosts.lean#L31

View graph