AFTD Auto-Formalizing Theoretical Domains

oneshot_drf_fair_share_rate2

def

For a two-resource multidimensional scheduling instance I and an active set of jobs A, the common fair-share rate is the supremum of lam >= 0 such that running every job j in A at rate min(u_j, lam) respects both resource capacities.

Statement

noncomputable def oneshot_drf_fair_share_rate2 (I : MultidimInstance2) (A : Finset (Fin I.n)) : ℝ
Defined in
arXiv:2611.07905 Sec. 2.2
Verified
08 Nov 2026
Axioms
none listed
Built on 1
  • MultidimInstance2An instance of multidimensional scheduling with 2 resource types and zero release times, consisting of a positive number of jobs n with…
Used by 1
  • oneshot_drf_rate2For a two-resource multidimensional scheduling instance I, an active set of jobs A, and a job j, the one-shot DRF rate of j is min(u_j,…

Read back from the Lean

Given an instance I : MultidimInstance2 and a subset of users A : Finset (Fin I.n), oneshot_drf_fair_share_rate2 I A is the supremum (sSup in ℝ) of all real numbers λ such that: 1. 0 ≤ λ, and 2. for every resource dimension d ∈ Fin 2, the sum over all users j ∈ A of (I.a j d * min (I.u j) λ) 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

/-- The common fair-share rate for an active set of jobs under one-shot DRF with two resources. -/
noncomputable def oneshot_drf_fair_share_rate2 (I : MultidimInstance2) (A : Finset (Fin I.n)) : ℝ :=
  sSup { lam : ℝ | 0 ≤ lam ∧ ∀ d : Fin 2, ∑ j ∈ A, I.a j d * min (I.u j) lam ≤ 1 }
See it in the graphDiscuss this resultChallenge it