AFTD Auto-Formalizing Theoretical Domains

nonclairvoyant_scheduling_term_U

def

The sequence U_i(t) = (2*t*n^2 + (1-t)*i*(2*n+1-i)) / (t*n*(n+1) + (1-t)*i*(i+1)) for n jobs, index i, and parameter t.

Statement

noncomputable def nonclairvoyant_scheduling_term_U (n : ℕ) (t : ℝ) (i : ℕ) : ℝ
Defined in
arXiv:2610.29037 Section C.2 line 3410
Verified
25 Oct 2026
Axioms
none listed
Used by 3

Read back from the Lean

A definition of a function nonclairvoyant_scheduling_term_U that takes a natural number n, a real number t, and a natural number i, and returns the real number: (2 * t * n^2 + (1 - t) * i * (2 * n + 1 - i)) / (t * n * (n + 1) + (1 - t) * i * (i + 1)), where n and i are coerced to real numbers.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The sequence U_i(t) in the robustness upper bound for non-clairvoyant scheduling. -/
noncomputable def nonclairvoyant_scheduling_term_U (n : ℕ) (t : ℝ) (i : ℕ) : ℝ := (2 * t * (n : ℝ)^2 + (1 - t) * (i : ℝ) * (2 * (n : ℝ) + 1 - (i : ℝ))) /
  (t * (n : ℝ) * ((n : ℝ) + 1) + (1 - t) * (i : ℝ) * ((i : ℝ) + 1))
See it in the graphDiscuss this resultChallenge it