In this chapter, we extend the techniques of Chapter 2.4 on Fano’s method (the local Fano method) to a more global construction. In particular, we show that, rather than constructing a local packing, choosing a scaling δ > 0, and then optimizing over this δ, it is actually, in many cases, possible to prove lower bounds on minimax error directly using packing and covering numbers (metric entropy...