{"id":"a5d93a42-6813-44ab-898c-8a69fe0c2dae","arxiv_id":"2607.08599","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":3,"one_line_summary":"Three sharp informational inequalities are derived by combining a Rényi entropy–divergence–cross-entropy inequality with relative Stam and moment-entropy bounds, yielding explicit minimizers of generalized Gaussian and Beta types.","lead":"The paper proves three new sharp inequalities linking entropy, Fisher information, and moment functionals across non-relative, relative, and cross-entropy settings. These results extend Stam-type and moment-entropy inequalities to pairs of probability densities, with minimizers including stretched Gaussians and generalized Beta distributions.","discovery_kind":"unclear","skeptic_critique":{"model":"glm-5.2","headline":"Sharpness of all three theorems is entirely transitive, inheriting from unverified preprint [28]; the multiplication-of-inequalities technique preserves sharpness only if both factors are simultaneously saturated by the same pair (f,h).","rationale":"The reader correctly identified that the sharpness of all three theorems is transitive, depending on [28, Theorem 4.1]. I agree with this assessment and sharpen it: the deeper concern is not merely the unverified status of [28], but the logical structure of the sharpness argument itself. The multiplication technique requires simultaneous saturation of both factor inequalities by the same pair, and for Theorem 5.1 this leads to an ODE whose solvability is unproven. The inequalities themselves (as non-sharp bounds) would still hold as products of two valid inequalities even if sharpness fails, so the core contribution is not entirely undermined. But the paper's central selling point — 'All the inequalities are sharp' — is not fully established for Theorem 5.1. Theorems 3.1 and 4.1 are more convincing because their optimizer ODEs are explicitly solved. The conditional verdict is appropriate: the paper should be accepted conditional on either proving existence of solutions to (5.9) or softening the sharpness claim for Theorem 5.1 to conditional sharpness (sharp if a solution exists). The reader's concern about [28] being a same-author preprint is valid but secondary; the more immediate issue is internal to this paper's logic.","tokens_in":13285,"tokens_out":879,"duration_ms":137213,"concrete_test":"For Theorem 5.1, either (a) prove existence of a solution to ODE (5.9) on an appropriate domain that yields non-negative, integrable densities f and h, or (b) provide a numerical example: pick specific parameter values (e.g., p=2, λ=1/2, α=2, γ satisfying (3.1)), numerically solve (5.9), and verify that the resulting f and h from (5.7) and (5.4) are valid PDFs and that equality holds in (5.2) up to numerical precision.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"Each theorem is proved by multiplying two inequalities and canceling a shared divergence term. For the resulting product inequality to be sharp, BOTH factor inequalities must achieve equality for the SAME pair (f,h) simultaneously. The paper's argument for this simultaneous saturation is not fully convincing upon close inspection. For Theorem 3.1: inequality (3.5) [from (2.8)] is saturated when h ∝ f^{(λ_α−α)/(λ_α−1)} (eq. 3.7), while inequality (3.6) [from [28]] is saturated by f(x) = [r g_{p,λ}(r y(x))]^{1/α} h(x) with y'(x) = [r g_{p,λ}(r y(x))]^{−1/α*} h(x) (eq. 3.9). The paper combines these to derive the optimizers, but this derivation assumes that the proportionality constant in (3.7) and the change-of-variable structure in (3.9) are compatible — i.e., that the h satisfying (3.7) also satisfies the integral constraint implicit in (3.9). The paper shows this leads to the ODE (3.11) and solves it, which is encouraging. However, the same simultaneous-saturation argument for Theorem 5.1 leads to the ODE (5.9), which the authors explicitly state 'cannot be explicitly integrated.' This means the sharpness claim for Theorem 5.1 is asserted without verification that a solution satisfying all constraints actually exists. The paper says 'any solution y(x) of (5.9) produces a pair of optimizers,' but does not prove such a solution exists, nor that it yields valid probability densities (non-negative, integrable, normalized). This is a genuine gap: sharpness is claimed but not demonstrated.","agreement_with_reader":"agree"},"referee_report":{"model":"glm-5.2","summary":"The paper derives three new sharp informational inequalities that combine non-relative, relative, and cross functionals. The technique is to multiply two known inequalities (one from [29] mixing Rényi entropy, divergence, and cross-entropy; one from [28] providing relative Stam and moment-entropy bounds) and cancel the shared Rényi divergence term. Theorem 3.1 gives a Stam-like inequality involving the Rényi entropy power, relative Fisher information, and Rényi cross-entropy, with stretched Gaussian / generalized trigonometric optimizers. Theorem 4.1 gives a moment-type inequality with generalized Beta optimizers. Theorem 5.1 gives a Fisher-type inequality whose optimizers satisfy a second-order ODE that cannot be solved in closed form. The derivations are short and mechanically checkable.","tokens_in":14202,"tokens_out":1246,"duration_ms":114536,"significance":"The paper provides a clean and systematic way to generate cross-functional inequalities from existing relative-framework results. The optimizers for Theorems 3.1 and 4.1 are given explicitly in terms of known special functions (stretched Gaussians, generalized trigonometric functions, Beta distributions), which is a concrete strength. The technique of combining a three-term Rényi inequality with relative Stam/moment-entropy bounds to eliminate the divergence is natural and the resulting inequalities are genuinely new. However, the novelty is incremental: each theorem is a direct product of two cited inequalities, and the paper's contribution is primarily the identification of simultaneous saturation conditions and the resulting optimizer calculations.","major_comments":[{"comment":"Theorem 5.1, §5: The sharpness claim is not fully substantiated. The optimizers are characterized by the second-order ODE (5.9), which the authors state 'cannot be explicitly integrated.' The paper then asserts that 'any solution y(x) of (5.9) produces a pair of optimizers (f,h)' but does not prove that such a solution exists, nor that it yields valid probability densities (non-negative, integrable, normalizable). Without an existence argument—e.g., a fixed-point or variational existence result—the sharpness of Theorem 5.1 is asserted but not demonstrated. The authors should either provide an existence proof for solutions to (5.9) yielding valid densities, or downgrade the sharpness claim for Theorem 5.1 to conditional on such existence.","section":null},{"comment":"Theorems 3.1, 4.1, and 5.1: The sharpness of all three results is transitive, inheriting from the relative Stam inequality (3.6) and relative moment-entropy inequality (4.5) of [28, Theorem 4.1], which is cited as an arXiv preprint. The multiplication-of-inequalities technique preserves sharpness only if both factor inequalities are simultaneously saturated by the same pair (f,h). For Theorems 3.1 and 4.1, the paper does verify this compatibility by deriving explicit optimizers (eqs. 3.10–3.13, 4.10–4.13). However, the paper should explicitly state that the sharpness of all results is contingent on [28] being correct, and ideally summarize the key steps of [28, Theorem 4.1] so the reader can verify the simultaneous-saturation argument without consulting the preprint.","section":null}],"minor_comments":[{"comment":"The paper depends critically on two unpublished preprints [28] and [29] by the same authors. The central inequality (2.8) from [29] and the relative Stam/moment-entropy inequalities from [28] are load-bearing. The authors should ensure these are accepted or forthcoming, or at minimum make the preprints available for review.","section":null},{"comment":"§2, definition of Rényi cross-entropy: the limiting case writes 'lim_{α→1} H_α[f]' but should be 'lim_{α→1} H_α[f;g]' to be consistent with the notation used elsewhere.","section":null},{"comment":"§3, equation (3.1): the condition '(α(2−λ)−1))(α−γ) = (α−1)²' has an extra closing parenthesis. Please verify the intended expression.","section":null},{"comment":"§3, Remark 1: the statement that 'up to a scaling change, g^{1/α*}_{p,λ} = g_{p,λ} with λ = λ_{α−1}/(α−1)' is not immediately obvious. A brief derivation would help.","section":null},{"comment":"§4, equation (4.4): the exponents on σ are typeset in a way that makes the expression hard to parse. Clarifying the grouping (e.g., with explicit braces) would aid readability.","section":null},{"comment":"§5, equation (5.1): the notation ϕ^{(cr)}_{a,b,c}[f;h] is introduced here but the superscript '(cr)' is not used consistently in the subsequent text. Standardize the notation.","section":null},{"comment":"The paper states (§3, last paragraph) that the optimal constant K can be 'explicitly computed in terms of the optimal constant of the biparametric Stam inequality' but does not give the formula. Providing the explicit expression (or at least the relationship) would be helpful.","section":null}],"recommendation":"minor_revision","confidential_remarks":"The paper is technically correct in its core technique (multiply two inequalities, cancel divergence) but the sharpness claims rest entirely on preprint [28]. The most substantive concern is Theorem 5.1, where sharpness is claimed but the optimizers are only characterized by an ODE whose solvability is unverified. If the authors can either prove existence for (5.9) or qualify the sharpness claim, the paper is publishable. The overall contribution is incremental but appropriate for a short note in an information theory journal."},"author_rebuttal":null,"desk_editor":{"model":"glm-5.2","letter":"The paper proves three new inequalities connecting non-relative, relative, and cross informational functionals. The technique is the same each time: take a three-term Rényi inequality from [29] and a relative Stam or moment-entropy inequality from [28], multiply them, and cancel the shared divergence term. The resulting bounds on cross-entropy, cross-deviation, and cross-Fisher information are genuinely new as stated, and the optimizer calculations for Theorems 3.1 and 4.1 are worked out in detail — the Beta-type minimizers for the moment inequality (Theorem 4.1) are a nice concrete result, and the stretched Gaussian / generalized trigonometric optimizers for Theorem 3.1 are explicit and checkable. The algebraic parameter conditions are straightforward substitutions and look correct. The paper is short, focused, and does not oversell what it does. Credit for that. The soft spots are real but concentrated. First, the sharpness of all three theorems is entirely transitive — it inherits from [28, Theorem 4.1], a same-author preprint. The conditions (3.3)/(3.4) are lifted verbatim. If [28] has a gap, the sharpness claims here collapse, though the inequalities themselves would survive as non-sharp bounds. Second, the stress-test concern about simultaneous saturation is partially valid. For Theorem 3.1, the paper does the work: it derives the ODE (3.11), solves it explicitly, and produces concrete optimizers. That is convincing. For Theorem 5.1, the simultaneous-saturation argument leads to ODE (5.9), which the authors admit they cannot integrate. They assert that any solution produces optimizers but do not prove a solution exists or that it yields valid densities. That is a genuine gap in the sharpness claim for Theorem 5.1 specifically — not for the other two theorems. Third, the optimal constants K are never computed explicitly; they are just inherited from prior work. Minor, but worth noting. The invented functionals (cross-deviation, generalized cross-Fisher information) are reasonable extensions of existing definitions and not problematic. Overall: the core technique is simple but legitimate, two of three sharpness claims are properly justified, and the third has a real gap. This is a solid incremental paper within an established program. It deserves a serious referee who can check [28] and assess whether the Theorem 5.1 sharpness claim should be downgraded to conditional.","headline":"Three new sharp inequalities built by multiplying two known inequalities and canceling a divergence term; sharpness inherited from cited preprints.","tokens_in":14181,"tokens_out":606,"would_cite":true,"duration_ms":116675,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"glm-5.2","headline":"Three sharp inequalities fuse entropy, Fisher, and moment measures","keywords":[],"falsifier":"A concrete pair of densities (f, h) satisfying all regularity conditions for which the product N_α[f]·φ_{p,λ_α}[f||h] falls strictly below K·exp{H_γ[f;h]}, or a proof that the relative Stam inequality (3.6) from the companion paper is not actually sharp under conditions (3.3)/(3.4), which would invalidate the equality-case analysis for all three theorems.","tokens_in":13468,"feed_emoji":"⚖️","tokens_out":867,"duration_ms":88043,"temperature":0.7,"pith_summary":"The paper proves three new sharp inequalities that bind together informational functionals of three types—non-relative (depending on a single probability density), relative (depending on a pair), and cross (a hybrid). The central mechanism is a multiplicative cancellation trick: the authors take a recently established inequality relating Rényi entropy, Rényi divergence, and Rényi cross-entropy, and multiply it by a separate relative Stam-like or moment-entropy-like inequality. The Rényi divergence term appears in both and cancels, leaving a clean inequality that directly connects a non-relative functional, a relative functional, and a cross functional. This yields a Stam-type inequality linking Rényi entropy power, relative Fisher information, and Rényi cross-entropy; a moment-type inequality linking absolute deviation, relative cumulative deviation, and cross-deviation; and a Fisher-type inequality linking biparametric Fisher information, relative Fisher information, and a new generalized cross-Fisher information. All three are sharp, and their equality cases are characterized by stretched Gaussian densities, generalized trigonometric/hyperbolic functions, and generalized Beta distributions.","feed_headline":"Three sharp inequalities fuse entropy, Fisher, and moment measures","feed_subtitle":"A cancellation trick binds non-relative, relative, and cross informational functionals into sharp bounds with Gaussian and Beta minimizers.","key_machinery":"The multiplicative cancellation of Rényi divergence between inequality (2.8) and the relative Stam/moment-entropy inequalities from the relative framework. Equality cases are then found by simultaneously solving the proportionality condition h ∝ f^{(β−1)/(β−α)} from (2.8) with the optimizer structure of the relative inequalities, which involves a change of variables y(x) driven by the stretched Gaussian g_{p,λ}.","core_discovery":"The core discovery is that multiplying a three-term Rényi inequality (entropy + divergence ≤ cross-entropy) by a relative Stam or moment-entropy inequality causes the Rényi divergence factor to cancel, producing a new sharp inequality that directly links one-parameter non-relative functionals, biparametric relative functionals, and cross functionals. The equality cases are explicit for the first two inequalities—pairs of stretched Gaussian or generalized Beta densities—and are characterized by a second-order ODE for the third.","pith_inferences":[],"forward_implications":["The cancellation trick can be iterated: any future relative inequality involving Rényi divergence can be combined with (2.8) to produce a new non-relative/relative/cross inequality at the corresponding functional level.","The generalized Beta and stretched Gaussian minimizers provide explicit extremal distributions that can serve as reference cases for testing numerical optimization algorithms in information geometry.","The cross-deviation and generalized cross-Fisher information functionals introduced here are new objects; their properties (convexity, monotonicity, data-processing behavior) are natural next targets.","The moment-inequality minimizers being generalized Beta distributions suggests a deeper structural analogy between the Stam and moment-entropy hierarchies at the cross-functional level."],"fun_headline_variants":["Rényi divergence cancels to fuse entropy, Fisher, and moment measures","Cancellation trick yields sharp bounds linking relative and cross functionals","Stretched Gaussian and Beta densities minimize new sharp informational inequalities","Three sharp Rényi inequalities bind non-relative, relative, and cross functionals","Stam-like framework produces sharp bounds with explicit Gaussian and Beta minimizers"],"cache_read_input_tokens":0,"weakest_assumption_plain":"The sharpness of all three new inequalities is inherited from a relative Stam inequality and a relative moment-entropy inequality established in a cited companion preprint. If the sharpness analysis in that companion result has a gap, the sharpness claims here collapse—though the inequalities themselves, being products of two individually valid bounds, would still hold as non-sharp estimates.","fun_headline_variants_meta":{"raw":{"variants":["Rényi divergence cancels to fuse entropy, Fisher, and moment measures","Cancellation trick yields sharp bounds linking relative and cross functionals","Stretched Gaussian and Beta densities minimize new sharp informational inequalities","Three sharp Rényi inequalities bind non-relative, relative, and cross functionals","Stam-like framework produces sharp bounds with explicit Gaussian and Beta minimizers"]},"model":"glm-5.2","effort":"low","cost_usd":0.0,"raw_usage":{"total_tokens":573,"prompt_tokens":481,"completion_tokens":92,"prompt_tokens_details":null},"tokens_in":481,"tokens_out":92,"duration_ms":26583,"temperature":1.0,"reasoning_tokens":null,"cache_read_input_tokens":0,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-10T04:38:05.889217+00:00","model_set":{"reader":"glm-5.2"},"falsifier":"A concrete pair of densities (f, h) satisfying all regularity conditions for which the product N_α[f]·φ_{p,λ_α}[f||h] falls strictly below K·exp{H_γ[f;h]}, or a proof that the relative Stam inequality (3.6) from the companion paper is not actually sharp under conditions (3.3)/(3.4), which would invalidate the equality-case analysis for all three theorems.","supporting_citations":[],"review_version":1}