statement theorem
Picard's great theorem
Statement
Let , let , and let be holomorphic on the punctured disc . Assume that is an essential singularity of . Then for each with , there is at most one with the following property. The function takes the value only finitely many times on . Thus, on each punctured disc around , takes each complex value infinitely often, with at most one exception.
Remarks
The exception can occur: never takes the value , and it takes each infinitely often near , see exp(1/z). The theorem is much stronger than the Casorati–Weierstrass theorem, which gives only that the values come close to each . Picard's little theorem is a related result: a nonconstant entire function takes all complex values with at most one exception.
Explanations
L1 human
Near an essential singularity, the function does not only come close to each value: it hits almost every value infinitely many times. At most one value can be missed, as is missed by .
What this node needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 18 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Complex numbers object
- Real numbers object
- Set bounded above definition
- Real and imaginary parts definition
- Supremum definition
- Completeness axiom statement
- Existence of square roots of nonnegative reals statement
- Square root definition
- Modulus of a complex number definition
- Complex differentiability definition
- Holomorphic function definition
- Isolated singularity definition
- Pole definition
- Removable singularity definition
- Essential singularity definition
- Riemann's theorem on removable singularities statement
- Casorati–Weierstrass theorem statement
- Picard's great theorem statement
Sources
- Web https://en.wikipedia.org/wiki/Picard_theorem, The theorems
What links here
No node links to this node yet.