Space of continuous functions C[a,b]

Click For Summary
The dimension of the space of continuous functions C[a,b] is infinite, as it includes all polynomials. The discussion centers on whether a Hamel basis for this space is countable or uncountable, with indications that it is uncountable. A proof without relying on a norm is sought, and a counting argument is suggested, highlighting that the cardinality of C[a,b] is the continuum. It is established that the set E = {e^ax | a real} is an uncountable linearly independent subset of C[a,b], reinforcing that C[a,b] cannot have a countable Hamel basis. The conversation also notes that while Hamel bases can be finite or uncountable, specific examples exist where a countable basis is possible, such as in the space of real sequences that are eventually zero.
ninty
Messages
12
Reaction score
0
We know that dim(C[a,b]) is infinte. Indeed it cannot be finite since it contains the set of all polynomials.
Is the dimension of a Hamel basis for it countable or uncountable?

I guess if we put a norm on it to make a Banach space, we could use Baire's to imply uncountable.
I am however interested in a proof that does not rely on equipping the vector space with a norm.

If it's too long winded but available somewhere else(books, articles) kindly point it out to me and I'll read it.
 
Physics news on Phys.org
Hamel bases are always finite or uncountable.
 
JSuarez said:
Hamel bases are always finite or uncountable.

That's true if your space is an infinite dimensional normed vector space which is complete, and that result follows from Baire's category theorem AFAIK. So you haven't really strayed from the original proof.

A counting argument might suffice. Suppose there was a countable basis. There are only continuum many choices of finite linear combinations from these, but the cardinality of the vector space is larger than that
 
I used instead the fact that exponentials are continuous
Then E:={e^ax : a real } is a subset of C[a,b]

It's clear that for finite n, {e^ix : i in N} is linearly independent.
I'm fudging, but that would seem to imply that E is also linearly independent, since every finite subset is linearly independent.
Hence cardinality of a basis is at least |E| = continuum
 
Office_Shredder said:
A counting argument might suffice. Suppose there was a countable basis. There are only continuum many choices of finite linear combinations from these, but the cardinality of the vector space is larger than that

False: the cardinality of C[a,b] is the cardinality of the continuum. (Each function in C[a,b] is uniquely determined by its values on the rational numbers in [a,b].)

But yes, you could show that E = {eax | a real} is an uncountable linearly independent subset of C[a,b], to show that C[a,b] has no countable Hamel basis.

JSuarez said:
Hamel bases are always finite or uncountable.

The space of all real sequences which are eventually zero has a countable Hamel basis.
 
Last edited:
Thread 'How to define a vector field?'
Hello! In one book I saw that function ##V## of 3 variables ##V_x, V_y, V_z## (vector field in 3D) can be decomposed in a Taylor series without higher-order terms (partial derivative of second power and higher) at point ##(0,0,0)## such way: I think so: higher-order terms can be neglected because partial derivative of second power and higher are equal to 0. Is this true? And how to define vector field correctly for this case? (In the book I found nothing and my attempt was wrong...

Similar threads

  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
7
Views
6K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
13
Views
10K
Replies
2
Views
1K
  • · Replies 25 ·
Replies
25
Views
3K
  • · Replies 24 ·
Replies
24
Views
5K
  • · Replies 9 ·
Replies
9
Views
2K