In real analysis and complex analysis, branches of mathematics, the identity theorem for analytic functions states: given functions f and g analytic on a domain D (open and connected subset of R {\displaystyle \mathbb {R} } or C {\displaystyle \mathbb {C} } ), if f = g on some S ⊆ D {\displaystyle S\subseteq D} , where S {\displaystyle S} has an accumulation point in D, then f = g on D. Thus an analytic function is completely determined by its values on a single open neighborhood in D, or even a countable subset of D with an accumulation point (provided this contains a converging sequence together with its limit). This is not true in general for real-differentiable functions, even infinitely real-differentiable functions. In comparison, analytic functions are a much more rigid notion. The underpinning fact from which the theorem is established is the expandability of a holomorphic function into its Taylor series. The connectedness assumption on the domain D is necessary. For example, if D consists of two disjoint open sets, f {\displaystyle f} can be 0 {\displaystyle 0} on one open set, and 1 {\displaystyle 1} on another, while g {\displaystyle g} is 0 {\displaystyle 0} on one, and 2 {\displaystyle 2} on another.
Lemma If two holomorphic functions f {\displaystyle f} and g {\displaystyle g} on a domain D agree on a set S which has an accumulation point c {\displaystyle c} in D {\displaystyle D} , then f = g {\displaystyle f=g} on a disk in D {\displaystyle D} centered at c {\displaystyle c} . To prove this, it is enough to show that f ( n ) ( c ) = g ( n ) ( c ) {\displaystyle f^{(n)}(c)=g^{(n)}(c)} for all n ≥ 0 {\displaystyle n\geq 0} , since both functions are analytic. If this is not the case, let m {\displaystyle m} be the smallest nonnegative integer with f ( m ) ( c ) ≠ g ( m ) ( c ) {\displaystyle f^{(m)}(c)\neq g^{(m)}(c)} . By holomorphy, we have the following Taylor series representation in some open neighborhood U of c {\displaystyle c} :
( f − g ) ( z )
= ( z − c ) m ⋅ [ ( f − g ) ( m ) ( c ) m ! + ( z − c ) ⋅ ( f − g ) ( m + 1 ) ( c ) ( m + 1 ) ! + ⋯ ]
… excerpt ends here. Continue reading the full article.
