Find maximum of $\log(1+x)(1-I_x(a,b-a))$

I am struggling to find (or at least set some bounds on) $$\arg \max_x \log(1+x)(1-I_x(a,b-a)),$$ where $$I_x(a,b-a)$$ is the regularized incomplete beta function, i.e

$$I_x(a,b-a) = \frac {\int_0^x t^{a-1} (1-t)^{b-a-1}dt}{B(a, b-a)}$$

For $$0 with $$a>1,b-a>1$$.

I've noticed that this can be represented as the product of the following integrals:

$$\arg \max_x \int_0^x \frac{\mathrm{d}\tau}{1+\tau} \cdot \int_x^1 \frac{\tau^{a-1}(1-\tau)^{b-a-1}}{B(a,b-a)}\mathrm{d}\tau$$

Yet, it didn't help much to obtain the maximum nor the arg max. I've tried through the first-order derivative, tried to bound it with arithmetic mean-geometric mean, and even tried to apply Jenssen inequality, however, without any success.

I got a hunch that since the first term does not have an explicit maximum, the only term that impacts on the maximum is the second integral, which reaches a maximum at $$x\to \frac{a-1}{b-2}$$, but didn't succeed to prove this bound.

Maybe L'hoptial rule can help get some insights on this?

Any ideas, help, and clues are much appreciated.

• You can obtain a numerical solution very easily. The derivative of your cost function is quite daunting, I may say. But it can be seen, as @LadaDudnikova wrote, that $\frac{a-1}{b-2}$ is not a maximizer. – Pantelis Sopasakis Apr 27 at 23:46
• Thanks, @Pantelis Sopasakis, it is certainly not the maximizer, and finding the true maximizer would be awesome, however, it gives a lower bound (which is also fine for me). Though, I still don't know how to prove that this bound holds. – sefi Apr 28 at 7:31
• Looks like you have a typo in the denominator in the product: $B(a,b)$ instead of $B(a,b-a)$ – Lada Dudnikova Apr 28 at 10:19
• @sefi any feasible point gives you a lower bound – Pantelis Sopasakis Apr 28 at 19:41

Not an answer, I have graphed this, and it's really a tricky function. But your assumption

$$x \to \frac{a-1}{b-2}$$

is not true. For example, $$a=0.7, b = 1$$, $$a=10, b=14$$ Good Luck! • Thank you @Lada Dudnikova, indeed this is not a maximizer, but only a bound. Can we prove it as a bound? I also noticed that this bound becomes tighter as $a$ and $b$ grow. (I forgot to mention $a,b>1$). – sefi Apr 28 at 5:00 One more thing: I tried using McLoren series for logarithm $$(1+x)$$ at 0 and 1. I really don't understand why both estimations go so terribly wrong. Note that I substitute $$a, b-a$$ for $$a,b$$

https://www.desmos.com/calculator/yvvenwyafg

• Thank you @Lada Dudnikova! I also went in a similar direction, taking $\log(1+x) \approx x$, which is encouraging, yet, it didn't simplify things much for me either. Interestingly, though, $x\to\frac{a}{b+1}$, does falls pretty close. – sefi May 3 at 21:26