关于「九类错账的检出矩阵:试算平衡抓得住什么、放得过什么」,《四柱复式守恒代数》给出的定量结论是什么?
结论:表中「cases」一列是每类错误在这一天能生成的全部形态数。十二笔分录可以各漏一次、各重复一次、各颠倒一次;串户要把每一条借贷腿改到每一个不在该分录里的账户上,共 172 种;互相抵消要从两笔不同分录里各挑一条腿,一条加十元、一条减十元,共 286 种。九类合计 581 种。
数据口径:本书用可运行的程序说明,单式流水本身不含任何检验:在一个示意日上漏记一笔 1,500.00 元的尾款,表格依旧自洽,只有拿银行余额来比才出现差额。 书中参数为示意;全部计算由书中程序生成;本书属于非个人化的会计、税务或法律建议。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 172, 286, 581
| type | cases | FP | TB | DE | LOC |
|---|---|---|---|---|---|
| omit entry | 12 | 0.833 | 0.000 | 1.000 | 1.000 |
| duplicate | 12 | 0.833 | 0.000 | 1.000 | 1.000 |
| wrong acct | 172 | 0.436 | 0.000 | 0.948 | 0.948 |
| reversal | 12 | 0.833 | 0.000 | 1.000 | 1.000 |
| x10 both | 12 | 0.833 | 0.000 | 1.000 | 1.000 |
| compensate | 286 | 0.490 | 0.000 | 0.780 | 0.780 |
| omit leg | 25 | 0.400 | 1.000 | 1.000 | 0.880 |
| slip leg | 25 | 0.400 | 1.000 | 1.000 | 0.880 |
| same side | 25 | 0.400 | 1.000 | 1.000 | 0.880 |
| all | 581 | 0.491 | 0.129 | 0.876 | 0.861 |
查看完整验算程序
# Chapter 2. p21: the detection matrix of nine error types, enumerated.
# Model: the illustrative day of p12. Every error of each type is
# generated exhaustively on that day and the damaged books are run
# through four schemes (FP four pillars on counted cash, TB trial
# balance, DE trial balance plus outside evidence for CASH, STOCK, AR,
# DEP and SHIP; the single-entry list never fires and is not shown).
# LOC = share of cases in which DE names at least one wrong account.
# Error types follow the textbook list of errors a trial balance does
# not reveal, plus the one-sided slips it does reveal. Exact integers.
from itertools import combinations
ACCTS = ("CASH", "STOCK", "AR", "DEP", "REV", "COGS", "FX", "SHIP",
"CAP")
EXT = ("CASH", "STOCK", "AR", "DEP", "SHIP")
OPEN = {"CASH": 1500000, "STOCK": 420000, "AR": 0, "DEP": -380000,
"REV": 0, "COGS": 0, "FX": 0, "SHIP": 0, "CAP": -1540000}
DAY = (
(("CASH", 60000), ("DEP", -60000)),
(("CASH", 45000), ("DEP", -45000)),
(("STOCK", 178560), ("CASH", -178560)),
(("FX", 1240), ("CASH", -1240)),
(("SHIP", 12000), ("CASH", -12000)),
(("DEP", 80000), ("AR", 150000), ("REV", -230000)),
(("COGS", 170000), ("STOCK", -170000)),
(("CASH", 150000), ("AR", -150000)),
(("DEP", 20000), ("CASH", -20000)),
(("STOCK", 96300), ("CASH", -96300)),
(("SHIP", 3500), ("CASH", -3500)),
(("CASH", 30000), ("DEP", -30000)),
)
def post(entries):
bal = dict(OPEN)
for legs in entries:
for acct, amt in legs:
bal[acct] += amt
return bal
def swap_digits(n):
s = str(abs(n))
for i in range(len(s) - 1):
if s[i] != s[i + 1]:
t = s[:i] + s[i + 1] + s[i] + s[i + 2:]
return int(t) if n > 0 else -int(t)
return n
def legs_of():
return [(i, j) for i, legs in enumerate(DAY) for j in range(len(legs))]
def edit(i, legs):
return DAY[:i] + (tuple(legs),) + DAY[i + 1:]
def cases():
out = {}
out["omit entry"] = [DAY[:i] + DAY[i + 1:] for i in range(len(DAY))]
out["duplicate"] = [DAY[:i + 1] + DAY[i:] for i in range(len(DAY))]
out["reversal"] = [edit(i, [(a, -m) for a, m in DAY[i]])
for i in range(len(DAY))]
out["x10 both"] = [edit(i, [(a, 10 * m) for a, m in DAY[i]])
for i in range(len(DAY))]
om, sl, ss, wr = [], [], [], []
for i, j in legs_of():
legs = list(DAY[i])
a, m = legs[j]
om.append(edit(i, legs[:j] + legs[j + 1:]))
sl.append(edit(i, legs[:j] + [(a, swap_digits(m))] + legs[j + 1:]))
ss.append(edit(i, legs[:j] + [(a, -m)] + legs[j + 1:]))
for b in ACCTS:
if b not in [x for x, _ in legs]:
wr.append(edit(i, legs[:j] + [(b, m)] + legs[j + 1:]))
out["wrong acct"] = wr
out["omit leg"] = om
out["slip leg"] = sl
out["same side"] = ss
comp = []
for (i, j), (k, l) in combinations(legs_of(), 2):
if i == k:
continue
d = list(DAY)
a, m = d[i][j]
d[i] = d[i][:j] + ((a, m + 1000),) + d[i][j + 1:]
b, n = d[k][l]
d[k] = d[k][:l] + ((b, n - 1000),) + d[k][l + 1:]
comp.append(tuple(d))
out["compensate"] = comp
return out
def rate(k, n):
return "{:.3f}".format(k / n)
if __name__ == "__main__":
truth = post(DAY)
order = ("omit entry", "duplicate", "wrong acct", "reversal",
"x10 both", "compensate", "omit leg", "slip leg",
"same side")
allc = cases()
print("type cases FP TB DE LOC")
tot = [0, 0, 0, 0, 0]
for name in order:
fp = tb = de = loc = 0
for entries in allc[name]:
book = post(entries)
s = 0
for a in ACCTS:
s += book[a]
flagged = [a for a in EXT if book[a] != truth[a]]
fp += book["CASH"] != truth["CASH"]
tb += s != 0
de += (s != 0) or bool(flagged)
loc += bool(flagged)
n = len(allc[name])
for idx, v in enumerate((n, fp, tb, de, loc)):
tot[idx] += v
print("{:11s} {:6d} {:>6s} {:>6s} {:>6s} {:>6s}".format(
name, n, rate(fp, n), rate(tb, n), rate(de, n), rate(loc, n)))
n = tot[0]
print("{:11s} {:6d} {:>6s} {:>6s} {:>6s} {:>6s}".format(
"all", n, rate(tot[1], n), rate(tot[2], n), rate(tot[3], n),
rate(tot[4], n)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《四柱结算与复式记账的守恒代数、代购流水零差错对账不变量母典》第 2 章「九类错账的检出矩阵:试算平衡抓得住什么、放得过什么」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-318 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026318,
author = {Fan, Yafu},
title = {The Conservation Algebra of Four-Pillar Settlement and Double-Entry Bookkeeping: Invariants for Error-Free Reconciliation of Buying-Agent Ledgers},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}