uea-floored-agent-theorem

and · drafted

Statement

In the finite shadow of Cole Wyeth's setting, every fixed point of the agent with a one-query current-node self-trust floor is near-optimal at every history, with value gap bounded in terms of the odds O_h against the self-hypothesis and no factor in the number of actions.

Source

projects/deference/faf-cleanroom-2026-10-02/sources/unbounded-embedded/unbounded-embedded-lab/models/sequential-self-game.md: "Every fixed point of the current-node floor is near-optimal at every history"

projects/deference/faf-cleanroom-2026-10-02/packages/uea-cole-shadow/uea-cole-shadow-report.md.

projects/deference/faf-cleanroom-2026-10-02/DIGEST.md.

projects/deference/faf-cleanroom-2026-10-02/OPEN.txt: "Cleanroom.Uea.UeaColeShadow.Model.theoremC_log_open"

Notes

A refinement of uea-theorem-1 (refinement_of): the theorem restated for a slightly different agent in a finite model. The ln-plus form with the tight rate Θ(δ log(1/δ)) and the existence of pure floored fixed points are open rows of the public clean room (OPEN.txt), which the improvement claim's routes carry.

Bridge card

Connected to no informal claim yet: held by no frame.

Declaration Cleanroom.Uea.UeaColeShadow.Model.theoremC (record uea-floored-agent-theorem.record)

Bridge (formalizer-stated; uea-floored-agent-theorem.bridge, drafted):

The finite model of the uea-cole-shadow package (finite trees, finitely many hypotheses, the floored agent defined by one oracle query on a comparison machine) is the finite shadow of Cole Wyeth's rOSI setting, and theoremC is the horizon form of the lab note's Theorem C.

Hypotheses, read:

Completeness (uea-floored-agent-theorem.complete): No premise beyond the kernel-checked declaration and the reading its bridge states is needed for the claim of uea-floored-agent-theorem to hold of the finite model.

Author and human events

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

No human event has touched this node.

Edges

Above

part of level-super-turing
root (shared-claim) of level-super-turing

Children

part: uea-floored-agent-theorem.record leaf/record
part: uea-floored-agent-theorem.bridge leaf/bridge
part: uea-floored-agent-theorem.complete leaf/completeness

Ranking (the lens, not the structure)

{
 "status": "open",
 "diagnosis": null,
 "flags": [
  "AI number",
  "refinement of uea-theorem-1"
 ],
 "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": "47/625",
   "mid": "7857/10000"
  },
  "value": null,
  "cost": "99/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