Topics — What a work is about. Nucleation holds whatever reading the owner files here, whether or not an Anthology of the SOTA topic could also hold it; instruction for ML practice belongs to the anthology (ADR-048). The words are seeded from the clusters the reading-time triage of 2026-09-25 found, and grow by decision.
Mathematics — mathematics read for itself — category theory, topoi and sheaves, spectral geometry, set and measure theory — including mathematical frameworks applied to other fields.
104 of 547 CLAIM documents. Back to the full index.
| # | Title | Summary | Status |
|---|---|---|---|
| CLAIM-011 | Intertwining with an uninformative correspondence is vacuous or lossy, so the source–target correspondence must be anchored to independently measured distinctions and evaluated on tasks other than those it was estimated on | The assistant’s own objections at A34 §3 and A40 §6.4, with the remedy of A40 §VIII. Recovered: the manuscript keeps the intertwining identity but states neither limit nor remedy, apparently by inadvertence. | Active |
| CLAIM-015 | Classical structuralism studies relations within a system, whereas this theory makes the transport of relational systems its object and does not require structure to remain invariant | A102’s contrast under U36, objected to by the owner at U37 (“symmetry is a kind of invariance, no?”) and conceded at A105: “My earlier contrast between structural invariance and structural transport was too sharp.” | Superseded — by CLAIM-113 |
| CLAIM-017 | What survives translation is the invariants, and approximately preserved relations, of communicative transformation | The crystallized argument’s final thesis (A110, U38). The manuscript’s answer, written three minutes later in C7, is receiver-relative: what “a receiving system can still reconstruct and act upon”. No turn announces or argues the change. | Superseded — by CLAIM-115 |
| CLAIM-035 v2 | Translation operations are generally not invertible, need not compose by a fixed rule, and preserve no structure given in advance; which communicative properties are invariant must be discovered or negotiated | A18’s own limit on its analogy: “the physics analogy has a hard limit.” Accepted at once. Its content reached the manuscript as the semigroup of §4. | Active |
| CLAIM-040 | Symmetry is a kind of invariance, and Noether’s theorem is the point: invariance under transformation yields conservation | The owner at U37, quoting A102’s “We do not require the structure to remain invariant”: “symmetry is a kind of invariance, no? isn’t that part of the point of Noether Theory?” Conceded at A105. Its Noether half was limited by the assistant in the same reply. | Active |
| CLAIM-056 v4 | Local transport errors in a reconstruction chain are bounded by the per-step discrepancies weighted by the sensitivity of the later reconstructions, so the same local error can be damped, accumulated or amplified, and local similarity can coexist with large global drift; the bound measures departure from a reference transport, not whether the act survives | A50 §2–3, kept nearly verbatim in outline v4 and the manuscript §8. The manuscript later restricts the expansive regime: for stochastic kernels in total variation, contraction coefficients do not exceed one. | Active |
| CLAIM-059 v3 | Repeated reconstruction chains fall into different regimes under conditions assigned in advance, contracting toward conventions, accumulating neutrally or amplifying, and amplification needs a metric other than total variation, an enlarged state or state-dependent dynamics | A50 §3, A52 §5.3 and the crystallized argument §19, recovered. The manuscript and C7 Appendix B keep the corrected bound and the remark that κ ≤ 1 in total variation; the taxonomy and its third experiment’s test were dropped. | Proposed |
| CLAIM-063 v3 | A transport that approximately intertwines each framing operation approximately preserves their commutator, so the degree to which interpretive perspectives interfere can itself be part of what a translation preserves; on observed responses that degree is the order effect, which the intertwining defects bound only with a readout defect added and which the data identify only through observational distortion | A34 §4, made approximate at A40 §6.4 and stated in the manuscript §9 as the commutator-distortion identity. Its argument is an ARG because A40 limited the inference: the conclusion holds of Φ’s image only. | Proposed |
| CLAIM-067 | If a transport exactly intertwines a generating set of communicative operations, it preserves every trajectory composed from them | A49’s “compositional preservation theorem”, proposed as the paper’s organizing result. True as algebra; superseded at U20 when the owner objected that fidelity is similarity within ε, not equivalence. Its rationale, test generators and infer trajectories, lives on in the drift bound. | Superseded — by CLAIM-106 |
| CLAIM-069 v3 | The 2016 Contextuality-by-Default criterion was being replaced by multimaximal couplings as it appeared, and the change matters for observables in more than two contexts | From the reading of Dzhafarov and Kujala 2016 (NOTE-600). The manuscript cites the 2016 paper; its general observational covers need the later version. | Superseded — by ARG-022 |
| CLAIM-070 | Transport induced by one global stochastic kernel carries a global extension of the source model to a global extension of the target model | Proposition II of A84, Proposition B2 of C6, the manuscript’s Proposition 2. Without a common global kernel preservation is not automatic, which leaves open whether transport can create or destroy contextuality. | Active |
| CLAIM-077 v3 | A transport is admissible only if it keeps specified observable distinctions apart, which excludes trivial collapse by construction | A49’s answer to the collapse objection, recovered: d_O(s_1, s_2) > δ implies d_O(Φ(s_1), Φ(s_2)) > δ′. The owner’s U19 strategy at work: define rather than defend. One bullet in outline v4; absent from the manuscript. | Active |
| CLAIM-093 | Not every invariance of a stochastic or communicative process implies a Noether conservation law: the symmetry principle can be borrowed, a conservation analogue has to be derived | A105, limiting the owner’s U37 appeal to Noether in the same reply that conceded the rest. The manuscript §4 and §11: Noether-type results give “conservation criteria for particular stochastic processes, not a universal conservation law of meaning”. | Active |
| CLAIM-094 | A harmonic observable conserves only its mean, and Baez and Fong show that mean conservation for every initial state does not make an observable a symmetry | From the reading of Baez and Fong (NOTE-598). The manuscript’s Kf = f is the mean-only condition, which the cited theorem’s counterexample shows is weaker than commuting with the generator. | Active |
| CLAIM-098 v3 | Translation and cross-modal reconstruction need not be group actions: they form a category or semigroup of directed stochastic transformations, in which invertible symmetries are special cases | Manuscript §4. The one trace the relativity analogy left: symmetry and equivariance for exact preservation, a semigroup of stochastic maps for the rest. | Active |
| CLAIM-100 | Sheaf-theoretic contextuality has to be extended to directed transport between observational scenarios whose covers change, and that extension is the theory’s open mathematical problem | A93 §1’s “Research opportunity” and A94’s bridge question, which the owner quoted at U34. The manuscript concedes the gap (“cover-changing or incompatible maps demand separate analysis”, §6) without posing it. | Superseded — by CLAIM-125 |
| CLAIM-101 | Translation is a context-conditioned transport process that preserves selected structures of communicative meaning to varying degrees while introducing distortions that may accumulate, attenuate or amplify under composition | A50 §7 and outline v4 (A52), after the owner’s U20 objection. The manuscript keeps transport, graded fidelity and drift. Superseded at U30 by the observational-structure thesis of proposal v5 (A81–A83). | Superseded — by CLAIM-124 |
| CLAIM-103 | Symmetry is not opposed to transport: exact symmetries are the invertible core of a nested family of transports, and their main use is to supply the invariants against which non-symmetric transports are assessed | A110 §25, recovered. The manuscript §4 keeps “invertible symmetry maps are special cases” and drops the nesting and the yardstick role, apparently by inadvertence. | Proposed |
| CLAIM-106 v3 | Pragmatic fidelity is a graded, potentially asymmetric property of transport, not an equivalence relation; equivalence is its zero-distortion limit | The owner’s objection at U20, accepted in full by A50 (“an important correction”) and made the thesis of outline v4. The manuscript §12: “stochastic transport generalizes exact equivalence to graded fidelity.” | Active |
| CLAIM-107 v3 | Under Markov reconstruction kernels, an observable’s expectation is invariant when the observable is harmonic (K f = f), and drifts by at most Σ ε_i when ‖K_i f − f‖∞ ≤ ε_i; on a finite irreducible chain only constants are harmonic | The manuscript’s §4, citing Baez and Fong. CLAIM-094 says what the cited theorem needs that the discrete-time criterion leaves out. | Active |
| CLAIM-108 | Communicative identity is characterized by the observational structures and relations invariant or equivariant under specified classes of transformation, and fidelity by their preservation, deformation or loss | A105’s thesis after the owner’s U37 objection, with the title question restated: “What are the invariants of communicative transformation, which classes of transformation preserve them, and what happens when those symmetries are broken?” The manuscript’s §1 thesis is a softened form. | Superseded — by CLAIM-017 |
| CLAIM-113 v2 | Transformations and invariants define one another: translation preserves some structures exactly, carries some equivariantly, preserves some approximately and reorganizes others, and identity is studied through what a class of transformations leaves invariant | A105’s reframing after U37, and the manuscript §4 and §11: “Structural transformations help identify structure through what they preserve”, with a four-way split of exact, equivariant, approximate and reorganizing transformations. | Active |
| CLAIM-117 v3 | Pragmatic fidelity requires preserving the dynamics of interpretation, not only final judgements: a good transport approximately intertwines source and target framing operations under a correspondence anchored to independently measured distinctions | A30’s commuting diagram for pragmatic fidelity, developed in the manuscript §9 as intertwining defects and the commutator-distortion identity. | Proposed |
| CLAIM-119 v2 | Communicative categories form a concept lattice rather than a hierarchy: categories such as affectionate teasing and sarcastic condemnation share attributes and differ in a few social-relational constraints | A75 §7, recovered: formal concept analysis as the direct formalization of the owner’s “objects are intersections of regions”. Absent from A81, C6 and the manuscript without critique. The record holds Ganter and Wille unread. | Proposed |
| CLAIM-121 | A transport whose local kernels commute with restriction maps overlap-consistent source models to overlap-consistent target models | Proposition I of A84, Proposition B1 of C6, the manuscript’s Proposition 1. It concerns marginal consistency, not global noncontextuality. | Active |
| CLAIM-125 v4 | Directed transport between empirical models whose covers change has two open problems: when it preserves decision-relevant information, and how it extends to signalling data | CLAIM-100 narrowed. Simulations between empirical models already give directed stochastic transport between scenarios whose covers change, and settle when it preserves global compatibility. What is left open is decision-relevant information and signalling data. | Active |
| CLAIM-131 | A compatible family of sections of the event sheaf always glues, so where a communicative object lacks a global realization the obstruction lies in its supports or distributions, not in the event sheaf | The assistant at A125 §2 and A129 §2, after the owner’s U41 “double click on this”. It is the standard sheaf property of E(U) = ∏ O_x (Abramsky and Brandenburger). Granted, because it is elementary; it is used against TERM-002’s wording, not against CLAIM-038’s thesis, which version 2 restates to agree with it. | Active |
| CLAIM-132 v2 | Characters classify finite-dimensional representations of a finite or compact group up to isomorphism only over a field of characteristic zero; they forget the isomorphisms, fix neither the group nor a permutation action, and classify kinds, not tokens or positions | Standard representation theory, which the exchange states correctly with its main hypotheses (A194 §1, A198 §§2 and 4, A203 §§5–6, A218 §3.2). This entry adds the limits the exchange left out, and the exact link to Yoneda: a character is a counts-only relational profile, complete because the category is semisimple. Granted, because it bounds the owner’s analogy: priority for classifying kinds up to isomorphism, in the most favourable setting, and no further. | Active |
| CLAIM-141 v2 | Causal-loop consistency and sheaf contextuality are both local-to-global problems, but passing to distributions affects them oppositely: a loop with no deterministic solution has a distributional fixed point, while a model with no global section in its supports has no global distribution either | A161, after the owner’s U46, sharpened. A161 saw that a causal loop and a contextual model are “not the same”, but not that they run in opposite directions under passage to distributions, or why. Its parity pattern is LIT-278’s identification of Liar cycles with contextual support tables, which the record holds and has read (NOTE-251). A173 and A178 kept the three kinds of global consistency apart; A218 Ch10.9 keeps the feedback case. | Active |
| CLAIM-142 v3 | Two communicative realizations can agree on every probe in a restricted family without being structurally identical, so observational equivalence is relative to the probes, and only independently justified probes evaluated on held-out cases are evidence that structure was preserved | It began at the owner’s U45 pointer to Yoneda, and A158 §5 gave it its first form. A173, A178 §3.2, A184 §2, A203 §§8 and 14, A214 §3 and A218 Ch7 restate it; A203 calls it “our central epistemic distinction”. The mathematical half is elementary and exact. The substantive half is the realist commitment that communicative identity is not exhausted by any probe profile. It makes TERM-014’s equivalence class probe-relative, and puts a realist reading over CLAIM-046’s methodological ordering. | Proposed |
| CLAIM-144 | Inertial observers who disagree about temporal order differ in coordinates, not in a failure to glue: only spacelike-separated events change order between frames, and frames are global charts related by a group action | A164’s correction of the owner’s U47, which is standard special relativity, with two repairs. A164 left out the reading of the owner’s scenario whose answer is invariant (two passings of one marker). And it described frames as patches glued by a cocycle, which they are not: each inertial frame charts all of spacetime, and the frames are related by the Poincaré group. | Active |
| CLAIM-148 v4 | A matrix factorization is identified only up to an invertible change of latent coordinates, which weight decay narrows to rotations and nonnegativity to rescalings and permutations plus a data-dependent remainder; such a gauge is not a symmetry of the relational system, and automorphisms of the data act on the factors only when the factorization is identifiable | Drawn by the assistant at A207 §3, made explicit at A214 §6 and kept in A218 (§4.2, Ch5.4–5.9). Granted, because it is elementary, and the record already held its mathematics. The record adds the full list of invariants, the data-dependent freedom of nonnegative factorization, and why identifiability must come before automorphisms and characters. It does not say latent axes are meaningless, or that observed data have non-trivial automorphisms. | Active |
| CLAIM-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 | Dual-filed from MOM-CLM-165 (ADR-037). Model contexts (roles, personas, sub-agents) as a cover, and the offsets that reconcile neighbours as a cochain. A global section, one coherent self, exists exactly when the monodromy Φ around a cycle vanishes. Two contexts always glue, so compartmentalization needs a loop. The frustrated XY or Kuramoto energy finds the obstruction: its minimum is 0 exactly when Φ ≡ 0. Abelian case only; re-checked here. | Active |
| CLAIM-164 v4 | What a spectral gap makes definite is the subspace of the cluster it isolates, not a single direction: the gap picks the object, and the object is a vector only when its own gap is wide | Dual-filed from MOM-CLM-144 (ADR-037). Under a perturbation δT, the subspace spanned by a cluster of singular values separated by a gap δ rotates by at most ‖δT‖/δ (Davis–Kahan), whatever happens to the vectors inside it. So the well-defined unit is the gap-isolated projector. Re-measured here. With CLAIM-154 it is a criterion: the gap picks the object, and the Occam factor says whether the gap is big enough. | Active |
| CLAIM-193 v4 | A linear probe family can tell apart only realizations whose representations differ in normalized kernel, and kernels fix a representation only up to the symmetry of what is observed: any distinction beyond that is supplied by the analyst | A partial answer to QUESTION-031 for the linear case, from THEORYs the record held without linking them to the line. What a regularized linear readout decodes is a function of the normalized kernel (THEORY-008); kernels fix a representation only up to the symmetry of what is observed (THEORY-004, THEORY-723); an inner product beyond that is a stipulation (THEORY-018); and spectral degeneracy does not identify the symmetry (THEORY-019). Proved results for learned representations; the carry-over to communicative realizations is the filer’s. | Proposed |
| CLAIM-196 | A person’s roles in contexts that do not meet cannot contradict one another: role conflict needs an overlap, which segregating audiences prevents and collapsed contexts create | The MoM manuscript models a person’s roles (“daughter”, “teacher”, “friend”) as sections over family, professional and social contexts, with identity as their global section, failing when the roles contradict. Roles in contexts that do not meet glue (CLAIM-197), so contradiction between them is not yet a failure. Conflict needs an overlap: an occasion on which two audiences are present at once. People manage the cover. They segregate audiences, which keeps the contexts disjoint, and they script the occasions where audiences must meet. Broadcast and networked media collapse contexts, which creates overlaps the person did not choose (boyd 2008, after Meyrowitz 1985). | Proposed |
| CLAIM-197 | Sections over contexts that do not overlap always glue, so a sense that differs between disjoint contexts is not a gluing failure: a failure needs an overlap carrying sections that disagree, and which families count as covers decides whether anything glues | Dual-filed from MOM-CLM-088 (ADR-037). The sheaf condition says a family of sections that agree on overlaps glues to one global section. Where two contexts do not overlap, agreement is vacuous and they glue. So “tall”, which takes one threshold for people and another for trees, is one global section with the comparison class part of the meaning, not a failure of gluing. A failure needs contexts that overlap and carry sections that disagree there. Which families count as covering is the piece that decides whether anything glues, and a sheaf picture of meaning that does not state it has decided nothing. | Active |
| CLAIM-207 | The transports of Propositions 1–2 and of D_obs act on judgement outcomes, not texts, and for any one source–target pair a constant kernel transports any overlap-consistent target, so they constrain a translation only once one kernel family is fixed across many utterances and derived from the text channel | Found in the record’s audit of the line on 2026-10-10 (formal lens); no turn of the exchange raises it. The manuscript’s kernels K_C map readers’ judgements to readers’ judgements, while a translation is a channel on texts, T(v | u), and TERM-008 records that the two levels are never formally related. For one source and any overlap-consistent target, the constant kernel makes D_obs zero and satisfies naturality. Granted, because it is elementary. It does not say CLAIM-121 or CLAIM-070 is false; it bears on what they are used to support. | Active |
| CLAIM-231 | On observed responses, a rendering that keeps the response distribution of each order of two framings within ε of the source’s, under an outcome correspondence, keeps the observed order effect within 2ε, a bound identified from data, while the intertwining identity bounds it only through defects of an unidentified state model | The record’s repair, on 2026-10-10, after CLAIM-253. The commutator identity of the manuscript’s §9 holds, and its defects are not identified from data, by the objection’s hidden-bit construction. What can be estimated is the response distribution under each order, so the bound is restated on those: a special case of observational distortion with contexts indexed by framing order. Active, because it is elementary and checkable. It does not say the state-model account is wrong, and it does not identify the defects. | Active |
| CLAIM-245 | Under Contextuality-by-Default, a deterministic context-wise recoding can make a noncontextual signalling source maximally contextual, or turn a contextual source into pure signalling, so per-content signalling is not monotone under such maps and the quantity to bound is joint overlap discrepancy | Found in the record’s audit of the line on 2026-10-10 (formal lens); no turn of the exchange raises it. Two worked rank-2 systems answer NOTE-654’s open question negatively: THEORY-177’s per-content signalling can rise under deterministic recodings, once the source signals, and CbD contextuality can be created or removed by them. By data processing, the joint overlap discrepancy cannot rise, so that is the quantity CLAIM-125’s second part should name. Granted, because the examples are elementary. It does not say THEORY-174 is wrong, which is about no-signalling models. | Active |
| CLAIM-249 | Comparing characters across realizations needs one group identified on both, which is fixed only up to automorphism, and automorphisms permute the irreducible characters, so “the same character” is relative to a chosen correspondence: the collapse problem again, at the level of the symmetry group | Found in the record’s audit of the line on 2026-10-10 (formal lens); no turn of the exchange raises it. To say a visual realization has the same character as a spoken one, the same group element must be named on both sides. Changing that identification by an automorphism α turns χ into χ∘α, and for the cyclic group of order 3 the automorphism g ↦ g² swaps the two nontrivial characters. The transformations the line studies form a semigroup, so the group is a symmetry group the analyst chooses, with its action on each medium fixed independently: CLAIM-011’s anchoring once more. Granted, because the argument is elementary. CLAIM-132 and TERM-041 hold neighbouring limits, not this one. | Active |
| CLAIM-251 v2 | A change in which questions a receiver population can answer determinately is not by itself a change of cover in the sheaf sense: the cover belongs to the measurement scenario and the responses are an empirical model on it, so such a change is a change of empirical model, which can create or remove a gluing obstruction on a fixed cover but does not change what the cover is, and the operational notion needs its own name until a functorial link is shown | From the interlocutor’s reading of PR #121 and its reconciliation, relayed by the owner on 2026-10-12, on the open tension between CLAIM-197 with CASE-048 and the operational cover of CLAIM-201. It keeps the empirical notion and denies it the sheaf-theoretic name. Open. | Proposed |
| CLAIM-253 v2 | The intertwining defects are defined on unobservable interpretive-state spaces, so they are not identified from judgement data, and the commutator identity bounds observed order effects only with a further, unstated readout-intertwining defect | Found in the record’s audit of the line on 2026-10-10 (formal lens); no turn of the exchange raises it. The commutator identity is correct, but Φ, A and A′ act on interpretive states. CLAIM-046 says hidden-state models that give identical observations can differ, and a worked case shows two such models with defects 0 and the largest possible, so the defect is not a function of the data. What is observed is responses, and the identity reaches the observed order effect only through a readout defect between outcome spaces, which no draft names. It is distinct from CLAIM-011, which is about collapse: this is about identification. | Active |
| CLAIM-256 | D_obs sums over source contexts only, so a target context outside the image of τ appears in no term: a rendering that adds a relation pays nothing, and a change of cover registers only as loss | Found in the record’s audit of the line on 2026-10-10 (formal lens); no turn of the exchange raises it. L_obs and D_obs are sums over source contexts, so a target context that is not the image of one appears in no term. The line says interpreters add relations (CLAIM-076) and that a transport can add a distinction (CLAIM-087), and D_obs is the one component with a formula (CLAIM-128). Granted, because it is read off the definition. It does not say no other component could catch an addition, or that additions are distortions. | Active |
| CLAIM-257 v3 | Observational distortion should be summed over the contexts both covers can host, with the target’s new questions asked of the source too, and the questions only one side can decide reported as a separate change of cover, so that a rendering that adds a relation pays for it | The record’s repair, on 2026-10-10, after CLAIM-256. D_obs sums over source contexts only, so a target context outside the image of τ is free. Asking the target’s new question of the source, where its readers can answer it, puts it in both covers, and an addition then costs. Questions only one side can decide are a change of cover, which CLAIM-201 makes the line’s headline; they are reported, not summed. A proposal: the restatement is a definition, and whether its added term predicts anything is the defeat condition. It does not say additions are distortions. | Active |
| CLAIM-260 | Approximate transports compose into a category only if the distortion obeys a triangle inequality and later kernels are nonexpansive, so the semigroup claim’s “category or semigroup” holds for exact kernels, and for approximate ones only under those conditions | Found in the record’s audit of the line on 2026-10-10 (formal lens); no turn of the exchange raises it. TERM-008’s founding sense is a transport that gets “within some eps”, and CLAIM-106 makes fidelity graded. Kernels always compose, but the composite of an ε₁-transport and an ε₂-transport is an (ε₁ + ε₂)-transport only if the distortion obeys a triangle inequality and the second kernel is nonexpansive. In total variation both hold. QUESTION-017 holds the triangle inequality open and does not tie it to the category claim. Granted, because it is elementary. It does not say the category claim fails for exact transports or in total variation. | Active |
| CLAIM-264 v2 | Two objects can agree on every probe in a restricted family without being isomorphic, so equivalence under a probe family is coarser than identity unless the family is rich enough | The general content of CLAIM-142, filed alone under ADR-040 so that it does not rest on CLAIM-046 and CLAIM-011, which are about pragmatic identity. The restricted Yoneda functor is fully faithful exactly when the probe family is dense. A strong generator makes it conservative, which is weaker: a morphism the probes see as invertible is invertible, but objects with isomorphic profiles need not be isomorphic. Matching every probe’s marginal leaves the joint unconstrained. The evidential rule is CLAIM-322’s. | Active |
| CLAIM-265 v3 | Local descriptions that disagree are not thereby incompatible: whether they obstruct a joint description is decided only relative to a specified class of admissible correspondences between their observations, and a correspondence admitted only because it removes the disagreement decides nothing | The general content of CLAIM-143, filed alone under ADR-040 so that the order of tests does not rest on CLAIM-011, CLAIM-004 and CLAIM-035, which are about translation. Disagreement between local descriptions sorts into a coordinate difference, a structural transformation or a global obstruction, and the sort cannot be made until a class of admissible transition maps is given. Inertial frames (CASE-039) show disagreement with no obstruction once the maps are known. | Active |
| CLAIM-267 v3 | Per-step discrepancies between a chain of maps and a reference chain compound through the sensitivity of the later steps, so the same local error can be damped, accumulated or amplified, and closeness at every step can coexist with large end-to-end divergence | The general content of CLAIM-056, filed alone under ADR-040 so that the line-neutral recursion does not rest on CLAIM-106’s account of fidelity. It is elementary: with e_(i+1) ≤ L_i e_i + ε_i, the end-to-end error is bounded by the discrepancies weighted by the later Lipschitz constants. Three regimes follow. For stochastic kernels in total variation, contraction coefficients do not exceed one, so amplification needs another metric or a nonlinear, adaptive state. | Active |
| CLAIM-269 v5 | A regularized linear readout can tell apart only representations that differ in normalized kernel, and kernels fix a representation only up to the symmetry of what is observed, so no such readout supplies a distinction beyond that symmetry | The general content of CLAIM-193, filed alone under ADR-040 so that the linear result does not rest on CLAIM-142, whose realist reading is about communicative identity. What a regularized linear readout decodes is a function of the normalized kernel (THEORY-008). Kernels fix a representation only up to the symmetry of what is observed (THEORY-004, THEORY-723). An inner product beyond that is a stipulation (THEORY-018). And spectral degeneracy does not identify the symmetry (THEORY-019). These are proved results for learned representations. | Active |
| CLAIM-289 | Non-stochastic strings stay non-stochastic under total recursive models: their minimal randomness deficiency agrees with the finite-set one to within O(log n) in argument and value | The step that THEORY-260’s promotion (version 2) names as the record’s own: carrying LIT-239’s non-stochastic strings, proved for finite-set models, to total recursive function models through Propositions B.1(b) and B.2(b) with Remark B.3. Remark B.3 asserts wholesale that every result of the paper extends to total functions up to a logarithmic term. This writes the extension out for this one result. It holds at O(log n) precision only, and does not reach LIT-229’s sophistication, which is defined at constant precision. | Active |
| CLAIM-290 | A positive-definite kernel’s minimal realizations are unique up to a unitary, and two finite representation matrices with the same centred Gram matrix differ by a translation and an orthogonal map | The record’s own proofs of two steps that THEORY-004 rests on and that its sources state without proof. (a) Jorgensen & Tian’s Cor. 1.35: minimal realizations of a positive-definite kernel are unique up to a unitary. The book leaves this “as an exercise”, and NOTE-829 supplied the book’s own proof of Thm 4.35, transferred. (b) The finite case that LIT-250 §5.3 states as known: XXᵀ = YYᵀ implies Y = XQ with Q orthogonal, with no assumption that the rows span R^d. With centring this becomes a translation and an orthogonal map. It does not say Q is unique, which fails when the rank is below d. | Active |
| CLAIM-291 | The adjoint of a square-integrable integral operator is the integral operator with the conjugate-transposed kernel | The record’s own step, written down in THEORY-009 and marked there as not the Riesz article’s, which covers matrices and bounded operators only. For a kernel k in L²(μ⊗ν), the operator (Tf)(x) = ∫ k(x,y) f(y) dν(y) from L²(ν) to L²(μ) has adjoint (T*g)(y) = ∫ k̄(x,y) g(x) dμ(x), by Cauchy–Schwarz and Fubini. So T is self-adjoint, when μ = ν, exactly when k(x,y) = k̄(y,x) almost everywhere. It does not say where the symmetry of k comes from, which is THEORY-009’s question, and it is not claimed for kernels that are not square-integrable. | Active |
| CLAIM-302 | Equivalence under feasible tests can be much coarser than statistical equivalence: there are ensembles almost disjoint from uniform that no polynomial-size test tells apart from it, and efficiently samplable ensembles of this kind exist if pseudorandom generators do | A15’s witness for “Complexity changes what we mean by an observable”, which the owner asked to have developed at U15, corrected by the reading of Goldreich (NOTE of 2026-10-15). CLAIM-264 says agreement on a restricted probe family is coarser than identity; feasibility gives a restriction that is forced, not chosen. The separation itself is unconditional: a counting argument gives ensembles supported on at most 2^(n/2) strings that no circuit of size 2^(n/8) tells from uniform. Only an efficiently samplable witness needs an assumption, and a secure pseudorandom generator supplies one. All of it is asymptotic, about ensembles indexed by n. | Active |
| CLAIM-304 | A rendering can keep a distinction recoverable in principle and make it infeasible to recover: if pseudorandom generators exist, a uniformly random bit can be encoded so that an unbounded receiver recovers it except with probability at most 2⁻⁽ⁿ⁺¹⁾, while no efficient receiver does non-negligibly better than chance | A14’s first failure mode, computational inaccessibility, and A18’s fourth candidate: “Recoverable in principle ≠ recoverable within budget.” CLAIM-199 shows a garbling can help a bounded receiver. This is the other direction: a nearly lossless rendering can defeat every efficient one. The construction is the record’s, from CLAIM-302’s witness; A18 asked for one and warned against “a vague appeal to an inverse being hard”. | Active |
| CLAIM-318 | Within a shared observational scenario, exact structure-preserving symmetries are the invertible members of a nested family of stochastic transports, and among Markov kernels between finite sets the invertible ones are the permutation matrices, so the invertible core is the relabellings, a groupoid in which objects joined by an arrow have isomorphic automorphism groups | Split from CLAIM-103 under ADR-043: the nesting and its invertible core, stated on their own so that their warrant can be. A110 §25 nests exact symmetries inside structure-compatible transports inside stochastic communicative transports, within a shared scenario, and the exact symmetries are the invertible ones. For Markov kernels between finite sets, a stochastic matrix with a stochastic inverse is a permutation matrix, because a nonnegative matrix with a nonnegative inverse is monomial, so the invertible core is the relabellings. In that groupoid an invertible u : A → B gives Aut(A) ≅ Aut(B), which corrects A198 §8. It does not say what symmetries are for: that they supply the yardstick for non-symmetric transports is CLAIM-103’s, and interpretive. | Active |
| CLAIM-319 | Over a scenario of n contexts in an odd cycle, changing the support of one context takes the contextual fraction from 1 to 0 while the other n − 1 contexts and every marginal are kept exactly, at a weighted observational distortion of 1/n, so within a scenario the fraction’s Lipschitz constant against that distortion is at least n; and any change of global extension needs a contextual model on one side | Split from CLAIM-201 under ADR-043: the derivation that claim called “decisive and checkable”, stated on its own. For odd n, an n-cycle of ±1 observables in which every context anticorrelates is strongly contextual; making one context correlate gives a model with a global distribution. The two agree on n − 1 contexts and on every marginal, differ by total variation 1 in the last, and so lie at weighted D_obs = 1/n with contextual fractions 1 and 0. For n = 3 it is CASE-037 with one observable relabelled. It answers how small the local change can be; it says nothing about whether any data are contextual. | Active |
| CLAIM-320 | Within one fixed measurement scenario, two no-signalling empirical models can agree on all but one of their contexts and on every single-observable marginal while their contextual fractions are 1 and 0, so keeping most local judgement distributions does not fix their global compatibility | Split from CLAIM-105 under ADR-043: the possibility that claim’s headline needs, shown by the pair it lost and recovered in CASE-037. On the cover {AB, BC, AC} with binary outcomes, the parity triangle at 1/2 per allowed outcome is no-signalling and strongly contextual, with contextual fraction 1. Change only S_AC to {(0,0), (1,1)}: two contexts and every marginal are unchanged, and the model now extends to a global distribution, with fraction 0. It is an existence result by construction, and the weights are stipulated. It does not say reconstruction chains do this, which is CLAIM-105’s thesis and interpretive, and the context that changes moves by a total-variation distance of 1. | Active |
| CLAIM-345 | Equal controllability rank does not fix the cost of control: for x_{t+1} = x_t + b·u the least quadratic effort for a displacement Δ is Δ²/b², unbounded as b → 0 while the system stays controllable, and in general the least effort is Δxᵀ W_T^† Δx, set by the Gramian and not by its rank | A9 §2 and A12’s Proposition 1 of the exchange of 2026-10-17, the step the owner’s U9 “controllability of a system isn’t binary” needs. For a scalar step x_{t+1} = x_t + b·u the cheapest input costs Δ²/b², so two systems that are both controllable can differ in cost by any factor. The general statement is the minimum-energy formula with the controllability Gramian. A9: “This is already a standard result from linear control theory.” Proved here because the record holds no source for it. The sharp edge: the cost is relative to a fixed input norm, and rescaling the input makes every b cost the same, so comparing costs across systems needs inputs in common units. | Active |
| CLAIM-346 | Feasibility, aggregation and epistemic coordination are independent obstructions to an organization’s realizing its demands: each can occur with the other two absent | Owner-seeded, U36 of the exchange of 2026-10-17: Arrow’s theorem, then cryptography and “the two generals problem”. A36 placed them: “Arrow’s theorem belongs in the theory of endorsement, not directly in the geometry of feasible updates”, and the two generals add “epistemic frustration”. Three elementary constructions, each with one obstruction and not the others, are given in the body. The sharp edge: the independence is relative to fixing the demands as the constituents’ own acceptance conditions; that no remedy for one removes another is A36’s further reading, argued in the body and not part of the claim. | Active |
| CLAIM-347 v3 | 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 | The owner’s correction, U37 of the exchange of 2026-10-17: “We can do quite a lot with access to an ordering, even if it doesn’t give us a true measure.” A37 granted it (“I agree with your correction”) and built the acceptance sets, their intersection and the compatibility complex. Corrected here: acceptance conditions sit on attainable outcomes, a demand’s form depends on whether it demands improvement or maintenance, and A37’s weak-preference sets fail only as representations of improvement demands. The definitional facts are shown in the body, including that every pair of demands can be jointly improvable while the triple is not. The sharp edge: relief compares complexes for the same declared demands, so a reorganization that deletes a demand is not compared at all, and two reorganizations can be incomparable. It is the move CLAIM-128 and TERM-043 made for translation, in a new line. | Active |
| CLAIM-350 v2 | A coarse-graining preserves a deterministic judgment exactly when the judgment is constant on its fibres: the judgment then factors through the coarse description, uniquely on its image, and otherwise two states the judgment tells apart have been merged | A21 §3 and §18 (Candidate 1) of the exchange of 2026-10-17, and A22’s Construction A: for a judgment J and a coarse-graining C on the same states, J = j∘C for some j exactly when C(x₁) = C(x₂) implies J(x₁) = J(x₂). Granted, because it is elementary (the universal property of a quotient) and Ak’s; the proof is in the body. It is CLAIM-152’s judgment-valued special case with the converse added: CLAIM-152 says a partition sufficient for one target need not be for another, and this says which partitions serve a deterministic judgment, those whose fibres lie inside its level sets, so the coarsest is the judgment’s own partition. The sharp edge: it says when a description keeps a judgment, never whether the judgment is right. A21’s probabilistic and causal versions are recorded in the body, not claimed. | Active |
| CLAIM-365 v2 | 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 | A34 §4 and A35 §3 of the exchange of 2026-10-17, checked. The residual is the smallest worst-case shortfall of the declared local improvements ε_i over updates of size at most r. Minimax for the bilinear problem on two compact convex sets gives the dual over the simplex, so Φ_r > 0 exactly when some λ certifies that no update meets all demands (A34’s form). Governance regret Γ is the gap between an actual admissible update’s shortfall and Φ_r, and is never negative. For L₁ = (θ − 1)², L₂ = (θ + 1)² at θ = 0, Φ_r = ε for every r. The sharp edge: per A37 it is a cardinal refinement of the ordinal fact (CLAIM-347), and its magnitude depends on units (A36 §2D). | Active |
| CLAIM-366 v3 | Whether several objectives share a strict first-order descent direction, 0 ∉ conv{g_i}, is invariant under smooth invertible reparameterization, while the sign of a Euclidean gradient inner product is not, and a negative inner product does not exclude common descent; a budgeted version is invariant only with the metric pulled back | A35 §2 of the exchange of 2026-10-17, at the owner’s U35 “double click” on whether functionally equivalent parameterizations give equivalent frustration diagnoses. Gradients transform as g′ = Jᵀg and directions as v′ = J⁻¹v, so directional derivatives, and with them the common-descent test 0 ∉ conv{g_i}, do not depend on coordinates. A Euclidean inner product does: g₁ = (1, 1), g₂ = (1, −½) have product ½, and under θ = diag(½, 2)ψ their transforms have −7/4, while d = (−1, 0) lowers both throughout. The sharp edge: it covers coordinate changes of one parameter space at first order, not function-preserving symmetries or training trajectories (QUESTION-127). The practice corollary, not to diagnose task conflict by gradient cosine, is the anthology’s. | Active |
| CLAIM-369 | In symmetric resource-mediated competition with interaction matrix A = UᵀU and growth rates r = Uᵀb − c, Lotka–Volterra population dynamics are multiplicative gradient flow on the convex feature-selection objective ½‖b − Un‖² + cᵀn over the nonnegative orthant: the invasion fitness of an absent component is the negative partial derivative of that objective, and the uninvadable equilibria are its KKT points | From a synthesis the owner relayed on 2026-10-18 (workbench entry of that date), checked here and given a proof. When competition between components is mediated by shared resources with feature or niche vectors u_i, so that A = UᵀU and r = Uᵀb − c, the Lotka–Volterra dynamics are ṅ_i = −n_i ∂_i L with L(n) = ½‖b − Un‖² + cᵀn: entropic mirror descent on the positive orthant. A rare component’s invasion fitness is −∂_i L, the value of adding that feature, and uninvadable equilibria are the KKT points of the convex program. The sharp edge: the identity needs a shared scalar objective, and it fails for asymmetric interactions or processes with competing objectives, which is where an organization stops being an optimizer. Mehta et al. (2019) and Marsland, Cui and Mehta (2020) give the general duality for consumer–resource models. | Active |
| CLAIM-370 | For a symmetric positive-pair distribution with marginal p, the conditional-expectation operator on L²(p) has the density ratio K⁺ as its kernel, and it is Hilbert–Schmidt exactly when the χ²-divergence of the pair from the product of its marginals is finite, in which case it is compact and self-adjoint with an orthonormal eigenbasis | THEORY-005’s derivation, stated as the record’s own and with its proof. Johnson et al. (LIT-258) write the operator on a finite space without an integrability condition. HaoChen et al. (LIT-249) reach the Hilbert– Schmidt property from a uniform bound, which is stronger. Here the condition is exact: Hilbert–Schmidt if and only if finite χ². It says nothing about what trained features span. | Active |
| CLAIM-371 | Under the componentwise order on distortion profiles, two profiles are incomparable exactly when they trade off, and then positive weightings can rank them either way, while every positive weighting agrees with a dominance | The order-theoretic part of CLAIM-128, on its own so that it can carry its own warrant. It says nothing about translation, what the components measure, or which weighting a task fixes. Only that, under the componentwise order of TERM-043, a trade-off is incomparability, that a trade-off can be resolved either way by positive weights, and that a dominance cannot. | Active |
| CLAIM-372 | Within a fixed measurement scenario, the contextual fraction is a piecewise-linear and Lipschitz-continuous function of the empirical model’s probability table, with a constant that depends only on the scenario | The record’s own derivation, from the linear programme of Abramsky, Barbosa and Mansfield (LIT-265, Eq. 3), which THEORY-165 holds. The non-contextual fraction is the minimum of the dual objective over finitely many vertices, so it is concave and piecewise linear in the probability table, and the contextual fraction is Lipschitz in it. The constant is the largest ℓ₁ norm of a dual vertex, which depends only on the scenario and is not bounded here. Nothing here crosses scenarios or applies to signalling data. | Active |
| CLAIM-373 | If a map approximately intertwines two operators, with defects E_A = ΦA − A′Φ and E_B = ΦB − B′Φ, then Φ[A,B] − [A′,B′]Φ = A′E_B + E_A B − B′E_A − E_B A, so the commutator is carried to within (‖A‖ + ‖A′‖)‖E_B‖ + (‖B‖ + ‖B′‖)‖E_A‖ | The commutator-distortion identity of the manuscript’s §9, on its own and proved. A map that nearly intertwines each of two operations carries their commutator to the commutator of the images, up to an error that is linear in the two intertwining defects. ARG-006 is the exact case. It says nothing about whether the defects can be identified from data (CLAIM-253), or what bounds an observed order effect (CLAIM-231). | Active |
| CLAIM-374 | On a consistently connected system, Contextuality-by-Default and the sheaf criterion agree: a maximally connected coupling exists exactly when a global law has the contexts’ laws as its marginals | The record’s derivation of what NOTE-600 marks as its own inference. In a consistently connected system, every observable has one distribution in all the contexts that contain it. Then each connection’s maximal coupling makes its copies equal with probability 1 (LIT-777, Theorem 3.3), so a maximally connected coupling is a joint law of one variable per observable, which is a global section in Abramsky and Brandenburger’s sense (LIT-016, THEORY-012). Conversely, a global section gives such a coupling. The two criteria come apart only when marginals shift with context. | Active |
| CLAIM-375 | Under one-hop allocation within an epoch, an operator that endorses an ally whose policy is nearer its own than the collective decision is raises how far its preferred policy is realized while its own authority stays fixed, so the two conditions of the endorsement scheme hold together | The demonstrated core of CLAIM-285. Under A3’s one-hop rule I_j = I_j⁰ + Σ_(k≠j) b_k E_kj, with budgets and baselines fixed within an epoch (CLAIM-282), an operator’s authority does not respond to its own endorsements. If the collective decision is the authority-weighted mean of the operators’ policies, then endorsing an ally whose policy is nearer one’s own than the decision is moves the decision strictly toward one’s policy. So the reward for realized policy, and not for held authority, pays for delegating. It does not say operators behave so, or that any rule beyond one hop keeps both conditions. | Active |
| CLAIM-376 | A linear system that is stable at every instant can have a positive Lyapunov exponent: shifting any operator with exponent λ > 0 by −δI lowers its exponent by exactly δ and makes every instantaneous operator stable, so for 0 < δ < λ the shifted system is stable at every instant and unstable | The case THEORY-724’s source asserts and does not show. If A(t) has first Lyapunov exponent λ > 0, the propagator of A(t) − δI is e^(−δt)Φ(t), so its exponent is exactly λ − δ, while every eigenvalue of every A(t) moves left by δ. Applied to the undamped oscillator switching ω between 0.5 and 3 every unit of time: λ = 0.1955, and with δ = 0.1 the system is stable at every instant, with eigenvalues −0.1 ± 3i and −0.1 ± 0.5i, and has exponent 0.0955. | Active |
| CLAIM-377 | For any differentiable model under squared loss with Gaussian noise of precision β, the model’s Fisher on n inputs is the Gauss–Newton matrix βJᵀJ, and its non-zero eigenvalues are exactly β times those of the empirical NTK Gram matrix JJᵀ, with the same multiplicities, its eigenvectors being Jᵀ applied to the Gram matrix’s, normalized | THEORY-084’s Step 1, stated as the record’s own and proved. Through the SVD J = UΣVᵀ, JᵀJ and JJᵀ share the non-zero eigenvalues σ_i² with equal multiplicities, and Jᵀu/σ is the eigenvector of JᵀJ for a unit eigenvector u of JJᵀ. Under y | x ~ N(f(x; θ), β⁻¹), the expected outer product of the score is β∇f∇fᵀ, which summed over inputs is βJᵀJ, the Gauss–Newton matrix. “Fisher” means the model’s Fisher, not the empirical Fisher of observed residuals. It holds at every width, in every regime and on any data. It says nothing about what the spectrum looks like, which is THEORY-084’s. | Active |
| CLAIM-378 | A representational similarity index invariant to every invertible linear map depends on a representation only through its column space, so it takes one value on all column-centred representations of rank n − 1, as it does on all representations of rank n | The generalization of THEORY-236’s theorem. If col(X) = col(Y), write X = BC and Y = BD with B a basis of the common column space and C, D of full row rank, extend C and D to invertible matrices, and the quotient maps X onto Y. Since XA always has the column space of X, the GL(p) orbits are exactly the sets of n × p matrices sharing a column space. Theorem 1 is the case of column space ℝⁿ. Column-centred matrices of rank n − 1 all have column space 1^⊥, so an invariant index cannot tell them apart either. | Active |
| CLAIM-379 | On a finite set of stimuli, regularized linear readouts with ridge b > 0 cannot tell apart two centred representations of the same width exactly when one is an orthogonal transformation of the other, and the unregularized CCA member cannot tell apart representations with the same column space, which differ by an invertible linear map | The proved core of CLAIM-269. What a regularized linear readout decodes is a function of K_X = X G⁻¹ Xᵀ/M, with G = aC_X + bI (THEORY-008). For b > 0, K_X and the Gram matrix XXᵀ determine each other, by a monotone map on the shared eigenvalues; and equal Gram matrices mean an orthogonal transformation (CLAIM-290, THEORY-004). For b = 0, K_X is the projection onto the column space, which fixes X only up to an invertible linear map, as for a softmax layer (THEORY-723). | Active |
| CLAIM-382 | In an autoencoder initialised with i.i.d. Gaussian weights and zero biases and trained by SGD or momentum SGD on a loss of its output, the law of each hidden layer’s learned representation is invariant under every orthogonal map of that layer that commutes with its activation, so under a radial activation no basis is privileged in law, while elementwise tanh or Leaky-ReLU yields invariance only under the signed permutations or the permutations, which leaves the standard axes free to be privileged | THEORY-288’s symmetry argument, stated as the record’s own and proved. Transform the parameters by orthogonal maps Q_l of the hidden spaces that commute with the activation. The network then computes Q_l h_l and the same output, so the loss is invariant. Gradient steps commute with the transformation, and an i.i.d. Gaussian initialisation is invariant under it, so the law of the trained representations is too. For radial activations this is all of O(n), and no basis is privileged in law. For elementwise ones it is a finite group, so the axes may be privileged. Whether they are, and how strongly, is THEORY-288’s empirical content. The argument needs an orthogonally equivariant optimiser, and fails for Adam. | Active |
| CLAIM-383 | In plane Couette and plane Poiseuille flow, measured in the energy norm, the linearized operator about the laminar profile has transient growth at least cR and resolvent norm at least cR² with c independent of R, so wherever it is eigenvalue-stable a perturbation of norm at most CR⁻² makes it eigenvalue-unstable | THEORY-304’s scalings as lower bounds, derived. At streamwise wavenumber zero, the cross-stream velocities obey an R-independent Stokes problem in the time t/R. They force the streamwise velocity through −U′v, so the streamwise response is R times an R-independent field. In the energy norm this gives transient growth at least cR, and in the steady forced problem a resolvent norm at least cR². Through pseudospectra, a perturbation of norm O(R⁻²) then moves an eigenvalue into the unstable half-plane wherever the flow is eigenvalue-stable. The sharp constants, and that the growth is no more than order R, come from the computation and are not here. | Active |
| CLAIM-384 | For a network linearised at its initial parameters, with an isotropic Gaussian prior of precision α on the parameter displacement and Gaussian noise of precision β, the log-determinant part of the evidence is −½ Σ log(1 + βλ/α) over the non-zero eigenvalues λ of the empirical neural tangent kernel’s Gram matrix on the training inputs, so at most n directions are priced however many parameters the network has | Active | |
| CLAIM-385 v2 | If a symmetric operator on ℝⁿ commutes with an orthogonal representation of a compact group, each eigenspace is a sum of real irreducibles and each multiplicity a sum of multiples of their dimensions, so SO(2) and ℤ/n for n ≥ 3 force paired eigenvalues; conversely the spectrum fixes neither the group nor a basis inside an eigenspace | Active | |
| CLAIM-386 | For x(t+1) = (A* + εC)x with A* block-diagonal, the Simon–Ando aggregate  = QAV has one-step closure defect exactly QA − ÂQ = QA(I − VQ); the part from the blocks’ own dynamics vanishes iff every block has equal column sums, and then the whole defect is ε·QC(I − VQ) | Derived in the reading of Shpak, Stadler, Wagner and Altenberg (2004), NOTE-977, which states the Simon–Ando aggregate without an error term, and re-checked here. It splits the closure defect of block aggregates into a part from coupling between blocks, which is exactly first order in ε, and a part from the blocks’ own dynamics, which vanishes exactly in the equitable case of THEORY-755. Deterministic dynamics, one step; the post-transient orders reported below are numerical, not part of the claim. | Active |
| CLAIM-388 v3 | Exact dynamical closure of a collective variable does not require a nearly decomposable block: in a linear Gaussian VAR(1) with uniform coupling among n units, the sum of all units is exactly dynamically independent at every stable coupling strength, while every partition of the units into two or more groups couples as strongly across its edges as within them | From A5 of the exchange of 2026-10-19 on coarse-to-fine processes, which gave the two-unit continuous-time case (ż = (b − a)z for z = x₁ + x₂) and the boxed slogan “Exact aggregation ⇏ near-decomposability”. Made exact here for n units with THEORY-733’s sufficiency condition, and checked numerically. It answers the converse half of QUESTION-221. It does not say the closed sum is one system (QUESTION-218), and it is about partitions of the units: in the eigenbasis of A the same system is exactly decomposable, which is the point. | Active |
| CLAIM-389 v2 | In a stable linear Gaussian VAR(1), exact dynamical independence of a linear coarse-graining implies that its Mori–Zwanzig memory vanishes, but not conversely: memory needs coupling out of the coarse variable and back, and dependence needs only the way back, so a coarse variable can be Markov in its own law with zero memory and still be dynamically dependent | Derived in the reading of Chorin, Hald and Kupferman (2000), NOTE-989, and re-checked here. It settles, for the linear Gaussian VAR(1) class, the relation QUESTION-222 left open between memory in the reduced dynamics and THEORY-257’s dynamical independence: memory is the round trip Y → rest → Y, dependence the inward leg alone. Not about VAR(p ≥ 2), where the reading reports that an independent variable can carry memory, nor about nonlinear systems. | Active |
| CLAIM-390 | For a block of coordinates in a stable linear Gaussian VAR(1), dynamical dependence is at most ½ log det(I + Σ_YY⁻¹ A_YR C A_YRᵀ), with A_YR the coupling into the block and C the covariance of the rest given the block’s present state, so it is of second order in the coupling into the block, whatever the coupling out of it | First found in the reading of Chorin, Hald and Kupferman (2000), NOTE-989, as a by-product; derived and checked here. It answers the forward half of QUESTION-221 for a block’s full state: weak coupling into a block makes its dynamical dependence small, to second order. It is about the block’s full state, not its aggregate. For the aggregate, the block’s own internal dynamics add a defect of their own (CLAIM-386). | Active |
| CLAIM-391 | For any classes with weights π_c and per-class factor matrices H_c and Δ_c, the class-wise Kronecker product Σ_c π_c H_c ⊗ Δ_c exceeds the product of the weighted averages H̄ ⊗ Δ̄ by exactly the weighted between-class covariance Σ_c π_c (H_c − H̄) ⊗ (Δ_c − Δ̄), so the two agree when either factor is the same in every class | Active | |
| CLAIM-394 | In a stationary linear Gaussian VAR(1) that is time-reversible (AΠ = ΠAᵀ, Π the stationary covariance), every slow-feature direction is a left eigenvector of A, so any span of slow features is an exactly dynamically independent coarse-graining; off reversibility a slow feature is in general neither independent nor free of memory | Derived in the reading of Schüler and Wiskott (2025), NOTE-1015, and re-checked here. It says when slowness, the criterion of slow feature analysis (THEORY-746), picks out a closed coarse-graining in THEORY-733’s sense: always in the reversible linear Gaussian VAR(1), which is the class of noise-free square mixtures of independent AR(1) processes, and not in general otherwise. Linear features, linear Gaussian dynamics, lag one. | Active |
| CLAIM-395 | Under Montévil and Mossio’s definition of closure, a closed set of constraints has at least two members, and if each constraint is produced at the time scale of a constraint in the set that generates it and not at the scale at which it is itself conserved, the set includes at least one slow and one fast dependence, so a system with a single constraint of its own cannot realise closure | Active | |
| CLAIM-397 v2 | For a scalar stationary process with autocovariance C, the Mori–Zwanzig memory kernels for the projection onto the current value are fixed by C alone, through C(m+1) = Σ_{k≤m} c_k C(m−k); the memory vanishes iff C is geometric, and when C has finite Hankel rank d the memory has Hankel rank exactly d − 1 | Derived in the reading of Lin and Lu (2019), NOTE-1029, and re-checked here. It settles the minimal-order question CLAIM-398 left open, for every scalar stationary process with rational autocovariance, and gives the structural reason for CLAIM-389’s “not conversely”: the memory is a functional of the coarse variable’s own law, so it cannot register dependence on the rest of the system. | Active |
| CLAIM-398 | In a stable linear Gaussian VAR(1) on ℝⁿ, a scalar linear coarse variable Y = LX is, in its own law, an ARMA process of orders at most (n, n − 1); so its Mori–Zwanzig memory, though non-zero at every lag in general, is carried exactly by finitely many coordinates that are functions of Y’s own past and innovations | Derived in the reading of Chorin and Lu (2015), NOTE-1028, and re-checked here. Their NARMAX closures are fitted, with no error bound; in the linear Gaussian class the same idea is exact. A coarse variable with memory admits a finite Markovian augmentation built only from its own history, which is the augmentation THEORY-257’s criterion conditions on. Scalar Y, VAR(1), Gaussian noise. | Active |
| CLAIM-409 v2 | For one state law, one intervention distribution and one outcome, a deficiency of sufficiency cannot increase under refinement: if T₁ = g∘T₂ then Γ(T₂) ≤ Γ(T₁); informational closure, by contrast, is monotone in neither direction, since in the three-bit chain of Rosas et al. (2024) A is closed, its refinement (A, B) is not and the full state refining that is closed again, while A⊕B, a coarsening of (A, B), is not closed either; closure fails to be monotone because refining a description changes the future it must predict as well as the evidence, so Blackwell dominance, which every deterministic refinement has over its coarsening, does not order closure | Two readers’ drafts of one point, from A6, A7, A16 and A17 of the exchange of 2026-10-20. A16 §5 and A17’s Proposition 2: a fixed-target deficiency is refinement-monotone; “Adding information cannot hurt exact sufficiency for an unchanged question, but changing what the description is expected to explain can expose new dependencies.” A6 §6 and A7’s Proposition 3: “Increasing the information retained by a representation can destroy a desirable dynamical property”, and “There is no general data-processing inequality ordering these quantities, because both the predicted variable and the conditioning information change.” This claim joins them, and corrects A7’s slogan “When More Information Reveals Less Autonomy”: closure is not reversed by refinement, it is unordered by it. Checked exactly on 2026-10-21. | Active |
| CLAIM-414 v4 | Matched ordinary trajectories can conceal differences in an interpretation’s efficacy, in the allocation of that efficacy, and in the maintenance of its enabling constraints: in two finite constructions, systems that agree under ordinary operation differ in each, and a specified intervention exposes the difference that passive observation of the matched trajectories does not | A10 of the exchange on experience and interpretation, re-run here. Three one-bit systems behave alike when the interpretation is 0. Under an intervention that sets it to 1, the first never acts on it, the second acts at once, and the third acts one step late, because its own interpretation opens the gate. Two two-constraint systems have the same trajectory, (1,1) throughout. A single perturbation runs one into (0,0) and leaves the other restored to (1,1): one maintains its constraints by CLAIM-395’s minimal slow–fast closure, the other is reset from outside. These are CLAIM-407’s lesson about governance and CLAIM-194’s about boundaries, applied to interpretation. | Active |
| CLAIM-434 | On a finite set of outcomes, some function rises with every move that wins one of a negotiation’s conflicts exactly when no chain of winning moves returns to where it began, and the length of the longest such chain ending at an outcome is one such function; a perfectly transitive record of which side won each pair, in a complete tournament contesting every pair once, leaves a cyclic share of (n − 2)/3n under the Hodge decomposition, a baseline that does not carry to sparse records; the Hodge gradient can reverse a comparison the wins settle, netting a record erases alternation, a record fixes a class of potentials rather than one, a coherent record is not yet one aligned with any single perspective’s ordering, a best-fitting ordering of a cycle is no Lyapunov function, the sign a class of potentials gives can be set-valued, and an ordering fitted to a record overstates its agreement there | The formal core of the rename of 2026-10-23 from “ascendancy” to “potential” (TERM-076). Part 1 is the finite case of Monderer and Shapley’s equivalence between the finite improvement property and a generalized ordinal potential, proved here because the record has not read their paper (LIT-1462). Part 2 is a calibration of the Hodge decomposition (Candogan et al.; Jiang et al.) for binary conflict records, computed here: even a perfect ranking leaves a cyclic residual. Part 3 separates coherence from alignment. Parts 9 to 11 were added after a second review. Parts 4 to 8 were added when a review of the pull request found that the measures built on parts 2 and 3 confused ordinal and cardinal structure; each is checked in scratch/formal/valence.py. | Active |
| CLAIM-436 v4 | An instantaneous ordering is a common currency on a finite set of options, where every complete preorder has a real-valued representation, but not in general: the lexicographic order on the unit square has no real-valued representation, while a continuous complete preorder on a connected separable space has a continuous one; so admitting an ordering is strictly weaker than admitting a currency, a graded lexicographic override lies in the gap while an exact threshold override does not, a threshold override with a discrimination threshold is a lexicographic semiorder whose choices can cycle and so is no ordering at all, and even where each instant has a currency, successive currencies need not share exchange rates | The formal half of the owner’s reframing of 2026-10-23, that a “common currency” is better read as a negotiation admitting an (at least instantaneous) ordering. On finite option sets the two coincide at each instant. On a continuum they do not: a graded lexicographic order, one form ALARM’s “100% weight” override could take, admits no numerical representation, while a continuous ordering, the form of Veit’s proportional trade-offs, admits a continuous one (Eilenberg; Debreu). A threshold override admits a discontinuous one, and one with a discrimination threshold, a lexicographic semiorder, can cycle and admits no ordering at all (Luce; Tversky). Across instants, representations need not be related, so a sequence of currencies need not be one currency. | Active |
| CLAIM-480 v2 | Composing interactions can turn an interior into a constraint, and sometimes into a constraint of a new kind: in the chain E = ½k₁(x₁ − x₂)² + ½k₂(x₂ − x₃)², with x₂ internal and equilibrated, the boundary sees E_eff = ½·k₁k₂/(k₁ + k₂)·(x₁ − x₃)², a coupling between x₁ and x₃ that neither part has; if the interior relaxes slowly, eliminating it leaves a history-dependent constraint, a memory kernel, so interconnection fixes an effective constraint on the boundary’s trajectories and separation of time scales decides only whether that constraint is approximately memoryless; and for cellular sheaves the reduced constraint can relate three boundary values where every relation among the parts is pairwise | From A22 §4 and A23 §IV of the exchange of 2026-10-27, which called composition “the most important missing mechanism” after the owner’s U20. Eliminating an equilibrated interior leaves an effective boundary relation that no part has; an outside system interacting only with the boundary meets it as a constraint, and “The interior has effectively become apparatus.” Baez and Fong’s black-boxing functor is the general theorem for passive linear networks. The memory case ties it to Mori–Zwanzig and to CLAIM-478: interconnection yields an effective constraint on the boundary’s trajectories in every case, and separation of time scales decides only whether it is approximately memoryless. For cellular sheaves the reduction can need a richer relational vocabulary than the parts used (THEORY-1090; QUESTION-283). It is independent evidence for CLAIM-477, that constraints are realized by organization. | Active |
| CLAIM-481 | Coupling does not by itself separate time scales: two identical undamped oscillators coupled with stiffness k have normal modes at ω₀ and √(ω₀² + 2k), nearly equal when k ≪ ω₀², and neither decays; separation comes where the coupling dissipates relative differences faster than collective ones, as in ẋ = −ax − k(x − y), ẏ = −ay − k(y − x), whose collective and relative modes relax at rates a and a + 2k, and in a Laplacian flow ẋ = −κLx, where the spectrum of L sets the rates | The answer A20, A21 and A23 gave to the owner’s conjecture at U20 that coupling necessarily induces scale separation (CLAIM-473). Two small computations: conservative coupling splits modes without separating or damping them, and dissipative coupling damps the relative mode at a rate that grows with the coupling. For a Laplacian flow the kernel is exact compatibility and the nonzero spectrum is the hierarchy of relaxation rates, so a spectral gap is where the separation comes from. Conceded, so Active. It gives a mechanism for CLAIM-478’s second half and is not a test of individuality. | Active |
| 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 | From A2 and A3 of the exchange “Paper assessment” (2026-10-29), which drew it out of LIT-1820’s O(d) setting against THEORY-1082’s U(1) one. The proof and the example are the record’s, checked numerically. It is the zeroth cohomology of the connection sheaf, so standard, and it says nothing about which organizations have such transports. | Active |
| CLAIM-496 | Agreement between routes of translation is a measure of coherence, not of fidelity, and the two are independent: a rendering that sends every source utterance to one output makes direct and relay transport agree exactly while a receiver who could tell a promise from a prediction with no error is left at chance, and two routes that keep the act and differ in register disagree completely while losing nothing the act-identification task needs | From A4 and A5 of the exchange “Paper assessment” (2026-10-29), where the assistant carried LIT-1820’s comparison of alternative paths over to translation and then warned that “path agreement is a coherence criterion, not a fidelity criterion”. The constructions are the record’s. It does not say path discrepancy is uninformative: it says it measures something CLAIM-259’s directed loss does not, and conversely. | Active |
| CLAIM-502 | Multi-hop delegation can keep an operator’s authority exactly independent of its own endorsements: under leave-one-out damped delegation, which counts the authority reaching each operator only along paths that have not already passed through it, an operator’s endorsements raise the authority of every operator the endorsed one reaches and leave its own unchanged | A construction that shows CLAIM-282’s old title false. Compute each operator’s authority from A2’s damped recursive rule with that operator’s own outgoing endorsements removed. Then authority reaches it along paths of any length, but only along paths that have not passed through it, so nothing it endorses can return to it. Its authority is exactly independent of its own endorsements, and an endorsement moves authority two hops and more. It does not say the rule conserves authority, that it closes the social route of moving others’ endorsements, or that CLAIM-375’s guarantee carries over. | Active |
| CLAIM-516 | Where every constraint capacity turns over at a positive rate and is produced only by others, with no basal production and production vanishing as its producers do, capacities whose production graph is acyclic all decay to zero: a capacity that persists needs a productive cycle among its ancestors, and removing a feedback edge set extinguishes every capacity; a cycle is necessary and not sufficient, and a one-member cycle is not closure | From A10 §1 and §5A of the exchange “Analyze nucleation concepts” (2026-10-31), after the owner’s “try to progress the theoretical program”. The proof was rechecked by the reader of U7–U10. It is known in substance from autocatalytic-set theory, as A10 said. What it adds to the record is the boundary with closure: the necessary cycle may be a self-loop, and a self-loop is not closure in TERM-070’s sense or CLAIM-395’s, which need two or more constraints. | Active |
| CLAIM-517 | A successor regulator keeps a viable set positively invariant if, at every boundary context, its response distribution is within γ/L in total variation of a regulator that certifies inward margin γ, the dynamics being L-Lipschitz in that distribution; an average distillation loss certifies this only through coverage of the boundary contexts, so fidelity measured in ordinary operation certifies nothing about viability | From A16 §4 and §5 of the exchange “Analyze nucleation concepts” (2026-10-31), the owner having quoted its conclusion at U17: “preserving a regulator’s response distribution sufficiently accurately can guarantee preservation of a physical organization’s viability”. The algebra was rechecked; the regularity conditions A16 left implicit are stated here. A16’s application to its own construction (γ = 0.16) was notional, since that model has no regulator distribution and L is undefined there. | Active |
| CLAIM-524 | Whether functionally equivalent realizations are connected depends on which paths are admissible: for f = u₁v₁ + u₂v₂ with nonnegative weights, (1, 1, 0, 0) and (0, 0, 1, 1) are joined by a curve along which f stays 1 though the straight line between them falls to ½, and under any resource budget below √2 times the endpoints’ cost no path with f = 1 joins them | From the owner’s remark at U17 of the exchange “Analyze nucleation concepts” (2026-10-31), that the reconstruction fibres “reminds me of loss landscape connected mode stuff (which might just be a consequence of high dimensional geometry? … probably already discussed on the nucleation record)”. It is: see below. A17 §9 gave the curve and A18 §7 the budget for a tied-weight family; the general bound here is the reader’s, rechecked. “Viable mode connectivity” is A18’s name and is not filed as a term. | Active |
| CLAIM-536 | A categorical model of perspectives and an LDA-style model differ in where the mixture lives: the first draws every act’s perspective from one fixed categorical distribution, the second gives each episode its own mixture, drawn from a Dirichlet, and draws each act from it; the Dirichlet is a distribution over mixtures, not the perspectives themselves, and with symmetric concentration a over K perspectives two acts in one episode share a perspective with probability (a + 1)/(Ka + 1) against 1/K across episodes, so the concentration runs from one perspective per episode, as in persona selection (a → 0), to a fresh independent draw for every act (a → ∞) | The owner’s U12 of the exchange “Assess SDT Coverage” (2026-11-02), stated precisely: “H1 isn’t LDA like though. that’s my point. it’s a categorical distribution. the topics in H@ are the dirichlet distribution which parameterizes the categorical distribution, which is what distinguishes H2 from H1 and why H2 is an LDA.” The structure is right; one word is not. The Dirichlet is a distribution over each episode’s mixture, and the topics, here the perspectives, are the categories that mixture weights. The agreement formula, derived here and checked by simulation, shows that both readings of H1 are limits of H2. | Active |
| 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 | A30 §§2–3 of the exchange “Assess SDT Coverage” (2026-11-02), at the owner’s “keep going”, with the second and third conditions derived by the reader of U30–U31 and checked by simulation (500 random instances, no mismatch). It is the first concrete instance of the branch’s note of 2026-11-02 on CLAIM-354, that a reachable set should range over the policies an organization can carry out on what it can read. The framing is adjustable robust optimization (LIT-1975). Static selection only, scalar overlaps only. | Active |
| 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 | The owner’s U27 of the exchange “Assess SDT Coverage” (2026-11-02), “compatibility of tolerance bounds”, with U28’s pointer to the record’s sheaf tools, worked out at A28 §3 and A29 §§3–4, 7 and A32’s Claim A. The feasibility criterion is the classical feasible-differential theorem of network flows (Rockafellar 1984; no checked identifier, not registered), and the ratio is LP duality, so the result is granted, not the record’s discovery. What the record adds is the reading: the frontier is an invariant of the obstruction class, governance chooses where on it the mismatch falls, and omission can fake compatibility. Checked by linear programming against brute-force cycle enumeration on random graphs. | Active |
| CLAIM-542 | Sensitivity does not fix the allocation or the authorship of control: linearized, every input reaches the final state through the same transition operator, ∂x_T/∂w_t = Φ(T, t)B_w(t), so systems with the same Lyapunov spectrum can differ arbitrarily in what an agent’s own channel, an outside party’s channel and noise each reach and at what least energy; and along one unstable direction a larger exponent λ lowers the least effort to reach a displacement, since W_T = b²(e^{2λT} − 1)/2λ grows with λ, while a constant open-loop input against white noise entering the same direction has terminal signal-to-noise ratio tending to (bu/σ)√(2/λ), which falls as λ grows, so only feedback that observes the state turns cheaper control into reliable direction | The demonstrated part of the owner’s U16 and U20 of the exchange “Assess SDT Coverage” (2026-11-02), “controllability vs sensitivity”. A20 §2 stated the impulse case (“the relative contribution is not determined by e^{λT}”) and A22 §5 the channel case. The scalar signal-to-noise result is the reader’s derivation, checked by simulation. It sharpens the owner’s point: sensitivity makes control cheaper and, without feedback, less decisive against noise. CLAIM-345 holds the cost formula and not the allocation across channels. | Active |