li-corrigibility-inequality-public
leaf/step · drafted
Statement
The structural bypass inequality of the corrigibilization theorem compiles into a bounded combination of logically uncertain variables with constant coefficients, which a logical inductor learns uniformly over polynomial-size efficiently generated menus, with a directional mismatch term.
Source
projects/deference/rounds/2026-09-15-li-corrigibility/README.md, headline: "the structural bypass inequality of the corrigibilization theorem compiles into a bounded LUV-combination with constant coefficients"; projects/deference/rounds/2026-09-15-li-corrigibility/THEOREM.md (T1 to T4) and LI_CORRIGIBILITY.md.
Notes
A public LI-register result of the corrigibility line; the evidence parent of the item-109 question, because the compilation technique is what that item would use (the filing session's reading). Registry entry not checked here.
Author and human events
Author @smithy-verity; version 1; size S.
No human event has touched this node.
Edges
Above
- held by legitimacy
Ranking (the lens, not the structure)
{
"status": "open",
"diagnosis": null,
"flags": [
"AI number",
"held by legitimacy"
],
"V": {
"V_prior": null,
"display": "2",
"headline": 2,
"ref": 2,
"valid": 2,
"weaker": "both"
},
"belief": {
"J": 0,
"mid": "43/50",
"range": [
"9/25",
"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.