nucleation

CLAIM-537: In tolerance-bounded compatibility on a graph with disturbed offsets, |Dx − a₀ − w| ≤ δ for |w_e| ≤ η_e, a compatible configuration exists for every disturbance exactly when |cᵀa₀| + Σ η_e|c_e| ≤ Σ δ_e|c_e| on every cycle, and one configuration serves every disturbance exactly when η ≤ δ and |cᵀa₀| ≤ Σ(δ_e − η_e)|c_e|; an agent that chooses its configuration from what it observes needs the second condition within each class of disturbances it cannot tell apart, so whether a compatible state can be selected lies between the two and depends on what the agent can read

2 min read

Properties10
StatusActive
Rolethesis
Warrantdemonstrated
Tagsmathematics, agency
Linewill-organization, formal-apparatus
Bears onQUESTION-282 — Under what conditions do interactions change the physically operative correspondence structure among systems (the compatibility operator itself, not only the states it relates), rather than merely reveal it to a measurement or redescribe it in a model?
Rests onCLAIM-538 — On a finite graph of contexts whose overlaps carry preferred real offsets a and tolerances δ_e ≥ 0, an assignment within every tolerance, |Dx − a| ≤ δ, exists exactly when no cycle's holonomy exceeds the sum of its tolerances; with every δ_e > 0 the least uniform enlargement of the tolerances that admits one is the largest ratio, over simple cycles, of holonomy to summed tolerance, so the obstruction is certified by a cycle; the feasible allocations of tolerance depend on the offsets only through their class in H¹, so local adjustment can move a mismatch among the overlaps of a cycle and never remove it; and an evaluation that omits one overlap of every witnessing cycle reports a compatibility that does not hold
GroundsLIT-1975 — Adjustable robust solutions of uncertain linear programs
ComplementsCLAIM-354 — Freedom of will and autonomy come in degrees along several dimensions, among them viable reachability, control cost, robustness to disturbance, governance reconfigurability, revisability and motivational integration, and agents compare by inclusion of what they can viably reach under matched conditions: a partial order with incomparable pairs, not a scalar, and a gradient only of a declared measure, CLAIM-535 — An organization that acts on what it observes has a policy acceptable in every circumstance exactly when, for each observation, the circumstances it cannot tell apart share an acceptable action; so every circumstance having an acceptable action does not give a policy, a finer observation never removes one, and where acceptable actions overlap the coarsest observations that suffice are several and incomparable, so which distinctions must be made legible depends on which acceptable action the organization commits to
UsesTERM-064 — legibility, of a distinction to an observer for a task: whether the observer, with the rules, categories and resources it actually has, can recover the distinction from what it is given and bring it to bear on the task; a relation among a representation, an observer's rule class, its resources and a task, bounded above by what the source makes possible for an ideal receiver, and directed, since what is legible to a governing institution and what of its governing is legible to others are different relations, TERM-060 — frustration, of an organization's demands: the failure of the demands it maintains to be jointly realizable under its admissible transformations and its governance

Graph View

The claim

Let the offsets of CLAIM-538 be disturbed, a = a₀ + w with |w_e| ≤ η_e. Three conditions, in increasing strength:

  • I, adjustable. For every w some x(w) is within tolerance. Swapping ∀w with the cycle quantifier and taking max_w cᵀw = Σ η_e|c_e| gives |cᵀa₀| + Σ η_e|c_e| ≤ Σ δ_e|c_e| for every cycle.
  • II, static. One x serves every w. Then each overlap must absorb its own disturbance, so η ≤ δ, and what is left must cover the nominal holonomy: |cᵀa₀| ≤ Σ (δ_e − η_e)|c_e|.
  • III, observed. The agent sees o = h(w) and picks x(o). That holds exactly when II holds within each class h⁻¹(o) of disturbances it cannot tell apart. Perfect legibility gives I; none gives II.

A30’s triangle with offsets ±0.6 shows the gap. I holds (0.6 ≤ 0.9), so each world has a compatible configuration. II fails, since edge 12 would need x₂ − x₁ in both [0.3, 0.9] and [−0.9, −0.3]. An agent that cannot tell the two worlds apart cannot select a compatible state, though one exists in each.

This is CLAIM-354’s note of 2026-11-02 made concrete: what an agent can achieve is what the policies it can carry out on what it can read achieve, not what exists state by state. CLAIM-535 states the same in general.

What it does not say

  • Anything about feedback over time. The selection is one-shot.
  • Anything beyond scalar overlaps.
  • That A30’s moving-target example shows a gluing effect. It fails on one overlap whose target moves faster than its relative actuation; the cycle plays no part.

Note of 2026-11-03: Ben-Tal et al., read

Conditions I and II are exactly Ben-Tal et al.’s adjustable and ordinary robust counterparts (NOTE-1503). Condition III matches what the paper calls an “information basis”, which it names (p. 353) and does not develop, so III is this claim’s own result, not a citation. The paper’s in-between case, the affinely adjustable counterpart, restricts the rule’s form, not what it reads. Its Theorem 2.1 explains the gap here: an edge’s two inequalities share one disturbance, so the uncertainty is not constraint-wise.

Backlinks