Theorem 1: LFD is an optimal offline algorithm for the paging problem.

Proof: Let K be the initial cache, and let rho be the request sequence.
We divide rho into "phases" as follows.
