|
Entire Function
In complex analysis, an entire function, also called an integral function, is a complex-valued function that is holomorphic on the whole complex plane. Typical examples of entire functions are polynomials and the exponential function, and any finite sums, products and compositions of these, such as the trigonometric functions sine and cosine and their hyperbolic counterparts sinh and cosh, as well as derivatives and integrals of entire functions such as the error function. If an entire function f(z) has a root at w, then f(z)/(z-w), taking the limit value at w, is an entire function. On the other hand, the natural logarithm, the reciprocal function, and the square root are all not entire functions, nor can they be continued analytically to an entire function. A transcendental entire function is an entire function that is not a polynomial. Just as meromorphic functions can be viewed as a generalization of rational fractions, entire functions can be viewed as a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complex Analysis
Complex analysis, traditionally known as the theory of functions of a complex variable, is the branch of mathematical analysis that investigates functions of complex numbers. It is helpful in many branches of mathematics, including algebraic geometry, number theory, analytic combinatorics, and applied mathematics, as well as in physics, including the branches of hydrodynamics, thermodynamics, quantum mechanics, and twistor theory. By extension, use of complex analysis also has applications in engineering fields such as nuclear, aerospace, mechanical and electrical engineering. As a differentiable function of a complex variable is equal to the sum function given by its Taylor series (that is, it is analytic), complex analysis is particularly concerned with analytic functions of a complex variable, that is, '' holomorphic functions''. The concept can be extended to functions of several complex variables. Complex analysis is contrasted with real analysis, which dea ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Reciprocal Function
In mathematics, a multiplicative inverse or reciprocal for a number ''x'', denoted by 1/''x'' or ''x''−1, is a number which when multiplied by ''x'' yields the multiplicative identity, 1. The multiplicative inverse of a fraction ''a''/''b'' is ''b''/''a''. For the multiplicative inverse of a real number, divide 1 by the number. For example, the reciprocal of 5 is one fifth (1/5 or 0.2), and the reciprocal of 0.25 is 1 divided by 0.25, or 4. The reciprocal function, the function ''f''(''x'') that maps ''x'' to 1/''x'', is one of the simplest examples of a function which is its own inverse (an involution). Multiplying by a number is the same as dividing by its reciprocal and vice versa. For example, multiplication by 4/5 (or 0.8) will give the same result as division by 5/4 (or 1.25). Therefore, multiplication by a number followed by multiplication by its reciprocal yields the original number (since the product of the number and its reciprocal is 1). The term ''reciproca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Up To
Two Mathematical object, mathematical objects and are called "equal up to an equivalence relation " * if and are related by , that is, * if holds, that is, * if the equivalence classes of and with respect to are equal. This figure of speech is mostly used in connection with expressions derived from equality, such as uniqueness or count. For example, " is unique up to " means that all objects under consideration are in the same equivalence class with respect to the relation . Moreover, the equivalence relation is often designated rather implicitly by a generating condition or transformation. For example, the statement "an integer's prime factorization is unique up to ordering" is a concise way to say that any two lists of prime factors of a given integer are equivalent with respect to the relation that relates two lists if one can be obtained by reordering (permutation, permuting) the other. As another example, the statement "the solution to an indefinite integral is , up ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complex Conjugate
In mathematics, the complex conjugate of a complex number is the number with an equal real part and an imaginary part equal in magnitude but opposite in sign. That is, if a and b are real numbers, then the complex conjugate of a + bi is a - bi. The complex conjugate of z is often denoted as \overline or z^*. In polar form, if r and \varphi are real numbers then the conjugate of r e^ is r e^. This can be shown using Euler's formula. The product of a complex number and its conjugate is a real number: a^2 + b^2 (or r^2 in polar coordinates). If a root of a univariate polynomial with real coefficients is complex, then its complex conjugate is also a root. Notation The complex conjugate of a complex number z is written as \overline z or z^*. The first notation, a vinculum, avoids confusion with the notation for the conjugate transpose of a matrix, which can be thought of as a generalization of the complex conjugate. The second is preferred in physics, where ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Radius Of Convergence
In mathematics, the radius of convergence of a power series is the radius of the largest Disk (mathematics), disk at the Power series, center of the series in which the series Convergent series, converges. It is either a non-negative real number or \infty. When it is positive, the power series absolute convergence, converges absolutely and compact convergence, uniformly on compact sets inside the open disk of radius equal to the radius of convergence, and it is the Taylor series of the analytic function to which it converges. In case of multiple singularities of a function (singularities are those values of the argument for which the function is not defined), the radius of convergence is the shortest or minimum of all the respective distances (which are all non-negative numbers) calculated from the center of the disk of convergence to the respective singularities of the function. Definition For a power series ''f'' defined as: :f(z) = \sum_^\infty c_n (z-a)^n, where *''a'' is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Compact Convergence
In mathematics compact convergence (or uniform convergence on compact sets) is a type of convergence that generalizes the idea of uniform convergence. It is associated with the compact-open topology. Definition Let (X, \mathcal) be a topological space and (Y,d_) be a metric space. A sequence of functions :f_ : X \to Y, n \in \mathbb, is said to converge compactly as n \to \infty to some function f : X \to Y if, for every compact set K \subseteq X, :f_, _ \to f, _ uniformly on K as n \to \infty. This means that for all compact K \subseteq X, :\lim_ \sup_ d_ \left( f_ (x), f(x) \right) = 0. Examples * If X = (0, 1) \subseteq \mathbb and Y = \mathbb with their usual topologies, with f_ (x) := x^, then f_ converges compactly to the constant function with value 0, but not uniformly. * If X=(0,1], Y=\R and f_n(x)=x^n, then f_n converges pointwise convergence, pointwise to the function that is zero on (0,1) and one at 1, but the sequence does not converge compactly. * A very po ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convergence (mathematics)
In mathematics, a series (mathematics), series is the summation, sum of the terms of an infinite sequence of numbers. More precisely, an infinite sequence (a_1, a_2, a_3, \ldots) defines a series (mathematics), series that is denoted :S=a_1 + a_2 + a_3 + \cdots=\sum_^\infty a_k. The th partial sum is the sum of the first terms of the sequence; that is, :S_n = a_1 +a_2 + \cdots + a_n = \sum_^n a_k. A series is convergent (or converges) if and only if the sequence (S_1, S_2, S_3, \dots) of its partial sums tends to a limit of a sequence, limit; that means that, when adding one a_k after the other ''in the order given by the indices'', one gets partial sums that become closer and closer to a given number. More precisely, a series converges, if and only if there exists a number \ell such that for every arbitrarily small positive number \varepsilon, there is a (sufficiently large) integer N such that for all n \ge N, :\left , S_n - \ell \right , 1 produce a convergent series: ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Power Series
In mathematics, a power series (in one variable) is an infinite series of the form \sum_^\infty a_n \left(x - c\right)^n = a_0 + a_1 (x - c) + a_2 (x - c)^2 + \dots where ''a_n'' represents the coefficient of the ''n''th term and ''c'' is a constant called the ''center'' of the series. Power series are useful in mathematical analysis, where they arise as Taylor series of infinitely differentiable functions. In fact, Borel's theorem implies that every power series is the Taylor series of some smooth function. In many situations, the center ''c'' is equal to zero, for instance for Maclaurin series. In such cases, the power series takes the simpler form \sum_^\infty a_n x^n = a_0 + a_1 x + a_2 x^2 + \dots. The partial sums of a power series are polynomials, the partial sums of the Taylor series of an analytic function are a sequence of converging polynomial approximations to the function at the center, and a converging power series can be seen as a kind of generalized polynom ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Weierstrass Factorization Theorem
In mathematics, and particularly in the field of complex analysis, the Weierstrass factorization theorem asserts that every entire function can be represented as a (possibly infinite) product involving its Zero of a function, zeroes. The theorem may be viewed as an extension of the fundamental theorem of algebra, which asserts that every polynomial may be factored into linear factors, one for each root. The theorem, which is named for Karl Weierstrass, is closely related to a second result that every sequence tending to infinity has an associated entire function with zeroes at precisely the points of that sequence. A generalization of the theorem extends it to meromorphic functions and allows one to consider a given meromorphic function as a product of three factors: terms depending on the function's zeros and poles, and an associated non-zero holomorphic function. Motivation It is clear that any finite set \ of points in the complex plane has an associated polynomial p(z) = \pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mittag-Leffler's Theorem
In complex analysis, Mittag-Leffler's theorem concerns the existence of meromorphic functions with prescribed poles. Conversely, it can be used to express any meromorphic function as a sum of partial fractions. It is sister to the Weierstrass factorization theorem, which asserts existence of holomorphic functions with prescribed zeros. The theorem is named after the Swedish mathematician Gösta Mittag-Leffler who published versions of the theorem in 1876 and 1884. Theorem Let U be an open set in \mathbb C and E \subset U be a subset whose limit points, if any, occur on the boundary of U. For each a in E, let p_a(z) be a polynomial in 1/(z-a) without constant coefficient, i.e. of the form p_a(z) = \sum_^ \frac. Then there exists a meromorphic function f on U whose poles are precisely the elements of E and such that for each such pole a \in E, the function f(z)-p_a(z) has only a removable singularity at a; in particular, the principal part of f at a is p_a(z). Furthermore, a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rational Function
In mathematics, a rational function is any function that can be defined by a rational fraction, which is an algebraic fraction such that both the numerator and the denominator are polynomials. The coefficients of the polynomials need not be rational numbers; they may be taken in any field . In this case, one speaks of a rational function and a rational fraction ''over ''. The values of the variables may be taken in any field containing . Then the domain of the function is the set of the values of the variables for which the denominator is not zero, and the codomain is . The set of rational functions over a field is a field, the field of fractions of the ring of the polynomial functions over . Definitions A function f is called a rational function if it can be written in the form : f(x) = \frac where P and Q are polynomial functions of x and Q is not the zero function. The domain of f is the set of all values of x for which the denominator Q(x) is not zero. How ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Meromorphic Function
In the mathematical field of complex analysis, a meromorphic function on an open subset ''D'' of the complex plane is a function that is holomorphic on all of ''D'' ''except'' for a set of isolated points, which are ''poles'' of the function. The term comes from the Greek ''meros'' ( μέρος), meaning "part". Every meromorphic function on ''D'' can be expressed as the ratio between two holomorphic functions (with the denominator not constant 0) defined on ''D'': any pole must coincide with a zero of the denominator. Heuristic description Intuitively, a meromorphic function is a ratio of two well-behaved (holomorphic) functions. Such a function will still be well-behaved, except possibly at the points where the denominator of the fraction is zero. If the denominator has a zero at ''z'' and the numerator does not, then the value of the function will approach infinity; if both parts have a zero at ''z'', then one must compare the multiplicity of these zeros. From an algeb ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
