Basis of Nullspace: Linear Algebra & Differential Equations

  • Thread starter Thread starter dschmidt12
  • Start date Start date
  • Tags Tags
    Basis Nullspace
dschmidt12
Messages
9
Reaction score
0
I am in a linear algebra and differential equations course and have recently been learning how to find a basis for a nullspace, row space, or column space. However, I am EXTREMELY confused by a solution to a question in my textbook. The question asks to find the basis for the null space of a particular matrix. For the question at hand, the determinant is zero, which of course means that it is invertible. However, I'm confused as to why this means that there is no basis for this nullspace -- there is no relevant explanation in my text as far as I can tell. Thank you to anyone who can help solve this problem for me!
 
Physics news on Phys.org
If the determinant is zero then the matrix is not invertible
 
I'm sorry, I meant to write not zero...my mistake; that makes a big difference. :)
 
This all stems from the fact that matrices distribute over vectors and commute with scalar multiplication: i.e, the fact that matrices are linear transformations.

If Av=0 and Ax=r then A(v + x) = Av + Ax = 0 + r = r.

If I have one solution to Ax = r, then I also have a solution for every element of the nullspace. In this situation, how would I write A-1? Is it A-1r = x or A-1r = x + v? They both get sent to r by A.

This means that a matrix can only be invertible if the nullspace is trivial, in other words, if only zero gets sent to zero.
 
"Nullspace of A" is, by definition, the set of vectors, x, such that Ax= 0. If A has an inverse, take A^{-1} on both sides: A^{-1}Ax= x= A^{-1}0= 0.

That is, if A is invertible, Ax= 0 only for x= 0.

It is true, then that if A is invertible, it is one-to-one.
 
##\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...
Back
Top