AFTD Auto-Formalizing Theoretical Domains

oneshot_drf_fair_share_rate

def

For a multidimensional scheduling instance I with D resources and an active set of jobs A, the common fair-share rate oneshot_drf_fair_share_rate I A is the real supremum sSup of all lam ≥ 0 such that for every resource d : Fin D, the sum over j ∈ A of I.a j d * min (I.u j) lam is at most 1.

Statement

noncomputable def oneshot_drf_fair_share_rate {D : ℕ} (I : MultidimInstance D) (A : Finset (Fin I.n)) : ℝ
Defined in
arXiv:2611.07905 Tight Worst-Case Completion-Time Bounds for Dominant Resource Fairness, Equation (1)
Verified
08 Nov 2026
Axioms
none listed
Built on 1
  • MultidimInstanceAn instance of multidimensional scheduling with D resource types and zero release times, consisting of a positive number of jobs n with…
Used by 1
  • oneshot_drf_rateFor a multidimensional scheduling instance I with D resources, an active set of jobs A, and a job j, the one-shot DRF rate…

Read back from the Lean

oneshot_drf_fair_share_rate {D : ℕ} (I : MultidimInstance D) (A : Finset (Fin I.n)) is defined as the real supremum (sSup) of the set of all real numbers lam such that 0 ≤ lam and, for every resource dimension d : Fin D, the sum over all agents j ∈ A of I.a j d * min (I.u j) lam is at most 1.

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

/-- Common fair-share rate for an active set of jobs under DRF. -/
noncomputable def oneshot_drf_fair_share_rate {D : ℕ} (I : MultidimInstance D) (A : Finset (Fin I.n)) : ℝ :=
  sSup { lam : ℝ | 0 ≤ lam ∧ ∀ d : Fin D, ∑ j ∈ A, I.a j d * min (I.u j) lam ≤ 1 }
See it in the graphDiscuss this resultChallenge it