Which Subspaces of the Vector Space of Real Valued Functions Are Valid?

  • Thread starter Thread starter VinnyCee
  • Start date Start date
  • Tags Tags
    Subspaces
Click For Summary
SUMMARY

The discussion centers on identifying valid subspaces of the vector space V = F(R, R), which consists of all real-valued functions f(x). The valid subspaces include (A) {f | f(0) = 0}, (D) C^0(R) (continuous functions), (E) C^1(R) (continuously differentiable functions), and (F) P (polynomials). Cases (B) {f | f(0) = 1} and (C) {f | f(0) = f(1)} are not subspaces due to failing the necessary conditions for closure under addition and scalar multiplication.

PREREQUISITES
  • Understanding of vector spaces and their properties
  • Familiarity with function types: continuous, differentiable, and polynomial functions
  • Knowledge of the definitions of C^0(R) and C^1(R)
  • Basic concepts of linear algebra, particularly regarding subspaces
NEXT STEPS
  • Study the properties of C^0 and C^1 spaces in functional analysis
  • Learn about polynomial functions and their degrees, specifically P_d
  • Explore the criteria for subspaces in vector spaces
  • Investigate the implications of closure properties in function spaces
USEFUL FOR

Mathematicians, students of linear algebra, and anyone studying functional analysis will benefit from this discussion, particularly those interested in the properties of vector spaces of functions.

VinnyCee
Messages
486
Reaction score
0
V = F(R, R), the vector space of all real valued functions f(x) of a real variable x. Which are subspaces of V?

(A) {f | f(0) = 0}

(B) {f | f(0) = 1}

(C) {f | f(0) = f(1)}

(D) C^0(R) = {f | f is continous}

(E) C^1(R) = {f | f is differentiable and f' is continous}

(F) P = {f | f is a polynomial}

(G) P_d\,\,\,\,=\,\,\,\,{f\,\in\,P\,|\,deg(f)\,\le\,d}

(H) {f\,\in\,C^1(R)\,|\,f'\,=\,f}

I have no idea what the last five of these instances mean. Case (C) is not a subspace because it only satifies the first rule that the set {0} be in the space before it can be considered a subspace, right?

Please help, I don't understand the terminology of the last five examples!
 
Physics news on Phys.org
You don't know what "polynomial", "differentiable", and "continuous" mean? If f is a polynomial, you don't know what deg(f), the degree of f, is?
 
Yes, I know those terms, but not the C^0,\,C^1 terms or the P or P_d terms.
 
Well that's why they are defined for you

For instance, C^1(R) denoted the set of all continuously differentiable (meaning f' is continuous) functions.
 
(G) would be polynomials that look like

<br /> f(x) = \sum_{i=0...d} a_i x^i<br />
 
Both (A) and (B) are subspaces of V, but (C) is not because each element must be unique, right? f(0) = f(1) means that it is not unique and not 1-1. But, how would I prove that (A) and (B) are subspaces of V?
 
If f(0) = f(1), it's still a function (think of a horizontal line), and there's no requirement for it to be 1-1.

For (B), what is the 0 element of the set?
 
There will be no 0 element because it always equals 1. So (B) is NOT a subset. (C) could be a horizontal line. But how would I prove these items? what would an arbitrary f(x) function look like?

f(x)\,=\,a_1\,x^{n\,+\,2}\,+a_2\,x^{n\,+\,1}\,+\,...\,+a_n\,x^n
 
It's just like the matrix case. You have functions in the set f and g and a real number a. Are af, f + g,and the zero function in the set?
 
  • #10
0 function would be f = 0 or f = 0 x^2 + 0 x + 0?

How would I write it out (prove) for case (A)?

{f | f(0) = 0}

1.) 0 \in V.

2.) a f(0) = 0 \in V.

3.) f(0) + g(0) = 0 + 0 = 0 \in V.
 
Last edited:
  • #11
VinnyCee said:
0 function would be f = 0 or f = 0 x^2 + 0 x + 0?

How would I write it out though for case (A)?

{f | f(0) = 0}

1.) 0 \in V.

2.) a f(0) = 0 \in V.

3.) f(0) + g(0) = 0 + 0 = 0 \in V.

Those are all pretty clear, right? You just need a sentence after each of those computations saying "so <function> is in the set <whatever>." You may need a sentence explaining that the sum of a C^0 functions is also C^0. The same for C^1 functions. And similarly for a real number times a function (should be able to look this up in your calculus text.) For the polynomials you show directly by combining terms that the new function is a polynomial of whatever type is required.
 
Last edited:
  • #12
What about case (B)?

It says that a function with zero plugged-in as the variable is equal to one. But this does not mean that the function cannot equal zero at some other plugged-in constant, right? So rule 1 checks out.

However, rule 3 (additive) is not satisfied because f(0) + g(0) = (1) + (1) = 2. Which is not 1, obviously.

Does that sound right?
 
  • #13
Yes, it does. Further on, for scalar multiplication, i.e. a real scalar a \neq 1, you'd have a\cdot f(0) = a.
 
  • #14
So, is every case except (B) and (H) a subspace of V?
 
  • #15
VinnyCee said:
What about case (B)?

It says that a function with zero plugged-in as the variable is equal to one. But this does not mean that the function cannot equal zero at some other plugged-in constant, right? So rule 1 checks out.
No, it doesn't. In function spaces with f+ g defined by (f+g)(x)= f(x)+ g(x) (the usual definition), the 0 vector is the function f(x)= 0 for all x. Is that function in this set?

However, rule 3 (additive) is not satisfied because f(0) + g(0) = (1) + (1) = 2. Which is not 1, obviously.
Yes, that is true.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
15
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 58 ·
2
Replies
58
Views
4K
  • · Replies 6 ·
Replies
6
Views
11K