What does Prediction-Market Prices and Arbitrage conclude, in numbers, about “Logically Related Events: Convex Polytopes, Frank-Wolfe Projection and Arbitrage Certificates”?

Answer: Chapter 5 puts logically related contracts into a convex polytope and uses a hand-written Frank-Wolfe projection to find a certificate that gains in every state; the plain variant is unconverged after 400 steps while the pairwise variant converges exactly; pairwise logical rules catch only 92.9 % of incoherent quotes, and the best executed return is only +4.6 % a year.

Scope of the numbers: It is not investment, trading or betting advice; all data are synthetic, generated by its programs. Chapter 7 reads the Guanzi's "the clever gain tenfold" and the Shiji's Bai Gui, "what others discard I take, what others take I let go", as information rent and the cost of carry, marked as interpretation.

中文版

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: 4.6, 92.9

A. one unit at quoted prices: gain 0.035 on 0.9653.63% in 6 months
units phi net gain capital annualised
5000.00 8.41 491.6 +3.4%
20000.00 44.50 1955.5 +4.6%
40000.00 62.00 3938.0 +3.2%
5000.02 2.49 497.5 +1.0%
20000.02 20.84 1979.2 +2.1%
26500.02 22.67 2627.3 +1.7%
5000.07 -12.30 512.3 -4.7%
20000.07 -38.32 2038.3 -3.7%
B. incoherent vectors2518 of 4000
caught by R1 (pairwise logic)92.9%
caught by R2 (plus counting rule)100.0%
Reading: the guaranteed gain is small next to the capital it
locks - 3.63 % for six months before costs, at best 4.6 % a
year after depth and fixed costs, and a loss at every size with
a 0.07 fee. Pairwise logic misses part of the incoherence
that the polytope catches; for this tiny market one more rule
closes the gap, but real markets have too many facets to list,
which is why the vertex oracle matters.

Key formula

\[\mathbf{x}\cdot(\boldsymbol{\phi}(s) - \boldsymbol{\theta}) \;\ge\; \lVert \boldsymbol{\mu}^* - \boldsymbol{\theta} \rVert^2 > 0 .\]
Show the full program
# Chapter 5. p11: From certificate to trade, and why simple rules miss it.
# A. The certificate of p10, scaled to buy 1 N and sell 0.5 of each state
#    (selling a state = buying its NO at 1 - price), gains at least 0.035
#    per unit in every state. Each leg's book deepens by 0.01 per 2,000
#    contracts; fee phi P(1 - P) per contract; 2 per leg order; payout in
#    6 months. Annualised return on the capital locked is reported.
# B. 4,000 random price vectors in [0.02, 0.98]^4. A vector is incoherent
#    if its Euclidean distance to the polytope (pairwise FW, as in p10)
#    exceeds 1e-6. Two rule sets are tried as screens:
#      R1 pairwise logic: N >= s_i + s_j - 1 and N <= s_i + s_j
#      R2 R1 plus the counting rule 2N <= A + B + C <= 1 + 2N
import itertools
import random

THETA = (0.65, 0.62, 0.60, 0.40)
V = [(a, b, c, 1 if a + b + c >= 2 else 0)
     for a, b, c in itertools.product((0, 1), repeat=3)]
UNIT = (-0.5, -0.5, -0.5, 1.0)
STEP, DEPTH, FIXED, TAU = 0.01, 2000.0, 2.0, 0.5

def trade(k, phi):
    capital = gain_min = 0.0
    for q, th in zip(UNIT, THETA):
        n = abs(q) * k
        px = th if q > 0 else 1 - th
        avg = px + STEP * n / DEPTH / 2
        capital += n * avg + phi * n * px * (1 - px) + FIXED
    payoff = min(sum(abs(q) * k * (v[j] if q > 0 else 1 - v[j])
                     for j, q in enumerate(UNIT)) for v in V)
    return payoff - capital, capital

def dist(th, iters=300):
    w = {i: 1 / 8 for i in range(8)}
    for _ in range(iters):
        mu = [sum(w[i] * V[i][j] for i in w) for j in range(4)]
        g = [a - b for a, b in zip(mu, th)]
        s = min(range(8), key=lambda i: sum(x * y for x, y in zip(g, V[i])))
        a = max(w, key=lambda i: sum(x * y for x, y in zip(g, V[i])))
        d = [x - y for x, y in zip(V[s], V[a])]
        dd = sum(x * x for x in d)
        if dd == 0:
            break
        st = max(0.0, min(w[a], -sum(x * y for x, y in zip(g, d)) / dd))
        w[a] -= st
        w[s] = w.get(s, 0.0) + st
        if w[a] <= 1e-15:
            del w[a]
    mu = [sum(w[i] * V[i][j] for i in w) for j in range(4)]
    return sum((a - b) ** 2 for a, b in zip(mu, th)) ** 0.5

def rules(th, counting):
    a, b, c, n = th
    for x, y in ((a, b), (a, c), (b, c)):
        if n < x + y - 1 or n > x + y:
            return False
    if counting and not (2 * n <= a + b + c <= 1 + 2 * n):
        return False
    return True

if __name__ == "__main__":
    c1 = sum(abs(q) * (th if q > 0 else 1 - th)
             for q, th in zip(UNIT, THETA))
    g1 = min(sum(abs(q) * (v[j] if q > 0 else 1 - v[j])
                 for j, q in enumerate(UNIT)) for v in V) - c1
    print("A. one unit at quoted prices: gain {:.3f} on {:.3f}"
          " = {:.2%} in 6 months".format(g1, c1, g1 / c1))
    print("   units   phi    net gain   capital   annualised")
    for phi in (0.0, 0.02, 0.07):
        best = max(range(10, 40001, 10), key=lambda k: trade(k, phi)[0])
        sizes = (500, 2000) + ((best,) if trade(best, phi)[0] > 0 else ())
        for k in sizes:
            net, cap = trade(k, phi)
            ann = ((cap + net) / cap) ** (1 / TAU) - 1
            print("   {:6d}  {:4.2f}  {:9.2f}  {:8.1f}   {:+.1%}".format(
                k, phi, net, cap, ann))
    rng = random.Random(59011)
    inc = r1 = r2 = 0
    for _ in range(4000):
        th = [rng.uniform(0.02, 0.98) for _ in range(4)]
        if dist(th) > 1e-6:
            inc += 1
            r1 += not rules(th, False)
            r2 += not rules(th, True)
    print("\nB. incoherent vectors: {} of 4000".format(inc))
    print("   caught by R1 (pairwise logic):     {:5.1%}".format(r1 / inc))
    print("   caught by R2 (plus counting rule): {:5.1%}".format(r2 / inc))
    print("\nReading: the guaranteed gain is small next to the capital it")
    print("locks - 3.63 % for six months before costs, at best 4.6 % a")
    print("year after depth and fixed costs, and a loss at every size with")
    print("a 0.07 fee. Pairwise logic misses part of the incoherence")
    print("that the polytope catches; for this tiny market one more rule")
    print("closes the gap, but real markets have too many facets to list,")
    print("which is why the vertex oracle matters.")

Single source and citation

Fan, Y. (2026). Prediction Market Microstructure, Bregman Information Projection and Cross-Book Arbitrage Bounds (Version 1.0.0), Chapter 5: Logically Related Events: Convex Polytopes, Frank-Wolfe Projection and Arbitrage Certificates. 5D Library. https://doi.org/10.5281/zenodo.24090166

DOI: 10.5281/zenodo.24090166 · Read the monograph · 5DL-B-059 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026059,
  author    = {Fan, Yafu},
  title     = {Prediction Market Microstructure, Bregman Information Projection and Cross-Book Arbitrage Bounds},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090166},
  url       = {https://doi.org/10.5281/zenodo.24090166}
}

Other chapter answers in this book