Metadata
slug: hirche-2020-arimoto-information-combining-convexity
bibkey: hirche2020renyibounds
doi: 10.48550/arXiv.2004.14408
url: https://arxiv.org/abs/2004.14408v1
triage: theorem
motivation_gids:
- D5/S3/Entropy/RenyiCombining/HircheArimotoCombining.result
Arimoto information combining convexity and concavity
Problem
C. Hirche, Rényi Bounds on Information Combining, ISIT 2020, arXiv:2004.14408v1, §IV-A, Conjecture IV.6:
There exists a value 1 < α̂ < 1.5783, such that k_α^A(k_α^A⁻¹(x) ∗ k_α^A⁻¹(y)) (47) is convex for 0 < α < 1 and concave for 1 < α ≤ α̂.
Equation (23) defines
For binary , , hence
Write below. Lemma IV.3, cited from Hsu–Asoodeh–Salamatian–Calmon, gives convexity for ; Lemma IV.4 shows neither convexity nor concavity for .
The inverse is the restriction to , with range
,
where . Orders and exponents are real.
For each permitted order and every fixed , the claim is the
full two-point ConvexOn or ConcaveOn inequality on the closed interval
. The specified witness is .
Motivation
This scalar inequality supplies the separate curvature needed for binary Arimoto conditional Rényi information combining. The exact inverse branch, real orders and boundary inputs are part of the assertion.
Gap
The sign certificate at three halves requires an analytic proof over the entire bias interval. A numerical sign test does not establish that uniform claim. Rioul–Béguinot, HAL hal-05074668v1, Proposition 1 and Remark 6, stated the threshold from a numerical sign check without proving the sign throughout the parameter domain. See the source note.
Route
Set and on . For , , and , differentiation gives
All bases are strictly positive. The slope has the sign of . For , and ,
Its derivative divided by itself is
For fixed , both and strictly increase on . In the first case the derivative numerator is , since its value at zero is zero and its derivative is for . The second derivative formula is .
If , put . Oddness gives , so . If , the same comparisons give . At that exact endpoint,
Thus increases for both claimed order ranges. The identity , for and , gives . The transported first derivative is , and
The prefactor is positive. For the inverse bias decreases, giving a nondecreasing derivative in the coordinate and hence convexity. For it increases, giving concavity. Continuity extends these inequalities to the closed interval. Bias gives a constant slice; gives the identity slice.
The formal proof reuses the Cachin slope rather than rederiving the real-power second derivative. With and the shared positive bias slope , and . The shared certificate gives . The identity and uniqueness of derivatives identify this expression with . Also, , so continuity of the inverse comes directly from the existing inverse.
| Needed interface | Reused source | Use |
|---|---|---|
| Convolution and bias product | BinaryRenyiCombining.bconv, bconv_bias | The combining reduction |
| Positive power sum and monotone probability entropy | HircheCachinCombiningConcavity.powerSum_pos, h_strictMonoOn, h_image | The exponential change of coordinate and exact range |
| Specified entropy inverse | hInv_h, hInv_continuousOn | The Arimoto probability inverse and its continuity |
| Bias derivative and positive slope | psi_hasDerivAt, slope_pos | The Arimoto bias derivative and its sign |
| Real-power elasticity | slope_hasDerivAt, slope_eq, T_comp_hasDerivAt | The Arimoto elasticity and its hyperbolic identity |
| Closed-interval curvature | Mathlib MonotoneOn.convexOn_of_deriv, AntitoneOn.concaveOn_of_deriv | Continuous endpoint extension |
Falsifier
A violation consists of an allowed real order, a permitted fixed , two points of and a convex weight violating the corresponding inequality. Source fidelity and bibliographic priority are separate from mathematical correctness of this statement.
Evidence
The settling declaration is result : claim in
D5/S3/Entropy/RenyiCombining/HircheArimotoCombining.lean.
Its statement includes all real orders in both ranges and both coordinate
endpoints. The hyperbolic certificate is
ArimotoHyperbolic.strictMonoOn_elasticity.
Triage
Conjecture IV.6 is PROVED with by result : claim.
Since , this witness meets the source’s strict numerical
bound. The conjecture asks for the existence of such a threshold; it does
not assert concavity throughout .
The following full separate-curvature classification on positive orders is computed, with its strictness and additional order ranges OPEN as formalization targets:
| Order | Internal slices |
|---|---|
| Strictly convex | |
| Strictly concave | |
| Neither convex nor concave | |
| Strictly convex; this is the regime of Hirche’s Lemma IV.3 |
Here “internal” means the fixed second bias belongs to . Endpoint slices are constant or identity and satisfy the non-strict inequalities. At the original coordinate is constant and the specified inverse does not exist.
For the computed sharpness calculation, let with . Its convergent even Taylor expansion is . Therefore
For and every fixed , the difference is strictly positive for sufficiently small positive . In particular, gives the slice and positive second derivative, excluding concavity. For , the explicit formula for shows as , whereas has a finite limit. The second derivative is then negative near that endpoint, excluding convexity as well. For , parameter comparison gives , so elasticity decreases and internal slices are strictly convex. Sharpness for , including failure of concavity at for , is computed / OPEN: these sharpness, strictness and remaining-range arguments are not formalized.
ASSUMED-UNVERIFIED
Citation indexes and subsequent literature have not been exhaustively checked; bibliographic priority and the absence of a later analytic proof are not established.