MHB Basis for $U$ using $\operatorname{null}A$

Click For Summary
The discussion focuses on proving that for an n by n matrix A of rank r, the dimension of the set U, defined as U = {X ∈ M_nn | AX = 0}, is n(n-r). It is established that the nullity of A is n-r, indicating that there are n-r independent solutions to the equation AX=0. Each column of the matrix X must belong to the null space of A, which leads to the construction of matrices X_ij that represent these solutions. By demonstrating that the set of matrices formed by varying the columns provides a basis for U, the conclusion that the dimension of U is indeed n(n-r) is supported. This confirms the relationship between the rank of A and the dimension of the solution space U.
Dethrone
Messages
716
Reaction score
0
Prove: Let $A$ be an $n$ by $n$ matrix of rank $r$. If $U={}\left\{X \in M_{nn}|AX=0\right\}$, show that $\dim U=n(n-r)$.

Proof:
Clearly, $\dim \operatorname{null}A=n-r$, and let $X=[c_1,c_2,...,c_n]$ where $c_i \in \Bbb{R}^n$ are column vectors. Then since $AX=0$, using block multiplication, $Ac_i=0, \forall i$. Thus, $c_i \in \operatorname{null}A.$

I am not sure what to do now, but I think it has something to do with $n\cdot (n-r)$. Any help is appreciated!
 
Last edited:
Physics news on Phys.org
Hi Rido12,

I'm a little confused by the phrasing of $\dim U=n(n-r)$. Usually we talk about the dimension of the column space (rank) or the dimension of the null space (nullity). If we just talk about the dimension of a matrix, then we we list it as rows by columns, usually $m \times n$. However usually your notation of something like $M_{nn}$ then maybe this is simply asking for the dimension of $U$.

If this is indeed what they are asking, then we know that there are $n$ rows $X$ such that $AX=0$ and there are $n-r$ solutions to this equation, so $U$ should be of size $n(n-r)$.
 
Rido12 said:
Prove: Let $A$ be an $n$ by $n$ matrix of rank $r$. If $U={}\left\{X \in M_{nn}|AX=0\right\}$, show that $\dim U=n(n-r)$.

Proof:
Clearly, $\dim \operatorname{null}A=n-r$, and let $X=[c_1,c_2,...,c_n]$ where $c_i \in \Bbb{R}^n$ are column vectors. Then since $AX=0$, using block multiplication, $Ac_i=0, \forall i$. Thus, $c_i \in \operatorname{null}A.$

I am not sure what to do now, but I think it has something to do with $n\cdot (n-r)$. Any help is appreciated!
You are correct to start by saying that if $X\in U$ then each column of $X$ must be in $\operatorname{null}A$. Suppose that $\{v_1,\ldots,v_{n-r}\}$ is a basis for $\operatorname{null}A$. For $1\leqslant i\leqslant n$ and $1\leqslant j\leqslant n-r$, let $X_{ij}$ be the matrix whose $i$th column is $v_j$, and all its other columns are $0$. Show that $\{X_{ij} : 1\leqslant i\leqslant n,\,1\leqslant j\leqslant n-r\}$ is a basis for $U$.
 
Thread 'How to define a vector field?'
Hello! In one book I saw that function ##V## of 3 variables ##V_x, V_y, V_z## (vector field in 3D) can be decomposed in a Taylor series without higher-order terms (partial derivative of second power and higher) at point ##(0,0,0)## such way: I think so: higher-order terms can be neglected because partial derivative of second power and higher are equal to 0. Is this true? And how to define vector field correctly for this case? (In the book I found nothing and my attempt was wrong...

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 9 ·
Replies
9
Views
5K
  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
34
Views
3K