Fraňková–Helly selection theorem

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

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*,

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

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

and

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

over all partitions

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

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 λ X*,

gollark: Actually, that seems like it would be hard and require much specialised knowledge.
gollark: I wonder if we can somehow exploit this to run APIONET at a lower level.
gollark: Oh, and fun things like the towers knowing your location fairly accurately at all times and "silent SMSes" and such.
gollark: Anyway, the phone network is a hellhole of poorly designed custom encryption, SIM cards which shouldn't exist and definitely shouldn't run Java but do (and have way too much possibly insecure onboard functionality), seemingly nonpublic standards, and modems with apioformic proprietary code doing ???.
gollark: I made an automatic trader bot for the meme economy.

References

  • Fraňková, Dana (1991). "Regulated functions". Math. Bohem. 116 (1): 20–59. ISSN 0862-7959. MR 1100424.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.