5D Library › 塔罗超几何抽样、雷诺曼网格拓扑与卡巴拉生命树图论 · English

第七章 《形成之书》、基歇尔之树与韦特牌序

为什么在这里读这些原典

前几章的结构都有文本来源:二十二个字母与它们的分类来自《形成之书》(Sefer Yetzirah);十个节点与二十二条路径的形状来自基歇尔;路径、字母与大阿卡纳的对应来自十九世纪末的金色黎明会;正逆位的系统化解释与凯尔特十字牌阵则见于埃特拉与韦特。本章核对这些文本中可以写成计数的部分。

《形成之书》:三、七、十二

原典

《形成之书》第二章(作者译)

二十二个基础字母:三个母字母,七个双音字母,十二个单字母。

同章又说这些字母两两相配,构成二百三十一道「门」。(Kaplan 1997)

三个母字母是 aleph、mem、shin;七个双音字母是 beth、gimel、daleth、kaph、pe、resh、tav;其余十二个为单字母。二百三十一正是从 22 个字母中取 2 个的组合数 (222)\binom{22}{2}。

基歇尔的生命树有一个与此对应的几何事实:22 条路径中恰好 3 条水平、7 条垂直、12 条斜向。若按几何类型分配字母,母字母应在水平路径上,双音字母在垂直路径上,单字母在斜向路径上。基歇尔却是按字母表顺序沿路径编号逐一分配的(aleph 在 1-2,beth 在 1-3,依此类推)。

推导

# 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]))
#    path shapes: 3 horizontal, 7 vertical, 12 diagonal
#    horizontal paths carrying a letter of that class: 0 of 3
#    vertical   paths carrying a letter of that class: 3 of 7
#    diagonal   paths carrying a letter of that class: 8 of 12
#    Kircher order: 11 of 22 letters match
#    expected under a random lettering: 101/11 = 9.182
#    letterings with every class on its shape: 14,485,008,384,000
#    share of all 22! letterings: 1.289 x 10^-8
#    gates (unordered letter pairs): C(22, 2) = 231
#    Marseille  Strength 11, Justice  8: card n on path n + 11 for 20 of 22
#    Waite 1910 Strength  8, Justice 11: card n on path n + 11 for 22 of 22
#    path 19 = teth, path 22 = lamed

在基歇尔的次序下,3 条水平路径上没有一个母字母,7 条垂直路径中有 3 条是双音字母,12 条斜向路径中有 8 条是单字母,合计 22 个中 11 个与几何类型相符。若随机分配字母,相符个数的期望为 101/11,约 9.182。因此基歇尔的分配只比随机略好,看不出按 3、7、12 分类布置的意图;使三类全部各就其位的分配有 14,485,008,384,000 种,只占全部 22!22! 种分配的 1.289×10−81.289 \times 10^{-8}。

证据

已核实: 基歇尔在《埃及的俄狄浦斯》中按顺序为路径编号并标注字母,金色黎明会沿用了他的树形与字母标注,但改动了行星对应 (Kircher 1652; Decker et al. 1996)。按几何类型分配字母的生命树是另一种传统,不是基歇尔的版本。

埃特拉与韦特:正逆位与牌序

把塔罗用于占卜并为每张牌写出正位与逆位两种含义,是十八世纪八十年代埃特拉开创的做法 (Decker et al. 1996)。第二章已经说明,逆位的统计性质取决于翻牌动作,而不取决于牌义。

金色黎明会把大阿卡纳按编号放上路径:第 nn 号牌在第 n+11n + 11 条路径上,愚人(0)在 aleph。但按星象对应,力量(狮子座)应配 teth(第 19 条路径),正义(天秤座)应配 lamed(第 22 条路径),而马赛牌中正义是 8 号、力量是 11 号。韦特在 1910 年的书中把两张牌的编号对调:

原典

韦特《塔罗图解》(1910)力量牌条下

this card has been interchanged with that of justice, which is usually numbered eight.

(Waite 1910)

程序显示,在马赛编号下,「第 nn 号牌在第 n+11n + 11 条路径」只对 22 张中的 20 张成立;韦特对调之后对全部 22 张成立。韦特没有改变任何字母与牌的对应,只是让印在牌上的数字与路径次序重新一致。凯尔特十字也载于这本书,题为「一种古老的凯尔特占卜法」(Waite 1910)。

小结

《形成之书》的 3、7、12 分类与生命树的 3 条水平、7 条垂直、12 条斜向路径在数目上完全对应,但基歇尔按字母表顺序分配字母,只有 11 个字母落在与其分类相符的路径上,接近随机的 9.182。韦特 1910 年的 8 与 11 对调,使牌号与路径次序对全部 22 张一致。

参考文献

Decker, Ronald, Thierry Depaulis, and Michael Dummett. 1996. A Wicked Pack of Cards: The Origins of the Occult Tarot. Duckworth.
Kaplan, Aryeh. 1997. Sefer Yetzirah: The Book of Creation in Theory and Practice. Revised. Weiser.
Kircher, Athanasius. 1652. Oedipus Aegyptiacus. Vitale Mascardi.
Waite, Arthur Edward. 1910. The Pictorial Key to the Tarot. William Rider & Son.

Fan, Y. (2026). Tarot Hypergeometric Sampling, Lenormand Grid Topology and Kabbalistic Tree Graphs: Reversal Binomial Mixtures, Grand-Tableau Manhattan Distances and Twenty-Two-Edge Spectral Centrality [塔罗超几何抽样、雷诺曼网格拓扑与卡巴拉生命树图论] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090191 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).