Published June 16, 2026 | Version v2
Preprint Restricted

The Unhedgeability Theorem: Sheaf Cohomology of Interaction Diagrams and the Topology of Financial Risk

Authors/Creators

Description

ATTRIBUTION NOTICE (2026-08). The construction used here — a cellular sheaf on an interaction graph, with H⁰ local data, H¹ the first obstruction to global consistency, and higher cohomology measuring further obstruction — is correct and is verifiable directly: a coupling of gradient form composes exactly around every triangle, a general one does not, and that failure is H¹. It is also an established field that this record does not cite. Applied sheaf theory on graphs and networks is developed in Justin Curry's thesis (2014), in Robert Ghrist's Elementary Applied Topology, in Michael Robinson's work on sheaves for sensor networks, and in Jakob Hansen and Ghrist's cellular-sheaf Laplacian papers; the sheaf-theoretic reading of contextuality is Abramsky and Brandenburger (2011). The financial and climate applications developed here may well be new, but they should be presented as applications of that machinery rather than as its introduction. A revised version with proper attribution is in preparation.

PENDING QUALITY AUDIT (2026-08). The file is restricted while this record is reviewed as part of a systematic audit of the author's corpus. It has not yet been assessed. Metadata and DOI remain public, and access can be requested.

We give a topological classification of financial risk. A risk factor propagating on an interaction diagram Γ — a simplicial complex whose vertices are instruments and whose edges are pairwise exposures — is assigned a sheaf $\mathcal{F}$ recording the local pricing data at each vertex and the consistency conditions between them. The Čech cohomology of $\mathcal{F}$ stratifies risk into three levels: $H^0$ (bilateral risk, always locally consistent), $H^1$ (triangular risk, the first obstruction to a globally consistent pricing scheme), and $H^2$ (systemic risk, a secondary obstruction that vanishes whenever a no-arbitrage condition holds).

We work this out in full for interest rate risk. The discount factor sheaf on the time axis is exact — $H^1 = 0$ — in a deterministic world. Once rates are stochastic, Itô's lemma produces a non-trivial $H^1$ class: the Heath–Jarrow–Morton (HJM) convexity adjustment $$A(t,T) = \sigma(t,T)\int_t^T \sigma(t,u),du$$ is exactly the value of this cocycle on the elementary triangle $(t,s,T)$, and the HJM no-arbitrage condition is exactly the vanishing of the corresponding $H^2$ obstruction.

This gives the paper's central result, the Unhedgeability Theorem: a risk factor is hedgeable with a finite portfolio of bilateral instruments (forwards, futures, vanilla swaps) if and only if its Čech class is trivial in $H^1(\Gamma, \mathcal{F})$. Convexity risk, basis risk, smile/skew risk, and CDO correlation risk are all non-trivial $H^1$ classes, and are therefore topologically — not merely practically — unhedgeable with bilateral instruments. This is proved directly from the Čech complex and holds for any sheaf on any interaction diagram; it requires no group representation theory and no 6j-symbol or recoupling combinatorics of any kind.

Finally, the Origami ISA opcodes (SPLIT, SPLAT, FLIP, FLOP, TWIST) are identified with the Čech cohomology operations on $\mathcal{F}$ — SPLIT is the coboundary map $\delta^0$, SPLAT is fibre integration back to $H^0$, and the Pentagon identity is $\delta^1\circ\delta^0=0$ — giving the theorem a direct computational realisation. The paper is explicit about the scope of this identification (§5.4): in the two-instrument case worked out here, SPLIT/SPLAT classify a quantity already derived from Itô calculus, rather than computing it in a new way — a contrast with the non-abelian, spin-foam instance of the same opcodes (companion paper, Spin Foams as Origami, doi:10.5281/zenodo.20680634), where they evaluate 6j/15j amplitudes that have no closed form otherwise.

Files

Restricted

The record is publicly accessible, but files are restricted. Log in to check if you have access.