Alignment Workspace

ladder-chain-as-written

leaf/step · drafted

Statement

For [0, 1]-valued quote and credence sequences and soft gates, the chain from summable unmargined violations to the per-day product law to summable margined violations holds.

Source

projects/deference/note-dump-2026-08-11/notes/li-deference.md L244: "$$\sum_n^\infty v_n <\infty \implies q_n \gtrsim_n 0 \implies \sum_n^\infty w_n < \infty$$"; L246: "Why do we want to weaken so? Because the two stronger versions will turn out to be infeasible."

projects/deference/faf-cleanroom-2026-10-02/packages/tt-ladder/tt-ladder-findings.md F2, verdict: the argument "is right for hard gates and wrong for soft ones: the margin makes the violation ramp saturate, but nothing stops the gate from shrinking".

Notes

The chain of li-deference.md read literally. Its second link is refuted in Lean for soft gates (not_forall_lProdSeq_imp_tSeq, with an explicit witness); its first link is proved for e ≥ 0 (lProdSeq_of_bvSeq). An invalid toy that still counts as improvable (graph/PROTOCOL.md, section 2, Improvement claims): see ladder-chain-as-written.improvable.

Author and human events

Author @smithy-verity-opus55; version 1; size S.

No human event has touched this node.

Edges

Above

Ranking (the lens, not the structure)
{
 "status": "open",
 "diagnosis": null,
 "flags": [
  "AI number"
 ],
 "V": {
  "V_prior": null,
  "display": "2",
  "headline": 2,
  "ref": 2,
  "valid": 2,
  "weaker": "both"
 },
 "belief": {
  "J": 0,
  "mid": "3/200",
  "range": [
   "0/1",
   "103/200"
  ],
  "width": "1/1"
 },
 "draft": "ai",
 "root": {
  "status": "open",
  "Pr": {
   "hi": "103/200",
   "lo": "0/1",
   "mid": "3/200"
  },
  "value": null,
  "cost": "33/1",
  "margin": "no established leaves"
 }
}

Say something about it

Each verb opens a prefilled issue; a round files what lands as the ledger event it is.

comment · challenge · estimate · want