Geometry of linear equations: questions for repetition
This section evolves around the concepts of linearity, linear subspaces and orthogonality. As usual, you are expected to produce at least those proofs that I give.
-
Prove linearity of the mapping generated by a matrix. This fundamental fact will have many implications. Do you think any linear mapping is generated by some matrix? Do you think a mapping inverse to a linear mapping should be linear?
-
What is the first characterization of a matrix image? In other sources it is called a column space. Later on it will be linked to the notions of linear independence and rank.
-
How would you write $latex Ax$ ($latex A$ is a matrix and $latex x$ is a vector), if $latex A$ is partitioned a) into rows and b) into columns?
-
Show that a span of some vectors is a linear subspace. Note that one- and two-dimensional examples of linear subspaces we considered are special cases of subspaces described by linear systems of equations.
-
Can spans of two different systems of vectors coincide? Give an example.
-
Show that the image and null space of a matrix are linear subspaces. This facts indicate that the subspace notion is an adequate tool for problems at hand.
-
What is the description of the set of solutions of $latex Ax=y$? It is pretty general. For example, the structure of solutions of an ordinary linear differential equation is the same.
-
Illustrate geometrically the theorem on second orthocomplement and explain why it holds.
-
What is the relationship between $latex (Ax)\cdot y$ and $latex x\cdot (A^Ty)$?
-
Derive the second characterization of matrix image.
-
What are the geometric conditions for the solvability and uniqueness of solutions of an inhomogeneous equation?
← Previous: Geometry of linear equations: orthogonal complement and equation solvability | Next: Is the inverse of a linear mapping linear? →
Leave a Reply
You must be logged in to post a comment.