What does Zero-Ambiguity Cross-Lingual Dispatch conclude, in numbers, about “Classical Sources East and West: Rectified Names, a Drill, Babel and Friction”?
Answer: The chain of names, the two rounds of blame, friction and Babel each capture one side of cross-language dispatch, and each turns a probabilistic relation into a necessity. The programs translate them into testable numbers: little information survives five links in series; locking terms raises the probability that a six-term dispatch is read correctly throughout from 0.7828 to 0.9704; a job of twelve hand-offs succeeds only 0.6938 of the time; and after a matching readback the probability that the dispatch was still at fault falls to 0.2707. The ancients supplied the direction, and today's ledger supplies the scale.
Scope of the numbers: Parameters are illustrative and all calculations are generated by the book's programs. This is general operating analysis, not legal or human-resources advice, and it labels no individual by nationality, ethnicity, religion or language.
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.7828, 0.9704
| A. information left after k links (bits) | |
| k e | 0.02 e = 0.05 e = 0.10 |
| 1 | 0.8586 0.7136 0.5310 |
| 2 | 0.7614 0.5471 0.3199 |
| 3 | 0.6820 0.4277 0.1984 |
| 4 | 0.6145 0.3379 0.1247 |
| 5 | 0.5559 0.2687 0.0789 |
| B. a dispatch with k terms is read right on every term | |
| k unlocked t | 0.04 locked t=0.005 |
| 2 | 0.9216 0.9900 |
| 4 | 0.8493 0.9801 |
| 6 | 0.7828 0.9704 |
| 8 | 0.7214 0.9607 |
| 10 | 0.6648 0.9511 |
Show the full program
# Chapter 7. p71: the Analects chain as channels in series.
# Lunyu, Zilu: names -> words -> tasks -> rites and music -> penalties
# -> the people, five links. Read each link as a binary symmetric
# channel with crossover e; information about "is the name right" left
# after k links is 1 - H(p_k), p_k = (1 - (1 - 2e)^k) / 2. Second part:
# a dispatch that uses k business terms, each misread with chance t;
# term locking moves t from 0.04 to 0.005 (illustrative).
import math
def h2(p):
if p <= 0 or p >= 1:
return 0.0
return -(p * math.log2(p) + (1 - p) * math.log2(1 - p))
print("A. information left after k links (bits)")
print(" k e = 0.02 e = 0.05 e = 0.10")
for k in range(1, 6):
row = []
for e in (0.02, 0.05, 0.10):
p = (1 - (1 - 2 * e) ** k) / 2
row.append(1 - h2(p))
print(" {} {:.4f} {:.4f} {:.4f}".format(k, *row))
print("B. a dispatch with k terms is read right on every term")
print(" k unlocked t=0.04 locked t=0.005")
for k in (2, 4, 6, 8, 10):
print(" {:>2} {:.4f} {:.4f}".format(
k, (1 - 0.04) ** k, (1 - 0.005) ** k))Single source and citation
Fan, Y. (2026). Cross-Lingual Command Channel Distortion, High-Low Context Alignment and Zero-Ambiguity Multinational Operations (Version 1.0.0), Chapter 7: Classical Sources East and West: Rectified Names, a Drill, Babel and Friction. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-361 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026361,
author = {Fan, Yafu},
title = {Cross-Lingual Command Channel Distortion, High-Low Context Alignment and Zero-Ambiguity Multinational Operations},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Channels in Series: Why a Good Translator Cannot Win Back the Cultural Loss
- Chapter 2 · The Four-Field Dispatch: Cutting the Receiver's Action Set with Conditional Entropy
- Chapter 3 · Readback Confirmation: the Readback Error Rate Times the Hearback Miss Rate
- Chapter 4 · The Term-Lock Table: Collisions without Tone Marks, False Friends across Varieties and a Version Fingerprint
- Chapter 5 · High and Low Context: the Overlap of Country Means and the Ecological Fallacy
- Chapter 6 · Breaking Even between Rework and Writing: a Triage Threshold for Each Business Line
- Chapter 8 · Standard Operating Templates and Checker Specification: the Weekly Ledger, the Four-Field Checker and a Pre-Registered Refutation