Book 3 · The Mini-Beast · Chapter 31 of 44

EDUCATION

Week 6 · Threshold Crossing

Cross your own κ*. Submit something to a public log.

κ ≥ κ*

Sigil κ Operator U CEFR B1-B2 Week 6
C · CompressionK · ThresholdF · FoldU · UnfoldingG · Generation
Version — Book 3 v2 (web, dated 2026-09-25). This page is the live web edition, part of Book 3 version 2, to be deposited on Zenodo at the March 2027 equinox. Added since version 1: three worked examples of the objection types, taken from this book's own 2026-09 Lean audit. Version 1, as taught and deposited: 10.5281/zenodo.22947908.

The TaskCross Your Own κ*

Submit something to a public log. Not a polished paper — a dated, citable, publicly visible statement of a claim you are prepared to defend. This is the first milestone of the program and it is deliberately uncomfortable.

The discomfort is the content. Everything up to week 6 is reversible: notes can be rewritten, drafts discarded. A public log entry is the first irreversible step, which is exactly what the F operator is. You are not being asked to be right. You are being asked to be on record.

κ ≥ κ*week 6 · the threshold crossing, applied to yourself

Anticipating CounterargumentsThe Skill This Week Teaches

A claim that has not been attacked has not been tested, and the cheapest attacker available is you. Before posting, write the three strongest objections to your own claim — and write them as an opponent would, not as a straw man you can knock down.

Objection type 1 · the number has no derivation

Where did your number come from? If the answer is ‘another document’, follow the citation until it touches ground. A result missing a derivation, a dataset and reproducible code is not a weak result; it is a placeholder that looks like one.

Objection type 2 · the label is doing the work

A green verification badge, a status cell reading proved, a DOI in the reference list — these are claims about evidence, not evidence. Styling is free. Check that yours points at something.

Objection type 3 · it explains rather than predicts

Does your claim account for data you had already seen, or does it commit you to an observation you have not made yet? Only the second kind can be wrong, and only the second kind is worth logging.

Where and When to Submit

WhereAnywhere dated, public and citable. A Zenodo deposit, a GitHub Pages entry with commit history, a preprint server appropriate to your field. The requirement is not prestige; it is that the date cannot be edited afterwards.
WhenWhen the claim is falsifiable and you can state what would falsify it — not when it is finished. Waiting for finished is how week 6 becomes week 40.
What to includeThe claim, the derivation or the data, the three objections you wrote, and your honest confidence. An explicit uncertainty is a stronger position than a hedge.

A negative result is a legitimate submission and often the more useful one. The standing example in this corpus is an audit that refuted a bridge in the author’s own material and published the failing symbolic computation alongside it. That is what crossing the threshold looks like when it goes well.

Worked ExamplesThe Three Objections, Applied to This Book

Lean status (Book 3 v2, 2026-09-25) — one example of each objection, from this book. Type 1, the number has no derivation: the plasma chapters printed df ≈ 1.43 from λ = 0.6 and μ = −0.42, but the formula gives 2.70; 1.43 needs λ ≈ 0.133 (PlasmaRoom.lean). Type 2, the label is doing the work: chapter 1 carried “SORRY_COUNT: 0” badges for four figure-eight files that had never been built; on first build they gave 30 errors, and are now corrected and kernel-checked (Figure8). Type 3, explains rather than predicts — and here a prediction that could be wrong, and is: chapter 3 predicted that doubling every molecular rate leaves the circadian period unchanged; for any autonomous system, doubling every rate halves the period (CircadianReeb.lean). Each correction was published beside the original, dated, in the version 2 notes.

BridgesWhere This Connects

← PreviousWeek 5 · Neural Oscillations