Proof that every basis has the same cardinality

In summary, the conversation is discussing a proof concerning the cardinality of different bases for a vector space. The question is raised about how to ensure that a chosen element is not already in a set, to which it is responded that it doesn't matter if it is because it can be replaced by another element. The difficulty with the proof lies in the first part, where the sets A and B are infinite, as it is unclear if the same argument holds for uncountably infinite sets.
  • #1
member 587159
Hello all.

I have a question concerning following proof, Lemma 1.

http://planetmath.org/allbasesforavectorspacehavethesamecardinalitySo, we suppose that A and B are finite and then we construct a new basis ##B_1## for V by removing an element. So they choose ##a_1 \in A## and add it to ##S_1##. How do we know for sure that ##a_1## is not yet in B? Can we say this because we suppose that m < n, thus there is certainly such an element?(to derive a contradiction)

Thanks!
 
Physics news on Phys.org
  • #2
It doesn't matter if ##a_1## is already in ##B##. Say ##a_1=b_1##. Then, certainly, ##B_1=\{a_1,b_2,\dots,b_m\}(=B)## spans ##V##. This is just a special case of the argument in the proof.
 
  • Like
Likes member 587159
  • #3
Math_QED said:
Hello all.

I have a question concerning following proof, Lemma 1.

http://planetmath.org/allbasesforavectorspacehavethesamecardinalitySo, we suppose that A and B are finite and then we construct a new basis ##B_1## for V by removing an element. So they choose ##a_1 \in A## and add it to ##S_1##. How do we know for sure that ##a_1## is not yet in B? Can we say this because we suppose that m < n, thus there is certainly such an element?(to derive a contradiction)

Thanks!
It doesn't matter whether ##a_1 \in B## or not. We only need a ##b_1## with non-zero coefficient to replace ##b_1## by ##a_1## and the fact that it spans ##V##. Let ##a_1 = \beta_1 b_1 + \dots \beta_m b_m##. If all ##\beta_i = 0 ## then ##a_1= 0## which we ruled out. So without loss of generality, let ##\beta_1 \neq 0##. Thus ##b_1 = \beta'_1 a_1 + \beta_2' b_2 + \dots \beta'_m b_m## and it can be replaced. We don't need to bother linear dependencies here.

Remark: My difficulty with the proof is in the first part, where ##A## and ##B## are infinite. This part is IMO only true, if ##|\infty| = |\infty| ## regardless which class of infinity is meant. However, what is if ##A## is uncountably infinite and ##B## countable? Why can't this happen?
 

FAQ: Proof that every basis has the same cardinality

1. What is a basis in mathematics?

A basis is a set of linearly independent vectors that can be used to represent any vector within a vector space. It is the minimal set of vectors needed to span the entire space.

2. How is the cardinality of a basis defined?

The cardinality of a basis is defined as the number of vectors in the basis. It is also known as the dimension of the vector space.

3. What does it mean for every basis to have the same cardinality?

If every basis of a vector space has the same cardinality, it means that the dimension of the vector space is unique and does not depend on the particular basis chosen.

4. Why is it important to prove that every basis has the same cardinality?

This proof is important because it establishes a fundamental property of vector spaces and allows us to define their dimension in a consistent manner. It also enables us to compare and classify vector spaces based on their dimension.

5. What is the significance of this proof in other areas of mathematics?

The concept of dimension is not limited to vector spaces, so this proof has implications in other areas of mathematics such as linear algebra, abstract algebra, and topology. It also has applications in physics and engineering, where vector spaces are used to model and solve real-world problems.

Back
Top