An $n \times n$ matrix has $n$ rows and $n$ columns. The rank of a matrix is the number of linearly independent rows or columns (row rank and column rank being the same). The greatest possible number of linearly independent vectors out of a set of $n$ vectors is obviously $n$. Thus for $k \ge n$, every $n \times n$ matrix $A$ satisfies
An $n \times n$ matrix has $n$ rows and $n$ columns. The rank of a matrix is the number of linearly independent rows or columns (row rank and column rank being the same). The greatest possible number of linearly independent vectors out of a set of $n$ vectors is obviously $n$. Thus for $k \ge n$, every $n \times n$ matrix $A$ satisfies
$\text{rank}(A) \le n \le k. \tag 1$