MHB Spanning set of vectors question

  • Thread starter Thread starter gucci1
  • Start date Start date
  • Tags Tags
    Set Vectors
gucci1
Messages
12
Reaction score
0
I am currently trying to understand linear independence and spanning sets. So the question that I have right now is, does a set of five linearly independent vectors always span F^5? Thanks for any help you can offer!

Edit: Sorry for the confusion, I really had no idea how to begin this problem. I guess I should have said that. I was pretty sure the answer was yes, but the reason why it is yes was a mystery.
 
Last edited:
Physics news on Phys.org
gucci said:
I am currently trying to understand linear independence and spanning sets. So the question that I have right now is, does a set of five linearly independent vectors always span F^5? Thanks for any help you can offer!
The answer is yes, and the reason is that the number of vectors in your set is the same as the dimension of the space.

The dimension of a vector space is the number of vectors in a basis, and the definition of a basis is that it is a set of vectors that satisfies these two properties:
(1) it is linearly independent,
(2) it spans the space.
To show that a set is a basis, you normally have to check that it satisfies both properties (1) and (2). But if you happen to know that the number of vectors in the set is the same as the dimension of the space, then you only have to check one of those two properties, and the other one will then automatically hold.

The reason for that is that there is a standard procedure for enlarging a linearly independent set so as to form a basis, by adding a suitable number of additional vectors. But there is a theorem (the basis theorem) which says that any two bases must contain the same number of elements. So if your linearly independent set started with the same number of elements as the dimension of the space, then the number of additional elements needed is zero. In other words, the original set was already a basis. Similarly, if you start with a set that spans the space, then you can always obtain a basis from it by discarding some of its elements. But if the spanning set has the same number of elements as the dimension of the space, then the number of elements to be discarded is zero, so the original set was already a basis.
 
Thanks so much for the explanation, that really helped. I wasn't aware that it was so firmly established that the number of vectors in a basis is the same as the dimension of the space. I guess my teacher glossed over that fact :-/
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Back
Top