关于「《形成之书》、基歇尔之树与韦特牌序」,《塔罗、雷诺曼与生命树的数学》给出的定量结论是什么?

结论:第七章与《形成之书》、基歇尔的生命树与韦特 1910 年的牌序并读:基歇尔按字母表顺序分配字母,只有 11 个落在与其三、七、十二分类相符的路径上。

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

English version

对照数据表

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

path shapes3 horizontal, 7 vertical, 12 diagonal
horizontal paths carrying a letter of that class0 of 3
vertical paths carrying a letter of that class3 of 7
diagonal paths carrying a letter of that class8 of 12
Kircher order11 of 22 letters match
expected under a random lettering101/11 = 9.182
letterings with every class on its shape14,485,008,384,000
share of all 22! letterings1.289 x 10^-8
gates (unordered letter pairs): C(22, 2)231
Marseille Strength 11, Justice8: card n on path n + 11 for 20 of 22
Waite 1910 Strength8, Justice 11: card n on path n + 11 for 22 of 22
path 19 = teth, path 22 = lamed
查看完整验算程序
# Chapter 7. p15: Three mothers, seven doubles, twelve simples - letters
# on the paths of the Kircher tree, and the Waite swap.
# Sefer Yetzirah divides the 22 letters into 3 mothers (aleph, mem, shin),
# 7 doubles (beth, gimel, daleth, kaph, pe, resh, tav) and 12 simples.
# The tree has 3 horizontal, 7 vertical and 12 diagonal paths. Kircher
# lettered the paths in order (aleph on 1-2, beth on 1-3, ...). How many
# letters fall on a path of "their" geometric type, against chance?
# Then: the 231 "gates" (pairs of letters), and what changes when Waite
# (1910) gives Strength the number 8 and Justice 11.
from fractions import Fraction
from math import comb, factorial

PATHS = [(1, 2), (1, 3), (1, 6), (2, 3), (2, 6), (2, 4), (3, 6), (3, 5),
         (4, 5), (4, 6), (4, 7), (5, 6), (5, 8), (6, 7), (6, 9), (6, 8),
         (7, 8), (7, 9), (7, 10), (8, 9), (8, 10), (9, 10)]
LETTERS = ["aleph", "beth", "gimel", "daleth", "he", "vav", "zayin",
           "heth", "teth", "yod", "kaph", "lamed", "mem", "nun", "samekh",
           "ayin", "pe", "tsadi", "qoph", "resh", "shin", "tav"]
MOTHER = {"aleph", "mem", "shin"}
DOUBLE = {"beth", "gimel", "daleth", "kaph", "pe", "resh", "tav"}
COLUMN = {1: 1, 2: 2, 3: 0, 4: 2, 5: 0, 6: 1, 7: 2, 8: 0, 9: 1, 10: 1}
LEVEL = {1: 0, 2: 1, 3: 1, 4: 2, 5: 2, 6: 3, 7: 4, 8: 4, 9: 5, 10: 6}

def shape(a, b):
    if LEVEL[a] == LEVEL[b]:
        return "horizontal"
    return "vertical" if COLUMN[a] == COLUMN[b] else "diagonal"

def kind(letter):
    if letter in MOTHER:
        return "horizontal"
    return "vertical" if letter in DOUBLE else "diagonal"

if __name__ == "__main__":
    shapes = [shape(a, b) for a, b in PATHS]
    print("   path shapes: " + ", ".join(
        "{} {}".format(shapes.count(s), s)
        for s in ("horizontal", "vertical", "diagonal")))
    match = [kind(l) == s for l, s in zip(LETTERS, shapes)]
    for s, size in (("horizontal", 3), ("vertical", 7), ("diagonal", 12)):
        k = sum(m for m, x in zip(match, shapes) if x == s)
        print("   {:10s} paths carrying a letter of that class: {} of {}"
              .format(s, k, size))
    print("   Kircher order: {} of 22 letters match".format(sum(match)))
    exp = Fraction(3 * 3 + 7 * 7 + 12 * 12, 22)
    print("   expected under a random lettering: {} = {:.3f}".format(
        exp, float(exp)))
    full = factorial(3) * factorial(7) * factorial(12)
    print("   letterings with every class on its shape: {:,}".format(full))
    print("   share of all 22! letterings: {:.3f} x 10^-8".format(
        full / factorial(22) * 1e8))
    print("   gates (unordered letter pairs): C(22, 2) = {}".format(
        comb(22, 2)))
    # Golden Dawn letters by symbol: teth (Leo) for Strength, lamed
    # (Libra) for Justice; every other major n sits on path n + 11.
    gd = {"Strength": 19, "Justice": 22}
    for name, numbers in (("Marseille", {"Strength": 11, "Justice": 8}),
                          ("Waite 1910", {"Strength": 8, "Justice": 11})):
        ok = 20 + sum(numbers[c] + 11 == gd[c] for c in gd)
        print("   {:10s} Strength {:2d}, Justice {:2d}: card n on path n + 11"
              " for {} of 22".format(name, numbers["Strength"],
                                     numbers["Justice"], ok))
    print("   path 19 = {}, path 22 = {}".format(LETTERS[8], LETTERS[11]))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《塔罗超几何抽样、雷诺曼网格拓扑与卡巴拉生命树图论》第 7 章「《形成之书》、基歇尔之树与韦特牌序」(版本 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}
}

本书其他章节结论