Holomorphic extension across a finite set of bounded singularities, preserving the bound
ProvedDavenport.bounded_holomorphic_extension_of_finsetStatement. Let be open, let be a finite set of complex numbers, let be holomorphic on , and suppose for every . Then there is a function which is holomorphic on all of , agrees with on , and satisfies for every — including the points of that lie in .
Discussion. This is Riemann's removable singularity theorem, iterated over a finite set and with the uniform bound carried across the removed points. The first two conclusions follow by induction on : if is one of the points, then is again open, the inductive hypothesis produces a holomorphic extension across the remaining points, and Riemann's theorem (in the form: a function holomorphic and bounded on a punctured neighbourhood of extends holomorphically across ) removes the singularity at .
The third conclusion is not automatic from the first two and is what makes the lemma usable in contour-integration estimates: at a point the value is a limit of values with , because is open and is finite, so accumulates at ; continuity of at then gives as well.
Note that no hypothesis is needed. If were empty then would be a finite open subset of , hence empty, and the conclusion is vacuous.
Use. In the Hardy–Littlewood/Perron contour method one is given a generating function with its polar parts subtracted off, holomorphic and bounded by away from a finite set of would-be poles. This lemma says the shifted contour picks up no residues at all and that the bound is valid on the whole rectangle, which is exactly what the edge estimates require.
import Mathlib.Analysis.Complex.RemovableSingularity import Mathlib.Analysis.Complex.CauchyIntegral open Set
namespace Davenport
theorem bounded_holomorphic_extension_of_finset {U : Set ℂ} {P : Finset ℂ}
{H : ℂ → ℂ} {M : ℝ} (hU : IsOpen U)
(hd : DifferentiableOn ℂ H (U \ ↑P))
(hb : ∀ s ∈ U \ (↑P : Set ℂ), ‖H s‖ ≤ M) :
∃ G : ℂ → ℂ, DifferentiableOn ℂ G U ∧ Set.EqOn G H (U \ ↑P) ∧ ∀ s ∈ U, ‖G s‖ ≤ M := by sorry
end Davenport