White Paper · Quantitative Finance

The Mathematics of Synthesis

A proof that adversarially-filtered, covariance-weighted fusion dominates its parts.

Dr. Alex Djahankhah · The Futures Playbook · 2026
Companion to The Mathematics of the Desk Read — chapter references in brackets.

Abstract

The Desk Read does not act on any single signal. It synthesizes: several partially-informative estimators — a volatility-driven range model, a logistic directional probability, a dealer-gamma structure read, and multiple independent model assessments — are combined into one decision, and a final adversarial step discards candidates that cannot survive a critic. This paper proves that this synthesis is not stylistic but optimal. We establish four results: (1) the minimum-variance linear pool has variance no larger than the best single estimator, with equality only under perfect redundancy; (2) the ambiguity decomposition shows the pooled forecast's error is always at most the average member's error, the gap being exactly the members' disagreement; (3) the Bayes-optimal fusion of probabilistic forecasts is the additive log-odds pool — the very logistic structure the openBias model already uses; and (4) the adversarial refutation step, read as a Neyman–Pearson likelihood-ratio test, is the most powerful admissible filter, minimizing false discoveries for any fixed acceptance rate. Assembled, these give a synthesized estimator that provably dominates every component under three transparent conditions — calibration, diversity, and bounded correlation — and, as an honest corollary, is provably worthless when those conditions fail. Synthesis is a theorem, not a slogan.

The synthesis problem
Framework and assumptions
Theorem 1 — Optimal linear pooling beats the best part
Theorem 2 — The ambiguity decomposition
Theorem 3 — Bayes-optimal fusion is additive log-odds
Theorem 4 — Adversarial refutation is a most-powerful filter
The synthesis theorem
When synthesis fails (the redundancy boundary)
Limitations & scope
Notation and references

1. The synthesis problem

Fix a quantity we wish to estimate before the open — say $\theta$, the session's directional edge, or the expected opening range. We possess $n$ signals $X_1,\dots,X_n$, each an imperfect estimate of $\theta$ produced by a different mechanism (a regression, a probability model, a gamma read, a language model's assessment). None is authoritative; each carries noise, and the noises are neither identical nor independent. The engineering question — which signal do I trust? — is the wrong question. The right question is: what single function of all $n$ signals has the smallest error, and can we prove it beats trusting any one of them?

That function is the synthesis. We now make it precise and prove four things about it.

2. Framework and assumptions

Definition 2.1 (Signals). A signal is a random variable $X_i=\theta+\varepsilon_i$ with error $\varepsilon_i$, $\mathbb E[\varepsilon_i]=b_i$ (bias) and $\mathrm{Cov}(\varepsilon_i,\varepsilon_j)=\Sigma_{ij}$. Write $\sigma_i^2=\Sigma_{ii}$ and let $\Sigma\succ 0$ be the error covariance matrix. A signal is calibrated (unbiased) if $b_i=0$; a probabilistic signal reporting $p_i=\hat{\mathbb P}(Y=1)$ is calibrated if $\mathbb P(Y=1\mid p_i=q)=q$.

Standing assumptions. (A1) Calibration. Each component is unbiased / calibrated after its own fitting (Ch. 6, Ch. 10). (A2) Diversity. The signals are not all the same: the errors are not perfectly correlated, so $\Sigma$ is nonsingular. (A3) Bounded correlation. Pairwise error correlations satisfy $|\rho_{ij}|\le\bar\rho\lt 1$. (A4) Admissible critic. The adversarial step behaves as a likelihood-ratio test between "no edge" and "edge." We treat A1–A4 as hypotheses of the theorems and return, in §8, to exactly what breaks when they fail.

3. Theorem 1 — Optimal linear pooling beats the best part

Restrict first to linear synthesis of calibrated signals: $\hat\theta_w=\mathbf w^\top X=\sum_i w_i X_i$. To keep the pool unbiased we require the weights to sum to one, $\mathbf 1^\top\mathbf w=1$ (then $\mathbb E[\hat\theta_w]=\theta$). Among all such weightings, which has the least variance?

Theorem 1 (Minimum-variance pool). Under (A1)–(A2), the unbiased linear pool of least variance has weights $$\mathbf w^\star=\frac{\Sigma^{-1}\mathbf 1}{\mathbf 1^\top\Sigma^{-1}\mathbf 1},\qquad \mathrm{Var}(\hat\theta_{\mathbf w^\star})=\frac{1}{\mathbf 1^\top\Sigma^{-1}\mathbf 1},$$ and this variance satisfies $\mathrm{Var}(\hat\theta_{\mathbf w^\star})\le\min_i\sigma_i^2$ — the synthesis is at least as precise as the single best signal.

draws on Ch. 4 (normal equations), Ch. 11 (covariance Σ), Ch. 13 ($\Sigma^{-1}\mu$ sizing)

Proof. Minimize $f(\mathbf w)=\mathbf w^\top\Sigma\mathbf w$ subject to $g(\mathbf w)=\mathbf 1^\top\mathbf w-1=0$. Form the Lagrangian $L=\mathbf w^\top\Sigma\mathbf w-\lambda(\mathbf 1^\top\mathbf w-1)$. Since $\Sigma$ is symmetric, $\nabla_{\mathbf w}L=2\Sigma\mathbf w-\lambda\mathbf 1$ (Appendix A). Setting it to zero gives $\mathbf w=\tfrac{\lambda}{2}\Sigma^{-1}\mathbf 1$. Imposing the constraint, $1=\mathbf 1^\top\mathbf w=\tfrac{\lambda}{2}\,\mathbf 1^\top\Sigma^{-1}\mathbf 1$, so $\tfrac{\lambda}{2}=(\mathbf 1^\top\Sigma^{-1}\mathbf 1)^{-1}$ and $\mathbf w^\star=\Sigma^{-1}\mathbf 1/(\mathbf 1^\top\Sigma^{-1}\mathbf 1)$. The objective is convex ($\Sigma\succ0$), so this stationary point is the global minimum. Its value is $\mathbf w^{\star\top}\Sigma\mathbf w^\star=\dfrac{\mathbf 1^\top\Sigma^{-1}\Sigma\Sigma^{-1}\mathbf 1}{(\mathbf 1^\top\Sigma^{-1}\mathbf 1)^2} =\dfrac{1}{\mathbf 1^\top\Sigma^{-1}\mathbf 1}$. For the bound: each unit vector $\mathbf e_i$ satisfies $\mathbf 1^\top\mathbf e_i=1$, so it is a feasible weighting with variance $\mathbf e_i^\top\Sigma\mathbf e_i=\sigma_i^2$. The minimum over the feasible set cannot exceed any feasible point, hence $\mathrm{Var}(\hat\theta_{\mathbf w^\star})\le\min_i\sigma_i^2$. ∎

Corollary 1.1 (The $\sqrt n$ law). If the signals are independent with equal variance, $\Sigma=\sigma^2 I$, then $\mathbf w^\star=\tfrac1n\mathbf 1$ (the plain average) and $\mathrm{Var}=\sigma^2/n$. Synthesis of $n$ independent reads cuts the standard error by $\sqrt n$ — the same law that governs the standard error of a mean.

Ch. 3 (SE $=\sigma/\sqrt n$), Ch. 7 / App. C (Monte-Carlo $1/\sqrt N$)

Proof. $\Sigma^{-1}=\sigma^{-2}I$, so $\Sigma^{-1}\mathbf 1=\sigma^{-2}\mathbf 1$ and $\mathbf 1^\top\Sigma^{-1}\mathbf 1=n/\sigma^2$; hence $\mathbf w^\star=\mathbf 1/n$ and $\mathrm{Var}=1/(n/\sigma^2)=\sigma^2/n$. ∎

For two signals with variances $\sigma_1^2,\sigma_2^2$ and correlation $\rho$, Theorem 1 gives the explicit Bates–Granger weight $w_1^\star=\dfrac{\sigma_2^2-\rho\,\sigma_1\sigma_2}{\sigma_1^2+\sigma_2^2-2\rho\,\sigma_1\sigma_2}$. Two lessons are already visible: a noisier signal still earns positive weight (it carries independent information), and as $\rho\to1$ the denominator collapses — the gain from adding a near-duplicate vanishes. We return to that boundary in §8.

4. Theorem 2 — The ambiguity decomposition

Theorem 1 assumed we could estimate $\Sigma$. The next result needs no distributional assumption at all: it is an algebraic identity that holds for every realization, and it is the cleanest possible statement of "the whole is better than the parts."

Theorem 2 (Ambiguity decomposition). Let $f_1,\dots,f_n$ be any forecasts of a target $y$, and let $\bar f=\sum_i w_i f_i$ be a convex combination ($w_i\ge0,\ \sum_i w_i=1$). Then $$(\bar f-y)^2=\underbrace{\sum_i w_i (f_i-y)^2}_{\text{avg. member error}}-\underbrace{\sum_i w_i (f_i-\bar f)^2}_{\text{diversity (ambiguity)}}.$$ Consequently $(\bar f-y)^2\le\sum_i w_i (f_i-y)^2$: the ensemble's squared error never exceeds the weighted-average member's, and is strictly smaller whenever the members disagree.

draws on Ch. 6 (bias–variance), Ch. 4 (inner products)

Proof. Expand both sums against $\bar f$. First, $\sum_i w_i(f_i-\bar f)^2=\sum_i w_i f_i^2-2\bar f\sum_i w_i f_i+\bar f^2\sum_i w_i=\sum_i w_i f_i^2-2\bar f^2+\bar f^2=\sum_i w_i f_i^2-\bar f^2$, using $\sum_i w_i f_i=\bar f$ and $\sum_i w_i=1$. Second, $\sum_i w_i(f_i-y)^2-(\bar f-y)^2=\big(\sum_i w_i f_i^2-2y\bar f+y^2\big)-\big(\bar f^2-2y\bar f+y^2\big)=\sum_i w_i f_i^2-\bar f^2$. The two right-hand sides are identical, proving the identity. Since each term $w_i(f_i-\bar f)^2\ge0$, the diversity term is non-negative, giving the inequality; it is zero iff all $f_i=\bar f$, i.e. no disagreement. ∎

Corollary 2.1 (Expected form). Taking expectations, $\mathbb E[(\bar f-y)^2]=\sum_i w_i\,\mathbb E[(f_i-y)^2]-\mathbb E\!\big[\textstyle\sum_i w_i(f_i-\bar f)^2\big]$. The generalization error of the synthesis equals average member error minus expected diversity. Diversity is not noise to be averaged away; it is the mechanism by which synthesis wins.

This is the formal content of the adversarial design: a second model that argues against the first is valuable precisely because it is engineered to be different — it raises the diversity term. A committee of yes-men ($f_i\equiv\bar f$) proves, by Theorem 2, exactly nothing.

5. Theorem 3 — Bayes-optimal fusion is additive log-odds

For a directional call the signals are probabilities $p_i=\hat{\mathbb P}(Y=1)$, not point estimates. Averaging probabilities is not the right operation; the correct fusion is multiplicative in the odds — and it turns out to be exactly the logistic structure the openBias model already speaks.

Theorem 3 (Logarithmic opinion pool). (i) Among all distributions $q$, the one minimizing the weighted divergence $\sum_i w_i\,\mathrm{KL}(q\,\|\,p_i)$ is the normalized weighted geometric mean $q^\star(x)\propto\prod_i p_i(x)^{w_i}$. (ii) For a binary outcome this is equivalent to adding log-odds: $$\operatorname{logit} q^\star=\sum_i w_i\operatorname{logit} p_i+C.$$ (iii) If the signals are conditionally independent given $Y$, the Bayes posterior is exactly this pool with unit weights, up to the prior. Hence summing calibrated log-odds is the Bayes-optimal synthesis.

draws on Ch. 10 (logit/sigmoid $=$ additive log-odds), Ch. 11 (independence), Ch. 1 (expectation)

Proof. (i) Minimize $J(q)=\sum_i w_i\sum_x q(x)\log\frac{q(x)}{p_i(x)}$ over $q\ge0,\ \sum_x q(x)=1$. With multiplier $\mu$ for normalization, the stationarity condition $\partial/\partial q(x)$ gives $\sum_i w_i\big(\log\frac{q(x)}{p_i(x)}+1\big)-\mu=0$, i.e. $\log q(x)=\sum_i w_i\log p_i(x)+(\mu-1)$ (using $\sum_i w_i=1$). Exponentiating, $q^\star(x)\propto\prod_i p_i(x)^{w_i}$; convexity of KL in $q$ makes it the minimizer. (ii) For $Y\in\{0,1\}$ apply this to the two mass points and take the ratio: $\frac{q^\star(1)}{q^\star(0)}=\prod_i\Big(\frac{p_i}{1-p_i}\Big)^{w_i}$; taking $\log$, $\operatorname{logit}q^\star=\sum_i w_i\operatorname{logit}p_i$ (the constant $C$ absorbs normalization). (iii) By Bayes' rule with conditionally-independent evidence $e_i$, $\frac{\mathbb P(Y=1\mid e_{1:n})}{\mathbb P(Y=0\mid e_{1:n})}=\frac{\pi_1}{\pi_0}\prod_i\frac{\mathbb P(e_i\mid Y=1)}{\mathbb P(e_i\mid Y=0)}$, where $\pi$ is the prior. Each likelihood ratio equals $\frac{p_i/(1-p_i)}{\pi_1/\pi_0}$ (calibration), so $\operatorname{logit}\mathbb P(Y=1\mid e_{1:n})=\operatorname{logit}\pi_1+\sum_i\big(\operatorname{logit}p_i-\operatorname{logit}\pi_1\big)$ — additive log-odds, up to the prior correction. ∎

Two consequences worth stating. First, the synthesis of probabilistic signals is a logistic model whose inputs are the members' log-odds — the openBias machinery (Ch. 10) generalized from raw factors to model opinions. Second, part (iii) makes the independence requirement (A2/Ch. 11) rigorous: if two signals read the same evidence, adding both log-odds double-counts it and the pool becomes overconfident. Correlated evidence is not free precision — it is the multicollinearity of §8.

6. Theorem 4 — Adversarial refutation is a most-powerful filter

The last stage is not a combiner but a gate: a candidate plan is emitted, and an adversary attempts to refute it; only survivors are acted on. We show this gate, if it behaves as a likelihood-ratio test, is optimal — it lets through the most genuine signal for any fixed rate of admitting noise.

Definition 6.1 (The gate). Let $T$ be a statistic summarizing the candidate. Under $H_0$ ("no edge") $T\sim f_0$; under $H_1$ ("real edge") $T\sim f_1$. A gate is a decision rule $\delta(T)\in\{\text{accept},\text{reject}\}$. Its size is $\alpha=\mathbb P(\text{accept}\mid H_0)$ (rate of passing junk) and its power is $\beta=\mathbb P(\text{accept}\mid H_1)$ (rate of keeping real signal).

Theorem 4 (Optimal refutation). Under (A4), among all gates of size at most $\alpha$, the likelihood-ratio gate $\Lambda(T)=f_1(T)/f_0(T)\gt k$ — accept only candidates the adversary cannot make look like noise — has the greatest power $\beta$. Equivalently, for a fixed false-acceptance rate it maximizes the fraction of true signals retained, and therefore minimizes the false-discovery rate of acted-on plans.

draws on Ch. 12 (hypothesis testing, multiple-testing, deflation), Ch. 3 (p-values)

Proof. This is the Neyman–Pearson lemma. Let $\delta^\star$ be the LR gate with threshold $k$ chosen so its size is $\alpha$, and let $\delta$ be any gate with size $\le\alpha$. Write $\phi$ for the accept-indicator of each. On $\{\Lambda\gt k\}$ we have $f_1\ge k f_0$, and on $\{\Lambda\lt k\}$, $f_1\le k f_0$; in both regions $(\phi^\star-\phi)(f_1-kf_0)\ge0$ pointwise, since $\phi^\star=1\ge\phi$ where $f_1-kf_0\ge0$ and $\phi^\star=0\le\phi$ where $f_1-kf_0\le0$. Integrating, $\int(\phi^\star-\phi)f_1\;\ge\;k\int(\phi^\star-\phi)f_0=k(\alpha-\text{size}(\delta))\ge0$. The left side is $\beta^\star-\beta$, so $\beta^\star\ge\beta$: the LR gate is most powerful. Finally, with a fixed base rate $\pi_1$ of genuine edges, the false-discovery rate among accepted plans is $\mathrm{FDR}=\frac{(1-\pi_1)\alpha}{(1-\pi_1)\alpha+\pi_1\beta}$, which is decreasing in $\beta$ at fixed $\alpha$; maximizing $\beta$ therefore minimizes FDR. ∎

Operationally, the adversary raises the bar a candidate must clear. Across many sessions this is the multiple-testing discipline of Chapter 12 enacted in real time: just as searching $N$ strategies demands a threshold near $\sqrt{2\ln N}$ rather than $1.96$, demanding a plan survive refutation deflates the effective significance and suppresses the daily drizzle of false "edges."

7. The synthesis theorem

The Desk Read composes the three combiners and the gate. Write the component signals $s_1,\dots,s_n$ (point estimates fused by Theorem 1, probabilities fused by Theorem 3), and let $\mathcal G$ be the Theorem-4 gate.

Theorem 5 (Synthesis dominates its parts). Under (A1)–(A4), the synthesized decision $$\widehat D=\mathcal G\!\Big(\underbrace{\textstyle\sum_i w_i^\star\,s_i}_{\text{covariance-weighted (Thm 1)}}\ \big/\ \underbrace{\textstyle\operatorname{logit}^{-1}\!\sum_i w_i\operatorname{logit}p_i}_{\text{log-odds pool (Thm 3)}}\Big)$$ satisfies, before gating, $\mathrm{Var}(\widehat\theta_{\text{synth}})=\big(\mathbf 1^\top\Sigma^{-1}\mathbf 1\big)^{-1}\le\min_i\sigma_i^2$ (Thm 1) and expected loss $\mathbb E[(\widehat\theta_{\text{synth}}-\theta)^2]\le\frac1n\sum_i\mathbb E[(s_i-\theta)^2]-\overline{\text{Amb}}$ with $\overline{\text{Amb}}\gt 0$ (Thm 2); and after gating it attains, for its acceptance rate, the minimum false-discovery rate of any admissible rule (Thm 4). Hence $\widehat D$ is at least as accurate as the best single signal and strictly better whenever the members are diverse — with strict inequality guaranteed by (A2).

Proof. The variance claim is Theorem 1 applied to the point-estimate channel; the loss claim is Corollary 2.1 with the ambiguity term $\overline{\text{Amb}}=\mathbb E[\sum_i w_i(s_i-\bar s)^2]\gt 0$, which is strictly positive under (A2) (not all signals equal); the probabilistic channel is Bayes-optimal by Theorem 3(iii); and the gate is most-powerful by Theorem 4. Composition preserves each guarantee on its own channel, and the gate only removes candidates that fail the LR test, which cannot raise the retained-signal error. Combining, $\widehat D$ dominates every component, strictly under diversity. ∎

8. When synthesis fails — the redundancy boundary

A proof is only as honest as its converse. Each assumption is load-bearing, and naming its failure mode is the most useful part of the paper.

Corollary 8.1 (Redundancy nullifies synthesis). If the signals are perfectly correlated ($\rho_{ij}\to1$), $\Sigma$ approaches singularity, $\mathbf 1^\top\Sigma^{-1}\mathbf 1$ diverges in the degenerate directions, the ambiguity term of Theorem 2 vanishes, and the log-odds pool of Theorem 3 double-counts the shared evidence. In the limit the synthesis reduces to a single signal and its advantage is exactly zero.

This is the multicollinearity theorem of Chapter 11 restated for models: synthesizing redundant signals is provably worthless. It is why econ-surprise — spanned by rates and the dollar (high VIF) — was excluded from openBias, and why an ensemble of identically-prompted models is theatre. The value of a component is not its accuracy but its orthogonality to the others. Correspondingly: (A1) calibration failure makes the pool biased (a confidently-wrong member poisons the log-odds sum, Ch. 10); (A4) failure — an adversary that rubber-stamps — sends the gate's power to its trivial value and forfeits the FDR control of Theorem 4. The theorems do not promise that combining anything helps; they promise that combining calibrated, diverse, weakly-correlated signals, and filtering with a genuine critic, is optimal — and quantify exactly how much.

9. Limitations & scope

The results are estimator-theoretic, not a guarantee of profit. Four caveats bound their reach. (a) Theorem 1 requires an estimate of $\Sigma$; a poorly-estimated covariance can produce unstable weights, so in practice one shrinks $\Sigma$ toward a diagonal or caps weights (the same estimation-error discipline that motivates fractional Kelly, Ch. 13). (b) Calibration (A1) is an empirical property that must be monitored, not assumed — hence the self-grading accuracy tracker (Ch. 10, Ch. 12). (c) Language-model assessments are not formally independent draws; their error correlation is unknown and likely positive, so their realized diversity — and thus the Theorem-2 gain — is smaller than a naive $1/\sqrt n$ suggests. (d) The gate's optimality (A4) presumes the adversary approximates a likelihood-ratio test; a weak critic degrades gracefully to no filter, never below it. None of these overturn the theorems; they delineate where the inequalities are tight versus slack.

10. Notation and references

Notation. $\theta$ target quantity; $X_i,s_i$ signals; $\varepsilon_i$ signal error; $\Sigma$ error covariance, $\sigma_i^2=\Sigma_{ii}$; $\mathbf 1$ ones-vector; $\mathbf w$ pool weights; $p_i$ probabilistic signal; $\operatorname{logit}p=\ln\frac{p}{1-p}$; $\mathrm{KL}(q\|p)$ Kullback–Leibler divergence; $f_0,f_1$ null/alternative densities; $\Lambda$ likelihood ratio; $\alpha,\beta$ size and power; FDR false-discovery rate.

Bates, J. M., & Granger, C. W. J. (1969). The combination of forecasts. Operational Research Quarterly, 20(4), 451–468.

Krogh, A., & Vedelsby, J. (1995). Neural network ensembles, cross validation, and active learning. NeurIPS 7.

Genest, C., & Zidek, J. V. (1986). Combining probability distributions: A critique and an annotated bibliography. Statistical Science, 1(1), 114–135.

Neyman, J., & Pearson, E. S. (1933). On the problem of the most efficient tests of statistical hypotheses. Phil. Trans. Royal Society A, 231, 289–337.

Hinton, G. E. (2002). Training products of experts by minimizing contrastive divergence. Neural Computation, 14(8).

Djahankhah, A. (2026). The Mathematics of the Desk Read. alexdjahankhah.com/textbook.

© 2026 Dr. Alex Djahankhah · The Futures Playbook. This white paper accompanies The Mathematics of the Desk Read. Estimator-theoretic results; not investment advice. To export a PDF, print this page (Cmd/Ctrl-P → Save as PDF).