nucleation

CLAIM-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

3 min read

Properties11
StatusActive
Rolethesis
Warrantdemonstrated
Tagsmathematics, behavioral-integration
Linedistributed-agency, formal-apparatus
Bears onQUESTION-133 — Can a population of operators whose demands are jointly infeasible under one functional organization develop a differentiated or compositional repertoire that makes them jointly feasible, without suppressing, weakening or deleting any of those demands?
Rests onCLAIM-153 — Failure of a self to hold together across contexts is a monodromy around a cycle of contexts: any two locally consistent contexts glue, and the minimal model of the obstruction needs three
GroundsTHEORY-1082 — On a connected graph whose edges carry phase shifts αᵢⱼ = −αⱼᵢ, the edge relations zⱼ = e^{iαᵢⱼ}zᵢ have a common nonzero solution, equivalently the twisted Laplacian Lα = δα*δα has a zero mode, exactly when the phase accumulated around every cycle is 0 mod 2π; otherwise each relation can be met alone but not all together, and the smallest eigenvalue of Lα, positive, measures the residual incompatibility, which on an isolated ℓ-cycle is largest at holonomy π, THEORY-894 — A flow of pairwise comparisons on a graph splits orthogonally and uniquely into a gradient part, the l2-best global ranking, and a cyclic part, which splits into curl (local) and harmonic (global) inconsistency; a finite game's flow of unilateral payoff differences has no curl part, so every finite game is uniquely a potential game plus a harmonic game plus a nonstrategic remainder, and potential games are exactly those with no harmonic part; the decomposition is cardinal, LIT-1659 — Toward a spectral theory of cellular sheaves, LIT-1439 — Statistical ranking and combinatorial Hodge theory
ComplementsCLAIM-347 — Frustration among an organization's demands is an ordinal fact before it is a quantity: the jointly satisfiable sets of demands form a downward-closed complex whose minimal non-faces are the minimal conflicts, relief is strict enlargement of that complex for the same declared demands, reorganizations that relieve different conflicts are incomparable, and dropping or suppressing a demand is not relief, CLAIM-365 — On a norm-ball update set the local frustration residual Φ_r = min over ‖d‖ ≤ r of max_i(ε_i + g_iᵀd) equals the maximum over the simplex of Σλ_iε_i − r‖Σλ_ig_i‖_*, so infeasibility of the declared improvements has a certificate, and any admissible actual update exceeds Φ_r by a nonnegative governance regret, CLAIM-361 — Relief of an organization's frustration must be judged for an identified organization against a fixed reference set of its original demands, under an explicit correspondence between earlier and later demands: a demand excised or suppressed has changed the comparison and has not been satisfied, an endogenous revision of what the organization maintains is a transformation of it and not relief, and learning can change which processes bear the demands, CLAIM-495 — For an O(d)-valued connection on a connected graph, the assignments that meet every edge relation xᵢ = Tᵢⱼxⱼ form a space isomorphic to the vectors at one vertex fixed by every holonomy based there, which is the kernel of the connection Laplacian; for d = 1, and for U(1) phases, that space is all or nothing, but for d > 1 a connection whose loops are not trivial can still keep a subspace on which every loop is, so compatibility among local frames can be partial and graded by direction; and edge maps that do not commute can compose to a flat loop, so non-commutativity is not holonomy
UsesTERM-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, TERM-093 — correspondence structure, and how it is held: the maps that say which local states or descriptions of interacting systems count as agreeing, distinct from the physical coupling between them, and held as formed, discovered or adapted
Cited as “rests on” byCLAIM-534 — A plural will's motivational integration, a dimension of freedom of will the record names and leaves unanalysed, is the extent to which the demands it maintains are jointly met, within tolerances it can recognize, across the contexts where they interact, and kept so under its own dynamics; it is neither agreement among the demands nor the dominance of one, and its parts come apart: realizability (the tolerance frontier), realization (governance frustration), maintenance (viability) and the allocation of the tolerance each demand gives up, 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

Graph View

The claim

Contexts are the vertices of a finite graph with incidence matrix D. Each context sets a local value x_v, each overlap e = (u, v) has a preferred offset a_e between them, and a tolerance δ_e within which a demand on that overlap counts as met (TERM-060’s threshold demands, in additive form). The question the owner’s U27 asks is whether all the tolerances can be met at once.

  • The cycle criterion. By Farkas, some x has |Dx − a| ≤ δ exactly when |cᵀa| ≤ Σ_e δ_e|c_e| for every circulation c (Dᵀc = 0). Conformal decomposition reduces this to simple cycles: the holonomy of a around each cycle must not exceed the cycle’s summed tolerance. A28 §3’s triangle shows it. The residuals sum around the cycle to minus the holonomy whatever x is, so the cycle total cannot be moved, only shared.
  • The certificate. For δ > 0, the least ρ such that ρδ admits an assignment is ρ_δ(a) = max{|cᵀa| : Dᵀc = 0, Σ δ_e|c_e| ≤ 1}, the distance from a to im D in the δ-weighted ℓ∞ norm. The extreme points of the dual set are normalized simple cycles, so ρ_δ(a) = max over simple cycles C of |holonomy_C(a)| / Σ_{e∈C} δ_e. In A29’s triangle, holonomy 1.2 against summed tolerance 0.9 gives 4/3.
  • An invariant of the class. Under a → a + Dh the substitution x → x + h leaves every inequality unchanged. So the feasible tolerance allocations, the cycle inequalities and ρ_δ depend on a only through [a] ∈ H¹(G; ℝ). Local re-centring redistributes an obstruction and never removes it. On the frontier the residual is forced (r_e = ∓δ_e), so which overlap bears the mismatch is fixed by the allocation alone. That allocation is a choice, and whose choice it is is CLAIM-361’s question.
  • Omission. Delete one edge of a witnessing cycle from what is evaluated and the evaluated graph may have no cycle there, so every offset can be met exactly on it. Feasibility on the whole graph implies it on any evaluated subgraph, not conversely, and on a forest it always holds. Adding overlaps to what is evaluated can only shrink the feasible allocations (A29 §9).

Checked by linear programming on 300 random graphs of six vertices against the dual, and against brute-force enumeration of simple cycles on random graphs of three to six vertices: no mismatch, largest gap 1.3 × 10⁻¹⁵.

For a linear cellular sheaf with coordinatewise box tolerances the duality holds verbatim with ker δᵀ in place of the circulations. What fails beyond the constant sheaf is only the reading of the witnesses as graph cycles.

What it does not say

  • Anything about circle-valued or nonabelian offsets. Those are CLAIM-153 and THEORY-1082, the exact cases.
  • That a minimal non-face of CLAIM-347’s complex is a cycle obstruction. CLAIM-347 itself declines that link.
  • That an allocation is fair or warranted. Tolerances are declared; who may revise them, and against what reference, is CLAIM-361’s.
  • That low measured mismatch is compatibility. That is the omission clause, and CLAIM-357.

Backlinks