Carleson–Jacobs theorem

In mathematics, the Carleson–Jacobs theorem, introduced by Carleson and Jacobs (1972), describes the best approximation to a continuous function on the unit circle by a function in a Hardy space.[1]

Notes
  1. Garnett 1981, p. 139.
gollark: Valorant does have the significant issue of having constantly-running kernel-level "anticheat" which I think can also be remotely updated.
gollark: Generally not a very efficient one, at least, because of the competing interests of all the humans involved and very slow self-regulation.
gollark: That would kind of defeat the point of the trolley problem.
gollark: That post and the comments seem to provide a decent enough explanation, yes.
gollark: You would expect *some* other stargate network, since it was discovered... a few thousand years, or something, ~~since~~ before the present day in-setting and technology has improved since then.

References
  • Carleson, Lennart; Jacobs, Sigvard (1972), "Best uniform approximation by analytic functions", Arkiv för Matematik, 10: 219–229, doi:10.1007/BF02384810, ISSN 0004-2080, MR 0322410
  • Garnett, John B. (1981). Bounded analytic functions. Academic Press. ISBN 0-12-276150-2. MR 0068971.CS1 maint: ref=harv (link)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.