copied from math stack exchange
There is a theorem which says the probability/size of a random matrix having repeated eigenvalues is 0 and this result is used in many fields. What I am wondering is, how does this translate to real systems with finite precision?
How can we extend this result to make some statement on the probability a random matrix with finite precision has no repeat eigenvalues? Obviously it's no longer 0 but how do we quantify it?