Monotonicity of relative convexity among binary Rényi entropies
Statement
For , let be the binary Rényi entropy of order . For functions and , write when there exists a convex function such that .
Rényi relative-convexity conjecture. If , then
This would give a monotone ordering of the binary Rényi entropies under the paper's relative-convexity relation. The parser supplies no resolution evidence, so the claim remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.