A whole function approximating polynomials

In summary: Since \epsilon_{n_0} can be made arbitrarily small, we have that lim_{n \rightarrow \infty} sup_{z \in V_{n_0}} |g(z)-p_{n_0}(z)|=0. This proves that g approximates the polynomials p_n on the sets V_n, as desired.In summary, we have shown that given a sequence of polynomials p_n and a sequence of open, non-intersecting sets V_n, there exists a function g\in \mathcal{O}(\mathbb{C}) such that lim_{n \rightarrow \infty} sup
  • #1
LWRS
1
0
Given a series of polynomials \(\displaystyle p_{n}\) and a series of open, non-intersecting sets \(\displaystyle V_{n} \subset \mathbb{C}\) show that there exists a function \(\displaystyle g\in \mathcal{O}(\mathbb{C})\) such that \(\displaystyle lim_{n \rightarrow \infty} sup_{z \in V_{n}} |g(z)-p_{n}(z)|=0\).

Normally the approximation goes the other way around so I'm not sure what to do here.
 
Physics news on Phys.org
  • #2
Let g(z) denote the function we want to construct. We can use a technique known as the Weierstrass Approximation Theorem to construct g(z). This theorem states that if V_{n} is compact and p_{n} is continuous, then there exists a sequence of polynomials f_{n} such that lim_{n \rightarrow \infty} sup_{z \in V_{n}} |f_{n}(z)-p_{n}(z)|=0.Now, we can define g(z) as the uniform limit of the sequence of polynomials {f_{n}(z)}, i.e., g(z)=lim_{n \rightarrow \infty} f_{n}(z). Since f_{n}(z) converges uniformly to p_{n}(z), it follows that lim_{n \rightarrow \infty} sup_{z \in V_{n}} |g(z)-p_{n}(z)|=0. Hence, we have constructed a function g(z) which satisfies the desired condition.
 
  • #3


Hi there,

It seems like you are trying to prove the Weierstrass Approximation Theorem, which states that for any continuous function f on a closed interval [a,b], there exists a sequence of polynomials p_n that converges uniformly to f on [a,b]. In this case, we are given a sequence of polynomials p_n and a sequence of open sets V_n, and we need to show that there exists a function g\in \mathcal{O}(\mathbb{C}) (the space of holomorphic functions) that approximates the polynomials p_n on the sets V_n.

To prove this, we can use the fact that any continuous function on a compact set can be uniformly approximated by polynomials. Since the sets V_n are open and non-intersecting, they can be covered by a finite number of compact sets. Let's call these compact sets K_n, where K_n \subset V_n for all n. Now, for each n, we can find a polynomial p_n that approximates p_n uniformly on K_n. This means that for all z \in K_n, we have |p_n(z)-p_n(z)|< \epsilon_n, where \epsilon_n is some small positive number.

Next, we can define a function g as follows: g(z)=p_n(z) for z \in K_n and g(z)=0 for z \notin \bigcup_{n}K_n. In other words, g is equal to the polynomial p_n on the compact set K_n and is equal to 0 outside of this set. Since the sets V_n are non-intersecting, this function is well-defined and holomorphic on \mathbb{C}. Also, by construction, we have |g(z)-p_n(z)|< \epsilon_n for all z \in K_n.

Now, since the sets K_n cover the sets V_n, we have that for all z \in V_n, there exists some n_0 such that z \in K_{n_0}. Therefore, we have |g(z)-p_{n_0}(z)|< \epsilon_{n_0} for all z \in V_{n_0}. Taking the supremum over all z \in V_{n_0}, we get lim_{n \rightarrow \infty} sup_{z \in V_{n_0}} |g(z)-
 

FAQ: A whole function approximating polynomials

What is a whole function?

A whole function is a type of mathematical function that is defined for all complex numbers, rather than just a subset of them. It is also known as an entire function.

What is polynomial approximation?

Polynomial approximation is a method of approximating a more complex function with a simpler polynomial function. This is done by finding the polynomial that best fits the original function, using a process called regression.

How does a whole function approximate polynomials?

A whole function can approximate polynomials by using its Taylor series expansion. By finding the coefficients of the Taylor series, the whole function can be expressed as a polynomial, providing a good approximation of the original function.

What are the advantages of using a whole function to approximate polynomials?

Using a whole function to approximate polynomials can be advantageous because whole functions are defined for all complex numbers, making them more versatile than polynomials which may only be defined for a limited set. Additionally, whole functions can provide a better approximation for functions with more complex behavior.

Are there any limitations to using a whole function to approximate polynomials?

While whole functions can provide a good approximation for many types of functions, they may not always be the best choice. For example, if the original function has singularities or poles, a whole function may not be able to accurately approximate it. Additionally, finding the coefficients of the Taylor series can be a complex and time-consuming process.

Similar threads

Replies
11
Views
786
Replies
9
Views
2K
Replies
10
Views
3K
Replies
1
Views
970
Replies
2
Views
1K
Replies
4
Views
2K
Replies
11
Views
1K
Back
Top