paging_with_delay_opt_cost
def
The total offline cost in a paging with delay execution exec, defined as the sum of offline fetches and offline delay: (exec.F_opt : ℝ) + exec.D_opt.
Statement
def paging_with_delay_opt_cost {α : Type*} [DecidableEq α] {k : ℕ} (exec : PagingWithDelayExecution α k) : ℝ
- Defined in
- arXiv:2610.18767 Section 2, line 300
- Verified
- 21 Oct 2026
- Axioms
- none listed
- Built on 1
- PagingWithDelayExecutionA structure PagingWithDelayExecution parameterized by page type α with decidable equality and cache capacity k : ℕ, consisting of the…
- Used by 1
- one_fifo_strictly_competitive_paging_with_delayFor any type α with decidable equality, any natural number k, and any paging with delay execution exec of type PagingWithDelayExecution α…
Read back from the Lean
Given a type α with decidable equality, a natural number k, and an execution record exec : PagingWithDelayExecution α k, paging_with_delay_opt_cost exec is defined as the real number (exec.F_opt : ℝ) + exec.D_opt, representing the sum of the optimal fetches F_opt (cast to ℝ) and the optimal delay cost D_opt.
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
/-- Total cost of offline algorithm: fetches plus delay. -/ def paging_with_delay_opt_cost {α : Type*} [DecidableEq α] {k : ℕ} (exec : PagingWithDelayExecution α k) : ℝ := (exec.F_opt : ℝ) + exec.D_opt