What does Most Conflicts Are Redundancy conclude, in numbers, about “Conflict Graphs and Transitive Closure: Contradictions Hidden in Chains”?
Answer: Switch rules form a conflict graph in which implication is transitive and exclusion spreads along implication. In the illustrative library of p31, 4 written exclusions become 6 after closure, and two dead rules emerge, the same-day launch and the evergreen page; the latter is the formal reason why a resetting countdown is always a violation. Random libraries show derived exclusions and dead rules multiplying a hundredfold once the mean out-degree passes one. p32 shows that restatements declared in both directions shrink 280 rules to 40 synonym classes and 617 links to a skeleton of 71, while each tenth of declarations left out adds about twenty singleton classes. Graph theory tells us which rules are equivalent and which redundant, but it works rule by rule. When dozens of prohibitions each forbid one narrow combination, and together amount to a few broad prohibitions, the graph cannot see it. How can they be merged into the fewest primitives? The next chapter calls on Quine and McCluskey.
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: 280, 40, 617, 71
| K=40 meanings, 6 restatements each, 60 redundant shortcuts | ||||||
| p_both | rules | edges | classes | singletons | skeleton | saved |
| 1.0 | 280 | 617 | 40 | 0 | 71 | 0.885 |
| 0.9 | 280 | 596 | 61 | 21 | 95 | 0.841 |
| 0.8 | 280 | 570 | 87 | 47 | 117 | 0.795 |
| 0.6 | 280 | 530 | 127 | 87 | 161 | 0.696 |
| rules = meanings + restatements; saved = 1 - skeleton / edges |
Show the full program
# Chapter 3. p32: synonym classes and the minimal implication skeleton
# Model: K hidden meanings linked by a random acyclic "forces" order;
# each meaning is restated by several writers. A restatement linked
# both ways to its original (declared "same as") falls in the same
# strongly connected class; one linked only one way does not. Classes
# come from the transitive closure (i ~ j iff each reaches the other);
# the skeleton is the transitive reduction of the class graph (Aho,
# Garey and Ullman 1972): edge A -> B is kept iff no third class C
# lies on a path A -> C -> B. Sizes and rates are illustrative; one
# fixed seed. Reachability rows are integers used as bit sets.
import random
def closure(n, imp):
reach = [1 << i for i in range(n)]
for a, b in imp:
reach[a] |= 1 << b
for k in range(n):
bit = 1 << k
rk = reach[k]
for i in range(n):
if reach[i] & bit:
reach[i] |= rk
return reach
def classes(n, reach):
rep = [-1] * n
for i in range(n):
if rep[i] < 0:
for j in range(i, n):
if rep[j] < 0 and (reach[i] >> j) & 1 \
and (reach[j] >> i) & 1:
rep[j] = i
return rep
def reduction(n, reach, rep):
reps = sorted(set(rep))
keep = 0
for a in reps:
for b in reps:
if a == b or not (reach[a] >> b) & 1:
continue
via = False
for c in reps:
if c not in (a, b) and (reach[a] >> c) & 1 \
and (reach[c] >> b) & 1:
via = True
break
if not via:
keep += 1
return keep
def library(rng, k, copies, p_both, extra):
imp = []
order = list(range(k))
for b in range(1, k):
for a in rng.sample(range(b), min(b, 2)):
imp.append((order[a], order[b]))
n = k
for m in range(k):
for _ in range(copies):
imp.append((n, m))
if rng.random() < p_both:
imp.append((m, n))
n += 1
for _ in range(extra):
a, b = sorted(rng.sample(range(k), 2))
imp.append((a, b))
return n, imp
rng = random.Random(20261113)
print("K=40 meanings, 6 restatements each, 60 redundant shortcuts")
print("p_both rules edges classes singletons skeleton saved")
for p in (1.0, 0.9, 0.8, 0.6):
n, imp = library(rng, 40, 6, p, 60)
reach = closure(n, imp)
rep = classes(n, reach)
nc = len(set(rep))
single = 0
for r in sorted(set(rep)):
if rep.count(r) == 1:
single += 1
sk = reduction(n, reach, rep)
print(" %.1f %5d %5d %7d %10d %8d %.3f"
% (p, n, len(imp), nc, single, sk, 1 - sk / len(imp)))
print("rules = meanings + restatements; saved = 1 - skeleton / edges")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 3: Conflict Graphs and Transitive Closure: Contradictions Hidden in Chains. 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 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 7 · Classical Sources East and West: the Xunzi on Correct Names and Book I of Euclid's Elements
- Chapter 8 · Closing the Loop: Plugging in the Pruner, Monthly Reduction and a Pre-Registered Test