li-corrigibilization-theorem
and · 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").
Notes
A public round, distinct from bli-corrigibility-thesis despite the similar name. The record names T1's response-authority theorem, one declaration of the spine T1 to T4, since the round registers nothing and names its declarations provisional. Work pointer: the round directory.
Bridge card
Connected to no informal claim yet: held by no frame.
Declaration K_iff_exists_response (record li-corrigibilization-theorem.record)
The round's four statements are the public line's corrigibility result at the logical-induction level, distinct from this branch's BLI-level thesis.
Hypotheses, read:
- li-corrigibilization-theorem.setting definitional: The corrigibilization transform over a logical inductor with efficient menus and the round's bypass inequality, as the round's Lean files fix them.
Completeness (li-corrigibilization-theorem.complete): No premise beyond the proved declaration, its stated setting and its bridge is needed for the informal reading of li corrigibilization theorem to hold.
Author and human events
Author @smithy-verity; version 1; size M.
No human event has touched this node.
Edges
Above
- part of public-corrigibility-line
- root (shared-claim) of public-corrigibility-line
Children
- part: li-corrigibilization-theorem.record leaf/record
- part: li-corrigibilization-theorem.setting leaf/hypothesis
- part: li-corrigibilization-theorem.bridge leaf/bridge
- part: li-corrigibilization-theorem.complete leaf/completeness
Work pointers
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": null,
"draft": "ai",
"root": {
"status": "open",
"Pr": {
"hi": "1/1",
"lo": "58671/8000000",
"mid": "403767/1000000"
},
"value": null,
"cost": "132/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.