2

I know from $rank(A)+nullity(A)=n$ that is $rank(A)=rank(A^T)=n$ and $nullity(A^T) ≠ 0$.Is there any other useful connection to solve this problem?

Learning
  • 1,301
VidaXpo
  • 87

3 Answers3

3

Suppose $A^TAv=0$; then also $v^TA^TAv=(Av)^T(Av)=0$, which implies $Av=0$. Since the null space of $A$ is trivial, you're done: $v=0$, so the nullity of $A^TA$ is zero and the rank is full.

Suppose $x=(x_1,\dots,x_n)\in\mathbb{R}^n$ and $x^Tx=0$; this means $$ x_1^2+x_2^2+\dots+x_n^2=0 $$ so $x_1=0, x_2=0,\dots,x_n=0$ and $x=0$. Apply it to $x=Av$.

egreg
  • 238,574
1

Well ! Use the fact that $$RankA+RankB -k<=Rank (AB)<= min (Rank A , Rank B)$$ Where $A$ is $n×k$ and $B$ is $k×m$ matrix.

It will work surely!

Devendra Singh Rana
  • 1,780
  • 1
  • 15
  • 32
0

You can define:

$\mathbb{A}_{m\times n}(\mathbb{R})$ be the matrix of any linear transformation $T:\mathbb{R^n}\to\mathbb{R^m}$ .So by Sylvester's law $rank(A)+nullity(A)=n\implies rank(A)=n$

and we know that $rank(A)=rank(A^TA)$=$n$; [1]: Prove rank $A^TA$ = rank $A$ for any $A_{m \times n}$

here , $A^TA$ is $n\times n$ , has full rank.

Therefore , $A^TA$ is invertible. (Hope it may help you.)

Learning
  • 1,301