For a holomorphic function on , the complex Taylor theorem states
with uniform convergence on each smaller closed disc. Here is a proof. Choose . For and , the geometric series
converges uniformly. Substitute it into Cauchy integral formula and integrate term by term to get
If , then . These bounds justify differentiating the power series any fixed number of times on a smaller closed disc, by comparison with convergent differentiated geometric series. Evaluation at gives . Since every belongs to some such smaller disc, the formula holds throughout the stated domain.
The identity theorem says that two holomorphic functions on a connected open subset of are equal everywhere if their equality set has an accumulation point in that subset. Equivalently, a holomorphic function with an interior accumulation point of zeros is identically zero there.
The proposed Taylor coefficients at , including the specified value for , give
The function is holomorphic on and has exactly the given derivatives, so it supplies existence. Any other admissible holomorphic function has the same Taylor series on . The punctured plane is connected, so the identity theorem gives uniqueness:
Use the following boundary version of Cauchy's integral theorem: if a function is holomorphic on a neighborhood of a compact region bounded by finitely many piecewise smooth simple closed curves, its integral around the positively oriented boundary is zero. On an annulus this means that its integrals around the two circles, both taken counterclockwise, are equal.
For , the function is holomorphic on a neighborhood of . The theorem therefore gives
As , continuity of makes the integrand converge uniformly to . The right side tends to , proving Cauchy integral formula without assuming that formula in an intermediate step.
Let denote the requested boundary integral. Parametrize the unit circle by . Since ,
Taking complex conjugates and using gives
This is the conjugated Cauchy integral on a circle identity. The function is holomorphic on a neighborhood of the closed unit disc, because . Applying Cauchy integral formula at zero gives . Thus
The complex conjugates in these formulas are essential; the boundary integrand contains .
A maximal ideal is a proper ideal of such that an ideal with is either or . Suppose first that is a maximal ideal. If , then , so for some and . In the quotient ring, . Every nonzero element of therefore has a multiplicative inverse, so is a field. Conversely, if is a field and properly contains , choose . The element has a multiplicative inverse , whence , giving and . Thus
The squares in are , which do not include . Hence has no root in . A polynomial of degree two or three over a field is an irreducible polynomial exactly when it has no root: any proper polynomial factorization of such a degree has a factor of degree one. The polynomial ring over a field is a Euclidean domain, so the ideal generated by an irreducible polynomial is a maximal ideal. It follows that
is a field. Every coset has a unique representative , by polynomial division, so .
Let be the coset of in this field. Since , the map
is a ring homomorphism. It is surjective by the representative description. Since are linearly independent over , its kernel of a ring homomorphism is
There is also a field with elements. The cubes in are , so has no root and is an irreducible polynomial. Therefore
is a field whose unique representatives have degree below three. There are such representatives.
The adjoint on an inner product space is characterized by
Here is a finite-dimensional construction that supplies every required basis fact. If is any basis, its coordinate linear functionals form a basis of : a linear functional is uniquely specified by its values on these vectors. Hence . The linear map
is injective, because implies , and positive definiteness implies . Equal dimensions make an linear isomorphism. If is the dual map, then
This establishes existence and linearity. If two possible vectors represent the same linear functional through the inner product, then , so . Applied to every argument, this proves uniqueness of the adjoint on an inner product space.
For linear maps , two applications of the defining inner product identity give
Uniqueness therefore gives . Likewise , for real , and . An induction gives , and applying additivity to a polynomial with real coefficients gives
Symmetry of the real inner product also gives . If is the minimal polynomial of , the displayed identity gives , so the minimal polynomial of divides . Applying the same argument to gives reverse divisibility. Both polynomials are monic, hence their minimal polynomials are equal.
The distinct eigenvalues are exactly the roots of the minimal polynomial in the chosen field. An eigenvector with eigenvalue satisfies , so . Conversely, if and were a linear isomorphism, then would imply , contradicting minimal degree. Thus is not injective, giving an eigenvector. It follows that and have the same distinct eigenvalues. This includes the complex eigenvalues after complexification of a real vector space; over the real field it states equality of their real eigenvalues.
Write for the dual space. Define . For fixed , this is a linear functional on ; evaluation is also linear in , so is a linear map. If , extend to a basis and take its first coordinate linear functional ; then . Thus is injective. A dual basis has the same number of elements as the original basis, so . The rank-nullity theorem now makes an linear isomorphism.
The annihilator of a vector subspace of a linear subspace is
Extend a basis of to a basis of , with dual basis . A linear functional belongs to exactly when its first coordinates in this dual basis vanish. Hence has basis , proving
The dual map is ; here this is the algebraic dual map, denoted in the source. If , then . Consequently . Moreover,
because coordinate linear functionals separate vectors. This proves , including the requested second inclusion. Taking dimensions gives
The first inclusion has equal dimensions on both sides, so
For a matrix representing , the matrix of in the corresponding dual bases is : its entry is . Thus the column rank of is the row rank of , while the column rank of is . Applying the established equality to these two linear maps proves row rank equals column rank over every field.

There are unlisted articles, also show them or only show them.