Table of Contents
Fetching ...

A two-parameter entropy and its fundamental properties

Supriyo Dutta, Shigeru Furuichi, Partha Guha

TL;DR

This paper introduces a two-parameter generalization of entropy, denoted $S_{k,r}$, built from a two-parameter deformed logarithm $\ln_{k,r}$ and paired with a generalized divergence $D_{k,r}$. It shows that $S_{k,r}$ reduces to the Tsallis entropy for $k=r=(q-1)/2$ and that $D_{k,r}$ extends Sharma–Mittal and Tsallis divergences, establishing fundamental properties including chain rule, sub-additivity, strong sub-additivity, joint convexity, and information monotonicity. It then analyzes the information-geometric structure by deriving a Hessian metric on the probability simplex, showing the induced manifold is Hassian. These results provide a flexible two-parameter framework for information theory in complex systems and suggest future work on mutual information and two-parameter data-processing inequalities.

Abstract

This article proposes a new two-parameter generalized entropy, which can be reduced to the Tsallis and the Shannon entropy for specific values of its parameters. We develop a number of information-theoretic properties of this generalized entropy and divergence, for instance, the sub-additive property, strong sub-additive property, joint convexity, and information monotonicity. This article presents an exposit investigation on the information-theoretic and information-geometric characteristics of the new generalized entropy and compare them with the properties of the Tsallis and the Shannon entropy.

A two-parameter entropy and its fundamental properties

TL;DR

This paper introduces a two-parameter generalization of entropy, denoted , built from a two-parameter deformed logarithm and paired with a generalized divergence . It shows that reduces to the Tsallis entropy for and that extends Sharma–Mittal and Tsallis divergences, establishing fundamental properties including chain rule, sub-additivity, strong sub-additivity, joint convexity, and information monotonicity. It then analyzes the information-geometric structure by deriving a Hessian metric on the probability simplex, showing the induced manifold is Hassian. These results provide a flexible two-parameter framework for information theory in complex systems and suggest future work on mutual information and two-parameter data-processing inequalities.

Abstract

This article proposes a new two-parameter generalized entropy, which can be reduced to the Tsallis and the Shannon entropy for specific values of its parameters. We develop a number of information-theoretic properties of this generalized entropy and divergence, for instance, the sub-additive property, strong sub-additive property, joint convexity, and information monotonicity. This article presents an exposit investigation on the information-theoretic and information-geometric characteristics of the new generalized entropy and compare them with the properties of the Tsallis and the Shannon entropy.

Paper Structure

This paper contains 5 sections, 17 theorems, 78 equations, 3 tables.

Key Result

Lemma 1

For $r < 0$, and $0 < k \leq 1$ the function $-\ln_{\{k,r\}}(u) = -u^r \frac{u^{k} - u^{-k}}{2k}$ is positive, convex, and monotonically decreasing for all $u \in (0, 1]$.

Theorems & Definitions (38)

  • Definition 1
  • Lemma 1
  • proof
  • Lemma 2
  • proof
  • Definition 2
  • Definition 3
  • Definition 4
  • Lemma 3
  • proof
  • ...and 28 more