What does Bicameral AI Architecture conclude, in numbers, about “Diversity Measures and the Ambiguity Decomposition: How Different Is Different Enough”?
Answer: Chapter 2 shows that binary correlations on a ledger fall far below the latent correlation, and proves by enumeration that diversity and voting accuracy are not monotonic: majority accuracy can range from 0.4 to 0.9.
Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; "bicameral" is an engineering metaphor and no model is claimed to have awareness; the book is not personalised business or engineering advice. Marked boxes separate published evidence, runnable Python calculations (23 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.4, 0.9
| A. N | 20,000 tasks per rho; members err 0.10 and 0.12 |
| rho N11 N10 N01 N00 Q phi dis DF | |
| 0.0 | 15,894 2,114 1,748 244 +0.024 +0.005 0.1931 0.0122 |
| 0.2 | 16,002 2,001 1,582 415 +0.354 +0.089 0.1792 0.0208 |
| 0.4 | 16,328 1,721 1,384 567 +0.591 +0.182 0.1552 0.0284 |
| 0.6 | 16,519 1,530 1,025 926 +0.814 +0.352 0.1278 0.0463 |
| 0.8 | 16,927 1,129 723 1,221 +0.924 +0.520 0.0926 0.0611 |
| 0.9 | 17,084 880 517 1,519 +0.966 +0.649 0.0698 0.0760 |
| B. phi (error correlation) is not the latent rho: | |
| latent 0.4 -> phi 0.182, Q 0.591 | |
| latent 0.9 -> phi 0.649, Q 0.966 | |
| C. double fault = leak of a veto pair; it rises with rho |
Show the full program
# Chapter 2. p21: pairwise diversity measures from oracle outputs.
# Two members are simulated with a Gaussian copula (error rates 0.10
# and 0.12, latent rho). From the 2x2 table of correct (1) and wrong
# (0) we compute Yule's Q, the correlation phi, the disagreement and
# the double-fault rate, as defined in the ensemble literature.
# Illustrative rates; N tasks per rho with a fixed seed.
import math
import random
from statistics import NormalDist
ND = NormalDist()
N = 20000
def table(rho, rng, pa=0.10, pb=0.12):
a, b = ND.inv_cdf(pa), ND.inv_cdf(pb)
s, r = math.sqrt(rho), math.sqrt(1.0 - rho)
n = {"11": 0, "10": 0, "01": 0, "00": 0}
for _ in range(N):
f = rng.gauss(0.0, 1.0)
ca = "0" if s * f + r * rng.gauss(0.0, 1.0) < a else "1"
cb = "0" if s * f + r * rng.gauss(0.0, 1.0) < b else "1"
n[ca + cb] += 1
return n
def measures(n):
n11, n10, n01, n00 = n["11"], n["10"], n["01"], n["00"]
q = (n11 * n00 - n01 * n10) / (n11 * n00 + n01 * n10)
den = math.sqrt((n11 + n10) * (n01 + n00) * (n11 + n01)
* (n10 + n00))
phi = (n11 * n00 - n01 * n10) / den
dis = (n01 + n10) / N
df = n00 / N
return q, phi, dis, df
if __name__ == "__main__":
rng = random.Random(41002)
print("A. N = {:,} tasks per rho; members err 0.10 and 0.12".format(N))
print(" rho N11 N10 N01 N00 Q phi dis"
" DF")
rows = []
for rho in (0.0, 0.2, 0.4, 0.6, 0.8, 0.9):
n = table(rho, rng)
q, phi, dis, df = measures(n)
rows.append((rho, q, phi, df))
print(" {:.1f} {:>6,} {:>5,} {:>5,} {:>5,} {:+.3f} {:+.3f}"
" {:.4f} {:.4f}".format(rho, n["11"], n["10"], n["01"],
n["00"], q, phi, dis, df))
print("B. phi (error correlation) is not the latent rho:")
for rho, q, phi, df in rows:
if rho in (0.4, 0.9):
print(" latent {:.1f} -> phi {:.3f}, Q {:.3f}".format(
rho, phi, q))
print("C. double fault = leak of a veto pair; it rises with rho")Single source and citation
Fan, Y. (2026). Bicameral AI Architecture: Fusing Long-Context Holographic Strategy Models with Local Deterministic Execution Agents (Version 1.0.0), Chapter 2: Diversity Measures and the Ambiguity Decomposition: How Different Is Different Enough. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-410 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026410,
author = {Fan, Yafu},
title = {Bicameral AI Architecture: Fusing Long-Context Holographic Strategy Models with Local Deterministic Execution Agents},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Correlated Errors: Where the Second Model's Gain Comes From
- Chapter 3 · The Three-Stage Pipeline: Turning Errors into Intercepted Errors
- Chapter 4 · The Intent Translation Protocol: Slots, Ambiguity Entropy and Upper Bounds
- Chapter 5 · State-Sync Packets: Hash Chains, Version Vectors and Idempotency Keys
- Chapter 6 · Two-Way Correction: Gain, Noise and the Limits of Self-Correction
- Chapter 7 · Eastern and Western Classical Sources: Temple Reckoning, Breadth with Precision, and Friction
- Chapter 8 · The Empirical Loop: Field Tools and Checker Specifications