What does Memory, Signals and Reunion after a Rupture conclude, in numbers, about “Signals That Can Be Believed”?
Answer: Chapter 4 uses a signalling game and Bayes' rule to show that a happy post moves the belief that someone has changed only from 0.300 to 0.325, while four months of steady conduct move it to 0.696.
Scope of the numbers: Its parameters are illustrative or synthetic; all calculations are generated by its programs; the book is not psychological counselling or therapy and not a manual for winning anyone back, and the other person's decision is theirs. Marked boxes separate published evidence, runnable Python calculations (16 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. printed values that match the answer: 0.300, 0.325, 0.696
| evidence seen | posterior |
|---|---|
| nothing (prior) | 0.300 |
| cheap display | 0.325 |
| cheap display, three times | 0.379 |
| four steady months | 0.696 |
| direct demand | 0.125 |
| four steady months + direct demand | 0.432 |
| four steady months + respects a no | 0.837 |
Show the full program
# Chapter 4. p08: What the other person can infer. Prior that the
# sender has really changed: 0.3. Each observation has a probability
# under H and under L; the posterior is updated by Bayes' rule.
# cheap display (a happy post): H 0.90, L 0.80
# four months of steady conduct: H 0.80, L 0.15
# a direct demand for commitment: H 0.20, L 0.60
# a reply that respects a "no": H 0.90, L 0.40
SIG = {"cheap display": (0.90, 0.80), "four steady months": (0.80, 0.15),
"direct demand": (0.20, 0.60), "respects a no": (0.90, 0.40)}
def post(prior, seq):
p = prior
for s in seq:
h, l = SIG[s]
p = p * h / (p * h + (1 - p) * l)
return p
if __name__ == "__main__":
print(" evidence seen posterior")
for seq in ((), ("cheap display",), ("cheap display",) * 3,
("four steady months",), ("direct demand",),
("four steady months", "direct demand"),
("four steady months", "respects a no")):
lab = " + ".join(seq) if seq else "nothing (prior)"
if len(seq) == 3:
lab = "cheap display, three times"
print(" {:<42} {:9.3f}".format(lab, post(0.3, seq)))Single source and citation
Fan, Y. (2026). Relationship Rupture Survival Analysis, No-Contact Memory Decay and Reconciliation Game Windows (Version 1.0.0), Chapter 4: Signals That Can Be Believed. 5D Library. https://doi.org/10.5281/zenodo.24090241
DOI: 10.5281/zenodo.24090241 · Read the monograph · 5DL-B-092 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026092,
author = {Fan, Yafu},
title = {Relationship Rupture Survival Analysis, No-Contact Memory Decay and Reconciliation Game Windows},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090241},
url = {https://doi.org/10.5281/zenodo.24090241}
}Other chapter answers in this book
- Chapter 1 · Reconciliation as a Survival Problem
- Chapter 2 · Two Memories Fading at Two Speeds
- Chapter 3 · The Reactance Ratchet: Why Early Pressure Backfires
- Chapter 5 · How Long Reunions Last
- Chapter 6 · Two Resting States: Gottman's Difference Equations
- Chapter 7 · "Mang", "Gu feng" and "Bai tou yin"
- Chapter 8 · Practice: Three Ways to Spend the Year, Measuring Oneself, and Too Few Cases