Cryptanalysis of the Lorenz cipher

From formulasearchengine
Revision as of 20:22, 12 December 2013 by en>TedColes (Transmissions often contained more than one message)
Jump to navigation Jump to search

Template:No footnotes In functional analysis, the Fréchet-Kolmogorov theorem (the names of Riesz or Weil are sometimes added as well) gives a necessary and sufficient condition for a set of functions to be relatively compact in an Lp space. It can be thought of as an Lp version of the Arzelà-Ascoli theorem, from which it can be deduced.

Statement

Let B be a bounded set in Lp(n), with p[1,).

The subset B is relatively compact if and only if the following properties hold:

  1. limr|x|>r|f|p=0 uniformly on B,
  2. lima0τaffLp(n)=0 uniformly on B,

where τaf denotes the translation of f by a, that is, τaf(x)=f(xa).

The second property can be stated as ε>0δ>0 such that τaffLp(n)<εfB,a with |a|<δ.

References


Template:Mathanalysis-stub