关于「四步核查与一项预注册的配对检验」,《卦变与星宫的数学》给出的定量结论是什么?
结论:第八章给出四步核查与一项预注册的盲法配对检验(349 名参与者)。书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 349
participants needed: 349; reject 'chance' at 132 hits or more simulated power at a true hit rate of 0.40: 0.820 simulated false-positive rate at chance: 0.043 decision rule, one line per branch: 132 hits of 349: readings carry information about their owners 131 hits of 349: above chance but not significant: no claim 116 hits of 349: no sign of information: at or below chance
查看完整验算程序
# Chapter 8. A pre-registered matching test of a chart reading.
# Design (after Carlson's double-blind test of astrology): each
# participant gives birth data; the software, using ONE scoring convention
# fixed and published in advance, writes a reading; the participant sees
# their own reading and two readings written for other participants, in
# random order and without names, and picks the one that fits best. With
# no information in the readings the hit rate is 1/3. The claim tested is
# a hit rate of at least 0.40. One-sided exact binomial test, alpha 0.05,
# power 80 %. The program finds the sample size, checks it by
# simulation, and prints the decision rule.
import math
import random
def tail(n, p, k):
return sum(math.comb(n, j) * p ** j * (1 - p) ** (n - j)
for j in range(k, n + 1))
def critical(n, p0=1 / 3, alpha=0.05):
lo, hi = 0, n + 1
while lo < hi:
mid = (lo + hi) // 2
if tail(n, p0, mid) <= alpha:
hi = mid
else:
lo = mid + 1
return lo
def needed(p1=0.40, power=0.8):
n = 50
while tail(n, p1, critical(n)) < power:
n += 10
while n > 1 and tail(n - 1, p1, critical(n - 1)) >= power:
n -= 1
return n
def decide(hits, n):
k = critical(n)
if hits >= k:
return "readings carry information about their owners"
if hits <= n / 3:
return "no sign of information: at or below chance"
return "above chance but not significant: no claim"
if __name__ == "__main__":
n = needed()
k = critical(n)
print(" participants needed: {:,}; reject 'chance' at {} hits or more"
.format(n, k))
rng = random.Random(64016)
sims = [sum(rng.random() < 0.40 for _ in range(n)) for _ in range(4000)]
print(" simulated power at a true hit rate of 0.40: {:.3f}".format(
sum(s >= k for s in sims) / 4000))
sims0 = [sum(rng.random() < 1 / 3 for _ in range(n)) for _ in range(4000)]
print(" simulated false-positive rate at chance: {:.3f}".format(
sum(s >= k for s in sims0) / 4000))
print("\n decision rule, one line per branch:")
for hits in (k, k - 1, n // 3):
print(" {} hits of {:,}: {}".format(hits, n, decide(hits, n)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《六维超立方体游走、卦变马尔可夫链与模运算星宫晶格》第 8 章「四步核查与一项预注册的配对检验」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090176
DOI: 10.5281/zenodo.24090176 · 阅读本章所在专著 · 5DL-B-064 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026064,
author = {Fan, Yafu},
title = {Six-Dimensional Hypercube Walks, Hexagram Mutation Markov Chains and Modular Star-Palace Lattices},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090176},
url = {https://doi.org/10.5281/zenodo.24090176}
}