What does Dyadic Coupling and Grid Games conclude, in numbers, about “A Match Score Is a Bilinear Form”?

Answer: Chapter 1 writes a match score as a bilinear form and splits its matrix uniquely into a symmetric and an antisymmetric part: the larger the antisymmetric part, the more one-way pairs of opposite sign, and at a ratio of 1.0 "the person I give most to" and "the person who gives most to me" differ in 0.985 of cases; from an outcome the two share, only 10 of 16 parameters are identified, so one-sidedness can be seen only by measuring each person separately.

Scope of the numbers: All data are synthetic, generated by its programs, and wherever physics or game theory is applied to people it is marked as an analogy. Chapter 7 reads the Tuan commentary on Xian and Heng, the Rhapsody of the Old Fisherman and Yang Hui's magic squares; that Xian upside down is Heng is read, as marked interpretation, as a transposed matrix.

中文版

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.985, 1.0

r = |K|/|S|mutualone-wayboth negativetop match differs
0.00.4980.0000.5020.000
0.50.3550.2880.3570.840
1.00.2520.4950.2530.985
2.00.1530.6990.1481.000
Reading: with a symmetric M (r = 0) no pair is one-way. As the
antisymmetric part grows, more pairs have scores of opposite sign
and a person's best match depends on which direction is asked.

Key formula

\[s(A, B) = x_A^{\top} M x_B = \sum_{i,j} x_{A,i}\, M_{ij}\, x_{B,j},\]
Show the full program
# Chapter 1. A bilinear compatibility score and its two halves.
# Each person is a vector x of d = 6 traits, each uniform on [-1, 1]. The
# score of A towards B is s(A, B) = x_A' M x_B. If M is not symmetric,
# s(A, B) and s(B, A) differ. Every square M splits uniquely as M = S + K with
#   S = (M + M') / 2  symmetric       -> s(A,B) + s(B,A) = 2 x_A' S x_B
#   K = (M - M') / 2  antisymmetric   -> s(A,B) - s(B,A) = 2 x_A' K x_B
# r = |K| / |S| (Frobenius norms) measures how one-sided M is. For each r the
# program draws M, then 20,000 random pairs, and counts pairs where both
# scores are positive (mutual), where the signs differ (one-way), and where
# both are negative; and, in a pool of 200 people, how often A's best match
# "by what A gives" differs from A's best match "by what A receives".
import random

D, PAIRS, POOL = 6, 20000, 200

def rand_matrix(rng, r):
    a = [[rng.gauss(0, 1) for _ in range(D)] for _ in range(D)]
    s = [[(a[i][j] + a[j][i]) / 2 for j in range(D)] for i in range(D)]
    b = [[rng.gauss(0, 1) for _ in range(D)] for _ in range(D)]
    k = [[(b[i][j] - b[j][i]) / 2 for j in range(D)] for i in range(D)]
    ns = sum(v * v for row in s for v in row) ** 0.5
    nk = sum(v * v for row in k for v in row) ** 0.5
    return [[s[i][j] / ns + r * k[i][j] / nk for j in range(D)]
            for i in range(D)]

def score(m, x, y):
    return sum(x[i] * m[i][j] * y[j] for i in range(D) for j in range(D))

def person(rng):
    return [rng.uniform(-1, 1) for _ in range(D)]

if __name__ == "__main__":
    print("   r = |K|/|S|   mutual   one-way   both negative"
          "   top match differs")
    for r in (0.0, 0.5, 1.0, 2.0):
        rng = random.Random(62001)
        m = rand_matrix(rng, r)
        mu = one = neg = 0
        for _ in range(PAIRS):
            a, b = person(rng), person(rng)
            sab, sba = score(m, a, b), score(m, b, a)
            if sab > 0 and sba > 0:
                mu += 1
            elif sab < 0 and sba < 0:
                neg += 1
            else:
                one += 1
        pool = [person(rng) for _ in range(POOL)]
        diff = 0
        for i, a in enumerate(pool):
            others = [j for j in range(POOL) if j != i]
            give = max(others, key=lambda j: score(m, a, pool[j]))
            get = max(others, key=lambda j: score(m, pool[j], a))
            diff += give != get
        print("      {:3.1f}       {:6.3f}    {:6.3f}      {:6.3f}"
              "            {:5.3f}".format(r, mu / PAIRS, one / PAIRS,
                                          neg / PAIRS, diff / POOL))
    print("\nReading: with a symmetric M (r = 0) no pair is one-way. As the")
    print("antisymmetric part grows, more pairs have scores of opposite sign")
    print("and a person's best match depends on which direction is asked.")

Single source and citation

Fan, Y. (2026). Dyadic Phase Coupling, Bilinear Compatibility Tensors and Spatiotemporal Grid Games (Version 1.0.0), Chapter 1: A Match Score Is a Bilinear Form. 5D Library. https://doi.org/10.5281/zenodo.24090172

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

BibTeX
@book{fan2026062,
  author    = {Fan, Yafu},
  title     = {Dyadic Phase Coupling, Bilinear Compatibility Tensors and Spatiotemporal Grid Games},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090172},
  url       = {https://doi.org/10.5281/zenodo.24090172}
}

Other chapter answers in this book