关于「情境线索自动化指数:线索熵、时段与重复次数时钟」,《习惯渐近曲线与二十一天神话》给出的定量结论是什么?

结论:习惯是情境与反应之间的联结,情境越稳定,联结形成越快。本章用前置事件与时段的香农熵定义了情境线索自动化指数:只有一个线索时指数为 1.000,完全随机时降到 0.145,在示意换算下 T95 从 59.0 天延长到 121.2 天。早上与晚上执行的差距,在实证研究中是 105.95 天对 154.01 天。把横轴从天数换成重复次数,一天 6 次的行为 11 天就到达平台,一周 2 次的行为要 184 天。对经营者而言,成本最低的加速手段不是延长打磨内容,而是在开营第一天帮每个成员选定一个固定的前置事件,并按重复次数而不是日历天数安排周期。下一章讨论测量本身:量表能看见多小的变化,以及为什么平均曲线会误导。

数据口径:书中的人群参数、遗忘速率与线索指数均为示意;全部计算由书中程序生成;本书不是医疗或心理建议,也不是个人化的经营建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(19 段程序)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.145, 1.000, 121.2, 59.0, 95

logcuesCAIT95 (days)
one anchor, one slot11.00059.0
one anchor, 2 slots20.82066.1
2 anchors alternating20.79267.4
weekday vs weekend50.75969.0
no fixed anchor190.145121.2
Fournier ratio of T95, evening / morning: 1.454
CAI that would match it if morning = 1: 0.480
flag (CAI < 0.50): 1 log; strong (CAI >= 0.75): 4 logs
查看完整验算程序
# Chapter 5. p51: A cue-based automaticity index (CAI) from a 28-day log.
# Each day records the anchor that preceded the behaviour (an event such
# as "after coffee") and a time slot. CAI = 1 - H / H_max, where H is the
# Shannon entropy (bits) of the observed (anchor, slot) pairs and H_max =
# log2(28) is the entropy of 28 all-different days. The author's
# illustrative link to the rate: c = c_top * (0.4 + 0.6 * CAI), with c_top
# set so that CAI = 1 gives T95 = 59 days (the drinking median of Lally
# et al. 2010). Fournier et al. (2017): morning 105.95 vs evening 154.01
# days; we ask what CAI gap the link would need to produce that ratio.
# Grouping thresholds 0.5 and 0.75 are the author's, for convenience.
import math
import random
from collections import Counter

DAYS = 28
H_MAX = math.log2(DAYS)
LN20B = math.log(20 * 30 / 35)
C_TOP = LN20B / 59.0


def cai(log):
    n = len(log)
    cnt = Counter(log)
    h = -math.fsum(v / n * math.log2(v / n) for v in sorted(cnt.values()))
    return 1.0 - h / H_MAX, len(cnt)


def t95(index):
    return LN20B / (C_TOP * (0.4 + 0.6 * index))


rng = random.Random(20261112)
anchors = ["coffee", "commute", "lunch", "shower", "dinner", "bed"]
slots = ["06", "08", "12", "18", "21", "23"]
logs = [
    ("one anchor, one slot", [("coffee", "08")] * DAYS),
    ("one anchor, 2 slots", [("coffee", "08" if d % 7 < 5 else "10")
                             for d in range(DAYS)]),
    ("2 anchors alternating", [("coffee", "08") if d % 2 else
                               ("dinner", "18") for d in range(DAYS)]),
    ("weekday vs weekend", [("commute", "08") if d % 7 < 5 else
                            (anchors[d % 6], slots[d % 6])
                            for d in range(DAYS)]),
    ("no fixed anchor", [(rng.choice(anchors), rng.choice(slots))
                         for _ in range(DAYS)]),
]
print("  log                     cues   CAI     T95 (days)")
for name, log in logs:
    v, m = cai(log)
    print("  %-22s %5d   %5.3f   %10.1f" % (name, m, v, t95(v)))
ratio = 154.01 / 105.95
print("")
print("Fournier ratio of T95, evening / morning: %.3f" % ratio)
# solve 0.4 + 0.6 * hi = ratio * (0.4 + 0.6 * lo) with hi = 1
lo = ((0.4 + 0.6) / ratio - 0.4) / 0.6
print("CAI that would match it if morning = 1: %.3f" % lo)
LOW, HIGH = 0.5, 0.75
flagged = [n for n, log in logs if cai(log)[0] < LOW]
strong = [n for n, log in logs if cai(log)[0] >= HIGH]
print("flag (CAI < %.2f): %d log; strong (CAI >= %.2f): %d logs"
      % (LOW, len(flagged), HIGH, len(strong)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《习惯形成渐近曲线、二十一天神话证伪与情境线索自动化指数母典》第 5 章「情境线索自动化指数:线索熵、时段与重复次数时钟」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-197 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026197,
  author    = {Fan, Yafu},
  title     = {Asymptotic Habit-Formation Curves, Debunking the 21-Day Myth and a Cue-Based Automaticity Index},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论