Schwarz integral formula

In complex analysis, a branch of mathematics, the Schwarz integral formula, named after Hermann Schwarz, allows one to recover a holomorphic function, up to an imaginary constant, from the boundary values of its real part.

Unit disc

Let f be a function holomorphic on the closed unit disc {z  C | |z|  1}. Then

for all |z| < 1.

Upper half-plane

Let f be a function holomorphic on the closed upper half-plane {z  C | Im(z)  0} such that, for some α > 0, |zα f(z)| is bounded on the closed upper half-plane. Then

for all Im(z) > 0.

Note that, as compared to the version on the unit disc, this formula does not have an arbitrary constant added to the integral; this is because the additional decay condition makes the conditions for this formula more stringent.

Corollary of Poisson integral formula

The formula follows from Poisson integral formula applied to u:[1][2]

By means of conformal maps, the formula can be generalized to any simply connected open set.

Notes and references

  1. "Lectures on Entire Functions - Google Book Search". books.google.com. Retrieved 2008-06-26.
  2. The derivation without an appeal to the Poisson formula can be found at: http://planetmath.org/encyclopedia/PoissonFormula.html
  • Ahlfors, Lars V. (1979), Complex Analysis, Third Edition, McGraw-Hill, ISBN 0-07-085008-9
  • Remmert, Reinhold (1990), Theory of Complex Functions, Second Edition, Springer, ISBN 0-387-97195-5
  • Saff, E. B., and A. D. Snider (1993), Fundamentals of Complex Analysis for Mathematics, Science, and Engineering, Second Edition, Prentice Hall, ISBN 0-13-327461-6
gollark: Weird thing I noticed today: my desktop, which was plugged in and had the PSU on, but was off according to the front panel power light, was showing Ethernet connectivity and network activity on my cheap switch. Even though the status lights on the actual network port (on the computer, not switch) were off.
gollark: I kind of want to make a random password constraint generator.
gollark: *your password must be between 8 and 4003 characters in length, the length must be a prime number not ending in 7, and it must contain one or nine Egyptian hieroglyphs, at least one valid SQL command, the tears of a unicorn, and a proof or disproof of P = NP*
gollark: What about ~~foolish~~ places which limit password length to 0.5KB?
gollark: hunter2, hunter3, hunter4...
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.