|
Runge Theorem
In complex analysis, Runge's theorem (also known as Runge's approximation theorem) is named after the German mathematician Carl Runge who first proved it in the year 1885. It states the following: Denoting by C the set of complex numbers, let ''K'' be a compact subset of C and let ''f'' be a function which is holomorphic on an open set containing ''K''. If ''A'' is a set containing at least one complex number from every bounded connected component of C\''K'' then there exists a sequence (r_n)_ of rational functions which converges uniformly to ''f'' on ''K'' and such that all the poles of the functions (r_n)_ are in ''A.'' Note that not every complex number in ''A'' needs to be a pole of every rational function of the sequence (r_n)_. We merely know that for all members of (r_n)_ that do have poles, those poles lie in ''A''. One aspect that makes this theorem so powerful is that one can choose the set ''A'' arbitrarily. In other words, one can choose any complex numbers fro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Runge Theorem
In complex analysis, Runge's theorem (also known as Runge's approximation theorem) is named after the German mathematician Carl Runge who first proved it in the year 1885. It states the following: Denoting by C the set of complex numbers, let ''K'' be a compact subset of C and let ''f'' be a function which is holomorphic on an open set containing ''K''. If ''A'' is a set containing at least one complex number from every bounded connected component of C\''K'' then there exists a sequence (r_n)_ of rational functions which converges uniformly to ''f'' on ''K'' and such that all the poles of the functions (r_n)_ are in ''A.'' Note that not every complex number in ''A'' needs to be a pole of every rational function of the sequence (r_n)_. We merely know that for all members of (r_n)_ that do have poles, those poles lie in ''A''. One aspect that makes this theorem so powerful is that one can choose the set ''A'' arbitrarily. In other words, one can choose any complex numbers fro ... [...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 ''K''. In this case, one speaks of a rational function and a rational fraction ''over K''. The values of the variables may be taken in any field ''L'' containing ''K''. 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 ''L''. The set of rational functions over a field ''K'' is a field, the field of fractions of the ring of the polynomial functions over ''K''. Definitions A function f(x) is called a rational function if and only 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 valu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Oka–Weil Theorem
In mathematics, especially the theory of several complex variables, the Oka–Weil theorem is a result about the uniform convergence of holomorphic functions on Stein spaces due to Kiyoshi Oka and André Weil. Statement The Oka–Weil theorem states that if ''X'' is a Stein space and ''K'' is a compact \mathcal(X)-convex subset of ''X'', then every holomorphic function in an open neighborhood of ''K'' can be approximated uniformly on ''K'' by holomorphic functions on \mathcal(X) (i.e. by polynomials). Applications Since Runge's theorem may not hold for several complex variables, the Oka–Weil theorem is often used as an approximation theorem for several complex variables. The Behnke–Stein theorem was originally proved using the Oka–Weil theorem. See also * Oka coherence theorem In mathematics, the Oka coherence theorem, proved by , states that the sheaf \mathcal := \mathcal_ of germs of holomorphic functions on \mathbb^n over a complex manifold is coherent.In pa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cauchy's Integral Formula
In mathematics, Cauchy's integral formula, named after Augustin-Louis Cauchy, is a central statement in complex analysis. It expresses the fact that a holomorphic function defined on a disk is completely determined by its values on the boundary of the disk, and it provides integral formulas for all derivatives of a holomorphic function. Cauchy's formula shows that, in complex analysis, "differentiation is equivalent to integration": complex differentiation, like integration, behaves well under uniform limits – a result that does not hold in real analysis. Theorem Let be an open subset of the complex plane , and suppose the closed disk defined as :D = \bigl\ is completely contained in . Let be a holomorphic function, and let be the circle, oriented counterclockwise, forming the boundary of . Then for every in the interior of , :f(a) = \frac \oint_\gamma \frac\,dz.\, The proof of this statement uses the Cauchy integral theorem and like that theorem, it only requir ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Riemann Sphere
In mathematics, the Riemann sphere, named after Bernhard Riemann, is a model of the extended complex plane: the complex plane plus one point at infinity. This extended plane represents the extended complex numbers, that is, the complex numbers plus a value \infty for infinity. With the Riemann model, the point \infty is near to very large numbers, just as the point 0 is near to very small numbers. The extended complex numbers are useful in complex analysis because they allow for division by zero in some circumstances, in a way that makes expressions such as 1/0=\infty well-behaved. For example, any rational function on the complex plane can be extended to a holomorphic function on the Riemann sphere, with the poles of the rational function mapping to infinity. More generally, any meromorphic function can be thought of as a holomorphic function whose codomain is the Riemann sphere. In geometry, the Riemann sphere is the prototypical example of a Riemann surface, an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mergelyan's Theorem
Mergelyan's theorem is a result from approximation by polynomials in complex analysis proved by the Armenian mathematician Sergei Mergelyan in 1951. Statement :Let ''K'' be a compact subset of the complex plane C such that C∖''K'' is connected. Then, every continuous function ''f'' : ''K''\to C, such that the restriction ''f'' to int(''K'') is holomorphic, can be approximated uniformly on ''K'' with polynomials. Here, int(''K'') denotes the interior of ''K''. Mergelyan's theorem also holds for open Riemann surfaces :If ''K'' is a compact set without holes in an open Riemann surface ''X'', then every function in \mathcal (K) can be approximated uniformly on K by functions in \mathcal(X). Mergelyan's theorem does not always hold in higher dimensions (spaces of several complex variables), but it has some consequences. History Mergelyan's theorem is a generalization of the Weierstrass approximation theorem and Runge's theorem. In the case that C∖''K'' is ''not'' co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Corollary
In mathematics and logic, a corollary ( , ) is a theorem of less importance which can be readily deduced from a previous, more notable statement. A corollary could, for instance, be a proposition which is incidentally proved while proving another proposition; it might also be used more casually to refer to something which naturally or incidentally accompanies something else (e.g., violence as a corollary of revolutionary social changes). Overview In mathematics, a corollary is a theorem connected by a short proof to an existing theorem. The use of the term ''corollary'', rather than ''proposition'' or ''theorem'', is intrinsically subjective. More formally, proposition ''B'' is a corollary of proposition ''A'', if ''B'' can be readily deduced from ''A'' or is self-evident from its proof. In many cases, a corollary corresponds to a special case of a larger theorem, which makes the theorem easier to use and apply, even though its importance is generally considered to be secondary t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polynomial
In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example of a polynomial of a single indeterminate is . An example with three indeterminates is . Polynomials appear in many areas of mathematics and science. For example, they are used to form polynomial equations, which encode a wide range of problems, from elementary word problems to complicated scientific problems; they are used to define polynomial functions, which appear in settings ranging from basic chemistry and physics to economics and social science; they are used in calculus and numerical analysis to approximate other functions. In advanced mathematics, polynomials are used to construct polynomial rings and algebraic varieties, which are central concepts in algebra and algebraic geometry. Etymology The word ''polynomial'' joins tw ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pole (complex Analysis)
In complex analysis (a branch of mathematics), a pole is a certain type of singularity of a complex-valued function of a complex variable. In some sense, it is the simplest type of singularity. Technically, a point is a pole of a function if it is a zero of the function and is holomorphic in some neighbourhood of (that is, complex differentiable in a neighbourhood of ). A function is meromorphic in an open set if for every point of there is a neighborhood of in which either or is holomorphic. If is meromorphic in , then a zero of is a pole of , and a pole of is a zero of . This induces a duality between ''zeros'' and ''poles'', that is fundamental for the study of meromorphic functions. For example, if a function is meromorphic on the whole complex plane plus the point at infinity, then the sum of the multiplicities of its poles equals the sum of the multiplicities of its zeros. Definitions A function of a complex variable is holomorphic in an open ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform Convergence
In the mathematical field of analysis, uniform convergence is a mode of convergence of functions stronger than pointwise convergence. A sequence of functions (f_n) converges uniformly to a limiting function f on a set E if, given any arbitrarily small positive number \epsilon, a number N can be found such that each of the functions f_N, f_,f_,\ldots differs from f by no more than \epsilon ''at every point'' x ''in'' E. Described in an informal way, if f_n converges to f uniformly, then the rate at which f_n(x) approaches f(x) is "uniform" throughout its domain in the following sense: in order to guarantee that f_n(x) falls within a certain distance \epsilon of f(x), we do not need to know the value of x\in E in question — there can be found a single value of N=N(\epsilon) ''independent of x'', such that choosing n\geq N will ensure that f_n(x) is within \epsilon of f(x) ''for all x\in E''. In contrast, pointwise convergence of f_n to f merely guarantees that for any x\in E giv ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sequence
In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is called the ''length'' of the sequence. Unlike a set, the same elements can appear multiple times at different positions in a sequence, and unlike a set, the order does matter. Formally, a sequence can be defined as a function from natural numbers (the positions of elements in the sequence) to the elements at each position. The notion of a sequence can be generalized to an indexed family, defined as a function from an ''arbitrary'' index set. For example, (M, A, R, Y) is a sequence of letters with the letter 'M' first and 'Y' last. This sequence differs from (A, R, M, Y). Also, the sequence (1, 1, 2, 3, 5, 8), which contains the number 1 at two different positions, is a valid sequence. Sequences can be ''finite'', as in these examples, or ''infi ... [...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 Function (mathematics), functions of complex numbers. It is helpful in many branches of mathematics, including algebraic geometry, number theory, analytic combinatorics, applied mathematics; as well as in physics, including the branches of hydrodynamics, thermodynamics, and particularly quantum mechanics. By extension, use of complex analysis also has applications in engineering fields such as nuclear engineering, nuclear, aerospace engineering, aerospace, mechanical engineering, mechanical and electrical engineering. As a differentiable function of a complex variable is equal to its Taylor series (that is, it is Analyticity of holomorphic functions, analytic), complex analysis is particularly concerned with analytic functions of a complex variable (that is, holomorphic functions). History Complex analysis is one of the classical ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
