Proving Completeness of a function space

  • Context: Graduate 
  • Thread starter Thread starter vineethbs
  • Start date Start date
  • Tags Tags
    Function Space
Click For Summary
SUMMARY

The function space F, defined as F = {f : [0, ∞) → R, norm(f) = sup_{x ∈ [0,∞)} |f(x)|/(x² + 1) < ∞}, is complete under the specified norm. The proof involves analyzing a Cauchy sequence (f_n) and demonstrating that the pointwise limit converges uniformly to a function g(x). By establishing that the limit function f(x) = g(x)(x² + 1) remains within the bounds of F, it is confirmed that F is indeed complete.

PREREQUISITES
  • Understanding of Cauchy sequences in metric spaces
  • Familiarity with uniform convergence and pointwise limits
  • Knowledge of functional analysis concepts, particularly normed spaces
  • Proficiency in mathematical notation and proofs
NEXT STEPS
  • Study the properties of complete metric spaces in functional analysis
  • Learn about uniform convergence and its implications for function spaces
  • Explore examples of Cauchy sequences in various normed spaces
  • Investigate the role of suprema in defining norms and their completeness
USEFUL FOR

Mathematicians, particularly those specializing in functional analysis, graduate students studying metric spaces, and researchers interested in the completeness of function spaces.

vineethbs
Messages
8
Reaction score
0
Let F = \left\{f : [0, \infty) \rightarrow R, norm(f) = \sup_{x \in [0,\infty)} \frac{|f(x)|}{x^{2} + 1} &lt; \infty\right\}

Is F complete , under the given norm ?

My approach was to look at the pointwise limit of an arbitrary Cauchy sequence, but I am not able to prove that it converges in the metric induced by the norm.

Thank you and Merry Christmas !
 
Physics news on Phys.org
Hi , is the following correct ?
(an outline of the proof )
Given an arbitrary Cauchy sequence (f_{n})
we have that
\forall \epsilon &gt; 0, \exists n_{\epsilon} \leq m &lt; n \, s.t \sup_{0 \leq x &lt; \infty} \frac{|f_{n}(x) - f_{m}(x)|}{x^{2} + 1} &lt; \epsilon

g_{n}(x) = f_{n}(x)/(x^{2} + 1)

this means that \sup_{ 0 \leq x \infy} |g_{n}(x) - g_{m}(x)| &lt; \epsilon for m, n as above

so that g_{n}(x) \rightarrow g(x) , \forall x, uniformly
which means that \sup_{0 \leq x &lt; \infty} |g_{n}(x) - g(x)| \rightarrow 0

with f(x) = g(x)(x^{2} + 1)

\sup_{0 \leq x &lt; \infty} |\frac{f_{n}(x) - f(x)}{x^{2} + 1}| \rightarrow 0
\forall x, \frac{|f(x)|}{x^{2} + 1} \leq \frac{|f_{n}(x) - f(x)|}{x^{2} + 1} + \frac{|f_{n}(x)|}{x^{2} + 1} which should give that f \in F ?
Thank you for your time !
 
Last edited:

Similar threads

  • · Replies 0 ·
Replies
0
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 2 ·
Replies
2
Views
4K