agency-correspondence-refuted

and · drafted

Statement

Under determination of actions by policy and observation and recoverability of the policy from behaviour alone, two agency attributions to the same behaviour need not agree on the policy; agreement needs perfect condensation of both models.

Source

projects/deference/faf-cleanroom-2026-10-02/packages/udt-condense-dd/udt-condense-dd-findings.md, item 6 ("Correspondence theorem for agency"): "Under the note's two formal conditions (determination H(A_i | Π, O_i) = 0, recoverability H(Π | behaviour) = 0) the conclusion is false: agency_correspondence_fails on four uniform worlds with Pol₂ = (Pol₁, one more bit of behaviour). Eisenstat's Theorem 4.15 needs perfect condensation of both models".

Notes

A negative result Stage 5 starts from rather than from the retracted chain the clean room catalogues (item 3, 'so nobody resurrects it'). It bounds the representation theorem: agreement of two interpretations needs perfect condensation of both, which the corpus never verified for agents.

Bridge card

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

Declaration agency_correspondence_fails (record agency-correspondence-refuted.record)

Bridge (formalizer-stated; agency-correspondence-refuted.bridge, drafted):

The declaration's four-world witness is a counterexample to the corpus's correspondence theorem for agency as stated, with the corpus's determination and recoverability conditions as its hypotheses.

Hypotheses, read:

Completeness (agency-correspondence-refuted.complete): No premise beyond determination and recoverability is in the refuted claim, so the counterexample refutes it as stated.

Author and human events

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

No human event has touched this node.

Edges

Above

part of stage5-li-representation-theorem
root (shared-claim) of stage5-li-representation-theorem

Children

part: agency-correspondence-refuted.record leaf/record
part: agency-correspondence-refuted.bridge leaf/bridge
part: agency-correspondence-refuted.complete leaf/completeness

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": "3598771/40000000",
   "mid": "69872127/80000000"
  },
  "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