关于「信息量、重复与「总有特别之处」的基率」,《塔罗、雷诺曼与生命树的数学》给出的定量结论是什么?

结论:第五章计算信息量与多重比较:两次凯尔特十字至少共享一张牌的概率为 0.7689,随机牌阵具有八种常见特征中至少一种的概率为 0.9099。

数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

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

layout bits
3 cards, upright only18.80
3 cards with reversals21.80
Celtic Cross, reversals71.99
Lenormand Grand Tableau138.09
two Celtic Crosses: shared cards S
S0 0.2311
S1 0.3916
S2 0.2644
S3 0.0925
S4 0.0183
E[S]1.2821; P(S >= 1) = 0.7689; P(S >= 2) = 0.3773
a named card in r spreads of 10:
r1 P(at least once) = 0.1282
r3 P(at least once) = 0.3374
r5 P(at least once) = 0.4964
r10 P(at least once) = 0.7464
r20 P(at least once) = 0.9357
P(a Celtic Cross holds at least one major)0.9717
查看完整验算程序
# Chapter 5. p11: How much a spread can say, and how often cards repeat.
# (1) Information: log2 of the number of distinguishable layouts.
# (2) Repeats: two independent 10-card spreads from a full deck share
#     S cards, S hypergeometric with mean 100/78. "The same card again"
#     is the rule, not the exception.
# (3) Over a run of readings: P(a named card appears at least once in
#     r spreads of 10).
from fractions import Fraction
from math import comb, factorial, log2

def bits(n):
    return log2(n)

if __name__ == "__main__":
    rows = [("3 cards, upright only", 78 * 77 * 76),
            ("3 cards with reversals", 78 * 77 * 76 * 8),
            ("Celtic Cross, reversals",
             factorial(78) // factorial(68) * 2 ** 10),
            ("Lenormand Grand Tableau", factorial(36))]
    print("   layout                     bits")
    for name, n in rows:
        print("   {:24s} {:7.2f}".format(name, bits(n)))
    share = [Fraction(comb(10, s) * comb(68, 10 - s), comb(78, 10))
             for s in range(11)]
    mean = sum(s * p for s, p in enumerate(share))
    print("\n   two Celtic Crosses: shared cards S")
    for s in range(5):
        print("     S = {}  {:.4f}".format(s, float(share[s])))
    print("   E[S] = {:.4f}; P(S >= 1) = {:.4f}; P(S >= 2) = {:.4f}".format(
        float(mean), float(1 - share[0]), float(1 - share[0] - share[1])))
    print("\n   a named card in r spreads of 10:")
    for r in (1, 3, 5, 10, 20):
        p = 1 - (Fraction(68, 78)) ** r
        print("     r = {:2d}  P(at least once) = {:.4f}".format(r, float(p)))
    one_of_22 = 1 - Fraction(comb(56, 10), comb(78, 10))
    print("   P(a Celtic Cross holds at least one major) = {:.4f}".format(
        float(one_of_22)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《塔罗超几何抽样、雷诺曼网格拓扑与卡巴拉生命树图论》第 5 章「信息量、重复与「总有特别之处」的基率」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090191

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

BibTeX
@book{fan2026071,
  author    = {Fan, Yafu},
  title     = {Tarot Hypergeometric Sampling, Lenormand Grid Topology and Kabbalistic Tree Graphs},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090191},
  url       = {https://doi.org/10.5281/zenodo.24090191}
}

本书其他章节结论