li-corrigibilization-theorem.record
leaf/record · drafted
Statement
The corrigibilization transform preserves the principal's options, and its structural bypass inequality compiles into a bounded combination of logically uncertain variables with constant coefficients that a logical inductor learns uniformly over efficient menus, with a directional mismatch term.
Source
projects/deference/rounds/2026-09-15-li-corrigibility/README.md and THEOREM.md (statements T1 to T4; Lean files LICorrigibility.lean, LICorrigibilityCertificate.lean and Corrigibilization.lean; "Landed on main by the landing pass (PR #100); nothing is registered").
Author and human events
Author @smithy-verity; version 1; size S.
No human event has touched this node.
Edges
Above
- part of li-corrigibilization-theorem
Ranking (the lens, not the structure)
{
"status": "open",
"diagnosis": null,
"flags": [
"AI number",
"not in a claims registry"
],
"V": {
"V_prior": null,
"display": "2",
"headline": 2,
"ref": 2,
"valid": 2,
"weaker": "both"
},
"belief": {
"J": 0,
"mid": "4/5",
"range": [
"3/10",
"1/1"
],
"width": "1/1"
},
"draft": "ai"
}Say something about it
Each verb opens a prefilled issue; a round files what lands as the ledger event it is.