Deos this question make sense to anyone?

  • Thread starter Thread starter Emspak
  • Start date Start date
Click For Summary

Homework Help Overview

The discussion revolves around proving that the set of functions \( C(S,K) \), which consists of functions that are zero for all but a finite number of elements of a nonempty set \( S \), forms a vector space over a field \( K \). Participants express confusion regarding the implications of certain function values and the requirements for closure under addition and scalar multiplication in the context of vector spaces.

Discussion Character

  • Exploratory, Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Some participants attempt to clarify the role of functions \( f \) and \( g \) in the proof, questioning where \( g \) originates and its relevance to the vector space definition. Others suggest focusing on closure under addition and scalar multiplication as key aspects of the proof.

Discussion Status

The discussion is ongoing, with participants sharing their thoughts on the axioms of vector spaces and expressing uncertainty about how to apply them to the problem at hand. Some guidance has been offered regarding the need to show closure properties, but no consensus has been reached on the overall approach or understanding of the problem.

Contextual Notes

Participants note the potential ambiguity in the problem statement and express frustration over the clarity of the definitions and axioms involved. There is a recognition that understanding the nature of functions in \( C(S,K) \) is crucial for addressing the proof requirements.

  • #31
OK Let me see if I get this: the issue is that you're defining V (the vector space) from the get-go as the set of functions that are non zero at one point only. If you can put two functions together in that space V it isn't a vector space anymore. But if it isn't just one point then it's ok, it is still a vector space. As I understand it this starts <i>from the definition of V itself</i>.

(BTW I also discovered earlier this evening that the original problem as I presented it was wrong because the prof who wrote the assignment had a huge typo, the "real" problem was to prove a set was as subspace. Oh lord.)

Anyhow I think what was confusing me was that I got hung up on what functions do when you've already defined a space that they are in rather differently. In vector calculus for instance you don't get into the properties that make a vector space a vector space.

And I want to thank you for your patience. There are aspects of this that are really frustrating at first. I am not trying ot be flip or go off tangentwise, I was sort of following some reasoning in the text.
 
Physics news on Phys.org
  • #32
Emspak said:
OK Let me see if I get this: the issue is that you're defining V (the vector space) from the get-go as the set of functions that are non zero at one point only. If you can put two functions together in that space V it isn't a vector space anymore. But if it isn't just one point then it's ok, it is still a vector space. As I understand it this starts <i>from the definition of V itself</i>.

(BTW I also discovered earlier this evening that the original problem as I presented it was wrong because the prof who wrote the assignment had a huge typo, the "real" problem was to prove a set was as subspace. Oh lord.)

Anyhow I think what was confusing me was that I got hung up on what functions do when you've already defined a space that they are in rather differently. In vector calculus for instance you don't get into the properties that make a vector space a vector space.

And I want to thank you for your patience. There are aspects of this that are really frustrating at first. I am not trying ot be flip or go off tangentwise, I was sort of following some reasoning in the text.

Proving it's a subspace of a vector space is certainly easier. You don't have to prove all of the axioms. Given the axioms are true for the larger space means most of them are automatically true for the subset. You just have to prove the closure ones. But it's not horribly different. And, no, in vector calculus you don't have to worry about whether it is a vector space. That's sort of implicit in the subject. This is more abstract. But do you see the difference between "at most one" and "a finite number" I was trying to spell out?
 
  • #33
Well, I see that if the set is defined in the first place as being that which only has functions that are nonzero at one point, and further reduce that (by definition) to only one. if you have any other functions that are zero then you aren't in the set anymore. Yes?
 
  • #34
Emspak said:
Well, I see that if the set is defined in the first place as being that which only has functions that are nonzero at one point, and further reduce that (by definition) to only one. if you have any other functions that are zero then you aren't in the set anymore. Yes?

I hope that means the same thing I tried to explain, it's not a very clear statement.
 

Similar threads

Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 0 ·
Replies
0
Views
2K
Replies
34
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 5 ·
Replies
5
Views
7K
  • · Replies 1 ·
Replies
1
Views
2K