I have this inequality $$\frac{1}{a}\exp\bigl\{-\frac{4}{h^2}\bigr\} \geq \frac{1}{f}$$ where $$ a \leq \Bigl(\pi^{d/2}\Gamma(\frac{1}{2}d+1)^{-1} + 1\Bigr) \left(\frac{h^{d+1}}{2} \Gamma \left(\frac{d+1}{2} \right) + h^d \left(\frac{d}{2}\right)^\frac{d}{2} \exp\Bigl\{-\frac{d}{2}\Bigr\} \right) $$
I tried to lowerbound $h$ in the inequality using the properties of the [Gamma function](https://math.stackexchange.com/questions/3014318/edit-after-stirlings-approximation-and-gamma-function-still-complicated) and [Stirling's approximation](https://en.wikipedia.org/wiki/Stirling%27s_approximation) but I still see it complicated to be used in order to bound $h$.


Here is my work


Again
\begin{align}
a & \leq \Bigl(\pi^{d/2}\Gamma(\frac{1}{2}d+1)^{-1} + 1\Bigr) \left(\frac{h^{d+1}}{2} \Gamma \left(\frac{d+1}{2} \right) + h^d \left(\frac{d}{2}\right)^\frac{d}{2} \exp\Bigl\{-\frac{d}{2}\Bigr\} \right) \nonumber \\
\text{let $\frac{d}{2}=n$, then} \nonumber \\
a & \leq \Bigl(\pi^{n}\Gamma(n+1)^{-1} + 1\Bigr)\left( \frac{h^{2n+1}}{2} \Gamma \left( n+\frac{1}{2} \right) + h^{2n} n^n \exp\Bigl\{-n\Bigr\} \right) \nonumber
\end{align}
If $$\Gamma(n+1) = n\Gamma(n)=n(n-1)!=n! $$ and $$\Gamma(n+\frac{1}{2})=\frac{(2n)!}{4^n n!}\sqrt(\pi)=\frac{(2n-1)!!}{2^n}\sqrt(\pi)=\binom {n-\frac{1}{2}}{n}n! \sqrt(\pi) $$ then


\begin{align}
a & \leq \Bigl(\frac{\pi^{n}}{n!} + 1\Bigr)\left( \frac{h^{2n+1}}{2} \frac{(2n)!}{4^n n!}\sqrt(\pi) + h^{2n} n^n \exp\Bigl\{-n\Bigr\} \right)\nonumber \\
& \leq h^{2n+2} \Bigl( \Bigl(\frac{\pi^{n}}{n!} + 1\Bigr) \left( \frac{(2n)!}{2^{2n }n!}\sqrt(\pi) + n^n \exp\Bigl\{-n\Bigr\} \right) \Bigr) \nonumber
\end{align}
Using stirling's approximation
\begin{align}
a & \leq h^{2n+2} \Bigl( \Bigl( \frac{1}{\sqrt{2}} \frac{\pi^{n-(1/2)}e^n}{n^{n+(1/2)}} + 1\Bigr)\left(\frac{1}{\sqrt{2}} \frac{e^n}{n^{n+(1/2)}} + \left(\frac{n}{e}\right)^n\right) \Bigr) \nonumber \\
& \leq h^{2n+2}\Bigl( \Bigl( \pi^{n-\frac{1}{2}} \left( \frac{e}{n}\right)^n +1 \Bigr) \Bigl(\left( \frac{e}{n}\right)^n + \left( \frac{n}{e}\right)^n \Bigr) \Bigr) \nonumber \\
& = h^{2n+2}\Bigl( \pi^{n-\frac{1}{2}} \Bigl( \left( \frac{e}{n}\right)^{2n} +1 \Bigr) + \left( \frac{e}{n}\right)^n + \left( \frac{n}{e}\right)^n \Bigr) \nonumber
\end{align}
What I can do more to simplify $a$ in order to use it to bound $h$ or is there a better way to bound $h$.



Complicated bound after using Stirling's approximation
I understand from the reference to Stirling that you are looking for a large-$d$ approximation of


$$a\_{\rm max}= \Bigl(\pi^{d/2}\Gamma(\frac{1}{2}d+1)^{-1} + 1\Bigr) \left(\frac{h^{d+1}}{2} \Gamma \left(\frac{d+1}{2} \right) + h^d \left(\frac{d}{2}\right)^\frac{d}{2} \exp\left(-\frac{d}{2}\right)\right).$$
With some algebra I arrived at


$$a\_{\rm max}\approx\left(h^{d+1}\sqrt{\frac{\pi}{2} } +h^d\right) \exp\left[\frac{d}{2} \left(\ln \left(\frac{d}{2}\right)-1\right)\right]\equiv a\_{\rm approx},\;\;d\gg 1.$$


This is already quite accurate for moderately small $d$, here is a plot for $d=10$. Shown are $a\_{\rm max}/f$ (blue), $a\_{\rm approx}/f$ (green), and $\exp(-4/h^2)$ (orange) as a function of $h$ for $f=10^5$.


![](https://ilorentz.org/beenakker/MO/aapprox.png)


The condition $\exp(-4/h^2)\geq a\_{\rm max}/f$ is reached in an interval $(h\_{\rm min},h\_{\rm max})$ around $h\_0$ given by


$$4/h\_0^2=\ln f-\frac{d}{2} \left(\ln \left(\frac{d}{2}\right)-1\right)$$


This interval only exists if $f$ is large enough, you need $$f\gtrsim\exp\left[\frac{d}{2} \left(\ln \left(\frac{d}{2}\right)-1\right)\right]\equiv f\_{\rm min}.$$




---


Irrespective of these large-$d$ approximations, the inequality in the OP is always violated for large enough $h$, because $a\_{\rm max}$ grows as $h^{d+1}$ for large $h$, while $\exp(-4/h^2)$ tends to unity. So $h\_{\rm max}<\infty$. Moreover, $h\_{\rm min}>0$ because $a\_{\rm max}$ vanishes as $h^d$ for small $h$, while $\exp(-4/h^2)$ vanishes more rapidly.


