关于「《周礼》六梦、王符「十梦」、敦煌梦书与荣格的共时性」,《梦境意象、哈希牌卡与巧合基率》给出的定量结论是什么?

结论:一位分析师每年 1,000 次会谈,持续 25 年,大约听到 100,000 个「意象-小时」。如果某个意象在那一小时里出现在室内或窗外的概率是 20,000 分之一,一个职业生涯里预计有 5.00 次这样的事件,至少发生一次的概率是 0.993;即使是 1,000,000 分之一,概率仍有 0.095,而在 1,000 位分析师中会出现约 100 个这样的故事。单独一个惊人案例,无法把非因果原则与大量的机会区分开来。

数据口径:本书不主张梦或牌能预示任何事;意象图、事件率、记忆率与行为参数均为示意或合成模型;全部数据由书中程序生成;本书不是医疗或心理建议。 第六章的示意模型显示,牌对「行动瘫痪」的帮助(开始工作的概率从 0.584 到 0.740)与硬币相同,且不如「如果-就」计划。

English version

对照数据表

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

motif-hours in one career100,000
1 in20,000: expected 5.00, P(at least one) 0.993
stories among 1,000 analysts5,000
1 in100,000: expected 1.00, P(at least one) 0.632
stories among 1,000 analysts1,000
1 in 1,000,000: expected 0.10, P(at least one) 0.095
stories among 1,000 analysts100
查看完整验算程序
# Chapter 7. p14: Jung's scarab as a counting problem. An analyst sees
# 1,000 sessions a year for 25 years; in each, a patient reports a dream
# with 4 animal or object motifs. The chance that one of those things
# turns up in the room or at the window during that hour is taken as
# 1 in 20,000, 1 in 100,000 or 1 in 1,000,000 per motif (illustrative).
# Expected count and P(at least one) for one career, and the expected
# number of such stories among 1,000 analysts.
import math

if __name__ == "__main__":
    chances = 25 * 1000 * 4
    print("   motif-hours in one career: {:,}".format(chances))
    for odds in (20000, 100000, 1000000):
        lam = chances / odds
        print("   1 in {:>9,}: expected {:.2f}, P(at least one) {:.3f}"
              .format(odds, lam, 1 - math.exp(-lam)))
        print("                   stories among 1,000 analysts: {:,.0f}"
              .format(1000 * lam))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《梦境意象二分图、确定性哈希牌卡与潜意识先验激活》第 7 章「《周礼》六梦、王符「十梦」、敦煌梦书与荣格的共时性」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090233

DOI: 10.5281/zenodo.24090233 · 阅读本章所在专著 · 5DL-B-089 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026089,
  author    = {Fan, Yafu},
  title     = {Dream Motif Bipartite Graphs, Deterministic Oracle Decks and Subconscious Prior Activation},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090233},
  url       = {https://doi.org/10.5281/zenodo.24090233}
}

本书其他章节结论