Master Linear Algebra Proofs: Dimension Theorem, Rank-Nullity Theorem, and More!

In summary, the conversation discusses three proofs related to vector spaces and linear transformations. The first proof involves the Dimension Theorem, which states that the sum of the dimensions of two vector spaces is equal to the sum of their dimensions and the dimension of their intersection. The second proof shows that if a linear transformation is bijective, then the dimensions of its domain and codomain are equal. The last proof involves the Rank-Nullity Theorem and discusses the injectivity and surjectivity of a linear transformation based on the dimensions of its domain and codomain. Some general insight into these proofs is requested, as well as recommendations for resources to further understand these concepts.
  • #1
killpoppop
13
0
Hey people. I find myself getting through my course but currently with not as much understanding as I would like. We've got to some proofs and i either vaguely understand them or do not know how to prove them.

Homework Statement


The first would be to prove the Dimension theorem that.

dimU + dimV = dim(U + V) + dim( U intersection V )

The second is if U,V are finite dimensional vector spaces over a field, and T: V -> W is a bijection

Show dimU = dimW

The last is to do with the Rank-Nullity Theorem and a basic linear transformation T: Rn -> Rm

That if m < n prove that T is not injective
And if m = n prove that T is injective iff T is surjective.

Some general insight into these proofs would be very very helpful. All feedback would be very much appreciated.

Thanks.
 
Physics news on Phys.org
  • #2
killpoppop said:
The first would be to prove the Dimension theorem that.

dimU + dimV = dim(U + V) + dim( U intersection V )

Let {u1, ... , uk} be a basis for U and {v1, ... , vp} a basis for V. Now consider the intersection U[tex]\cap[/tex]V. If U[tex]\cap[/tex]V = {0}, what can you say about the linear depence of the set {u1, ... , uk, v1, ... , vp}? How about the situation U[tex]\cap[/tex]V [tex]\neq[/tex] {0}?

The second is if U,V are finite dimensional vector spaces over a field, and T: V -> W is a bijection

Show dimU = dimW
If T: V -> W is a bijective map, then what can you say about its range and kernel? How is this related to the first problem?

The last is to do with the Rank-Nullity Theorem and a basic linear transformation T: Rn -> Rm

That if m < n prove that T is not injective
And if m = n prove that T is injective iff T is surjective.
Again, consider range and kernel.
 
  • #3
killpoppop said:
Hey people. I find myself getting through my course but currently with not as much understanding as I would like. We've got to some proofs and i either vaguely understand them or do not know how to prove them.


Homework Statement


The first would be to prove the Dimension theorem that.

dimU + dimV = dim(U + V) + dim( U intersection V )
I would do this: subtract dim(U intersect V) from both sides to get the equivalent
dim(U+ V)= dimU + dimV- dim( U intersection V )
Choose a basis for U intersect V, then extend it to a basis of U. Extend that same basis for U intersect V to a basis for V. Show that the union of those two bases is a basis for U+ V.


The second is if U,V are finite dimensional vector spaces over a field, and T: V -> W is a bijection

Show dimU = dimW
Choose a basis for U, {u1, u2, ..., un} and show that {Tu1, Tu2, ... Tun} are independent. Thus, [itex]dimU\le dimW[/itex]. Choose a basis for W, {w1, w2, ..., wm} and show that {T-1w1, T-1w2, ..., T-1wn} are independent.

The last is to do with the Rank-Nullity Theorem and a basic linear transformation T: Rn -> Rm

That if m < n prove that T is not injective
And if m = n prove that T is injective iff T is surjective.
Again choose a basis for Rn, {v1, v2, ..., vn} and look at {Tv1, Tv2, ..., Tvn}.

Some general insight into these proofs would be very very helpful. All feedback would be very much appreciated.

Thanks.
 
Last edited by a moderator:
  • #4
Thanks for the feedback it all helps. But still doesn't clear a lot up for me.

Choose a basis for U intersect V, then extend it to a basis of U. Extend that same basis for U intersect V to a basis for V. Show that the union of those two bases is a basis for U+ V.

For this questions I've proved U+V is a subspace. What your saying is the next step but it doesn't make much sense to me. Can you explain further?
 
  • #5
Also can anyone suggest a decent book or website where i can read up on these?
 

FAQ: Master Linear Algebra Proofs: Dimension Theorem, Rank-Nullity Theorem, and More!

What is linear algebra?

Linear algebra is a branch of mathematics that deals with linear equations, matrices, and vector spaces. It is used to solve problems related to systems of linear equations, transformations, and geometric concepts.

What are proofs in linear algebra?

Proofs in linear algebra involve using logical reasoning and mathematical concepts to show that a statement or theorem is true. They are used to provide a rigorous and formal justification for mathematical arguments.

What are some common techniques used in linear algebra proofs?

Some common techniques used in linear algebra proofs include direct proof, proof by contradiction, proof by induction, and proof by counterexample. These techniques involve using different logical strategies to show that a statement is true.

Why are proofs important in linear algebra?

Proofs are important in linear algebra because they help us to understand and verify mathematical concepts. They also allow us to extend our knowledge and make new discoveries in the field. In addition, proofs provide a strong foundation for further study and applications of linear algebra.

What are some tips for writing effective linear algebra proofs?

Some tips for writing effective linear algebra proofs include clearly stating the assumptions and definitions used, organizing the proof logically, providing detailed explanations and justifications for each step, and checking for errors and inconsistencies. It is also helpful to practice and become familiar with common proof techniques and strategies.

Back
Top