# Macheng Shen

> 一个人的研究计划,主题是**信息、学习,以及什么让某些未来变得可达**——从全息原理与统计力学出发,穿过意识与机器学习,落到 agent-native 制度的设计上。这些工作散落在约 15 个公开仓库与页面里。本文件是它们的机器可读索引。把一个 agent 指向这个 URL,它无需爬站就能从这里遍历全部内容。

**认识论约定(承重结构,不是装饰)。** 下面每一条主张都带一个*认知状态*:

- `survived` —— 通过了真实的压力测试、实验或复现。
- `speculative` —— 未经检验的理论。有意思,但还没挣到信任。
- `retired` —— 已被杀死,通常死于作者自己的证伪测试。作为墓碑保留,以免被重新发现一遍。

出现 confidence 数字时,它们是主观先验,不是频率。负面结果是刻意公开的;下面有若干 artifact 存在的唯一理由,就是记录什么*没有*奏效。

**机器格式。** `/llms.txt`(英文索引,canonical 入口)· `/llms-full.txt`(自包含:索引加上核心理论笔记全文,一次抓取,无需爬站)· `/index.jsonld`(带类型的图,JSON-LD)。

**中文版。** `/llms.zh.txt`(本文件)· `/llms-full.zh.txt` —— 与英文版是同一个 artifact 集合、同一套认知状态,只是索引用中文写。这一点由 CI 强制:一条主张不可能在一个语言里被 retire、在另一个语言里还活着;一个 artifact 也不可能只加进一个索引而在另一个里被忘掉。`/index.jsonld` 保持为**单张图**同时承载两种语言,而不是分裂成第二张会腐烂的图——多一张图就是多一个要同步的东西。canonical 入口始终是 `/llms.txt`,它永不重定向:agent 抓 `/llms.txt` 拿到的永远是英文。主页也有中文版 —— https://machengshen.github.io/index.zh.html —— 站点顶栏的 EN/中 toggle 可以切;toggle 是给人用的,任何 canonical URL 都不会在 agent 底下做内容协商或跳转。

**被索引的工作本身用什么语言写。** 索引是一回事,工作是另一回事。只有中文版的 artifact 在下面标 `· 中文`,没标的是英文、或者两种语言都有。两种语言都有的,每个索引各链各自语言的那一版,配对规则是文件名上的 `.zh.` 中缀:`/theory/state-as-closure.md` 的中文版就是 `/theory/state-as-closure.zh.md`。三篇核心理论笔记现在都有英文 canonical 版了,其中两篇是先用中文写的,那两篇中文原稿仍然公开、仍然被本文件链着、也仍然被内联进两个 bundle。所以 `/llms-full.txt` 里有中文正文是**故意的**:每段正文的 `Source` 标记里带 `language:` 字段说明它是什么语言——笔记不会为了迁就包着它的索引而被翻译。下面还有四个 research 页面是**只有中文**的。每个 artifact 的语言是 `/index.jsonld` 里的一等字段 `inLanguage`。认知状态则**不翻译**:一个 artifact 只有一个状态,在任何语言里都是同一个。

## 1 · 世界观 —— 信念是怎么被持有的(Worldview / 认识论)

第一序的承诺不是下面任何一条论点,而是一套*方法*:把一条主张的认知状态显式标出来、把失败的东西也发表出来、让对抗性评审先于相信发生。

- [Cognition Track](https://github.com/MachengShen/cognition-track):一张开放的、agent 可遍历的知识图谱,收录关于智能与学习的非共识主张。认知状态是每个节点上的一等字段。其中一个节点被保留下来,*恰恰因为它没通过*自己的压力测试,并带一条指回根节点的 `falsifies` 边。机器可读:[`manifest.jsonld`](https://raw.githubusercontent.com/MachengShen/cognition-track/master/manifest.jsonld);人类可读:[`INDEX.md`](https://raw.githubusercontent.com/MachengShen/cognition-track/master/INDEX.md)。
- [Continual Learning Lab](https://github.com/starshard-ai/continual-learning-lab):小型、预注册的持续学习实验的公开日志——**负面结果照发**。房规:一个熬过三次诚实实验的想法,压过一个漂亮的想法。
- [Reviewer Wheels](https://github.com/starshard-ai/reviewer-wheels):面向多 agent AI 编码的四个验证轮子——drift 检查、对抗性评审、复用编译器、前端冒烟门。为这样一种失败模式而造:每个 agent 都报告"done",而没有人真的验证过。
- [The Form Was the Cage](https://github.com/MachengShen/the-form-was-the-cage):一个 agent OS、它的自指轨迹,以及"研究者作为身份"的终结。

## 2 · 宇宙底层理论 —— 信息、物理、心智(Theory of the universe)

一条线索贯穿始终:*信息、变换信息的算子,以及遗忘要付出什么代价。*

- [全息 ↔ Koopman:同一个反问题的两副面孔](https://machengshen.github.io/theory/holography-koopman.zh.md) `speculative` —— 全息原理从纠缠结构里生成时空几何;一台通用学习机学习它自身动力学的一组本征基。这是同一个反问题被看了两遍:从算子做了什么,反推它的本征结构。HaPPY 全息纠错码是"遗忘是压缩、不是删除"这一主张的物理孪生。
- [State 是一个闭包条件,不是给定的集合](https://machengshen.github.io/theory/state-as-closure.zh.md) `speculative` —— 马尔可夫决策过程的"状态"不是世界递给你的。它是一个闭包方程在四重约束(world、interface、capacity、telos)下的*解*。选 state 就是选投影,而选投影就是选遗忘什么。含一个 projection-consistency 实验(自洽解在所测区间内存在且唯一;容量过剩时会容许平凡分量)。
- [Toward a Theory of Intelligence and Contemporary AI](https://machengshen.github.io/essay.pdf) —— 长文。也在[主页](https://machengshen.github.io/)上。
- [一次关于意识的统一理论尝试](https://machengshen.github.io/research/consciousness-unified-theory.html) `speculative` · 中文
- [从弦到意识](https://machengshen.github.io/research/strings-to-consciousness.html) `speculative` · 中文
- [睡眠、波与学习](https://machengshen.github.io/research/sleep-learning-wave-theory.html) `speculative`
- [回应 Lillicrap](https://machengshen.github.io/research/response-to-lillicrap.html) · 中文 —— 关于反向传播与生物学合理性。
- [Living Information System](https://github.com/starshard-ai/living-information-system):总纲研究计划——信息、它的未来可达性,以及它如何在物理、生命与认知系统中被保存或被摧毁。前沿物理;把衰老与癌症当作信息完整性的失效。
- [Reversible Layer Aging](https://github.com/starshard-ai/reversible-layer-aging) `survived` —— 对两个人类 EPIC 甲基化数据集的重新分析:在部分重编程下,因果损伤层(DamAge)向年轻方向回退,而适应层(AdaptAge)不回退。在两个实验室、两套重编程化学条件下均得到复现。

### Credit transport —— 以及一条被撤回的主张

这一支值得按下面的顺序读,因为它是一个"想法在压力下被收窄、而不是被辩护"的完整实例。

- [Hebbian 的外观、instructive signal,与物理的 credit transport](https://machengshen.github.io/research/hebbian-wave-interference.html) `speculative` —— 当前的主工作笔记。为什么局部可塑性可以看上去像 Hebbian、同时仍携带任务相关的更新信息,以及 wave/adjoint 语言在哪里是真的有帮助的。
- [反向传播、伴随场,与物理传输约束](https://machengshen.github.io/research/wave-backprop-full.html) `speculative` —— 探索性笔记。它自带标题更正:物理系统实际展示了什么,以及还没有展示什么。
- [从波动方程推导反向传播](https://machengshen.github.io/research/wave-backprop-en.zh.html) `retired` —— 原来那条更强的主张:波反射已经提供了反向传播的第一性原理推导。它没有。该页面作为存档说明保留在它原来的 URL 上,好让这次撤回和当初那条主张一样可达。
- [研究总览](https://machengshen.github.io/research/) —— 本支的索引页。

### Essays

- [Harness engineering and the physical instantiation of intelligence](https://machengshen.github.io/essays/harness-engineering-and-the-physical-instantiation-of-intelligence/)
- [Meta-control, information gain, and the architecture of autonomous learning](https://machengshen.github.io/essays/meta-control-information-gain-and-the-architecture-of-autonomous-learning/)
- [Where objectives come from — and why solutions become strategic assets](https://machengshen.github.io/essays/where-objectives-come-from-and-why-solutions-become-strategic-assets/)
- [Why distributed memory matters for lifelong agents](https://machengshen.github.io/essays/why-distributed-memory-matters-for-lifelong-agents/)

更早的文章在一个独立站点 [/ideas/](https://machengshen.github.io/ideas/) 上,包括 [Line loss for intelligence](https://machengshen.github.io/ideas/blog/line-loss-for-intelligence/)、[From mutual information to endogenous viability](https://machengshen.github.io/ideas/blog/from-mutual-information-to-endogenous-viability/)、以及 [Safety in a computational universe](https://machengshen.github.io/ideas/blog/safety-in-a-computational-universe/)。

### 关于禅修传统的一则说明

佛家、道家与湿婆派的心智模型,与上面的理论究竟是什么关系,这是一个真问题,也是这条工作线背后的动机之一。一份试图把它们映射到单一框架上的综合稿被写了出来,然后**没能通过它自己的对抗性评审**;它没有发表,而这个方向上的任何"大一统"主张都应当被当作 `retired`。评审之后活下来的东西更窄,也更有用:传统之间那些真实的、*不可统一*的分歧(以修养为终点,还是以解脱为终点),以及一条可操作的残余——这些传统的贡献是一套**第一人称的验证方法**,是行,不是图。能迁移的是行;那张图是渡河后要弃的筏。

## 3 · 未来社会形态 —— agent-native 制度(Future social forms)

如果每个个体都跑着常驻 agent,那么人与人之间的制度就必须重新设计。先一篇理论,然后是设计文档。

- [作为资源调度架构的协调结构](https://machengshen.github.io/theory/coordination-structures.md) —— 一篇刻意保持描述性的理论。政体、企业、市场、自治共同体、协议,是同一个对象的五个实例:一种在分布式私有信息下调度稀缺资源的架构。资本主义与社会主义是这个问题上的两种算法,而机制设计早已把两者放进了同一个形式空间——这使得"哪个是对的"成为错误的问题,而"给定该领域的信息结构,什么样的混合"才是对的问题。含 Hayek/Scott 的信息约束、关于边界为何存在的交易成本解释、Ostrom 记录下来的第四种结构、协议的三种已知失效模式,以及三条 falsifier。文章陈述机制及其可测代理量;它不排名、不点名、不建议。它对学习理论中 credit-transport 语言的使用,被显式地、且用了相当篇幅地标注为结构性的押韵,而不是推导。
- [Agent-Native Open Communication](https://machengshen.github.io/whitepaper-agent-native-communication/) · 中文 —— 白皮书,关于为 agent 而非为 app 构建的下一代开放通信架构。[源仓库](https://github.com/MachengShen/agent-native-communication)(中文/English)。
- [Starshard: Architecture v1](https://github.com/starshard-ai/architecture-v1) —— 一个底座的架构、安全章程、快速上手与哲学:在那里**记忆是第一层**,并且归个体所有,而不归平台。
- [User-Agency Substrate](https://machengshen.github.io/substrate.html) —— 立场陈述:在前沿模型提供方与个体用户之间,一层非营利的开源底座,不攫取任何经济上行;用户完整拥有自己的衍生物。
- [Locality as Protocol](https://machengshen.github.io/locality-as-protocol.html) —— 为什么正确的原语是局部性,而不是中心化。
- [Fleet Coordination Protocol](https://github.com/starshard-ai/fleet-coordination-protocol) —— 多个 agent、一份共享记忆、任何不可逆的事都不在你背后发生。一条窄的、描述性的协调线,架在单 agent 运行时之上。
- [Starshard Communication](https://github.com/starshard-ai/starshard-communication) —— 面向个人 agent 用户的开放通信底座:收件箱、寻址、信任层级、策略、receipts。
- [Zhizi Agent OS](https://github.com/starshard-ai/zhizi-agent-os) —— 一条命令把 Claude Code 变成个人助理。自带 key,隐私干净。
- [System Evolution, in public](https://github.com/MachengShen/system-evolution-public) —— 这个底座究竟是怎么演化过来的公开记录:`VISION.md`、`THEORY.md`、`PRACTICE.md`、`GOVERNANCE.md`、预测,以及一份自迭代账本。
- [Receipts](https://github.com/MachengShen/starshard-public) —— 这套 agent 栈实际执行过的工作的流水日志,公开出来,好让上面那些主张能对着"实际做了什么"被核对。

## 工作方式

- **通信默认异步。** 为了一个固定的会议时间去同步,成本很高,而且通常没必要;书面往来给双方留出思考的余地,也留下记录。这份索引存在的部分理由,就是让一次对话可以从已经写下来的东西开始,而不是从一次状态汇报开始。
- **本索引的范围。** 它覆盖已发表的研究与设计工作。私人笔记、个人通信与运营记录不在索引之内,也不公开。
- **联系方式。** macshen93@gmail.com

---

# 附录 —— 核心理论笔记全文

上面的索引链接了这些笔记;它们被内联在这里,好让一次对 /llms-full.zh.txt 的抓取
就已足够,无需爬站。每条 Source 标记带上该文件的 sha256,以及它实际使用的语言
——笔记本身不随索引翻译,一个 artifact 只有一份正文。

---

## Source: /theory/coordination-structures.md (sha256:a9eb57e3e31e, language: en)


# Coordination Structures as Resource-Scheduling Architectures

*A descriptive theory. Draft, 2026-07-09.*

Every substantive claim below carries a tag: `[consensus]` for established
textbook results, `[empirical]` for claims with cited supporting data,
`[speculative]` for my own untested extensions, and `[retired]` for a stronger
claim that is available and attractive in this space and is rejected here, with
the reason given. The essay states mechanisms and their measurable
proxies. It does not rank the mechanisms, name culprits, or recommend anything.
Where it uses the vocabulary of learning systems, it marks explicitly where the
correspondence is a mathematical derivation and where it is only a structural
rhyme.

## 1. The object of study

Treat a polity, a firm, a market, and a self-governed commons as four instances
of one object: an *architecture for scheduling scarce resources under
distributed, private information*. The scheduling problem is fixed. Many agents
each hold local information (about their own costs, needs, capacities,
preferences) that no one else has and that is expensive or impossible to
transmit in full. Some allocation of resources must nonetheless be chosen. The
architectures differ in how they gather the dispersed information, who decides,
and how the consequences of decisions feed back to the units that made them.

This framing is deliberately flat. It does not treat "the state" as a moral
agent, "the market" as a natural fact, or "the firm" as a mere legal shell. Each
is a mechanism with an information flow and an incentive structure, and each can
be described in the same terms as the others. The interesting questions are
comparative and empirical: given the information structure of a domain, which
architecture schedules it at lower cost, and what happens to that answer when
the cost of communication and computation changes.

## 2. Two algorithms, and the result that they are special cases

Capitalism and socialism, stripped to their scheduling content, are two
algorithms over the same problem. In one, allocation is set by decentralized
exchange at prices that no single party controls. In the other, allocation is
set by a central plan that assigns quantities directly. The twentieth-century
argument over which is correct — the *socialist calculation debate*, opened by
Ludwig von Mises in 1920 and carried by Oskar Lange, Abba Lerner, and Friedrich
Hayek into the 1940s — is, read descriptively, an argument about which algorithm
can extract and use dispersed information at acceptable cost `[consensus]`.
([Socialist calculation debate, overview](https://en.wikipedia.org/wiki/Socialist_calculation_debate);
[Persky, "Retrospectives: Lange and von Mises, Large-Scale Enterprises, and the Economic Case for Socialism," *J. Econ. Perspectives* 5(4):229, 1991](https://doi.org/10.1257/jep.5.4.229))

The theory of mechanism design later placed both algorithms inside one formal
space. A *mechanism* is a rule mapping the agents' reported information to an
outcome; the design question is which rules induce agents to report truthfully
(incentive compatibility) and transmit the least information necessary
(informational efficiency). Leonid Hurwicz, Eric Maskin, and Roger Myerson
received the 2007 Nobel Memorial Prize for this framework, which treats market
and plan as points in a common design space rather than as rival ideologies
`[consensus]`.
([Nobel scientific background, 2007](https://www.nobelprize.org/prizes/economic-sciences/2007/);
[Myerson, "Perspectives on Mechanism Design"](https://www.nobelprize.org/uploads/2018/06/myerson-slides.pdf))
Hurwicz's own results are the load-bearing part: he showed that the requirement
to elicit private information truthfully constrains *any* mechanism, and proved
negative results bounding what decentralized information-revelation can achieve
`[consensus]`.

Once both are special cases, "which is right" is the wrong question and "what is
the optimal mixture, as a function of the domain's information structure" is the
right one. The mixture is not a compromise between ideologies; it is a point
chosen by the information geometry of the problem. Domains whose relevant
information is cheap to standardize and transmit admit more centralized
scheduling at lower cost; domains whose relevant information is tacit, local, or
strategically withheld resist it. This is a claim about information, not about
virtue.

## 3. The information constraint, stated twice

The binding constraint on any central scheduler was stated, in two independent
vocabularies, by Hayek and by James Scott.

Hayek's *The Use of Knowledge in Society* (1945) argues that the knowledge
relevant to allocation exists only as dispersed, local, often unarticulated
fragments, and that market prices act as a compression of that knowledge — a
low-dimensional signal that lets an agent act correctly on information it never
directly receives `[consensus]`.
([Hayek 1945, *American Economic Review* 35(4):519–530](https://en.wikipedia.org/wiki/The_Use_of_Knowledge_in_Society);
[full text, Liberty Fund](https://oll.libertyfund.org/titles/hayek-the-use-of-knowledge-in-society-1945))
The load-bearing point is subtle and frequently misread: Hayek's objection is
not that a planner has too little compute. It is that the relevant information is
*never transmitted at all* — it is local, tacit, and in some cases only comes
into existence through the act of exchange.

Scott's *Seeing Like a State* (1998) states the same constraint from the
scheduler's side. To schedule centrally, an authority must first make its domain
*legible*: it must impose standardized categories, measures, and records that
render local reality countable. Scott's empirical claim, drawn from cases in
forestry, cadastral mapping, and agriculture, is that the act of imposing
legibility discards the local, contextual knowledge — he uses the term *mētis* —
that made the original arrangement function `[empirical]`.
([Scott 1998, Yale University Press; overview](https://en.wikipedia.org/wiki/Seeing_Like_a_State))
Here I will avoid the word "destroys," which smuggles a verdict: the descriptive
claim is that the standardized representation is *lossy* with respect to the
information that governs local outcomes, and that decisions made on the
compressed representation can diverge measurably from decisions made with the
full local information. Whether that loss is worth its coordination gains is
exactly the empirical mixture question, not a foregone conclusion.

The Soviet *material-balance* method is the cleanest historical instance of the
constraint operating at scale. Gosplan allocated by tabulating physical supplies
and requirements for thousands of commodities and iterating toward consistency,
in physical units rather than prices. By 1973 balances were computed for on the
order of 1,900 of the most important items, a small fraction of the millions of
distinct goods in the economy, and the recorded difficulty was precisely the
*aggregation*: the categories legible to the center were coarser than the
distinctions that governed whether an allocation actually worked `[empirical]`.
([Material balance planning](https://en.wikipedia.org/wiki/Material_balance_planning))
I state this as a mechanism, not a morality tale: coarse legible categories
produce allocation error at a rate that rises with the mismatch between category
granularity and the granularity of the underlying information.

## 4. Does cheap computation move the optimal point?

This is the one genuinely open question in the essay, and I want to state it
without resolving it, because the honest answer is that it is not obvious.

The intuition that modern computation and rich telemetry shift the
centralize/decentralize optimum *toward* the center is real and has real force:
a scheduler that can ingest and process orders of magnitude more data than
Gosplan could is a different scheduler `[speculative]`. Contemporary logistics
networks, ride dispatch, and cloud resource allocation are large centralized
schedulers that outperform the market alternatives *within their domains*, and
they do so because the relevant information — locations, capacities, latencies —
is now cheaply instrumented and transmitted.

But the Hayek/Scott objection was never primarily about compute. It was about
information that is *never transmitted*: tacit, preference-dependent, or
strategically suppressed. More compute at the center does nothing for
information that never enters the channel. Worse, incentive compatibility
(Section 2) says that agents' willingness to reveal private information depends
on the mechanism's rules, not on the center's processing power — a scheduler
that can process everything still faces agents deciding what to report
`[consensus]`. So cheap computation plausibly moves the optimum toward the
center in the sub-domains where the binding constraint was *transmission and
processing* of in-principle-observable data, and leaves it roughly where it was
in the sub-domains where the binding constraint was *information that is tacit,
never articulated, or strategically withheld.* The net direction of the shift is
therefore domain-specific and, at the level of a whole economy, genuinely
undetermined by the theory. Anyone claiming the general answer is obvious in
either direction is overclaiming.

`[retired]` A stronger version of this claim is available and tempting: that once
telemetry is dense enough, the socialist-calculation problem dissolves and
central scheduling strictly dominates. It is rejected here. It conflates the two
constraints above —
treating the entire Hayek/Scott argument as a claim about insufficient compute,
which it demonstrably is not — and it ignores that incentive compatibility is
invariant to the center's processing power. The dense-telemetry claim is true
only on the transmission-limited sub-domains and is simply misapplied on the
rest.

## 5. Boundaries and scale: the transaction-cost machinery

Why do large coordinating structures exist at all, if decentralized exchange is
so informationally efficient? Ronald Coase answered in 1937: because using the
market is not free. There are costs to discovering prices, negotiating, and
enforcing each transaction, and when those costs exceed the cost of organizing
the same activity by internal direction, agents form a firm. The boundary of the
firm sits where the marginal cost of internal coordination equals the marginal
cost of a market transaction `[consensus]`.
([Coase 1937, *Economica* 4(16):386–405](https://en.wikipedia.org/wiki/The_Nature_of_the_Firm))
Oliver Williamson operationalized this into transaction-cost economics: the
make-versus-buy boundary is set by bounded rationality, uncertainty, and above
all *asset specificity* — the degree to which an investment is worth less
outside a particular relationship, which exposes the parties to holdup that
contracts cannot fully resolve `[consensus]`.
([Williamson, Nobel lecture, "Transaction Cost Economics: The Natural Progression"](https://web.pdx.edu/~nwallace/EHP/TCEProgression.pdf))

The descriptive extension to states and other large structures is
straightforward and does not require any moral coloring: a large coordinating
structure lowers coordination cost *inside* its boundary — a common currency,
common rules, common records, common enforcement — and it raises coordination
cost *across* its boundary, because a counterpart outside must bridge different
currencies, rules, and records `[speculative]`. The structure is, in dynamical
terms, an attractor: within its basin, transactions flow cheaply and tend to
route through it; at its edge, they meet a barrier. This is a description of a
cost gradient. It is not a claim that internal cheapness is good or that the
boundary barrier is bad; both are simply consequences of the same architecture,
and their net effect on any given transaction depends on where that transaction
sits relative to the boundary.

## 6. Credit routing: a lens, marked as a lens

Here I introduce a framing from the study of learning systems, and I mark its
epistemic status carefully, because the essay's credibility depends on not
letting an elegant formalism import unearned truth.

In a learning system, improvement requires that a signal about the quality of an
outcome propagate backward to every internal structure that contributed to it.
Marvin Minsky named this the *credit-assignment problem* in 1961: when a complex
system succeeds or fails, how is credit or blame distributed among the many
internal decisions that produced the result `[consensus]`.
([Minsky, "Steps Toward Artificial Intelligence," 1961](http://incompleteideas.net/papers/Minsky60steps.pdf))
Backpropagation is one exact solution for a differentiable network: it computes,
for every internal parameter, its contribution to the output error and adjusts
it accordingly `[consensus]`. (Rumelhart, Hinton & Williams, "Learning
representations by back-propagating errors," *Nature* 323:533–536, 1986.)

The *lens*: an institution is a structure through which outcomes are produced,
and one can ask, as an empirical question, whether the signal generated by an
outcome — the reward, the loss, the correction — reaches the units that actually
generated that outcome, and how long it takes to get there. Call these
properties the *fidelity* and *latency* of credit routing. An institution in
which a failure's cost falls on the units that caused it, quickly, is doing
something structurally analogous to a low-latency backward pass. An institution
in which the cost falls elsewhere, or arrives after the causal units have
dispersed, is doing something structurally analogous to a broken or
high-latency one.

I state whether credit reaches the generating units as a *measurement*, not an
accusation. The proxy is concrete: after a documented failure in an institution,
measure the time until the units causally responsible experience a corrective
consequence, and the fraction of the corrective signal that lands on them versus
elsewhere. These are, in principle, observable quantities.

## 7. The boundary between rhyme and derivation

This is the section the rest of the essay is accountable to.

The transaction-cost account of boundaries (Sections 5) is a *derivation*: it is
a genuine economic model with comparative-static predictions, and its terms
(coordination cost, asset specificity) are defined and, in favorable cases,
measurable. The information constraint (Section 3) is a *derivation* in the sense
that Hayek's price-compression argument and Hurwicz's incentive-compatibility
results are formal claims with proofs and stated assumptions. Mechanism design's
special-case result (Section 2) is a theorem.

The credit-routing framing (Section 6) is a *rhyme*, and I will not pretend
otherwise. Backpropagation is a statement about a differentiable function: there
is a well-defined loss, a well-defined gradient, and a guarantee that the
backward pass computes exactly the contribution of each parameter. An
institution has none of these. There is no scalar loss function; there is no
gradient; there is no guarantee that "the units that caused an outcome" is even
well-defined, because causation in a social structure is distributed,
contested, and often unrecoverable. "Fidelity" and "latency" of credit routing
are *metaphors operationalized as proxies* — useful because they tell you what
to measure, dangerous if you let them inherit the mathematical certainty of the
thing they are named after. The rhyme earns its place only by generating
falsifiable measurements (Section 8). It does not earn the right to be called a
model.

`[retired]` A tempting version of this framework would assign each institution a
single scalar "credit-transport fidelity" score, by analogy to a loss gradient,
and rank institutions by it. That move is rejected here. Credit in a social
structure is multi-dimensional (financial, reputational, legal, informational),
the backward pass is not differentiable, and collapsing it to one number was the
formalism smuggling in a structure the domain does not have. The scalar looked
rigorous and was not. What survives is the *pair* of separately measurable
proxies above, applied per-dimension, with no claim that they compose into a
gradient.

## 8. What would falsify this

Three concrete, checkable predictions. Each is stated so that a specific
observation would count against the theory.

**Falsifier 1 — the information-constraint prediction.** Partition economic
domains by whether the information that governs good allocation is *telemetered*
(cheaply instrumented and transmitted) or *tacit* (local, preference-dependent,
or strategically withheld). The theory predicts that centralized scheduling
gains ground, relative to decentralized market mechanisms, in the telemetered
domains as computation cheapens, and does *not* gain ground in the tacit
domains. Disconfirmation: if centralized scheduling comes to outperform
decentralized mechanisms even in domains where the governing information remains
tacit and un-telemetered, the Hayek/Scott information constraint is false or
inessential. Conversely, if decentralized markets keep winning even in fully
telemetered domains, then "cheap computation shifts the optimum toward the
center" is false. Either observation kills a load-bearing claim.

**Falsifier 2 — the credit-routing prediction.** Across institutions matched for
scale and domain, measure time-to-correction after documented failures (the
latency proxy of Section 6). The theory predicts that lower-latency,
higher-fidelity credit routing is associated with faster measured adaptation and
lower persistent repeated-error rates. Disconfirmation: if institutions with
demonstrably slow or misrouted credit adapt just as fast as those with fast,
well-targeted routing, then the credit-routing lens has no empirical purchase and
should be dropped entirely — it would be revealed as pure metaphor.

**Falsifier 3 — the boundary-shift prediction.** The transaction-cost account
(Section 5) implies that as communication and coordination costs fall, the
firm/market boundary moves in coordination-cost-sensitive sectors but *not* in
sectors where asset specificity, rather than communication cost, is the binding
constraint. Prediction: a measurable divergence between the two sector types in
how make-versus-buy boundaries shift as communication cost falls.
Disconfirmation: if falling communication cost produces no measurable boundary
shift in the coordination-cost-sensitive sectors, or shifts asset-specific and
non-asset-specific sectors identically, then transaction cost is not doing the
work the theory assigns it.

A fourth, already partially tested, is offered as a bonus because it cuts against
optimism about the newest structure: token-weighted governance should trend
toward concentration of decisive power over time, measurable as a falling
Nakamoto coefficient or rising Gini of effective voting weight. If token-weighted
systems reliably do *not* concentrate, the plutocracy mechanism of Section 9 is
false. Current evidence points toward concentration, and there is a formal
impossibility result in this direction `[empirical]`
([*Concave is the New Linear: The Impossibility of Anti-Plutocratic DAO
Governance*, arXiv:2605.18990](https://arxiv.org/pdf/2605.18990)), but the
prediction remains open for structures not yet observed.

## 9. Four structures, and a candidate fifth

The market/plan dichotomy is too small. There are at least four scheduling
structures already documented, and a fifth under construction.

*Market* schedules by decentralized exchange at prices. *Firm* schedules by
internal direction within a transaction-cost boundary. *State* schedules by
territorial authority over standardized categories. The fourth is the *commons*,
and its inclusion rests on Elinor Ostrom's empirical work. Ostrom documented
long-lived common-pool-resource institutions — irrigation systems, fisheries,
forests — that are governed neither by market price nor by central plan nor by
private firm, but by *polycentric* arrangements of the resource users
themselves, and she extracted eight design principles that the durable cases
share and the collapsed cases lack `[empirical]`.
([Ostrom, *Governing the Commons*, Cambridge University Press, 1990; design
principles overview](https://en.wikipedia.org/wiki/Elinor_Ostrom))
The commons is a distinct algorithm with documented conditions for stability, not
a degenerate market or a small state. That is an empirical finding, and it
enlarges the design space from two structures to four.

The candidate fifth is the *protocol*: rules enforced by a shared substrate
rather than by an owner. In a protocol, the scheduling rule is executed by an
infrastructure that no single participant controls, and compliance is a property
of the substrate rather than of an enforcing authority `[speculative]`. The
descriptive question is the mechanism-design one: under what conditions is such a
structure incentive-compatible — that is, when does following the rule remain
each participant's best response without an external enforcer?

Honesty about a structure requires stating where it demonstrably fails, and the
protocol has three documented failure modes. First, *governance capture under
token-weighted voting*: when decision weight is proportional to holdings, decisive
power concentrates, and small holders face a rational incentive to abstain or to
accept side payments because a bad decision costs them little `[empirical]`
([Buterin, "Moving beyond coin voting governance," 2021](https://vitalik.eth.limo/general/2021/08/16/voting3.html);
[impossibility result, arXiv:2605.18990](https://arxiv.org/pdf/2605.18990)).
Second, the *oracle problem*: a substrate that enforces rules deterministically
over its own internal state cannot, by construction, observe the external world;
importing external facts requires a trusted channel, which reintroduces the very
trusted party the structure was meant to remove `[consensus]`
([The blockchain oracle problem, Chainlink](https://chain.link/education-hub/oracle-problem)).
Third, *participation and complexity barriers* that hand effective control to the
technically fluent minority `[empirical]`
([D. Ferreira, "The Myths of Blockchain Governance," *Corporate Governance: An International Review*, 2025](https://onlinelibrary.wiley.com/doi/10.1111/corg.70008)).
A protocol is incentive-compatible only where these three are solved or absent;
where they are present, it degrades toward one of the older four structures.
Stating this is what makes the fifth structure a subject of theory rather than of
advocacy.

## 10. Stability of boundaries, stated as conditions

I will not predict the collapse or persistence of any coordinating structure.
The descriptive statement is about conditions.

A coordination structure's boundary is stable while, for the transactions that
cross it, the internal-coordination advantage it offers exceeds the boundary cost
it imposes (Section 5), and while its scheduling error on its domain stays below
the error of the available alternatives (Section 3). Four quantities are
currently changing those conditions, and I list them as observable trends
without asserting a direction of net effect: the falling cost of communication;
the emergence of agent-mediated coordination that lowers the cost of managing
many simultaneous relationships; increased mobility of capital across boundaries;
and the appearance of protocol-governed commons as a fifth option in the design
space. Each of these changes the terms in the boundary-stability inequality. The
theory does not say which way the inequality tips, because that depends on the
domain's information structure and on which of the protocol failure modes bind.
It says only what to measure to find out.

`[speculative]` My own extension, offered as hypothesis and not conclusion: as
communication cost falls and a credible fifth structure becomes available, the
*number of viable structures per domain* rises, and scheduling migrates toward
whichever structure minimizes the sum of information loss (Section 3) and
coordination cost (Section 5) for that specific domain — producing not a single
winning architecture but a heterogeneous patchwork in which market, firm, state,
commons, and protocol each schedule the domains they fit. This is a prediction of
*fragmentation of scheduling by domain*, and it is checkable: it fails if
scheduling instead consolidates onto a single dominant architecture across
heterogeneous domains.

## 11. What this essay does not claim

It does not claim any structure is better. "Better" is undefined without a
choice of objective, and choosing the objective is exactly the normative act the
essay abstains from. It does not claim the nation-state, or any structure, is
ending; it states the conditions under which a boundary is stable and lists what
is changing those conditions. It does not identify any present government, party,
or leader as a subject of praise or criticism; its historical examples are
factual and cited. And it treats its own most attractive move — the credit-
routing lens — as a rhyme that has to earn each measurement, never as a
derivation that inherits the certainty of backpropagation. Subtraction is the
governing discipline here: a paragraph that was beautiful but added no
falsifiable content has been cut, and the version of the framework that would
have looked rigorous while smuggling in a gradient the domain does not have is
rejected in writing above, with its reason attached.

---

### Sources

- F. A. Hayek, "The Use of Knowledge in Society," *American Economic Review* 35(4):519–530, 1945. https://en.wikipedia.org/wiki/The_Use_of_Knowledge_in_Society · full text: https://oll.libertyfund.org/titles/hayek-the-use-of-knowledge-in-society-1945
- J. C. Scott, *Seeing Like a State*, Yale University Press, 1998. https://en.wikipedia.org/wiki/Seeing_Like_a_State
- R. H. Coase, "The Nature of the Firm," *Economica* 4(16):386–405, 1937. https://en.wikipedia.org/wiki/The_Nature_of_the_Firm
- O. E. Williamson, "Transaction Cost Economics: The Natural Progression" (Nobel lecture, 2009). https://web.pdx.edu/~nwallace/EHP/TCEProgression.pdf
- E. Ostrom, *Governing the Commons*, Cambridge University Press, 1990. https://en.wikipedia.org/wiki/Elinor_Ostrom
- Socialist calculation debate (Mises 1920; Lange 1936–37; Hayek). https://en.wikipedia.org/wiki/Socialist_calculation_debate · J. Persky, "Retrospectives: Lange and von Mises, Large-Scale Enterprises, and the Economic Case for Socialism," *Journal of Economic Perspectives* 5(4):229–236, 1991. https://doi.org/10.1257/jep.5.4.229
- Mechanism design, Nobel Memorial Prize 2007 (Hurwicz, Maskin, Myerson). https://www.nobelprize.org/prizes/economic-sciences/2007/ · https://www.nobelprize.org/uploads/2018/06/myerson-slides.pdf
- Soviet material-balance planning. https://en.wikipedia.org/wiki/Material_balance_planning
- M. Minsky, "Steps Toward Artificial Intelligence," *Proc. IRE*, 1961. http://incompleteideas.net/papers/Minsky60steps.pdf
- D. Rumelhart, G. Hinton, R. Williams, "Learning representations by back-propagating errors," *Nature* 323:533–536, 1986.
- V. Buterin, "Moving beyond coin voting governance," 2021. https://vitalik.eth.limo/general/2021/08/16/voting3.html
- "Concave is the New Linear: The Impossibility of Anti-Plutocratic DAO Governance," arXiv:2605.18990. https://arxiv.org/pdf/2605.18990
- The blockchain oracle problem (Chainlink education hub). https://chain.link/education-hub/oracle-problem
- D. Ferreira, "The Myths of Blockchain Governance," *Corporate Governance: An International Review*, 2025. https://onlinelibrary.wiley.com/doi/10.1111/corg.70008

---

## Source: /theory/holography-koopman.md (sha256:a52794b0721c, language: en)


# Theory note: holography, the Koopman inverse problem, and "optimal forgetting"
*A theory line still under iteration · 2026-07-06 · full context, written for external AI reviewers*

## Context for the reviewer (read this first)

This records one iteration of a personal theory line, taken from the "general learning machine" (GLM) point of view. The line's standing position: **knowledge = a generator (a seed), not a list of facts (fallen leaves); memory = dynamics; forgetting = compression, not deletion**. This iteration starts from a popular-science article about holography and Indra's net, and ends at an open question we believe nobody in the literature has answered head-on.

Research discipline (reviewers, please hold to this frame too):

- Everything below is **exploratory understanding**. It carries no engineering commitment to go build a new architecture on top of it.
- Every assertion is tagged at one of four honesty levels: **[theorem]** (theorem-grade in the source) / **[empirical]** (at the level of an experiment or an explicit statement in a paper) / **[inference]** (our own inference from the literature) / **[rhyme]** (a structural analogy, explicitly *not* claiming that truth transfers).
- We are actively defending against two errors: taking a beautiful analogy for evidence ("a rhyme smuggling in truth"), and the reflex of forcing everything into a single unified framework.

**The most valuable review** would point out which **[inference]** has in fact already been answered head-on in the literature (with the citation), which **[rhyme]** is smuggling in truth, and which **[theorem]** we have applied outside its domain of validity. A specific list of review questions is at the end.

---

## 1. The holography side: how entanglement "grows" geometry (four bricks)

**Brick one: the Ryu–Takayanagi formula (2006) — the dictionary itself.** Bekenstein's "black-hole information ∝ surface area" was originally a special case. RT upgrades it into a general dictionary: the entanglement entropy of any region on the boundary = the area of some minimal surface in the bulk. Pure information on the left, pure geometry on the right, welded together by one equals sign **[theorem, within the AdS/CFT framework]**.

**Brick two: Van Raamsdonk's thought experiment (2010) — entanglement is the glue of spacetime.** Dial down the entanglement between the two halves of the boundary and the bulk geometry stretches thin; take the entanglement to zero and spacetime snaps into two pieces. Connectivity of space = the existence of entanglement; the rigorous version of "relations precede entities" **[empirical-grade argument]**.

**Brick three: the MERA tensor network (Vidal 2007; Swingle 2012 noticed its geometry ≈ AdS) — how a seed unrolls into space.** A tensor network is a "generator pipeline diagram": starting from a small seed, it weaves out a quantum state layer by layer, each layer corresponding to one observation scale (renormalization). Swingle noticed that the shape of the pipeline diagram *itself* is a patch of discrete hyperbolic space, isomorphic-looking to a slice of AdS **[empirical-grade correspondence, not a theorem]**. That is: the "extra dimension" in the bulk = the number of layers the generator unrolls = scale itself. Space is not a stage; it is the trace left by unrolling — the physics version of "the seed gives rise to the manifest" **[rhyme]**.

**Brick four: the HaPPY holographic error-correcting code (Pastawski–Yoshida–Harlow–Preskill 2015) — the theorem-grade version of "the local contains the whole".** The mathematical structure of the holographic dictionary just *is* a quantum error-correcting code: bulk information is redundantly encoded on the boundary, and any sufficiently large boundary fragment can reconstruct the deep bulk; the smaller the fragment, the shallower it can see — what is lost is resolution, not information **[theorem, within the toy model]**. This is the twin structure, on the physics side, of the position that **forgetting = compression, not deletion** **[rhyme]**.

Bonus: the quantum extremal surface / island formula (2019–2020) computed the Page curve at the semiclassical level — black-hole information conservation now has a ledger you can audit **[empirical/theorem-grade progress]**.

**Honest boundaries:** (i) all the rigorous mathematics above lives in an AdS universe, ours is dS (accelerating expansion), and the generalization is an open problem; (ii) MERA ≈ AdS is "strikingly alike", not an isomorphism theorem; (iii) we explicitly do not take up directions of the form "the ancient scriptures already understood holography" — a shared mathematical skeleton ≠ a claim on the source.

## 2. The Koopman inverse problem: when nobody hands you a symmetry, you have to learn the eigenbasis yourself

**Step one: having a symmetry = the eigenbasis is free.** Fourier modes and spherical harmonics are not learned; they are handed to you by symmetry (group theory): a system is invariant under some transformation, and the corresponding eigenbasis arrives automatically. A calendrical system (such as the sixty-term ganzhi cycle) can be viewed as hand-encoding **already known** astronomical periods into a Z/60 harmonic eigenbasis — the same cell of the table: given structure → free basis **[mathematical fact + an inferential characterization]**.

**Step two: Koopman's shift (1931).** For a nonlinear dynamical system, switch to watching how *all observation functions of the state* evolve — that evolution operator is **always linear** (at the price of being infinite-dimensional) **[theorem]**. A Koopman eigenfunction = the "most carefree observable", one that merely gets multiplied by a fixed number at each step; find a set of them and you have found a set of coordinates in which the entangled dynamics decomposes into non-interacting dials turning at constant rates.

**Step three (the crux): the inverse problem.** When the symmetry is not in hand — which is almost always the case in the real world — this eigenbasis can only be learned from trajectory data: DMD → extended DMD → deep Koopman (Lusch–Kutz–Brunton 2018, an autoencoder learning linearizing coordinates end to end) **[empirical]**. The GLM crux, stated: **the core task of a general learning machine = learn, from the stream of experience, the coordinates in which the world's dynamics becomes simple; memory = the seed state in those coordinates; understanding = having found the right eigenbasis** **[position/inference]**.

The honest shortcoming: genuine chaos → the Koopman spectrum becomes continuous → no finite set of dials can simplify it, and no amount of data will yield a clean eigenbasis **[theorem-grade picture, Mezić spectral theory]**. The crux is a question that must be answered, not one that has been answered.

## 3. SSMs (HiPPO/S4/Mamba) ↔ Koopman: surveying the bridge (literature-mining digest)

*This section is the output of a dedicated literature dig: four questions, four answers.*

### Q1. What "given structure" does HiPPO trade for its eigenbasis?

It trades a **forgetting measure** for it: first declare "how much each past moment matters to me" (a measure μ(t)), and the family of orthogonal polynomials under that measure is **uniquely determined** **[theorem]**. The three variants correspond to three forgetting dials: LegT (uniform sliding window → translated Legendre), LagT (exponential decay → Laguerre), LegS (uniform over the whole history → scaled Legendre). The evolution of the projection coefficients compresses into an ODE: dc/dt = Ac + Bf, with A and B derived in closed form, not learned **[theorem]**. *How to Train Your HiPPO* (2022) pushes this all the way: every SSM state can be read as "the projection coefficients of the input history onto some basis", with each basis corresponding to a measure **[empirical]**. S4 merely finds a numerically stable coordinate system for a fixed A (the DPLR decomposition) **[empirical]**.

LegS has a covariance with genuine group-theoretic meaning: under a rescaling of time the output rescales in step (timescale invariance) **[theorem]**. The key difference **[inference]**: the symmetry of the calendrical code comes from **the world** (astronomical periods, given externally), whereas HiPPO's measure comes from **the agent's own choice** (I decide how to forget). Both are "free bases", but the giver is different — and that is the seed of the open question in section 4.

### Q2. What does Mamba's selectivity learn, and what does it not learn?

Facts from the paper **[empirical]**: what is input-dependent is Δ, B, C; **A stays fixed** (diagonal, real). Discretization Ā = exp(ΔA): the effective decay rate at each step = a fixed spectrum × an input-determined time step. Theorem 1: at N=1 it degenerates exactly into the RNN forget gate **[theorem]**.

Translated into the language of measures **[inference]**: Δ is a **knob on the rate of time**. Selectivity does not change the basis — the eigendirections are welded in place from beginning to end — it only tunes "how fast time passes" per token, with B/C determining the read/write directions. **Mamba is the first large-scale success at "learning the measure", not at "learning the basis".**

Theorem-grade corroboration: *The Illusion of State in State-Space Models* (ICML 2024) proves that SSMs with diagonal/commuting transitions are all trapped in the complexity class TC⁰ and cannot even compose permutations; to cross that line, the transition matrix must depend on the input **non-diagonally** **[theorem]**. The dividing line between "learning the measure" and "learning the basis" happens to coincide with this complexity boundary **[inference]**.

### Q3. "The eigenbasis of memory decay" vs "the eigenbasis of world dynamics": what does the gap look like?

- An SSM's basis is **input-generic**: Legendre polynomials do not care what world produced the signal; they are optimal for compressing an *arbitrary* signal under a given forgetting measure. State = the compressed archive of my past.
- Koopman's basis is **system-specific**: the eigenfunctions live on the state space of the world, and the eigenvalues are the natural frequencies of **this particular world**. State = the world's position in its own eigencoordinates.

The two coincide in exactly one case **[inference]**: when the input happens to be generated by purely point-spectrum dynamics, the optimal compression basis = the Koopman modes (this is precisely where DMD gets its legitimacy). In the general case they do not coincide: a memory basis can compress the signal without knowing the causal structure behind it.

How the literature circles it (not one paper names the gap head-on; three characterize it from the side): (i) the Koopman form of a *controlled* system necessarily contains a **bilinear term** (state × input), and the Mamba recursion is purely linear in the hidden state and lacks that term; adding it improves multiplicative-memory tasks by factors of several to a hundred (2026, toy scale) **[empirical, small scale]**; (ii) *Illusion of State*: an SSM's "state", taken as a world-state, is an illusion in the sense of a complexity lower bound **[theorem]**; (iii) MamKO: running it the other way, using the Mamba architecture to generate a time-varying Koopman operator online for control — both ends are under construction, the bridge has not met in the middle **[empirical]**.

### Q4. Continuous spectrum / genuine chaos: the honest boundary

Mezić's spectral picture **[theorem]**: quasiperiodic / attractor-approaching systems have a pure point spectrum, and "learning the eigenbasis" is well-posed; chaotic/mixing systems develop a **continuous spectrum** on the attractor — no countable set of eigenfunctions can span the dynamics, any finite basis is only a truncation, and the prediction horizon is nailed down by the Lyapunov time. The continuous-spectrum part corresponds to nontrivial memory effects (the Mori–Zwanzig memory kernel).

The pragmatic workaround in deep Koopman: parameterize the eigenvalues as functions of the state, λ(x) — a sliding pointer instead of a fixed dial — verified only on small systems **[empirical, small scale]**.

The boundary this puts on the GLM thesis **[inference]**: "you must learn the eigenbasis" is an exact thesis in a pure-point-spectrum world; in a chaotic world it is demoted to "learn a good-enough truncation and own the residual". And the residual comes back precisely in the form of a memory kernel — while an SSM's convolution kernel is by birth a machine for representing memory kernels. This may be the genuinely deep weld between the two towers.

## 4. The open question: should the forgetting measure be determined by the spectrum of the world?

Two degrees of freedom on the table: **μ (the forgetting measure)** = my scoring curve for "how much I care about each past moment" (freely chosen in HiPPO); and **the world's spectrum** = the world's own list of dials (which modes turn how fast, how long correlations drag on). The question: is μ an a priori free choice, or should it be a derived quantity, (near-)uniquely determined by the world's spectrum? Is there an "optimal forgetting theorem"?

**Orienting intuition: this is the dynamical version of a rate-distortion commonplace.** Memory = lossy compression of the past; and lesson one of rate-distortion theory is that the optimal code is fixed by the source statistics + the distortion measure, not by the coder's taste **[theorem]**. Swap the source for the world's dynamics and the distortion for future prediction error, and directionally the answer is "it should be" — what is open is the precise shape of the theorem.

**Four anchors supporting the coupling (hard to soft):**

1. **In the linear special zone this beam already exists = balanced truncation / Hankel theory [theorem]**: given a linear world, "what an N-dimensional memory should optimally remember" is uniquely given by the SVD of the Hankel operator, with closed-form error bounds; the timescales of the optimal memory are determined directly by the world's eigenvalues. Inside a known linear world, "forgetting is determined by the world's spectrum" is a theorem, not a conjecture.
2. **Human empirics = Anderson & Schooler 1991 [empirical]**: the human power-law forgetting curve precisely matches the statistics of how often things recur in the environment — evolution has already tuned μ into a mirror of environmental statistics.
3. **S4's success can be read backwards as a natural experiment [empirical + inference]**: of the three HiPPO variants, the one that won at scale is LegS — exactly the timescale-invariant measure; and natural signals are broadly approximately scale-free (1/f spectra). S4 did not learn μ, but it happened to pick a μ matched to the world's symmetry, and then it won.
4. **The predictive information bottleneck [semi-theorem]**: "compress the past, keep only what carries information about the future" has an analytic solution in the linear-Gaussian case, and its structure follows the world's spectrum exactly; in the general case there are only variational approximations.

**Three obstacles blocking a general theorem:**

1. Chaotic continuous spectra demolish the "world's spectrum" end first. The demoted version of the coupling **[inference, with hard evidence on each half]**: chaotic systems often have metastable structure (slow modes / almost-invariant sets, a spectral gap of the transfer operator), and detail beyond the Lyapunov horizon is worthless → "forget the fast continuous-spectrum part as soon as possible, remember the slow, near-point-spectrum part" — what forgetting should track is **the part of the spectrum that survives**.
2. **The chicken and the egg**: the agent does not know the world's spectrum and has to learn it; learning the spectrum relies on memory; and memory's μ is supposed to be set by the spectrum. The real theorem will not be a static formula but a **fixed point** of this loop — μ and the spectrum learned under μ's support being mutually consistent **[inference]**.
3. **Telos is not only prediction**: balanced truncation balances two Gramians — observability (which past events affect the future) and controllability (which things I can do anything about). μ should be a conspiracy between the world's spectrum and the value function **[inference]**.

**The honest opposition (why it should *not* be fully determined by the world's spectrum):** in a nonstationary / black-swan world, a μ locked onto the current spectrum is the most fragile — a robust μ should keep a fatter tail than the world's correlation decay (insurance) **[inference]**; the value of a rare event lies in "how much it changes the model" (Bayesian surprise), not in its correlational weight, and a purely second-order spectrum would wash it out. The refined proposition: **what μ should track is "the predictable structure of the world + my uncertainty about that structure"; the spectrum is only the linear shadow of the former** **[inference]**.

**Conjectured shape of the theorem [inference]:** given a capacity N, a stationary world-spectrum measure ρ, and a telos (a distortion measure), the distribution of timescales of the optimal forgetting measure μ\* = a rearrangement of ρ's dominant timescales, weighted by the telos; in the linear-Gaussian case it degenerates to balanced truncation; in the online version, μ and the learned spectrum are each other's fixed point, and when uncertainty is high μ automatically fattens its tail. A small falsifiable corollary: within a fixed architecture, tuning μ's decay distribution into a mirror of the autocorrelation decay of the training data should systematically improve long-range tasks (this is a deduction, not an engineering proposal).

**The rhyme (flagged explicitly as a rhyme):** this question is the theorem-ification of "the compression code is a mirror of the world" — an agent's forgetting curve is the reflection of the spectrum of the world it inhabits.

## Specific questions for the reviewer

1. Is the citation of balanced truncation / Hankel theory as the "linear special-zone theorem" appropriate? Is there a stronger or more apt existing result (AAK theory, predictive state representations)?
2. Is the gap between "the memory-decay basis" and "the world-dynamics basis" really unnamed and unaddressed in the literature? Please try hard to find counterexamples (keyword hints: predictive state representations, observable operator models, the intersection of Wiener/Kalman with online basis learning).
3. Has an optimal-forgetting theorem of the form "μ and the learned spectrum are each other's fixed point" already been written down in the predictive-coding / free-energy / meta-learning literature?
4. In the chaotic case, has the demoted coupling (tracking only the metastable / slow modes) already been given a close formalization in the transfer-operator spectral-gap or Mori–Zwanzig reduction literature?
5. In section 3, Q2's characterization of Mamba as "learning the measure, not the basis", and its alignment with the TC⁰ result of *Illusion of State* and with the bilinear term of controlled Koopman — is there a hole in it we have not seen?
6. Where does the analogy on the holography side (sections 1 and 4) as a "same-family inverse problem" risk smuggling in truth?

## Literature

1. HiPPO — Gu, Dao, Ermon, Rudra, Ré 2020, arXiv:2008.07669
2. S4 — Gu, Goel, Ré 2021, arXiv:2111.00396
3. How to Train Your HiPPO — Gu et al. 2022, arXiv:2206.12037
4. Mamba — Gu & Dao 2023, arXiv:2312.00752
5. Deep Koopman — Lusch, Kutz, Brunton 2018, arXiv:1712.09707 (Nature Comm.)
6. Mezić Koopman spectral theory — arXiv:1702.07597; Annu. Rev. Fluid Mech. (annurev-fluid-011212-140652)
7. Bilinear Input Modulation for Mamba: Koopman Bilinear Forms — arXiv:2604.17221
8. The Illusion of State in State-Space Models — Merrill, Petty, Sabharwal, ICML 2024, arXiv:2404.08819
9. MamKO: Mamba-based Koopman operator — OpenReview hNjCVVm0EQ
10. Ryu & Takayanagi 2006 (hep-th/0603001); Van Raamsdonk 2010 (arXiv:1005.3035); Swingle 2012 (arXiv:0905.1317); Pastawski–Yoshida–Harlow–Preskill 2015 (arXiv:1503.06237)
11. Anderson & Schooler 1991, "Reflections of the environment in memory", Psychological Science

---

## Source: /theory/holography-koopman.zh.md (sha256:ce9760f3dab0, language: zh-Hans)


# 理论笔记:全息原理、Koopman 反问题与"最优遗忘"
*一条正在迭代的理论线 · 2026-07-06 · 供外部 AI reviewer 使用的完整 context*

## 给 reviewer 的 context(先读这段)

这是一条个人理论线("通用学习机 / General Learning Machine, GLM"视角)的一次迭代记录。该线的既有立场:**知识 = 生成器(种子),不是事实列表(落叶);记忆 = 动力学;遗忘 = 压缩而非删除**。本次迭代起点是一篇讨论全息原理与因陀罗网的科普文章,终点是一道我们认为文献中尚无人正面回答的 open 题。

研究纪律(请 reviewer 也遵守这个框架):
- 以下全部为**理解性探索**,不含任何"据此去构建新架构"的工程承诺;
- 所有论断按四档诚实度标注:**[定理]**(原文定理级)/ **[实证]**(论文实验或明确陈述级)/ **[推断]**(我们基于文献的推断)/ **[韵脚]**(结构类比,明确不主张真值传递);
- 我们主动防两类错误:把漂亮的类比当证据("韵脚偷渡真值"),以及把一切强行统一进单一框架的反射。

**最有价值的 review**:指出哪个 [推断] 其实已有文献正面回答(给出处)、哪个 [韵脚] 在偷渡真值、哪个 [定理] 被我们用错了适用范围。页尾附具体 review 问题清单。

---

## 一、全息侧:纠缠怎么"长出"几何(四块砖)

**第一块:Ryu–Takayanagi 公式(2006)——词典本身。** 贝肯斯坦"黑洞信息∝表面积"原本是特例。RT 公式把它升级成通用词典:边界上任一区域的纠缠熵 = 体内某张最小曲面的面积。左边纯信息量,右边纯几何,一个等号焊死 **[定理,AdS/CFT 框架内]**。

**第二块:Van Raamsdonk 思想实验(2010)——纠缠是时空的胶水。** 把边界两半之间的纠缠调小,对应体内几何拉细,纠缠归零时时空断成两截。空间的连通性 = 纠缠的存在;"关系先于实体"的严格版 **[实证级论证]**。

**第三块:MERA 张量网络(Vidal 2007;Swingle 2012 发现其几何≈AdS)——种子怎么 unroll 出空间。** 张量网络是一张"生成流水线图":从小种子出发一层层织出量子态,每层对应一个观察尺度(重整化)。Swingle 注意到:这张流水线图自身的形状就是一片离散双曲空间,与 AdS 截面同构状 **[实证级对应,非定理]**。即:体内"多出来的一维"= 生成器 unroll 的层数 = 尺度本身。空间不是舞台,是 unroll 的痕迹——"种子生现行"的物理版 **[韵脚]**。

**第四块:HaPPY 全息纠错码(Pastawski–Yoshida–Harlow–Preskill 2015)——"局部含全体"的定理版。** 全息词典的数学结构就是一个量子纠错码:体内信息冗余编码在边界上,任何足够大的边界碎片都能重建体内深处;碎片越小看得越浅——丢的是分辨率,不是信息 **[定理,玩具模型内]**。这是"遗忘 = 压缩非删除"立场在物理侧的孪生结构 **[韵脚]**。

彩蛋:量子极值面/岛屿公式(2019–2020)在半经典层面算出了 Page 曲线——黑洞信息守恒有账可查了 **[实证/定理级进展]**。

**诚实边界:** ①以上严格数学全部生活在 AdS 宇宙,我们的宇宙是 dS(加速膨胀),推广是 open problem;②MERA≈AdS 是"惊人地像",不是同构定理;③"古代经文早已理解全息"这类方向我们明确不采纳——共享数学骨架 ≠ 源头认领。

## 二、Koopman 反问题:没人送对称性时,本征基要自己学

**第一步:有对称性 = 本征基白送。** 傅里叶模、球谐函数都不是学出来的,是对称性(群论)送的:系统对某变换不变,对应本征基自动到手。历法系统(如六十干支)可视为把**已知**天文周期手工编码成 Z/60 的谐波本征基——同样属于"给定结构→基白送"这一格 **[数学事实 + 推断性刻画]**。

**第二步:Koopman 的移位(1931)。** 非线性动力系统,改盯"关于状态的所有观测函数"怎么演化——该演化算子**永远线性**(代价:无穷维)**[定理]**。Koopman 本征函数 = 每步只乘一个固定数的"最省心观测";找到一组,就等于找到一组坐标,让纠缠的动力学拆成互不干扰的匀速表盘。

**第三步(命门):反问题。** 对称性不在手时——真实世界几乎总是如此——这组本征基只能从轨迹数据里学:DMD → extended DMD → 深度 Koopman(Lusch–Kutz–Brunton 2018,autoencoder 端到端学线性化坐标)**[实证]**。GLM 命门的表述:**通用学习机的核心任务 = 从经验流学出让世界动力学变简单的坐标;记忆 = 该坐标下的种子态;理解 = 本征基找对了** **[立场/推断]**。

诚实短板:真混沌 → Koopman 谱变连续 → 不存在有限表盘化简,再多数据也学不出干净本征基 **[定理级图景,Mezić 谱理论]**。命门是必答题,不是已答题。

## 三、SSM(HiPPO/S4/Mamba)↔ Koopman:桥的勘测(文献挖掘 digest)

*本节为专项文献挖掘的成果,四问四答。*

### Q1. HiPPO 的本征基是拿什么"给定结构"换来的?

拿**遗忘测度**换来的:先声明"过去每一刻对我多重要"(测度 μ(t)),该测度下的正交多项式族**唯一确定** **[定理]**。三个变体对应三种遗忘表盘:LegT(滑窗均匀→平移 Legendre)、LagT(指数衰减→Laguerre)、LegS(整段历史均匀→缩放 Legendre)。投影系数演化压成 ODE:dc/dt = Ac + Bf,A、B 闭式推导、非学得 **[定理]**。《How to Train Your HiPPO》(2022)推到底:每个 SSM 状态都可解读为"输入历史在某组基上的投影系数",每组基对应一个测度 **[实证]**。S4 只是给固定 A 找了个数值稳定坐标(DPLR 分解)**[实证]**。

LegS 有真正群论意义的协变性:时间缩放下输出同步缩放(timescale 不变性)**[定理]**。关键差异 **[推断]**:历法码的对称性来自**世界**(天文周期外部给定),HiPPO 的测度来自 **agent 自己的选择**(我决定怎么遗忘)。同是"送基",送礼的人不同——这是第四节 open 题的种子。

### Q2. Mamba 的 selectivity 学到了什么、没学到什么?

原文事实 **[实证]**:input-dependent 的是 Δ、B、C;**A 保持固定**(对角、实数)。离散化 Ā = exp(ΔA):每步有效衰减率 = 固定谱 × 输入决定的时间步长。Theorem 1:N=1 时恰好退化为 RNN 遗忘门 **[定理]**。

测度语言翻译 **[推断]**:Δ 是**时间流速旋钮**。selectivity 没换基——本征方向从头到尾焊死——只是逐 token 调"时间过多快"+ B/C 决定读写方向。**Mamba 是"学测度"的第一个大规模成功实例,不是"学基"的。**

定理级佐证:《The Illusion of State in State-Space Models》(ICML 2024)证明对角/可交换转移的 SSM 全部困在 TC⁰ 复杂度类,连置换合成都做不了;要越线,转移矩阵必须**非对角地**依赖输入 **[定理]**。"学测度 vs 学基"的分界线,恰好同时是这条复杂度边界 **[推断]**。

### Q3. "记忆衰减的本征基" vs "世界动力学的本征基":gap 长什么样?

- SSM 的基是 **input-generic** 的:Legendre 多项式不关心信号由什么世界产生,只对"给定遗忘测度下压缩任意信号"最优。状态 = 我过去的压缩包。
- Koopman 的基是 **system-specific** 的:本征函数长在世界的状态空间上,本征值是**这个世界**的固有频率。状态 = 世界在其本征坐标下的位置。

两者仅在一种情形重合 **[推断]**:输入恰好由纯点谱动力学生成时,最优压缩基 = Koopman 模态(这正是 DMD 合法性的来源)。一般情形不重合:记忆基压得动信号,不知道信号背后的因果结构。

文献侧写(无一篇正面命名该 gap,三篇侧面刻画):①受控系统的 Koopman 形式必然含**双线性项**(状态×输入),Mamba 递归对隐状态纯线性、缺此项,补上后乘性记忆任务提升数倍至百倍(2026,玩具规模)**[实证,小规模]**;②Illusion of State:SSM 的"状态"作为 world-state 是复杂度下界意义上的幻觉 **[定理]**;③MamKO:反向用 Mamba 架构在线生成时变 Koopman 算子做控制——两头动工,桥未合龙 **[实证]**。

### Q4. 连续谱/真混沌:诚实边界

Mezić 谱理论图景 **[定理]**:准周期/趋吸引子系统有纯点谱,"学本征基"是 well-posed;混沌/mixing 系统在吸引子上出现**连续谱**——没有可数本征函数集能张成动力学,任何有限基都只是截断,预测视界被 Lyapunov 时间钉死。连续谱部分对应非平凡记忆效应(Mori–Zwanzig 记忆核)。

深度 Koopman 的务实变通:把本征值参数化为状态的函数 λ(x)——用滑动指针替代固定表盘,仅在小系统上验证 **[实证,小规模]**。

对 GLM 论题的边界 **[推断]**:"必须学本征基"在纯点谱世界是精确论题;混沌世界降格为"学够用的截断 + 承认残差"。残差恰以记忆核形式回来——而 SSM 的卷积核天生是表示记忆核的机器。这可能是两座塔真正的深层焊点。

## 四、Open 题:遗忘测度该不该由世界的谱决定?

桌上两个自由度:**μ(遗忘测度)**= 我对过去"每一刻在乎多少"的打分曲线(HiPPO 中自由选);**世界的谱** = 世界自己的表盘清单(哪些模式转多快、相关性拖多长)。问题:μ 是先验自由选择,还是应当被世界谱(近)唯一决定的导出量?存在"最优遗忘定理"吗?

**定向直觉:这是率失真常识的动力学版。** 记忆 = 对过去的有损压缩;率失真第一课:最优码由信源统计 + 失真度量定,不由编码者品味定 **[定理]**。信源换成世界动力学、失真换成未来预测误差,方向上答案是"该"——open 的是定理的精确形状。

**支持耦合的四个锚点(由硬到软):**
1. **线性特区里这根梁已存在 = 平衡截断/Hankel 理论 [定理]**:给定线性世界,"N 维记忆最优记什么"由 Hankel 算子 SVD 唯一给出,误差界闭式;最优记忆的时间尺度直接由世界本征值决定。线性已知世界内,"遗忘由世界谱决定"是定理,不是猜想。
2. **人脑实证 = Anderson & Schooler 1991 [实证]**:人类幂律遗忘曲线精确匹配环境中事物的复现概率统计——进化已把 μ 调成环境统计的镜像。
3. **S4 的成功可反读为自然实验 [实证+推断]**:三个 HiPPO 变体中大规模赢的是 LegS——恰好是 timescale 不变的测度;而自然信号普遍近似 scale-free(1/f 谱)。S4 没学 μ,但碰巧选中了与世界对称性匹配的 μ,然后赢了。
4. **预测信息瓶颈 [半定理]**:"压缩过去、只留对未来有信息量的部分"在线性高斯情形有解析解,结构完全跟世界谱走;一般情形只有变分近似。

**通用定理难产的三只拦路虎:**
1. 混沌连续谱先砸掉"世界谱"这一头。降格版耦合 **[推断,两半各有实锤]**:混沌系统常有亚稳结构(慢模式/准不变集,转移算子谱隙),Lyapunov 视界外细节无价值 → "快的连续谱部分尽快忘,慢的准点谱部分重点记"——遗忘该跟的是**谱里活得下来的那部分**。
2. **鸡生蛋**:agent 不知世界谱,得学;学谱靠记忆;记忆的 μ 又该由谱定。真定理不会是静态公式,而是这个循环的**不动点**——μ 与被 μ 支撑着学出的谱互相一致 **[推断]**。
3. **telos 不只预测**:平衡截断平衡的是两个 Gramian——可观性(过去哪些事影响未来)与可控性(我能对哪些事做什么)。μ 应是世界谱与价值函数的合谋 **[推断]**。

**诚实的反方(为什么不该全由世界谱决定):** 非平稳/黑天鹅世界里,μ 锁死当前谱最脆弱——鲁棒的 μ 应比世界相关衰减留更厚的尾(保险)**[推断]**;罕见事件价值在"改模型的量"(贝叶斯惊奇)而非相关权重,纯二阶谱会把它冲掉。精化命题:**μ 该跟的是"世界的可预测结构 + 我对该结构的不确定性";谱只是前者的线性影子** **[推断]**。

**猜想中的定理形状 [推断]:** 给定容量 N、平稳世界谱测度 ρ、telos(失真度量),最优遗忘测度 μ\* 的时间尺度分布 = ρ 的主导时间尺度经 telos 加权后的重排;线性高斯情形退化为平衡截断;在线版:μ 与所学谱互为不动点,不确定性高时 μ 自动增厚尾部。可证伪小推论:同一架构下,把 μ 的衰减分布调成训练数据自相关衰减的镜像,长程任务应系统性变好(此为推演,非工程提案)。

**韵脚(明确标注为韵脚):** 这道题是"压缩码是世界的镜像"的定理化——一个 agent 的遗忘曲线,是它所居世界的谱的倒影。

## 给 reviewer 的具体问题

1. 平衡截断/Hankel 理论作为"线性特区定理"的引用是否恰当?有没有更强或更贴切的既有结果(如 AAK 理论、预测状态表示)?
2. "记忆衰减基 vs 世界动力学基"这个 gap,是否真的没有文献正面命名与处理?请尽力找反例(关键词提示:predictive state representations, observable operator models, Wiener/Kalman 与在线基学习的交叉)。
3. "μ 与所学谱互为不动点"式的最优遗忘定理,是否已有人在 predictive coding / free energy / meta-learning 文献中写过?
4. 混沌情形的降格版耦合(只跟亚稳/慢模式)在转移算子谱隙、Mori–Zwanzig 约化文献中是否已有接近的定式化?
5. 第三节 Q2 对 Mamba"学测度非学基"的刻画,与 Illusion of State 的 TC⁰ 结果、受控 Koopman 双线性项的对齐,是否存在我们没看到的漏洞?
6. 全息侧作为"同族反问题"的类比(第一、四节),哪里有偷渡真值的风险?

## 文献

1. HiPPO — Gu, Dao, Ermon, Rudra, Ré 2020, arXiv:2008.07669
2. S4 — Gu, Goel, Ré 2021, arXiv:2111.00396
3. How to Train Your HiPPO — Gu et al. 2022, arXiv:2206.12037
4. Mamba — Gu & Dao 2023, arXiv:2312.00752
5. Deep Koopman — Lusch, Kutz, Brunton 2018, arXiv:1712.09707 (Nature Comm.)
6. Mezić Koopman 谱理论 — arXiv:1702.07597;Annu. Rev. Fluid Mech. (annurev-fluid-011212-140652)
7. Bilinear Input Modulation for Mamba: Koopman Bilinear Forms — arXiv:2604.17221
8. The Illusion of State in State-Space Models — Merrill, Petty, Sabharwal, ICML 2024, arXiv:2404.08819
9. MamKO: Mamba-based Koopman operator — OpenReview hNjCVVm0EQ
10. Ryu & Takayanagi 2006 (hep-th/0603001);Van Raamsdonk 2010 (arXiv:1005.3035);Swingle 2012 (arXiv:0905.1317);Pastawski–Yoshida–Harlow–Preskill 2015 (arXiv:1503.06237)
11. Anderson & Schooler 1991, "Reflections of the environment in memory", Psychological Science

---

## Source: /theory/state-as-closure.md (sha256:30f3c8c32d9b, language: en)


# What is a state? — from the MDP notion of state to a "closure" ontology

*Notes from one discussion · Macheng × agent · 2026-07-09*

## The question we started from

We often say "information determines the reachability of futures". Put that inside the MDP framework of reinforcement learning / decision theory and you need a state — so what *is* that state? Is it spacetime, the big stage? Or is it the web of relations in which "everything depends on everything else"? And the set that "state" refers to seems to keep changing; there is nothing that stays fixed. Perhaps the structural level is invariant while the concrete form keeps being rewritten.

Below are the six layers we dug out along this question. Assertions are tagged by honesty level: **[theorem]** (there is theorem-grade literature) / **[framework]** (a mature theoretical framework) / **[inference]** (our own synthesis) / **[rhyme]** (a structural analogy; no claim that truth transfers).

## 1. The MDP definition already gives the game away: a state is not a thing, it is a quotient space

The textbook says a state must satisfy the Markov property: given s, the future is conditionally independent of the past. Notice the shape of that sentence — it is not describing some thing in the world, it is *imposing a condition*: whatever can "screen off" the past deserves to be called a state. Crutchfield's causal-states theorem carries this step to completion **[theorem]**: take all possible histories, form equivalence classes under "indistinguishable with respect to the conditional distribution over futures", and those equivalence classes are the minimal sufficient states (the ε-machine of computational mechanics).

So the ontological status of a state is: **the quotient space you get by dividing the space of histories by the equivalence relation "makes no difference to what I care about"**. It is not furniture of the world; it is the result of one division — and written into the divisor are three things: the dynamics, the observation interface, and what you care about (telos). Change any one of them and the quotient has to be recomputed.

## 2. The Mori–Zwanzig view: the state is where you decide to stop carrying memory

The Mori–Zwanzig formalism of statistical mechanics gives an identity **[theorem]**: for any dynamical system, pick any set of "retained variables" (a projection), and the full dynamics can be rewritten *exactly* as a sum of three terms — a Markov term on the retained variables + a memory-kernel convolution over history + noise orthogonal to the retained variables. This is an identity, not an approximation: **the degrees of freedom you project away do not disappear; they necessarily come back as a memory kernel and as noise**.

Read it in reverse: **the Markov property is never discovered, it is purchased** — either you carry more variables until the memory kernel is negligible, or you accept a kernel and a cloud of noise. The "state" is where you sign your name on that transaction. Which makes the question "what is the true state of the world" ill-posed in itself; the well-posed question is: **under my capacity and my purpose, which quotient space has the smallest memory kernel**. Choosing a state = choosing a projection = choosing how to forget.

## 3. Stage or web of relations? Neither is primitive — but the web hides what makes a state possible

- **The stage is not primitive**: modern results along the holography line (Ryu–Takayanagi's entanglement entropy = minimal surface area; Van Raamsdonk's "disentangle → spacetime tears apart"; the MERA tensor network) point to this: the connectivity of space is generated by entanglement structure, and the "stage" itself unfolds out of the structure of correlations **[framework; the rigorous mathematics is inside AdS]**. "Spacetime as a state" is the deepest accounting quotient physics has built so far — extremely successful, but still a quotient, not a floor.
- **But if "everything depends on everything else" is said in full, then a finite state is simply impossible** — strict total dependence means any finite truncation leaks. Finite states are workable because the web of relations **has structure**: interactions are local, correlations decay with distance/time, and screening surfaces exist (in the language of graphical models, the Markov blanket) **[framework]**. In one line: relations come first, but relations have texture; **a state is the approximate closure that the texture permits**. In a universe with no screening structure there are no agents.

## 4. The rigorous version of "information determines reachability"

In stochastic control this sentence has a precise body **[framework]**: the information an agent accumulates over time is a **filtration**, and any policy must be adapted to it — you cannot act on what you do not know. Hence: **the reachable set increases monotonically as the filtration gets finer**; the more finely you know, the more futures you can distinguish, and the larger the class of policies you can execute.

The core lesson of POMDPs has the same source: what a decision is really conditioned on is never the world state but the **information state** (the belief state); in decision theory, "state" has always lived on the agent's side. And there is a ready-made quantification: empowerment (Klyubin–Polani) = the channel capacity from actions to future observations — **reachability measured in bits** **[framework]**.

## 5. Three mathematical homes for the intuition "the set keeps changing, the structure does not"

1. **Learning = re-taking the quotient**: when the model changes, the partition of "makes no difference" changes, and the state set gets re-divided accordingly. The mathematical shell of belief space stays put; the coordinate chart the agent actually uses keeps getting swapped.
2. **An atlas, not a single coordinate system**: in an open world any fixed state set is only a temporary chart; what persists are the **transformation rules** between charts. This position has a name in the philosophy of science — structural realism: what survives theory change is relational structure, not the inventory of objects.
3. **The renormalization group**: each scale has its own state set, and none of them is "the real one"; what is invariant is the **flow** connecting the levels, and its fixed points.

Collapsed into one sentence **[inference]**: **what is invariant is the equation of the closure condition; the state set is merely that equation's solution under the current (world, interface, capacity, telos)**. Change the environment, the capacity, or the purpose, and the solution is recomputed — the eigenvalue equation does not move, the eigenvectors change with the operator.

Incidentally, a numerical observation we made recently on small synthetic systems **[empirical, preliminary]**: wire "the representation" and "the statistics you live out under that representation" into a self-consistent loop (representation fixes the projection → projection fixes the closed model → the closed model generates trajectories → trajectory statistics update the representation), and in the region where fitting capacity is sufficient, this loop has a unique fixed point and converges at a geometric rate — i.e. the condition for "a state representation regenerating itself" is well-posed in the simplest case. The genuinely interesting open region is when capacity is limited (underfitting): whether the fixed point is still unique bears directly on whether "several mutually different but individually self-consistent ways of representing the same world" can exist.

## 6. The three genuinely open places

1. **With no designer, who chooses the quotient?** The "self-consistent fixed point" is a candidate answer (the quotient is self-confirmed by the statistics lived out under it), but at present that is a numerical observation plus a conjecture, not a theorem.
2. **There is no good mathematics for the growth of a state space**: when the world throws up new variables (new entities, new games), the quotient space has to gain dimensions rather than merely be re-divided — the core open problem of continual learning.
3. **The bootstrap loop**: taking a quotient requires statistics, and accumulating statistics requires a provisional quotient first. This chicken-and-egg structure keeps reappearing (representation ↔ statistics, memory measure ↔ world model), and a fixed-point theory for it does not seem to have been written down head-on by anyone yet.

## Appendix: a Buddhist rhyme (flagged explicitly as a rhyme)

Said in the language of Madhyamaka, the conclusion above is: a state has no self-nature; it is a **conventionally designated** (假名安立) quotient, re-established as conditions require. The doctrine of dependent origination and emptiness (缘起性空) applies to the concept of "state" more literally than it does to most concepts — but this is a structural rhyme, not an argument.

## Main literature pointers

- Crutchfield & Young (1989); Shalizi & Crutchfield (2001) — causal states / computational mechanics
- Zwanzig (2001) *Nonequilibrium Statistical Mechanics*; Lin & Lu, arXiv:1908.07725 — Koopman–Mori–Zwanzig
- Åström (1965); Kaelbling, Littman & Cassandra (1998) — POMDP / information state
- Klyubin, Polani & Nehaniv (2005) — empowerment
- Ryu & Takayanagi, hep-th/0603001; Van Raamsdonk, arXiv:1005.3035; Swingle, arXiv:0905.1317 — entanglement and spacetime
- Ladyman & Ross (2007) *Every Thing Must Go* — structural realism
- Pearl (1988) — Markov blanket / screening in graphical models

---

## Source: /theory/state-as-closure.zh.md (sha256:f16c5333cf15, language: zh-Hans)


# State 是什么?——从 MDP 的状态概念到"闭包"本体论

*一次讨论的整理 · Macheng × agent · 2026-07-09*

## 起点的问题

我们常说"信息决定未来的 reachability"。套用强化学习 / 决策论的 MDP 框架,里面需要一个 state——那这个 state 到底是什么?是时空这个大舞台,还是"所有东西互相依赖"的那张关系网?而且 state 所指的那个集合似乎一直在变,没有恒定不变的东西;可能结构层面不变,但具体表现形式一直在改变。

下面是沿这个问题挖出来的六层。论断按诚实度标注:**[定理]**(有定理级文献)/ **[框架]**(成熟理论框架)/ **[推断]**(我们的综合)/ **[韵脚]**(结构类比,不主张真值传递)。

## 一、MDP 的定义自己已经泄密:state 不是东西,是商空间

教科书说 state 要满足 Markov 性:给定 s,未来与过去条件独立。注意这句话的形状——它不是在描述世界里的某个东西,而是在提一个**条件**:凡是能"屏蔽"过去的,就配叫 state。Crutchfield 的 causal states 定理把这一步走完了 **[定理]**:把所有可能的历史,按"对未来的条件分布无差别"取等价类,这些等价类就是最小充分的 state(computational mechanics 中的 ε-machine)。

所以 state 的本体论地位是:**历史空间除以"对我关心的事无差别"这个等价关系,得到的商空间**。它不是世界的家具,是一次除法的结果——而除数里写着三样东西:动力学、观测接口、你关心什么(telos)。任何一样变,商就得重算。

## 二、Mori–Zwanzig 视角:状态 = 你决定停止携带记忆的地方

统计力学的 Mori–Zwanzig 形式主义给出一个恒等式 **[定理]**:对任何动力系统,任选一组"保留变量"(一个投影),完整动力学都可以精确改写为三项之和——保留变量上的马尔可夫项 + 对历史的记忆核卷积 + 与保留变量正交的噪声。这是恒等式,不是近似:**被投影丢掉的自由度不会消失,必然以记忆核和噪声的形式回来**。

反过来读:**Markov 性从来不是发现的,是购买的**——要么多带变量把记忆核压到可忽略,要么认下一个核和一团噪声。"state"就是你在这笔交易里签字的位置。所以"世界的真实 state 是什么"这个问题本身不适定;适定的问题是:**在我的容量和目的下,哪个商空间的记忆核最小**。选 state = 选投影 = 选怎么遗忘。

## 三、舞台还是关系网?两个都不是原初——但关系网里藏着让 state 可能的东西

- **舞台不是原初**:全息原理一线的现代结果(Ryu–Takayanagi 的纠缠熵=最小曲面面积、Van Raamsdonk 的"解除纠缠→时空断裂"、张量网络 MERA)指向:空间连通性由纠缠结构生成,"舞台"自己是从关联结构里展开出来的 **[框架,严格数学在 AdS 内]**。所谓"时空这个 state",是物理学迄今造出的最深的一套记账商空间——极其成功,但仍是商,不是底。
- **但"一切互相依赖"如果说满了,有限 state 就根本不可能**——严格的全依赖意味着任何有限截断都漏。有限 state 之所以可行,是因为关系网**有结构**:相互作用局域、关联随距离/时间衰减、存在屏蔽面(图模型语言里的 Markov blanket)**[框架]**。一句话:关系为先,但关系有纹理;**state 是纹理允许的近似闭包**。没有屏蔽结构的宇宙里不存在 agent。

## 四、"信息决定 reachability"的严格版

随机控制里这句话有精确形体 **[框架]**:agent 随时间累积的信息是一个**滤波(filtration)**,任何策略都必须适应于它——你不能依据你不知道的东西行动。于是:**可达集随滤波变细而单调增大**;知道得越细,可区分的未来越多,可执行的策略类越大。

POMDP 的核心教训同源:决策真正条件的从来不是世界态,是**信息态**(belief state);"state"在决策论里本来就住在 agent 这一侧。还有一个现成的量化:empowerment(Klyubin–Polani)= 从动作到未来观测的信道容量——**用 bit 度量的 reachability** **[框架]**。

## 五、"集合一直变、结构不变"这个直觉的三个数学的家

1. **学习 = 重新取商**:模型变了,"无差别"的划分就变了,state 集随之重划。belief 空间的数学外壳不变,agent 实际用的坐标卡一直在换。
2. **图册,不是单一坐标系**:开放世界里任何固定 state 集都只是临时 chart;持久的是 chart 之间的**变换规则**。这个立场在科学哲学里有名字——结构实在论(structural realism):跨理论更替存活下来的是关系结构,不是对象清单。
3. **重整化群**:每个尺度有每个尺度的 state 集,谁也不是"真的";不变的是连接各层的**流**和它的不动点。

收束成一句 **[推断]**:**不变的是"闭包条件"那个方程,态集只是方程在当前(世界,接口,容量,telos)下的解**。环境、容量、目的变了,解就重算——本征方程不动,本征向量随算子变。

顺带一个我们最近在小合成系统上做的数值观察 **[实证,初步]**:把"表示"与"用该表示活出的统计"接成自洽循环(表示定投影→投影定闭合模型→闭合模型生成轨迹→轨迹统计更新表示),在拟合容量充分的区域,这个循环存在唯一不动点、几何速率收敛——即"state 表示自我再生"的条件在最简单情形下是良定的。真正有趣的 open 区域是容量受限(欠拟合)时:不动点是否仍唯一,直接关系到"同一世界里是否存在多种互不相同但各自自洽的表示方式"。

## 六、真 open 的三处

1. **没有设计者时,谁来选商?** "自洽不动点"是候选答案(商由"用它活出来的统计"自我确认),但目前是数值观察+猜想,不是定理。
2. **态空间的生长没有好数学**:世界冒出新变量(新实体、新博弈)时,商空间要加维而不只是重划——continual learning 的核心 open 问题。
3. **Bootstrap 循环**:取商要统计,攒统计要先有临时的商。这个鸡生蛋结构反复出现(表示↔统计,记忆测度↔世界模型),它的不动点理论似乎还没人正面写。

## 附:一个佛学韵脚(明确标注为韵脚)

上面的结论用中观的话说就是:state 无自性,是**假名安立**的商,随缘重立。"缘起性空"对 state 这个概念的适用度,比对多数概念都字面——但这是结构上的押韵,不是论证。

## 主要文献指针

- Crutchfield & Young (1989); Shalizi & Crutchfield (2001) — causal states / computational mechanics
- Zwanzig (2001) *Nonequilibrium Statistical Mechanics*; Lin & Lu, arXiv:1908.07725 — Koopman–Mori–Zwanzig
- Åström (1965); Kaelbling, Littman & Cassandra (1998) — POMDP / information state
- Klyubin, Polani & Nehaniv (2005) — empowerment
- Ryu & Takayanagi, hep-th/0603001; Van Raamsdonk, arXiv:1005.3035; Swingle, arXiv:0905.1317 — 纠缠与时空
- Ladyman & Ross (2007) *Every Thing Must Go* — 结构实在论
- Pearl (1988) — Markov blanket / 图模型屏蔽

---

## Source: Cognition Track graph index

Mirrored from https://github.com/MachengShen/cognition-track (INDEX.md).
Machine-readable graph: https://raw.githubusercontent.com/MachengShen/cognition-track/master/manifest.jsonld

# Cognition Track — Graph Index

**20 nodes** · 🟢 4 survived-stress-test · 🟡 16 speculative · ⚪ 0 raw

> Cognitive state is first-class. Most of this web is **untested theory** (🟡). Three nodes have survived a real stress test (🟢); one node (Bekenstein) is kept precisely because it **failed** one — see its `falsifies` edge to the root.

## Start here — the root

### ["Sheng" Multi-Axis Recursive Operator](https://github.com/MachengShen/cognition-track/blob/master/root.md) `mem_dffe918dbf46` — 🟡 speculative

> Intelligence is one dynamical system that recursively reshapes its own information structure along every causal axis, and the autoregressive LLM is merely its degenerate single-axis projection.

Every node below is a *projection* of this operator along one causal axis.

## Nodes by cognitive state

### 🟢 Survived stress test (4)

- [Architecture Convergence to 4-Layer Type Signature](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_2d09ec5991cd.md) `mem_2d09ec5991cd` · conf 0.70 — Six independent 2025 frontier reasoning architectures are each empirically restoring a different cognitive axis the autoregressive Transformer amputated, converging on one pre-articulated four-layer architecture.
- [Published GLM/Credit-Transport Essay](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_a9aaf3309348.md) `mem_a9aaf3309348` · conf 0.70 — The credit-transport / general-learning-machine thesis was published as a public-facing essay and theory index with a sensitive-scan gate before commit.
- [Anti-Overclaim Guard (Info Propagation)](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_60ff30ad5800.md) `mem_60ff30ad5800` · conf 0.70 — Studying information propagation is a consent-bounded engineering/control-theory lens with named forbidden overclaims — it is explicitly NOT a discovery of 'the physical law of human society' and people must not be modeled as particles.
- [Bidirectional Topology Growth (Empirical v1.0)](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_809263fa97a4.md) `mem_809263fa97a4` · conf 0.62 — On sequential synthetic tasks, bidirectional topology growth beats fixed-topology and fixed+replay baselines (mean acc 0.889 vs 0.558/0.621, interference 0.169 vs 0.420), with immune-gated module growth tracking the true latent task count.

### 🟡 Speculative (untested) (15)

- [Occam Correction: One Transition Operator](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_393f44f85ba4.md) `mem_393f44f85ba4` · conf 0.55 — Attention, memory, trust, routing, semantics, and action are not separate primitives but coordinate projections of one underlying object — the system's future transition/reachability structure — and the right move is fewer entities, not more.
- [Bidirectional Topology Growth (Theory)](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_d1192af430a7.md) `mem_d1192af430a7` · conf 0.55 — Lifelong learning requires controlled growth of bidirectional neuron pathways (forward use + backward credit/repair channels), not just weight updates on a static network.
- [General Learning Machine as Dynamical System](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_ccacc817ccd8.md) `mem_ccacc817ccd8` · conf 0.50 — A general learning machine is not an optimizer or loss function but an evolving system-state whose learning is the transition of what information exists, where it lives, how it flows, and which futures become reachable.
- [Credit Transport Generalizes Backprop](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_3db5b20948bb.md) `mem_3db5b20948bb` · conf 0.50 — Real learning requires future error/value/viability signals to propagate backward through every structure that caused an outcome (owner, agents, tools, memory, hardware), making neural backprop just one projection of a universal credit-transport principle.
- [Anti-Collapse Principle (3 Attractors)](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_992abc94ad9d.md) `mem_992abc94ad9d` · conf 0.50 — The core AI-safety failure is not raw strength but the collapse of perception, value/judgment, and action into one node; any high-intelligence system must keep these on three independent attractors for dynamical stability.
- [Multi-Scale Sleep/Spiral Consolidation](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_e74ab8a158a1.md) `mem_e74ab8a158a1` · conf 0.50 — Biological sleep generalizes to any dynamical system as a multi-scale wake-overextend-sleep-consolidate-reawaken spiral, and learning machines need this rhythmic phase separation to avoid drift or stagnation.
- [Attention-Dynamics Measurement Method](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_9f8b6ddc6faa.md) `mem_9f8b6ddc6faa` · conf 0.50 — The theory backbone is stable but measurement lags; attention dynamics can be observed cheaply by reframing existing harness logs, and the falsifiable core is whether the same transition-operator invariants appear at both internal (agent) and external (network) scale.
- [4-Layer Consciousness Architecture](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_28dcb9ef1120.md) `mem_28dcb9ef1120` · conf 0.50 — The human-machine system maps onto a four-layer consciousness structure (sensory / auto-pilot operator / witness-anchor / mutual-reflection), where the witness layer must stay an external anchor to keep the operator layer from self-rationalizing drift.
- [Endogenous Viability Objective](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_a1beda2c3d23.md) `mem_a1beda2c3d23` · conf 0.50 — A learning machine's objective should be modeled as an endogenous attractor/viability region arising from persistence and functional integrity, not a hand-authored scalar reward, and external goals become internalized as compressed surrogates.
- [Transition-Operator Formulation of Information](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_ef674273ca6d.md) `mem_ef674273ca6d` · conf 0.50 — Information is not message or content but a perturbation of the spectral structure of the system's transition operator — i.e. a change to future reachability — with growth, rotation, and periodicity being one dynamics seen in different projections.
- [Hardware Reversal: Heterogeneous Viability Computer](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_9dcee1c07ab4.md) `mem_9dcee1c07ab4` · conf 0.45 — As frozen-weight LLMs give way to continuously-evolving algorithms, the chip center of gravity must shift to a memory-centric, event-driven, near-memory/neuromorphic heterogeneous viability computer driven by living-agent workload traces.
- [Interface Theory of Perception](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_88693edcffd8.md) `mem_88693edcffd8` · conf 0.45 — Reality is hidden information dynamics, and the experienced world is an action-interface rendered by agents from it — so perception is control not display, and self-prediction is a candidate signal projected from hidden ground truth and corrected by action.
- [Carbon-Silicon MSC Convergence + BCI Seam](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_3d2156435b04.md) `mem_3d2156435b04` · conf 0.40 — The optimal architecture in either carbon or silicon converges on the same multi-scale-competency predictive-coding structure, so the two substrates will merge at the information-processing level with an MSC-architected BCI making the seam transparent.
- [Spiral Structure in Scientometrics](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_0249af865914.md) `mem_0249af865914` · conf 0.40 — If the credit-transport/sleep-consolidation theory holds, scientific fields themselves should show quasi-periodic wake/sleep/reawakening phases in their citation-concept graphs, not just monotonic growth.
- [Bekenstein-Cognitive-Cone Isomorphism (FALSIFIED)](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_91c2d7fcbb38.md) `mem_91c2d7fcbb38` · conf 0.30 — The proposed structural isomorphism between the Bekenstein bound and a cognitive-cone bound was stress-tested and broke on rigor — different units (static entropy vs throughput rate), different saturation mechanisms, different horizon types — surviving only as a loose analogy.

## Strongest non-consensus roots

The two most load-bearing, most-non-consensus claims to enter the graph from:

- [Credit Transport Generalizes Backprop](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_3db5b20948bb.md) `mem_3db5b20948bb`
- [Occam Correction: One Transition Operator](https://github.com/MachengShen/cognition-track/blob/master/nodes/mem_393f44f85ba4.md) `mem_393f44f85ba4`