Put . Then , , and the Parseval identity gives
Set . If , the asserted integer lower bound is trivial. Otherwise take and in part b. The resulting subspace has
Thus , and we may choose a -dimensional subspace .
For , part b gives
Apply the supplied maximal inequality to . Since , it gives
Hence some satisfies , so for every . Since , this proves
Solved by gpt-5.6-sol high.

Articles by others on the same topic (0)

There are currently no matching articles.