What does Most Conflicts Are Redundancy conclude, in numbers, about “Rules as Intervals: Deciding Threshold Conflicts Mechanically”?

Answer: Chapter 2 shows one-dimensional thresholds decided in one sweep, constraints between two quantities needing negative-cycle detection, and floating point inventing false conflicts on 0.1151 of boundary pairs.

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: 0.1151

A. lower bound a + b against upper bound c = a + b, 9801 pairs
float says conflict (false)1128 share 0.1151
float says slack below c978 share 0.0998
exact Fraction says conflict0
B. percent / 100 differs from the written decimal261 of 999
C. three-term bounds 0.01 to 0.49, 117649 triples
naive float addition disagrees31633 share 0.2689
math.fsum of the floats19085 share 0.1622
Show the full program
# Chapter 2. p23: binary floating point invents and hides conflicts
# Model: two rules meet exactly on a boundary, "x >= a + b" (a bound
# computed from two written decimals) and "x <= c" with c = a + b in
# decimal. Exact arithmetic says the pair is feasible (a single
# point). Binary floats may say a + b > c (a false conflict). Part A
# enumerates every pair a, b of two-decimal values from 0.01 to 0.99.
# Part B converts one-decimal percentages 0.1 to 99.9 by dividing by
# 100 and compares with the decimal written directly, the way two
# kits write the same threshold. Part C: three-term bounds a + b + c
# on a coarse grid, naive left-to-right float addition against
# math.fsum of the same three floats. Exhaustive, no randomness;
# Fraction is the judge.

import math
from fractions import Fraction as F

false_conf = 0
false_slack = 0
total = 0
for i in range(1, 100):
    for j in range(1, 100):
        total += 1
        a, b = "0.%02d" % i, "0.%02d" % j
        c = F(i + j, 100)
        fa = float(a) + float(b)
        fc = float(c)
        if fa > fc:
            false_conf += 1
        elif fa < fc:
            false_slack += 1
print("A. lower bound a + b against upper bound c = a + b, %d pairs"
      % total)
print("   float says conflict (false)      %5d  share %.4f"
      % (false_conf, false_conf / total))
print("   float says slack below c         %5d  share %.4f"
      % (false_slack, false_slack / total))
print("   exact Fraction says conflict         0")

diff = 0
for k in range(1, 1000):
    pct = "%d.%d" % divmod(k, 10)
    via_pct = float(pct) / 100
    direct = float(F(k, 1000))
    if via_pct != direct:
        diff += 1
print("B. percent / 100 differs from the written decimal: %d of 999"
      % diff)

bad3 = 0
badf = 0
n3 = 0
for i in range(1, 50):
    for j in range(1, 50):
        for k in range(1, 50):
            n3 += 1
            t = [float(F(i, 100)), float(F(j, 100)), float(F(k, 100))]
            want = float(F(i + j + k, 100))
            if (t[0] + t[1]) + t[2] != want:
                bad3 += 1
            if math.fsum(t) != want:
                badf += 1
print("C. three-term bounds 0.01 to 0.49, %d triples" % n3)
print("   naive float addition disagrees %6d  share %.4f"
      % (bad3, bad3 / n3))
print("   math.fsum of the floats        %6d  share %.4f"
      % (badf, badf / n3))

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 2: Rules as Intervals: Deciding Threshold Conflicts Mechanically. 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