Which theorem states that "An integral function attains every finite value with atmost one possible exception"?
Picard's theorem
The question asks about a specific theorem in complex analysis that describes the range of an integral function (also known as an entire function). An integral function is a function that is analytic everywhere in the complex plane.
Understanding the range of an integral function is a key topic in complex analysis. Some theorems place strong restrictions on the values that an entire function can attain.
Let's look at the provided options:
The statement "An integral function attains every finite value with atmost one possible exception" precisely matches the statement of the Little Picard theorem.
The Little Picard theorem states that if a function \(f\) is entire (analytic on the entire complex plane) and non-constant, then \(f\) attains every value in the complex plane, with the possible exception of at most one value.
Let \(f: \mathbb{C} \to \mathbb{C}\) be an entire function.
A classic example illustrating the exception is the exponential function \(f(z) = e^z\). This function is entire and non-constant. Its range is \(\mathbb{C} \setminus \{0\}\). The value 0 is the single exceptional value that the exponential function does not attain.
Polynomials of degree greater than or equal to 1 are other examples of entire functions. By the Fundamental Theorem of Algebra, a polynomial \(P(z)\) of degree \(n \ge 1\) has exactly \(n\) roots (counting multiplicity). This implies that the equation \(P(z) = c\) has a solution for any constant \(c\). Thus, non-constant polynomials attain every complex value; they have no exceptional values.
Based on the definitions and statements of the theorems, the theorem that states "An integral function attains every finite value with atmost one possible exception" is indeed Picard's theorem, specifically the Little Picard theorem.
| Theorem | Main Idea | Relevance to Question |
|---|---|---|
| Picard's theorem (Little) | Range of non-constant entire functions omits at most one value. | Directly matches the question's statement. |
| Jensen's inequality | Convex functions and expected values. | Not relevant to complex function ranges. |
| Jensen's formula | Relates function magnitude on a circle to zeros inside. | Tool for zero distribution, not value range exception. |
| Schwartz' lemma | Bounds functions on the unit disk mapping origin to origin. | Specific to functions on disk, not global entire functions. |
| Theorem | Description |
|---|---|
| Little Picard Theorem | A non-constant entire function takes on every value in the complex plane, with at most one exception. |
| Great Picard Theorem | In every neighborhood of an essential singularity, an analytic function takes on every complex value, with at most one exception, infinitely often. |
| Liouville's Theorem | Every bounded entire function must be constant. |
| Fundamental Theorem of Algebra | Every non-constant single-variable polynomial with complex coefficients has at least one complex root. (Implies polynomials attain all values). |
The Little Picard theorem is a powerful result and a significant extension of Liouville's Theorem. Liouville's Theorem can be seen as a special case of Picard's theorem: if an entire function is bounded (i.e., its range omits all values outside a bounded set), then its range omits infinitely many values, which by Picard's theorem implies it must be constant.
The theorem highlights how "large" the range of a non-constant entire function must be. It cannot, for example, be restricted to a half-plane or a disk.
If f(x) is a polynomial of degree n in x, then nth difference of this polynomial is
What is Lagrange’s interpolation polynomial for the following data?
| x | 2 | 4 |
| f(x) | 3 | 5 |
If f(1) = 4 and f(5) = 6, then what is the value of f(3) using Lagrange’s interpolation?
Let h be defined in finite-difference fraction notation as follows.
The order of convergence of Newton Raphson method is: