# Uncountable Infinite Basis

1. Dec 10, 2006

### andytoh

Last edited: Jan 22, 2008
2. Dec 10, 2006

### matt grime

Please post your work in a non-proprietary format that those of us not blessed with MS word can read easily. Freely available programs that open Word documents are usually terrible for those that contain anything other than the plainest text (i.e. any maths content will be completely buggered).

Better yet, just type it in to the forum directly.

3. Dec 10, 2006

### andytoh

When I tried to copy the contents of my Word file onto here, the symbols did not show. Ok, so I took a gif picture of my Word file. The links are below.

Last edited: Jan 22, 2008
4. Dec 10, 2006

### AKG

You got confused with the notation. At one moment, the hint is using the subscript on fr to determine the function, i.e. fr = (1, r, r2, ...). Next, they are using the subscripts to index, so when they talk about f1, ..., fn, they just mean any n functions (from T), i.e. not that fn = (1, n, n2, ...). To be more clear, let's instead think about

$$f_{r_1},\, f_{r_2},\, \dots ,\, f_{r_n}$$

If these are linearly dependent, then there exists a set of reals, {a1, ..., an} not all zero such that:

$$\sum _{i = 1} ^n a_if_{r_i} = 0$$

Thus, for ANY vector v in V, we get:

$$\sum _{i = 1} ^n a_if_{r_i}(v) = 0(v) = 0$$

In particular, this holds (simultaneously) for v0, v1, ..., vn-1, so we get:

$$\sum _{i = 1} ^n a_if_{r_i}(v_0) = \sum _{i=1} ^n a_i = 0$$

$$\sum _{i = 1} ^n a_if_{r_i}(v_0) = \sum _{i=1} ^n a_ir_i = 0$$

.
.
.

$$\sum _{i = 1} ^n a_if_{r_i}(v_0) = \sum _{i=1} ^n a_ir_i^{n-1} = 0$$

So:

$$\left( \begin{array}{cccc} 1 & 1 & \dots & 1\\ r_1 & r_2 & \dots & r_n \\ \vdots & \vdots & \ddots & \vdots \\ r_1^{n-1} & r_2^{n-1} & \dots & r_n^{n-1} \end{array} \right) \left( \begin{array}{c} a_1\\ a_2\\ \vdots \\ a_n \end{array} \right) = \left( \begin{array}{c} 0\\ 0\\ \vdots \\ 0 \end{array} \right)$$

You should be able to prove that the ai are all zero from here. Prove it by contradiction, and think about how many roots a k-degree polynomial can have. The fact that T is linearly independent then follows immediately. I don't think you need to show that T spans your space, because showing that T is a basis is overkill, is it not? If T is uncountable and linearly independent, then surely any (not the) basis for your space is uncountable.

5. Dec 10, 2006

### andytoh

Thank you very much AKG. So the problem was that the hint was vaguely written. Had I known what they meant exactly, I could have found that eventually.

The columns of the nxn matrix in your last line are linearly independent and so the matrix is invertible. Left multiplying both sides of the equation by the inverse matrix results in the ai all being zero.

Last edited: Dec 10, 2006
6. Dec 10, 2006

### AKG

No, that's not it. You are trying to prove that the columns are linearly independent.

7. Dec 10, 2006

### andytoh

I've already proven that the columns are linearly independent. I was just explaining the remaining proof after that.

8. Dec 10, 2006

### AKG

Oh, I see. I went about it a different way:

If there is a non-trivial choice of the ai that makes the linear combination of the fri 0, then there is a non-zero column vector in the kernel of that nxn matrix, which means that the columns are linearly dependent, which means that there is an (n-1)-degree polynomial with n distinct roots, contradiction. Thus there is no non-trivial choice for the ai.

9. Dec 10, 2006

### andytoh

Ok, the problem is solved. AKG, please check your private mail. I believe your specialty is linear algebra, abstract algebra, topology, and vector calculus. The exercises that I will be doing for the next many months will be differential topology, differential geometry, tensor analysis, riemannian geometry.