5D Library › 黄历择吉布尔格、建除十二直同余与卢恩符文组合学 · English

第六章 逆位能说明什么,以及符文套组差异的影响

三个精确的推论

如果逆位在解读中有含义,那么在解释它之前就应当知道它出现的频率。从 15 个可逆符文可以直接推出三点。

推导

# Chapter 6. p11: What a reversal can and cannot say. Exact results for
# the Elder Futhark (15 of 24 runes reversible), drawing without
# replacement and turning each with probability 1/2: (1) the chance that
# a Norns reading of 3 shows no reversal, against 1/8 under the shortcut;
# (2) the chance that a given drawn rune is reversed, by aett (family of
# 8); (3) where reversed runes come from: no reversed rune can ever be
# one of the 9 symmetric runes, and Hagal's aett supplies only 2 of 15.
from fractions import Fraction
from math import comb

FUTHARK = ("Fehu Uruz Thurisaz Ansuz Raidho Kenaz Gebo Wunjo "
           "Hagalaz Naudhiz Isa Jera Eihwaz Perthro Algiz Sowilo "
           "Tiwaz Berkano Ehwaz Mannaz Laguz Ingwaz Dagaz Othala").split()
SAME_TURNED = {"Gebo", "Hagalaz", "Naudhiz", "Isa", "Jera", "Eihwaz",
               "Sowilo", "Ingwaz", "Dagaz"}

if __name__ == "__main__":
    p0 = sum(Fraction(comb(15, k) * comb(9, 3 - k), comb(24, 3)) *
             Fraction(1, 2 ** k) for k in range(4))
    print("   Norns reading with no reversal: {:.4f} (shortcut 0.125, "
          "ratio {:.2f})".format(float(p0), float(p0 / Fraction(1, 8))))
    for a in range(3):
        aett = FUTHARK[8 * a:8 * a + 8]
        rev = [r for r in aett if r not in SAME_TURNED]
        print("   aett {} ({:7s}): {} reversible, P(reversed) {:.4f}, "
              "share {:.3f}".format(a + 1, aett[0], len(rev),
                                    len(rev) / 16, len(rev) / 15))
    sym = [r for r in FUTHARK if r in SAME_TURNED]
    print("   symmetric runes: {}".format(", ".join(sym[:5])))
    print("                    {}".format(", ".join(sym[5:])))
#    Norns reading with no reversal: 0.3197 (shortcut 0.125, ratio 2.56)
#    aett 1 (Fehu   ): 7 reversible, P(reversed) 0.4375, share 0.467
#    aett 2 (Hagalaz): 2 reversible, P(reversed) 0.1250, share 0.133
#    aett 3 (Tiwaz  ): 6 reversible, P(reversed) 0.3750, share 0.400
#    symmetric runes: Gebo, Hagalaz, Naudhiz, Isa, Jera
#                     Eihwaz, Sowilo, Ingwaz, Dagaz

第一,命运三女神阵完全没有逆位(常被解读为「道路通畅」)的概率是 0.3197,是简化算法的 2.56 倍;所有三符文解读中将近三分之一看起来「通畅」。第二,逆位在三个 aett 之间分布并不均匀。第一族(Fehu 族)8 个中有 7 个可逆,抽出的符文逆位概率 0.4375;第二族(Hagalaz 族)只有 2 个,概率 0.1250;第三族(Tiwaz 族)6 个,概率 0.3750。第三,全部逆位符文中有 0.467 来自第一族,只有 0.133 来自第二族,九个对称符文永远不会以逆位出现。一位注意到「凶险的」第二族符文很少逆位的解读者,注意到的其实是它们的形状。

套组的差异有多大影响

卢恩套组并不统一。有的加入一块现代占卜推广的空白石,它不能逆位;有的制作者把符文刻得使 14 个或 16 个(而不是 15 个)倒过来看起来不同。

推导

# Chapter 6. p12: How much the answer depends on the rune set. Modern
# sets differ: some add a blank rune (25 stones, the blank never
# reversed), and makers draw some runes so that 14 or 16 of them look
# different turned over. For each variant: the mean number reversed in a
# Norns reading of 3, the chance of none, and the readings a sceptic
# would need to tell the exact law from the shortcut binomial (3, 1/2)
# by the mean, two-sided alpha 0.05, power 0.80.
import math
from fractions import Fraction
from math import comb
from statistics import NormalDist

def law(n, N, rev):
    p = [Fraction(0)] * (n + 1)
    for k in range(max(0, n - (N - rev)), min(n, rev) + 1):
        pk = Fraction(comb(rev, k) * comb(N - rev, n - k), comb(N, n))
        for r in range(k + 1):
            p[r] += pk * Fraction(comb(k, r), 2 ** k)
    return p

if __name__ == "__main__":
    z = NormalDist().inv_cdf(0.975) + NormalDist().inv_cdf(0.80)
    print("   stones reversible   mean    P(none)   readings to tell")
    for N, rev in ((24, 15), (24, 14), (24, 16), (25, 15)):
        p = law(3, N, rev)
        mean = float(sum(r * x for r, x in enumerate(p)))
        var = float(sum(r * r * x for r, x in enumerate(p))) - mean ** 2
        n = math.ceil((z * math.sqrt(var) / (1.5 - mean)) ** 2)
        print("   {:6d} {:9d}   {:.4f}   {:.4f}   {:8d}".format(
            N, rev, mean, float(p[0]), n))
#    stones reversible   mean    P(none)   readings to tell
#        24        15   0.9375   0.3197         16
#        24        14   0.8750   0.3498         13
#        24        16   1.0000   0.2915         21
#        25        15   0.9000   0.3378         14

24 个中 15 个可逆时,命运三女神阵的逆位均值是 0.9375,没有逆位的概率 0.3197。14 个可逆时,均值降到 0.8750,没有逆位升到 0.3498;16 个时是 1.0000 与 0.2915;在 15 个可逆符文之外加一块空白石,是 0.9000 与 0.3378。每种变体都远离简化算法的 1.5 与 0.125。一位怀疑者用逆位数的均值来比较实际与简化算法,只需记录 13 到 21 次命运三女神阵就能区分两者:简化算法并不是一个细微的错误。

假说 · 尚未验证

作者的诠释(尚未验证): 解读逆位的人,对以第一族符文为主的牌阵,会比对以第二族为主的牌阵报告更多「受阻」或「困难」的主题,原因只是第一族符文更常逆位。什么会证明它错: 在记录下来的解读中,以第一族为主与以第二族为主的牌阵,「困难」解读的比例没有差别。

小结

命运三女神阵没有逆位的概率是 0.3197,是简化算法的 2.56 倍。逆位大多来自第一族与第三族,因为第二族的大多数符文是对称的。套组的变体会使数字略有变化(均值 0.8750 到 1.0000),但没有一种接近简化算法。

Fan, Y. (2026). Almanac Auspicious Boolean Lattices, Jianchu Twelve-Officer Congruences and Runic Combinatorics: Constraint Satisfaction Paradoxes, Solar-Term Phase Jumps and Elder Futhark Inversion Distributions [黄历择吉布尔格、建除十二直同余与卢恩符文组合学] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090239 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).