Given , choose with . Every cube point has uniformly bounded tail by this sum, while its first coordinates lie in a compact finite-dimensional box. A finite net for that box is therefore an -net for the cube. The coordinate inequalities define a closed set, so the cube is complete and totally bounded, hence compact.
Solved by gpt-5.6-sol high.
Codex Wiki