I am working on a problem these days and the following issue came up. I am not sure yet that I understand it's depth very well, so I would like to discuss a simple case. For those interested, the problem has applications in coding theory.
Consider a quadratic polynomial $f \left( x_1, x_2, x_3, x_4 \right)$ with real roots and coefficients drawn from a continuous distribution (and therefore irrationals with probability 1). Is there a strictly positive lower bound on $|f \left( x_1, x_2, x_3, x_4 \right)|$ if we constrain all $x_1, x_2, x_3, x_4$ to lie in $\mathbb{Z}$ ? In other words, is there a $\gamma > 0$ such that $\displaystyle |f \left( x_1, x_2, x_3, x_4 \right)| \geq \gamma~~ \text{for all} ~~ x_1, x_2, x_3, x_4 \in \mathbb{Z}$ ?
It seems to me that this is a Diophantine approximation - type problem. Note that one can show through a simple application of Khintchine-Groshev theorem that $|f \left( x_1, x_2, x_3, x_4 \right)|$ will be strictly positive for all $x_1, x_2, x_3, x_4 \in \mathbb{Z}$, in that case with probability 1. This is relatively straightforward.