Harmonic entropy: Difference between revisions

m Fredg999 moved page Harmonic Entropy to Harmonic entropy over redirect: Singular title by convention
m Markup (lead section, header levels)
Line 1: Line 1:
__FORCETOC__
'''Harmonic entropy''' ('''HE''') is a simple model to quantify the extent to which musical chords exhibit various psychoacoustic effects, lumped together in a single construct called psychoacoustic '''concordance'''. It was invented by Paul Erlich and developed extensively on the Yahoo! tuning and harmonic_entropy lists. Various later contributions to the model have been made by Steve Martin, Mike Battaglia, Keenan Pepper, and others.


'''Harmonic Entropy''', sometimes abbreviated as "HE", is a simple model to quantify the extent to which musical chords exhibit various psychoacoustic effects, lumped together in a single construct called psychoacoustic '''concordance'''. It was invented by Paul Erlich and developed extensively on the Yahoo! tuning and harmonic_entropy lists. Various later contributions to the model have been made by Steve Martin, Mike Battaglia, Keenan Pepper, and others.
== Background ==
 
=Background=
The general workings of the human auditory system lead to a plethora of well-documented and sonically interesting phenomena that can occur when a musical chord is played:
The general workings of the human auditory system lead to a plethora of well-documented and sonically interesting phenomena that can occur when a musical chord is played:


Line 28: Line 26:
Concordance has often been confused with actual musical consonance, an unfortunate fact made more common by the psychoacoustics literature under the unfortunate name '''sensory consonance''', most often used to refer to phenomena related to roughness and beatlessness specifically. This is not to be confused with the more familiar construct of tonal stability, typically just called "consonance" in Western common practice music theory and sometimes clarified as "musical consonance" in the music cognition literature. To make matters worse, the literature has also at times referred to concordance -- and not tonal stability -- as '''tonal consonance''', often referring to phenomena related to virtual pitch integration, creating a complete terminological mess. As a result, the term "consonance" has been completely avoided in this article.
Concordance has often been confused with actual musical consonance, an unfortunate fact made more common by the psychoacoustics literature under the unfortunate name '''sensory consonance''', most often used to refer to phenomena related to roughness and beatlessness specifically. This is not to be confused with the more familiar construct of tonal stability, typically just called "consonance" in Western common practice music theory and sometimes clarified as "musical consonance" in the music cognition literature. To make matters worse, the literature has also at times referred to concordance -- and not tonal stability -- as '''tonal consonance''', often referring to phenomena related to virtual pitch integration, creating a complete terminological mess. As a result, the term "consonance" has been completely avoided in this article.


=Basic Model: Shannon Entropy=
== Basic Model: Shannon Entropy ==
The original Harmonic Entropy model limited itself to working with dyads. More recently, work by Steve Martin and others has extended this basic idea to higher-cardinality chords. This article will concern itself with dyads, as the dyadic case is still the most well-developed, and many of the ideas extend naturally to larger chords without need for much exposition.
The original Harmonic Entropy model limited itself to working with dyads. More recently, work by Steve Martin and others has extended this basic idea to higher-cardinality chords. This article will concern itself with dyads, as the dyadic case is still the most well-developed, and many of the ideas extend naturally to larger chords without need for much exposition.


Line 35: Line 33:
A clear mathematical way of quantifying this "dispersion" is via the [http://en.wikipedia.org/wiki/Entropy_(information_theory) Shannon entropy] of the probability distribution, which can be thought of as describing the "uncertainty" in the distribution. A distribution which has a very high probability of picking one outcome has low entropy and is not very uncertain, whereas a distribution which has the probability spread out on many outcomes is highly uncertain and has a high entropy.
A clear mathematical way of quantifying this "dispersion" is via the [http://en.wikipedia.org/wiki/Entropy_(information_theory) Shannon entropy] of the probability distribution, which can be thought of as describing the "uncertainty" in the distribution. A distribution which has a very high probability of picking one outcome has low entropy and is not very uncertain, whereas a distribution which has the probability spread out on many outcomes is highly uncertain and has a high entropy.


==Definitions==
=== Definitions ===
To formalize our notion of Shannon entropy, we will first describe the random variable <math>J</math>, representing the set of JI "basis" intervals that our incoming interval is being "matched" to, and the parameter <math>C</math>, representing the "cents" of the incoming interval being played. For example, the interval <math>C</math> would take values such as "400 cents," and the interval <math>J</math> would take values in the set of basis ratios, such as "5/4" or "9/7."
To formalize our notion of Shannon entropy, we will first describe the random variable <math>J</math>, representing the set of JI "basis" intervals that our incoming interval is being "matched" to, and the parameter <math>C</math>, representing the "cents" of the incoming interval being played. For example, the interval <math>C</math> would take values such as "400 cents," and the interval <math>J</math> would take values in the set of basis ratios, such as "5/4" or "9/7."


Line 72: Line 70:
which makes more explicit that <math>c</math> is the argument to the harmonic entropy function, which is equal to the entropy of <math>J</math>, conditioned on the incoming dyad of <math>c</math> cents.
which makes more explicit that <math>c</math> is the argument to the harmonic entropy function, which is equal to the entropy of <math>J</math>, conditioned on the incoming dyad of <math>c</math> cents.


==Probability Distributions==
=== Probability Distributions ===


In order to systematically assign a probability distribution to this dyad, we first start by defining a '''spreading function''', denoted by <math>S(x)</math>, that dictates how the dyad is "smeared" out in log-frequency space, representing how the auditory system allows for some tolerance for mistuning. The typical choice that we will assume here for a spreading function is a Gaussian distribution, with mean centered around the incoming dyad, and standard deviation typically taken as a free parameter in the system and denoted as <math>s</math>.
In order to systematically assign a probability distribution to this dyad, we first start by defining a '''spreading function''', denoted by <math>S(x)</math>, that dictates how the dyad is "smeared" out in log-frequency space, representing how the auditory system allows for some tolerance for mistuning. The typical choice that we will assume here for a spreading function is a Gaussian distribution, with mean centered around the incoming dyad, and standard deviation typically taken as a free parameter in the system and denoted as <math>s</math>.
Line 97: Line 95:
Given a spreading function and set of basis rationals, there are two different procedures commonly used to assign probabilities to each rational. The first, the '''domain-integral approach''', works for arbitrary nowhere dense sets of rationals without any further free parameters. The second, the '''simple weighted approach''', has nice mathematical properties which sometimes make it easier to compute and which may lead to generalizations to infinite sets of rationals which are sometimes dense in the reals. It is conjectured that there are certain important limiting situations where the two converge; both are described in detail below.
Given a spreading function and set of basis rationals, there are two different procedures commonly used to assign probabilities to each rational. The first, the '''domain-integral approach''', works for arbitrary nowhere dense sets of rationals without any further free parameters. The second, the '''simple weighted approach''', has nice mathematical properties which sometimes make it easier to compute and which may lead to generalizations to infinite sets of rationals which are sometimes dense in the reals. It is conjectured that there are certain important limiting situations where the two converge; both are described in detail below.


===Domain-Integral Probabilities===
==== Domain-Integral Probabilities ====
For discrete sets of JI basis ratios, the log-frequency spectrum can be divided up into '''domains''' assigned to each ratio. Each ratio is assigned a domain with lower bound equal to the mediant of itself and its nearest lower neighbor, and likewise with upper bound equal to the mediant of itself and its nearest upper neighbor. If no such neighbor exists, <math>\pm \infty</math> is used instead. Mathematically, this can be represented via the following expression:
For discrete sets of JI basis ratios, the log-frequency spectrum can be divided up into '''domains''' assigned to each ratio. Each ratio is assigned a domain with lower bound equal to the mediant of itself and its nearest lower neighbor, and likewise with upper bound equal to the mediant of itself and its nearest upper neighbor. If no such neighbor exists, <math>\pm \infty</math> is used instead. Mathematically, this can be represented via the following expression:


Line 112: Line 110:
In the case where the set of basis rationals consists of a finite set bounded by Tenney or Weil height, the resulting set of widths is conjectured to have interesting mathematical properties, leading to mathematically nice conceptual simplifications of the model. These simplifications are explained below.
In the case where the set of basis rationals consists of a finite set bounded by Tenney or Weil height, the resulting set of widths is conjectured to have interesting mathematical properties, leading to mathematically nice conceptual simplifications of the model. These simplifications are explained below.


===Simple Weighted Probabilities===
==== Simple Weighted Probabilities ====
It has been noted empirically by Paul Erlich that, given all those rationals with Tenney height under some cutoff <math>N</math> as a basis set, that the domain widths for rationals sufficiently far from the cutoff seem to be proportional to <math>\frac{1}{\sqrt{nd}}</math>.
It has been noted empirically by Paul Erlich that, given all those rationals with Tenney height under some cutoff <math>N</math> as a basis set, that the domain widths for rationals sufficiently far from the cutoff seem to be proportional to <math>\frac{1}{\sqrt{nd}}</math>.


Line 143: Line 141:
This approach to assigning probabilities to basis rationals is useful because it hypothetically makes it possible to consider the HE of sets of rationals which are dense in the reals, or even the entire set of positive rationals, although the best way to do this is a subject of ongoing research.
This approach to assigning probabilities to basis rationals is useful because it hypothetically makes it possible to consider the HE of sets of rationals which are dense in the reals, or even the entire set of positive rationals, although the best way to do this is a subject of ongoing research.


==Examples==
=== Examples ===


In all of these examples, the x-axis represents the width in cents of the dyad, and the y-axis represents ''discordance'' rather than concordance, measured in nats of Shannon entropy.
In all of these examples, the x-axis represents the width in cents of the dyad, and the y-axis represents ''discordance'' rather than concordance, measured in nats of Shannon entropy.


=== s=17, N<10000, sqrt(n*d) weights ===
==== s=17, N<10000, sqrt(n*d) weights ====
This uses as a spreading function the Gaussian distribution with <math>s=~17\cent</math> (or a lin-frequency deviation of 1%). The basis set is all rationals of Tenney height less than 10,000. This uses the simple weighted approach, and the weighting function is <math>\sqrt{nd}</math>:
This uses as a spreading function the Gaussian distribution with <math>s=~17\cent</math> (or a lin-frequency deviation of 1%). The basis set is all rationals of Tenney height less than 10,000. This uses the simple weighted approach, and the weighting function is <math>\sqrt{nd}</math>:


[[File:HE_Tenney_N_10000_s_17cents.png]]
[[File:HE_Tenney_N_10000_s_17cents.png]]


=== s=17, N<100, max(n,d) weights ===
==== s=17, N<100, max(n,d) weights ====
This example uses the same spreading function and standard deviation, but this time the basis set is all rationals of Weil height less than 100. The weighting function here is <math>\max(n,d)</math>:
This example uses the same spreading function and standard deviation, but this time the basis set is all rationals of Weil height less than 100. The weighting function here is <math>\max(n,d)</math>:


[[File:HE_Weil_N_100_s_17cents.png]]
[[File:HE_Weil_N_100_s_17cents.png]]


=== s=17, N<10000, sqrt(n*d) vs mediant-to-mediant weights ===
==== s=17, N<10000, sqrt(n*d) vs mediant-to-mediant weights ====
The following image (from Paul Erlich) compares the domain-integral and simple weighted approaches by overlaying the two curves on top of each other. In both cases, the spreading function is again a Gaussian with s=~17 cents, and the basis set is all those rationals with Tenney height ≤ 10000. It can be seen that the curves are extremely similar, and that the locations of the minima and maxima are largely preserved:
The following image (from Paul Erlich) compares the domain-integral and simple weighted approaches by overlaying the two curves on top of each other. In both cases, the spreading function is again a Gaussian with s=~17 cents, and the basis set is all those rationals with Tenney height ≤ 10000. It can be seen that the curves are extremely similar, and that the locations of the minima and maxima are largely preserved:


[[File:HE_Tenney_mediant_vs_sqrt_nd_Paul.png|800px]]
[[File:HE_Tenney_mediant_vs_sqrt_nd_Paul.png|800px]]


=Harmonic Rényi Entropy=
== Harmonic Rényi Entropy ==


An extension to the base Harmonic Entropy model, proposed by Mike Battaglia, is to generalize the use of [http://en.wikipedia.org/wiki/Entropy_(information_theory) Shannon entropy] by replacing it instead with [http://en.wikipedia.org/wiki/R%C3%A9nyi_entropy Rényi entropy], a [http://en.wikipedia.org/wiki/Q-analog q-analog] of Shannon's original entropy. This can be thought of as adding a second parameter, called <math>a</math>, to the model, reflecting how "intelligent" the brain's "decoding" process is when determining the most likely JI interpretation of an ambiguous interval.
An extension to the base Harmonic Entropy model, proposed by Mike Battaglia, is to generalize the use of [http://en.wikipedia.org/wiki/Entropy_(information_theory) Shannon entropy] by replacing it instead with [http://en.wikipedia.org/wiki/R%C3%A9nyi_entropy Rényi entropy], a [http://en.wikipedia.org/wiki/Q-analog q-analog] of Shannon's original entropy. This can be thought of as adding a second parameter, called <math>a</math>, to the model, reflecting how "intelligent" the brain's "decoding" process is when determining the most likely JI interpretation of an ambiguous interval.


==Definitions and Background==
=== Definitions and Background ===


The '''Harmonic Rényi Entropy of order a''' of an incoming dyad can be defined as follows:
The '''Harmonic Rényi Entropy of order a''' of an incoming dyad can be defined as follows:
Line 184: Line 182:
Certain values of <math>a</math> reduce to simpler expressions and have special names, as given in the examples below.
Certain values of <math>a</math> reduce to simpler expressions and have special names, as given in the examples below.


==Examples==
=== Examples ===
===a=0: Harmonic Hartley Entropy===
==== a=0: Harmonic Hartley Entropy ====
<math>\displaystyle H_0(J|c) = \log |J|</math>
<math>\displaystyle H_0(J|c) = \log |J|</math>


Line 194: Line 192:
''Harmonic Hartley Entropy (a=0) with the basis set all rationals with Tenney height ≤ 10000. Note that the choice of spreading function makes no difference in the end result at all.''
''Harmonic Hartley Entropy (a=0) with the basis set all rationals with Tenney height ≤ 10000. Note that the choice of spreading function makes no difference in the end result at all.''


===a=1: Harmonic Shannon Entropy (Harmonic Entropy)===
==== a=1: Harmonic Shannon Entropy (Harmonic Entropy) ====
<math>\displaystyle H_1(J|c) = -\sum_{j \in J} P(j|c) \log P(j|c)</math>
<math>\displaystyle H_1(J|c) = -\sum_{j \in J} P(j|c) \log P(j|c)</math>


Line 203: Line 201:
''Harmonic Shannon Entropy (a=1) with the basis set all rationals with Tenney height ≤ 10000, spreading function a Gaussian distribution with s=1% (~17 cents), and <math>\sqrt{nd}</math> weighting.''
''Harmonic Shannon Entropy (a=1) with the basis set all rationals with Tenney height ≤ 10000, spreading function a Gaussian distribution with s=1% (~17 cents), and <math>\sqrt{nd}</math> weighting.''


===a=2: Harmonic Collision Entropy===
==== a=2: Harmonic Collision Entropy ====
<math>\displaystyle H_2(J|c) = -\log \sum_{j \in J} P(j|c)^2 = -\log (J_1 = J_2|c)</math>
<math>\displaystyle H_2(J|c) = -\log \sum_{j \in J} P(j|c)^2 = -\log (J_1 = J_2|c)</math>


Line 212: Line 210:
''Harmonic Collision Entropy (a=2) with the basis set all rationals with Tenney height ≤ 10000, spreading function a Gaussian distribution with s=1% (~17 cents), and <math>\sqrt{nd}</math> weighting.''
''Harmonic Collision Entropy (a=2) with the basis set all rationals with Tenney height ≤ 10000, spreading function a Gaussian distribution with s=1% (~17 cents), and <math>\sqrt{nd}</math> weighting.''


===a=∞: Harmonic Min-Entropy===
==== a=∞: Harmonic Min-Entropy ====
<math>\displaystyle H_\infty(J|c) = -\log \max_{j \in J} P(j|c)</math>
<math>\displaystyle H_\infty(J|c) = -\log \max_{j \in J} P(j|c)</math>


Line 221: Line 219:
''Harmonic Rényi Entropy with a=7, with the high value of a being chosen to approximate min-entropy (a=''∞''). The basis set is still all rationals with Tenney height ≤ 10000, the spreading function a Gaussian distribution with s=1% (~17 cents), and the weighting function <math>\sqrt{nd}</math>.''
''Harmonic Rényi Entropy with a=7, with the high value of a being chosen to approximate min-entropy (a=''∞''). The basis set is still all rationals with Tenney height ≤ 10000, the spreading function a Gaussian distribution with s=1% (~17 cents), and the weighting function <math>\sqrt{nd}</math>.''


==Convolution-Based Expression For Quickly Computing Rényi Entropy==
=== Convolution-Based Expression For Quickly Computing Rényi Entropy ===
Below is given an derivation that expresses Harmonic Rényi Entropy in terms of two simpler functions, each of which is a convolution product and hence can be computed quickly using the Fast Fourier Transform.
Below is given an derivation that expresses Harmonic Rényi Entropy in terms of two simpler functions, each of which is a convolution product and hence can be computed quickly using the Fast Fourier Transform.


The below derivation depends on the use of simple weighted probabilities, although it may be possible to extend to domain-integral probabilities instead.
The below derivation depends on the use of simple weighted probabilities, although it may be possible to extend to domain-integral probabilities instead.


===Preliminaries===
==== Preliminaries ====
The Harmonic Rényi Entropy is defined as
The Harmonic Rényi Entropy is defined as


Line 265: Line 263:
We thus reduce the term inside the logarithm to the quotient of the functions <math>\rho_a(c)</math> and <math>\psi(c)</math>. Our aim is now to express each of these two functions in terms of a convolution product.
We thus reduce the term inside the logarithm to the quotient of the functions <math>\rho_a(c)</math> and <math>\psi(c)</math>. Our aim is now to express each of these two functions in terms of a convolution product.


===Convolution product for <math>\psi(c)</math>===
==== Convolution product for <math>\psi(c)</math> ====
<math>\displaystyle \psi(c)</math>, the normalization function, is written as follows:
<math>\displaystyle \psi(c)</math>, the normalization function, is written as follows:


Line 300: Line 298:
<math>\displaystyle \psi(c) = \left[S \ast K\right](-c)</math>
<math>\displaystyle \psi(c) = \left[S \ast K\right](-c)</math>


===Convolution product for <math>\rho_a(c)</math>===
==== Convolution product for <math>\rho_a(c)</math> ====
The derivation for <math>\rho_a(c)</math> proceeds similarly. Recall the function is written as follows:
The derivation for <math>\rho_a(c)</math> proceeds similarly. Recall the function is written as follows:


Line 334: Line 332:
Note that the function <math>K^a(c)</math> involves a slight abuse of notation, as it is not literally <math>K(c)</math> taken to the <math>a</math>'th power (as the square of the delta distribution is undefined). Rather, we are simply taking the weights of each delta distribution in the summation to the <math>a</math>'th power.
Note that the function <math>K^a(c)</math> involves a slight abuse of notation, as it is not literally <math>K(c)</math> taken to the <math>a</math>'th power (as the square of the delta distribution is undefined). Rather, we are simply taking the weights of each delta distribution in the summation to the <math>a</math>'th power.


===Round-up===
==== Round-up ====
Taking all of this, we can rewrite the original expression for Harmonic Rényi Entropy as follows:
Taking all of this, we can rewrite the original expression for Harmonic Rényi Entropy as follows:


Line 349: Line 347:
We have succeeded in representing Harmonic Rényi Entropy in simple terms of two convolution products, each of which can be computed in <math>O(N log N)</math> time.
We have succeeded in representing Harmonic Rényi Entropy in simple terms of two convolution products, each of which can be computed in <math>O(N log N)</math> time.


=Extending HE to <math>N=\infty</math>: zeta-HE=
== Extending HE to <math>N=\infty</math>: zeta-HE ==
All of the models described above involve a finite set of rational numbers, bounded by some weighting function, and where the weighting is less than some max value <math>N</math>.
All of the models described above involve a finite set of rational numbers, bounded by some weighting function, and where the weighting is less than some max value <math>N</math>.


Line 366: Line 364:
This enables us to speak cognizantly of the harmonic entropy of an interval as measured against ''all'' rational numbers.
This enables us to speak cognizantly of the harmonic entropy of an interval as measured against ''all'' rational numbers.


==Background: Unnormalized Entropy==
=== Background: Unnormalized Entropy ===
Our derivation only analytically continues the entropy function for the "unnormalized" set of probabilities, which we previously wrote as <math>Q(j|c)</math>. For this definition to be philosophically perfect, we would want to analytically continue the entropy function for the normalized sense of probabilities, previously written as <math>P(j|c)</math>.
Our derivation only analytically continues the entropy function for the "unnormalized" set of probabilities, which we previously wrote as <math>Q(j|c)</math>. For this definition to be philosophically perfect, we would want to analytically continue the entropy function for the normalized sense of probabilities, previously written as <math>P(j|c)</math>.


Line 387: Line 385:
For now, we will start with a derivation of the unnormalized entropy for <math>N=\infty</math>, as an interesting function worthy of study in its own right - not only because it looks exactly like HE, but because it leads to an expression for unnormalized HE in terms of the [[The_Riemann_Zeta_Function_and_Tuning|Riemann Zeta function]].
For now, we will start with a derivation of the unnormalized entropy for <math>N=\infty</math>, as an interesting function worthy of study in its own right - not only because it looks exactly like HE, but because it leads to an expression for unnormalized HE in terms of the [[The_Riemann_Zeta_Function_and_Tuning|Riemann Zeta function]].


==Derivation==
=== Derivation ===
For now, our derivation is limited to the case of <math>\sqrt{nd}</math> Tenney-weighted rationals, although it may be possible to derive a similar result for <math>\max(n,d)</math> weighting as well.
For now, our derivation is limited to the case of <math>\sqrt{nd}</math> Tenney-weighted rationals, although it may be possible to derive a similar result for <math>\max(n,d)</math> weighting as well.


Additionally, because it simplifies the derivation, we will use ''unreduced rationals'' in our basis set, meaning that we will even allow unreduced fractions such as <math>4/2</math> so long as <math>nd<N</math> for our bound N. The use of HE with unreduced rationals has previously been studied by Paul and shown to be not that much different than HE with reduced ones. However, we will easily show later unreduced and reduced rationals converge to the same thing in the limit as <math>N \to \infty</math>, up to a constant multiplicative scaling.
Additionally, because it simplifies the derivation, we will use ''unreduced rationals'' in our basis set, meaning that we will even allow unreduced fractions such as <math>4/2</math> so long as <math>nd<N</math> for our bound N. The use of HE with unreduced rationals has previously been studied by Paul and shown to be not that much different than HE with reduced ones. However, we will easily show later unreduced and reduced rationals converge to the same thing in the limit as <math>N \to \infty</math>, up to a constant multiplicative scaling.


===Definition of the Unnormalized Harmonic Rényi Entropy===
==== Definition of the Unnormalized Harmonic Rényi Entropy ====
Let's start by recalling the original definition for Harmonic Rényi Entropy, using simple weighted probabilities:
Let's start by recalling the original definition for Harmonic Rényi Entropy, using simple weighted probabilities:


Line 430: Line 428:




===Analytic Continuation of the Convolution Kernel===
==== Analytic Continuation of the Convolution Kernel ====
The definition for <math>K</math> is:
The definition for <math>K</math> is:


Line 510: Line 508:
so that the choice of <math>a</math> simply changes our choice of vertical slice of the Riemann zeta function, as well as the shape of our spreading function (because it is also being raised to a power). If our spreading function is a Gaussian, then we simply get another Gaussian with a different standard deviation.
so that the choice of <math>a</math> simply changes our choice of vertical slice of the Riemann zeta function, as well as the shape of our spreading function (because it is also being raised to a power). If our spreading function is a Gaussian, then we simply get another Gaussian with a different standard deviation.


===Analytic Continuation of Unnormalized Harmonic Rényi Entropy===
==== Analytic Continuation of Unnormalized Harmonic Rényi Entropy ====


We can put this back into our equation for the Unnormalized Harmonic Rényi Entropy. To do so, we will continue with our change of units from cents to nepers, corresponding to a change of our variable from <math>c</math> to <math>n</math>. We will likewise assume the spreading probability distribution <math>S</math> has been scaled to reflect the new choice of units.
We can put this back into our equation for the Unnormalized Harmonic Rényi Entropy. To do so, we will continue with our change of units from cents to nepers, corresponding to a change of our variable from <math>c</math> to <math>n</math>. We will likewise assume the spreading probability distribution <math>S</math> has been scaled to reflect the new choice of units.
Line 552: Line 550:
where we can drop the overline on <math>|\zeta_{0.5a}|^2</math> because it is purely real, and its complex conjugate is itself.
where we can drop the overline on <math>|\zeta_{0.5a}|^2</math> because it is purely real, and its complex conjugate is itself.


==Examples==
=== Examples ===


It is very easy to see empirically that our expression does seem to converge be the thing that UHE converges on in the limit of large N. Here are some examples for different values of s and a, showing that as N increases it converges on the our analytically continued "zeta HE."
It is very easy to see empirically that our expression does seem to converge be the thing that UHE converges on in the limit of large N. Here are some examples for different values of s and a, showing that as N increases it converges on the our analytically continued "zeta HE."
Line 562: Line 560:
Lastly, note that, due to our multiplication of UHE by <math>(1-a)</math> above, the UHE would be flipped upside down relative to what we're used to, with higher values corresponding to more concordant intervals. In the pictures below we have flipped it back upside down, for consistency with the earlier pictures.
Lastly, note that, due to our multiplication of UHE by <math>(1-a)</math> above, the UHE would be flipped upside down relative to what we're used to, with higher values corresponding to more concordant intervals. In the pictures below we have flipped it back upside down, for consistency with the earlier pictures.


===s=0.5%, a=1.00001===
==== s=0.5%, a=1.00001 ====
[[File:ExpUHE vs zeta s=0.5%.png|800px]]
[[File:ExpUHE vs zeta s=0.5%.png|800px]]


===s=1%, a=1.00001===
==== s=1%, a=1.00001 ====
[[File:ExpUHE vs zeta s=1%.png|800px]]
[[File:ExpUHE vs zeta s=1%.png|800px]]


===s=1.5%, a=1.00001===
==== s=1.5%, a=1.00001 ====
[[File:ExpUHE vs zeta s=1.5%.png|800px]]
[[File:ExpUHE vs zeta s=1.5%.png|800px]]


Note that in all these plots, the value of <math>a</math> is chosen to be <math>1.00001</math> rather than exactly <math>1</math>, so as to avoid that <math>(1-a)</math> term becoming 0. Similar results are seen for other choices of <math>a</math>:
Note that in all these plots, the value of <math>a</math> is chosen to be <math>1.00001</math> rather than exactly <math>1</math>, so as to avoid that <math>(1-a)</math> term becoming 0. Similar results are seen for other choices of <math>a</math>:


===s=1%, a=2.2===
==== s=1%, a=2.2 ====
[[File:ExpUHE vs zeta s=1% a=2.2.png|800px]]
[[File:ExpUHE vs zeta s=1% a=2.2.png|800px]]


Note that you have to be careful if you choose to compute the analytically continued <math>a=2</math> numerically: this corresponds to the vertical slice of zeta function at <math>\Re(z) = 1</math>, where there is a pole.
Note that you have to be careful if you choose to compute the analytically continued <math>a=2</math> numerically: this corresponds to the vertical slice of zeta function at <math>\Re(z) = 1</math>, where there is a pole.


==Apparent Equivalence of exp-UHE and UHE for <math>a \leq 2</math>==
=== Apparent Equivalence of exp-UHE and UHE for <math>a \leq 2</math> ===


Let's go back to our original convolution expression for finite-<math>N</math> UHE:
Let's go back to our original convolution expression for finite-<math>N</math> UHE:
Line 644: Line 642:
Note again that this does not hold for <math>a \gt 2</math>, where the graph does display a very large difference between UHE and exp-UHE.
Note again that this does not hold for <math>a \gt 2</math>, where the graph does display a very large difference between UHE and exp-UHE.


==Why not Normalized HE?==
=== Why not Normalized HE? ===
On the surface, everything we did with the convolution theorem, and subsequent analytic continuation, should appear to work for normalized HE as well. For example, let's review our result for the exp of unnormalized HE:
On the surface, everything we did with the convolution theorem, and subsequent analytic continuation, should appear to work for normalized HE as well. For example, let's review our result for the exp of unnormalized HE:


Line 686: Line 684:
Finally, it is noteworthy that for <math>a>2</math>, we end up looking at slices of the zeta function for which <math>\Re(z)>1</math>. This is where our original unnormalized HE function should converge as <math>N \to \infty</math>, corresponding to the region where the Riemann zeta function Dirichlet series converges. For these values of <math>a</math>, the exp-UHE ''is'' positive. So, we can take the log again and look at the usual UHE. This can be useful for plotting, since exp-UHE tends to "flatten" out the curve for high values of <math>a</math>, whereas taking the log accentuates the minima and maxima (and more closely resembles the usual HRE).
Finally, it is noteworthy that for <math>a>2</math>, we end up looking at slices of the zeta function for which <math>\Re(z)>1</math>. This is where our original unnormalized HE function should converge as <math>N \to \infty</math>, corresponding to the region where the Riemann zeta function Dirichlet series converges. For these values of <math>a</math>, the exp-UHE ''is'' positive. So, we can take the log again and look at the usual UHE. This can be useful for plotting, since exp-UHE tends to "flatten" out the curve for high values of <math>a</math>, whereas taking the log accentuates the minima and maxima (and more closely resembles the usual HRE).


==Interpretation as a New Free Parameter: the Weighting Exponent==
=== Interpretation as a New Free Parameter: the Weighting Exponent ===
In our original derivation of the analytic continuation, we temporarily changed the weighting for rationals from <math>(nd)^{0.5}</math> to some other <math>(nd)^w</math>, with <math>w > 1</math>, for the sake of obtaining a series that converges. We then changed the exponent back to <math>0.5</math>.
In our original derivation of the analytic continuation, we temporarily changed the weighting for rationals from <math>(nd)^{0.5}</math> to some other <math>(nd)^w</math>, with <math>w > 1</math>, for the sake of obtaining a series that converges. We then changed the exponent back to <math>0.5</math>.


Line 697: Line 695:
So that our vertical slice of the zeta function is given by $\Re(z) = w\cdot \a$.
So that our vertical slice of the zeta function is given by $\Re(z) = w\cdot \a$.


==Equivalence of the Weighting Exponent and <math>a</math> for Generalized Normal Distributions==
=== Equivalence of the Weighting Exponent and <math>a</math> for Generalized Normal Distributions ===


We get a very interesting result if our spreading distribution is a [https://en.wikipedia.org/wiki/Generalized_normal_distribution generalized normal distribution], which a family that encompasses both the Gaussian and the Laplace distributions (sometimes referred to as the "Vos curve" in Paul's work).
We get a very interesting result if our spreading distribution is a [https://en.wikipedia.org/wiki/Generalized_normal_distribution generalized normal distribution], which a family that encompasses both the Gaussian and the Laplace distributions (sometimes referred to as the "Vos curve" in Paul's work).
Line 719: Line 717:
This gives us a very nice interpretation of our <math>a</math> coefficient from HRE: it basically represents the weighting exponent on the rationals, with a corresponding adjustment to the standard deviation. The collision entropy <math>a=2</math> with the standard weighting <math>\sqrt{nd}</math> is totally equivalent to the Shannon entropy <math>a=1</math> with the weighting <math>nd</math> on the rationals, so long as the value of <math>s</math> is adjusted according to the equation above. However, it should be noted that this definition only holds for the "unnormalized HRE" given above.
This gives us a very nice interpretation of our <math>a</math> coefficient from HRE: it basically represents the weighting exponent on the rationals, with a corresponding adjustment to the standard deviation. The collision entropy <math>a=2</math> with the standard weighting <math>\sqrt{nd}</math> is totally equivalent to the Shannon entropy <math>a=1</math> with the weighting <math>nd</math> on the rationals, so long as the value of <math>s</math> is adjusted according to the equation above. However, it should be noted that this definition only holds for the "unnormalized HRE" given above.


==Reduced Rationals Only==
=== Reduced Rationals Only ===


In our derivation, we assumed the use of unreduced rationals. It turns out that with a minor adjustment, the same model gives us reduced rationals, up to a constant multiplicative scaling. Let's go back to our analytic continuation of the convolution kernel, for some arbitrary weighting:
In our derivation, we assumed the use of unreduced rationals. It turns out that with a minor adjustment, the same model gives us reduced rationals, up to a constant multiplicative scaling. Let's go back to our analytic continuation of the convolution kernel, for some arbitrary weighting:
Line 757: Line 755:
Lastly, you will note that for the special value <math>w=0.5</math>, corresponding to the usual <math>\sqrt{nd}</math> weighting, we end up dividing by the term <math>\zeta(1)</math>. This is the only pole in the zeta function, so we wind up dividing by infinity, making the entire function zero, as pointed out by Martin Gough. However, as we can get arbitrarily close to <math>w=0.5</math> and still exhibit the behavior that the unreduced and reduced functions are scaled versions of one another, we can simply use the unreduced version of exp-UHE for <math>w=0.5</math> and consider it equivalent to reduced exp-UHE in the limit.
Lastly, you will note that for the special value <math>w=0.5</math>, corresponding to the usual <math>\sqrt{nd}</math> weighting, we end up dividing by the term <math>\zeta(1)</math>. This is the only pole in the zeta function, so we wind up dividing by infinity, making the entire function zero, as pointed out by Martin Gough. However, as we can get arbitrarily close to <math>w=0.5</math> and still exhibit the behavior that the unreduced and reduced functions are scaled versions of one another, we can simply use the unreduced version of exp-UHE for <math>w=0.5</math> and consider it equivalent to reduced exp-UHE in the limit.


=To Do=
== To Do ==
There are a number of things that need to be added to this article. Below are listed some for reference:
There are a number of things that need to be added to this article. Below are listed some for reference:


Line 764: Line 762:
* addition of many more pictures
* addition of many more pictures


=References=
== References ==
* [http://www.webcitation.org/60qOlJVFS Paul Erlich article]
* [http://www.webcitation.org/60qOlJVFS Paul Erlich article]
* [http://sethares.engr.wisc.edu/paperspdf/HarmonicEntropy.pdf William Sethares article]
* [http://sethares.engr.wisc.edu/paperspdf/HarmonicEntropy.pdf William Sethares article]