0

Let $A,B,d\ge 1$ and suppose that $x\ge0$ satisfies $$ x^{\frac{d+1}{d}} \le Ax+B. \qquad(*) $$ I can show that $(*)$ implies the bound $$ x< d(A^d+B). \qquad(**) $$

Questions: (1) Can a better bound than $(**)$ be obtained? (2) Can such bounds be easily derived from some general "master" theorem?

Aryeh Kontorovich
  • 6,061
  • 1
    Is the initial condition greater than or equal to $1$ only imposed on $d$, or on $A$ and $B$ too? – Pietro Majer Aug 23 '19 at 06:40
  • on all 3 -- otherwise, the claim is false – Aryeh Kontorovich Aug 23 '19 at 06:44
  • 2
    To improve a bit your bound you may multiply $()$ by $\lambda ^{\frac{ d+1}{d}}$, deducing a family of $()\lambda$ for $\lambda x$, with $\lambda$ in the range of validity of your initial bound (that is, with corresponding $A\lambda\ge1, B_\lambda\ge1$). Then you may optimize w.r.to $\lambda$ the corresponding bound on $x$ given by $(**)_\lambda$ – Pietro Majer Aug 23 '19 at 06:57

1 Answers1

2

I assume $d$ is an integer. Let $x=y^d$, then the inequality takes form: $$y^{d+1} \leq Ay^d+B.$$ It holds for $y\leq Y$, where $Y$ is the largest zero of the polynomial $y^{d+1} - Ay^d-B$.

There is a number of known bounds for polynomial zeros. For example, Cauchy's bound gives $Y\leq 1+\max(A,B)$ implying that $x\leq (1+\max(A,B))^d$. Under scaling we can also get $$x\leq ((B/A)^{1/d}+A)^d.$$ Alternatively, Hölder's inequality for $k=d$ gives $$x\leq 1+(A^{d/(d-1)}+B^{d/(d-1)})^{d-1},$$ and so on.

Max Alekseyev
  • 30,425