10.2 Continuation Along a Path

Direct continuation extends a function one overlapping disc at a time. Chaining those steps along a curve is what allows a function to be carried a long way from where it started.

Definition 10.6 (continuation along a path). Let \(\gamma : [0,1] \rightarrow \mathbb {C}\) be a path with \(\gamma (0) = a\) and \(\gamma (1) = b\). A continuation of the element \((f_0, D_0)\) along \(\gamma \) is a family of function elements \((f_t, D_t)\), one for each \(t \in [0,1]\), such that

(i).
\(\gamma (t) \in D_t\) for every \(t\);
(ii).
the element at \(t = 0\) is the given \((f_0, D_0)\);
(iii).
for each \(t \in [0,1]\) there is \(\varepsilon > 0\) such that whenever \(\left |s - t\right | < \varepsilon \) we have \(\gamma (s) \in D_t\) and \(f_s = f_t\) on a neighbourhood of \(\gamma (s)\).

The element \((f_1, D_1)\) is called the continuation of \((f_0,D_0)\) along \(\gamma \).

Condition (iii) is what makes the family hang together: it says neighbouring elements agree near the point of the path they share, so no jump is smuggled in.

Theorem 10.7. If a continuation of \((f_0, D_0)\) along \(\gamma \) exists, the terminal element is unique near \(b\): any two continuations along the same path agree on a neighbourhood of \(\gamma (1)\).

Proof. Let \((f_t, D_t)\) and \((g_t, E_t)\) both continue \((f_0, D_0)\) along \(\gamma \), and let \[S = \{ t \in [0,1] : f_t = g_t \text { on a neighbourhood of } \gamma (t)\}.\] Then \(0 \in S\), so \(S \neq \emptyset \). Condition (iii), applied to both families at a point \(t\), shows that membership of \(S\) propagates to all \(s\) near \(t\): so \(S\) is open in \([0,1]\). If \(t\) is a limit point of \(S\), then \(f_t\) and \(g_t\) are both analytic near \(\gamma (t)\) and agree on a set accumulating at \(\gamma (t)\), so by the uniqueness theorem above they agree near \(\gamma (t)\) and \(t \in S\): so \(S\) is closed. A non-empty subset of the connected set \([0,1]\) that is both open and closed is all of \([0,1]\). Hence \(1 \in S\). \(\blacksquare \)

So the outcome of continuing along a path depends on the path but not on the particular chain of discs used to walk along it. The next question is the one that matters: how much does it depend on the path? □

Questions on this section

Stuck on something here? Ask below and it stays attached to this topic.