Fraňková–Helly selection theorem explained

In mathematics, the Fraňková - Helly selection theorem is a generalisation of Helly's selection theorem for functions of bounded variation to the case of regulated functions. It was proved in 1991 by the Czech mathematician Dana Fraňková.

Background

Let X be a separable Hilbert space, and let BV([0, ''T'']; X) denote the normed vector space of all functions f : [0, ''T''] → X with finite total variation over the interval [0, ''T''], equipped with the total variation norm. It is well known that BV([0, ''T'']; X) satisfies the compactness theorem known as Helly's selection theorem: given any sequence of functions (fn)nN in BV([0, ''T'']; X) that is uniformly bounded in the total variation norm, there exists a subsequence

\left(fn(k)\right)\subseteq(fn)\subsetBV([0,T];X)

and a limit function f ∈ BV([0, ''T'']; X) such that fn(k)(t) converges weakly in X to f(t) for every t ∈ [0, ''T'']. That is, for every continuous linear functional λX*,

λ\left(fn(k)(t)\right)\toλ(f(t))inRask\toinfty.

Consider now the Banach space Reg([0, ''T'']; X) of all regulated functions f : [0, ''T''] → X, equipped with the supremum norm. Helly's theorem does not hold for the space Reg([0, ''T'']; X): a counterexample is given by the sequence

fn(t)=\sin(nt).

One may ask, however, if a weaker selection theorem is true, and the Fraňková - Helly selection theorem is such a result.

Statement of the Fraňková - Helly selection theorem

As before, let X be a separable Hilbert space and let Reg([0, ''T'']; X) denote the space of regulated functions f : [0, ''T''] → X, equipped with the supremum norm. Let (fn)nN be a sequence in Reg([0, ''T'']; X) satisfying the following condition: for every ε > 0, there exists some Lε > 0 so that each fn may be approximated by a un ∈ BV([0, ''T'']; X) satisfying

\|fn-un\|infty<\varepsilon

and

|un(0)|+Var(un)\leqL\varepsilon,

where |-| denotes the norm in X and Var(u) denotes the variation of u, which is defined to be the supremum

\sup\Pi

m
\sum
j=1

|u(tj)-u(tj-1)|

over all partitions

\Pi=\{0=t0<t1<...<tm=T,m\inN\}

of [0, ''T'']. Then there exists a subsequence

\left(fn(k)\right)\subseteq(fn)\subsetReg([0,T];X)

and a limit function f ∈ Reg([0, ''T'']; X) such that fn(k)(t) converges weakly in X to f(t) for every t ∈ [0, ''T'']. That is, for every continuous linear functional &lambda;X*,

λ\left(fn(k)(t)\right)\toλ(f(t))inRask\toinfty.

References