Proving a set to be a vector space,

Click For Summary

Discussion Overview

The discussion revolves around proving that a set of functions mapping from R to R constitutes a vector space. Participants explore the definitions of addition and scalar multiplication of functions, the requirements for closure under these operations, and the verification of vector space axioms.

Discussion Character

  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • One participant asserts that the set of functions V is a vector space under the usual operations of real numbers but expresses confusion about the proof process.
  • Another participant clarifies that the addition and scalar multiplication must be defined pointwise for functions, emphasizing that the usual operations of real numbers do not apply directly.
  • A participant questions the notation of defining V as a finite set of functions, pointing out that a vector space can have uncountably many elements and that the proposed notation may imply a misunderstanding of vector space properties.
  • There is a request for examples to aid in understanding how to prove closure under addition and scalar multiplication, indicating a need for clearer definitions.
  • Some participants emphasize the importance of understanding the definitions of function addition and scalar multiplication before proceeding with the proof.

Areas of Agreement / Disagreement

Participants generally agree on the need for correct definitions of addition and scalar multiplication for functions, but there is disagreement regarding the initial understanding of the set V and its properties as a vector space. The discussion remains unresolved as participants seek clarity and examples.

Contextual Notes

There are limitations in the understanding of the definitions of operations on functions and the implications of finite versus infinite dimensionality in vector spaces. Some mathematical steps and assumptions about the nature of the set V remain unresolved.

u5022494
Messages
2
Reaction score
0
I know that a set (let's call it V) of all functions which map (R -> R) is a vector space under the usual multiplication and addition of real numbers, but i am having trouble proving it, i understand that the zero vector is f(x)=0, do i just have to prove that each element of V remains in V under additon and scalar multiplication? If that's the case then i can't work out how to go about proving it, if it isn't the case, then what exactly am i proving?
 
Physics news on Phys.org
You have to notice that when you want to see how a set of functions forms a vector space, you are *not * taking the addition operation of real numbers.
f ( c ) may be a real number for any c, but the images of a function are not the function "object" itself. You need to think about how you can take two functions, add them, and have a resulting function that is still from R to R
 
u5022494 said:
I know that a set (let's call it V) of all functions which map (R -> R) is a vector space under the usual multiplication and addition of real numbers

No, that is not true. You don't have the correct definition of addition and scalar multiplication of functions. The usual multiplication of real numbers doesn't apply, since we are dealing with a space of functions.

The correct definitions are that V is a vector space under pointwise addition and scalar multiplication. What does that mean? If f and g are elements of V, then we define f+g to be the function defined by

(f+g)(x) = f(x) + g(x).

Now we have to verify that f+g, as defined, is in fact an element of V. You should prove that.

Scalar multiplication of a function f by a scalar a is defined as

(af)(x) = a * f(x).

Again, we need to show that if f is in V, then so is af for any scalar a.

Having shown that V is closed under addition and scalar multiplication as defined, you then need to verify each of the vector space axioms.

u5022494 said:
i understand that the zero vector is f(x)=0, do i just have to prove that each element of V remains in V under additon and scalar multiplication?

Yes, you need to prove that; then you need to prove that V satisfies the vector space axioms. I think you'll find it easier once you understand how addition and scalar multiplication of functions are defined. Did you understand the definitions I gave?
 
@ SteveL27, How would i go about proving those? perhaps an example would help considerably,
What i was thinking was that i could set V := {v1, v2, ... , vn} where each V is a function which maps R -> R and thus an element of V, but i can't quite get a rigorous proof using this notation..
 
u5022494 said:
What i was thinking was that i could set V := {v1, v2, ... , vn} where each V is a function which maps R -> R and thus an element of V, but i can't quite get a rigorous proof using this notation..

I hope you can clear something up for me.

I'm not quite sure what you mean here with V=\{v_{1} ,v_{2} ,\dots ,v_{n} \}. This would imply that V has n elements, which is not true if V is a vector space. This can be seen that if V is a vector space over the field \mathbb R and f\in V, then af\in V,\,\forall a\in \mathbb R. However, there are uncountably many a\in \mathbb R, so V has much more than only n elements.

Does that make sense? I hope it helps.

Do you mean for \{v_{1} ,v_{2} ,\dots ,v_{n} \} to be a basis of V? Because if so, then I want you to ask yourself if we know that V is finite-dimensional.
 
u5022494 said:
@ SteveL27, How would i go about proving those? perhaps an example would help considerably,
What i was thinking was that i could set V := {v1, v2, ... , vn} where each V is a function which maps R -> R and thus an element of V, but i can't quite get a rigorous proof using this notation..

We need to get the definition of addition and scalar multiplication clear first. Do you understand what the definitions of f+g and af for a scalar a? Your idea is unfortunately not in the right direction, but before discussing that, it's important to get the definition of V nailed down.

Are you taking a class or working from a book? Have you worked through other examples yet of being given a set with operations, and showing that it is or isn't a vector space?
 

Similar threads

  • · Replies 32 ·
2
Replies
32
Views
6K
  • · Replies 18 ·
Replies
18
Views
4K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 15 ·
Replies
15
Views
5K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 0 ·
Replies
0
Views
8K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
4K