What does Maximum-Entropy Demand Reconstruction conclude, in numbers, about “The Lagrange Multiplier of Maximum Entropy: the Truncated Exponential When Only a Mean and Bounds Are Known”?

Answer: The closer the mean sits to the lower bound, the worse the normal shortcut becomes. With a mean of 40 it puts 0.412 of its probability below 30, and its 10th percentile is a negative order value of \(-17.7\), impossible in any shop. With a mean of 50 that share is 0.328, and with a mean of 80 it is still 0.133. Meanwhile the gap between the two answers for the 90th percentile is \(-44.6\) at a mean of 40, where the normal overstates the upper tail, and 55.6 at a mean of 130, where it understates it; somewhere in between the gap passes through zero. At a mean of 80 the gap is only 8.4, which shows that at certain points the normal shortcut's upper-tail figure happens to be passable. Chapter 3 deals with this directly: the figure is passable because two errors cancel, not because the shortcut has better grounds.

Scope of the numbers: The normal shortcut adds a symmetric shape and a standard deviation; under illustrative parameters, with a mean of 80 and a floor of 30, it puts 0.133 of its probability on impossible values, rising to 0.412 when the mean is 40. Accepting only the bounds and the mean, the maximum-entropy principle proposed by Jaynes in 1957 gives a truncated exponential distribution, with a 90th-percentile order of 146.0 for the illustrative dessert shop.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: -17.7, -44.6, 0.133, 0.328, 0.412, 10

bounds [30, 300]; shortcut = normal(m, 45)
m(m-a)/(b-a)ME P10ME P90N P10N P90N<aN>bP90 gap
400.03731.153.0-17.797.70.4120.000-44.6
500.07432.176.1-7.7107.70.3280.000-31.6
650.13033.7110.77.3122.70.2180.000-11.9
800.18535.4146.022.3137.70.1330.0008.4
1000.25938.1191.842.3157.70.0600.00034.1
1300.37043.9243.272.3187.70.0130.00055.6
1650.50057.0273.0107.3222.70.0010.00150.3
Show the full program
# Chapter 1. p13: how far the normal shortcut strays as the mean moves.
# Model: bounds a = 30, b = 300 (illustrative order values). For each
# stated mean m we compare the maximum-entropy answer (truncated
# exponential, lam found by bisection) with the common shortcut
# normal(m, (b - a) / 6). We report P10 and P90 of both, the share of
# the normal that falls below a or above b (values the owner said are
# impossible), and the gap between the two P90s.
import math
from statistics import NormalDist

A, B = 30.0, 300.0
L = B - A


def te_mean(lam):
    u = lam * L
    if abs(u) < 1e-8:
        return A + L / 2.0 - lam * L * L / 12.0
    return A + 1.0 / lam - L / math.expm1(u)


def solve(m):
    lo, hi = -2.0, 2.0
    for _ in range(80):
        mid = (lo + hi) / 2.0
        if te_mean(mid) > m:
            lo = mid
        else:
            hi = mid
    lam = (lo + hi) / 2.0
    return 0.0 if abs(lam) < 1e-9 else lam


def te_q(lam, p):
    if abs(lam * L) < 1e-12:
        return A + p * L
    return A - math.log1p(p * math.expm1(-lam * L)) / lam


if __name__ == "__main__":
    sd = L / 6.0
    print("bounds [30, 300]; shortcut = normal(m, {:.0f})".format(sd))
    print("    m  (m-a)/(b-a)  ME P10  ME P90  N P10  N P90"
          "  N<a    N>b   P90 gap")
    for m in (40.0, 50.0, 65.0, 80.0, 100.0, 130.0, 165.0):
        lam = solve(m)
        nd = NormalDist(m, sd)
        e10, e90 = te_q(lam, 0.1), te_q(lam, 0.9)
        n10, n90 = nd.inv_cdf(0.1), nd.inv_cdf(0.9)
        lo, hi = nd.cdf(A), 1.0 - nd.cdf(B)
        print("  {:>3.0f}  {:>11.3f}  {:>6.1f}  {:>6.1f}  {:>5.1f}  {:>5.1f}"
              "  {:.3f}  {:.3f}  {:>7.1f}".format(
                  m, (m - A) / L, e10, e90, n10, n90, lo, hi, e90 - n90))

Single source and citation

Fan, Y. (2026). The Maximum-Entropy Principle and Demand Reconstruction from Missing Data: the Least-Biased Order-Value Distribution Given Only a Mean and Bounds (Version 1.0.0), Chapter 1: The Lagrange Multiplier of Maximum Entropy: the Truncated Exponential When Only a Mean and Bounds Are Known. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-301 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026301,
  author    = {Fan, Yafu},
  title     = {The Maximum-Entropy Principle and Demand Reconstruction from Missing Data: the Least-Biased Order-Value Distribution Given Only a Mean and Bounds},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book