What does Three-Second Thin-Slicing Trust conclude, in numbers, about “Maximum-Likelihood Integration: Several Channels Buy Precision, Not Multiplication”?

Answer: Chapter 2 shows that with three equally precise channels the standard deviation falls at most to 0.577, and that three channels combine to a discrimination of 1.044, only 1.305 times the best single channel.

Scope of the numbers: Parameters are illustrative and every number is printed by a program. Chapter 1 separates reliability from validity: under illustrative parameters a three-second judgement reaches 0.612 of its ceiling validity and agrees with the long-run evaluation in 0.579 of cases.

中文版

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: 1.044, 1.305

A. single channels: d' V/A/O0.8, 0.6, 0.3
d' 0.8: accuracy 0.655
d' 0.6: accuracy 0.618
d' 0.3: accuracy 0.560
B. three channels, equal noise correlation rho
rho d'_comb /best accuracy
0.01.044 1.305 0.699
0.30.885 1.106 0.671
0.60.869 1.086 0.668
C. slogans vs the bound (rho0)
naive sum of d'1.700
product of d'0.144
optimal1.044
D. two equal channels d' 0.8: combined 1.1310.8 x 1.414
Show the full program
# Chapter 2. p22: how much three channels add to telling a reliable seller
# from an unreliable one. Each channel separates the two kinds by d'_i in
# noise units; with noise correlation matrix S the optimal combined d' is
# sqrt(d' S^-1 d'). Independent noise gives sqrt(sum of d'_i^2): squares add,
# the d' values do not multiply. Accuracy of an unbiased two-way call is
# Phi(d'/2). The d' values and correlations are illustrative.
import math

D = (0.8, 0.6, 0.3)


def phi(x):
    return 0.5 * (1.0 + math.erf(x / math.sqrt(2.0)))


def solve(a, b):
    n = len(b)
    m = [list(a[i]) + [b[i]] for i in range(n)]
    for c in range(n):
        p = max(range(c, n), key=lambda r: abs(m[r][c]))
        m[c], m[p] = m[p], m[c]
        for r in range(n):
            if r != c:
                f = m[r][c] / m[c][c]
                m[r] = [x - f * y for x, y in zip(m[r], m[c])]
    return [m[i][n] / m[i][i] for i in range(n)]


def combined(d, rho):
    n = len(d)
    s = [[1.0 if i == j else rho for j in range(n)] for i in range(n)]
    x = solve(s, list(d))
    return math.sqrt(math.fsum(a * b for a, b in zip(d, x)))


if __name__ == "__main__":
    print("A. single channels: d' V/A/O = {}".format(
        ", ".join("{:.1f}".format(x) for x in D)))
    for x in D:
        print("   d' {:.1f}: accuracy {:.3f}".format(x, phi(x / 2.0)))
    print("B. three channels, equal noise correlation rho")
    print("   rho   d'_comb  /best   accuracy")
    for rho in (0.0, 0.3, 0.6):
        dc = combined(D, rho)
        print("   {:.1f}   {:.3f}    {:.3f}   {:.3f}".format(
            rho, dc, dc / max(D), phi(dc / 2.0)))
    print("C. slogans vs the bound (rho = 0)")
    print("   naive sum of d'  {:.3f}".format(math.fsum(D)))
    print("   product of d'    {:.3f}".format(D[0] * D[1] * D[2]))
    print("   optimal          {:.3f}".format(combined(D, 0.0)))
    two = combined((0.8, 0.8), 0.0)
    print("D. two equal channels d' 0.8: combined {:.3f} = 0.8 x {:.3f}"
          .format(two, two / 0.8))

Single source and citation

Fan, Y. (2026). Three-Second Thin-Slicing Trust: Visual-Auditory-Olfactory Congruence and Instant Authority Signalling (Version 1.0.0), Chapter 2: Maximum-Likelihood Integration: Several Channels Buy Precision, Not Multiplication. 5D Library. DOI pending

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

BibTeX
@book{fan2026419,
  author    = {Fan, Yafu},
  title     = {Three-Second Thin-Slicing Trust: Visual-Auditory-Olfactory Congruence and Instant Authority Signalling},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book