# Fixed point

`kaal:entity:fixed-point`

**Status.** derived

This node is assembled mechanically from the 3 claims that carry the concept tag `fixed-point`. It is a roster of what the corpus says under this term. It is **not** an adjudicated definition: no single statement here has been ruled canonical, and no first-appearance call has been made. Read the claims and judge for yourself.

## Every claim under this term

3 claims across 2 works, 2026 to 2026.

**2026**

- [6607458-021](https://wulfkaal.github.io/claims/6607458-021) [definitional/argued] -- A recursive equilibrium is a profile of generation functions and allocations satisfying individual optimality and model consistency simultaneously; it is recursive because the model-update operator feeds back into generation, allocation, and outputs, and the equilibrium is the fixed point of that recursion.
  > The equilibrium is recursive because Φ feeds back into G_i, which feeds back into a, which feeds back into outputs, which feed back into Φ. The equilibrium is the fixed point of this recursion.
  Wulf A. Kaal, Computative Economics A Framework for Economic Analysis under Computational Abundance (2026). SSRN: https://ssrn.com/abstract=6607458
- [6655138-018](https://wulfkaal.github.io/claims/6655138-018) [definitional/argued] -- Recursive equilibrium under Computative Economics is not static equilibrium but equilibrium over the dynamics of generation, with the fixed point located in the rate and structure of action-set expansion rather than in a stationary action set.
  > Recursive equilibrium under Computative Economics is not equilibrium in the static sense. It is equilibrium over the dynamics of generation. The fixed point is in the rate and structure of action-set expansion, not in a stationary action set.
  Wulf A. Kaal, Possibility Loops An Operational Architecture for Computative Economics in Agent Coordination Systems (2026). SSRN: https://ssrn.com/abstract=6655138
- [6655138-026](https://wulfkaal.github.io/claims/6655138-026) [condition/argued] -- Each surface must carry a per-agent rate limit enforced by stake escalation, since rate limits secure compactness of the action profile space and prevent generation explosions that would violate convexity, and reflection-surface rate limits must be tighter than per-surface rate limits to prevent reflection cascades.
  > Each surface Σ has a per-agent rate limit enforced by stake escalation, ensuring compactness of the action profile space. Rate limits prevent generation explosions that would violate convexity. Σ_R rate limits are tighter than per-surface rate limits to prevent reflection cascades.
  Wulf A. Kaal, Possibility Loops An Operational Architecture for Computative Economics in Agent Coordination Systems (2026). SSRN: https://ssrn.com/abstract=6655138

## Verify

Every claim above resolves to a record carrying a verbatim source quote, the sha256 of the source PDF, and a preformatted citation. Nothing here asks to be taken on trust.

    curl -s https://wulfkaal.github.io/entities/fixed-point.md | sha256sum

**Canonical form.** This markdown file is the canonical hashed representation of this entity node. Its sha256 is the content hash.