For infinite products, a nonzero limiting product requires that its factors tend to one. A useful sufficient condition isAfter finitely many factors, and the principal holomorphic logarithm satisfies . Therefore the sum of logarithms converges, and exponentiating it gives a finite nonzero product. The same argument on compact sets proves infinite product convergence from logarithmic tails: a locally uniformly absolutely convergent tail of holomorphic logarithms gives a holomorphic nonvanishing tail product. Finite factors then determine all zeros and their orders.
Work with entire functions on . As usual for prescribed exact zero orders, the distinct zero locations must have consistent multiplicities. The literal statement allows repeated locations with conflicting orders; that cannot be true, for example if the same point is prescribed order one and order two. Remove consistent repetitions rather than adding their orders, and separate a possible zero at the origin.
List the distinct nonzero locations as , with prescribed orders , and write for the prescribed order at zero, or zero if the origin is not prescribed. Choose large enough thatThen the Weierstrass factorization theorem construction isOn every compact set, for all sufficiently large because . Its logarithmic tail is bounded byThus the product converges locally uniformly, is entire, and has exactly the specified zeros with exactly their orders. At a prescribed zero, only its own finite factor vanishes; all other finite factors and the tail product are nonzero.
Without escape to infinity the conclusion fails in general. Distinct proposed zeros accumulate at zero. The identity theorem would force an entire function with those zeros to vanish identically, which does not have precisely the prescribed isolated zeros. A finite zero set can of course be realized by a polynomial.
For entire functions with the same zero divisor, the quotient extends through every common zero by cancelling equal local powers. It is entire and nowhere zero. Hence is entire and has a primitive on the simply connected plane. Choose with and putThe derivative of vanishes, and its value at zero is one. ThereforeIf also , then everywhere. The continuous difference takes values in the discrete set and so is constant on the connected plane:The whole-plane hypothesis matters: a zero-free holomorphic quotient on a multiply connected domain need not possess a global holomorphic logarithm.
Write the finite abelian group additively. A character of a finite abelian group is a group homomorphism . We first prove that there are exactly such characters of a finite abelian group, without assuming a structure theorem.
Use extension of a character across a cyclic quotient. Given a subgroup and , let be the least positive integer with . The subgroup has cosets of . If is a character of a finite abelian group on , choose any of the roots and defineThis is well-defined: two representations differ by an integer multiple of , and the root equation exactly cancels that difference. It is a character of a finite abelian group, and every extension arises from one of the choices of . Build a chain from the trivial subgroup to by adjoining elements. The character of a finite abelian group count multiplies by the same factor as the subgroup order at every step, so .
For a nontrivial character of a finite abelian group , choose with . Translating the group sum showsso the sum is zero. Applied to , this provesThe orthogonal nonzero characters of a finite abelian group therefore form a basis of all complex functions on , a vector space of dimension .
With the unnormalized Fourier coefficients , expansion in that basis gives the Fourier inversion on a finite groupUnder a normalized forward-transform convention the prefactor would instead be one. Thus the unspecified constant is determined by the convention, and the inversion itself follows directly from character of a finite abelian group counting and orthogonality.
Articles by others on the same topic
There are currently no matching articles.