The Sharma-Mittal Entropy is Subadditive and Supermodular on the Majorization Lattice
Pith reviewed 2026-05-20 08:10 UTC · model grok-4.3
The pith
Sharma-Mittal entropy is subadditive and supermodular on the majorization lattice of probability distributions.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We prove that Sharma-Mittal entropy is a subadditive and supermodular function on the lattice of all n-dimensional probability distributions, ordered according to the partial order relation defined by majorization among vectors. Our result unifies and extends analogous results presented in the literature for the Shannon entropy, the Tsallis entropy, and the Rényi entropy.
What carries the argument
The Sharma-Mittal entropy function (a two-parameter generalization of entropy) acting on the lattice formed by the majorization order on the probability simplex.
If this is right
- The same subadditivity and supermodularity statements hold automatically for Shannon entropy, Tsallis entropy, and Rényi entropy as parameter special cases.
- Majorization-based comparisons of uncertainty can be performed directly with the Sharma-Mittal measure without separate proofs for each classical entropy.
- Any optimization or bounding problem that previously used majorization for one of the classical entropies now extends uniformly to the full two-parameter family.
Where Pith is reading between the lines
- A common proof technique now covers all listed entropies, which may shorten future derivations that rely on these lattice properties.
- The result opens the possibility of checking whether other two-parameter entropies outside the Sharma-Mittal family also inherit subadditivity and supermodularity on the same lattice.
Load-bearing premise
The majorization relation forms a lattice on the simplex of probability vectors and the Sharma-Mittal parameters are restricted to the range that yields a valid entropy.
What would settle it
An explicit pair of probability vectors x and y where the subadditivity or supermodularity inequality for Sharma-Mittal entropy is violated for some admissible parameter pair.
read the original abstract
We prove that Sharma-Mittal entropy is a subadditive and supermodular function on the lattice of all $n$-dimensional probability distributions, ordered according to the partial order relation defined by majorization among vectors. Our result unifies and extends analogous results presented in the literature for the Shannon entropy, the Tsallis entropy, and the R\'enyi entropy.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript proves that the two-parameter Sharma-Mittal entropy is subadditive and supermodular on the lattice of n-dimensional probability vectors equipped with the majorization partial order. The result is obtained by direct verification of the defining inequalities and unifies the corresponding statements already known for the Shannon, Tsallis, and Rényi cases, which arise as special or limiting values of the parameters.
Significance. If the proof is correct, the paper supplies a single argument that covers a broad parametric family of entropies, thereby strengthening the lattice-theoretic approach to majorization inequalities in information theory. The unification is useful because many applications rely on the same majorization lattice but previously required separate arguments for each entropy measure.
major comments (2)
- [§3] §3, Theorem 3.1 (subadditivity): the reduction to the case of sorted vectors is stated without an explicit reference to the fact that the meet and join operations on the majorization lattice preserve the sorted order; a short sentence confirming that the partial-sum construction commutes with the entropy functional would remove any ambiguity.
- [§4] §4, Eq. (12) (supermodularity inequality): the proof assumes α, β lie in the open interval that guarantees strict concavity of the underlying function; outside this interval the inequality may reverse or fail, yet the statement of the theorem does not restate the precise parameter domain required for the claim.
minor comments (2)
- [Abstract] The abstract and introduction use the phrase 'all n-dimensional probability distributions' without noting that the result is stated for the simplex of fixed dimension n; a parenthetical remark would prevent misreading as a statement about variable-length vectors.
- [§2] Notation for the two parameters of the Sharma-Mittal entropy is introduced only in §2; repeating the definition (with the conventional range) in the statement of the main theorems would improve readability.
Simulated Author's Rebuttal
We thank the referee for the careful reading of the manuscript and the constructive suggestions. We address each major comment below and have revised the manuscript accordingly.
read point-by-point responses
-
Referee: [§3] §3, Theorem 3.1 (subadditivity): the reduction to the case of sorted vectors is stated without an explicit reference to the fact that the meet and join operations on the majorization lattice preserve the sorted order; a short sentence confirming that the partial-sum construction commutes with the entropy functional would remove any ambiguity.
Authors: We agree that an explicit reference would improve clarity. In the revised manuscript we have added one sentence in §3 noting that the meet and join operations on the majorization lattice preserve the decreasing order of the components of the probability vectors, and that the partial-sum construction therefore commutes with the Sharma-Mittal entropy, which is invariant under permutation of its arguments. revision: yes
-
Referee: [§4] §4, Eq. (12) (supermodularity inequality): the proof assumes α, β lie in the open interval that guarantees strict concavity of the underlying function; outside this interval the inequality may reverse or fail, yet the statement of the theorem does not restate the precise parameter domain required for the claim.
Authors: We thank the referee for this observation. The parameter restrictions required for strict concavity are stated in the preliminaries, but the theorem statement itself did not repeat them. We have revised the statement of the supermodularity theorem to explicitly restate the open interval for α and β under which the claimed inequality holds. revision: yes
Circularity Check
No significant circularity in the derivation chain
full rationale
The paper presents a direct mathematical proof establishing subadditivity and supermodularity of the Sharma-Mittal entropy on the majorization lattice of probability distributions. It extends known results for Shannon, Tsallis, and Rényi entropies at parameter limits using the standard parametric definition and the established lattice structure of majorization (with explicit meet/join operations). No load-bearing step reduces by construction to a fitted input, self-definition, or unverified self-citation chain; the central inequalities are verified independently from the definitions without circular reduction.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption Sharma-Mittal entropy is defined via its standard two-parameter formula that reduces to Shannon, Tsallis, and Rényi entropies for appropriate parameter choices.
- standard math The set of n-dimensional probability distributions with the majorization partial order forms a lattice.
Lean theorems connected to this paper
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
We prove that Sharma-Mittal entropy is a subadditive and supermodular function on the lattice of all n-dimensional probability distributions, ordered according to the partial order relation defined by majorization among vectors.
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.