Let $\mathbf{A}$ be a matrix of size $N\times N$ whose elements $A_{ij}$ (with $1\leq i,j\leq N$) are I.I.D following some distribution.
If we set set $\langle A_{ij}\rangle=0$ and $\langle {A_{ij}}^2\rangle=\frac{1}{N}$ (where $\langle \cdot\rangle$ denotes the average over the distribution) then we know that for $N\to \infty $ the eigenvalues of $\mathbf{A}$ will be distributed uniformly in the unit circle on the complex plane (which could be called the disk law really).
I know that the expectation value of the determinant of $\mathbf{A}$ should be zero (Expected determinant of a random NxN matrix) meaning that at least one of the eigenvalues is zero.
However my issue in understanding is mainly heuristic: even as $N$ grows to infinity, the number of eigenvalues is still countable and the points to cover are uncountable. Even after generating $N$ random points on the unit circle, no matter how big $N$ is, we still have an uncountable number of points to cover. Therefore if the eigenvalues were truly random, the probability of having an eigenvalue $\lambda_i=0$ should be null. Therefore the determinant of $\mathbf{A}$ should not be zero.
Where is the flaw in this heuristic argument?
Edit: Speaking about the expectation value of the determinant was not a good idea. What I ask is that even if $N\to \infty$, det$(A)$ will always be non zero?