Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I have a sequence $\lambda_0,\lambda_1,\ldots,$ which is defined implicitly as

$$ \lambda_0 = \frac{1}{2},$$

and

$$\lambda_{k+1} = \max_{\lambda\in[1,b]} \left\{\frac{1}{2\lambda}\prod_{0\leq j\leq k}\left(\frac{\lambda-\lambda_j}{\lambda+\lambda_j}\right)^2\right\}, \qquad k\geq 0,$$

where $b>1$. I would like to find a relatively sharp upper bound for $\lambda_k$. Numerically, it seems that $\lambda_k$ is bounded by something like,

$$\lambda_k \leq \mathcal{O}\left(e^{-8k/\log(b)}\right). $$

For instance, the following simple argument gives an upper bound that is very weak and I'm seeking techniques to do better:

Note that we have, for $k\geq 0$,

$$ \lambda_{k+1} \leq \max_{\lambda\in[1,b]} \left\{\frac{1}{2\lambda}\prod_{0\leq j\leq k-1}\left(\frac{\lambda-\lambda_j}{\lambda+\lambda_j}\right)^2\right\}\max_{\lambda\in[1,b]}\left(\frac{\lambda - \lambda_k}{\lambda+\lambda_k}\right)^2\leq \lambda_k \left(\frac{b-1}{b+1}\right)^2$$

and hence,

$$\lambda_k \leq \left(\frac{b-1}{b+1}\right)^{2k}\lambda_0 =\frac{1}{2}\left(\frac{b-1}{b+1}\right)^{2k},\qquad k\geq0.$$

share|improve this question
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.