What does Most Conflicts Are Redundancy conclude, in numbers, about “Classical Sources East and West: the Xunzi on Correct Names and Book I of Euclid's Elements”?
Answer: The Xunzi's "the same are named the same, the different are named differently" and "where a single name does not suffice, a compound name is used" correspond to merging, separating and adding scope in a rule library. p71 shows compound names removing all 3 false conflicts, while only grouping by true meaning finds all 53 duplicate pairs. Xunzi gave no detailed criterion for sameness, and in particular did not treat one meaning written with two numbers. Book I of the Elements built all its propositions on a few postulates and common notions and pioneered the minimal primitive set; the independence of the fifth postulate needed models to be settled, and Hilbert supplied the assumptions Euclid had left tacit. p72 shows 8 of 9 rules redundant one at a time and yet impossible to delete together, with irredundant bases of three sizes, 4, 5 and 6. The classics gave a direction and modern mathematics a method. What remains is practice: how to fit these methods into monthly rule governance, and how to test the central claim of this book? The last chapter gives the routine and a pre-registered protocol.
Scope of the numbers: The rule libraries and values are illustrative; every calculation is generated by the book's programs; the book offers general business method, not legal, compliance or business-decision advice, and adding or deleting a rule must be released by its owner. Marked boxes separate published evidence, runnable Python calculations (19 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 53
| rules 30, bare names 8, meanings 9, duplicate pairs 53 | |||||
| meanings with 2+ names (synonyms): 3; names with 2+ meanings (homonyms): 3 | |||||
| key | groups | flagged | spurious | real | dup pairs found |
| bare name | 8 | 4 | 3 | 1 | 31 of 53 |
| name + scope | 12 | 1 | 0 | 1 | 31 of 53 |
| true meaning | 9 | 1 | 0 | 1 | 53 of 53 |
Show the full program
# Chapter 7. p71: "same then same, different then different" as keys
# Model: an illustrative library of 30 threshold rules, each written
# under a name, a scope and a value; the true meaning is known. The
# rules are grouped three ways: by the bare name (a single name), by
# name plus scope (a compound name), and by the true meaning. A group
# whose values differ is flagged; a flag is spurious when the values
# differ only because the group mixes meanings, and real when one
# meaning carries two values. A duplicate pair (same meaning, same
# value) is found only if both rules land in one group. Counts only;
# no randomness.
from collections import Counter
from itertools import combinations
LIB = [
("tap target", "any page", "tap", 44, 5),
("tap target", "purchase path", "tap_buy", 48, 3),
("touch area", "any page", "tap", 44, 2),
("follow-ups", "silent customer", "fu_silent", 2, 4),
("chasers", "silent customer", "fu_silent", 2, 2),
("follow-ups", "per quote", "fu_quote", 3, 1),
("reminders", "unpaid order", "pay_remind", 2, 2),
("reminders", "idle learner", "learn_remind", 2, 1),
("reminders", "abandoned cart", "cart_remind", 5, 1),
("quiet hours", "messages", "quiet", 21, 4),
("quiet hours", "messages", "quiet", 22, 1),
("silent hours", "messages", "quiet", 21, 1),
("pushes", "per week", "push_week", 4, 3),
]
rules = []
for name, scope, meaning, v, k in LIB:
rules += [(name, scope, meaning, v)] * k
def audit(keyf):
groups = {}
for r in rules:
groups.setdefault(keyf(r), []).append(r)
flagged = spurious = real = 0
for g in sorted(groups):
rs = groups[g]
if len({r[3] for r in rs}) > 1:
flagged += 1
by_m = {}
for r in rs:
by_m.setdefault(r[2], set()).add(r[3])
if any(len(vs) > 1 for vs in by_m.values()):
real += 1
else:
spurious += 1
dup_found = 0
for g in sorted(groups):
for a, b in combinations(groups[g], 2):
if a[2] == b[2] and a[3] == b[3]:
dup_found += 1
return len(groups), flagged, spurious, real, dup_found
dups = 0
for a, b in combinations(rules, 2):
if a[2] == b[2] and a[3] == b[3]:
dups += 1
names = Counter()
for name, scope, meaning, v, k in LIB:
names[(name, meaning)] += 0
per_meaning = Counter(m for (_, m) in names)
per_name = Counter(n for (n, _) in names)
print("rules %d, bare names %d, meanings %d, duplicate pairs %d"
% (len(rules), len(per_name), len(per_meaning), dups))
print("meanings with 2+ names (synonyms): %d; names with 2+ meanings"
" (homonyms): %d" % (len([m for m in per_meaning
if per_meaning[m] > 1]),
len([n for n in per_name if per_name[n] > 1])))
print("key groups flagged spurious real dup pairs found")
for label, f in (("bare name", lambda r: r[0]),
("name + scope", lambda r: (r[0], r[1])),
("true meaning", lambda r: r[2])):
g, fl, sp, re_, dp = audit(f)
print("%-13s %6d %7d %8d %4d %8d of %d"
% (label, g, fl, sp, re_, dp, dups))Single source and citation
Fan, Y. (2026). Cross-Volume Rule Resolution and Axiom Reduction: Detecting Threshold Conflicts among a Thousand Machine Rules and Finding a Minimal Primitive Set (Version 1.0.0), Chapter 7: Classical Sources East and West: the Xunzi on Correct Names and Book I of Euclid's Elements. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-258 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026258,
author = {Fan, Yafu},
title = {Cross-Volume Rule Resolution and Axiom Reduction: Detecting Threshold Conflicts among a Thousand Machine Rules and Finding a Minimal Primitive Set},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Most Conflicts among a Thousand Rules Are Redundancy
- Chapter 2 · Rules as Intervals: Deciding Threshold Conflicts Mechanically
- Chapter 3 · Conflict Graphs and Transitive Closure: Contradictions Hidden in Chains
- Chapter 4 · Prime Implicants: Merging Forty Narrow Prohibitions into Four Primitives
- Chapter 5 · Greedy Set Cover and ln n: Provable Bounds on a Minimal Primitive Set
- Chapter 6 · Judging Synonyms: Two Errors of Text Similarity, and Canonical Keys
- Chapter 8 · Closing the Loop: Plugging in the Pruner, Monthly Reduction and a Pre-Registered Test