Look at the following matrices. Do you notice anything that these matrices have in common?

If you noticed that the rows of each matrix are arithmetic progressions, good for you. For each row, there is a constant difference (also called the "increment") between adjacent elements. For these examples:

- In the first matrix, each row is an arithmetic progression with a difference of 1. That is, the value of the (j+1)th column is one more than the value of the j_th column.
- In the second matrix, each row is an arithmetic progression with a difference of 2. That is, the value of the (j+1)th column is two more than the value of the j_th column.
- In the third matrix, each row is an arithmetic progression, but the increments for the rows are not identical. The increment for the first row is -3. The increment for the second row is +1. The increments for the remaining rows are -2 and +3, respectively.

However, there is another characteristic that these matrices have in common: they are all singular matrices.
It turns out this is not a coincidence.
An *n* x *n* matrix (*n*>2) is singular if each row is an arithmetic progression.

### Why are these matrices singular?

Recall that a matrix will be singular if one of the columns can be written as a linear combination of other columns. For these three matrices, you can use mental arithmetic to verify that the third column
is a linear combination of the first two columns. Specifically, you can verify that the third column can be written as

X_{3} = 2 X_{2} – X_{1}

where X1, X2, X3, ... are the columns of a matrix.
Thus, these matrices are singular.

It turns out that this relationship holds in general for any matrix whose rows are arithmetic progressions.
Suppose the elements of the i_th row satisfy the progression with increment d_{i} so that the elements of the i_th row satisfy
X[i, j+1] = X[i, j] + d[i] for j=1,2,...,n.
Let **d** be the vector of differences. Then

X_{2} = X_{1} + **d**

which you can solve for **d** to obtain

**d** = X_{2} – X_{1}.

By substitution,

X_{3} = X_{2} + **d** = X_{2} + (X_{2} – X_{1}), or

X_{3} = 2*X_{2} – X_{1}.

Therefore, the third column is always a linear combination of the first two columns, and the coefficients are independent of the differences in the arithmetic progressions of the rows. It doesn't matter what increments are used in the arithmetic progressions of the rows.

In fact, even more is true. You can use similar arguments to show that the j_th column can be written as a linear combination of the first two columns for any j > 2. Thus, regardless of the matrix size, matrices whose rows are arithmetic progressions are rank-2 matrices: they have only two linearly independent columns.

### Why should you care about this?

I decided to write about this topic for three reasons:

- It's mathematically interesting, and I never noticed it before.
- When I write a program, I often need to quickly create an example matrix to test the program. I often use a matrix such as {1 2 3, 4 5 6, 7 8 9} or
`SHAPE(1:25,5,5)`. This article shows that both matrices are singular, which is important to know if the program requires a nonsingular matrix. - Lastly, I wanted to emphasize the difference between a "random matrix" and an "arbitrary matrix."
In a previous article, I discussed the probability that a random matrix is singular and concluded that a random matrix is almost always nonsingular. Here, "random matrix" means that the matrix elements are drawn randomly from a continuous probability distribution such as the uniform or normal distribution.

However, the other day I received a comment on that blog post. Essentially, the comment said, "I wrote down this matrix at random, but it is singular. How do you explain that?" The matrix was similar to the matrices at the top of this article. The answer is that the elements of the matrix were not generated randomly. The rows of the matrix form an arithmetic progression (very NON-random!), which, as we have seen, implies that the matrix is singular.