Probability of invertibility of matrices

Mathematics — Alex @ 1:47 pm

Robert Rosenbaum posted a really nice question to the UH math mailing list:

Given an n \times n matrix of integers, what is the probability that it is
invertible?

What if we put a bound on the magnitude of the integers (so that we consider only a finite number of matrices)? In other words, given an integer n > 0 and an integer M, what is the probability that an n \times n matrix A of integers each less than M in absolute value is invertible? Is there an elementary way to express this value in terms of M and n? I don’t know.

If we don’t restrict ourselves to integer valued matrices and consider all real or complex valued matrices, I think that the probability would be exactly 1. Can someone give an argument for this claim?

I got the last question, where you consider all of \C^{n\times n}: from an earlier problem I posted about, it is clear that the set of noninvertible matrices has empty interior, so measure zero; therefore a random matrix is invertible with probability one.

The discrete case is probably a lot harder…

Update: It seems I made an unwarranted assumption. Just because the set of noninvertible matrices has an empty interior doesn’t mean it has measure zero. I still think that’s true, but the proof is not complete.

Possibly relevant posts:

1 Comment »

  1. The probability of a matrix being invertable is inversly proportional to the “square” of how useful its invertability would be.

    Comment by ObsessiveMathsFreak — 6/8/2006 @ 4:41 am

RSS feed for comments on this post. TrackBack URI

Leave a comment

This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 Unported License.
(c) 2008 ChapterZero | powered by WordPress with Barecity