Compactness of graphs lemma

The graph of a continuous function over a compact domain is compact
Compactness of graphs lemma

Compactness of graphs lemma: Let (X,dX)(X,d_X) and (Y,dY)(Y,d_Y) be , let KXK\subseteq X be , and let f:KYf:K\to Y be . The graph of ff is Γf={(x,f(x))X×Y:xK}. \Gamma_f=\{(x,f(x))\in X\times Y: x\in K\}. Then Γf\Gamma_f is compact in the product metric space X×YX\times Y.

This lemma is useful when turning statements about functions into statements about sets, for example in limiting arguments and compactness proofs.

Proof sketch: Define F:KX×YF:K\to X\times Y by F(x)=(x,f(x))F(x)=(x,f(x)). The map FF is continuous, and Γf=F(K)\Gamma_f=F(K) is the , hence compact.