Wikipedia:Reference desk/Archives/Mathematics/2019 May 10

= May 10 =

Solving Inequality with Polygarithms
I am looking for a (preferably simple) function $$f$$, and a constant $$r\in(0,1)$$ that satisfy $$f(x,y,k)=\Omega\Big(\Big(\frac {\log(y)} {x^r}\Big)^k\Big)$$, and also $$\min_{a,b,c}\{f (a,b,k)+f(d-a,c,k) +f(d,e-bc,k)\}=\Omega(f(d,e,k))$$.

So, I came up with $$f(x,y,k)=\Big(\frac {\log (y)} {\log^r(x)}\Big)^k$$ that I think that it satisfies even stornger condition: $$f(a,b,k)+f(d-a,c,k) +f(d,e-bc,k)\geq f(d,e,k)$$ for all $$a,b,c,d,e,k$$ in $$f$$'s definition domain (but I can't neither prove it, nor finding the desired $$r>0$$).

Does it work for my function?

Do you have any simpler function, with simple proof that it works?

Any help would be highly appreciated! David (talk) 13:55, 10 May 2019 (UTC)


 * Here $$\log^r(x)$$ means $$(\log(x))^r$$? One minor observation is that the function is concave up in its first coordinate, so (assuming that you expect all arguments always to be positive, or perhaps even larger than 1) the minimum of the LHS is always obtained when $$ a = d/2$$.  --JBL (talk) 19:09, 13 May 2019 (UTC)