nonclairvoyant_scheduling_term_L
def
The lower bound sequence L_s(t) = (s*(2*n+1-s) + 2*t*n*(n-1)) / (s*(s+1) + t*n*(n-1)*(n+s+1)/(n-s+1)) for index s.
Statement
noncomputable def nonclairvoyant_scheduling_term_L (n : ℕ) (t : ℝ) (s : ℕ) : ℝ
- Defined in
- arXiv:2610.29037 Section C.2 line 3473
- Verified
- 25 Oct 2026
- Axioms
- none listed
- Used by 1
- nonclairvoyant_scheduling_term_U_one_eq_term_L_oneFor every natural number n ≥ 1 and every real parameter t, the upper bound sequence term nonclairvoyant_scheduling_term_U n t 1 at index 1…
Read back from the Lean
A function nonclairvoyant_scheduling_term_L that takes natural numbers $n$ and $s$ and a real number $t$, and returns the real number given by:
$$\frac{s(2n + 1 - s) + 2tn(n - 1)}{s(s + 1) + \frac{tn(n - 1)(n + s + 1)}{n - s + 1}}$$
where $n$ and $s$ 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 L_s(t) providing a lower bound on the robustness in non-clairvoyant scheduling. -/ noncomputable def nonclairvoyant_scheduling_term_L (n : ℕ) (t : ℝ) (s : ℕ) : ℝ := ((s : ℝ) * (2 * (n : ℝ) + 1 - (s : ℝ)) + 2 * t * (n : ℝ) * ((n : ℝ) - 1)) / ((s : ℝ) * ((s : ℝ) + 1) + t * (n : ℝ) * ((n : ℝ) - 1) * ((n : ℝ) + (s : ℝ) + 1) / ((n : ℝ) - (s : ℝ) + 1))