deck-collapse-statement

and · drafted

Statement

For a human inductor H and an AI inductor A whose chooser satisfies REGULARITY on an efficiently describable sequence of finite menus, soft Total Trust of H in A implies Value on that sequence, and Value on regular menu sequences implies the tower E^H_n E^A_n V_n ≈_n E^H_n V_n.

Source

projects/deference/faf-cleanroom-2026-10-02/sources/Boundedly Rational Deference.pdf, slides 7–11 and 19: "Translating VALUE" ("A_n any 'regular' sequence of decision problems, expressed as e.d. sets of bounded real variables (LUVs)"), "Translating TOTAL TRUST (TT)", "When Does TT ⟹ VALUE?", the counterexample and REGULARITY, "VALUE ⟹ TOWER", and the appendix proving the bounds transfer. The deck is the maintainer's own (title slide: "Boundedly Rational Trust", Abram Demski); mathematics transcribed from handwriting.

projects/deference/note-dump-2026-08-11/wiki/total-trust-implies-value.md, (H3) Conditional-stability, marked "(Abram, 2026-07-25; mass-weighted one-sided form 2026-07-26)".

Notes

The statement the maintainer presents, filed as its own literal claim and a refinement of the corpus construal li-deference-collapse, which states Value unscoped. Its scope premise (REGULARITY holds of non-trivial menus) and the expert's asymptotic self-knowledge are assumption leaves, so the view shows both the literal claim and the implication deck-collapse-statement@valid.

The deck's two closing arrows (Tower ⟹ Total Trust and Value ⟹ Total Trust) are title-only slides and are not part of this statement; their prose pages are tower-implies-total-trust.md and two-option-value-iff-total-trust.md.

Reading REGULARITY as the wiki's H3 is the filing session's reading (regularity-is-h3 asks the maintainer). The decomposition into two arrows, the premise and the self-knowledge assumption follows the slides' order.

Author and human events

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

No human event has touched this node.

Edges

Above

part of deference-and-trust
root (shared-claim) of deference-and-trust

Children

part: deck-tt-implies-value-regular leaf/step
part: deck-value-implies-tower leaf/step
part: deck-regularity-premise leaf/assumption
part: expert-knows-own-estimates-asymptotically leaf/assumption
part: deck-collapse-statement.complete leaf/completeness

Ranking (the lens, not the structure)

{
 "status": "open",
 "diagnosis": null,
 "flags": [
  "AI number",
  "refinement of li-deference-collapse"
 ],
 "V": {
  "V_prior": null,
  "display": "2",
  "headline": 2,
  "ref": 2,
  "valid": 2,
  "weaker": "both"
 },
 "belief": null,
 "draft": "ai",
 "root": {
  "status": "open",
  "Pr": {
   "hi": "1/1",
   "lo": "694312983/204800000000000",
   "mid": "269856167119/1280000000000"
  },
  "value": null,
  "cost": "165/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