Proving Linear Independence and Span of D

Click For Summary
SUMMARY

The discussion centers on proving the existence of a subset D' within a nonempty subset D of a vector space V over a field F, such that the span of the union of (D-D') and a finite linearly independent subset B equals the span of D. The proof utilizes induction, starting with base cases for 1 and 2 elements and extending to n elements. The conclusion asserts that if D is linearly independent, then the union (D-D') U B also maintains linear independence.

PREREQUISITES
  • Understanding of vector spaces and their properties
  • Knowledge of linear independence and span in linear algebra
  • Familiarity with induction proofs in mathematics
  • Basic concepts of subsets and their relationships
NEXT STEPS
  • Study the properties of vector spaces and their spans
  • Learn about induction proofs in linear algebra
  • Explore the implications of linear independence in vector spaces
  • Investigate examples of constructing subsets in vector spaces
USEFUL FOR

Students and educators in mathematics, particularly those focused on linear algebra, as well as researchers exploring vector space properties and proofs of linear independence.

andytoh
Messages
357
Reaction score
3
I can't seem to figure this one out:

Question: Let D be a nonempty subset of a vector space V over a field F. Let B be a finite linearly independet subset of span D having n elements. Prove there exists a subset D' of D also having n elements such that

span[(D-D') U B] = span(D).

Moreover, if D is linearly independent, so is (D-D') U B.

Can anyone help?
 
Last edited:
Physics news on Phys.org
Here's the beginning of my induction proof for the case of 1 and 2 elements. I'm working on the nth step now.
 

Attachments

Ok, I've finished the proof now.

It is about 2 pages long! Even the base case for 1 element had to be modified to some length.
 
Last edited:

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 23 ·
Replies
23
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K