关于「原典考辨:《韩非子·说难》与富兰克林的道德代数」,《异议柔道与定金锁单》给出的定量结论是什么?

结论:第七章考辨《韩非子·说难》与富兰克林的道德代数:称四天的决定一致率达到 0.8275。

数据口径:书中的顾客群、概率与金额均为示意;全部计算由书中程序生成;本书不构成个人化的法律、财务或投资建议,只讨论守规矩的说服。 第一章的判别树说明,在示意先验下,说「太贵了」的人有 0.734 并不缺钱。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.8275

days of weighingagreement with true-weight decision
10.7175
20.7764
30.8046
40.8275
count only (ties by coin, 0.247 tied)0.6821
one striking item0.6338
查看完整验算程序
# Chapter 7. p72: Franklin's "moral or prudential algebra" (letter to
# Joseph Priestley, 1772): list pros and cons, weigh them, strike out
# items of equal weight, and take three or four days over it. A model:
# 5 pros and 5 cons with true weights U(0, 1). Each day the decider
# re-estimates every weight with error N(0, 0.35) and averages the days
# so far. How often does the averaged list agree with the true-weight
# decision? Compared with a count-only list and with deciding on one
# striking item. Fixed-seed Monte Carlo, 20,000 decisions; illustrative.
import math
import random

M, SD, TRIALS = 5, 0.35, 20000
rng = random.Random(20261112)
agree = [0] * 5
count_ok = gut_ok = ties = 0
for _ in range(TRIALS):
    pro = [rng.random() for _ in range(M)]
    con = [rng.random() for _ in range(M)]
    truth = math.fsum(pro) > math.fsum(con)
    est_p = [[] for _ in range(M)]
    est_c = [[] for _ in range(M)]
    for day in range(1, 5):
        for i in range(M):
            est_p[i].append(pro[i] + rng.gauss(0, SD))
            est_c[i].append(con[i] + rng.gauss(0, SD))
        sp = math.fsum(math.fsum(e) / day for e in est_p)
        sc = math.fsum(math.fsum(e) / day for e in est_c)
        agree[day] += (sp > sc) == truth
    # count-only: an item "counts" if its first estimate exceeds 0.5
    npro = len([e for e in est_p if e[0] > 0.5])
    ncon = len([e for e in est_c if e[0] > 0.5])
    if npro == ncon:
        ties += 1
        count_ok += rng.random() < 0.5 and 1 or 0
    else:
        count_ok += (npro > ncon) == truth
    # one striking item: the largest single first-day estimate decides
    bp = max(e[0] for e in est_p)
    bc = max(e[0] for e in est_c)
    gut_ok += (bp > bc) == truth
print("days of weighing   agreement with true-weight decision")
for day in range(1, 5):
    print("{:>16} {:>14.4f}".format(day, agree[day] / TRIALS))
print("count only (ties by coin, {:.3f} tied) {:>9.4f}".format(
    ties / TRIALS, count_ok / TRIALS))
print("one striking item {:>23.4f}".format(gut_ok / TRIALS))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《顾问式销售异议柔道、价格嫌贵贝叶斯拆解与定金锁单停时协议》第 7 章「原典考辨:《韩非子·说难》与富兰克林的道德代数」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-146 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026146,
  author    = {Fan, Yafu},
  title     = {Consultative Objection Judo, a Bayesian Decomposition of "Too Expensive" and Deposit-Lock Stopping-Time Protocols},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论