Among the 4 x 4 matrices whose entries are all 1's and 0's, are there more invertible or more singular matrices (over the reals)?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
As an upper bound on ∣ C ∣ , we can use the interpretation of vector space over F 2 . An invertible matrix has determinant 0 in F 2 , which means that it's determinant in R is even (hence we only have an upper bound). Each 0-1 matrix then corresponds to a multi-set of 4 vectors, and an invertible matrix corresponds to a set of basis vectors. Hence, the number of ways is:
( 2 4 − 1 ) ( 2 4 − 2 ) ( 2 4 − 4 ) ( 2 4 − 8 )
@Challenge Master: This formula works over F 2 but not over the real numbers, which is what I'm asking for. As far as I know, there is no formula in that case.
Log in to reply
Oh yes, that is true. I calculated the number of matrices whose determinant is even (0 in F 2 ), instead of those who are exactly 0.
I've updated the note.
Problem Loading...
Note Loading...
Set Loading...
Let A be the set of all 4 x 4 matrices whose entries are all 1's and 0's; let B be the matrices in A with pairwise distinct nonzero rows; and let C be the invertible matrices in A .
Now ∣ C ∣ = 2 1 6 = 6 5 5 3 6 and ∣ B ∣ = 1 5 ∗ 1 4 ∗ 1 3 ∗ 1 2 = 3 2 7 6 0 . We know that C is a subset of B , so that ∣ C ∣ ≤ ∣ B ∣ < ∣ A ∣ / 2 . Thus there are more singular matrices than invertible matrices in A .