Let $G := SO\_n(R)$ be equipped with the Euclidean metric on vectors of length $n^2$. Is it true that for any $\epsilon >0$, there is a finite subgroup of $G$ which intersects every metric ball of radius $< \epsilon$ in $G$?



Can SO_n(R) be approximated arbitrarily well using a discrete  subgroup? 
Generalizing Robin's answer to arbitrary $n$:


Jordan's theorem implies that for any $n$ there is an integer $J(n)$ such that the index of a normal abelian subgroup of a finite subgroup of $GL(n,\mathbf{C})$ and hence $SO(n)$ is $\leq J(n)$. A theorem by Boris Weisfeiler (based on the classification of finite simple groups) implies that there are real $a,b$ such that $J(n)<(n+1)!n^{b+a\log n}$. See <http://www.pnas.org/content/81/16/5278.short?related-urls=yes&legid=pnas;81/16/5278>


So any finite subgroup of $SO(n)$ is included in $\leq J(n)$ copies of the maximal torus and so if one takes $n\geq 3$ and small enough $\varepsilon>0$, then for any finite subgroup $G$ of $SO(n)$ there will there elements $\varepsilon$ or further away from $G$ (with respect to any say left-invariant metric)


