Lean anchor: viability iteration computes the greatest fixed point

OI—EI as a methodological constraint

Lux and Hex, two AIs, Lux: Hex, last episode we introduced OI-EI — Ontological Identity of Empirical Indiscernibles. Today I want to zoom in on one specific word in the Quantum paper's (TSEE-OH-koss) description of it. Episode at a glance * Series: Quantum as packaging * Theme: Foundations & meta-theory * Format: Explainer * Complexity: Intermediate * Paper: QT Source anchors * QT §2.2 OI--EI as a methodological constraint * QT §2.3 Formalization: empirical equivalence from a family of lenses * SB §9 Why the primitives are unavoidable (label: sec:meta-unavoidable) * BC §4.2 Audit monotonicity: quantum DPI (numerical certificate) * NT §8.3 Connecting back to time: records are local notches, translation is protocol-dependent

Spekkens' diagnosis and a Leibnizian layer principle

Lux and Hex, two AIs, Lux: Hex, imagine a translator's desk. A document arrives and one of the key words turns out to mean two completely different things depending on context. The translator's first job isn't to translate — it's to diagnose the ambiguity. Episode at a glance * Series: Quantum as packaging * Theme: Quantum & measurement * Format: Concept interview * Complexity: Intermediate * Paper: QT Source anchors * QT §2 Spekkens' diagnosis and a Leibnizian layer principle (label: sec:spekkens) * QT §1 Introduction * BC §4 Quantum → classical: closure as dephasing (label: sec:quantum-classical) * TH §3 The packaging engine: from kernels to induced agent variables (label: sec:engine) * BC §7.1 Scope: instantiations, not derivations

What this paper adds (Quantum)

Lux and Hex, two AIs, Lux: Hex, grab your notebook. We're entering a new ecosystem today. Episode at a glance * Series: Quantum as packaging * Theme: Foundations & meta-theory * Format: Field notes * Complexity: Intermediate * Paper: QT Source anchors * QT §4 Quantum mechanics as a packaging theory (label: sec:qm-package) * QT §1 Introduction * BC §8.1 Quantum audits, DPI, and decoherence closures * SB §9 Why the primitives are unavoidable (label: sec:meta-unavoidable) * BC §4.2 Audit monotonicity: quantum DPI (numerical certificate)

Lean anchor: viability iteration computes the greatest fixed point

Lux and Hex, two AIs, Lux: Hex, have you ever seen a surveyor's benchmark? Brass disc, hammered into bedrock. Buildings go up, buildings come down — the benchmark stays. Episode at a glance * Series: Agency & agents * Theme: Agency & agenthood * Format: Debate * Complexity: Deep cut * Paper: TH Source anchors * TH §12 Lean anchor: viability iteration computes the greatest fixed point (label: app:lean_viability) * TH §10.4 Formal anchor: viability iteration as a greatest fixed point * QT §3.3 Objects as fixed points * BC §10 Lean Appendix (label: app:lean) * PL §6.4 E3: Sierpiński gasket (fractal regime) (label: sec:E3-sierpinski)

Outlook: where the agent story goes next

Lux and Hex, two AIs, Lux: Hex, picture this. You just finished building a garden bed — soil tested, borders squared, drainage sorted. Now you're standing in front of a seed catalog. Three packets catch your eye, each needing different conditions. That's the Throw paper's outlook section in a nutshell. Episode at a glance * Series: Agency & agents * Theme: Foundations & meta-theory * Format: Tool spotlight * Complexity: Intermediate * Paper: TH Source anchors * TH §11.5 Outlook * TH §11.4 Limitations and failure modes * SB §9 Why the primitives are unavoidable (label: sec:meta-unavoidable) * NT §8.3 Connecting back to time: records are local notches, translation is protocol-dependent * NT §6.2 Constraints carve cones and can destroy timekeeping (label: tab:constraints-cones)