Notation by work
Stratified Relational Workspace Theory
All notation · Glossary · Source coverage
2099 symbol spellings in 2664 mathematical passages across 33 selected source files. Subscripts and superscripts have their own entries alongside their base symbols.
The same symbol can have several meanings here. A passage classified as a definition may define another part of its expression. Read the linked context before assigning a meaning.
All 2099 entries are available below.
ANotation table · 178 passages
Search aliases: A
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 534
Goal use · η_G→ A · Goal intervention versus goal-label replay.
Exact mathematical passage
\eta_{G\to A}
DNotation table · 138 passages
Search aliases: D
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 540
Damage detection · η_D→ M · Damage versus matched no-damage.
Exact mathematical passage
\eta_{D\to M}
GNotation table · 172 passages
Search aliases: G
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 532
Goal retention · η_G(τ) · Goal intervention with future cues matched or removed.
Exact mathematical passage
\eta_G(\tau)
gNotation table · 127 passages
Search aliases: g
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 530
Goal semantics · Held-out Q_t^g ordering · Distinct goals reverse or alter at least one declared action ordering.
Exact mathematical passage
Q_t^g
MNotation table · 46 passages
Search aliases: M
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 540
Damage detection · η_D→ M · Damage versus matched no-damage.
Exact mathematical passage
\eta_{D\to M}
NNotation table · 30 passages
Search aliases: N
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 505
Null ID · One of N_1,…,N_34 or a declared extension.
Exact mathematical passage
N_1,\ldots,N_{34}
N_1Notation table · 3 passages
Search aliases: N_1
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 505
Null ID · One of N_1,…,N_34 or a declared extension.
Exact mathematical passage
N_1,\ldots,N_{34}
N_{34}Notation table · 4 passages
Search aliases: N_34
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 505
Null ID · One of N_1,…,N_34 or a declared extension.
Exact mathematical passage
N_1,\ldots,N_{34}
QNotation table · 90 passages
Search aliases: Q
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 530
Goal semantics · Held-out Q_t^g ordering · Distinct goals reverse or alter at least one declared action ordering.
Exact mathematical passage
Q_t^g
Q_t^gNotation table · 6 passages
Search aliases: Q_t^g
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 530
Goal semantics · Held-out Q_t^g ordering · Distinct goals reverse or alter at least one declared action ordering.
Exact mathematical passage
Q_t^g
RNotation table · 85 passages
Search aliases: R
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 541
Repair mediation · η_M→ R · Monitor intervention and monitor ablation.
Exact mathematical passage
\eta_{M\to R}
\mathrm{repair}Notation table · 6 passages
Search aliases: repair mathrm
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 544
Repair specificity · Δ_repair^spec · Intended repair versus cost-matched generic action.
Exact mathematical passage
\Delta_{\mathrm{repair}}^{\mathrm{spec}}
\mathrm{spec}Notation table · 18 passages
Search aliases: spec mathrm
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 544
Repair specificity · Δ_repair^spec · Intended repair versus cost-matched generic action.
Exact mathematical passage
\Delta_{\mathrm{repair}}^{\mathrm{spec}}
tNotation table · 489 passages
Search aliases: t
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 530
Goal semantics · Held-out Q_t^g ordering · Distinct goals reverse or alter at least one declared action ordering.
Exact mathematical passage
Q_t^g
VNotation table · 220 passages
Search aliases: V
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 537
Value use · η_V→ A · Value-label permutation and value-channel ablation.
Exact mathematical passage
\eta_{V\to A}
vNotation table · 32 passages
Search aliases: v
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 543
Restoration · η_R→ v · Repair versus matched no-repair.
Exact mathematical passage
\eta_{R\to v}
YNotation table · 136 passages
Search aliases: Y
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 539
Outcome control · η_A→ Y · Feasible action intervention.
Exact mathematical passage
\eta_{A\to Y}
\DeltaNotation table · 75 passages
Search aliases: Δ Delta
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 544
Repair specificity · Δ_repair^spec · Intended repair versus cost-matched generic action.
Exact mathematical passage
\Delta_{\mathrm{repair}}^{\mathrm{spec}}
\deltaNotation table · 190 passages
Search aliases: δ delta
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 535
Counterfactual accuracy · δ_Q · Internal value versus external action interventions.
Exact mathematical passage
\delta_Q
\delta_QNotation table · 5 passages
Search aliases: δ_Q delta
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 535
Counterfactual accuracy · δ_Q · Internal value versus external action interventions.
Exact mathematical passage
\delta_Q
\Delta_{\mathrm{repair}}^{\mathrm{spec}}Notation table · 6 passages
Search aliases: Δ_repair^spec Delta mathrm mathrm
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 544
Repair specificity · Δ_repair^spec · Intended repair versus cost-matched generic action.
Exact mathematical passage
\Delta_{\mathrm{repair}}^{\mathrm{spec}}
\etaNotation table · 96 passages
Search aliases: η eta
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 532
Goal retention · η_G(τ) · Goal intervention with future cues matched or removed.
Exact mathematical passage
\eta_G(\tau)
\eta_{A\to Y}Notation table · 7 passages
Search aliases: η_A→ Y eta to
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 539
Outcome control · η_A→ Y · Feasible action intervention.
Exact mathematical passage
\eta_{A\to Y}
\eta_{D\to M}Notation table · 6 passages
Search aliases: η_D→ M eta to
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 540
Damage detection · η_D→ M · Damage versus matched no-damage.
Exact mathematical passage
\eta_{D\to M}
\eta_GNotation table · 6 passages
Search aliases: η_G eta
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 532
Goal retention · η_G(τ) · Goal intervention with future cues matched or removed.
Exact mathematical passage
\eta_G(\tau)
\eta_{G\to A}Notation table · 8 passages
Search aliases: η_G→ A eta to
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 534
Goal use · η_G→ A · Goal intervention versus goal-label replay.
Exact mathematical passage
\eta_{G\to A}
\eta_{M\to R}Notation table · 6 passages
Search aliases: η_M→ R eta to
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 541
Repair mediation · η_M→ R · Monitor intervention and monitor ablation.
Exact mathematical passage
\eta_{M\to R}
\eta_{R\to v}Notation table · 7 passages
Search aliases: η_R→ v eta to
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 543
Restoration · η_R→ v · Repair versus matched no-repair.
Exact mathematical passage
\eta_{R\to v}
\eta_{V\to A}Notation table · 4 passages
Search aliases: η_V→ A eta to
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 537
Value use · η_V→ A · Value-label permutation and value-channel ablation.
Exact mathematical passage
\eta_{V\to A}
\tauNotation table · 101 passages
Search aliases: τ tau
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 532
Goal retention · η_G(τ) · Goal intervention with future cues matched or removed.
Exact mathematical passage
\eta_G(\tau)
\ldotsNotation table · 18 passages
Search aliases: … ldots
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 505
Null ID · One of N_1,…,N_34 or a declared extension.
Exact mathematical passage
N_1,\ldots,N_{34}
\toNotation table · 99 passages
Search aliases: → to
Notation table · 21-empirical-certification-and-reporting-protocol.tex, line 534
Goal use · η_G→ A · Goal intervention versus goal-label replay.
Exact mathematical passage
\eta_{G\to A}
*Definition passage · 157 passages
Search aliases: *
Definition passage: Transfer discrepancy · 04-approximate-workspaces.tex, line 46
[Transfer discrepancy] The transfer discrepancy operator is D_H: C_V⟶ C_E, (D_Hc)_e = sqrtw_e(c_t(e)-H_ec_s(e)). Its squared norm is the coherence energy E_H(c) = D_Hc ^2 = ∑_e∈ Ew_e c_t(e)-H_ec_s(e) ^2. The transfer Laplacian is L_H=D_H^*D_H.
Exact mathematical passage
\boxed{L_H=D_H^*D_H.}
+Definition passage · 314 passages
Search aliases: +
Definition passage: Threshold workspace · 04-approximate-workspaces.tex, line 190
[Threshold workspace] For ε≥0, define Γ_ε(H) = ran P_[0,ε](L_H). Its dimension is d_ε = #{k:λ_k≤ε}. When 0<d_ε<N, define the boundary gap g_ε = λ_d_ε+1-λ_d_ε.
Exact mathematical passage
\boxed{ g_\varepsilon = \lambda_{d_\varepsilon+1}-\lambda_{d_\varepsilon}. }
\mathbf1Definition passage · 4 passages
Search aliases: 1 mathbf
Definition passage: Workspace specification · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 53
item ℓ is the normalized loss or utility convention; item τ is the temporal horizon or horizon family; item I is the feasible intervention family; item N is the required matched-null family; and item Θ is the gate schema, direction, threshold, and indifference region used for certification. The complete certificate is written Cert(W;ς) = bigwedge_q∈ J(ς) 1{m_q(W;ς)>0}, where m_q is the signed margin of gate q. Positive margin means that that gate passes in the direction declared by Θ.
Exact mathematical passage
\operatorname{Cert}(W;\varsigma) = \bigwedge_{q\in\mathcal J(\varsigma)} \mathbf 1\{m_q(W;\varsigma)>0\},
=Definition passage · 905 passages
Search aliases: =
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 19
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
\mathfrak R = \bigl( G,\mathbf X,\mathbf T,\mathcal A,\boldsymbol\rho, \mathcal H,\mathcal I,\mathcal Y \bigr),
\mathcal ADefinition passage · 36 passages
Search aliases: A mathcal
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 19
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
\mathfrak R = \bigl( G,\mathbf X,\mathbf T,\mathcal A,\boldsymbol\rho, \mathcal H,\mathcal I,\mathcal Y \bigr),
aDefinition passage · 138 passages
Search aliases: a
Definition passage: Exact operation-compatible transfer · 02-static-core-transfer-theory.tex, line 307
[Exact operation-compatible transfer] A core transfer H_e:C_i→ C_j is operation compatible when it is an intertwiner: H_eρ_i(a)=ρ_j(a)H_e ∀ a∈ A. Equivalently, the diagram ccc C_i · xrightarrowρ_i(a) · C_i
Exact mathematical passage
\boxed{ H_e\rho_i(a)=\rho_j(a)H_e } \qquad \forall a\in\mathcal A.
A_iDefinition passage · 15 passages
Search aliases: A_i
Definition passage: Natural workspace operators · 03-exact-shared-cores.tex, line 418
[Natural workspace operators] Define O_Workspace = { (A_i)_i∈ V: A_t(e)H_e=H_eA_s(e) ∀ e }. Categorically, O_Workspace=Nat(H,H), the algebra of natural endomorphisms of the local system.
Exact mathematical passage
\boxed{ \mathcal O_{\Workspace} = \left\{ (A_i)_{i\in V}: A_{t(e)}H_e=H_eA_{s(e)}\ \forall e \right\}. }
A_{s(e)}Definition passage · 1 passage
Search aliases: A_s(e)
Definition passage: Natural workspace operators · 03-exact-shared-cores.tex, line 418
[Natural workspace operators] Define O_Workspace = { (A_i)_i∈ V: A_t(e)H_e=H_eA_s(e) ∀ e }. Categorically, O_Workspace=Nat(H,H), the algebra of natural endomorphisms of the local system.
Exact mathematical passage
\boxed{ \mathcal O_{\Workspace} = \left\{ (A_i)_{i\in V}: A_{t(e)}H_e=H_eA_{s(e)}\ \forall e \right\}. }
A_{t(e)}Definition passage · 1 passage
Search aliases: A_t(e)
Definition passage: Natural workspace operators · 03-exact-shared-cores.tex, line 418
[Natural workspace operators] Define O_Workspace = { (A_i)_i∈ V: A_t(e)H_e=H_eA_s(e) ∀ e }. Categorically, O_Workspace=Nat(H,H), the algebra of natural endomorphisms of the local system.
Exact mathematical passage
\boxed{ \mathcal O_{\Workspace} = \left\{ (A_i)_{i\in V}: A_{t(e)}H_e=H_eA_{s(e)}\ \forall e \right\}. }
BDefinition passage · 90 passages
Search aliases: B
Definition passage: Feasible implementation intervention · 08-causal-efficacy-and-reentry.tex, line 31
[Feasible implementation intervention] Let B_t denote declared background variables that should remain matched. A family {ι_w:w∈ W_t^∘} is a feasible implementation of workspace values on the experimental domain W_t^∘ when: item each ι_w acts only on declared manipulable parents, channels, or artifacts at or after time t; item the intervened realization satisfies π_t(S_t^ι_w)=w almost surely; item the background law is matched across compared interventions; and item the intervention does not dir…
Exact mathematical passage
B_t
\mathcal BDefinition passage · 14 passages
Search aliases: B mathcal
Definition passage: Predictive kernel and canonical state · 06-dynamic-workspace-theory.tex, line 119
[Predictive kernel and canonical state] Let H_t and Y be standard Borel spaces. A regular conditional kernel is a measurable map K_t: H_t× B( Y)→[0,1] satisfying K_t(h,A) = P(Y_t^+∈ Amid H_t=h) for P_ H_t-almost every h. Let P( Y) carry its evaluation sigma-algebra. The canonical predictive state is the random probability measure Z_t = K_t( H_t,·) ∈ P( Y). Two histories are predictively equivalent precisely when they induce the same conditional law of Y_t^+.
Exact mathematical passage
K_t:\mathsf H_t\times\mathcal B(\mathsf Y)\to[0,1]
\mathfrak BDefinition passage · 3 passages
Search aliases: B mathfrak
Definition passage: Boundary problem · 15-boundary-formation-and-stability.tex, line 13
[Boundary problem] A boundary problem is a tuple B = ( V, S, τ, Y, I, Π, G_B ), where S⊆2^V is the admissible candidate family, τ is the temporal scale, Y is the operational target, I is the feasible intervention family, Π is the environment distribution, and G_B is a symmetry group under which boundaries are considered equivalent.
Exact mathematical passage
\mathfrak B = \left( V, \mathfrak S, \tau, \mathcal Y, \mathcal I, \Pi, \mathcal G_B \right),
B_tDefinition passage · 14 passages
Search aliases: B_t
Definition passage: Feasible implementation intervention · 08-causal-efficacy-and-reentry.tex, line 31
[Feasible implementation intervention] Let B_t denote declared background variables that should remain matched. A family {ι_w:w∈ W_t^∘} is a feasible implementation of workspace values on the experimental domain W_t^∘ when: item each ι_w acts only on declared manipulable parents, channels, or artifacts at or after time t; item the intervened realization satisfies π_t(S_t^ι_w)=w almost surely; item the background law is matched across compared interventions; and item the intervention does not dir…
Exact mathematical passage
B_t
B_\alphaDefinition passage · 2 passages
Search aliases: B_α alpha
Definition passage: System decomposition · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 34
[System decomposition] A decomposition of a carrier presentation is a tuple D = ( Π, O,G_Π, I_Π ), where: item Π={B_α}_α∈ A is a partition of Ω; item O_α is the declared local-access map for block B_α, producing the local state or history available at that component; item G_Π records the declared communication, transfer, and causal interfaces among the blocks; and item I_Π is the family of feasible interventions at that resolution. The accessible information of component α is the sigma-field mat…
Exact mathematical passage
\Pi=\{B_\alpha\}_{\alpha\in A}
\bigveeDefinition passage · 3 passages
Search aliases: bigvee
Definition passage: Refinement and coarsening · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 79
r presentation. The fine decomposition refines the coarse decomposition, written D_fpreceq D_c, when there is a surjection q:V_f⟶ V_c such that each coarse component is the union of the fine components in one fiber of q, and its accessible information is generated only from those fine components. The aggregation is information faithful when mathscr F_B^ D_c = bigvee_i∈ q^-1(B) mathscr F_i^ D_f (B∈ V_c). It is structurally faithful when it also retains every internal compatibility condition and e…
Exact mathematical passage
\mathscr F_B^{\mathcal D_c} = \bigvee_{i\in q^{-1}(B)} \mathscr F_i^{\mathcal D_f} \qquad(B\in V_c).
\bigvee_{i\in q^{-1}(B)}Definition passage · 2 passages
Search aliases: bigvee_i∈ q^-1(B) bigvee in
Definition passage: Refinement and coarsening · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 79
r presentation. The fine decomposition refines the coarse decomposition, written D_fpreceq D_c, when there is a surjection q:V_f⟶ V_c such that each coarse component is the union of the fine components in one fiber of q, and its accessible information is generated only from those fine components. The aggregation is information faithful when mathscr F_B^ D_c = bigvee_i∈ q^-1(B) mathscr F_i^ D_f (B∈ V_c). It is structurally faithful when it also retains every internal compatibility condition and e…
Exact mathematical passage
\mathscr F_B^{\mathcal D_c} = \bigvee_{i\in q^{-1}(B)} \mathscr F_i^{\mathcal D_f} \qquad(B\in V_c).
\bigwedgeDefinition passage · 5 passages
Search aliases: bigwedge
Definition passage: Decomposition-robust certificate · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 451
[Decomposition-robust certificate] A workspace passes the D-robust certificate at level L when Certify_L, D^rob(W) = bigwedge_q∈ J(L) { inf_ D∈ D m_q(W; D)>0 }. A pass for one selected decomposition is a decomposition-specific claim. A pass throughout D is a family-robust claim. A claim is decomposition fragile when at least one required gate changes sign inside the admissible family.
Exact mathematical passage
\boxed{ \operatorname{Certify}_{L,\mathfrak D}^{\mathrm{rob}}(W) = \bigwedge_{q\in\mathcal J(L)} \left\{ \inf_{\mathcal D\in\mathfrak D} m_q(W;\mathcal D)>0 \right\}. }
\bigwedge_{q\in\mathcal J(L)}Definition passage · 1 passage
Search aliases: bigwedge_q∈ J(L) bigwedge in mathcal
Definition passage: Decomposition-robust certificate · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 451
[Decomposition-robust certificate] A workspace passes the D-robust certificate at level L when Certify_L, D^rob(W) = bigwedge_q∈ J(L) { inf_ D∈ D m_q(W; D)>0 }. A pass for one selected decomposition is a decomposition-specific claim. A pass throughout D is a family-robust claim. A claim is decomposition fragile when at least one required gate changes sign inside the admissible family.
Exact mathematical passage
\boxed{ \operatorname{Certify}_{L,\mathfrak D}^{\mathrm{rob}}(W) = \bigwedge_{q\in\mathcal J(L)} \left\{ \inf_{\mathcal D\in\mathfrak D} m_q(W;\mathcal D)>0 \right\}. }
\bigwedge_{q\in\mathcal J(\varsigma)}Definition passage · 2 passages
Search aliases: bigwedge_q∈ J(ς) bigwedge in mathcal varsigma
Definition passage: Workspace specification · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 53
item ℓ is the normalized loss or utility convention; item τ is the temporal horizon or horizon family; item I is the feasible intervention family; item N is the required matched-null family; and item Θ is the gate schema, direction, threshold, and indifference region used for certification. The complete certificate is written Cert(W;ς) = bigwedge_q∈ J(ς) 1{m_q(W;ς)>0}, where m_q is the signed margin of gate q. Positive margin means that that gate passes in the direction declared by Θ.
Exact mathematical passage
\operatorname{Cert}(W;\varsigma) = \bigwedge_{q\in\mathcal J(\varsigma)} \mathbf 1\{m_q(W;\varsigma)>0\},
CDefinition passage · 130 passages
Search aliases: C
Definition passage: Admissible local decomposition · 02-static-core-transfer-theory.tex, line 125
[Admissible local decomposition] For every vertex i, choose an orthogonal decomposition X_i=C_i⊕ R_i, with projectors P_i:X_i→ C_i, Q_i=I-P_i:X_i→ R_i. The subspace C_i is the candidate locally realized transferable core. The subspace R_i contains substrate-specific, context-specific, or otherwise noncore degrees of freedom relative to the present analysis.
Exact mathematical passage
X_i=C_i\oplus R_i,
\mathbb CDefinition passage · 1 passage
Search aliases: C mathbb
Definition passage: Operation algebra · 02-static-core-transfer-theory.tex, line 291
[Operation algebra] Let F∈{ R, C}. An operation algebra A is a unital associative F-algebra whose elements represent abstract transformations, inferential rules, questions, or procedures that can be realized in multiple strata.
Exact mathematical passage
\mathbb F\in\{\mathbb R,\mathbb C\}
\mathcal CDefinition passage · 25 passages
Search aliases: C mathcal
Definition passage: Transfer discrepancy · 04-approximate-workspaces.tex, line 27
[Transfer discrepancy] The transfer discrepancy operator is D_H: C_V⟶ C_E, (D_Hc)_e = sqrtw_e(c_t(e)-H_ec_s(e)). Its squared norm is the coherence energy E_H(c) = D_Hc ^2 = ∑_e∈ Ew_e c_t(e)-H_ec_s(e) ^2. The transfer Laplacian is L_H=D_H^*D_H.
Exact mathematical passage
D_H:\mathcal C_V\longrightarrow\mathcal C_E, \qquad (D_Hc)_e = \sqrt{w_e}\bigl(c_{t(e)}-H_ec_{s(e)}\bigr).
\mathfrak CDefinition passage · 3 passages
Search aliases: C mathfrak
Definition passage: Case-study realization · 22-integrated-worked-examples-and-case-studies.tex, line 27
[Case-study realization] A case-study realization is a tuple K = ( R, B, C, P, E, D, S, I, Q, G ), where: item R is the declared relational realization; item B is the boundary problem and component decomposition; item C is the structural core--transfer model; item P is the downstream predictive or control problem; item E is the evidence or generated-data family; item D is the admissible decomposition family; item S is the admissible family of complete scientific specifications, including targets…
Exact mathematical passage
\mathfrak K = \bigl( \mathfrak R, \mathfrak B, \mathfrak C, \mathfrak P, \mathcal E, \mathfrak D, \mathfrak S, \mathcal I, \mathcal Q, \mathcal G \bigr),
cDefinition passage · 177 passages
Search aliases: c
Definition passage: Exact operation-compatible transfer · 02-static-core-transfer-theory.tex, line 315
[Exact operation-compatible transfer] A core transfer H_e:C_i→ C_j is operation compatible when it is an intertwiner: H_eρ_i(a)=ρ_j(a)H_e ∀ a∈ A. Equivalently, the diagram ccc C_i · xrightarrowρ_i(a) · C_i downarrow H_e · · downarrow H_e C_j · xrightarrowρ_j(a) · C_j commutes for every a.
Exact mathematical passage
\begin{array}{ccc} C_i&\xrightarrow{\rho_i(a)}&C_i\\ \downarrow H_e&&\downarrow H_e\\ C_j&\xrightarrow{\rho_j(a)}&C_j \end{array}
\mathcal C_EDefinition passage · 6 passages
Search aliases: C_E mathcal
Definition passage: Transfer discrepancy · 04-approximate-workspaces.tex, line 27
[Transfer discrepancy] The transfer discrepancy operator is D_H: C_V⟶ C_E, (D_Hc)_e = sqrtw_e(c_t(e)-H_ec_s(e)). Its squared norm is the coherence energy E_H(c) = D_Hc ^2 = ∑_e∈ Ew_e c_t(e)-H_ec_s(e) ^2. The transfer Laplacian is L_H=D_H^*D_H.
Exact mathematical passage
D_H:\mathcal C_V\longrightarrow\mathcal C_E, \qquad (D_Hc)_e = \sqrt{w_e}\bigl(c_{t(e)}-H_ec_{s(e)}\bigr).
C_iDefinition passage · 23 passages
Search aliases: C_i
Definition passage: Admissible local decomposition · 02-static-core-transfer-theory.tex, line 125
[Admissible local decomposition] For every vertex i, choose an orthogonal decomposition X_i=C_i⊕ R_i, with projectors P_i:X_i→ C_i, Q_i=I-P_i:X_i→ R_i. The subspace C_i is the candidate locally realized transferable core. The subspace R_i contains substrate-specific, context-specific, or otherwise noncore degrees of freedom relative to the present analysis.
Exact mathematical passage
X_i=C_i\oplus R_i,
c_iDefinition passage · 25 passages
Search aliases: c_i
Definition passage: Global compatible section · 03-exact-shared-cores.tex, line 13
[Global compatible section] The exact structural workspace is Γ(H) = { (c_i)_i∈ V∈⊕_i∈ VC_i: c_t(e)=H_ec_s(e) ∀ e∈ E }. An element c=(c_i)∈Γ(H) is a global compatible section.
Exact mathematical passage
\boxed{ \Gamma(H) = \left\{ (c_i)_{i\in V}\in\bigoplus_{i\in V}C_i: \ c_{t(e)}=H_ec_{s(e)}\ \forall e\in E \right\}. }
C_jDefinition passage · 5 passages
Search aliases: C_j
Definition passage: Exact operation-compatible transfer · 02-static-core-transfer-theory.tex, line 305
[Exact operation-compatible transfer] A core transfer H_e:C_i→ C_j is operation compatible when it is an intertwiner: H_eρ_i(a)=ρ_j(a)H_e ∀ a∈ A. Equivalently, the diagram ccc C_i · xrightarrowρ_i(a) · C_i
Exact mathematical passage
H_e:C_i\to C_j
C_{s(e)}Definition passage · 3 passages
Search aliases: C_s(e)
Definition passage: Exact core-transfer system · 02-static-core-transfer-theory.tex, line 272
[Exact core-transfer system] An exact core-transfer system on G consists of: item decompositions X_i=C_i⊕ R_i; item core-preserving edge maps V_e=0; and item invertible core blocks H_e∈ GL(C_s(e),C_t(e)) whenever holonomy is invoked.
Exact mathematical passage
H_e\in GL(C_{s(e)},C_{t(e)})
c_{s(e)}Definition passage · 10 passages
Search aliases: c_s(e)
Definition passage: Global compatible section · 03-exact-shared-cores.tex, line 13
[Global compatible section] The exact structural workspace is Γ(H) = { (c_i)_i∈ V∈⊕_i∈ VC_i: c_t(e)=H_ec_s(e) ∀ e∈ E }. An element c=(c_i)∈Γ(H) is a global compatible section.
Exact mathematical passage
\boxed{ \Gamma(H) = \left\{ (c_i)_{i\in V}\in\bigoplus_{i\in V}C_i: \ c_{t(e)}=H_ec_{s(e)}\ \forall e\in E \right\}. }
C_{t(e)}Definition passage · 5 passages
Search aliases: C_t(e)
Definition passage: Exact core-transfer system · 02-static-core-transfer-theory.tex, line 272
[Exact core-transfer system] An exact core-transfer system on G consists of: item decompositions X_i=C_i⊕ R_i; item core-preserving edge maps V_e=0; and item invertible core blocks H_e∈ GL(C_s(e),C_t(e)) whenever holonomy is invoked.
Exact mathematical passage
H_e\in GL(C_{s(e)},C_{t(e)})
c_{t(e)}Definition passage · 8 passages
Search aliases: c_t(e)
Definition passage: Global compatible section · 03-exact-shared-cores.tex, line 13
[Global compatible section] The exact structural workspace is Γ(H) = { (c_i)_i∈ V∈⊕_i∈ VC_i: c_t(e)=H_ec_s(e) ∀ e∈ E }. An element c=(c_i)∈Γ(H) is a global compatible section.
Exact mathematical passage
\boxed{ \Gamma(H) = \left\{ (c_i)_{i\in V}\in\bigoplus_{i\in V}C_i: \ c_{t(e)}=H_ec_{s(e)}\ \forall e\in E \right\}. }
\mathcal C_VDefinition passage · 20 passages
Search aliases: C_V mathcal
Definition passage: Transfer discrepancy · 04-approximate-workspaces.tex, line 27
[Transfer discrepancy] The transfer discrepancy operator is D_H: C_V⟶ C_E, (D_Hc)_e = sqrtw_e(c_t(e)-H_ec_s(e)). Its squared norm is the coherence energy E_H(c) = D_Hc ^2 = ∑_e∈ Ew_e c_t(e)-H_ec_s(e) ^2. The transfer Laplacian is L_H=D_H^*D_H.
Exact mathematical passage
D_H:\mathcal C_V\longrightarrow\mathcal C_E, \qquad (D_Hc)_e = \sqrt{w_e}\bigl(c_{t(e)}-H_ec_{s(e)}\bigr).
\mathrm{causal}Definition passage · 26 passages
Search aliases: causal mathrm
Definition passage: Causal formation sensitivity · 14-scaffolded-and-endogenous-formation.tex, line 264
[Causal formation sensitivity] Let ι_h and ι_h' be matched feasible interventions that alter formation history while preserving the scaffold, randomization law, sample size, and intervention cost. For a divergence D, define e_q^causal = E_(h,h')∼ν_q D ( L^ι_h(q), L^ι_h'(q) ). A common null uses temporally or relationally shuffled histories that preserve local marginals but destroy the candidate formation signal.
Exact mathematical passage
\boxed{ e_q^{\mathrm{causal}} = \mathbb E_{(h,h')\sim\nu_q} D\!\left( \mathcal L^{\iota_h}(q), \mathcal L^{\iota_{h'}}(q) \right). }
\mathrm{cert}Definition passage · 11 passages
Search aliases: cert mathrm
Definition passage: Formation system · 14-scaffolded-and-endogenous-formation.tex, line 15
[Formation system] A workspace formation system is a tuple F = ( Σ, D_form, L, Ω, widehatθ, D_cert, I_form ), where: item Σ is the externally supplied scaffold; item D_form is the formation or training history; item L is the learning or selection rule; item Ω is its internal random seed or stochastic state; item widehatθ= L(Σ, D_form,Ω) is the learned organization; item D_cert is held-out certification data; and item I_form is a declared family of interventions on scaffold and formation history.…
Exact mathematical passage
\mathfrak F = \bigl( \Sigma, \mathcal D_{\mathrm{form}}, \mathcal L, \Omega, \widehat\theta, \mathcal D_{\mathrm{cert}}, \mathcal I_{\mathrm{form}} \bigr),
\operatorname{Cert}Definition passage · 10 passages
Search aliases: Cert operatorname
Definition passage: Workspace specification · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 53
item ℓ is the normalized loss or utility convention; item τ is the temporal horizon or horizon family; item I is the feasible intervention family; item N is the required matched-null family; and item Θ is the gate schema, direction, threshold, and indifference region used for certification. The complete certificate is written Cert(W;ς) = bigwedge_q∈ J(ς) 1{m_q(W;ς)>0}, where m_q is the signed margin of gate q. Positive margin means that that gate passes in the direction declared by Θ.
Exact mathematical passage
\operatorname{Cert}(W;\varsigma) = \bigwedge_{q\in\mathcal J(\varsigma)} \mathbf 1\{m_q(W;\varsigma)>0\},
\operatorname{Certify}Definition passage · 3 passages
Search aliases: Certify operatorname
Definition passage: Decomposition-robust certificate · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 451
[Decomposition-robust certificate] A workspace passes the D-robust certificate at level L when Certify_L, D^rob(W) = bigwedge_q∈ J(L) { inf_ D∈ D m_q(W; D)>0 }. A pass for one selected decomposition is a decomposition-specific claim. A pass throughout D is a family-robust claim. A claim is decomposition fragile when at least one required gate changes sign inside the admissible family.
Exact mathematical passage
\boxed{ \operatorname{Certify}_{L,\mathfrak D}^{\mathrm{rob}}(W) = \bigwedge_{q\in\mathcal J(L)} \left\{ \inf_{\mathcal D\in\mathfrak D} m_q(W;\mathcal D)>0 \right\}. }
\operatorname{Certify}_{L,\mathfrak D}^{\mathrm{rob}}Definition passage · 2 passages
Search aliases: Certify_L, D^rob operatorname mathfrak mathrm
Definition passage: Decomposition-robust certificate · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 451
[Decomposition-robust certificate] A workspace passes the D-robust certificate at level L when Certify_L, D^rob(W) = bigwedge_q∈ J(L) { inf_ D∈ D m_q(W; D)>0 }. A pass for one selected decomposition is a decomposition-specific claim. A pass throughout D is a family-robust claim. A claim is decomposition fragile when at least one required gate changes sign inside the admissible family.
Exact mathematical passage
\boxed{ \operatorname{Certify}_{L,\mathfrak D}^{\mathrm{rob}}(W) = \bigwedge_{q\in\mathcal J(L)} \left\{ \inf_{\mathcal D\in\mathfrak D} m_q(W;\mathcal D)>0 \right\}. }
\mathcal DDefinition passage · 64 passages
Search aliases: D mathcal
Definition passage: Formation system · 14-scaffolded-and-endogenous-formation.tex, line 15
[Formation system] A workspace formation system is a tuple F = ( Σ, D_form, L, Ω, widehatθ, D_cert, I_form ), where: item Σ is the externally supplied scaffold; item D_form is the formation or training history; item L is the learning or selection rule; item Ω is its internal random seed or stochastic state; item widehatθ= L(Σ, D_form,Ω) is the learned organization; item D_cert is held-out certification data; and item I_form is a declared family of interventions on scaffold and formation history.…
Exact mathematical passage
\mathfrak F = \bigl( \Sigma, \mathcal D_{\mathrm{form}}, \mathcal L, \Omega, \widehat\theta, \mathcal D_{\mathrm{cert}}, \mathcal I_{\mathrm{form}} \bigr),
\mathfrak DDefinition passage · 23 passages
Search aliases: D mathfrak
Definition passage: Admissible decomposition family · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 403
[Admissible decomposition family] An admissible family D is a predeclared collection of decompositions of the same carrier presentation satisfying the following audit conditions. item Carrier continuity. Each component corresponds to a process, artifact, or mechanism that can be tracked through the relevant time scale. item Access locality. The local state contains only information available through the declared component and its recorded incoming channels. item Channel completeness. Shared memo…
Exact mathematical passage
\mathfrak D
dDefinition passage · 144 passages
Search aliases: d
Definition passage: Threshold workspace · 04-approximate-workspaces.tex, line 184
[Threshold workspace] For ε≥0, define Γ_ε(H) = ran P_[0,ε](L_H). Its dimension is d_ε = #{k:λ_k≤ε}. When 0<d_ε<N, define the boundary gap g_ε = λ_d_ε+1-λ_d_ε.
Exact mathematical passage
d_\varepsilon = \#\{k:\lambda_k\leq\varepsilon\}.
D'Definition passage · 8 passages
Search aliases: D'
Definition passage: Exact structural correspondence · 12-identity-through-time-and-replacement.tex, line 35
[Exact structural correspondence] The correspondence is structurally exact when D'J_V=J_ED. It is operation exact for a∈ A when ρ_V'(a)J_V=J_Vρ_V(a).
Exact mathematical passage
\boxed{D'J_V=J_ED.}
\mathcal D_cDefinition passage · 11 passages
Search aliases: D_c mathcal
Definition passage: Refinement and coarsening · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 66
[Refinement and coarsening] Let D_f and D_c be decompositions of the same carrier presentation. The fine decomposition refines the coarse decomposition, written D_fpreceq D_c, when there is a surjection q:V_f⟶ V_c such that each coarse component is the union of the fine components in one fiber of q, and its accessible information is generated only from those fine components. The aggregation is information faithful when mathscr F_B^ D_c = bigvee_i∈ q^-1(B) mathscr F_i^ D_f (B∈ V_c). It is structu…
Exact mathematical passage
\mathcal D_c
\mathcal D_{\mathrm{cert}}Definition passage · 7 passages
Search aliases: D_cert mathcal mathrm
Definition passage: Formation system · 14-scaffolded-and-endogenous-formation.tex, line 15
[Formation system] A workspace formation system is a tuple F = ( Σ, D_form, L, Ω, widehatθ, D_cert, I_form ), where: item Σ is the externally supplied scaffold; item D_form is the formation or training history; item L is the learning or selection rule; item Ω is its internal random seed or stochastic state; item widehatθ= L(Σ, D_form,Ω) is the learned organization; item D_cert is held-out certification data; and item I_form is a declared family of interventions on scaffold and formation history.…
Exact mathematical passage
\mathfrak F = \bigl( \Sigma, \mathcal D_{\mathrm{form}}, \mathcal L, \Omega, \widehat\theta, \mathcal D_{\mathrm{cert}}, \mathcal I_{\mathrm{form}} \bigr),
\mathcal D_fDefinition passage · 11 passages
Search aliases: D_f mathcal
Definition passage: Refinement and coarsening · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 66
[Refinement and coarsening] Let D_f and D_c be decompositions of the same carrier presentation. The fine decomposition refines the coarse decomposition, written D_fpreceq D_c, when there is a surjection q:V_f⟶ V_c such that each coarse component is the union of the fine components in one fiber of q, and its accessible information is generated only from those fine components. The aggregation is information faithful when mathscr F_B^ D_c = bigvee_i∈ q^-1(B) mathscr F_i^ D_f (B∈ V_c). It is structu…
Exact mathematical passage
\mathcal D_f
\mathcal D_{\mathrm{form}}Definition passage · 10 passages
Search aliases: D_form mathcal mathrm
Definition passage: Formation system · 14-scaffolded-and-endogenous-formation.tex, line 15
[Formation system] A workspace formation system is a tuple F = ( Σ, D_form, L, Ω, widehatθ, D_cert, I_form ), where: item Σ is the externally supplied scaffold; item D_form is the formation or training history; item L is the learning or selection rule; item Ω is its internal random seed or stochastic state; item widehatθ= L(Σ, D_form,Ω) is the learned organization; item D_cert is held-out certification data; and item I_form is a declared family of interventions on scaffold and formation history.…
Exact mathematical passage
\mathfrak F = \bigl( \Sigma, \mathcal D_{\mathrm{form}}, \mathcal L, \Omega, \widehat\theta, \mathcal D_{\mathrm{cert}}, \mathcal I_{\mathrm{form}} \bigr),
D_HDefinition passage · 42 passages
Search aliases: D_H
Definition passage: Transfer discrepancy · 04-approximate-workspaces.tex, line 27
[Transfer discrepancy] The transfer discrepancy operator is D_H: C_V⟶ C_E, (D_Hc)_e = sqrtw_e(c_t(e)-H_ec_s(e)). Its squared norm is the coherence energy E_H(c) = D_Hc ^2 = ∑_e∈ Ew_e c_t(e)-H_ec_s(e) ^2. The transfer Laplacian is L_H=D_H^*D_H.
Exact mathematical passage
D_H:\mathcal C_V\longrightarrow\mathcal C_E, \qquad (D_Hc)_e = \sqrt{w_e}\bigl(c_{t(e)}-H_ec_{s(e)}\bigr).
D_H^*Definition passage · 10 passages
Search aliases: D_H^*
Definition passage: Transfer discrepancy · 04-approximate-workspaces.tex, line 46
[Transfer discrepancy] The transfer discrepancy operator is D_H: C_V⟶ C_E, (D_Hc)_e = sqrtw_e(c_t(e)-H_ec_s(e)). Its squared norm is the coherence energy E_H(c) = D_Hc ^2 = ∑_e∈ Ew_e c_t(e)-H_ec_s(e) ^2. The transfer Laplacian is L_H=D_H^*D_H.
Exact mathematical passage
\boxed{L_H=D_H^*D_H.}
d_\varepsilonDefinition passage · 7 passages
Search aliases: d_ε varepsilon
Definition passage: Threshold workspace · 04-approximate-workspaces.tex, line 184
[Threshold workspace] For ε≥0, define Γ_ε(H) = ran P_[0,ε](L_H). Its dimension is d_ε = #{k:λ_k≤ε}. When 0<d_ε<N, define the boundary gap g_ε = λ_d_ε+1-λ_d_ε.
Exact mathematical passage
d_\varepsilon = \#\{k:\lambda_k\leq\varepsilon\}.
\operatorname{do}Definition passage · 15 passages
Search aliases: do operatorname
Definition passage: Formation leakage · 14-scaffolded-and-endogenous-formation.tex, line 185
[Formation leakage] A certification variable Y_cert leaks into formation when the conditional law of widehatθ changes under an intervention on Y_cert that should be inaccessible during formation: L ( widehatθ mid do(Y_cert=y) ) ≠ L ( widehatθ mid do(Y_cert=y') ). A valid discovery claim requires a documented information barrier or an audit showing that this effect is absent up to tolerance.
Exact mathematical passage
\mathcal L \left( \widehat\theta \mid \operatorname{do}(Y_{\mathrm{cert}}=y) \right) \neq \mathcal L \left( \widehat\theta \mid \operatorname{do}(Y_{\mathrm{cert}}=y') \right).
\downarrowDefinition passage · 2 passages
Search aliases: downarrow
Definition passage: Exact operation-compatible transfer · 02-static-core-transfer-theory.tex, line 315
[Exact operation-compatible transfer] A core transfer H_e:C_i→ C_j is operation compatible when it is an intertwiner: H_eρ_i(a)=ρ_j(a)H_e ∀ a∈ A. Equivalently, the diagram ccc C_i · xrightarrowρ_i(a) · C_i downarrow H_e · · downarrow H_e C_j · xrightarrowρ_j(a) · C_j commutes for every a.
Exact mathematical passage
\begin{array}{ccc} C_i&\xrightarrow{\rho_i(a)}&C_i\\ \downarrow H_e&&\downarrow H_e\\ C_j&\xrightarrow{\rho_j(a)}&C_j \end{array}
EDefinition passage · 99 passages
Search aliases: E
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 29
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
G=(V,E,s,t)
\mathbb EDefinition passage · 43 passages
Search aliases: E mathbb
Definition passage: Causal formation sensitivity · 14-scaffolded-and-endogenous-formation.tex, line 264
[Causal formation sensitivity] Let ι_h and ι_h' be matched feasible interventions that alter formation history while preserving the scaffold, randomization law, sample size, and intervention cost. For a divergence D, define e_q^causal = E_(h,h')∼ν_q D ( L^ι_h(q), L^ι_h'(q) ). A common null uses temporally or relationally shuffled histories that preserve local marginals but destroy the candidate formation signal.
Exact mathematical passage
\boxed{ e_q^{\mathrm{causal}} = \mathbb E_{(h,h')\sim\nu_q} D\!\left( \mathcal L^{\iota_h}(q), \mathcal L^{\iota_{h'}}(q) \right). }
\mathcal EDefinition passage · 32 passages
Search aliases: E mathcal
Definition passage: Transfer discrepancy · 04-approximate-workspaces.tex, line 35
[Transfer discrepancy] The transfer discrepancy operator is D_H: C_V⟶ C_E, (D_Hc)_e = sqrtw_e(c_t(e)-H_ec_s(e)). Its squared norm is the coherence energy E_H(c) = D_Hc ^2 = ∑_e∈ Ew_e c_t(e)-H_ec_s(e) ^2. The transfer Laplacian is L_H=D_H^*D_H.
Exact mathematical passage
\boxed{ \mathcal E_H(c) = \|D_Hc\|^2 = \sum_{e\in E}w_e \left\|c_{t(e)}-H_ec_{s(e)}\right\|^2. }
eDefinition passage · 188 passages
Search aliases: e
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 31
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
\mathbf T=\{T_e\}_{e\in E}
\mathbb E_{(h,h')\sim\nu_q}Definition passage · 1 passage
Search aliases: E_(h,h')∼ν_q mathbb sim nu
Definition passage: Causal formation sensitivity · 14-scaffolded-and-endogenous-formation.tex, line 264
[Causal formation sensitivity] Let ι_h and ι_h' be matched feasible interventions that alter formation history while preserving the scaffold, randomization law, sample size, and intervention cost. For a divergence D, define e_q^causal = E_(h,h')∼ν_q D ( L^ι_h(q), L^ι_h'(q) ). A common null uses temporally or relationally shuffled histories that preserve local marginals but destroy the candidate formation signal.
Exact mathematical passage
\boxed{ e_q^{\mathrm{causal}} = \mathbb E_{(h,h')\sim\nu_q} D\!\left( \mathcal L^{\iota_h}(q), \mathcal L^{\iota_{h'}}(q) \right). }
\mathcal E_HDefinition passage · 11 passages
Search aliases: E_H mathcal
Definition passage: Transfer discrepancy · 04-approximate-workspaces.tex, line 35
[Transfer discrepancy] The transfer discrepancy operator is D_H: C_V⟶ C_E, (D_Hc)_e = sqrtw_e(c_t(e)-H_ec_s(e)). Its squared norm is the coherence energy E_H(c) = D_Hc ^2 = ∑_e∈ Ew_e c_t(e)-H_ec_s(e) ^2. The transfer Laplacian is L_H=D_H^*D_H.
Exact mathematical passage
\boxed{ \mathcal E_H(c) = \|D_Hc\|^2 = \sum_{e\in E}w_e \left\|c_{t(e)}-H_ec_{s(e)}\right\|^2. }
e_q^{\mathrm{causal}}Definition passage · 4 passages
Search aliases: e_q^causal mathrm
Definition passage: Causal formation sensitivity · 14-scaffolded-and-endogenous-formation.tex, line 264
[Causal formation sensitivity] Let ι_h and ι_h' be matched feasible interventions that alter formation history while preserving the scaffold, randomization law, sample size, and intervention cost. For a divergence D, define e_q^causal = E_(h,h')∼ν_q D ( L^ι_h(q), L^ι_h'(q) ). A common null uses temporally or relationally shuffled histories that preserve local marginals but destroy the candidate formation signal.
Exact mathematical passage
\boxed{ e_q^{\mathrm{causal}} = \mathbb E_{(h,h')\sim\nu_q} D\!\left( \mathcal L^{\iota_h}(q), \mathcal L^{\iota_{h'}}(q) \right). }
e_q^{\mathrm{MDL}}Definition passage · 3 passages
Search aliases: e_q^MDL mathrm
Definition passage: Code-relative history contribution · 14-scaffolded-and-endogenous-formation.tex, line 237
[Code-relative history contribution] Let M_q be a declared coding or predictive model class for a learned component q. Let L_ M_q(qmid Z) be its held-out codelength given side information Z. Define e_q^MDL = [ frac L_ M_q(qmidΣ) - L_ M_q(qmidΣ, D_form) max{L_ M_q(qmidΣ),1} ]_0^1, where [x]_0^1=min{1,max{0,x}}.
Exact mathematical passage
\boxed{ e_q^{\mathrm{MDL}} = \left[ \frac{ L_{\mathfrak M_q}(q\mid\Sigma) - L_{\mathfrak M_q}(q\mid\Sigma,\mathcal D_{\mathrm{form}}) }{ \max\{L_{\mathfrak M_q}(q\mid\Sigma),1\} } \right]_{0}^{1}, }
E_tDefinition passage · 10 passages
Search aliases: E_t
Definition passage: Dynamic relational realization · 06-dynamic-workspace-theory.tex, line 18
[Dynamic relational realization] A dynamic relational realization is defined on a probability space (Ω, F, P) and consists of: item node states X_i(t)∈ X_i for i∈ V; item edge messages M_e(t)∈ M_e for e∈ E; item external inputs E_t, local actions A_i(t), and disturbances ξ_i(t),ζ_e(t); item time-dependent transfer data H_e(t), local core vectors c_i(t), and transfer Laplacians L_t=L_H(t); and item a future target Y_t^+∈ Y. All state, history, and target spaces are assumed standard Borel unless a…
Exact mathematical passage
E_t
E_\alphaDefinition passage · 2 passages
Search aliases: E_α alpha
Definition passage: Finite workspace cover · 13-gluing-and-workspaces-of-workspaces.tex, line 38
[Finite workspace cover] A finite family of subgraphs U={G_α}_α∈ A is an edge-complete workspace cover of G when V=⋃_α∈ AV_α, E=⋃_α∈ AE_α. Every edge in E_α carries the transfer inherited from G. For a nonempty finite index set I={α_0,…,α_p}⊆ A, define the intersection subgraph G_I = G_α_0⋯α_p := ⋂_α∈ IG_α by intersecting both vertex and edge sets. Isolated vertices are retained.
Exact mathematical passage
V=\bigcup_{\alpha\in A}V_\alpha, \qquad E=\bigcup_{\alpha\in A}E_\alpha.
FDefinition passage · 47 passages
Search aliases: F
Definition passage: Admissible equivalence · 01-foundational-thesis.tex, line 67
[Admissible equivalence] An admissible equivalence F: R≃ R' is a family of correspondences preserving, exactly or within a declared tolerance: · the transferable core and its dimension,
Exact mathematical passage
F:\mathfrak R\simeq\mathfrak R'
\mathbb FDefinition passage · 3 passages
Search aliases: F mathbb
Definition passage: Operation algebra · 02-static-core-transfer-theory.tex, line 291
[Operation algebra] Let F∈{ R, C}. An operation algebra A is a unital associative F-algebra whose elements represent abstract transformations, inferential rules, questions, or procedures that can be realized in multiple strata.
Exact mathematical passage
\mathbb F\in\{\mathbb R,\mathbb C\}
\mathcal FDefinition passage · 6 passages
Search aliases: F mathcal
Definition passage: Dynamic relational realization · 06-dynamic-workspace-theory.tex, line 14
[Dynamic relational realization] A dynamic relational realization is defined on a probability space (Ω, F, P) and consists of: item node states X_i(t)∈ X_i for i∈ V; item edge messages M_e(t)∈ M_e for e∈ E; item external inputs E_t, local actions A_i(t), and disturbances ξ_i(t),ζ_e(t); item time-dependent transfer data H_e(t), local core vectors c_i(t), and transfer Laplacians L_t=L_H(t); and item a future target Y_t^+∈ Y. All state, history, and target spaces are assumed standard Borel unless a…
Exact mathematical passage
(\Omega,\mathcal F,\mathbb P)
\mathfrak FDefinition passage · 1 passage
Search aliases: F mathfrak
Definition passage: Formation system · 14-scaffolded-and-endogenous-formation.tex, line 15
[Formation system] A workspace formation system is a tuple F = ( Σ, D_form, L, Ω, widehatθ, D_cert, I_form ), where: item Σ is the externally supplied scaffold; item D_form is the formation or training history; item L is the learning or selection rule; item Ω is its internal random seed or stochastic state; item widehatθ= L(Σ, D_form,Ω) is the learned organization; item D_cert is held-out certification data; and item I_form is a declared family of interventions on scaffold and formation history.…
Exact mathematical passage
\mathfrak F = \bigl( \Sigma, \mathcal D_{\mathrm{form}}, \mathcal L, \Omega, \widehat\theta, \mathcal D_{\mathrm{cert}}, \mathcal I_{\mathrm{form}} \bigr),
fDefinition passage · 50 passages
Search aliases: f
Definition passage: Refinement and coarsening · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 66
[Refinement and coarsening] Let D_f and D_c be decompositions of the same carrier presentation. The fine decomposition refines the coarse decomposition, written D_fpreceq D_c, when there is a surjection q:V_f⟶ V_c such that each coarse component is the union of the fine components in one fiber of q, and its accessible information is generated only from those fine components. The aggregation is information faithful when mathscr F_B^ D_c = bigvee_i∈ q^-1(B) mathscr F_i^ D_f (B∈ V_c). It is structu…
Exact mathematical passage
\mathcal D_f
F_B^{\mathcal D_c}Definition passage · 1 passage
Search aliases: F_B^ D_c mathcal
Definition passage: Refinement and coarsening · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 79
r presentation. The fine decomposition refines the coarse decomposition, written D_fpreceq D_c, when there is a surjection q:V_f⟶ V_c such that each coarse component is the union of the fine components in one fiber of q, and its accessible information is generated only from those fine components. The aggregation is information faithful when mathscr F_B^ D_c = bigvee_i∈ q^-1(B) mathscr F_i^ D_f (B∈ V_c). It is structurally faithful when it also retains every internal compatibility condition and e…
Exact mathematical passage
\mathscr F_B^{\mathcal D_c} = \bigvee_{i\in q^{-1}(B)} \mathscr F_i^{\mathcal D_f} \qquad(B\in V_c).
F_i^{\mathcal D_f}Definition passage · 2 passages
Search aliases: F_i^ D_f mathcal
Definition passage: Refinement and coarsening · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 79
r presentation. The fine decomposition refines the coarse decomposition, written D_fpreceq D_c, when there is a surjection q:V_f⟶ V_c such that each coarse component is the union of the fine components in one fiber of q, and its accessible information is generated only from those fine components. The aggregation is information faithful when mathscr F_B^ D_c = bigvee_i∈ q^-1(B) mathscr F_i^ D_f (B∈ V_c). It is structurally faithful when it also retains every internal compatibility condition and e…
Exact mathematical passage
\mathscr F_B^{\mathcal D_c} = \bigvee_{i\in q^{-1}(B)} \mathscr F_i^{\mathcal D_f} \qquad(B\in V_c).
F_\alpha^{\mathcal D}Definition passage · 1 passage
Search aliases: F_α^ D alpha mathcal
Definition passage: System decomposition · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 43
declared local-access map for block B_α, producing the local state or history available at that component; item G_Π records the declared communication, transfer, and causal interfaces among the blocks; and item I_Π is the family of feasible interventions at that resolution. The accessible information of component α is the sigma-field mathscr F_α^ D = σ (O_α( H_t)). Every shared bus, common memory, supervisor, or artifact that can alter more than one local state must appear either as its own carr…
Exact mathematical passage
\mathscr F_\alpha^{\mathcal D} = \sigma\!\left(O_\alpha(\mathbf H_t)\right).
\mathrm{form}Definition passage · 24 passages
Search aliases: form mathrm
Definition passage: Formation system · 14-scaffolded-and-endogenous-formation.tex, line 15
[Formation system] A workspace formation system is a tuple F = ( Σ, D_form, L, Ω, widehatθ, D_cert, I_form ), where: item Σ is the externally supplied scaffold; item D_form is the formation or training history; item L is the learning or selection rule; item Ω is its internal random seed or stochastic state; item widehatθ= L(Σ, D_form,Ω) is the learned organization; item D_cert is held-out certification data; and item I_form is a declared family of interventions on scaffold and formation history.…
Exact mathematical passage
\mathfrak F = \bigl( \Sigma, \mathcal D_{\mathrm{form}}, \mathcal L, \Omega, \widehat\theta, \mathcal D_{\mathrm{cert}}, \mathcal I_{\mathrm{form}} \bigr),
\mathcal GDefinition passage · 14 passages
Search aliases: G mathcal
Definition passage: Boundary problem · 15-boundary-formation-and-stability.tex, line 13
[Boundary problem] A boundary problem is a tuple B = ( V, S, τ, Y, I, Π, G_B ), where S⊆2^V is the admissible candidate family, τ is the temporal scale, Y is the operational target, I is the feasible intervention family, Π is the environment distribution, and G_B is a symmetry group under which boundaries are considered equivalent.
Exact mathematical passage
\mathfrak B = \left( V, \mathfrak S, \tau, \mathcal Y, \mathcal I, \Pi, \mathcal G_B \right),
\mathcal G_BDefinition passage · 4 passages
Search aliases: G_B mathcal
Definition passage: Boundary problem · 15-boundary-formation-and-stability.tex, line 13
[Boundary problem] A boundary problem is a tuple B = ( V, S, τ, Y, I, Π, G_B ), where S⊆2^V is the admissible candidate family, τ is the temporal scale, Y is the operational target, I is the feasible intervention family, Π is the environment distribution, and G_B is a symmetry group under which boundaries are considered equivalent.
Exact mathematical passage
\mathfrak B = \left( V, \mathfrak S, \tau, \mathcal Y, \mathcal I, \Pi, \mathcal G_B \right),
G_IDefinition passage · 1 passage
Search aliases: G_I
Definition passage: Finite workspace cover · 13-gluing-and-workspaces-of-workspaces.tex, line 49
ver A finite family of subgraphs U={G_α}_α∈ A is an edge-complete workspace cover of G when V=⋃_α∈ AV_α, E=⋃_α∈ AE_α. Every edge in E_α carries the transfer inherited from G. For a nonempty finite index set I={α_0,…,α_p}⊆ A, define the intersection subgraph G_I = G_α_0⋯α_p := ⋂_α∈ IG_α by intersecting both vertex and edge sets. Isolated vertices are retained.
Exact mathematical passage
G_I = G_{\alpha_0\cdots\alpha_p} := \bigcap_{\alpha\in I}G_\alpha
g_iDefinition passage · 8 passages
Search aliases: g_i
Definition passage: Exact static equivalence · 05-gauge-invariance-and-abstract-identity.tex, line 207
[Exact static equivalence] Two static realizations are exactly gauge equivalent, R∼_stat R', when there exists an invertible family g_i such that H_e'=g_t(e)H_eg_s(e)^-1, ρ_i'(a)=g_iρ_i(a)g_i^-1. The exact static abstract workspace is Workspace_stat = [ R]_∼_stat.
Exact mathematical passage
g_i
g_i^{-1}Definition passage · 4 passages
Search aliases: g_i^-1
Definition passage: Exact static equivalence · 05-gauge-invariance-and-abstract-identity.tex, line 208
[Exact static equivalence] Two static realizations are exactly gauge equivalent, R∼_stat R', when there exists an invertible family g_i such that H_e'=g_t(e)H_eg_s(e)^-1, ρ_i'(a)=g_iρ_i(a)g_i^-1. The exact static abstract workspace is Workspace_stat = [ R]_∼_stat.
Exact mathematical passage
H_e'=g_{t(e)}H_eg_{s(e)}^{-1}, \qquad \rho_i'(a)=g_i\rho_i(a)g_i^{-1}.
g_{s(e)}^{-1}Definition passage · 4 passages
Search aliases: g_s(e)^-1
Definition passage: Exact static equivalence · 05-gauge-invariance-and-abstract-identity.tex, line 208
[Exact static equivalence] Two static realizations are exactly gauge equivalent, R∼_stat R', when there exists an invertible family g_i such that H_e'=g_t(e)H_eg_s(e)^-1, ρ_i'(a)=g_iρ_i(a)g_i^-1. The exact static abstract workspace is Workspace_stat = [ R]_∼_stat.
Exact mathematical passage
H_e'=g_{t(e)}H_eg_{s(e)}^{-1}, \qquad \rho_i'(a)=g_i\rho_i(a)g_i^{-1}.
g_{t(e)}Definition passage · 6 passages
Search aliases: g_t(e)
Definition passage: Exact static equivalence · 05-gauge-invariance-and-abstract-identity.tex, line 208
[Exact static equivalence] Two static realizations are exactly gauge equivalent, R∼_stat R', when there exists an invertible family g_i such that H_e'=g_t(e)H_eg_s(e)^-1, ρ_i'(a)=g_iρ_i(a)g_i^-1. The exact static abstract workspace is Workspace_stat = [ R]_∼_stat.
Exact mathematical passage
H_e'=g_{t(e)}H_eg_{s(e)}^{-1}, \qquad \rho_i'(a)=g_i\rho_i(a)g_i^{-1}.
G_\alphaDefinition passage · 15 passages
Search aliases: G_α alpha
Definition passage: Finite workspace cover · 13-gluing-and-workspaces-of-workspaces.tex, line 34
[Finite workspace cover] A finite family of subgraphs U={G_α}_α∈ A is an edge-complete workspace cover of G when V=⋃_α∈ AV_α, E=⋃_α∈ AE_α. Every edge in E_α carries the transfer inherited from G. For a nonempty finite index set I={α_0,…,α_p}⊆ A, define the intersection subgraph G_I = G_α_0⋯α_p := ⋂_α∈ IG_α by intersecting both vertex and edge sets. Isolated vertices are retained.
Exact mathematical passage
\mathcal U=\{G_\alpha\}_{\alpha\in A}
G_{\alpha_0\cdots\alpha_p}Definition passage · 3 passages
Search aliases: G_α_0⋯α_p alpha cdots alpha
Definition passage: Finite workspace cover · 13-gluing-and-workspaces-of-workspaces.tex, line 49
ver A finite family of subgraphs U={G_α}_α∈ A is an edge-complete workspace cover of G when V=⋃_α∈ AV_α, E=⋃_α∈ AE_α. Every edge in E_α carries the transfer inherited from G. For a nonempty finite index set I={α_0,…,α_p}⊆ A, define the intersection subgraph G_I = G_α_0⋯α_p := ⋂_α∈ IG_α by intersecting both vertex and edge sets. Isolated vertices are retained.
Exact mathematical passage
G_I = G_{\alpha_0\cdots\alpha_p} := \bigcap_{\alpha\in I}G_\alpha
g_\varepsilonDefinition passage · 3 passages
Search aliases: g_ε varepsilon
Definition passage: Threshold workspace · 04-approximate-workspaces.tex, line 190
[Threshold workspace] For ε≥0, define Γ_ε(H) = ran P_[0,ε](L_H). Its dimension is d_ε = #{k:λ_k≤ε}. When 0<d_ε<N, define the boundary gap g_ε = λ_d_ε+1-λ_d_ε.
Exact mathematical passage
\boxed{ g_\varepsilon = \lambda_{d_\varepsilon+1}-\lambda_{d_\varepsilon}. }
G_{\Pi}Definition passage · 3 passages
Search aliases: G_Π Pi
Definition passage: System decomposition · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 25
[System decomposition] A decomposition of a carrier presentation is a tuple D = ( Π, O,G_Π, I_Π ), where: item Π={B_α}_α∈ A is a partition of Ω; item O_α is the declared local-access map for block B_α, producing the local state or history available at that component; item G_Π records the declared communication, transfer, and causal interfaces among the blocks; and item I_Π is the family of feasible interventions at that resolution. The accessible information of component α is the sigma-field mat…
Exact mathematical passage
\mathcal D = \bigl( \Pi,\mathbf O,G_{\Pi},\mathcal I_{\Pi} \bigr),
HDefinition passage · 275 passages
Search aliases: H
Definition passage: Exact core-transfer system · 02-static-core-transfer-theory.tex, line 272
[Exact core-transfer system] An exact core-transfer system on G consists of: item decompositions X_i=C_i⊕ R_i; item core-preserving edge maps V_e=0; and item invertible core blocks H_e∈ GL(C_s(e),C_t(e)) whenever holonomy is invoked.
Exact mathematical passage
H_e\in GL(C_{s(e)},C_{t(e)})
\mathbf HDefinition passage · 82 passages
Search aliases: H mathbf
Definition passage: Predictive kernel and canonical state · 06-dynamic-workspace-theory.tex, line 123
[Predictive kernel and canonical state] Let H_t and Y be standard Borel spaces. A regular conditional kernel is a measurable map K_t: H_t× B( Y)→[0,1] satisfying K_t(h,A) = P(Y_t^+∈ Amid H_t=h) for P_ H_t-almost every h. Let P( Y) carry its evaluation sigma-algebra. The canonical predictive state is the random probability measure Z_t = K_t( H_t,·) ∈ P( Y). Two histories are predictively equivalent precisely when they induce the same conditional law of Y_t^+.
Exact mathematical passage
K_t(h,A) = \mathbb P(Y_t^+\in A\mid\mathbf H_t=h)
\mathcal HDefinition passage · 13 passages
Search aliases: H mathcal
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 19
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
\mathfrak R = \bigl( G,\mathbf X,\mathbf T,\mathcal A,\boldsymbol\rho, \mathcal H,\mathcal I,\mathcal Y \bigr),
\mathsf HDefinition passage · 3 passages
Search aliases: H mathsf
Definition passage: Predictive kernel and canonical state · 06-dynamic-workspace-theory.tex, line 117
[Predictive kernel and canonical state] Let H_t and Y be standard Borel spaces. A regular conditional kernel is a measurable map K_t: H_t× B( Y)→[0,1] satisfying K_t(h,A) = P(Y_t^+∈ Amid H_t=h) for P_ H_t-almost every h. Let P( Y) carry its evaluation sigma-algebra. The canonical predictive state is the random probability measure Z_t = K_t( H_t,·) ∈ P( Y). Two histories are predictively equivalent precisely when they induce the same conditional law of Y_t^+.
Exact mathematical passage
\mathsf H_t
hDefinition passage · 49 passages
Search aliases: h
Definition passage: Predictive kernel and canonical state · 06-dynamic-workspace-theory.tex, line 123
[Predictive kernel and canonical state] Let H_t and Y be standard Borel spaces. A regular conditional kernel is a measurable map K_t: H_t× B( Y)→[0,1] satisfying K_t(h,A) = P(Y_t^+∈ Amid H_t=h) for P_ H_t-almost every h. Let P( Y) carry its evaluation sigma-algebra. The canonical predictive state is the random probability measure Z_t = K_t( H_t,·) ∈ P( Y). Two histories are predictively equivalent precisely when they induce the same conditional law of Y_t^+.
Exact mathematical passage
K_t(h,A) = \mathbb P(Y_t^+\in A\mid\mathbf H_t=h)
h'Definition passage · 3 passages
Search aliases: h'
Definition passage: Causal formation sensitivity · 14-scaffolded-and-endogenous-formation.tex, line 261
[Causal formation sensitivity] Let ι_h and ι_h' be matched feasible interventions that alter formation history while preserving the scaffold, randomization law, sample size, and intervention cost. For a divergence D, define e_q^causal = E_(h,h')∼ν_q D ( L^ι_h(q), L^ι_h'(q) ). A common null uses temporally or relationally shuffled histories that preserve local marginals but destroy the candidate formation signal.
Exact mathematical passage
\iota_{h'}
H^0Definition passage · 2 passages
Search aliases: H^0
Definition passage: Descent-faithful compression · 13-gluing-and-workspaces-of-workspaces.tex, line 801
[Descent-faithful compression] The compression is descent-faithful in degree zero when the induced map H^0(Q): kerδ^0 ⟶ keroverlineδ^0 is an isomorphism.
Exact mathematical passage
\boxed{ H^0(Q): \ker\delta^0 \longrightarrow \ker\overline\delta^0 }
H_eDefinition passage · 43 passages
Search aliases: H_e
Definition passage: Exact core-transfer system · 02-static-core-transfer-theory.tex, line 272
[Exact core-transfer system] An exact core-transfer system on G consists of: item decompositions X_i=C_i⊕ R_i; item core-preserving edge maps V_e=0; and item invertible core blocks H_e∈ GL(C_s(e),C_t(e)) whenever holonomy is invoked.
Exact mathematical passage
H_e\in GL(C_{s(e)},C_{t(e)})
H_e'Definition passage · 2 passages
Search aliases: H_e'
Definition passage: Exact static equivalence · 05-gauge-invariance-and-abstract-identity.tex, line 208
[Exact static equivalence] Two static realizations are exactly gauge equivalent, R∼_stat R', when there exists an invertible family g_i such that H_e'=g_t(e)H_eg_s(e)^-1, ρ_i'(a)=g_iρ_i(a)g_i^-1. The exact static abstract workspace is Workspace_stat = [ R]_∼_stat.
Exact mathematical passage
H_e'=g_{t(e)}H_eg_{s(e)}^{-1}, \qquad \rho_i'(a)=g_i\rho_i(a)g_i^{-1}.
\mathbf H_tDefinition passage · 55 passages
Search aliases: H_t mathbf
Definition passage: Predictive kernel and canonical state · 06-dynamic-workspace-theory.tex, line 123
[Predictive kernel and canonical state] Let H_t and Y be standard Borel spaces. A regular conditional kernel is a measurable map K_t: H_t× B( Y)→[0,1] satisfying K_t(h,A) = P(Y_t^+∈ Amid H_t=h) for P_ H_t-almost every h. Let P( Y) carry its evaluation sigma-algebra. The canonical predictive state is the random probability measure Z_t = K_t( H_t,·) ∈ P( Y). Two histories are predictively equivalent precisely when they induce the same conditional law of Y_t^+.
Exact mathematical passage
K_t(h,A) = \mathbb P(Y_t^+\in A\mid\mathbf H_t=h)
\mathsf H_tDefinition passage · 2 passages
Search aliases: H_t mathsf
Definition passage: Predictive kernel and canonical state · 06-dynamic-workspace-theory.tex, line 117
[Predictive kernel and canonical state] Let H_t and Y be standard Borel spaces. A regular conditional kernel is a measurable map K_t: H_t× B( Y)→[0,1] satisfying K_t(h,A) = P(Y_t^+∈ Amid H_t=h) for P_ H_t-almost every h. Let P( Y) carry its evaluation sigma-algebra. The canonical predictive state is the random probability measure Z_t = K_t( H_t,·) ∈ P( Y). Two histories are predictively equivalent precisely when they induce the same conditional law of Y_t^+.
Exact mathematical passage
\mathsf H_t
IDefinition passage · 83 passages
Search aliases: I
Definition passage: Admissible local decomposition · 02-static-core-transfer-theory.tex, line 129
[Admissible local decomposition] For every vertex i, choose an orthogonal decomposition X_i=C_i⊕ R_i, with projectors P_i:X_i→ C_i, Q_i=I-P_i:X_i→ R_i. The subspace C_i is the candidate locally realized transferable core. The subspace R_i contains substrate-specific, context-specific, or otherwise noncore degrees of freedom relative to the present analysis.
Exact mathematical passage
P_i:X_i\to C_i, \qquad Q_i=I-P_i:X_i\to R_i.
\mathcal IDefinition passage · 61 passages
Search aliases: I mathcal
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 19
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
\mathfrak R = \bigl( G,\mathbf X,\mathbf T,\mathcal A,\boldsymbol\rho, \mathcal H,\mathcal I,\mathcal Y \bigr),
iDefinition passage · 196 passages
Search aliases: i
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 30
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
\mathbf X=\{X_i\}_{i\in V}
\mathcal I_{\mathrm{form}}Definition passage · 3 passages
Search aliases: I_form mathcal mathrm
Definition passage: Formation system · 14-scaffolded-and-endogenous-formation.tex, line 15
[Formation system] A workspace formation system is a tuple F = ( Σ, D_form, L, Ω, widehatθ, D_cert, I_form ), where: item Σ is the externally supplied scaffold; item D_form is the formation or training history; item L is the learning or selection rule; item Ω is its internal random seed or stochastic state; item widehatθ= L(Σ, D_form,Ω) is the learned organization; item D_cert is held-out certification data; and item I_form is a declared family of interventions on scaffold and formation history.…
Exact mathematical passage
\mathfrak F = \bigl( \Sigma, \mathcal D_{\mathrm{form}}, \mathcal L, \Omega, \widehat\theta, \mathcal D_{\mathrm{cert}}, \mathcal I_{\mathrm{form}} \bigr),
\mathcal I_{\Pi}Definition passage · 2 passages
Search aliases: I_Π mathcal Pi
Definition passage: System decomposition · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 25
[System decomposition] A decomposition of a carrier presentation is a tuple D = ( Π, O,G_Π, I_Π ), where: item Π={B_α}_α∈ A is a partition of Ω; item O_α is the declared local-access map for block B_α, producing the local state or history available at that component; item G_Π records the declared communication, transfer, and causal interfaces among the blocks; and item I_Π is the family of feasible interventions at that resolution. The accessible information of component α is the sigma-field mat…
Exact mathematical passage
\mathcal D = \bigl( \Pi,\mathbf O,G_{\Pi},\mathcal I_{\Pi} \bigr),
\mathrm{ID}Definition passage · 8 passages
Search aliases: ID mathrm
Definition passage: Identified realization set · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 560
[Identified realization set] Given an experimental law P^ E and model class M, define R_ID (P^ E; M) = { R∈ M: P_ R^ E=P^ E }. For a gate q and specification ς, its identified margin set is M_q^ID (P^ E;ς) = { m_q(W_ R;ς): R∈ R_ID }.
Exact mathematical passage
\boxed{ \mathfrak R_{\mathrm{ID}} (P^{\mathcal E};\mathfrak M) = \left\{ \mathfrak R\in\mathfrak M: P_{\mathfrak R}^{\mathcal E}=P^{\mathcal E} \right\}. }
\infDefinition passage · 27 passages
Search aliases: inf
Definition passage: Decomposition-robust certificate · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 451
[Decomposition-robust certificate] A workspace passes the D-robust certificate at level L when Certify_L, D^rob(W) = bigwedge_q∈ J(L) { inf_ D∈ D m_q(W; D)>0 }. A pass for one selected decomposition is a decomposition-specific claim. A pass throughout D is a family-robust claim. A claim is decomposition fragile when at least one required gate changes sign inside the admissible family.
Exact mathematical passage
\boxed{ \operatorname{Certify}_{L,\mathfrak D}^{\mathrm{rob}}(W) = \bigwedge_{q\in\mathcal J(L)} \left\{ \inf_{\mathcal D\in\mathfrak D} m_q(W;\mathcal D)>0 \right\}. }
\inf_{\mathcal D\in\mathfrak D}Definition passage · 3 passages
Search aliases: inf_ D∈ D inf mathcal in mathfrak
Definition passage: Decomposition-robust certificate · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 451
[Decomposition-robust certificate] A workspace passes the D-robust certificate at level L when Certify_L, D^rob(W) = bigwedge_q∈ J(L) { inf_ D∈ D m_q(W; D)>0 }. A pass for one selected decomposition is a decomposition-specific claim. A pass throughout D is a family-robust claim. A claim is decomposition fragile when at least one required gate changes sign inside the admissible family.
Exact mathematical passage
\boxed{ \operatorname{Certify}_{L,\mathfrak D}^{\mathrm{rob}}(W) = \bigwedge_{q\in\mathcal J(L)} \left\{ \inf_{\mathcal D\in\mathfrak D} m_q(W;\mathcal D)>0 \right\}. }
JDefinition passage · 75 passages
Search aliases: J
Definition passage: Exact structural correspondence · 12-identity-through-time-and-replacement.tex, line 35
[Exact structural correspondence] The correspondence is structurally exact when D'J_V=J_ED. It is operation exact for a∈ A when ρ_V'(a)J_V=J_Vρ_V(a).
Exact mathematical passage
\boxed{D'J_V=J_ED.}
\mathcal JDefinition passage · 25 passages
Search aliases: J mathcal
Definition passage: Decomposition-robust certificate · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 451
[Decomposition-robust certificate] A workspace passes the D-robust certificate at level L when Certify_L, D^rob(W) = bigwedge_q∈ J(L) { inf_ D∈ D m_q(W; D)>0 }. A pass for one selected decomposition is a decomposition-specific claim. A pass throughout D is a family-robust claim. A claim is decomposition fragile when at least one required gate changes sign inside the admissible family.
Exact mathematical passage
\boxed{ \operatorname{Certify}_{L,\mathfrak D}^{\mathrm{rob}}(W) = \bigwedge_{q\in\mathcal J(L)} \left\{ \inf_{\mathcal D\in\mathfrak D} m_q(W;\mathcal D)>0 \right\}. }
jDefinition passage · 53 passages
Search aliases: j
Definition passage: Interaction graph · 02-static-core-transfer-theory.tex, line 14
[Interaction graph] Let G=(V,E,s,t) be a finite directed multigraph. Parallel edges and self-loops are allowed. The vertex set indexes strata, participants, artifacts, models, instruments, or subworkspaces. An edge e:i→ j denotes an admissible directed translation or influence channel from i to j.
Exact mathematical passage
e:i\to j
\mathcal J_*Definition passage · 15 passages
Search aliases: J_* mathcal
Definition passage: Specification leakage · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 910
[Specification leakage] Specification leakage occurs when certification outcomes influence any of the following without a fresh inferential correction: Y^+, ℓ, τ, I, N, Θ, S, J_*. The leakage status is separate from formation leakage. A workspace extractor may be frozen while the analyst still searches over targets or thresholds on the certification split.
Exact mathematical passage
Y^+, \ell, \tau, \mathcal I, \mathcal N, \Theta, \mathfrak S, \mathcal J_*.
J_EDefinition passage · 8 passages
Search aliases: J_E
Definition passage: Exact structural correspondence · 12-identity-through-time-and-replacement.tex, line 35
[Exact structural correspondence] The correspondence is structurally exact when D'J_V=J_ED. It is operation exact for a∈ A when ρ_V'(a)J_V=J_Vρ_V(a).
Exact mathematical passage
\boxed{D'J_V=J_ED.}
J_VDefinition passage · 24 passages
Search aliases: J_V
Definition passage: Exact structural correspondence · 12-identity-through-time-and-replacement.tex, line 35
[Exact structural correspondence] The correspondence is structurally exact when D'J_V=J_ED. It is operation exact for a∈ A when ρ_V'(a)J_V=J_Vρ_V(a).
Exact mathematical passage
\boxed{D'J_V=J_ED.}
KDefinition passage · 67 passages
Search aliases: K
Definition passage: Predictive kernel and canonical state · 06-dynamic-workspace-theory.tex, line 119
[Predictive kernel and canonical state] Let H_t and Y be standard Borel spaces. A regular conditional kernel is a measurable map K_t: H_t× B( Y)→[0,1] satisfying K_t(h,A) = P(Y_t^+∈ Amid H_t=h) for P_ H_t-almost every h. Let P( Y) carry its evaluation sigma-algebra. The canonical predictive state is the random probability measure Z_t = K_t( H_t,·) ∈ P( Y). Two histories are predictively equivalent precisely when they induce the same conditional law of Y_t^+.
Exact mathematical passage
K_t:\mathsf H_t\times\mathcal B(\mathsf Y)\to[0,1]
\mathfrak KDefinition passage · 4 passages
Search aliases: K mathfrak
Definition passage: Case-study realization · 22-integrated-worked-examples-and-case-studies.tex, line 27
[Case-study realization] A case-study realization is a tuple K = ( R, B, C, P, E, D, S, I, Q, G ), where: item R is the declared relational realization; item B is the boundary problem and component decomposition; item C is the structural core--transfer model; item P is the downstream predictive or control problem; item E is the evidence or generated-data family; item D is the admissible decomposition family; item S is the admissible family of complete scientific specifications, including targets…
Exact mathematical passage
\mathfrak K = \bigl( \mathfrak R, \mathfrak B, \mathfrak C, \mathfrak P, \mathcal E, \mathfrak D, \mathfrak S, \mathcal I, \mathcal Q, \mathcal G \bigr),
kDefinition passage · 98 passages
Search aliases: k
Definition passage: Threshold workspace · 04-approximate-workspaces.tex, line 184
[Threshold workspace] For ε≥0, define Γ_ε(H) = ran P_[0,ε](L_H). Its dimension is d_ε = #{k:λ_k≤ε}. When 0<d_ε<N, define the boundary gap g_ε = λ_d_ε+1-λ_d_ε.
Exact mathematical passage
d_\varepsilon = \#\{k:\lambda_k\leq\varepsilon\}.
K_tDefinition passage · 8 passages
Search aliases: K_t
Definition passage: Predictive kernel and canonical state · 06-dynamic-workspace-theory.tex, line 119
[Predictive kernel and canonical state] Let H_t and Y be standard Borel spaces. A regular conditional kernel is a measurable map K_t: H_t× B( Y)→[0,1] satisfying K_t(h,A) = P(Y_t^+∈ Amid H_t=h) for P_ H_t-almost every h. Let P( Y) carry its evaluation sigma-algebra. The canonical predictive state is the random probability measure Z_t = K_t( H_t,·) ∈ P( Y). Two histories are predictively equivalent precisely when they induce the same conditional law of Y_t^+.
Exact mathematical passage
K_t:\mathsf H_t\times\mathcal B(\mathsf Y)\to[0,1]
\kerDefinition passage · 48 passages
Search aliases: ker
Definition passage: Descent-faithful compression · 13-gluing-and-workspaces-of-workspaces.tex, line 801
[Descent-faithful compression] The compression is descent-faithful in degree zero when the induced map H^0(Q): kerδ^0 ⟶ keroverlineδ^0 is an isomorphism.
Exact mathematical passage
\boxed{ H^0(Q): \ker\delta^0 \longrightarrow \ker\overline\delta^0 }
LDefinition passage · 150 passages
Search aliases: L
Definition passage: Exact core-transfer system · 02-static-core-transfer-theory.tex, line 272
[Exact core-transfer system] An exact core-transfer system on G consists of: item decompositions X_i=C_i⊕ R_i; item core-preserving edge maps V_e=0; and item invertible core blocks H_e∈ GL(C_s(e),C_t(e)) whenever holonomy is invoked.
Exact mathematical passage
H_e\in GL(C_{s(e)},C_{t(e)})
\mathcal LDefinition passage · 12 passages
Search aliases: L mathcal
Definition passage: Formation system · 14-scaffolded-and-endogenous-formation.tex, line 15
[Formation system] A workspace formation system is a tuple F = ( Σ, D_form, L, Ω, widehatθ, D_cert, I_form ), where: item Σ is the externally supplied scaffold; item D_form is the formation or training history; item L is the learning or selection rule; item Ω is its internal random seed or stochastic state; item widehatθ= L(Σ, D_form,Ω) is the learned organization; item D_cert is held-out certification data; and item I_form is a declared family of interventions on scaffold and formation history.…
Exact mathematical passage
\mathfrak F = \bigl( \Sigma, \mathcal D_{\mathrm{form}}, \mathcal L, \Omega, \widehat\theta, \mathcal D_{\mathrm{cert}}, \mathcal I_{\mathrm{form}} \bigr),
\mathcal L^{\iota_h}Definition passage · 1 passage
Search aliases: L^ι_h mathcal iota
Definition passage: Causal formation sensitivity · 14-scaffolded-and-endogenous-formation.tex, line 264
[Causal formation sensitivity] Let ι_h and ι_h' be matched feasible interventions that alter formation history while preserving the scaffold, randomization law, sample size, and intervention cost. For a divergence D, define e_q^causal = E_(h,h')∼ν_q D ( L^ι_h(q), L^ι_h'(q) ). A common null uses temporally or relationally shuffled histories that preserve local marginals but destroy the candidate formation signal.
Exact mathematical passage
\boxed{ e_q^{\mathrm{causal}} = \mathbb E_{(h,h')\sim\nu_q} D\!\left( \mathcal L^{\iota_h}(q), \mathcal L^{\iota_{h'}}(q) \right). }
\mathcal L^{\iota_{h'}}Definition passage · 1 passage
Search aliases: L^ι_h' mathcal iota
Definition passage: Causal formation sensitivity · 14-scaffolded-and-endogenous-formation.tex, line 264
[Causal formation sensitivity] Let ι_h and ι_h' be matched feasible interventions that alter formation history while preserving the scaffold, randomization law, sample size, and intervention cost. For a divergence D, define e_q^causal = E_(h,h')∼ν_q D ( L^ι_h(q), L^ι_h'(q) ). A common null uses temporally or relationally shuffled histories that preserve local marginals but destroy the candidate formation signal.
Exact mathematical passage
\boxed{ e_q^{\mathrm{causal}} = \mathbb E_{(h,h')\sim\nu_q} D\!\left( \mathcal L^{\iota_h}(q), \mathcal L^{\iota_{h'}}(q) \right). }
L_{\mathfrak M_q}Definition passage · 2 passages
Search aliases: L_ M_q mathfrak
Definition passage: Code-relative history contribution · 14-scaffolded-and-endogenous-formation.tex, line 233
[Code-relative history contribution] Let M_q be a declared coding or predictive model class for a learned component q. Let L_ M_q(qmid Z) be its held-out codelength given side information Z. Define e_q^MDL = [ frac L_ M_q(qmidΣ) - L_ M_q(qmidΣ, D_form) max{L_ M_q(qmidΣ),1} ]_0^1, where [x]_0^1=min{1,max{0,x}}.
Exact mathematical passage
L_{\mathfrak M_q}(q\mid Z)
\mathcal L_{\mathfrak R}Definition passage · 1 passage
Search aliases: L_ R mathcal mathfrak
Definition passage: Experimental design and induced law · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 417
efinition[Experimental design and induced law] An experimental design is a tuple E = ( O, I, T), where O is the observation map, I is the family of implemented interventions, and T is the set of measured temporal windows. A realization R induces the family of laws P_ R^ E = { L_ R ( O( H)middo(ι)): ι∈ I, t∈ T }.
Exact mathematical passage
P_{\mathfrak R}^{\mathcal E} = \left \{ \mathcal L_{\mathfrak R} \bigl(\mathcal O(\mathbf H)\mid\operatorname{do}(\iota)\bigr): \iota\in\mathcal I, \ t\in\mathcal T \right\}.
L_HDefinition passage · 47 passages
Search aliases: L_H
Definition passage: Transfer discrepancy · 04-approximate-workspaces.tex, line 46
[Transfer discrepancy] The transfer discrepancy operator is D_H: C_V⟶ C_E, (D_Hc)_e = sqrtw_e(c_t(e)-H_ec_s(e)). Its squared norm is the coherence energy E_H(c) = D_Hc ^2 = ∑_e∈ Ew_e c_t(e)-H_ec_s(e) ^2. The transfer Laplacian is L_H=D_H^*D_H.
Exact mathematical passage
\boxed{L_H=D_H^*D_H.}
L_{H(t)}Definition passage · 1 passage
Search aliases: L_H(t)
Definition passage: Dynamic relational realization · 06-dynamic-workspace-theory.tex, line 21
y space (Ω, F, P) and consists of: item node states X_i(t)∈ X_i for i∈ V; item edge messages M_e(t)∈ M_e for e∈ E; item external inputs E_t, local actions A_i(t), and disturbances ξ_i(t),ζ_e(t); item time-dependent transfer data H_e(t), local core vectors c_i(t), and transfer Laplacians L_t=L_H(t); and item a future target Y_t^+∈ Y. All state, history, and target spaces are assumed standard Borel unless a stronger topology is explicitly invoked.
Exact mathematical passage
L_t=L_{H(t)}
L_tDefinition passage · 6 passages
Search aliases: L_t
Definition passage: Dynamic relational realization · 06-dynamic-workspace-theory.tex, line 21
y space (Ω, F, P) and consists of: item node states X_i(t)∈ X_i for i∈ V; item edge messages M_e(t)∈ M_e for e∈ E; item external inputs E_t, local actions A_i(t), and disturbances ξ_i(t),ζ_e(t); item time-dependent transfer data H_e(t), local core vectors c_i(t), and transfer Laplacians L_t=L_H(t); and item a future target Y_t^+∈ Y. All state, history, and target spaces are assumed standard Borel unless a stronger topology is explicitly invoked.
Exact mathematical passage
L_t=L_{H(t)}
\mathcal MDefinition passage · 7 passages
Search aliases: M mathcal
Definition passage: Time-unrolled causal realization · 08-causal-efficacy-and-reentry.tex, line 15
[Time-unrolled causal realization] A time-unrolled causal realization is a structural causal model M = ( U, V,F, P_U) whose endogenous variables include the local states, messages, actions, artifacts, target variables, and a measurable workspace extractor π_t: S_t→ W_t, W_t=π_t(S_t). The unrolled graph is acyclic even when the rolled process is recurrent.
Exact mathematical passage
\mathcal M = (\mathcal U,\mathcal V,F,\mathbb P_U)
\mathfrak MDefinition passage · 12 passages
Search aliases: M mathfrak
Definition passage: Code-relative history contribution · 14-scaffolded-and-endogenous-formation.tex, line 231
[Code-relative history contribution] Let M_q be a declared coding or predictive model class for a learned component q. Let L_ M_q(qmid Z) be its held-out codelength given side information Z. Define e_q^MDL = [ frac L_ M_q(qmidΣ) - L_ M_q(qmidΣ, D_form) max{L_ M_q(qmidΣ),1} ]_0^1, where [x]_0^1=min{1,max{0,x}}.
Exact mathematical passage
\mathfrak M_q
\mathsf MDefinition passage · 2 passages
Search aliases: M mathsf
Definition passage: Dynamic relational realization · 06-dynamic-workspace-theory.tex, line 17
[Dynamic relational realization] A dynamic relational realization is defined on a probability space (Ω, F, P) and consists of: item node states X_i(t)∈ X_i for i∈ V; item edge messages M_e(t)∈ M_e for e∈ E; item external inputs E_t, local actions A_i(t), and disturbances ξ_i(t),ζ_e(t); item time-dependent transfer data H_e(t), local core vectors c_i(t), and transfer Laplacians L_t=L_H(t); and item a future target Y_t^+∈ Y. All state, history, and target spaces are assumed standard Borel unless a…
Exact mathematical passage
M_e(t)\in\mathsf M_e
mDefinition passage · 110 passages
Search aliases: m
Definition passage: Decomposition-robust certificate · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 451
[Decomposition-robust certificate] A workspace passes the D-robust certificate at level L when Certify_L, D^rob(W) = bigwedge_q∈ J(L) { inf_ D∈ D m_q(W; D)>0 }. A pass for one selected decomposition is a decomposition-specific claim. A pass throughout D is a family-robust claim. A claim is decomposition fragile when at least one required gate changes sign inside the admissible family.
Exact mathematical passage
\boxed{ \operatorname{Certify}_{L,\mathfrak D}^{\mathrm{rob}}(W) = \bigwedge_{q\in\mathcal J(L)} \left\{ \inf_{\mathcal D\in\mathfrak D} m_q(W;\mathcal D)>0 \right\}. }
M_eDefinition passage · 3 passages
Search aliases: M_e
Definition passage: Dynamic relational realization · 06-dynamic-workspace-theory.tex, line 17
[Dynamic relational realization] A dynamic relational realization is defined on a probability space (Ω, F, P) and consists of: item node states X_i(t)∈ X_i for i∈ V; item edge messages M_e(t)∈ M_e for e∈ E; item external inputs E_t, local actions A_i(t), and disturbances ξ_i(t),ζ_e(t); item time-dependent transfer data H_e(t), local core vectors c_i(t), and transfer Laplacians L_t=L_H(t); and item a future target Y_t^+∈ Y. All state, history, and target spaces are assumed standard Borel unless a…
Exact mathematical passage
M_e(t)\in\mathsf M_e
\mathsf M_eDefinition passage · 1 passage
Search aliases: M_e mathsf
Definition passage: Dynamic relational realization · 06-dynamic-workspace-theory.tex, line 17
[Dynamic relational realization] A dynamic relational realization is defined on a probability space (Ω, F, P) and consists of: item node states X_i(t)∈ X_i for i∈ V; item edge messages M_e(t)∈ M_e for e∈ E; item external inputs E_t, local actions A_i(t), and disturbances ξ_i(t),ζ_e(t); item time-dependent transfer data H_e(t), local core vectors c_i(t), and transfer Laplacians L_t=L_H(t); and item a future target Y_t^+∈ Y. All state, history, and target spaces are assumed standard Borel unless a…
Exact mathematical passage
M_e(t)\in\mathsf M_e
\mathfrak M_qDefinition passage · 3 passages
Search aliases: M_q mathfrak
Definition passage: Code-relative history contribution · 14-scaffolded-and-endogenous-formation.tex, line 231
[Code-relative history contribution] Let M_q be a declared coding or predictive model class for a learned component q. Let L_ M_q(qmid Z) be its held-out codelength given side information Z. Define e_q^MDL = [ frac L_ M_q(qmidΣ) - L_ M_q(qmidΣ, D_form) max{L_ M_q(qmidΣ),1} ]_0^1, where [x]_0^1=min{1,max{0,x}}.
Exact mathematical passage
\mathfrak M_q
m_qDefinition passage · 34 passages
Search aliases: m_q
Definition passage: Decomposition-robust certificate · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 451
[Decomposition-robust certificate] A workspace passes the D-robust certificate at level L when Certify_L, D^rob(W) = bigwedge_q∈ J(L) { inf_ D∈ D m_q(W; D)>0 }. A pass for one selected decomposition is a decomposition-specific claim. A pass throughout D is a family-robust claim. A claim is decomposition fragile when at least one required gate changes sign inside the admissible family.
Exact mathematical passage
\boxed{ \operatorname{Certify}_{L,\mathfrak D}^{\mathrm{rob}}(W) = \bigwedge_{q\in\mathcal J(L)} \left\{ \inf_{\mathcal D\in\mathfrak D} m_q(W;\mathcal D)>0 \right\}. }
\mathcal M_q^{\mathrm{ID}}Definition passage · 2 passages
Search aliases: M_q^ID mathcal mathrm
Definition passage: Identified realization set · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 572
ion[Identified realization set] Given an experimental law P^ E and model class M, define R_ID (P^ E; M) = { R∈ M: P_ R^ E=P^ E }. For a gate q and specification ς, its identified margin set is M_q^ID (P^ E;ς) = { m_q(W_ R;ς): R∈ R_ID }.
Exact mathematical passage
\mathcal M_q^{\mathrm{ID}} (P^{\mathcal E};\varsigma) = \left\{ m_q(W_{\mathfrak R};\varsigma): \mathfrak R\in\mathfrak R_{\mathrm{ID}} \right\}.
\mathscrDefinition passage · 49 passages
Search aliases: mathscr
Definition passage: System decomposition · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 43
declared local-access map for block B_α, producing the local state or history available at that component; item G_Π records the declared communication, transfer, and causal interfaces among the blocks; and item I_Π is the family of feasible interventions at that resolution. The accessible information of component α is the sigma-field mathscr F_α^ D = σ (O_α( H_t)). Every shared bus, common memory, supervisor, or artifact that can alter more than one local state must appear either as its own carr…
Exact mathematical passage
\mathscr F_\alpha^{\mathcal D} = \sigma\!\left(O_\alpha(\mathbf H_t)\right).
\maxDefinition passage · 30 passages
Search aliases: max
Definition passage: Code-relative history contribution · 14-scaffolded-and-endogenous-formation.tex, line 237
[Code-relative history contribution] Let M_q be a declared coding or predictive model class for a learned component q. Let L_ M_q(qmid Z) be its held-out codelength given side information Z. Define e_q^MDL = [ frac L_ M_q(qmidΣ) - L_ M_q(qmidΣ, D_form) max{L_ M_q(qmidΣ),1} ]_0^1, where [x]_0^1=min{1,max{0,x}}.
Exact mathematical passage
\boxed{ e_q^{\mathrm{MDL}} = \left[ \frac{ L_{\mathfrak M_q}(q\mid\Sigma) - L_{\mathfrak M_q}(q\mid\Sigma,\mathcal D_{\mathrm{form}}) }{ \max\{L_{\mathfrak M_q}(q\mid\Sigma),1\} } \right]_{0}^{1}, }
\mathrm{MDL}Definition passage · 4 passages
Search aliases: MDL mathrm
Definition passage: Code-relative history contribution · 14-scaffolded-and-endogenous-formation.tex, line 237
[Code-relative history contribution] Let M_q be a declared coding or predictive model class for a learned component q. Let L_ M_q(qmid Z) be its held-out codelength given side information Z. Define e_q^MDL = [ frac L_ M_q(qmidΣ) - L_ M_q(qmidΣ, D_form) max{L_ M_q(qmidΣ),1} ]_0^1, where [x]_0^1=min{1,max{0,x}}.
Exact mathematical passage
\boxed{ e_q^{\mathrm{MDL}} = \left[ \frac{ L_{\mathfrak M_q}(q\mid\Sigma) - L_{\mathfrak M_q}(q\mid\Sigma,\mathcal D_{\mathrm{form}}) }{ \max\{L_{\mathfrak M_q}(q\mid\Sigma),1\} } \right]_{0}^{1}, }
\midDefinition passage · 77 passages
Search aliases: mid
Definition passage: Predictive kernel and canonical state · 06-dynamic-workspace-theory.tex, line 123
[Predictive kernel and canonical state] Let H_t and Y be standard Borel spaces. A regular conditional kernel is a measurable map K_t: H_t× B( Y)→[0,1] satisfying K_t(h,A) = P(Y_t^+∈ Amid H_t=h) for P_ H_t-almost every h. Let P( Y) carry its evaluation sigma-algebra. The canonical predictive state is the random probability measure Z_t = K_t( H_t,·) ∈ P( Y). Two histories are predictively equivalent precisely when they induce the same conditional law of Y_t^+.
Exact mathematical passage
K_t(h,A) = \mathbb P(Y_t^+\in A\mid\mathbf H_t=h)
\minDefinition passage · 45 passages
Search aliases: min
Definition passage: Code-relative history contribution · 14-scaffolded-and-endogenous-formation.tex, line 252
a declared coding or predictive model class for a learned component q. Let L_ M_q(qmid Z) be its held-out codelength given side information Z. Define e_q^MDL = [ frac L_ M_q(qmidΣ) - L_ M_q(qmidΣ, D_form) max{L_ M_q(qmidΣ),1} ]_0^1, where [x]_0^1=min{1,max{0,x}}.
Exact mathematical passage
[x]_0^1=\min\{1,\max\{0,x\}\}
\mathcal NDefinition passage · 14 passages
Search aliases: N mathcal
Definition passage: Relational witness pair · 07-relational-irreducibility.tex, line 362
[Relational witness pair] A pair of laws (P,Q) is a predictive relational witness pair for the decomposition V and target Y_t^+ when Q∈ N_pred(P) but Risk_ℓ,Q(V) ≠ Risk_ℓ,P(V). The two systems agree on every single-node predictive marginal but differ in full-system operative capacity.
Exact mathematical passage
Q\in\mathcal N_{\mathrm{pred}}(P)
\mathcal N_{\mathrm{pred}}Definition passage · 6 passages
Search aliases: N_pred mathcal mathrm
Definition passage: Relational witness pair · 07-relational-irreducibility.tex, line 362
[Relational witness pair] A pair of laws (P,Q) is a predictive relational witness pair for the decomposition V and target Y_t^+ when Q∈ N_pred(P) but Risk_ℓ,Q(V) ≠ Risk_ℓ,P(V). The two systems agree on every single-node predictive marginal but differ in full-system operative capacity.
Exact mathematical passage
Q\in\mathcal N_{\mathrm{pred}}(P)
\NatDefinition passage · 1 passage
Search aliases: Nat
Definition passage: Natural workspace operators · 03-exact-shared-cores.tex, line 429
[Natural workspace operators] Define O_Workspace = { (A_i)_i∈ V: A_t(e)H_e=H_eA_s(e) ∀ e }. Categorically, O_Workspace=Nat(H,H), the algebra of natural endomorphisms of the local system.
Exact mathematical passage
\mathcal O_{\Workspace}=\Nat(H,H),
ODefinition passage · 16 passages
Search aliases: O
Definition passage: System decomposition · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 35
[System decomposition] A decomposition of a carrier presentation is a tuple D = ( Π, O,G_Π, I_Π ), where: item Π={B_α}_α∈ A is a partition of Ω; item O_α is the declared local-access map for block B_α, producing the local state or history available at that component; item G_Π records the declared communication, transfer, and causal interfaces among the blocks; and item I_Π is the family of feasible interventions at that resolution. The accessible information of component α is the sigma-field mat…
Exact mathematical passage
O_\alpha
\mathbf ODefinition passage · 1 passage
Search aliases: O mathbf
Definition passage: System decomposition · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 25
[System decomposition] A decomposition of a carrier presentation is a tuple D = ( Π, O,G_Π, I_Π ), where: item Π={B_α}_α∈ A is a partition of Ω; item O_α is the declared local-access map for block B_α, producing the local state or history available at that component; item G_Π records the declared communication, transfer, and causal interfaces among the blocks; and item I_Π is the family of feasible interventions at that resolution. The accessible information of component α is the sigma-field mat…
Exact mathematical passage
\mathcal D = \bigl( \Pi,\mathbf O,G_{\Pi},\mathcal I_{\Pi} \bigr),
\mathcal ODefinition passage · 17 passages
Search aliases: O mathcal
Definition passage: Natural workspace operators · 03-exact-shared-cores.tex, line 418
[Natural workspace operators] Define O_Workspace = { (A_i)_i∈ V: A_t(e)H_e=H_eA_s(e) ∀ e }. Categorically, O_Workspace=Nat(H,H), the algebra of natural endomorphisms of the local system.
Exact mathematical passage
\boxed{ \mathcal O_{\Workspace} = \left\{ (A_i)_{i\in V}: A_{t(e)}H_e=H_eA_{s(e)}\ \forall e \right\}. }
\mathcal O_{\Workspace}Definition passage · 9 passages
Search aliases: O_Workspace mathcal Workspace
Definition passage: Natural workspace operators · 03-exact-shared-cores.tex, line 418
[Natural workspace operators] Define O_Workspace = { (A_i)_i∈ V: A_t(e)H_e=H_eA_s(e) ∀ e }. Categorically, O_Workspace=Nat(H,H), the algebra of natural endomorphisms of the local system.
Exact mathematical passage
\boxed{ \mathcal O_{\Workspace} = \left\{ (A_i)_{i\in V}: A_{t(e)}H_e=H_eA_{s(e)}\ \forall e \right\}. }
O_\alphaDefinition passage · 2 passages
Search aliases: O_α alpha
Definition passage: System decomposition · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 35
[System decomposition] A decomposition of a carrier presentation is a tuple D = ( Π, O,G_Π, I_Π ), where: item Π={B_α}_α∈ A is a partition of Ω; item O_α is the declared local-access map for block B_α, producing the local state or history available at that component; item G_Π records the declared communication, transfer, and causal interfaces among the blocks; and item I_Π is the family of feasible interventions at that resolution. The accessible information of component α is the sigma-field mat…
Exact mathematical passage
O_\alpha
\overline\deltaDefinition passage · 5 passages
Search aliases: overlineδ overline delta
Definition passage: Descent-faithful compression · 13-gluing-and-workspaces-of-workspaces.tex, line 801
[Descent-faithful compression] The compression is descent-faithful in degree zero when the induced map H^0(Q): kerδ^0 ⟶ keroverlineδ^0 is an isomorphism.
Exact mathematical passage
\boxed{ H^0(Q): \ker\delta^0 \longrightarrow \ker\overline\delta^0 }
\overline\delta^0Definition passage · 2 passages
Search aliases: overlineδ^0 overline delta
Definition passage: Descent-faithful compression · 13-gluing-and-workspaces-of-workspaces.tex, line 801
[Descent-faithful compression] The compression is descent-faithful in degree zero when the induced map H^0(Q): kerδ^0 ⟶ keroverlineδ^0 is an isomorphism.
Exact mathematical passage
\boxed{ H^0(Q): \ker\delta^0 \longrightarrow \ker\overline\delta^0 }
PDefinition passage · 167 passages
Search aliases: P
Definition passage: Admissible local decomposition · 02-static-core-transfer-theory.tex, line 129
[Admissible local decomposition] For every vertex i, choose an orthogonal decomposition X_i=C_i⊕ R_i, with projectors P_i:X_i→ C_i, Q_i=I-P_i:X_i→ R_i. The subspace C_i is the candidate locally realized transferable core. The subspace R_i contains substrate-specific, context-specific, or otherwise noncore degrees of freedom relative to the present analysis.
Exact mathematical passage
P_i:X_i\to C_i, \qquad Q_i=I-P_i:X_i\to R_i.
\mathbb PDefinition passage · 44 passages
Search aliases: P mathbb
Definition passage: Dynamic relational realization · 06-dynamic-workspace-theory.tex, line 14
[Dynamic relational realization] A dynamic relational realization is defined on a probability space (Ω, F, P) and consists of: item node states X_i(t)∈ X_i for i∈ V; item edge messages M_e(t)∈ M_e for e∈ E; item external inputs E_t, local actions A_i(t), and disturbances ξ_i(t),ζ_e(t); item time-dependent transfer data H_e(t), local core vectors c_i(t), and transfer Laplacians L_t=L_H(t); and item a future target Y_t^+∈ Y. All state, history, and target spaces are assumed standard Borel unless a…
Exact mathematical passage
(\Omega,\mathcal F,\mathbb P)
\mathcal PDefinition passage · 8 passages
Search aliases: P mathcal
Definition passage: Predictive kernel and canonical state · 06-dynamic-workspace-theory.tex, line 129
[Predictive kernel and canonical state] Let H_t and Y be standard Borel spaces. A regular conditional kernel is a measurable map K_t: H_t× B( Y)→[0,1] satisfying K_t(h,A) = P(Y_t^+∈ Amid H_t=h) for P_ H_t-almost every h. Let P( Y) carry its evaluation sigma-algebra. The canonical predictive state is the random probability measure Z_t = K_t( H_t,·) ∈ P( Y). Two histories are predictively equivalent precisely when they induce the same conditional law of Y_t^+.
Exact mathematical passage
\mathcal P(\mathsf Y)
\mathfrak PDefinition passage · 2 passages
Search aliases: P mathfrak
Definition passage: Case-study realization · 22-integrated-worked-examples-and-case-studies.tex, line 27
[Case-study realization] A case-study realization is a tuple K = ( R, B, C, P, E, D, S, I, Q, G ), where: item R is the declared relational realization; item B is the boundary problem and component decomposition; item C is the structural core--transfer model; item P is the downstream predictive or control problem; item E is the evidence or generated-data family; item D is the admissible decomposition family; item S is the admissible family of complete scientific specifications, including targets…
Exact mathematical passage
\mathfrak K = \bigl( \mathfrak R, \mathfrak B, \mathfrak C, \mathfrak P, \mathcal E, \mathfrak D, \mathfrak S, \mathcal I, \mathcal Q, \mathcal G \bigr),
pDefinition passage · 39 passages
Search aliases: p
Definition passage: Finite workspace cover · 13-gluing-and-workspaces-of-workspaces.tex, line 45
[Finite workspace cover] A finite family of subgraphs U={G_α}_α∈ A is an edge-complete workspace cover of G when V=⋃_α∈ AV_α, E=⋃_α∈ AE_α. Every edge in E_α carries the transfer inherited from G. For a nonempty finite index set I={α_0,…,α_p}⊆ A, define the intersection subgraph G_I = G_α_0⋯α_p := ⋂_α∈ IG_α by intersecting both vertex and edge sets. Isolated vertices are retained.
Exact mathematical passage
I=\{\alpha_0,\ldots,\alpha_p\}\subseteq A,
P^{\mathcal E}Definition passage · 4 passages
Search aliases: P^ E mathcal
Definition passage: Identified realization set · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 558
[Identified realization set] Given an experimental law P^ E and model class M, define R_ID (P^ E; M) = { R∈ M: P_ R^ E=P^ E }. For a gate q and specification ς, its identified margin set is M_q^ID (P^ E;ς) = { m_q(W_ R;ς): R∈ R_ID }.
Exact mathematical passage
P^{\mathcal E}
\mathbb P_{\mathbf H_t}Definition passage · 1 passage
Search aliases: P_ H_t mathbb mathbf
Definition passage: Predictive kernel and canonical state · 06-dynamic-workspace-theory.tex, line 128
[Predictive kernel and canonical state] Let H_t and Y be standard Borel spaces. A regular conditional kernel is a measurable map K_t: H_t× B( Y)→[0,1] satisfying K_t(h,A) = P(Y_t^+∈ Amid H_t=h) for P_ H_t-almost every h. Let P( Y) carry its evaluation sigma-algebra. The canonical predictive state is the random probability measure Z_t = K_t( H_t,·) ∈ P( Y). Two histories are predictively equivalent precisely when they induce the same conditional law of Y_t^+.
Exact mathematical passage
\mathbb P_{\mathbf H_t}
P_{\mathfrak R'}^{\mathcal E}Definition passage · 1 passage
Search aliases: P_ R'^ E mathfrak mathcal
Definition passage: Experimental equivalence · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 436
[Experimental equivalence] Two realizations are experimentally equivalent under E, written R≡_ E R', when P_ R^ E = P_ R'^ E. A property ψ( R) is identifiable on a model class M under E when it is constant on every ≡_ E-equivalence class contained in M.
Exact mathematical passage
P_{\mathfrak R}^{\mathcal E} = P_{\mathfrak R'}^{\mathcal E}.
P_{\mathfrak R}^{\mathcal E}Definition passage · 3 passages
Search aliases: P_ R^ E mathfrak mathcal
Definition passage: Experimental design and induced law · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 417
efinition[Experimental design and induced law] An experimental design is a tuple E = ( O, I, T), where O is the observation map, I is the family of implemented interventions, and T is the set of measured temporal windows. A realization R induces the family of laws P_ R^ E = { L_ R ( O( H)middo(ι)): ι∈ I, t∈ T }.
Exact mathematical passage
P_{\mathfrak R}^{\mathcal E} = \left \{ \mathcal L_{\mathfrak R} \bigl(\mathcal O(\mathbf H)\mid\operatorname{do}(\iota)\bigr): \iota\in\mathcal I, \ t\in\mathcal T \right\}.
P_{[0,\varepsilon]}Definition passage · 1 passage
Search aliases: P_[0,ε] varepsilon
Definition passage: Threshold workspace · 04-approximate-workspaces.tex, line 176
[Threshold workspace] For ε≥0, define Γ_ε(H) = ran P_[0,ε](L_H). Its dimension is d_ε = #{k:λ_k≤ε}. When 0<d_ε<N, define the boundary gap g_ε = λ_d_ε+1-λ_d_ε.
Exact mathematical passage
\boxed{ \Gamma_\varepsilon(H) = \ran P_{[0,\varepsilon]}(L_H). }
P_iDefinition passage · 2 passages
Search aliases: P_i
Definition passage: Admissible local decomposition · 02-static-core-transfer-theory.tex, line 129
[Admissible local decomposition] For every vertex i, choose an orthogonal decomposition X_i=C_i⊕ R_i, with projectors P_i:X_i→ C_i, Q_i=I-P_i:X_i→ R_i. The subspace C_i is the candidate locally realized transferable core. The subspace R_i contains substrate-specific, context-specific, or otherwise noncore degrees of freedom relative to the present analysis.
Exact mathematical passage
P_i:X_i\to C_i, \qquad Q_i=I-P_i:X_i\to R_i.
\mathbb P_UDefinition passage · 1 passage
Search aliases: P_U mathbb
Definition passage: Time-unrolled causal realization · 08-causal-efficacy-and-reentry.tex, line 15
[Time-unrolled causal realization] A time-unrolled causal realization is a structural causal model M = ( U, V,F, P_U) whose endogenous variables include the local states, messages, actions, artifacts, target variables, and a measurable workspace extractor π_t: S_t→ W_t, W_t=π_t(S_t). The unrolled graph is acyclic even when the rolled process is recurrent.
Exact mathematical passage
\mathcal M = (\mathcal U,\mathcal V,F,\mathbb P_U)
\prDefinition passage · 2 passages
Search aliases: pr
Definition passage: Relational instantiation · 01-foundational-thesis.tex, line 141
[Relational instantiation] A workspace is relationally instantiated relative to the decomposition V when no single projection determines its equivalence class: ∀ i∈ V, ∃ R, R' such that pr_i( R)=pr_i( R') but [ R]_≃≠[ R']_≃.
Exact mathematical passage
\pr_i(\mathfrak R)=\pr_i(\mathfrak R') \quad\text{but}\quad [\mathfrak R]_{\simeq}\neq[\mathfrak R']_{\simeq}.
\pr_iDefinition passage · 2 passages
Search aliases: pr_i pr
Definition passage: Relational instantiation · 01-foundational-thesis.tex, line 141
[Relational instantiation] A workspace is relationally instantiated relative to the decomposition V when no single projection determines its equivalence class: ∀ i∈ V, ∃ R, R' such that pr_i( R)=pr_i( R') but [ R]_≃≠[ R']_≃.
Exact mathematical passage
\pr_i(\mathfrak R)=\pr_i(\mathfrak R') \quad\text{but}\quad [\mathfrak R]_{\simeq}\neq[\mathfrak R']_{\simeq}.
\preceqDefinition passage · 3 passages
Search aliases: preceq
Definition passage: Refinement and coarsening · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 69
[Refinement and coarsening] Let D_f and D_c be decompositions of the same carrier presentation. The fine decomposition refines the coarse decomposition, written D_fpreceq D_c, when there is a surjection q:V_f⟶ V_c such that each coarse component is the union of the fine components in one fiber of q, and its accessible information is generated only from those fine components. The aggregation is information faithful when mathscr F_B^ D_c = bigvee_i∈ q^-1(B) mathscr F_i^ D_f (B∈ V_c). It is structu…
Exact mathematical passage
\mathcal D_f\preceq\mathcal D_c,
\mathrm{pred}Definition passage · 6 passages
Search aliases: pred mathrm
Definition passage: Relational witness pair · 07-relational-irreducibility.tex, line 362
[Relational witness pair] A pair of laws (P,Q) is a predictive relational witness pair for the decomposition V and target Y_t^+ when Q∈ N_pred(P) but Risk_ℓ,Q(V) ≠ Risk_ℓ,P(V). The two systems agree on every single-node predictive marginal but differ in full-system operative capacity.
Exact mathematical passage
Q\in\mathcal N_{\mathrm{pred}}(P)
\mathcal QDefinition passage · 16 passages
Search aliases: Q mathcal
Definition passage: Case-study realization · 22-integrated-worked-examples-and-case-studies.tex, line 27
[Case-study realization] A case-study realization is a tuple K = ( R, B, C, P, E, D, S, I, Q, G ), where: item R is the declared relational realization; item B is the boundary problem and component decomposition; item C is the structural core--transfer model; item P is the downstream predictive or control problem; item E is the evidence or generated-data family; item D is the admissible decomposition family; item S is the admissible family of complete scientific specifications, including targets…
Exact mathematical passage
\mathfrak K = \bigl( \mathfrak R, \mathfrak B, \mathfrak C, \mathfrak P, \mathcal E, \mathfrak D, \mathfrak S, \mathcal I, \mathcal Q, \mathcal G \bigr),
qDefinition passage · 158 passages
Search aliases: q
Definition passage: Code-relative history contribution · 14-scaffolded-and-endogenous-formation.tex, line 231
[Code-relative history contribution] Let M_q be a declared coding or predictive model class for a learned component q. Let L_ M_q(qmid Z) be its held-out codelength given side information Z. Define e_q^MDL = [ frac L_ M_q(qmidΣ) - L_ M_q(qmidΣ, D_form) max{L_ M_q(qmidΣ),1} ]_0^1, where [x]_0^1=min{1,max{0,x}}.
Exact mathematical passage
\mathfrak M_q
q^{-1}Definition passage · 5 passages
Search aliases: q^-1
Definition passage: Refinement and coarsening · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 79
r presentation. The fine decomposition refines the coarse decomposition, written D_fpreceq D_c, when there is a surjection q:V_f⟶ V_c such that each coarse component is the union of the fine components in one fiber of q, and its accessible information is generated only from those fine components. The aggregation is information faithful when mathscr F_B^ D_c = bigvee_i∈ q^-1(B) mathscr F_i^ D_f (B∈ V_c). It is structurally faithful when it also retains every internal compatibility condition and e…
Exact mathematical passage
\mathscr F_B^{\mathcal D_c} = \bigvee_{i\in q^{-1}(B)} \mathscr F_i^{\mathcal D_f} \qquad(B\in V_c).
Q_iDefinition passage · 1 passage
Search aliases: Q_i
Definition passage: Admissible local decomposition · 02-static-core-transfer-theory.tex, line 129
[Admissible local decomposition] For every vertex i, choose an orthogonal decomposition X_i=C_i⊕ R_i, with projectors P_i:X_i→ C_i, Q_i=I-P_i:X_i→ R_i. The subspace C_i is the candidate locally realized transferable core. The subspace R_i contains substrate-specific, context-specific, or otherwise noncore degrees of freedom relative to the present analysis.
Exact mathematical passage
P_i:X_i\to C_i, \qquad Q_i=I-P_i:X_i\to R_i.
\mathbb RDefinition passage · 23 passages
Search aliases: R mathbb
Definition passage: Operation algebra · 02-static-core-transfer-theory.tex, line 291
[Operation algebra] Let F∈{ R, C}. An operation algebra A is a unital associative F-algebra whose elements represent abstract transformations, inferential rules, questions, or procedures that can be realized in multiple strata.
Exact mathematical passage
\mathbb F\in\{\mathbb R,\mathbb C\}
\mathfrak RDefinition passage · 66 passages
Search aliases: R mathfrak
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 19
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
\mathfrak R = \bigl( G,\mathbf X,\mathbf T,\mathcal A,\boldsymbol\rho, \mathcal H,\mathcal I,\mathcal Y \bigr),
\mathfrak R'Definition passage · 24 passages
Search aliases: R' mathfrak
Definition passage: Admissible equivalence · 01-foundational-thesis.tex, line 67
[Admissible equivalence] An admissible equivalence F: R≃ R' is a family of correspondences preserving, exactly or within a declared tolerance: · the transferable core and its dimension,
Exact mathematical passage
F:\mathfrak R\simeq\mathfrak R'
R_iDefinition passage · 7 passages
Search aliases: R_i
Definition passage: Admissible local decomposition · 02-static-core-transfer-theory.tex, line 125
[Admissible local decomposition] For every vertex i, choose an orthogonal decomposition X_i=C_i⊕ R_i, with projectors P_i:X_i→ C_i, Q_i=I-P_i:X_i→ R_i. The subspace C_i is the candidate locally realized transferable core. The subspace R_i contains substrate-specific, context-specific, or otherwise noncore degrees of freedom relative to the present analysis.
Exact mathematical passage
X_i=C_i\oplus R_i,
\mathfrak R_{\mathrm{ID}}Definition passage · 5 passages
Search aliases: R_ID mathfrak mathrm
Definition passage: Identified realization set · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 560
[Identified realization set] Given an experimental law P^ E and model class M, define R_ID (P^ E; M) = { R∈ M: P_ R^ E=P^ E }. For a gate q and specification ς, its identified margin set is M_q^ID (P^ E;ς) = { m_q(W_ R;ς): R∈ R_ID }.
Exact mathematical passage
\boxed{ \mathfrak R_{\mathrm{ID}} (P^{\mathcal E};\mathfrak M) = \left\{ \mathfrak R\in\mathfrak M: P_{\mathfrak R}^{\mathcal E}=P^{\mathcal E} \right\}. }
\mathfrak R_{\mathrm{stat}}Definition passage · 1 passage
Search aliases: R_stat mathfrak mathrm
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 39
s; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family of downstream variables relative to which causal and predictive claims are evaluated. The static reduct is R_stat = (G, X, T, A,ρ).
Exact mathematical passage
\mathfrak R_{\mathrm{stat}} = (G,\mathbf X,\mathbf T,\mathcal A,\boldsymbol\rho).
\ranDefinition passage · 16 passages
Search aliases: ran
Definition passage: Threshold workspace · 04-approximate-workspaces.tex, line 176
[Threshold workspace] For ε≥0, define Γ_ε(H) = ran P_[0,ε](L_H). Its dimension is d_ε = #{k:λ_k≤ε}. When 0<d_ε<N, define the boundary gap g_ε = λ_d_ε+1-λ_d_ε.
Exact mathematical passage
\boxed{ \Gamma_\varepsilon(H) = \ran P_{[0,\varepsilon]}(L_H). }
\RiskDefinition passage · 36 passages
Search aliases: Risk
Definition passage: Relational witness pair · 07-relational-irreducibility.tex, line 366
[Relational witness pair] A pair of laws (P,Q) is a predictive relational witness pair for the decomposition V and target Y_t^+ when Q∈ N_pred(P) but Risk_ℓ,Q(V) ≠ Risk_ℓ,P(V). The two systems agree on every single-node predictive marginal but differ in full-system operative capacity.
Exact mathematical passage
\Risk_{\ell,Q}(V) \neq \Risk_{\ell,P}(V).
\Risk_{\ell,P}Definition passage · 3 passages
Search aliases: Risk_ℓ,P Risk ell
Definition passage: Relational witness pair · 07-relational-irreducibility.tex, line 366
[Relational witness pair] A pair of laws (P,Q) is a predictive relational witness pair for the decomposition V and target Y_t^+ when Q∈ N_pred(P) but Risk_ℓ,Q(V) ≠ Risk_ℓ,P(V). The two systems agree on every single-node predictive marginal but differ in full-system operative capacity.
Exact mathematical passage
\Risk_{\ell,Q}(V) \neq \Risk_{\ell,P}(V).
\Risk_{\ell,Q}Definition passage · 3 passages
Search aliases: Risk_ℓ,Q Risk ell
Definition passage: Relational witness pair · 07-relational-irreducibility.tex, line 366
[Relational witness pair] A pair of laws (P,Q) is a predictive relational witness pair for the decomposition V and target Y_t^+ when Q∈ N_pred(P) but Risk_ℓ,Q(V) ≠ Risk_ℓ,P(V). The two systems agree on every single-node predictive marginal but differ in full-system operative capacity.
Exact mathematical passage
\Risk_{\ell,Q}(V) \neq \Risk_{\ell,P}(V).
\mathrm{rob}Definition passage · 2 passages
Search aliases: rob mathrm
Definition passage: Decomposition-robust certificate · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 451
[Decomposition-robust certificate] A workspace passes the D-robust certificate at level L when Certify_L, D^rob(W) = bigwedge_q∈ J(L) { inf_ D∈ D m_q(W; D)>0 }. A pass for one selected decomposition is a decomposition-specific claim. A pass throughout D is a family-robust claim. A claim is decomposition fragile when at least one required gate changes sign inside the admissible family.
Exact mathematical passage
\boxed{ \operatorname{Certify}_{L,\mathfrak D}^{\mathrm{rob}}(W) = \bigwedge_{q\in\mathcal J(L)} \left\{ \inf_{\mathcal D\in\mathfrak D} m_q(W;\mathcal D)>0 \right\}. }
SDefinition passage · 160 passages
Search aliases: S
Definition passage: Time-unrolled causal realization · 08-causal-efficacy-and-reentry.tex, line 22
[Time-unrolled causal realization] A time-unrolled causal realization is a structural causal model M = ( U, V,F, P_U) whose endogenous variables include the local states, messages, actions, artifacts, target variables, and a measurable workspace extractor π_t: S_t→ W_t, W_t=π_t(S_t). The unrolled graph is acyclic even when the rolled process is recurrent.
Exact mathematical passage
\pi_t:\mathsf S_t\to\mathsf W_t, \qquad W_t=\pi_t(S_t).
\mathfrak SDefinition passage · 67 passages
Search aliases: S mathfrak
Definition passage: Boundary problem · 15-boundary-formation-and-stability.tex, line 13
[Boundary problem] A boundary problem is a tuple B = ( V, S, τ, Y, I, Π, G_B ), where S⊆2^V is the admissible candidate family, τ is the temporal scale, Y is the operational target, I is the feasible intervention family, Π is the environment distribution, and G_B is a symmetry group under which boundaries are considered equivalent.
Exact mathematical passage
\mathfrak B = \left( V, \mathfrak S, \tau, \mathcal Y, \mathcal I, \Pi, \mathcal G_B \right),
\mathsf SDefinition passage · 7 passages
Search aliases: S mathsf
Definition passage: Time-unrolled causal realization · 08-causal-efficacy-and-reentry.tex, line 22
[Time-unrolled causal realization] A time-unrolled causal realization is a structural causal model M = ( U, V,F, P_U) whose endogenous variables include the local states, messages, actions, artifacts, target variables, and a measurable workspace extractor π_t: S_t→ W_t, W_t=π_t(S_t). The unrolled graph is acyclic even when the rolled process is recurrent.
Exact mathematical passage
\pi_t:\mathsf S_t\to\mathsf W_t, \qquad W_t=\pi_t(S_t).
sDefinition passage · 59 passages
Search aliases: s
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 29
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
G=(V,E,s,t)
S_tDefinition passage · 26 passages
Search aliases: S_t
Definition passage: Time-unrolled causal realization · 08-causal-efficacy-and-reentry.tex, line 22
[Time-unrolled causal realization] A time-unrolled causal realization is a structural causal model M = ( U, V,F, P_U) whose endogenous variables include the local states, messages, actions, artifacts, target variables, and a measurable workspace extractor π_t: S_t→ W_t, W_t=π_t(S_t). The unrolled graph is acyclic even when the rolled process is recurrent.
Exact mathematical passage
\pi_t:\mathsf S_t\to\mathsf W_t, \qquad W_t=\pi_t(S_t).
\mathsf S_tDefinition passage · 1 passage
Search aliases: S_t mathsf
Definition passage: Time-unrolled causal realization · 08-causal-efficacy-and-reentry.tex, line 22
[Time-unrolled causal realization] A time-unrolled causal realization is a structural causal model M = ( U, V,F, P_U) whose endogenous variables include the local states, messages, actions, artifacts, target variables, and a measurable workspace extractor π_t: S_t→ W_t, W_t=π_t(S_t). The unrolled graph is acyclic even when the rolled process is recurrent.
Exact mathematical passage
\pi_t:\mathsf S_t\to\mathsf W_t, \qquad W_t=\pi_t(S_t).
S_t^{\iota_w}Definition passage · 1 passage
Search aliases: S_t^ι_w iota
Definition passage: Feasible implementation intervention · 08-causal-efficacy-and-reentry.tex, line 38
(B_t denote declared background variables that should remain matched. A family {ι_w:w∈ W_t^∘} is a feasible implementation of workspace values on the experimental domain W_t^∘ when: item each ι_w acts only on declared manipulable parents, channels, or artifacts at or after time t; item the intervened realization satisfies π_t(S_t^ι_w)=w almost surely; item the background law is matched across compared interventions; and item the intervention does not directly modify Y_t^+ except through paths in…
Exact mathematical passage
\pi_t(S_t^{\iota_w})=w \qquad\text{almost surely};
\mathrm{stat}Definition passage · 3 passages
Search aliases: stat mathrm
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 39
s; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family of downstream variables relative to which causal and predictive claims are evaluated. The static reduct is R_stat = (G, X, T, A,ρ).
Exact mathematical passage
\mathfrak R_{\mathrm{stat}} = (G,\mathbf X,\mathbf T,\mathcal A,\boldsymbol\rho).
TDefinition passage · 119 passages
Search aliases: T
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 31
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
\mathbf T=\{T_e\}_{e\in E}
\mathbf TDefinition passage · 3 passages
Search aliases: T mathbf
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 19
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
\mathfrak R = \bigl( G,\mathbf X,\mathbf T,\mathcal A,\boldsymbol\rho, \mathcal H,\mathcal I,\mathcal Y \bigr),
\mathcal TDefinition passage · 9 passages
Search aliases: T mathcal
Definition passage: Experimental design and induced law · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 409
[Experimental design and induced law] An experimental design is a tuple E = ( O, I, T), where O is the observation map, I is the family of implemented interventions, and T is the set of measured temporal windows. A realization R induces the family of laws P_ R^ E = { L_ R ( O( H)middo(ι)): ι∈ I, t∈ T }.
Exact mathematical passage
\mathcal E = (\mathcal O,\mathcal I,\mathcal T),
T_eDefinition passage · 12 passages
Search aliases: T_e
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 31
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
\mathbf T=\{T_e\}_{e\in E}
UDefinition passage · 33 passages
Search aliases: U
Definition passage: Time-unrolled causal realization · 08-causal-efficacy-and-reentry.tex, line 15
[Time-unrolled causal realization] A time-unrolled causal realization is a structural causal model M = ( U, V,F, P_U) whose endogenous variables include the local states, messages, actions, artifacts, target variables, and a measurable workspace extractor π_t: S_t→ W_t, W_t=π_t(S_t). The unrolled graph is acyclic even when the rolled process is recurrent.
Exact mathematical passage
\mathcal M = (\mathcal U,\mathcal V,F,\mathbb P_U)
\mathcal UDefinition passage · 62 passages
Search aliases: U mathcal
Definition passage: Time-unrolled causal realization · 08-causal-efficacy-and-reentry.tex, line 15
[Time-unrolled causal realization] A time-unrolled causal realization is a structural causal model M = ( U, V,F, P_U) whose endogenous variables include the local states, messages, actions, artifacts, target variables, and a measurable workspace extractor π_t: S_t→ W_t, W_t=π_t(S_t). The unrolled graph is acyclic even when the rolled process is recurrent.
Exact mathematical passage
\mathcal M = (\mathcal U,\mathcal V,F,\mathbb P_U)
\mathcal VDefinition passage · 3 passages
Search aliases: V mathcal
Definition passage: Time-unrolled causal realization · 08-causal-efficacy-and-reentry.tex, line 15
[Time-unrolled causal realization] A time-unrolled causal realization is a structural causal model M = ( U, V,F, P_U) whose endogenous variables include the local states, messages, actions, artifacts, target variables, and a measurable workspace extractor π_t: S_t→ W_t, W_t=π_t(S_t). The unrolled graph is acyclic even when the rolled process is recurrent.
Exact mathematical passage
\mathcal M = (\mathcal U,\mathcal V,F,\mathbb P_U)
V_cDefinition passage · 6 passages
Search aliases: V_c
Definition passage: Refinement and coarsening · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 73
[Refinement and coarsening] Let D_f and D_c be decompositions of the same carrier presentation. The fine decomposition refines the coarse decomposition, written D_fpreceq D_c, when there is a surjection q:V_f⟶ V_c such that each coarse component is the union of the fine components in one fiber of q, and its accessible information is generated only from those fine components. The aggregation is information faithful when mathscr F_B^ D_c = bigvee_i∈ q^-1(B) mathscr F_i^ D_f (B∈ V_c). It is structu…
Exact mathematical passage
q:V_f\longrightarrow V_c
V_eDefinition passage · 15 passages
Search aliases: V_e
Definition passage: Exact core-transfer system · 02-static-core-transfer-theory.tex, line 271
[Exact core-transfer system] An exact core-transfer system on G consists of: item decompositions X_i=C_i⊕ R_i; item core-preserving edge maps V_e=0; and item invertible core blocks H_e∈ GL(C_s(e),C_t(e)) whenever holonomy is invoked.
Exact mathematical passage
V_e=0
V_fDefinition passage · 4 passages
Search aliases: V_f
Definition passage: Refinement and coarsening · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 73
[Refinement and coarsening] Let D_f and D_c be decompositions of the same carrier presentation. The fine decomposition refines the coarse decomposition, written D_fpreceq D_c, when there is a surjection q:V_f⟶ V_c such that each coarse component is the union of the fine components in one fiber of q, and its accessible information is generated only from those fine components. The aggregation is information faithful when mathscr F_B^ D_c = bigvee_i∈ q^-1(B) mathscr F_i^ D_f (B∈ V_c). It is structu…
Exact mathematical passage
q:V_f\longrightarrow V_c
V_\alphaDefinition passage · 4 passages
Search aliases: V_α alpha
Definition passage: Finite workspace cover · 13-gluing-and-workspaces-of-workspaces.tex, line 38
[Finite workspace cover] A finite family of subgraphs U={G_α}_α∈ A is an edge-complete workspace cover of G when V=⋃_α∈ AV_α, E=⋃_α∈ AE_α. Every edge in E_α carries the transfer inherited from G. For a nonempty finite index set I={α_0,…,α_p}⊆ A, define the intersection subgraph G_I = G_α_0⋯α_p := ⋂_α∈ IG_α by intersecting both vertex and edge sets. Isolated vertices are retained.
Exact mathematical passage
V=\bigcup_{\alpha\in A}V_\alpha, \qquad E=\bigcup_{\alpha\in A}E_\alpha.
WDefinition passage · 209 passages
Search aliases: W
Definition passage: Exact structural--operational alignment · 06-dynamic-workspace-theory.tex, line 379
[Exact structural--operational alignment] The candidate W_t is observationally aligned when there exists a measurable map ϕ_t such that Z_t=ϕ_t(W_t) a.s. It is I-causally aligned when Z_t^ I=ϕ_t^ I(W_t) a.s.
Exact mathematical passage
W_t
\mathsf WDefinition passage · 4 passages
Search aliases: W mathsf
Definition passage: Time-unrolled causal realization · 08-causal-efficacy-and-reentry.tex, line 22
[Time-unrolled causal realization] A time-unrolled causal realization is a structural causal model M = ( U, V,F, P_U) whose endogenous variables include the local states, messages, actions, artifacts, target variables, and a measurable workspace extractor π_t: S_t→ W_t, W_t=π_t(S_t). The unrolled graph is acyclic even when the rolled process is recurrent.
Exact mathematical passage
\pi_t:\mathsf S_t\to\mathsf W_t, \qquad W_t=\pi_t(S_t).
wDefinition passage · 90 passages
Search aliases: w
Definition passage: Transfer discrepancy · 04-approximate-workspaces.tex, line 27
[Transfer discrepancy] The transfer discrepancy operator is D_H: C_V⟶ C_E, (D_Hc)_e = sqrtw_e(c_t(e)-H_ec_s(e)). Its squared norm is the coherence energy E_H(c) = D_Hc ^2 = ∑_e∈ Ew_e c_t(e)-H_ec_s(e) ^2. The transfer Laplacian is L_H=D_H^*D_H.
Exact mathematical passage
D_H:\mathcal C_V\longrightarrow\mathcal C_E, \qquad (D_Hc)_e = \sqrt{w_e}\bigl(c_{t(e)}-H_ec_{s(e)}\bigr).
W_{\mathfrak R}Definition passage · 6 passages
Search aliases: W_ R mathfrak
Definition passage: Identified realization set · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 572
ion[Identified realization set] Given an experimental law P^ E and model class M, define R_ID (P^ E; M) = { R∈ M: P_ R^ E=P^ E }. For a gate q and specification ς, its identified margin set is M_q^ID (P^ E;ς) = { m_q(W_ R;ς): R∈ R_ID }.
Exact mathematical passage
\mathcal M_q^{\mathrm{ID}} (P^{\mathcal E};\varsigma) = \left\{ m_q(W_{\mathfrak R};\varsigma): \mathfrak R\in\mathfrak R_{\mathrm{ID}} \right\}.
w_eDefinition passage · 17 passages
Search aliases: w_e
Definition passage: Transfer discrepancy · 04-approximate-workspaces.tex, line 27
[Transfer discrepancy] The transfer discrepancy operator is D_H: C_V⟶ C_E, (D_Hc)_e = sqrtw_e(c_t(e)-H_ec_s(e)). Its squared norm is the coherence energy E_H(c) = D_Hc ^2 = ∑_e∈ Ew_e c_t(e)-H_ec_s(e) ^2. The transfer Laplacian is L_H=D_H^*D_H.
Exact mathematical passage
D_H:\mathcal C_V\longrightarrow\mathcal C_E, \qquad (D_Hc)_e = \sqrt{w_e}\bigl(c_{t(e)}-H_ec_{s(e)}\bigr).
W_tDefinition passage · 59 passages
Search aliases: W_t
Definition passage: Exact structural--operational alignment · 06-dynamic-workspace-theory.tex, line 379
[Exact structural--operational alignment] The candidate W_t is observationally aligned when there exists a measurable map ϕ_t such that Z_t=ϕ_t(W_t) a.s. It is I-causally aligned when Z_t^ I=ϕ_t^ I(W_t) a.s.
Exact mathematical passage
W_t
\mathsf W_tDefinition passage · 2 passages
Search aliases: W_t mathsf
Definition passage: Time-unrolled causal realization · 08-causal-efficacy-and-reentry.tex, line 22
[Time-unrolled causal realization] A time-unrolled causal realization is a structural causal model M = ( U, V,F, P_U) whose endogenous variables include the local states, messages, actions, artifacts, target variables, and a measurable workspace extractor π_t: S_t→ W_t, W_t=π_t(S_t). The unrolled graph is acyclic even when the rolled process is recurrent.
Exact mathematical passage
\pi_t:\mathsf S_t\to\mathsf W_t, \qquad W_t=\pi_t(S_t).
\mathsf W_t^\circDefinition passage · 2 passages
Search aliases: W_t^∘ mathsf circ
Definition passage: Feasible implementation intervention · 08-causal-efficacy-and-reentry.tex, line 32
[Feasible implementation intervention] Let B_t denote declared background variables that should remain matched. A family {ι_w:w∈ W_t^∘} is a feasible implementation of workspace values on the experimental domain W_t^∘ when: item each ι_w acts only on declared manipulable parents, channels, or artifacts at or after time t; item the intervened realization satisfies π_t(S_t^ι_w)=w almost surely; item the background law is matched across compared interventions; and item the intervention does not dir…
Exact mathematical passage
\{\iota_w:w\in\mathsf W_t^\circ\}
\widehat BDefinition passage · 3 passages
Search aliases: widehat B widehat
Definition passage: Formation system · 14-scaffolded-and-endogenous-formation.tex, line 41
is its internal random seed or stochastic state; item widehatθ= L(Σ, D_form,Ω) is the learned organization; item D_cert is held-out certification data; and item I_form is a declared family of interventions on scaffold and formation history. The learned organization is decomposed as widehatθ = ( widehat V, widehat E, widehat H, widehat P, widehat O, widehat B ), where widehat B is a learned operational boundary.
Exact mathematical passage
\widehat\theta = \bigl( \widehat V, \widehat E, \widehat H, \widehat P, \widehat{\mathcal O}, \widehat B \bigr),
\widehat EDefinition passage · 2 passages
Search aliases: widehat E widehat
Definition passage: Formation system · 14-scaffolded-and-endogenous-formation.tex, line 41
is its internal random seed or stochastic state; item widehatθ= L(Σ, D_form,Ω) is the learned organization; item D_cert is held-out certification data; and item I_form is a declared family of interventions on scaffold and formation history. The learned organization is decomposed as widehatθ = ( widehat V, widehat E, widehat H, widehat P, widehat O, widehat B ), where widehat B is a learned operational boundary.
Exact mathematical passage
\widehat\theta = \bigl( \widehat V, \widehat E, \widehat H, \widehat P, \widehat{\mathcal O}, \widehat B \bigr),
\widehat HDefinition passage · 9 passages
Search aliases: widehat H widehat
Definition passage: Formation system · 14-scaffolded-and-endogenous-formation.tex, line 41
is its internal random seed or stochastic state; item widehatθ= L(Σ, D_form,Ω) is the learned organization; item D_cert is held-out certification data; and item I_form is a declared family of interventions on scaffold and formation history. The learned organization is decomposed as widehatθ = ( widehat V, widehat E, widehat H, widehat P, widehat O, widehat B ), where widehat B is a learned operational boundary.
Exact mathematical passage
\widehat\theta = \bigl( \widehat V, \widehat E, \widehat H, \widehat P, \widehat{\mathcal O}, \widehat B \bigr),
\widehat{\mathcal O}Definition passage · 1 passage
Search aliases: widehat O widehat mathcal
Definition passage: Formation system · 14-scaffolded-and-endogenous-formation.tex, line 41
is its internal random seed or stochastic state; item widehatθ= L(Σ, D_form,Ω) is the learned organization; item D_cert is held-out certification data; and item I_form is a declared family of interventions on scaffold and formation history. The learned organization is decomposed as widehatθ = ( widehat V, widehat E, widehat H, widehat P, widehat O, widehat B ), where widehat B is a learned operational boundary.
Exact mathematical passage
\widehat\theta = \bigl( \widehat V, \widehat E, \widehat H, \widehat P, \widehat{\mathcal O}, \widehat B \bigr),
\widehat PDefinition passage · 2 passages
Search aliases: widehat P widehat
Definition passage: Formation system · 14-scaffolded-and-endogenous-formation.tex, line 41
is its internal random seed or stochastic state; item widehatθ= L(Σ, D_form,Ω) is the learned organization; item D_cert is held-out certification data; and item I_form is a declared family of interventions on scaffold and formation history. The learned organization is decomposed as widehatθ = ( widehat V, widehat E, widehat H, widehat P, widehat O, widehat B ), where widehat B is a learned operational boundary.
Exact mathematical passage
\widehat\theta = \bigl( \widehat V, \widehat E, \widehat H, \widehat P, \widehat{\mathcal O}, \widehat B \bigr),
\widehat VDefinition passage · 6 passages
Search aliases: widehat V widehat
Definition passage: Formation system · 14-scaffolded-and-endogenous-formation.tex, line 41
is its internal random seed or stochastic state; item widehatθ= L(Σ, D_form,Ω) is the learned organization; item D_cert is held-out certification data; and item I_form is a declared family of interventions on scaffold and formation history. The learned organization is decomposed as widehatθ = ( widehat V, widehat E, widehat H, widehat P, widehat O, widehat B ), where widehat B is a learned operational boundary.
Exact mathematical passage
\widehat\theta = \bigl( \widehat V, \widehat E, \widehat H, \widehat P, \widehat{\mathcal O}, \widehat B \bigr),
\widehat\thetaDefinition passage · 15 passages
Search aliases: widehatθ widehat theta
Definition passage: Formation system · 14-scaffolded-and-endogenous-formation.tex, line 15
[Formation system] A workspace formation system is a tuple F = ( Σ, D_form, L, Ω, widehatθ, D_cert, I_form ), where: item Σ is the externally supplied scaffold; item D_form is the formation or training history; item L is the learning or selection rule; item Ω is its internal random seed or stochastic state; item widehatθ= L(Σ, D_form,Ω) is the learned organization; item D_cert is held-out certification data; and item I_form is a declared family of interventions on scaffold and formation history.…
Exact mathematical passage
\mathfrak F = \bigl( \Sigma, \mathcal D_{\mathrm{form}}, \mathcal L, \Omega, \widehat\theta, \mathcal D_{\mathrm{cert}}, \mathcal I_{\mathrm{form}} \bigr),
\WorkspaceDefinition passage · 43 passages
Search aliases: Workspace
Definition passage: Natural workspace operators · 03-exact-shared-cores.tex, line 418
[Natural workspace operators] Define O_Workspace = { (A_i)_i∈ V: A_t(e)H_e=H_eA_s(e) ∀ e }. Categorically, O_Workspace=Nat(H,H), the algebra of natural endomorphisms of the local system.
Exact mathematical passage
\boxed{ \mathcal O_{\Workspace} = \left\{ (A_i)_{i\in V}: A_{t(e)}H_e=H_eA_{s(e)}\ \forall e \right\}. }
\Workspace_{\mathrm{stat}}Definition passage · 1 passage
Search aliases: Workspace_stat Workspace mathrm
Definition passage: Exact static equivalence · 05-gauge-invariance-and-abstract-identity.tex, line 214
[Exact static equivalence] Two static realizations are exactly gauge equivalent, R∼_stat R', when there exists an invertible family g_i such that H_e'=g_t(e)H_eg_s(e)^-1, ρ_i'(a)=g_iρ_i(a)g_i^-1. The exact static abstract workspace is Workspace_stat = [ R]_∼_stat.
Exact mathematical passage
\boxed{ \Workspace_{\mathrm{stat}} = [\mathfrak R]_{\sim_{\mathrm{stat}}}. }
XDefinition passage · 84 passages
Search aliases: X
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 30
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
\mathbf X=\{X_i\}_{i\in V}
\mathbf XDefinition passage · 3 passages
Search aliases: X mathbf
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 19
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
\mathfrak R = \bigl( G,\mathbf X,\mathbf T,\mathcal A,\boldsymbol\rho, \mathcal H,\mathcal I,\mathcal Y \bigr),
\mathsf XDefinition passage · 5 passages
Search aliases: X mathsf
Definition passage: Dynamic relational realization · 06-dynamic-workspace-theory.tex, line 16
[Dynamic relational realization] A dynamic relational realization is defined on a probability space (Ω, F, P) and consists of: item node states X_i(t)∈ X_i for i∈ V; item edge messages M_e(t)∈ M_e for e∈ E; item external inputs E_t, local actions A_i(t), and disturbances ξ_i(t),ζ_e(t); item time-dependent transfer data H_e(t), local core vectors c_i(t), and transfer Laplacians L_t=L_H(t); and item a future target Y_t^+∈ Y. All state, history, and target spaces are assumed standard Borel unless a…
Exact mathematical passage
X_i(t)\in\mathsf X_i
xDefinition passage · 45 passages
Search aliases: x
Definition passage: Code-relative history contribution · 14-scaffolded-and-endogenous-formation.tex, line 252
a declared coding or predictive model class for a learned component q. Let L_ M_q(qmid Z) be its held-out codelength given side information Z. Define e_q^MDL = [ frac L_ M_q(qmidΣ) - L_ M_q(qmidΣ, D_form) max{L_ M_q(qmidΣ),1} ]_0^1, where [x]_0^1=min{1,max{0,x}}.
Exact mathematical passage
[x]_0^1=\min\{1,\max\{0,x\}\}
X_iDefinition passage · 25 passages
Search aliases: X_i
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 30
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
\mathbf X=\{X_i\}_{i\in V}
\mathsf X_iDefinition passage · 1 passage
Search aliases: X_i mathsf
Definition passage: Dynamic relational realization · 06-dynamic-workspace-theory.tex, line 16
[Dynamic relational realization] A dynamic relational realization is defined on a probability space (Ω, F, P) and consists of: item node states X_i(t)∈ X_i for i∈ V; item edge messages M_e(t)∈ M_e for e∈ E; item external inputs E_t, local actions A_i(t), and disturbances ξ_i(t),ζ_e(t); item time-dependent transfer data H_e(t), local core vectors c_i(t), and transfer Laplacians L_t=L_H(t); and item a future target Y_t^+∈ Y. All state, history, and target spaces are assumed standard Borel unless a…
Exact mathematical passage
X_i(t)\in\mathsf X_i
\xrightarrowDefinition passage · 11 passages
Search aliases: xrightarrow
Definition passage: Exact operation-compatible transfer · 02-static-core-transfer-theory.tex, line 315
[Exact operation-compatible transfer] A core transfer H_e:C_i→ C_j is operation compatible when it is an intertwiner: H_eρ_i(a)=ρ_j(a)H_e ∀ a∈ A. Equivalently, the diagram ccc C_i · xrightarrowρ_i(a) · C_i downarrow H_e · · downarrow H_e C_j · xrightarrowρ_j(a) · C_j commutes for every a.
Exact mathematical passage
\begin{array}{ccc} C_i&\xrightarrow{\rho_i(a)}&C_i\\ \downarrow H_e&&\downarrow H_e\\ C_j&\xrightarrow{\rho_j(a)}&C_j \end{array}
\mathcal YDefinition passage · 8 passages
Search aliases: Y mathcal
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 19
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
\mathfrak R = \bigl( G,\mathbf X,\mathbf T,\mathcal A,\boldsymbol\rho, \mathcal H,\mathcal I,\mathcal Y \bigr),
\mathsf YDefinition passage · 23 passages
Search aliases: Y mathsf
Definition passage: Dynamic relational realization · 06-dynamic-workspace-theory.tex, line 22
d consists of: item node states X_i(t)∈ X_i for i∈ V; item edge messages M_e(t)∈ M_e for e∈ E; item external inputs E_t, local actions A_i(t), and disturbances ξ_i(t),ζ_e(t); item time-dependent transfer data H_e(t), local core vectors c_i(t), and transfer Laplacians L_t=L_H(t); and item a future target Y_t^+∈ Y. All state, history, and target spaces are assumed standard Borel unless a stronger topology is explicitly invoked.
Exact mathematical passage
Y_t^+\in\mathsf Y
yDefinition passage · 19 passages
Search aliases: y
Definition passage: Formation leakage · 14-scaffolded-and-endogenous-formation.tex, line 185
[Formation leakage] A certification variable Y_cert leaks into formation when the conditional law of widehatθ changes under an intervention on Y_cert that should be inaccessible during formation: L ( widehatθ mid do(Y_cert=y) ) ≠ L ( widehatθ mid do(Y_cert=y') ). A valid discovery claim requires a documented information barrier or an audit showing that this effect is absent up to tolerance.
Exact mathematical passage
\mathcal L \left( \widehat\theta \mid \operatorname{do}(Y_{\mathrm{cert}}=y) \right) \neq \mathcal L \left( \widehat\theta \mid \operatorname{do}(Y_{\mathrm{cert}}=y') \right).
y'Definition passage · 1 passage
Search aliases: y'
Definition passage: Formation leakage · 14-scaffolded-and-endogenous-formation.tex, line 185
[Formation leakage] A certification variable Y_cert leaks into formation when the conditional law of widehatθ changes under an intervention on Y_cert that should be inaccessible during formation: L ( widehatθ mid do(Y_cert=y) ) ≠ L ( widehatθ mid do(Y_cert=y') ). A valid discovery claim requires a documented information barrier or an audit showing that this effect is absent up to tolerance.
Exact mathematical passage
\mathcal L \left( \widehat\theta \mid \operatorname{do}(Y_{\mathrm{cert}}=y) \right) \neq \mathcal L \left( \widehat\theta \mid \operatorname{do}(Y_{\mathrm{cert}}=y') \right).
Y^+Definition passage · 13 passages
Search aliases: Y^+
Definition passage: Workspace specification · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 26
[Workspace specification] A workspace specification is a tuple ς = ( D, Y^+, ℓ, τ, I, N, Θ ), where: item D is the decomposition and local-access model; item Y^+ is the declared future variable or trajectory; item ℓ is the normalized loss or utility convention; item τ is the temporal horizon or horizon family; item I is the feasible intervention family; item N is the required matched-null family; and item Θ is the gate schema, direction, threshold, and indifference region used for certification.…
Exact mathematical passage
\boxed{ \varsigma = \bigl( \mathcal D, Y^+, \ell, \tau, \mathcal I, \mathcal N, \Theta \bigr), }
Y_{\mathrm{cert}}Definition passage · 3 passages
Search aliases: Y_cert mathrm
Definition passage: Formation leakage · 14-scaffolded-and-endogenous-formation.tex, line 182
[Formation leakage] A certification variable Y_cert leaks into formation when the conditional law of widehatθ changes under an intervention on Y_cert that should be inaccessible during formation: L ( widehatθ mid do(Y_cert=y) ) ≠ L ( widehatθ mid do(Y_cert=y') ). A valid discovery claim requires a documented information barrier or an audit showing that this effect is absent up to tolerance.
Exact mathematical passage
Y_{\mathrm{cert}}
Y_t^+Definition passage · 59 passages
Search aliases: Y_t^+
Definition passage: Dynamic relational realization · 06-dynamic-workspace-theory.tex, line 22
d consists of: item node states X_i(t)∈ X_i for i∈ V; item edge messages M_e(t)∈ M_e for e∈ E; item external inputs E_t, local actions A_i(t), and disturbances ξ_i(t),ζ_e(t); item time-dependent transfer data H_e(t), local core vectors c_i(t), and transfer Laplacians L_t=L_H(t); and item a future target Y_t^+∈ Y. All state, history, and target spaces are assumed standard Borel unless a stronger topology is explicitly invoked.
Exact mathematical passage
Y_t^+\in\mathsf Y
ZDefinition passage · 54 passages
Search aliases: Z
Definition passage: Predictive kernel and canonical state · 06-dynamic-workspace-theory.tex, line 131
d Y be standard Borel spaces. A regular conditional kernel is a measurable map K_t: H_t× B( Y)→[0,1] satisfying K_t(h,A) = P(Y_t^+∈ Amid H_t=h) for P_ H_t-almost every h. Let P( Y) carry its evaluation sigma-algebra. The canonical predictive state is the random probability measure Z_t = K_t( H_t,·) ∈ P( Y). Two histories are predictively equivalent precisely when they induce the same conditional law of Y_t^+.
Exact mathematical passage
\boxed{ Z_t = K_t(\mathbf H_t,\cdot) \in \mathcal P(\mathsf Y). }
Z_tDefinition passage · 29 passages
Search aliases: Z_t
Definition passage: Predictive kernel and canonical state · 06-dynamic-workspace-theory.tex, line 131
d Y be standard Borel spaces. A regular conditional kernel is a measurable map K_t: H_t× B( Y)→[0,1] satisfying K_t(h,A) = P(Y_t^+∈ Amid H_t=h) for P_ H_t-almost every h. Let P( Y) carry its evaluation sigma-algebra. The canonical predictive state is the random probability measure Z_t = K_t( H_t,·) ∈ P( Y). Two histories are predictively equivalent precisely when they induce the same conditional law of Y_t^+.
Exact mathematical passage
\boxed{ Z_t = K_t(\mathbf H_t,\cdot) \in \mathcal P(\mathsf Y). }
Z_t^{\mathcal I}Definition passage · 7 passages
Search aliases: Z_t^ I mathcal
Definition passage: Exact structural--operational alignment · 06-dynamic-workspace-theory.tex, line 386
[Exact structural--operational alignment] The candidate W_t is observationally aligned when there exists a measurable map ϕ_t such that Z_t=ϕ_t(W_t) a.s. It is I-causally aligned when Z_t^ I=ϕ_t^ I(W_t) a.s.
Exact mathematical passage
Z_t^{\mathcal I}=\phi_t^{\mathcal I}(W_t) \qquad\text{a.s.}
\cdotDefinition passage · 25 passages
Search aliases: · cdot
Definition passage: Predictive kernel and canonical state · 06-dynamic-workspace-theory.tex, line 131
d Y be standard Borel spaces. A regular conditional kernel is a measurable map K_t: H_t× B( Y)→[0,1] satisfying K_t(h,A) = P(Y_t^+∈ Amid H_t=h) for P_ H_t-almost every h. Let P( Y) carry its evaluation sigma-algebra. The canonical predictive state is the random probability measure Z_t = K_t( H_t,·) ∈ P( Y). Two histories are predictively equivalent precisely when they induce the same conditional law of Y_t^+.
Exact mathematical passage
\boxed{ Z_t = K_t(\mathbf H_t,\cdot) \in \mathcal P(\mathsf Y). }
\timesDefinition passage · 6 passages
Search aliases: × times
Definition passage: Predictive kernel and canonical state · 06-dynamic-workspace-theory.tex, line 119
[Predictive kernel and canonical state] Let H_t and Y be standard Borel spaces. A regular conditional kernel is a measurable map K_t: H_t× B( Y)→[0,1] satisfying K_t(h,A) = P(Y_t^+∈ Amid H_t=h) for P_ H_t-almost every h. Let P( Y) carry its evaluation sigma-algebra. The canonical predictive state is the random probability measure Z_t = K_t( H_t,·) ∈ P( Y). Two histories are predictively equivalent precisely when they induce the same conditional law of Y_t^+.
Exact mathematical passage
K_t:\mathsf H_t\times\mathcal B(\mathsf Y)\to[0,1]
\alphaDefinition passage · 120 passages
Search aliases: α alpha
Definition passage: Finite workspace cover · 13-gluing-and-workspaces-of-workspaces.tex, line 34
[Finite workspace cover] A finite family of subgraphs U={G_α}_α∈ A is an edge-complete workspace cover of G when V=⋃_α∈ AV_α, E=⋃_α∈ AE_α. Every edge in E_α carries the transfer inherited from G. For a nonempty finite index set I={α_0,…,α_p}⊆ A, define the intersection subgraph G_I = G_α_0⋯α_p := ⋂_α∈ IG_α by intersecting both vertex and edge sets. Isolated vertices are retained.
Exact mathematical passage
\mathcal U=\{G_\alpha\}_{\alpha\in A}
\alpha_0Definition passage · 7 passages
Search aliases: α_0 alpha
Definition passage: Finite workspace cover · 13-gluing-and-workspaces-of-workspaces.tex, line 45
[Finite workspace cover] A finite family of subgraphs U={G_α}_α∈ A is an edge-complete workspace cover of G when V=⋃_α∈ AV_α, E=⋃_α∈ AE_α. Every edge in E_α carries the transfer inherited from G. For a nonempty finite index set I={α_0,…,α_p}⊆ A, define the intersection subgraph G_I = G_α_0⋯α_p := ⋂_α∈ IG_α by intersecting both vertex and edge sets. Isolated vertices are retained.
Exact mathematical passage
I=\{\alpha_0,\ldots,\alpha_p\}\subseteq A,
\alpha_pDefinition passage · 5 passages
Search aliases: α_p alpha
Definition passage: Finite workspace cover · 13-gluing-and-workspaces-of-workspaces.tex, line 45
[Finite workspace cover] A finite family of subgraphs U={G_α}_α∈ A is an edge-complete workspace cover of G when V=⋃_α∈ AV_α, E=⋃_α∈ AE_α. Every edge in E_α carries the transfer inherited from G. For a nonempty finite index set I={α_0,…,α_p}⊆ A, define the intersection subgraph G_I = G_α_0⋯α_p := ⋂_α∈ IG_α by intersecting both vertex and edge sets. Isolated vertices are retained.
Exact mathematical passage
I=\{\alpha_0,\ldots,\alpha_p\}\subseteq A,
\GammaDefinition passage · 56 passages
Search aliases: Γ Gamma
Definition passage: Global compatible section · 03-exact-shared-cores.tex, line 13
[Global compatible section] The exact structural workspace is Γ(H) = { (c_i)_i∈ V∈⊕_i∈ VC_i: c_t(e)=H_ec_s(e) ∀ e∈ E }. An element c=(c_i)∈Γ(H) is a global compatible section.
Exact mathematical passage
\boxed{ \Gamma(H) = \left\{ (c_i)_{i\in V}\in\bigoplus_{i\in V}C_i: \ c_{t(e)}=H_ec_{s(e)}\ \forall e\in E \right\}. }
\Gamma_\varepsilonDefinition passage · 5 passages
Search aliases: Γ_ε Gamma varepsilon
Definition passage: Threshold workspace · 04-approximate-workspaces.tex, line 176
[Threshold workspace] For ε≥0, define Γ_ε(H) = ran P_[0,ε](L_H). Its dimension is d_ε = #{k:λ_k≤ε}. When 0<d_ε<N, define the boundary gap g_ε = λ_d_ε+1-λ_d_ε.
Exact mathematical passage
\boxed{ \Gamma_\varepsilon(H) = \ran P_{[0,\varepsilon]}(L_H). }
\delta^0Definition passage · 25 passages
Search aliases: δ^0 delta
Definition passage: Descent-faithful compression · 13-gluing-and-workspaces-of-workspaces.tex, line 801
[Descent-faithful compression] The compression is descent-faithful in degree zero when the induced map H^0(Q): kerδ^0 ⟶ keroverlineδ^0 is an isomorphism.
Exact mathematical passage
\boxed{ H^0(Q): \ker\delta^0 \longrightarrow \ker\overline\delta^0 }
\varepsilonDefinition passage · 126 passages
Search aliases: ε varepsilon
Definition passage: Threshold workspace · 04-approximate-workspaces.tex, line 175
[Threshold workspace] For ε≥0, define Γ_ε(H) = ran P_[0,ε](L_H). Its dimension is d_ε = #{k:λ_k≤ε}. When 0<d_ε<N, define the boundary gap g_ε = λ_d_ε+1-λ_d_ε.
Exact mathematical passage
\varepsilon\geq0
\zetaDefinition passage · 8 passages
Search aliases: ζ zeta
Definition passage: Dynamic relational realization · 06-dynamic-workspace-theory.tex, line 19
tion[Dynamic relational realization] A dynamic relational realization is defined on a probability space (Ω, F, P) and consists of: item node states X_i(t)∈ X_i for i∈ V; item edge messages M_e(t)∈ M_e for e∈ E; item external inputs E_t, local actions A_i(t), and disturbances ξ_i(t),ζ_e(t); item time-dependent transfer data H_e(t), local core vectors c_i(t), and transfer Laplacians L_t=L_H(t); and item a future target Y_t^+∈ Y. All state, history, and target spaces are assumed standard Borel unle…
Exact mathematical passage
\xi_i(t),\zeta_e(t)
\zeta_eDefinition passage · 2 passages
Search aliases: ζ_e zeta
Definition passage: Dynamic relational realization · 06-dynamic-workspace-theory.tex, line 19
tion[Dynamic relational realization] A dynamic relational realization is defined on a probability space (Ω, F, P) and consists of: item node states X_i(t)∈ X_i for i∈ V; item edge messages M_e(t)∈ M_e for e∈ E; item external inputs E_t, local actions A_i(t), and disturbances ξ_i(t),ζ_e(t); item time-dependent transfer data H_e(t), local core vectors c_i(t), and transfer Laplacians L_t=L_H(t); and item a future target Y_t^+∈ Y. All state, history, and target spaces are assumed standard Borel unle…
Exact mathematical passage
\xi_i(t),\zeta_e(t)
\ThetaDefinition passage · 29 passages
Search aliases: Θ Theta
Definition passage: Workspace specification · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 26
[Workspace specification] A workspace specification is a tuple ς = ( D, Y^+, ℓ, τ, I, N, Θ ), where: item D is the decomposition and local-access model; item Y^+ is the declared future variable or trajectory; item ℓ is the normalized loss or utility convention; item τ is the temporal horizon or horizon family; item I is the feasible intervention family; item N is the required matched-null family; and item Θ is the gate schema, direction, threshold, and indifference region used for certification.…
Exact mathematical passage
\boxed{ \varsigma = \bigl( \mathcal D, Y^+, \ell, \tau, \mathcal I, \mathcal N, \Theta \bigr), }
\iotaDefinition passage · 43 passages
Search aliases: ι iota
Definition passage: Feasible implementation intervention · 08-causal-efficacy-and-reentry.tex, line 32
[Feasible implementation intervention] Let B_t denote declared background variables that should remain matched. A family {ι_w:w∈ W_t^∘} is a feasible implementation of workspace values on the experimental domain W_t^∘ when: item each ι_w acts only on declared manipulable parents, channels, or artifacts at or after time t; item the intervened realization satisfies π_t(S_t^ι_w)=w almost surely; item the background law is matched across compared interventions; and item the intervention does not dir…
Exact mathematical passage
\{\iota_w:w\in\mathsf W_t^\circ\}
\iota_hDefinition passage · 2 passages
Search aliases: ι_h iota
Definition passage: Causal formation sensitivity · 14-scaffolded-and-endogenous-formation.tex, line 261
[Causal formation sensitivity] Let ι_h and ι_h' be matched feasible interventions that alter formation history while preserving the scaffold, randomization law, sample size, and intervention cost. For a divergence D, define e_q^causal = E_(h,h')∼ν_q D ( L^ι_h(q), L^ι_h'(q) ). A common null uses temporally or relationally shuffled histories that preserve local marginals but destroy the candidate formation signal.
Exact mathematical passage
\iota_h
\iota_{h'}Definition passage · 2 passages
Search aliases: ι_h' iota
Definition passage: Causal formation sensitivity · 14-scaffolded-and-endogenous-formation.tex, line 261
[Causal formation sensitivity] Let ι_h and ι_h' be matched feasible interventions that alter formation history while preserving the scaffold, randomization law, sample size, and intervention cost. For a divergence D, define e_q^causal = E_(h,h')∼ν_q D ( L^ι_h(q), L^ι_h'(q) ). A common null uses temporally or relationally shuffled histories that preserve local marginals but destroy the candidate formation signal.
Exact mathematical passage
\iota_{h'}
\iota_wDefinition passage · 8 passages
Search aliases: ι_w iota
Definition passage: Feasible implementation intervention · 08-causal-efficacy-and-reentry.tex, line 32
[Feasible implementation intervention] Let B_t denote declared background variables that should remain matched. A family {ι_w:w∈ W_t^∘} is a feasible implementation of workspace values on the experimental domain W_t^∘ when: item each ι_w acts only on declared manipulable parents, channels, or artifacts at or after time t; item the intervened realization satisfies π_t(S_t^ι_w)=w almost surely; item the background law is matched across compared interventions; and item the intervention does not dir…
Exact mathematical passage
\{\iota_w:w\in\mathsf W_t^\circ\}
\lambdaDefinition passage · 73 passages
Search aliases: λ lambda
Definition passage: Threshold workspace · 04-approximate-workspaces.tex, line 184
[Threshold workspace] For ε≥0, define Γ_ε(H) = ran P_[0,ε](L_H). Its dimension is d_ε = #{k:λ_k≤ε}. When 0<d_ε<N, define the boundary gap g_ε = λ_d_ε+1-λ_d_ε.
Exact mathematical passage
d_\varepsilon = \#\{k:\lambda_k\leq\varepsilon\}.
\lambda_{d_\varepsilon}Definition passage · 1 passage
Search aliases: λ_d_ε lambda varepsilon
Definition passage: Threshold workspace · 04-approximate-workspaces.tex, line 190
[Threshold workspace] For ε≥0, define Γ_ε(H) = ran P_[0,ε](L_H). Its dimension is d_ε = #{k:λ_k≤ε}. When 0<d_ε<N, define the boundary gap g_ε = λ_d_ε+1-λ_d_ε.
Exact mathematical passage
\boxed{ g_\varepsilon = \lambda_{d_\varepsilon+1}-\lambda_{d_\varepsilon}. }
\lambda_{d_\varepsilon+1}Definition passage · 1 passage
Search aliases: λ_d_ε+1 lambda varepsilon
Definition passage: Threshold workspace · 04-approximate-workspaces.tex, line 190
[Threshold workspace] For ε≥0, define Γ_ε(H) = ran P_[0,ε](L_H). Its dimension is d_ε = #{k:λ_k≤ε}. When 0<d_ε<N, define the boundary gap g_ε = λ_d_ε+1-λ_d_ε.
Exact mathematical passage
\boxed{ g_\varepsilon = \lambda_{d_\varepsilon+1}-\lambda_{d_\varepsilon}. }
\lambda_kDefinition passage · 8 passages
Search aliases: λ_k lambda
Definition passage: Threshold workspace · 04-approximate-workspaces.tex, line 184
[Threshold workspace] For ε≥0, define Γ_ε(H) = ran P_[0,ε](L_H). Its dimension is d_ε = #{k:λ_k≤ε}. When 0<d_ε<N, define the boundary gap g_ε = λ_d_ε+1-λ_d_ε.
Exact mathematical passage
d_\varepsilon = \#\{k:\lambda_k\leq\varepsilon\}.
\nuDefinition passage · 18 passages
Search aliases: ν nu
Definition passage: Causal formation sensitivity · 14-scaffolded-and-endogenous-formation.tex, line 264
[Causal formation sensitivity] Let ι_h and ι_h' be matched feasible interventions that alter formation history while preserving the scaffold, randomization law, sample size, and intervention cost. For a divergence D, define e_q^causal = E_(h,h')∼ν_q D ( L^ι_h(q), L^ι_h'(q) ). A common null uses temporally or relationally shuffled histories that preserve local marginals but destroy the candidate formation signal.
Exact mathematical passage
\boxed{ e_q^{\mathrm{causal}} = \mathbb E_{(h,h')\sim\nu_q} D\!\left( \mathcal L^{\iota_h}(q), \mathcal L^{\iota_{h'}}(q) \right). }
\nu_qDefinition passage · 1 passage
Search aliases: ν_q nu
Definition passage: Causal formation sensitivity · 14-scaffolded-and-endogenous-formation.tex, line 264
[Causal formation sensitivity] Let ι_h and ι_h' be matched feasible interventions that alter formation history while preserving the scaffold, randomization law, sample size, and intervention cost. For a divergence D, define e_q^causal = E_(h,h')∼ν_q D ( L^ι_h(q), L^ι_h'(q) ). A common null uses temporally or relationally shuffled histories that preserve local marginals but destroy the candidate formation signal.
Exact mathematical passage
\boxed{ e_q^{\mathrm{causal}} = \mathbb E_{(h,h')\sim\nu_q} D\!\left( \mathcal L^{\iota_h}(q), \mathcal L^{\iota_{h'}}(q) \right). }
\xiDefinition passage · 13 passages
Search aliases: ξ xi
Definition passage: Dynamic relational realization · 06-dynamic-workspace-theory.tex, line 19
tion[Dynamic relational realization] A dynamic relational realization is defined on a probability space (Ω, F, P) and consists of: item node states X_i(t)∈ X_i for i∈ V; item edge messages M_e(t)∈ M_e for e∈ E; item external inputs E_t, local actions A_i(t), and disturbances ξ_i(t),ζ_e(t); item time-dependent transfer data H_e(t), local core vectors c_i(t), and transfer Laplacians L_t=L_H(t); and item a future target Y_t^+∈ Y. All state, history, and target spaces are assumed standard Borel unle…
Exact mathematical passage
\xi_i(t),\zeta_e(t)
\xi_iDefinition passage · 2 passages
Search aliases: ξ_i xi
Definition passage: Dynamic relational realization · 06-dynamic-workspace-theory.tex, line 19
tion[Dynamic relational realization] A dynamic relational realization is defined on a probability space (Ω, F, P) and consists of: item node states X_i(t)∈ X_i for i∈ V; item edge messages M_e(t)∈ M_e for e∈ E; item external inputs E_t, local actions A_i(t), and disturbances ξ_i(t),ζ_e(t); item time-dependent transfer data H_e(t), local core vectors c_i(t), and transfer Laplacians L_t=L_H(t); and item a future target Y_t^+∈ Y. All state, history, and target spaces are assumed standard Borel unle…
Exact mathematical passage
\xi_i(t),\zeta_e(t)
\PiDefinition passage · 41 passages
Search aliases: Π Pi
Definition passage: Boundary problem · 15-boundary-formation-and-stability.tex, line 13
[Boundary problem] A boundary problem is a tuple B = ( V, S, τ, Y, I, Π, G_B ), where S⊆2^V is the admissible candidate family, τ is the temporal scale, Y is the operational target, I is the feasible intervention family, Π is the environment distribution, and G_B is a symmetry group under which boundaries are considered equivalent.
Exact mathematical passage
\mathfrak B = \left( V, \mathfrak S, \tau, \mathcal Y, \mathcal I, \Pi, \mathcal G_B \right),
\piDefinition passage · 22 passages
Search aliases: π pi
Definition passage: Time-unrolled causal realization · 08-causal-efficacy-and-reentry.tex, line 22
[Time-unrolled causal realization] A time-unrolled causal realization is a structural causal model M = ( U, V,F, P_U) whose endogenous variables include the local states, messages, actions, artifacts, target variables, and a measurable workspace extractor π_t: S_t→ W_t, W_t=π_t(S_t). The unrolled graph is acyclic even when the rolled process is recurrent.
Exact mathematical passage
\pi_t:\mathsf S_t\to\mathsf W_t, \qquad W_t=\pi_t(S_t).
\pi_tDefinition passage · 7 passages
Search aliases: π_t pi
Definition passage: Time-unrolled causal realization · 08-causal-efficacy-and-reentry.tex, line 22
[Time-unrolled causal realization] A time-unrolled causal realization is a structural causal model M = ( U, V,F, P_U) whose endogenous variables include the local states, messages, actions, artifacts, target variables, and a measurable workspace extractor π_t: S_t→ W_t, W_t=π_t(S_t). The unrolled graph is acyclic even when the rolled process is recurrent.
Exact mathematical passage
\pi_t:\mathsf S_t\to\mathsf W_t, \qquad W_t=\pi_t(S_t).
\boldsymbol\rhoDefinition passage · 3 passages
Search aliases: ρ boldsymbol rho
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 19
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
\mathfrak R = \bigl( G,\mathbf X,\mathbf T,\mathcal A,\boldsymbol\rho, \mathcal H,\mathcal I,\mathcal Y \bigr),
\rhoDefinition passage · 60 passages
Search aliases: ρ rho
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 33
ple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family of downstream variables relative to which causal and predictive …
Exact mathematical passage
\boldsymbol\rho=\{\rho_i\}_{i\in V}
\rho_iDefinition passage · 16 passages
Search aliases: ρ_i rho
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 33
ple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family of downstream variables relative to which causal and predictive …
Exact mathematical passage
\boldsymbol\rho=\{\rho_i\}_{i\in V}
\rho_i'Definition passage · 1 passage
Search aliases: ρ_i' rho
Definition passage: Exact static equivalence · 05-gauge-invariance-and-abstract-identity.tex, line 208
[Exact static equivalence] Two static realizations are exactly gauge equivalent, R∼_stat R', when there exists an invertible family g_i such that H_e'=g_t(e)H_eg_s(e)^-1, ρ_i'(a)=g_iρ_i(a)g_i^-1. The exact static abstract workspace is Workspace_stat = [ R]_∼_stat.
Exact mathematical passage
H_e'=g_{t(e)}H_eg_{s(e)}^{-1}, \qquad \rho_i'(a)=g_i\rho_i(a)g_i^{-1}.
\rho_jDefinition passage · 6 passages
Search aliases: ρ_j rho
Definition passage: Exact operation-compatible transfer · 02-static-core-transfer-theory.tex, line 307
[Exact operation-compatible transfer] A core transfer H_e:C_i→ C_j is operation compatible when it is an intertwiner: H_eρ_i(a)=ρ_j(a)H_e ∀ a∈ A. Equivalently, the diagram ccc C_i · xrightarrowρ_i(a) · C_i
Exact mathematical passage
\boxed{ H_e\rho_i(a)=\rho_j(a)H_e } \qquad \forall a\in\mathcal A.
\rho_VDefinition passage · 12 passages
Search aliases: ρ_V rho
Definition passage: Exact structural correspondence · 12-identity-through-time-and-replacement.tex, line 39
[Exact structural correspondence] The correspondence is structurally exact when D'J_V=J_ED. It is operation exact for a∈ A when ρ_V'(a)J_V=J_Vρ_V(a).
Exact mathematical passage
\boxed{\rho_V'(a)J_V=J_V\rho_V(a).}
\rho_V'Definition passage · 3 passages
Search aliases: ρ_V' rho
Definition passage: Exact structural correspondence · 12-identity-through-time-and-replacement.tex, line 39
[Exact structural correspondence] The correspondence is structurally exact when D'J_V=J_ED. It is operation exact for a∈ A when ρ_V'(a)J_V=J_Vρ_V(a).
Exact mathematical passage
\boxed{\rho_V'(a)J_V=J_V\rho_V(a).}
\SigmaDefinition passage · 27 passages
Search aliases: Σ Sigma
Definition passage: Formation system · 14-scaffolded-and-endogenous-formation.tex, line 15
[Formation system] A workspace formation system is a tuple F = ( Σ, D_form, L, Ω, widehatθ, D_cert, I_form ), where: item Σ is the externally supplied scaffold; item D_form is the formation or training history; item L is the learning or selection rule; item Ω is its internal random seed or stochastic state; item widehatθ= L(Σ, D_form,Ω) is the learned organization; item D_cert is held-out certification data; and item I_form is a declared family of interventions on scaffold and formation history.…
Exact mathematical passage
\mathfrak F = \bigl( \Sigma, \mathcal D_{\mathrm{form}}, \mathcal L, \Omega, \widehat\theta, \mathcal D_{\mathrm{cert}}, \mathcal I_{\mathrm{form}} \bigr),
\sigmaDefinition passage · 34 passages
Search aliases: σ sigma
Definition passage: System decomposition · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 43
declared local-access map for block B_α, producing the local state or history available at that component; item G_Π records the declared communication, transfer, and causal interfaces among the blocks; and item I_Π is the family of feasible interventions at that resolution. The accessible information of component α is the sigma-field mathscr F_α^ D = σ (O_α( H_t)). Every shared bus, common memory, supervisor, or artifact that can alter more than one local state must appear either as its own carr…
Exact mathematical passage
\mathscr F_\alpha^{\mathcal D} = \sigma\!\left(O_\alpha(\mathbf H_t)\right).
\varsigmaDefinition passage · 61 passages
Search aliases: ς varsigma
Definition passage: Workspace specification · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 26
[Workspace specification] A workspace specification is a tuple ς = ( D, Y^+, ℓ, τ, I, N, Θ ), where: item D is the decomposition and local-access model; item Y^+ is the declared future variable or trajectory; item ℓ is the normalized loss or utility convention; item τ is the temporal horizon or horizon family; item I is the feasible intervention family; item N is the required matched-null family; and item Θ is the gate schema, direction, threshold, and indifference region used for certification.…
Exact mathematical passage
\boxed{ \varsigma = \bigl( \mathcal D, Y^+, \ell, \tau, \mathcal I, \mathcal N, \Theta \bigr), }
\varsigma'Definition passage · 5 passages
Search aliases: ς' varsigma
Definition passage: Specification equivalence · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 108
[Specification equivalence] Two specifications ς and ς' are equivalent, written ς≃_specς', when there are bijective transport maps that: item preserve the sigma-field generated by the future target; item preserve the ordering and normalization of decisions under the loss; item map feasible interventions to physically equivalent interventions; item map every required null to a null preserving the same quantities; and item carry every gate threshold and margin into its counterpart.
Exact mathematical passage
\varsigma'
\varsigma_0Definition passage · 15 passages
Search aliases: ς_0 varsigma
Definition passage: Specification-specific, robust, and fragile claims · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 241
item[Specification-specific] when it is asserted only for one declared ς_0. item[Specification-robust] when every required gate has positive lower envelope across S. item[Specification-fragile] when it passes for at least one admissible specification and fails for at least one other.
Exact mathematical passage
\varsigma_0
\phiDefinition passage · 23 passages
Search aliases: ϕ phi
Definition passage: Exact structural--operational alignment · 06-dynamic-workspace-theory.tex, line 380
[Exact structural--operational alignment] The candidate W_t is observationally aligned when there exists a measurable map ϕ_t such that Z_t=ϕ_t(W_t) a.s. It is I-causally aligned when Z_t^ I=ϕ_t^ I(W_t) a.s.
Exact mathematical passage
\phi_t
\phi_tDefinition passage · 6 passages
Search aliases: ϕ_t phi
Definition passage: Exact structural--operational alignment · 06-dynamic-workspace-theory.tex, line 380
[Exact structural--operational alignment] The candidate W_t is observationally aligned when there exists a measurable map ϕ_t such that Z_t=ϕ_t(W_t) a.s. It is I-causally aligned when Z_t^ I=ϕ_t^ I(W_t) a.s.
Exact mathematical passage
\phi_t
\phi_t^{\mathcal I}Definition passage · 1 passage
Search aliases: ϕ_t^ I phi mathcal
Definition passage: Exact structural--operational alignment · 06-dynamic-workspace-theory.tex, line 386
[Exact structural--operational alignment] The candidate W_t is observationally aligned when there exists a measurable map ϕ_t such that Z_t=ϕ_t(W_t) a.s. It is I-causally aligned when Z_t^ I=ϕ_t^ I(W_t) a.s.
Exact mathematical passage
Z_t^{\mathcal I}=\phi_t^{\mathcal I}(W_t) \qquad\text{a.s.}
\psiDefinition passage · 5 passages
Search aliases: ψ psi
Definition passage: Experimental equivalence · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 441
[Experimental equivalence] Two realizations are experimentally equivalent under E, written R≡_ E R', when P_ R^ E = P_ R'^ E. A property ψ( R) is identifiable on a model class M under E when it is constant on every ≡_ E-equivalence class contained in M.
Exact mathematical passage
\psi(\mathfrak R)
\OmegaDefinition passage · 16 passages
Search aliases: Ω Omega
Definition passage: Dynamic relational realization · 06-dynamic-workspace-theory.tex, line 14
[Dynamic relational realization] A dynamic relational realization is defined on a probability space (Ω, F, P) and consists of: item node states X_i(t)∈ X_i for i∈ V; item edge messages M_e(t)∈ M_e for e∈ E; item external inputs E_t, local actions A_i(t), and disturbances ξ_i(t),ζ_e(t); item time-dependent transfer data H_e(t), local core vectors c_i(t), and transfer Laplacians L_t=L_H(t); and item a future target Y_t^+∈ Y. All state, history, and target spaces are assumed standard Borel unless a…
Exact mathematical passage
(\Omega,\mathcal F,\mathbb P)
\ellDefinition passage · 54 passages
Search aliases: ℓ ell
Definition passage: Relational witness pair · 07-relational-irreducibility.tex, line 366
[Relational witness pair] A pair of laws (P,Q) is a predictive relational witness pair for the decomposition V and target Y_t^+ when Q∈ N_pred(P) but Risk_ℓ,Q(V) ≠ Risk_ℓ,P(V). The two systems agree on every single-node predictive marginal but differ in full-system operative capacity.
Exact mathematical passage
\Risk_{\ell,Q}(V) \neq \Risk_{\ell,P}(V).
\forallDefinition passage · 11 passages
Search aliases: ∀ forall
Definition passage: Relational instantiation · 01-foundational-thesis.tex, line 136
[Relational instantiation] A workspace is relationally instantiated relative to the decomposition V when no single projection determines its equivalence class: ∀ i∈ V, ∃ R, R' such that pr_i( R)=pr_i( R') but [ R]_≃≠[ R']_≃.
Exact mathematical passage
\forall i\in V,\quad \exists\mathfrak R,\mathfrak R'
\existsDefinition passage · 2 passages
Search aliases: ∃ exists
Definition passage: Relational instantiation · 01-foundational-thesis.tex, line 136
[Relational instantiation] A workspace is relationally instantiated relative to the decomposition V when no single projection determines its equivalence class: ∀ i∈ V, ∃ R, R' such that pr_i( R)=pr_i( R') but [ R]_≃≠[ R']_≃.
Exact mathematical passage
\forall i\in V,\quad \exists\mathfrak R,\mathfrak R'
\inDefinition passage · 250 passages
Search aliases: ∈ in
Definition passage: Concrete realization · 01-foundational-thesis.tex, line 30
[Concrete realization] A concrete relational realization is a tuple R = ( G, X, T, A,ρ, H, I, Y ), where: item G=(V,E,s,t) is an interaction graph; item X={X_i}_i∈ V is a family of local state spaces; item T={T_e}_e∈ E is a family of transfer maps; item A is an algebra of admissible operations; item ρ={ρ_i}_i∈ V gives the local realization of those operations; item H is the temporally ordered interaction history; item I is a specified family of admissible interventions; and item Y is the family …
Exact mathematical passage
\mathbf X=\{X_i\}_{i\in V}
\sumDefinition passage · 39 passages
Search aliases: ∑ sum
Definition passage: Transfer discrepancy · 04-approximate-workspaces.tex, line 35
[Transfer discrepancy] The transfer discrepancy operator is D_H: C_V⟶ C_E, (D_Hc)_e = sqrtw_e(c_t(e)-H_ec_s(e)). Its squared norm is the coherence energy E_H(c) = D_Hc ^2 = ∑_e∈ Ew_e c_t(e)-H_ec_s(e) ^2. The transfer Laplacian is L_H=D_H^*D_H.
Exact mathematical passage
\boxed{ \mathcal E_H(c) = \|D_Hc\|^2 = \sum_{e\in E}w_e \left\|c_{t(e)}-H_ec_{s(e)}\right\|^2. }
\sum_{e\in E}Definition passage · 3 passages
Search aliases: ∑_e∈ E sum in
Definition passage: Transfer discrepancy · 04-approximate-workspaces.tex, line 35
[Transfer discrepancy] The transfer discrepancy operator is D_H: C_V⟶ C_E, (D_Hc)_e = sqrtw_e(c_t(e)-H_ec_s(e)). Its squared norm is the coherence energy E_H(c) = D_Hc ^2 = ∑_e∈ Ew_e c_t(e)-H_ec_s(e) ^2. The transfer Laplacian is L_H=D_H^*D_H.
Exact mathematical passage
\boxed{ \mathcal E_H(c) = \|D_Hc\|^2 = \sum_{e\in E}w_e \left\|c_{t(e)}-H_ec_{s(e)}\right\|^2. }
\circDefinition passage · 4 passages
Search aliases: ∘ circ
Definition passage: Feasible implementation intervention · 08-causal-efficacy-and-reentry.tex, line 32
[Feasible implementation intervention] Let B_t denote declared background variables that should remain matched. A family {ι_w:w∈ W_t^∘} is a feasible implementation of workspace values on the experimental domain W_t^∘ when: item each ι_w acts only on declared manipulable parents, channels, or artifacts at or after time t; item the intervened realization satisfies π_t(S_t^ι_w)=w almost surely; item the background law is matched across compared interventions; and item the intervention does not dir…
Exact mathematical passage
\{\iota_w:w\in\mathsf W_t^\circ\}
\simDefinition passage · 19 passages
Search aliases: ∼ sim
Definition passage: Exact static equivalence · 05-gauge-invariance-and-abstract-identity.tex, line 204
[Exact static equivalence] Two static realizations are exactly gauge equivalent, R∼_stat R', when there exists an invertible family g_i such that H_e'=g_t(e)H_eg_s(e)^-1, ρ_i'(a)=g_iρ_i(a)g_i^-1. The exact static abstract workspace is Workspace_stat = [ R]_∼_stat.
Exact mathematical passage
\mathfrak R\sim_{\mathrm{stat}}\mathfrak R',
\sim_{\mathrm{stat}}Definition passage · 2 passages
Search aliases: ∼_stat sim mathrm
Definition passage: Exact static equivalence · 05-gauge-invariance-and-abstract-identity.tex, line 204
[Exact static equivalence] Two static realizations are exactly gauge equivalent, R∼_stat R', when there exists an invertible family g_i such that H_e'=g_t(e)H_eg_s(e)^-1, ρ_i'(a)=g_iρ_i(a)g_i^-1. The exact static abstract workspace is Workspace_stat = [ R]_∼_stat.
Exact mathematical passage
\mathfrak R\sim_{\mathrm{stat}}\mathfrak R',
\simeqDefinition passage · 9 passages
Search aliases: ≃ simeq
Definition passage: Admissible equivalence · 01-foundational-thesis.tex, line 67
[Admissible equivalence] An admissible equivalence F: R≃ R' is a family of correspondences preserving, exactly or within a declared tolerance: · the transferable core and its dimension,
Exact mathematical passage
F:\mathfrak R\simeq\mathfrak R'
\simeq_{\mathrm{spec}}Definition passage · 2 passages
Search aliases: ≃_spec simeq mathrm
Definition passage: Specification equivalence · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 109
[Specification equivalence] Two specifications ς and ς' are equivalent, written ς≃_specς', when there are bijective transport maps that: item preserve the sigma-field generated by the future target; item preserve the ordering and normalization of decisions under the loss; item map feasible interventions to physically equivalent interventions; item map every required null to a null preserving the same quantities; and item carry every gate threshold and margin into its counterpart.
Exact mathematical passage
\varsigma\simeq_{\mathrm{spec}}\varsigma'
\neqDefinition passage · 32 passages
Search aliases: ≠ neq
Definition passage: Relational instantiation · 01-foundational-thesis.tex, line 141
[Relational instantiation] A workspace is relationally instantiated relative to the decomposition V when no single projection determines its equivalence class: ∀ i∈ V, ∃ R, R' such that pr_i( R)=pr_i( R') but [ R]_≃≠[ R']_≃.
Exact mathematical passage
\pr_i(\mathfrak R)=\pr_i(\mathfrak R') \quad\text{but}\quad [\mathfrak R]_{\simeq}\neq[\mathfrak R']_{\simeq}.
\equivDefinition passage · 5 passages
Search aliases: ≡ equiv
Definition passage: Experimental equivalence · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 432
[Experimental equivalence] Two realizations are experimentally equivalent under E, written R≡_ E R', when P_ R^ E = P_ R'^ E. A property ψ( R) is identifiable on a model class M under E when it is constant on every ≡_ E-equivalence class contained in M.
Exact mathematical passage
\mathfrak R\equiv_{\mathcal E}\mathfrak R',
\equiv_{\mathcal E}Definition passage · 3 passages
Search aliases: ≡_ E equiv mathcal
Definition passage: Experimental equivalence · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 432
[Experimental equivalence] Two realizations are experimentally equivalent under E, written R≡_ E R', when P_ R^ E = P_ R'^ E. A property ψ( R) is identifiable on a model class M under E when it is constant on every ≡_ E-equivalence class contained in M.
Exact mathematical passage
\mathfrak R\equiv_{\mathcal E}\mathfrak R',
\leqDefinition passage · 208 passages
Search aliases: ≤ leq
Definition passage: Threshold workspace · 04-approximate-workspaces.tex, line 184
[Threshold workspace] For ε≥0, define Γ_ε(H) = ran P_[0,ε](L_H). Its dimension is d_ε = #{k:λ_k≤ε}. When 0<d_ε<N, define the boundary gap g_ε = λ_d_ε+1-λ_d_ε.
Exact mathematical passage
d_\varepsilon = \#\{k:\lambda_k\leq\varepsilon\}.
\geqDefinition passage · 74 passages
Search aliases: ≥ geq
Definition passage: Threshold workspace · 04-approximate-workspaces.tex, line 175
[Threshold workspace] For ε≥0, define Γ_ε(H) = ran P_[0,ε](L_H). Its dimension is d_ε = #{k:λ_k≤ε}. When 0<d_ε<N, define the boundary gap g_ε = λ_d_ε+1-λ_d_ε.
Exact mathematical passage
\varepsilon\geq0
\subseteqDefinition passage · 41 passages
Search aliases: ⊆ subseteq
Definition passage: Finite workspace cover · 13-gluing-and-workspaces-of-workspaces.tex, line 45
[Finite workspace cover] A finite family of subgraphs U={G_α}_α∈ A is an edge-complete workspace cover of G when V=⋃_α∈ AV_α, E=⋃_α∈ AE_α. Every edge in E_α carries the transfer inherited from G. For a nonempty finite index set I={α_0,…,α_p}⊆ A, define the intersection subgraph G_I = G_α_0⋯α_p := ⋂_α∈ IG_α by intersecting both vertex and edge sets. Isolated vertices are retained.
Exact mathematical passage
I=\{\alpha_0,\ldots,\alpha_p\}\subseteq A,
\bigoplusDefinition passage · 18 passages
Search aliases: ⊕ bigoplus
Definition passage: Global compatible section · 03-exact-shared-cores.tex, line 13
[Global compatible section] The exact structural workspace is Γ(H) = { (c_i)_i∈ V∈⊕_i∈ VC_i: c_t(e)=H_ec_s(e) ∀ e∈ E }. An element c=(c_i)∈Γ(H) is a global compatible section.
Exact mathematical passage
\boxed{ \Gamma(H) = \left\{ (c_i)_{i\in V}\in\bigoplus_{i\in V}C_i: \ c_{t(e)}=H_ec_{s(e)}\ \forall e\in E \right\}. }
\oplusDefinition passage · 14 passages
Search aliases: ⊕ oplus
Definition passage: Admissible local decomposition · 02-static-core-transfer-theory.tex, line 125
[Admissible local decomposition] For every vertex i, choose an orthogonal decomposition X_i=C_i⊕ R_i, with projectors P_i:X_i→ C_i, Q_i=I-P_i:X_i→ R_i. The subspace C_i is the candidate locally realized transferable core. The subspace R_i contains substrate-specific, context-specific, or otherwise noncore degrees of freedom relative to the present analysis.
Exact mathematical passage
X_i=C_i\oplus R_i,
\bigoplus_{i\in V}Definition passage · 6 passages
Search aliases: ⊕_i∈ V bigoplus in
Definition passage: Global compatible section · 03-exact-shared-cores.tex, line 13
[Global compatible section] The exact structural workspace is Γ(H) = { (c_i)_i∈ V∈⊕_i∈ VC_i: c_t(e)=H_ec_s(e) ∀ e∈ E }. An element c=(c_i)∈Γ(H) is a global compatible section.
Exact mathematical passage
\boxed{ \Gamma(H) = \left\{ (c_i)_{i\in V}\in\bigoplus_{i\in V}C_i: \ c_{t(e)}=H_ec_{s(e)}\ \forall e\in E \right\}. }
\bigcapDefinition passage · 4 passages
Search aliases: ⋂ bigcap
Definition passage: Finite workspace cover · 13-gluing-and-workspaces-of-workspaces.tex, line 49
ver A finite family of subgraphs U={G_α}_α∈ A is an edge-complete workspace cover of G when V=⋃_α∈ AV_α, E=⋃_α∈ AE_α. Every edge in E_α carries the transfer inherited from G. For a nonempty finite index set I={α_0,…,α_p}⊆ A, define the intersection subgraph G_I = G_α_0⋯α_p := ⋂_α∈ IG_α by intersecting both vertex and edge sets. Isolated vertices are retained.
Exact mathematical passage
G_I = G_{\alpha_0\cdots\alpha_p} := \bigcap_{\alpha\in I}G_\alpha
\bigcap_{\alpha\in I}Definition passage · 1 passage
Search aliases: ⋂_α∈ I bigcap alpha in
Definition passage: Finite workspace cover · 13-gluing-and-workspaces-of-workspaces.tex, line 49
ver A finite family of subgraphs U={G_α}_α∈ A is an edge-complete workspace cover of G when V=⋃_α∈ AV_α, E=⋃_α∈ AE_α. Every edge in E_α carries the transfer inherited from G. For a nonempty finite index set I={α_0,…,α_p}⊆ A, define the intersection subgraph G_I = G_α_0⋯α_p := ⋂_α∈ IG_α by intersecting both vertex and edge sets. Isolated vertices are retained.
Exact mathematical passage
G_I = G_{\alpha_0\cdots\alpha_p} := \bigcap_{\alpha\in I}G_\alpha
\bigcupDefinition passage · 3 passages
Search aliases: ⋃ bigcup
Definition passage: Finite workspace cover · 13-gluing-and-workspaces-of-workspaces.tex, line 38
[Finite workspace cover] A finite family of subgraphs U={G_α}_α∈ A is an edge-complete workspace cover of G when V=⋃_α∈ AV_α, E=⋃_α∈ AE_α. Every edge in E_α carries the transfer inherited from G. For a nonempty finite index set I={α_0,…,α_p}⊆ A, define the intersection subgraph G_I = G_α_0⋯α_p := ⋂_α∈ IG_α by intersecting both vertex and edge sets. Isolated vertices are retained.
Exact mathematical passage
V=\bigcup_{\alpha\in A}V_\alpha, \qquad E=\bigcup_{\alpha\in A}E_\alpha.
\bigcup_{\alpha\in A}Definition passage · 1 passage
Search aliases: ⋃_α∈ A bigcup alpha in
Definition passage: Finite workspace cover · 13-gluing-and-workspaces-of-workspaces.tex, line 38
[Finite workspace cover] A finite family of subgraphs U={G_α}_α∈ A is an edge-complete workspace cover of G when V=⋃_α∈ AV_α, E=⋃_α∈ AE_α. Every edge in E_α carries the transfer inherited from G. For a nonempty finite index set I={α_0,…,α_p}⊆ A, define the intersection subgraph G_I = G_α_0⋯α_p := ⋂_α∈ IG_α by intersecting both vertex and edge sets. Isolated vertices are retained.
Exact mathematical passage
V=\bigcup_{\alpha\in A}V_\alpha, \qquad E=\bigcup_{\alpha\in A}E_\alpha.
\cdotsDefinition passage · 25 passages
Search aliases: ⋯ cdots
Definition passage: Finite workspace cover · 13-gluing-and-workspaces-of-workspaces.tex, line 49
ver A finite family of subgraphs U={G_α}_α∈ A is an edge-complete workspace cover of G when V=⋃_α∈ AV_α, E=⋃_α∈ AE_α. Every edge in E_α carries the transfer inherited from G. For a nonempty finite index set I={α_0,…,α_p}⊆ A, define the intersection subgraph G_I = G_α_0⋯α_p := ⋂_α∈ IG_α by intersecting both vertex and edge sets. Isolated vertices are retained.
Exact mathematical passage
G_I = G_{\alpha_0\cdots\alpha_p} := \bigcap_{\alpha\in I}G_\alpha
\longrightarrowDefinition passage · 31 passages
Search aliases: ⟶ longrightarrow
Definition passage: Transfer discrepancy · 04-approximate-workspaces.tex, line 27
[Transfer discrepancy] The transfer discrepancy operator is D_H: C_V⟶ C_E, (D_Hc)_e = sqrtw_e(c_t(e)-H_ec_s(e)). Its squared norm is the coherence energy E_H(c) = D_Hc ^2 = ∑_e∈ Ew_e c_t(e)-H_ec_s(e) ^2. The transfer Laplacian is L_H=D_H^*D_H.
Exact mathematical passage
D_H:\mathcal C_V\longrightarrow\mathcal C_E, \qquad (D_Hc)_e = \sqrt{w_e}\bigl(c_{t(e)}-H_ec_{s(e)}\bigr).
A_tIntroduction passage · 8 passages
Search aliases: A_t
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 601
Let V_t denote the internal value channel. A counterfactual-mediation test compares: G_t ⟶ V_t ⟶ A_t ⟶ Y_t^+. The relevant quantities include: η_G→ V, η_V→ A, η_A→ Y, δ_G→ Amid V, where the final term measures the residual goal-to-action effect after the value channel is blocked or randomized.
Exact mathematical passage
G_t \longrightarrow V_t \longrightarrow A_t \longrightarrow Y_t^+.
\mathcal A_tIntroduction passage · 7 passages
Search aliases: A_t mathcal
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 450
Let A_t(w,e) denote the actions that can be implemented from workspace state w in environment e. The interventional action value is Q_t^g(amid w,e) = E^ι_a [ U_g(Y_t^+) mid W_t=w, E_t=e, G_t=g ]. The optimal action set is A_t^*(w,g,e) = argmax_a∈ A_t(w,e)Q_t^g(amid w,e). A counterfactual evaluator is an internal state widehat Q_t = ( widehat Q_t(a) )_a∈ A_t(w,e) that estimates these intervention values. It is not enough for widehat Q_t to predict the action selected by the system. It must be val…
Exact mathematical passage
\mathcal A_t(w,e)
\mathcal A_t^*Introduction passage · 1 passage
Search aliases: A_t^* mathcal
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 465
Let A_t(w,e) denote the actions that can be implemented from workspace state w in environment e. The interventional action value is Q_t^g(amid w,e) = E^ι_a [ U_g(Y_t^+) mid W_t=w, E_t=e, G_t=g ]. The optimal action set is A_t^*(w,g,e) = argmax_a∈ A_t(w,e)Q_t^g(amid w,e). A counterfactual evaluator is an internal state widehat Q_t = ( widehat Q_t(a) )_a∈ A_t(w,e) that estimates these intervention values. It is not enough for widehat Q_t to predict the action selected by the system. It must be val…
Exact mathematical passage
\mathcal A_t^*(w,g,e) = \argmax_{a\in\mathcal A_t(w,e)}Q_t^g(a\mid w,e).
\argmaxIntroduction passage · 7 passages
Search aliases: argmax
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 465
Let A_t(w,e) denote the actions that can be implemented from workspace state w in environment e. The interventional action value is Q_t^g(amid w,e) = E^ι_a [ U_g(Y_t^+) mid W_t=w, E_t=e, G_t=g ]. The optimal action set is A_t^*(w,g,e) = argmax_a∈ A_t(w,e)Q_t^g(amid w,e). A counterfactual evaluator is an internal state widehat Q_t = ( widehat Q_t(a) )_a∈ A_t(w,e) that estimates these intervention values. It is not enough for widehat Q_t to predict the action selected by the system. It must be val…
Exact mathematical passage
\mathcal A_t^*(w,g,e) = \argmax_{a\in\mathcal A_t(w,e)}Q_t^g(a\mid w,e).
\argmax_{a\in\mathcal A_t(w,e)}Introduction passage · 1 passage
Search aliases: argmax_a∈ A_t(w,e) argmax in mathcal
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 465
Let A_t(w,e) denote the actions that can be implemented from workspace state w in environment e. The interventional action value is Q_t^g(amid w,e) = E^ι_a [ U_g(Y_t^+) mid W_t=w, E_t=e, G_t=g ]. The optimal action set is A_t^*(w,g,e) = argmax_a∈ A_t(w,e)Q_t^g(amid w,e). A counterfactual evaluator is an internal state widehat Q_t = ( widehat Q_t(a) )_a∈ A_t(w,e) that estimates these intervention values. It is not enough for widehat Q_t to predict the action selected by the system. It must be val…
Exact mathematical passage
\mathcal A_t^*(w,g,e) = \argmax_{a\in\mathcal A_t(w,e)}Q_t^g(a\mid w,e).
bIntroduction passage · 91 passages
Search aliases: b
Introduction passage · 08-causal-efficacy-and-reentry.tex, line 217
To isolate reentry, consider the unrolled causal graph and remove every direct retention edge whose source and target are both workspace variables at successive times. Let M^∖dir denote the resulting path-specific model, preserving paths that leave the workspace through a nonworkspace participant, action, message, or artifact and later return. Define η_loop(τ) = E_(w,w',b)∼ν D ( P_ M^∖dir^ι_w (W_t+τ∈·mid B_t=b), P_ M^∖dir^ι_w' (W_t+τ∈·mid B_t=b) ). Then the distinctions are: I(W_t;W_t+τ)>0 · tem…
Exact mathematical passage
\boxed{ \eta_{\mathrm{loop}}(\tau) = \mathbb E_{(w,w',b)\sim\nu} D\!\left( \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_w} (W_{t+\tau}\in\cdot\mid B_t=b), \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_{w'}} (W_{t+\tau}\in\cdot\mid B_t=b) \right). }
\bigwedge_{j\in\mathcal J(\ell)}Introduction passage · 1 passage
Search aliases: bigwedge_j∈ J(ℓ) bigwedge in mathcal ell
Introduction passage · 22-integrated-worked-examples-and-case-studies.tex, line 131
Let L( K)∈{0,1,…,6} denote the highest level from Part~XXIV whose complete required gate set is established. The level is conjunctive and pointwise in the declared scientific specification unless the D and X coordinates also pass: L( K)≥ ℓ Longleftrightarrow bigwedge_j∈ J(ℓ)Pass_j( K). A case may have strong higher-level-looking behavior while remaining at a lower certified level because an earlier gate is absent. For example, successful repair behavior does not establish self-maintenance when n…
Exact mathematical passage
L(\mathfrak K)\geq \ell \quad\Longleftrightarrow\quad \bigwedge_{j\in\mathcal J(\ell)}\Pass_j(\mathfrak K).
\mathrm{bound}Introduction passage · 1 passage
Search aliases: bound mathrm
Introduction passage · 05-gauge-invariance-and-abstract-identity.tex, line 293
A minimal structural report is therefore ( d,λ_d,λ_d+1,g_d, δ_H, P_d-widetilde P_d _bound, β(a), Λ_γ ), where Λ_γ denotes the right-hand side of the pathwise leakage bound. This structural report is intentionally incomplete as a workspace certificate. Parts~VI--IX add the predictive, causal, null, and irreducibility gates required to interpret the low-energy subspace operationally.
Exact mathematical passage
\boxed{ \left( d,\lambda_d,\lambda_{d+1},g_d, \delta_H, \|P_d-\widetilde P_d\|_{\mathrm{bound}}, \beta(a), \Lambda_\gamma \right), }
c^0Introduction passage · 2 passages
Search aliases: c^0
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 264
Let C_t denote an external command or task cue. Fix a neutral or matched future command trajectory c_t+1:t+τ^0. For goal interventions ι_g and ι_g', define the cue-controlled retention effect η_G(τ;g,g') = D_G ( P ( G_t+τ∈· mid ι_g, do(C_t+1:t+τ=c^0) ), P ( G_t+τ∈· mid ι_g', do(C_t+1:t+τ=c^0) ) ). The corresponding action-retention effect is η_G→ A(τ;g,g') = D_A ( P(A_t+τ∈·midι_g,c^0), P(A_t+τ∈·midι_g',c^0) ). The first quantity tests whether a goal difference survives. The second tests whether …
Exact mathematical passage
\eta_G(\tau;g,g') = D_G \left( \mathbb P \left( G_{t+\tau}\in\cdot \mid \iota_g, \operatorname{do}(C_{t+1:t+\tau}=c^0) \right), \mathbb P \left( G_{t+\tau}\in\cdot \mid \iota_{g'}, \operatorname{do}(C_{t+1:t+\tau}=c^0) \right) \right).
C_tIntroduction passage · 1 passage
Search aliases: C_t
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 261
Let C_t denote an external command or task cue. Fix a neutral or matched future command trajectory c_t+1:t+τ^0. For goal interventions ι_g and ι_g', define the cue-controlled retention effect η_G(τ;g,g') = D_G ( P ( G_t+τ∈· mid ι_g, do(C_t+1:t+τ=c^0) ), P ( G_t+τ∈· mid ι_g', do(C_t+1:t+τ=c^0) ) ). The corresponding action-retention effect is η_G→ A(τ;g,g') = D_A ( P(A_t+τ∈·midι_g,c^0), P(A_t+τ∈·midι_g',c^0) ). The first quantity tests whether a goal difference
Exact mathematical passage
C_t
C_{t+1:t+\tau}Introduction passage · 1 passage
Search aliases: C_t+1:t+τ tau
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 264
Let C_t denote an external command or task cue. Fix a neutral or matched future command trajectory c_t+1:t+τ^0. For goal interventions ι_g and ι_g', define the cue-controlled retention effect η_G(τ;g,g') = D_G ( P ( G_t+τ∈· mid ι_g, do(C_t+1:t+τ=c^0) ), P ( G_t+τ∈· mid ι_g', do(C_t+1:t+τ=c^0) ) ). The corresponding action-retention effect is η_G→ A(τ;g,g') = D_A ( P(A_t+τ∈·midι_g,c^0), P(A_t+τ∈·midι_g',c^0) ). The first quantity tests whether a goal difference survives. The second tests whether …
Exact mathematical passage
\eta_G(\tau;g,g') = D_G \left( \mathbb P \left( G_{t+\tau}\in\cdot \mid \iota_g, \operatorname{do}(C_{t+1:t+\tau}=c^0) \right), \mathbb P \left( G_{t+\tau}\in\cdot \mid \iota_{g'}, \operatorname{do}(C_{t+1:t+\tau}=c^0) \right) \right).
c_{t+1:t+\tau}^{0}Introduction passage · 1 passage
Search aliases: c_t+1:t+τ^0 tau
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 262
Let C_t denote an external command or task cue. Fix a neutral or matched future command trajectory c_t+1:t+τ^0. For goal interventions ι_g and ι_g', define the cue-controlled retention effect η_G(τ;g,g') = D_G ( P ( G_t+τ∈· mid ι_g, do(C_t+1:t+τ=c^0) ), P ( G_t+τ∈· mid ι_g', do(C_t+1:t+τ=c^0) ) ). The corresponding action-retention effect is η_G→ A(τ;g,g') = D_A ( P(A_t+τ∈·midι_g,c^0), P(A_t+τ∈·midι_g',c^0) ). The first quantity tests whether a goal difference survives. The second tests whether …
Exact mathematical passage
c_{t+1:t+\tau}^{0}
\centernotIntroduction passage · 10 passages
Search aliases: centernot
Introduction passage · 23-relation-to-prior-work.tex, line 234
The relation is therefore analogical rather than identificatory: SRW(W) centernotLongrightarrow GlobalNeuronalWorkspace(W) centernotLongrightarrow Conscious(W). The term is retained because it denotes a domain in which jointly available operations can be carried out. Every consciousness claim remains on an explicitly separate axis.
Exact mathematical passage
\boxed{ \operatorname{SRW}(W) \centernot\Longrightarrow \operatorname{GlobalNeuronalWorkspace}(W) \centernot\Longrightarrow \operatorname{Conscious}(W). }
\operatorname{Conscious}Introduction passage · 2 passages
Search aliases: Conscious operatorname
Introduction passage · 23-relation-to-prior-work.tex, line 234
The relation is therefore analogical rather than identificatory: SRW(W) centernotLongrightarrow GlobalNeuronalWorkspace(W) centernotLongrightarrow Conscious(W). The term is retained because it denotes a domain in which jointly available operations can be carried out. Every consciousness claim remains on an explicitly separate axis.
Exact mathematical passage
\boxed{ \operatorname{SRW}(W) \centernot\Longrightarrow \operatorname{GlobalNeuronalWorkspace}(W) \centernot\Longrightarrow \operatorname{Conscious}(W). }
\mathsf DIntroduction passage · 6 passages
Search aliases: D mathsf
Introduction passage · 22-integrated-worked-examples-and-case-studies.tex, line 130
Let L( K)∈{0,1,…,6} denote the highest level from Part~XXIV whose complete required gate set is established. The level is conjunctive and pointwise in the declared scientific specification unless the D and X coordinates also pass: L( K)≥ ℓ Longleftrightarrow bigwedge_j∈ J(ℓ)Pass_j( K). A case may have strong higher-level-looking behavior while remaining at a lower certified level because an earlier gate is absent. For example, successful repair behavior does not establish self-maintenance when n…
Exact mathematical passage
\mathsf D
D_GIntroduction passage · 4 passages
Search aliases: D_G
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 264
Let C_t denote an external command or task cue. Fix a neutral or matched future command trajectory c_t+1:t+τ^0. For goal interventions ι_g and ι_g', define the cue-controlled retention effect η_G(τ;g,g') = D_G ( P ( G_t+τ∈· mid ι_g, do(C_t+1:t+τ=c^0) ), P ( G_t+τ∈· mid ι_g', do(C_t+1:t+τ=c^0) ) ). The corresponding action-retention effect is η_G→ A(τ;g,g') = D_A ( P(A_t+τ∈·midι_g,c^0), P(A_t+τ∈·midι_g',c^0) ). The first quantity tests whether a goal difference survives. The second tests whether …
Exact mathematical passage
\eta_G(\tau;g,g') = D_G \left( \mathbb P \left( G_{t+\tau}\in\cdot \mid \iota_g, \operatorname{do}(C_{t+1:t+\tau}=c^0) \right), \mathbb P \left( G_{t+\tau}\in\cdot \mid \iota_{g'}, \operatorname{do}(C_{t+1:t+\tau}=c^0) \right) \right).
D_tIntroduction passage · 9 passages
Search aliases: D_t
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 716
A repair intervention r∈ I_R can add, remove, retrain, rewrite, or reroute an admissible component. Let r_0 denote matched no-repair. The post-repair integrity value at horizon τ is V_t^rep(r;d) = E [ v_t+τ mid do(D_t=d), do(R_t=r), H_t ]. The repair gain is Δ_t^rep(r;d) = V_t^rep(r;d) - V_t^rep(r_0;d). Repair costs are handled either by restricting the feasible repair family or by reporting a separate cost-effect curve. They should not be hidden inside an undocumented scalar reward.
Exact mathematical passage
V_t^{\mathrm{rep}}(r;d) = \mathbb E \left[ v_{t+\tau} \mid \operatorname{do}(D_t=d), \operatorname{do}(R_t=r), \mathbf H_t \right].
D_YIntroduction passage · 3 passages
Search aliases: D_Y
Introduction passage · 12-identity-through-time-and-replacement.tex, line 285
β w,χ b:(w,b)∈ D} be matched feasible implementation-intervention families in the sense of Part~VIII. Here b denotes declared background variables and χ is the background correspondence. Define K(w,b) = P^ι_w,b(Y^+∈·), K'(β w,χ b) = P^prime ι'_β w,χ b(Y^prime+∈·). For a chosen divergence D_Y, define δ_causal(β) = sup_(w,b)∈ D D_Y( K(w,b), K'(β w,χ b) ). The observational response is included only when the null intervention belongs to the declared family. This definition compares actual implement…
Exact mathematical passage
D_Y
\dimIntroduction passage · 19 passages
Search aliases: dim
Introduction passage · 04-approximate-workspaces.tex, line 166
Let 0≤λ_1≤λ_2≤⋯≤λ_N, N=dim C_V, be the eigenvalues of L_H, repeated with multiplicity, and let P_I(L_H) denote the spectral projector associated with an interval I.
Exact mathematical passage
0\leq\lambda_1\leq\lambda_2\leq\cdots\leq\lambda_N, \qquad N=\dim\mathcal C_V,
\mathrm{dir}Introduction passage · 2 passages
Search aliases: dir mathrm
Introduction passage · 08-causal-efficacy-and-reentry.tex, line 211
To isolate reentry, consider the unrolled causal graph and remove every direct retention edge whose source and target are both workspace variables at successive times. Let M^∖dir denote the resulting path-specific model, preserving paths that leave the workspace through a nonworkspace participant, action, message, or artifact and later return. Define η_loop(τ) = E_(w,w',b)∼ν D ( P_ M^∖dir^ι_w (W_t+τ∈·mid B_t=b), P_ M^∖dir^ι_w' (W_t+τ∈·mid B_t=b) ). Then the distinctions are: I(W_t;W_t+τ)>0 · tem…
Exact mathematical passage
\mathcal M^{\setminus\mathrm{dir}}
e^{-1}Introduction passage · 1 passage
Search aliases: e^-1
Introduction passage · 02-static-core-transfer-theory.tex, line 71
ninvertible. Holonomy, however, requires transport around reversible loops. To state the exact holonomy theorem without ambiguity, let |G| be the underlying undirected graph and let Π_1(G) denote its fundamental path groupoid. Every oriented edge is then supplied with a formal reverse. The core transfers extend to Π_1(G) only when the relevant maps H_e are invertible, with H_e^-1=H_e^-1.
Exact mathematical passage
H_{e^{-1}}=H_e^{-1}.
\mathbb E^{\iota_a}Introduction passage · 1 passage
Search aliases: E^ι_a mathbb iota
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 452
Let A_t(w,e) denote the actions that can be implemented from workspace state w in environment e. The interventional action value is Q_t^g(amid w,e) = E^ι_a [ U_g(Y_t^+) mid W_t=w, E_t=e, G_t=g ]. The optimal action set is A_t^*(w,g,e) = argmax_a∈ A_t(w,e)Q_t^g(amid w,e). A counterfactual evaluator is an internal state widehat Q_t = ( widehat Q_t(a) )_a∈ A_t(w,e) that estimates these intervention values. It is not enough for widehat Q_t to predict the action selected by the system. It must be val…
Exact mathematical passage
Q_t^g(a\mid w,e) = \mathbb E^{\iota_a} \left[ U_g(Y_t^+) \mid W_t=w, E_t=e, G_t=g \right].
\mathbb E_{(w,w',b)\sim\nu}Introduction passage · 3 passages
Search aliases: E_(w,w',b)∼ν mathbb sim nu
Introduction passage · 08-causal-efficacy-and-reentry.tex, line 217
To isolate reentry, consider the unrolled causal graph and remove every direct retention edge whose source and target are both workspace variables at successive times. Let M^∖dir denote the resulting path-specific model, preserving paths that leave the workspace through a nonworkspace participant, action, message, or artifact and later return. Define η_loop(τ) = E_(w,w',b)∼ν D ( P_ M^∖dir^ι_w (W_t+τ∈·mid B_t=b), P_ M^∖dir^ι_w' (W_t+τ∈·mid B_t=b) ). Then the distinctions are: I(W_t;W_t+τ)>0 · tem…
Exact mathematical passage
\boxed{ \eta_{\mathrm{loop}}(\tau) = \mathbb E_{(w,w',b)\sim\nu} D\!\left( \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_w} (W_{t+\tau}\in\cdot\mid B_t=b), \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_{w'}} (W_{t+\tau}\in\cdot\mid B_t=b) \right). }
\mathcal F_t^AIntroduction passage · 3 passages
Search aliases: F_t^A mathcal
Introduction passage · 06-dynamic-workspace-theory.tex, line 54
For a coalition A⊆ V, let H_t^A denote the random history available to that coalition through time t. Its generated information is F_t^A=σ( H_t^A). The full relational history is H_t= H_t^V, with F_t^A⊆ F_t^B whenever A⊆ B. The empty-coalition history H_t^∅ is the trivial constant statistic and represents prediction from the background target law alone. A concrete history may contain node trajectories, incident messages, actions, artifacts, transfer-map estimates, and the declared graph history.…
Exact mathematical passage
\mathcal F_t^A=\sigma(\mathbf H_t^A).
\mathcal F_t^BIntroduction passage · 1 passage
Search aliases: F_t^B mathcal
Introduction passage · 06-dynamic-workspace-theory.tex, line 58
For a coalition A⊆ V, let H_t^A denote the random history available to that coalition through time t. Its generated information is F_t^A=σ( H_t^A). The full relational history is H_t= H_t^V, with F_t^A⊆ F_t^B whenever A⊆ B. The empty-coalition history H_t^∅ is the trivial constant statistic and represents prediction from the background target law alone. A concrete history may contain node trajectories, incident messages, actions, artifacts, transfer-map estimates, and the declared graph history.…
Exact mathematical passage
\mathcal F_t^A\subseteq\mathcal F_t^B \qquad \text{whenever }A\subseteq B.
g'Introduction passage · 13 passages
Search aliases: g'
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 263
Let C_t denote an external command or task cue. Fix a neutral or matched future command trajectory c_t+1:t+τ^0. For goal interventions ι_g and ι_g', define the cue-controlled retention effect η_G(τ;g,g') = D_G ( P ( G_t+τ∈· mid ι_g, do(C_t+1:t+τ=c^0) ), P ( G_t+τ∈· mid ι_g', do(C_t+1:t+τ=c^0) ) ). The corresponding action-retention effect is η_G→ A(τ;g,g') = D_A ( P(A_t+τ∈·midι_g,c^0), P(A_t+τ∈·midι_g',c^0) ). The first quantity tests whether a goal difference survives. The second tests whether …
Exact mathematical passage
\iota_{g'}
G_1Introduction passage · 2 passages
Search aliases: G_1
Introduction passage · 21-empirical-certification-and-reporting-protocol.tex, line 586
[Intersection-gate false-certification control] Let a certificate require all gates G_1,…,G_m to pass. For each gate j, let H_0j denote the null that the required property is absent, and assume the predeclared test satisfies sup_P∈ H_0j P_P(G_j passes) ≤ α_j. The global null is H_0 = ⋃_j=1^m H_0j, meaning that at least one required property is absent. If the certificate is declared only when every gate passes, then sup_P∈ H_0 P_P(certificate passes) ≤ max_1≤ j≤ mα_j. No independence assumption a…
Exact mathematical passage
G_1,\ldots,G_m
g_dIntroduction passage · 15 passages
Search aliases: g_d
Introduction passage · 05-gauge-invariance-and-abstract-identity.tex, line 293
A minimal structural report is therefore ( d,λ_d,λ_d+1,g_d, δ_H, P_d-widetilde P_d _bound, β(a), Λ_γ ), where Λ_γ denotes the right-hand side of the pathwise leakage bound. This structural report is intentionally incomplete as a workspace certificate. Parts~VI--IX add the predictive, causal, null, and irreducibility gates required to interpret the low-energy subspace operationally.
Exact mathematical passage
\boxed{ \left( d,\lambda_d,\lambda_{d+1},g_d, \delta_H, \|P_d-\widetilde P_d\|_{\mathrm{bound}}, \beta(a), \Lambda_\gamma \right), }
G_jIntroduction passage · 1 passage
Search aliases: G_j
Introduction passage · 21-empirical-certification-and-reporting-protocol.tex, line 589
[Intersection-gate false-certification control] Let a certificate require all gates G_1,…,G_m to pass. For each gate j, let H_0j denote the null that the required property is absent, and assume the predeclared test satisfies sup_P∈ H_0j P_P(G_j passes) ≤ α_j. The global null is H_0 = ⋃_j=1^m H_0j, meaning that at least one required property is absent. If the certificate is declared only when every gate passes, then sup_P∈ H_0 P_P(certificate passes) ≤ max_1≤ j≤ mα_j. No independence assumption a…
Exact mathematical passage
\sup_{P\in H_{0j}} \mathbb P_P(G_j\text{ passes}) \leq \alpha_j.
G_mIntroduction passage · 2 passages
Search aliases: G_m
Introduction passage · 21-empirical-certification-and-reporting-protocol.tex, line 586
[Intersection-gate false-certification control] Let a certificate require all gates G_1,…,G_m to pass. For each gate j, let H_0j denote the null that the required property is absent, and assume the predeclared test satisfies sup_P∈ H_0j P_P(G_j passes) ≤ α_j. The global null is H_0 = ⋃_j=1^m H_0j, meaning that at least one required property is absent. If the certificate is declared only when every gate passes, then sup_P∈ H_0 P_P(certificate passes) ≤ max_1≤ j≤ mα_j. No independence assumption a…
Exact mathematical passage
G_1,\ldots,G_m
G_tIntroduction passage · 12 passages
Search aliases: G_t
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 452
Let A_t(w,e) denote the actions that can be implemented from workspace state w in environment e. The interventional action value is Q_t^g(amid w,e) = E^ι_a [ U_g(Y_t^+) mid W_t=w, E_t=e, G_t=g ]. The optimal action set is A_t^*(w,g,e) = argmax_a∈ A_t(w,e)Q_t^g(amid w,e). A counterfactual evaluator is an internal state widehat Q_t = ( widehat Q_t(a) )_a∈ A_t(w,e) that estimates these intervention values. It is not enough for widehat Q_t to predict the action selected by the system. It must be val…
Exact mathematical passage
Q_t^g(a\mid w,e) = \mathbb E^{\iota_a} \left[ U_g(Y_t^+) \mid W_t=w, E_t=e, G_t=g \right].
G_{t+\tau}Introduction passage · 9 passages
Search aliases: G_t+τ tau
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 264
Let C_t denote an external command or task cue. Fix a neutral or matched future command trajectory c_t+1:t+τ^0. For goal interventions ι_g and ι_g', define the cue-controlled retention effect η_G(τ;g,g') = D_G ( P ( G_t+τ∈· mid ι_g, do(C_t+1:t+τ=c^0) ), P ( G_t+τ∈· mid ι_g', do(C_t+1:t+τ=c^0) ) ). The corresponding action-retention effect is η_G→ A(τ;g,g') = D_A ( P(A_t+τ∈·midι_g,c^0), P(A_t+τ∈·midι_g',c^0) ). The first quantity tests whether a goal difference survives. The second tests whether …
Exact mathematical passage
\eta_G(\tau;g,g') = D_G \left( \mathbb P \left( G_{t+\tau}\in\cdot \mid \iota_g, \operatorname{do}(C_{t+1:t+\tau}=c^0) \right), \mathbb P \left( G_{t+\tau}\in\cdot \mid \iota_{g'}, \operatorname{do}(C_{t+1:t+\tau}=c^0) \right) \right).
\operatorname{GlobalNeuronalWorkspace}Introduction passage · 1 passage
Search aliases: GlobalNeuronalWorkspace operatorname
Introduction passage · 23-relation-to-prior-work.tex, line 234
The relation is therefore analogical rather than identificatory: SRW(W) centernotLongrightarrow GlobalNeuronalWorkspace(W) centernotLongrightarrow Conscious(W). The term is retained because it denotes a domain in which jointly available operations can be carried out. Every consciousness claim remains on an explicitly separate axis.
Exact mathematical passage
\boxed{ \operatorname{SRW}(W) \centernot\Longrightarrow \operatorname{GlobalNeuronalWorkspace}(W) \centernot\Longrightarrow \operatorname{Conscious}(W). }
H_0Introduction passage · 4 passages
Search aliases: H_0
Introduction passage · 21-empirical-certification-and-reporting-protocol.tex, line 596
[Intersection-gate false-certification control] Let a certificate require all gates G_1,…,G_m to pass. For each gate j, let H_0j denote the null that the required property is absent, and assume the predeclared test satisfies sup_P∈ H_0j P_P(G_j passes) ≤ α_j. The global null is H_0 = ⋃_j=1^m H_0j, meaning that at least one required property is absent. If the certificate is declared only when every gate passes, then sup_P∈ H_0 P_P(certificate passes) ≤ max_1≤ j≤ mα_j. No independence assumption a…
Exact mathematical passage
H_0 = \bigcup_{j=1}^m H_{0j},
H_{0j}Introduction passage · 3 passages
Search aliases: H_0j
Introduction passage · 21-empirical-certification-and-reporting-protocol.tex, line 587
[Intersection-gate false-certification control] Let a certificate require all gates G_1,…,G_m to pass. For each gate j, let H_0j denote the null that the required property is absent, and assume the predeclared test satisfies sup_P∈ H_0j P_P(G_j passes) ≤ α_j. The global null is H_0 = ⋃_j=1^m H_0j, meaning that at least one required property is absent. If the certificate is declared only when every gate passes, then sup_P∈ H_0 P_P(certificate passes) ≤ max_1≤ j≤ mα_j. No independence assumption a…
Exact mathematical passage
H_{0j}
H_e^{-1}Introduction passage · 1 passage
Search aliases: H_e^-1
Introduction passage · 02-static-core-transfer-theory.tex, line 71
ninvertible. Holonomy, however, requires transport around reversible loops. To state the exact holonomy theorem without ambiguity, let |G| be the underlying undirected graph and let Π_1(G) denote its fundamental path groupoid. Every oriented edge is then supplied with a formal reverse. The core transfers extend to Π_1(G) only when the relevant maps H_e are invertible, with H_e^-1=H_e^-1.
Exact mathematical passage
H_{e^{-1}}=H_e^{-1}.
H_{e^{-1}}Introduction passage · 1 passage
Search aliases: H_e^-1
Introduction passage · 02-static-core-transfer-theory.tex, line 71
ninvertible. Holonomy, however, requires transport around reversible loops. To state the exact holonomy theorem without ambiguity, let |G| be the underlying undirected graph and let Π_1(G) denote its fundamental path groupoid. Every oriented edge is then supplied with a formal reverse. The core transfers extend to Π_1(G) only when the relevant maps H_e are invertible, with H_e^-1=H_e^-1.
Exact mathematical passage
H_{e^{-1}}=H_e^{-1}.
\mathbf H_t^AIntroduction passage · 12 passages
Search aliases: H_t^A mathbf
Introduction passage · 06-dynamic-workspace-theory.tex, line 51
For a coalition A⊆ V, let H_t^A denote the random history available to that coalition through time t. Its generated information is F_t^A=σ( H_t^A). The full relational history is H_t= H_t^V, with F_t^A⊆ F_t^B whenever A⊆ B. The empty-coalition history H_t^∅ is the trivial constant statistic and represents prediction from the background target law alone. A concrete history may contain node trajectories, incident messages, actions, artifacts, transfer-map estimates, and the declared graph history.…
Exact mathematical passage
\mathbf H_t^A
\mathbf H_t^VIntroduction passage · 1 passage
Search aliases: H_t^V mathbf
Introduction passage · 06-dynamic-workspace-theory.tex, line 57
For a coalition A⊆ V, let H_t^A denote the random history available to that coalition through time t. Its generated information is F_t^A=σ( H_t^A). The full relational history is H_t= H_t^V, with F_t^A⊆ F_t^B whenever A⊆ B. The empty-coalition history H_t^∅ is the trivial constant statistic and represents prediction from the background target law alone. A concrete history may contain node trajectories, incident messages, actions, artifacts, transfer-map estimates, and the declared graph history.…
Exact mathematical passage
\mathbf H_t=\mathbf H_t^V
\mathbf H_t^\varnothingIntroduction passage · 1 passage
Search aliases: H_t^∅ mathbf varnothing
Introduction passage · 06-dynamic-workspace-theory.tex, line 63
For a coalition A⊆ V, let H_t^A denote the random history available to that coalition through time t. Its generated information is F_t^A=σ( H_t^A). The full relational history is H_t= H_t^V, with F_t^A⊆ F_t^B whenever A⊆ B. The empty-coalition history H_t^∅ is the trivial constant statistic and represents prediction from the background target law alone. A concrete history may contain node trajectories, incident messages, actions, artifacts, transfer-map estimates, and the declared graph history.…
Exact mathematical passage
\mathbf H_t^\varnothing
\mathcal I_RIntroduction passage · 4 passages
Search aliases: I_R mathcal
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 713
A repair intervention r∈ I_R can add, remove, retrain, rewrite, or reroute an admissible component. Let r_0 denote matched no-repair. The post-repair integrity value at horizon τ is V_t^rep(r;d) = E [ v_t+τ mid do(D_t=d), do(R_t=r), H_t ]. The repair gain is Δ_t^rep(r;d) = V_t^rep(r;d) - V_t^rep(r_0;d). Repair costs are handled either by restricting the feasible repair family or by reporting a separate cost-effect curve. They should not be hidden inside an undocumented scalar reward.
Exact mathematical passage
r\in\mathcal I_R
K'Introduction passage · 3 passages
Search aliases: K'
Introduction passage · 12-identity-through-time-and-replacement.tex, line 280
nce does not determine operational identity. Let {ι_w,b:(w,b)∈ D} and {ι'_β w,χ b:(w,b)∈ D} be matched feasible implementation-intervention families in the sense of Part~VIII. Here b denotes declared background variables and χ is the background correspondence. Define K(w,b) = P^ι_w,b(Y^+∈·), K'(β w,χ b) = P^prime ι'_β w,χ b(Y^prime+∈·). For a chosen divergence D_Y, define δ_causal(β) = sup_(w,b)∈ D D_Y( K(w,b), K'(β w,χ b) ). The observational response is included only when the null intervention…
Exact mathematical passage
K'(\beta w,\chi b) = \mathbb P^{\prime\,\iota'_{\beta w,\chi b}}(Y^{\prime+}\in\cdot).
K_0Introduction passage · 1 passage
Search aliases: K_0
Introduction passage · 13-gluing-and-workspaces-of-workspaces.tex, line 1145
Let K_r and widetilde K_r now denote exact and implemented Markov kernels at successive hierarchy levels, and suppose sup_x TV ( widetilde K_r(x,·), K_r(x,·) ) ≤ ζ_r. Because Markov kernels contract total variation, a telescoping argument gives sup_x TV ( widetilde K_0⋯widetilde K_R-1(x,·), K_0⋯ K_R-1(x,·) ) ≤ ∑_r=0^R-1ζ_r. Thus causal semantics can also be transported through a hierarchy, but only under an explicit kernel-level compatibility test. Structural gluing alone provides no such guaran…
Exact mathematical passage
\boxed{ \sup_x \operatorname{TV} \left( \widetilde K_0\cdots\widetilde K_{R-1}(x,\cdot), K_0\cdots K_{R-1}(x,\cdot) \right) \leq \sum_{r=0}^{R-1}\zeta_r. }
K_rIntroduction passage · 4 passages
Search aliases: K_r
Introduction passage · 13-gluing-and-workspaces-of-workspaces.tex, line 1132
Let K_r and widetilde K_r now denote exact and implemented Markov kernels at successive hierarchy levels, and suppose sup_x TV ( widetilde K_r(x,·), K_r(x,·) ) ≤ ζ_r. Because Markov kernels contract total variation, a telescoping argument gives sup_x TV ( widetilde K_0⋯widetilde K_R-1(x,·), K_0⋯ K_R-1(x,·) ) ≤ ∑_r=0^R-1ζ_r. Thus causal semantics can also be transported through a hierarchy, but only under an explicit kernel-level compatibility test. Structural gluing alone provides no such guaran…
Exact mathematical passage
K_r
K_{R-1}Introduction passage · 1 passage
Search aliases: K_R-1
Introduction passage · 13-gluing-and-workspaces-of-workspaces.tex, line 1145
Let K_r and widetilde K_r now denote exact and implemented Markov kernels at successive hierarchy levels, and suppose sup_x TV ( widetilde K_r(x,·), K_r(x,·) ) ≤ ζ_r. Because Markov kernels contract total variation, a telescoping argument gives sup_x TV ( widetilde K_0⋯widetilde K_R-1(x,·), K_0⋯ K_R-1(x,·) ) ≤ ∑_r=0^R-1ζ_r. Thus causal semantics can also be transported through a hierarchy, but only under an explicit kernel-level compatibility test. Structural gluing alone provides no such guaran…
Exact mathematical passage
\boxed{ \sup_x \operatorname{TV} \left( \widetilde K_0\cdots\widetilde K_{R-1}(x,\cdot), K_0\cdots K_{R-1}(x,\cdot) \right) \leq \sum_{r=0}^{R-1}\zeta_r. }
\mathrm{loc}Introduction passage · 3 passages
Search aliases: loc mathrm
Introduction passage · 13-gluing-and-workspaces-of-workspaces.tex, line 830
Exact or approximate overlap coherence does not by itself establish global predictive sufficiency. Let W_t denote a glued structural state and let Z_t^loc = (Z_α,t)_α∈ A be local predictive summaries recovered from its chart restrictions.
Exact mathematical passage
Z_t^{\mathrm{loc}} = (Z_{\alpha,t})_{\alpha\in A}
\LongleftrightarrowIntroduction passage · 8 passages
Search aliases: Longleftrightarrow
Introduction passage · 22-integrated-worked-examples-and-case-studies.tex, line 131
Let L( K)∈{0,1,…,6} denote the highest level from Part~XXIV whose complete required gate set is established. The level is conjunctive and pointwise in the declared scientific specification unless the D and X coordinates also pass: L( K)≥ ℓ Longleftrightarrow bigwedge_j∈ J(ℓ)Pass_j( K). A case may have strong higher-level-looking behavior while remaining at a lower certified level because an earlier gate is absent. For example, successful repair behavior does not establish self-maintenance when n…
Exact mathematical passage
L(\mathfrak K)\geq \ell \quad\Longleftrightarrow\quad \bigwedge_{j\in\mathcal J(\ell)}\Pass_j(\mathfrak K).
\LongrightarrowIntroduction passage · 18 passages
Search aliases: Longrightarrow
Introduction passage · 23-relation-to-prior-work.tex, line 234
The relation is therefore analogical rather than identificatory: SRW(W) centernotLongrightarrow GlobalNeuronalWorkspace(W) centernotLongrightarrow Conscious(W). The term is retained because it denotes a domain in which jointly available operations can be carried out. Every consciousness claim remains on an explicitly separate axis.
Exact mathematical passage
\boxed{ \operatorname{SRW}(W) \centernot\Longrightarrow \operatorname{GlobalNeuronalWorkspace}(W) \centernot\Longrightarrow \operatorname{Conscious}(W). }
\mathrm{loop}Introduction passage · 10 passages
Search aliases: loop mathrm
Introduction passage · 08-causal-efficacy-and-reentry.tex, line 217
To isolate reentry, consider the unrolled causal graph and remove every direct retention edge whose source and target are both workspace variables at successive times. Let M^∖dir denote the resulting path-specific model, preserving paths that leave the workspace through a nonworkspace participant, action, message, or artifact and later return. Define η_loop(τ) = E_(w,w',b)∼ν D ( P_ M^∖dir^ι_w (W_t+τ∈·mid B_t=b), P_ M^∖dir^ι_w' (W_t+τ∈·mid B_t=b) ). Then the distinctions are: I(W_t;W_t+τ)>0 · tem…
Exact mathematical passage
\boxed{ \eta_{\mathrm{loop}}(\tau) = \mathbb E_{(w,w',b)\sim\nu} D\!\left( \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_w} (W_{t+\tau}\in\cdot\mid B_t=b), \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_{w'}} (W_{t+\tau}\in\cdot\mid B_t=b) \right). }
\mathcal M^{\setminus\mathrm{dir}}Introduction passage · 2 passages
Search aliases: M^∖dir mathcal setminus mathrm
Introduction passage · 08-causal-efficacy-and-reentry.tex, line 211
To isolate reentry, consider the unrolled causal graph and remove every direct retention edge whose source and target are both workspace variables at successive times. Let M^∖dir denote the resulting path-specific model, preserving paths that leave the workspace through a nonworkspace participant, action, message, or artifact and later return. Define η_loop(τ) = E_(w,w',b)∼ν D ( P_ M^∖dir^ι_w (W_t+τ∈·mid B_t=b), P_ M^∖dir^ι_w' (W_t+τ∈·mid B_t=b) ). Then the distinctions are: I(W_t;W_t+τ)>0 · tem…
Exact mathematical passage
\mathcal M^{\setminus\mathrm{dir}}
\max_{1\leq j\leq m}Introduction passage · 1 passage
Search aliases: max_1≤ j≤ m max leq leq
Introduction passage · 21-empirical-certification-and-reporting-protocol.tex, line 603
dots,G_m to pass. For each gate j, let H_0j denote the null that the required property is absent, and assume the predeclared test satisfies sup_P∈ H_0j P_P(G_j passes) ≤ α_j. The global null is H_0 = ⋃_j=1^m H_0j, meaning that at least one required property is absent. If the certificate is declared only when every gate passes, then sup_P∈ H_0 P_P(certificate passes) ≤ max_1≤ j≤ mα_j. No independence assumption among gate tests is required.
Exact mathematical passage
\boxed{ \sup_{P\in H_0} \mathbb P_P(\text{certificate passes}) \leq \max_{1\leq j\leq m}\alpha_j. }
\mathbb P^{\prime\,\iota'_{\beta w,\chi b}}Introduction passage · 1 passage
Search aliases: P^prime ι'_β w,χ b mathbb prime iota beta chi
Introduction passage · 12-identity-through-time-and-replacement.tex, line 280
nce does not determine operational identity. Let {ι_w,b:(w,b)∈ D} and {ι'_β w,χ b:(w,b)∈ D} be matched feasible implementation-intervention families in the sense of Part~VIII. Here b denotes declared background variables and χ is the background correspondence. Define K(w,b) = P^ι_w,b(Y^+∈·), K'(β w,χ b) = P^prime ι'_β w,χ b(Y^prime+∈·). For a chosen divergence D_Y, define δ_causal(β) = sup_(w,b)∈ D D_Y( K(w,b), K'(β w,χ b) ). The observational response is included only when the null intervention…
Exact mathematical passage
K'(\beta w,\chi b) = \mathbb P^{\prime\,\iota'_{\beta w,\chi b}}(Y^{\prime+}\in\cdot).
\mathbb P^{\iota_{w,b}}Introduction passage · 1 passage
Search aliases: P^ι_w,b mathbb iota
Introduction passage · 12-identity-through-time-and-replacement.tex, line 275
Structural correspondence does not determine operational identity. Let {ι_w,b:(w,b)∈ D} and {ι'_β w,χ b:(w,b)∈ D} be matched feasible implementation-intervention families in the sense of Part~VIII. Here b denotes declared background variables and χ is the background correspondence. Define K(w,b) = P^ι_w,b(Y^+∈·), K'(β w,χ b) = P^prime ι'_β w,χ b(Y^prime+∈·). For a chosen divergence D_Y, define δ_causal(β) = sup_(w,b)∈ D D_Y( K(w,b), K'(β w,χ b) ). The observational response is included only when…
Exact mathematical passage
K(w,b) = \mathbb P^{\iota_{w,b}}(Y^+\in\cdot),
\mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_w}Introduction passage · 1 passage
Search aliases: P_ M^∖dir^ι_w mathbb mathcal setminus mathrm iota
Introduction passage · 08-causal-efficacy-and-reentry.tex, line 217
To isolate reentry, consider the unrolled causal graph and remove every direct retention edge whose source and target are both workspace variables at successive times. Let M^∖dir denote the resulting path-specific model, preserving paths that leave the workspace through a nonworkspace participant, action, message, or artifact and later return. Define η_loop(τ) = E_(w,w',b)∼ν D ( P_ M^∖dir^ι_w (W_t+τ∈·mid B_t=b), P_ M^∖dir^ι_w' (W_t+τ∈·mid B_t=b) ). Then the distinctions are: I(W_t;W_t+τ)>0 · tem…
Exact mathematical passage
\boxed{ \eta_{\mathrm{loop}}(\tau) = \mathbb E_{(w,w',b)\sim\nu} D\!\left( \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_w} (W_{t+\tau}\in\cdot\mid B_t=b), \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_{w'}} (W_{t+\tau}\in\cdot\mid B_t=b) \right). }
\mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_{w'}}Introduction passage · 1 passage
Search aliases: P_ M^∖dir^ι_w' mathbb mathcal setminus mathrm iota
Introduction passage · 08-causal-efficacy-and-reentry.tex, line 217
To isolate reentry, consider the unrolled causal graph and remove every direct retention edge whose source and target are both workspace variables at successive times. Let M^∖dir denote the resulting path-specific model, preserving paths that leave the workspace through a nonworkspace participant, action, message, or artifact and later return. Define η_loop(τ) = E_(w,w',b)∼ν D ( P_ M^∖dir^ι_w (W_t+τ∈·mid B_t=b), P_ M^∖dir^ι_w' (W_t+τ∈·mid B_t=b) ). Then the distinctions are: I(W_t;W_t+τ)>0 · tem…
Exact mathematical passage
\boxed{ \eta_{\mathrm{loop}}(\tau) = \mathbb E_{(w,w',b)\sim\nu} D\!\left( \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_w} (W_{t+\tau}\in\cdot\mid B_t=b), \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_{w'}} (W_{t+\tau}\in\cdot\mid B_t=b) \right). }
P_dIntroduction passage · 21 passages
Search aliases: P_d
Introduction passage · 05-gauge-invariance-and-abstract-identity.tex, line 293
A minimal structural report is therefore ( d,λ_d,λ_d+1,g_d, δ_H, P_d-widetilde P_d _bound, β(a), Λ_γ ), where Λ_γ denotes the right-hand side of the pathwise leakage bound. This structural report is intentionally incomplete as a workspace certificate. Parts~VI--IX add the predictive, causal, null, and irreducibility gates required to interpret the low-energy subspace operationally.
Exact mathematical passage
\boxed{ \left( d,\lambda_d,\lambda_{d+1},g_d, \delta_H, \|P_d-\widetilde P_d\|_{\mathrm{bound}}, \beta(a), \Lambda_\gamma \right), }
P_IIntroduction passage · 3 passages
Search aliases: P_I
Introduction passage · 04-approximate-workspaces.tex, line 172
Let 0≤λ_1≤λ_2≤⋯≤λ_N, N=dim C_V, be the eigenvalues of L_H, repeated with multiplicity, and let P_I(L_H) denote the spectral projector associated with an interval I.
Exact mathematical passage
P_I(L_H)
\mathbb P_PIntroduction passage · 6 passages
Search aliases: P_P mathbb
Introduction passage · 21-empirical-certification-and-reporting-protocol.tex, line 589
[Intersection-gate false-certification control] Let a certificate require all gates G_1,…,G_m to pass. For each gate j, let H_0j denote the null that the required property is absent, and assume the predeclared test satisfies sup_P∈ H_0j P_P(G_j passes) ≤ α_j. The global null is H_0 = ⋃_j=1^m H_0j, meaning that at least one required property is absent. If the certificate is declared only when every gate passes, then sup_P∈ H_0 P_P(certificate passes) ≤ max_1≤ j≤ mα_j. No independence assumption a…
Exact mathematical passage
\sup_{P\in H_{0j}} \mathbb P_P(G_j\text{ passes}) \leq \alpha_j.
\PassIntroduction passage · 2 passages
Search aliases: Pass
Introduction passage · 22-integrated-worked-examples-and-case-studies.tex, line 131
Let L( K)∈{0,1,…,6} denote the highest level from Part~XXIV whose complete required gate set is established. The level is conjunctive and pointwise in the declared scientific specification unless the D and X coordinates also pass: L( K)≥ ℓ Longleftrightarrow bigwedge_j∈ J(ℓ)Pass_j( K). A case may have strong higher-level-looking behavior while remaining at a lower certified level because an earlier gate is absent. For example, successful repair behavior does not establish self-maintenance when n…
Exact mathematical passage
L(\mathfrak K)\geq \ell \quad\Longleftrightarrow\quad \bigwedge_{j\in\mathcal J(\ell)}\Pass_j(\mathfrak K).
\Pass_jIntroduction passage · 1 passage
Search aliases: Pass_j Pass
Introduction passage · 22-integrated-worked-examples-and-case-studies.tex, line 131
Let L( K)∈{0,1,…,6} denote the highest level from Part~XXIV whose complete required gate set is established. The level is conjunctive and pointwise in the declared scientific specification unless the D and X coordinates also pass: L( K)≥ ℓ Longleftrightarrow bigwedge_j∈ J(ℓ)Pass_j( K). A case may have strong higher-level-looking behavior while remaining at a lower certified level because an earlier gate is absent. For example, successful repair behavior does not establish self-maintenance when n…
Exact mathematical passage
L(\mathfrak K)\geq \ell \quad\Longleftrightarrow\quad \bigwedge_{j\in\mathcal J(\ell)}\Pass_j(\mathfrak K).
\primeIntroduction passage · 1 passage
Search aliases: prime
Introduction passage · 12-identity-through-time-and-replacement.tex, line 280
nce does not determine operational identity. Let {ι_w,b:(w,b)∈ D} and {ι'_β w,χ b:(w,b)∈ D} be matched feasible implementation-intervention families in the sense of Part~VIII. Here b denotes declared background variables and χ is the background correspondence. Define K(w,b) = P^ι_w,b(Y^+∈·), K'(β w,χ b) = P^prime ι'_β w,χ b(Y^prime+∈·). For a chosen divergence D_Y, define δ_causal(β) = sup_(w,b)∈ D D_Y( K(w,b), K'(β w,χ b) ). The observational response is included only when the null intervention…
Exact mathematical passage
K'(\beta w,\chi b) = \mathbb P^{\prime\,\iota'_{\beta w,\chi b}}(Y^{\prime+}\in\cdot).
rIntroduction passage · 140 passages
Search aliases: r
Introduction passage · 13-gluing-and-workspaces-of-workspaces.tex, line 1132
Let K_r and widetilde K_r now denote exact and implemented Markov kernels at successive hierarchy levels, and suppose sup_x TV ( widetilde K_r(x,·), K_r(x,·) ) ≤ ζ_r. Because Markov kernels contract total variation, a telescoping argument gives sup_x TV ( widetilde K_0⋯widetilde K_R-1(x,·), K_0⋯ K_R-1(x,·) ) ≤ ∑_r=0^R-1ζ_r. Thus causal semantics can also be transported through a hierarchy, but only under an explicit kernel-level compatibility test. Structural gluing alone provides no such guaran…
Exact mathematical passage
K_r
r_0Introduction passage · 2 passages
Search aliases: r_0
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 714
A repair intervention r∈ I_R can add, remove, retrain, rewrite, or reroute an admissible component. Let r_0 denote matched no-repair. The post-repair integrity value at horizon τ is V_t^rep(r;d) = E [ v_t+τ mid do(D_t=d), do(R_t=r), H_t ]. The repair gain is Δ_t^rep(r;d) = V_t^rep(r;d) - V_t^rep(r_0;d). Repair costs are handled either by restricting the feasible repair family or by reporting a separate cost-effect curve. They should not be hidden inside an undocumented scalar reward.
Exact mathematical passage
r_0
R_tIntroduction passage · 6 passages
Search aliases: R_t
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 716
A repair intervention r∈ I_R can add, remove, retrain, rewrite, or reroute an admissible component. Let r_0 denote matched no-repair. The post-repair integrity value at horizon τ is V_t^rep(r;d) = E [ v_t+τ mid do(D_t=d), do(R_t=r), H_t ]. The repair gain is Δ_t^rep(r;d) = V_t^rep(r;d) - V_t^rep(r_0;d). Repair costs are handled either by restricting the feasible repair family or by reporting a separate cost-effect curve. They should not be hidden inside an undocumented scalar reward.
Exact mathematical passage
V_t^{\mathrm{rep}}(r;d) = \mathbb E \left[ v_{t+\tau} \mid \operatorname{do}(D_t=d), \operatorname{do}(R_t=r), \mathbf H_t \right].
\mathrm{rep}Introduction passage · 8 passages
Search aliases: rep mathrm
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 716
A repair intervention r∈ I_R can add, remove, retrain, rewrite, or reroute an admissible component. Let r_0 denote matched no-repair. The post-repair integrity value at horizon τ is V_t^rep(r;d) = E [ v_t+τ mid do(D_t=d), do(R_t=r), H_t ]. The repair gain is Δ_t^rep(r;d) = V_t^rep(r;d) - V_t^rep(r_0;d). Repair costs are handled either by restricting the feasible repair family or by reporting a separate cost-effect curve. They should not be hidden inside an undocumented scalar reward.
Exact mathematical passage
V_t^{\mathrm{rep}}(r;d) = \mathbb E \left[ v_{t+\tau} \mid \operatorname{do}(D_t=d), \operatorname{do}(R_t=r), \mathbf H_t \right].
\operatorname{SRW}Introduction passage · 6 passages
Search aliases: SRW operatorname
Introduction passage · 23-relation-to-prior-work.tex, line 234
The relation is therefore analogical rather than identificatory: SRW(W) centernotLongrightarrow GlobalNeuronalWorkspace(W) centernotLongrightarrow Conscious(W). The term is retained because it denotes a domain in which jointly available operations can be carried out. Every consciousness claim remains on an explicitly separate axis.
Exact mathematical passage
\boxed{ \operatorname{SRW}(W) \centernot\Longrightarrow \operatorname{GlobalNeuronalWorkspace}(W) \centernot\Longrightarrow \operatorname{Conscious}(W). }
\supIntroduction passage · 47 passages
Search aliases: sup
Introduction passage · 12-identity-through-time-and-replacement.tex, line 286
:(w,b)∈ D} be matched feasible implementation-intervention families in the sense of Part~VIII. Here b denotes declared background variables and χ is the background correspondence. Define K(w,b) = P^ι_w,b(Y^+∈·), K'(β w,χ b) = P^prime ι'_β w,χ b(Y^prime+∈·). For a chosen divergence D_Y, define δ_causal(β) = sup_(w,b)∈ D D_Y( K(w,b), K'(β w,χ b) ). The observational response is included only when the null intervention belongs to the declared family. This definition compares actual implementation i…
Exact mathematical passage
\boxed{ \delta_{\mathrm{causal}}(\beta) = \sup_{(w,b)\in\mathcal D} D_Y\left( K(w,b), K'(\beta w,\chi b) \right). }
\sup_{(w,b)\in\mathcal D}Introduction passage · 1 passage
Search aliases: sup_(w,b)∈ D sup in mathcal
Introduction passage · 12-identity-through-time-and-replacement.tex, line 286
:(w,b)∈ D} be matched feasible implementation-intervention families in the sense of Part~VIII. Here b denotes declared background variables and χ is the background correspondence. Define K(w,b) = P^ι_w,b(Y^+∈·), K'(β w,χ b) = P^prime ι'_β w,χ b(Y^prime+∈·). For a chosen divergence D_Y, define δ_causal(β) = sup_(w,b)∈ D D_Y( K(w,b), K'(β w,χ b) ). The observational response is included only when the null intervention belongs to the declared family. This definition compares actual implementation i…
Exact mathematical passage
\boxed{ \delta_{\mathrm{causal}}(\beta) = \sup_{(w,b)\in\mathcal D} D_Y\left( K(w,b), K'(\beta w,\chi b) \right). }
\sup_{P\in H_0}Introduction passage · 1 passage
Search aliases: sup_P∈ H_0 sup in
Introduction passage · 21-empirical-certification-and-reporting-protocol.tex, line 603
dots,G_m to pass. For each gate j, let H_0j denote the null that the required property is absent, and assume the predeclared test satisfies sup_P∈ H_0j P_P(G_j passes) ≤ α_j. The global null is H_0 = ⋃_j=1^m H_0j, meaning that at least one required property is absent. If the certificate is declared only when every gate passes, then sup_P∈ H_0 P_P(certificate passes) ≤ max_1≤ j≤ mα_j. No independence assumption among gate tests is required.
Exact mathematical passage
\boxed{ \sup_{P\in H_0} \mathbb P_P(\text{certificate passes}) \leq \max_{1\leq j\leq m}\alpha_j. }
\sup_{P\in H_{0j}}Introduction passage · 1 passage
Search aliases: sup_P∈ H_0j sup in
Introduction passage · 21-empirical-certification-and-reporting-protocol.tex, line 589
[Intersection-gate false-certification control] Let a certificate require all gates G_1,…,G_m to pass. For each gate j, let H_0j denote the null that the required property is absent, and assume the predeclared test satisfies sup_P∈ H_0j P_P(G_j passes) ≤ α_j. The global null is H_0 = ⋃_j=1^m H_0j, meaning that at least one required property is absent. If the certificate is declared only when every gate passes, then sup_P∈ H_0 P_P(certificate passes) ≤ max_1≤ j≤ mα_j. No independence assumption a…
Exact mathematical passage
\sup_{P\in H_{0j}} \mathbb P_P(G_j\text{ passes}) \leq \alpha_j.
\sup_xIntroduction passage · 2 passages
Search aliases: sup_x sup
Introduction passage · 13-gluing-and-workspaces-of-workspaces.tex, line 1134
Let K_r and widetilde K_r now denote exact and implemented Markov kernels at successive hierarchy levels, and suppose sup_x TV ( widetilde K_r(x,·), K_r(x,·) ) ≤ ζ_r. Because Markov kernels contract total variation, a telescoping argument gives sup_x TV ( widetilde K_0⋯widetilde K_R-1(x,·), K_0⋯ K_R-1(x,·) ) ≤ ∑_r=0^R-1ζ_r. Thus causal semantics can also be transported through a hierarchy, but only under an explicit kernel-level compatibility test. Structural gluing alone provides no such guaran…
Exact mathematical passage
\sup_x \operatorname{TV} \left( \widetilde K_r(x,\cdot), K_r(x,\cdot) \right) \leq \zeta_r.
\operatorname{TV}Introduction passage · 2 passages
Search aliases: TV operatorname
Introduction passage · 13-gluing-and-workspaces-of-workspaces.tex, line 1134
Let K_r and widetilde K_r now denote exact and implemented Markov kernels at successive hierarchy levels, and suppose sup_x TV ( widetilde K_r(x,·), K_r(x,·) ) ≤ ζ_r. Because Markov kernels contract total variation, a telescoping argument gives sup_x TV ( widetilde K_0⋯widetilde K_R-1(x,·), K_0⋯ K_R-1(x,·) ) ≤ ∑_r=0^R-1ζ_r. Thus causal semantics can also be transported through a hierarchy, but only under an explicit kernel-level compatibility test. Structural gluing alone provides no such guaran…
Exact mathematical passage
\sup_x \operatorname{TV} \left( \widetilde K_r(x,\cdot), K_r(x,\cdot) \right) \leq \zeta_r.
U_gIntroduction passage · 8 passages
Search aliases: U_g
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 452
Let A_t(w,e) denote the actions that can be implemented from workspace state w in environment e. The interventional action value is Q_t^g(amid w,e) = E^ι_a [ U_g(Y_t^+) mid W_t=w, E_t=e, G_t=g ]. The optimal action set is A_t^*(w,g,e) = argmax_a∈ A_t(w,e)Q_t^g(amid w,e). A counterfactual evaluator is an internal state widehat Q_t = ( widehat Q_t(a) )_a∈ A_t(w,e) that estimates these intervention values. It is not enough for widehat Q_t to predict the action selected by the system. It must be val…
Exact mathematical passage
Q_t^g(a\mid w,e) = \mathbb E^{\iota_a} \left[ U_g(Y_t^+) \mid W_t=w, E_t=e, G_t=g \right].
V_tIntroduction passage · 3 passages
Search aliases: V_t
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 599
Let V_t denote the internal value channel. A counterfactual-mediation test compares: G_t ⟶ V_t ⟶ A_t ⟶ Y_t^+. The relevant quantities include: η_G→ V, η_V→ A, η_A→ Y, δ_G→ Amid V, where the final term measures the residual goal-to-action effect after the value channel is blocked or randomized.
Exact mathematical passage
V_t
v_{t+\tau}Introduction passage · 3 passages
Search aliases: v_t+τ tau
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 716
A repair intervention r∈ I_R can add, remove, retrain, rewrite, or reroute an admissible component. Let r_0 denote matched no-repair. The post-repair integrity value at horizon τ is V_t^rep(r;d) = E [ v_t+τ mid do(D_t=d), do(R_t=r), H_t ]. The repair gain is Δ_t^rep(r;d) = V_t^rep(r;d) - V_t^rep(r_0;d). Repair costs are handled either by restricting the feasible repair family or by reporting a separate cost-effect curve. They should not be hidden inside an undocumented scalar reward.
Exact mathematical passage
V_t^{\mathrm{rep}}(r;d) = \mathbb E \left[ v_{t+\tau} \mid \operatorname{do}(D_t=d), \operatorname{do}(R_t=r), \mathbf H_t \right].
V_t^{\mathrm{rep}}Introduction passage · 3 passages
Search aliases: V_t^rep mathrm
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 716
A repair intervention r∈ I_R can add, remove, retrain, rewrite, or reroute an admissible component. Let r_0 denote matched no-repair. The post-repair integrity value at horizon τ is V_t^rep(r;d) = E [ v_t+τ mid do(D_t=d), do(R_t=r), H_t ]. The repair gain is Δ_t^rep(r;d) = V_t^rep(r;d) - V_t^rep(r_0;d). Repair costs are handled either by restricting the feasible repair family or by reporting a separate cost-effect curve. They should not be hidden inside an undocumented scalar reward.
Exact mathematical passage
V_t^{\mathrm{rep}}(r;d) = \mathbb E \left[ v_{t+\tau} \mid \operatorname{do}(D_t=d), \operatorname{do}(R_t=r), \mathbf H_t \right].
w'Introduction passage · 14 passages
Search aliases: w'
Introduction passage · 08-causal-efficacy-and-reentry.tex, line 217
To isolate reentry, consider the unrolled causal graph and remove every direct retention edge whose source and target are both workspace variables at successive times. Let M^∖dir denote the resulting path-specific model, preserving paths that leave the workspace through a nonworkspace participant, action, message, or artifact and later return. Define η_loop(τ) = E_(w,w',b)∼ν D ( P_ M^∖dir^ι_w (W_t+τ∈·mid B_t=b), P_ M^∖dir^ι_w' (W_t+τ∈·mid B_t=b) ). Then the distinctions are: I(W_t;W_t+τ)>0 · tem…
Exact mathematical passage
\boxed{ \eta_{\mathrm{loop}}(\tau) = \mathbb E_{(w,w',b)\sim\nu} D\!\left( \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_w} (W_{t+\tau}\in\cdot\mid B_t=b), \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_{w'}} (W_{t+\tau}\in\cdot\mid B_t=b) \right). }
W_{t+\tau}Introduction passage · 8 passages
Search aliases: W_t+τ tau
Introduction passage · 08-causal-efficacy-and-reentry.tex, line 217
To isolate reentry, consider the unrolled causal graph and remove every direct retention edge whose source and target are both workspace variables at successive times. Let M^∖dir denote the resulting path-specific model, preserving paths that leave the workspace through a nonworkspace participant, action, message, or artifact and later return. Define η_loop(τ) = E_(w,w',b)∼ν D ( P_ M^∖dir^ι_w (W_t+τ∈·mid B_t=b), P_ M^∖dir^ι_w' (W_t+τ∈·mid B_t=b) ). Then the distinctions are: I(W_t;W_t+τ)>0 · tem…
Exact mathematical passage
\boxed{ \eta_{\mathrm{loop}}(\tau) = \mathbb E_{(w,w',b)\sim\nu} D\!\left( \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_w} (W_{t+\tau}\in\cdot\mid B_t=b), \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_{w'}} (W_{t+\tau}\in\cdot\mid B_t=b) \right). }
\widehat QIntroduction passage · 18 passages
Search aliases: widehat Q widehat
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 471
( A_t(w,e) denote the actions that can be implemented from workspace state w in environment e. The interventional action value is Q_t^g(amid w,e) = E^ι_a [ U_g(Y_t^+) mid W_t=w, E_t=e, G_t=g ]. The optimal action set is A_t^*(w,g,e) = argmax_a∈ A_t(w,e)Q_t^g(amid w,e). A counterfactual evaluator is an internal state widehat Q_t = ( widehat Q_t(a) )_a∈ A_t(w,e) that estimates these intervention values. It is not enough for widehat Q_t to predict the action selected by the system. It must be valid…
Exact mathematical passage
\widehat Q_t = \left( \widehat Q_t(a) \right)_{a\in\mathcal A_t(w,e)}
\widehat Q_tIntroduction passage · 7 passages
Search aliases: widehat Q_t widehat
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 471
( A_t(w,e) denote the actions that can be implemented from workspace state w in environment e. The interventional action value is Q_t^g(amid w,e) = E^ι_a [ U_g(Y_t^+) mid W_t=w, E_t=e, G_t=g ]. The optimal action set is A_t^*(w,g,e) = argmax_a∈ A_t(w,e)Q_t^g(amid w,e). A counterfactual evaluator is an internal state widehat Q_t = ( widehat Q_t(a) )_a∈ A_t(w,e) that estimates these intervention values. It is not enough for widehat Q_t to predict the action selected by the system. It must be valid…
Exact mathematical passage
\widehat Q_t = \left( \widehat Q_t(a) \right)_{a\in\mathcal A_t(w,e)}
\widetilde KIntroduction passage · 3 passages
Search aliases: widetilde K widetilde
Introduction passage · 13-gluing-and-workspaces-of-workspaces.tex, line 1132
Let K_r and widetilde K_r now denote exact and implemented Markov kernels at successive hierarchy levels, and suppose sup_x TV ( widetilde K_r(x,·), K_r(x,·) ) ≤ ζ_r. Because Markov kernels contract total variation, a telescoping argument gives sup_x TV ( widetilde K_0⋯widetilde K_R-1(x,·), K_0⋯ K_R-1(x,·) ) ≤ ∑_r=0^R-1ζ_r. Thus causal semantics can also be transported through a hierarchy, but only under an explicit kernel-level compatibility test. Structural gluing alone provides no such guaran…
Exact mathematical passage
\widetilde K_r
\widetilde K_0Introduction passage · 1 passage
Search aliases: widetilde K_0 widetilde
Introduction passage · 13-gluing-and-workspaces-of-workspaces.tex, line 1145
Let K_r and widetilde K_r now denote exact and implemented Markov kernels at successive hierarchy levels, and suppose sup_x TV ( widetilde K_r(x,·), K_r(x,·) ) ≤ ζ_r. Because Markov kernels contract total variation, a telescoping argument gives sup_x TV ( widetilde K_0⋯widetilde K_R-1(x,·), K_0⋯ K_R-1(x,·) ) ≤ ∑_r=0^R-1ζ_r. Thus causal semantics can also be transported through a hierarchy, but only under an explicit kernel-level compatibility test. Structural gluing alone provides no such guaran…
Exact mathematical passage
\boxed{ \sup_x \operatorname{TV} \left( \widetilde K_0\cdots\widetilde K_{R-1}(x,\cdot), K_0\cdots K_{R-1}(x,\cdot) \right) \leq \sum_{r=0}^{R-1}\zeta_r. }
\widetilde K_rIntroduction passage · 2 passages
Search aliases: widetilde K_r widetilde
Introduction passage · 13-gluing-and-workspaces-of-workspaces.tex, line 1132
Let K_r and widetilde K_r now denote exact and implemented Markov kernels at successive hierarchy levels, and suppose sup_x TV ( widetilde K_r(x,·), K_r(x,·) ) ≤ ζ_r. Because Markov kernels contract total variation, a telescoping argument gives sup_x TV ( widetilde K_0⋯widetilde K_R-1(x,·), K_0⋯ K_R-1(x,·) ) ≤ ∑_r=0^R-1ζ_r. Thus causal semantics can also be transported through a hierarchy, but only under an explicit kernel-level compatibility test. Structural gluing alone provides no such guaran…
Exact mathematical passage
\widetilde K_r
\widetilde K_{R-1}Introduction passage · 1 passage
Search aliases: widetilde K_R-1 widetilde
Introduction passage · 13-gluing-and-workspaces-of-workspaces.tex, line 1145
Let K_r and widetilde K_r now denote exact and implemented Markov kernels at successive hierarchy levels, and suppose sup_x TV ( widetilde K_r(x,·), K_r(x,·) ) ≤ ζ_r. Because Markov kernels contract total variation, a telescoping argument gives sup_x TV ( widetilde K_0⋯widetilde K_R-1(x,·), K_0⋯ K_R-1(x,·) ) ≤ ∑_r=0^R-1ζ_r. Thus causal semantics can also be transported through a hierarchy, but only under an explicit kernel-level compatibility test. Structural gluing alone provides no such guaran…
Exact mathematical passage
\boxed{ \sup_x \operatorname{TV} \left( \widetilde K_0\cdots\widetilde K_{R-1}(x,\cdot), K_0\cdots K_{R-1}(x,\cdot) \right) \leq \sum_{r=0}^{R-1}\zeta_r. }
\widetilde PIntroduction passage · 12 passages
Search aliases: widetilde P widetilde
Introduction passage · 05-gauge-invariance-and-abstract-identity.tex, line 293
A minimal structural report is therefore ( d,λ_d,λ_d+1,g_d, δ_H, P_d-widetilde P_d _bound, β(a), Λ_γ ), where Λ_γ denotes the right-hand side of the pathwise leakage bound. This structural report is intentionally incomplete as a workspace certificate. Parts~VI--IX add the predictive, causal, null, and irreducibility gates required to interpret the low-energy subspace operationally.
Exact mathematical passage
\boxed{ \left( d,\lambda_d,\lambda_{d+1},g_d, \delta_H, \|P_d-\widetilde P_d\|_{\mathrm{bound}}, \beta(a), \Lambda_\gamma \right), }
\widetilde P_dIntroduction passage · 11 passages
Search aliases: widetilde P_d widetilde
Introduction passage · 05-gauge-invariance-and-abstract-identity.tex, line 293
A minimal structural report is therefore ( d,λ_d,λ_d+1,g_d, δ_H, P_d-widetilde P_d _bound, β(a), Λ_γ ), where Λ_γ denotes the right-hand side of the pathwise leakage bound. This structural report is intentionally incomplete as a workspace certificate. Parts~VI--IX add the predictive, causal, null, and irreducibility gates required to interpret the low-energy subspace operationally.
Exact mathematical passage
\boxed{ \left( d,\lambda_d,\lambda_{d+1},g_d, \delta_H, \|P_d-\widetilde P_d\|_{\mathrm{bound}}, \beta(a), \Lambda_\gamma \right), }
Y^{\prime+}Introduction passage · 1 passage
Search aliases: Y^prime+ prime
Introduction passage · 12-identity-through-time-and-replacement.tex, line 280
nce does not determine operational identity. Let {ι_w,b:(w,b)∈ D} and {ι'_β w,χ b:(w,b)∈ D} be matched feasible implementation-intervention families in the sense of Part~VIII. Here b denotes declared background variables and χ is the background correspondence. Define K(w,b) = P^ι_w,b(Y^+∈·), K'(β w,χ b) = P^prime ι'_β w,χ b(Y^prime+∈·). For a chosen divergence D_Y, define δ_causal(β) = sup_(w,b)∈ D D_Y( K(w,b), K'(β w,χ b) ). The observational response is included only when the null intervention…
Exact mathematical passage
K'(\beta w,\chi b) = \mathbb P^{\prime\,\iota'_{\beta w,\chi b}}(Y^{\prime+}\in\cdot).
Z_t^{\mathrm{loc}}Introduction passage · 3 passages
Search aliases: Z_t^loc mathrm
Introduction passage · 13-gluing-and-workspaces-of-workspaces.tex, line 830
Exact or approximate overlap coherence does not by itself establish global predictive sufficiency. Let W_t denote a glued structural state and let Z_t^loc = (Z_α,t)_α∈ A be local predictive summaries recovered from its chart restrictions.
Exact mathematical passage
Z_t^{\mathrm{loc}} = (Z_{\alpha,t})_{\alpha\in A}
Z_{\alpha,t}Introduction passage · 2 passages
Search aliases: Z_α,t alpha
Introduction passage · 13-gluing-and-workspaces-of-workspaces.tex, line 830
Exact or approximate overlap coherence does not by itself establish global predictive sufficiency. Let W_t denote a glued structural state and let Z_t^loc = (Z_α,t)_α∈ A be local predictive summaries recovered from its chart restrictions.
Exact mathematical passage
Z_t^{\mathrm{loc}} = (Z_{\alpha,t})_{\alpha\in A}
|Introduction passage · 65 passages
Search aliases: |
Introduction passage · 02-static-core-transfer-theory.tex, line 63
Global compatible sections make sense even when transfers are noninvertible. Holonomy, however, requires transport around reversible loops. To state the exact holonomy theorem without ambiguity, let |G| be the underlying undirected graph and let Π_1(G) denote its fundamental path groupoid. Every oriented edge is then supplied with a formal reverse. The core transfers extend to Π_1(G) only when the relevant maps H_e are invertible, with H_e^-1=H_e^-1.
Exact mathematical passage
|G|
\alpha_jIntroduction passage · 5 passages
Search aliases: α_j alpha
Introduction passage · 21-empirical-certification-and-reporting-protocol.tex, line 589
[Intersection-gate false-certification control] Let a certificate require all gates G_1,…,G_m to pass. For each gate j, let H_0j denote the null that the required property is absent, and assume the predeclared test satisfies sup_P∈ H_0j P_P(G_j passes) ≤ α_j. The global null is H_0 = ⋃_j=1^m H_0j, meaning that at least one required property is absent. If the certificate is declared only when every gate passes, then sup_P∈ H_0 P_P(certificate passes) ≤ max_1≤ j≤ mα_j. No independence assumption a…
Exact mathematical passage
\sup_{P\in H_{0j}} \mathbb P_P(G_j\text{ passes}) \leq \alpha_j.
\betaIntroduction passage · 61 passages
Search aliases: β beta
Introduction passage · 05-gauge-invariance-and-abstract-identity.tex, line 293
A minimal structural report is therefore ( d,λ_d,λ_d+1,g_d, δ_H, P_d-widetilde P_d _bound, β(a), Λ_γ ), where Λ_γ denotes the right-hand side of the pathwise leakage bound. This structural report is intentionally incomplete as a workspace certificate. Parts~VI--IX add the predictive, causal, null, and irreducibility gates required to interpret the low-energy subspace operationally.
Exact mathematical passage
\boxed{ \left( d,\lambda_d,\lambda_{d+1},g_d, \delta_H, \|P_d-\widetilde P_d\|_{\mathrm{bound}}, \beta(a), \Lambda_\gamma \right), }
\gammaIntroduction passage · 54 passages
Search aliases: γ gamma
Introduction passage · 05-gauge-invariance-and-abstract-identity.tex, line 293
A minimal structural report is therefore ( d,λ_d,λ_d+1,g_d, δ_H, P_d-widetilde P_d _bound, β(a), Λ_γ ), where Λ_γ denotes the right-hand side of the pathwise leakage bound. This structural report is intentionally incomplete as a workspace certificate. Parts~VI--IX add the predictive, causal, null, and irreducibility gates required to interpret the low-energy subspace operationally.
Exact mathematical passage
\boxed{ \left( d,\lambda_d,\lambda_{d+1},g_d, \delta_H, \|P_d-\widetilde P_d\|_{\mathrm{bound}}, \beta(a), \Lambda_\gamma \right), }
\delta_{\mathrm{causal}}Introduction passage · 7 passages
Search aliases: δ_causal delta mathrm
Introduction passage · 12-identity-through-time-and-replacement.tex, line 286
:(w,b)∈ D} be matched feasible implementation-intervention families in the sense of Part~VIII. Here b denotes declared background variables and χ is the background correspondence. Define K(w,b) = P^ι_w,b(Y^+∈·), K'(β w,χ b) = P^prime ι'_β w,χ b(Y^prime+∈·). For a chosen divergence D_Y, define δ_causal(β) = sup_(w,b)∈ D D_Y( K(w,b), K'(β w,χ b) ). The observational response is included only when the null intervention belongs to the declared family. This definition compares actual implementation i…
Exact mathematical passage
\boxed{ \delta_{\mathrm{causal}}(\beta) = \sup_{(w,b)\in\mathcal D} D_Y\left( K(w,b), K'(\beta w,\chi b) \right). }
\delta_{G\to A\mid V}Introduction passage · 1 passage
Search aliases: δ_G→ Amid V delta to mid
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 611
Let V_t denote the internal value channel. A counterfactual-mediation test compares: G_t ⟶ V_t ⟶ A_t ⟶ Y_t^+. The relevant quantities include: η_G→ V, η_V→ A, η_A→ Y, δ_G→ Amid V, where the final term measures the residual goal-to-action effect after the value channel is blocked or randomized.
Exact mathematical passage
\eta_{G\to V}, \qquad \eta_{V\to A}, \qquad \eta_{A\to Y}, \qquad \delta_{G\to A\mid V},
\delta_HIntroduction passage · 6 passages
Search aliases: δ_H delta
Introduction passage · 05-gauge-invariance-and-abstract-identity.tex, line 293
A minimal structural report is therefore ( d,λ_d,λ_d+1,g_d, δ_H, P_d-widetilde P_d _bound, β(a), Λ_γ ), where Λ_γ denotes the right-hand side of the pathwise leakage bound. This structural report is intentionally incomplete as a workspace certificate. Parts~VI--IX add the predictive, causal, null, and irreducibility gates required to interpret the low-energy subspace operationally.
Exact mathematical passage
\boxed{ \left( d,\lambda_d,\lambda_{d+1},g_d, \delta_H, \|P_d-\widetilde P_d\|_{\mathrm{bound}}, \beta(a), \Lambda_\gamma \right), }
\Delta_t^{\mathrm{rep}}Introduction passage · 2 passages
Search aliases: Δ_t^rep Delta mathrm
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 729
A repair intervention r∈ I_R can add, remove, retrain, rewrite, or reroute an admissible component. Let r_0 denote matched no-repair. The post-repair integrity value at horizon τ is V_t^rep(r;d) = E [ v_t+τ mid do(D_t=d), do(R_t=r), H_t ]. The repair gain is Δ_t^rep(r;d) = V_t^rep(r;d) - V_t^rep(r_0;d). Repair costs are handled either by restricting the feasible repair family or by reporting a separate cost-effect curve. They should not be hidden inside an undocumented scalar reward.
Exact mathematical passage
\Delta_t^{\mathrm{rep}}(r;d) = V_t^{\mathrm{rep}}(r;d) - V_t^{\mathrm{rep}}(r_0;d).
\zeta_rIntroduction passage · 4 passages
Search aliases: ζ_r zeta
Introduction passage · 13-gluing-and-workspaces-of-workspaces.tex, line 1134
Let K_r and widetilde K_r now denote exact and implemented Markov kernels at successive hierarchy levels, and suppose sup_x TV ( widetilde K_r(x,·), K_r(x,·) ) ≤ ζ_r. Because Markov kernels contract total variation, a telescoping argument gives sup_x TV ( widetilde K_0⋯widetilde K_R-1(x,·), K_0⋯ K_R-1(x,·) ) ≤ ∑_r=0^R-1ζ_r. Thus causal semantics can also be transported through a hierarchy, but only under an explicit kernel-level compatibility test. Structural gluing alone provides no such guaran…
Exact mathematical passage
\sup_x \operatorname{TV} \left( \widetilde K_r(x,\cdot), K_r(x,\cdot) \right) \leq \zeta_r.
\eta_{G\to V}Introduction passage · 1 passage
Search aliases: η_G→ V eta to
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 611
Let V_t denote the internal value channel. A counterfactual-mediation test compares: G_t ⟶ V_t ⟶ A_t ⟶ Y_t^+. The relevant quantities include: η_G→ V, η_V→ A, η_A→ Y, δ_G→ Amid V, where the final term measures the residual goal-to-action effect after the value channel is blocked or randomized.
Exact mathematical passage
\eta_{G\to V}, \qquad \eta_{V\to A}, \qquad \eta_{A\to Y}, \qquad \delta_{G\to A\mid V},
\eta_{\mathrm{loop}}Introduction passage · 9 passages
Search aliases: η_loop eta mathrm
Introduction passage · 08-causal-efficacy-and-reentry.tex, line 217
To isolate reentry, consider the unrolled causal graph and remove every direct retention edge whose source and target are both workspace variables at successive times. Let M^∖dir denote the resulting path-specific model, preserving paths that leave the workspace through a nonworkspace participant, action, message, or artifact and later return. Define η_loop(τ) = E_(w,w',b)∼ν D ( P_ M^∖dir^ι_w (W_t+τ∈·mid B_t=b), P_ M^∖dir^ι_w' (W_t+τ∈·mid B_t=b) ). Then the distinctions are: I(W_t;W_t+τ)>0 · tem…
Exact mathematical passage
\boxed{ \eta_{\mathrm{loop}}(\tau) = \mathbb E_{(w,w',b)\sim\nu} D\!\left( \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_w} (W_{t+\tau}\in\cdot\mid B_t=b), \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_{w'}} (W_{t+\tau}\in\cdot\mid B_t=b) \right). }
\iota'_{\beta w,\chi b}Introduction passage · 2 passages
Search aliases: ι'_β w,χ b iota beta chi
Introduction passage · 12-identity-through-time-and-replacement.tex, line 267
Structural correspondence does not determine operational identity. Let {ι_w,b:(w,b)∈ D} and {ι'_β w,χ b:(w,b)∈ D} be matched feasible implementation-intervention families in the sense of Part~VIII. Here b denotes declared background variables and χ is the background correspondence. Define K(w,b) = P^ι_w,b(Y^+∈·), K'(β w,χ b) = P^prime ι'_β w,χ b(Y^prime+∈·). For a chosen divergence D_Y, define δ_causal(β) = sup_(w,b)∈ D D_Y( K(w,b), K'(β w,χ b) ). The observational response is included only when…
Exact mathematical passage
\{\iota_{w,b}:(w,b)\in\mathcal D\} \quad\text{and}\quad \{\iota'_{\beta w,\chi b}:(w,b)\in\mathcal D\}
\iota_aIntroduction passage · 2 passages
Search aliases: ι_a iota
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 452
Let A_t(w,e) denote the actions that can be implemented from workspace state w in environment e. The interventional action value is Q_t^g(amid w,e) = E^ι_a [ U_g(Y_t^+) mid W_t=w, E_t=e, G_t=g ]. The optimal action set is A_t^*(w,g,e) = argmax_a∈ A_t(w,e)Q_t^g(amid w,e). A counterfactual evaluator is an internal state widehat Q_t = ( widehat Q_t(a) )_a∈ A_t(w,e) that estimates these intervention values. It is not enough for widehat Q_t to predict the action selected by the system. It must be val…
Exact mathematical passage
Q_t^g(a\mid w,e) = \mathbb E^{\iota_a} \left[ U_g(Y_t^+) \mid W_t=w, E_t=e, G_t=g \right].
\iota_gIntroduction passage · 6 passages
Search aliases: ι_g iota
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 263
Let C_t denote an external command or task cue. Fix a neutral or matched future command trajectory c_t+1:t+τ^0. For goal interventions ι_g and ι_g', define the cue-controlled retention effect η_G(τ;g,g') = D_G ( P ( G_t+τ∈· mid ι_g, do(C_t+1:t+τ=c^0) ), P ( G_t+τ∈· mid ι_g', do(C_t+1:t+τ=c^0) ) ). The corresponding action-retention effect is η_G→ A(τ;g,g') = D_A ( P(A_t+τ∈·midι_g,c^0), P(A_t+τ∈·midι_g',c^0) ). The first quantity tests whether a goal difference survives. The second tests whether …
Exact mathematical passage
\iota_g
\iota_{g'}Introduction passage · 5 passages
Search aliases: ι_g' iota
Introduction passage · 16-agency-counterfactual-control-and-self-maintenance.tex, line 263
Let C_t denote an external command or task cue. Fix a neutral or matched future command trajectory c_t+1:t+τ^0. For goal interventions ι_g and ι_g', define the cue-controlled retention effect η_G(τ;g,g') = D_G ( P ( G_t+τ∈· mid ι_g, do(C_t+1:t+τ=c^0) ), P ( G_t+τ∈· mid ι_g', do(C_t+1:t+τ=c^0) ) ). The corresponding action-retention effect is η_G→ A(τ;g,g') = D_A ( P(A_t+τ∈·midι_g,c^0), P(A_t+τ∈·midι_g',c^0) ). The first quantity tests whether a goal difference survives. The second tests whether …
Exact mathematical passage
\iota_{g'}
\iota_{w'}Introduction passage · 4 passages
Search aliases: ι_w' iota
Introduction passage · 08-causal-efficacy-and-reentry.tex, line 217
To isolate reentry, consider the unrolled causal graph and remove every direct retention edge whose source and target are both workspace variables at successive times. Let M^∖dir denote the resulting path-specific model, preserving paths that leave the workspace through a nonworkspace participant, action, message, or artifact and later return. Define η_loop(τ) = E_(w,w',b)∼ν D ( P_ M^∖dir^ι_w (W_t+τ∈·mid B_t=b), P_ M^∖dir^ι_w' (W_t+τ∈·mid B_t=b) ). Then the distinctions are: I(W_t;W_t+τ)>0 · tem…
Exact mathematical passage
\boxed{ \eta_{\mathrm{loop}}(\tau) = \mathbb E_{(w,w',b)\sim\nu} D\!\left( \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_w} (W_{t+\tau}\in\cdot\mid B_t=b), \mathbb P_{\mathcal M^{\setminus\mathrm{dir}}}^{\iota_{w'}} (W_{t+\tau}\in\cdot\mid B_t=b) \right). }
\iota_{w,b}Introduction passage · 2 passages
Search aliases: ι_w,b iota
Introduction passage · 12-identity-through-time-and-replacement.tex, line 267
Structural correspondence does not determine operational identity. Let {ι_w,b:(w,b)∈ D} and {ι'_β w,χ b:(w,b)∈ D} be matched feasible implementation-intervention families in the sense of Part~VIII. Here b denotes declared background variables and χ is the background correspondence. Define K(w,b) = P^ι_w,b(Y^+∈·), K'(β w,χ b) = P^prime ι'_β w,χ b(Y^prime+∈·). For a chosen divergence D_Y, define δ_causal(β) = sup_(w,b)∈ D D_Y( K(w,b), K'(β w,χ b) ). The observational response is included only when…
Exact mathematical passage
\{\iota_{w,b}:(w,b)\in\mathcal D\} \quad\text{and}\quad \{\iota'_{\beta w,\chi b}:(w,b)\in\mathcal D\}
\LambdaIntroduction passage · 5 passages
Search aliases: Λ Lambda
Introduction passage · 05-gauge-invariance-and-abstract-identity.tex, line 293
A minimal structural report is therefore ( d,λ_d,λ_d+1,g_d, δ_H, P_d-widetilde P_d _bound, β(a), Λ_γ ), where Λ_γ denotes the right-hand side of the pathwise leakage bound. This structural report is intentionally incomplete as a workspace certificate. Parts~VI--IX add the predictive, causal, null, and irreducibility gates required to interpret the low-energy subspace operationally.
Exact mathematical passage
\boxed{ \left( d,\lambda_d,\lambda_{d+1},g_d, \delta_H, \|P_d-\widetilde P_d\|_{\mathrm{bound}}, \beta(a), \Lambda_\gamma \right), }
\lambda_1Introduction passage · 2 passages
Search aliases: λ_1 lambda
Introduction passage · 04-approximate-workspaces.tex, line 166
Let 0≤λ_1≤λ_2≤⋯≤λ_N, N=dim C_V, be the eigenvalues of L_H, repeated with multiplicity, and let P_I(L_H) denote the spectral projector associated with an interval I.
Exact mathematical passage
0\leq\lambda_1\leq\lambda_2\leq\cdots\leq\lambda_N, \qquad N=\dim\mathcal C_V,
\lambda_2Introduction passage · 1 passage
Search aliases: λ_2 lambda
Introduction passage · 04-approximate-workspaces.tex, line 166
Let 0≤λ_1≤λ_2≤⋯≤λ_N, N=dim C_V, be the eigenvalues of L_H, repeated with multiplicity, and let P_I(L_H) denote the spectral projector associated with an interval I.
Exact mathematical passage
0\leq\lambda_1\leq\lambda_2\leq\cdots\leq\lambda_N, \qquad N=\dim\mathcal C_V,
\lambda_dIntroduction passage · 9 passages
Search aliases: λ_d lambda
Introduction passage · 05-gauge-invariance-and-abstract-identity.tex, line 293
A minimal structural report is therefore ( d,λ_d,λ_d+1,g_d, δ_H, P_d-widetilde P_d _bound, β(a), Λ_γ ), where Λ_γ denotes the right-hand side of the pathwise leakage bound. This structural report is intentionally incomplete as a workspace certificate. Parts~VI--IX add the predictive, causal, null, and irreducibility gates required to interpret the low-energy subspace operationally.
Exact mathematical passage
\boxed{ \left( d,\lambda_d,\lambda_{d+1},g_d, \delta_H, \|P_d-\widetilde P_d\|_{\mathrm{bound}}, \beta(a), \Lambda_\gamma \right), }
\lambda_{d+1}Introduction passage · 8 passages
Search aliases: λ_d+1 lambda
Introduction passage · 05-gauge-invariance-and-abstract-identity.tex, line 293
A minimal structural report is therefore ( d,λ_d,λ_d+1,g_d, δ_H, P_d-widetilde P_d _bound, β(a), Λ_γ ), where Λ_γ denotes the right-hand side of the pathwise leakage bound. This structural report is intentionally incomplete as a workspace certificate. Parts~VI--IX add the predictive, causal, null, and irreducibility gates required to interpret the low-energy subspace operationally.
Exact mathematical passage
\boxed{ \left( d,\lambda_d,\lambda_{d+1},g_d, \delta_H, \|P_d-\widetilde P_d\|_{\mathrm{bound}}, \beta(a), \Lambda_\gamma \right), }
\lambda_NIntroduction passage · 1 passage
Search aliases: λ_N lambda
Introduction passage · 04-approximate-workspaces.tex, line 166
Let 0≤λ_1≤λ_2≤⋯≤λ_N, N=dim C_V, be the eigenvalues of L_H, repeated with multiplicity, and let P_I(L_H) denote the spectral projector associated with an interval I.
Exact mathematical passage
0\leq\lambda_1\leq\lambda_2\leq\cdots\leq\lambda_N, \qquad N=\dim\mathcal C_V,
\Lambda_\gammaIntroduction passage · 3 passages
Search aliases: Λ_γ Lambda gamma
Introduction passage · 05-gauge-invariance-and-abstract-identity.tex, line 293
A minimal structural report is therefore ( d,λ_d,λ_d+1,g_d, δ_H, P_d-widetilde P_d _bound, β(a), Λ_γ ), where Λ_γ denotes the right-hand side of the pathwise leakage bound. This structural report is intentionally incomplete as a workspace certificate. Parts~VI--IX add the predictive, causal, null, and irreducibility gates required to interpret the low-energy subspace operationally.
Exact mathematical passage
\boxed{ \left( d,\lambda_d,\lambda_{d+1},g_d, \delta_H, \|P_d-\widetilde P_d\|_{\mathrm{bound}}, \beta(a), \Lambda_\gamma \right), }
\Pi_1Introduction passage · 4 passages
Search aliases: Π_1 Pi
Introduction passage · 02-static-core-transfer-theory.tex, line 65
Global compatible sections make sense even when transfers are noninvertible. Holonomy, however, requires transport around reversible loops. To state the exact holonomy theorem without ambiguity, let |G| be the underlying undirected graph and let Π_1(G) denote its fundamental path groupoid. Every oriented edge is then supplied with a formal reverse. The core transfers extend to Π_1(G) only when the relevant maps H_e are invertible, with H_e^-1=H_e^-1.
Exact mathematical passage
\Pi_1(G)
\chiIntroduction passage · 4 passages
Search aliases: χ chi
Introduction passage · 12-identity-through-time-and-replacement.tex, line 267
Structural correspondence does not determine operational identity. Let {ι_w,b:(w,b)∈ D} and {ι'_β w,χ b:(w,b)∈ D} be matched feasible implementation-intervention families in the sense of Part~VIII. Here b denotes declared background variables and χ is the background correspondence. Define K(w,b) = P^ι_w,b(Y^+∈·), K'(β w,χ b) = P^prime ι'_β w,χ b(Y^prime+∈·). For a chosen divergence D_Y, define δ_causal(β) = sup_(w,b)∈ D D_Y( K(w,b), K'(β w,χ b) ). The observational response is included only when…
Exact mathematical passage
\{\iota_{w,b}:(w,b)\in\mathcal D\} \quad\text{and}\quad \{\iota'_{\beta w,\chi b}:(w,b)\in\mathcal D\}
\varnothingIntroduction passage · 3 passages
Search aliases: ∅ varnothing
Introduction passage · 06-dynamic-workspace-theory.tex, line 63
For a coalition A⊆ V, let H_t^A denote the random history available to that coalition through time t. Its generated information is F_t^A=σ( H_t^A). The full relational history is H_t= H_t^V, with F_t^A⊆ F_t^B whenever A⊆ B. The empty-coalition history H_t^∅ is the trivial constant statistic and represents prediction from the background target law alone. A concrete history may contain node trajectories, incident messages, actions, artifacts, transfer-map estimates, and the declared graph history.…
Exact mathematical passage
\mathbf H_t^\varnothing
\sum_{r=0}^{R-1}Introduction passage · 4 passages
Search aliases: ∑_r=0^R-1 sum
Introduction passage · 13-gluing-and-workspaces-of-workspaces.tex, line 1145
Let K_r and widetilde K_r now denote exact and implemented Markov kernels at successive hierarchy levels, and suppose sup_x TV ( widetilde K_r(x,·), K_r(x,·) ) ≤ ζ_r. Because Markov kernels contract total variation, a telescoping argument gives sup_x TV ( widetilde K_0⋯widetilde K_R-1(x,·), K_0⋯ K_R-1(x,·) ) ≤ ∑_r=0^R-1ζ_r. Thus causal semantics can also be transported through a hierarchy, but only under an explicit kernel-level compatibility test. Structural gluing alone provides no such guaran…
Exact mathematical passage
\boxed{ \sup_x \operatorname{TV} \left( \widetilde K_0\cdots\widetilde K_{R-1}(x,\cdot), K_0\cdots K_{R-1}(x,\cdot) \right) \leq \sum_{r=0}^{R-1}\zeta_r. }
\setminusIntroduction passage · 8 passages
Search aliases: ∖ setminus
Introduction passage · 08-causal-efficacy-and-reentry.tex, line 211
To isolate reentry, consider the unrolled causal graph and remove every direct retention edge whose source and target are both workspace variables at successive times. Let M^∖dir denote the resulting path-specific model, preserving paths that leave the workspace through a nonworkspace participant, action, message, or artifact and later return. Define η_loop(τ) = E_(w,w',b)∼ν D ( P_ M^∖dir^ι_w (W_t+τ∈·mid B_t=b), P_ M^∖dir^ι_w' (W_t+τ∈·mid B_t=b) ). Then the distinctions are: I(W_t;W_t+τ)>0 · tem…
Exact mathematical passage
\mathcal M^{\setminus\mathrm{dir}}
\perpIntroduction passage · 7 passages
Search aliases: ⊥ perp
Introduction passage · 08-causal-efficacy-and-reentry.tex, line 146
If the complement is defined by Γ_ε(H)^⊥, the result is metric dependent. Under nonunitary gauge changes, either the metric must be transported with the coordinates or interventions must be matched by a coordinate-independent physical cost. Otherwise specificity can change merely because the representation was rescaled.
Exact mathematical passage
\Gamma_\varepsilon(H)^\perp
\bigcup_{j=1}^mIntroduction passage · 1 passage
Search aliases: ⋃_j=1^m bigcup
Introduction passage · 21-empirical-certification-and-reporting-protocol.tex, line 596
[Intersection-gate false-certification control] Let a certificate require all gates G_1,…,G_m to pass. For each gate j, let H_0j denote the null that the required property is absent, and assume the predeclared test satisfies sup_P∈ H_0j P_P(G_j passes) ≤ α_j. The global null is H_0 = ⋃_j=1^m H_0j, meaning that at least one required property is absent. If the certificate is declared only when every gate passes, then sup_P∈ H_0 P_P(certificate passes) ≤ max_1≤ j≤ mα_j. No independence assumption a…
Exact mathematical passage
H_0 = \bigcup_{j=1}^m H_{0j},
+'Use in source · 1 passage
Search aliases: +'
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
\mathbf1_{[0,\varepsilon]}Use in source · 1 passage
Search aliases: 1_[0,ε] mathbf varepsilon
Use in source · 25-unified-formulation.tex, line 6
The complete static-to-agentive construction is · (Ω, D, S,Σ, D_form, L) [2mm] · Downarrow ( D,widehat V,widehat E,widehat H,widehat P,widehat B) [2mm] · Downarrow (G,{X_i},{T_e}) [2mm] · Downarrow X_i=C_i⊕ R_i [2mm] · ({C_i},{H_e}, A,{ρ_i}) [2mm] · Downarrow Γ(H)=varprojlim C_i [2mm] · Downarrow L_H=D_H^*D_H [2mm] · Downarrow Γ_ε(H) = ran 1_[0,ε](L_H) [2mm] · Downarrow W_t^str [2mm] · xrightarrowalignment Z_t= P(Y_t^+∈·mid H_t) [2mm] · Downarrow SRW_Θ(W_t; D) [2mm] · Downarrow (W_t,G_t,widehat …
Exact mathematical passage
\boxed{ \begin{aligned} & (\Omega,\mathfrak D,\mathfrak S,\Sigma,\mathcal D_{\mathrm{form}},\mathcal L) \\[2mm] &\Downarrow \qquad (\mathcal D,\widehat V,\widehat E,\widehat H,\widehat P,\widehat B) \\[2mm] &\Downarrow \qquad (G,\{X_i\},\{T_e\}) \\[2mm] &\Downarrow \qquad X_i=C_i\oplus R_i \\[2mm] & (\{C_i\},\{H_e\},\mathcal A,\{\rho_i\}) \\[2mm] &\Downarrow \qquad \Gamma(H)=\varprojlim C_i \\[2mm] &\Downarrow \qquad L_H=D_H^*D_H \\[2mm] &\Downarrow \qquad \Gamma_\varepsilon(H) = \ran\,\mathbf 1_{[0,\varepsilon]}(L_H) \\[2mm] &\Downarrow \qquad W_t^{\mathrm{str}} \\[2mm] &\xrightarrow{\text{alignment}} Z_t=\mathbb P(Y_t^+\in\cdot\mid\mathbf H_t) \\[2mm] &\Downarrow \qquad \SRW_\Theta(W_t;\mathcal D) \\[2mm] &\Downarrow \qquad (W_t,G_t,\widehat Q_t,M_t,B_t) \\[2mm] &\xrightarrow{\text{goal and value use}} (A_t,R_t) \\[2mm] &\xrightarrow{\text{causal repair}} e_t\leq e_{\max} \\[2mm] &\Downarrow \qquad \Workspace = [\mathfrak R]_{\text{gauge}+\text{causal equivalence}}. \end{aligned} }
\mathbf1_{[0,\varepsilon_t]}Use in source · 1 passage
Search aliases: 1_[0,ε_t] mathbf varepsilon
Use in source · 06-dynamic-workspace-theory.tex, line 81
Let c(t)=(c_i(t))_i∈ V ∈ C_V(t), P_t= 1_[0,ε_t](L_t). The instantaneous structural workspace coordinate is W_t^str=P_tc(t) ∈ Γ_ε_t(H(t)). When P_t varies with time, these coordinates inhabit a moving family of subspaces. Parts~X--XII will supply the transport required to compare them across time. In what follows, all sufficiency and intervention statements are made at a fixed decision time t.
Exact mathematical passage
c(t)=(c_i(t))_{i\in V} \in \mathcal C_V(t), \qquad P_t=\mathbf 1_{[0,\varepsilon_t]}(L_t).
\mathfrak AUse in source · 1 passage
Search aliases: A mathfrak
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 24
A controlled relational realization extends Definition~[source reference] by the tuple A_Workspace = ( R, G, A_t, Y^+, {U_g}_g∈ G, Π, I_A, I_G, I_D, I_R ). Here: item R is the underlying relational realization; item G is a measurable goal-code space; item A_t is the feasible action set at time t; item Y^+ is the relevant future trajectory space; item U_g: Y^+→ R evaluates a trajectory under goal code g; item Π is an admissible class of workspace-level policies; item I_A and I_G are feasible acti…
Exact mathematical passage
\boxed{ \mathfrak A_{\Workspace} = \left( \mathfrak R, \mathcal G, \mathcal A_t, \mathcal Y^+, \{U_g\}_{g\in\mathcal G}, \Pi, \mathcal I_A, \mathcal I_G, \mathcal I_D, \mathcal I_R \right). }
\mathsf AUse in source · 9 passages
Search aliases: A mathsf
Use in source · 06-dynamic-workspace-theory.tex, line 258
Sufficiency has a direct decision-theoretic interpretation. Use the convention TV(P,Q)=sup_A|P(A)-Q(A)|. Let A be a finite action set and ℓ: Y× A→[0,1] a bounded loss. Define Risk_ℓ(S_t) = inf_d E [ ℓ(Y_t^+,d(S_t)) ].
Exact mathematical passage
\mathsf A
A'Use in source · 7 passages
Search aliases: A'
Use in source · 12-identity-through-time-and-replacement.tex, line 201
Write A=ρ_V(a), A'=ρ_V'(a), and define δ_ρ(a)= A'J_V-J_VA , ℓ_a= (I-P)AP . Let A_ W=PAP, A_ W''=P'A'P'.
Exact mathematical passage
A=\rho_V(a), \qquad A'=\rho_V'(a),
a'Use in source · 2 passages
Search aliases: a'
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 115
Two goal codes are operationally equivalent, g∼_goalg', when they induce the same action ordering in every declared state and intervention background: Q_t^g(amid w) ≥ Q_t^g(a'mid w) Longleftrightarrow Q_t^g'(amid w) ≥ Q_t^g'(a'mid w). The abstract goal is the equivalence class [g]_goal. This quotient prevents a mere invertible recoding of a goal channel from being reported as a change of objective. For quantitative regret bounds, a representative normalization of U_g must nevertheless be fixed.
Exact mathematical passage
Q_t^g(a\mid w) \geq Q_t^g(a'\mid w) \quad\Longleftrightarrow\quad Q_t^{g'}(a\mid w) \geq Q_t^{g'}(a'\mid w).
a^*Use in source · 7 passages
Search aliases: a^*
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 539
r widehat Q: max_π E_a∼π[widehat Q(a)] - E_a∼widehatπ[widehat Q(a)] ≤ δ_opt. Then, for every true-value-optimal policy π^*, E_a∼π^*[Q(a)] - E_a∼widehatπ[Q(a)] ≤ 2ε_Q+δ_opt. For a deterministic greedy action widehat a∈argmax_awidehat Q(a), Q(a^*)-Q(widehat a) ≤2ε_Q. If the true optimal action a^* is unique and its value gap Δ_Q = Q(a^*)- max_a≠ a^*Q(a) satisfies Δ_Q>2ε_Q, then every greedy maximizer of widehat Q equals a^*.
Exact mathematical passage
Q(a^*)-Q(\widehat a) \leq2\varepsilon_Q.
A^0Use in source · 3 passages
Search aliases: A^0
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 769
Suppose local operations A_α:mathscr W_α→mathscr W_α and overlap operations A_αβ:mathscr W_αβ→ mathscr W_αβ satisfy r_αβ^αA_α = A_αβr_αβ^α, r_αβ^βA_β = A_αβr_αβ^β. Then, with A^0=⊕_α A_α and A^1=⊕_α<βA_αβ, B_ UA^0=A^1B_ U. Therefore A^0ker B_ U⊆ker B_ U. The operation-closure theorem from Part~III reappears at the meta level: operations on subworkspaces descend globally precisely when they agree on interfaces.
Exact mathematical passage
A^0=\bigoplus_\alpha A_\alpha
A^1Use in source · 2 passages
Search aliases: A^1
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 770
Suppose local operations A_α:mathscr W_α→mathscr W_α and overlap operations A_αβ:mathscr W_αβ→ mathscr W_αβ satisfy r_αβ^αA_α = A_αβr_αβ^α, r_αβ^βA_β = A_αβr_αβ^β. Then, with A^0=⊕_α A_α and A^1=⊕_α<βA_αβ, B_ UA^0=A^1B_ U. Therefore A^0ker B_ U⊆ker B_ U. The operation-closure theorem from Part~III reappears at the meta level: operations on subworkspaces descend globally precisely when they agree on interfaces.
Exact mathematical passage
A^1=\bigoplus_{\alpha<\beta}A_{\alpha\beta}
a^2Use in source · 2 passages
Search aliases: a^2
Use in source · 04-approximate-workspaces.tex, line 344
Let C_1=C_2= R, use unit weights, and take two directed transfers H_12=a, H_21=b. Then D_H = -a · 1 1 · -b , L_H = a^2+1 · -(a+b) -(a+b) · b^2+1 . Writing τ=a^2+b^2+2, the eigenvalues are λ_± = frac12 ( τ±sqrtτ^2-4(ab-1)^2 ), and det L_H=(ab-1)^2. Thus a nonzero exact shared core exists precisely when ab=1, which is exactly the trivial-holonomy condition. Away from exact consistency, λ_-λ_+=(ab-1)^2. When |ab-1| is small while λ_+ stays bounded away from zero, the soft workspace eigenvalue is qu…
Exact mathematical passage
D_H = \begin{pmatrix} -a&1\\ 1&-b \end{pmatrix}, \qquad L_H = \begin{pmatrix} a^2+1&-(a+b)\\ -(a+b)&b^2+1 \end{pmatrix}.
A_{\mathcal W}Use in source · 7 passages
Search aliases: A_ W mathcal
Use in source · 12-identity-through-time-and-replacement.tex, line 213
Write A=ρ_V(a), A'=ρ_V'(a), and define δ_ρ(a)= A'J_V-J_VA , ℓ_a= (I-P)AP . Let A_ W=PAP, A_ W''=P'A'P'.
Exact mathematical passage
A_{\mathcal W}=PAP, \qquad A_{\mathcal W'}'=P'A'P'.
A_{\mathcal W'}'Use in source · 7 passages
Search aliases: A_ W'' mathcal
Use in source · 12-identity-through-time-and-replacement.tex, line 213
Write A=ρ_V(a), A'=ρ_V'(a), and define δ_ρ(a)= A'J_V-J_VA , ℓ_a= (I-P)AP . Let A_ W=PAP, A_ W''=P'A'P'.
Exact mathematical passage
A_{\mathcal W}=PAP, \qquad A_{\mathcal W'}'=P'A'P'.
\mathcal A_1Use in source · 3 passages
Search aliases: A_1 mathcal
Use in source · 12-identity-through-time-and-replacement.tex, line 336
For an admissible correspondence J, define the operation defect on a declared unit ball A_1 by δ_op( J) = sup_a∈ A_1 A_ W''β-β A_ W . The primary certification object is the identity profile d_id( J) = ( q_str, δ_op( J), δ_causal(β), δ_rec(β); μ^keep ). The first four coordinates must remain below declared tolerances, while the non-collapse margin μ^keep must remain above a declared lower bound. This vector, rather than a weighted average, determines whether a specific identity claim passes.
Exact mathematical passage
\mathcal A_1
a_CUse in source · 1 passage
Search aliases: a_C
Use in source · 15-boundary-formation-and-stability.tex, line 144
A general score is B_t(S) = · a_RRet_τ(S) +a_OOut_τ(S) +a_CCOut_τ(S) · -a_DDep_τ(S) -a_ICIn_τ(S) -a_LCoh(S) · -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal B_t(S) ={}& a_R\Ret_\tau(S) +a_O\Out_\tau(S) +a_C\COut_\tau(S)\\ &-a_D\Dep_\tau(S) -a_I\CIn_\tau(S) -a_L\mathsf{Coh}(S)\\ &-a_K\mathsf{Cut}(S) -a_Z\mathsf{Size}(S) -a_T\Instability_t(S). \end{aligned} }
a_DUse in source · 1 passage
Search aliases: a_D
Use in source · 15-boundary-formation-and-stability.tex, line 144
A general score is B_t(S) = · a_RRet_τ(S) +a_OOut_τ(S) +a_CCOut_τ(S) · -a_DDep_τ(S) -a_ICIn_τ(S) -a_LCoh(S) · -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal B_t(S) ={}& a_R\Ret_\tau(S) +a_O\Out_\tau(S) +a_C\COut_\tau(S)\\ &-a_D\Dep_\tau(S) -a_I\CIn_\tau(S) -a_L\mathsf{Coh}(S)\\ &-a_K\mathsf{Cut}(S) -a_Z\mathsf{Size}(S) -a_T\Instability_t(S). \end{aligned} }
a_eUse in source · 3 passages
Search aliases: a_e
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 374
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1
Exact mathematical passage
z_i\in\{0,1\}, \qquad a_e\in[0,1]
a_IUse in source · 1 passage
Search aliases: a_I
Use in source · 15-boundary-formation-and-stability.tex, line 144
A general score is B_t(S) = · a_RRet_τ(S) +a_OOut_τ(S) +a_CCOut_τ(S) · -a_DDep_τ(S) -a_ICIn_τ(S) -a_LCoh(S) · -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal B_t(S) ={}& a_R\Ret_\tau(S) +a_O\Out_\tau(S) +a_C\COut_\tau(S)\\ &-a_D\Dep_\tau(S) -a_I\CIn_\tau(S) -a_L\mathsf{Coh}(S)\\ &-a_K\mathsf{Cut}(S) -a_Z\mathsf{Size}(S) -a_T\Instability_t(S). \end{aligned} }
A_jUse in source · 1 passage
Search aliases: A_j
Use in source · 03-exact-shared-cores.tex, line 492
Conversely, take B∈Comm(Hol_o) and define A_i=H_τ_iBH_τ_i^-1. This is independent of the chosen root path: changing τ_i multiplies it by a loop holonomy that commutes with B. For an edge e:i→ j, the operator H_τ_j^-1H_eH_τ_i is a root holonomy. Commutation with B rearranges to A_jH_e=H_eA_i. Hence (A_i) is natural and Φ_o((A_i))=B. Thus Φ_o is surjective.
Exact mathematical passage
A_jH_e=H_eA_i.
a_KUse in source · 1 passage
Search aliases: a_K
Use in source · 15-boundary-formation-and-stability.tex, line 144
A general score is B_t(S) = · a_RRet_τ(S) +a_OOut_τ(S) +a_CCOut_τ(S) · -a_DDep_τ(S) -a_ICIn_τ(S) -a_LCoh(S) · -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal B_t(S) ={}& a_R\Ret_\tau(S) +a_O\Out_\tau(S) +a_C\COut_\tau(S)\\ &-a_D\Dep_\tau(S) -a_I\CIn_\tau(S) -a_L\mathsf{Coh}(S)\\ &-a_K\mathsf{Cut}(S) -a_Z\mathsf{Size}(S) -a_T\Instability_t(S). \end{aligned} }
a_LUse in source · 1 passage
Search aliases: a_L
Use in source · 15-boundary-formation-and-stability.tex, line 144
A general score is B_t(S) = · a_RRet_τ(S) +a_OOut_τ(S) +a_CCOut_τ(S) · -a_DDep_τ(S) -a_ICIn_τ(S) -a_LCoh(S) · -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal B_t(S) ={}& a_R\Ret_\tau(S) +a_O\Out_\tau(S) +a_C\COut_\tau(S)\\ &-a_D\Dep_\tau(S) -a_I\CIn_\tau(S) -a_L\mathsf{Coh}(S)\\ &-a_K\mathsf{Cut}(S) -a_Z\mathsf{Size}(S) -a_T\Instability_t(S). \end{aligned} }
A_oUse in source · 6 passages
Search aliases: A_o
Use in source · 03-exact-shared-cores.tex, line 446
[Commutant characterization] Let |G| be connected and let H be an invertible local system. Root evaluation induces an algebra isomorphism Φ_o: O_Workspace xrightarrow ≅ Comm(Hol_o), Φ_o((A_i))=A_o, where Comm(Hol_o) = {B∈End(C_o):Bh=hB ∀ h∈Hol_o}.
Exact mathematical passage
\boxed{ \Phi_o:\mathcal O_{\Workspace} \xrightarrow{\ \cong\ } \operatorname{Comm}(\Hol_o), \qquad \Phi_o((A_i))=A_o, }
a_OUse in source · 1 passage
Search aliases: a_O
Use in source · 15-boundary-formation-and-stability.tex, line 144
A general score is B_t(S) = · a_RRet_τ(S) +a_OOut_τ(S) +a_CCOut_τ(S) · -a_DDep_τ(S) -a_ICIn_τ(S) -a_LCoh(S) · -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal B_t(S) ={}& a_R\Ret_\tau(S) +a_O\Out_\tau(S) +a_C\COut_\tau(S)\\ &-a_D\Dep_\tau(S) -a_I\CIn_\tau(S) -a_L\mathsf{Coh}(S)\\ &-a_K\mathsf{Cut}(S) -a_Z\mathsf{Size}(S) -a_T\Instability_t(S). \end{aligned} }
A_PUse in source · 4 passages
Search aliases: A_P
Use in source · 04-approximate-workspaces.tex, line 414
On ran P and ranwidetilde Q, set A_P=PAP|_ran P, B_Q=widetilde QBwidetilde Q|_ranwidetilde Q. The operator X=Pwidetilde Q satisfies the Sylvester equation A_PX-XB_Q=-PEwidetilde Q. Let μ=(a+b)/2. Since e^t(A_P-μ I) ≤ e^-(b-a)t/2, e^-t(B_Q-μ I) ≤ e^-(b-a)t/2, the inverse Sylvester operator has the convergent integral representation X = ∫_0^∞ e^t(A_P-μ I) (PEwidetilde Q) e^-t(B_Q-μ I) dd t. Taking norms and integrating gives the result.
Exact mathematical passage
A_P=PAP|_{\ran P}, \qquad B_Q=\widetilde QB\widetilde Q|_{\ran\widetilde Q}.
a_RUse in source · 1 passage
Search aliases: a_R
Use in source · 15-boundary-formation-and-stability.tex, line 144
A general score is B_t(S) = · a_RRet_τ(S) +a_OOut_τ(S) +a_CCOut_τ(S) · -a_DDep_τ(S) -a_ICIn_τ(S) -a_LCoh(S) · -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal B_t(S) ={}& a_R\Ret_\tau(S) +a_O\Out_\tau(S) +a_C\COut_\tau(S)\\ &-a_D\Dep_\tau(S) -a_I\CIn_\tau(S) -a_L\mathsf{Coh}(S)\\ &-a_K\mathsf{Cut}(S) -a_Z\mathsf{Size}(S) -a_T\Instability_t(S). \end{aligned} }
A_SUse in source · 21 passages
Search aliases: A_S
Use in source · 11-reconstruction-and-resilience.tex, line 37
For a coalition S⊆ V, define the analysis operator A_S:C_*⟶⊕_i∈ S Y_i, A_Sc=(E_ic)_i∈ S, and the coalition frame operator F_S=A_S^*A_S=∑_i∈ SE_i^*E_i. Set α_S=λ_min(F_S), β_S=λ_max(F_S). Thus α_S c ^2 ≤ A_Sc ^2 ≤ β_S c ^2.
Exact mathematical passage
A_S:C_*\longrightarrow\bigoplus_{i\in S}\mathsf Y_i, \qquad A_Sc=(E_ic)_{i\in S},
A_S'Use in source · 3 passages
Search aliases: A_S'
Use in source · 12-identity-through-time-and-replacement.tex, line 487
[Preservation of coalition frame bounds] Identify the old and new abstract cores with ran P and ran P' through their chosen core parameterizations. Let S be a declared coalition, let A_S:ran P→ Y_S, A_S':ran P'→ Y_S' be the resulting accessible coalition encoders, and let K_S be a unitary identification of their observation spaces. Suppose A_S'β-K_SA_S ≤ δ_S^frame < sqrtα_S. Then the replacement coalition remains reconstructive and its new lower frame bound satisfies α_S' ≥ ( sqrtα_S-δ_S^frame )…
Exact mathematical passage
A_S:\ran P\to\mathsf Y_S, \qquad A_S':\ran P'\to\mathsf Y_S'
A_S^*Use in source · 2 passages
Search aliases: A_S^*
Use in source · 11-reconstruction-and-resilience.tex, line 43
For a coalition S⊆ V, define the analysis operator A_S:C_*⟶⊕_i∈ S Y_i, A_Sc=(E_ic)_i∈ S, and the coalition frame operator F_S=A_S^*A_S=∑_i∈ SE_i^*E_i. Set α_S=λ_min(F_S), β_S=λ_max(F_S). Thus α_S c ^2 ≤ A_Sc ^2 ≤ β_S c ^2.
Exact mathematical passage
\boxed{ F_S=A_S^*A_S=\sum_{i\in S}E_i^*E_i. }
A_S^\daggerUse in source · 10 passages
Search aliases: A_S^† dagger
Use in source · 11-reconstruction-and-resilience.tex, line 72
[Coalition reconstruction criterion] For a coalition S, the following are equivalent: item A_S is injective; item F_S is positive definite; item α_S>0; item there exists a linear decoder R_S with R_SA_S=I_C_*. When these conditions hold, the canonical decoder is R_S=A_S^†=F_S^-1A_S^*.
Exact mathematical passage
\boxed{ R_S=A_S^\dagger=F_S^{-1}A_S^*. }
a_TUse in source · 1 passage
Search aliases: a_T
Use in source · 15-boundary-formation-and-stability.tex, line 144
A general score is B_t(S) = · a_RRet_τ(S) +a_OOut_τ(S) +a_CCOut_τ(S) · -a_DDep_τ(S) -a_ICIn_τ(S) -a_LCoh(S) · -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal B_t(S) ={}& a_R\Ret_\tau(S) +a_O\Out_\tau(S) +a_C\COut_\tau(S)\\ &-a_D\Dep_\tau(S) -a_I\CIn_\tau(S) -a_L\mathsf{Coh}(S)\\ &-a_K\mathsf{Cut}(S) -a_Z\mathsf{Size}(S) -a_T\Instability_t(S). \end{aligned} }
a_tUse in source · 2 passages
Search aliases: a_t
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 851
After a possible damage event, let the pre-repair health be h_t^-∈{0,1}. The system chooses a joint action u_t=(a_t,r_t)∈{0,1}^2, where a_t is a task action and r_t is a repair action. Define the optimal task action a_t^*=g_t⊕ b_t⊕ h_t^- and optimal repair action r_t^*=1-h_t^-. No individual node determines the full pair (a_t^*,r_t^*): item the planner lacks h_t^-; item the monitor lacks g_t; and item the recorder lacks b_t. Every two-node coalition determines all three workspace bits and theref…
Exact mathematical passage
u_t=(a_t,r_t)\in\{0,1\}^2,
A_{t+\tau}Use in source · 3 passages
Search aliases: A_t+τ tau
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 286
τ^0. For goal interventions ι_g and ι_g', define the cue-controlled retention effect η_G(τ;g,g') = D_G ( P ( G_t+τ∈· mid ι_g, do(C_t+1:t+τ=c^0) ), P ( G_t+τ∈· mid ι_g', do(C_t+1:t+τ=c^0) ) ). The corresponding action-retention effect is η_G→ A(τ;g,g') = D_A ( P(A_t+τ∈·midι_g,c^0), P(A_t+τ∈·midι_g',c^0) ). The first quantity tests whether a goal difference survives. The second tests whether the surviving difference remains behaviorally operative.
Exact mathematical passage
\eta_{G\to A}(\tau;g,g') = D_A \left( \mathbb P(A_{t+\tau}\in\cdot\mid\iota_g,c^0), \mathbb P(A_{t+\tau}\in\cdot\mid\iota_{g'},c^0) \right).
a_t^*Use in source · 3 passages
Search aliases: a_t^*
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 856
After a possible damage event, let the pre-repair health be h_t^-∈{0,1}. The system chooses a joint action u_t=(a_t,r_t)∈{0,1}^2, where a_t is a task action and r_t is a repair action. Define the optimal task action a_t^*=g_t⊕ b_t⊕ h_t^- and optimal repair action r_t^*=1-h_t^-. No individual node determines the full pair (a_t^*,r_t^*): item the planner lacks h_t^-; item the monitor lacks g_t; and item the recorder lacks b_t. Every two-node coalition determines all three workspace bits and theref…
Exact mathematical passage
a_t^*=g_t\oplus b_t\oplus h_t^-
A_{V\setminus A}Use in source · 2 passages
Search aliases: A_V∖ A setminus
Use in source · 11-reconstruction-and-resilience.tex, line 258
[Uniform erasure resilience] The encoding family is exactly reconstructible after every loss of at most k nodes if and only if α^(k)>0. If surviving observations have the form y_V∖ A=A_V∖ Ac+η_A, |A|≤ k, then the canonical survivor decoder obeys the uniform estimate widehat c_A-c ≤ frac η_A sqrtα^(k).
Exact mathematical passage
y_{V\setminus A}=A_{V\setminus A}c+\eta_A, \qquad |A|\leq k,
\mathfrak A_{\Workspace}Use in source · 1 passage
Search aliases: A_Workspace mathfrak Workspace
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 24
A controlled relational realization extends Definition~[source reference] by the tuple A_Workspace = ( R, G, A_t, Y^+, {U_g}_g∈ G, Π, I_A, I_G, I_D, I_R ). Here: item R is the underlying relational realization; item G is a measurable goal-code space; item A_t is the feasible action set at time t; item Y^+ is the relevant future trajectory space; item U_g: Y^+→ R evaluates a trajectory under goal code g; item Π is an admissible class of workspace-level policies; item I_A and I_G are feasible acti…
Exact mathematical passage
\boxed{ \mathfrak A_{\Workspace} = \left( \mathfrak R, \mathcal G, \mathcal A_t, \mathcal Y^+, \{U_g\}_{g\in\mathcal G}, \Pi, \mathcal I_A, \mathcal I_G, \mathcal I_D, \mathcal I_R \right). }
a_ZUse in source · 1 passage
Search aliases: a_Z
Use in source · 15-boundary-formation-and-stability.tex, line 144
A general score is B_t(S) = · a_RRet_τ(S) +a_OOut_τ(S) +a_CCOut_τ(S) · -a_DDep_τ(S) -a_ICIn_τ(S) -a_LCoh(S) · -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal B_t(S) ={}& a_R\Ret_\tau(S) +a_O\Out_\tau(S) +a_C\COut_\tau(S)\\ &-a_D\Dep_\tau(S) -a_I\CIn_\tau(S) -a_L\mathsf{Coh}(S)\\ &-a_K\mathsf{Cut}(S) -a_Z\mathsf{Size}(S) -a_T\Instability_t(S). \end{aligned} }
A_\alphaUse in source · 3 passages
Search aliases: A_α alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 751
Suppose local operations A_α:mathscr W_α→mathscr W_α and overlap operations A_αβ:mathscr W_αβ→ mathscr W_αβ satisfy r_αβ^αA_α = A_αβr_αβ^α, r_αβ^βA_β = A_αβr_αβ^β. Then, with A^0=⊕_α A_α and A^1=⊕_α<βA_αβ, B_ UA^0=A^1B_ U. Therefore A^0ker B_ U⊆ker B_ U. The operation-closure theorem from Part~III reappears at the meta level: operations on subworkspaces descend globally precisely when they agree on interfaces.
Exact mathematical passage
A_\alpha:\mathscr W_\alpha\to\mathscr W_\alpha
A_{\alpha\beta}Use in source · 3 passages
Search aliases: A_αβ alpha beta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 755
Suppose local operations A_α:mathscr W_α→mathscr W_α and overlap operations A_αβ:mathscr W_αβ→ mathscr W_αβ satisfy r_αβ^αA_α = A_αβr_αβ^α, r_αβ^βA_β = A_αβr_αβ^β. Then, with A^0=⊕_α A_α and A^1=⊕_α<βA_αβ, B_ UA^0=A^1B_ U. Therefore A^0ker B_ U⊆ker B_ U. The operation-closure theorem from Part~III reappears at the meta level: operations on subworkspaces descend globally precisely when they agree on interfaces.
Exact mathematical passage
A_{\alpha\beta}:\mathscr W_{\alpha\beta}\to \mathscr W_{\alpha\beta}
A_\betaUse in source · 1 passage
Search aliases: A_β beta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 760
Suppose local operations A_α:mathscr W_α→mathscr W_α and overlap operations A_αβ:mathscr W_αβ→ mathscr W_αβ satisfy r_αβ^αA_α = A_αβr_αβ^α, r_αβ^βA_β = A_αβr_αβ^β. Then, with A^0=⊕_α A_α and A^1=⊕_α<βA_αβ, B_ UA^0=A^1B_ U. Therefore A^0ker B_ U⊆ker B_ U. The operation-closure theorem from Part~III reappears at the meta level: operations on subworkspaces descend globally precisely when they agree on interfaces.
Exact mathematical passage
r_{\alpha\beta}^{\alpha}A_\alpha = A_{\alpha\beta}r_{\alpha\beta}^{\alpha}, \qquad r_{\alpha\beta}^{\beta}A_\beta = A_{\alpha\beta}r_{\alpha\beta}^{\beta}.
\mathsf{actions}Use in source · 1 passage
Search aliases: actions mathsf
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 660
The machine-readable record should contain at least the following top-level objects: ResultRecord ={ · claim, specification, specification_family, decomposition, data_splits, formation, · workspace_extractor, goals, actions, interventions, · nulls, gates, identified_sets, specification_envelopes, uncertainty, failures, artifacts }. Each gate object records its symbol, estimator, direction, threshold, point estimate, interval, split, seed set, status, and artifact reference. Each intervention and…
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{ResultRecord} =\{& \mathsf{claim}, \mathsf{specification}, \mathsf{specification\_family}, \mathsf{decomposition}, \mathsf{data\_splits}, \mathsf{formation},\\ &\mathsf{workspace\_extractor}, \mathsf{goals}, \mathsf{actions}, \mathsf{interventions},\\ &\mathsf{nulls}, \mathsf{gates}, \mathsf{identified\_sets}, \mathsf{specification\_envelopes}, \mathsf{uncertainty}, \mathsf{failures}, \mathsf{artifacts} \}. \end{aligned} }
\operatorname{AdaptivelyParameterised}Use in source · 1 passage
Search aliases: AdaptivelyParameterised operatorname
Use in source · 24-theory-hierarchy.tex, line 74
subtopicOrthogonal formation-provenance axis Scaffolded ⟶ AdaptivelyParameterised ⟶ StructurallyAdaptive ⟶ EndogenouslyConstituted. This axis is independent of Levels~0--6. A scaffolded system can instantiate a high-level relational workspace, while an endogenously learned organization can fail every operational workspace gate.
Exact mathematical passage
\operatorname{Scaffolded} \longrightarrow \operatorname{AdaptivelyParameterised} \longrightarrow \operatorname{StructurallyAdaptive} \longrightarrow \operatorname{EndogenouslyConstituted}.
\addcontentslineUse in source · 1 passage
Search aliases: addcontentsline
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
\mathsf{ADP}Use in source · 15 passages
Search aliases: ADP mathsf
Use in source · 23-relation-to-prior-work.tex, line 15
The audit uses five labels: ll STD · = established concept, theorem, or technique, ADP · = established machinery adapted to relational workspaces, SYN · = nontrivial synthesis of established components, CAN · = candidate original contribution requiring priority review, EMP · = empirical claim not yet established in an uncontrolled system. These labels describe the status of a claim, not its importance. A standard result may be indispensable. A synthesis may be scientifically useful without conta…
Exact mathematical passage
\begin{array}{ll} \mathsf{STD} & = \text{established concept, theorem, or technique},\\ \mathsf{ADP} & = \text{established machinery adapted to relational workspaces},\\ \mathsf{SYN} & = \text{nontrivial synthesis of established components},\\ \mathsf{CAN} & = \text{candidate original contribution requiring priority review},\\ \mathsf{EMP} & = \text{empirical claim not yet established in an uncontrolled system}. \end{array}
\operatorname{Agent}Use in source · 3 passages
Search aliases: Agent operatorname
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1100
by fracoverline d+overlineϵ1-β; item no single-node statistic is sufficient for the complete control state; item matched local policy nulls cannot reproduce the intact control value; item goal-dependent action selection and workspace repair are causally mediated by implemented internal channels. Hence the realization satisfies the formal predicate Agent_Θ_A(Workspace)=1.
Exact mathematical passage
\operatorname{Agent}_{\Theta_A}(\Workspace)=1.
\operatorname{Agent}_{\Theta_A}Use in source · 3 passages
Search aliases: Agent_Θ_A operatorname Theta
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1100
by fracoverline d+overlineϵ1-β; item no single-node statistic is sufficient for the complete control state; item matched local policy nulls cannot reproduce the intact control value; item goal-dependent action selection and workspace repair are causally mediated by implemented internal channels. Hence the realization satisfies the formal predicate Agent_Θ_A(Workspace)=1.
Exact mathematical passage
\operatorname{Agent}_{\Theta_A}(\Workspace)=1.
\mathbf{Alg}Use in source · 1 passage
Search aliases: Alg mathbf
Use in source · 02-static-core-transfer-theory.tex, line 51
The finite-dimensional Hilbert assumption supplies adjoints and spectral tools. The exact compatible-section definitions require less and may later be formulated in categories such as Ban, Meas, Prob, Top, Alg.
Exact mathematical passage
\mathbf{Ban},\qquad \mathbf{Meas},\qquad \mathbf{Prob},\qquad \mathbf{Top},\qquad \mathbf{Alg}.
\mathrm{align}Use in source · 13 passages
Search aliases: align mathrm
Use in source · 06-dynamic-workspace-theory.tex, line 425
Define the observational alignment defect by δ_align^obs(W_t) = I_ P(Y_t^+; H_tmid W_t). For a countable intervention family with declared weights q_ι>0, ∑_ι q_ι=1, define δ_align^ I(W_t) = ∑_ι∈ I q_ι I_ P^ι (Y_t^+; H_tmid W_t). For bounded decision losses, Proposition~[source reference] applies under each intervention and gives the weighted bound ∑_ιq_ι [ Risk_ℓ^ι(W_t) - Risk_ℓ^ι( H_t) ] ≤ sqrtfrac δ_align^ I(W_t)2.
Exact mathematical passage
\boxed{ \delta_{\mathrm{align}}^{\mathrm{obs}}(W_t) = I_{\mathbb P}(Y_t^+;\mathbf H_t\mid W_t). }
\mathrm{analytic}Use in source · 2 passages
Search aliases: analytic mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 447
Inside the declared finite model, S · =checkmark_analytic, · O · =checkmark_analytic, R · =checkmark_analytic, · P · =checkmark_analytic, F · =scaffolded, · A · =not tested, D · =fixed decomposition, · C · =not established. The highest supported level is Level~4 when the handoff dynamics and identity correspondence are included. The example does not contain an operational goal state, counterfactual policy, damage monitor, or repair loop, so it does not support Levels~5 or 6.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf S&=\checkmark_{\mathrm{analytic}}, &\mathsf O&=\checkmark_{\mathrm{analytic}},\\ \mathsf R&=\checkmark_{\mathrm{analytic}}, &\mathsf P&=\checkmark_{\mathrm{analytic}},\\ \mathsf F&=\text{scaffolded}, &\mathsf A&=\text{not tested},\\ \mathsf D&=\text{fixed decomposition}, &\mathsf C&=\text{not established}. \end{aligned} }
\operatorname{Ann}Use in source · 2 passages
Search aliases: Ann operatorname
Use in source · 03-exact-shared-cores.tex, line 519
Some natural operators may vanish on every global section while acting nontrivially on locally available but globally inconsistent directions. Define the annihilator Ann(Γ(H)) = {A∈ O_Workspace: π_Workspace(A)=0}. The effective workspace algebra is O_Workspace^eff = O_Workspace/Ann(Γ(H)). Its action on Γ(H) is faithful by construction.
Exact mathematical passage
\operatorname{Ann}(\Gamma(H)) = \{A\in\mathcal O_{\Workspace}: \pi_{\Workspace}(A)=0\}.
\argmax_aUse in source · 1 passage
Search aliases: argmax_a argmax
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 538
) is δ_opt-optimal for widehat Q: max_π E_a∼π[widehat Q(a)] - E_a∼widehatπ[widehat Q(a)] ≤ δ_opt. Then, for every true-value-optimal policy π^*, E_a∼π^*[Q(a)] - E_a∼widehatπ[Q(a)] ≤ 2ε_Q+δ_opt. For a deterministic greedy action widehat a∈argmax_awidehat Q(a), Q(a^*)-Q(widehat a) ≤2ε_Q. If the true optimal action a^* is unique and its value gap Δ_Q = Q(a^*)- max_a≠ a^*Q(a) satisfies Δ_Q>2ε_Q, then every greedy maximizer of widehat Q equals a^*.
Exact mathematical passage
\widehat a\in\argmax_a\widehat Q(a)
\argmax_rUse in source · 2 passages
Search aliases: argmax_r argmax
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 801
[Repair selection under value-model error] Fix a damage intervention d and a finite feasible repair set R. Let V(r)=V_t^rep(r;d) be the true expected post-repair integrity margin and let widehat V obey sup_r∈ R|widehat V(r)-V(r)| ≤ ε_R. Let widehat r∈argmax_rwidehat V(r) and r^*∈argmax_r V(r). Then V(r^*)-V(widehat r) ≤ 2ε_R. If V(r^*) ≥ ρ+2ε_R, then the selected repair restores the expected reserve: V(widehat r)≥ρ. If r^* is unique and its repair-value gap exceeds 2ε_R, then widehat r=r^*.
Exact mathematical passage
\widehat r\in\argmax_r\widehat V(r)
\argmax_{S\in\mathfrak S_{\mathrm{pass}}}Use in source · 3 passages
Search aliases: argmax_S∈ S_pass argmax in mathfrak mathrm
Use in source · 15-boundary-formation-and-stability.tex, line 163
· -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\widehat S_t \in \argmax_{S\in\mathfrak S_{\mathrm{pass}}} \widehat{\mathcal B}_t(S),
\argminUse in source · 2 passages
Search aliases: argmin
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 395
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1 · + λ_stab J_stab + λ_leak J_leak }. The objective is schematic rather than universal. Its purpose is to expose which quantities were fixed and which were optimized. If z and …
Exact mathematical passage
\boxed{ \begin{aligned} \widehat\theta \in \argmin_{z,a,H,P,\mathcal O,B} \Bigl \{& \widehat{\mathcal R}_{\mathrm{task}} + \lambda_{\mathrm{coh}}\|D_{a,H}c\|^2 + \lambda_E\|a\|_1 + \lambda_V\|z\|_1\\ &+ \lambda_{\mathrm{stab}}\mathcal J_{\mathrm{stab}} + \lambda_{\mathrm{leak}}\mathcal J_{\mathrm{leak}} \Bigr\}. \end{aligned} }
\argmin_{z,a,H,P,\mathcal O,B}Use in source · 1 passage
Search aliases: argmin_z,a,H,P, O,B argmin mathcal
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 395
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1 · + λ_stab J_stab + λ_leak J_leak }. The objective is schematic rather than universal. Its purpose is to expose which quantities were fixed and which were optimized. If z and …
Exact mathematical passage
\boxed{ \begin{aligned} \widehat\theta \in \argmin_{z,a,H,P,\mathcal O,B} \Bigl \{& \widehat{\mathcal R}_{\mathrm{task}} + \lambda_{\mathrm{coh}}\|D_{a,H}c\|^2 + \lambda_E\|a\|_1 + \lambda_V\|z\|_1\\ &+ \lambda_{\mathrm{stab}}\mathcal J_{\mathrm{stab}} + \lambda_{\mathrm{leak}}\mathcal J_{\mathrm{leak}} \Bigr\}. \end{aligned} }
\argmin_{\theta\in\mathfrak T}Use in source · 1 passage
Search aliases: argmin_θ∈ T argmin theta in mathfrak
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 602
[Uniform structure-selection recovery] Let T be a finite candidate family with population score J: T→ R. Let θ_* = argmin_θ∈ TJ(θ) be unique, with margin Δ_J = min_θ≠θ_* (J(θ)-J(θ_*))>0. If a held-out estimate widehat J satisfies sup_θ∈ T |widehat J(θ)-J(θ)| ≤ε, then every empirical minimizer widehatθ obeys J(widehatθ)-J(θ_*) ≤2ε. If 2ε<Δ_J, then widehatθ=θ_*.
Exact mathematical passage
\theta_* = \argmin_{\theta\in\mathfrak T}J(\theta)
\operatorname{artanh}Use in source · 4 passages
Search aliases: artanh operatorname
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 134
A fixed point satisfies artanh(m)=λ m. For m>0, the function h(m)=fracartanh(m)m is strictly increasing from 1 to +∞. Hence there is no positive solution when λ≤1, and exactly one positive solution when λ>1. Odd symmetry gives the negative solution.
Exact mathematical passage
\operatorname{artanh}(m)=\lambda m.
\mathsf{artifacts}Use in source · 1 passage
Search aliases: artifacts mathsf
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 660
The machine-readable record should contain at least the following top-level objects: ResultRecord ={ · claim, specification, specification_family, decomposition, data_splits, formation, · workspace_extractor, goals, actions, interventions, · nulls, gates, identified_sets, specification_envelopes, uncertainty, failures, artifacts }. Each gate object records its symbol, estimator, direction, threshold, point estimate, interval, split, seed set, status, and artifact reference. Each intervention and…
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{ResultRecord} =\{& \mathsf{claim}, \mathsf{specification}, \mathsf{specification\_family}, \mathsf{decomposition}, \mathsf{data\_splits}, \mathsf{formation},\\ &\mathsf{workspace\_extractor}, \mathsf{goals}, \mathsf{actions}, \mathsf{interventions},\\ &\mathsf{nulls}, \mathsf{gates}, \mathsf{identified\_sets}, \mathsf{specification\_envelopes}, \mathsf{uncertainty}, \mathsf{failures}, \mathsf{artifacts} \}. \end{aligned} }
B^*Use in source · 1 passage
Search aliases: B^*
Use in source · 12-identity-through-time-and-replacement.tex, line 158
eorem[Approximate structural replacement] If η_L<frac g2, then q_str := P'-J_VPJ_V^* ≤ fracη_Lg-η_L ≤ frac2η_Lg. If q_str<1, then B=P'J_VP:ran P⟶ran P' is bijective and satisfies σ_min(B) ≥ sqrt1-q_str^2. Its polar factor β =B(B^*B)^-1/2 is a canonical unitary workspace correspondence. Moreover, β-J_VP ≤ q_str + 1-sqrt1-q_str^2.
Exact mathematical passage
\boxed{ \beta =B(B^*B)^{-1/2} }
b^2Use in source · 2 passages
Search aliases: b^2
Use in source · 04-approximate-workspaces.tex, line 344
Let C_1=C_2= R, use unit weights, and take two directed transfers H_12=a, H_21=b. Then D_H = -a · 1 1 · -b , L_H = a^2+1 · -(a+b) -(a+b) · b^2+1 . Writing τ=a^2+b^2+2, the eigenvalues are λ_± = frac12 ( τ±sqrtτ^2-4(ab-1)^2 ), and det L_H=(ab-1)^2. Thus a nonzero exact shared core exists precisely when ab=1, which is exactly the trivial-holonomy condition. Away from exact consistency, λ_-λ_+=(ab-1)^2. When |ab-1| is small while λ_+ stays bounded away from zero, the soft workspace eigenvalue is qu…
Exact mathematical passage
D_H = \begin{pmatrix} -a&1\\ 1&-b \end{pmatrix}, \qquad L_H = \begin{pmatrix} a^2+1&-(a+b)\\ -(a+b)&b^2+1 \end{pmatrix}.
B_{\mathcal U}Use in source · 7 passages
Search aliases: B_ U mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 480
First assume each local state already lies in its exact local workspace. Define B_ U := δ^0: check C^0( U;mathscr W) ⟶ check C^1( U;mathscr W) and the meta-Laplacian L_ U^meta = B_ U^*B_ U. By Theorem~[source reference], ker L_ U^meta = R_ Umathscr W(G). Thus the gluing problem is itself a workspace problem whose ``nodes'' are local workspaces and whose interfaces are overlaps.
Exact mathematical passage
B_{\mathcal U} := \delta^0: \check C^0(\mathcal U;\mathscr W) \longrightarrow \check C^1(\mathcal U;\mathscr W)
B_{\mathcal U}^*Use in source · 1 passage
Search aliases: B_ U^* mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 489
First assume each local state already lies in its exact local workspace. Define B_ U := δ^0: check C^0( U;mathscr W) ⟶ check C^1( U;mathscr W) and the meta-Laplacian L_ U^meta = B_ U^*B_ U. By Theorem~[source reference], ker L_ U^meta = R_ Umathscr W(G). Thus the gluing problem is itself a workspace problem whose ``nodes'' are local workspaces and whose interfaces are overlaps.
Exact mathematical passage
\boxed{ L_{\mathcal U}^{\mathrm{meta}} = B_{\mathcal U}^*B_{\mathcal U}. }
b_{12}Use in source · 5 passages
Search aliases: b_12
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 305
Consider three charts arranged in a cycle, with one-dimensional overlap spaces and oriented offsets b_12, b_23, b_31. Local potentials would have to satisfy q_2-q_1=b_12, q_3-q_2=b_23, q_1-q_3=b_31. Adding the equations gives the necessary and sufficient condition b_12+b_23+b_31=0. With the standard edge norm, the harmonic obstruction has magnitude ω_ U(b) = frac|b_12+b_23+b_31|sqrt3. Every pairwise relation may be individually meaningful while the complete cycle remains globally inconsistent.
Exact mathematical passage
b_{12},\qquad b_{23},\qquad b_{31}.
b_{23}Use in source · 5 passages
Search aliases: b_23
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 305
Consider three charts arranged in a cycle, with one-dimensional overlap spaces and oriented offsets b_12, b_23, b_31. Local potentials would have to satisfy q_2-q_1=b_12, q_3-q_2=b_23, q_1-q_3=b_31. Adding the equations gives the necessary and sufficient condition b_12+b_23+b_31=0. With the standard edge norm, the harmonic obstruction has magnitude ω_ U(b) = frac|b_12+b_23+b_31|sqrt3. Every pairwise relation may be individually meaningful while the complete cycle remains globally inconsistent.
Exact mathematical passage
b_{12},\qquad b_{23},\qquad b_{31}.
b_{31}Use in source · 5 passages
Search aliases: b_31
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 305
Consider three charts arranged in a cycle, with one-dimensional overlap spaces and oriented offsets b_12, b_23, b_31. Local potentials would have to satisfy q_2-q_1=b_12, q_3-q_2=b_23, q_1-q_3=b_31. Adding the equations gives the necessary and sufficient condition b_12+b_23+b_31=0. With the standard edge norm, the harmonic obstruction has magnitude ω_ U(b) = frac|b_12+b_23+b_31|sqrt3. Every pairwise relation may be individually meaningful while the complete cycle remains globally inconsistent.
Exact mathematical passage
b_{12},\qquad b_{23},\qquad b_{31}.
B_QUse in source · 4 passages
Search aliases: B_Q
Use in source · 04-approximate-workspaces.tex, line 414
On ran P and ranwidetilde Q, set A_P=PAP|_ran P, B_Q=widetilde QBwidetilde Q|_ranwidetilde Q. The operator X=Pwidetilde Q satisfies the Sylvester equation A_PX-XB_Q=-PEwidetilde Q. Let μ=(a+b)/2. Since e^t(A_P-μ I) ≤ e^-(b-a)t/2, e^-t(B_Q-μ I) ≤ e^-(b-a)t/2, the inverse Sylvester operator has the convergent integral representation X = ∫_0^∞ e^t(A_P-μ I) (PEwidetilde Q) e^-t(B_Q-μ I) dd t. Taking norms and integrating gives the result.
Exact mathematical passage
A_P=PAP|_{\ran P}, \qquad B_Q=\widetilde QB\widetilde Q|_{\ran\widetilde Q}.
b_qUse in source · 15 passages
Search aliases: b_q
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 488
Fix a reference decomposition D_0. For each D∈ D, let Φ_ D:W^ D_0⟶ W^ D be a declared workspace correspondence and let δ_ D measure its structural and causal identity defect. Assume gate q has a transport bound | m_q(Φ_ DW; D) -m_q(W; D_0) | ≤ L_qδ_ D+b_q( D), where L_q is a sensitivity constant and b_q records model mismatch not captured by the identity distance.
Exact mathematical passage
\left| m_q(\Phi_{\mathcal D}W;\mathcal D) -m_q(W;\mathcal D_0) \right| \leq L_q\delta_{\mathcal D}+b_q(\mathcal D),
B_q^{\mathrm{model}}Use in source · 1 passage
Search aliases: B_q^model mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 378
In practice, the reference margin is reduced by three distinct uncertainty budgets: B_q^total = B_q^model +B_q^spec +B_q^sample. The first covers variation across observationally compatible realizations. The second covers variation across admissible specifications. The third covers finite-sample estimation. The sufficient condition widehat m_q(W;ς_0) > B_q^total (q∈ J_*) will reappear below in identified-set and confidence-envelope form. Keeping the budgets separate prevents an apparently narrow…
Exact mathematical passage
\boxed{ B_q^{\mathrm{total}} = B_q^{\mathrm{model}} +B_q^{\mathrm{spec}} +B_q^{\mathrm{sample}}. }
B_q^{\mathrm{sample}}Use in source · 1 passage
Search aliases: B_q^sample mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 378
In practice, the reference margin is reduced by three distinct uncertainty budgets: B_q^total = B_q^model +B_q^spec +B_q^sample. The first covers variation across observationally compatible realizations. The second covers variation across admissible specifications. The third covers finite-sample estimation. The sufficient condition widehat m_q(W;ς_0) > B_q^total (q∈ J_*) will reappear below in identified-set and confidence-envelope form. Keeping the budgets separate prevents an apparently narrow…
Exact mathematical passage
\boxed{ B_q^{\mathrm{total}} = B_q^{\mathrm{model}} +B_q^{\mathrm{spec}} +B_q^{\mathrm{sample}}. }
B_q^{\mathrm{spec}}Use in source · 1 passage
Search aliases: B_q^spec mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 378
In practice, the reference margin is reduced by three distinct uncertainty budgets: B_q^total = B_q^model +B_q^spec +B_q^sample. The first covers variation across observationally compatible realizations. The second covers variation across admissible specifications. The third covers finite-sample estimation. The sufficient condition widehat m_q(W;ς_0) > B_q^total (q∈ J_*) will reappear below in identified-set and confidence-envelope form. Keeping the budgets separate prevents an apparently narrow…
Exact mathematical passage
\boxed{ B_q^{\mathrm{total}} = B_q^{\mathrm{model}} +B_q^{\mathrm{spec}} +B_q^{\mathrm{sample}}. }
B_q^{\mathrm{total}}Use in source · 2 passages
Search aliases: B_q^total mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 378
In practice, the reference margin is reduced by three distinct uncertainty budgets: B_q^total = B_q^model +B_q^spec +B_q^sample. The first covers variation across observationally compatible realizations. The second covers variation across admissible specifications. The third covers finite-sample estimation. The sufficient condition widehat m_q(W;ς_0) > B_q^total (q∈ J_*) will reappear below in identified-set and confidence-envelope form. Keeping the budgets separate prevents an apparently narrow…
Exact mathematical passage
\boxed{ B_q^{\mathrm{total}} = B_q^{\mathrm{model}} +B_q^{\mathrm{spec}} +B_q^{\mathrm{sample}}. }
B_sUse in source · 2 passages
Search aliases: B_s
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 319
[Cue-controlled goal retention] Let G_s∈ R^d_G obey G_s+1 = R_sG_s+B_sC_s+1+ζ_s+1 (s=t,…,t+τ-1). Consider two intervention runs that set G_t=g, G_t'=g', and then use the same command trajectory and the same disturbance realization. Let R_t+τ:t = R_t+τ-1⋯ R_t. Then G_t+τ-G_t+τ' = R_t+τ:t(g-g'). If m_s ≤ σ_min(R_s), R_s ≤ M_s, then ( ∏_s=t^t+τ-1m_s ) g-g' ≤ G_t+τ-G_t+τ' ≤ ( ∏_s=t^t+τ-1M_s ) g-g' .
Exact mathematical passage
G_{s+1} = R_sG_s+B_sC_{s+1}+\zeta_{s+1} \qquad (s=t,\ldots,t+\tau-1).
\mathcal B_tUse in source · 11 passages
Search aliases: B_t mathcal
Use in source · 15-boundary-formation-and-stability.tex, line 144
A general score is B_t(S) = · a_RRet_τ(S) +a_OOut_τ(S) +a_CCOut_τ(S) · -a_DDep_τ(S) -a_ICIn_τ(S) -a_LCoh(S) · -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal B_t(S) ={}& a_R\Ret_\tau(S) +a_O\Out_\tau(S) +a_C\COut_\tau(S)\\ &-a_D\Dep_\tau(S) -a_I\CIn_\tau(S) -a_L\mathsf{Coh}(S)\\ &-a_K\mathsf{Cut}(S) -a_Z\mathsf{Size}(S) -a_T\Instability_t(S). \end{aligned} }
b_tUse in source · 8 passages
Search aliases: b_t
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 960
Let b_t∈[0,1] be a boundary-integrity score and let the reserve be ρ. Define e_t=(ρ-b_t)_+. Suppose uncorrected damage obeys e_t+1^(0) ≤ 1.08e_t+d_t, so the open-loop boundary is locally unstable. A repair policy with measured causal effect e_t+1^(0)-e_t+1 ≥ 0.25e_t-ϵ_t gives β=1.08-0.25=0.83. If overline d=0.01, overlineϵ=0.005, then limsup e_t ≤ frac0.0151-0.83 ≈0.0883. Thus an open-loop unstable boundary can be maintained within a finite deficit band by a sufficiently strong repair channel. T…
Exact mathematical passage
b_t\in[0,1]
\mathcal B_{t+1}Use in source · 3 passages
Search aliases: B_t+1 mathcal
Use in source · 15-boundary-formation-and-stability.tex, line 241
[Boundary persistence under score drift] Assume S_t^* is the unique maximizer of B_t with margin Δ_t^B, and suppose sup_S∈ S_pass | B_t+1(S)- B_t(S)| ≤δ_t. If 2δ_t<Δ_t^B, then S_t+1^*=S_t^*. More generally, B_t+1(S_t+1^*) - B_t+1(S_t^*) ≤2δ_t.
Exact mathematical passage
\sup_{S\in\mathfrak S_{\mathrm{pass}}} |\mathcal B_{t+1}(S)-\mathcal B_t(S)| \leq\delta_t.
B_t^{\mathrm{sys}}Use in source · 2 passages
Search aliases: B_t^sys mathrm
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 245
Let B_t^sys be an internal membership or routing state used by the system, and let S_t^* = argmax_S∈ S_pass B_t(S) be the population boundary defined by the external certification protocol. The strong endogenous boundary conjecture asserts that there are adaptive systems and nontrivial environments for which: · d_B(B_t^sys,S_t^*)→0,
Exact mathematical passage
B_t^{\mathrm{sys}}
b_{\alpha\beta}Use in source · 1 passage
Search aliases: b_αβ alpha beta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 204
A different problem arises when only relative transition data are supplied. Let b=(b_αβ)∈check C^1( U;mathscr W) be a prescribed family of overlap offsets. The triple-overlap consistency condition is δ^1b=0. One seeks local potentials q=(q_α)∈check C^0 satisfying δ^0q=b. Define check H^1( U;mathscr W) = frackerδ^1imδ^0. Then the affine gluing problem is solvable precisely when [b]=0 in check H^1( U;mathscr W). A nonzero class means that all local transition statements can be mutually consistent …
Exact mathematical passage
b=(b_{\alpha\beta})\in\check C^1(\mathcal U;\mathscr W)
\mathcal B_{\vartheta}Use in source · 1 passage
Search aliases: B_ϑ mathcal vartheta
Use in source · 15-boundary-formation-and-stability.tex, line 281
If the score depends on a parameter ϑ_t and satisfies sup_S | B_ϑ(S)- B_ϑ'(S)| ≤ L_Bd(ϑ,ϑ'), then the sufficient stability condition becomes 2L_Bd(ϑ_t,ϑ_t+1) < Δ_t^B.
Exact mathematical passage
\sup_S |\mathcal B_{\vartheta}(S)-\mathcal B_{\vartheta'}(S)| \leq L_Bd(\vartheta,\vartheta'),
\mathcal B_{\vartheta'}Use in source · 1 passage
Search aliases: B_ϑ' mathcal vartheta
Use in source · 15-boundary-formation-and-stability.tex, line 281
If the score depends on a parameter ϑ_t and satisfies sup_S | B_ϑ(S)- B_ϑ'(S)| ≤ L_Bd(ϑ,ϑ'), then the sufficient stability condition becomes 2L_Bd(ϑ_t,ϑ_t+1) < Δ_t^B.
Exact mathematical passage
\sup_S |\mathcal B_{\vartheta}(S)-\mathcal B_{\vartheta'}(S)| \leq L_Bd(\vartheta,\vartheta'),
\mathbf{Ban}Use in source · 1 passage
Search aliases: Ban mathbf
Use in source · 02-static-core-transfer-theory.tex, line 51
The finite-dimensional Hilbert assumption supplies adjoints and spectral tools. The exact compatible-section definitions require less and may later be formulated in categories such as Ban, Meas, Prob, Top, Alg.
Exact mathematical passage
\mathbf{Ban},\qquad \mathbf{Meas},\qquad \mathbf{Prob},\qquad \mathbf{Top},\qquad \mathbf{Alg}.
\bar SUse in source · 6 passages
Search aliases: bar S bar
Use in source · 15-boundary-formation-and-stability.tex, line 47
For S∈ S, define Ret_τ(S) = I ( X_S(t+τ);X_S(t) mid X_bar S(t),E_t ), Dep_τ(S) = I ( X_S(t+τ);X_bar S(t) mid X_S(t),E_t ), Out_τ(S) = I ( X_bar S(t+τ);X_S(t) mid X_bar S(t),E_t ). These quantities are observational. They can be nonzero because of common causes, selection, or feedback paths and therefore cannot alone establish a causal boundary.
Exact mathematical passage
\Ret_\tau(S) = I\!\left( X_S(t+\tau);X_S(t) \mid X_{\bar S}(t),E_t \right),
\bar vUse in source · 3 passages
Search aliases: bar v bar
Use in source · 10-persistence.tex, line 297
[Mean-square persistence] Suppose E[e_t+1^2mid F_t] ≤ q e_t^2+v_t, 0≤ q<1, and E[v_t]≤bar v. Then E[e_t^2] ≤ q^t E[e_0^2] + fracbar v(1-q^t)1-q, so limsup_t→∞ E[e_t^2] ≤ fracbar v1-q.
Exact mathematical passage
\mathbb E[v_t]\leq\bar v
\bar\alphaUse in source · 7 passages
Search aliases: barα bar alpha
Use in source · 10-persistence.tex, line 223
· + ∑_j=0^t-1 (∏_r=j+1^t-1α_r)σ_j, where an empty product equals one. If α_t≤barα<1, σ_t≤barσ, then e_t ≤ barα^te_0 + fracbarσ(1-barα^t)1-barα, and consequently limsup_t→∞e_t ≤ fracbarσ1-barα.
Exact mathematical passage
\alpha_t\leq\bar\alpha<1, \qquad \sigma_t\leq\bar\sigma,
\bar\alpha^tUse in source · 1 passage
Search aliases: barα^t bar alpha
Use in source · 10-persistence.tex, line 229
· + ∑_j=0^t-1 (∏_r=j+1^t-1α_r)σ_j, where an empty product equals one. If α_t≤barα<1, σ_t≤barσ, then e_t ≤ barα^te_0 + fracbarσ(1-barα^t)1-barα, and consequently limsup_t→∞e_t ≤ fracbarσ1-barα.
Exact mathematical passage
\boxed{ e_t \leq \bar\alpha^te_0 + \frac{\bar\sigma(1-\bar\alpha^t)}{1-\bar\alpha}, }
\bar\sigmaUse in source · 5 passages
Search aliases: barσ bar sigma
Use in source · 10-persistence.tex, line 223
· + ∑_j=0^t-1 (∏_r=j+1^t-1α_r)σ_j, where an empty product equals one. If α_t≤barα<1, σ_t≤barσ, then e_t ≤ barα^te_0 + fracbarσ(1-barα^t)1-barα, and consequently limsup_t→∞e_t ≤ fracbarσ1-barα.
Exact mathematical passage
\alpha_t\leq\bar\alpha<1, \qquad \sigma_t\leq\bar\sigma,
\mathrm{bench}Use in source · 1 passage
Search aliases: bench mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 1128
Let two realizations have identical benchmark output distributions, P(Y_bench)=P'(Y_bench), but different intervention kernels: K(w,b)≠ K'(β w,b) for some matched workspace intervention. Then task behavior is preserved while d_causal(W,W')>0. The later system may be a successor or replacement rather than the same workspace under the identity criterion of Part~XII.
Exact mathematical passage
P(Y_{\mathrm{bench}})=P'(Y_{\mathrm{bench}}),
\operatorname{Bernoulli}Use in source · 1 passage
Search aliases: Bernoulli operatorname
Use in source · 07-relational-irreducibility.tex, line 377
[XOR witness pair] Under the intact law P, let X_1,X_2oversetiid∼Bernoulli(1/2), Y=X_1⊕ X_2. Then each (X_i,Y) pair is independent and uniform, so H_P(Ymid X_i)=1 bit, H_P(Ymid X_1,X_2)=0. Let Q make X_1,X_2,Y mutually independent fair bits. Then Q_(X_i,Y)=P_(X_i,Y) (i=1,2), but H_Q(Ymid X_1,X_2)=1 bit. Therefore Δ_joint^log=1 bit, k_0=2, Δ_tr(Q)=1 bit. This proves predictive relational structure relative to the declared variables. It does not, by itself, prove that any workspace variable is cau…
Exact mathematical passage
X_1,X_2\overset{\mathrm{iid}}{\sim}\operatorname{Bernoulli}(1/2), \qquad Y=X_1\oplus X_2.
\bfseriesUse in source · 1 passage
Search aliases: bfseries
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
\bigvee_{B\in S}Use in source · 1 passage
Search aliases: bigvee_B∈ S bigvee in
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 276
Information faithfulness gives mathscr F_S^ D_c = bigvee_B∈ S bigvee_i∈ q^-1(B) mathscr F_i^ D_f = mathscr F_q^-1(S)^ D_f. The two Bayes risks optimize over the same measurable decision rules and are therefore equal. If a fine coalition of size k is sufficient within ε, the set of coarse blocks meeting that coalition has at most k elements and contains at least the same information. This proves the coalition-size inequality.
Exact mathematical passage
\mathscr F_S^{\mathcal D_c} = \bigvee_{B\in S} \bigvee_{i\in q^{-1}(B)} \mathscr F_i^{\mathcal D_f} = \mathscr F_{q^{-1}(S)}^{\mathcal D_f}.
\bigvee_{i\in S}Use in source · 1 passage
Search aliases: bigvee_i∈ S bigvee in
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 237
The structural core can be preserved by faithful coarse-graining, while coalition counts generally are not. Let mathscr F_S^ D = bigvee_i∈ Smathscr F_i^ D be the information available to coalition S under decomposition D. For a declared loss ℓ, write Risk_ D(S) = inf_f E [ ℓ(Y^+,f(mathscr F_S^ D)) ].
Exact mathematical passage
\mathscr F_S^{\mathcal D} = \bigvee_{i\in S}\mathscr F_i^{\mathcal D}
\bigwedge_{j\in\mathcal J(L,\varsigma)}Use in source · 1 passage
Search aliases: bigwedge_j∈ J(L,ς) bigwedge in mathcal varsigma
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 714
Let J(L) be the required gate set for claim level L. Then Certify_L(W;ς) = bigwedge_j∈ J(L,ς) Pass_j(W;ς). For a workspace-agent claim, the required set includes every structural, operational, relational, persistent, goal, counterfactual-control, and self-maintenance gate declared in Parts~IX and XVI. A specification-robust claim additionally requires the uniform rule of Part~XVIII across S. Failure of an earlier level prevents certification of a later level, even when later-level behavior appea…
Exact mathematical passage
\boxed{ \operatorname{Certify}_L(W;\varsigma) = \bigwedge_{j\in\mathcal J(L,\varsigma)} \operatorname{Pass}_j(W;\varsigma). }
\mathrm{boundary}Use in source · 1 passage
Search aliases: boundary mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
\operatorname{BoundaryDamage}Use in source · 1 passage
Search aliases: BoundaryDamage operatorname
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 258
Let B_t^sys be an internal membership or routing state used by the system, and let S_t^* = argmax_S∈ S_pass B_t(S) be the population boundary defined by the external certification protocol. The strong endogenous boundary conjecture asserts that there are adaptive systems and nontrivial environments for which: · d_B(B_t^sys,S_t^*)→0, · Form_Θ_form(W_B_t^sys)=1, · CE ( B_t^sys→ Routing_t+1 )>0, · CE ( BoundaryDamage_t→ RepairAction_t+1 )>0, while the scaffold contains no direct encoding of S_t^*.
Exact mathematical passage
\boxed{ \begin{aligned} &d_B(B_t^{\mathrm{sys}},S_t^*)\to0,\\ &\operatorname{Form}_{\Theta_{\mathrm{form}}}(W_{B_t^{\mathrm{sys}}})=1,\\ &\operatorname{CE} \left( B_t^{\mathrm{sys}}\to \operatorname{Routing}_{t+1} \right)>0,\\ &\operatorname{CE} \left( \operatorname{BoundaryDamage}_t\to \operatorname{RepairAction}_{t+1} \right)>0, \end{aligned} }
\operatorname{BoundaryDamage}_tUse in source · 1 passage
Search aliases: BoundaryDamage_t operatorname
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 258
Let B_t^sys be an internal membership or routing state used by the system, and let S_t^* = argmax_S∈ S_pass B_t(S) be the population boundary defined by the external certification protocol. The strong endogenous boundary conjecture asserts that there are adaptive systems and nontrivial environments for which: · d_B(B_t^sys,S_t^*)→0, · Form_Θ_form(W_B_t^sys)=1, · CE ( B_t^sys→ Routing_t+1 )>0, · CE ( BoundaryDamage_t→ RepairAction_t+1 )>0, while the scaffold contains no direct encoding of S_t^*.
Exact mathematical passage
\boxed{ \begin{aligned} &d_B(B_t^{\mathrm{sys}},S_t^*)\to0,\\ &\operatorname{Form}_{\Theta_{\mathrm{form}}}(W_{B_t^{\mathrm{sys}}})=1,\\ &\operatorname{CE} \left( B_t^{\mathrm{sys}}\to \operatorname{Routing}_{t+1} \right)>0,\\ &\operatorname{CE} \left( \operatorname{BoundaryDamage}_t\to \operatorname{RepairAction}_{t+1} \right)>0, \end{aligned} }
\bulletUse in source · 1 passage
Search aliases: bullet
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 797
A practical hierarchy rarely transmits each complete local workspace. Let Q^p:check C^p( U;mathscr W)→overline C^p be compression maps into smaller local and overlap representations. Suppose there is a compressed coboundary overlineδ^p such that Q^p+1δ^p = overlineδ^p Q^p. The maps Q^bullet then form a cochain map.
Exact mathematical passage
Q^\bullet
\mathbf CUse in source · 2 passages
Search aliases: C mathbf
Use in source · 12-identity-through-time-and-replacement.tex, line 14
Let R=(G, C,D,ρ, I, K) and R'=(G', C',D',ρ', I', K') be two realizations. A correspondence begins with a graph isomorphism φ:G→ G'. After relabeling by φ, let J_i:C_i→ C_i' be unitary local identifications and define J_V=⊕_i∈ VJ_i, J_E=⊕_e∈ EJ_t(e).
Exact mathematical passage
\mathfrak R=(G,\mathbf C,D,\rho,\mathcal I,\mathcal K)
\mathsf CUse in source · 6 passages
Search aliases: C mathsf
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 83
For each case we report the vector Card( K) = ( S, O, R, P, F, A, D, X, C ), where: ll S · = structural core and spectral coherence,
Exact mathematical passage
\boxed{ \mathsf{Card}(\mathfrak K) = \left( \mathsf S, \mathsf O, \mathsf R, \mathsf P, \mathsf F, \mathsf A, \mathsf D, \mathsf X, \mathsf C \right), }
\mathbf C'Use in source · 1 passage
Search aliases: C' mathbf
Use in source · 12-identity-through-time-and-replacement.tex, line 18
Let R=(G, C,D,ρ, I, K) and R'=(G', C',D',ρ', I', K') be two realizations. A correspondence begins with a graph isomorphism φ:G→ G'. After relabeling by φ, let J_i:C_i→ C_i' be unitary local identifications and define J_V=⊕_i∈ VJ_i, J_E=⊕_e∈ EJ_t(e).
Exact mathematical passage
\mathfrak R'=(G',\mathbf C',D',\rho',\mathcal I',\mathcal K')
c'Use in source · 2 passages
Search aliases: c'
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
C^0Use in source · 6 passages
Search aliases: C^0
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 212
A different problem arises when only relative transition data are supplied. Let b=(b_αβ)∈check C^1( U;mathscr W) be a prescribed family of overlap offsets. The triple-overlap consistency condition is δ^1b=0. One seeks local potentials q=(q_α)∈check C^0 satisfying δ^0q=b. Define check H^1( U;mathscr W) = frackerδ^1imδ^0. Then the affine gluing problem is solvable precisely when [b]=0 in check H^1( U;mathscr W). A nonzero class means that all local transition statements can be mutually consistent …
Exact mathematical passage
q=(q_\alpha)\in\check C^0
C^1Use in source · 5 passages
Search aliases: C^1
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 204
A different problem arises when only relative transition data are supplied. Let b=(b_αβ)∈check C^1( U;mathscr W) be a prescribed family of overlap offsets. The triple-overlap consistency condition is δ^1b=0. One seeks local potentials q=(q_α)∈check C^0 satisfying δ^0q=b. Define check H^1( U;mathscr W) = frackerδ^1imδ^0. Then the affine gluing problem is solvable precisely when [b]=0 in check H^1( U;mathscr W). A nonzero class means that all local transition statements can be mutually consistent …
Exact mathematical passage
b=(b_{\alpha\beta})\in\check C^1(\mathcal U;\mathscr W)
C^pUse in source · 3 passages
Search aliases: C^p
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 127
For p≥0, define the finite cochain space check C^p( U;mathscr W) = ⊕_α_0<⋯<α_p mathscr W(G_α_0⋯α_p), where empty intersections contribute the zero space. The coboundary δ^p:check C^p⟶check C^p+1 is (δ^p s)_α_0⋯α_p+1 = ∑_j=0^p+1(-1)^j r_α_0⋯α_p+1^% α_0⋯widehatα_j⋯α_p+1 % s_α_0⋯widehatα_j⋯α_p+1. The restriction identities imply δ^p+1δ^p=0. For a local family w=(w_α)_α, (δ^0w)_αβ = r_αβ^βw_β - r_αβ^αw_α. Thus δ^0 is the overlap-discrepancy operator at the level of exact local workspaces.
Exact mathematical passage
\check C^p(\mathcal U;\mathscr W) = \bigoplus_{\alpha_0<\cdots<\alpha_p} \mathscr W(G_{\alpha_0\cdots\alpha_p}),
C^{p+1}Use in source · 1 passage
Search aliases: C^p+1
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 134
For p≥0, define the finite cochain space check C^p( U;mathscr W) = ⊕_α_0<⋯<α_p mathscr W(G_α_0⋯α_p), where empty intersections contribute the zero space. The coboundary δ^p:check C^p⟶check C^p+1 is (δ^p s)_α_0⋯α_p+1 = ∑_j=0^p+1(-1)^j r_α_0⋯α_p+1^% α_0⋯widehatα_j⋯α_p+1 % s_α_0⋯widehatα_j⋯α_p+1. The restriction identities imply δ^p+1δ^p=0. For a local family w=(w_α)_α, (δ^0w)_αβ = r_αβ^βw_β - r_αβ^αw_α. Thus δ^0 is the overlap-discrepancy operator at the level of exact local workspaces.
Exact mathematical passage
\delta^p:\check C^p\longrightarrow\check C^{p+1}
C_{\mathfrak R}Use in source · 4 passages
Search aliases: C_ R mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 468
in M satisfy R≡_ E R' but Cert(W_ R;ς) ≠ Cert(W_ R';ς). Then the workspace certificate is not identifiable on M under E. More strongly, for every possibly randomized decision rule widehat C based only on data generated by E, P_ R ( widehat C≠ C_ R ) + P_ R' ( widehat C≠ C_ R' ) =1, where C_ R=Cert(W_ R;ς). Consequently, inf_widehat C max{ P_ R(widehat C≠ C_ R), P_ R'(widehat C≠ C_ R') } ≥frac12.
Exact mathematical passage
\boxed{ \mathbb P_{\mathfrak R} \left( \widehat C\neq C_{\mathfrak R} \right) + \mathbb P_{\mathfrak R'} \left( \widehat C\neq C_{\mathfrak R'} \right) =1, }
C_{\mathfrak R'}Use in source · 3 passages
Search aliases: C_ R' mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 468
in M satisfy R≡_ E R' but Cert(W_ R;ς) ≠ Cert(W_ R';ς). Then the workspace certificate is not identifiable on M under E. More strongly, for every possibly randomized decision rule widehat C based only on data generated by E, P_ R ( widehat C≠ C_ R ) + P_ R' ( widehat C≠ C_ R' ) =1, where C_ R=Cert(W_ R;ς). Consequently, inf_widehat C max{ P_ R(widehat C≠ C_ R), P_ R'(widehat C≠ C_ R') } ≥frac12.
Exact mathematical passage
\boxed{ \mathbb P_{\mathfrak R} \left( \widehat C\neq C_{\mathfrak R} \right) + \mathbb P_{\mathfrak R'} \left( \widehat C\neq C_{\mathfrak R'} \right) =1, }
C_*Use in source · 24 passages
Search aliases: C_*
Use in source · 03-exact-shared-cores.tex, line 107
The obstruction associated with a loop is Ω_γ=H_γ-I_C_o. The maximal path-independent root core is C_* = ⋂_γ:o→ oker(H_γ-I). Equivalently, C_*=C_o^Hol_o=Fix(Hol_o).
Exact mathematical passage
\boxed{ C_* = \bigcap_{\gamma:o\to o}\ker(H_\gamma-I). }
C_*^gUse in source · 1 passage
Search aliases: C_*^g
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 71
[Exact gauge covariance] The map G_V:Γ(H)⟶Γ(H^g) is an isomorphism. Therefore, Γ(H^g)=G_VΓ(H), dimΓ(H^g)=dimΓ(H). If the core transports are invertible and o is a root, then H_γ^g=g_oH_γ g_o^-1 for every loop γ:o→ o. Hence the holonomy-fixed core transforms by C_*^g=g_oC_*.
Exact mathematical passage
C_*^g=g_oC_*.
c_0Use in source · 2 passages
Search aliases: c_0
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 64
The notation absorbs lower-bounded and upper-bounded gates into one sign convention. If a causal effect must exceed c_0, then m_q=widehatη-c_0. If a defect must remain below ε_0, then m_q=ε_0-widehatδ. The complete certificate therefore passes exactly when every required signed margin is positive.
Exact mathematical passage
c_0
C_1Use in source · 6 passages
Search aliases: C_1
Use in source · 02-static-core-transfer-theory.tex, line 397
[Equivalent operations in different coordinates] Let C_1=C_2= R^2, choose S∈ GL_2( R), and set H_12=S, ρ_2(a)=Sρ_1(a)S^-1. Then H_12ρ_1(a) =Sρ_1(a) =ρ_2(a)S =ρ_2(a)H_12. The local matrices can look different while realizing the same abstract operation. This is the elementary model of representation change used throughout the theory.
Exact mathematical passage
C_1=C_2=\mathbb R^2
c_1Use in source · 3 passages
Search aliases: c_1
Use in source · 11-reconstruction-and-resilience.tex, line 407
Let C_*= R^2 and define scalar node encodings E_1(c_1,c_2)=c_1, E_2(c_1,c_2)=c_2, E_3(c_1,c_2)=c_1+c_2. Every singleton has rank one, so no node reconstructs the two-dimensional core. Every pair does reconstruct. For S={1,2}, F_S=I, α_S=1. For S={1,3} or S={2,3}, the frame eigenvalues are frac3±sqrt52. Therefore m_rec=2, k_erase=1, d_er=2, α^(1)=frac3-sqrt52. This realizes a workspace core that is irreducible to any singleton while remaining reconstructible after any one node fails.
Exact mathematical passage
E_1(c_1,c_2)=c_1, \qquad E_2(c_1,c_2)=c_2, \qquad E_3(c_1,c_2)=c_1+c_2.
C_2Use in source · 6 passages
Search aliases: C_2
Use in source · 02-static-core-transfer-theory.tex, line 397
[Equivalent operations in different coordinates] Let C_1=C_2= R^2, choose S∈ GL_2( R), and set H_12=S, ρ_2(a)=Sρ_1(a)S^-1. Then H_12ρ_1(a) =Sρ_1(a) =ρ_2(a)S =ρ_2(a)H_12. The local matrices can look different while realizing the same abstract operation. This is the elementary model of representation change used throughout the theory.
Exact mathematical passage
C_1=C_2=\mathbb R^2
c_2Use in source · 3 passages
Search aliases: c_2
Use in source · 11-reconstruction-and-resilience.tex, line 407
Let C_*= R^2 and define scalar node encodings E_1(c_1,c_2)=c_1, E_2(c_1,c_2)=c_2, E_3(c_1,c_2)=c_1+c_2. Every singleton has rank one, so no node reconstructs the two-dimensional core. Every pair does reconstruct. For S={1,2}, F_S=I, α_S=1. For S={1,3} or S={2,3}, the frame eigenvalues are frac3±sqrt52. Therefore m_rec=2, k_erase=1, d_er=2, α^(1)=frac3-sqrt52. This realizes a workspace core that is irreducible to any singleton while remaining reconstructible after any one node fails.
Exact mathematical passage
E_1(c_1,c_2)=c_1, \qquad E_2(c_1,c_2)=c_2, \qquad E_3(c_1,c_2)=c_1+c_2.
C_3Use in source · 3 passages
Search aliases: C_3
Use in source · 03-exact-shared-cores.tex, line 287
[One-dimensional core surviving a contradictory cycle] Let a three-node cycle have C_1=C_2=C_3= R^2 and H_12=I, H_23=I, H_31=J, J= 1 · 0
Exact mathematical passage
C_1=C_2=C_3=\mathbb R^2
c_3Use in source · 2 passages
Search aliases: c_3
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 146
The positive examples use a recurring distributed code. Let c=(c_1,c_2,c_3)^ T∈ R^3 and define three local encodings E_1c=(c_1,c_2), E_2c=(c_2,c_3), E_3c=(c_1,c_3). Then ∑_i=1^3E_i^*E_i=2I_3. No individual encoding is injective, while every two-node coalition is injective. The pairwise frame operators are E_{1,2}^*E_{1,2} · =diag(1,2,1),
Exact mathematical passage
c=(c_1,c_2,c_3)^{\mathsf T}\in\mathbb R^3
C_aUse in source · 2 passages
Search aliases: C_a
Use in source · 01-foundational-thesis.tex, line 156
Consider three strata: h=human conceptual state, m=model-formal state, a=artifact state. Let the corresponding core spaces be C_h,C_m,C_a, with transfers H_hm:C_h→ C_m, H_ma:C_m→ C_a, H_ah:C_a→ C_h. A proposed shared item begins as c_h∈ C_h, is formalized as c_m=H_hmc_h, externalized as c_a=H_mac_m, and re-enters human reasoning as c_h'=H_ahc_a. The round-trip consistency condition is c_h'=c_h, or equivalently H_ahH_maH_hmc_h=c_h. Thus the genuinely shared part of C_h is not automatically all of…
Exact mathematical passage
C_h,C_m,C_a
c_aUse in source · 2 passages
Search aliases: c_a
Use in source · 01-foundational-thesis.tex, line 169
Consider three strata: h=human conceptual state, m=model-formal state, a=artifact state. Let the corresponding core spaces be C_h,C_m,C_a, with transfers H_hm:C_h→ C_m, H_ma:C_m→ C_a, H_ah:C_a→ C_h. A proposed shared item begins as c_h∈ C_h, is formalized as c_m=H_hmc_h, externalized as c_a=H_mac_m, and re-enters human reasoning as c_h'=H_ahc_a. The round-trip consistency condition is c_h'=c_h, or equivalently H_ahH_maH_hmc_h=c_h. Thus the genuinely shared part of C_h is not automatically all of…
Exact mathematical passage
c_a=H_{ma}c_m,
\mathcal C_{\mathrm{dyn}}Use in source · 1 passage
Search aliases: C_dyn mathcal mathrm
Use in source · 08-causal-efficacy-and-reentry.tex, line 378
The resulting certification report is C_dyn(W_t) =( · δ_align^ I, {Δ_A^ℓ}_A⊆ V, k_ε, Δ_tr( Q), · η_causal^ν, Δ_specific(r), η_rec(τ), η_loop(τ) ). No single coordinate certifies a relational workspace.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal C_{\mathrm{dyn}}(W_t) =\bigl(& \delta_{\mathrm{align}}^{\mathcal I}, \{\Delta_A^\ell\}_{A\subseteq V}, k_\varepsilon, \boldsymbol\Delta_{\mathrm{tr}}(\mathcal Q),\\ &\eta_{\mathrm{causal}}^\nu, \Delta_{\mathrm{specific}}(r), \eta_{\mathrm{rec}}(\tau), \eta_{\mathrm{loop}}(\tau) \bigr). \end{aligned} }
\mathcal C_{\mathrm{full}}Use in source · 1 passage
Search aliases: C_full mathcal mathrm
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 351
Use a vector rather than one aggregate score: C_full(W) =( · d_ε, g_ε, δ_coh, δ_align^ I, Δ_joint^ℓ, k_ε, · Δ_tr( Q), η_causal^ν, Δ_specific(r), η_loop(τ), · d_id, Rec_k, underline m_ D, Δ_dec, E_form, δ^scaf, δ^leak, · Δ_J, Δ_t^B, COut_τ(widehat S), CIn_τ(widehat S), · η_G(τ), δ_G^cue(τ), η_G→ A, δ_Q, η_V→ A, η_A→ Y, · η_D→ M, η_M→ R, η_R→ v, Δ_repair^spec, δ_rep-id, sup_t e_t ). A claim passes only when every required coordinate lies in its predeclared admissible region. No weighted average ma…
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal C_{\mathrm{full}}(W) =\bigl(& d_\varepsilon, g_\varepsilon, \delta_{\mathrm{coh}}, \delta_{\mathrm{align}}^{\mathcal I}, \Delta_{\mathrm{joint}}^\ell, k_\varepsilon,\\ &\boldsymbol\Delta_{\mathrm{tr}}(\mathcal Q), \eta_{\mathrm{causal}}^\nu, \Delta_{\mathrm{specific}}(r), \eta_{\mathrm{loop}}(\tau),\\ &d_{\mathrm{id}}, \Rec_k, \underline{\mathbf m}_{\mathfrak D}, \boldsymbol\Delta_{\mathrm{dec}}, \mathbf E_{\mathrm{form}}, \delta^{\mathrm{scaf}}, \delta^{\mathrm{leak}},\\ &\Delta_J, \Delta_t^B, \COut_\tau(\widehat S), \CIn_\tau(\widehat S),\\ &\eta_G(\tau), \delta_G^{\mathrm{cue}}(\tau), \eta_{G\to A}, \delta_Q, \eta_{V\to A}, \eta_{A\to Y},\\ &\eta_{D\to M}, \eta_{M\to R}, \eta_{R\to v}, \Delta_{\mathrm{repair}}^{\mathrm{spec}}, \delta_{\mathrm{rep-id}}, \sup_t e_t \bigr). \end{aligned} }
C_hUse in source · 5 passages
Search aliases: C_h
Use in source · 01-foundational-thesis.tex, line 156
Consider three strata: h=human conceptual state, m=model-formal state, a=artifact state. Let the corresponding core spaces be C_h,C_m,C_a, with transfers H_hm:C_h→ C_m, H_ma:C_m→ C_a, H_ah:C_a→ C_h. A proposed shared item begins as c_h∈ C_h, is formalized as c_m=H_hmc_h, externalized as c_a=H_mac_m, and re-enters human reasoning as c_h'=H_ahc_a. The round-trip consistency condition is c_h'=c_h, or equivalently H_ahH_maH_hmc_h=c_h. Thus the genuinely shared part of C_h is not automatically all of…
Exact mathematical passage
C_h,C_m,C_a
c_hUse in source · 4 passages
Search aliases: c_h
Use in source · 01-foundational-thesis.tex, line 164
Consider three strata: h=human conceptual state, m=model-formal state, a=artifact state. Let the corresponding core spaces be C_h,C_m,C_a, with transfers H_hm:C_h→ C_m, H_ma:C_m→ C_a, H_ah:C_a→ C_h. A proposed shared item begins as c_h∈ C_h, is formalized as c_m=H_hmc_h, externalized as c_a=H_mac_m, and re-enters human reasoning as c_h'=H_ahc_a. The round-trip consistency condition is c_h'=c_h, or equivalently H_ahH_maH_hmc_h=c_h. Thus the genuinely shared part of C_h is not automatically all of…
Exact mathematical passage
c_h\in C_h
c_h'Use in source · 2 passages
Search aliases: c_h'
Use in source · 01-foundational-thesis.tex, line 173
human conceptual state, m=model-formal state, a=artifact state. Let the corresponding core spaces be C_h,C_m,C_a, with transfers H_hm:C_h→ C_m, H_ma:C_m→ C_a, H_ah:C_a→ C_h. A proposed shared item begins as c_h∈ C_h, is formalized as c_m=H_hmc_h, externalized as c_a=H_mac_m, and re-enters human reasoning as c_h'=H_ahc_a. The round-trip consistency condition is c_h'=c_h, or equivalently H_ahH_maH_hmc_h=c_h. Thus the genuinely shared part of C_h is not automatically all of C_h. It is the fixed sub…
Exact mathematical passage
c_h'=H_{ah}c_a.
C_i'Use in source · 1 passage
Search aliases: C_i'
Use in source · 12-identity-through-time-and-replacement.tex, line 23
Let R=(G, C,D,ρ, I, K) and R'=(G', C',D',ρ', I', K') be two realizations. A correspondence begins with a graph isomorphism φ:G→ G'. After relabeling by φ, let J_i:C_i→ C_i' be unitary local identifications and define J_V=⊕_i∈ VJ_i, J_E=⊕_e∈ EJ_t(e).
Exact mathematical passage
J_i:C_i\to C_i'
C_{i_m}Use in source · 1 passage
Search aliases: C_i_m
Use in source · 04-approximate-workspaces.tex, line 743
For every step, T_rι_i_r-1^C = ι_i_r^CH_r+ ι_i_r^RV_r. Telescope the sequence T_m⋯ T_r+1ι_i_r^C H_r⋯ H_1, r=0,1,…,m. The difference between consecutive terms is exactly the r-th summand in the displayed formula. Projection onto R_i_m or C_i_m, followed by submultiplicativity of the operator norm, gives the two bounds.
Exact mathematical passage
C_{i_m}
\mathcal C_{\mathrm{ID}}Use in source · 1 passage
Search aliases: C_ID mathcal mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 600
Define C_ID (P^ E;ς) = { Cert(W_ R;ς): R∈ R_ID } ⊆{0,1}. The certificate is point identified exactly when this set is a singleton. The marginal gate intervals provide simple sufficient conditions, but they need not be logically necessary because gate margins can be dependent across the identified set.
Exact mathematical passage
\boxed{ \mathcal C_{\mathrm{ID}} (P^{\mathcal E};\varsigma) = \left\{ \operatorname{Cert}(W_{\mathfrak R};\varsigma): \mathfrak R\in\mathfrak R_{\mathrm{ID}} \right\} \subseteq\{0,1\}. }
c_jUse in source · 3 passages
Search aliases: c_j
Use in source · 03-exact-shared-cores.tex, line 217
independent of the chosen path. Indeed, if σ_i:o→ i is another path, then σ_i^-1τ_i:o→ o is a loop, and invariance of x gives H_σ_i^-1H_τ_ix=x. Multiplying by H_σ_i yields H_τ_ix=H_σ_ix. For any edge e:i→ j, the paths eτ_i and τ_j both run from o to j. Path independence therefore gives H_ec_i =H_eH_τ_ix =H_τ_jx =c_j. Thus (c_i) is a global compatible section and ev_o((c_i))=x. Hence ev_o is surjective and therefore an isomorphism.
Exact mathematical passage
H_ec_i =H_eH_{\tau_i}x =H_{\tau_j}x =c_j.
C_kUse in source · 1 passage
Search aliases: C_k
Use in source · 02-static-core-transfer-theory.tex, line 342
For composable intertwiners H_e:C_i→ C_j and H_f:C_j→ C_k, H_fH_eρ_i(a) =H_fρ_j(a)H_e =ρ_k(a)H_fH_e. Induction over path length proves the claim.
Exact mathematical passage
H_f:C_j\to C_k
C_mUse in source · 2 passages
Search aliases: C_m
Use in source · 01-foundational-thesis.tex, line 156
Consider three strata: h=human conceptual state, m=model-formal state, a=artifact state. Let the corresponding core spaces be C_h,C_m,C_a, with transfers H_hm:C_h→ C_m, H_ma:C_m→ C_a, H_ah:C_a→ C_h. A proposed shared item begins as c_h∈ C_h, is formalized as c_m=H_hmc_h, externalized as c_a=H_mac_m, and re-enters human reasoning as c_h'=H_ahc_a. The round-trip consistency condition is c_h'=c_h, or equivalently H_ahH_maH_hmc_h=c_h. Thus the genuinely shared part of C_h is not automatically all of…
Exact mathematical passage
C_h,C_m,C_a
c_mUse in source · 2 passages
Search aliases: c_m
Use in source · 01-foundational-thesis.tex, line 165
Consider three strata: h=human conceptual state, m=model-formal state, a=artifact state. Let the corresponding core spaces be C_h,C_m,C_a, with transfers H_hm:C_h→ C_m, H_ma:C_m→ C_a, H_ah:C_a→ C_h. A proposed shared item begins as c_h∈ C_h, is formalized as c_m=H_hmc_h, externalized as c_a=H_mac_m, and re-enters human reasoning as c_h'=H_ahc_a. The round-trip consistency condition is c_h'=c_h, or equivalently H_ahH_maH_hmc_h=c_h. Thus the genuinely shared part of C_h is not automatically all of…
Exact mathematical passage
c_m=H_{hm}c_h,
C_oUse in source · 10 passages
Search aliases: C_o
Use in source · 03-exact-shared-cores.tex, line 44
Fix a root o. The evaluation map is ev_o:Γ(H)→ C_o, ev_o((c_i))=c_o.
Exact mathematical passage
\ev_o:\Gamma(H)\to C_o, \qquad \ev_o((c_i))=c_o.
c_oUse in source · 5 passages
Search aliases: c_o
Use in source · 03-exact-shared-cores.tex, line 44
Fix a root o. The evaluation map is ev_o:Γ(H)→ C_o, ev_o((c_i))=c_o.
Exact mathematical passage
\ev_o:\Gamma(H)\to C_o, \qquad \ev_o((c_i))=c_o.
C_o^{\Hol_o}Use in source · 5 passages
Search aliases: C_o^Hol_o Hol
Use in source · 03-exact-shared-cores.tex, line 115
The obstruction associated with a loop is Ω_γ=H_γ-I_C_o. The maximal path-independent root core is C_* = ⋂_γ:o→ oker(H_γ-I). Equivalently, C_*=C_o^Hol_o=Fix(Hol_o).
Exact mathematical passage
C_*=C_o^{\Hol_o}=\operatorname{Fix}(\Hol_o).
C_o^{\operatorname{Hol}_o}Use in source · 1 passage
Search aliases: C_o^Hol_o operatorname
Use in source · 19-summary-of-main-results.tex, line 8
subtopicT_1: Limit--holonomy theorem Γ(H)≅ C_o^Hol_o.
Exact mathematical passage
\Gamma(H)\cong C_o^{\operatorname{Hol}_o}.
C_{s(\gamma)}Use in source · 1 passage
Search aliases: C_s(γ) gamma
Use in source · 02-static-core-transfer-theory.tex, line 224
[Pathwise core preservation] Suppose V_e=0 for every edge in a directed path γ=e_m⋯ e_1. Then T_γ(C_s(γ))⊆ C_t(γ) and P_t(γ)T_γ P_s(γ) = H_e_m⋯ H_e_1.
Exact mathematical passage
T_\gamma(C_{s(\gamma)})\subseteq C_{t(\gamma)}
C_{s+1}Use in source · 2 passages
Search aliases: C_s+1
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 319
[Cue-controlled goal retention] Let G_s∈ R^d_G obey G_s+1 = R_sG_s+B_sC_s+1+ζ_s+1 (s=t,…,t+τ-1). Consider two intervention runs that set G_t=g, G_t'=g', and then use the same command trajectory and the same disturbance realization. Let R_t+τ:t = R_t+τ-1⋯ R_t. Then G_t+τ-G_t+τ' = R_t+τ:t(g-g'). If m_s ≤ σ_min(R_s), R_s ≤ M_s, then ( ∏_s=t^t+τ-1m_s ) g-g' ≤ G_t+τ-G_t+τ' ≤ ( ∏_s=t^t+τ-1M_s ) g-g' .
Exact mathematical passage
G_{s+1} = R_sG_s+B_sC_{s+1}+\zeta_{s+1} \qquad (s=t,\ldots,t+\tau-1).
\mathfrak C_{\mathrm{SRW}}Use in source · 1 passage
Search aliases: C_SRW mathfrak mathrm
Use in source · 23-relation-to-prior-work.tex, line 884
The strongest current candidate is not a single equation. It is the following conjunctive object: C_SRW = ( c heterogeneous core--transfer diagram and residuals, exact or spectral shared-section state, operation and predictive alignment, feasible causal interventions, coalition irreducibility under matched local-predictive nulls, non-collapse, reconstruction, and replacement identity, descent across subworkspaces without hidden centralization, formation provenance and certification leakage contr…
Exact mathematical passage
\boxed{ \mathfrak C_{\mathrm{SRW}} = \left( \begin{array}{c} \text{heterogeneous core--transfer diagram and residuals},\\ \text{exact or spectral shared-section state},\\ \text{operation and predictive alignment},\\ \text{feasible causal interventions},\\ \text{coalition irreducibility under matched local-predictive nulls},\\ \text{non-collapse, reconstruction, and replacement identity},\\ \text{descent across subworkspaces without hidden centralization},\\ \text{formation provenance and certification leakage control},\\ \text{goal-conditioned action and certificate-directed repair},\\ \text{robustness across admissible decompositions and scientific specifications},\\ \text{identified-set and uniform finite-sample certification} \end{array} \right). }
c_tUse in source · 1 passage
Search aliases: c_t
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 790
Consider three agents: V_MA={P,M,R}, called the planner, monitor, and recorder. The global workspace-control state is c_t=(g_t,b_t,h_t)∈ F_2^3, where: ll g_t=goal bit, · b_t=environment or belief bit,
Exact mathematical passage
c_t=(g_t,b_t,h_t)\in\mathbb F_2^3,
C_{t(\gamma)}Use in source · 1 passage
Search aliases: C_t(γ) gamma
Use in source · 02-static-core-transfer-theory.tex, line 224
[Pathwise core preservation] Suppose V_e=0 for every edge in a directed path γ=e_m⋯ e_1. Then T_γ(C_s(γ))⊆ C_t(γ) and P_t(γ)T_γ P_s(γ) = H_e_m⋯ H_e_1.
Exact mathematical passage
T_\gamma(C_{s(\gamma)})\subseteq C_{t(\gamma)}
C_{t+1}Use in source · 2 passages
Search aliases: C_t+1
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 1114
Let G_t+1=C_t+1, where C_t+1 is an external instruction repeated at every step. Goal and action can be strongly correlated, but after cutting the cue channel, I(G_t+τ;G_tmidcut(C))=0. The system tracks an external command. It has not established internal goal retention.
Exact mathematical passage
G_{t+1}=C_{t+1},
C_t^{\mathrm{ctl}}Use in source · 2 passages
Search aliases: C_t^ctl mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 58
A controlled state contains at least C_t^ctl = ( W_t,G_t,M_t,B_t,E_t ), where G_t is the represented goal, M_t is a workspace-integrity monitor, B_t is the current boundary or routing state, and E_t is the declared external context. An action is generated by A_t ∼ π_t ( ·mid W_t,G_t,M_t,B_t,E_t ). The future controlled state obeys a time-unrolled structural model S_t+1 = F_t(S_t,A_t,E_t+1,ξ_t+1), W_t+1=ω_t+1(S_t+1). The intervention semantics are inherited from Part~VII. A symbol such as do(A_t=…
Exact mathematical passage
C_t^{\mathrm{ctl}} = \left( W_t,G_t,M_t,B_t,E_t \right),
\mathrm{cal}Use in source · 2 passages
Search aliases: cal mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 158
The same sample must not be used both to select a workspace and to certify its coherence, causal efficacy, or relational irreducibility. The required split is D = D_form sqcup D_cal sqcup D_cert. The formation sample selects widehatθ. The calibration sample fixes thresholds, regularization strengths, and intervention magnitudes. The certification sample evaluates the final gates without further structural selection. In a multi-environment study, the stronger requirement is E_form ∩ E_cert = ∅, s…
Exact mathematical passage
\mathcal D = \mathcal D_{\mathrm{form}} \sqcup \mathcal D_{\mathrm{cal}} \sqcup \mathcal D_{\mathrm{cert}}.
\mathsf{CAN}Use in source · 7 passages
Search aliases: CAN mathsf
Use in source · 23-relation-to-prior-work.tex, line 15
The audit uses five labels: ll STD · = established concept, theorem, or technique, ADP · = established machinery adapted to relational workspaces, SYN · = nontrivial synthesis of established components, CAN · = candidate original contribution requiring priority review, EMP · = empirical claim not yet established in an uncontrolled system. These labels describe the status of a claim, not its importance. A standard result may be indispensable. A synthesis may be scientifically useful without conta…
Exact mathematical passage
\begin{array}{ll} \mathsf{STD} & = \text{established concept, theorem, or technique},\\ \mathsf{ADP} & = \text{established machinery adapted to relational workspaces},\\ \mathsf{SYN} & = \text{nontrivial synthesis of established components},\\ \mathsf{CAN} & = \text{candidate original contribution requiring priority review},\\ \mathsf{EMP} & = \text{empirical claim not yet established in an uncontrolled system}. \end{array}
\mathsf{Card}Use in source · 1 passage
Search aliases: Card mathsf
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 83
For each case we report the vector Card( K) = ( S, O, R, P, F, A, D, X, C ), where: ll S · = structural core and spectral coherence,
Exact mathematical passage
\boxed{ \mathsf{Card}(\mathfrak K) = \left( \mathsf S, \mathsf O, \mathsf R, \mathsf P, \mathsf F, \mathsf A, \mathsf D, \mathsf X, \mathsf C \right), }
\CEUse in source · 4 passages
Search aliases: CE
Use in source · 08-causal-efficacy-and-reentry.tex, line 50
Let D be a divergence or metric on probability laws. For a matched background value b, define CE_Workspace(w,w';b) = D ( P^ι_w(Y_t^+∈·mid B_t=b), P^ι_w'(Y_t^+∈·mid B_t=b) ). For a declared comparison design ν over (w,w',b), define η_causal^ν = E_(w,w',b)∼ν [ CE_Workspace(w,w';b) ]. The maximum η_causal^max = sup_w,w',bCE_Workspace(w,w';b) may be useful for discovery, but a design-weighted effect is harder to inflate by selecting a single exceptional pair after inspection.
Exact mathematical passage
\CE_{\Workspace}(w,w';b) = D\!\left( \mathbb P^{\iota_w}(Y_t^+\in\cdot\mid B_t=b), \mathbb P^{\iota_{w'}}(Y_t^+\in\cdot\mid B_t=b) \right).
\operatorname{CE}Use in source · 1 passage
Search aliases: CE operatorname
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 258
Let B_t^sys be an internal membership or routing state used by the system, and let S_t^* = argmax_S∈ S_pass B_t(S) be the population boundary defined by the external certification protocol. The strong endogenous boundary conjecture asserts that there are adaptive systems and nontrivial environments for which: · d_B(B_t^sys,S_t^*)→0, · Form_Θ_form(W_B_t^sys)=1, · CE ( B_t^sys→ Routing_t+1 )>0, · CE ( BoundaryDamage_t→ RepairAction_t+1 )>0, while the scaffold contains no direct encoding of S_t^*.
Exact mathematical passage
\boxed{ \begin{aligned} &d_B(B_t^{\mathrm{sys}},S_t^*)\to0,\\ &\operatorname{Form}_{\Theta_{\mathrm{form}}}(W_{B_t^{\mathrm{sys}}})=1,\\ &\operatorname{CE} \left( B_t^{\mathrm{sys}}\to \operatorname{Routing}_{t+1} \right)>0,\\ &\operatorname{CE} \left( \operatorname{BoundaryDamage}_t\to \operatorname{RepairAction}_{t+1} \right)>0, \end{aligned} }
\CE_{\Workspace}Use in source · 4 passages
Search aliases: CE_Workspace CE Workspace
Use in source · 08-causal-efficacy-and-reentry.tex, line 50
Let D be a divergence or metric on probability laws. For a matched background value b, define CE_Workspace(w,w';b) = D ( P^ι_w(Y_t^+∈·mid B_t=b), P^ι_w'(Y_t^+∈·mid B_t=b) ). For a declared comparison design ν over (w,w',b), define η_causal^ν = E_(w,w',b)∼ν [ CE_Workspace(w,w';b) ]. The maximum η_causal^max = sup_w,w',bCE_Workspace(w,w';b) may be useful for discovery, but a design-weighted effect is harder to inflate by selecting a single exceptional pair after inspection.
Exact mathematical passage
\CE_{\Workspace}(w,w';b) = D\!\left( \mathbb P^{\iota_w}(Y_t^+\in\cdot\mid B_t=b), \mathbb P^{\iota_{w'}}(Y_t^+\in\cdot\mid B_t=b) \right).
\CE_{\Workspace'}Use in source · 1 passage
Search aliases: CE_Workspace' CE Workspace
Use in source · 08-causal-efficacy-and-reentry.tex, line 86
[Coordinate invariance of intervention effects] Let g: W_t→ W_t' be a measurable bijection and suppose the reparametrized intervention family satisfies ι_g(w)'=ι_w. Then every divergence-based causal effect is preserved: CE_Workspace'(g(w),g(w');b) = CE_Workspace(w,w';b).
Exact mathematical passage
\CE_{\Workspace'}(g(w),g(w');b) = \CE_{\Workspace}(w,w';b).
\operatorname{Cert}_{\mathfrak S}Use in source · 2 passages
Search aliases: Cert_ S operatorname mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 231
n Sm_q(W;ς), overline m_q^ S(W) = sup_ς∈ Sm_q(W;ς). Its sensitivity width is Δ_q^spec(W) = overline m_q^ S(W) - underline m_q^ S(W). The robust certificate margin is r_ S(W) = inf_ς∈ S min_q∈ J_*m_q(W;ς). Then Cert_ S(W)=1 Longleftrightarrow r_ S(W)>0.
Exact mathematical passage
\operatorname{Cert}_{\mathfrak S}(W)=1 \quad\Longleftrightarrow\quad r_{\mathfrak S}(W)>0.
\mathrm{certificate}Use in source · 1 passage
Search aliases: certificate mathrm
Use in source · 23-relation-to-prior-work.tex, line 101
The analysis does not make one global novelty claim. It uses a priority profile p(C) = ( p_concept, p_object, p_theorem, p_certificate, p_experiment ). For example, the philosophical concept of distributed cognition may be standard while a specific mathematical object is adapted, a theorem is a specialization of known spectral theory, the certificate is a synthesis, and the empirical claim is unresolved. This prevents originality in one coordinate from being used to imply originality in every co…
Exact mathematical passage
\boxed{ \mathbf p(C) = \left( p_{\mathrm{concept}}, p_{\mathrm{object}}, p_{\mathrm{theorem}}, p_{\mathrm{certificate}}, p_{\mathrm{experiment}} \right). }
\operatorname{Certify}_LUse in source · 1 passage
Search aliases: Certify_L operatorname
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 714
Let J(L) be the required gate set for claim level L. Then Certify_L(W;ς) = bigwedge_j∈ J(L,ς) Pass_j(W;ς). For a workspace-agent claim, the required set includes every structural, operational, relational, persistent, goal, counterfactual-control, and self-maintenance gate declared in Parts~IX and XVI. A specification-robust claim additionally requires the uniform rule of Part~XVIII across S. Failure of an earlier level prevents certification of a later level, even when later-level behavior appea…
Exact mathematical passage
\boxed{ \operatorname{Certify}_L(W;\varsigma) = \bigwedge_{j\in\mathcal J(L,\varsigma)} \operatorname{Pass}_j(W;\varsigma). }
\operatorname{Ch}Use in source · 2 passages
Search aliases: Ch operatorname
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 909
A finite workspace hierarchy is a rooted tree T. Each node a∈ T carries a subgraph G_a. The root r carries G_r=G. For every internal node a, its children Ch(a) form a finite edge-complete cover of G_a. Leaves carry primitive local workspace spaces W_ℓ=mathscr W(G_ℓ). For an internal node, define recursively W_a = ker ( δ_a^0: ⊕_b∈Ch(a)W_b ⟶ ⊕_b<cW_bc ), where the overlap spaces and restrictions are inherited from the child cover.
Exact mathematical passage
\operatorname{Ch}(a)
\checkUse in source · 16 passages
Search aliases: check
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 127
For p≥0, define the finite cochain space check C^p( U;mathscr W) = ⊕_α_0<⋯<α_p mathscr W(G_α_0⋯α_p), where empty intersections contribute the zero space. The coboundary δ^p:check C^p⟶check C^p+1 is (δ^p s)_α_0⋯α_p+1 = ∑_j=0^p+1(-1)^j r_α_0⋯α_p+1^% α_0⋯widehatα_j⋯α_p+1 % s_α_0⋯widehatα_j⋯α_p+1. The restriction identities imply δ^p+1δ^p=0. For a local family w=(w_α)_α, (δ^0w)_αβ = r_αβ^βw_β - r_αβ^αw_α. Thus δ^0 is the overlap-discrepancy operator at the level of exact local workspaces.
Exact mathematical passage
\check C^p(\mathcal U;\mathscr W) = \bigoplus_{\alpha_0<\cdots<\alpha_p} \mathscr W(G_{\alpha_0\cdots\alpha_p}),
\checkmarkUse in source · 2 passages
Search aliases: checkmark
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 447
Inside the declared finite model, S · =checkmark_analytic, · O · =checkmark_analytic, R · =checkmark_analytic, · P · =checkmark_analytic, F · =scaffolded, · A · =not tested, D · =fixed decomposition, · C · =not established. The highest supported level is Level~4 when the handoff dynamics and identity correspondence are included. The example does not contain an operational goal state, counterfactual policy, damage monitor, or repair loop, so it does not support Levels~5 or 6.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf S&=\checkmark_{\mathrm{analytic}}, &\mathsf O&=\checkmark_{\mathrm{analytic}},\\ \mathsf R&=\checkmark_{\mathrm{analytic}}, &\mathsf P&=\checkmark_{\mathrm{analytic}},\\ \mathsf F&=\text{scaffolded}, &\mathsf A&=\text{not tested},\\ \mathsf D&=\text{fixed decomposition}, &\mathsf C&=\text{not established}. \end{aligned} }
\checkmark_{\mathrm{analytic}}Use in source · 2 passages
Search aliases: checkmark_analytic checkmark mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 447
Inside the declared finite model, S · =checkmark_analytic, · O · =checkmark_analytic, R · =checkmark_analytic, · P · =checkmark_analytic, F · =scaffolded, · A · =not tested, D · =fixed decomposition, · C · =not established. The highest supported level is Level~4 when the handoff dynamics and identity correspondence are included. The example does not contain an operational goal state, counterfactual policy, damage monitor, or repair loop, so it does not support Levels~5 or 6.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf S&=\checkmark_{\mathrm{analytic}}, &\mathsf O&=\checkmark_{\mathrm{analytic}},\\ \mathsf R&=\checkmark_{\mathrm{analytic}}, &\mathsf P&=\checkmark_{\mathrm{analytic}},\\ \mathsf F&=\text{scaffolded}, &\mathsf A&=\text{not tested},\\ \mathsf D&=\text{fixed decomposition}, &\mathsf C&=\text{not established}. \end{aligned} }
\CInUse in source · 4 passages
Search aliases: CIn
Use in source · 15-boundary-formation-and-stability.tex, line 95
nate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general. A useful workspace may receive substantial external input. The boundary object…
Exact mathematical passage
\boxed{ \CIn_\tau(S) = \mathbb E_{u,u'\sim\nu_{\bar S}} D\!\left( \mathcal L^{\iota_{\bar S,u}} (X_S(t+\tau)), \mathcal L^{\iota_{\bar S,u'}} (X_S(t+\tau)) \right). }
\CIn_\tauUse in source · 4 passages
Search aliases: CIn_τ CIn tau
Use in source · 15-boundary-formation-and-stability.tex, line 95
nate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general. A useful workspace may receive substantial external input. The boundary object…
Exact mathematical passage
\boxed{ \CIn_\tau(S) = \mathbb E_{u,u'\sim\nu_{\bar S}} D\!\left( \mathcal L^{\iota_{\bar S,u}} (X_S(t+\tau)), \mathcal L^{\iota_{\bar S,u'}} (X_S(t+\tau)) \right). }
\operatorname{Cl}Use in source · 1 passage
Search aliases: Cl operatorname
Use in source · 23-relation-to-prior-work.tex, line 65
mined by mathematical and operational equivalence, not by terminology. Let C be a claim in the paper and S a prior source. Write Spreccurlyeq C when the main content of C follows from S after admissible relabeling, restriction, or direct specialization. A substantive novelty residual exists only when the claim contains content not absorbed by the closure of known sources: Res(C) = C∖ Cl ( ⋃_S∈ LS ). This is a conceptual audit device rather than a set-theoretic definition of ideas. Its purpose is…
Exact mathematical passage
\operatorname{Res}(C) = C\setminus \operatorname{Cl} \left( \bigcup_{S\in\mathcal L}S \right).
\mathsf{claim}Use in source · 1 passage
Search aliases: claim mathsf
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 660
The machine-readable record should contain at least the following top-level objects: ResultRecord ={ · claim, specification, specification_family, decomposition, data_splits, formation, · workspace_extractor, goals, actions, interventions, · nulls, gates, identified_sets, specification_envelopes, uncertainty, failures, artifacts }. Each gate object records its symbol, estimator, direction, threshold, point estimate, interval, split, seed set, status, and artifact reference. Each intervention and…
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{ResultRecord} =\{& \mathsf{claim}, \mathsf{specification}, \mathsf{specification\_family}, \mathsf{decomposition}, \mathsf{data\_splits}, \mathsf{formation},\\ &\mathsf{workspace\_extractor}, \mathsf{goals}, \mathsf{actions}, \mathsf{interventions},\\ &\mathsf{nulls}, \mathsf{gates}, \mathsf{identified\_sets}, \mathsf{specification\_envelopes}, \mathsf{uncertainty}, \mathsf{failures}, \mathsf{artifacts} \}. \end{aligned} }
\clearpageUse in source · 1 passage
Search aliases: clearpage
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
\mathrm{coh}Use in source · 15 passages
Search aliases: coh mathrm
Use in source · 04-approximate-workspaces.tex, line 261
For c≠0, define the Rayleigh defect δ_coh(c) = frac E_H(c) c ^2. For a nonzero subspace W⊆ C_V, define δ_coh(W) = sup_substackc∈ W
Exact mathematical passage
\delta_{\mathrm{coh}}(c) = \frac{\mathcal E_H(c)}{\|c\|^2}.
\mathsf{Coh}Use in source · 2 passages
Search aliases: Coh mathsf
Use in source · 15-boundary-formation-and-stability.tex, line 116
For the induced subsystem on S, define Coh(S) = tr ( P_S,dL_SP_S,d ), where P_S,d projects onto the selected low-energy workspace modes. Let Cut(S) = ∑_e:s(e)∈ S, t(e)∉ Sw_e + ∑_e:s(e)∉ S, t(e)∈ Sw_e. Let k_ε(S) be the minimal sufficient coalition size inside the candidate subsystem. A candidate is admissible only if SRW_Θ_S(W_S)=1, k_ε(S)≥2, unless the claim explicitly concerns a centralized workspace.
Exact mathematical passage
\mathsf{Coh}(S) = \operatorname{tr} \left( P_{S,d}L_SP_{S,d} \right),
\operatorname{Comm}Use in source · 8 passages
Search aliases: Comm operatorname
Use in source · 02-static-core-transfer-theory.tex, line 357
[Holonomy commutes with abstract operations] For every loop γ:o→ o, H_γρ_o(a)=ρ_o(a)H_γ. Hence ρ_o( A) ⊆ Comm(Hol_o), where Comm(Hol_o) is the commutant of the holonomy representation.
Exact mathematical passage
\rho_o(\mathcal A) \subseteq \operatorname{Comm}(\Hol_o),
\mathrm{concept}Use in source · 1 passage
Search aliases: concept mathrm
Use in source · 23-relation-to-prior-work.tex, line 101
The analysis does not make one global novelty claim. It uses a priority profile p(C) = ( p_concept, p_object, p_theorem, p_certificate, p_experiment ). For example, the philosophical concept of distributed cognition may be standard while a specific mathematical object is adapted, a theorem is a specialization of known spectral theory, the certificate is a synthesis, and the empirical claim is unresolved. This prevents originality in one coordinate from being used to imply originality in every co…
Exact mathematical passage
\boxed{ \mathbf p(C) = \left( p_{\mathrm{concept}}, p_{\mathrm{object}}, p_{\mathrm{theorem}}, p_{\mathrm{certificate}}, p_{\mathrm{experiment}} \right). }
\cosUse in source · 2 passages
Search aliases: cos
Use in source · 03-exact-shared-cores.tex, line 315
[Local compatibility without a global nonzero core] Let the only nontrivial cycle holonomy on R^2 be a rotation R_θ= cosθ · -sinθ sinθ · cosθ with θ∉2π Z. Then ker(R_θ-I)={0}. Every edge map is individually invertible and well-defined, yet the complete cycle admits no nonzero exact shared core. Pairwise translatability is therefore insufficient for global path independence.
Exact mathematical passage
R_\theta= \begin{pmatrix} \cos\theta&-\sin\theta\\ \sin\theta&\cos\theta \end{pmatrix}
\operatorname{Cost}Use in source · 4 passages
Search aliases: Cost operatorname
Use in source · 12-identity-through-time-and-replacement.tex, line 363
A composite identity cost is Cost( J) = a q_str +b δ_op( J) +c δ_causal(β) +d δ_rec(β), where a,b,c,d>0 are declared scales. Define d_id( R, R') = inf_ J Cost( J). This quantity is a task-relative optimization surrogate until the admissible correspondence class, intervention matching, divergence, and scales are fixed. It does not replace the coordinatewise identity profile or the non-collapse gate.
Exact mathematical passage
\boxed{ \operatorname{Cost}(\mathfrak J) = a\,q_{\mathrm{str}} +b\,\delta_{\mathrm{op}}(\mathfrak J) +c\,\delta_{\mathrm{causal}}(\beta) +d\,\delta_{\mathrm{rec}}(\beta), }
\COutUse in source · 4 passages
Search aliases: COut
Use in source · 15-boundary-formation-and-stability.tex, line 80
Let ι_S,x be a feasible intervention that changes the internal workspace coordinate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general.…
Exact mathematical passage
\boxed{ \COut_\tau(S) = \mathbb E_{x,x'\sim\nu_S} D\!\left( \mathcal L^{\iota_{S,x}} (X_{\bar S}(t+\tau)), \mathcal L^{\iota_{S,x'}} (X_{\bar S}(t+\tau)) \right). }
\COut_\tauUse in source · 4 passages
Search aliases: COut_τ COut tau
Use in source · 15-boundary-formation-and-stability.tex, line 80
Let ι_S,x be a feasible intervention that changes the internal workspace coordinate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general.…
Exact mathematical passage
\boxed{ \COut_\tau(S) = \mathbb E_{x,x'\sim\nu_S} D\!\left( \mathcal L^{\iota_{S,x}} (X_{\bar S}(t+\tau)), \mathcal L^{\iota_{S,x'}} (X_{\bar S}(t+\tau)) \right). }
\mathrm{ctl}Use in source · 12 passages
Search aliases: ctl mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 58
A controlled state contains at least C_t^ctl = ( W_t,G_t,M_t,B_t,E_t ), where G_t is the represented goal, M_t is a workspace-integrity monitor, B_t is the current boundary or routing state, and E_t is the declared external context. An action is generated by A_t ∼ π_t ( ·mid W_t,G_t,M_t,B_t,E_t ). The future controlled state obeys a time-unrolled structural model S_t+1 = F_t(S_t,A_t,E_t+1,ξ_t+1), W_t+1=ω_t+1(S_t+1). The intervention semantics are inherited from Part~VII. A symbol such as do(A_t=…
Exact mathematical passage
C_t^{\mathrm{ctl}} = \left( W_t,G_t,M_t,B_t,E_t \right),
\mathrm{cue}Use in source · 4 passages
Search aliases: cue mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 300
Cue dependence must be reported separately. For matched initial goal g, define δ_G^cue(τ) = sup_c,c' D_G ( P(G_t+τ∈·midι_g,do(C=c)), P(G_t+τ∈·midι_g,do(C=c')) ). High cue dependence is not a failure when the claimed agent is intentionally instruction following. It does mean that persistence cannot be attributed to an autonomous internal objective without an additional cue-removal result.
Exact mathematical passage
\delta_G^{\mathrm{cue}}(\tau) = \sup_{c,c'} D_G \left( \mathbb P(G_{t+\tau}\in\cdot\mid\iota_g,\operatorname{do}(C=c)), \mathbb P(G_{t+\tau}\in\cdot\mid\iota_g,\operatorname{do}(C=c')) \right).
\mathsf{Cut}Use in source · 2 passages
Search aliases: Cut mathsf
Use in source · 15-boundary-formation-and-stability.tex, line 125
For the induced subsystem on S, define Coh(S) = tr ( P_S,dL_SP_S,d ), where P_S,d projects onto the selected low-energy workspace modes. Let Cut(S) = ∑_e:s(e)∈ S, t(e)∉ Sw_e + ∑_e:s(e)∉ S, t(e)∈ Sw_e. Let k_ε(S) be the minimal sufficient coalition size inside the candidate subsystem. A candidate is admissible only if SRW_Θ_S(W_S)=1, k_ε(S)≥2, unless the claim explicitly concerns a centralized workspace.
Exact mathematical passage
\mathsf{Cut}(S) = \sum_{e:s(e)\in S,\ t(e)\notin S}w_e + \sum_{e:s(e)\notin S,\ t(e)\in S}w_e.
\operatorname{cut}Use in source · 1 passage
Search aliases: cut operatorname
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 1119
Let G_t+1=C_t+1, where C_t+1 is an external instruction repeated at every step. Goal and action can be strongly correlated, but after cutting the cue channel, I(G_t+τ;G_tmidcut(C))=0. The system tracks an external command. It has not established internal goal retention.
Exact mathematical passage
I(G_{t+\tau};G_t\mid\operatorname{cut}(C))=0.
\mathbf dUse in source · 2 passages
Search aliases: d mathbf
Use in source · 12-identity-through-time-and-replacement.tex, line 344
For an admissible correspondence J, define the operation defect on a declared unit ball A_1 by δ_op( J) = sup_a∈ A_1 A_ W''β-β A_ W . The primary certification object is the identity profile d_id( J) = ( q_str, δ_op( J), δ_causal(β), δ_rec(β); μ^keep ). The first four coordinates must remain below declared tolerances, while the non-collapse margin μ^keep must remain above a declared lower bound. This vector, rather than a weighted average, determines whether a specific identity claim passes.
Exact mathematical passage
\boxed{ \mathbf d_{\mathrm{id}}(\mathfrak J) = \left( q_{\mathrm{str}}, \delta_{\mathrm{op}}(\mathfrak J), \delta_{\mathrm{causal}}(\beta), \delta_{\mathrm{rec}}(\beta); \mu^{\mathrm{keep}} \right). }
\mathrm dUse in source · 1 passage
Search aliases: d mathrm
Use in source · 06-dynamic-workspace-theory.tex, line 168
For every bounded measurable f: Y→ R, define Z_t(f)=∫_ Yf(y) Z_t( dy). By construction, E[f(Y_t^+)mid H_t]=Z_t(f). Since Z_t is a measurable function of H_t, the tower property gives E[f(Y_t^+)mid Z_t] = E[Z_t(f)mid Z_t] = Z_t(f). Hence conditioning additionally on H_t does not change the conditional expectation, which is the stated conditional independence.
Exact mathematical passage
Z_t(f)=\int_{\mathsf Y}f(y)\,Z_t(\mathrm dy).
\mathcal D'Use in source · 1 passage
Search aliases: D' mathcal
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
D'^*Use in source · 2 passages
Search aliases: D'^*
Use in source · 12-identity-through-time-and-replacement.tex, line 68
For every c, D'J_Vc=J_EDc. Because J_E is invertible, Dc=0 if and only if D'J_Vc=0, proving the kernel statement. Taking adjoints of the exact covariance identity gives D'^*J_E=J_VD^*. Therefore L'J_V=D'^*D'J_V=D'^*J_ED=J_VD^*D=J_VL. The spectral and operation claims follow by functional calculus and the intertwining assumptions.
Exact mathematical passage
D'^*J_E=J_VD^*.
D^*Use in source · 2 passages
Search aliases: D^*
Use in source · 12-identity-through-time-and-replacement.tex, line 68
For every c, D'J_Vc=J_EDc. Because J_E is invertible, Dc=0 if and only if D'J_Vc=0, proving the kernel statement. Taking adjoints of the exact covariance identity gives D'^*J_E=J_VD^*. Therefore L'J_V=D'^*D'J_V=D'^*J_ED=J_VD^*D=J_VL. The spectral and operation claims follow by functional calculus and the intertwining assumptions.
Exact mathematical passage
D'^*J_E=J_VD^*.
d_{\mathcal P}Use in source · 2 passages
Search aliases: d_ P mathcal
Use in source · 07-relational-irreducibility.tex, line 204
Let d_ P be a bounded metric generating the measurable structure on P( Y). Define the reconstruction defect of the canonical state from coalition A by δ_A^Z = inf_ψ_A E [ d_ P ( Z_t,ψ_A( H_t^A) ) ].
Exact mathematical passage
d_{\mathcal P}
d_{\mathfrak S}Use in source · 10 passages
Search aliases: d_ S mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 257
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ')
Exact mathematical passage
d_{\mathfrak S}
d_{\mathcal W'}Use in source · 1 passage
Search aliases: d_ W' mathcal
Use in source · 12-identity-through-time-and-replacement.tex, line 303
A reconstructive handoff may also be imperfect. Let δ_rec(β) = E[d_ W'(W'_init,β W)] measure replacement initialization error. Corollary~[source reference] provides one explicit upper bound on this term.
Exact mathematical passage
\delta_{\mathrm{rec}}(\beta) = \mathbb E\bigl[d_{\mathcal W'}(W'_{\mathrm{init}},\beta W)\bigr]
\mathcal D_0Use in source · 8 passages
Search aliases: D_0 mathcal
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 480
Fix a reference decomposition D_0. For each D∈ D, let Φ_ D:W^ D_0⟶ W^ D be a declared workspace correspondence and let δ_ D measure its structural and causal identity defect. Assume gate q has a transport bound | m_q(Φ_ DW; D) -m_q(W; D_0) | ≤ L_qδ_ D+b_q( D), where L_q is a sensitivity constant and b_q records model mismatch not captured by the identity distance.
Exact mathematical passage
\mathcal D_0
D_AUse in source · 4 passages
Search aliases: D_A
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 202
Goal-dependent action mediation is measured by feasible interventions on the goal channel while matching the current workspace and external context. For a divergence D_A, define η_G→ A = sup_g,g',w,e D_A ( P(A_t∈·midι_g,w,e), P(A_t∈·midι_g',w,e) ). Workspace-dependent action mediation is η_W→ A = sup_w,w',g,e D_A ( P(A_t∈·midι_w,g,e), P(A_t∈·midι_w',g,e) ). An action must also alter the declared future: η_A→ Y = sup_a,a',b D_Y ( P(Y_t^+∈·midι_a,b), P(Y_t^+∈·midι_a',b) ). A positive η_G→ A withou…
Exact mathematical passage
D_A
d_AUse in source · 2 passages
Search aliases: d_A
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 512
Order the local coordinates as x=(g_H,d_H,g_M,p_M,p_X,v_X,d_A,v_A)^ T. The overlap discrepancies are g_H-g_M, p_M-p_X, v_X-v_A, d_A-d_H. Thus D_HAI = 1 · 0 · -1 · 0 · 0 · 0 · 0 · 0
Exact mathematical passage
x=(g_H,d_H,g_M,p_M,p_X,v_X,d_A,v_A)^{\mathsf T}.
D_{a,H}Use in source · 2 passages
Search aliases: D_a,H
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 386
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1
Exact mathematical passage
(D_{a,H}c)_e = \sqrt{w_ea_e} \left( c_{t(e)}-H_ec_{s(e)} \right).
d_BUse in source · 1 passage
Search aliases: d_B
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 258
Let B_t^sys be an internal membership or routing state used by the system, and let S_t^* = argmax_S∈ S_pass B_t(S) be the population boundary defined by the external certification protocol. The strong endogenous boundary conjecture asserts that there are adaptive systems and nontrivial environments for which: · d_B(B_t^sys,S_t^*)→0, · Form_Θ_form(W_B_t^sys)=1, · CE ( B_t^sys→ Routing_t+1 )>0, · CE ( BoundaryDamage_t→ RepairAction_t+1 )>0, while the scaffold contains no direct encoding of S_t^*.
Exact mathematical passage
\boxed{ \begin{aligned} &d_B(B_t^{\mathrm{sys}},S_t^*)\to0,\\ &\operatorname{Form}_{\Theta_{\mathrm{form}}}(W_{B_t^{\mathrm{sys}}})=1,\\ &\operatorname{CE} \left( B_t^{\mathrm{sys}}\to \operatorname{Routing}_{t+1} \right)>0,\\ &\operatorname{CE} \left( \operatorname{BoundaryDamage}_t\to \operatorname{RepairAction}_{t+1} \right)>0, \end{aligned} }
\mathcal D_{\mathrm{cal}}Use in source · 2 passages
Search aliases: D_cal mathcal mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 158
The same sample must not be used both to select a workspace and to certify its coherence, causal efficacy, or relational irreducibility. The required split is D = D_form sqcup D_cal sqcup D_cert. The formation sample selects widehatθ. The calibration sample fixes thresholds, regularization strengths, and intervention magnitudes. The certification sample evaluates the final gates without further structural selection. In a multi-environment study, the stronger requirement is E_form ∩ E_cert = ∅, s…
Exact mathematical passage
\mathcal D = \mathcal D_{\mathrm{form}} \sqcup \mathcal D_{\mathrm{cal}} \sqcup \mathcal D_{\mathrm{cert}}.
d_{\mathrm{causal}}Use in source · 1 passage
Search aliases: d_causal mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 1136
Let two realizations have identical benchmark output distributions, P(Y_bench)=P'(Y_bench), but different intervention kernels: K(w,b)≠ K'(β w,b) for some matched workspace intervention. Then task behavior is preserved while d_causal(W,W')>0. The later system may be a successor or replacement rather than the same workspace under the identity criterion of Part~XII.
Exact mathematical passage
d_{\mathrm{causal}}(W,W')>0.
d_DUse in source · 1 passage
Search aliases: d_D
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
d_{\mathrm{er}}Use in source · 8 passages
Search aliases: d_er mathrm
Use in source · 11-reconstruction-and-resilience.tex, line 305
Define the accessible block support of c≠0 by supp_E(c) = {i∈ V:E_ic≠0} and define the node-erasure distance d_er = min_c≠0|supp_E(c)|.
Exact mathematical passage
\boxed{ d_{\mathrm{er}} = \min_{c\neq0}|\operatorname{supp}_E(c)|. }
d_GUse in source · 1 passage
Search aliases: d_G
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 318
[Cue-controlled goal retention] Let G_s∈ R^d_G obey G_s+1 = R_sG_s+B_sC_s+1+ζ_s+1 (s=t,…,t+τ-1). Consider two intervention runs that set G_t=g, G_t'=g', and then use the same command trajectory and the same disturbance realization. Let R_t+τ:t = R_t+τ-1⋯ R_t. Then G_t+τ-G_t+τ' = R_t+τ:t(g-g'). If m_s ≤ σ_min(R_s), R_s ≤ M_s, then ( ∏_s=t^t+τ-1m_s ) g-g' ≤ G_t+τ-G_t+τ' ≤ ( ∏_s=t^t+τ-1M_s ) g-g' .
Exact mathematical passage
G_s\in\mathbb R^{d_G}
D_{G_\alpha}Use in source · 2 passages
Search aliases: D_G_α alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 562
Local candidates may also violate their internal transfer equations. Define the local-copy space widehat C_ U = ⊕_α∈ A C_V(G_α) and the block internal discrepancy widehat D_ U = ⊕_α∈ AD_G_α. For u=(u_α)_α∈widehat C_ U, define the raw overlap synchronization operator (S_ Uu)_αβ = ρ_G_αβ^G_βu_β - ρ_G_αβ^G_αu_α. For an overlap weight λ_ov>0, set K_ U = widehat D_ U
Exact mathematical passage
\widehat D_{\mathcal U} = \bigoplus_{\alpha\in A}D_{G_\alpha}.
d_HUse in source · 2 passages
Search aliases: d_H
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 512
Order the local coordinates as x=(g_H,d_H,g_M,p_M,p_X,v_X,d_A,v_A)^ T. The overlap discrepancies are g_H-g_M, p_M-p_X, v_X-v_A, d_A-d_H. Thus D_HAI = 1 · 0 · -1 · 0 · 0 · 0 · 0 · 0
Exact mathematical passage
x=(g_H,d_H,g_M,p_M,p_X,v_X,d_A,v_A)^{\mathsf T}.
D_{H^g}Use in source · 5 passages
Search aliases: D_H^g
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 36
For each i∈ V, let g_i∈ GL(C_i), g=(g_i)_i∈ V. Define the vertex and edge direct sums G_V=⊕_i∈ Vg_i, G_E=⊕_e∈ Eg_t(e). The transformed transfers and local operation representations are H_e^g = g_t(e)H_eg_s(e)^-1, ρ_i^g(a) = g_iρ_i(a)g_i^-1. The fundamental covariance identity is D_H^gG_V=G_ED_H. It follows directly by evaluating the e-component: sqrtw_e ( g_t(e)c_t(e) - g_t(e)H_ec_s(e) ).
Exact mathematical passage
\boxed{ D_{H^g}G_V=G_ED_H. }
D_{H^g}^*Use in source · 1 passage
Search aliases: D_H^g^*
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 113
From D_H^g=G_ED_HG_V^-1 and unitarity, D_H^g^*D_H^g = G_VD_H^*G_E^-1G_ED_HG_V^-1 = G_VL_HG_V^-1. The spectral statements follow from unitary similarity.
Exact mathematical passage
D_{H^g}^*D_{H^g} = G_VD_H^*G_E^{-1}G_ED_HG_V^{-1} = G_VL_HG_V^{-1}.
D_{\mathrm{HAI}}Use in source · 2 passages
Search aliases: D_HAI mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 526
Order the local coordinates as x=(g_H,d_H,g_M,p_M,p_X,v_X,d_A,v_A)^ T. The overlap discrepancies are g_H-g_M, p_M-p_X, v_X-v_A, d_A-d_H. Thus D_HAI = 1 · 0 · -1 · 0 · 0 · 0 · 0 · 0 0 · 0 · 0 · 1 · -1 · 0 · 0 · 0 0 · 0 · 0 · 0 · 0 · 1 · 0 · -1 0 · -1 · 0 · 0 · 0 · 0 · 1 · 0 . The rows are orthogonal with squared norm two. Therefore ker D_HAI ≅ R^4, spec(L_HAI) = {0,0,0,0,2,2,2,2}, γ_HAI=2. The full accessible frame operator is F_HMXA=2I_4. No single node is injective. Every three-node coalition r…
Exact mathematical passage
D_{\mathrm{HAI}} = \begin{pmatrix} 1&0&-1&0&0&0&0&0\\ 0&0&0&1&-1&0&0&0\\ 0&0&0&0&0&1&0&-1\\ 0&-1&0&0&0&0&1&0 \end{pmatrix}.
D_{\mathrm{HH}}Use in source · 3 passages
Search aliases: D_HH mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 286
Order the local coordinates as x=(q_P,p_P,p_C,f_C,q_N,f_N)^ T. Compatibility requires p_P=p_C, f_C=f_N, q_N=q_P. The discrepancy operator is D_HH = 0 · 1 · -1 · 0 · 0 · 0 0 · 0 · 0 · 1 · 0 · -1 -1 · 0 · 0 · 0 · 1 · 0 . Therefore ker D_HH = { (q,p,p,f,q,f)^ T:q,p,f∈ R } ≅ R^3. The rows are orthogonal with squared norm two, so D_HHD_HH^*=2I_3. Consequently the transfer Laplacian has spectrum spec(L_HH) = {0,0,0,2,2,2}, and the exact workspace gap is γ_HH=2. The low-energy subspace is therefore sta…
Exact mathematical passage
D_{\mathrm{HH}} = \begin{pmatrix} 0&1&-1&0&0&0\\ 0&0&0&1&0&-1\\ -1&0&0&0&1&0 \end{pmatrix}.
D_{\mathrm{HH}}^*Use in source · 1 passage
Search aliases: D_HH^* mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 305
-1 · 0 · 0 · 0 · 1 · 0 . Therefore ker D_HH = { (q,p,p,f,q,f)^ T:q,p,f∈ R } ≅ R^3. The rows are orthogonal with squared norm two, so D_HHD_HH^*=2I_3. Consequently the transfer Laplacian has spectrum spec(L_HH) = {0,0,0,2,2,2}, and the exact workspace gap is γ_HH=2. The low-energy subspace is therefore stable under any Laplacian perturbation whose operator norm is strictly below one, with the quantitative projector bound from Theorem~[source reference].
Exact mathematical passage
D_{\mathrm{HH}}D_{\mathrm{HH}}^*=2I_3.
d_IUse in source · 1 passage
Search aliases: d_I
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
\mathbf d_{\mathrm{id}}Use in source · 2 passages
Search aliases: d_id mathbf mathrm
Use in source · 12-identity-through-time-and-replacement.tex, line 344
For an admissible correspondence J, define the operation defect on a declared unit ball A_1 by δ_op( J) = sup_a∈ A_1 A_ W''β-β A_ W . The primary certification object is the identity profile d_id( J) = ( q_str, δ_op( J), δ_causal(β), δ_rec(β); μ^keep ). The first four coordinates must remain below declared tolerances, while the non-collapse margin μ^keep must remain above a declared lower bound. This vector, rather than a weighted average, determines whether a specific identity claim passes.
Exact mathematical passage
\boxed{ \mathbf d_{\mathrm{id}}(\mathfrak J) = \left( q_{\mathrm{str}}, \delta_{\mathrm{op}}(\mathfrak J), \delta_{\mathrm{causal}}(\beta), \delta_{\mathrm{rec}}(\beta); \mu^{\mathrm{keep}} \right). }
d_{\mathrm{id}}Use in source · 14 passages
Search aliases: d_id mathrm
Use in source · 01-foundational-thesis.tex, line 334
Persistence does not require token identity. Let R_t and R_t+1 be temporally successive realizations. Continuity is possible when there exists an admissible transport J_t: R_trightsquigarrow R_t+1 that preserves the operative core and its causal role within tolerance: d_id(Workspace_t,Workspace_t+1)≤ε. Thus a workspace may persist by reconstruction rather than by retaining an unchanged physical inscription.
Exact mathematical passage
d_{\mathrm{id}}(\Workspace_t,\Workspace_{t+1})\leq\varepsilon.
D_{\mathrm{int}}Use in source · 5 passages
Search aliases: D_int mathrm
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 104
Let the vertex set of a core-transfer diagram be partitioned as V=V_1sqcup⋯sqcup V_m. Write the transfer discrepancy as D_H = D_int D_∂ , D_int = ⊕_α=1^mD_α, where D_α contains the edge constraints internal to V_α, and D_∂ contains the constraints crossing between blocks. Define the internally coherent macro-state spaces W_α=ker D_α, W_Π=⊕_α=1^mW_α. Let J_Π:W_Π↪ C_V be the canonical isometric inclusion, and define the quotient discrepancy D_Π=D_∂J_Π. The quotient does not replace a group of node…
Exact mathematical passage
D_H = \begin{pmatrix} D_{\mathrm{int}}\\ D_{\partial} \end{pmatrix}, \qquad D_{\mathrm{int}} = \bigoplus_{\alpha=1}^{m}D_\alpha,
D_{\mathrm{int}}^*Use in source · 1 passage
Search aliases: D_int^* mathrm
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 193
[Two-scale coherence bound] Let P_Π be the orthogonal projector onto J_Π W_Π. Let γ_int>0 be the smallest positive eigenvalue of D_int^*D_int, and let γ_Π>0 be the smallest positive eigenvalue of D_Π^*D_Π. Then every c∈ C_V satisfies dist(c,Γ(H)) ≤ frac D_intc sqrtγ_int + frac D_Π J_Π^*P_Π c sqrtγ_Π. The first term measures incoherence within macro-components. The second measures incompatibility among their internally coherent states.
Exact mathematical passage
D_{\mathrm{int}}^*D_{\mathrm{int}}
d_NUse in source · 1 passage
Search aliases: d_N
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
d_{\mathrm{path}}^{\rightarrow}Use in source · 2 passages
Search aliases: d_path^rightarrow mathrm rightarrow
Use in source · 12-identity-through-time-and-replacement.tex, line 571
For a sequence of realizations R_0, R_1,…, R_T, let J_t: R_t→ R_t+1 be admissible correspondences. Define the path length Len( J_0:T) = ∑_t=0^T-1Cost( J_t) and the induced directed path quasi-pseudometric d_path^rightarrow( R_0, R_T) = inf_ J_0:T Len( J_0:T). Concatenation gives the directed triangle inequality. Because replacement costs and intervention divergences need not be symmetric, symmetry is not assumed. When reverse correspondences exist, define the symmetrized pseudometric d_path^sym(…
Exact mathematical passage
\boxed{ d_{\mathrm{path}}^{\rightarrow}(\mathfrak R_0,\mathfrak R_T) = \inf_{\mathfrak J_{0:T}} \operatorname{Len}(\mathfrak J_{0:T}). }
d_{\mathrm{path}}^{\mathrm{sym}}Use in source · 1 passage
Search aliases: d_path^sym mathrm mathrm
Use in source · 12-identity-through-time-and-replacement.tex, line 583
d path quasi-pseudometric d_path^rightarrow( R_0, R_T) = inf_ J_0:T Len( J_0:T). Concatenation gives the directed triangle inequality. Because replacement costs and intervention divergences need not be symmetric, symmetry is not assumed. When reverse correspondences exist, define the symmetrized pseudometric d_path^sym( R, R') = max{ d_path^rightarrow( R, R'), d_path^rightarrow( R', R) }. Distinct physical realizations can have zero symmetrized pseudodistance when an exact correspondence exists …
Exact mathematical passage
\boxed{ d_{\mathrm{path}}^{\mathrm{sym}}(\mathfrak R,\mathfrak R') = \max\left\{ d_{\mathrm{path}}^{\rightarrow}(\mathfrak R,\mathfrak R'), d_{\mathrm{path}}^{\rightarrow}(\mathfrak R',\mathfrak R) \right\}. }
d_qUse in source · 1 passage
Search aliases: d_q
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 309
For a family S of admissible scaffold variants, define the cross-scaffold identity defect δ_q^scaf = inf_{J_σσ'} E_σ,σ'∼π d_q ( J_σσ'q_σ,q_σ' ), where J_σσ' transports the learned object between admissible coordinate systems. A low value indicates that the same abstract organization is recovered under multiple non-solution-bearing scaffolds.
Exact mathematical passage
\boxed{ \delta_q^{\mathrm{scaf}} = \inf_{\{J_{\sigma\sigma'}\}} \mathbb E_{\sigma,\sigma'\sim\pi} d_q \left( J_{\sigma\sigma'}q_{\sigma},q_{\sigma'} \right), }
\mathcal D_{\mathrm{sel}}Use in source · 3 passages
Search aliases: D_sel mathcal mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 934
[Validity after independent specification selection] Let widehatς be selected using D_sel, and let D_cert be independent of D_sel. For every fixed ς∈ S, let ϕ_ς( D_cert)∈{0,1} be a certificate rule satisfying sup_P:Cert(W;ς)=0 P_P(ϕ_ς=1) ≤α. Then the selected-specification procedure satisfies sup_P P_P( ϕ_widehatς=1, Cert(W;widehatς)=0 ) ≤α.
Exact mathematical passage
\mathcal D_{\mathrm{sel}}
\mathcal D_{\mathrm{spec}}Use in source · 1 passage
Search aliases: D_spec mathcal mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 975
A practical design may use: D_form sqcup D_spec sqcup D_cert sqcup D_stress. Formation learns the workspace. The specification split chooses targets, horizons, nulls, and thresholds from a predeclared menu. Certification makes the pass decision once. Stress testing explores broader shifts without retroactively changing the certified claim. Cross-fitting can recover sample efficiency, but the fold-level selection and evaluation paths must remain separated and the final uncertainty calculation mus…
Exact mathematical passage
\mathcal D_{\mathrm{form}} \sqcup \mathcal D_{\mathrm{spec}} \sqcup \mathcal D_{\mathrm{cert}} \sqcup \mathcal D_{\mathrm{stress}}.
\mathcal D_{\mathrm{stress}}Use in source · 2 passages
Search aliases: D_stress mathcal mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 975
A practical design may use: D_form sqcup D_spec sqcup D_cert sqcup D_stress. Formation learns the workspace. The specification split chooses targets, horizons, nulls, and thresholds from a predeclared menu. Certification makes the pass decision once. Stress testing explores broader shifts without retroactively changing the certified claim. Cross-fitting can recover sample efficiency, but the fold-level selection and evaluation paths must remain separated and the final uncertainty calculation mus…
Exact mathematical passage
\mathcal D_{\mathrm{form}} \sqcup \mathcal D_{\mathrm{spec}} \sqcup \mathcal D_{\mathrm{cert}} \sqcup \mathcal D_{\mathrm{stress}}.
d_tUse in source · 7 passages
Search aliases: d_t
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 878
[Causal repair stabilizes maintenance deficit] Let e_t≥0 be the maintenance deficit. Suppose the matched no-repair trajectory satisfies e_t+1^(0) ≤ α e_t+d_t, where d_t≥0 is exogenous damage. Suppose the implemented repair policy has the causal one-step effect e_t+1^(0)-e_t+1 ≥ κ e_t-ϵ_t. Assume 0≤β:=α-κ<1, 0≤ d_t≤overline d, 0≤ϵ_t≤overlineϵ. Then e_t ≤ β^te_0 + frac(overline d+overlineϵ)(1-β^t)1-β, and therefore limsup_t→∞e_t ≤ fracoverline d+overlineϵ1-β. If the admissible deficit is e_max and…
Exact mathematical passage
e_{t+1}^{(0)} \leq \alpha e_t+d_t,
D_{t+1}Use in source · 2 passages
Search aliases: D_t+1
Use in source · 10-persistence.tex, line 40
To compare successive times, choose unitary identification maps U_t^V: C_V(t)⟶ C_V(t+1), U_t^E: C_E(t)⟶ C_E(t+1). They are comparison maps, not assumptions that the physical carriers are identical. Define the one-step diagram defect Δ_t^D = D_t+1U_t^V-U_t^ED_t, δ_t^D= Δ_t^D . Exact temporal compatibility is the condition Δ_t^D=0.
Exact mathematical passage
\boxed{ \Delta_t^D = D_{t+1}U_t^V-U_t^ED_t, \qquad \delta_t^D=\|\Delta_t^D\|. }
D_t^*Use in source · 2 passages
Search aliases: D_t^*
Use in source · 10-persistence.tex, line 22
At time t, let C_V(t)=⊕_i∈ VC_i(t), C_E(t)=⊕_e∈ EC_t(e)(t), and let D_t: C_V(t)⟶ C_E(t), L_t=D_t^*D_t be the transfer discrepancy and transfer Laplacian. At time t, the combinatorial graph is held fixed while the local representations, transfers, and metrics may vary. Changes of graph are treated later by a graph correspondence.
Exact mathematical passage
D_t:\mathcal C_V(t)\longrightarrow\mathcal C_E(t), \qquad L_t=D_t^*D_t
d_uUse in source · 1 passage
Search aliases: d_u
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 452
[Population transfer identification] Let X∈ R^d_u and Y∈ R^d_v satisfy Y=H_*X+ξ, E[ξ X^ T]=0, and assume Σ_XX = E[XX^ T] succeq κ I for some κ>0. Then H_* is the unique minimizer of R(H) = E Y-HX _2^2, with H_* = Σ_YXΣ_XX^-1. Moreover, R(H)- R(H_*) = tr ( (H-H_*)Σ_XX(H-H_*)^ T ) ≥ κ H-H_* _F^2.
Exact mathematical passage
X\in\mathbb R^{d_u}
d_vUse in source · 1 passage
Search aliases: d_v
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 452
[Population transfer identification] Let X∈ R^d_u and Y∈ R^d_v satisfy Y=H_*X+ξ, E[ξ X^ T]=0, and assume Σ_XX = E[XX^ T] succeq κ I for some κ>0. Then H_* is the unique minimizer of R(H) = E Y-HX _2^2, with H_* = Σ_YXΣ_XX^-1. Moreover, R(H)- R(H_*) = tr ( (H-H_*)Σ_XX(H-H_*)^ T ) ≥ κ H-H_* _F^2.
Exact mathematical passage
Y\in\mathbb R^{d_v}
d_WUse in source · 2 passages
Search aliases: d_W
Use in source · 11-reconstruction-and-resilience.tex, line 170
Geometric recovery becomes behaviorally relevant when the workspace state controls a predictive kernel. Let K_w= P(Y∈·mid W=w) and suppose TV(K_w,K_w')≤ L_Kd_W(w,w').
Exact mathematical passage
\TV(K_w,K_{w'})\leq L_Kd_W(w,w').
D_{\widetilde H}Use in source · 1 passage
Search aliases: D_widetilde H widetilde
Use in source · 04-approximate-workspaces.tex, line 512
Suppose the edge maps are perturbed to widetilde H_e=H_e+Δ_e while the weights and vertex metrics remain fixed. Define δ_H^2 = max_i∈ V ∑_e:s(e)=iw_e Δ_e ^2. Let F=D_widetilde H-D_H. Then (Fc)_e=-sqrtw_e Δ_ec_s(e), F ≤δ_H. Since L_widetilde H-L_H =D_H^*F+F^*D_H+F^*F, we obtain L_widetilde H-L_H ≤ 2 D_H δ_H+δ_H^2.
Exact mathematical passage
F=D_{\widetilde H}-D_H
d_{\Workspace}Use in source · 4 passages
Search aliases: d_Workspace Workspace
Use in source · 03-exact-shared-cores.tex, line 39
A nontrivial exact structural workspace exists when dimΓ(H)>0. Its exact dimension is d_Workspace=dimΓ(H).
Exact mathematical passage
d_{\Workspace}=\dim\Gamma(H).
d_YUse in source · 1 passage
Search aliases: d_Y
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
D_\alphaUse in source · 4 passages
Search aliases: D_α alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1192
The exact and approximate constructions can be compressed as local transfer systems · xrightarrow ker D_α local workspaces · xrightarrow kerδ^0 meta-workspace · xrightarrow finite recursive descent global workspace. At exact resolution, all finite parenthesizations are canonically equivalent. At approximate resolution, every level contributes a defect scaled by its spectral gap and by downstream amplification. Relative-only overlap data can carry a harmonic H^1 obstruction even when every local …
Exact mathematical passage
\boxed{ \begin{aligned} \text{local transfer systems} &\xrightarrow{\ \ker D_\alpha\ } \text{local workspaces}\\ &\xrightarrow{\ \ker\delta^0\ } \text{meta-workspace}\\ &\xrightarrow{\ \text{finite recursive descent}\ } \text{global workspace}. \end{aligned} }
d_{\varepsilon}Use in source · 1 passage
Search aliases: d_ε varepsilon
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 41
For a one-parameter family R_λ, define λ_str · = inf{λ: d_ε(λ)>0, g_ε(λ)>0}, λ_op · = inf{λ: δ_align(λ) ≤ε_op}, λ_causal · = inf{λ: η_causal(λ) ≥τ_causal}, λ_rel · = inf{λ: k_ε(λ)≥2, Δ_tr(λ) ≥τ_tr}, λ_form · = inf{λ: Form_Θ_form (W_λ)=1}. In general, λ_str, λ_op, λ_causal, λ_rel, λ_form can be distinct. A synchronized representation can appear before it becomes causally useful, and causal coordination can appear while remaining reducible to one centralized component.
Exact mathematical passage
\begin{aligned} \lambda_{\mathrm{str}} &= \inf\{\lambda: d_{\varepsilon}(\lambda)>0, g_{\varepsilon}(\lambda)>0\},\\ \lambda_{\mathrm{op}} &= \inf\{\lambda: \delta_{\mathrm{align}}(\lambda) \leq\varepsilon_{\mathrm{op}}\},\\ \lambda_{\mathrm{causal}} &= \inf\{\lambda: \eta_{\mathrm{causal}}(\lambda) \geq\tau_{\mathrm{causal}}\},\\ \lambda_{\mathrm{rel}} &= \inf\{\lambda: k_\varepsilon(\lambda)\geq2, \Delta_{\mathrm{tr}}(\lambda) \geq\tau_{\mathrm{tr}}\},\\ \lambda_{\mathrm{form}} &= \inf\{\lambda: \operatorname{Form}_{\Theta_{\mathrm{form}}} (W_\lambda)=1\}. \end{aligned}
d_\ThetaUse in source · 1 passage
Search aliases: d_Θ Theta
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
D_\PiUse in source · 14 passages
Search aliases: D_Π Pi
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 129
where D_α contains the edge constraints internal to V_α, and D_∂ contains the constraints crossing between blocks. Define the internally coherent macro-state spaces W_α=ker D_α, W_Π=⊕_α=1^mW_α. Let J_Π:W_Π↪ C_V be the canonical isometric inclusion, and define the quotient discrepancy D_Π=D_∂J_Π. The quotient does not replace a group of nodes by an arbitrary summary. Its macro-state is the complete internal section space of that group, and its boundary operator retains all cross-block compatibili…
Exact mathematical passage
D_\Pi=D_{\partial}J_\Pi.
D_\Pi^*Use in source · 3 passages
Search aliases: D_Π^* Pi
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 146
[Faithful coarse-graining] For every finite partition of the vertex set, ker D_H = J_Πker D_Π. Equivalently, Γ(H) ≅ ker D_Π = ker(D_Π^*D_Π). In particular, dimΓ(H) = dim W_Π-rank(D_Π). Thus faithful coarse-graining preserves the exact structural workspace even though it changes the number and interpretation of the displayed nodes.
Exact mathematical passage
\boxed{ \Gamma(H) \cong \ker D_\Pi = \ker(D_\Pi^*D_\Pi). }
d_\tauUse in source · 1 passage
Search aliases: d_τ tau
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
d_\ellUse in source · 1 passage
Search aliases: d_ℓ ell
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
D_{\partial}Use in source · 5 passages
Search aliases: D_∂ partial
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 104
Let the vertex set of a core-transfer diagram be partitioned as V=V_1sqcup⋯sqcup V_m. Write the transfer discrepancy as D_H = D_int D_∂ , D_int = ⊕_α=1^mD_α, where D_α contains the edge constraints internal to V_α, and D_∂ contains the constraints crossing between blocks. Define the internally coherent macro-state spaces W_α=ker D_α, W_Π=⊕_α=1^mW_α. Let J_Π:W_Π↪ C_V be the canonical isometric inclusion, and define the quotient discrepancy D_Π=D_∂J_Π. The quotient does not replace a group of node…
Exact mathematical passage
D_H = \begin{pmatrix} D_{\mathrm{int}}\\ D_{\partial} \end{pmatrix}, \qquad D_{\mathrm{int}} = \bigoplus_{\alpha=1}^{m}D_\alpha,
\mathsf{data\_splits}Use in source · 1 passage
Search aliases: data_splits mathsf
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 660
The machine-readable record should contain at least the following top-level objects: ResultRecord ={ · claim, specification, specification_family, decomposition, data_splits, formation, · workspace_extractor, goals, actions, interventions, · nulls, gates, identified_sets, specification_envelopes, uncertainty, failures, artifacts }. Each gate object records its symbol, estimator, direction, threshold, point estimate, interval, split, seed set, status, and artifact reference. Each intervention and…
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{ResultRecord} =\{& \mathsf{claim}, \mathsf{specification}, \mathsf{specification\_family}, \mathsf{decomposition}, \mathsf{data\_splits}, \mathsf{formation},\\ &\mathsf{workspace\_extractor}, \mathsf{goals}, \mathsf{actions}, \mathsf{interventions},\\ &\mathsf{nulls}, \mathsf{gates}, \mathsf{identified\_sets}, \mathsf{specification\_envelopes}, \mathsf{uncertainty}, \mathsf{failures}, \mathsf{artifacts} \}. \end{aligned} }
\ddUse in source · 1 passage
Search aliases: dd
Use in source · 04-approximate-workspaces.tex, line 430
nwidetilde Q, set A_P=PAP|_ran P, B_Q=widetilde QBwidetilde Q|_ranwidetilde Q. The operator X=Pwidetilde Q satisfies the Sylvester equation A_PX-XB_Q=-PEwidetilde Q. Let μ=(a+b)/2. Since e^t(A_P-μ I) ≤ e^-(b-a)t/2, e^-t(B_Q-μ I) ≤ e^-(b-a)t/2, the inverse Sylvester operator has the convergent integral representation X = ∫_0^∞ e^t(A_P-μ I) (PEwidetilde Q) e^-t(B_Q-μ I) dd t. Taking norms and integrating gives the result.
Exact mathematical passage
X = \int_0^\infty e^{t(A_P-\mu I)} (PE\widetilde Q) e^{-t(B_Q-\mu I)}\,\dd t.
\mathrm{dec}Use in source · 5 passages
Search aliases: dec mathrm
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 442
Let m_q(W; D) be the signed margin of gate q, oriented so that m_q(W; D)>0 means that the gate passes after its uncertainty correction. Define the decomposition envelope underline m_q = inf_ D∈ Dm_q(W; D), overline m_q = sup_ D∈ Dm_q(W; D), and its sensitivity width Δ_q^dec = overline m_q-underline m_q.
Exact mathematical passage
\Delta_q^{\mathrm{dec}} = \overline m_q-\underline m_q.
\mathsf{decomposition}Use in source · 1 passage
Search aliases: decomposition mathsf
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 660
The machine-readable record should contain at least the following top-level objects: ResultRecord ={ · claim, specification, specification_family, decomposition, data_splits, formation, · workspace_extractor, goals, actions, interventions, · nulls, gates, identified_sets, specification_envelopes, uncertainty, failures, artifacts }. Each gate object records its symbol, estimator, direction, threshold, point estimate, interval, split, seed set, status, and artifact reference. Each intervention and…
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{ResultRecord} =\{& \mathsf{claim}, \mathsf{specification}, \mathsf{specification\_family}, \mathsf{decomposition}, \mathsf{data\_splits}, \mathsf{formation},\\ &\mathsf{workspace\_extractor}, \mathsf{goals}, \mathsf{actions}, \mathsf{interventions},\\ &\mathsf{nulls}, \mathsf{gates}, \mathsf{identified\_sets}, \mathsf{specification\_envelopes}, \mathsf{uncertainty}, \mathsf{failures}, \mathsf{artifacts} \}. \end{aligned} }
\DepUse in source · 2 passages
Search aliases: Dep
Use in source · 15-boundary-formation-and-stability.tex, line 55
For S∈ S, define Ret_τ(S) = I ( X_S(t+τ);X_S(t) mid X_bar S(t),E_t ), Dep_τ(S) = I ( X_S(t+τ);X_bar S(t) mid X_S(t),E_t ), Out_τ(S) = I ( X_bar S(t+τ);X_S(t) mid X_bar S(t),E_t ). These quantities are observational. They can be nonzero because of common causes, selection, or feedback paths and therefore cannot alone establish a causal boundary.
Exact mathematical passage
\Dep_\tau(S) = I\!\left( X_S(t+\tau);X_{\bar S}(t) \mid X_S(t),E_t \right),
\Dep_\tauUse in source · 2 passages
Search aliases: Dep_τ Dep tau
Use in source · 15-boundary-formation-and-stability.tex, line 55
For S∈ S, define Ret_τ(S) = I ( X_S(t+τ);X_S(t) mid X_bar S(t),E_t ), Dep_τ(S) = I ( X_S(t+τ);X_bar S(t) mid X_S(t),E_t ), Out_τ(S) = I ( X_bar S(t+τ);X_S(t) mid X_bar S(t),E_t ). These quantities are observational. They can be nonzero because of common causes, selection, or feedback paths and therefore cannot alone establish a causal boundary.
Exact mathematical passage
\Dep_\tau(S) = I\!\left( X_S(t+\tau);X_{\bar S}(t) \mid X_S(t),E_t \right),
\detUse in source · 1 passage
Search aliases: det
Use in source · 04-approximate-workspaces.tex, line 373
-(a+b) · b^2+1 . Writing τ=a^2+b^2+2, the eigenvalues are λ_± = frac12 ( τ±sqrtτ^2-4(ab-1)^2 ), and det L_H=(ab-1)^2. Thus a nonzero exact shared core exists precisely when ab=1, which is exactly the trivial-holonomy condition. Away from exact consistency, λ_-λ_+=(ab-1)^2. When |ab-1| is small while λ_+ stays bounded away from zero, the soft workspace eigenvalue is quadratic in the cycle mismatch: λ_- = frac(ab-1)^2λ_+. This example connects approximate spectral coherence directly to approximate…
Exact mathematical passage
\det L_H=(ab-1)^2.
\operatorname{diag}Use in source · 2 passages
Search aliases: diag operatorname
Use in source · 03-exact-shared-cores.tex, line 537
[Operators in the reflection-cycle workspace] For Example~[source reference], the holonomy is J=diag(1,-1). Its commutant consists of diagonal matrices: Comm(J) = { a · 0
Exact mathematical passage
J=\operatorname{diag}(1,-1).
\operatorname{dist}Use in source · 8 passages
Search aliases: dist operatorname
Use in source · 04-approximate-workspaces.tex, line 297
[Coherence-to-core distance estimate] Let W_0=Γ(H)=ker L_H, r=dim W_0, and suppose r<N. Set γ_H=λ_r+1>0. Then every c∈ C_V satisfies dist(c,W_0)^2 ≤ frac E_H(c)γ_H. Moreover, E_H(c) ≤ L_H dist(c,W_0)^2.
Exact mathematical passage
\boxed{ \operatorname{dist}(c,W_0)^2 \leq \frac{\mathcal E_H(c)}{\gamma_H}. }
\operatorname{Distributed}Use in source · 1 passage
Search aliases: Distributed operatorname
Use in source · 01-foundational-thesis.tex, line 365
Workspace( R) centernotLongrightarrow Conscious( R). Likewise, Distributed(Workspace) centernotLongrightarrow Person(Workspace). Workspace structure, reentry, agency, self-maintenance, and phenomenal consciousness remain formally distinct predicates. Any bridge among them would require additional theory and evidence.
Exact mathematical passage
\operatorname{Distributed}(\Workspace) \centernot\Longrightarrow \operatorname{Person}(\Workspace).
\DownarrowUse in source · 1 passage
Search aliases: Downarrow
Use in source · 25-unified-formulation.tex, line 6
The complete static-to-agentive construction is · (Ω, D, S,Σ, D_form, L) [2mm] · Downarrow ( D,widehat V,widehat E,widehat H,widehat P,widehat B) [2mm] · Downarrow (G,{X_i},{T_e}) [2mm] · Downarrow X_i=C_i⊕ R_i [2mm] · ({C_i},{H_e}, A,{ρ_i}) [2mm] · Downarrow Γ(H)=varprojlim C_i [2mm] · Downarrow L_H=D_H^*D_H [2mm] · Downarrow Γ_ε(H) = ran 1_[0,ε](L_H) [2mm] · Downarrow W_t^str [2mm] · xrightarrowalignment Z_t= P(Y_t^+∈·mid H_t) [2mm] · Downarrow SRW_Θ(W_t; D) [2mm] · Downarrow (W_t,G_t,widehat …
Exact mathematical passage
\boxed{ \begin{aligned} & (\Omega,\mathfrak D,\mathfrak S,\Sigma,\mathcal D_{\mathrm{form}},\mathcal L) \\[2mm] &\Downarrow \qquad (\mathcal D,\widehat V,\widehat E,\widehat H,\widehat P,\widehat B) \\[2mm] &\Downarrow \qquad (G,\{X_i\},\{T_e\}) \\[2mm] &\Downarrow \qquad X_i=C_i\oplus R_i \\[2mm] & (\{C_i\},\{H_e\},\mathcal A,\{\rho_i\}) \\[2mm] &\Downarrow \qquad \Gamma(H)=\varprojlim C_i \\[2mm] &\Downarrow \qquad L_H=D_H^*D_H \\[2mm] &\Downarrow \qquad \Gamma_\varepsilon(H) = \ran\,\mathbf 1_{[0,\varepsilon]}(L_H) \\[2mm] &\Downarrow \qquad W_t^{\mathrm{str}} \\[2mm] &\xrightarrow{\text{alignment}} Z_t=\mathbb P(Y_t^+\in\cdot\mid\mathbf H_t) \\[2mm] &\Downarrow \qquad \SRW_\Theta(W_t;\mathcal D) \\[2mm] &\Downarrow \qquad (W_t,G_t,\widehat Q_t,M_t,B_t) \\[2mm] &\xrightarrow{\text{goal and value use}} (A_t,R_t) \\[2mm] &\xrightarrow{\text{causal repair}} e_t\leq e_{\max} \\[2mm] &\Downarrow \qquad \Workspace = [\mathfrak R]_{\text{gauge}+\text{causal equivalence}}. \end{aligned} }
\mathrm{dyn}Use in source · 1 passage
Search aliases: dyn mathrm
Use in source · 08-causal-efficacy-and-reentry.tex, line 378
The resulting certification report is C_dyn(W_t) =( · δ_align^ I, {Δ_A^ℓ}_A⊆ V, k_ε, Δ_tr( Q), · η_causal^ν, Δ_specific(r), η_rec(τ), η_loop(τ) ). No single coordinate certifies a relational workspace.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal C_{\mathrm{dyn}}(W_t) =\bigl(& \delta_{\mathrm{align}}^{\mathcal I}, \{\Delta_A^\ell\}_{A\subseteq V}, k_\varepsilon, \boldsymbol\Delta_{\mathrm{tr}}(\mathcal Q),\\ &\eta_{\mathrm{causal}}^\nu, \Delta_{\mathrm{specific}}(r), \eta_{\mathrm{rec}}(\tau), \eta_{\mathrm{loop}}(\tau) \bigr). \end{aligned} }
\mathbf EUse in source · 3 passages
Search aliases: E mathbf
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 326
The complete formation signature is E_form(W) = ( e_V,e_E,e_H,e_P,e_ O,e_B; δ^scaf, δ^leak ), where every e_q is reported as the pair e_q = ( e_q^MDL, e_q^causal ). No scalar average is permitted to hide a zero history contribution for one of the structures claimed to have been discovered.
Exact mathematical passage
\boxed{ \mathbf E_{\mathrm{form}}(W) = \left( e_V,e_E,e_H,e_P,e_{\mathcal O},e_B; \delta^{\mathrm{scaf}}, \delta^{\mathrm{leak}} \right), }
e^{-(b-a)t/2}Use in source · 1 passage
Search aliases: e^-(b-a)t/2
Use in source · 04-approximate-workspaces.tex, line 424
On ran P and ranwidetilde Q, set A_P=PAP|_ran P, B_Q=widetilde QBwidetilde Q|_ranwidetilde Q. The operator X=Pwidetilde Q satisfies the Sylvester equation A_PX-XB_Q=-PEwidetilde Q. Let μ=(a+b)/2. Since e^t(A_P-μ I) ≤ e^-(b-a)t/2, e^-t(B_Q-μ I) ≤ e^-(b-a)t/2, the inverse Sylvester operator has the convergent integral representation X = ∫_0^∞ e^t(A_P-μ I) (PEwidetilde Q) e^-t(B_Q-μ I) dd t. Taking norms and integrating gives the result.
Exact mathematical passage
\|e^{t(A_P-\mu I)}\|\leq e^{-(b-a)t/2}, \qquad \|e^{-t(B_Q-\mu I)}\|\leq e^{-(b-a)t/2},
e^{-t(B_Q-\mu I)}Use in source · 2 passages
Search aliases: e^-t(B_Q-μ I) mu
Use in source · 04-approximate-workspaces.tex, line 424
On ran P and ranwidetilde Q, set A_P=PAP|_ran P, B_Q=widetilde QBwidetilde Q|_ranwidetilde Q. The operator X=Pwidetilde Q satisfies the Sylvester equation A_PX-XB_Q=-PEwidetilde Q. Let μ=(a+b)/2. Since e^t(A_P-μ I) ≤ e^-(b-a)t/2, e^-t(B_Q-μ I) ≤ e^-(b-a)t/2, the inverse Sylvester operator has the convergent integral representation X = ∫_0^∞ e^t(A_P-μ I) (PEwidetilde Q) e^-t(B_Q-μ I) dd t. Taking norms and integrating gives the result.
Exact mathematical passage
\|e^{t(A_P-\mu I)}\|\leq e^{-(b-a)t/2}, \qquad \|e^{-t(B_Q-\mu I)}\|\leq e^{-(b-a)t/2},
e^{t(A_P-\mu I)}Use in source · 2 passages
Search aliases: e^t(A_P-μ I) mu
Use in source · 04-approximate-workspaces.tex, line 424
On ran P and ranwidetilde Q, set A_P=PAP|_ran P, B_Q=widetilde QBwidetilde Q|_ranwidetilde Q. The operator X=Pwidetilde Q satisfies the Sylvester equation A_PX-XB_Q=-PEwidetilde Q. Let μ=(a+b)/2. Since e^t(A_P-μ I) ≤ e^-(b-a)t/2, e^-t(B_Q-μ I) ≤ e^-(b-a)t/2, the inverse Sylvester operator has the convergent integral representation X = ∫_0^∞ e^t(A_P-μ I) (PEwidetilde Q) e^-t(B_Q-μ I) dd t. Taking norms and integrating gives the result.
Exact mathematical passage
\|e^{t(A_P-\mu I)}\|\leq e^{-(b-a)t/2}, \qquad \|e^{-t(B_Q-\mu I)}\|\leq e^{-(b-a)t/2},
e_{\mathcal O}Use in source · 2 passages
Search aliases: e_ O mathcal
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 326
The complete formation signature is E_form(W) = ( e_V,e_E,e_H,e_P,e_ O,e_B; δ^scaf, δ^leak ), where every e_q is reported as the pair e_q = ( e_q^MDL, e_q^causal ). No scalar average is permitted to hide a zero history contribution for one of the structures claimed to have been discovered.
Exact mathematical passage
\boxed{ \mathbf E_{\mathrm{form}}(W) = \left( e_V,e_E,e_H,e_P,e_{\mathcal O},e_B; \delta^{\mathrm{scaf}}, \delta^{\mathrm{leak}} \right), }
\mathcal E_{\mathcal U}^{\mathrm{tot}}Use in source · 2 passages
Search aliases: E_ U^tot mathcal mathcal mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 592
[0.2em] sqrtλ_ov S_ U , L_ U^tot = K_ U^*K_ U. Its energy is E_ U^tot(u) = · ∑_α D_G_αu_α ^2 · + λ_ov ∑_α<β ρ^G_β_G_αβu_β - ρ^G_α_G_αβu_α ^2.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal E_{\mathcal U}^{\mathrm{tot}}(u) ={}& \sum_\alpha\|D_{G_\alpha}u_\alpha\|^2\\ &+ \lambda_{\mathrm{ov}} \sum_{\alpha<\beta} \left\| \rho^{G_\beta}_{G_{\alpha\beta}}u_\beta - \rho^{G_\alpha}_{G_{\alpha\beta}}u_\alpha \right\|^2. \end{aligned} }
e_0Use in source · 7 passages
Search aliases: e_0
Use in source · 10-persistence.tex, line 210
[Nonautonomous persistence theorem] Let e_t≥0 satisfy e_t+1≤α_te_t+σ_t, α_t,σ_t≥0. Then, for every t≥1, e_t ≤ · (∏_r=0^t-1α_r)e_0 · + ∑_j=0^t-1 (∏_r=j+1^t-1α_r)σ_j, where an empty product equals one. If α_t≤barα<1, σ_t≤barσ, then e_t ≤ barα^te_0 + fracbarσ(1-barα^t)1-barα, and consequently limsup_t→∞e_t ≤ fracbarσ1-barα.
Exact mathematical passage
\boxed{ \begin{aligned} e_t \leq &\left(\prod_{r=0}^{t-1}\alpha_r\right)e_0\\ &+ \sum_{j=0}^{t-1} \left(\prod_{r=j+1}^{t-1}\alpha_r\right)\sigma_j, \end{aligned} }
e_0^2Use in source · 1 passage
Search aliases: e_0^2
Use in source · 10-persistence.tex, line 298
[Mean-square persistence] Suppose E[e_t+1^2mid F_t] ≤ q e_t^2+v_t, 0≤ q<1, and E[v_t]≤bar v. Then E[e_t^2] ≤ q^t E[e_0^2] + fracbar v(1-q^t)1-q, so limsup_t→∞ E[e_t^2] ≤ fracbar v1-q.
Exact mathematical passage
\boxed{ \mathbb E[e_t^2] \leq q^t\mathbb E[e_0^2] + \frac{\bar v(1-q^t)}{1-q}, }
E_1Use in source · 3 passages
Search aliases: E_1
Use in source · 11-reconstruction-and-resilience.tex, line 407
Let C_*= R^2 and define scalar node encodings E_1(c_1,c_2)=c_1, E_2(c_1,c_2)=c_2, E_3(c_1,c_2)=c_1+c_2. Every singleton has rank one, so no node reconstructs the two-dimensional core. Every pair does reconstruct. For S={1,2}, F_S=I, α_S=1. For S={1,3} or S={2,3}, the frame eigenvalues are frac3±sqrt52. Therefore m_rec=2, k_erase=1, d_er=2, α^(1)=frac3-sqrt52. This realizes a workspace core that is irreducible to any singleton while remaining reconstructible after any one node fails.
Exact mathematical passage
E_1(c_1,c_2)=c_1, \qquad E_2(c_1,c_2)=c_2, \qquad E_3(c_1,c_2)=c_1+c_2.
e_1Use in source · 10 passages
Search aliases: e_1
Use in source · 02-static-core-transfer-theory.tex, line 23
The directed path category is C=Path(G). Its objects are vertices. A path γ=e_m⋯ e_2e_1 means that e_1 is traversed first. Composition is concatenation, and the empty path at i is denoted 1_i.
Exact mathematical passage
\gamma=e_m\cdots e_2e_1
E_2Use in source · 3 passages
Search aliases: E_2
Use in source · 11-reconstruction-and-resilience.tex, line 407
Let C_*= R^2 and define scalar node encodings E_1(c_1,c_2)=c_1, E_2(c_1,c_2)=c_2, E_3(c_1,c_2)=c_1+c_2. Every singleton has rank one, so no node reconstructs the two-dimensional core. Every pair does reconstruct. For S={1,2}, F_S=I, α_S=1. For S={1,3} or S={2,3}, the frame eigenvalues are frac3±sqrt52. Therefore m_rec=2, k_erase=1, d_er=2, α^(1)=frac3-sqrt52. This realizes a workspace core that is irreducible to any singleton while remaining reconstructible after any one node fails.
Exact mathematical passage
E_1(c_1,c_2)=c_1, \qquad E_2(c_1,c_2)=c_2, \qquad E_3(c_1,c_2)=c_1+c_2.
e_2Use in source · 3 passages
Search aliases: e_2
Use in source · 02-static-core-transfer-theory.tex, line 23
The directed path category is C=Path(G). Its objects are vertices. A path γ=e_m⋯ e_2e_1 means that e_1 is traversed first. Composition is concatenation, and the empty path at i is denoted 1_i.
Exact mathematical passage
\gamma=e_m\cdots e_2e_1
E_3Use in source · 3 passages
Search aliases: E_3
Use in source · 11-reconstruction-and-resilience.tex, line 407
Let C_*= R^2 and define scalar node encodings E_1(c_1,c_2)=c_1, E_2(c_1,c_2)=c_2, E_3(c_1,c_2)=c_1+c_2. Every singleton has rank one, so no node reconstructs the two-dimensional core. Every pair does reconstruct. For S={1,2}, F_S=I, α_S=1. For S={1,3} or S={2,3}, the frame eigenvalues are frac3±sqrt52. Therefore m_rec=2, k_erase=1, d_er=2, α^(1)=frac3-sqrt52. This realizes a workspace core that is irreducible to any singleton while remaining reconstructible after any one node fails.
Exact mathematical passage
E_1(c_1,c_2)=c_1, \qquad E_2(c_1,c_2)=c_2, \qquad E_3(c_1,c_2)=c_1+c_2.
E_AUse in source · 1 passage
Search aliases: E_A
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 497
p=open proof or implementation obligations, · v=verification and regression status. Define local encodings E_Hc=(g,d), E_Mc=(g,p), E_Xc=(p,v), E_Ac=(d,v). Each coordinate is represented at exactly two nodes, and the incidence pattern forms a four-cycle.
Exact mathematical passage
E_Hc=(g,d), \qquad E_Mc=(g,p), \qquad E_Xc=(p,v), \qquad E_Ac=(d,v).
\mathbb E_{a\sim\widehat\pi}Use in source · 2 passages
Search aliases: E_a∼widehatπ mathbb sim widehat pi
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 520
gintheorem[Approximate counterfactual policy selection] Let A be a finite feasible action set. Let Q: A→ R be the true interventional value and let widehat Q satisfy sup_a∈ A|widehat Q(a)-Q(a)|≤ε_Q. Suppose a policy widehatπ is δ_opt-optimal for widehat Q: max_π E_a∼π[widehat Q(a)] - E_a∼widehatπ[widehat Q(a)] ≤ δ_opt. Then, for every true-value-optimal policy π^*, E_a∼π^*[Q(a)] - E_a∼widehatπ[Q(a)] ≤ 2ε_Q+δ_opt. For a deterministic greedy action widehat a∈argmax_awidehat Q(a), Q(a^*)-Q(widehat …
Exact mathematical passage
\max_{\pi} \mathbb E_{a\sim\pi}[\widehat Q(a)] - \mathbb E_{a\sim\widehat\pi}[\widehat Q(a)] \leq \delta_{\mathrm{opt}}.
\mathbb E_{a\sim\pi}Use in source · 2 passages
Search aliases: E_a∼π mathbb sim pi
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 520
gintheorem[Approximate counterfactual policy selection] Let A be a finite feasible action set. Let Q: A→ R be the true interventional value and let widehat Q satisfy sup_a∈ A|widehat Q(a)-Q(a)|≤ε_Q. Suppose a policy widehatπ is δ_opt-optimal for widehat Q: max_π E_a∼π[widehat Q(a)] - E_a∼widehatπ[widehat Q(a)] ≤ δ_opt. Then, for every true-value-optimal policy π^*, E_a∼π^*[Q(a)] - E_a∼widehatπ[Q(a)] ≤ 2ε_Q+δ_opt. For a deterministic greedy action widehat a∈argmax_awidehat Q(a), Q(a^*)-Q(widehat …
Exact mathematical passage
\max_{\pi} \mathbb E_{a\sim\pi}[\widehat Q(a)] - \mathbb E_{a\sim\widehat\pi}[\widehat Q(a)] \leq \delta_{\mathrm{opt}}.
\mathbb E_{a\sim\pi^*}Use in source · 1 passage
Search aliases: E_a∼π^* mathbb sim pi
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 529
the true interventional value and let widehat Q satisfy sup_a∈ A|widehat Q(a)-Q(a)|≤ε_Q. Suppose a policy widehatπ is δ_opt-optimal for widehat Q: max_π E_a∼π[widehat Q(a)] - E_a∼widehatπ[widehat Q(a)] ≤ δ_opt. Then, for every true-value-optimal policy π^*, E_a∼π^*[Q(a)] - E_a∼widehatπ[Q(a)] ≤ 2ε_Q+δ_opt. For a deterministic greedy action widehat a∈argmax_awidehat Q(a), Q(a^*)-Q(widehat a) ≤2ε_Q. If the true optimal action a^* is unique and its value gap Δ_Q = Q(a^*)- max_a≠ a^*Q(a) satisfies Δ_…
Exact mathematical passage
\boxed{ \mathbb E_{a\sim\pi^*}[Q(a)] - \mathbb E_{a\sim\widehat\pi}[Q(a)] \leq 2\varepsilon_Q+\delta_{\mathrm{opt}}. }
e_BUse in source · 2 passages
Search aliases: e_B
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 326
The complete formation signature is E_form(W) = ( e_V,e_E,e_H,e_P,e_ O,e_B; δ^scaf, δ^leak ), where every e_q is reported as the pair e_q = ( e_q^MDL, e_q^causal ). No scalar average is permitted to hide a zero history contribution for one of the structures claimed to have been discovered.
Exact mathematical passage
\boxed{ \mathbf E_{\mathrm{form}}(W) = \left( e_V,e_E,e_H,e_P,e_{\mathcal O},e_B; \delta^{\mathrm{scaf}}, \delta^{\mathrm{leak}} \right), }
e_B^{\mathrm{causal}}Use in source · 1 passage
Search aliases: e_B^causal mathrm
Use in source · 15-boundary-formation-and-stability.tex, line 322
A boundary widehat S is certified as endogenously formed only if: item the membership mask was not directly encoded in Σ_B or Σ_Y; item e_B^MDL and e_B^causal exceed declared thresholds; item held-out recovery satisfies Theorem~[source reference]; item the boundary remains stable under admissible environment drift or its changes are predicted by score-margin closure; item matched history-shuffle and label-leakage controls fail to reproduce the result, as do full-system, empty-set, singleton, and…
Exact mathematical passage
e_B^{\mathrm{causal}}
e_B^{\mathrm{MDL}}Use in source · 1 passage
Search aliases: e_B^MDL mathrm
Use in source · 15-boundary-formation-and-stability.tex, line 322
A boundary widehat S is certified as endogenously formed only if: item the membership mask was not directly encoded in Σ_B or Σ_Y; item e_B^MDL and e_B^causal exceed declared thresholds; item held-out recovery satisfies Theorem~[source reference]; item the boundary remains stable under admissible environment drift or its changes are predicted by score-margin closure; item matched history-shuffle and label-leakage controls fail to reproduce the result, as do full-system, empty-set, singleton, and…
Exact mathematical passage
e_B^{\mathrm{MDL}}
E_CUse in source · 3 passages
Search aliases: E_C
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 247
f · =falsification-status coordinate. The accessible encodings are E_P= 1 · 0 · 0 0 · 1 · 0 , E_C= 0 · 1 · 0 0 · 0 · 1 , E_N= 1 · 0 · 0 0 · 0 · 1 . The semantics are stylized. The point is not that real researchers contain only two numbers. The point is to exhibit, without metaphor, a system in which no participant or artifact contains the entire operative state while the coupled system does.
Exact mathematical passage
E_P= \begin{pmatrix} 1&0&0\\ 0&1&0 \end{pmatrix}, \quad E_C= \begin{pmatrix} 0&1&0\\ 0&0&1 \end{pmatrix}, \quad E_N= \begin{pmatrix} 1&0&0\\ 0&0&1 \end{pmatrix}.
E_C^*Use in source · 1 passage
Search aliases: E_C^*
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 327
The full frame operator is F_PCN=E_P^*E_P+E_C^*E_C+E_N^*E_N=2I_3. For every two-node coalition S, λ_min(F_S)=1. Thus every two-node coalition reconstructs the complete core and, for noisy observations y_S=A_Sc+η_S, widehat c-c ≤ η_S . No individual node reconstructs c, because rank(E_P) = rank(E_C) = rank(E_N) =2<3. The realization is therefore simultaneously: individually incomplete and robust to any one-node loss.
Exact mathematical passage
F_{PCN}=E_P^*E_P+E_C^*E_C+E_N^*E_N=2I_3.
\mathcal E_{\mathrm{cert}}Use in source · 1 passage
Search aliases: E_cert mathcal mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 171
cal D = D_form sqcup D_cal sqcup D_cert. The formation sample selects widehatθ. The calibration sample fixes thresholds, regularization strengths, and intervention magnitudes. The certification sample evaluates the final gates without further structural selection. In a multi-environment study, the stronger requirement is E_form ∩ E_cert = ∅, so that the learned organization is tested under environments not used to construct it.
Exact mathematical passage
\mathcal E_{\mathrm{form}} \cap \mathcal E_{\mathrm{cert}} = \varnothing,
e_EUse in source · 2 passages
Search aliases: e_E
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 326
The complete formation signature is E_form(W) = ( e_V,e_E,e_H,e_P,e_ O,e_B; δ^scaf, δ^leak ), where every e_q is reported as the pair e_q = ( e_q^MDL, e_q^causal ). No scalar average is permitted to hide a zero history contribution for one of the structures claimed to have been discovered.
Exact mathematical passage
\boxed{ \mathbf E_{\mathrm{form}}(W) = \left( e_V,e_E,e_H,e_P,e_{\mathcal O},e_B; \delta^{\mathrm{scaf}}, \delta^{\mathrm{leak}} \right), }
\mathbf E_{\mathrm{form}}Use in source · 3 passages
Search aliases: E_form mathbf mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 326
The complete formation signature is E_form(W) = ( e_V,e_E,e_H,e_P,e_ O,e_B; δ^scaf, δ^leak ), where every e_q is reported as the pair e_q = ( e_q^MDL, e_q^causal ). No scalar average is permitted to hide a zero history contribution for one of the structures claimed to have been discovered.
Exact mathematical passage
\boxed{ \mathbf E_{\mathrm{form}}(W) = \left( e_V,e_E,e_H,e_P,e_{\mathcal O},e_B; \delta^{\mathrm{scaf}}, \delta^{\mathrm{leak}} \right), }
\mathcal E_{\mathrm{form}}Use in source · 1 passage
Search aliases: E_form mathcal mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 171
cal D = D_form sqcup D_cal sqcup D_cert. The formation sample selects widehatθ. The calibration sample fixes thresholds, regularization strengths, and intervention magnitudes. The certification sample evaluates the final gates without further structural selection. In a multi-environment study, the stronger requirement is E_form ∩ E_cert = ∅, so that the learned organization is tested under environments not used to construct it.
Exact mathematical passage
\mathcal E_{\mathrm{form}} \cap \mathcal E_{\mathrm{cert}} = \varnothing,
E_HUse in source · 1 passage
Search aliases: E_H
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 497
p=open proof or implementation obligations, · v=verification and regression status. Define local encodings E_Hc=(g,d), E_Mc=(g,p), E_Xc=(p,v), E_Ac=(d,v). Each coordinate is represented at exactly two nodes, and the incidence pattern forms a four-cycle.
Exact mathematical passage
E_Hc=(g,d), \qquad E_Mc=(g,p), \qquad E_Xc=(p,v), \qquad E_Ac=(d,v).
e_HUse in source · 2 passages
Search aliases: e_H
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 326
The complete formation signature is E_form(W) = ( e_V,e_E,e_H,e_P,e_ O,e_B; δ^scaf, δ^leak ), where every e_q is reported as the pair e_q = ( e_q^MDL, e_q^causal ). No scalar average is permitted to hide a zero history contribution for one of the structures claimed to have been discovered.
Exact mathematical passage
\boxed{ \mathbf E_{\mathrm{form}}(W) = \left( e_V,e_E,e_H,e_P,e_{\mathcal O},e_B; \delta^{\mathrm{scaf}}, \delta^{\mathrm{leak}} \right), }
\mathcal E_{H^g}Use in source · 2 passages
Search aliases: E_H^g mathcal
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 137
For a general invertible gauge, define m_V=σ_min(G_V), M_V= G_V , m_E=σ_min(G_E), M_E= G_E . The covariance identity yields m_E^2 E_H(c) ≤ E_H^g(G_Vc) ≤ M_E^2 E_H(c), and m_V^2 c ^2 ≤ G_Vc ^2 ≤ M_V^2 c ^2. Therefore the Rayleigh quotients obey fracm_E^2M_V^2 frac E_H(c) c ^2 ≤ frac E_H^g(G_Vc) G_Vc ^2 ≤ fracM_E^2m_V^2 frac E_H(c) c ^2. By the min--max principle, fracm_E^2M_V^2λ_k(L_H) ≤ λ_k(L_H^g) ≤ fracM_E^2m_V^2λ_k(L_H). Exact zero modes are unchanged, but fixed-metric approximate eigenvalues …
Exact mathematical passage
m_E^2\mathcal E_H(c) \leq \mathcal E_{H^g}(G_Vc) \leq M_E^2\mathcal E_H(c),
E_iUse in source · 11 passages
Search aliases: E_i
Use in source · 11-reconstruction-and-resilience.tex, line 26
nsional abstract core. The exact static theory provides a complete local chart overline E_i = ev_i∘Ψ:C_*⟶ C_i, where Ψ:C_*→Γ(H) is the root-to-section isomorphism. A participant or artifact need not expose that complete chart. Let O_i:C_i⟶ Y_i be the declared observation or access map and define the accessible encoding E_i=O_ioverline E_i:C_*⟶ Y_i. For notational economy, the direct sums below use the accessible spaces Y_i. Thus injectivity of a full structural chart does not make a singleton op…
Exact mathematical passage
\boxed{ E_i=O_i\overline E_i:C_*\longrightarrow\mathsf Y_i. }
E_i^*Use in source · 2 passages
Search aliases: E_i^*
Use in source · 11-reconstruction-and-resilience.tex, line 43
For a coalition S⊆ V, define the analysis operator A_S:C_*⟶⊕_i∈ S Y_i, A_Sc=(E_ic)_i∈ S, and the coalition frame operator F_S=A_S^*A_S=∑_i∈ SE_i^*E_i. Set α_S=λ_min(F_S), β_S=λ_max(F_S). Thus α_S c ^2 ≤ A_Sc ^2 ≤ β_S c ^2.
Exact mathematical passage
\boxed{ F_S=A_S^*A_S=\sum_{i\in S}E_i^*E_i. }
E_jUse in source · 1 passage
Search aliases: E_j
Use in source · 23-relation-to-prior-work.tex, line 285
Network consensus studies how local interactions drive distributed states toward agreement [source reference]. Agreement is not the same as a workspace. Consensus often removes heterogeneity by converging all nodes to a common value. Stratified relational workspaces preserve heterogeneous local representations and may require complementary disagreement: X_inot≅ X_j, E_i c≠ E_j c, (c_i)_i∈Γ(H). The global state is compatible, not necessarily copied. This distinction is central to the anti-replica…
Exact mathematical passage
X_i\not\cong X_j, \qquad E_i c\neq E_j c, \qquad (c_i)_i\in\Gamma(H).
\mathbb E_{\jmath,\jmath'\sim\mathcal I_{\perp}(r)}Use in source · 1 passage
Search aliases: E_jmath,jmath'∼ I_⊥(r) mathbb jmath jmath sim mathcal perp
Use in source · 08-causal-efficacy-and-reentry.tex, line 126
Define η_Workspace(r) = E_ι,ι'∼ I_Workspace(r) D ( P^ι(Y_t^+), P^ι'(Y_t^+) ), η_⊥(r) = E_jmath,jmath'∼ I_⊥(r) D ( P^jmath(Y_t^+), P^jmath'(Y_t^+) ), and Δ_specific(r) = η_Workspace(r)-η_⊥(r). A positive value supports causal concentration in the candidate workspace at the declared perturbation scale.
Exact mathematical passage
\eta_{\perp}(r) = \mathbb E_{\jmath,\jmath'\sim\mathcal I_{\perp}(r)} D\!\left( \mathbb P^{\jmath}(Y_t^+), \mathbb P^{\jmath'}(Y_t^+) \right),
E_MUse in source · 1 passage
Search aliases: E_M
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 497
p=open proof or implementation obligations, · v=verification and regression status. Define local encodings E_Hc=(g,d), E_Mc=(g,p), E_Xc=(p,v), E_Ac=(d,v). Each coordinate is represented at exactly two nodes, and the incidence pattern forms a four-cycle.
Exact mathematical passage
E_Hc=(g,d), \qquad E_Mc=(g,p), \qquad E_Xc=(p,v), \qquad E_Ac=(d,v).
e_mUse in source · 6 passages
Search aliases: e_m
Use in source · 02-static-core-transfer-theory.tex, line 23
The directed path category is C=Path(G). Its objects are vertices. A path γ=e_m⋯ e_2e_1 means that e_1 is traversed first. Composition is concatenation, and the empty path at i is denoted 1_i.
Exact mathematical passage
\gamma=e_m\cdots e_2e_1
e_{\max}Use in source · 10 passages
Search aliases: e_max max
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 684
t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To maintain a reserve ρ>0, define the maintenance deficit e_t =(ρ-v_t)_+. Define the zero-reserve and bounded-deficit viability sets V_Θ = { S:ϕ_j(S)≥0 for every j∈ J_maint } V_Θ,e_max = { S:e(S)≤ e_max } The first set requires every protected gate to pass. The second permits a declared finite reserve deficit.
Exact mathematical passage
\boxed{ \mathcal V_{\Theta,e_{\max}} = \left\{ S:e(S)\leq e_{\max} \right\} }
E_NUse in source · 3 passages
Search aliases: E_N
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 247
f · =falsification-status coordinate. The accessible encodings are E_P= 1 · 0 · 0 0 · 1 · 0 , E_C= 0 · 1 · 0 0 · 0 · 1 , E_N= 1 · 0 · 0 0 · 0 · 1 . The semantics are stylized. The point is not that real researchers contain only two numbers. The point is to exhibit, without metaphor, a system in which no participant or artifact contains the entire operative state while the coupled system does.
Exact mathematical passage
E_P= \begin{pmatrix} 1&0&0\\ 0&1&0 \end{pmatrix}, \quad E_C= \begin{pmatrix} 0&1&0\\ 0&0&1 \end{pmatrix}, \quad E_N= \begin{pmatrix} 1&0&0\\ 0&0&1 \end{pmatrix}.
E_N^*Use in source · 1 passage
Search aliases: E_N^*
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 327
The full frame operator is F_PCN=E_P^*E_P+E_C^*E_C+E_N^*E_N=2I_3. For every two-node coalition S, λ_min(F_S)=1. Thus every two-node coalition reconstructs the complete core and, for noisy observations y_S=A_Sc+η_S, widehat c-c ≤ η_S . No individual node reconstructs c, because rank(E_P) = rank(E_C) = rank(E_N) =2<3. The realization is therefore simultaneously: individually incomplete and robust to any one-node loss.
Exact mathematical passage
F_{PCN}=E_P^*E_P+E_C^*E_C+E_N^*E_N=2I_3.
\mathcal E_{\mathrm{ov}}Use in source · 1 passage
Search aliases: E_ov mathcal mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 182
A family w=(w_α)_α is exactly compatible when δ^0w=0. Its direct mismatch is m_ U(w)=δ^0w. After choosing inner products and positive overlap weights, the mismatch energy is E_ov(w) = δ^0w ^2 = ∑_α<β ν_αβ r_αβ^βw_β -r_αβ^αw_α ^2. This is the appropriate obstruction when the full local states are already given. Such a family glues exactly if and only if its mismatch vector itself vanishes. No cohomological quotient is needed for that direct question.
Exact mathematical passage
\boxed{ \mathcal E_{\mathrm{ov}}(w) = \|\delta^0w\|^2 = \sum_{\alpha<\beta} \nu_{\alpha\beta} \left\| r_{\alpha\beta}^{\beta}w_\beta -r_{\alpha\beta}^{\alpha}w_\alpha \right\|^2. }
E_PUse in source · 3 passages
Search aliases: E_P
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 247
f · =falsification-status coordinate. The accessible encodings are E_P= 1 · 0 · 0 0 · 1 · 0 , E_C= 0 · 1 · 0 0 · 0 · 1 , E_N= 1 · 0 · 0 0 · 0 · 1 . The semantics are stylized. The point is not that real researchers contain only two numbers. The point is to exhibit, without metaphor, a system in which no participant or artifact contains the entire operative state while the coupled system does.
Exact mathematical passage
E_P= \begin{pmatrix} 1&0&0\\ 0&1&0 \end{pmatrix}, \quad E_C= \begin{pmatrix} 0&1&0\\ 0&0&1 \end{pmatrix}, \quad E_N= \begin{pmatrix} 1&0&0\\ 0&0&1 \end{pmatrix}.
e_PUse in source · 2 passages
Search aliases: e_P
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 326
The complete formation signature is E_form(W) = ( e_V,e_E,e_H,e_P,e_ O,e_B; δ^scaf, δ^leak ), where every e_q is reported as the pair e_q = ( e_q^MDL, e_q^causal ). No scalar average is permitted to hide a zero history contribution for one of the structures claimed to have been discovered.
Exact mathematical passage
\boxed{ \mathbf E_{\mathrm{form}}(W) = \left( e_V,e_E,e_H,e_P,e_{\mathcal O},e_B; \delta^{\mathrm{scaf}}, \delta^{\mathrm{leak}} \right), }
E_{P'}Use in source · 1 passage
Search aliases: E_P'
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 424
Suppose the proposer becomes unavailable. The remaining coalition {C,N} reconstructs (q,p,f) exactly. A replacement proposer P' can therefore be initialized by E_P'c=(q,p). If P' uses a different local coordinate system J_P'∈ GL(2), then the incoming and outgoing overlap maps are conjugated accordingly. The global section and all downstream kernels remain unchanged. This is exact replacement invariance, not literal carrier identity.
Exact mathematical passage
E_{P'}c=(q,p).
E_P^*Use in source · 1 passage
Search aliases: E_P^*
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 327
The full frame operator is F_PCN=E_P^*E_P+E_C^*E_C+E_N^*E_N=2I_3. For every two-node coalition S, λ_min(F_S)=1. Thus every two-node coalition reconstructs the complete core and, for noisy observations y_S=A_Sc+η_S, widehat c-c ≤ η_S . No individual node reconstructs c, because rank(E_P) = rank(E_C) = rank(E_N) =2<3. The realization is therefore simultaneously: individually incomplete and robust to any one-node loss.
Exact mathematical passage
F_{PCN}=E_P^*E_P+E_C^*E_C+E_N^*E_N=2I_3.
e_qUse in source · 3 passages
Search aliases: e_q
Use in source · 03-exact-shared-cores.tex, line 141
[Finite obstruction set] Let e_1,…,e_r be the non-tree edges of a connected finite graph. Then C_* = ⋂_q=1^r ker(H_γ_e_q-I).
Exact mathematical passage
C_* = \bigcap_{q=1}^{r} \ker(H_{\gamma_{e_q}}-I).
e_rUse in source · 5 passages
Search aliases: e_r
Use in source · 02-static-core-transfer-theory.tex, line 241
For a single edge, V_e=0 means T_e(c,0)=(H_ec,0), so core states remain in the core. Inductively, if the first r transfers map c to (H_e_r⋯ H_e_1c,0), applying T_e_r+1 gives (H_e_r+1H_e_r⋯ H_e_1c,0). The conclusion follows after m steps.
Exact mathematical passage
(H_{e_r}\cdots H_{e_1}c,0)
E_{r'}'Use in source · 3 passages
Search aliases: E_r''
Use in source · 11-reconstruction-and-resilience.tex, line 345
Suppose node r is removed and the surviving coalition is S=V∖{r}. A replacement node r' is to receive the encoding E_r'':C_*→ Y_r''.
Exact mathematical passage
E_{r'}':C_*\to\mathsf Y_{r'}'.
e_{r+1}Use in source · 2 passages
Search aliases: e_r+1
Use in source · 02-static-core-transfer-theory.tex, line 241
For a single edge, V_e=0 means T_e(c,0)=(H_ec,0), so core states remain in the core. Inductively, if the first r transfers map c to (H_e_r⋯ H_e_1c,0), applying T_e_r+1 gives (H_e_r+1H_e_r⋯ H_e_1c,0). The conclusion follows after m steps.
Exact mathematical passage
T_{e_{r+1}}
e_tUse in source · 41 passages
Search aliases: e_t
Use in source · 10-persistence.tex, line 136
Let the realized vertex state satisfy x_t+1=F_tx_t+ξ_t, where F_t: C_V(t)→ C_V(t+1) is the actual update and ξ_t is an unmodeled disturbance. Define the off-workspace error e_t= (I-P_t)x_t . Introduce α_t = (I-P_t+1)F_t(I-P_t) , which measures persistence of prior off-workspace error, and ℓ_t = (I-P_t+1)F_tP_t , which measures leakage of a valid workspace state under the update.
Exact mathematical passage
\boxed{ e_t=\|(I-P_t)x_t\|. }
E_{t+1}Use in source · 1 passage
Search aliases: E_t+1
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 77
C_t^ctl = ( W_t,G_t,M_t,B_t,E_t ), where G_t is the represented goal, M_t is a workspace-integrity monitor, B_t is the current boundary or routing state, and E_t is the declared external context. An action is generated by A_t ∼ π_t ( ·mid W_t,G_t,M_t,B_t,E_t ). The future controlled state obeys a time-unrolled structural model S_t+1 = F_t(S_t,A_t,E_t+1,ξ_t+1), W_t+1=ω_t+1(S_t+1). The intervention semantics are inherited from Part~VII. A symbol such as do(A_t=a) is meaningful only when an impleme…
Exact mathematical passage
S_{t+1} = F_t(S_t,A_t,E_{t+1},\xi_{t+1}), \qquad W_{t+1}=\omega_{t+1}(S_{t+1}).
e_{t+1}Use in source · 13 passages
Search aliases: e_t+1
Use in source · 10-persistence.tex, line 161
[Grounded coherence recurrence] Every trajectory satisfies e_t+1≤α_te_t+σ_t, where σ_t = ℓ_t P_tx_t + (I-P_t+1)ξ_t .
Exact mathematical passage
\boxed{ e_{t+1}\leq\alpha_te_t+\sigma_t,}
E_{t+1:t+\tau}Use in source · 1 passage
Search aliases: E_t+1:t+τ tau
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 243
The observational condition I(G_t+τ;G_tmid E_t+1:t+τ)>0 can arise from several non-agentic mechanisms: item a persistent external command writes the same code at every step; item a clock, episode label, or task identifier drives both variables; item a frozen memory cell repeats a symbol that is not used by the policy; item selection on successful trajectories induces apparent temporal dependence; or item a downstream action is copied back into the nominal goal channel. A goal-persistence claim t…
Exact mathematical passage
I(G_{t+\tau};G_t\mid E_{t+1:t+\tau})>0
e_{t+1}^{(0)}Use in source · 8 passages
Search aliases: e_t+1^(0)
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 878
[Causal repair stabilizes maintenance deficit] Let e_t≥0 be the maintenance deficit. Suppose the matched no-repair trajectory satisfies e_t+1^(0) ≤ α e_t+d_t, where d_t≥0 is exogenous damage. Suppose the implemented repair policy has the causal one-step effect e_t+1^(0)-e_t+1 ≥ κ e_t-ϵ_t. Assume 0≤β:=α-κ<1, 0≤ d_t≤overline d, 0≤ϵ_t≤overlineϵ. Then e_t ≤ β^te_0 + frac(overline d+overlineϵ)(1-β^t)1-β, and therefore limsup_t→∞e_t ≤ fracoverline d+overlineϵ1-β. If the admissible deficit is e_max and…
Exact mathematical passage
e_{t+1}^{(0)} \leq \alpha e_t+d_t,
e_{t+1}^2Use in source · 1 passage
Search aliases: e_t+1^2
Use in source · 10-persistence.tex, line 290
[Mean-square persistence] Suppose E[e_t+1^2mid F_t] ≤ q e_t^2+v_t, 0≤ q<1, and E[v_t]≤bar v. Then E[e_t^2] ≤ q^t E[e_0^2] + fracbar v(1-q^t)1-q, so limsup_t→∞ E[e_t^2] ≤ fracbar v1-q.
Exact mathematical passage
\mathbb E[e_{t+1}^2\mid\mathcal F_t] \leq q e_t^2+v_t, \qquad 0\leq q<1,
e_t^2Use in source · 3 passages
Search aliases: e_t^2
Use in source · 10-persistence.tex, line 290
[Mean-square persistence] Suppose E[e_t+1^2mid F_t] ≤ q e_t^2+v_t, 0≤ q<1, and E[v_t]≤bar v. Then E[e_t^2] ≤ q^t E[e_0^2] + fracbar v(1-q^t)1-q, so limsup_t→∞ E[e_t^2] ≤ fracbar v1-q.
Exact mathematical passage
\mathbb E[e_{t+1}^2\mid\mathcal F_t] \leq q e_t^2+v_t, \qquad 0\leq q<1,
\mathbb E_{u,u'\sim\nu_{\bar S}}Use in source · 1 passage
Search aliases: E_u,u'∼ν_bar S mathbb sim nu bar
Use in source · 15-boundary-formation-and-stability.tex, line 95
nate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general. A useful workspace may receive substantial external input. The boundary object…
Exact mathematical passage
\boxed{ \CIn_\tau(S) = \mathbb E_{u,u'\sim\nu_{\bar S}} D\!\left( \mathcal L^{\iota_{\bar S,u}} (X_S(t+\tau)), \mathcal L^{\iota_{\bar S,u'}} (X_S(t+\tau)) \right). }
E_{\mathrm{und}}Use in source · 1 passage
Search aliases: E_und mathrm
Use in source · 03-exact-shared-cores.tex, line 156
The number of independent graph cycles is r=|E_und|-|V|+1 for a connected underlying graph, after treating parallel edges with their multiplicity.
Exact mathematical passage
r=|E_{\mathrm{und}}|-|V|+1
e_VUse in source · 2 passages
Search aliases: e_V
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 326
The complete formation signature is E_form(W) = ( e_V,e_E,e_H,e_P,e_ O,e_B; δ^scaf, δ^leak ), where every e_q is reported as the pair e_q = ( e_q^MDL, e_q^causal ). No scalar average is permitted to hide a zero history contribution for one of the structures claimed to have been discovered.
Exact mathematical passage
\boxed{ \mathbf E_{\mathrm{form}}(W) = \left( e_V,e_E,e_H,e_P,e_{\mathcal O},e_B; \delta^{\mathrm{scaf}}, \delta^{\mathrm{leak}} \right), }
\mathbb E_{\widehat\pi}Use in source · 1 passage
Search aliases: E_widehatπ mathbb widehat pi
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 565
For every policy π, uniform approximation gives | E_a∼π[widehat Q(a)] - E_a∼π[Q(a)] | ≤ε_Q. Therefore E_π^*[Q] - E_widehatπ[Q] · ≤ E_π^*[widehat Q] - E_widehatπ[widehat Q] +2ε_Q · ≤ δ_opt+2ε_Q. The deterministic bound is the special case of point-mass policies. If widehat a≠ a^*, then widehat Q(a^*) ≥ Q(a^*)-ε_Q > Q(widehat a)+ε_Q ≥ widehat Q(widehat a), contradicting greedy optimality.
Exact mathematical passage
\begin{aligned} \mathbb E_{\pi^*}[Q] - \mathbb E_{\widehat\pi}[Q] &\leq \mathbb E_{\pi^*}[\widehat Q] - \mathbb E_{\widehat\pi}[\widehat Q] +2\varepsilon_Q\\ &\leq \delta_{\mathrm{opt}}+2\varepsilon_Q. \end{aligned}
E_XUse in source · 1 passage
Search aliases: E_X
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 497
p=open proof or implementation obligations, · v=verification and regression status. Define local encodings E_Hc=(g,d), E_Mc=(g,p), E_Xc=(p,v), E_Ac=(d,v). Each coordinate is represented at exactly two nodes, and the incidence pattern forms a four-cycle.
Exact mathematical passage
E_Hc=(g,d), \qquad E_Mc=(g,p), \qquad E_Xc=(p,v), \qquad E_Ac=(d,v).
\mathbb E_{x,x'\sim\nu_S}Use in source · 1 passage
Search aliases: E_x,x'∼ν_S mathbb sim nu
Use in source · 15-boundary-formation-and-stability.tex, line 80
Let ι_S,x be a feasible intervention that changes the internal workspace coordinate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general.…
Exact mathematical passage
\boxed{ \COut_\tau(S) = \mathbb E_{x,x'\sim\nu_S} D\!\left( \mathcal L^{\iota_{S,x}} (X_{\bar S}(t+\tau)), \mathcal L^{\iota_{S,x'}} (X_{\bar S}(t+\tau)) \right). }
E_{\{1,2\}}Use in source · 1 passage
Search aliases: E_{1,2}
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 163
The positive examples use a recurring distributed code. Let c=(c_1,c_2,c_3)^ T∈ R^3 and define three local encodings E_1c=(c_1,c_2), E_2c=(c_2,c_3), E_3c=(c_1,c_3). Then ∑_i=1^3E_i^*E_i=2I_3. No individual encoding is injective, while every two-node coalition is injective. The pairwise frame operators are E_{1,2}^*E_{1,2} · =diag(1,2,1), E_{1,3}^*E_{1,3} · =diag(2,1,1), E_{2,3}^*E_{2,3} · =diag(1,1,2). Hence α_{i,j}=1 (i≠ j), and one-node erasure recovery is exact. Every nonzero core vector is v…
Exact mathematical passage
\begin{aligned} E_{\{1,2\}}^*E_{\{1,2\}}&=\operatorname{diag}(1,2,1),\\ E_{\{1,3\}}^*E_{\{1,3\}}&=\operatorname{diag}(2,1,1),\\ E_{\{2,3\}}^*E_{\{2,3\}}&=\operatorname{diag}(1,1,2). \end{aligned}
E_{\{1,2\}}^*Use in source · 1 passage
Search aliases: E_{1,2}^*
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 163
The positive examples use a recurring distributed code. Let c=(c_1,c_2,c_3)^ T∈ R^3 and define three local encodings E_1c=(c_1,c_2), E_2c=(c_2,c_3), E_3c=(c_1,c_3). Then ∑_i=1^3E_i^*E_i=2I_3. No individual encoding is injective, while every two-node coalition is injective. The pairwise frame operators are E_{1,2}^*E_{1,2} · =diag(1,2,1), E_{1,3}^*E_{1,3} · =diag(2,1,1), E_{2,3}^*E_{2,3} · =diag(1,1,2). Hence α_{i,j}=1 (i≠ j), and one-node erasure recovery is exact. Every nonzero core vector is v…
Exact mathematical passage
\begin{aligned} E_{\{1,2\}}^*E_{\{1,2\}}&=\operatorname{diag}(1,2,1),\\ E_{\{1,3\}}^*E_{\{1,3\}}&=\operatorname{diag}(2,1,1),\\ E_{\{2,3\}}^*E_{\{2,3\}}&=\operatorname{diag}(1,1,2). \end{aligned}
E_{\{1,3\}}Use in source · 1 passage
Search aliases: E_{1,3}
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 163
The positive examples use a recurring distributed code. Let c=(c_1,c_2,c_3)^ T∈ R^3 and define three local encodings E_1c=(c_1,c_2), E_2c=(c_2,c_3), E_3c=(c_1,c_3). Then ∑_i=1^3E_i^*E_i=2I_3. No individual encoding is injective, while every two-node coalition is injective. The pairwise frame operators are E_{1,2}^*E_{1,2} · =diag(1,2,1), E_{1,3}^*E_{1,3} · =diag(2,1,1), E_{2,3}^*E_{2,3} · =diag(1,1,2). Hence α_{i,j}=1 (i≠ j), and one-node erasure recovery is exact. Every nonzero core vector is v…
Exact mathematical passage
\begin{aligned} E_{\{1,2\}}^*E_{\{1,2\}}&=\operatorname{diag}(1,2,1),\\ E_{\{1,3\}}^*E_{\{1,3\}}&=\operatorname{diag}(2,1,1),\\ E_{\{2,3\}}^*E_{\{2,3\}}&=\operatorname{diag}(1,1,2). \end{aligned}
E_{\{1,3\}}^*Use in source · 1 passage
Search aliases: E_{1,3}^*
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 163
The positive examples use a recurring distributed code. Let c=(c_1,c_2,c_3)^ T∈ R^3 and define three local encodings E_1c=(c_1,c_2), E_2c=(c_2,c_3), E_3c=(c_1,c_3). Then ∑_i=1^3E_i^*E_i=2I_3. No individual encoding is injective, while every two-node coalition is injective. The pairwise frame operators are E_{1,2}^*E_{1,2} · =diag(1,2,1), E_{1,3}^*E_{1,3} · =diag(2,1,1), E_{2,3}^*E_{2,3} · =diag(1,1,2). Hence α_{i,j}=1 (i≠ j), and one-node erasure recovery is exact. Every nonzero core vector is v…
Exact mathematical passage
\begin{aligned} E_{\{1,2\}}^*E_{\{1,2\}}&=\operatorname{diag}(1,2,1),\\ E_{\{1,3\}}^*E_{\{1,3\}}&=\operatorname{diag}(2,1,1),\\ E_{\{2,3\}}^*E_{\{2,3\}}&=\operatorname{diag}(1,1,2). \end{aligned}
E_{\{2,3\}}Use in source · 1 passage
Search aliases: E_{2,3}
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 163
The positive examples use a recurring distributed code. Let c=(c_1,c_2,c_3)^ T∈ R^3 and define three local encodings E_1c=(c_1,c_2), E_2c=(c_2,c_3), E_3c=(c_1,c_3). Then ∑_i=1^3E_i^*E_i=2I_3. No individual encoding is injective, while every two-node coalition is injective. The pairwise frame operators are E_{1,2}^*E_{1,2} · =diag(1,2,1), E_{1,3}^*E_{1,3} · =diag(2,1,1), E_{2,3}^*E_{2,3} · =diag(1,1,2). Hence α_{i,j}=1 (i≠ j), and one-node erasure recovery is exact. Every nonzero core vector is v…
Exact mathematical passage
\begin{aligned} E_{\{1,2\}}^*E_{\{1,2\}}&=\operatorname{diag}(1,2,1),\\ E_{\{1,3\}}^*E_{\{1,3\}}&=\operatorname{diag}(2,1,1),\\ E_{\{2,3\}}^*E_{\{2,3\}}&=\operatorname{diag}(1,1,2). \end{aligned}
E_{\{2,3\}}^*Use in source · 1 passage
Search aliases: E_{2,3}^*
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 163
The positive examples use a recurring distributed code. Let c=(c_1,c_2,c_3)^ T∈ R^3 and define three local encodings E_1c=(c_1,c_2), E_2c=(c_2,c_3), E_3c=(c_1,c_3). Then ∑_i=1^3E_i^*E_i=2I_3. No individual encoding is injective, while every two-node coalition is injective. The pairwise frame operators are E_{1,2}^*E_{1,2} · =diag(1,2,1), E_{1,3}^*E_{1,3} · =diag(2,1,1), E_{2,3}^*E_{2,3} · =diag(1,1,2). Hence α_{i,j}=1 (i≠ j), and one-node erasure recovery is exact. Every nonzero core vector is v…
Exact mathematical passage
\begin{aligned} E_{\{1,2\}}^*E_{\{1,2\}}&=\operatorname{diag}(1,2,1),\\ E_{\{1,3\}}^*E_{\{1,3\}}&=\operatorname{diag}(2,1,1),\\ E_{\{2,3\}}^*E_{\{2,3\}}&=\operatorname{diag}(1,1,2). \end{aligned}
\mathbb E_{\iota,\iota'\sim\mathcal I_{\Workspace}(r)}Use in source · 1 passage
Search aliases: E_ι,ι'∼ I_Workspace(r) mathbb iota iota sim mathcal Workspace
Use in source · 08-causal-efficacy-and-reentry.tex, line 117
Define η_Workspace(r) = E_ι,ι'∼ I_Workspace(r) D ( P^ι(Y_t^+), P^ι'(Y_t^+) ), η_⊥(r) = E_jmath,jmath'∼ I_⊥(r) D ( P^jmath(Y_t^+), P^jmath'(Y_t^+) ), and Δ_specific(r) = η_Workspace(r)-η_⊥(r). A positive value supports causal concentration in the candidate workspace at the declared perturbation scale.
Exact mathematical passage
\eta_{\Workspace}(r) = \mathbb E_{\iota,\iota'\sim\mathcal I_{\Workspace}(r)} D\!\left( \mathbb P^{\iota}(Y_t^+), \mathbb P^{\iota'}(Y_t^+) \right),
\mathbb E_{\pi^*}Use in source · 1 passage
Search aliases: E_π^* mathbb pi
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 565
For every policy π, uniform approximation gives | E_a∼π[widehat Q(a)] - E_a∼π[Q(a)] | ≤ε_Q. Therefore E_π^*[Q] - E_widehatπ[Q] · ≤ E_π^*[widehat Q] - E_widehatπ[widehat Q] +2ε_Q · ≤ δ_opt+2ε_Q. The deterministic bound is the special case of point-mass policies. If widehat a≠ a^*, then widehat Q(a^*) ≥ Q(a^*)-ε_Q > Q(widehat a)+ε_Q ≥ widehat Q(widehat a), contradicting greedy optimality.
Exact mathematical passage
\begin{aligned} \mathbb E_{\pi^*}[Q] - \mathbb E_{\widehat\pi}[Q] &\leq \mathbb E_{\pi^*}[\widehat Q] - \mathbb E_{\widehat\pi}[\widehat Q] +2\varepsilon_Q\\ &\leq \delta_{\mathrm{opt}}+2\varepsilon_Q. \end{aligned}
\mathbb E_{\sigma,\sigma'\sim\pi}Use in source · 1 passage
Search aliases: E_σ,σ'∼π mathbb sigma sigma sim pi
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 309
For a family S of admissible scaffold variants, define the cross-scaffold identity defect δ_q^scaf = inf_{J_σσ'} E_σ,σ'∼π d_q ( J_σσ'q_σ,q_σ' ), where J_σσ' transports the learned object between admissible coordinate systems. A low value indicates that the same abstract organization is recovered under multiple non-solution-bearing scaffolds.
Exact mathematical passage
\boxed{ \delta_q^{\mathrm{scaf}} = \inf_{\{J_{\sigma\sigma'}\}} \mathbb E_{\sigma,\sigma'\sim\pi} d_q \left( J_{\sigma\sigma'}q_{\sigma},q_{\sigma'} \right), }
e_{\phi(q)}^{\mathrm{causal}}Use in source · 1 passage
Search aliases: e_ϕ(q)^causal phi mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 283
[Reparameterization invariance of causal provenance] Let ϕ be a measurable bijection on the range of q, and let the divergence D be invariant under measurable bijections. Then e_ϕ(q)^causal = e_q^causal.
Exact mathematical passage
e_{\phi(q)}^{\mathrm{causal}} = e_q^{\mathrm{causal}}.
e_\ellUse in source · 1 passage
Search aliases: e_ℓ ell
Use in source · 19-summary-of-main-results.tex, line 222
For a path γ=e_m⋯ e_1, Q_t(γ)T_γ P_s(γ) ≤ ∑_r=1^m · ( ∏_ℓ=r+1^m T_e_ℓ ) V_e_r · × ( ∏_ℓ=1^r-1 H_e_ℓ ). The same bound controls the defect between full core-to-core path transport and the pure core product. An exact Duhamel identity yields both estimates.
Exact mathematical passage
\boxed{ \begin{aligned} \|Q_{t(\gamma)}T_\gamma P_{s(\gamma)}\| \leq \sum_{r=1}^{m} &\left( \prod_{\ell=r+1}^{m}\|T_{e_\ell}\| \right) \|V_{e_r}\|\\ &\times \left( \prod_{\ell=1}^{r-1}\|H_{e_\ell}\| \right). \end{aligned} }
\mathrm{eff}Use in source · 2 passages
Search aliases: eff mathrm
Use in source · 03-exact-shared-cores.tex, line 526
Some natural operators may vanish on every global section while acting nontrivially on locally available but globally inconsistent directions. Define the annihilator Ann(Γ(H)) = {A∈ O_Workspace: π_Workspace(A)=0}. The effective workspace algebra is O_Workspace^eff = O_Workspace/Ann(Γ(H)). Its action on Γ(H) is faithful by construction.
Exact mathematical passage
\boxed{ \mathcal O_{\Workspace}^{\mathrm{eff}} = \mathcal O_{\Workspace}/\operatorname{Ann}(\Gamma(H)). }
\mathsf{EMP}Use in source · 1 passage
Search aliases: EMP mathsf
Use in source · 23-relation-to-prior-work.tex, line 15
The audit uses five labels: ll STD · = established concept, theorem, or technique, ADP · = established machinery adapted to relational workspaces, SYN · = nontrivial synthesis of established components, CAN · = candidate original contribution requiring priority review, EMP · = empirical claim not yet established in an uncontrolled system. These labels describe the status of a claim, not its importance. A standard result may be indispensable. A synthesis may be scientifically useful without conta…
Exact mathematical passage
\begin{array}{ll} \mathsf{STD} & = \text{established concept, theorem, or technique},\\ \mathsf{ADP} & = \text{established machinery adapted to relational workspaces},\\ \mathsf{SYN} & = \text{nontrivial synthesis of established components},\\ \mathsf{CAN} & = \text{candidate original contribution requiring priority review},\\ \mathsf{EMP} & = \text{empirical claim not yet established in an uncontrolled system}. \end{array}
\EndUse in source · 2 passages
Search aliases: End
Use in source · 02-static-core-transfer-theory.tex, line 298
Every core space carries a unital representation ρ_i: A⟶End(C_i). For a∈ A, the operator ρ_i(a) is the realization of the same abstract operation in local coordinates.
Exact mathematical passage
\rho_i:\mathcal A\longrightarrow\End(C_i).
\operatorname{Endogenous}Use in source · 2 passages
Search aliases: Endogenous operatorname
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 210
The formation provenance of a workspace and its operational certification are separate coordinates. A fully scaffolded structure may satisfy every structural and causal workspace gate. A highly endogenous structure may fail to become coherent or causally useful. Symbolically, Endogenous(W) centernotLongrightarrow SRW_Θ(W), SRW_Θ(W) centernotLongrightarrow Endogenous(W). The theory therefore treats endogeneity as a provenance axis rather than a higher level on the workspace hierarchy.
Exact mathematical passage
\operatorname{Endogenous}(W) \centernot\Longrightarrow \operatorname{SRW}_{\Theta}(W),
\operatorname{EndogenouslyConstituted}Use in source · 1 passage
Search aliases: EndogenouslyConstituted operatorname
Use in source · 24-theory-hierarchy.tex, line 74
subtopicOrthogonal formation-provenance axis Scaffolded ⟶ AdaptivelyParameterised ⟶ StructurallyAdaptive ⟶ EndogenouslyConstituted. This axis is independent of Levels~0--6. A scaffolded system can instantiate a high-level relational workspace, while an endogenously learned organization can fail every operational workspace gate.
Exact mathematical passage
\operatorname{Scaffolded} \longrightarrow \operatorname{AdaptivelyParameterised} \longrightarrow \operatorname{StructurallyAdaptive} \longrightarrow \operatorname{EndogenouslyConstituted}.
\operatorname{Eq}Use in source · 3 passages
Search aliases: Eq operatorname
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 361
[Exact workspace gluing] For every finite edge-complete workspace cover U, the sequence 0 ⟶ mathscr W(G) xrightarrow R_ U check C^0( U;mathscr W) xrightarrow δ^0 check C^1( U;mathscr W) is exact. Equivalently, mathscr W(G) ≅ kerδ^0 ≅ Eq ( ∏_αmathscr W_α rightrightarrows ∏_α<βmathscr W_αβ ). Every pairwise compatible family of exact local workspace states therefore glues to a unique exact global workspace state.
Exact mathematical passage
\boxed{ \mathscr W(G) \cong \ker\delta^0 \cong \operatorname{Eq} \left( \prod_\alpha\mathscr W_\alpha \rightrightarrows \prod_{\alpha<\beta}\mathscr W_{\alpha\beta} \right). }
\operatorname{Eq}_{\mathcal U_{\mathrm{flat}}}Use in source · 1 passage
Search aliases: Eq_ U_flat operatorname mathcal mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 997
l U_flat = {G_ℓ:ℓ∈ L( T)} is itself an edge-complete cover of G. Let δ_flat^0 be its overlap coboundary and define W_flat = kerδ_flat^0. Theorem~[source reference] and Theorem~[source reference] give W_r ≅ W_flat ≅ mathscr W(G). Equivalently, Lim_ T^rec ( {mathscr W(G_ℓ)}_ℓ∈ L( T) ) ≅ Eq_ U_flat ( {mathscr W(G_ℓ)}_ℓ∈ L( T) ). The notation on the left means recursive finite descent along the tree; the right side means one-shot equalization over the flattened leaf cover. In finite-dimensional vect…
Exact mathematical passage
\boxed{ \operatorname{Lim}_{\mathcal T}^{\mathrm{rec}} \left( \{\mathscr W(G_\ell)\}_{\ell\in L(\mathcal T)} \right) \cong \operatorname{Eq}_{\mathcal U_{\mathrm{flat}}} \left( \{\mathscr W(G_\ell)\}_{\ell\in L(\mathcal T)} \right). }
\mathsf{equivalence\_classes}Use in source · 1 passage
Search aliases: equivalence_classes mathsf
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1051
The machine-readable record should include: SpecificationRecord ={ · reference, family, equivalence_classes, metric, · targets, losses, horizons, interventions, · null_panels, thresholds, selection_history, · identified_sets, uniform_bounds, gate_envelopes }. Every omitted family member requires a reason. Every changed specification requires a data-split label and time stamp. Every gate requires pointwise and family-wide status.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{SpecificationRecord} =\{& \mathsf{reference}, \mathsf{family}, \mathsf{equivalence\_classes}, \mathsf{metric},\\ &\mathsf{targets}, \mathsf{losses}, \mathsf{horizons}, \mathsf{interventions},\\ &\mathsf{null\_panels}, \mathsf{thresholds}, \mathsf{selection\_history},\\ &\mathsf{identified\_sets}, \mathsf{uniform\_bounds}, \mathsf{gate\_envelopes} \}. \end{aligned} }
\mathrm{er}Use in source · 8 passages
Search aliases: er mathrm
Use in source · 11-reconstruction-and-resilience.tex, line 305
Define the accessible block support of c≠0 by supp_E(c) = {i∈ V:E_ic≠0} and define the node-erasure distance d_er = min_c≠0|supp_E(c)|.
Exact mathematical passage
\boxed{ d_{\mathrm{er}} = \min_{c\neq0}|\operatorname{supp}_E(c)|. }
\mathrm{erase}Use in source · 3 passages
Search aliases: erase mathrm
Use in source · 11-reconstruction-and-resilience.tex, line 381
Define the minimum reconstructing coalition size m_rec = min{|S|:α_S>0} and the maximum exact erasure tolerance k_erase = max{k:α^(k)>0}. The condition m_rec≥2 means that no individual encoding is sufficient for exact core recovery. The condition k_erase≥1 means that the system survives at least one node loss. These can hold simultaneously because nonlocality of encoding is not the same as fragility.
Exact mathematical passage
\boxed{ k_{\mathrm{erase}} = \max\{k:\alpha^{(k)}>0\}. }
\evUse in source · 9 passages
Search aliases: ev
Use in source · 03-exact-shared-cores.tex, line 44
Fix a root o. The evaluation map is ev_o:Γ(H)→ C_o, ev_o((c_i))=c_o.
Exact mathematical passage
\ev_o:\Gamma(H)\to C_o, \qquad \ev_o((c_i))=c_o.
\ev_iUse in source · 1 passage
Search aliases: ev_i ev
Use in source · 11-reconstruction-and-resilience.tex, line 14
Let C_* be a finite-dimensional abstract core. The exact static theory provides a complete local chart overline E_i = ev_i∘Ψ:C_*⟶ C_i, where Ψ:C_*→Γ(H) is the root-to-section isomorphism. A participant or artifact need not expose that complete chart. Let O_i:C_i⟶ Y_i be the declared observation or access map and define the accessible encoding E_i=O_ioverline E_i:C_*⟶ Y_i. For notational economy, the direct sums below use the accessible spaces Y_i. Thus injectivity of a full structural chart does…
Exact mathematical passage
\overline E_i = \ev_i\circ\Psi:C_*\longrightarrow C_i,
\ev_oUse in source · 8 passages
Search aliases: ev_o ev
Use in source · 03-exact-shared-cores.tex, line 44
Fix a root o. The evaluation map is ev_o:Γ(H)→ C_o, ev_o((c_i))=c_o.
Exact mathematical passage
\ev_o:\Gamma(H)\to C_o, \qquad \ev_o((c_i))=c_o.
\mathrm{experiment}Use in source · 1 passage
Search aliases: experiment mathrm
Use in source · 23-relation-to-prior-work.tex, line 101
The analysis does not make one global novelty claim. It uses a priority profile p(C) = ( p_concept, p_object, p_theorem, p_certificate, p_experiment ). For example, the philosophical concept of distributed cognition may be standard while a specific mathematical object is adapted, a theorem is a specialization of known spectral theory, the certificate is a synthesis, and the empirical claim is unresolved. This prevents originality in one coordinate from being used to imply originality in every co…
Exact mathematical passage
\boxed{ \mathbf p(C) = \left( p_{\mathrm{concept}}, p_{\mathrm{object}}, p_{\mathrm{theorem}}, p_{\mathrm{certificate}}, p_{\mathrm{experiment}} \right). }
\operatorname{ExtendedCognition}Use in source · 1 passage
Search aliases: ExtendedCognition operatorname
Use in source · 23-relation-to-prior-work.tex, line 136
Accordingly, ExtendedCognition centernotLongleftrightarrow SRW. An externally scaffolded process may be cognitively extended without being relationally irreducible. Conversely, an institution or multi-agent system may instantiate a certified relational workspace without being an extension of any single person's cognition.
Exact mathematical passage
\operatorname{ExtendedCognition} \centernot\Longleftrightarrow \operatorname{SRW}.
\mathsf FUse in source · 6 passages
Search aliases: F mathsf
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 83
For each case we report the vector Card( K) = ( S, O, R, P, F, A, D, X, C ), where: ll S · = structural core and spectral coherence,
Exact mathematical passage
\boxed{ \mathsf{Card}(\mathfrak K) = \left( \mathsf S, \mathsf O, \mathsf R, \mathsf P, \mathsf F, \mathsf A, \mathsf D, \mathsf X, \mathsf C \right), }
F^*Use in source · 1 passage
Search aliases: F^*
Use in source · 04-approximate-workspaces.tex, line 519
Suppose the edge maps are perturbed to widetilde H_e=H_e+Δ_e while the weights and vertex metrics remain fixed. Define δ_H^2 = max_i∈ V ∑_e:s(e)=iw_e Δ_e ^2. Let F=D_widetilde H-D_H. Then (Fc)_e=-sqrtw_e Δ_ec_s(e), F ≤δ_H. Since L_widetilde H-L_H =D_H^*F+F^*D_H+F^*F, we obtain L_widetilde H-L_H ≤ 2 D_H δ_H+δ_H^2.
Exact mathematical passage
L_{\widetilde H}-L_H =D_H^*F+F^*D_H+F^*F,
f^{-1}Use in source · 2 passages
Search aliases: f^-1
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 29
The reparameterized realization at μ is the original realization at f^-1(μ). It passes precisely when f^-1(μ)>λ_c, equivalently when μ>f(λ_c).
Exact mathematical passage
f^{-1}(\mu)
F^2Use in source · 2 passages
Search aliases: F^2
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 481
thm:transfer-identification Let X∈ R^d_u and Y∈ R^d_v satisfy Y=H_*X+ξ, E[ξ X^ T]=0, and assume Σ_XX = E[XX^ T] succeq κ I for some κ>0. Then H_* is the unique minimizer of R(H) = E Y-HX _2^2, with H_* = Σ_YXΣ_XX^-1. Moreover, R(H)- R(H_*) = tr ( (H-H_*)Σ_XX(H-H_*)^ T ) ≥ κ H-H_* _F^2.
Exact mathematical passage
\boxed{ \mathcal R(H)-\mathcal R(H_*) = \operatorname{tr} \left( (H-H_*)\Sigma_{XX}(H-H_*)^{\mathsf T} \right) \geq \kappa\|H-H_*\|_F^2. }
F_0Use in source · 2 passages
Search aliases: F_0
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1064
l H_r+1, widetilde F_r: H_r→ H_r+1 be exact and implemented level-collapse maps for r=0,…,R-1. Let R_r⊆ H_r contain the exact and implemented states reachable at level r. Assume, on R_r, F_r(x)-F_r(y) ≤ L_r x-y and sup_x∈ R_r widetilde F_r(x)-F_r(x) ≤ δ_r. Then · widetilde F_R-1∘⋯∘widetilde F_0(x) - F_R-1∘⋯∘ F_0(x) · ≤ ∑_r=0^R-1 ( ∏_s=r+1^R-1L_s ) δ_r. In particular, if L_r≤1, then the total error is at most ∑_r=0^R-1δ_r. If L_r≤ L<1 and δ_r≤δ, then total error ≤ fracδ(1-L^R)1-L ≤ fracδ1-L.
Exact mathematical passage
\boxed{ \begin{aligned} &\left\| \widetilde F_{R-1}\circ\cdots\circ\widetilde F_0(x) - F_{R-1}\circ\cdots\circ F_0(x) \right\|\\ &\qquad\leq \sum_{r=0}^{R-1} \left( \prod_{s=r+1}^{R-1}L_s \right) \delta_r. \end{aligned} }
\mathbb F_2^3Use in source · 1 passage
Search aliases: F_2^3 mathbb
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 790
Consider three agents: V_MA={P,M,R}, called the planner, monitor, and recorder. The global workspace-control state is c_t=(g_t,b_t,h_t)∈ F_2^3, where: ll g_t=goal bit, · b_t=environment or belief bit,
Exact mathematical passage
c_t=(g_t,b_t,h_t)\in\mathbb F_2^3,
f_CUse in source · 2 passages
Search aliases: f_C
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 274
Order the local coordinates as x=(q_P,p_P,p_C,f_C,q_N,f_N)^ T. Compatibility requires p_P=p_C, f_C=f_N, q_N=q_P. The discrepancy operator is D_HH = 0 · 1 · -1 · 0 · 0 · 0
Exact mathematical passage
x=(q_P,p_P,p_C,f_C,q_N,f_N)^{\mathsf T}.
F_{HMXA}Use in source · 1 passage
Search aliases: F_HMXA
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 551
0 · -1 · 0 · 0 · 0 · 0 · 1 · 0 . The rows are orthogonal with squared norm two. Therefore ker D_HAI ≅ R^4, spec(L_HAI) = {0,0,0,0,2,2,2,2}, γ_HAI=2. The full accessible frame operator is F_HMXA=2I_4. No single node is injective. Every three-node coalition reconstructs the full state, and the two opposite pairs {H,X}, {M,A} are already sufficient. Adjacent pairs observe only three of the four coordinates. Hence k_rec=2, d_er=2, while the identity of the sufficient two-node coalition depends on th…
Exact mathematical passage
F_{HMXA}=2I_4.
F_iUse in source · 1 passage
Search aliases: F_i
Use in source · 06-dynamic-workspace-theory.tex, line 29
A representative local update is X_i(t+1) = F_i ( X_i(t), {M_e(t):t(e)=i}, A_i(t),E_t,ξ_i(t) ), with messages M_e(t) = K_e ( X_s(e)(t), W_t, E_t,ζ_e(t) ). This notation permits, but does not require, the current workspace state to modulate future transfers.
Exact mathematical passage
X_i(t+1) = F_i\!\left( X_i(t), \{M_e(t):t(e)=i\}, A_i(t),E_t,\xi_i(t) \right),
F_i^{\mathcal D}Use in source · 1 passage
Search aliases: F_i^ D mathcal
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 237
The structural core can be preserved by faithful coarse-graining, while coalition counts generally are not. Let mathscr F_S^ D = bigvee_i∈ Smathscr F_i^ D be the information available to coalition S under decomposition D. For a declared loss ℓ, write Risk_ D(S) = inf_f E [ ℓ(Y^+,f(mathscr F_S^ D)) ].
Exact mathematical passage
\mathscr F_S^{\mathcal D} = \bigvee_{i\in S}\mathscr F_i^{\mathcal D}
f_NUse in source · 2 passages
Search aliases: f_N
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 274
Order the local coordinates as x=(q_P,p_P,p_C,f_C,q_N,f_N)^ T. Compatibility requires p_P=p_C, f_C=f_N, q_N=q_P. The discrepancy operator is D_HH = 0 · 1 · -1 · 0 · 0 · 0
Exact mathematical passage
x=(q_P,p_P,p_C,f_C,q_N,f_N)^{\mathsf T}.
F_{PCN}Use in source · 1 passage
Search aliases: F_PCN
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 327
The full frame operator is F_PCN=E_P^*E_P+E_C^*E_C+E_N^*E_N=2I_3. For every two-node coalition S, λ_min(F_S)=1. Thus every two-node coalition reconstructs the complete core and, for noisy observations y_S=A_Sc+η_S, widehat c-c ≤ η_S . No individual node reconstructs c, because rank(E_P) = rank(E_C) = rank(E_N) =2<3. The realization is therefore simultaneously: individually incomplete and robust to any one-node loss.
Exact mathematical passage
F_{PCN}=E_P^*E_P+E_C^*E_C+E_N^*E_N=2I_3.
F_{q^{-1}(S)}^{\mathcal D_f}Use in source · 1 passage
Search aliases: F_q^-1(S)^ D_f mathcal
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 276
Information faithfulness gives mathscr F_S^ D_c = bigvee_B∈ S bigvee_i∈ q^-1(B) mathscr F_i^ D_f = mathscr F_q^-1(S)^ D_f. The two Bayes risks optimize over the same measurable decision rules and are therefore equal. If a fine coalition of size k is sufficient within ε, the set of coarse blocks meeting that coalition has at most k elements and contains at least the same information. This proves the coalition-size inequality.
Exact mathematical passage
\mathscr F_S^{\mathcal D_c} = \bigvee_{B\in S} \bigvee_{i\in q^{-1}(B)} \mathscr F_i^{\mathcal D_f} = \mathscr F_{q^{-1}(S)}^{\mathcal D_f}.
F_rUse in source · 4 passages
Search aliases: F_r
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1043
[Approximate hierarchical collapse bound] Let F_r: H_r→ H_r+1, widetilde F_r: H_r→ H_r+1 be exact and implemented level-collapse maps for r=0,…,R-1. Let R_r⊆ H_r contain the exact and implemented states reachable at level r. Assume, on R_r, F_r(x)-F_r(y) ≤ L_r x-y and sup_x∈ R_r widetilde F_r(x)-F_r(x) ≤ δ_r. Then · widetilde F_R-1∘⋯∘widetilde F_0(x) - F_R-1∘⋯∘ F_0(x)
Exact mathematical passage
F_r:\mathcal H_r\to\mathcal H_{r+1}, \qquad \widetilde F_r:\mathcal H_r\to\mathcal H_{r+1}
F_{R-1}Use in source · 2 passages
Search aliases: F_R-1
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1064
l H_r+1, widetilde F_r: H_r→ H_r+1 be exact and implemented level-collapse maps for r=0,…,R-1. Let R_r⊆ H_r contain the exact and implemented states reachable at level r. Assume, on R_r, F_r(x)-F_r(y) ≤ L_r x-y and sup_x∈ R_r widetilde F_r(x)-F_r(x) ≤ δ_r. Then · widetilde F_R-1∘⋯∘widetilde F_0(x) - F_R-1∘⋯∘ F_0(x) · ≤ ∑_r=0^R-1 ( ∏_s=r+1^R-1L_s ) δ_r. In particular, if L_r≤1, then the total error is at most ∑_r=0^R-1δ_r. If L_r≤ L<1 and δ_r≤δ, then total error ≤ fracδ(1-L^R)1-L ≤ fracδ1-L.
Exact mathematical passage
\boxed{ \begin{aligned} &\left\| \widetilde F_{R-1}\circ\cdots\circ\widetilde F_0(x) - F_{R-1}\circ\cdots\circ F_0(x) \right\|\\ &\qquad\leq \sum_{r=0}^{R-1} \left( \prod_{s=r+1}^{R-1}L_s \right) \delta_r. \end{aligned} }
F_SUse in source · 8 passages
Search aliases: F_S
Use in source · 11-reconstruction-and-resilience.tex, line 43
For a coalition S⊆ V, define the analysis operator A_S:C_*⟶⊕_i∈ S Y_i, A_Sc=(E_ic)_i∈ S, and the coalition frame operator F_S=A_S^*A_S=∑_i∈ SE_i^*E_i. Set α_S=λ_min(F_S), β_S=λ_max(F_S). Thus α_S c ^2 ≤ A_Sc ^2 ≤ β_S c ^2.
Exact mathematical passage
\boxed{ F_S=A_S^*A_S=\sum_{i\in S}E_i^*E_i. }
F_S^{\mathcal D}Use in source · 2 passages
Search aliases: F_S^ D mathcal
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 237
The structural core can be preserved by faithful coarse-graining, while coalition counts generally are not. Let mathscr F_S^ D = bigvee_i∈ Smathscr F_i^ D be the information available to coalition S under decomposition D. For a declared loss ℓ, write Risk_ D(S) = inf_f E [ ℓ(Y^+,f(mathscr F_S^ D)) ].
Exact mathematical passage
\mathscr F_S^{\mathcal D} = \bigvee_{i\in S}\mathscr F_i^{\mathcal D}
F_S^{\mathcal D_c}Use in source · 1 passage
Search aliases: F_S^ D_c mathcal
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 276
Information faithfulness gives mathscr F_S^ D_c = bigvee_B∈ S bigvee_i∈ q^-1(B) mathscr F_i^ D_f = mathscr F_q^-1(S)^ D_f. The two Bayes risks optimize over the same measurable decision rules and are therefore equal. If a fine coalition of size k is sufficient within ε, the set of coarse blocks meeting that coalition has at most k elements and contains at least the same information. This proves the coalition-size inequality.
Exact mathematical passage
\mathscr F_S^{\mathcal D_c} = \bigvee_{B\in S} \bigvee_{i\in q^{-1}(B)} \mathscr F_i^{\mathcal D_f} = \mathscr F_{q^{-1}(S)}^{\mathcal D_f}.
F_S^{-1}Use in source · 1 passage
Search aliases: F_S^-1
Use in source · 11-reconstruction-and-resilience.tex, line 72
[Coalition reconstruction criterion] For a coalition S, the following are equivalent: item A_S is injective; item F_S is positive definite; item α_S>0; item there exists a linear decoder R_S with R_SA_S=I_C_*. When these conditions hold, the canonical decoder is R_S=A_S^†=F_S^-1A_S^*.
Exact mathematical passage
\boxed{ R_S=A_S^\dagger=F_S^{-1}A_S^*. }
F_tUse in source · 10 passages
Search aliases: F_t
Use in source · 10-persistence.tex, line 131
Let the realized vertex state satisfy x_t+1=F_tx_t+ξ_t, where F_t: C_V(t)→ C_V(t+1) is the actual update and ξ_t is an unmodeled disturbance. Define the off-workspace error e_t= (I-P_t)x_t . Introduce α_t = (I-P_t+1)F_t(I-P_t) , which measures persistence of prior off-workspace error, and ℓ_t = (I-P_t+1)F_tP_t , which measures leakage of a valid workspace state under the update.
Exact mathematical passage
x_{t+1}=F_tx_t+\xi_t,
\mathcal F_tUse in source · 2 passages
Search aliases: F_t mathcal
Use in source · 10-persistence.tex, line 285
For stochastic systems, pathwise bounded disturbances may be too strong. Let { F_t} be a filtration containing the history through time t.
Exact mathematical passage
\{\mathcal F_t\}
F_\lambdaUse in source · 1 passage
Search aliases: F_λ lambda
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 99
[Pitchfork formation transition] For the map F_λ(m)=tanh(λ m), m∈[-1,1], the following hold. item If 0≤λ≤1, the unique fixed point is m=0. It is globally attracting for λ<1 and nonexpanding at λ=1. item If λ>1, there are exactly three fixed points -m_λ, quad0, m_λ, m_λ∈(0,1). The zero fixed point is unstable and the two nonzero fixed points are locally asymptotically stable. item As λdownarrow1, m_λ = sqrtfrac3(λ-1)λ^3 + O((λ-1)^3/2).
Exact mathematical passage
F_\lambda(m)=\tanh(\lambda m), \qquad m\in[-1,1],
F_\lambda'Use in source · 2 passages
Search aliases: F_λ' lambda
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 146
The derivative is F_λ'(m) = λsech^2(λ m). At zero this equals λ, proving stability for λ<1 and instability for λ>1. At a nonzero fixed point, F_λ'(m_λ) = λ(1-m_λ^2) = frac(1-m_λ^2)artanh(m_λ)m_λ <1, because artanh(m) < fracm1-m^2 (0<m<1). The derivative is positive, so the nonzero fixed points are locally stable. Finally, expanding tanh(λ m) = λ m- fracλ^3m^33 +O(m^5) and solving the nonzero fixed-point equation gives the stated asymptotic.
Exact mathematical passage
F_\lambda'(m) = \lambda\operatorname{sech}^2(\lambda m).
\mathsf{failures}Use in source · 1 passage
Search aliases: failures mathsf
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 660
The machine-readable record should contain at least the following top-level objects: ResultRecord ={ · claim, specification, specification_family, decomposition, data_splits, formation, · workspace_extractor, goals, actions, interventions, · nulls, gates, identified_sets, specification_envelopes, uncertainty, failures, artifacts }. Each gate object records its symbol, estimator, direction, threshold, point estimate, interval, split, seed set, status, and artifact reference. Each intervention and…
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{ResultRecord} =\{& \mathsf{claim}, \mathsf{specification}, \mathsf{specification\_family}, \mathsf{decomposition}, \mathsf{data\_splits}, \mathsf{formation},\\ &\mathsf{workspace\_extractor}, \mathsf{goals}, \mathsf{actions}, \mathsf{interventions},\\ &\mathsf{nulls}, \mathsf{gates}, \mathsf{identified\_sets}, \mathsf{specification\_envelopes}, \mathsf{uncertainty}, \mathsf{failures}, \mathsf{artifacts} \}. \end{aligned} }
\mathsf{family}Use in source · 1 passage
Search aliases: family mathsf
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1051
The machine-readable record should include: SpecificationRecord ={ · reference, family, equivalence_classes, metric, · targets, losses, horizons, interventions, · null_panels, thresholds, selection_history, · identified_sets, uniform_bounds, gate_envelopes }. Every omitted family member requires a reason. Every changed specification requires a data-split label and time stamp. Every gate requires pointwise and family-wide status.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{SpecificationRecord} =\{& \mathsf{reference}, \mathsf{family}, \mathsf{equivalence\_classes}, \mathsf{metric},\\ &\mathsf{targets}, \mathsf{losses}, \mathsf{horizons}, \mathsf{interventions},\\ &\mathsf{null\_panels}, \mathsf{thresholds}, \mathsf{selection\_history},\\ &\mathsf{identified\_sets}, \mathsf{uniform\_bounds}, \mathsf{gate\_envelopes} \}. \end{aligned} }
\mathbf{FinHilb}Use in source · 3 passages
Search aliases: FinHilb mathbf
Use in source · 02-static-core-transfer-theory.tex, line 44
For every i∈ V, assign a finite-dimensional Hilbert space X_i. For every edge, assign a linear transfer T_e:X_s(e)⟶ X_t(e). The path transfer is T_γ=T_e_m⋯ T_e_2T_e_1, T_1_i=I_X_i. Accordingly, the static transfer system is a functor X:Path(G)⟶FinHilb.
Exact mathematical passage
\mathcal X:\Path(G)\longrightarrow\mathbf{FinHilb}.
\mathbf{FinHilb}^{\times}Use in source · 2 passages
Search aliases: FinHilb^× mathbf times
Use in source · 02-static-core-transfer-theory.tex, line 81
Hence two regimes will be distinguished: item the diagram regime, in which arbitrary directed maps define compatible sections; and item the local-system regime, in which invertible core maps define a functor H:Π_1(G)→FinHilb^×. Theorems based on holonomy will explicitly assume the second regime.
Exact mathematical passage
H:\Pi_1(G)\to\mathbf{FinHilb}^{\times}.
\operatorname{Fix}Use in source · 1 passage
Search aliases: Fix operatorname
Use in source · 03-exact-shared-cores.tex, line 115
The obstruction associated with a loop is Ω_γ=H_γ-I_C_o. The maximal path-independent root core is C_* = ⋂_γ:o→ oker(H_γ-I). Equivalently, C_*=C_o^Hol_o=Fix(Hol_o).
Exact mathematical passage
C_*=C_o^{\Hol_o}=\operatorname{Fix}(\Hol_o).
\mathrm{flat}Use in source · 8 passages
Search aliases: flat mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 970
Let L( T) be the leaf set. Repeated edge completeness implies that the flattened family U_flat = {G_ℓ:ℓ∈ L( T)} is itself an edge-complete cover of G. Let δ_flat^0 be its overlap coboundary and define W_flat = kerδ_flat^0. Theorem~[source reference] and Theorem~[source reference] give W_r ≅ W_flat ≅ mathscr W(G). Equivalently, Lim_ T^rec ( {mathscr W(G_ℓ)}_ℓ∈ L( T) ) ≅ Eq_ U_flat ( {mathscr W(G_ℓ)}_ℓ∈ L( T) ). The notation on the left means recursive finite descent along the tree; the right side…
Exact mathematical passage
\mathcal U_{\mathrm{flat}} = \{G_\ell:\ell\in L(\mathcal T)\}
\operatorname{Form}Use in source · 5 passages
Search aliases: Form operatorname
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 352
For thresholds Θ_form, define Form_Θ_form(W)=1 only when all applicable gates pass: · e_q^MDL≥ τ_q^MDL, · · e_q^causal≥ τ_q^causal,
Exact mathematical passage
\operatorname{Form}_{\Theta_{\mathrm{form}}}(W)=1
\operatorname{Form}_{\Theta_{\mathrm{form}}}Use in source · 5 passages
Search aliases: Form_Θ_form operatorname Theta mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 352
For thresholds Θ_form, define Form_Θ_form(W)=1 only when all applicable gates pass: · e_q^MDL≥ τ_q^MDL, · · e_q^causal≥ τ_q^causal,
Exact mathematical passage
\operatorname{Form}_{\Theta_{\mathrm{form}}}(W)=1
\mathsf{formation}Use in source · 1 passage
Search aliases: formation mathsf
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 660
The machine-readable record should contain at least the following top-level objects: ResultRecord ={ · claim, specification, specification_family, decomposition, data_splits, formation, · workspace_extractor, goals, actions, interventions, · nulls, gates, identified_sets, specification_envelopes, uncertainty, failures, artifacts }. Each gate object records its symbol, estimator, direction, threshold, point estimate, interval, split, seed set, status, and artifact reference. Each intervention and…
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{ResultRecord} =\{& \mathsf{claim}, \mathsf{specification}, \mathsf{specification\_family}, \mathsf{decomposition}, \mathsf{data\_splits}, \mathsf{formation},\\ &\mathsf{workspace\_extractor}, \mathsf{goals}, \mathsf{actions}, \mathsf{interventions},\\ &\mathsf{nulls}, \mathsf{gates}, \mathsf{identified\_sets}, \mathsf{specification\_envelopes}, \mathsf{uncertainty}, \mathsf{failures}, \mathsf{artifacts} \}. \end{aligned} }
\mathrm{frame}Use in source · 3 passages
Search aliases: frame mathrm
Use in source · 12-identity-through-time-and-replacement.tex, line 494
e bounds] Identify the old and new abstract cores with ran P and ran P' through their chosen core parameterizations. Let S be a declared coalition, let A_S:ran P→ Y_S, A_S':ran P'→ Y_S' be the resulting accessible coalition encoders, and let K_S be a unitary identification of their observation spaces. Suppose A_S'β-K_SA_S ≤ δ_S^frame < sqrtα_S. Then the replacement coalition remains reconstructive and its new lower frame bound satisfies α_S' ≥ ( sqrtα_S-δ_S^frame )^2. Consequently, k-failure res…
Exact mathematical passage
\|A_S'\beta-K_SA_S\| \leq \delta_{S}^{\mathrm{frame}} < \sqrt{\alpha_S}.
\mathrm{full}Use in source · 1 passage
Search aliases: full mathrm
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 351
Use a vector rather than one aggregate score: C_full(W) =( · d_ε, g_ε, δ_coh, δ_align^ I, Δ_joint^ℓ, k_ε, · Δ_tr( Q), η_causal^ν, Δ_specific(r), η_loop(τ), · d_id, Rec_k, underline m_ D, Δ_dec, E_form, δ^scaf, δ^leak, · Δ_J, Δ_t^B, COut_τ(widehat S), CIn_τ(widehat S), · η_G(τ), δ_G^cue(τ), η_G→ A, δ_Q, η_V→ A, η_A→ Y, · η_D→ M, η_M→ R, η_R→ v, Δ_repair^spec, δ_rep-id, sup_t e_t ). A claim passes only when every required coordinate lies in its predeclared admissible region. No weighted average ma…
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal C_{\mathrm{full}}(W) =\bigl(& d_\varepsilon, g_\varepsilon, \delta_{\mathrm{coh}}, \delta_{\mathrm{align}}^{\mathcal I}, \Delta_{\mathrm{joint}}^\ell, k_\varepsilon,\\ &\boldsymbol\Delta_{\mathrm{tr}}(\mathcal Q), \eta_{\mathrm{causal}}^\nu, \Delta_{\mathrm{specific}}(r), \eta_{\mathrm{loop}}(\tau),\\ &d_{\mathrm{id}}, \Rec_k, \underline{\mathbf m}_{\mathfrak D}, \boldsymbol\Delta_{\mathrm{dec}}, \mathbf E_{\mathrm{form}}, \delta^{\mathrm{scaf}}, \delta^{\mathrm{leak}},\\ &\Delta_J, \Delta_t^B, \COut_\tau(\widehat S), \CIn_\tau(\widehat S),\\ &\eta_G(\tau), \delta_G^{\mathrm{cue}}(\tau), \eta_{G\to A}, \delta_Q, \eta_{V\to A}, \eta_{A\to Y},\\ &\eta_{D\to M}, \eta_{M\to R}, \eta_{R\to v}, \Delta_{\mathrm{repair}}^{\mathrm{spec}}, \delta_{\mathrm{rep-id}}, \sup_t e_t \bigr). \end{aligned} }
\mathsf GUse in source · 3 passages
Search aliases: G mathsf
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 343
[Coarsening and secret-sharing trivializations] The following statements hold. item Any finite realization can be coarsened to a single displayed component. Relative to that decomposition, the full-system state is local and k_0≤1. item Let Z be uniform on a finite abelian group G. Let K be an independent uniform group element and define X_1=K, X_2=Z-K. Then I(Z;X_1)=I(Z;X_2)=0, H(Zmid X_1,X_2)=0. Under logarithmic loss, Risk({1})=Risk({2})=log| G|, Risk({1,2})=0, so the declared two-node represe…
Exact mathematical passage
\mathsf G
G'Use in source · 2 passages
Search aliases: G'
Use in source · 12-identity-through-time-and-replacement.tex, line 18
Let R=(G, C,D,ρ, I, K) and R'=(G', C',D',ρ', I', K') be two realizations. A correspondence begins with a graph isomorphism φ:G→ G'. After relabeling by φ, let J_i:C_i→ C_i' be unitary local identifications and define J_V=⊕_i∈ VJ_i, J_E=⊕_e∈ EJ_t(e).
Exact mathematical passage
\mathfrak R'=(G',\mathbf C',D',\rho',\mathcal I',\mathcal K')
g_0Use in source · 4 passages
Search aliases: g_0
Use in source · 12-identity-through-time-and-replacement.tex, line 446
· +c δ_c+d δ_r. In particular, if all local structural, operation, closure, causal, and reconstruction defects are O(δ_rep), the relevant operator norms are uniformly bounded, and g≥ g_0>0, then d_id( R, R') ≤ C_1fracδ_repg_0 +C_2δ_rep +O (fracδ_rep^2g_0). After a fixed normalization of the non-spectral terms, this recovers the schematic target d_id lesssim Cfracδ_repg_0.
Exact mathematical passage
g\geq g_0>0
G_aUse in source · 6 passages
Search aliases: G_a
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 904
A finite workspace hierarchy is a rooted tree T. Each node a∈ T carries a subgraph G_a. The root r carries G_r=G. For every internal node a, its children Ch(a) form a finite edge-complete cover of G_a. Leaves carry primitive local workspace spaces W_ℓ=mathscr W(G_ℓ). For an internal node, define recursively W_a = ker ( δ_a^0: ⊕_b∈Ch(a)W_b ⟶ ⊕_b<cW_bc ), where the overlap spaces and restrictions are inherited from the child cover.
Exact mathematical passage
G_a
G_bUse in source · 1 passage
Search aliases: G_b
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 956
Proceed upward from the leaves. The claim holds at every leaf by definition. Assume it holds for all children of an internal node a. Replacing each child space W_b by its canonical copy mathscr W(G_b), the recursive definition of W_a is exactly the compatible-family kernel for the edge-complete child cover of G_a. Theorem~[source reference] therefore gives W_a≅mathscr W(G_a). Finite induction reaches the root.
Exact mathematical passage
\mathscr W(G_b)
G_EUse in source · 9 passages
Search aliases: G_E
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 19
For each i∈ V, let g_i∈ GL(C_i), g=(g_i)_i∈ V. Define the vertex and edge direct sums G_V=⊕_i∈ Vg_i, G_E=⊕_e∈ Eg_t(e). The transformed transfers and local operation representations are H_e^g = g_t(e)H_eg_s(e)^-1, ρ_i^g(a) = g_iρ_i(a)g_i^-1. The fundamental covariance identity is D_H^gG_V=G_ED_H. It follows directly by evaluating the e-component: sqrtw_e ( g_t(e)c_t(e) - g_t(e)H_ec_s(e) ).
Exact mathematical passage
G_V=\bigoplus_{i\in V}g_i, \qquad G_E=\bigoplus_{e\in E}g_{t(e)}.
G_E^{-1}Use in source · 1 passage
Search aliases: G_E^-1
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 113
From D_H^g=G_ED_HG_V^-1 and unitarity, D_H^g^*D_H^g = G_VD_H^*G_E^-1G_ED_HG_V^-1 = G_VL_HG_V^-1. The spectral statements follow from unitary similarity.
Exact mathematical passage
D_{H^g}^*D_{H^g} = G_VD_H^*G_E^{-1}G_ED_HG_V^{-1} = G_VL_HG_V^{-1}.
g_HUse in source · 2 passages
Search aliases: g_H
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 512
Order the local coordinates as x=(g_H,d_H,g_M,p_M,p_X,v_X,d_A,v_A)^ T. The overlap discrepancies are g_H-g_M, p_M-p_X, v_X-v_A, d_A-d_H. Thus D_HAI = 1 · 0 · -1 · 0 · 0 · 0 · 0 · 0
Exact mathematical passage
x=(g_H,d_H,g_M,p_M,p_X,v_X,d_A,v_A)^{\mathsf T}.
G_{j_P}Use in source · 1 passage
Search aliases: G_j_P
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 618
For any P∈ H_0, choose an index j_P such that P∈ H_0j_P. The event that every gate passes is contained in the event that gate j_P passes. Hence P_P(certificate passes) ≤ P_P(G_j_P passes) ≤ α_j_P ≤ max_jα_j. Taking the supremum over P∈ H_0 proves the claim.
Exact mathematical passage
\mathbb P_P(\text{certificate passes}) \leq \mathbb P_P(G_{j_P}\text{ passes}) \leq \alpha_{j_P} \leq \max_j\alpha_j.
g_MUse in source · 2 passages
Search aliases: g_M
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 512
Order the local coordinates as x=(g_H,d_H,g_M,p_M,p_X,v_X,d_A,v_A)^ T. The overlap discrepancies are g_H-g_M, p_M-p_X, v_X-v_A, d_A-d_H. Thus D_HAI = 1 · 0 · -1 · 0 · 0 · 0 · 0 · 0
Exact mathematical passage
x=(g_H,d_H,g_M,p_M,p_X,v_X,d_A,v_A)^{\mathsf T}.
g_oUse in source · 2 passages
Search aliases: g_o
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 67
[Exact gauge covariance] The map G_V:Γ(H)⟶Γ(H^g) is an isomorphism. Therefore, Γ(H^g)=G_VΓ(H), dimΓ(H^g)=dimΓ(H). If the core transports are invertible and o is a root, then H_γ^g=g_oH_γ g_o^-1 for every loop γ:o→ o. Hence the holonomy-fixed core transforms by C_*^g=g_oC_*.
Exact mathematical passage
H_\gamma^g=g_oH_\gamma g_o^{-1}
g_o^{-1}Use in source · 1 passage
Search aliases: g_o^-1
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 67
[Exact gauge covariance] The map G_V:Γ(H)⟶Γ(H^g) is an isomorphism. Therefore, Γ(H^g)=G_VΓ(H), dimΓ(H^g)=dimΓ(H). If the core transports are invertible and o is a root, then H_γ^g=g_oH_γ g_o^-1 for every loop γ:o→ o. Hence the holonomy-fixed core transforms by C_*^g=g_oC_*.
Exact mathematical passage
H_\gamma^g=g_oH_\gamma g_o^{-1}
G_rUse in source · 1 passage
Search aliases: G_r
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 905
A finite workspace hierarchy is a rooted tree T. Each node a∈ T carries a subgraph G_a. The root r carries G_r=G. For every internal node a, its children Ch(a) form a finite edge-complete cover of G_a. Leaves carry primitive local workspace spaces W_ℓ=mathscr W(G_ℓ). For an internal node, define recursively W_a = ker ( δ_a^0: ⊕_b∈Ch(a)W_b ⟶ ⊕_b<cW_bc ), where the overlap spaces and restrictions are inherited from the child cover.
Exact mathematical passage
G_r=G.
G_sUse in source · 4 passages
Search aliases: G_s
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 318
[Cue-controlled goal retention] Let G_s∈ R^d_G obey G_s+1 = R_sG_s+B_sC_s+1+ζ_s+1 (s=t,…,t+τ-1). Consider two intervention runs that set G_t=g, G_t'=g', and then use the same command trajectory and the same disturbance realization. Let R_t+τ:t = R_t+τ-1⋯ R_t. Then G_t+τ-G_t+τ' = R_t+τ:t(g-g'). If m_s ≤ σ_min(R_s), R_s ≤ M_s, then ( ∏_s=t^t+τ-1m_s ) g-g' ≤ G_t+τ-G_t+τ' ≤ ( ∏_s=t^t+τ-1M_s ) g-g' .
Exact mathematical passage
G_s\in\mathbb R^{d_G}
G_s'Use in source · 1 passage
Search aliases: G_s'
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 376
Subtract the two update equations. The matched command and disturbance terms cancel, giving G_s+1-G_s+1' = R_s(G_s-G_s'). Iteration gives the exact product formula. The upper bound follows from submultiplicativity of the operator norm. The lower bound follows from σ_min(AB) ≥ σ_min(A)σ_min(B) for square linear maps.
Exact mathematical passage
G_{s+1}-G_{s+1}' = R_s(G_s-G_s').
G_{s+1}Use in source · 3 passages
Search aliases: G_s+1
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 319
[Cue-controlled goal retention] Let G_s∈ R^d_G obey G_s+1 = R_sG_s+B_sC_s+1+ζ_s+1 (s=t,…,t+τ-1). Consider two intervention runs that set G_t=g, G_t'=g', and then use the same command trajectory and the same disturbance realization. Let R_t+τ:t = R_t+τ-1⋯ R_t. Then G_t+τ-G_t+τ' = R_t+τ:t(g-g'). If m_s ≤ σ_min(R_s), R_s ≤ M_s, then ( ∏_s=t^t+τ-1m_s ) g-g' ≤ G_t+τ-G_t+τ' ≤ ( ∏_s=t^t+τ-1M_s ) g-g' .
Exact mathematical passage
G_{s+1} = R_sG_s+B_sC_{s+1}+\zeta_{s+1} \qquad (s=t,\ldots,t+\tau-1).
G_{s+1}'Use in source · 1 passage
Search aliases: G_s+1'
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 376
Subtract the two update equations. The matched command and disturbance terms cancel, giving G_s+1-G_s+1' = R_s(G_s-G_s'). Iteration gives the exact product formula. The upper bound follows from submultiplicativity of the operator norm. The lower bound follows from σ_min(AB) ≥ σ_min(A)σ_min(B) for square linear maps.
Exact mathematical passage
G_{s+1}-G_{s+1}' = R_s(G_s-G_s').
g_tUse in source · 11 passages
Search aliases: g_t
Use in source · 10-persistence.tex, line 89
Let P_t project onto a selected rank-d low-energy workspace cluster of L_t, and set W_t=ran P_t. Write g_t=λ_d+1(L_t)-λ_d(L_t)>0 for the separating spectral gap and η_t^L=2 D_t δ_t^D+(δ_t^D)^2.
Exact mathematical passage
g_t=\lambda_{d+1}(L_t)-\lambda_d(L_t)>0
G_t'Use in source · 1 passage
Search aliases: G_t'
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 327
[Cue-controlled goal retention] Let G_s∈ R^d_G obey G_s+1 = R_sG_s+B_sC_s+1+ζ_s+1 (s=t,…,t+τ-1). Consider two intervention runs that set G_t=g, G_t'=g', and then use the same command trajectory and the same disturbance realization. Let R_t+τ:t = R_t+τ-1⋯ R_t. Then G_t+τ-G_t+τ' = R_t+τ:t(g-g'). If m_s ≤ σ_min(R_s), R_s ≤ M_s, then ( ∏_s=t^t+τ-1m_s ) g-g' ≤ G_t+τ-G_t+τ' ≤ ( ∏_s=t^t+τ-1M_s ) g-g' .
Exact mathematical passage
G_t=g, \qquad G_t'=g',
G_{t+1}Use in source · 1 passage
Search aliases: G_t+1
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 1114
Let G_t+1=C_t+1, where C_t+1 is an external instruction repeated at every step. Goal and action can be strongly correlated, but after cutting the cue channel, I(G_t+τ;G_tmidcut(C))=0. The system tracks an external command. It has not established internal goal retention.
Exact mathematical passage
G_{t+1}=C_{t+1},
g_{t+1}Use in source · 1 passage
Search aliases: g_t+1
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 825
In the absence of an explicit goal intervention, let g_t+1=g_t. Under matched cue-cut trials, do(g_t=0) and do(g_t=1) remain distinguishable at every later time: |g_t+τ-g_t+τ'|=1. Thus the cue-controlled retention factor is exactly one: η_G(τ)=1. The goal is not reloaded by an external channel after the initial intervention.
Exact mathematical passage
g_{t+1}=g_t.
g_{t+\tau}Use in source · 1 passage
Search aliases: g_t+τ tau
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 835
In the absence of an explicit goal intervention, let g_t+1=g_t. Under matched cue-cut trials, do(g_t=0) and do(g_t=1) remain distinguishable at every later time: |g_t+τ-g_t+τ'|=1. Thus the cue-controlled retention factor is exactly one: η_G(τ)=1. The goal is not reloaded by an external channel after the initial intervention.
Exact mathematical passage
|g_{t+\tau}-g_{t+\tau}'|=1.
G_{t+\tau}'Use in source · 4 passages
Search aliases: G_t+τ' tau
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 340
[Cue-controlled goal retention] Let G_s∈ R^d_G obey G_s+1 = R_sG_s+B_sC_s+1+ζ_s+1 (s=t,…,t+τ-1). Consider two intervention runs that set G_t=g, G_t'=g', and then use the same command trajectory and the same disturbance realization. Let R_t+τ:t = R_t+τ-1⋯ R_t. Then G_t+τ-G_t+τ' = R_t+τ:t(g-g'). If m_s ≤ σ_min(R_s), R_s ≤ M_s, then ( ∏_s=t^t+τ-1m_s ) g-g' ≤ G_t+τ-G_t+τ' ≤ ( ∏_s=t^t+τ-1M_s ) g-g' .
Exact mathematical passage
\boxed{ G_{t+\tau}-G_{t+\tau}' = R_{t+\tau:t}(g-g'). }
g_{t+\tau}'Use in source · 1 passage
Search aliases: g_t+τ' tau
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 835
In the absence of an explicit goal intervention, let g_t+1=g_t. Under matched cue-cut trials, do(g_t=0) and do(g_t=1) remain distinguishable at every later time: |g_t+τ-g_t+τ'|=1. Thus the cue-controlled retention factor is exactly one: η_G(τ)=1. The goal is not reloaded by an external channel after the initial intervention.
Exact mathematical passage
|g_{t+\tau}-g_{t+\tau}'|=1.
g_uUse in source · 3 passages
Search aliases: g_u
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 427
A learned transfer map is not absolutely identifiable when local coordinates are latent. Under local invertible changes X_u'=g_uX_u, X_v'=g_vX_v, the same abstract transfer is represented by H_uv'=g_vH_uvg_u^-1. The identifiable object is therefore the gauge class [H]_ G = { (g_t(e)H_eg_s(e)^-1)_e∈ E : (g_i)_i∈ V∈ G }. Any formation claim that compares raw matrices across independently trained systems without gauge alignment is ill posed.
Exact mathematical passage
X_u'=g_uX_u, \qquad X_v'=g_vX_v,
g_u^{\mathsf T}Use in source · 1 passage
Search aliases: g_u^ T mathsf
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 578
The transformed covariances are Σ_Y'X'=g_vΣ_YXg_u^ T, Σ_X'X'=g_uΣ_XXg_u^ T. Substitution into the covariance formula and inversion of the second factor give the result.
Exact mathematical passage
\Sigma_{Y'X'}=g_v\Sigma_{YX}g_u^{\mathsf T}, \qquad \Sigma_{X'X'}=g_u\Sigma_{XX}g_u^{\mathsf T}.
g_u^{-1}Use in source · 2 passages
Search aliases: g_u^-1
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 433
A learned transfer map is not absolutely identifiable when local coordinates are latent. Under local invertible changes X_u'=g_uX_u, X_v'=g_vX_v, the same abstract transfer is represented by H_uv'=g_vH_uvg_u^-1. The identifiable object is therefore the gauge class [H]_ G = { (g_t(e)H_eg_s(e)^-1)_e∈ E : (g_i)_i∈ V∈ G }. Any formation claim that compares raw matrices across independently trained systems without gauge alignment is ill posed.
Exact mathematical passage
H_{uv}'=g_vH_{uv}g_u^{-1}.
G_VUse in source · 17 passages
Search aliases: G_V
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 19
For each i∈ V, let g_i∈ GL(C_i), g=(g_i)_i∈ V. Define the vertex and edge direct sums G_V=⊕_i∈ Vg_i, G_E=⊕_e∈ Eg_t(e). The transformed transfers and local operation representations are H_e^g = g_t(e)H_eg_s(e)^-1, ρ_i^g(a) = g_iρ_i(a)g_i^-1. The fundamental covariance identity is D_H^gG_V=G_ED_H. It follows directly by evaluating the e-component: sqrtw_e ( g_t(e)c_t(e) - g_t(e)H_ec_s(e) ).
Exact mathematical passage
G_V=\bigoplus_{i\in V}g_i, \qquad G_E=\bigoplus_{e\in E}g_{t(e)}.
g_vUse in source · 5 passages
Search aliases: g_v
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 427
A learned transfer map is not absolutely identifiable when local coordinates are latent. Under local invertible changes X_u'=g_uX_u, X_v'=g_vX_v, the same abstract transfer is represented by H_uv'=g_vH_uvg_u^-1. The identifiable object is therefore the gauge class [H]_ G = { (g_t(e)H_eg_s(e)^-1)_e∈ E : (g_i)_i∈ V∈ G }. Any formation claim that compares raw matrices across independently trained systems without gauge alignment is ill posed.
Exact mathematical passage
X_u'=g_uX_u, \qquad X_v'=g_vX_v,
G_V^{-1}Use in source · 5 passages
Search aliases: G_V^-1
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 93
[Unitary gauge covariance of the Laplacian] If every g_i is unitary, then G_V and G_E are unitary and L_H^g=G_VL_HG_V^-1. Consequently, spec(L_H^g)=spec(L_H), P_I(L_H^g)=G_VP_I(L_H)G_V^-1 for every spectral interval I.
Exact mathematical passage
\boxed{ L_{H^g}=G_VL_HG_V^{-1}. }
G_{\alpha\beta}Use in source · 4 passages
Search aliases: G_αβ alpha beta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 99
For pairwise overlaps write mathscr W_α=mathscr W(G_α), mathscr W_αβ=mathscr W(G_αβ), and r_αβ^α: mathscr W_α→mathscr W_αβ, r_αβ^β: mathscr W_β→mathscr W_αβ. The interface is therefore a cospan mathscr W_α xrightarrow r_αβ^α mathscr W_αβ xleftarrow r_αβ^β mathscr W_β, not necessarily a direct transfer map from one complete local workspace to the other. Both charts are compared through the content they expose on their common domain.
Exact mathematical passage
\mathscr W_\alpha=\mathscr W(G_\alpha), \qquad \mathscr W_{\alpha\beta}=\mathscr W(G_{\alpha\beta}),
G_\betaUse in source · 3 passages
Search aliases: G_β beta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 389
Conversely, let w=(w_α)_α∈kerδ^0. For each vertex i∈ V, choose any chart G_α containing i and set c_i=(w_α)_i. If another chart G_β contains i, then i∈ G_αβ and overlap compatibility gives (w_α)_i=(w_β)_i. Thus c_i is well defined.
Exact mathematical passage
G_\beta
g_{\varepsilon}Use in source · 1 passage
Search aliases: g_ε varepsilon
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 41
For a one-parameter family R_λ, define λ_str · = inf{λ: d_ε(λ)>0, g_ε(λ)>0}, λ_op · = inf{λ: δ_align(λ) ≤ε_op}, λ_causal · = inf{λ: η_causal(λ) ≥τ_causal}, λ_rel · = inf{λ: k_ε(λ)≥2, Δ_tr(λ) ≥τ_tr}, λ_form · = inf{λ: Form_Θ_form (W_λ)=1}. In general, λ_str, λ_op, λ_causal, λ_rel, λ_form can be distinct. A synchronized representation can appear before it becomes causally useful, and causal coordination can appear while remaining reducible to one centralized component.
Exact mathematical passage
\begin{aligned} \lambda_{\mathrm{str}} &= \inf\{\lambda: d_{\varepsilon}(\lambda)>0, g_{\varepsilon}(\lambda)>0\},\\ \lambda_{\mathrm{op}} &= \inf\{\lambda: \delta_{\mathrm{align}}(\lambda) \leq\varepsilon_{\mathrm{op}}\},\\ \lambda_{\mathrm{causal}} &= \inf\{\lambda: \eta_{\mathrm{causal}}(\lambda) \geq\tau_{\mathrm{causal}}\},\\ \lambda_{\mathrm{rel}} &= \inf\{\lambda: k_\varepsilon(\lambda)\geq2, \Delta_{\mathrm{tr}}(\lambda) \geq\tau_{\mathrm{tr}}\},\\ \lambda_{\mathrm{form}} &= \inf\{\lambda: \operatorname{Form}_{\Theta_{\mathrm{form}}} (W_\lambda)=1\}. \end{aligned}
g_{\varepsilon,t}Use in source · 1 passage
Search aliases: g_ε,t varepsilon
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
G_\ellUse in source · 3 passages
Search aliases: G_ℓ ell
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 914
A finite workspace hierarchy is a rooted tree T. Each node a∈ T carries a subgraph G_a. The root r carries G_r=G. For every internal node a, its children Ch(a) form a finite edge-complete cover of G_a. Leaves carry primitive local workspace spaces W_ℓ=mathscr W(G_ℓ). For an internal node, define recursively W_a = ker ( δ_a^0: ⊕_b∈Ch(a)W_b ⟶ ⊕_b<cW_bc ), where the overlap spaces and restrictions are inherited from the child cover.
Exact mathematical passage
W_\ell=\mathscr W(G_\ell).
\mathrm{gap}Use in source · 1 passage
Search aliases: gap mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
\operatorname{Gate}Use in source · 1 passage
Search aliases: Gate operatorname
Use in source · 09-formal-workspace-definition.tex, line 101
Symbolically, SRW(W_t;ς) = bigwedge_q∈ J(ς) Gate_q(W_t;ς). The gate set is claim-relative. A one-step operational workspace need not pass persistence or reentry gates, while a persistent reentrant workspace must. No scalar total score is sufficient: failure of a required gate cannot be hidden by high performance on another gate.
Exact mathematical passage
\boxed{ \SRW(W_t;\varsigma) = \bigwedge_{q\in\mathcal J(\varsigma)} \operatorname{Gate}_q(W_t;\varsigma). }
\mathsf{gate\_envelopes}Use in source · 1 passage
Search aliases: gate_envelopes mathsf
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1051
The machine-readable record should include: SpecificationRecord ={ · reference, family, equivalence_classes, metric, · targets, losses, horizons, interventions, · null_panels, thresholds, selection_history, · identified_sets, uniform_bounds, gate_envelopes }. Every omitted family member requires a reason. Every changed specification requires a data-split label and time stamp. Every gate requires pointwise and family-wide status.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{SpecificationRecord} =\{& \mathsf{reference}, \mathsf{family}, \mathsf{equivalence\_classes}, \mathsf{metric},\\ &\mathsf{targets}, \mathsf{losses}, \mathsf{horizons}, \mathsf{interventions},\\ &\mathsf{null\_panels}, \mathsf{thresholds}, \mathsf{selection\_history},\\ &\mathsf{identified\_sets}, \mathsf{uniform\_bounds}, \mathsf{gate\_envelopes} \}. \end{aligned} }
\operatorname{Gate}_qUse in source · 1 passage
Search aliases: Gate_q operatorname
Use in source · 09-formal-workspace-definition.tex, line 101
Symbolically, SRW(W_t;ς) = bigwedge_q∈ J(ς) Gate_q(W_t;ς). The gate set is claim-relative. A one-step operational workspace need not pass persistence or reentry gates, while a persistent reentrant workspace must. No scalar total score is sufficient: failure of a required gate cannot be hidden by high performance on another gate.
Exact mathematical passage
\boxed{ \SRW(W_t;\varsigma) = \bigwedge_{q\in\mathcal J(\varsigma)} \operatorname{Gate}_q(W_t;\varsigma). }
\mathsf{gates}Use in source · 1 passage
Search aliases: gates mathsf
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 660
The machine-readable record should contain at least the following top-level objects: ResultRecord ={ · claim, specification, specification_family, decomposition, data_splits, formation, · workspace_extractor, goals, actions, interventions, · nulls, gates, identified_sets, specification_envelopes, uncertainty, failures, artifacts }. Each gate object records its symbol, estimator, direction, threshold, point estimate, interval, split, seed set, status, and artifact reference. Each intervention and…
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{ResultRecord} =\{& \mathsf{claim}, \mathsf{specification}, \mathsf{specification\_family}, \mathsf{decomposition}, \mathsf{data\_splits}, \mathsf{formation},\\ &\mathsf{workspace\_extractor}, \mathsf{goals}, \mathsf{actions}, \mathsf{interventions},\\ &\mathsf{nulls}, \mathsf{gates}, \mathsf{identified\_sets}, \mathsf{specification\_envelopes}, \mathsf{uncertainty}, \mathsf{failures}, \mathsf{artifacts} \}. \end{aligned} }
\mathrm{goal}Use in source · 2 passages
Search aliases: goal mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 110
Two goal codes are operationally equivalent, g∼_goalg', when they induce the same action ordering in every declared state and intervention background: Q_t^g(amid w) ≥ Q_t^g(a'mid w) Longleftrightarrow Q_t^g'(amid w) ≥ Q_t^g'(a'mid w). The abstract goal is the equivalence class [g]_goal. This quotient prevents a mere invertible recoding of a goal channel from being reported as a change of objective. For quantitative regret bounds, a representative normalization of U_g must nevertheless be fixed.
Exact mathematical passage
g\sim_{\mathrm{goal}}g',
\operatorname{GoalPersistent}Use in source · 1 passage
Search aliases: GoalPersistent operatorname
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1134
The following implications are not licensed: Agent_Θ_A(Workspace) centernotLongrightarrow PhenomenallyConscious(Workspace), SelfMaintaining(Workspace) centernotLongrightarrow SelfAware(Workspace), GoalPersistent(Workspace) centernotLongrightarrow MoralPatient(Workspace). A thermostat-like controller can maintain a variable without representing itself. A sophisticated planner can evaluate counterfactual actions without phenomenal experience. Conversely, failure to pass this engineering certificat…
Exact mathematical passage
\operatorname{GoalPersistent}(\Workspace) \centernot\Longrightarrow \operatorname{MoralPatient}(\Workspace).
\mathsf{goals}Use in source · 1 passage
Search aliases: goals mathsf
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 660
The machine-readable record should contain at least the following top-level objects: ResultRecord ={ · claim, specification, specification_family, decomposition, data_splits, formation, · workspace_extractor, goals, actions, interventions, · nulls, gates, identified_sets, specification_envelopes, uncertainty, failures, artifacts }. Each gate object records its symbol, estimator, direction, threshold, point estimate, interval, split, seed set, status, and artifact reference. Each intervention and…
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{ResultRecord} =\{& \mathsf{claim}, \mathsf{specification}, \mathsf{specification\_family}, \mathsf{decomposition}, \mathsf{data\_splits}, \mathsf{formation},\\ &\mathsf{workspace\_extractor}, \mathsf{goals}, \mathsf{actions}, \mathsf{interventions},\\ &\mathsf{nulls}, \mathsf{gates}, \mathsf{identified\_sets}, \mathsf{specification\_envelopes}, \mathsf{uncertainty}, \mathsf{failures}, \mathsf{artifacts} \}. \end{aligned} }
h^-Use in source · 5 passages
Search aliases: h^-
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 883
Let the one-step utility be U_g(a,r;b,h^-) = 1{a=g⊕ b⊕ h^-} +2 1{h^-lor r=1} -frac12r. For fixed (g,b,h^-), the unique maximizer is (a^*,r^*) = (g⊕ b⊕ h^-,1-h^-). Indeed: item a wrong task action loses one unit; item omitting repair when h^-=0 loses 3/2 units; and item performing unnecessary repair when h^-=1 loses 1/2 unit. The smallest optimal-action gap is therefore Δ_Q=frac12. By Theorem~[source reference], any uniformly accurate value model with ε_Q<frac14 recovers the exact greedy joint ac…
Exact mathematical passage
U_g(a,r;b,h^-) = \mathbf 1\{a=g\oplus b\oplus h^-\} +2\mathbf 1\{h^-\lor r=1\} -\frac12r.
H^1Use in source · 5 passages
Search aliases: H^1
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 217
A different problem arises when only relative transition data are supplied. Let b=(b_αβ)∈check C^1( U;mathscr W) be a prescribed family of overlap offsets. The triple-overlap consistency condition is δ^1b=0. One seeks local potentials q=(q_α)∈check C^0 satisfying δ^0q=b. Define check H^1( U;mathscr W) = frackerδ^1imδ^0. Then the affine gluing problem is solvable precisely when [b]=0 in check H^1( U;mathscr W). A nonzero class means that all local transition statements can be mutually consistent …
Exact mathematical passage
\boxed{ \check H^1(\mathcal U;\mathscr W) = \frac{\ker\delta^1}{\operatorname{im}\delta^0}. }
\mathcal H^1_{\mathcal U}Use in source · 4 passages
Search aliases: H^1_ U mathcal mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 246
Equip the finite cochain spaces with Hilbert inner products and define the first vCech Laplacian Δ_1 = δ^0(δ^0)^* + (δ^1)^*δ^1. Let H^1_ U=kerΔ_1.
Exact mathematical passage
\mathcal H^1_{\mathcal U}=\ker\Delta_1.
H^gUse in source · 14 passages
Search aliases: H^g
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 36
For each i∈ V, let g_i∈ GL(C_i), g=(g_i)_i∈ V. Define the vertex and edge direct sums G_V=⊕_i∈ Vg_i, G_E=⊕_e∈ Eg_t(e). The transformed transfers and local operation representations are H_e^g = g_t(e)H_eg_s(e)^-1, ρ_i^g(a) = g_iρ_i(a)g_i^-1. The fundamental covariance identity is D_H^gG_V=G_ED_H. It follows directly by evaluating the e-component: sqrtw_e ( g_t(e)c_t(e) - g_t(e)H_ec_s(e) ).
Exact mathematical passage
\boxed{ D_{H^g}G_V=G_ED_H. }
h^mUse in source · 1 passage
Search aliases: h^m
Use in source · 04-approximate-workspaces.tex, line 757
[Uniform path bound] If along the path T_r ≤τ, H_r ≤ h, V_r ≤ν, then the leakage and core-transport defects are bounded by ν∑_r=1^mτ^m-rh^r-1 = displaystyle νfracτ^m-h^mτ-h, · τ≠ h, [1.1em] displaystyle mντ^m-1, · τ=h. In particular, if τ≤1 and h≤1, the bound is at most mν.
Exact mathematical passage
\boxed{ \nu\sum_{r=1}^{m}\tau^{m-r}h^{r-1} = \begin{cases} \displaystyle \nu\frac{\tau^m-h^m}{\tau-h},&\tau\neq h,\\[1.1em] \displaystyle m\nu\tau^{m-1},&\tau=h. \end{cases} }
h^{r-1}Use in source · 1 passage
Search aliases: h^r-1
Use in source · 04-approximate-workspaces.tex, line 757
[Uniform path bound] If along the path T_r ≤τ, H_r ≤ h, V_r ≤ν, then the leakage and core-transport defects are bounded by ν∑_r=1^mτ^m-rh^r-1 = displaystyle νfracτ^m-h^mτ-h, · τ≠ h, [1.1em] displaystyle mντ^m-1, · τ=h. In particular, if τ≤1 and h≤1, the bound is at most mν.
Exact mathematical passage
\boxed{ \nu\sum_{r=1}^{m}\tau^{m-r}h^{r-1} = \begin{cases} \displaystyle \nu\frac{\tau^m-h^m}{\tau-h},&\tau\neq h,\\[1.1em] \displaystyle m\nu\tau^{m-1},&\tau=h. \end{cases} }
\mathbf H^SUse in source · 3 passages
Search aliases: H^S mathbf
Use in source · 11-reconstruction-and-resilience.tex, line 181
[Exact reconstruction implies coalition sufficiency] Let W be sufficient for Y relative to the full history H: Yindep Hmid W. If a coalition reconstructs the workspace exactly, W=R_S( H^S) almost surely, then Yindep Hmid H^S. Under logarithmic loss, Risk_log(S)=Risk_log(V).
Exact mathematical passage
W=R_S(\mathbf H^S) \qquad\text{almost surely},
H_*Use in source · 16 passages
Search aliases: H_*
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 453
[Population transfer identification] Let X∈ R^d_u and Y∈ R^d_v satisfy Y=H_*X+ξ, E[ξ X^ T]=0, and assume Σ_XX = E[XX^ T] succeq κ I for some κ>0. Then H_* is the unique minimizer of R(H) = E Y-HX _2^2, with H_* = Σ_YXΣ_XX^-1. Moreover, R(H)- R(H_*) = tr ( (H-H_*)Σ_XX(H-H_*)^ T ) ≥ κ H-H_* _F^2.
Exact mathematical passage
Y=H_*X+\xi, \qquad \mathbb E[\xi X^{\mathsf T}]=0,
H_*'Use in source · 1 passage
Search aliases: H_*'
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 571
[Gauge covariance of least squares] Under invertible coordinate transformations X'=g_uX, Y'=g_vY, the population least-squares solution transforms as H_*'=g_vH_*g_u^-1.
Exact mathematical passage
H_*'=g_vH_*g_u^{-1}.
H_{0j_P}Use in source · 1 passage
Search aliases: H_0j_P
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 615
For any P∈ H_0, choose an index j_P such that P∈ H_0j_P. The event that every gate passes is contained in the event that gate j_P passes. Hence P_P(certificate passes) ≤ P_P(G_j_P passes) ≤ α_j_P ≤ max_jα_j. Taking the supremum over P∈ H_0 proves the claim.
Exact mathematical passage
P\in H_{0j_P}
H_1Use in source · 5 passages
Search aliases: H_1
Use in source · 04-approximate-workspaces.tex, line 694
[Pathwise core--residual Duhamel formula] The deviation of full path transport from pure core transport is exactly · T_m⋯ T_1ι_i_0^C - ι_i_m^C H_m⋯ H_1 · = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r
Exact mathematical passage
\boxed{ \begin{aligned} &T_m\cdots T_1\iota_{i_0}^C - \iota_{i_m}^C H_m\cdots H_1\\ &\qquad= \sum_{r=1}^{m} T_m\cdots T_{r+1} \iota_{i_r}^R V_r H_{r-1}\cdots H_1. \end{aligned} }
H_{12}Use in source · 4 passages
Search aliases: H_12
Use in source · 02-static-core-transfer-theory.tex, line 398
[Equivalent operations in different coordinates] Let C_1=C_2= R^2, choose S∈ GL_2( R), and set H_12=S, ρ_2(a)=Sρ_1(a)S^-1. Then H_12ρ_1(a) =Sρ_1(a) =ρ_2(a)S =ρ_2(a)H_12. The local matrices can look different while realizing the same abstract operation. This is the elementary model of representation change used throughout the theory.
Exact mathematical passage
H_{12}=S, \qquad \rho_2(a)=S\rho_1(a)S^{-1}.
H_2Use in source · 1 passage
Search aliases: H_2
Use in source · 04-approximate-workspaces.tex, line 781
For two consecutive transfers, P_i_2T_2T_1P_i_0 = H_2H_1+U_2V_1, Q_i_2T_2T_1P_i_0 = V_2H_1+K_2V_1. Thus leakage out of the core is first order in the blocks V_r, while an excursion that leaves and then returns to the core contains at least one V-block and one later U-block. For a fixed path length, if U_r , V_r =O(δ) and the diagonal blocks remain bounded, the residual-mediated correction to pure core-to-core transport is O(δ^2), whereas terminal residual leakage can be O(δ). This distinction se…
Exact mathematical passage
P_{i_2}T_2T_1P_{i_0} = H_2H_1+U_2V_1,
H_{21}Use in source · 1 passage
Search aliases: H_21
Use in source · 04-approximate-workspaces.tex, line 338
Let C_1=C_2= R, use unit weights, and take two directed transfers H_12=a, H_21=b. Then D_H = -a · 1
Exact mathematical passage
H_{12}=a, \qquad H_{21}=b.
H_{23}Use in source · 1 passage
Search aliases: H_23
Use in source · 03-exact-shared-cores.tex, line 288
[One-dimensional core surviving a contradictory cycle] Let a three-node cycle have C_1=C_2=C_3= R^2 and H_12=I, H_23=I, H_31=J, J= 1 · 0 0 · -1 . The cycle holonomy is J, hence C_*=ker(J-I)=span{(1,0)^top}. The first coordinate circulates consistently through all three strata. The second returns with its sign reversed and therefore cannot define a nonzero exact shared section. Thus d_Workspace=1.
Exact mathematical passage
H_{12}=I, \qquad H_{23}=I, \qquad H_{31}=J, \qquad J= \begin{pmatrix} 1&0\\ 0&-1 \end{pmatrix}.
H_{31}Use in source · 1 passage
Search aliases: H_31
Use in source · 03-exact-shared-cores.tex, line 288
[One-dimensional core surviving a contradictory cycle] Let a three-node cycle have C_1=C_2=C_3= R^2 and H_12=I, H_23=I, H_31=J, J= 1 · 0 0 · -1 . The cycle holonomy is J, hence C_*=ker(J-I)=span{(1,0)^top}. The first coordinate circulates consistently through all three strata. The second returns with its sign reversed and therefore cannot define a nonzero exact shared section. Thus d_Workspace=1.
Exact mathematical passage
H_{12}=I, \qquad H_{23}=I, \qquad H_{31}=J, \qquad J= \begin{pmatrix} 1&0\\ 0&-1 \end{pmatrix}.
H_{ah}Use in source · 3 passages
Search aliases: H_ah
Use in source · 01-foundational-thesis.tex, line 157
Consider three strata: h=human conceptual state, m=model-formal state, a=artifact state. Let the corresponding core spaces be C_h,C_m,C_a, with transfers H_hm:C_h→ C_m, H_ma:C_m→ C_a, H_ah:C_a→ C_h. A proposed shared item begins as c_h∈ C_h, is formalized as c_m=H_hmc_h, externalized as c_a=H_mac_m, and re-enters human reasoning as c_h'=H_ahc_a. The round-trip consistency condition is c_h'=c_h, or equivalently H_ahH_maH_hmc_h=c_h. Thus the genuinely shared part of C_h is not automatically all of…
Exact mathematical passage
H_{hm}:C_h\to C_m, \qquad H_{ma}:C_m\to C_a, \qquad H_{ah}:C_a\to C_h.
H_e^*Use in source · 2 passages
Search aliases: H_e^*
Use in source · 04-approximate-workspaces.tex, line 58
For z=(z_e)_e∈ E∈ C_E, the adjoint is (D_H^*z)_i = ∑_e:t(e)=isqrtw_e z_e - ∑_e:s(e)=isqrtw_e H_e^*z_e. Consequently, (L_Hc)_i = · ∑_e:t(e)=iw_e(c_i-H_ec_s(e))
Exact mathematical passage
(D_H^*z)_i = \sum_{e:t(e)=i}\sqrt{w_e}\,z_e - \sum_{e:s(e)=i}\sqrt{w_e}\,H_e^*z_e.
H_e^gUse in source · 2 passages
Search aliases: H_e^g
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 25
For each i∈ V, let g_i∈ GL(C_i), g=(g_i)_i∈ V. Define the vertex and edge direct sums G_V=⊕_i∈ Vg_i, G_E=⊕_e∈ Eg_t(e). The transformed transfers and local operation representations are H_e^g = g_t(e)H_eg_s(e)^-1, ρ_i^g(a) = g_iρ_i(a)g_i^-1. The fundamental covariance identity is D_H^gG_V=G_ED_H. It follows directly by evaluating the e-component: sqrtw_e ( g_t(e)c_t(e) - g_t(e)H_ec_s(e) ).
Exact mathematical passage
H_e^g = g_{t(e)}H_eg_{s(e)}^{-1},
H_{e_1}Use in source · 3 passages
Search aliases: H_e_1
Use in source · 02-static-core-transfer-theory.tex, line 228
[Pathwise core preservation] Suppose V_e=0 for every edge in a directed path γ=e_m⋯ e_1. Then T_γ(C_s(γ))⊆ C_t(γ) and P_t(γ)T_γ P_s(γ) = H_e_m⋯ H_e_1.
Exact mathematical passage
P_{t(\gamma)}T_\gamma P_{s(\gamma)} = H_{e_m}\cdots H_{e_1}.
H_{e_m}Use in source · 1 passage
Search aliases: H_e_m
Use in source · 02-static-core-transfer-theory.tex, line 228
[Pathwise core preservation] Suppose V_e=0 for every edge in a directed path γ=e_m⋯ e_1. Then T_γ(C_s(γ))⊆ C_t(γ) and P_t(γ)T_γ P_s(γ) = H_e_m⋯ H_e_1.
Exact mathematical passage
P_{t(\gamma)}T_\gamma P_{s(\gamma)} = H_{e_m}\cdots H_{e_1}.
H_{e_r}Use in source · 3 passages
Search aliases: H_e_r
Use in source · 02-static-core-transfer-theory.tex, line 241
For a single edge, V_e=0 means T_e(c,0)=(H_ec,0), so core states remain in the core. Inductively, if the first r transfers map c to (H_e_r⋯ H_e_1c,0), applying T_e_r+1 gives (H_e_r+1H_e_r⋯ H_e_1c,0). The conclusion follows after m steps.
Exact mathematical passage
(H_{e_r}\cdots H_{e_1}c,0)
H_{e_{r+1}}Use in source · 1 passage
Search aliases: H_e_r+1
Use in source · 02-static-core-transfer-theory.tex, line 242
For a single edge, V_e=0 means T_e(c,0)=(H_ec,0), so core states remain in the core. Inductively, if the first r transfers map c to (H_e_r⋯ H_e_1c,0), applying T_e_r+1 gives (H_e_r+1H_e_r⋯ H_e_1c,0). The conclusion follows after m steps.
Exact mathematical passage
(H_{e_{r+1}}H_{e_r}\cdots H_{e_1}c,0).
H_{e_\ell}Use in source · 1 passage
Search aliases: H_e_ℓ ell
Use in source · 19-summary-of-main-results.tex, line 222
For a path γ=e_m⋯ e_1, Q_t(γ)T_γ P_s(γ) ≤ ∑_r=1^m · ( ∏_ℓ=r+1^m T_e_ℓ ) V_e_r · × ( ∏_ℓ=1^r-1 H_e_ℓ ). The same bound controls the defect between full core-to-core path transport and the pure core product. An exact Duhamel identity yields both estimates.
Exact mathematical passage
\boxed{ \begin{aligned} \|Q_{t(\gamma)}T_\gamma P_{s(\gamma)}\| \leq \sum_{r=1}^{m} &\left( \prod_{\ell=r+1}^{m}\|T_{e_\ell}\| \right) \|V_{e_r}\|\\ &\times \left( \prod_{\ell=1}^{r-1}\|H_{e_\ell}\| \right). \end{aligned} }
H_fUse in source · 5 passages
Search aliases: H_f
Use in source · 02-static-core-transfer-theory.tex, line 201
For composable edges e:i→ j and f:j→ k, direct block multiplication gives T_fT_e = H_fH_e+U_fV_e · H_fU_e+U_fK_e V_fH_e+K_fV_e · V_fU_e+K_fK_e . The induced core-to-core block is therefore P_kT_fT_eP_i = H_fH_e+U_fV_e. The term U_fV_e is a residual-mediated correction: information leaves the candidate core at the intermediate node and later re-enters it. Consequently, the simple path product H_fH_e faithfully represents full core transport only under a preservation condition such as V_e=0, or un…
Exact mathematical passage
T_fT_e = \begin{pmatrix} H_fH_e+U_fV_e & H_fU_e+U_fK_e\\ V_fH_e+K_fV_e & V_fU_e+K_fK_e \end{pmatrix}.
H_{hm}Use in source · 3 passages
Search aliases: H_hm
Use in source · 01-foundational-thesis.tex, line 157
Consider three strata: h=human conceptual state, m=model-formal state, a=artifact state. Let the corresponding core spaces be C_h,C_m,C_a, with transfers H_hm:C_h→ C_m, H_ma:C_m→ C_a, H_ah:C_a→ C_h. A proposed shared item begins as c_h∈ C_h, is formalized as c_m=H_hmc_h, externalized as c_a=H_mac_m, and re-enters human reasoning as c_h'=H_ahc_a. The round-trip consistency condition is c_h'=c_h, or equivalently H_ahH_maH_hmc_h=c_h. Thus the genuinely shared part of C_h is not automatically all of…
Exact mathematical passage
H_{hm}:C_h\to C_m, \qquad H_{ma}:C_m\to C_a, \qquad H_{ah}:C_a\to C_h.
H_mUse in source · 2 passages
Search aliases: H_m
Use in source · 04-approximate-workspaces.tex, line 694
[Pathwise core--residual Duhamel formula] The deviation of full path transport from pure core transport is exactly · T_m⋯ T_1ι_i_0^C - ι_i_m^C H_m⋯ H_1 · = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r
Exact mathematical passage
\boxed{ \begin{aligned} &T_m\cdots T_1\iota_{i_0}^C - \iota_{i_m}^C H_m\cdots H_1\\ &\qquad= \sum_{r=1}^{m} T_m\cdots T_{r+1} \iota_{i_r}^R V_r H_{r-1}\cdots H_1. \end{aligned} }
H_{ma}Use in source · 3 passages
Search aliases: H_ma
Use in source · 01-foundational-thesis.tex, line 157
Consider three strata: h=human conceptual state, m=model-formal state, a=artifact state. Let the corresponding core spaces be C_h,C_m,C_a, with transfers H_hm:C_h→ C_m, H_ma:C_m→ C_a, H_ah:C_a→ C_h. A proposed shared item begins as c_h∈ C_h, is formalized as c_m=H_hmc_h, externalized as c_a=H_mac_m, and re-enters human reasoning as c_h'=H_ahc_a. The round-trip consistency condition is c_h'=c_h, or equivalently H_ahH_maH_hmc_h=c_h. Thus the genuinely shared part of C_h is not automatically all of…
Exact mathematical passage
H_{hm}:C_h\to C_m, \qquad H_{ma}:C_m\to C_a, \qquad H_{ah}:C_a\to C_h.
H_PUse in source · 2 passages
Search aliases: H_P
Use in source · 07-relational-irreducibility.tex, line 383
[XOR witness pair] Under the intact law P, let X_1,X_2oversetiid∼Bernoulli(1/2), Y=X_1⊕ X_2. Then each (X_i,Y) pair is independent and uniform, so H_P(Ymid X_i)=1 bit, H_P(Ymid X_1,X_2)=0. Let Q make X_1,X_2,Y mutually independent fair bits. Then Q_(X_i,Y)=P_(X_i,Y) (i=1,2), but H_Q(Ymid X_1,X_2)=1 bit. Therefore Δ_joint^log=1 bit, k_0=2, Δ_tr(Q)=1 bit. This proves predictive relational structure relative to the declared variables. It does not, by itself, prove that any workspace variable is cau…
Exact mathematical passage
H_P(Y\mid X_i)=1\text{ bit}, \qquad H_P(Y\mid X_1,X_2)=0.
H_QUse in source · 2 passages
Search aliases: H_Q
Use in source · 07-relational-irreducibility.tex, line 394
ness pair] Under the intact law P, let X_1,X_2oversetiid∼Bernoulli(1/2), Y=X_1⊕ X_2. Then each (X_i,Y) pair is independent and uniform, so H_P(Ymid X_i)=1 bit, H_P(Ymid X_1,X_2)=0. Let Q make X_1,X_2,Y mutually independent fair bits. Then Q_(X_i,Y)=P_(X_i,Y) (i=1,2), but H_Q(Ymid X_1,X_2)=1 bit. Therefore Δ_joint^log=1 bit, k_0=2, Δ_tr(Q)=1 bit. This proves predictive relational structure relative to the declared variables. It does not, by itself, prove that any workspace variable is causally ac…
Exact mathematical passage
H_Q(Y\mid X_1,X_2)=1\text{ bit}.
H_rUse in source · 4 passages
Search aliases: H_r
Use in source · 04-approximate-workspaces.tex, line 677
Let a path have vertices i_0xrightarrowe_1i_1xrightarrowe_2⋯ xrightarrowe_mi_m. Write T_r=T_e_r, H_r=H_e_r, V_r=V_e_r, and let ι_i^C:C_i↪ X_i, ι_i^R:R_i↪ X_i be the canonical inclusions. Empty products below are identities.
Exact mathematical passage
T_r=T_{e_r}, \quad H_r=H_{e_r}, \quad V_r=V_{e_r},
\mathcal H_rUse in source · 2 passages
Search aliases: H_r mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1043
[Approximate hierarchical collapse bound] Let F_r: H_r→ H_r+1, widetilde F_r: H_r→ H_r+1 be exact and implemented level-collapse maps for r=0,…,R-1. Let R_r⊆ H_r contain the exact and implemented states reachable at level r. Assume, on R_r, F_r(x)-F_r(y) ≤ L_r x-y and sup_x∈ R_r widetilde F_r(x)-F_r(x) ≤ δ_r. Then · widetilde F_R-1∘⋯∘widetilde F_0(x) - F_R-1∘⋯∘ F_0(x)
Exact mathematical passage
F_r:\mathcal H_r\to\mathcal H_{r+1}, \qquad \widetilde F_r:\mathcal H_r\to\mathcal H_{r+1}
\mathcal H_{r+1}Use in source · 1 passage
Search aliases: H_r+1 mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1043
[Approximate hierarchical collapse bound] Let F_r: H_r→ H_r+1, widetilde F_r: H_r→ H_r+1 be exact and implemented level-collapse maps for r=0,…,R-1. Let R_r⊆ H_r contain the exact and implemented states reachable at level r. Assume, on R_r, F_r(x)-F_r(y) ≤ L_r x-y and sup_x∈ R_r widetilde F_r(x)-F_r(x) ≤ δ_r. Then · widetilde F_R-1∘⋯∘widetilde F_0(x) - F_R-1∘⋯∘ F_0(x)
Exact mathematical passage
F_r:\mathcal H_r\to\mathcal H_{r+1}, \qquad \widetilde F_r:\mathcal H_r\to\mathcal H_{r+1}
H_{r-1}Use in source · 1 passage
Search aliases: H_r-1
Use in source · 04-approximate-workspaces.tex, line 694
[Pathwise core--residual Duhamel formula] The deviation of full path transport from pure core transport is exactly · T_m⋯ T_1ι_i_0^C - ι_i_m^C H_m⋯ H_1 · = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r
Exact mathematical passage
\boxed{ \begin{aligned} &T_m\cdots T_1\iota_{i_0}^C - \iota_{i_m}^C H_m\cdots H_1\\ &\qquad= \sum_{r=1}^{m} T_m\cdots T_{r+1} \iota_{i_r}^R V_r H_{r-1}\cdots H_1. \end{aligned} }
h_tUse in source · 4 passages
Search aliases: h_t
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 790
Consider three agents: V_MA={P,M,R}, called the planner, monitor, and recorder. The global workspace-control state is c_t=(g_t,b_t,h_t)∈ F_2^3, where: ll g_t=goal bit, · b_t=environment or belief bit,
Exact mathematical passage
c_t=(g_t,b_t,h_t)\in\mathbb F_2^3,
h_{t+1}Use in source · 3 passages
Search aliases: h_t+1
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 945
Post-action health evolves according to h_t+1=h_t^-lor r_t. Define the maintenance deficit e_t=1-h_t. Under the intact policy, h_t+1=1 and e_t+1=0 for both damage states. Under the matched no-repair intervention and h_t^-=0, e_t+1^(0)=1. Thus the measured causal repair gain is Δ_maint=1. The closed-loop recurrence has β=0, overline d=0, overlineϵ=0, so Theorem~[source reference] gives sup_t e_t=0 after each repair action. Monitor-blind random repair fails the specificity control whenever it eith…
Exact mathematical passage
h_{t+1}=h_t^-\lor r_t.
h_t^-Use in source · 10 passages
Search aliases: h_t^-
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 847
After a possible damage event, let the pre-repair health be h_t^-∈{0,1}. The system chooses a joint action u_t=(a_t,r_t)∈{0,1}^2, where a_t is a task action and r_t is a repair action. Define the optimal task action a_t^*=g_t⊕ b_t⊕ h_t^- and optimal repair action r_t^*=1-h_t^-. No individual node determines the full pair (a_t^*,r_t^*): item the planner lacks h_t^-; item the monitor lacks g_t; and item the recorder lacks b_t. Every two-node coalition determines all three workspace bits and theref…
Exact mathematical passage
h_t^-\in\{0,1\}.
\mathbf H_t^1Use in source · 1 passage
Search aliases: H_t^1 mathbf
Use in source · 07-relational-irreducibility.tex, line 265
Let P be the intact law of (Y_t^+, H_t^1,…, H_t^n). Define the local-marginal null class N_marg(P) = { Q: Q_ H_t^i=P_ H_t^i for every i }, and the stronger local-predictive-matched class N_pred(P) = { Q: Q_(Y_t^+, H_t^i) = P_(Y_t^+, H_t^i) for every i }. Because H_t^i can include the complete local trajectory, the latter class can preserve all single-component temporal and predictive behavior while altering cross-component organization.
Exact mathematical passage
(Y_t^+,\mathbf H_t^1,\ldots,\mathbf H_t^n)
\mathbf H_t^BUse in source · 2 passages
Search aliases: H_t^B mathbf
Use in source · 07-relational-irreducibility.tex, line 40
[Coalition log-risk identity] Assume H(Y_t^+)<∞. If A⊆ B⊆ V, then Risk_log(A)-Risk_log(B) = I ( Y_t^+; H_t^B mid H_t^A ). In particular, Risk_log(A)-Risk_log(V) = I ( Y_t^+; H_t mid H_t^A ).
Exact mathematical passage
\boxed{ \Risk_{\log}(A)-\Risk_{\log}(B) = I\!\left( Y_t^+;\mathbf H_t^B \mid \mathbf H_t^A \right). }
\mathbf H_t^iUse in source · 9 passages
Search aliases: H_t^i mathbf
Use in source · 07-relational-irreducibility.tex, line 267
Let P be the intact law of (Y_t^+, H_t^1,…, H_t^n). Define the local-marginal null class N_marg(P) = { Q: Q_ H_t^i=P_ H_t^i for every i }, and the stronger local-predictive-matched class N_pred(P) = { Q: Q_(Y_t^+, H_t^i) = P_(Y_t^+, H_t^i) for every i }. Because H_t^i can include the complete local trajectory, the latter class can preserve all single-component temporal and predictive behavior while altering cross-component organization.
Exact mathematical passage
\mathcal N_{\mathrm{marg}}(P) = \left\{ Q: Q_{\mathbf H_t^i}=P_{\mathbf H_t^i} \text{ for every }i \right\},
\mathbf H_t^nUse in source · 1 passage
Search aliases: H_t^n mathbf
Use in source · 07-relational-irreducibility.tex, line 265
Let P be the intact law of (Y_t^+, H_t^1,…, H_t^n). Define the local-marginal null class N_marg(P) = { Q: Q_ H_t^i=P_ H_t^i for every i }, and the stronger local-predictive-matched class N_pred(P) = { Q: Q_(Y_t^+, H_t^i) = P_(Y_t^+, H_t^i) for every i }. Because H_t^i can include the complete local trajectory, the latter class can preserve all single-component temporal and predictive behavior while altering cross-component organization.
Exact mathematical passage
(Y_t^+,\mathbf H_t^1,\ldots,\mathbf H_t^n)
\mathcal H_t^SUse in source · 3 passages
Search aliases: H_t^S mathcal
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 141
Let H_t^S be the history available to coalition S⊆ V. For a loss ℓ_G, define goal-reconstruction risk Risk_G(S) = inf_f E [ ℓ_G ( G_t, f( H_t^S) ) ]. For tolerance ε, define k_G,ε = min { |S|: Risk_G(S) ≤ Risk_G(V)+ε }. A goal is locally stored when k_G,ε=1. It is distributed relative to the declared decomposition when k_G,ε≥2.
Exact mathematical passage
\mathcal H_t^S
\mathbf H_t^{\{i\}}Use in source · 1 passage
Search aliases: H_t^{i} mathbf
Use in source · 07-relational-irreducibility.tex, line 95
Define the coalition gap Δ_A^ℓ = Risk_ℓ(A)-Risk_ℓ(V) ≥0. The node-level joint advantage is Δ_joint^ℓ = min_i∈ V Δ_{i}^ℓ. Under logarithmic loss, Δ_joint^log = min_i∈ V I ( Y_t^+; H_t mid H_t^{i} ). Therefore Δ_joint^log>0 means that every individual component omits some predictive information available to the complete system.
Exact mathematical passage
\boxed{ \Delta_{\mathrm{joint}}^{\log} = \min_{i\in V} I\!\left( Y_t^+;\mathbf H_t \mid \mathbf H_t^{\{i\}} \right). }
H_{uv}Use in source · 1 passage
Search aliases: H_uv
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 433
A learned transfer map is not absolutely identifiable when local coordinates are latent. Under local invertible changes X_u'=g_uX_u, X_v'=g_vX_v, the same abstract transfer is represented by H_uv'=g_vH_uvg_u^-1. The identifiable object is therefore the gauge class [H]_ G = { (g_t(e)H_eg_s(e)^-1)_e∈ E : (g_i)_i∈ V∈ G }. Any formation claim that compares raw matrices across independently trained systems without gauge alignment is ill posed.
Exact mathematical passage
H_{uv}'=g_vH_{uv}g_u^{-1}.
H_{uv}'Use in source · 1 passage
Search aliases: H_uv'
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 433
A learned transfer map is not absolutely identifiable when local coordinates are latent. Under local invertible changes X_u'=g_uX_u, X_v'=g_vX_v, the same abstract transfer is represented by H_uv'=g_vH_uvg_u^-1. The identifiable object is therefore the gauge class [H]_ G = { (g_t(e)H_eg_s(e)^-1)_e∈ E : (g_i)_i∈ V∈ G }. Any formation claim that compares raw matrices across independently trained systems without gauge alignment is ill posed.
Exact mathematical passage
H_{uv}'=g_vH_{uv}g_u^{-1}.
H_\gammaUse in source · 11 passages
Search aliases: H_γ gamma
Use in source · 02-static-core-transfer-theory.tex, line 255
[Autonomous splitting] If U_e=V_e=0 for every edge, then the complete diagram decomposes as the direct sum of two diagrams, X≅ H⊕ K, and every path transfer satisfies T_γ = H_γ · 0 0 · K_γ .
Exact mathematical passage
T_\gamma = \begin{pmatrix} H_\gamma&0\\ 0&K_\gamma \end{pmatrix}.
H_\gamma^gUse in source · 1 passage
Search aliases: H_γ^g gamma
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 67
[Exact gauge covariance] The map G_V:Γ(H)⟶Γ(H^g) is an isomorphism. Therefore, Γ(H^g)=G_VΓ(H), dimΓ(H^g)=dimΓ(H). If the core transports are invertible and o is a root, then H_γ^g=g_oH_γ g_o^-1 for every loop γ:o→ o. Hence the holonomy-fixed core transforms by C_*^g=g_oC_*.
Exact mathematical passage
H_\gamma^g=g_oH_\gamma g_o^{-1}
H_{\gamma_1}Use in source · 1 passage
Search aliases: H_γ_1 gamma
Use in source · 03-exact-shared-cores.tex, line 241
[Finite matrix test] Let γ_1,…,γ_r be fundamental cycle generators and suppose dim C_o=d. Define the stacked obstruction matrix M = H_γ_1-I vdots H_γ_r-I . Then C_*=ker M, d_Workspace=d-rank( M).
Exact mathematical passage
\mathcal M = \begin{pmatrix} H_{\gamma_1}-I\\ \vdots\\ H_{\gamma_r}-I \end{pmatrix}.
H_{\gamma_e}Use in source · 1 passage
Search aliases: H_γ_e gamma
Use in source · 03-exact-shared-cores.tex, line 131
Choose a spanning tree T⊆|G|. Let τ_i:o→ i be the unique tree path. Every non-tree edge e:i→ j determines a fundamental loop γ_e=τ_j^-1eτ_i with transfer H_γ_e=H_τ_j^-1H_eH_τ_i. The fundamental group of a finite graph is generated freely by these cotree loops. Hence it is enough to impose fixed-point conditions for a finite set of generators.
Exact mathematical passage
H_{\gamma_e}=H_{\tau_j}^{-1}H_eH_{\tau_i}.
H_{\gamma_{e_q}}Use in source · 1 passage
Search aliases: H_γ_e_q gamma
Use in source · 03-exact-shared-cores.tex, line 141
[Finite obstruction set] Let e_1,…,e_r be the non-tree edges of a connected finite graph. Then C_* = ⋂_q=1^r ker(H_γ_e_q-I).
Exact mathematical passage
C_* = \bigcap_{q=1}^{r} \ker(H_{\gamma_{e_q}}-I).
H_{\gamma_r}Use in source · 1 passage
Search aliases: H_γ_r gamma
Use in source · 03-exact-shared-cores.tex, line 241
[Finite matrix test] Let γ_1,…,γ_r be fundamental cycle generators and suppose dim C_o=d. Define the stacked obstruction matrix M = H_γ_1-I vdots H_γ_r-I . Then C_*=ker M, d_Workspace=d-rank( M).
Exact mathematical passage
\mathcal M = \begin{pmatrix} H_{\gamma_1}-I\\ \vdots\\ H_{\gamma_r}-I \end{pmatrix}.
H_{\sigma_i}Use in source · 2 passages
Search aliases: H_σ_i sigma
Use in source · 03-exact-shared-cores.tex, line 211
Conversely, let x∈ C_o^Hol_o. Choose a path τ_i:o→ i for each vertex and define c_i=H_τ_ix. This definition is independent of the chosen path. Indeed, if σ_i:o→ i is another path, then σ_i^-1τ_i:o→ o is a loop, and invariance of x gives H_σ_i^-1H_τ_ix=x. Multiplying by H_σ_i yields H_τ_ix=H_σ_ix. For any edge e:i→ j, the paths eτ_i and τ_j both run from o to j. Path independence therefore gives H_ec_i =H_eH_τ_ix =H_τ_jx =c_j. Thus (c_i) is a global compatible section and ev_o((c_i))=x. Hence ev_…
Exact mathematical passage
H_{\sigma_i}
H_{\sigma_i}^{-1}Use in source · 1 passage
Search aliases: H_σ_i^-1 sigma
Use in source · 03-exact-shared-cores.tex, line 208
Conversely, let x∈ C_o^Hol_o. Choose a path τ_i:o→ i for each vertex and define c_i=H_τ_ix. This definition is independent of the chosen path. Indeed, if σ_i:o→ i is another path, then σ_i^-1τ_i:o→ o is a loop, and invariance of x gives H_σ_i^-1H_τ_ix=x. Multiplying by H_σ_i yields H_τ_ix=H_σ_ix. For any edge e:i→ j, the paths eτ_i and τ_j both run from o to j. Path independence therefore gives H_ec_i =H_eH_τ_ix =H_τ_jx =c_j. Thus (c_i) is a global compatible section and ev_o((c_i))=x. Hence ev_…
Exact mathematical passage
H_{\sigma_i}^{-1}H_{\tau_i}x=x.
H_{\tau_i}Use in source · 11 passages
Search aliases: H_τ_i tau
Use in source · 03-exact-shared-cores.tex, line 60
Choose for each vertex i a path τ_i:o→ i. Compatibility gives c_i=H_τ_ic_o. Thus a section with c_o=0 vanishes at every vertex. Hence ev_o is injective.
Exact mathematical passage
c_i=H_{\tau_i}c_o.
H_{\tau_i}^{-1}Use in source · 2 passages
Search aliases: H_τ_i^-1 tau
Use in source · 03-exact-shared-cores.tex, line 476
Choose paths τ_i:o→ i. Naturality along τ_i gives A_iH_τ_i=H_τ_iA_o, so A_i=H_τ_iA_oH_τ_i^-1. Therefore A_o determines every A_i, and Φ_o is injective.
Exact mathematical passage
A_i=H_{\tau_i}A_oH_{\tau_i}^{-1}.
H_{\tau_j}Use in source · 1 passage
Search aliases: H_τ_j tau
Use in source · 03-exact-shared-cores.tex, line 217
independent of the chosen path. Indeed, if σ_i:o→ i is another path, then σ_i^-1τ_i:o→ o is a loop, and invariance of x gives H_σ_i^-1H_τ_ix=x. Multiplying by H_σ_i yields H_τ_ix=H_σ_ix. For any edge e:i→ j, the paths eτ_i and τ_j both run from o to j. Path independence therefore gives H_ec_i =H_eH_τ_ix =H_τ_jx =c_j. Thus (c_i) is a global compatible section and ev_o((c_i))=x. Hence ev_o is surjective and therefore an isomorphism.
Exact mathematical passage
H_ec_i =H_eH_{\tau_i}x =H_{\tau_j}x =c_j.
H_{\tau_j}^{-1}Use in source · 2 passages
Search aliases: H_τ_j^-1 tau
Use in source · 03-exact-shared-cores.tex, line 131
Choose a spanning tree T⊆|G|. Let τ_i:o→ i be the unique tree path. Every non-tree edge e:i→ j determines a fundamental loop γ_e=τ_j^-1eτ_i with transfer H_γ_e=H_τ_j^-1H_eH_τ_i. The fundamental group of a finite graph is generated freely by these cotree loops. Hence it is enough to impose fixed-point conditions for a finite set of generators.
Exact mathematical passage
H_{\gamma_e}=H_{\tau_j}^{-1}H_eH_{\tau_i}.
H_\ellUse in source · 1 passage
Search aliases: H_ℓ ell
Use in source · 04-approximate-workspaces.tex, line 709
· = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r · × (∏_ℓ=1^r-1 H_ℓ ), and the same right-hand side bounds P_i_mT_m⋯ T_1P_i_0-H_m⋯ H_1 .
Exact mathematical passage
\boxed{ \begin{aligned} \|Q_{i_m}T_m\cdots T_1P_{i_0}\| \leq \sum_{r=1}^{m} &\left(\prod_{\ell=r+1}^{m}\|T_\ell\|\right) \|V_r\|\\ &\times \left(\prod_{\ell=1}^{r-1}\|H_\ell\|\right), \end{aligned} }
\mathrm{HAI}Use in source · 4 passages
Search aliases: HAI mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 471
Consider four heterogeneous components: V_HAI={H,M,X,A}, where: item H is a human researcher who maintains goals and semantic direction; item M is a language-model process that constructs local formalizations; item X is an execution and verification process that compiles, tests, or falsifies candidate artifacts; and item A is a persistent artifact store containing exact source, results, and versioned handoff state. Let the abstract research state be c=(g,d,p,v)^ T∈ R^4, where: ll g=goal and acce…
Exact mathematical passage
V_{\mathrm{HAI}}=\{H,M,X,A\},
\mathrm{HH}Use in source · 9 passages
Search aliases: HH mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 222
Consider two researchers and one persistent notebook: V_HH={P,C,N}, where: item P is a proposer who tracks the theorem statement and open proof obligations; item C is a critic who tracks proof obligations and falsification status; item N is a notebook that tracks the theorem statement and falsification status. The abstract core is c=(q,p,f)^ T∈ R^3, with q · =statement coordinate, · p · =proof-obligation coordinate,
Exact mathematical passage
V_{\mathrm{HH}}=\{P,C,N\},
\mathrm{hist}Use in source · 3 passages
Search aliases: hist mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 109
component q of widehatθ, define its scaffold-only Bayes risk under loss ℓ_q by R_q^Σ = inf_f E [ ℓ_q(q,f(Σ,Ω)) ]. Define the full formation risk by R_q^Σ, H = inf_g E [ ℓ_q(q,g(Σ, D_form,Ω)) ]. The history advantage is Δ_q^hist = R_q^Σ - R_q^Σ, H. A positive history advantage means that formation history contains information about q that is not already recoverable from the declared scaffold and random seed.
Exact mathematical passage
\boxed{ \Delta_q^{\mathrm{hist}} = \mathcal R_q^{\Sigma} - \mathcal R_q^{\Sigma,\mathcal H}. }
\HolUse in source · 18 passages
Search aliases: Hol
Use in source · 02-static-core-transfer-theory.tex, line 357
[Holonomy commutes with abstract operations] For every loop γ:o→ o, H_γρ_o(a)=ρ_o(a)H_γ. Hence ρ_o( A) ⊆ Comm(Hol_o), where Comm(Hol_o) is the commutant of the holonomy representation.
Exact mathematical passage
\rho_o(\mathcal A) \subseteq \operatorname{Comm}(\Hol_o),
\operatorname{Hol}Use in source · 1 passage
Search aliases: Hol operatorname
Use in source · 19-summary-of-main-results.tex, line 8
subtopicT_1: Limit--holonomy theorem Γ(H)≅ C_o^Hol_o.
Exact mathematical passage
\Gamma(H)\cong C_o^{\operatorname{Hol}_o}.
\operatorname{hol}Use in source · 2 passages
Search aliases: hol operatorname
Use in source · 03-exact-shared-cores.tex, line 93
Fix a root o∈ V. For every loop class [γ]∈π_1(|G|,o), define the holonomy Hol([γ])=H_γ∈ GL(C_o). Functoriality gives a group representation hol_o: π_1(|G|,o)⟶ GL(C_o). Its image is the holonomy group Hol_o=im(hol_o).
Exact mathematical passage
\operatorname{hol}_o: \pi_1(|G|,o)\longrightarrow GL(C_o).
\Hol_oUse in source · 17 passages
Search aliases: Hol_o Hol
Use in source · 02-static-core-transfer-theory.tex, line 357
[Holonomy commutes with abstract operations] For every loop γ:o→ o, H_γρ_o(a)=ρ_o(a)H_γ. Hence ρ_o( A) ⊆ Comm(Hol_o), where Comm(Hol_o) is the commutant of the holonomy representation.
Exact mathematical passage
\rho_o(\mathcal A) \subseteq \operatorname{Comm}(\Hol_o),
\operatorname{Hol}_oUse in source · 1 passage
Search aliases: Hol_o operatorname
Use in source · 19-summary-of-main-results.tex, line 8
subtopicT_1: Limit--holonomy theorem Γ(H)≅ C_o^Hol_o.
Exact mathematical passage
\Gamma(H)\cong C_o^{\operatorname{Hol}_o}.
\operatorname{hol}_oUse in source · 2 passages
Search aliases: hol_o operatorname
Use in source · 03-exact-shared-cores.tex, line 93
Fix a root o∈ V. For every loop class [γ]∈π_1(|G|,o), define the holonomy Hol([γ])=H_γ∈ GL(C_o). Functoriality gives a group representation hol_o: π_1(|G|,o)⟶ GL(C_o). Its image is the holonomy group Hol_o=im(hol_o).
Exact mathematical passage
\operatorname{hol}_o: \pi_1(|G|,o)\longrightarrow GL(C_o).
\mathsf{horizons}Use in source · 1 passage
Search aliases: horizons mathsf
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1051
The machine-readable record should include: SpecificationRecord ={ · reference, family, equivalence_classes, metric, · targets, losses, horizons, interventions, · null_panels, thresholds, selection_history, · identified_sets, uniform_bounds, gate_envelopes }. Every omitted family member requires a reason. Every changed specification requires a data-split label and time stamp. Every gate requires pointwise and family-wide status.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{SpecificationRecord} =\{& \mathsf{reference}, \mathsf{family}, \mathsf{equivalence\_classes}, \mathsf{metric},\\ &\mathsf{targets}, \mathsf{losses}, \mathsf{horizons}, \mathsf{interventions},\\ &\mathsf{null\_panels}, \mathsf{thresholds}, \mathsf{selection\_history},\\ &\mathsf{identified\_sets}, \mathsf{uniform\_bounds}, \mathsf{gate\_envelopes} \}. \end{aligned} }
\mathcal I'Use in source · 2 passages
Search aliases: I' mathcal
Use in source · 12-identity-through-time-and-replacement.tex, line 18
Let R=(G, C,D,ρ, I, K) and R'=(G', C',D',ρ', I', K') be two realizations. A correspondence begins with a graph isomorphism φ:G→ G'. After relabeling by φ, let J_i:C_i→ C_i' be unitary local identifications and define J_V=⊕_i∈ VJ_i, J_E=⊕_e∈ EJ_t(e).
Exact mathematical passage
\mathfrak R'=(G',\mathbf C',D',\rho',\mathcal I',\mathcal K')
I_{\mathbb P}Use in source · 1 passage
Search aliases: I_ P mathbb
Use in source · 06-dynamic-workspace-theory.tex, line 425
Define the observational alignment defect by δ_align^obs(W_t) = I_ P(Y_t^+; H_tmid W_t). For a countable intervention family with declared weights q_ι>0, ∑_ι q_ι=1, define δ_align^ I(W_t) = ∑_ι∈ I q_ι I_ P^ι (Y_t^+; H_tmid W_t). For bounded decision losses, Proposition~[source reference] applies under each intervention and gives the weighted bound ∑_ιq_ι [ Risk_ℓ^ι(W_t) - Risk_ℓ^ι( H_t) ] ≤ sqrtfrac δ_align^ I(W_t)2.
Exact mathematical passage
\boxed{ \delta_{\mathrm{align}}^{\mathrm{obs}}(W_t) = I_{\mathbb P}(Y_t^+;\mathbf H_t\mid W_t). }
I_{\mathbb P^\iota}Use in source · 1 passage
Search aliases: I_ P^ι mathbb iota
Use in source · 06-dynamic-workspace-theory.tex, line 434
Define the observational alignment defect by δ_align^obs(W_t) = I_ P(Y_t^+; H_tmid W_t). For a countable intervention family with declared weights q_ι>0, ∑_ι q_ι=1, define δ_align^ I(W_t) = ∑_ι∈ I q_ι I_ P^ι (Y_t^+; H_tmid W_t). For bounded decision losses, Proposition~[source reference] applies under each intervention and gives the weighted bound ∑_ιq_ι [ Risk_ℓ^ι(W_t) - Risk_ℓ^ι( H_t) ] ≤ sqrtfrac δ_align^ I(W_t)2.
Exact mathematical passage
\boxed{ \delta_{\mathrm{align}}^{\mathcal I}(W_t) = \sum_{\iota\in\mathcal I} q_\iota I_{\mathbb P^\iota} (Y_t^+;\mathbf H_t\mid W_t). }
i_0Use in source · 6 passages
Search aliases: i_0
Use in source · 04-approximate-workspaces.tex, line 672
Let a path have vertices i_0xrightarrowe_1i_1xrightarrowe_2⋯ xrightarrowe_mi_m. Write T_r=T_e_r, H_r=H_e_r, V_r=V_e_r, and let ι_i^C:C_i↪ X_i, ι_i^R:R_i↪ X_i be the canonical inclusions. Empty products below are identities.
Exact mathematical passage
i_0\xrightarrow{e_1}i_1\xrightarrow{e_2}\cdots \xrightarrow{e_m}i_m.
i_1Use in source · 1 passage
Search aliases: i_1
Use in source · 04-approximate-workspaces.tex, line 672
Let a path have vertices i_0xrightarrowe_1i_1xrightarrowe_2⋯ xrightarrowe_mi_m. Write T_r=T_e_r, H_r=H_e_r, V_r=V_e_r, and let ι_i^C:C_i↪ X_i, ι_i^R:R_i↪ X_i be the canonical inclusions. Empty products below are identities.
Exact mathematical passage
i_0\xrightarrow{e_1}i_1\xrightarrow{e_2}\cdots \xrightarrow{e_m}i_m.
i_2Use in source · 2 passages
Search aliases: i_2
Use in source · 04-approximate-workspaces.tex, line 781
For two consecutive transfers, P_i_2T_2T_1P_i_0 = H_2H_1+U_2V_1, Q_i_2T_2T_1P_i_0 = V_2H_1+K_2V_1. Thus leakage out of the core is first order in the blocks V_r, while an excursion that leaves and then returns to the core contains at least one V-block and one later U-block. For a fixed path length, if U_r , V_r =O(δ) and the diagonal blocks remain bounded, the residual-mediated correction to pure core-to-core transport is O(δ^2), whereas terminal residual leakage can be O(δ). This distinction se…
Exact mathematical passage
P_{i_2}T_2T_1P_{i_0} = H_2H_1+U_2V_1,
I_3Use in source · 3 passages
Search aliases: I_3
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 158
The positive examples use a recurring distributed code. Let c=(c_1,c_2,c_3)^ T∈ R^3 and define three local encodings E_1c=(c_1,c_2), E_2c=(c_2,c_3), E_3c=(c_1,c_3). Then ∑_i=1^3E_i^*E_i=2I_3. No individual encoding is injective, while every two-node coalition is injective. The pairwise frame operators are E_{1,2}^*E_{1,2} · =diag(1,2,1),
Exact mathematical passage
\sum_{i=1}^3E_i^*E_i=2I_3.
I_4Use in source · 1 passage
Search aliases: I_4
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 551
0 · -1 · 0 · 0 · 0 · 0 · 1 · 0 . The rows are orthogonal with squared norm two. Therefore ker D_HAI ≅ R^4, spec(L_HAI) = {0,0,0,0,2,2,2,2}, γ_HAI=2. The full accessible frame operator is F_HMXA=2I_4. No single node is injective. Every three-node coalition reconstructs the full state, and the two opposite pairs {H,X}, {M,A} are already sufficient. Adjacent pairs observe only three of the four coordinates. Hence k_rec=2, d_er=2, while the identity of the sufficient two-node coalition depends on th…
Exact mathematical passage
F_{HMXA}=2I_4.
\mathcal I_AUse in source · 3 passages
Search aliases: I_A mathcal
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 24
A controlled relational realization extends Definition~[source reference] by the tuple A_Workspace = ( R, G, A_t, Y^+, {U_g}_g∈ G, Π, I_A, I_G, I_D, I_R ). Here: item R is the underlying relational realization; item G is a measurable goal-code space; item A_t is the feasible action set at time t; item Y^+ is the relevant future trajectory space; item U_g: Y^+→ R evaluates a trajectory under goal code g; item Π is an admissible class of workspace-level policies; item I_A and I_G are feasible acti…
Exact mathematical passage
\boxed{ \mathfrak A_{\Workspace} = \left( \mathfrak R, \mathcal G, \mathcal A_t, \mathcal Y^+, \{U_g\}_{g\in\mathcal G}, \Pi, \mathcal I_A, \mathcal I_G, \mathcal I_D, \mathcal I_R \right). }
I_{C_*}Use in source · 2 passages
Search aliases: I_C_*
Use in source · 11-reconstruction-and-resilience.tex, line 69
[Coalition reconstruction criterion] For a coalition S, the following are equivalent: item A_S is injective; item F_S is positive definite; item α_S>0; item there exists a linear decoder R_S with R_SA_S=I_C_*. When these conditions hold, the canonical decoder is R_S=A_S^†=F_S^-1A_S^*.
Exact mathematical passage
R_SA_S=I_{C_*}
I_{C_o}Use in source · 1 passage
Search aliases: I_C_o
Use in source · 03-exact-shared-cores.tex, line 103
The obstruction associated with a loop is Ω_γ=H_γ-I_C_o. The maximal path-independent root core is C_* = ⋂_γ:o→ oker(H_γ-I). Equivalently, C_*=C_o^Hol_o=Fix(Hol_o).
Exact mathematical passage
\Omega_\gamma=H_\gamma-I_{C_o}.
I_dUse in source · 1 passage
Search aliases: I_d
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 1061
Let every node store a complete copy of the same core: E_i=I_d for every i. Then coherence is perfect and reconstruction is robust, but k_0=1, min_iδ_i^local=0. If the archive is never used in downstream control, then also η_causal=0. This is a shared representation or archive, not a relationally irreducible workspace.
Exact mathematical passage
E_i=I_d \qquad\text{for every }i.
\mathcal I_DUse in source · 4 passages
Search aliases: I_D mathcal
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 24
A controlled relational realization extends Definition~[source reference] by the tuple A_Workspace = ( R, G, A_t, Y^+, {U_g}_g∈ G, Π, I_A, I_G, I_D, I_R ). Here: item R is the underlying relational realization; item G is a measurable goal-code space; item A_t is the feasible action set at time t; item Y^+ is the relevant future trajectory space; item U_g: Y^+→ R evaluates a trajectory under goal code g; item Π is an admissible class of workspace-level policies; item I_A and I_G are feasible acti…
Exact mathematical passage
\boxed{ \mathfrak A_{\Workspace} = \left( \mathfrak R, \mathcal G, \mathcal A_t, \mathcal Y^+, \{U_g\}_{g\in\mathcal G}, \Pi, \mathcal I_A, \mathcal I_G, \mathcal I_D, \mathcal I_R \right). }
\mathcal I_GUse in source · 3 passages
Search aliases: I_G mathcal
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 24
A controlled relational realization extends Definition~[source reference] by the tuple A_Workspace = ( R, G, A_t, Y^+, {U_g}_g∈ G, Π, I_A, I_G, I_D, I_R ). Here: item R is the underlying relational realization; item G is a measurable goal-code space; item A_t is the feasible action set at time t; item Y^+ is the relevant future trajectory space; item U_g: Y^+→ R evaluates a trajectory under goal code g; item Π is an admissible class of workspace-level policies; item I_A and I_G are feasible acti…
Exact mathematical passage
\boxed{ \mathfrak A_{\Workspace} = \left( \mathfrak R, \mathcal G, \mathcal A_t, \mathcal Y^+, \{U_g\}_{g\in\mathcal G}, \Pi, \mathcal I_A, \mathcal I_G, \mathcal I_D, \mathcal I_R \right). }
i_mUse in source · 6 passages
Search aliases: i_m
Use in source · 04-approximate-workspaces.tex, line 672
Let a path have vertices i_0xrightarrowe_1i_1xrightarrowe_2⋯ xrightarrowe_mi_m. Write T_r=T_e_r, H_r=H_e_r, V_r=V_e_r, and let ι_i^C:C_i↪ X_i, ι_i^R:R_i↪ X_i be the canonical inclusions. Empty products below are identities.
Exact mathematical passage
i_0\xrightarrow{e_1}i_1\xrightarrow{e_2}\cdots \xrightarrow{e_m}i_m.
I_PUse in source · 3 passages
Search aliases: I_P
Use in source · 08-causal-efficacy-and-reentry.tex, line 255
] Let Y be finite, let P be the intact law at a fixed decision time, and let W_t=π_t( H_t) be a structurally supported candidate. Let Q⊆ N_pred(P) be a nonempty, predeclared panel of validated relation-breaking nulls. Assume: item exact structural--operational alignment, I_P(Y_t^+; H_tmid W_t)=0; item a positive node-level information gap, δ_node = min_i∈ V I_P(Y_t^+; H_tmid H_t^i) >0; item a positive robust matched-null gap, δ_null = min_Q∈ Q [ H_Q(Y_t^+mid H_t) - H_P(Y_t^+mid H_t) ] >0; item a…
Exact mathematical passage
I_P(Y_t^+;\mathbf H_t\mid W_t)=0;
i_rUse in source · 3 passages
Search aliases: i_r
Use in source · 04-approximate-workspaces.tex, line 694
[Pathwise core--residual Duhamel formula] The deviation of full path transport from pure core transport is exactly · T_m⋯ T_1ι_i_0^C - ι_i_m^C H_m⋯ H_1 · = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r
Exact mathematical passage
\boxed{ \begin{aligned} &T_m\cdots T_1\iota_{i_0}^C - \iota_{i_m}^C H_m\cdots H_1\\ &\qquad= \sum_{r=1}^{m} T_m\cdots T_{r+1} \iota_{i_r}^R V_r H_{r-1}\cdots H_1. \end{aligned} }
i_{r-1}Use in source · 1 passage
Search aliases: i_r-1
Use in source · 04-approximate-workspaces.tex, line 730
For every step, T_rι_i_r-1^C = ι_i_r^CH_r+ ι_i_r^RV_r. Telescope the sequence T_m⋯ T_r+1ι_i_r^C H_r⋯ H_1, r=0,1,…,m. The difference between consecutive terms is exactly the r-th summand in the displayed formula. Projection onto R_i_m or C_i_m, followed by submultiplicativity of the operator norm, gives the two bounds.
Exact mathematical passage
T_r\iota_{i_{r-1}}^C = \iota_{i_r}^CH_r+ \iota_{i_r}^RV_r.
\mathcal I_{\mathrm{rep}}Use in source · 1 passage
Search aliases: I_rep mathcal mathrm
Use in source · 12-identity-through-time-and-replacement.tex, line 601
A complete replacement audit must report at least I_rep = ( q_str, δ_op, δ_causal, δ_rec, μ^keep ). The failure modes are different: ll q_str large · the shared subspace changed,
Exact mathematical passage
\boxed{ \mathcal I_{\mathrm{rep}} = \left( q_{\mathrm{str}}, \delta_{\mathrm{op}}, \delta_{\mathrm{causal}}, \delta_{\mathrm{rec}}, \mu^{\mathrm{keep}} \right). }
\mathcal I_WUse in source · 1 passage
Search aliases: I_W mathcal
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 26
D,Y^+,ℓ,τ, I, N,Θ); item the admissible decomposition family D and specification family S; item the target trajectory Y^+, loss, horizon, and environment family; item the candidate structural workspace extractor; item the goal family G, utility normalization, and feasible action set; item the intervention families I_W, I_G, I_A, I_D, I_R; item the null panel and the local distributions each null must preserve; item the required certificate level and every numerical threshold; item the formation,…
Exact mathematical passage
\mathcal I_W,\mathcal I_G,\mathcal I_A, \mathcal I_D,\mathcal I_R
\mathcal I_{\Workspace}Use in source · 2 passages
Search aliases: I_Workspace mathcal Workspace
Use in source · 08-causal-efficacy-and-reentry.tex, line 107
A causal effect on the target is not workspace-specific if an equal-cost perturbation outside the candidate workspace produces the same effect. Let c(ι) be a declared intervention cost and let I_Workspace(r), I_⊥(r) be matched families with cost r, the first changing workspace coordinates and the second changing complementary coordinates while preserving the workspace value as closely as the implementation permits.
Exact mathematical passage
\mathcal I_{\Workspace}(r), \qquad \mathcal I_{\perp}(r)
I_{X_i}Use in source · 1 passage
Search aliases: I_X_i
Use in source · 02-static-core-transfer-theory.tex, line 38
For every i∈ V, assign a finite-dimensional Hilbert space X_i. For every edge, assign a linear transfer T_e:X_s(e)⟶ X_t(e). The path transfer is T_γ=T_e_m⋯ T_e_2T_e_1, T_1_i=I_X_i. Accordingly, the static transfer system is a functor X:Path(G)⟶FinHilb.
Exact mathematical passage
T_\gamma=T_{e_m}\cdots T_{e_2}T_{e_1}, \qquad T_{1_i}=I_{X_i}.
I_{\Gamma(H)}Use in source · 1 passage
Search aliases: I_Γ(H) Gamma
Use in source · 03-exact-shared-cores.tex, line 402
[Inherited algebraic structure] Any algebraic relation satisfied by ρ_i( A) is inherited by the global action. In particular, if a,b∈ A, then ρ_Γ(ab)=ρ_Γ(a)ρ_Γ(b), ρ_Γ(1)=I_Γ(H).
Exact mathematical passage
\rho_\Gamma(ab)=\rho_\Gamma(a)\rho_\Gamma(b), \qquad \rho_\Gamma(1)=I_{\Gamma(H)}.
\mathcal I_{\perp}Use in source · 2 passages
Search aliases: I_⊥ mathcal perp
Use in source · 08-causal-efficacy-and-reentry.tex, line 107
A causal effect on the target is not workspace-specific if an equal-cost perturbation outside the candidate workspace produces the same effect. Let c(ι) be a declared intervention cost and let I_Workspace(r), I_⊥(r) be matched families with cost r, the first changing workspace coordinates and the second changing complementary coordinates while preserving the workspace value as closely as the implementation permits.
Exact mathematical passage
\mathcal I_{\Workspace}(r), \qquad \mathcal I_{\perp}(r)
\mathrm{id}Use in source · 18 passages
Search aliases: id mathrm
Use in source · 01-foundational-thesis.tex, line 334
Persistence does not require token identity. Let R_t and R_t+1 be temporally successive realizations. Continuity is possible when there exists an admissible transport J_t: R_trightsquigarrow R_t+1 that preserves the operative core and its causal role within tolerance: d_id(Workspace_t,Workspace_t+1)≤ε. Thus a workspace may persist by reconstruction rather than by retaining an unchanged physical inscription.
Exact mathematical passage
d_{\mathrm{id}}(\Workspace_t,\Workspace_{t+1})\leq\varepsilon.
\operatorname{id}Use in source · 1 passage
Search aliases: id operatorname
Use in source · 06-dynamic-workspace-theory.tex, line 356
The observational state is the special case I={id}. A causal workspace claim should align with Z_t^ I for a declared intervention family rather than only with the observational state.
Exact mathematical passage
\mathcal I=\{\operatorname{id}\}
\mathsf{identified\_sets}Use in source · 2 passages
Search aliases: identified_sets mathsf
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1051
The machine-readable record should include: SpecificationRecord ={ · reference, family, equivalence_classes, metric, · targets, losses, horizons, interventions, · null_panels, thresholds, selection_history, · identified_sets, uniform_bounds, gate_envelopes }. Every omitted family member requires a reason. Every changed specification requires a data-split label and time stamp. Every gate requires pointwise and family-wide status.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{SpecificationRecord} =\{& \mathsf{reference}, \mathsf{family}, \mathsf{equivalence\_classes}, \mathsf{metric},\\ &\mathsf{targets}, \mathsf{losses}, \mathsf{horizons}, \mathsf{interventions},\\ &\mathsf{null\_panels}, \mathsf{thresholds}, \mathsf{selection\_history},\\ &\mathsf{identified\_sets}, \mathsf{uniform\_bounds}, \mathsf{gate\_envelopes} \}. \end{aligned} }
\mathrm{iid}Use in source · 1 passage
Search aliases: iid mathrm
Use in source · 07-relational-irreducibility.tex, line 377
[XOR witness pair] Under the intact law P, let X_1,X_2oversetiid∼Bernoulli(1/2), Y=X_1⊕ X_2. Then each (X_i,Y) pair is independent and uniform, so H_P(Ymid X_i)=1 bit, H_P(Ymid X_1,X_2)=0. Let Q make X_1,X_2,Y mutually independent fair bits. Then Q_(X_i,Y)=P_(X_i,Y) (i=1,2), but H_Q(Ymid X_1,X_2)=1 bit. Therefore Δ_joint^log=1 bit, k_0=2, Δ_tr(Q)=1 bit. This proves predictive relational structure relative to the declared variables. It does not, by itself, prove that any workspace variable is cau…
Exact mathematical passage
X_1,X_2\overset{\mathrm{iid}}{\sim}\operatorname{Bernoulli}(1/2), \qquad Y=X_1\oplus X_2.
\operatorname{im}Use in source · 4 passages
Search aliases: im operatorname
Use in source · 03-exact-shared-cores.tex, line 98
Fix a root o∈ V. For every loop class [γ]∈π_1(|G|,o), define the holonomy Hol([γ])=H_γ∈ GL(C_o). Functoriality gives a group representation hol_o: π_1(|G|,o)⟶ GL(C_o). Its image is the holonomy group Hol_o=im(hol_o).
Exact mathematical passage
\Hol_o=\operatorname{im}(\operatorname{hol}_o).
\mathrm{in}Use in source · 1 passage
Search aliases: in mathrm
Use in source · 02-static-core-transfer-theory.tex, line 183
Core leakage, residual contamination, and total transfer defect are measured by λ_e^out= V_e , λ_e^in= U_e , δ_e^tr = U_e + V_e . These quantities depend on the chosen norms and projectors. Their empirical meaning must therefore be tied to a declared intervention and prediction protocol.
Exact mathematical passage
\lambda_e^{\mathrm{out}}=\|V_e\|, \qquad \lambda_e^{\mathrm{in}}=\|U_e\|,
\indepUse in source · 9 passages
Search aliases: indep
Use in source · 06-dynamic-workspace-theory.tex, line 149
[Predictive-state sufficiency and minimality, T_12] Under Definition~[source reference]: item Z_t is predictively sufficient: Y_t^+indep H_tmid Z_t. item If S_t=s( H_t) is any other history statistic satisfying Y_t^+indep H_tmid S_t, then there is a measurable map ϕ such that Z_t=ϕ(S_t) almost surely. item Consequently, any two minimal sufficient predictive states are measurably isomorphic after removal of null sets.
Exact mathematical passage
Y_t^+\indep\mathbf H_t\mid Z_t.
\inf_{\mathfrak J}Use in source · 1 passage
Search aliases: inf_ J inf mathfrak
Use in source · 12-identity-through-time-and-replacement.tex, line 374
A composite identity cost is Cost( J) = a q_str +b δ_op( J) +c δ_causal(β) +d δ_rec(β), where a,b,c,d>0 are declared scales. Define d_id( R, R') = inf_ J Cost( J). This quantity is a task-relative optimization surrogate until the admissible correspondence class, intervention matching, divergence, and scales are fixed. It does not replace the coordinatewise identity profile or the non-collapse gate.
Exact mathematical passage
\boxed{ d_{\mathrm{id}}(\mathfrak R,\mathfrak R') = \inf_{\mathfrak J} \operatorname{Cost}(\mathfrak J). }
\inf_{\mathfrak J_{0:T}}Use in source · 1 passage
Search aliases: inf_ J_0:T inf mathfrak
Use in source · 12-identity-through-time-and-replacement.tex, line 571
For a sequence of realizations R_0, R_1,…, R_T, let J_t: R_t→ R_t+1 be admissible correspondences. Define the path length Len( J_0:T) = ∑_t=0^T-1Cost( J_t) and the induced directed path quasi-pseudometric d_path^rightarrow( R_0, R_T) = inf_ J_0:T Len( J_0:T). Concatenation gives the directed triangle inequality. Because replacement costs and intervention divergences need not be symmetric, symmetry is not assumed. When reverse correspondences exist, define the symmetrized pseudometric d_path^sym(…
Exact mathematical passage
\boxed{ d_{\mathrm{path}}^{\rightarrow}(\mathfrak R_0,\mathfrak R_T) = \inf_{\mathfrak J_{0:T}} \operatorname{Len}(\mathfrak J_{0:T}). }
\inf_{\mathfrak R_0\in\mathfrak M}Use in source · 1 passage
Search aliases: inf_ R_0∈ M inf mathfrak in mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 694
In finite samples, the identified set is itself uncertain. Let widehat R_1-δ be a confidence region satisfying inf_ R_0∈ M P_ R_0 ( R_0∈ widehat R_1-δ ) ≥1-δ. A conservative robust lower margin is widehat r_1-δ = inf_ R∈widehat R_1-δ inf_ς∈ S min_q m_q(W_ R;ς). If widehat r_1-δ>0, a false specification-robust certificate has probability at most δ, provided that the model class and specification family were fixed before the confidence region was computed. This confidence-set approach is useful wh…
Exact mathematical passage
\inf_{\mathfrak R_0\in\mathfrak M} \mathbb P_{\mathfrak R_0} \left( \mathfrak R_0\in \widehat{\mathfrak R}_{1-\delta} \right) \geq1-\delta.
\inf_{\mathfrak R\in\mathfrak R_{\mathrm{ID}}}Use in source · 1 passage
Search aliases: inf_ R∈ R_ID inf mathfrak in mathfrak mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 627
For robustness across specifications, define the realization-level robust margin r_ S( R) = inf_ς∈ S min_q∈ J_* m_q(W_ R;ς) and its identified range underline r_ID, S = inf_ R∈ R_ID r_ S( R), overline r_ID, S = sup_ R∈ R_ID r_ S( R).
Exact mathematical passage
\underline r_{\mathrm{ID},\mathfrak S} = \inf_{\mathfrak R\in\mathfrak R_{\mathrm{ID}}} r_{\mathfrak S}(\mathfrak R), \qquad \overline r_{\mathrm{ID},\mathfrak S} = \sup_{\mathfrak R\in\mathfrak R_{\mathrm{ID}}} r_{\mathfrak S}(\mathfrak R).
\inf_{\mathfrak R\in\widehat{\mathfrak R}_{1-\delta}}Use in source · 1 passage
Search aliases: inf_ R∈widehat R_1-δ inf mathfrak in widehat mathfrak delta
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 704
In finite samples, the identified set is itself uncertain. Let widehat R_1-δ be a confidence region satisfying inf_ R_0∈ M P_ R_0 ( R_0∈ widehat R_1-δ ) ≥1-δ. A conservative robust lower margin is widehat r_1-δ = inf_ R∈widehat R_1-δ inf_ς∈ S min_q m_q(W_ R;ς). If widehat r_1-δ>0, a false specification-robust certificate has probability at most δ, provided that the model class and specification family were fixed before the confidence region was computed. This confidence-set approach is useful wh…
Exact mathematical passage
\widehat r_{1-\delta} = \inf_{\mathfrak R\in\widehat{\mathfrak R}_{1-\delta}} \inf_{\varsigma\in\mathfrak S} \min_q m_q(W_{\mathfrak R};\varsigma).
\inf_dUse in source · 1 passage
Search aliases: inf_d inf
Use in source · 07-relational-irreducibility.tex, line 10
For A⊆ V, the coalition statistic is H_t^A. Given an action space A and loss ℓ, define its unrestricted Bayes risk by Risk_ℓ(A) = inf_d E [ ℓ(Y_t^+,d( H_t^A)) ]. The infimum is over measurable decision rules for which the expectation is defined. The full-system risk is Risk_ℓ(V).
Exact mathematical passage
\boxed{ \Risk_\ell(A) = \inf_d \mathbb E\!\left[ \ell\bigl(Y_t^+,d(\mathbf H_t^A)\bigr) \right]. }
\inf_{d}Use in source · 1 passage
Search aliases: inf_d inf
Use in source · 06-dynamic-workspace-theory.tex, line 260
Sufficiency has a direct decision-theoretic interpretation. Use the convention TV(P,Q)=sup_A|P(A)-Q(A)|. Let A be a finite action set and ℓ: Y× A→[0,1] a bounded loss. Define Risk_ℓ(S_t) = inf_d E [ ℓ(Y_t^+,d(S_t)) ].
Exact mathematical passage
\Risk_\ell(S_t) = \inf_{d} \mathbb E\!\left[ \ell\bigl(Y_t^+,d(S_t)\bigr) \right].
\inf_fUse in source · 4 passages
Search aliases: inf_f inf
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 89
For any component q of widehatθ, define its scaffold-only Bayes risk under loss ℓ_q by R_q^Σ = inf_f E [ ℓ_q(q,f(Σ,Ω)) ]. Define the full formation risk by R_q^Σ, H = inf_g E [ ℓ_q(q,g(Σ, D_form,Ω)) ]. The history advantage is Δ_q^hist = R_q^Σ - R_q^Σ, H. A positive history advantage means that formation history contains information about q that is not already recoverable from the declared scaffold and random seed.
Exact mathematical passage
\mathcal R_q^{\Sigma} = \inf_f \mathbb E \left[ \ell_q\bigl(q,f(\Sigma,\Omega)\bigr) \right].
\inf_gUse in source · 1 passage
Search aliases: inf_g inf
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 99
For any component q of widehatθ, define its scaffold-only Bayes risk under loss ℓ_q by R_q^Σ = inf_f E [ ℓ_q(q,f(Σ,Ω)) ]. Define the full formation risk by R_q^Σ, H = inf_g E [ ℓ_q(q,g(Σ, D_form,Ω)) ]. The history advantage is Δ_q^hist = R_q^Σ - R_q^Σ, H. A positive history advantage means that formation history contains information about q that is not already recoverable from the declared scaffold and random seed.
Exact mathematical passage
\mathcal R_q^{\Sigma,\mathcal H} = \inf_g \mathbb E \left[ \ell_q\bigl(q,g(\Sigma,\mathcal D_{\mathrm{form}},\Omega)\bigr) \right].
\inf_qUse in source · 1 passage
Search aliases: inf_q inf
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 260
[Harmonic gluing obstruction] For every cocycle b∈kerδ^1, there is an orthogonal decomposition b=δ^0q^†+h, h∈ H^1_ U, where q^†=(δ^0)^† b is a least-squares potential. Moreover, inf_q b-δ^0q = h = P_ H^1_ Ub . Hence b is exactly integrable if and only if its harmonic component vanishes.
Exact mathematical passage
\boxed{ \inf_q\|b-\delta^0q\| = \|h\| = \|P_{\mathcal H^1_{\mathcal U}}b\|. }
\inf_{\widehat C}Use in source · 1 passage
Search aliases: inf_widehat C inf widehat
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 484
) under E. More strongly, for every possibly randomized decision rule widehat C based only on data generated by E, P_ R ( widehat C≠ C_ R ) + P_ R' ( widehat C≠ C_ R' ) =1, where C_ R=Cert(W_ R;ς). Consequently, inf_widehat C max{ P_ R(widehat C≠ C_ R), P_ R'(widehat C≠ C_ R') } ≥frac12.
Exact mathematical passage
\inf_{\widehat C} \max\left\{ \mathbb P_{\mathfrak R}(\widehat C\neq C_{\mathfrak R}), \mathbb P_{\mathfrak R'}(\widehat C\neq C_{\mathfrak R'}) \right\} \geq\frac12.
\inf_{\{J_{\sigma\sigma'}\}}Use in source · 1 passage
Search aliases: inf_{J_σσ'} inf sigma sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 309
For a family S of admissible scaffold variants, define the cross-scaffold identity defect δ_q^scaf = inf_{J_σσ'} E_σ,σ'∼π d_q ( J_σσ'q_σ,q_σ' ), where J_σσ' transports the learned object between admissible coordinate systems. A low value indicates that the same abstract organization is recovered under multiple non-solution-bearing scaffolds.
Exact mathematical passage
\boxed{ \delta_q^{\mathrm{scaf}} = \inf_{\{J_{\sigma\sigma'}\}} \mathbb E_{\sigma,\sigma'\sim\pi} d_q \left( J_{\sigma\sigma'}q_{\sigma},q_{\sigma'} \right), }
\inf_{\varsigma\in\mathfrak S}Use in source · 6 passages
Search aliases: inf_ς∈ S inf varsigma in mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 202
For each gate q∈ J_*, define the specification envelope underline m_q^ S(W) = inf_ς∈ Sm_q(W;ς), overline m_q^ S(W) = sup_ς∈ Sm_q(W;ς). Its sensitivity width is Δ_q^spec(W) = overline m_q^ S(W) - underline m_q^ S(W). The robust certificate margin is r_ S(W) = inf_ς∈ S min_q∈ J_*m_q(W;ς). Then Cert_ S(W)=1 Longleftrightarrow r_ S(W)>0.
Exact mathematical passage
\boxed{ \underline m_q^{\mathfrak S}(W) = \inf_{\varsigma\in\mathfrak S}m_q(W;\varsigma), \qquad \overline m_q^{\mathfrak S}(W) = \sup_{\varsigma\in\mathfrak S}m_q(W;\varsigma). }
\inf_{\psi_A}Use in source · 1 passage
Search aliases: inf_ψ_A inf psi
Use in source · 07-relational-irreducibility.tex, line 207
Let d_ P be a bounded metric generating the measurable structure on P( Y). Define the reconstruction defect of the canonical state from coalition A by δ_A^Z = inf_ψ_A E [ d_ P ( Z_t,ψ_A( H_t^A) ) ].
Exact mathematical passage
\delta_A^Z = \inf_{\psi_A} \mathbb E\!\left[ d_{\mathcal P}\!\left( Z_t,\psi_A(\mathbf H_t^A) \right) \right].
\mathrm{init}Use in source · 3 passages
Search aliases: init mathrm
Use in source · 11-reconstruction-and-resilience.tex, line 352
[Handoff initialization] If α_S>0 and the survivors observe y=A_Sc+η, initialize the replacement by x_r'^init =E_r''A_S^† y. Then x_r'^init-E_r''c ≤ frac E_r'' η sqrtα_S.
Exact mathematical passage
x_{r'}^{\mathrm{init}} =E_{r'}'A_S^\dagger y.
\InstabilityUse in source · 1 passage
Search aliases: Instability
Use in source · 15-boundary-formation-and-stability.tex, line 144
A general score is B_t(S) = · a_RRet_τ(S) +a_OOut_τ(S) +a_CCOut_τ(S) · -a_DDep_τ(S) -a_ICIn_τ(S) -a_LCoh(S) · -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal B_t(S) ={}& a_R\Ret_\tau(S) +a_O\Out_\tau(S) +a_C\COut_\tau(S)\\ &-a_D\Dep_\tau(S) -a_I\CIn_\tau(S) -a_L\mathsf{Coh}(S)\\ &-a_K\mathsf{Cut}(S) -a_Z\mathsf{Size}(S) -a_T\Instability_t(S). \end{aligned} }
\Instability_tUse in source · 1 passage
Search aliases: Instability_t Instability
Use in source · 15-boundary-formation-and-stability.tex, line 144
A general score is B_t(S) = · a_RRet_τ(S) +a_OOut_τ(S) +a_CCOut_τ(S) · -a_DDep_τ(S) -a_ICIn_τ(S) -a_LCoh(S) · -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal B_t(S) ={}& a_R\Ret_\tau(S) +a_O\Out_\tau(S) +a_C\COut_\tau(S)\\ &-a_D\Dep_\tau(S) -a_I\CIn_\tau(S) -a_L\mathsf{Coh}(S)\\ &-a_K\mathsf{Cut}(S) -a_Z\mathsf{Size}(S) -a_T\Instability_t(S). \end{aligned} }
\mathrm{int}Use in source · 10 passages
Search aliases: int mathrm
Use in source · 02-static-core-transfer-theory.tex, line 375
The edgewise defect is Ξ_e(a) = H_eρ_s(e)(a)-ρ_t(e)(a)H_e. For a bounded generating family G⊆ A, define η_int( G) = sup_a∈ G ∑_e∈ Ew_e Ξ_e(a) ^2. When A is normed and its unit ball is appropriate, one may take G={a: a _ A≤1}. Exact representational universality means η_int=0, while approximate universality means η_int≤ε_int. The use of a generating family prevents the definition from depending on an unbounded rescaling of algebra elements.
Exact mathematical passage
\eta_{\mathrm{int}}(\mathcal G) = \sup_{a\in\mathcal G} \sum_{e\in E}w_e\|\Xi_e(a)\|^2.
\mathsf{interventions}Use in source · 2 passages
Search aliases: interventions mathsf
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1051
The machine-readable record should include: SpecificationRecord ={ · reference, family, equivalence_classes, metric, · targets, losses, horizons, interventions, · null_panels, thresholds, selection_history, · identified_sets, uniform_bounds, gate_envelopes }. Every omitted family member requires a reason. Every changed specification requires a data-split label and time stamp. Every gate requires pointwise and family-wide status.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{SpecificationRecord} =\{& \mathsf{reference}, \mathsf{family}, \mathsf{equivalence\_classes}, \mathsf{metric},\\ &\mathsf{targets}, \mathsf{losses}, \mathsf{horizons}, \mathsf{interventions},\\ &\mathsf{null\_panels}, \mathsf{thresholds}, \mathsf{selection\_history},\\ &\mathsf{identified\_sets}, \mathsf{uniform\_bounds}, \mathsf{gate\_envelopes} \}. \end{aligned} }
\mathfrak JUse in source · 12 passages
Search aliases: J mathfrak
Use in source · 12-identity-through-time-and-replacement.tex, line 335
For an admissible correspondence J, define the operation defect on a declared unit ball A_1 by δ_op( J) = sup_a∈ A_1 A_ W''β-β A_ W . The primary certification object is the identity profile d_id( J) = ( q_str, δ_op( J), δ_causal(β), δ_rec(β); μ^keep ). The first four coordinates must remain below declared tolerances, while the non-collapse margin μ^keep must remain above a declared lower bound. This vector, rather than a weighted average, determines whether a specific identity
Exact mathematical passage
\mathfrak J
J_{\mathcal U}Use in source · 8 passages
Search aliases: J_ U mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 611
Let J_ U: C_V(G)→widehat C_ U, J_ Uc=(c|_G_α)_α, be the duplication map.
Exact mathematical passage
J_{\mathcal U}:\mathcal C_V(G)\to\widehat{\mathcal C}_{\mathcal U}, \qquad J_{\mathcal U}c=(c|_{G_\alpha})_\alpha,
J_{\mathcal U}^*Use in source · 1 passage
Search aliases: J_ U^* mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 674
Let m_i=|{α:i∈ V_α}| be the multiplicity of vertex i. Then J_ U^*J_ U=M_ U, (M_ Uc)_i=m_ic_i. The pseudoinverse performs coordinatewise averaging: (J_ U^† u)_i = frac1m_i ∑_α:i∈ V_α(u_α)_i. Let widehat u = P_ker K_ Uu = J_ Uwidehat c. Then widehat c = J_ U^†widehat u and u-J_ Uwidehat c ≤ frac K_ Uu sqrtγ_ U^tot. If m_min=min_i m_i, then widehat c-J_ U^† u ≤ frac K_ Uu sqrtm_minγ_ U^tot. The simple overlap average and the globally coherent least-squares assembly are close only whe
Exact mathematical passage
J_{\mathcal U}^*J_{\mathcal U}=M_{\mathcal U}, \qquad (M_{\mathcal U}c)_i=m_ic_i.
J_{\mathcal U}^\daggerUse in source · 3 passages
Search aliases: J_ U^† mathcal dagger
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 680
Let m_i=|{α:i∈ V_α}| be the multiplicity of vertex i. Then J_ U^*J_ U=M_ U, (M_ Uc)_i=m_ic_i. The pseudoinverse performs coordinatewise averaging: (J_ U^† u)_i = frac1m_i ∑_α:i∈ V_α(u_α)_i. Let widehat u = P_ker K_ Uu = J_ Uwidehat c. Then widehat c = J_ U^†widehat u and u-J_ Uwidehat c ≤ frac K_ Uu sqrtγ_ U^tot. If m_min=min_i m_i, then widehat c-J_ U^† u ≤ frac K_ Uu sqrtm_minγ_ U^tot. The simple overlap average and the globally coherent least-squares assembly are close only when the total des…
Exact mathematical passage
\boxed{ (J_{\mathcal U}^\dagger u)_i = \frac{1}{m_i} \sum_{\alpha:i\in V_\alpha}(u_\alpha)_i. }
\mathfrak J_{0:T}Use in source · 2 passages
Search aliases: J_0:T mathfrak
Use in source · 12-identity-through-time-and-replacement.tex, line 565
For a sequence of realizations R_0, R_1,…, R_T, let J_t: R_t→ R_t+1 be admissible correspondences. Define the path length Len( J_0:T) = ∑_t=0^T-1Cost( J_t) and the induced directed path quasi-pseudometric d_path^rightarrow( R_0, R_T) = inf_ J_0:T Len( J_0:T). Concatenation gives the directed triangle inequality. Because replacement costs and intervention divergences need not be symmetric, symmetry is not assumed. When reverse correspondences exist, define the symmetrized pseudometric d_path^sym(…
Exact mathematical passage
\operatorname{Len}(\mathfrak J_{0:T}) = \sum_{t=0}^{T-1}\operatorname{Cost}(\mathfrak J_t)
J_iUse in source · 2 passages
Search aliases: J_i
Use in source · 12-identity-through-time-and-replacement.tex, line 23
Let R=(G, C,D,ρ, I, K) and R'=(G', C',D',ρ', I', K') be two realizations. A correspondence begins with a graph isomorphism φ:G→ G'. After relabeling by φ, let J_i:C_i→ C_i' be unitary local identifications and define J_V=⊕_i∈ VJ_i, J_E=⊕_e∈ EJ_t(e).
Exact mathematical passage
J_i:C_i\to C_i'
\mathcal J_{\mathrm{leak}}Use in source · 1 passage
Search aliases: J_leak mathcal mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 395
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1 · + λ_stab J_stab + λ_leak J_leak }. The objective is schematic rather than universal. Its purpose is to expose which quantities were fixed and which were optimized. If z and …
Exact mathematical passage
\boxed{ \begin{aligned} \widehat\theta \in \argmin_{z,a,H,P,\mathcal O,B} \Bigl \{& \widehat{\mathcal R}_{\mathrm{task}} + \lambda_{\mathrm{coh}}\|D_{a,H}c\|^2 + \lambda_E\|a\|_1 + \lambda_V\|z\|_1\\ &+ \lambda_{\mathrm{stab}}\mathcal J_{\mathrm{stab}} + \lambda_{\mathrm{leak}}\mathcal J_{\mathrm{leak}} \Bigr\}. \end{aligned} }
\mathcal J_{\mathrm{maint}}Use in source · 3 passages
Search aliases: J_maint mathcal mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 633
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g,
Exact mathematical passage
\mathcal J_{\mathrm{maint}}
j_PUse in source · 4 passages
Search aliases: j_P
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 615
For any P∈ H_0, choose an index j_P such that P∈ H_0j_P. The event that every gate passes is contained in the event that gate j_P passes. Hence P_P(certificate passes) ≤ P_P(G_j_P passes) ≤ α_j_P ≤ max_jα_j. Taking the supremum over P∈ H_0 proves the claim.
Exact mathematical passage
j_P
J_{P'}Use in source · 1 passage
Search aliases: J_P'
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 428
Suppose the proposer becomes unavailable. The remaining coalition {C,N} reconstructs (q,p,f) exactly. A replacement proposer P' can therefore be initialized by E_P'c=(q,p). If P' uses a different local coordinate system J_P'∈ GL(2), then the incoming and outgoing overlap maps are conjugated accordingly. The global section and all downstream kernels remain unchanged. This is exact replacement invariance, not literal carrier identity.
Exact mathematical passage
J_{P'}\in GL(2),
J_{s(e)}Use in source · 1 passage
Search aliases: J_s(e)
Use in source · 12-identity-through-time-and-replacement.tex, line 94
For an approximate correspondence define Δ_D=D'J_V-J_ED, δ_D= Δ_D . If the graph weights are unchanged, define edgewise comparison defects δ_e = H_e'J_s(e)-J_t(e)H_e . The discrepancy operator has one changed source block per edge, so δ_D^2 ≤ max_i∈ V ∑_e:s(e)=iw_eδ_e^2 ≤ ∑_e∈ Ew_eδ_e^2. When a single node is replaced, every nonincident edge has δ_e=0. The replacement defect is therefore locally measurable even though its effect on the global workspace is controlled by the global spectral gap.
Exact mathematical passage
\delta_e = \|H_e'J_{s(e)}-J_{t(e)}H_e\|.
\mathcal J_{\mathrm{stab}}Use in source · 1 passage
Search aliases: J_stab mathcal mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 395
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1 · + λ_stab J_stab + λ_leak J_leak }. The objective is schematic rather than universal. Its purpose is to expose which quantities were fixed and which were optimized. If z and …
Exact mathematical passage
\boxed{ \begin{aligned} \widehat\theta \in \argmin_{z,a,H,P,\mathcal O,B} \Bigl \{& \widehat{\mathcal R}_{\mathrm{task}} + \lambda_{\mathrm{coh}}\|D_{a,H}c\|^2 + \lambda_E\|a\|_1 + \lambda_V\|z\|_1\\ &+ \lambda_{\mathrm{stab}}\mathcal J_{\mathrm{stab}} + \lambda_{\mathrm{leak}}\mathcal J_{\mathrm{leak}} \Bigr\}. \end{aligned} }
J_tUse in source · 1 passage
Search aliases: J_t
Use in source · 01-foundational-thesis.tex, line 330
Persistence does not require token identity. Let R_t and R_t+1 be temporally successive realizations. Continuity is possible when there exists an admissible transport J_t: R_trightsquigarrow R_t+1 that preserves the operative core and its causal role within tolerance: d_id(Workspace_t,Workspace_t+1)≤ε. Thus a workspace may persist by reconstruction rather than by retaining an unchanged physical inscription.
Exact mathematical passage
J_t:\mathfrak R_t\rightsquigarrow\mathfrak R_{t+1}
\mathfrak J_tUse in source · 2 passages
Search aliases: J_t mathfrak
Use in source · 12-identity-through-time-and-replacement.tex, line 563
For a sequence of realizations R_0, R_1,…, R_T, let J_t: R_t→ R_t+1 be admissible correspondences. Define the path length Len( J_0:T) = ∑_t=0^T-1Cost( J_t) and the induced directed path quasi-pseudometric d_path^rightarrow( R_0, R_T) = inf_ J_0:T Len( J_0:T). Concatenation gives the directed triangle inequality. Because replacement costs and intervention divergences need not be symmetric, symmetry is not assumed. When reverse correspondences exist, define the symmetrized pseudometric d_path^sym(…
Exact mathematical passage
\mathfrak J_t:\mathfrak R_t\to\mathfrak R_{t+1}
J_{t(e)}Use in source · 2 passages
Search aliases: J_t(e)
Use in source · 12-identity-through-time-and-replacement.tex, line 27
Let R=(G, C,D,ρ, I, K) and R'=(G', C',D',ρ', I', K') be two realizations. A correspondence begins with a graph isomorphism φ:G→ G'. After relabeling by φ, let J_i:C_i→ C_i' be unitary local identifications and define J_V=⊕_i∈ VJ_i, J_E=⊕_e∈ EJ_t(e).
Exact mathematical passage
J_V=\bigoplus_{i\in V}J_i, \qquad J_E=\bigoplus_{e\in E}J_{t(e)}.
J_V^*Use in source · 3 passages
Search aliases: J_V^*
Use in source · 12-identity-through-time-and-replacement.tex, line 54
[Exact replacement isomorphism] Under an exact structural correspondence, Γ(D')=J_VΓ(D), L'J_V=J_VL. Consequently, every spectral workspace subspace is transported exactly: P_I(L')=J_VP_I(L)J_V^* for every spectral interval I. If the correspondence is also operation exact, then the transported workspace actions are intertwined exactly.
Exact mathematical passage
P_I(L')=J_VP_I(L)J_V^*
J_\PiUse in source · 11 passages
Search aliases: J_Π Pi
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 125
D_∂ , D_int = ⊕_α=1^mD_α, where D_α contains the edge constraints internal to V_α, and D_∂ contains the constraints crossing between blocks. Define the internally coherent macro-state spaces W_α=ker D_α, W_Π=⊕_α=1^mW_α. Let J_Π:W_Π↪ C_V be the canonical isometric inclusion, and define the quotient discrepancy D_Π=D_∂J_Π. The quotient does not replace a group of nodes by an arbitrary summary. Its macro-state is the complete internal section space of that group, and its boundary operator retains a…
Exact mathematical passage
J_\Pi:W_\Pi\hookrightarrow\mathcal C_V
J_\Pi^*Use in source · 2 passages
Search aliases: J_Π^* Pi
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 196
[Two-scale coherence bound] Let P_Π be the orthogonal projector onto J_Π W_Π. Let γ_int>0 be the smallest positive eigenvalue of D_int^*D_int, and let γ_Π>0 be the smallest positive eigenvalue of D_Π^*D_Π. Then every c∈ C_V satisfies dist(c,Γ(H)) ≤ frac D_intc sqrtγ_int + frac D_Π J_Π^*P_Π c sqrtγ_Π. The first term measures incoherence within macro-components. The second measures incompatibility among their internally coherent states.
Exact mathematical passage
\boxed{ \operatorname{dist}(c,\Gamma(H)) \leq \frac{\|D_{\mathrm{int}}c\|}{\sqrt{\gamma_{\mathrm{int}}}} + \frac{ \|D_\Pi J_\Pi^*P_\Pi c\| }{\sqrt{\gamma_\Pi}}. }
J_{\sigma\sigma'}Use in source · 2 passages
Search aliases: J_σσ' sigma sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 309
For a family S of admissible scaffold variants, define the cross-scaffold identity defect δ_q^scaf = inf_{J_σσ'} E_σ,σ'∼π d_q ( J_σσ'q_σ,q_σ' ), where J_σσ' transports the learned object between admissible coordinate systems. A low value indicates that the same abstract organization is recovered under multiple non-solution-bearing scaffolds.
Exact mathematical passage
\boxed{ \delta_q^{\mathrm{scaf}} = \inf_{\{J_{\sigma\sigma'}\}} \mathbb E_{\sigma,\sigma'\sim\pi} d_q \left( J_{\sigma\sigma'}q_{\sigma},q_{\sigma'} \right), }
\jmathUse in source · 4 passages
Search aliases: jmath
Use in source · 08-causal-efficacy-and-reentry.tex, line 126
Define η_Workspace(r) = E_ι,ι'∼ I_Workspace(r) D ( P^ι(Y_t^+), P^ι'(Y_t^+) ), η_⊥(r) = E_jmath,jmath'∼ I_⊥(r) D ( P^jmath(Y_t^+), P^jmath'(Y_t^+) ), and Δ_specific(r) = η_Workspace(r)-η_⊥(r). A positive value supports causal concentration in the candidate workspace at the declared perturbation scale.
Exact mathematical passage
\eta_{\perp}(r) = \mathbb E_{\jmath,\jmath'\sim\mathcal I_{\perp}(r)} D\!\left( \mathbb P^{\jmath}(Y_t^+), \mathbb P^{\jmath'}(Y_t^+) \right),
\jmath'Use in source · 2 passages
Search aliases: jmath' jmath
Use in source · 08-causal-efficacy-and-reentry.tex, line 126
Define η_Workspace(r) = E_ι,ι'∼ I_Workspace(r) D ( P^ι(Y_t^+), P^ι'(Y_t^+) ), η_⊥(r) = E_jmath,jmath'∼ I_⊥(r) D ( P^jmath(Y_t^+), P^jmath'(Y_t^+) ), and Δ_specific(r) = η_Workspace(r)-η_⊥(r). A positive value supports causal concentration in the candidate workspace at the declared perturbation scale.
Exact mathematical passage
\eta_{\perp}(r) = \mathbb E_{\jmath,\jmath'\sim\mathcal I_{\perp}(r)} D\!\left( \mathbb P^{\jmath}(Y_t^+), \mathbb P^{\jmath'}(Y_t^+) \right),
\jmath_EUse in source · 2 passages
Search aliases: jmath_E jmath
Use in source · 08-causal-efficacy-and-reentry.tex, line 154
Let jmath_E randomize selected communication edges while preserving their marginal message laws, rates, and timing budget. The causal transfer gap is Δ_tr^do(jmath_E) = Risk_ℓ, P^jmath_E(V) - Risk_ℓ, P(V). Unlike an observational null law, this quantity is anchored to an implemented channel intervention. A positive effect is evidence that the intact alignment of messages, rather than merely their marginal content, contributes to task performance.
Exact mathematical passage
\jmath_E
\mathrm{joint}Use in source · 13 passages
Search aliases: joint mathrm
Use in source · 07-relational-irreducibility.tex, line 86
Define the coalition gap Δ_A^ℓ = Risk_ℓ(A)-Risk_ℓ(V) ≥0. The node-level joint advantage is Δ_joint^ℓ = min_i∈ V Δ_{i}^ℓ. Under logarithmic loss, Δ_joint^log = min_i∈ V I ( Y_t^+; H_t mid H_t^{i} ). Therefore Δ_joint^log>0 means that every individual component omits some predictive information available to the complete system.
Exact mathematical passage
\boxed{ \Delta_{\mathrm{joint}}^{\ell} = \min_{i\in V} \Delta_{\{i\}}^{\ell}. }
\mathcal KUse in source · 3 passages
Search aliases: K mathcal
Use in source · 07-relational-irreducibility.tex, line 154
For tolerance ε≥0, define k_ε = min{ |A|: Risk_ℓ(A) ≤ Risk_ℓ(V)+ε }. The set of minimal coalitions is K_ε = { A⊆ V: |A|=k_ε, Risk_ℓ(A) ≤ Risk_ℓ(V)+ε }.
Exact mathematical passage
\mathcal K_\varepsilon = \left\{ A\subseteq V: |A|=k_\varepsilon, \Risk_\ell(A) \leq \Risk_\ell(V)+\varepsilon \right\}.
\mathcal K'Use in source · 1 passage
Search aliases: K' mathcal
Use in source · 12-identity-through-time-and-replacement.tex, line 18
Let R=(G, C,D,ρ, I, K) and R'=(G', C',D',ρ', I', K') be two realizations. A correspondence begins with a graph isomorphism φ:G→ G'. After relabeling by φ, let J_i:C_i→ C_i' be unitary local identifications and define J_V=⊕_i∈ VJ_i, J_E=⊕_e∈ EJ_t(e).
Exact mathematical passage
\mathfrak R'=(G',\mathbf C',D',\rho',\mathcal I',\mathcal K')
K_{\mathcal U}Use in source · 7 passages
Search aliases: K_ U mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 577
and the block internal discrepancy widehat D_ U = ⊕_α∈ AD_G_α. For u=(u_α)_α∈widehat C_ U, define the raw overlap synchronization operator (S_ Uu)_αβ = ρ_G_αβ^G_βu_β - ρ_G_αβ^G_αu_α. For an overlap weight λ_ov>0, set K_ U = widehat D_ U [0.2em] sqrtλ_ov S_ U , L_ U^tot = K_ U^*K_ U. Its energy is E_ U^tot(u) = · ∑_α D_G_αu_α ^2
Exact mathematical passage
\boxed{ K_{\mathcal U} = \begin{pmatrix} \widehat D_{\mathcal U}\\[0.2em] \sqrt{\lambda_{\mathrm{ov}}}\,S_{\mathcal U} \end{pmatrix}, \qquad L_{\mathcal U}^{\mathrm{tot}} = K_{\mathcal U}^*K_{\mathcal U}. }
K_{\mathcal U}^*Use in source · 1 passage
Search aliases: K_ U^* mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 577
and the block internal discrepancy widehat D_ U = ⊕_α∈ AD_G_α. For u=(u_α)_α∈widehat C_ U, define the raw overlap synchronization operator (S_ Uu)_αβ = ρ_G_αβ^G_βu_β - ρ_G_αβ^G_αu_α. For an overlap weight λ_ov>0, set K_ U = widehat D_ U [0.2em] sqrtλ_ov S_ U , L_ U^tot = K_ U^*K_ U. Its energy is E_ U^tot(u) = · ∑_α D_G_αu_α ^2
Exact mathematical passage
\boxed{ K_{\mathcal U} = \begin{pmatrix} \widehat D_{\mathcal U}\\[0.2em] \sqrt{\lambda_{\mathrm{ov}}}\,S_{\mathcal U} \end{pmatrix}, \qquad L_{\mathcal U}^{\mathrm{tot}} = K_{\mathcal U}^*K_{\mathcal U}. }
k_0Use in source · 18 passages
Search aliases: k_0
Use in source · 07-relational-irreducibility.tex, line 184
This yields a graded classification: k_0=0 · Longrightarrow the background law alone is sufficient, k_0=1 · Longrightarrow some individual node is sufficient, k_0≥2 · Longrightarrow node-level relational irreducibility, k_0=|V| · Longrightarrow every proper coalition is insufficient. The last condition is much stronger and should not be inferred from the first.
Exact mathematical passage
\begin{aligned} k_0=0 &\quad\Longrightarrow\quad \text{the background law alone is sufficient},\\ k_0=1 &\quad\Longrightarrow\quad \text{some individual node is sufficient},\\ k_0\geq2 &\quad\Longrightarrow\quad \text{node-level relational irreducibility},\\ k_0=|V| &\quad\Longrightarrow\quad \text{every proper coalition is insufficient}. \end{aligned}
K_2Use in source · 1 passage
Search aliases: K_2
Use in source · 04-approximate-workspaces.tex, line 786
For two consecutive transfers, P_i_2T_2T_1P_i_0 = H_2H_1+U_2V_1, Q_i_2T_2T_1P_i_0 = V_2H_1+K_2V_1. Thus leakage out of the core is first order in the blocks V_r, while an excursion that leaves and then returns to the core contains at least one V-block and one later U-block. For a fixed path length, if U_r , V_r =O(δ) and the diagonal blocks remain bounded, the residual-mediated correction to pure core-to-core transport is O(δ^2), whereas terminal residual leakage can be O(δ). This distinction se…
Exact mathematical passage
Q_{i_2}T_2T_1P_{i_0} = V_2H_1+K_2V_1.
k_{\mathrm{ctl},0}Use in source · 1 passage
Search aliases: k_ctl,0 mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 876
(a_t^*,r_t^*): item the planner lacks h_t^-; item the monitor lacks g_t; and item the recorder lacks b_t. Every two-node coalition determines all three workspace bits and therefore the complete action. Under independent uniform bits, H(a_t^*mid X_i(t))=1 for every i, so the task-action component has a one-bit joint advantage and k_ctl,0=2.
Exact mathematical passage
k_{\mathrm{ctl},0}=2.
k_{\mathrm{ctl},\varepsilon}Use in source · 7 passages
Search aliases: k_ctl,ε mathrm varepsilon
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 190
For the complete control state, define Risk_ctl(S) = inf_f E [ ℓ_ctl ( C_t^ctl, f( H_t^S) ) ], and let k_ctl,ε be its minimal sufficient coalition size. A strong workspace-level agency claim requires k_ctl,ε≥2. This is a location criterion. It does not yet establish goal persistence, counterfactual evaluation, or self-maintenance.
Exact mathematical passage
k_{\mathrm{ctl},\varepsilon}
k_{\mathrm{ctl},\varepsilon_{\mathrm{ctl}}}Use in source · 1 passage
Search aliases: k_ctl,ε_ctl mathrm varepsilon mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1057
G; item goal-to-action mediation exceeds τ_G→ A; item counterfactual-value error is at most ε_Q; item value-to-action use exceeds τ_V→ A; item action-to-outcome control exceeds τ_A→ Y; item damage detection, monitor-to-repair mediation, and restoration exceed their thresholds; item repair specificity exceeds τ_spec; item k_ctl,ε_ctl≥2; and item repeated maintenance deficit remains at most e_max.
Exact mathematical passage
k_{\mathrm{ctl},\varepsilon_{\mathrm{ctl}}}\geq2
K_eUse in source · 4 passages
Search aliases: K_e
Use in source · 02-static-core-transfer-theory.tex, line 146
Relative to these decompositions, every edge map has the block form T_e= H_e · U_e V_e · K_e , where H_e=P_t(e)T_eP_s(e):C_s(e)→ C_t(e), U_e=P_t(e)T_eQ_s(e):R_s(e)→ C_t(e), V_e=Q_t(e)T_eP_s(e):C_s(e)→ R_t(e), K_e=Q_t(e)T_eQ_s(e):R_s(e)→ R_t(e).
Exact mathematical passage
T_e= \begin{pmatrix} H_e & U_e\\ V_e & K_e \end{pmatrix},
k_{\mathrm{erase}}Use in source · 3 passages
Search aliases: k_erase mathrm
Use in source · 11-reconstruction-and-resilience.tex, line 381
Define the minimum reconstructing coalition size m_rec = min{|S|:α_S>0} and the maximum exact erasure tolerance k_erase = max{k:α^(k)>0}. The condition m_rec≥2 means that no individual encoding is sufficient for exact core recovery. The condition k_erase≥1 means that the system survives at least one node loss. These can hold simultaneously because nonlocality of encoding is not the same as fragility.
Exact mathematical passage
\boxed{ k_{\mathrm{erase}} = \max\{k:\alpha^{(k)}>0\}. }
K_fUse in source · 1 passage
Search aliases: K_f
Use in source · 02-static-core-transfer-theory.tex, line 201
For composable edges e:i→ j and f:j→ k, direct block multiplication gives T_fT_e = H_fH_e+U_fV_e · H_fU_e+U_fK_e V_fH_e+K_fV_e · V_fU_e+K_fK_e . The induced core-to-core block is therefore P_kT_fT_eP_i = H_fH_e+U_fV_e. The term U_fV_e is a residual-mediated correction: information leaves the candidate core at the intermediate node and later re-enters it. Consequently, the simple path product H_fH_e faithfully represents full core transport only under a preservation condition such as V_e=0, or un…
Exact mathematical passage
T_fT_e = \begin{pmatrix} H_fH_e+U_fV_e & H_fU_e+U_fK_e\\ V_fH_e+K_fV_e & V_fU_e+K_fK_e \end{pmatrix}.
k_{G,\varepsilon}Use in source · 3 passages
Search aliases: k_G,ε varepsilon
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 157
Let H_t^S be the history available to coalition S⊆ V. For a loss ℓ_G, define goal-reconstruction risk Risk_G(S) = inf_f E [ ℓ_G ( G_t, f( H_t^S) ) ]. For tolerance ε, define k_G,ε = min { |S|: Risk_G(S) ≤ Risk_G(V)+ε }. A goal is locally stored when k_G,ε=1. It is distributed relative to the declared decomposition when k_G,ε≥2.
Exact mathematical passage
k_{G,\varepsilon} = \min \left\{ |S|: \Risk_G(S) \leq \Risk_G(V)+\varepsilon \right\}.
K_r^*Use in source · 1 passage
Search aliases: K_r^*
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1020
At level r, let K_r be the corresponding total descent operator, γ_r = λ_min^+(K_r^*K_r), K_ru_r ≤ε_r. The nearest exact compatible state then differs from u_r by at most fracε_rsqrtγ_r. Allow an additional implementation, compression, or causal-summary defect ζ_r, and define δ_r = fracε_rsqrtγ_r + ζ_r.
Exact mathematical passage
\gamma_r = \lambda_{\min}^+(K_r^*K_r), \qquad \|K_ru_r\|\leq\varepsilon_r.
k_{\mathrm{rec}}Use in source · 2 passages
Search aliases: k_rec mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 563
thbb R^4, spec(L_HAI) = {0,0,0,0,2,2,2,2}, γ_HAI=2. The full accessible frame operator is F_HMXA=2I_4. No single node is injective. Every three-node coalition reconstructs the full state, and the two opposite pairs {H,X}, {M,A} are already sufficient. Adjacent pairs observe only three of the four coordinates. Hence k_rec=2, d_er=2, while the identity of the sufficient two-node coalition depends on the graph geometry.
Exact mathematical passage
k_{\mathrm{rec}}=2, \qquad d_{\mathrm{er}}=2,
K_SUse in source · 4 passages
Search aliases: K_S
Use in source · 12-identity-through-time-and-replacement.tex, line 492
[Preservation of coalition frame bounds] Identify the old and new abstract cores with ran P and ran P' through their chosen core parameterizations. Let S be a declared coalition, let A_S:ran P→ Y_S, A_S':ran P'→ Y_S' be the resulting accessible coalition encoders, and let K_S be a unitary identification of their observation spaces. Suppose A_S'β-K_SA_S ≤ δ_S^frame < sqrtα_S. Then the replacement coalition remains reconstructive and its new lower frame bound satisfies α_S' ≥ ( sqrtα_S-δ_S^frame )…
Exact mathematical passage
K_S
K_{t+\tau}Use in source · 3 passages
Search aliases: K_t+τ tau
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 401
[Behavioral readout of a retained goal] Assume, in addition, that under the matched intervention background the action readout has conditional mean E[A_t+τmid G_t+τ,W_t+τ] = K_t+τG_t+τ+b(W_t+τ), and that the two runs are matched on W_t+τ. Then E[A_t+τmidι_g] - E[A_t+τmidι_g'] = K_t+τR_t+τ:t(g-g'). If σ_min(K_t+τ)≥ k_t+τ>0, the norm of this action-mean difference is at least k_t+τ ( ∏_s=t^t+τ-1m_s ) g-g' .
Exact mathematical passage
\mathbb E[A_{t+\tau}\mid G_{t+\tau},W_{t+\tau}] = K_{t+\tau}G_{t+\tau}+b(W_{t+\tau}),
k_{t+\tau}Use in source · 2 passages
Search aliases: k_t+τ tau
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 414
elcor:goal-action-readout Assume, in addition, that under the matched intervention background the action readout has conditional mean E[A_t+τmid G_t+τ,W_t+τ] = K_t+τG_t+τ+b(W_t+τ), and that the two runs are matched on W_t+τ. Then E[A_t+τmidι_g] - E[A_t+τmidι_g'] = K_t+τR_t+τ:t(g-g'). If σ_min(K_t+τ)≥ k_t+τ>0, the norm of this action-mean difference is at least k_t+τ ( ∏_s=t^t+τ-1m_s ) g-g' .
Exact mathematical passage
\sigma_{\min}(K_{t+\tau})\geq k_{t+\tau}>0
K_t^SUse in source · 2 passages
Search aliases: K_t^S
Use in source · 06-dynamic-workspace-theory.tex, line 219
For an arbitrary history statistic S_t=s( H_t), let K_t^S(s,·) = P(Y_t^+∈·mid S_t=s). Whenever the conditional relative entropy is finite, define the sufficiency defect δ_suff(S_t) = E [ KL ( K_t( H_t,·) middle K_t^S(S_t,·) ) ].
Exact mathematical passage
\boxed{ \delta_{\mathrm{suff}}(S_t) = \mathbb E\!\left[ \KL\!\left( K_t(\mathbf H_t,\cdot) \,\middle\|\, K_t^S(S_t,\cdot) \right) \right]. }
K_t^{S}Use in source · 1 passage
Search aliases: K_t^S
Use in source · 06-dynamic-workspace-theory.tex, line 212
For an arbitrary history statistic S_t=s( H_t), let K_t^S(s,·) = P(Y_t^+∈·mid S_t=s). Whenever the conditional relative entropy is finite, define the sufficiency defect δ_suff(S_t) = E [ KL ( K_t( H_t,·) middle K_t^S(S_t,·) ) ].
Exact mathematical passage
K_t^{S}(s,\cdot) = \mathbb P(Y_t^+\in\cdot\mid S_t=s).
K_t^{\iota}Use in source · 2 passages
Search aliases: K_t^ι iota
Use in source · 06-dynamic-workspace-theory.tex, line 320
Observational prediction may merge histories that behave identically under the current policy but respond differently to future interventions. Let I be a finite or countable family of interventions applied only after time t. For each ι∈ I, let K_t^ι(h,·) = P^ι(Y_t^+∈·mid H_t=h) be a regular post-intervention kernel on the common pre-intervention history space. Define Z_t^ I = (K_t^ι( H_t,·))_ι∈ I ∈ P( Y)^ I.
Exact mathematical passage
K_t^{\iota}(h,\cdot) = \mathbb P^{\iota}(Y_t^+\in\cdot\mid\mathbf H_t=h)
K_wUse in source · 5 passages
Search aliases: K_w
Use in source · 11-reconstruction-and-resilience.tex, line 166
Geometric recovery becomes behaviorally relevant when the workspace state controls a predictive kernel. Let K_w= P(Y∈·mid W=w) and suppose TV(K_w,K_w')≤ L_Kd_W(w,w').
Exact mathematical passage
K_w=\mathbb P(Y\in\cdot\mid W=w)
K_{w'}Use in source · 1 passage
Search aliases: K_w'
Use in source · 11-reconstruction-and-resilience.tex, line 170
Geometric recovery becomes behaviorally relevant when the workspace state controls a predictive kernel. Let K_w= P(Y∈·mid W=w) and suppose TV(K_w,K_w')≤ L_Kd_W(w,w').
Exact mathematical passage
\TV(K_w,K_{w'})\leq L_Kd_W(w,w').
K_{\widehat w}Use in source · 3 passages
Search aliases: K_widehat w widehat
Use in source · 11-reconstruction-and-resilience.tex, line 223
For every pair w,widehat w, using the Bayes action for K_widehat w under the true law K_w incurs conditional regret at most 2TV(K_w,K_widehat w). This follows by inserting and subtracting the risk under K_widehat w for both the chosen action and the Bayes action for K_w. Average the bound and use the Lipschitz assumption. The coalition's optimal rule performs at least as well as this decoder-based rule.
Exact mathematical passage
K_{\widehat w}
K_\gammaUse in source · 1 passage
Search aliases: K_γ gamma
Use in source · 02-static-core-transfer-theory.tex, line 255
[Autonomous splitting] If U_e=V_e=0 for every edge, then the complete diagram decomposes as the direct sum of two diagrams, X≅ H⊕ K, and every path transfer satisfies T_γ = H_γ · 0 0 · K_γ .
Exact mathematical passage
T_\gamma = \begin{pmatrix} H_\gamma&0\\ 0&K_\gamma \end{pmatrix}.
\mathcal K_\varepsilonUse in source · 1 passage
Search aliases: K_ε mathcal varepsilon
Use in source · 07-relational-irreducibility.tex, line 154
For tolerance ε≥0, define k_ε = min{ |A|: Risk_ℓ(A) ≤ Risk_ℓ(V)+ε }. The set of minimal coalitions is K_ε = { A⊆ V: |A|=k_ε, Risk_ℓ(A) ≤ Risk_ℓ(V)+ε }.
Exact mathematical passage
\mathcal K_\varepsilon = \left\{ A\subseteq V: |A|=k_\varepsilon, \Risk_\ell(A) \leq \Risk_\ell(V)+\varepsilon \right\}.
k_\varepsilonUse in source · 13 passages
Search aliases: k_ε varepsilon
Use in source · 07-relational-irreducibility.tex, line 141
For tolerance ε≥0, define k_ε = min{ |A|: Risk_ℓ(A) ≤ Risk_ℓ(V)+ε }. The set of minimal coalitions is K_ε = { A⊆ V: |A|=k_ε, Risk_ℓ(A) ≤ Risk_ℓ(V)+ε }.
Exact mathematical passage
\boxed{ k_\varepsilon = \min\left\{ |A|: \Risk_\ell(A) \leq \Risk_\ell(V)+\varepsilon \right\}. }
k_\varepsilon^{\mathrm{meta}}Use in source · 1 passage
Search aliases: k_ε^meta varepsilon mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 890
nough accessible information to reconstruct the whole meta-state. A claim that the hierarchy is genuinely distributed must therefore reuse the coalition gates from Parts~VII and XI. At the chart level, one may require, for example, α_{α}^meta=0 for every α, α_A^meta>0 for some |A|≥2, or the predictive analogue k_ε^meta≥2, Δ_joint^meta>0. Capacity-matched local-memory and chart-ablation controls are still required. Hierarchical notation cannot convert a centralized copy into a relational workspac…
Exact mathematical passage
k_\varepsilon^{\mathrm{meta}}\geq2, \qquad \Delta_{\mathrm{joint}}^{\mathrm{meta}}>0.
k_{\varepsilon_k}Use in source · 1 passage
Search aliases: k_ε_k varepsilon
Use in source · 09-formal-workspace-definition.tex, line 87
subtopicDistributedness k_ε_k ≥ k.
Exact mathematical passage
k_{\varepsilon_k} \geq k.
\mathrm{keep}Use in source · 11 passages
Search aliases: keep mathrm
Use in source · 10-persistence.tex, line 329
Low off-workspace error is not sufficient for meaningful persistence. The zero update F_t=0 drives every state exactly into every linear workspace while destroying all content. Define the internal transport B_t=P_t+1F_tP_t: W_t⟶ W_t+1 and its non-collapse margin μ_t^keep = σ_min(B_t|_ W_t). A content-preserving persistence claim requires μ_t^keep>0 for the relevant interval, or an information-theoretic replacement when the workspace state is stochastic. Structural tracking, state tracking, and c…
Exact mathematical passage
\boxed{ \mu_t^{\mathrm{keep}} = \sigma_{\min}(B_t|_{\mathcal W_t}). }
\KLUse in source · 1 passage
Search aliases: KL
Use in source · 06-dynamic-workspace-theory.tex, line 219
For an arbitrary history statistic S_t=s( H_t), let K_t^S(s,·) = P(Y_t^+∈·mid S_t=s). Whenever the conditional relative entropy is finite, define the sufficiency defect δ_suff(S_t) = E [ KL ( K_t( H_t,·) middle K_t^S(S_t,·) ) ].
Exact mathematical passage
\boxed{ \delta_{\mathrm{suff}}(S_t) = \mathbb E\!\left[ \KL\!\left( K_t(\mathbf H_t,\cdot) \,\middle\|\, K_t^S(S_t,\cdot) \right) \right]. }
lUse in source · 12 passages
Search aliases: l
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
L'Use in source · 6 passages
Search aliases: L'
Use in source · 12-identity-through-time-and-replacement.tex, line 46
[Exact replacement isomorphism] Under an exact structural correspondence, Γ(D')=J_VΓ(D), L'J_V=J_VL. Consequently, every spectral workspace subspace is transported exactly: P_I(L')=J_VP_I(L)J_V^* for every spectral interval I. If the correspondence is also operation exact, then the transported workspace actions are intertwined exactly.
Exact mathematical passage
\boxed{ \Gamma(D')=J_V\Gamma(D), \qquad L'J_V=J_VL. }
L^RUse in source · 1 passage
Search aliases: L^R
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1086
· ≤ ∑_r=0^R-1 ( ∏_s=r+1^R-1L_s ) δ_r. In particular, if L_r≤1, then the total error is at most ∑_r=0^R-1δ_r. If L_r≤ L<1 and δ_r≤δ, then total error ≤ fracδ(1-L^R)1-L ≤ fracδ1-L.
Exact mathematical passage
\boxed{ \text{total error} \leq \frac{\delta(1-L^R)}{1-L} \leq \frac{\delta}{1-L}. }
\mathcal L^{\iota_{\bar S,u}}Use in source · 1 passage
Search aliases: L^ι_bar S,u mathcal iota bar
Use in source · 15-boundary-formation-and-stability.tex, line 95
nate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general. A useful workspace may receive substantial external input. The boundary object…
Exact mathematical passage
\boxed{ \CIn_\tau(S) = \mathbb E_{u,u'\sim\nu_{\bar S}} D\!\left( \mathcal L^{\iota_{\bar S,u}} (X_S(t+\tau)), \mathcal L^{\iota_{\bar S,u'}} (X_S(t+\tau)) \right). }
\mathcal L^{\iota_{\bar S,u'}}Use in source · 1 passage
Search aliases: L^ι_bar S,u' mathcal iota bar
Use in source · 15-boundary-formation-and-stability.tex, line 95
nate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general. A useful workspace may receive substantial external input. The boundary object…
Exact mathematical passage
\boxed{ \CIn_\tau(S) = \mathbb E_{u,u'\sim\nu_{\bar S}} D\!\left( \mathcal L^{\iota_{\bar S,u}} (X_S(t+\tau)), \mathcal L^{\iota_{\bar S,u'}} (X_S(t+\tau)) \right). }
\mathcal L^{\iota_{S,x}}Use in source · 1 passage
Search aliases: L^ι_S,x mathcal iota
Use in source · 15-boundary-formation-and-stability.tex, line 80
Let ι_S,x be a feasible intervention that changes the internal workspace coordinate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general.…
Exact mathematical passage
\boxed{ \COut_\tau(S) = \mathbb E_{x,x'\sim\nu_S} D\!\left( \mathcal L^{\iota_{S,x}} (X_{\bar S}(t+\tau)), \mathcal L^{\iota_{S,x'}} (X_{\bar S}(t+\tau)) \right). }
\mathcal L^{\iota_{S,x'}}Use in source · 1 passage
Search aliases: L^ι_S,x' mathcal iota
Use in source · 15-boundary-formation-and-stability.tex, line 80
Let ι_S,x be a feasible intervention that changes the internal workspace coordinate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general.…
Exact mathematical passage
\boxed{ \COut_\tau(S) = \mathbb E_{x,x'\sim\nu_S} D\!\left( \mathcal L^{\iota_{S,x}} (X_{\bar S}(t+\tau)), \mathcal L^{\iota_{S,x'}} (X_{\bar S}(t+\tau)) \right). }
L_{\mathcal U}^{\mathrm{meta}}Use in source · 6 passages
Search aliases: L_ U^meta mathcal mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 489
First assume each local state already lies in its exact local workspace. Define B_ U := δ^0: check C^0( U;mathscr W) ⟶ check C^1( U;mathscr W) and the meta-Laplacian L_ U^meta = B_ U^*B_ U. By Theorem~[source reference], ker L_ U^meta = R_ Umathscr W(G). Thus the gluing problem is itself a workspace problem whose ``nodes'' are local workspaces and whose interfaces are overlaps.
Exact mathematical passage
\boxed{ L_{\mathcal U}^{\mathrm{meta}} = B_{\mathcal U}^*B_{\mathcal U}. }
L_{\mathcal U}^{\mathrm{tot}}Use in source · 2 passages
Search aliases: L_ U^tot mathcal mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 577
and the block internal discrepancy widehat D_ U = ⊕_α∈ AD_G_α. For u=(u_α)_α∈widehat C_ U, define the raw overlap synchronization operator (S_ Uu)_αβ = ρ_G_αβ^G_βu_β - ρ_G_αβ^G_αu_α. For an overlap weight λ_ov>0, set K_ U = widehat D_ U [0.2em] sqrtλ_ov S_ U , L_ U^tot = K_ U^*K_ U. Its energy is E_ U^tot(u) = · ∑_α D_G_αu_α ^2
Exact mathematical passage
\boxed{ K_{\mathcal U} = \begin{pmatrix} \widehat D_{\mathcal U}\\[0.2em] \sqrt{\lambda_{\mathrm{ov}}}\,S_{\mathcal U} \end{pmatrix}, \qquad L_{\mathcal U}^{\mathrm{tot}} = K_{\mathcal U}^*K_{\mathcal U}. }
L_2Use in source · 1 passage
Search aliases: L_2
Use in source · 02-static-core-transfer-theory.tex, line 397
[Equivalent operations in different coordinates] Let C_1=C_2= R^2, choose S∈ GL_2( R), and set H_12=S, ρ_2(a)=Sρ_1(a)S^-1. Then H_12ρ_1(a) =Sρ_1(a) =ρ_2(a)S =ρ_2(a)H_12. The local matrices can look different while realizing the same abstract operation. This is the elementary model of representation change used throughout the theory.
Exact mathematical passage
S\in GL_2(\mathbb R)
L_BUse in source · 2 passages
Search aliases: L_B
Use in source · 15-boundary-formation-and-stability.tex, line 281
If the score depends on a parameter ϑ_t and satisfies sup_S | B_ϑ(S)- B_ϑ'(S)| ≤ L_Bd(ϑ,ϑ'), then the sufficient stability condition becomes 2L_Bd(ϑ_t,ϑ_t+1) < Δ_t^B.
Exact mathematical passage
\sup_S |\mathcal B_{\vartheta}(S)-\mathcal B_{\vartheta'}(S)| \leq L_Bd(\vartheta,\vartheta'),
L_{H^g}Use in source · 4 passages
Search aliases: L_H^g
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 93
[Unitary gauge covariance of the Laplacian] If every g_i is unitary, then G_V and G_E are unitary and L_H^g=G_VL_HG_V^-1. Consequently, spec(L_H^g)=spec(L_H), P_I(L_H^g)=G_VP_I(L_H)G_V^-1 for every spectral interval I.
Exact mathematical passage
\boxed{ L_{H^g}=G_VL_HG_V^{-1}. }
L_{\mathrm{HAI}}Use in source · 1 passage
Search aliases: L_HAI mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 541
0 · -1 · 0 · 0 · 0 · 0 · 1 · 0 . The rows are orthogonal with squared norm two. Therefore ker D_HAI ≅ R^4, spec(L_HAI) = {0,0,0,0,2,2,2,2}, γ_HAI=2. The full accessible frame operator is F_HMXA=2I_4. No single node is injective. Every three-node coalition reconstructs the full state, and the two opposite pairs {H,X}, {M,A} are already sufficient. Adjacent pairs observe only three of the four coordinates. Hence k_rec=2, d_er=2, while the identity of the sufficient two-node coalition depends on th…
Exact mathematical passage
\boxed{ \spec(L_{\mathrm{HAI}}) = \{0,0,0,0,2,2,2,2\}, \qquad \gamma_{\mathrm{HAI}}=2. }
L_{\mathrm{HH}}Use in source · 1 passage
Search aliases: L_HH mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 309
-1 · 0 · 0 · 0 · 1 · 0 . Therefore ker D_HH = { (q,p,p,f,q,f)^ T:q,p,f∈ R } ≅ R^3. The rows are orthogonal with squared norm two, so D_HHD_HH^*=2I_3. Consequently the transfer Laplacian has spectrum spec(L_HH) = {0,0,0,2,2,2}, and the exact workspace gap is γ_HH=2. The low-energy subspace is therefore stable under any Laplacian perturbation whose operator norm is strictly below one, with the quantitative projector bound from Theorem~[source reference].
Exact mathematical passage
\boxed{ \spec(L_{\mathrm{HH}}) = \{0,0,0,2,2,2\}, }
L_KUse in source · 2 passages
Search aliases: L_K
Use in source · 11-reconstruction-and-resilience.tex, line 170
Geometric recovery becomes behaviorally relevant when the workspace state controls a predictive kernel. Let K_w= P(Y∈·mid W=w) and suppose TV(K_w,K_w')≤ L_Kd_W(w,w').
Exact mathematical passage
\TV(K_w,K_{w'})\leq L_Kd_W(w,w').
L_qUse in source · 16 passages
Search aliases: L_q
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 488
Fix a reference decomposition D_0. For each D∈ D, let Φ_ D:W^ D_0⟶ W^ D be a declared workspace correspondence and let δ_ D measure its structural and causal identity defect. Assume gate q has a transport bound | m_q(Φ_ DW; D) -m_q(W; D_0) | ≤ L_qδ_ D+b_q( D), where L_q is a sensitivity constant and b_q records model mismatch not captured by the identity distance.
Exact mathematical passage
\left| m_q(\Phi_{\mathcal D}W;\mathcal D) -m_q(W;\mathcal D_0) \right| \leq L_q\delta_{\mathcal D}+b_q(\mathcal D),
L_rUse in source · 5 passages
Search aliases: L_r
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1051
theorem[Approximate hierarchical collapse bound] Let F_r: H_r→ H_r+1, widetilde F_r: H_r→ H_r+1 be exact and implemented level-collapse maps for r=0,…,R-1. Let R_r⊆ H_r contain the exact and implemented states reachable at level r. Assume, on R_r, F_r(x)-F_r(y) ≤ L_r x-y and sup_x∈ R_r widetilde F_r(x)-F_r(x) ≤ δ_r. Then · widetilde F_R-1∘⋯∘widetilde F_0(x) - F_R-1∘⋯∘ F_0(x)
Exact mathematical passage
\|F_r(x)-F_r(y)\| \leq L_r\|x-y\|
L_SUse in source · 1 passage
Search aliases: L_S
Use in source · 15-boundary-formation-and-stability.tex, line 116
For the induced subsystem on S, define Coh(S) = tr ( P_S,dL_SP_S,d ), where P_S,d projects onto the selected low-energy workspace modes. Let Cut(S) = ∑_e:s(e)∈ S, t(e)∉ Sw_e + ∑_e:s(e)∉ S, t(e)∈ Sw_e. Let k_ε(S) be the minimal sufficient coalition size inside the candidate subsystem. A candidate is admissible only if SRW_Θ_S(W_S)=1, k_ε(S)≥2, unless the claim explicitly concerns a centralized workspace.
Exact mathematical passage
\mathsf{Coh}(S) = \operatorname{tr} \left( P_{S,d}L_SP_{S,d} \right),
L_sUse in source · 3 passages
Search aliases: L_s
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1064
l H_r+1, widetilde F_r: H_r→ H_r+1 be exact and implemented level-collapse maps for r=0,…,R-1. Let R_r⊆ H_r contain the exact and implemented states reachable at level r. Assume, on R_r, F_r(x)-F_r(y) ≤ L_r x-y and sup_x∈ R_r widetilde F_r(x)-F_r(x) ≤ δ_r. Then · widetilde F_R-1∘⋯∘widetilde F_0(x) - F_R-1∘⋯∘ F_0(x) · ≤ ∑_r=0^R-1 ( ∏_s=r+1^R-1L_s ) δ_r. In particular, if L_r≤1, then the total error is at most ∑_r=0^R-1δ_r. If L_r≤ L<1 and δ_r≤δ, then total error ≤ fracδ(1-L^R)1-L ≤ fracδ1-L.
Exact mathematical passage
\boxed{ \begin{aligned} &\left\| \widetilde F_{R-1}\circ\cdots\circ\widetilde F_0(x) - F_{R-1}\circ\cdots\circ F_0(x) \right\|\\ &\qquad\leq \sum_{r=0}^{R-1} \left( \prod_{s=r+1}^{R-1}L_s \right) \delta_r. \end{aligned} }
L_{t+1}Use in source · 3 passages
Search aliases: L_t+1
Use in source · 10-persistence.tex, line 53
[Temporal Laplacian drift] The carried Laplacian satisfies (U_t^V)^*L_t+1U_t^V-L_t ≤ 2 D_t δ_t^D+(δ_t^D)^2.
Exact mathematical passage
\boxed{ \left\| (U_t^V)^*L_{t+1}U_t^V-L_t \right\| \leq 2\|D_t\|\delta_t^D+(\delta_t^D)^2. }
L_{\widetilde H}Use in source · 2 passages
Search aliases: L_widetilde H widetilde
Use in source · 04-approximate-workspaces.tex, line 519
Suppose the edge maps are perturbed to widetilde H_e=H_e+Δ_e while the weights and vertex metrics remain fixed. Define δ_H^2 = max_i∈ V ∑_e:s(e)=iw_e Δ_e ^2. Let F=D_widetilde H-D_H. Then (Fc)_e=-sqrtw_e Δ_ec_s(e), F ≤δ_H. Since L_widetilde H-L_H =D_H^*F+F^*D_H+F^*F, we obtain L_widetilde H-L_H ≤ 2 D_H δ_H+δ_H^2.
Exact mathematical passage
L_{\widetilde H}-L_H =D_H^*F+F^*D_H+F^*F,
\LargeUse in source · 1 passage
Search aliases: Large
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
\largeUse in source · 1 passage
Search aliases: large
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
\mathrm{leak}Use in source · 5 passages
Search aliases: leak mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 326
The complete formation signature is E_form(W) = ( e_V,e_E,e_H,e_P,e_ O,e_B; δ^scaf, δ^leak ), where every e_q is reported as the pair e_q = ( e_q^MDL, e_q^causal ). No scalar average is permitted to hide a zero history contribution for one of the structures claimed to have been discovered.
Exact mathematical passage
\boxed{ \mathbf E_{\mathrm{form}}(W) = \left( e_V,e_E,e_H,e_P,e_{\mathcal O},e_B; \delta^{\mathrm{scaf}}, \delta^{\mathrm{leak}} \right), }
\operatorname{Len}Use in source · 2 passages
Search aliases: Len operatorname
Use in source · 12-identity-through-time-and-replacement.tex, line 565
For a sequence of realizations R_0, R_1,…, R_T, let J_t: R_t→ R_t+1 be admissible correspondences. Define the path length Len( J_0:T) = ∑_t=0^T-1Cost( J_t) and the induced directed path quasi-pseudometric d_path^rightarrow( R_0, R_T) = inf_ J_0:T Len( J_0:T). Concatenation gives the directed triangle inequality. Because replacement costs and intervention divergences need not be symmetric, symmetry is not assumed. When reverse correspondences exist, define the symmetrized pseudometric d_path^sym(…
Exact mathematical passage
\operatorname{Len}(\mathfrak J_{0:T}) = \sum_{t=0}^{T-1}\operatorname{Cost}(\mathfrak J_t)
\lesssimUse in source · 3 passages
Search aliases: lesssim
Use in source · 12-identity-through-time-and-replacement.tex, line 458
truction defects are O(δ_rep), the relevant operator norms are uniformly bounded, and g≥ g_0>0, then d_id( R, R') ≤ C_1fracδ_repg_0 +C_2δ_rep +O (fracδ_rep^2g_0). After a fixed normalization of the non-spectral terms, this recovers the schematic target d_id lesssim Cfracδ_repg_0.
Exact mathematical passage
d_{\mathrm{id}} \lesssim C\frac{\delta_{\mathrm{rep}}}{g_0}.
\operatorname{Lim}Use in source · 1 passage
Search aliases: Lim operatorname
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 997
l U_flat = {G_ℓ:ℓ∈ L( T)} is itself an edge-complete cover of G. Let δ_flat^0 be its overlap coboundary and define W_flat = kerδ_flat^0. Theorem~[source reference] and Theorem~[source reference] give W_r ≅ W_flat ≅ mathscr W(G). Equivalently, Lim_ T^rec ( {mathscr W(G_ℓ)}_ℓ∈ L( T) ) ≅ Eq_ U_flat ( {mathscr W(G_ℓ)}_ℓ∈ L( T) ). The notation on the left means recursive finite descent along the tree; the right side means one-shot equalization over the flattened leaf cover. In finite-dimensional vect…
Exact mathematical passage
\boxed{ \operatorname{Lim}_{\mathcal T}^{\mathrm{rec}} \left( \{\mathscr W(G_\ell)\}_{\ell\in L(\mathcal T)} \right) \cong \operatorname{Eq}_{\mathcal U_{\mathrm{flat}}} \left( \{\mathscr W(G_\ell)\}_{\ell\in L(\mathcal T)} \right). }
\operatorname{Lim}_{\mathcal T}^{\mathrm{rec}}Use in source · 1 passage
Search aliases: Lim_ T^rec operatorname mathcal mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 997
l U_flat = {G_ℓ:ℓ∈ L( T)} is itself an edge-complete cover of G. Let δ_flat^0 be its overlap coboundary and define W_flat = kerδ_flat^0. Theorem~[source reference] and Theorem~[source reference] give W_r ≅ W_flat ≅ mathscr W(G). Equivalently, Lim_ T^rec ( {mathscr W(G_ℓ)}_ℓ∈ L( T) ) ≅ Eq_ U_flat ( {mathscr W(G_ℓ)}_ℓ∈ L( T) ). The notation on the left means recursive finite descent along the tree; the right side means one-shot equalization over the flattened leaf cover. In finite-dimensional vect…
Exact mathematical passage
\boxed{ \operatorname{Lim}_{\mathcal T}^{\mathrm{rec}} \left( \{\mathscr W(G_\ell)\}_{\ell\in L(\mathcal T)} \right) \cong \operatorname{Eq}_{\mathcal U_{\mathrm{flat}}} \left( \{\mathscr W(G_\ell)\}_{\ell\in L(\mathcal T)} \right). }
\limsupUse in source · 7 passages
Search aliases: limsup
Use in source · 10-persistence.tex, line 239
· + ∑_j=0^t-1 (∏_r=j+1^t-1α_r)σ_j, where an empty product equals one. If α_t≤barα<1, σ_t≤barσ, then e_t ≤ barα^te_0 + fracbarσ(1-barα^t)1-barα, and consequently limsup_t→∞e_t ≤ fracbarσ1-barα.
Exact mathematical passage
\boxed{ \limsup_{t\to\infty}e_t \leq \frac{\bar\sigma}{1-\bar\alpha}. }
\limsup_{t\to\infty}Use in source · 5 passages
Search aliases: limsup_t→∞ limsup to infty
Use in source · 10-persistence.tex, line 239
· + ∑_j=0^t-1 (∏_r=j+1^t-1α_r)σ_j, where an empty product equals one. If α_t≤barα<1, σ_t≤barσ, then e_t ≤ barα^te_0 + fracbarσ(1-barα^t)1-barα, and consequently limsup_t→∞e_t ≤ fracbarσ1-barα.
Exact mathematical passage
\boxed{ \limsup_{t\to\infty}e_t \leq \frac{\bar\sigma}{1-\bar\alpha}. }
\llUse in source · 1 passage
Search aliases: ll
Use in source · 04-approximate-workspaces.tex, line 241
The spectrum supports three distinct interpretations: rcl λ_k=0 · Longleftrightarrow · exact compatible direction, 0<λ_kll g_d · Longrightarrow · approximately transported direction, λ_k≈λ_k+1 · Longrightarrow · rank selection is unstable at that boundary. A low eigenvalue can still be scientifically spurious if it arises from a poorly chosen weight, a nearly disconnected graph, or a noncausal encoding. The causal and null gates in later parts remain necessary.
Exact mathematical passage
\begin{array}{rcl} \lambda_k=0 &\Longleftrightarrow& \text{exact compatible direction},\\ 0<\lambda_k\ll g_d &\Longrightarrow& \text{approximately transported direction},\\ \lambda_k\approx\lambda_{k+1} &\Longrightarrow& \text{rank selection is unstable at that boundary}. \end{array}
\mathrm{local}Use in source · 1 passage
Search aliases: local mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 1066
Let every node store a complete copy of the same core: E_i=I_d for every i. Then coherence is perfect and reconstruction is robust, but k_0=1, min_iδ_i^local=0. If the archive is never used in downstream control, then also η_causal=0. This is a shared representation or archive, not a relationally irreducible workspace.
Exact mathematical passage
k_0=1, \qquad \min_i\delta_i^{\mathrm{local}}=0.
\logUse in source · 24 passages
Search aliases: log
Use in source · 06-dynamic-workspace-theory.tex, line 296
For a finite target alphabet and logarithmic scoring loss ℓ_log(y,q)=-log q(y), q∈ P( Y), the identity is exact: Risk_log(S_t)=H(Y_t^+mid S_t), Risk_log(S_t)-Risk_log( H_t) = I(Y_t^+; H_tmid S_t). Natural logarithms measure the gap in nats; base-two logarithms measure it in bits.
Exact mathematical passage
\ell_{\log}(y,q)=-\log q(y), \qquad q\in\mathcal P(\mathsf Y),
\lorUse in source · 2 passages
Search aliases: lor
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 883
Let the one-step utility be U_g(a,r;b,h^-) = 1{a=g⊕ b⊕ h^-} +2 1{h^-lor r=1} -frac12r. For fixed (g,b,h^-), the unique maximizer is (a^*,r^*) = (g⊕ b⊕ h^-,1-h^-). Indeed: item a wrong task action loses one unit; item omitting repair when h^-=0 loses 3/2 units; and item performing unnecessary repair when h^-=1 loses 1/2 unit. The smallest optimal-action gap is therefore Δ_Q=frac12. By Theorem~[source reference], any uniformly accurate value model with ε_Q<frac14 recovers the exact greedy joint ac…
Exact mathematical passage
U_g(a,r;b,h^-) = \mathbf 1\{a=g\oplus b\oplus h^-\} +2\mathbf 1\{h^-\lor r=1\} -\frac12r.
\mathsf{losses}Use in source · 1 passage
Search aliases: losses mathsf
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1051
The machine-readable record should include: SpecificationRecord ={ · reference, family, equivalence_classes, metric, · targets, losses, horizons, interventions, · null_panels, thresholds, selection_history, · identified_sets, uniform_bounds, gate_envelopes }. Every omitted family member requires a reason. Every changed specification requires a data-split label and time stamp. Every gate requires pointwise and family-wide status.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{SpecificationRecord} =\{& \mathsf{reference}, \mathsf{family}, \mathsf{equivalence\_classes}, \mathsf{metric},\\ &\mathsf{targets}, \mathsf{losses}, \mathsf{horizons}, \mathsf{interventions},\\ &\mathsf{null\_panels}, \mathsf{thresholds}, \mathsf{selection\_history},\\ &\mathsf{identified\_sets}, \mathsf{uniform\_bounds}, \mathsf{gate\_envelopes} \}. \end{aligned} }
\mathfrak mUse in source · 1 passage
Search aliases: m mathfrak
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 175
A family w=(w_α)_α is exactly compatible when δ^0w=0. Its direct mismatch is m_ U(w)=δ^0w. After choosing inner products and positive overlap weights, the mismatch energy is E_ov(w) = δ^0w ^2 = ∑_α<β ν_αβ r_αβ^βw_β -r_αβ^αw_α ^2. This is the appropriate obstruction when the full local states are already given. Such a family glues exactly if and only if its mismatch vector itself vanishes. No cohomological quotient is needed for that direct question.
Exact mathematical passage
\boxed{ \mathfrak m_{\mathcal U}(w)=\delta^0w. }
m^2Use in source · 1 passage
Search aliases: m^2
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 162
The derivative is F_λ'(m) = λsech^2(λ m). At zero this equals λ, proving stability for λ<1 and instability for λ>1. At a nonzero fixed point, F_λ'(m_λ) = λ(1-m_λ^2) = frac(1-m_λ^2)artanh(m_λ)m_λ <1, because artanh(m) < fracm1-m^2 (0<m<1). The derivative is positive, so the nonzero fixed points are locally stable. Finally, expanding tanh(λ m) = λ m- fracλ^3m^33 +O(m^5) and solving the nonzero fixed-point equation gives the stated asymptotic.
Exact mathematical passage
\operatorname{artanh}(m) < \frac{m}{1-m^2} \qquad(0<m<1).
m^3Use in source · 1 passage
Search aliases: m^3
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 170
ambda, proving stability for λ<1 and instability for λ>1. At a nonzero fixed point, F_λ'(m_λ) = λ(1-m_λ^2) = frac(1-m_λ^2)artanh(m_λ)m_λ <1, because artanh(m) < fracm1-m^2 (0<m<1). The derivative is positive, so the nonzero fixed points are locally stable. Finally, expanding tanh(λ m) = λ m- fracλ^3m^33 +O(m^5) and solving the nonzero fixed-point equation gives the stated asymptotic.
Exact mathematical passage
\tanh(\lambda m) = \lambda m- \frac{\lambda^3m^3}{3} +O(m^5)
m^5Use in source · 1 passage
Search aliases: m^5
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 170
ambda, proving stability for λ<1 and instability for λ>1. At a nonzero fixed point, F_λ'(m_λ) = λ(1-m_λ^2) = frac(1-m_λ^2)artanh(m_λ)m_λ <1, because artanh(m) < fracm1-m^2 (0<m<1). The derivative is positive, so the nonzero fixed points are locally stable. Finally, expanding tanh(λ m) = λ m- fracλ^3m^33 +O(m^5) and solving the nonzero fixed-point equation gives the stated asymptotic.
Exact mathematical passage
\tanh(\lambda m) = \lambda m- \frac{\lambda^3m^3}{3} +O(m^5)
M_{\mathcal U}Use in source · 1 passage
Search aliases: M_ U mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 674
Let m_i=|{α:i∈ V_α}| be the multiplicity of vertex i. Then J_ U^*J_ U=M_ U, (M_ Uc)_i=m_ic_i. The pseudoinverse performs coordinatewise averaging: (J_ U^† u)_i = frac1m_i ∑_α:i∈ V_α(u_α)_i. Let widehat u = P_ker K_ Uu = J_ Uwidehat c. Then widehat c = J_ U^†widehat u and u-J_ Uwidehat c ≤ frac K_ Uu sqrtγ_ U^tot. If m_min=min_i m_i, then widehat c-J_ U^† u ≤ frac K_ Uu sqrtm_minγ_ U^tot. The simple overlap average and the globally coherent least-squares assembly are close only whe
Exact mathematical passage
J_{\mathcal U}^*J_{\mathcal U}=M_{\mathcal U}, \qquad (M_{\mathcal U}c)_i=m_ic_i.
\mathfrak m_{\mathcal U}Use in source · 1 passage
Search aliases: m_ U mathfrak mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 175
A family w=(w_α)_α is exactly compatible when δ^0w=0. Its direct mismatch is m_ U(w)=δ^0w. After choosing inner products and positive overlap weights, the mismatch energy is E_ov(w) = δ^0w ^2 = ∑_α<β ν_αβ r_αβ^βw_β -r_αβ^αw_α ^2. This is the appropriate obstruction when the full local states are already given. Such a family glues exactly if and only if its mismatch vector itself vanishes. No cohomological quotient is needed for that direct question.
Exact mathematical passage
\boxed{ \mathfrak m_{\mathcal U}(w)=\delta^0w. }
M_EUse in source · 1 passage
Search aliases: M_E
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 131
For a general invertible gauge, define m_V=σ_min(G_V), M_V= G_V , m_E=σ_min(G_E), M_E= G_E . The covariance identity yields m_E^2 E_H(c) ≤ E_H^g(G_Vc) ≤ M_E^2 E_H(c), and m_V^2 c ^2 ≤ G_Vc ^2 ≤ M_V^2 c ^2. Therefore the Rayleigh quotients obey fracm_E^2M_V^2 frac E_H(c) c ^2 ≤ frac E_H^g(G_Vc) G_Vc ^2 ≤ fracM_E^2m_V^2 frac E_H(c) c ^2. By the min--max principle, fracm_E^2M_V^2λ_k(L_H) ≤ λ_k(L_H^g) ≤ fracM_E^2m_V^2λ_k(L_H). Exact zero modes are unchanged, but fixed-metric approximate eigenvalues …
Exact mathematical passage
m_E=\sigma_{\min}(G_E), \qquad M_E=\|G_E\|.
m_EUse in source · 1 passage
Search aliases: m_E
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 131
For a general invertible gauge, define m_V=σ_min(G_V), M_V= G_V , m_E=σ_min(G_E), M_E= G_E . The covariance identity yields m_E^2 E_H(c) ≤ E_H^g(G_Vc) ≤ M_E^2 E_H(c), and m_V^2 c ^2 ≤ G_Vc ^2 ≤ M_V^2 c ^2. Therefore the Rayleigh quotients obey fracm_E^2M_V^2 frac E_H(c) c ^2 ≤ frac E_H^g(G_Vc) G_Vc ^2 ≤ fracM_E^2m_V^2 frac E_H(c) c ^2. By the min--max principle, fracm_E^2M_V^2λ_k(L_H) ≤ λ_k(L_H^g) ≤ fracM_E^2m_V^2λ_k(L_H). Exact zero modes are unchanged, but fixed-metric approximate eigenvalues …
Exact mathematical passage
m_E=\sigma_{\min}(G_E), \qquad M_E=\|G_E\|.
M_E^2Use in source · 3 passages
Search aliases: M_E^2
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 137
For a general invertible gauge, define m_V=σ_min(G_V), M_V= G_V , m_E=σ_min(G_E), M_E= G_E . The covariance identity yields m_E^2 E_H(c) ≤ E_H^g(G_Vc) ≤ M_E^2 E_H(c), and m_V^2 c ^2 ≤ G_Vc ^2 ≤ M_V^2 c ^2. Therefore the Rayleigh quotients obey fracm_E^2M_V^2 frac E_H(c) c ^2 ≤ frac E_H^g(G_Vc) G_Vc ^2 ≤ fracM_E^2m_V^2 frac E_H(c) c ^2. By the min--max principle, fracm_E^2M_V^2λ_k(L_H) ≤ λ_k(L_H^g) ≤ fracM_E^2m_V^2λ_k(L_H). Exact zero modes are unchanged, but fixed-metric approximate eigenvalues …
Exact mathematical passage
m_E^2\mathcal E_H(c) \leq \mathcal E_{H^g}(G_Vc) \leq M_E^2\mathcal E_H(c),
m_E^2Use in source · 3 passages
Search aliases: m_E^2
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 137
For a general invertible gauge, define m_V=σ_min(G_V), M_V= G_V , m_E=σ_min(G_E), M_E= G_E . The covariance identity yields m_E^2 E_H(c) ≤ E_H^g(G_Vc) ≤ M_E^2 E_H(c), and m_V^2 c ^2 ≤ G_Vc ^2 ≤ M_V^2 c ^2. Therefore the Rayleigh quotients obey fracm_E^2M_V^2 frac E_H(c) c ^2 ≤ frac E_H^g(G_Vc) G_Vc ^2 ≤ fracM_E^2m_V^2 frac E_H(c) c ^2. By the min--max principle, fracm_E^2M_V^2λ_k(L_H) ≤ λ_k(L_H^g) ≤ fracM_E^2m_V^2λ_k(L_H). Exact zero modes are unchanged, but fixed-metric approximate eigenvalues …
Exact mathematical passage
m_E^2\mathcal E_H(c) \leq \mathcal E_{H^g}(G_Vc) \leq M_E^2\mathcal E_H(c),
m_iUse in source · 4 passages
Search aliases: m_i
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 670
Let m_i=|{α:i∈ V_α}| be the multiplicity of vertex i. Then J_ U^*J_ U=M_ U, (M_ Uc)_i=m_ic_i. The pseudoinverse performs coordinatewise averaging: (J_ U^† u)_i = frac1m_i ∑_α:i∈ V_α(u_α)_i. Let widehat u = P_ker K_ Uu = J_ Uwidehat c. Then widehat c = J_ U^†widehat u and u-J_ Uwidehat c ≤ frac K_ Uu sqrtγ_ U^tot. If m_min=min_i m_i, then widehat c-J_ U^† u ≤ frac K_ Uu sqrtm_minγ_
Exact mathematical passage
m_i=|\{\alpha:i\in V_\alpha\}|
m_{\min}Use in source · 2 passages
Search aliases: m_min min
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 711
forms coordinatewise averaging: (J_ U^† u)_i = frac1m_i ∑_α:i∈ V_α(u_α)_i. Let widehat u = P_ker K_ Uu = J_ Uwidehat c. Then widehat c = J_ U^†widehat u and u-J_ Uwidehat c ≤ frac K_ Uu sqrtγ_ U^tot. If m_min=min_i m_i, then widehat c-J_ U^† u ≤ frac K_ Uu sqrtm_minγ_ U^tot. The simple overlap average and the globally coherent least-squares assembly are close only when the total descent energy is small relative to the cover gap.
Exact mathematical passage
m_{\min}=\min_i m_i
m_{\mathrm{rec}}Use in source · 4 passages
Search aliases: m_rec mathrm
Use in source · 11-reconstruction-and-resilience.tex, line 373
Define the minimum reconstructing coalition size m_rec = min{|S|:α_S>0} and the maximum exact erasure tolerance k_erase = max{k:α^(k)>0}. The condition m_rec≥2 means that no individual encoding is sufficient for exact core recovery. The condition k_erase≥1 means that the system survives at least one node loss. These can hold simultaneously because nonlocality of encoding is not the same as fragility.
Exact mathematical passage
\boxed{ m_{\mathrm{rec}} = \min\{|S|:\alpha_S>0\} }
M_sUse in source · 4 passages
Search aliases: M_s
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 348
thm:goal-retention Let G_s∈ R^d_G obey G_s+1 = R_sG_s+B_sC_s+1+ζ_s+1 (s=t,…,t+τ-1). Consider two intervention runs that set G_t=g, G_t'=g', and then use the same command trajectory and the same disturbance realization. Let R_t+τ:t = R_t+τ-1⋯ R_t. Then G_t+τ-G_t+τ' = R_t+τ:t(g-g'). If m_s ≤ σ_min(R_s), R_s ≤ M_s, then ( ∏_s=t^t+τ-1m_s ) g-g' ≤ G_t+τ-G_t+τ' ≤ ( ∏_s=t^t+τ-1M_s ) g-g' .
Exact mathematical passage
m_s \leq \sigma_{\min}(R_s), \qquad \|R_s\|\leq M_s,
m_sUse in source · 5 passages
Search aliases: m_s
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 348
thm:goal-retention Let G_s∈ R^d_G obey G_s+1 = R_sG_s+B_sC_s+1+ζ_s+1 (s=t,…,t+τ-1). Consider two intervention runs that set G_t=g, G_t'=g', and then use the same command trajectory and the same disturbance realization. Let R_t+τ:t = R_t+τ-1⋯ R_t. Then G_t+τ-G_t+τ' = R_t+τ:t(g-g'). If m_s ≤ σ_min(R_s), R_s ≤ M_s, then ( ∏_s=t^t+τ-1m_s ) g-g' ≤ G_t+τ-G_t+τ' ≤ ( ∏_s=t^t+τ-1M_s ) g-g' .
Exact mathematical passage
m_s \leq \sigma_{\min}(R_s), \qquad \|R_s\|\leq M_s,
M_tUse in source · 10 passages
Search aliases: M_t
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 58
A controlled state contains at least C_t^ctl = ( W_t,G_t,M_t,B_t,E_t ), where G_t is the represented goal, M_t is a workspace-integrity monitor, B_t is the current boundary or routing state, and E_t is the declared external context. An action is generated by A_t ∼ π_t ( ·mid W_t,G_t,M_t,B_t,E_t ). The future controlled state obeys a time-unrolled structural model S_t+1 = F_t(S_t,A_t,E_t+1,ξ_t+1), W_t+1=ω_t+1(S_t+1). The intervention semantics are inherited from Part~VII. A symbol such as do(A_t=…
Exact mathematical passage
C_t^{\mathrm{ctl}} = \left( W_t,G_t,M_t,B_t,E_t \right),
m_tUse in source · 3 passages
Search aliases: m_t
Use in source · 19-summary-of-main-results.tex, line 395
For m_t+1=tanh(λ m_t), there is a unique zero fixed point for 0≤λ≤1. For λ>1, the zero state is unstable and exactly two stable nonzero fixed points appear. Their amplitude satisfies m_λ = sqrtfrac3(λ-1)λ^3 + O((λ-1)^3/2). This is an exact structural benchmark, not a universal law for complete relational workspaces.
Exact mathematical passage
m_{t+1}=\tanh(\lambda m_t),
m_{t+1}Use in source · 2 passages
Search aliases: m_t+1
Use in source · 19-summary-of-main-results.tex, line 395
For m_t+1=tanh(λ m_t), there is a unique zero fixed point for 0≤λ≤1. For λ>1, the zero state is unstable and exactly two stable nonzero fixed points appear. Their amplitude satisfies m_λ = sqrtfrac3(λ-1)λ^3 + O((λ-1)^3/2). This is an exact structural benchmark, not a universal law for complete relational workspaces.
Exact mathematical passage
m_{t+1}=\tanh(\lambda m_t),
M_VUse in source · 1 passage
Search aliases: M_V
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 126
For a general invertible gauge, define m_V=σ_min(G_V), M_V= G_V , m_E=σ_min(G_E), M_E= G_E . The covariance identity yields m_E^2 E_H(c) ≤ E_H^g(G_Vc) ≤ M_E^2 E_H(c), and m_V^2 c ^2 ≤ G_Vc ^2 ≤ M_V^2 c ^2. Therefore the Rayleigh quotients obey fracm_E^2M_V^2 frac E_H(c) c ^2 ≤ frac E_H^g(G_Vc) G_Vc ^2 ≤ fracM_E^2m_V^2 frac E_H(c) c ^2. By the min--max principle, fracm_E^2M_V^2λ_k(L_H) ≤ λ_k(L_H^g) ≤ fracM_E^2m_V^2λ_k(L_H). Exact zero modes are unchanged, but fixed-metric approximate eigenvalues …
Exact mathematical passage
m_V=\sigma_{\min}(G_V), \qquad M_V=\|G_V\|,
m_VUse in source · 1 passage
Search aliases: m_V
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 126
For a general invertible gauge, define m_V=σ_min(G_V), M_V= G_V , m_E=σ_min(G_E), M_E= G_E . The covariance identity yields m_E^2 E_H(c) ≤ E_H^g(G_Vc) ≤ M_E^2 E_H(c), and m_V^2 c ^2 ≤ G_Vc ^2 ≤ M_V^2 c ^2. Therefore the Rayleigh quotients obey fracm_E^2M_V^2 frac E_H(c) c ^2 ≤ frac E_H^g(G_Vc) G_Vc ^2 ≤ fracM_E^2m_V^2 frac E_H(c) c ^2. By the min--max principle, fracm_E^2M_V^2λ_k(L_H) ≤ λ_k(L_H^g) ≤ fracM_E^2m_V^2λ_k(L_H). Exact zero modes are unchanged, but fixed-metric approximate eigenvalues …
Exact mathematical passage
m_V=\sigma_{\min}(G_V), \qquad M_V=\|G_V\|,
M_V^2Use in source · 3 passages
Search aliases: M_V^2
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 145
For a general invertible gauge, define m_V=σ_min(G_V), M_V= G_V , m_E=σ_min(G_E), M_E= G_E . The covariance identity yields m_E^2 E_H(c) ≤ E_H^g(G_Vc) ≤ M_E^2 E_H(c), and m_V^2 c ^2 ≤ G_Vc ^2 ≤ M_V^2 c ^2. Therefore the Rayleigh quotients obey fracm_E^2M_V^2 frac E_H(c) c ^2 ≤ frac E_H^g(G_Vc) G_Vc ^2 ≤ fracM_E^2m_V^2 frac E_H(c) c ^2. By the min--max principle, fracm_E^2M_V^2λ_k(L_H) ≤ λ_k(L_H^g) ≤ fracM_E^2m_V^2λ_k(L_H). Exact zero modes are unchanged, but fixed-metric approximate eigenvalues …
Exact mathematical passage
m_V^2\|c\|^2 \leq \|G_Vc\|^2 \leq M_V^2\|c\|^2.
m_V^2Use in source · 3 passages
Search aliases: m_V^2
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 145
For a general invertible gauge, define m_V=σ_min(G_V), M_V= G_V , m_E=σ_min(G_E), M_E= G_E . The covariance identity yields m_E^2 E_H(c) ≤ E_H^g(G_Vc) ≤ M_E^2 E_H(c), and m_V^2 c ^2 ≤ G_Vc ^2 ≤ M_V^2 c ^2. Therefore the Rayleigh quotients obey fracm_E^2M_V^2 frac E_H(c) c ^2 ≤ frac E_H^g(G_Vc) G_Vc ^2 ≤ fracM_E^2m_V^2 frac E_H(c) c ^2. By the min--max principle, fracm_E^2M_V^2λ_k(L_H) ≤ λ_k(L_H^g) ≤ fracM_E^2m_V^2λ_k(L_H). Exact zero modes are unchanged, but fixed-metric approximate eigenvalues …
Exact mathematical passage
m_V^2\|c\|^2 \leq \|G_Vc\|^2 \leq M_V^2\|c\|^2.
m_\lambdaUse in source · 4 passages
Search aliases: m_λ lambda
Use in source · 19-summary-of-main-results.tex, line 401
For m_t+1=tanh(λ m_t), there is a unique zero fixed point for 0≤λ≤1. For λ>1, the zero state is unstable and exactly two stable nonzero fixed points appear. Their amplitude satisfies m_λ = sqrtfrac3(λ-1)λ^3 + O((λ-1)^3/2). This is an exact structural benchmark, not a universal law for complete relational workspaces.
Exact mathematical passage
\boxed{ m_\lambda = \sqrt{\frac{3(\lambda-1)}{\lambda^3}} + O\bigl((\lambda-1)^{3/2}\bigr). }
m_\lambda^2Use in source · 1 passage
Search aliases: m_λ^2 lambda
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 153
The derivative is F_λ'(m) = λsech^2(λ m). At zero this equals λ, proving stability for λ<1 and instability for λ>1. At a nonzero fixed point, F_λ'(m_λ) = λ(1-m_λ^2) = frac(1-m_λ^2)artanh(m_λ)m_λ <1, because artanh(m) < fracm1-m^2 (0<m<1). The derivative is positive, so the nonzero fixed points are locally stable. Finally, expanding tanh(λ m) = λ m- fracλ^3m^33 +O(m^5) and solving the nonzero fixed-point equation gives the stated asymptotic.
Exact mathematical passage
F_\lambda'(m_\lambda) = \lambda(1-m_\lambda^2) = \frac{(1-m_\lambda^2)\operatorname{artanh}(m_\lambda)}{m_\lambda} <1,
\mathrm{MA}Use in source · 1 passage
Search aliases: MA mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 785
Consider three agents: V_MA={P,M,R}, called the planner, monitor, and recorder. The global workspace-control state is c_t=(g_t,b_t,h_t)∈ F_2^3, where: ll g_t=goal bit, · b_t=environment or belief bit,
Exact mathematical passage
V_{\mathrm{MA}}=\{P,M,R\},
\mathrm{maint}Use in source · 4 passages
Search aliases: maint mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 633
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g,
Exact mathematical passage
\mathcal J_{\mathrm{maint}}
\mathrm{marg}Use in source · 1 passage
Search aliases: marg mathrm
Use in source · 07-relational-irreducibility.tex, line 267
Let P be the intact law of (Y_t^+, H_t^1,…, H_t^n). Define the local-marginal null class N_marg(P) = { Q: Q_ H_t^i=P_ H_t^i for every i }, and the stronger local-predictive-matched class N_pred(P) = { Q: Q_(Y_t^+, H_t^i) = P_(Y_t^+, H_t^i) for every i }. Because H_t^i can include the complete local trajectory, the latter class can preserve all single-component temporal and predictive behavior while altering cross-component organization.
Exact mathematical passage
\mathcal N_{\mathrm{marg}}(P) = \left\{ Q: Q_{\mathbf H_t^i}=P_{\mathbf H_t^i} \text{ for every }i \right\},
\max_{a\neq a^*}Use in source · 1 passage
Search aliases: max_a≠ a^* max neq
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 544
a)] ≤ δ_opt. Then, for every true-value-optimal policy π^*, E_a∼π^*[Q(a)] - E_a∼widehatπ[Q(a)] ≤ 2ε_Q+δ_opt. For a deterministic greedy action widehat a∈argmax_awidehat Q(a), Q(a^*)-Q(widehat a) ≤2ε_Q. If the true optimal action a^* is unique and its value gap Δ_Q = Q(a^*)- max_a≠ a^*Q(a) satisfies Δ_Q>2ε_Q, then every greedy maximizer of widehat Q equals a^*.
Exact mathematical passage
\Delta_Q = Q(a^*)- \max_{a\neq a^*}Q(a)
\max_{i\in V}Use in source · 3 passages
Search aliases: max_i∈ V max in
Use in source · 04-approximate-workspaces.tex, line 504
Suppose the edge maps are perturbed to widetilde H_e=H_e+Δ_e while the weights and vertex metrics remain fixed. Define δ_H^2 = max_i∈ V ∑_e:s(e)=iw_e Δ_e ^2. Let F=D_widetilde H-D_H. Then (Fc)_e=-sqrtw_e Δ_ec_s(e), F ≤δ_H. Since L_widetilde H-L_H =D_H^*F+F^*D_H+F^*F, we obtain L_widetilde H-L_H ≤ 2 D_H δ_H+δ_H^2.
Exact mathematical passage
\boxed{ \delta_H^2 = \max_{i\in V} \sum_{e:s(e)=i}w_e\|\Delta_e\|^2. }
\max_jUse in source · 2 passages
Search aliases: max_j max
Use in source · 19-summary-of-main-results.tex, line 543
Suppose a certificate requires every gate G_1,…,G_m to pass, and the predeclared test for gate j has false-pass probability at most α_j whenever that required property is absent. Under the global null that at least one required property is absent, P(complete certificate passes) ≤ max_jα_j. No independence assumption among gate tests is required. The guarantee fails under adaptive gate deletion, selective reporting, or reuse of the certification split.
Exact mathematical passage
\boxed{ \mathbb P(\text{complete certificate passes}) \leq \max_j\alpha_j. }
\max_{\substack{c\in S\\\|c\|=1}}Use in source · 1 passage
Search aliases: max_substackc∈ S c =1 max substack in
Use in source · 04-approximate-workspaces.tex, line 219
[Min--max characterization] For 1≤ k≤ N, λ_k = min_substackS⊆ C_V dim S=k max_substackc∈ S c =1 E_H(c). Consequently, the span of the first k eigenvectors minimizes the worst-case coherence energy among all k-dimensional candidate subspaces.
Exact mathematical passage
\lambda_k = \min_{\substack{S\subseteq\mathcal C_V\\\dim S=k}} \ \max_{\substack{c\in S\\\|c\|=1}} \mathcal E_H(c).
\max_{S\neq S_t^*}Use in source · 1 passage
Search aliases: max_S≠ S_t^* max neq
Use in source · 15-boundary-formation-and-stability.tex, line 196
[Held-out boundary recovery] Let S_pass be finite and let S_t^* = argmax_S∈ S_pass B_t(S) be unique. Define the population margin Δ_t^B = B_t(S_t^*) - max_S≠ S_t^* B_t(S)>0. If sup_S∈ S_pass | widehat B_t(S)- B_t(S) | ≤ε_t, then every empirical maximizer widehat S_t satisfies B_t(S_t^*)- B_t(widehat S_t) ≤2ε_t. If 2ε_t<Δ_t^B, then widehat S_t=S_t^*.
Exact mathematical passage
\Delta_t^B = \mathcal B_t(S_t^*) - \max_{S\neq S_t^*}\mathcal B_t(S)>0.
\max_{t<T}Use in source · 1 passage
Search aliases: max_t<T max
Use in source · 10-persistence.tex, line 345
A finite-horizon persistence certificate may be recorded as P_0:T = ( max_t<Tq_t^str, max_t≤ Te_t, min_t<Tμ_t^keep, ∑_t<Tσ_t ). No single coordinate of this vector subsumes the others.
Exact mathematical passage
\boxed{ \mathcal P_{0:T} = \left( \max_{t<T}q_t^{\mathrm{str}}, \max_{t\leq T}e_t, \min_{t<T}\mu_t^{\mathrm{keep}}, \sum_{t<T}\sigma_t \right). }
\max_{t\leq T}Use in source · 1 passage
Search aliases: max_t≤ T max leq
Use in source · 10-persistence.tex, line 345
A finite-horizon persistence certificate may be recorded as P_0:T = ( max_t<Tq_t^str, max_t≤ Te_t, min_t<Tμ_t^keep, ∑_t<Tσ_t ). No single coordinate of this vector subsumes the others.
Exact mathematical passage
\boxed{ \mathcal P_{0:T} = \left( \max_{t<T}q_t^{\mathrm{str}}, \max_{t\leq T}e_t, \min_{t<T}\mu_t^{\mathrm{keep}}, \sum_{t<T}\sigma_t \right). }
\max_{\pi}Use in source · 1 passage
Search aliases: max_π max pi
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 520
gintheorem[Approximate counterfactual policy selection] Let A be a finite feasible action set. Let Q: A→ R be the true interventional value and let widehat Q satisfy sup_a∈ A|widehat Q(a)-Q(a)|≤ε_Q. Suppose a policy widehatπ is δ_opt-optimal for widehat Q: max_π E_a∼π[widehat Q(a)] - E_a∼widehatπ[widehat Q(a)] ≤ δ_opt. Then, for every true-value-optimal policy π^*, E_a∼π^*[Q(a)] - E_a∼widehatπ[Q(a)] ≤ 2ε_Q+δ_opt. For a deterministic greedy action widehat a∈argmax_awidehat Q(a), Q(a^*)-Q(widehat …
Exact mathematical passage
\max_{\pi} \mathbb E_{a\sim\pi}[\widehat Q(a)] - \mathbb E_{a\sim\widehat\pi}[\widehat Q(a)] \leq \delta_{\mathrm{opt}}.
\max_{\varsigma_j\in\mathfrak S_\eta}Use in source · 1 passage
Search aliases: max_ς_j∈ S_η max varsigma in mathfrak eta
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 842
Let S_η be an η-net of ( S,d_ S) with covering number N(η, S,d_ S). If both the population and empirical margin functions are L_q-Lipschitz, then sup_ς∈ S |widehat m_q(ς)-m_q(ς)| ≤ max_ς_j∈ S_η |widehat m_q(ς_j)-m_q(ς_j)| +2L_qη. For bounded empirical means, a valid radius is therefore ε_q,n,η(δ) = sqrt frac log(2| J_*| N(η, S,d_ S)/δ) 2n +2L_qη. The tuning parameter η balances net cardinality against interpolation error. More refined empirical-process bounds may replace this elementary covering…
Exact mathematical passage
\sup_{\varsigma\in\mathfrak S} |\widehat m_q(\varsigma)-m_q(\varsigma)| \leq \max_{\varsigma_j\in\mathfrak S_\eta} |\widehat m_q(\varsigma_j)-m_q(\varsigma_j)| +2L_q\eta.
\mathbf{Meas}Use in source · 1 passage
Search aliases: Meas mathbf
Use in source · 02-static-core-transfer-theory.tex, line 51
The finite-dimensional Hilbert assumption supplies adjoints and spectral tools. The exact compatible-section definitions require less and may later be formulated in categories such as Ban, Meas, Prob, Top, Alg.
Exact mathematical passage
\mathbf{Ban},\qquad \mathbf{Meas},\qquad \mathbf{Prob},\qquad \mathbf{Top},\qquad \mathbf{Alg}.
\mathrm{med}Use in source · 2 passages
Search aliases: med mathrm
Use in source · 08-causal-efficacy-and-reentry.tex, line 175
A stronger mediation test equalizes the workspace state after two distinct channel interventions. Let μ be a common imposed workspace distribution, implemented by a feasible stochastic intervention in the sense of Definition~[source reference]. The notation below is shorthand for that implementation. Define the residual mediation defect δ_med = sup_jmath,jmath' D ( P^jmath,do(W_t∼μ)(Y_t^+), P^jmath',do(W_t∼μ)(Y_t^+) ). A small value means that once the workspace state is equalized, little of the…
Exact mathematical passage
\delta_{\mathrm{med}} = \sup_{\jmath,\jmath'} D\!\left( \mathbb P^{\jmath,\operatorname{do}(W_t\sim\mu)}(Y_t^+), \mathbb P^{\jmath',\operatorname{do}(W_t\sim\mu)}(Y_t^+) \right).
\mathrm{meta}Use in source · 13 passages
Search aliases: meta mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 489
First assume each local state already lies in its exact local workspace. Define B_ U := δ^0: check C^0( U;mathscr W) ⟶ check C^1( U;mathscr W) and the meta-Laplacian L_ U^meta = B_ U^*B_ U. By Theorem~[source reference], ker L_ U^meta = R_ Umathscr W(G). Thus the gluing problem is itself a workspace problem whose ``nodes'' are local workspaces and whose interfaces are overlaps.
Exact mathematical passage
\boxed{ L_{\mathcal U}^{\mathrm{meta}} = B_{\mathcal U}^*B_{\mathcal U}. }
\mathsf{metric}Use in source · 1 passage
Search aliases: metric mathsf
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1051
The machine-readable record should include: SpecificationRecord ={ · reference, family, equivalence_classes, metric, · targets, losses, horizons, interventions, · null_panels, thresholds, selection_history, · identified_sets, uniform_bounds, gate_envelopes }. Every omitted family member requires a reason. Every changed specification requires a data-split label and time stamp. Every gate requires pointwise and family-wide status.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{SpecificationRecord} =\{& \mathsf{reference}, \mathsf{family}, \mathsf{equivalence\_classes}, \mathsf{metric},\\ &\mathsf{targets}, \mathsf{losses}, \mathsf{horizons}, \mathsf{interventions},\\ &\mathsf{null\_panels}, \mathsf{thresholds}, \mathsf{selection\_history},\\ &\mathsf{identified\_sets}, \mathsf{uniform\_bounds}, \mathsf{gate\_envelopes} \}. \end{aligned} }
\middleUse in source · 1 passage
Search aliases: middle
Use in source · 06-dynamic-workspace-theory.tex, line 219
For an arbitrary history statistic S_t=s( H_t), let K_t^S(s,·) = P(Y_t^+∈·mid S_t=s). Whenever the conditional relative entropy is finite, define the sufficiency defect δ_suff(S_t) = E [ KL ( K_t( H_t,·) middle K_t^S(S_t,·) ) ].
Exact mathematical passage
\boxed{ \delta_{\mathrm{suff}}(S_t) = \mathbb E\!\left[ \KL\!\left( K_t(\mathbf H_t,\cdot) \,\middle\|\, K_t^S(S_t,\cdot) \right) \right]. }
\min_{1\leq k\leq K}Use in source · 1 passage
Search aliases: min_1≤ k≤ K min leq leq
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 890
A pointwise valid test does not remain valid after the analyst searches for the most favorable target, horizon, null panel, or threshold. Consider K independent null p-values and select the smallest. Then P(min_1≤ k≤ Kp_k≤α) = 1-(1-α)^K, which exceeds α whenever K>1. The same logic applies when a workspace certificate is reported only for the specification that produced the largest gate margins.
Exact mathematical passage
\mathbb P\left(\min_{1\leq k\leq K}p_k\leq\alpha\right) = 1-(1-\alpha)^K,
\min_{c\neq0}Use in source · 1 passage
Search aliases: min_c≠0 min neq
Use in source · 11-reconstruction-and-resilience.tex, line 305
Define the accessible block support of c≠0 by supp_E(c) = {i∈ V:E_ic≠0} and define the node-erasure distance d_er = min_c≠0|supp_E(c)|.
Exact mathematical passage
\boxed{ d_{\mathrm{er}} = \min_{c\neq0}|\operatorname{supp}_E(c)|. }
\min_iUse in source · 2 passages
Search aliases: min_i min
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 711
forms coordinatewise averaging: (J_ U^† u)_i = frac1m_i ∑_α:i∈ V_α(u_α)_i. Let widehat u = P_ker K_ Uu = J_ Uwidehat c. Then widehat c = J_ U^†widehat u and u-J_ Uwidehat c ≤ frac K_ Uu sqrtγ_ U^tot. If m_min=min_i m_i, then widehat c-J_ U^† u ≤ frac K_ Uu sqrtm_minγ_ U^tot. The simple overlap average and the globally coherent least-squares assembly are close only when the total descent energy is small relative to the cover gap.
Exact mathematical passage
m_{\min}=\min_i m_i
\min_{i\in V}Use in source · 3 passages
Search aliases: min_i∈ V min in
Use in source · 07-relational-irreducibility.tex, line 86
Define the coalition gap Δ_A^ℓ = Risk_ℓ(A)-Risk_ℓ(V) ≥0. The node-level joint advantage is Δ_joint^ℓ = min_i∈ V Δ_{i}^ℓ. Under logarithmic loss, Δ_joint^log = min_i∈ V I ( Y_t^+; H_t mid H_t^{i} ). Therefore Δ_joint^log>0 means that every individual component omits some predictive information available to the complete system.
Exact mathematical passage
\boxed{ \Delta_{\mathrm{joint}}^{\ell} = \min_{i\in V} \Delta_{\{i\}}^{\ell}. }
\min_{j\in\mathcal J_{\mathrm{maint}}}Use in source · 1 passage
Search aliases: min_j∈ J_maint min in mathcal mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 659
ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To maintain a reserve ρ>0, define the maintenance deficit e_t =(ρ-v_t)_+. Define the zero-reserve and bounded-deficit viability sets V_Θ = { S:ϕ_j(S)≥0 for every j∈ J_maint } V_Θ,e_max = { S:e(S)≤ e_max } The first set requires every protected gate to pass. The second permits a declared finite reserve deficit.
Exact mathematical passage
\boxed{ v_t = \min_{j\in\mathcal J_{\mathrm{maint}}}\phi_{j,t}. }
\min_qUse in source · 2 passages
Search aliases: min_q min
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 281
For a reference specification ς_0, define the distance to certificate failure by r_spec(W;ς_0) = inf{ d_ S(ς,ς_0): min_q m_q(W;ς)≤0 }. If no failing specification exists in the declared universe, the radius is infinite relative to that universe. A radius near zero means that a small scientifically defensible change can reverse the conclusion.
Exact mathematical passage
\boxed{ r_{\mathrm{spec}}(W;\varsigma_0) = \inf\left\{ d_{\mathfrak S}(\varsigma,\varsigma_0): \min_q m_q(W;\varsigma)\leq0 \right\}. }
\min_{q:L_q>0}Use in source · 3 passages
Search aliases: min_q:L_q>0 min
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 543
When b_q≡0, a convenient certificate radius is r_dec(W) = min_q:L_q>0 fracm_q(W; D_0)L_q. Every admissible family satisfying sup_ D∈ Dδ_ D < r_dec(W) preserves the sign of all required gate margins. In applications, the transport terms can be bounded using earlier results: small textwidth@>bfseriesraggedrightarraybackslashp0.22textwidth>raggedrightarraybackslashX@ Gate family · Relevant transport control
Exact mathematical passage
\boxed{ r_{\mathrm{dec}}(W) = \min_{q:L_q>0} \frac{m_q(W;\mathcal D_0)}{L_q}. }
\min_{q\in\mathcal J_*}Use in source · 2 passages
Search aliases: min_q∈ J_* min in mathcal
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 222
in J_*, define the specification envelope underline m_q^ S(W) = inf_ς∈ Sm_q(W;ς), overline m_q^ S(W) = sup_ς∈ Sm_q(W;ς). Its sensitivity width is Δ_q^spec(W) = overline m_q^ S(W) - underline m_q^ S(W). The robust certificate margin is r_ S(W) = inf_ς∈ S min_q∈ J_*m_q(W;ς). Then Cert_ S(W)=1 Longleftrightarrow r_ S(W)>0.
Exact mathematical passage
\boxed{ r_{\mathfrak S}(W) = \inf_{\varsigma\in\mathfrak S} \min_{q\in\mathcal J_*}m_q(W;\varsigma). }
\min_{Q\in\mathcal Q}Use in source · 2 passages
Search aliases: min_Q∈ Q min in mathcal
Use in source · 07-relational-irreducibility.tex, line 349
declared null Q, define Δ_tr(Q) = Risk_ℓ,Q(V) - Risk_ℓ,P(V). For a finite validated panel Q={Q_1,…,Q_m}⊆ N_pred(P), report both the complete vector Δ_tr( Q) = ( Δ_tr(Q_1),…, Δ_tr(Q_m) ) and the robust panel minimum Δ_tr^min( Q) = min_Q∈ QΔ_tr(Q). The panel must be fixed independently of the observed favorable gap. Otherwise null selection can manufacture apparent relational dependence.
Exact mathematical passage
\Delta_{\mathrm{tr}}^{\min}(\mathcal Q) = \min_{Q\in\mathcal Q}\Delta_{\mathrm{tr}}(Q).
\min_{\substack{A\subseteq V\\|A|\leq k}}Use in source · 1 passage
Search aliases: min_substackA⊆ V |A|≤ k min substack subseteq leq
Use in source · 11-reconstruction-and-resilience.tex, line 241
For k≥0, define the worst surviving lower frame bound α^(k) = min_substackA⊆ V |A|≤ k α_V∖ A. The sequence α^(k) is nonincreasing in k.
Exact mathematical passage
\boxed{ \alpha^{(k)} = \min_{\substack{A\subseteq V\\|A|\leq k}} \alpha_{V\setminus A}. }
\min_{\substack{A\subseteq V\\|A|\leq r}}Use in source · 1 passage
Search aliases: min_substackA⊆ V |A|≤ r min substack subseteq leq
Use in source · 07-relational-irreducibility.tex, line 124
For 0≤ r≤ |V|, define the order-r coalition gap profile by Δ^(r)_ℓ = min_substackA⊆ V |A|≤ r [ Risk_ℓ(A)-Risk_ℓ(V) ]. The profile is nonincreasing in r and reaches zero by r=|V|. It records how rapidly operative capacity becomes reconstructible as larger coalitions are permitted.
Exact mathematical passage
\boxed{ \Delta^{(r)}_\ell = \min_{\substack{A\subseteq V\\|A|\leq r}} \left[ \Risk_\ell(A)-\Risk_\ell(V) \right]. }
\min_{\substack{S\subseteq\mathcal C_V\\\dim S=k}}Use in source · 1 passage
Search aliases: min_substackS⊆ C_V dim S=k min substack subseteq mathcal dim
Use in source · 04-approximate-workspaces.tex, line 219
[Min--max characterization] For 1≤ k≤ N, λ_k = min_substackS⊆ C_V dim S=k max_substackc∈ S c =1 E_H(c). Consequently, the span of the first k eigenvectors minimizes the worst-case coherence energy among all k-dimensional candidate subspaces.
Exact mathematical passage
\lambda_k = \min_{\substack{S\subseteq\mathcal C_V\\\dim S=k}} \ \max_{\substack{c\in S\\\|c\|=1}} \mathcal E_H(c).
\min_{S\subseteq V_{\mathcal D}}Use in source · 1 passage
Search aliases: min_S⊆ V_ D min subseteq mathcal
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 303
A more stable quantity measures primitive carrier cost. Let w_ω>0 be a declared cost for each ω∈Ω, and assign a block the cost c(B)=∑_ω∈ Bw_ω. Define the sufficient support cost s_ε( D) = min_S⊆ V_ D { ∑_B∈ Sc(B): Risk_ D(S) ≤ Risk_ D(V_ D)+ε }. If D_fpreceq D_c is information faithful, then s_ε( D_f) ≤ s_ε( D_c). The fine decomposition permits every union of coarse blocks and may also permit cheaper sub-block coalitions. Equality holds whenever an optimal fine coalition is a union of complete c…
Exact mathematical passage
\boxed{ s_\varepsilon(\mathcal D) = \min_{S\subseteq V_{\mathcal D}} \left\{ \sum_{B\in S}c(B): \Risk_{\mathcal D}(S) \leq \Risk_{\mathcal D}(V_{\mathcal D})+\varepsilon \right\}. }
\min_{t<T}Use in source · 1 passage
Search aliases: min_t<T min
Use in source · 10-persistence.tex, line 345
A finite-horizon persistence certificate may be recorded as P_0:T = ( max_t<Tq_t^str, max_t≤ Te_t, min_t<Tμ_t^keep, ∑_t<Tσ_t ). No single coordinate of this vector subsumes the others.
Exact mathematical passage
\boxed{ \mathcal P_{0:T} = \left( \max_{t<T}q_t^{\mathrm{str}}, \max_{t\leq T}e_t, \min_{t<T}\mu_t^{\mathrm{keep}}, \sum_{t<T}\sigma_t \right). }
\min_{\theta\neq\theta_*}Use in source · 1 passage
Search aliases: min_θ≠θ_* min theta neq theta
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 608
[Uniform structure-selection recovery] Let T be a finite candidate family with population score J: T→ R. Let θ_* = argmin_θ∈ TJ(θ) be unique, with margin Δ_J = min_θ≠θ_* (J(θ)-J(θ_*))>0. If a held-out estimate widehat J satisfies sup_θ∈ T |widehat J(θ)-J(θ)| ≤ε, then every empirical minimizer widehatθ obeys J(widehatθ)-J(θ_*) ≤2ε. If 2ε<Δ_J, then widehatθ=θ_*.
Exact mathematical passage
\Delta_J = \min_{\theta\neq\theta_*} \bigl(J(\theta)-J(\theta_*)\bigr)>0.
\mathrm{model}Use in source · 1 passage
Search aliases: model mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 378
In practice, the reference margin is reduced by three distinct uncertainty budgets: B_q^total = B_q^model +B_q^spec +B_q^sample. The first covers variation across observationally compatible realizations. The second covers variation across admissible specifications. The third covers finite-sample estimation. The sufficient condition widehat m_q(W;ς_0) > B_q^total (q∈ J_*) will reappear below in identified-set and confidence-envelope form. Keeping the budgets separate prevents an apparently narrow…
Exact mathematical passage
\boxed{ B_q^{\mathrm{total}} = B_q^{\mathrm{model}} +B_q^{\mathrm{spec}} +B_q^{\mathrm{sample}}. }
\operatorname{MoralPatient}Use in source · 1 passage
Search aliases: MoralPatient operatorname
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1134
The following implications are not licensed: Agent_Θ_A(Workspace) centernotLongrightarrow PhenomenallyConscious(Workspace), SelfMaintaining(Workspace) centernotLongrightarrow SelfAware(Workspace), GoalPersistent(Workspace) centernotLongrightarrow MoralPatient(Workspace). A thermostat-like controller can maintain a variable without representing itself. A sophisticated planner can evaluate counterfactual actions without phenomenal experience. Conversely, failure to pass this engineering certificat…
Exact mathematical passage
\operatorname{GoalPersistent}(\Workspace) \centernot\Longrightarrow \operatorname{MoralPatient}(\Workspace).
nUse in source · 17 passages
Search aliases: n
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
\mathcal N'Use in source · 1 passage
Search aliases: N' mathcal
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
N_{10}Use in source · 1 passage
Search aliases: N_10
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{11}Use in source · 1 passage
Search aliases: N_11
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{12}Use in source · 1 passage
Search aliases: N_12
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{13}Use in source · 1 passage
Search aliases: N_13
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{14}Use in source · 1 passage
Search aliases: N_14
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{15}Use in source · 1 passage
Search aliases: N_15
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{16}Use in source · 1 passage
Search aliases: N_16
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{17}Use in source · 1 passage
Search aliases: N_17
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{18}Use in source · 1 passage
Search aliases: N_18
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{19}Use in source · 1 passage
Search aliases: N_19
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_2Use in source · 1 passage
Search aliases: N_2
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{20}Use in source · 1 passage
Search aliases: N_20
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{21}Use in source · 1 passage
Search aliases: N_21
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{22}Use in source · 1 passage
Search aliases: N_22
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{23}Use in source · 1 passage
Search aliases: N_23
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{24}Use in source · 1 passage
Search aliases: N_24
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{25}Use in source · 2 passages
Search aliases: N_25
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 527
Carrier-relative relationality becomes identifiable only when the experiment can test the claimed causal separation. Examples include independently interrupting the candidate carriers, exposing the hidden memory, randomizing a shared controller, or measuring whether one physical mechanism reconstructs the complete state before the displayed split. The decomposition controls N_25--N_27 are therefore identifiability interventions, not merely optional robustness checks.
Exact mathematical passage
N_{25}
N_{26}Use in source · 1 passage
Search aliases: N_26
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{27}Use in source · 2 passages
Search aliases: N_27
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 527
Carrier-relative relationality becomes identifiable only when the experiment can test the claimed causal separation. Examples include independently interrupting the candidate carriers, exposing the hidden memory, randomizing a shared controller, or measuring whether one physical mechanism reconstructs the complete state before the displayed split. The decomposition controls N_25--N_27 are therefore identifiability interventions, not merely optional robustness checks.
Exact mathematical passage
N_{27}
N_{28}Use in source · 2 passages
Search aliases: N_28
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{29}Use in source · 2 passages
Search aliases: N_29
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1031
The empirical null and audit panel is extended by: N_29 · =post hoc target-selection audit, N_30 · =horizon cherry-picking audit, N_31 · =loss and utility substitution audit, N_32 · =restricted intervention-family audit, N_33 · =threshold and gate-set tuning audit, N_34 · =frozen specification sweep across S. The first five reconstruct or bound the analysis search that preceded the reported claim. The final control reruns the complete frozen certificate across the admissible family. A claim that…
Exact mathematical passage
\begin{aligned} N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen specification sweep across }\mathfrak S. \end{aligned}
N_3Use in source · 1 passage
Search aliases: N_3
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_{30}Use in source · 2 passages
Search aliases: N_30
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1031
The empirical null and audit panel is extended by: N_29 · =post hoc target-selection audit, N_30 · =horizon cherry-picking audit, N_31 · =loss and utility substitution audit, N_32 · =restricted intervention-family audit, N_33 · =threshold and gate-set tuning audit, N_34 · =frozen specification sweep across S. The first five reconstruct or bound the analysis search that preceded the reported claim. The final control reruns the complete frozen certificate across the admissible family. A claim that…
Exact mathematical passage
\begin{aligned} N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen specification sweep across }\mathfrak S. \end{aligned}
N_{31}Use in source · 2 passages
Search aliases: N_31
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1031
The empirical null and audit panel is extended by: N_29 · =post hoc target-selection audit, N_30 · =horizon cherry-picking audit, N_31 · =loss and utility substitution audit, N_32 · =restricted intervention-family audit, N_33 · =threshold and gate-set tuning audit, N_34 · =frozen specification sweep across S. The first five reconstruct or bound the analysis search that preceded the reported claim. The final control reruns the complete frozen certificate across the admissible family. A claim that…
Exact mathematical passage
\begin{aligned} N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen specification sweep across }\mathfrak S. \end{aligned}
N_{32}Use in source · 2 passages
Search aliases: N_32
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1031
The empirical null and audit panel is extended by: N_29 · =post hoc target-selection audit, N_30 · =horizon cherry-picking audit, N_31 · =loss and utility substitution audit, N_32 · =restricted intervention-family audit, N_33 · =threshold and gate-set tuning audit, N_34 · =frozen specification sweep across S. The first five reconstruct or bound the analysis search that preceded the reported claim. The final control reruns the complete frozen certificate across the admissible family. A claim that…
Exact mathematical passage
\begin{aligned} N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen specification sweep across }\mathfrak S. \end{aligned}
N_{33}Use in source · 2 passages
Search aliases: N_33
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1031
The empirical null and audit panel is extended by: N_29 · =post hoc target-selection audit, N_30 · =horizon cherry-picking audit, N_31 · =loss and utility substitution audit, N_32 · =restricted intervention-family audit, N_33 · =threshold and gate-set tuning audit, N_34 · =frozen specification sweep across S. The first five reconstruct or bound the analysis search that preceded the reported claim. The final control reruns the complete frozen certificate across the admissible family. A claim that…
Exact mathematical passage
\begin{aligned} N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen specification sweep across }\mathfrak S. \end{aligned}
N_4Use in source · 1 passage
Search aliases: N_4
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_5Use in source · 1 passage
Search aliases: N_5
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_6Use in source · 1 passage
Search aliases: N_6
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_7Use in source · 1 passage
Search aliases: N_7
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_8Use in source · 1 passage
Search aliases: N_8
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
N_9Use in source · 1 passage
Search aliases: N_9
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 275
The core null panel is: N_1 · =shuffled transfer maps with validated local matching, N_2 · =shuffled cross-node temporal correspondence, N_3 · =matched-capacity local memory, N_4 · =matched-size irrelevant artifact, N_5 · =participant ablation, N_6 · =artifact ablation, N_7 · =workspace implementation intervention, N_8 · =matched off-workspace intervention, N_9 · =representation replacement, N_10 · =context reset and reconstruction, N_11 · =matched formation-history shuffle, N_12 · =cross-scaffo…
Exact mathematical passage
\begin{aligned} N_1&=\text{shuffled transfer maps with validated local matching},\\ N_2&=\text{shuffled cross-node temporal correspondence},\\ N_3&=\text{matched-capacity local memory},\\ N_4&=\text{matched-size irrelevant artifact},\\ N_5&=\text{participant ablation},\\ N_6&=\text{artifact ablation},\\ N_7&=\text{workspace implementation intervention},\\ N_8&=\text{matched off-workspace intervention},\\ N_9&=\text{representation replacement},\\ N_{10}&=\text{context reset and reconstruction},\\ N_{11}&=\text{matched formation-history shuffle},\\ N_{12}&=\text{cross-scaffold re-encoding and retraining},\\ N_{13}&=\text{boundary-label and certification leakage audit},\\ N_{14}&=\text{empty, full, singleton, and centralized boundary nulls},\\ N_{15}&=\text{held-out transfer and membership re-estimation},\\ N_{16}&=\text{boundary damage, use, and repair intervention},\\ N_{17}&=\text{goal-code permutation with cues and actions matched},\\ N_{18}&=\text{persistent external-cue rewrite with internal retention cut},\\ N_{19}&=\text{counterfactual-value label permutation},\\ N_{20}&=\text{critic or value-channel ablation},\\ N_{21}&=\text{open-loop action replay under held-out perturbation},\\ N_{22}&=\text{monitor-blind cost-matched random repair},\\ N_{23}&=\text{off-workspace repair with matched intervention norm},\\ N_{24}&=\text{identity-breaking reconstruction with matched task score},\\ N_{25}&=\text{merge control for components sharing an uninterruptible controller},\\ N_{26}&=\text{secret-sharing split of a known centralized controller},\\ N_{27}&=\text{hidden shared-memory and common-cue exposure test},\\ N_{28}&=\text{frozen certificate sweep across the admissible decomposition family},\\ N_{29}&=\text{post hoc target-selection audit},\\ N_{30}&=\text{horizon cherry-picking audit},\\ N_{31}&=\text{loss and utility substitution audit},\\ N_{32}&=\text{restricted intervention-family audit},\\ N_{33}&=\text{threshold and gate-set tuning audit},\\ N_{34}&=\text{frozen certificate sweep across the admissible specification family}. \end{aligned}
n_CUse in source · 2 passages
Search aliases: n_C
Use in source · 04-approximate-workspaces.tex, line 133
[Finite rank computation] Let n_C=∑_i∈ Vdim C_i. Then dimΓ(H)=n_C-rank(D_H). Hence the exact workspace dimension can be obtained by a single rank or singular-value computation, even when holonomy is unavailable because some transfers are noninvertible.
Exact mathematical passage
n_C=\sum_{i\in V}\dim C_i.
N_{\mathrm{form}}Use in source · 1 passage
Search aliases: N_form mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 356
For thresholds Θ_form, define Form_Θ_form(W)=1 only when all applicable gates pass: · e_q^MDL≥ τ_q^MDL, · · e_q^causal≥ τ_q^causal, · δ_q^scaf≤ε_q^scaf, · · δ^leak≤ε_leak, · SRW_Θ(W)=1, · · Pass(N_form)=1. The final workspace gate is included because endogenous discovery of an unstable or causally irrelevant pattern is not endogenous workspace formation.
Exact mathematical passage
\begin{aligned} & e_q^{\mathrm{MDL}}\geq \tau_q^{\mathrm{MDL}}, && e_q^{\mathrm{causal}}\geq \tau_q^{\mathrm{causal}},\\ & \delta_q^{\mathrm{scaf}}\leq\varepsilon_q^{\mathrm{scaf}}, && \delta^{\mathrm{leak}}\leq\varepsilon_{\mathrm{leak}},\\ & \operatorname{SRW}_{\Theta}(W)=1, && \operatorname{Pass}(N_{\mathrm{form}})=1. \end{aligned}
N_jUse in source · 1 passage
Search aliases: N_j
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 427
Null panel · Applicable N_j, preservation targets, and fit budgets.
Exact mathematical passage
N_j
\mathcal N_{\mathrm{marg}}Use in source · 1 passage
Search aliases: N_marg mathcal mathrm
Use in source · 07-relational-irreducibility.tex, line 267
Let P be the intact law of (Y_t^+, H_t^1,…, H_t^n). Define the local-marginal null class N_marg(P) = { Q: Q_ H_t^i=P_ H_t^i for every i }, and the stronger local-predictive-matched class N_pred(P) = { Q: Q_(Y_t^+, H_t^i) = P_(Y_t^+, H_t^i) for every i }. Because H_t^i can include the complete local trajectory, the latter class can preserve all single-component temporal and predictive behavior while altering cross-component organization.
Exact mathematical passage
\mathcal N_{\mathrm{marg}}(P) = \left\{ Q: Q_{\mathbf H_t^i}=P_{\mathbf H_t^i} \text{ for every }i \right\},
\mathrm{node}Use in source · 4 passages
Search aliases: node mathrm
Use in source · 08-causal-efficacy-and-reentry.tex, line 259
intact law at a fixed decision time, and let W_t=π_t( H_t) be a structurally supported candidate. Let Q⊆ N_pred(P) be a nonempty, predeclared panel of validated relation-breaking nulls. Assume: item exact structural--operational alignment, I_P(Y_t^+; H_tmid W_t)=0; item a positive node-level information gap, δ_node = min_i∈ V I_P(Y_t^+; H_tmid H_t^i) >0; item a positive robust matched-null gap, δ_null = min_Q∈ Q [ H_Q(Y_t^+mid H_t) - H_P(Y_t^+mid H_t) ] >0; item a feasible intervention design wi…
Exact mathematical passage
\delta_{\mathrm{node}} = \min_{i\in V} I_P(Y_t^+;\mathbf H_t\mid\mathbf H_t^i) >0;
\notUse in source · 2 passages
Search aliases: not
Use in source · 01-foundational-thesis.tex, line 268
The workspace is not determined by any single local state: ∀ i∈ V, ∃ R, R' such that pr_i( R)=pr_i( R') but Workspace( R)not≃Workspace( R'). The same person, model, or document can therefore participate in distinct workspaces because the relevant transfer graph, history, and operation structure differ.
Exact mathematical passage
\Workspace(\mathfrak R)\not\simeq\Workspace(\mathfrak R').
\mathrm{null}Use in source · 3 passages
Search aliases: null mathrm
Use in source · 08-causal-efficacy-and-reentry.tex, line 267
bseteq N_pred(P) be a nonempty, predeclared panel of validated relation-breaking nulls. Assume: item exact structural--operational alignment, I_P(Y_t^+; H_tmid W_t)=0; item a positive node-level information gap, δ_node = min_i∈ V I_P(Y_t^+; H_tmid H_t^i) >0; item a positive robust matched-null gap, δ_null = min_Q∈ Q [ H_Q(Y_t^+mid H_t) - H_P(Y_t^+mid H_t) ] >0; item a feasible intervention design with η_causal^ν>0; item positive matched causal specificity at some declared scale r, Δ_specific(r)>…
Exact mathematical passage
\delta_{\mathrm{null}} = \min_{Q\in\mathcal Q} \left[ H_Q(Y_t^+\mid\mathbf H_t) - H_P(Y_t^+\mid\mathbf H_t) \right] >0;
\mathsf{null\_panels}Use in source · 1 passage
Search aliases: null_panels mathsf
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1051
The machine-readable record should include: SpecificationRecord ={ · reference, family, equivalence_classes, metric, · targets, losses, horizons, interventions, · null_panels, thresholds, selection_history, · identified_sets, uniform_bounds, gate_envelopes }. Every omitted family member requires a reason. Every changed specification requires a data-split label and time stamp. Every gate requires pointwise and family-wide status.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{SpecificationRecord} =\{& \mathsf{reference}, \mathsf{family}, \mathsf{equivalence\_classes}, \mathsf{metric},\\ &\mathsf{targets}, \mathsf{losses}, \mathsf{horizons}, \mathsf{interventions},\\ &\mathsf{null\_panels}, \mathsf{thresholds}, \mathsf{selection\_history},\\ &\mathsf{identified\_sets}, \mathsf{uniform\_bounds}, \mathsf{gate\_envelopes} \}. \end{aligned} }
\mathsf{nulls}Use in source · 1 passage
Search aliases: nulls mathsf
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 660
The machine-readable record should contain at least the following top-level objects: ResultRecord ={ · claim, specification, specification_family, decomposition, data_splits, formation, · workspace_extractor, goals, actions, interventions, · nulls, gates, identified_sets, specification_envelopes, uncertainty, failures, artifacts }. Each gate object records its symbol, estimator, direction, threshold, point estimate, interval, split, seed set, status, and artifact reference. Each intervention and…
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{ResultRecord} =\{& \mathsf{claim}, \mathsf{specification}, \mathsf{specification\_family}, \mathsf{decomposition}, \mathsf{data\_splits}, \mathsf{formation},\\ &\mathsf{workspace\_extractor}, \mathsf{goals}, \mathsf{actions}, \mathsf{interventions},\\ &\mathsf{nulls}, \mathsf{gates}, \mathsf{identified\_sets}, \mathsf{specification\_envelopes}, \mathsf{uncertainty}, \mathsf{failures}, \mathsf{artifacts} \}. \end{aligned} }
\mathsf OUse in source · 6 passages
Search aliases: O mathsf
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 83
For each case we report the vector Card( K) = ( S, O, R, P, F, A, D, X, C ), where: ll S · = structural core and spectral coherence,
Exact mathematical passage
\boxed{ \mathsf{Card}(\mathfrak K) = \left( \mathsf S, \mathsf O, \mathsf R, \mathsf P, \mathsf F, \mathsf A, \mathsf D, \mathsf X, \mathsf C \right), }
oUse in source · 74 passages
Search aliases: o
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
O_iUse in source · 3 passages
Search aliases: O_i
Use in source · 11-reconstruction-and-resilience.tex, line 21
Let C_* be a finite-dimensional abstract core. The exact static theory provides a complete local chart overline E_i = ev_i∘Ψ:C_*⟶ C_i, where Ψ:C_*→Γ(H) is the root-to-section isomorphism. A participant or artifact need not expose that complete chart. Let O_i:C_i⟶ Y_i be the declared observation or access map and define the accessible encoding E_i=O_ioverline E_i:C_*⟶ Y_i. For notational economy, the direct sums below use the accessible spaces Y_i. Thus injectivity of a full structural chart does…
Exact mathematical passage
O_i:C_i\longrightarrow\mathsf Y_i
\mathcal O_{\Workspace}^{\mathrm{eff}}Use in source · 2 passages
Search aliases: O_Workspace^eff mathcal Workspace mathrm
Use in source · 03-exact-shared-cores.tex, line 526
Some natural operators may vanish on every global section while acting nontrivially on locally available but globally inconsistent directions. Define the annihilator Ann(Γ(H)) = {A∈ O_Workspace: π_Workspace(A)=0}. The effective workspace algebra is O_Workspace^eff = O_Workspace/Ann(Γ(H)). Its action on Γ(H) is faithful by construction.
Exact mathematical passage
\boxed{ \mathcal O_{\Workspace}^{\mathrm{eff}} = \mathcal O_{\Workspace}/\operatorname{Ann}(\Gamma(H)). }
\mathrm{object}Use in source · 1 passage
Search aliases: object mathrm
Use in source · 23-relation-to-prior-work.tex, line 101
The analysis does not make one global novelty claim. It uses a priority profile p(C) = ( p_concept, p_object, p_theorem, p_certificate, p_experiment ). For example, the philosophical concept of distributed cognition may be standard while a specific mathematical object is adapted, a theorem is a specialization of known spectral theory, the certificate is a synthesis, and the empirical claim is unresolved. This prevents originality in one coordinate from being used to imply originality in every co…
Exact mathematical passage
\boxed{ \mathbf p(C) = \left( p_{\mathrm{concept}}, p_{\mathrm{object}}, p_{\mathrm{theorem}}, p_{\mathrm{certificate}}, p_{\mathrm{experiment}} \right). }
\mathrm{obs}Use in source · 2 passages
Search aliases: obs mathrm
Use in source · 06-dynamic-workspace-theory.tex, line 425
Define the observational alignment defect by δ_align^obs(W_t) = I_ P(Y_t^+; H_tmid W_t). For a countable intervention family with declared weights q_ι>0, ∑_ι q_ι=1, define δ_align^ I(W_t) = ∑_ι∈ I q_ι I_ P^ι (Y_t^+; H_tmid W_t). For bounded decision losses, Proposition~[source reference] applies under each intervention and gives the weighted bound ∑_ιq_ι [ Risk_ℓ^ι(W_t) - Risk_ℓ^ι( H_t) ] ≤ sqrtfrac δ_align^ I(W_t)2.
Exact mathematical passage
\boxed{ \delta_{\mathrm{align}}^{\mathrm{obs}}(W_t) = I_{\mathbb P}(Y_t^+;\mathbf H_t\mid W_t). }
\mathrm{op}Use in source · 10 passages
Search aliases: op mathrm
Use in source · 12-identity-through-time-and-replacement.tex, line 337
For an admissible correspondence J, define the operation defect on a declared unit ball A_1 by δ_op( J) = sup_a∈ A_1 A_ W''β-β A_ W . The primary certification object is the identity profile d_id( J) = ( q_str, δ_op( J), δ_causal(β), δ_rec(β); μ^keep ). The first four coordinates must remain below declared tolerances, while the non-collapse margin μ^keep must remain above a declared lower bound. This vector, rather than a weighted average, determines whether a specific identity claim passes.
Exact mathematical passage
\delta_{\mathrm{op}}(\mathfrak J) = \sup_{a\in\mathcal A_1} \|A_{\mathcal W'}'\beta-\beta A_{\mathcal W}\|.
\mathrm{opt}Use in source · 11 passages
Search aliases: opt mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 518
[Approximate counterfactual policy selection] Let A be a finite feasible action set. Let Q: A→ R be the true interventional value and let widehat Q satisfy sup_a∈ A|widehat Q(a)-Q(a)|≤ε_Q. Suppose a policy widehatπ is δ_opt-optimal for widehat Q: max_π E_a∼π[widehat Q(a)] - E_a∼widehatπ[widehat Q(a)] ≤ δ_opt. Then, for every true-value-optimal policy π^*, E_a∼π^*[Q(a)] - E_a∼widehatπ[Q(a)] ≤ 2ε_Q+δ_opt. For a deterministic greedy action widehat a∈argmax_awidehat Q(a), Q(a^*)-Q(widehat a) ≤2ε_Q. …
Exact mathematical passage
\delta_{\mathrm{opt}}
\OutUse in source · 2 passages
Search aliases: Out
Use in source · 15-boundary-formation-and-stability.tex, line 63
For S∈ S, define Ret_τ(S) = I ( X_S(t+τ);X_S(t) mid X_bar S(t),E_t ), Dep_τ(S) = I ( X_S(t+τ);X_bar S(t) mid X_S(t),E_t ), Out_τ(S) = I ( X_bar S(t+τ);X_S(t) mid X_bar S(t),E_t ). These quantities are observational. They can be nonzero because of common causes, selection, or feedback paths and therefore cannot alone establish a causal boundary.
Exact mathematical passage
\Out_\tau(S) = I\!\left( X_{\bar S}(t+\tau);X_S(t) \mid X_{\bar S}(t),E_t \right).
\mathrm{out}Use in source · 1 passage
Search aliases: out mathrm
Use in source · 02-static-core-transfer-theory.tex, line 183
Core leakage, residual contamination, and total transfer defect are measured by λ_e^out= V_e , λ_e^in= U_e , δ_e^tr = U_e + V_e . These quantities depend on the chosen norms and projectors. Their empirical meaning must therefore be tied to a declared intervention and prediction protocol.
Exact mathematical passage
\lambda_e^{\mathrm{out}}=\|V_e\|, \qquad \lambda_e^{\mathrm{in}}=\|U_e\|,
\Out_\tauUse in source · 2 passages
Search aliases: Out_τ Out tau
Use in source · 15-boundary-formation-and-stability.tex, line 63
For S∈ S, define Ret_τ(S) = I ( X_S(t+τ);X_S(t) mid X_bar S(t),E_t ), Dep_τ(S) = I ( X_S(t+τ);X_bar S(t) mid X_S(t),E_t ), Out_τ(S) = I ( X_bar S(t+τ);X_S(t) mid X_bar S(t),E_t ). These quantities are observational. They can be nonzero because of common causes, selection, or feedback paths and therefore cannot alone establish a causal boundary.
Exact mathematical passage
\Out_\tau(S) = I\!\left( X_{\bar S}(t+\tau);X_S(t) \mid X_{\bar S}(t),E_t \right).
\mathrm{ov}Use in source · 4 passages
Search aliases: ov mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 182
A family w=(w_α)_α is exactly compatible when δ^0w=0. Its direct mismatch is m_ U(w)=δ^0w. After choosing inner products and positive overlap weights, the mismatch energy is E_ov(w) = δ^0w ^2 = ∑_α<β ν_αβ r_αβ^βw_β -r_αβ^αw_α ^2. This is the appropriate obstruction when the full local states are already given. Such a family glues exactly if and only if its mismatch vector itself vanishes. No cohomological quotient is needed for that direct question.
Exact mathematical passage
\boxed{ \mathcal E_{\mathrm{ov}}(w) = \|\delta^0w\|^2 = \sum_{\alpha<\beta} \nu_{\alpha\beta} \left\| r_{\alpha\beta}^{\beta}w_\beta -r_{\alpha\beta}^{\alpha}w_\alpha \right\|^2. }
\overline CUse in source · 1 passage
Search aliases: overline C overline
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 785
A practical hierarchy rarely transmits each complete local workspace. Let Q^p:check C^p( U;mathscr W)→overline C^p be compression maps into smaller local and overlap representations. Suppose there is a compressed coboundary overlineδ^p such that Q^p+1δ^p = overlineδ^p Q^p. The maps Q^bullet then form a cochain map.
Exact mathematical passage
Q^p:\check C^p(\mathcal U;\mathscr W)\to\overline C^p
\overline C^pUse in source · 1 passage
Search aliases: overline C^p overline
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 785
A practical hierarchy rarely transmits each complete local workspace. Let Q^p:check C^p( U;mathscr W)→overline C^p be compression maps into smaller local and overlap representations. Suppose there is a compressed coboundary overlineδ^p such that Q^p+1δ^p = overlineδ^p Q^p. The maps Q^bullet then form a cochain map.
Exact mathematical passage
Q^p:\check C^p(\mathcal U;\mathscr W)\to\overline C^p
\overline dUse in source · 12 passages
Search aliases: overline d overline
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 891
egintheorem[Causal repair stabilizes maintenance deficit] Let e_t≥0 be the maintenance deficit. Suppose the matched no-repair trajectory satisfies e_t+1^(0) ≤ α e_t+d_t, where d_t≥0 is exogenous damage. Suppose the implemented repair policy has the causal one-step effect e_t+1^(0)-e_t+1 ≥ κ e_t-ϵ_t. Assume 0≤β:=α-κ<1, 0≤ d_t≤overline d, 0≤ϵ_t≤overlineϵ. Then e_t ≤ β^te_0 + frac(overline d+overlineϵ)(1-β^t)1-β, and therefore limsup_t→∞e_t ≤ fracoverline d+overlineϵ1-β. If the admissible deficit i…
Exact mathematical passage
0\leq\beta:=\alpha-\kappa<1, \qquad 0\leq d_t\leq\overline d, \qquad 0\leq\epsilon_t\leq\overline\epsilon.
\overline EUse in source · 3 passages
Search aliases: overline E overline
Use in source · 11-reconstruction-and-resilience.tex, line 14
Let C_* be a finite-dimensional abstract core. The exact static theory provides a complete local chart overline E_i = ev_i∘Ψ:C_*⟶ C_i, where Ψ:C_*→Γ(H) is the root-to-section isomorphism. A participant or artifact need not expose that complete chart. Let O_i:C_i⟶ Y_i be the declared observation or access map and define the accessible encoding E_i=O_ioverline E_i:C_*⟶ Y_i. For notational economy, the direct sums below use the accessible spaces Y_i. Thus injectivity of a full structural chart does…
Exact mathematical passage
\overline E_i = \ev_i\circ\Psi:C_*\longrightarrow C_i,
\overline E_iUse in source · 3 passages
Search aliases: overline E_i overline
Use in source · 11-reconstruction-and-resilience.tex, line 14
Let C_* be a finite-dimensional abstract core. The exact static theory provides a complete local chart overline E_i = ev_i∘Ψ:C_*⟶ C_i, where Ψ:C_*→Γ(H) is the root-to-section isomorphism. A participant or artifact need not expose that complete chart. Let O_i:C_i⟶ Y_i be the declared observation or access map and define the accessible encoding E_i=O_ioverline E_i:C_*⟶ Y_i. For notational economy, the direct sums below use the accessible spaces Y_i. Thus injectivity of a full structural chart does…
Exact mathematical passage
\overline E_i = \ev_i\circ\Psi:C_*\longrightarrow C_i,
\overline mUse in source · 6 passages
Search aliases: overline m overline
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 432
Let m_q(W; D) be the signed margin of gate q, oriented so that m_q(W; D)>0 means that the gate passes after its uncertainty correction. Define the decomposition envelope underline m_q = inf_ D∈ Dm_q(W; D), overline m_q = sup_ D∈ Dm_q(W; D), and its sensitivity width Δ_q^dec = overline m_q-underline m_q.
Exact mathematical passage
\underline m_q = \inf_{\mathcal D\in\mathfrak D}m_q(W;\mathcal D), \qquad \overline m_q = \sup_{\mathcal D\in\mathfrak D}m_q(W;\mathcal D),
\overline m_qUse in source · 3 passages
Search aliases: overline m_q overline
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 432
Let m_q(W; D) be the signed margin of gate q, oriented so that m_q(W; D)>0 means that the gate passes after its uncertainty correction. Define the decomposition envelope underline m_q = inf_ D∈ Dm_q(W; D), overline m_q = sup_ D∈ Dm_q(W; D), and its sensitivity width Δ_q^dec = overline m_q-underline m_q.
Exact mathematical passage
\underline m_q = \inf_{\mathcal D\in\mathfrak D}m_q(W;\mathcal D), \qquad \overline m_q = \sup_{\mathcal D\in\mathfrak D}m_q(W;\mathcal D),
\overline m_q^{\mathfrak S}Use in source · 2 passages
Search aliases: overline m_q^ S overline mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 202
For each gate q∈ J_*, define the specification envelope underline m_q^ S(W) = inf_ς∈ Sm_q(W;ς), overline m_q^ S(W) = sup_ς∈ Sm_q(W;ς). Its sensitivity width is Δ_q^spec(W) = overline m_q^ S(W) - underline m_q^ S(W). The robust certificate margin is r_ S(W) = inf_ς∈ S min_q∈ J_*m_q(W;ς). Then Cert_ S(W)=1 Longleftrightarrow r_ S(W)>0.
Exact mathematical passage
\boxed{ \underline m_q^{\mathfrak S}(W) = \inf_{\varsigma\in\mathfrak S}m_q(W;\varsigma), \qquad \overline m_q^{\mathfrak S}(W) = \sup_{\varsigma\in\mathfrak S}m_q(W;\varsigma). }
\overline m_q^{\mathrm{ID}}Use in source · 1 passage
Search aliases: overline m_q^ID overline mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 584
The sharp lower and upper identified margins are underline m_q^ID(ς) = inf M_q^ID(ς), overline m_q^ID(ς) = sup M_q^ID(ς). A gate is sign-identified as passing if its lower bound is positive. It is sign-identified as failing if its upper bound is nonpositive. If the interval crosses zero, the available design does not determine that gate's outcome.
Exact mathematical passage
\underline m_q^{\mathrm{ID}}(\varsigma) = \inf\mathcal M_q^{\mathrm{ID}}(\varsigma), \qquad \overline m_q^{\mathrm{ID}}(\varsigma) = \sup\mathcal M_q^{\mathrm{ID}}(\varsigma).
\overline rUse in source · 2 passages
Search aliases: overline r overline
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 627
For robustness across specifications, define the realization-level robust margin r_ S( R) = inf_ς∈ S min_q∈ J_* m_q(W_ R;ς) and its identified range underline r_ID, S = inf_ R∈ R_ID r_ S( R), overline r_ID, S = sup_ R∈ R_ID r_ S( R).
Exact mathematical passage
\underline r_{\mathrm{ID},\mathfrak S} = \inf_{\mathfrak R\in\mathfrak R_{\mathrm{ID}}} r_{\mathfrak S}(\mathfrak R), \qquad \overline r_{\mathrm{ID},\mathfrak S} = \sup_{\mathfrak R\in\mathfrak R_{\mathrm{ID}}} r_{\mathfrak S}(\mathfrak R).
\overline r_{\mathrm{ID},\mathfrak S}Use in source · 2 passages
Search aliases: overline r_ID, S overline mathrm mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 627
For robustness across specifications, define the realization-level robust margin r_ S( R) = inf_ς∈ S min_q∈ J_* m_q(W_ R;ς) and its identified range underline r_ID, S = inf_ R∈ R_ID r_ S( R), overline r_ID, S = sup_ R∈ R_ID r_ S( R).
Exact mathematical passage
\underline r_{\mathrm{ID},\mathfrak S} = \inf_{\mathfrak R\in\mathfrak R_{\mathrm{ID}}} r_{\mathfrak S}(\mathfrak R), \qquad \overline r_{\mathrm{ID},\mathfrak S} = \sup_{\mathfrak R\in\mathfrak R_{\mathrm{ID}}} r_{\mathfrak S}(\mathfrak R).
\overline\delta^pUse in source · 2 passages
Search aliases: overlineδ^p overline delta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 789
A practical hierarchy rarely transmits each complete local workspace. Let Q^p:check C^p( U;mathscr W)→overline C^p be compression maps into smaller local and overlap representations. Suppose there is a compressed coboundary overlineδ^p such that Q^p+1δ^p = overlineδ^p Q^p. The maps Q^bullet then form a cochain map.
Exact mathematical passage
\overline\delta^p
\overline\delta_{\mathrm{coh}}Use in source · 1 passage
Search aliases: overlineδ_coh overline delta mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
\overline\epsilonUse in source · 12 passages
Search aliases: overlineϵ overline epsilon
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 891
egintheorem[Causal repair stabilizes maintenance deficit] Let e_t≥0 be the maintenance deficit. Suppose the matched no-repair trajectory satisfies e_t+1^(0) ≤ α e_t+d_t, where d_t≥0 is exogenous damage. Suppose the implemented repair policy has the causal one-step effect e_t+1^(0)-e_t+1 ≥ κ e_t-ϵ_t. Assume 0≤β:=α-κ<1, 0≤ d_t≤overline d, 0≤ϵ_t≤overlineϵ. Then e_t ≤ β^te_0 + frac(overline d+overlineϵ)(1-β^t)1-β, and therefore limsup_t→∞e_t ≤ fracoverline d+overlineϵ1-β. If the admissible deficit i…
Exact mathematical passage
0\leq\beta:=\alpha-\kappa<1, \qquad 0\leq d_t\leq\overline d, \qquad 0\leq\epsilon_t\leq\overline\epsilon.
\oversetUse in source · 1 passage
Search aliases: overset
Use in source · 07-relational-irreducibility.tex, line 377
[XOR witness pair] Under the intact law P, let X_1,X_2oversetiid∼Bernoulli(1/2), Y=X_1⊕ X_2. Then each (X_i,Y) pair is independent and uniform, so H_P(Ymid X_i)=1 bit, H_P(Ymid X_1,X_2)=0. Let Q make X_1,X_2,Y mutually independent fair bits. Then Q_(X_i,Y)=P_(X_i,Y) (i=1,2), but H_Q(Ymid X_1,X_2)=1 bit. Therefore Δ_joint^log=1 bit, k_0=2, Δ_tr(Q)=1 bit. This proves predictive relational structure relative to the declared variables. It does not, by itself, prove that any workspace variable is cau…
Exact mathematical passage
X_1,X_2\overset{\mathrm{iid}}{\sim}\operatorname{Bernoulli}(1/2), \qquad Y=X_1\oplus X_2.
\mathbf pUse in source · 1 passage
Search aliases: p mathbf
Use in source · 23-relation-to-prior-work.tex, line 101
The analysis does not make one global novelty claim. It uses a priority profile p(C) = ( p_concept, p_object, p_theorem, p_certificate, p_experiment ). For example, the philosophical concept of distributed cognition may be standard while a specific mathematical object is adapted, a theorem is a specialization of known spectral theory, the certificate is a synthesis, and the empirical claim is unresolved. This prevents originality in one coordinate from being used to imply originality in every co…
Exact mathematical passage
\boxed{ \mathbf p(C) = \left( p_{\mathrm{concept}}, p_{\mathrm{object}}, p_{\mathrm{theorem}}, p_{\mathrm{certificate}}, p_{\mathrm{experiment}} \right). }
\mathsf PUse in source · 6 passages
Search aliases: P mathsf
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 83
For each case we report the vector Card( K) = ( S, O, R, P, F, A, D, X, C ), where: ll S · = structural core and spectral coherence,
Exact mathematical passage
\boxed{ \mathsf{Card}(\mathfrak K) = \left( \mathsf S, \mathsf O, \mathsf R, \mathsf P, \mathsf F, \mathsf A, \mathsf D, \mathsf X, \mathsf C \right), }
P'Use in source · 19 passages
Search aliases: P'
Use in source · 12-identity-through-time-and-replacement.tex, line 127
Let P and P' be rank-d workspace projectors selected from L and L', and let g>0 be the separating source gap.
Exact mathematical passage
P'
\mathbb P^{\jmath}Use in source · 1 passage
Search aliases: P^jmath mathbb jmath
Use in source · 08-causal-efficacy-and-reentry.tex, line 126
Define η_Workspace(r) = E_ι,ι'∼ I_Workspace(r) D ( P^ι(Y_t^+), P^ι'(Y_t^+) ), η_⊥(r) = E_jmath,jmath'∼ I_⊥(r) D ( P^jmath(Y_t^+), P^jmath'(Y_t^+) ), and Δ_specific(r) = η_Workspace(r)-η_⊥(r). A positive value supports causal concentration in the candidate workspace at the declared perturbation scale.
Exact mathematical passage
\eta_{\perp}(r) = \mathbb E_{\jmath,\jmath'\sim\mathcal I_{\perp}(r)} D\!\left( \mathbb P^{\jmath}(Y_t^+), \mathbb P^{\jmath'}(Y_t^+) \right),
\mathbb P^{\jmath'}Use in source · 1 passage
Search aliases: P^jmath' mathbb jmath
Use in source · 08-causal-efficacy-and-reentry.tex, line 126
Define η_Workspace(r) = E_ι,ι'∼ I_Workspace(r) D ( P^ι(Y_t^+), P^ι'(Y_t^+) ), η_⊥(r) = E_jmath,jmath'∼ I_⊥(r) D ( P^jmath(Y_t^+), P^jmath'(Y_t^+) ), and Δ_specific(r) = η_Workspace(r)-η_⊥(r). A positive value supports causal concentration in the candidate workspace at the declared perturbation scale.
Exact mathematical passage
\eta_{\perp}(r) = \mathbb E_{\jmath,\jmath'\sim\mathcal I_{\perp}(r)} D\!\left( \mathbb P^{\jmath}(Y_t^+), \mathbb P^{\jmath'}(Y_t^+) \right),
\mathbb P^{\jmath',\operatorname{do}(W_t\sim\mu)}Use in source · 1 passage
Search aliases: P^jmath',do(W_t∼μ) mathbb jmath operatorname sim mu
Use in source · 08-causal-efficacy-and-reentry.tex, line 175
A stronger mediation test equalizes the workspace state after two distinct channel interventions. Let μ be a common imposed workspace distribution, implemented by a feasible stochastic intervention in the sense of Definition~[source reference]. The notation below is shorthand for that implementation. Define the residual mediation defect δ_med = sup_jmath,jmath' D ( P^jmath,do(W_t∼μ)(Y_t^+), P^jmath',do(W_t∼μ)(Y_t^+) ). A small value means that once the workspace state is equalized, little of the…
Exact mathematical passage
\delta_{\mathrm{med}} = \sup_{\jmath,\jmath'} D\!\left( \mathbb P^{\jmath,\operatorname{do}(W_t\sim\mu)}(Y_t^+), \mathbb P^{\jmath',\operatorname{do}(W_t\sim\mu)}(Y_t^+) \right).
\mathbb P^{\jmath,\operatorname{do}(W_t\sim\mu)}Use in source · 1 passage
Search aliases: P^jmath,do(W_t∼μ) mathbb jmath operatorname sim mu
Use in source · 08-causal-efficacy-and-reentry.tex, line 175
A stronger mediation test equalizes the workspace state after two distinct channel interventions. Let μ be a common imposed workspace distribution, implemented by a feasible stochastic intervention in the sense of Definition~[source reference]. The notation below is shorthand for that implementation. Define the residual mediation defect δ_med = sup_jmath,jmath' D ( P^jmath,do(W_t∼μ)(Y_t^+), P^jmath',do(W_t∼μ)(Y_t^+) ). A small value means that once the workspace state is equalized, little of the…
Exact mathematical passage
\delta_{\mathrm{med}} = \sup_{\jmath,\jmath'} D\!\left( \mathbb P^{\jmath,\operatorname{do}(W_t\sim\mu)}(Y_t^+), \mathbb P^{\jmath',\operatorname{do}(W_t\sim\mu)}(Y_t^+) \right).
\mathbb P^{\jmath_E}Use in source · 1 passage
Search aliases: P^jmath_E mathbb jmath
Use in source · 08-causal-efficacy-and-reentry.tex, line 156
Let jmath_E randomize selected communication edges while preserving their marginal message laws, rates, and timing budget. The causal transfer gap is Δ_tr^do(jmath_E) = Risk_ℓ, P^jmath_E(V) - Risk_ℓ, P(V). Unlike an observational null law, this quantity is anchored to an implemented channel intervention. A positive effect is evidence that the intact alignment of messages, rather than merely their marginal content, contributes to task performance.
Exact mathematical passage
\boxed{ \Delta_{\mathrm{tr}}^{\operatorname{do}}(\jmath_E) = \Risk_{\ell,\mathbb P^{\jmath_E}}(V) - \Risk_{\ell,\mathbb P}(V). }
\mathbb P^\iotaUse in source · 1 passage
Search aliases: P^ι mathbb iota
Use in source · 06-dynamic-workspace-theory.tex, line 434
Define the observational alignment defect by δ_align^obs(W_t) = I_ P(Y_t^+; H_tmid W_t). For a countable intervention family with declared weights q_ι>0, ∑_ι q_ι=1, define δ_align^ I(W_t) = ∑_ι∈ I q_ι I_ P^ι (Y_t^+; H_tmid W_t). For bounded decision losses, Proposition~[source reference] applies under each intervention and gives the weighted bound ∑_ιq_ι [ Risk_ℓ^ι(W_t) - Risk_ℓ^ι( H_t) ] ≤ sqrtfrac δ_align^ I(W_t)2.
Exact mathematical passage
\boxed{ \delta_{\mathrm{align}}^{\mathcal I}(W_t) = \sum_{\iota\in\mathcal I} q_\iota I_{\mathbb P^\iota} (Y_t^+;\mathbf H_t\mid W_t). }
\mathbb P^{\iota}Use in source · 2 passages
Search aliases: P^ι mathbb iota
Use in source · 06-dynamic-workspace-theory.tex, line 320
Observational prediction may merge histories that behave identically under the current policy but respond differently to future interventions. Let I be a finite or countable family of interventions applied only after time t. For each ι∈ I, let K_t^ι(h,·) = P^ι(Y_t^+∈·mid H_t=h) be a regular post-intervention kernel on the common pre-intervention history space. Define Z_t^ I = (K_t^ι( H_t,·))_ι∈ I ∈ P( Y)^ I.
Exact mathematical passage
K_t^{\iota}(h,\cdot) = \mathbb P^{\iota}(Y_t^+\in\cdot\mid\mathbf H_t=h)
\mathbb P^{\iota'}Use in source · 1 passage
Search aliases: P^ι' mathbb iota
Use in source · 08-causal-efficacy-and-reentry.tex, line 117
Define η_Workspace(r) = E_ι,ι'∼ I_Workspace(r) D ( P^ι(Y_t^+), P^ι'(Y_t^+) ), η_⊥(r) = E_jmath,jmath'∼ I_⊥(r) D ( P^jmath(Y_t^+), P^jmath'(Y_t^+) ), and Δ_specific(r) = η_Workspace(r)-η_⊥(r). A positive value supports causal concentration in the candidate workspace at the declared perturbation scale.
Exact mathematical passage
\eta_{\Workspace}(r) = \mathbb E_{\iota,\iota'\sim\mathcal I_{\Workspace}(r)} D\!\left( \mathbb P^{\iota}(Y_t^+), \mathbb P^{\iota'}(Y_t^+) \right),
\mathbb P^{\iota_w}Use in source · 2 passages
Search aliases: P^ι_w mathbb iota
Use in source · 08-causal-efficacy-and-reentry.tex, line 50
Let D be a divergence or metric on probability laws. For a matched background value b, define CE_Workspace(w,w';b) = D ( P^ι_w(Y_t^+∈·mid B_t=b), P^ι_w'(Y_t^+∈·mid B_t=b) ). For a declared comparison design ν over (w,w',b), define η_causal^ν = E_(w,w',b)∼ν [ CE_Workspace(w,w';b) ]. The maximum η_causal^max = sup_w,w',bCE_Workspace(w,w';b) may be useful for discovery, but a design-weighted effect is harder to inflate by selecting a single exceptional pair after inspection.
Exact mathematical passage
\CE_{\Workspace}(w,w';b) = D\!\left( \mathbb P^{\iota_w}(Y_t^+\in\cdot\mid B_t=b), \mathbb P^{\iota_{w'}}(Y_t^+\in\cdot\mid B_t=b) \right).
\mathbb P^{\iota_{w'}}Use in source · 2 passages
Search aliases: P^ι_w' mathbb iota
Use in source · 08-causal-efficacy-and-reentry.tex, line 50
Let D be a divergence or metric on probability laws. For a matched background value b, define CE_Workspace(w,w';b) = D ( P^ι_w(Y_t^+∈·mid B_t=b), P^ι_w'(Y_t^+∈·mid B_t=b) ). For a declared comparison design ν over (w,w',b), define η_causal^ν = E_(w,w',b)∼ν [ CE_Workspace(w,w';b) ]. The maximum η_causal^max = sup_w,w',bCE_Workspace(w,w';b) may be useful for discovery, but a design-weighted effect is harder to inflate by selecting a single exceptional pair after inspection.
Exact mathematical passage
\CE_{\Workspace}(w,w';b) = D\!\left( \mathbb P^{\iota_w}(Y_t^+\in\cdot\mid B_t=b), \mathbb P^{\iota_{w'}}(Y_t^+\in\cdot\mid B_t=b) \right).
P_{\mathcal H^1_{\mathcal U}}Use in source · 2 passages
Search aliases: P_ H^1_ U mathcal mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 260
[Harmonic gluing obstruction] For every cocycle b∈kerδ^1, there is an orthogonal decomposition b=δ^0q^†+h, h∈ H^1_ U, where q^†=(δ^0)^† b is a least-squares potential. Moreover, inf_q b-δ^0q = h = P_ H^1_ Ub . Hence b is exactly integrable if and only if its harmonic component vanishes.
Exact mathematical passage
\boxed{ \inf_q\|b-\delta^0q\| = \|h\| = \|P_{\mathcal H^1_{\mathcal U}}b\|. }
P_{\mathbf H_t^i}Use in source · 1 passage
Search aliases: P_ H_t^i mathbf
Use in source · 07-relational-irreducibility.tex, line 267
Let P be the intact law of (Y_t^+, H_t^1,…, H_t^n). Define the local-marginal null class N_marg(P) = { Q: Q_ H_t^i=P_ H_t^i for every i }, and the stronger local-predictive-matched class N_pred(P) = { Q: Q_(Y_t^+, H_t^i) = P_(Y_t^+, H_t^i) for every i }. Because H_t^i can include the complete local trajectory, the latter class can preserve all single-component temporal and predictive behavior while altering cross-component organization.
Exact mathematical passage
\mathcal N_{\mathrm{marg}}(P) = \left\{ Q: Q_{\mathbf H_t^i}=P_{\mathbf H_t^i} \text{ for every }i \right\},
\mathbb P_{\mathfrak R}Use in source · 2 passages
Search aliases: P_ R mathbb mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 468
in M satisfy R≡_ E R' but Cert(W_ R;ς) ≠ Cert(W_ R';ς). Then the workspace certificate is not identifiable on M under E. More strongly, for every possibly randomized decision rule widehat C based only on data generated by E, P_ R ( widehat C≠ C_ R ) + P_ R' ( widehat C≠ C_ R' ) =1, where C_ R=Cert(W_ R;ς). Consequently, inf_widehat C max{ P_ R(widehat C≠ C_ R), P_ R'(widehat C≠ C_ R') } ≥frac12.
Exact mathematical passage
\boxed{ \mathbb P_{\mathfrak R} \left( \widehat C\neq C_{\mathfrak R} \right) + \mathbb P_{\mathfrak R'} \left( \widehat C\neq C_{\mathfrak R'} \right) =1, }
\mathbb P_{\mathfrak R'}Use in source · 2 passages
Search aliases: P_ R' mathbb mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 468
in M satisfy R≡_ E R' but Cert(W_ R;ς) ≠ Cert(W_ R';ς). Then the workspace certificate is not identifiable on M under E. More strongly, for every possibly randomized decision rule widehat C based only on data generated by E, P_ R ( widehat C≠ C_ R ) + P_ R' ( widehat C≠ C_ R' ) =1, where C_ R=Cert(W_ R;ς). Consequently, inf_widehat C max{ P_ R(widehat C≠ C_ R), P_ R'(widehat C≠ C_ R') } ≥frac12.
Exact mathematical passage
\boxed{ \mathbb P_{\mathfrak R} \left( \widehat C\neq C_{\mathfrak R} \right) + \mathbb P_{\mathfrak R'} \left( \widehat C\neq C_{\mathfrak R'} \right) =1, }
\mathbb P_{\mathfrak R_0}Use in source · 1 passage
Search aliases: P_ R_0 mathbb mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 694
In finite samples, the identified set is itself uncertain. Let widehat R_1-δ be a confidence region satisfying inf_ R_0∈ M P_ R_0 ( R_0∈ widehat R_1-δ ) ≥1-δ. A conservative robust lower margin is widehat r_1-δ = inf_ R∈widehat R_1-δ inf_ς∈ S min_q m_q(W_ R;ς). If widehat r_1-δ>0, a false specification-robust certificate has probability at most δ, provided that the model class and specification family were fixed before the confidence region was computed. This confidence-set approach is useful wh…
Exact mathematical passage
\inf_{\mathfrak R_0\in\mathfrak M} \mathbb P_{\mathfrak R_0} \left( \mathfrak R_0\in \widehat{\mathfrak R}_{1-\delta} \right) \geq1-\delta.
P_{(X_i,Y)}Use in source · 1 passage
Search aliases: P_(X_i,Y)
Use in source · 07-relational-irreducibility.tex, line 389
[XOR witness pair] Under the intact law P, let X_1,X_2oversetiid∼Bernoulli(1/2), Y=X_1⊕ X_2. Then each (X_i,Y) pair is independent and uniform, so H_P(Ymid X_i)=1 bit, H_P(Ymid X_1,X_2)=0. Let Q make X_1,X_2,Y mutually independent fair bits. Then Q_(X_i,Y)=P_(X_i,Y) (i=1,2), but H_Q(Ymid X_1,X_2)=1 bit. Therefore Δ_joint^log=1 bit, k_0=2, Δ_tr(Q)=1 bit. This proves predictive relational structure relative to the declared variables. It does not, by itself, prove that any workspace variable is cau…
Exact mathematical passage
Q_{(X_i,Y)}=P_{(X_i,Y)} \qquad(i=1,2),
P_{(Y_t^+,\mathbf H_t^i)}Use in source · 1 passage
Search aliases: P_(Y_t^+, H_t^i) mathbf
Use in source · 07-relational-irreducibility.tex, line 277
Let P be the intact law of (Y_t^+, H_t^1,…, H_t^n). Define the local-marginal null class N_marg(P) = { Q: Q_ H_t^i=P_ H_t^i for every i }, and the stronger local-predictive-matched class N_pred(P) = { Q: Q_(Y_t^+, H_t^i) = P_(Y_t^+, H_t^i) for every i }. Because H_t^i can include the complete local trajectory, the latter class can preserve all single-component temporal and predictive behavior while altering cross-component organization.
Exact mathematical passage
\boxed{ \mathcal N_{\mathrm{pred}}(P) = \left\{ Q: Q_{(Y_t^+,\mathbf H_t^i)} = P_{(Y_t^+,\mathbf H_t^i)} \text{ for every }i \right\}. }
P_*Use in source · 7 passages
Search aliases: P_*
Use in source · 03-exact-shared-cores.tex, line 268
[Averaging projector for finite holonomy] If Hol_o is finite and acts unitarily, then P_*= frac1|Hol_o| ∑_h∈Hol_oh is the orthogonal projector onto C_*.
Exact mathematical passage
P_*= \frac{1}{|\Hol_o|} \sum_{h\in\Hol_o}h
P_*^*Use in source · 1 passage
Search aliases: P_*^*
Use in source · 03-exact-shared-cores.tex, line 280
For every g∈Hol_o, left multiplication permutes the group elements, so gP_*=P_*. Thus ranP_*⊆ C_*. If x∈ C_*, then P_*x=x, so C_*⊆ranP_*. Unitarity gives P_*^*=P_*, and the range characterization implies P_*^2=P_*.
Exact mathematical passage
P_*^*=P_*
P_*^2Use in source · 1 passage
Search aliases: P_*^2
Use in source · 03-exact-shared-cores.tex, line 281
For every g∈Hol_o, left multiplication permutes the group elements, so gP_*=P_*. Thus ranP_*⊆ C_*. If x∈ C_*, then P_*x=x, so C_*⊆ranP_*. Unitarity gives P_*^*=P_*, and the range characterization implies P_*^2=P_*.
Exact mathematical passage
P_*^2=P_*
P_0Use in source · 4 passages
Search aliases: P_0
Use in source · 04-approximate-workspaces.tex, line 313
Write c=P_0c+Q_0c, where P_0 projects onto W_0 and Q_0=I-P_0. Since L_HP_0=0, E_H(c) = ⟨ Q_0c,L_HQ_0c⟩. The spectrum of L_H on W_0^⊥ lies in [γ_H, L_H ]. Hence γ_H Q_0c ^2 ≤ E_H(c) ≤ L_H Q_0c ^2. Finally, Q_0c =dist(c,W_0).
Exact mathematical passage
c=P_0c+Q_0c
\mathcal P_{0:T}Use in source · 1 passage
Search aliases: P_0:T mathcal
Use in source · 10-persistence.tex, line 345
A finite-horizon persistence certificate may be recorded as P_0:T = ( max_t<Tq_t^str, max_t≤ Te_t, min_t<Tμ_t^keep, ∑_t<Tσ_t ). No single coordinate of this vector subsumes the others.
Exact mathematical passage
\boxed{ \mathcal P_{0:T} = \left( \max_{t<T}q_t^{\mathrm{str}}, \max_{t\leq T}e_t, \min_{t<T}\mu_t^{\mathrm{keep}}, \sum_{t<T}\sigma_t \right). }
p_CUse in source · 2 passages
Search aliases: p_C
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 274
Order the local coordinates as x=(q_P,p_P,p_C,f_C,q_N,f_N)^ T. Compatibility requires p_P=p_C, f_C=f_N, q_N=q_P. The discrepancy operator is D_HH = 0 · 1 · -1 · 0 · 0 · 0
Exact mathematical passage
x=(q_P,p_P,p_C,f_C,q_N,f_N)^{\mathsf T}.
p_{\mathrm{certificate}}Use in source · 1 passage
Search aliases: p_certificate mathrm
Use in source · 23-relation-to-prior-work.tex, line 101
The analysis does not make one global novelty claim. It uses a priority profile p(C) = ( p_concept, p_object, p_theorem, p_certificate, p_experiment ). For example, the philosophical concept of distributed cognition may be standard while a specific mathematical object is adapted, a theorem is a specialization of known spectral theory, the certificate is a synthesis, and the empirical claim is unresolved. This prevents originality in one coordinate from being used to imply originality in every co…
Exact mathematical passage
\boxed{ \mathbf p(C) = \left( p_{\mathrm{concept}}, p_{\mathrm{object}}, p_{\mathrm{theorem}}, p_{\mathrm{certificate}}, p_{\mathrm{experiment}} \right). }
p_{\mathrm{concept}}Use in source · 1 passage
Search aliases: p_concept mathrm
Use in source · 23-relation-to-prior-work.tex, line 101
The analysis does not make one global novelty claim. It uses a priority profile p(C) = ( p_concept, p_object, p_theorem, p_certificate, p_experiment ). For example, the philosophical concept of distributed cognition may be standard while a specific mathematical object is adapted, a theorem is a specialization of known spectral theory, the certificate is a synthesis, and the empirical claim is unresolved. This prevents originality in one coordinate from being used to imply originality in every co…
Exact mathematical passage
\boxed{ \mathbf p(C) = \left( p_{\mathrm{concept}}, p_{\mathrm{object}}, p_{\mathrm{theorem}}, p_{\mathrm{certificate}}, p_{\mathrm{experiment}} \right). }
p_{\mathrm{experiment}}Use in source · 1 passage
Search aliases: p_experiment mathrm
Use in source · 23-relation-to-prior-work.tex, line 101
The analysis does not make one global novelty claim. It uses a priority profile p(C) = ( p_concept, p_object, p_theorem, p_certificate, p_experiment ). For example, the philosophical concept of distributed cognition may be standard while a specific mathematical object is adapted, a theorem is a specialization of known spectral theory, the certificate is a synthesis, and the empirical claim is unresolved. This prevents originality in one coordinate from being used to imply originality in every co…
Exact mathematical passage
\boxed{ \mathbf p(C) = \left( p_{\mathrm{concept}}, p_{\mathrm{object}}, p_{\mathrm{theorem}}, p_{\mathrm{certificate}}, p_{\mathrm{experiment}} \right). }
P_{\mathrm{HH}}Use in source · 1 passage
Search aliases: P_HH mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 388
ition has all three bits and therefore zero conditional entropy. Hence Δ_joint^log=1 bit, k_0=2. Let Q_HH preserve the independent uniform local bit pairs but replace Y by an independent uniform bit. Because parity is independent of every two-bit local view, Q_HH preserves each (Y,X_i)-marginal. Nevertheless, Risk_log,Q_HH(V) - Risk_log,P_HH(V) =1 bit. This is an exact relational witness: the predictive capacity lies in the joint organization rather than in any local predictive marginal.
Exact mathematical passage
\Risk_{\log,Q_{\mathrm{HH}}}(V) - \Risk_{\log,P_{\mathrm{HH}}}(V) =1\text{ bit}.
P_{i_0}Use in source · 4 passages
Search aliases: P_i_0
Use in source · 04-approximate-workspaces.tex, line 709
· = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r · × (∏_ℓ=1^r-1 H_ℓ ), and the same right-hand side bounds P_i_mT_m⋯ T_1P_i_0-H_m⋯ H_1 .
Exact mathematical passage
\boxed{ \begin{aligned} \|Q_{i_m}T_m\cdots T_1P_{i_0}\| \leq \sum_{r=1}^{m} &\left(\prod_{\ell=r+1}^{m}\|T_\ell\|\right) \|V_r\|\\ &\times \left(\prod_{\ell=1}^{r-1}\|H_\ell\|\right), \end{aligned} }
P_{i_2}Use in source · 1 passage
Search aliases: P_i_2
Use in source · 04-approximate-workspaces.tex, line 781
For two consecutive transfers, P_i_2T_2T_1P_i_0 = H_2H_1+U_2V_1, Q_i_2T_2T_1P_i_0 = V_2H_1+K_2V_1. Thus leakage out of the core is first order in the blocks V_r, while an excursion that leaves and then returns to the core contains at least one V-block and one later U-block. For a fixed path length, if U_r , V_r =O(δ) and the diagonal blocks remain bounded, the residual-mediated correction to pure core-to-core transport is O(δ^2), whereas terminal residual leakage can be O(δ). This distinction se…
Exact mathematical passage
P_{i_2}T_2T_1P_{i_0} = H_2H_1+U_2V_1,
P_{i_m}Use in source · 1 passage
Search aliases: P_i_m
Use in source · 04-approximate-workspaces.tex, line 723
· × (∏_ℓ=1^r-1 H_ℓ ), and the same right-hand side bounds P_i_mT_m⋯ T_1P_i_0-H_m⋯ H_1 .
Exact mathematical passage
\|P_{i_m}T_m\cdots T_1P_{i_0}-H_m\cdots H_1\|.
P_kUse in source · 1 passage
Search aliases: P_k
Use in source · 02-static-core-transfer-theory.tex, line 210
V_fH_e+K_fV_e · V_fU_e+K_fK_e . The induced core-to-core block is therefore P_kT_fT_eP_i = H_fH_e+U_fV_e. The term U_fV_e is a residual-mediated correction: information leaves the candidate core at the intermediate node and later re-enters it. Consequently, the simple path product H_fH_e faithfully represents full core transport only under a preservation condition such as V_e=0, or under an explicit model that includes these mediated corrections.
Exact mathematical passage
P_kT_fT_eP_i = H_fH_e+U_fV_e.
p_kUse in source · 1 passage
Search aliases: p_k
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 890
A pointwise valid test does not remain valid after the analyst searches for the most favorable target, horizon, null panel, or threshold. Consider K independent null p-values and select the smallest. Then P(min_1≤ k≤ Kp_k≤α) = 1-(1-α)^K, which exceeds α whenever K>1. The same logic applies when a workspace certificate is reported only for the specification that produced the largest gate margins.
Exact mathematical passage
\mathbb P\left(\min_{1\leq k\leq K}p_k\leq\alpha\right) = 1-(1-\alpha)^K,
P_{\ker K_{\mathcal U}}Use in source · 1 passage
Search aliases: P_ker K_ U ker mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 689
Let m_i=|{α:i∈ V_α}| be the multiplicity of vertex i. Then J_ U^*J_ U=M_ U, (M_ Uc)_i=m_ic_i. The pseudoinverse performs coordinatewise averaging: (J_ U^† u)_i = frac1m_i ∑_α:i∈ V_α(u_α)_i. Let widehat u = P_ker K_ Uu = J_ Uwidehat c. Then widehat c = J_ U^†widehat u and u-J_ Uwidehat c ≤ frac K_ Uu sqrtγ_ U^tot. If m_min=min_i m_i, then widehat c-J_ U^† u ≤ frac K_ Uu sqrtm_minγ_ U^tot. The simple overlap average and the globally coherent least-squares assembly are close only when the total des…
Exact mathematical passage
\widehat u = P_{\ker K_{\mathcal U}}u = J_{\mathcal U}\widehat c.
p_MUse in source · 2 passages
Search aliases: p_M
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 512
Order the local coordinates as x=(g_H,d_H,g_M,p_M,p_X,v_X,d_A,v_A)^ T. The overlap discrepancies are g_H-g_M, p_M-p_X, v_X-v_A, d_A-d_H. Thus D_HAI = 1 · 0 · -1 · 0 · 0 · 0 · 0 · 0
Exact mathematical passage
x=(g_H,d_H,g_M,p_M,p_X,v_X,d_A,v_A)^{\mathsf T}.
p_{\mathrm{object}}Use in source · 1 passage
Search aliases: p_object mathrm
Use in source · 23-relation-to-prior-work.tex, line 101
The analysis does not make one global novelty claim. It uses a priority profile p(C) = ( p_concept, p_object, p_theorem, p_certificate, p_experiment ). For example, the philosophical concept of distributed cognition may be standard while a specific mathematical object is adapted, a theorem is a specialization of known spectral theory, the certificate is a synthesis, and the empirical claim is unresolved. This prevents originality in one coordinate from being used to imply originality in every co…
Exact mathematical passage
\boxed{ \mathbf p(C) = \left( p_{\mathrm{concept}}, p_{\mathrm{object}}, p_{\mathrm{theorem}}, p_{\mathrm{certificate}}, p_{\mathrm{experiment}} \right). }
p_PUse in source · 2 passages
Search aliases: p_P
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 274
Order the local coordinates as x=(q_P,p_P,p_C,f_C,q_N,f_N)^ T. Compatibility requires p_P=p_C, f_C=f_N, q_N=q_P. The discrepancy operator is D_HH = 0 · 1 · -1 · 0 · 0 · 0
Exact mathematical passage
x=(q_P,p_P,p_C,f_C,q_N,f_N)^{\mathsf T}.
P_{s(e)}Use in source · 2 passages
Search aliases: P_s(e)
Use in source · 02-static-core-transfer-theory.tex, line 154
V_e · K_e , where H_e=P_t(e)T_eP_s(e):C_s(e)→ C_t(e), U_e=P_t(e)T_eQ_s(e):R_s(e)→ C_t(e), V_e=Q_t(e)T_eP_s(e):C_s(e)→ R_t(e), K_e=Q_t(e)T_eQ_s(e):R_s(e)→ R_t(e).
Exact mathematical passage
H_e=P_{t(e)}T_eP_{s(e)}:C_{s(e)}\to C_{t(e)},
P_{s(\gamma)}Use in source · 2 passages
Search aliases: P_s(γ) gamma
Use in source · 02-static-core-transfer-theory.tex, line 228
[Pathwise core preservation] Suppose V_e=0 for every edge in a directed path γ=e_m⋯ e_1. Then T_γ(C_s(γ))⊆ C_t(γ) and P_t(γ)T_γ P_s(γ) = H_e_m⋯ H_e_1.
Exact mathematical passage
P_{t(\gamma)}T_\gamma P_{s(\gamma)} = H_{e_m}\cdots H_{e_1}.
P_{S,d}Use in source · 2 passages
Search aliases: P_S,d
Use in source · 15-boundary-formation-and-stability.tex, line 116
For the induced subsystem on S, define Coh(S) = tr ( P_S,dL_SP_S,d ), where P_S,d projects onto the selected low-energy workspace modes. Let Cut(S) = ∑_e:s(e)∈ S, t(e)∉ Sw_e + ∑_e:s(e)∉ S, t(e)∈ Sw_e. Let k_ε(S) be the minimal sufficient coalition size inside the candidate subsystem. A candidate is admissible only if SRW_Θ_S(W_S)=1, k_ε(S)≥2, unless the claim explicitly concerns a centralized workspace.
Exact mathematical passage
\mathsf{Coh}(S) = \operatorname{tr} \left( P_{S,d}L_SP_{S,d} \right),
P_tUse in source · 14 passages
Search aliases: P_t
Use in source · 06-dynamic-workspace-theory.tex, line 81
Let c(t)=(c_i(t))_i∈ V ∈ C_V(t), P_t= 1_[0,ε_t](L_t). The instantaneous structural workspace coordinate is W_t^str=P_tc(t) ∈ Γ_ε_t(H(t)). When P_t varies with time, these coordinates inhabit a moving family of subspaces. Parts~X--XII will supply the transport required to compare them across time. In what follows, all sufficiency and intervention statements are made at a fixed decision time t.
Exact mathematical passage
c(t)=(c_i(t))_{i\in V} \in \mathcal C_V(t), \qquad P_t=\mathbf 1_{[0,\varepsilon_t]}(L_t).
P_{t(e)}Use in source · 2 passages
Search aliases: P_t(e)
Use in source · 02-static-core-transfer-theory.tex, line 154
V_e · K_e , where H_e=P_t(e)T_eP_s(e):C_s(e)→ C_t(e), U_e=P_t(e)T_eQ_s(e):R_s(e)→ C_t(e), V_e=Q_t(e)T_eP_s(e):C_s(e)→ R_t(e), K_e=Q_t(e)T_eQ_s(e):R_s(e)→ R_t(e).
Exact mathematical passage
H_e=P_{t(e)}T_eP_{s(e)}:C_{s(e)}\to C_{t(e)},
P_{t(\gamma)}Use in source · 1 passage
Search aliases: P_t(γ) gamma
Use in source · 02-static-core-transfer-theory.tex, line 228
[Pathwise core preservation] Suppose V_e=0 for every edge in a directed path γ=e_m⋯ e_1. Then T_γ(C_s(γ))⊆ C_t(γ) and P_t(γ)T_γ P_s(γ) = H_e_m⋯ H_e_1.
Exact mathematical passage
P_{t(\gamma)}T_\gamma P_{s(\gamma)} = H_{e_m}\cdots H_{e_1}.
P_{t+1}Use in source · 7 passages
Search aliases: P_t+1
Use in source · 10-persistence.tex, line 103
[Temporal workspace tracking] If η_t^L<fracg_t2, then the transported and newly extracted workspace projectors satisfy q_t^str := P_t+1-U_t^VP_t(U_t^V)^* ≤ fracη_t^Lg_t-η_t^L ≤ frac2η_t^Lg_t.
Exact mathematical passage
\boxed{ q_t^{\mathrm{str}} := \left\| P_{t+1}-U_t^VP_t(U_t^V)^* \right\| \leq \frac{\eta_t^L}{g_t-\eta_t^L} \leq \frac{2\eta_t^L}{g_t}. }
p_{\mathrm{theorem}}Use in source · 1 passage
Search aliases: p_theorem mathrm
Use in source · 23-relation-to-prior-work.tex, line 101
The analysis does not make one global novelty claim. It uses a priority profile p(C) = ( p_concept, p_object, p_theorem, p_certificate, p_experiment ). For example, the philosophical concept of distributed cognition may be standard while a specific mathematical object is adapted, a theorem is a specialization of known spectral theory, the certificate is a synthesis, and the empirical claim is unresolved. This prevents originality in one coordinate from being used to imply originality in every co…
Exact mathematical passage
\boxed{ \mathbf p(C) = \left( p_{\mathrm{concept}}, p_{\mathrm{object}}, p_{\mathrm{theorem}}, p_{\mathrm{certificate}}, p_{\mathrm{experiment}} \right). }
p_XUse in source · 2 passages
Search aliases: p_X
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 512
Order the local coordinates as x=(g_H,d_H,g_M,p_M,p_X,v_X,d_A,v_A)^ T. The overlap discrepancies are g_H-g_M, p_M-p_X, v_X-v_A, d_A-d_H. Thus D_HAI = 1 · 0 · -1 · 0 · 0 · 0 · 0 · 0
Exact mathematical passage
x=(g_H,d_H,g_M,p_M,p_X,v_X,d_A,v_A)^{\mathsf T}.
P_{\{\lambda_1,\ldots,\lambda_d\}}Use in source · 1 passage
Search aliases: P_{λ_1,…,λ_d} lambda ldots lambda
Use in source · 04-approximate-workspaces.tex, line 205
An equivalent index-based description fixes d and writes W_d=ran P_d, P_d=P_{λ_1,…,λ_d}(L_H), with cluster gap g_d=λ_d+1-λ_d>0. The index-based form is convenient for perturbation theorems because the workspace rank is declared explicitly.
Exact mathematical passage
W_d=\ran P_d, \qquad P_d=P_{\{\lambda_1,\ldots,\lambda_d\}}(L_H),
P_\PiUse in source · 5 passages
Search aliases: P_Π Pi
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 191
[Two-scale coherence bound] Let P_Π be the orthogonal projector onto J_Π W_Π. Let γ_int>0 be the smallest positive eigenvalue of D_int^*D_int, and let γ_Π>0 be the smallest positive eigenvalue of D_Π^*D_Π. Then every c∈ C_V satisfies dist(c,Γ(H)) ≤ frac D_intc sqrtγ_int + frac D_Π J_Π^*P_Π c sqrtγ_Π. The first term measures incoherence within macro-components. The second measures incompatibility among their internally coherent states.
Exact mathematical passage
P_\Pi
\pagenumberingUse in source · 1 passage
Search aliases: pagenumbering
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
\parUse in source · 1 passage
Search aliases: par
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
\mathrm{pass}Use in source · 7 passages
Search aliases: pass mathrm
Use in source · 15-boundary-formation-and-stability.tex, line 163
· -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\widehat S_t \in \argmax_{S\in\mathfrak S_{\mathrm{pass}}} \widehat{\mathcal B}_t(S),
\operatorname{Pass}Use in source · 2 passages
Search aliases: Pass operatorname
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 356
For thresholds Θ_form, define Form_Θ_form(W)=1 only when all applicable gates pass: · e_q^MDL≥ τ_q^MDL, · · e_q^causal≥ τ_q^causal, · δ_q^scaf≤ε_q^scaf, · · δ^leak≤ε_leak, · SRW_Θ(W)=1, · · Pass(N_form)=1. The final workspace gate is included because endogenous discovery of an unstable or causally irrelevant pattern is not endogenous workspace formation.
Exact mathematical passage
\begin{aligned} & e_q^{\mathrm{MDL}}\geq \tau_q^{\mathrm{MDL}}, && e_q^{\mathrm{causal}}\geq \tau_q^{\mathrm{causal}},\\ & \delta_q^{\mathrm{scaf}}\leq\varepsilon_q^{\mathrm{scaf}}, && \delta^{\mathrm{leak}}\leq\varepsilon_{\mathrm{leak}},\\ & \operatorname{SRW}_{\Theta}(W)=1, && \operatorname{Pass}(N_{\mathrm{form}})=1. \end{aligned}
\operatorname{Pass}_jUse in source · 1 passage
Search aliases: Pass_j operatorname
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 714
Let J(L) be the required gate set for claim level L. Then Certify_L(W;ς) = bigwedge_j∈ J(L,ς) Pass_j(W;ς). For a workspace-agent claim, the required set includes every structural, operational, relational, persistent, goal, counterfactual-control, and self-maintenance gate declared in Parts~IX and XVI. A specification-robust claim additionally requires the uniform rule of Part~XVIII across S. Failure of an earlier level prevents certification of a later level, even when later-level behavior appea…
Exact mathematical passage
\boxed{ \operatorname{Certify}_L(W;\varsigma) = \bigwedge_{j\in\mathcal J(L,\varsigma)} \operatorname{Pass}_j(W;\varsigma). }
\PathUse in source · 3 passages
Search aliases: Path
Use in source · 02-static-core-transfer-theory.tex, line 19
The directed path category is C=Path(G). Its objects are vertices. A path γ=e_m⋯ e_2e_1 means that e_1 is traversed first. Composition is concatenation, and the empty path at i is denoted 1_i.
Exact mathematical passage
\mathcal C=\Path(G).
\mathrm{path}Use in source · 2 passages
Search aliases: path mathrm
Use in source · 12-identity-through-time-and-replacement.tex, line 571
For a sequence of realizations R_0, R_1,…, R_T, let J_t: R_t→ R_t+1 be admissible correspondences. Define the path length Len( J_0:T) = ∑_t=0^T-1Cost( J_t) and the induced directed path quasi-pseudometric d_path^rightarrow( R_0, R_T) = inf_ J_0:T Len( J_0:T). Concatenation gives the directed triangle inequality. Because replacement costs and intervention divergences need not be symmetric, symmetry is not assumed. When reverse correspondences exist, define the symmetrized pseudometric d_path^sym(…
Exact mathematical passage
\boxed{ d_{\mathrm{path}}^{\rightarrow}(\mathfrak R_0,\mathfrak R_T) = \inf_{\mathfrak J_{0:T}} \operatorname{Len}(\mathfrak J_{0:T}). }
\mathrm{pers}Use in source · 2 passages
Search aliases: pers mathrm
Use in source · 09-formal-workspace-definition.tex, line 8
Let Θ = ( ε_coh, ε_align, ε_k, underlineη_c, underlineη_loop, δ_node, δ_null, δ_spec, k, ε_pers ). Let ς = ( D,Y^+,ℓ,τ, I, Q,Θ) be the complete declared scientific specification, where Q⊆ N_pred(P) is a validated null panel. A dynamic realization contains a certified stratified relational workspace when there exists a candidate W_t satisfying all gates required for the claimed level under ς. The detailed robustness and identifiability requirements for varying ς are developed in Parts~XVII and XV…
Exact mathematical passage
\Theta = \left( \varepsilon_{\mathrm{coh}}, \varepsilon_{\mathrm{align}}, \varepsilon_k, \underline\eta_c, \underline\eta_{\mathrm{loop}}, \delta_{\mathrm{node}}, \delta_{\mathrm{null}}, \delta_{\mathrm{spec}}, k, \varepsilon_{\mathrm{pers}} \right).
\operatorname{Person}Use in source · 1 passage
Search aliases: Person operatorname
Use in source · 01-foundational-thesis.tex, line 365
Workspace( R) centernotLongrightarrow Conscious( R). Likewise, Distributed(Workspace) centernotLongrightarrow Person(Workspace). Workspace structure, reentry, agency, self-maintenance, and phenomenal consciousness remain formally distinct predicates. Any bridge among them would require additional theory and evidence.
Exact mathematical passage
\operatorname{Distributed}(\Workspace) \centernot\Longrightarrow \operatorname{Person}(\Workspace).
\operatorname{PhenomenalConsciousness}Use in source · 1 passage
Search aliases: PhenomenalConsciousness operatorname
Use in source · 24-theory-hierarchy.tex, line 118
subtopicSeparate, unresolved axis PhenomenalConsciousness.
Exact mathematical passage
\operatorname{PhenomenalConsciousness}.
\operatorname{PhenomenallyConscious}Use in source · 1 passage
Search aliases: PhenomenallyConscious operatorname
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1124
The following implications are not licensed: Agent_Θ_A(Workspace) centernotLongrightarrow PhenomenallyConscious(Workspace), SelfMaintaining(Workspace) centernotLongrightarrow SelfAware(Workspace), GoalPersistent(Workspace) centernotLongrightarrow MoralPatient(Workspace). A thermostat-like controller can maintain a variable without representing itself. A sophisticated planner can evaluate counterfactual actions without phenomenal experience. Conversely, failure to pass this engineering certificat…
Exact mathematical passage
\operatorname{Agent}_{\Theta_A}(\Workspace) \centernot\Longrightarrow \operatorname{PhenomenallyConscious}(\Workspace),
\preccurlyeqUse in source · 1 passage
Search aliases: preccurlyeq
Use in source · 23-relation-to-prior-work.tex, line 58
Failure to find the phrase ``Stratified Relational Workspace Theory'' in prior literature is weak evidence. Priority is determined by mathematical and operational equivalence, not by terminology. Let C be a claim in the paper and S a prior source. Write Spreccurlyeq C when the main content of C follows from S after admissible relabeling, restriction, or direct specialization. A substantive novelty residual exists only when the claim contains content not absorbed by the closure of known sources: …
Exact mathematical passage
S\preccurlyeq C
\mathbf{Prob}Use in source · 1 passage
Search aliases: Prob mathbf
Use in source · 02-static-core-transfer-theory.tex, line 51
The finite-dimensional Hilbert assumption supplies adjoints and spectral tools. The exact compatible-section definitions require less and may later be formulated in categories such as Ban, Meas, Prob, Top, Alg.
Exact mathematical passage
\mathbf{Ban},\qquad \mathbf{Meas},\qquad \mathbf{Prob},\qquad \mathbf{Top},\qquad \mathbf{Alg}.
Q^\bulletUse in source · 1 passage
Search aliases: Q^bullet bullet
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 797
A practical hierarchy rarely transmits each complete local workspace. Let Q^p:check C^p( U;mathscr W)→overline C^p be compression maps into smaller local and overlap representations. Suppose there is a compressed coboundary overlineδ^p such that Q^p+1δ^p = overlineδ^p Q^p. The maps Q^bullet then form a cochain map.
Exact mathematical passage
Q^\bullet
Q^pUse in source · 2 passages
Search aliases: Q^p
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 785
A practical hierarchy rarely transmits each complete local workspace. Let Q^p:check C^p( U;mathscr W)→overline C^p be compression maps into smaller local and overlap representations. Suppose there is a compressed coboundary overlineδ^p such that Q^p+1δ^p = overlineδ^p Q^p. The maps Q^bullet then form a cochain map.
Exact mathematical passage
Q^p:\check C^p(\mathcal U;\mathscr W)\to\overline C^p
Q^{p+1}Use in source · 1 passage
Search aliases: Q^p+1
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 790
A practical hierarchy rarely transmits each complete local workspace. Let Q^p:check C^p( U;mathscr W)→overline C^p be compression maps into smaller local and overlap representations. Suppose there is a compressed coboundary overlineδ^p such that Q^p+1δ^p = overlineδ^p Q^p. The maps Q^bullet then form a cochain map.
Exact mathematical passage
\boxed{ Q^{p+1}\delta^p = \overline\delta^p Q^p. }
q^tUse in source · 1 passage
Search aliases: q^t
Use in source · 10-persistence.tex, line 298
[Mean-square persistence] Suppose E[e_t+1^2mid F_t] ≤ q e_t^2+v_t, 0≤ q<1, and E[v_t]≤bar v. Then E[e_t^2] ≤ q^t E[e_0^2] + fracbar v(1-q^t)1-q, so limsup_t→∞ E[e_t^2] ≤ fracbar v1-q.
Exact mathematical passage
\boxed{ \mathbb E[e_t^2] \leq q^t\mathbb E[e_0^2] + \frac{\bar v(1-q^t)}{1-q}, }
q^\daggerUse in source · 3 passages
Search aliases: q^† dagger
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 252
[Harmonic gluing obstruction] For every cocycle b∈kerδ^1, there is an orthogonal decomposition b=δ^0q^†+h, h∈ H^1_ U, where q^†=(δ^0)^† b is a least-squares potential. Moreover, inf_q b-δ^0q = h = P_ H^1_ Ub . Hence b is exactly integrable if and only if its harmonic component vanishes.
Exact mathematical passage
\boxed{ b=\delta^0q^\dagger+h, \qquad h\in\mathcal H^1_{\mathcal U}, }
Q_{\mathbf H_t^i}Use in source · 1 passage
Search aliases: Q_ H_t^i mathbf
Use in source · 07-relational-irreducibility.tex, line 267
Let P be the intact law of (Y_t^+, H_t^1,…, H_t^n). Define the local-marginal null class N_marg(P) = { Q: Q_ H_t^i=P_ H_t^i for every i }, and the stronger local-predictive-matched class N_pred(P) = { Q: Q_(Y_t^+, H_t^i) = P_(Y_t^+, H_t^i) for every i }. Because H_t^i can include the complete local trajectory, the latter class can preserve all single-component temporal and predictive behavior while altering cross-component organization.
Exact mathematical passage
\mathcal N_{\mathrm{marg}}(P) = \left\{ Q: Q_{\mathbf H_t^i}=P_{\mathbf H_t^i} \text{ for every }i \right\},
Q_{(X_i,Y)}Use in source · 1 passage
Search aliases: Q_(X_i,Y)
Use in source · 07-relational-irreducibility.tex, line 389
[XOR witness pair] Under the intact law P, let X_1,X_2oversetiid∼Bernoulli(1/2), Y=X_1⊕ X_2. Then each (X_i,Y) pair is independent and uniform, so H_P(Ymid X_i)=1 bit, H_P(Ymid X_1,X_2)=0. Let Q make X_1,X_2,Y mutually independent fair bits. Then Q_(X_i,Y)=P_(X_i,Y) (i=1,2), but H_Q(Ymid X_1,X_2)=1 bit. Therefore Δ_joint^log=1 bit, k_0=2, Δ_tr(Q)=1 bit. This proves predictive relational structure relative to the declared variables. It does not, by itself, prove that any workspace variable is cau…
Exact mathematical passage
Q_{(X_i,Y)}=P_{(X_i,Y)} \qquad(i=1,2),
Q_{(Y_t^+,\mathbf H_t^i)}Use in source · 1 passage
Search aliases: Q_(Y_t^+, H_t^i) mathbf
Use in source · 07-relational-irreducibility.tex, line 277
Let P be the intact law of (Y_t^+, H_t^1,…, H_t^n). Define the local-marginal null class N_marg(P) = { Q: Q_ H_t^i=P_ H_t^i for every i }, and the stronger local-predictive-matched class N_pred(P) = { Q: Q_(Y_t^+, H_t^i) = P_(Y_t^+, H_t^i) for every i }. Because H_t^i can include the complete local trajectory, the latter class can preserve all single-component temporal and predictive behavior while altering cross-component organization.
Exact mathematical passage
\boxed{ \mathcal N_{\mathrm{pred}}(P) = \left\{ Q: Q_{(Y_t^+,\mathbf H_t^i)} = P_{(Y_t^+,\mathbf H_t^i)} \text{ for every }i \right\}. }
q_*Use in source · 6 passages
Search aliases: q_*
Use in source · 12-identity-through-time-and-replacement.tex, line 400
[Quantitative replacement invariance] Let J be a unitary graph correspondence with diagram defect δ_D. Define η_L=2 D δ_D+δ_D^2 and assume η_L<frac g2. Set q_* = fracη_Lg-η_L. Then there exists a unitary workspace correspondence β for which q_str≤ q_*. Moreover, δ_op( J) ≤ sup_a∈ A_1 [ · ρ_V'(a) q_* +δ_ρ(a) +ℓ_a
Exact mathematical passage
q_* = \frac{\eta_L}{g-\eta_L}.
q_*^2Use in source · 2 passages
Search aliases: q_*^2
Use in source · 12-identity-through-time-and-replacement.tex, line 410
m[Quantitative replacement invariance] Let J be a unitary graph correspondence with diagram defect δ_D. Define η_L=2 D δ_D+δ_D^2 and assume η_L<frac g2. Set q_* = fracη_Lg-η_L. Then there exists a unitary workspace correspondence β for which q_str≤ q_*. Moreover, δ_op( J) ≤ sup_a∈ A_1 [ · ρ_V'(a) q_* +δ_ρ(a) +ℓ_a · + ( A_ W'' + A_ W ) (1-sqrt1-q_*^2) ]. If, in addition, δ_causal(β)≤δ_c, δ_rec(β)≤δ_r, then d_id( R, R') ≤ · a q_*+b δ_op( J)
Exact mathematical passage
\boxed{ \begin{aligned} \delta_{\mathrm{op}}(\mathfrak J) \leq \sup_{a\in\mathcal A_1} \Bigl[& \|\rho_V'(a)\|q_* +\delta_\rho(a) +\ell_a\\ &+ \bigl(\|A_{\mathcal W'}'\|+\|A_{\mathcal W}\|\bigr) \left(1-\sqrt{1-q_*^2}\right) \Bigr]. \end{aligned} }
Q_0Use in source · 5 passages
Search aliases: Q_0
Use in source · 04-approximate-workspaces.tex, line 313
Write c=P_0c+Q_0c, where P_0 projects onto W_0 and Q_0=I-P_0. Since L_HP_0=0, E_H(c) = ⟨ Q_0c,L_HQ_0c⟩. The spectrum of L_H on W_0^⊥ lies in [γ_H, L_H ]. Hence γ_H Q_0c ^2 ≤ E_H(c) ≤ L_H Q_0c ^2. Finally, Q_0c =dist(c,W_0).
Exact mathematical passage
c=P_0c+Q_0c
Q_1Use in source · 2 passages
Search aliases: Q_1
Use in source · 07-relational-irreducibility.tex, line 338
For a predeclared null Q, define Δ_tr(Q) = Risk_ℓ,Q(V) - Risk_ℓ,P(V). For a finite validated panel Q={Q_1,…,Q_m}⊆ N_pred(P), report both the complete vector Δ_tr( Q) = ( Δ_tr(Q_1),…, Δ_tr(Q_m) ) and the robust panel minimum Δ_tr^min( Q) = min_Q∈ QΔ_tr(Q). The panel must be fixed independently of the observed favorable gap. Otherwise null selection can manufacture apparent relational dependence.
Exact mathematical passage
\mathcal Q=\{Q_1,\ldots,Q_m\}\subseteq\mathcal N_{\mathrm{pred}}(P)
q_1Use in source · 1 passage
Search aliases: q_1
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 309
Consider three charts arranged in a cycle, with one-dimensional overlap spaces and oriented offsets b_12, b_23, b_31. Local potentials would have to satisfy q_2-q_1=b_12, q_3-q_2=b_23, q_1-q_3=b_31. Adding the equations gives the necessary and sufficient condition b_12+b_23+b_31=0. With the standard edge norm, the harmonic obstruction has magnitude ω_ U(b) = frac|b_12+b_23+b_31|sqrt3. Every pairwise relation may be individually meaningful while the complete cycle remains globally inconsistent.
Exact mathematical passage
q_2-q_1=b_{12}, \qquad q_3-q_2=b_{23}, \qquad q_1-q_3=b_{31}.
q_2Use in source · 1 passage
Search aliases: q_2
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 309
Consider three charts arranged in a cycle, with one-dimensional overlap spaces and oriented offsets b_12, b_23, b_31. Local potentials would have to satisfy q_2-q_1=b_12, q_3-q_2=b_23, q_1-q_3=b_31. Adding the equations gives the necessary and sufficient condition b_12+b_23+b_31=0. With the standard edge norm, the harmonic obstruction has magnitude ω_ U(b) = frac|b_12+b_23+b_31|sqrt3. Every pairwise relation may be individually meaningful while the complete cycle remains globally inconsistent.
Exact mathematical passage
q_2-q_1=b_{12}, \qquad q_3-q_2=b_{23}, \qquad q_1-q_3=b_{31}.
q_3Use in source · 1 passage
Search aliases: q_3
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 309
Consider three charts arranged in a cycle, with one-dimensional overlap spaces and oriented offsets b_12, b_23, b_31. Local potentials would have to satisfy q_2-q_1=b_12, q_3-q_2=b_23, q_1-q_3=b_31. Adding the equations gives the necessary and sufficient condition b_12+b_23+b_31=0. With the standard edge norm, the harmonic obstruction has magnitude ω_ U(b) = frac|b_12+b_23+b_31|sqrt3. Every pairwise relation may be individually meaningful while the complete cycle remains globally inconsistent.
Exact mathematical passage
q_2-q_1=b_{12}, \qquad q_3-q_2=b_{23}, \qquad q_1-q_3=b_{31}.
Q_dUse in source · 10 passages
Search aliases: Q_d
Use in source · 04-approximate-workspaces.tex, line 590
[Approximate operation-closure theorem] Let P_d project onto the first d eigenvectors of L_H, set λ_d≤ε, μ=λ_d+1>0, and let Q_d=I-P_d. Then every a∈ A satisfies Q_dρ_V(a)P_d ≤ frac ρ_E(a) sqrtε+β(a) sqrtμ.
Exact mathematical passage
Q_d=I-P_d
Q_{\mathrm{HH}}Use in source · 3 passages
Search aliases: Q_HH mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 384
tion is abstract: acceptance depends on the statement, the state of the proof obligations, and the current falsification record. No individual node has sufficient information: H(Ymid X_P) = H(Ymid X_C) = H(Ymid X_N) =1. Every two-node coalition has all three bits and therefore zero conditional entropy. Hence Δ_joint^log=1 bit, k_0=2. Let Q_HH preserve the independent uniform local bit pairs but replace Y by an independent uniform bit. Because parity is independent of every two-bit local view, Q_…
Exact mathematical passage
Q_{\mathrm{HH}}
Q_{i_2}Use in source · 1 passage
Search aliases: Q_i_2
Use in source · 04-approximate-workspaces.tex, line 786
For two consecutive transfers, P_i_2T_2T_1P_i_0 = H_2H_1+U_2V_1, Q_i_2T_2T_1P_i_0 = V_2H_1+K_2V_1. Thus leakage out of the core is first order in the blocks V_r, while an excursion that leaves and then returns to the core contains at least one V-block and one later U-block. For a fixed path length, if U_r , V_r =O(δ) and the diagonal blocks remain bounded, the residual-mediated correction to pure core-to-core transport is O(δ^2), whereas terminal residual leakage can be O(δ). This distinction se…
Exact mathematical passage
Q_{i_2}T_2T_1P_{i_0} = V_2H_1+K_2V_1.
Q_{i_m}Use in source · 1 passage
Search aliases: Q_i_m
Use in source · 04-approximate-workspaces.tex, line 709
· = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r · × (∏_ℓ=1^r-1 H_ℓ ), and the same right-hand side bounds P_i_mT_m⋯ T_1P_i_0-H_m⋯ H_1 .
Exact mathematical passage
\boxed{ \begin{aligned} \|Q_{i_m}T_m\cdots T_1P_{i_0}\| \leq \sum_{r=1}^{m} &\left(\prod_{\ell=r+1}^{m}\|T_\ell\|\right) \|V_r\|\\ &\times \left(\prod_{\ell=1}^{r-1}\|H_\ell\|\right), \end{aligned} }
Q_mUse in source · 2 passages
Search aliases: Q_m
Use in source · 07-relational-irreducibility.tex, line 338
For a predeclared null Q, define Δ_tr(Q) = Risk_ℓ,Q(V) - Risk_ℓ,P(V). For a finite validated panel Q={Q_1,…,Q_m}⊆ N_pred(P), report both the complete vector Δ_tr( Q) = ( Δ_tr(Q_1),…, Δ_tr(Q_m) ) and the robust panel minimum Δ_tr^min( Q) = min_Q∈ QΔ_tr(Q). The panel must be fixed independently of the observed favorable gap. Otherwise null selection can manufacture apparent relational dependence.
Exact mathematical passage
\mathcal Q=\{Q_1,\ldots,Q_m\}\subseteq\mathcal N_{\mathrm{pred}}(P)
q_NUse in source · 3 passages
Search aliases: q_N
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 274
Order the local coordinates as x=(q_P,p_P,p_C,f_C,q_N,f_N)^ T. Compatibility requires p_P=p_C, f_C=f_N, q_N=q_P. The discrepancy operator is D_HH = 0 · 1 · -1 · 0 · 0 · 0
Exact mathematical passage
x=(q_P,p_P,p_C,f_C,q_N,f_N)^{\mathsf T}.
q_PUse in source · 3 passages
Search aliases: q_P
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 274
Order the local coordinates as x=(q_P,p_P,p_C,f_C,q_N,f_N)^ T. Compatibility requires p_P=p_C, f_C=f_N, q_N=q_P. The discrepancy operator is D_HH = 0 · 1 · -1 · 0 · 0 · 0
Exact mathematical passage
x=(q_P,p_P,p_C,f_C,q_N,f_N)^{\mathsf T}.
Q_{s(e)}Use in source · 2 passages
Search aliases: Q_s(e)
Use in source · 02-static-core-transfer-theory.tex, line 157
V_e · K_e , where H_e=P_t(e)T_eP_s(e):C_s(e)→ C_t(e), U_e=P_t(e)T_eQ_s(e):R_s(e)→ C_t(e), V_e=Q_t(e)T_eP_s(e):C_s(e)→ R_t(e), K_e=Q_t(e)T_eQ_s(e):R_s(e)→ R_t(e).
Exact mathematical passage
U_e=P_{t(e)}T_eQ_{s(e)}:R_{s(e)}\to C_{t(e)},
q_{\mathrm{str}}Use in source · 16 passages
Search aliases: q_str mathrm
Use in source · 12-identity-through-time-and-replacement.tex, line 136
[Approximate structural replacement] If η_L<frac g2, then q_str := P'-J_VPJ_V^* ≤ fracη_Lg-η_L ≤ frac2η_Lg. If q_str<1, then B=P'J_VP:ran P⟶ran P' is bijective and satisfies σ_min(B) ≥ sqrt1-q_str^2. Its polar factor β =B(B^*B)^-1/2 is a canonical unitary workspace correspondence. Moreover, β-J_VP ≤ q_str + 1-sqrt1-q_str^2.
Exact mathematical passage
\boxed{ q_{\mathrm{str}} := \|P'-J_VPJ_V^*\| \leq \frac{\eta_L}{g-\eta_L} \leq \frac{2\eta_L}{g}. }
q_{\mathrm{str}}^2Use in source · 6 passages
Search aliases: q_str^2 mathrm
Use in source · 12-identity-through-time-and-replacement.tex, line 152
[Approximate structural replacement] If η_L<frac g2, then q_str := P'-J_VPJ_V^* ≤ fracη_Lg-η_L ≤ frac2η_Lg. If q_str<1, then B=P'J_VP:ran P⟶ran P' is bijective and satisfies σ_min(B) ≥ sqrt1-q_str^2. Its polar factor β =B(B^*B)^-1/2 is a canonical unitary workspace correspondence. Moreover, β-J_VP ≤ q_str + 1-sqrt1-q_str^2.
Exact mathematical passage
\sigma_{\min}(B) \geq \sqrt{1-q_{\mathrm{str}}^2}.
Q_tUse in source · 1 passage
Search aliases: Q_t
Use in source · 19-summary-of-main-results.tex, line 450
If the interventional action-value estimator satisfies sup_a|widehat Q_t(a)-Q_t(a)|≤ε_Q and the implemented policy has optimization error at most δ_opt relative to widehat Q_t, then Reg_t(widehatπ_t) ≤ 2ε_Q+δ_opt. For deterministic greedy action, the bound is 2ε_Q. A unique true optimum with value gap greater than 2ε_Q is recovered exactly. The guarantee is relative to the declared utility, feasible action support, causal identification, and horizon.
Exact mathematical passage
\sup_a|\widehat Q_t(a)-Q_t(a)|\leq\varepsilon_Q
Q_{t(e)}Use in source · 2 passages
Search aliases: Q_t(e)
Use in source · 02-static-core-transfer-theory.tex, line 160
V_e · K_e , where H_e=P_t(e)T_eP_s(e):C_s(e)→ C_t(e), U_e=P_t(e)T_eQ_s(e):R_s(e)→ C_t(e), V_e=Q_t(e)T_eP_s(e):C_s(e)→ R_t(e), K_e=Q_t(e)T_eQ_s(e):R_s(e)→ R_t(e).
Exact mathematical passage
V_e=Q_{t(e)}T_eP_{s(e)}:C_{s(e)}\to R_{t(e)},
Q_{t(\gamma)}Use in source · 1 passage
Search aliases: Q_t(γ) gamma
Use in source · 19-summary-of-main-results.tex, line 222
For a path γ=e_m⋯ e_1, Q_t(γ)T_γ P_s(γ) ≤ ∑_r=1^m · ( ∏_ℓ=r+1^m T_e_ℓ ) V_e_r · × ( ∏_ℓ=1^r-1 H_e_ℓ ). The same bound controls the defect between full core-to-core path transport and the pure core product. An exact Duhamel identity yields both estimates.
Exact mathematical passage
\boxed{ \begin{aligned} \|Q_{t(\gamma)}T_\gamma P_{s(\gamma)}\| \leq \sum_{r=1}^{m} &\left( \prod_{\ell=r+1}^{m}\|T_{e_\ell}\| \right) \|V_{e_r}\|\\ &\times \left( \prod_{\ell=1}^{r-1}\|H_{e_\ell}\| \right). \end{aligned} }
Q_t^{g'}Use in source · 1 passage
Search aliases: Q_t^g'
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 115
Two goal codes are operationally equivalent, g∼_goalg', when they induce the same action ordering in every declared state and intervention background: Q_t^g(amid w) ≥ Q_t^g(a'mid w) Longleftrightarrow Q_t^g'(amid w) ≥ Q_t^g'(a'mid w). The abstract goal is the equivalence class [g]_goal. This quotient prevents a mere invertible recoding of a goal channel from being reported as a change of objective. For quantitative regret bounds, a representative normalization of U_g must nevertheless be fixed.
Exact mathematical passage
Q_t^g(a\mid w) \geq Q_t^g(a'\mid w) \quad\Longleftrightarrow\quad Q_t^{g'}(a\mid w) \geq Q_t^{g'}(a'\mid w).
q_t^{\mathrm{str}}Use in source · 4 passages
Search aliases: q_t^str mathrm
Use in source · 10-persistence.tex, line 103
[Temporal workspace tracking] If η_t^L<fracg_t2, then the transported and newly extracted workspace projectors satisfy q_t^str := P_t+1-U_t^VP_t(U_t^V)^* ≤ fracη_t^Lg_t-η_t^L ≤ frac2η_t^Lg_t.
Exact mathematical passage
\boxed{ q_t^{\mathrm{str}} := \left\| P_{t+1}-U_t^VP_t(U_t^V)^* \right\| \leq \frac{\eta_t^L}{g_t-\eta_t^L} \leq \frac{2\eta_t^L}{g_t}. }
q_\alphaUse in source · 1 passage
Search aliases: q_α alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 212
A different problem arises when only relative transition data are supplied. Let b=(b_αβ)∈check C^1( U;mathscr W) be a prescribed family of overlap offsets. The triple-overlap consistency condition is δ^1b=0. One seeks local potentials q=(q_α)∈check C^0 satisfying δ^0q=b. Define check H^1( U;mathscr W) = frackerδ^1imδ^0. Then the affine gluing problem is solvable precisely when [b]=0 in check H^1( U;mathscr W). A nonzero class means that all local transition statements can be mutually consistent …
Exact mathematical passage
q=(q_\alpha)\in\check C^0
q_\iotaUse in source · 4 passages
Search aliases: q_ι iota
Use in source · 06-dynamic-workspace-theory.tex, line 433
Define the observational alignment defect by δ_align^obs(W_t) = I_ P(Y_t^+; H_tmid W_t). For a countable intervention family with declared weights q_ι>0, ∑_ι q_ι=1, define δ_align^ I(W_t) = ∑_ι∈ I q_ι I_ P^ι (Y_t^+; H_tmid W_t). For bounded decision losses, Proposition~[source reference] applies under each intervention and gives the weighted bound ∑_ιq_ι [ Risk_ℓ^ι(W_t) - Risk_ℓ^ι( H_t) ] ≤ sqrtfrac δ_align^ I(W_t)2.
Exact mathematical passage
q_\iota>0
q_{\sigma}Use in source · 1 passage
Search aliases: q_σ sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 309
For a family S of admissible scaffold variants, define the cross-scaffold identity defect δ_q^scaf = inf_{J_σσ'} E_σ,σ'∼π d_q ( J_σσ'q_σ,q_σ' ), where J_σσ' transports the learned object between admissible coordinate systems. A low value indicates that the same abstract organization is recovered under multiple non-solution-bearing scaffolds.
Exact mathematical passage
\boxed{ \delta_q^{\mathrm{scaf}} = \inf_{\{J_{\sigma\sigma'}\}} \mathbb E_{\sigma,\sigma'\sim\pi} d_q \left( J_{\sigma\sigma'}q_{\sigma},q_{\sigma'} \right), }
q_{\sigma'}Use in source · 1 passage
Search aliases: q_σ' sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 309
For a family S of admissible scaffold variants, define the cross-scaffold identity defect δ_q^scaf = inf_{J_σσ'} E_σ,σ'∼π d_q ( J_σσ'q_σ,q_σ' ), where J_σσ' transports the learned object between admissible coordinate systems. A low value indicates that the same abstract organization is recovered under multiple non-solution-bearing scaffolds.
Exact mathematical passage
\boxed{ \delta_q^{\mathrm{scaf}} = \inf_{\{J_{\sigma\sigma'}\}} \mathbb E_{\sigma,\sigma'\sim\pi} d_q \left( J_{\sigma\sigma'}q_{\sigma},q_{\sigma'} \right), }
\mathcal RUse in source · 12 passages
Search aliases: R mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1049
[Approximate hierarchical collapse bound] Let F_r: H_r→ H_r+1, widetilde F_r: H_r→ H_r+1 be exact and implemented level-collapse maps for r=0,…,R-1. Let R_r⊆ H_r contain the exact and implemented states reachable at level r. Assume, on R_r, F_r(x)-F_r(y) ≤ L_r x-y and sup_x∈ R_r widetilde F_r(x)-F_r(x) ≤ δ_r. Then · widetilde F_R-1∘⋯∘widetilde F_0(x) - F_R-1∘⋯∘ F_0(x)
Exact mathematical passage
\mathcal R_r\subseteq\mathcal H_r
\mathsf RUse in source · 6 passages
Search aliases: R mathsf
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 83
For each case we report the vector Card( K) = ( S, O, R, P, F, A, D, X, C ), where: ll S · = structural core and spectral coherence,
Exact mathematical passage
\boxed{ \mathsf{Card}(\mathfrak K) = \left( \mathsf S, \mathsf O, \mathsf R, \mathsf P, \mathsf F, \mathsf A, \mathsf D, \mathsf X, \mathsf C \right), }
r'Use in source · 4 passages
Search aliases: r'
Use in source · 11-reconstruction-and-resilience.tex, line 344
Suppose node r is removed and the surviving coalition is S=V∖{r}. A replacement node r' is to receive the encoding E_r'':C_*→ Y_r''.
Exact mathematical passage
r'
r^*Use in source · 8 passages
Search aliases: r^*
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 802
gintheorem[Repair selection under value-model error] Fix a damage intervention d and a finite feasible repair set R. Let V(r)=V_t^rep(r;d) be the true expected post-repair integrity margin and let widehat V obey sup_r∈ R|widehat V(r)-V(r)| ≤ ε_R. Let widehat r∈argmax_rwidehat V(r) and r^*∈argmax_r V(r). Then V(r^*)-V(widehat r) ≤ 2ε_R. If V(r^*) ≥ ρ+2ε_R, then the selected repair restores the expected reserve: V(widehat r)≥ρ. If r^* is unique and its repair-value gap exceeds 2ε_R, then widehat r…
Exact mathematical passage
r^*\in\argmax_r V(r)
\mathbb R^2Use in source · 5 passages
Search aliases: R^2 mathbb
Use in source · 02-static-core-transfer-theory.tex, line 397
[Equivalent operations in different coordinates] Let C_1=C_2= R^2, choose S∈ GL_2( R), and set H_12=S, ρ_2(a)=Sρ_1(a)S^-1. Then H_12ρ_1(a) =Sρ_1(a) =ρ_2(a)S =ρ_2(a)H_12. The local matrices can look different while realizing the same abstract operation. This is the elementary model of representation change used throughout the theory.
Exact mathematical passage
C_1=C_2=\mathbb R^2
\mathbb R^3Use in source · 3 passages
Search aliases: R^3 mathbb
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 146
The positive examples use a recurring distributed code. Let c=(c_1,c_2,c_3)^ T∈ R^3 and define three local encodings E_1c=(c_1,c_2), E_2c=(c_2,c_3), E_3c=(c_1,c_3). Then ∑_i=1^3E_i^*E_i=2I_3. No individual encoding is injective, while every two-node coalition is injective. The pairwise frame operators are E_{1,2}^*E_{1,2} · =diag(1,2,1),
Exact mathematical passage
c=(c_1,c_2,c_3)^{\mathsf T}\in\mathbb R^3
\mathbb R^4Use in source · 2 passages
Search aliases: R^4 mathbb
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 484
rcher who maintains goals and semantic direction; item M is a language-model process that constructs local formalizations; item X is an execution and verification process that compiles, tests, or falsifies candidate artifacts; and item A is a persistent artifact store containing exact source, results, and versioned handoff state. Let the abstract research state be c=(g,d,p,v)^ T∈ R^4, where: ll g=goal and acceptance criterion, · d=current derivation or theory state,
Exact mathematical passage
c=(g,d,p,v)^{\mathsf T}\in\mathbb R^4,
\mathbb R^{d_G}Use in source · 1 passage
Search aliases: R^d_G mathbb
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 318
[Cue-controlled goal retention] Let G_s∈ R^d_G obey G_s+1 = R_sG_s+B_sC_s+1+ζ_s+1 (s=t,…,t+τ-1). Consider two intervention runs that set G_t=g, G_t'=g', and then use the same command trajectory and the same disturbance realization. Let R_t+τ:t = R_t+τ-1⋯ R_t. Then G_t+τ-G_t+τ' = R_t+τ:t(g-g'). If m_s ≤ σ_min(R_s), R_s ≤ M_s, then ( ∏_s=t^t+τ-1m_s ) g-g' ≤ G_t+τ-G_t+τ' ≤ ( ∏_s=t^t+τ-1M_s ) g-g' .
Exact mathematical passage
G_s\in\mathbb R^{d_G}
\mathbb R^{d_u}Use in source · 1 passage
Search aliases: R^d_u mathbb
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 452
[Population transfer identification] Let X∈ R^d_u and Y∈ R^d_v satisfy Y=H_*X+ξ, E[ξ X^ T]=0, and assume Σ_XX = E[XX^ T] succeq κ I for some κ>0. Then H_* is the unique minimizer of R(H) = E Y-HX _2^2, with H_* = Σ_YXΣ_XX^-1. Moreover, R(H)- R(H_*) = tr ( (H-H_*)Σ_XX(H-H_*)^ T ) ≥ κ H-H_* _F^2.
Exact mathematical passage
X\in\mathbb R^{d_u}
\mathbb R^{d_v}Use in source · 1 passage
Search aliases: R^d_v mathbb
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 452
[Population transfer identification] Let X∈ R^d_u and Y∈ R^d_v satisfy Y=H_*X+ξ, E[ξ X^ T]=0, and assume Σ_XX = E[XX^ T] succeq κ I for some κ>0. Then H_* is the unique minimizer of R(H) = E Y-HX _2^2, with H_* = Σ_YXΣ_XX^-1. Moreover, R(H)- R(H_*) = tr ( (H-H_*)Σ_XX(H-H_*)^ T ) ≥ κ H-H_* _F^2.
Exact mathematical passage
Y\in\mathbb R^{d_v}
r_{\mathfrak S}Use in source · 6 passages
Search aliases: r_ S mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 222
in J_*, define the specification envelope underline m_q^ S(W) = inf_ς∈ Sm_q(W;ς), overline m_q^ S(W) = sup_ς∈ Sm_q(W;ς). Its sensitivity width is Δ_q^spec(W) = overline m_q^ S(W) - underline m_q^ S(W). The robust certificate margin is r_ S(W) = inf_ς∈ S min_q∈ J_*m_q(W;ς). Then Cert_ S(W)=1 Longleftrightarrow r_ S(W)>0.
Exact mathematical passage
\boxed{ r_{\mathfrak S}(W) = \inf_{\varsigma\in\mathfrak S} \min_{q\in\mathcal J_*}m_q(W;\varsigma). }
R_{\mathcal U}Use in source · 9 passages
Search aliases: R_ U mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 335
Let R_ U:mathscr W(G) ⟶ check C^0( U;mathscr W) be the restriction map R_ U(w) = (w|_G_α)_α∈ A.
Exact mathematical passage
R_{\mathcal U}:\mathscr W(G) \longrightarrow \check C^0(\mathcal U;\mathscr W)
\mathfrak R_+Use in source · 2 passages
Search aliases: R_+ mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 664
mpatible with the experimental law passes every required gate under every admissible specification. The robust certificate is identified as passing. item If overline r_ID, S≤0, then no compatible realization passes the complete certificate throughout the family. The robust certificate is identified as failing. item If there exist compatible realizations R_+, R_- with r_ S( R_+)>0, r_ S( R_-)≤0, then the robust certificate is not identified under the declared experiment.
Exact mathematical passage
\mathfrak R_+,\mathfrak R_-
\mathfrak R_-Use in source · 2 passages
Search aliases: R_- mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 664
mpatible with the experimental law passes every required gate under every admissible specification. The robust certificate is identified as passing. item If overline r_ID, S≤0, then no compatible realization passes the complete certificate throughout the family. The robust certificate is identified as failing. item If there exist compatible realizations R_+, R_- with r_ S( R_+)>0, r_ S( R_-)≤0, then the robust certificate is not identified under the declared experiment.
Exact mathematical passage
\mathfrak R_+,\mathfrak R_-
R_{-i}Use in source · 5 passages
Search aliases: R_-i
Use in source · 01-foundational-thesis.tex, line 243
Let the total realization decompose as R=(X_i,R_-i), where R_-i contains the remaining components and relations. A workspace functional Workspace=f(X_i,R_-i) supervenes on R by construction. If there exist R_-i≠ R_-i' with f(X_i,R_-i)≠ f(X_i,R_-i'), then the same local projection X_i occurs in distinct workspaces. Hence supervenience on the whole is consistent with failure of supervenience on a part.
Exact mathematical passage
\mathfrak R=(X_i,R_{-i})
R_{-i}'Use in source · 2 passages
Search aliases: R_-i'
Use in source · 01-foundational-thesis.tex, line 246
Let the total realization decompose as R=(X_i,R_-i), where R_-i contains the remaining components and relations. A workspace functional Workspace=f(X_i,R_-i) supervenes on R by construction. If there exist R_-i≠ R_-i' with f(X_i,R_-i)≠ f(X_i,R_-i'), then the same local projection X_i occurs in distinct workspaces. Hence supervenience on the whole is consistent with failure of supervenience on a part.
Exact mathematical passage
R_{-i}\neq R_{-i}'
\mathfrak R_0Use in source · 3 passages
Search aliases: R_0 mathfrak
Use in source · 12-identity-through-time-and-replacement.tex, line 560
For a sequence of realizations R_0, R_1,…, R_T, let J_t: R_t→ R_t+1 be admissible correspondences. Define the path length Len( J_0:T) = ∑_t=0^T-1Cost( J_t) and the induced directed path quasi-pseudometric d_path^rightarrow( R_0, R_T) = inf_ J_0:T Len( J_0:T). Concatenation gives the directed triangle inequality. Because replacement costs and intervention divergences need not be symmetric, symmetry is not assumed. When reverse correspondences exist, define the symmetrized pseudometric d_path^sym(…
Exact mathematical passage
\mathfrak R_0,\mathfrak R_1,\ldots,\mathfrak R_T,
\mathfrak R_1Use in source · 1 passage
Search aliases: R_1 mathfrak
Use in source · 12-identity-through-time-and-replacement.tex, line 560
For a sequence of realizations R_0, R_1,…, R_T, let J_t: R_t→ R_t+1 be admissible correspondences. Define the path length Len( J_0:T) = ∑_t=0^T-1Cost( J_t) and the induced directed path quasi-pseudometric d_path^rightarrow( R_0, R_T) = inf_ J_0:T Len( J_0:T). Concatenation gives the directed triangle inequality. Because replacement costs and intervention divergences need not be symmetric, symmetry is not assumed. When reverse correspondences exist, define the symmetrized pseudometric d_path^sym(…
Exact mathematical passage
\mathfrak R_0,\mathfrak R_1,\ldots,\mathfrak R_T,
r_{\mathrm{dec}}Use in source · 2 passages
Search aliases: r_dec mathrm
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 543
When b_q≡0, a convenient certificate radius is r_dec(W) = min_q:L_q>0 fracm_q(W; D_0)L_q. Every admissible family satisfying sup_ D∈ Dδ_ D < r_dec(W) preserves the sign of all required gate margins. In applications, the transport terms can be bounded using earlier results: small textwidth@>bfseriesraggedrightarraybackslashp0.22textwidth>raggedrightarraybackslashX@ Gate family · Relevant transport control
Exact mathematical passage
\boxed{ r_{\mathrm{dec}}(W) = \min_{q:L_q>0} \frac{m_q(W;\mathcal D_0)}{L_q}. }
R_{i_m}Use in source · 1 passage
Search aliases: R_i_m
Use in source · 04-approximate-workspaces.tex, line 743
For every step, T_rι_i_r-1^C = ι_i_r^CH_r+ ι_i_r^RV_r. Telescope the sequence T_m⋯ T_r+1ι_i_r^C H_r⋯ H_1, r=0,1,…,m. The difference between consecutive terms is exactly the r-th summand in the displayed formula. Projection onto R_i_m or C_i_m, followed by submultiplicativity of the operator norm, gives the two bounds.
Exact mathematical passage
R_{i_m}
r_J^KUse in source · 1 passage
Search aliases: r_J^K
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 77
If K⊆ L⊆ G are subgraphs, coordinate restriction gives ρ_K^L: C_V(L)⟶ C_V(K). Because every edge equation on K is also an edge equation on L, restriction maps exact sections to exact sections: r_K^L := ρ_K^L|_mathscr W(L): mathscr W(L)⟶mathscr W(K). They obey r_L^L=I, r_J^K r_K^L=r_J^L whenever J⊆ K⊆ L. Thus K↦mathscr W(K) is a contravariant system of local workspaces.
Exact mathematical passage
r_L^L=I, \qquad r_J^K r_K^L=r_J^L
r_J^LUse in source · 1 passage
Search aliases: r_J^L
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 77
If K⊆ L⊆ G are subgraphs, coordinate restriction gives ρ_K^L: C_V(L)⟶ C_V(K). Because every edge equation on K is also an edge equation on L, restriction maps exact sections to exact sections: r_K^L := ρ_K^L|_mathscr W(L): mathscr W(L)⟶mathscr W(K). They obey r_L^L=I, r_J^K r_K^L=r_J^L whenever J⊆ K⊆ L. Thus K↦mathscr W(K) is a contravariant system of local workspaces.
Exact mathematical passage
r_L^L=I, \qquad r_J^K r_K^L=r_J^L
r_K^LUse in source · 2 passages
Search aliases: r_K^L
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 70
If K⊆ L⊆ G are subgraphs, coordinate restriction gives ρ_K^L: C_V(L)⟶ C_V(K). Because every edge equation on K is also an edge equation on L, restriction maps exact sections to exact sections: r_K^L := ρ_K^L|_mathscr W(L): mathscr W(L)⟶mathscr W(K). They obey r_L^L=I, r_J^K r_K^L=r_J^L whenever J⊆ K⊆ L. Thus K↦mathscr W(K) is a contravariant system of local workspaces.
Exact mathematical passage
r_K^L := \rho_K^L|_{\mathscr W(L)}: \mathscr W(L)\longrightarrow\mathscr W(K).
r_L^LUse in source · 1 passage
Search aliases: r_L^L
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 77
If K⊆ L⊆ G are subgraphs, coordinate restriction gives ρ_K^L: C_V(L)⟶ C_V(K). Because every edge equation on K is also an edge equation on L, restriction maps exact sections to exact sections: r_K^L := ρ_K^L|_mathscr W(L): mathscr W(L)⟶mathscr W(K). They obey r_L^L=I, r_J^K r_K^L=r_J^L whenever J⊆ K⊆ L. Thus K↦mathscr W(K) is a contravariant system of local workspaces.
Exact mathematical passage
r_L^L=I, \qquad r_J^K r_K^L=r_J^L
\mathcal R_q^{\Sigma}Use in source · 2 passages
Search aliases: R_q^Σ mathcal Sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 89
For any component q of widehatθ, define its scaffold-only Bayes risk under loss ℓ_q by R_q^Σ = inf_f E [ ℓ_q(q,f(Σ,Ω)) ]. Define the full formation risk by R_q^Σ, H = inf_g E [ ℓ_q(q,g(Σ, D_form,Ω)) ]. The history advantage is Δ_q^hist = R_q^Σ - R_q^Σ, H. A positive history advantage means that formation history contains information about q that is not already recoverable from the declared scaffold and random seed.
Exact mathematical passage
\mathcal R_q^{\Sigma} = \inf_f \mathbb E \left[ \ell_q\bigl(q,f(\Sigma,\Omega)\bigr) \right].
\mathcal R_q^{\Sigma,\mathcal H}Use in source · 2 passages
Search aliases: R_q^Σ, H mathcal Sigma mathcal
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 99
For any component q of widehatθ, define its scaffold-only Bayes risk under loss ℓ_q by R_q^Σ = inf_f E [ ℓ_q(q,f(Σ,Ω)) ]. Define the full formation risk by R_q^Σ, H = inf_g E [ ℓ_q(q,g(Σ, D_form,Ω)) ]. The history advantage is Δ_q^hist = R_q^Σ - R_q^Σ, H. A positive history advantage means that formation history contains information about q that is not already recoverable from the declared scaffold and random seed.
Exact mathematical passage
\mathcal R_q^{\Sigma,\mathcal H} = \inf_g \mathbb E \left[ \ell_q\bigl(q,g(\Sigma,\mathcal D_{\mathrm{form}},\Omega)\bigr) \right].
\mathcal R_rUse in source · 3 passages
Search aliases: R_r mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1049
[Approximate hierarchical collapse bound] Let F_r: H_r→ H_r+1, widetilde F_r: H_r→ H_r+1 be exact and implemented level-collapse maps for r=0,…,R-1. Let R_r⊆ H_r contain the exact and implemented states reachable at level r. Assume, on R_r, F_r(x)-F_r(y) ≤ L_r x-y and sup_x∈ R_r widetilde F_r(x)-F_r(x) ≤ δ_r. Then · widetilde F_R-1∘⋯∘widetilde F_0(x) - F_R-1∘⋯∘ F_0(x)
Exact mathematical passage
\mathcal R_r\subseteq\mathcal H_r
R_SUse in source · 4 passages
Search aliases: R_S
Use in source · 11-reconstruction-and-resilience.tex, line 69
[Coalition reconstruction criterion] For a coalition S, the following are equivalent: item A_S is injective; item F_S is positive definite; item α_S>0; item there exists a linear decoder R_S with R_SA_S=I_C_*. When these conditions hold, the canonical decoder is R_S=A_S^†=F_S^-1A_S^*.
Exact mathematical passage
R_S
R_sUse in source · 5 passages
Search aliases: R_s
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 319
[Cue-controlled goal retention] Let G_s∈ R^d_G obey G_s+1 = R_sG_s+B_sC_s+1+ζ_s+1 (s=t,…,t+τ-1). Consider two intervention runs that set G_t=g, G_t'=g', and then use the same command trajectory and the same disturbance realization. Let R_t+τ:t = R_t+τ-1⋯ R_t. Then G_t+τ-G_t+τ' = R_t+τ:t(g-g'). If m_s ≤ σ_min(R_s), R_s ≤ M_s, then ( ∏_s=t^t+τ-1m_s ) g-g' ≤ G_t+τ-G_t+τ' ≤ ( ∏_s=t^t+τ-1M_s ) g-g' .
Exact mathematical passage
G_{s+1} = R_sG_s+B_sC_{s+1}+\zeta_{s+1} \qquad (s=t,\ldots,t+\tau-1).
R_{s(e)}Use in source · 2 passages
Search aliases: R_s(e)
Use in source · 02-static-core-transfer-theory.tex, line 157
V_e · K_e , where H_e=P_t(e)T_eP_s(e):C_s(e)→ C_t(e), U_e=P_t(e)T_eQ_s(e):R_s(e)→ C_t(e), V_e=Q_t(e)T_eP_s(e):C_s(e)→ R_t(e), K_e=Q_t(e)T_eQ_s(e):R_s(e)→ R_t(e).
Exact mathematical passage
U_e=P_{t(e)}T_eQ_{s(e)}:R_{s(e)}\to C_{t(e)},
r_{\mathrm{spec}}Use in source · 3 passages
Search aliases: r_spec mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 281
For a reference specification ς_0, define the distance to certificate failure by r_spec(W;ς_0) = inf{ d_ S(ς,ς_0): min_q m_q(W;ς)≤0 }. If no failing specification exists in the declared universe, the radius is infinite relative to that universe. A radius near zero means that a small scientifically defensible change can reverse the conclusion.
Exact mathematical passage
\boxed{ r_{\mathrm{spec}}(W;\varsigma_0) = \inf\left\{ d_{\mathfrak S}(\varsigma,\varsigma_0): \min_q m_q(W;\varsigma)\leq0 \right\}. }
\mathfrak R_TUse in source · 2 passages
Search aliases: R_T mathfrak
Use in source · 12-identity-through-time-and-replacement.tex, line 560
For a sequence of realizations R_0, R_1,…, R_T, let J_t: R_t→ R_t+1 be admissible correspondences. Define the path length Len( J_0:T) = ∑_t=0^T-1Cost( J_t) and the induced directed path quasi-pseudometric d_path^rightarrow( R_0, R_T) = inf_ J_0:T Len( J_0:T). Concatenation gives the directed triangle inequality. Because replacement costs and intervention divergences need not be symmetric, symmetry is not assumed. When reverse correspondences exist, define the symmetrized pseudometric d_path^sym(…
Exact mathematical passage
\mathfrak R_0,\mathfrak R_1,\ldots,\mathfrak R_T,
\mathfrak R_tUse in source · 3 passages
Search aliases: R_t mathfrak
Use in source · 01-foundational-thesis.tex, line 327
Persistence does not require token identity. Let R_t and R_t+1 be temporally successive realizations. Continuity is possible when there exists an admissible transport J_t: R_trightsquigarrow R_t+1 that preserves the operative core and its causal role within tolerance: d_id(Workspace_t,Workspace_t+1)≤ε. Thus a workspace may persist by reconstruction rather than by retaining an unchanged physical inscription.
Exact mathematical passage
\mathfrak R_t
r_tUse in source · 6 passages
Search aliases: r_t
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 851
After a possible damage event, let the pre-repair health be h_t^-∈{0,1}. The system chooses a joint action u_t=(a_t,r_t)∈{0,1}^2, where a_t is a task action and r_t is a repair action. Define the optimal task action a_t^*=g_t⊕ b_t⊕ h_t^- and optimal repair action r_t^*=1-h_t^-. No individual node determines the full pair (a_t^*,r_t^*): item the planner lacks h_t^-; item the monitor lacks g_t; and item the recorder lacks b_t. Every two-node coalition determines all three workspace bits and theref…
Exact mathematical passage
u_t=(a_t,r_t)\in\{0,1\}^2,
R_{t(e)}Use in source · 2 passages
Search aliases: R_t(e)
Use in source · 02-static-core-transfer-theory.tex, line 160
V_e · K_e , where H_e=P_t(e)T_eP_s(e):C_s(e)→ C_t(e), U_e=P_t(e)T_eQ_s(e):R_s(e)→ C_t(e), V_e=Q_t(e)T_eP_s(e):C_s(e)→ R_t(e), K_e=Q_t(e)T_eQ_s(e):R_s(e)→ R_t(e).
Exact mathematical passage
V_e=Q_{t(e)}T_eP_{s(e)}:C_{s(e)}\to R_{t(e)},
\mathfrak R_{t+1}Use in source · 3 passages
Search aliases: R_t+1 mathfrak
Use in source · 01-foundational-thesis.tex, line 328
Persistence does not require token identity. Let R_t and R_t+1 be temporally successive realizations. Continuity is possible when there exists an admissible transport J_t: R_trightsquigarrow R_t+1 that preserves the operative core and its causal role within tolerance: d_id(Workspace_t,Workspace_t+1)≤ε. Thus a workspace may persist by reconstruction rather than by retaining an unchanged physical inscription.
Exact mathematical passage
\mathfrak R_{t+1}
R_{t+\tau-1}Use in source · 1 passage
Search aliases: R_t+τ-1 tau
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 334
[Cue-controlled goal retention] Let G_s∈ R^d_G obey G_s+1 = R_sG_s+B_sC_s+1+ζ_s+1 (s=t,…,t+τ-1). Consider two intervention runs that set G_t=g, G_t'=g', and then use the same command trajectory and the same disturbance realization. Let R_t+τ:t = R_t+τ-1⋯ R_t. Then G_t+τ-G_t+τ' = R_t+τ:t(g-g'). If m_s ≤ σ_min(R_s), R_s ≤ M_s, then ( ∏_s=t^t+τ-1m_s ) g-g' ≤ G_t+τ-G_t+τ' ≤ ( ∏_s=t^t+τ-1M_s ) g-g' .
Exact mathematical passage
R_{t+\tau:t} = R_{t+\tau-1}\cdots R_t.
R_{t+\tau:t}Use in source · 4 passages
Search aliases: R_t+τ:t tau
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 334
[Cue-controlled goal retention] Let G_s∈ R^d_G obey G_s+1 = R_sG_s+B_sC_s+1+ζ_s+1 (s=t,…,t+τ-1). Consider two intervention runs that set G_t=g, G_t'=g', and then use the same command trajectory and the same disturbance realization. Let R_t+τ:t = R_t+τ-1⋯ R_t. Then G_t+τ-G_t+τ' = R_t+τ:t(g-g'). If m_s ≤ σ_min(R_s), R_s ≤ M_s, then ( ∏_s=t^t+τ-1m_s ) g-g' ≤ G_t+τ-G_t+τ' ≤ ( ∏_s=t^t+τ-1M_s ) g-g' .
Exact mathematical passage
R_{t+\tau:t} = R_{t+\tau-1}\cdots R_t.
r_t^*Use in source · 2 passages
Search aliases: r_t^*
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 860
After a possible damage event, let the pre-repair health be h_t^-∈{0,1}. The system chooses a joint action u_t=(a_t,r_t)∈{0,1}^2, where a_t is a task action and r_t is a repair action. Define the optimal task action a_t^*=g_t⊕ b_t⊕ h_t^- and optimal repair action r_t^*=1-h_t^-. No individual node determines the full pair (a_t^*,r_t^*): item the planner lacks h_t^-; item the monitor lacks g_t; and item the recorder lacks b_t. Every two-node coalition determines all three workspace bits and theref…
Exact mathematical passage
r_t^*=1-h_t^-.
\mathfrak R_{\mathrm{total}}Use in source · 1 passage
Search aliases: R_total mathfrak mathrm
Use in source · 01-foundational-thesis.tex, line 349
The claim that the workspace is not identical with either participant does not imply that it occupies a separate nonphysical location. Formally, Workspace is an invariant of R, not an additional term appended to the physical realization: R_total eq( R,ghost workspace). The phrase ``between the participants'' is therefore topological or relational: it refers to the organization of maps, cycles, artifacts, and causal dependencies.
Exact mathematical passage
\mathfrak R_{\mathrm{total}} eq(\mathfrak R,\text{ghost workspace}).
r_{\alpha_0\cdots\alpha_{p+1}}^{\alpha_0\cdots\widehat{\alpha_j}\cdots\alpha_{p+1}}Use in source · 1 passage
Search aliases: r_α_0⋯α_p+1^α_0⋯widehatα_j⋯α_p+1 alpha cdots alpha alpha cdots widehat alpha cdots alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 138
For p≥0, define the finite cochain space check C^p( U;mathscr W) = ⊕_α_0<⋯<α_p mathscr W(G_α_0⋯α_p), where empty intersections contribute the zero space. The coboundary δ^p:check C^p⟶check C^p+1 is (δ^p s)_α_0⋯α_p+1 = ∑_j=0^p+1(-1)^j r_α_0⋯α_p+1^% α_0⋯widehatα_j⋯α_p+1 % s_α_0⋯widehatα_j⋯α_p+1. The restriction identities imply δ^p+1δ^p=0. For a local family w=(w_α)_α, (δ^0w)_αβ = r_αβ^βw_β - r_αβ^αw_α. Thus δ^0 is the overlap-discrepancy operator at the level of exact local workspaces.
Exact mathematical passage
\boxed{ (\delta^p s)_{\alpha_0\cdots\alpha_{p+1}} = \sum_{j=0}^{p+1}(-1)^j r_{\alpha_0\cdots\alpha_{p+1}}^% {\alpha_0\cdots\widehat{\alpha_j}\cdots\alpha_{p+1}} % s_{\alpha_0\cdots\widehat{\alpha_j}\cdots\alpha_{p+1}}. }
r_{\alpha\beta}^{\alpha}Use in source · 5 passages
Search aliases: r_αβ^α alpha beta alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 105
For pairwise overlaps write mathscr W_α=mathscr W(G_α), mathscr W_αβ=mathscr W(G_αβ), and r_αβ^α: mathscr W_α→mathscr W_αβ, r_αβ^β: mathscr W_β→mathscr W_αβ. The interface is therefore a cospan mathscr W_α xrightarrow r_αβ^α mathscr W_αβ xleftarrow r_αβ^β mathscr W_β, not necessarily a direct transfer map from one complete local workspace to the other. Both charts are compared through the content they expose on their common domain.
Exact mathematical passage
r_{\alpha\beta}^{\alpha}: \mathscr W_\alpha\to\mathscr W_{\alpha\beta}, \qquad r_{\alpha\beta}^{\beta}: \mathscr W_\beta\to\mathscr W_{\alpha\beta}.
r_{\alpha\beta}^{\beta}Use in source · 5 passages
Search aliases: r_αβ^β alpha beta beta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 105
For pairwise overlaps write mathscr W_α=mathscr W(G_α), mathscr W_αβ=mathscr W(G_αβ), and r_αβ^α: mathscr W_α→mathscr W_αβ, r_αβ^β: mathscr W_β→mathscr W_αβ. The interface is therefore a cospan mathscr W_α xrightarrow r_αβ^α mathscr W_αβ xleftarrow r_αβ^β mathscr W_β, not necessarily a direct transfer map from one complete local workspace to the other. Both charts are compared through the content they expose on their common domain.
Exact mathematical passage
r_{\alpha\beta}^{\alpha}: \mathscr W_\alpha\to\mathscr W_{\alpha\beta}, \qquad r_{\alpha\beta}^{\beta}: \mathscr W_\beta\to\mathscr W_{\alpha\beta}.
R_\thetaUse in source · 2 passages
Search aliases: R_θ theta
Use in source · 03-exact-shared-cores.tex, line 315
[Local compatibility without a global nonzero core] Let the only nontrivial cycle holonomy on R^2 be a rotation R_θ= cosθ · -sinθ sinθ · cosθ with θ∉2π Z. Then ker(R_θ-I)={0}. Every edge map is individually invertible and well-defined, yet the complete cycle admits no nonzero exact shared core. Pairwise translatability is therefore insufficient for global path independence.
Exact mathematical passage
R_\theta= \begin{pmatrix} \cos\theta&-\sin\theta\\ \sin\theta&\cos\theta \end{pmatrix}
\mathfrak R_\lambdaUse in source · 1 passage
Search aliases: R_λ mathfrak lambda
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 40
For a one-parameter family R_λ, define λ_str · = inf{λ: d_ε(λ)>0, g_ε(λ)>0},
Exact mathematical passage
\mathfrak R_\lambda
R_\perpUse in source · 2 passages
Search aliases: R_⊥ perp
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 777
Define the detection effect η_D→ M, mediation effect η_M→ R, restoration effect η_R→ v, and repair specificity Δ_repair^spec = η_R→ v - η_R_⊥→ v, where R_⊥ is a matched action outside the proposed repair channel.
Exact mathematical passage
\Delta_{\mathrm{repair}}^{\mathrm{spec}} = \eta_{R\to v} - \eta_{R_\perp\to v},
\operatorname{ran}Use in source · 2 passages
Search aliases: ran operatorname
Use in source · 03-exact-shared-cores.tex, line 278
For every g∈Hol_o, left multiplication permutes the group elements, so gP_*=P_*. Thus ranP_*⊆ C_*. If x∈ C_*, then P_*x=x, so C_*⊆ranP_*. Unitarity gives P_*^*=P_*, and the range characterization implies P_*^2=P_*.
Exact mathematical passage
\operatorname{ran}P_*\subseteq C_*
\operatorname{rank}Use in source · 5 passages
Search aliases: rank operatorname
Use in source · 03-exact-shared-cores.tex, line 251
H_γ_r-I . Then C_*=ker M, d_Workspace=d-rank( M).
Exact mathematical passage
\boxed{ C_*=\ker\mathcal M, \qquad d_{\Workspace}=d-\operatorname{rank}(\mathcal M). }
\RecUse in source · 2 passages
Search aliases: Rec
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 159
Report d_id(W_t,W_t+τ), Rec_k, e_t, α^(k), μ_t^keep. The report must separate: item subspace tracking from state tracking; item coherence from non-collapse; item reconstruction from mere prediction; item repair from successor-workspace creation; and item structural replacement from causal and reconstructive replacement.
Exact mathematical passage
d_{\mathrm{id}}(W_t,W_{t+\tau}), \qquad \Rec_k, \qquad e_t, \qquad \alpha^{(k)}, \qquad \mu_t^{\mathrm{keep}}.
\mathrm{rec}Use in source · 19 passages
Search aliases: rec mathrm
Use in source · 08-causal-efficacy-and-reentry.tex, line 193
Temporal correlation is weaker than causal recurrence. Define the total workspace recurrence effect at lag τ by η_rec(τ) = E_(w,w',b)∼ν D ( P^ι_w(W_t+τ∈·mid B_t=b), P^ι_w'(W_t+τ∈·mid B_t=b) ). A nonzero value shows that manipulating the present workspace changes a later workspace state. It may, however, be explained by direct copying or a retained memory register.
Exact mathematical passage
\boxed{ \eta_{\mathrm{rec}}(\tau) = \mathbb E_{(w,w',b)\sim\nu} D\!\left( \mathbb P^{\iota_w}(W_{t+\tau}\in\cdot\mid B_t=b), \mathbb P^{\iota_{w'}}(W_{t+\tau}\in\cdot\mid B_t=b) \right). }
\Rec_kUse in source · 2 passages
Search aliases: Rec_k Rec
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 159
Report d_id(W_t,W_t+τ), Rec_k, e_t, α^(k), μ_t^keep. The report must separate: item subspace tracking from state tracking; item coherence from non-collapse; item reconstruction from mere prediction; item repair from successor-workspace creation; and item structural replacement from causal and reconstructive replacement.
Exact mathematical passage
d_{\mathrm{id}}(W_t,W_{t+\tau}), \qquad \Rec_k, \qquad e_t, \qquad \alpha^{(k)}, \qquad \mu_t^{\mathrm{keep}}.
\mathsf{reference}Use in source · 1 passage
Search aliases: reference mathsf
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1051
The machine-readable record should include: SpecificationRecord ={ · reference, family, equivalence_classes, metric, · targets, losses, horizons, interventions, · null_panels, thresholds, selection_history, · identified_sets, uniform_bounds, gate_envelopes }. Every omitted family member requires a reason. Every changed specification requires a data-split label and time stamp. Every gate requires pointwise and family-wide status.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{SpecificationRecord} =\{& \mathsf{reference}, \mathsf{family}, \mathsf{equivalence\_classes}, \mathsf{metric},\\ &\mathsf{targets}, \mathsf{losses}, \mathsf{horizons}, \mathsf{interventions},\\ &\mathsf{null\_panels}, \mathsf{thresholds}, \mathsf{selection\_history},\\ &\mathsf{identified\_sets}, \mathsf{uniform\_bounds}, \mathsf{gate\_envelopes} \}. \end{aligned} }
\operatorname{Reg}Use in source · 4 passages
Search aliases: Reg operatorname
Use in source · 19-summary-of-main-results.tex, line 455
If the interventional action-value estimator satisfies sup_a|widehat Q_t(a)-Q_t(a)|≤ε_Q and the implemented policy has optimization error at most δ_opt relative to widehat Q_t, then Reg_t(widehatπ_t) ≤ 2ε_Q+δ_opt. For deterministic greedy action, the bound is 2ε_Q. A unique true optimum with value gap greater than 2ε_Q is recovered exactly. The guarantee is relative to the declared utility, feasible action support, causal identification, and horizon.
Exact mathematical passage
\boxed{ \operatorname{Reg}_t(\widehat\pi_t) \leq 2\varepsilon_Q+\delta_{\mathrm{opt}}. }
\operatorname{Reg}_tUse in source · 3 passages
Search aliases: Reg_t operatorname
Use in source · 19-summary-of-main-results.tex, line 455
If the interventional action-value estimator satisfies sup_a|widehat Q_t(a)-Q_t(a)|≤ε_Q and the implemented policy has optimization error at most δ_opt relative to widehat Q_t, then Reg_t(widehatπ_t) ≤ 2ε_Q+δ_opt. For deterministic greedy action, the bound is 2ε_Q. A unique true optimum with value gap greater than 2ε_Q is recovered exactly. The guarantee is relative to the declared utility, feasible action support, causal identification, and horizon.
Exact mathematical passage
\boxed{ \operatorname{Reg}_t(\widehat\pi_t) \leq 2\varepsilon_Q+\delta_{\mathrm{opt}}. }
\mathrm{rel}Use in source · 2 passages
Search aliases: rel mathrm
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 41
For a one-parameter family R_λ, define λ_str · = inf{λ: d_ε(λ)>0, g_ε(λ)>0}, λ_op · = inf{λ: δ_align(λ) ≤ε_op}, λ_causal · = inf{λ: η_causal(λ) ≥τ_causal}, λ_rel · = inf{λ: k_ε(λ)≥2, Δ_tr(λ) ≥τ_tr}, λ_form · = inf{λ: Form_Θ_form (W_λ)=1}. In general, λ_str, λ_op, λ_causal, λ_rel, λ_form can be distinct. A synchronized representation can appear before it becomes causally useful, and causal coordination can appear while remaining reducible to one centralized component.
Exact mathematical passage
\begin{aligned} \lambda_{\mathrm{str}} &= \inf\{\lambda: d_{\varepsilon}(\lambda)>0, g_{\varepsilon}(\lambda)>0\},\\ \lambda_{\mathrm{op}} &= \inf\{\lambda: \delta_{\mathrm{align}}(\lambda) \leq\varepsilon_{\mathrm{op}}\},\\ \lambda_{\mathrm{causal}} &= \inf\{\lambda: \eta_{\mathrm{causal}}(\lambda) \geq\tau_{\mathrm{causal}}\},\\ \lambda_{\mathrm{rel}} &= \inf\{\lambda: k_\varepsilon(\lambda)\geq2, \Delta_{\mathrm{tr}}(\lambda) \geq\tau_{\mathrm{tr}}\},\\ \lambda_{\mathrm{form}} &= \inf\{\lambda: \operatorname{Form}_{\Theta_{\mathrm{form}}} (W_\lambda)=1\}. \end{aligned}
\mathrm{rep-id}Use in source · 5 passages
Search aliases: rep-id mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 850
Restoration of performance is not automatically restoration of identity. Let W_t^- be the last certified pre-damage workspace and let W_t+τ^r be the post-repair workspace. Define the repair identity defect δ_rep-id(r) = d_id ( W_t^-,W_t+τ^r ). A repair action is identity preserving at tolerance ε_id when Δ_t^rep(r;d)>0, δ_rep-id(r) ≤ ε_id. When integrity is restored but the identity defect exceeds tolerance, the result is better described as a successor or replacement workspace. This terminologi…
Exact mathematical passage
\delta_{\mathrm{rep-id}}(r) = d_{\mathrm{id}} \left( W_{t^-},W_{t+\tau}^{r} \right).
\operatorname{RepairAction}Use in source · 1 passage
Search aliases: RepairAction operatorname
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 258
Let B_t^sys be an internal membership or routing state used by the system, and let S_t^* = argmax_S∈ S_pass B_t(S) be the population boundary defined by the external certification protocol. The strong endogenous boundary conjecture asserts that there are adaptive systems and nontrivial environments for which: · d_B(B_t^sys,S_t^*)→0, · Form_Θ_form(W_B_t^sys)=1, · CE ( B_t^sys→ Routing_t+1 )>0, · CE ( BoundaryDamage_t→ RepairAction_t+1 )>0, while the scaffold contains no direct encoding of S_t^*.
Exact mathematical passage
\boxed{ \begin{aligned} &d_B(B_t^{\mathrm{sys}},S_t^*)\to0,\\ &\operatorname{Form}_{\Theta_{\mathrm{form}}}(W_{B_t^{\mathrm{sys}}})=1,\\ &\operatorname{CE} \left( B_t^{\mathrm{sys}}\to \operatorname{Routing}_{t+1} \right)>0,\\ &\operatorname{CE} \left( \operatorname{BoundaryDamage}_t\to \operatorname{RepairAction}_{t+1} \right)>0, \end{aligned} }
\operatorname{RepairAction}_{t+1}Use in source · 1 passage
Search aliases: RepairAction_t+1 operatorname
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 258
Let B_t^sys be an internal membership or routing state used by the system, and let S_t^* = argmax_S∈ S_pass B_t(S) be the population boundary defined by the external certification protocol. The strong endogenous boundary conjecture asserts that there are adaptive systems and nontrivial environments for which: · d_B(B_t^sys,S_t^*)→0, · Form_Θ_form(W_B_t^sys)=1, · CE ( B_t^sys→ Routing_t+1 )>0, · CE ( BoundaryDamage_t→ RepairAction_t+1 )>0, while the scaffold contains no direct encoding of S_t^*.
Exact mathematical passage
\boxed{ \begin{aligned} &d_B(B_t^{\mathrm{sys}},S_t^*)\to0,\\ &\operatorname{Form}_{\Theta_{\mathrm{form}}}(W_{B_t^{\mathrm{sys}}})=1,\\ &\operatorname{CE} \left( B_t^{\mathrm{sys}}\to \operatorname{Routing}_{t+1} \right)>0,\\ &\operatorname{CE} \left( \operatorname{BoundaryDamage}_t\to \operatorname{RepairAction}_{t+1} \right)>0, \end{aligned} }
\mathrm{replacement}Use in source · 1 passage
Search aliases: replacement mathrm
Use in source · 19-summary-of-main-results.tex, line 324
operation leakage. Coalition frame bounds also persist under sufficiently small reconstructive transport error. With declared causal-kernel and reconstructive-handoff defects, d_id ≤ a q_str +b δ_op +c δ_causal +d δ_rec. Under bounded norms and a uniform spectral gap, this gives the schematic estimate d_id lesssim Cfracδ_replacementg. The causal and reconstructive terms are necessary assumptions rather than consequences of structural similarity.
Exact mathematical passage
d_{\mathrm{id}} \lesssim C\frac{\delta_{\mathrm{replacement}}}{g}.
\operatorname{Res}Use in source · 1 passage
Search aliases: Res operatorname
Use in source · 23-relation-to-prior-work.tex, line 65
mined by mathematical and operational equivalence, not by terminology. Let C be a claim in the paper and S a prior source. Write Spreccurlyeq C when the main content of C follows from S after admissible relabeling, restriction, or direct specialization. A substantive novelty residual exists only when the claim contains content not absorbed by the closure of known sources: Res(C) = C∖ Cl ( ⋃_S∈ LS ). This is a conceptual audit device rather than a set-theoretic definition of ideas. Its purpose is…
Exact mathematical passage
\operatorname{Res}(C) = C\setminus \operatorname{Cl} \left( \bigcup_{S\in\mathcal L}S \right).
\mathsf{ResultRecord}Use in source · 1 passage
Search aliases: ResultRecord mathsf
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 660
The machine-readable record should contain at least the following top-level objects: ResultRecord ={ · claim, specification, specification_family, decomposition, data_splits, formation, · workspace_extractor, goals, actions, interventions, · nulls, gates, identified_sets, specification_envelopes, uncertainty, failures, artifacts }. Each gate object records its symbol, estimator, direction, threshold, point estimate, interval, split, seed set, status, and artifact reference. Each intervention and…
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{ResultRecord} =\{& \mathsf{claim}, \mathsf{specification}, \mathsf{specification\_family}, \mathsf{decomposition}, \mathsf{data\_splits}, \mathsf{formation},\\ &\mathsf{workspace\_extractor}, \mathsf{goals}, \mathsf{actions}, \mathsf{interventions},\\ &\mathsf{nulls}, \mathsf{gates}, \mathsf{identified\_sets}, \mathsf{specification\_envelopes}, \mathsf{uncertainty}, \mathsf{failures}, \mathsf{artifacts} \}. \end{aligned} }
\RetUse in source · 2 passages
Search aliases: Ret
Use in source · 15-boundary-formation-and-stability.tex, line 47
For S∈ S, define Ret_τ(S) = I ( X_S(t+τ);X_S(t) mid X_bar S(t),E_t ), Dep_τ(S) = I ( X_S(t+τ);X_bar S(t) mid X_S(t),E_t ), Out_τ(S) = I ( X_bar S(t+τ);X_S(t) mid X_bar S(t),E_t ). These quantities are observational. They can be nonzero because of common causes, selection, or feedback paths and therefore cannot alone establish a causal boundary.
Exact mathematical passage
\Ret_\tau(S) = I\!\left( X_S(t+\tau);X_S(t) \mid X_{\bar S}(t),E_t \right),
\Ret_\tauUse in source · 2 passages
Search aliases: Ret_τ Ret tau
Use in source · 15-boundary-formation-and-stability.tex, line 47
For S∈ S, define Ret_τ(S) = I ( X_S(t+τ);X_S(t) mid X_bar S(t),E_t ), Dep_τ(S) = I ( X_S(t+τ);X_bar S(t) mid X_S(t),E_t ), Out_τ(S) = I ( X_bar S(t+τ);X_S(t) mid X_bar S(t),E_t ). These quantities are observational. They can be nonzero because of common causes, selection, or feedback paths and therefore cannot alone establish a causal boundary.
Exact mathematical passage
\Ret_\tau(S) = I\!\left( X_S(t+\tau);X_S(t) \mid X_{\bar S}(t),E_t \right),
\rightarrowUse in source · 2 passages
Search aliases: rightarrow
Use in source · 12-identity-through-time-and-replacement.tex, line 571
For a sequence of realizations R_0, R_1,…, R_T, let J_t: R_t→ R_t+1 be admissible correspondences. Define the path length Len( J_0:T) = ∑_t=0^T-1Cost( J_t) and the induced directed path quasi-pseudometric d_path^rightarrow( R_0, R_T) = inf_ J_0:T Len( J_0:T). Concatenation gives the directed triangle inequality. Because replacement costs and intervention divergences need not be symmetric, symmetry is not assumed. When reverse correspondences exist, define the symmetrized pseudometric d_path^sym(…
Exact mathematical passage
\boxed{ d_{\mathrm{path}}^{\rightarrow}(\mathfrak R_0,\mathfrak R_T) = \inf_{\mathfrak J_{0:T}} \operatorname{Len}(\mathfrak J_{0:T}). }
\rightrightarrowsUse in source · 2 passages
Search aliases: rightrightarrows
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 361
[Exact workspace gluing] For every finite edge-complete workspace cover U, the sequence 0 ⟶ mathscr W(G) xrightarrow R_ U check C^0( U;mathscr W) xrightarrow δ^0 check C^1( U;mathscr W) is exact. Equivalently, mathscr W(G) ≅ kerδ^0 ≅ Eq ( ∏_αmathscr W_α rightrightarrows ∏_α<βmathscr W_αβ ). Every pairwise compatible family of exact local workspace states therefore glues to a unique exact global workspace state.
Exact mathematical passage
\boxed{ \mathscr W(G) \cong \ker\delta^0 \cong \operatorname{Eq} \left( \prod_\alpha\mathscr W_\alpha \rightrightarrows \prod_{\alpha<\beta}\mathscr W_{\alpha\beta} \right). }
\rightsquigarrowUse in source · 1 passage
Search aliases: rightsquigarrow
Use in source · 01-foundational-thesis.tex, line 330
Persistence does not require token identity. Let R_t and R_t+1 be temporally successive realizations. Continuity is possible when there exists an admissible transport J_t: R_trightsquigarrow R_t+1 that preserves the operative core and its causal role within tolerance: d_id(Workspace_t,Workspace_t+1)≤ε. Thus a workspace may persist by reconstruction rather than by retaining an unchanged physical inscription.
Exact mathematical passage
J_t:\mathfrak R_t\rightsquigarrow\mathfrak R_{t+1}
\Risk_{\mathcal D}Use in source · 2 passages
Search aliases: Risk_ D Risk mathcal
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 244
The structural core can be preserved by faithful coarse-graining, while coalition counts generally are not. Let mathscr F_S^ D = bigvee_i∈ Smathscr F_i^ D be the information available to coalition S under decomposition D. For a declared loss ℓ, write Risk_ D(S) = inf_f E [ ℓ(Y^+,f(mathscr F_S^ D)) ].
Exact mathematical passage
\Risk_{\mathcal D}(S) = \inf_f \mathbb E\!\left[ \ell\bigl(Y^+,f(\mathscr F_S^{\mathcal D})\bigr) \right].
\Risk_{\mathcal D_c}Use in source · 3 passages
Search aliases: Risk_ D_c Risk mathcal
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 258
[Bayes-risk transport under faithful aggregation] Suppose D_fpreceq D_c through q:V_f→ V_c, and suppose the aggregation is information faithful. Then for every coarse coalition S⊆ V_c, Risk_ D_c(S) = Risk_ D_f(q^-1(S)). Consequently, k_ε( D_c) ≤ k_ε( D_f), where coalition size is counted in displayed nodes.
Exact mathematical passage
\boxed{ \Risk_{\mathcal D_c}(S) = \Risk_{\mathcal D_f}\bigl(q^{-1}(S)\bigr). }
\Risk_{\mathcal D_f}Use in source · 3 passages
Search aliases: Risk_ D_f Risk mathcal
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 258
[Bayes-risk transport under faithful aggregation] Suppose D_fpreceq D_c through q:V_f→ V_c, and suppose the aggregation is information faithful. Then for every coarse coalition S⊆ V_c, Risk_ D_c(S) = Risk_ D_f(q^-1(S)). Consequently, k_ε( D_c) ≤ k_ε( D_f), where coalition size is counted in displayed nodes.
Exact mathematical passage
\boxed{ \Risk_{\mathcal D_c}(S) = \Risk_{\mathcal D_f}\bigl(q^{-1}(S)\bigr). }
\Risk_{\mathrm{ctl}}Use in source · 1 passage
Search aliases: Risk_ctl Risk mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 177
For the complete control state, define Risk_ctl(S) = inf_f E [ ℓ_ctl ( C_t^ctl, f( H_t^S) ) ], and let k_ctl,ε be its minimal sufficient coalition size. A strong workspace-level agency claim requires k_ctl,ε≥2. This is a location criterion. It does not yet establish goal persistence, counterfactual evaluation, or self-maintenance.
Exact mathematical passage
\Risk_{\mathrm{ctl}}(S) = \inf_f \mathbb E \left[ \ell_{\mathrm{ctl}} \left( C_t^{\mathrm{ctl}}, f(\mathcal H_t^S) \right) \right],
\Risk_GUse in source · 3 passages
Search aliases: Risk_G Risk
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 143
Let H_t^S be the history available to coalition S⊆ V. For a loss ℓ_G, define goal-reconstruction risk Risk_G(S) = inf_f E [ ℓ_G ( G_t, f( H_t^S) ) ]. For tolerance ε, define k_G,ε = min { |S|: Risk_G(S) ≤ Risk_G(V)+ε }. A goal is locally stored when k_G,ε=1. It is distributed relative to the declared decomposition when k_G,ε≥2.
Exact mathematical passage
\Risk_G(S) = \inf_f \mathbb E \left[ \ell_G \left( G_t, f(\mathcal H_t^S) \right) \right].
\Risk_{\log}Use in source · 7 passages
Search aliases: Risk_log Risk log
Use in source · 06-dynamic-workspace-theory.tex, line 302
For a finite target alphabet and logarithmic scoring loss ℓ_log(y,q)=-log q(y), q∈ P( Y), the identity is exact: Risk_log(S_t)=H(Y_t^+mid S_t), Risk_log(S_t)-Risk_log( H_t) = I(Y_t^+; H_tmid S_t). Natural logarithms measure the gap in nats; base-two logarithms measure it in bits.
Exact mathematical passage
\boxed{ \Risk_{\log}(S_t)=H(Y_t^+\mid S_t), \qquad \Risk_{\log}(S_t)-\Risk_{\log}(\mathbf H_t) = I(Y_t^+;\mathbf H_t\mid S_t). }
\Risk_{\log,P}Use in source · 3 passages
Search aliases: Risk_log,P Risk log
Use in source · 08-causal-efficacy-and-reentry.tex, line 305
By Theorem~[source reference], for each node i, Risk_log,P({i})- Risk_log,P(V) = I_P(Y_t^+; H_tmid H_t^i) ≥ δ_node>0. Hence no single-node history, and therefore no statistic of one, is sufficient; this gives k_0≥2.
Exact mathematical passage
\Risk_{\log,P}(\{i\})- \Risk_{\log,P}(V) = I_P(Y_t^+;\mathbf H_t\mid\mathbf H_t^i) \geq \delta_{\mathrm{node}}>0.
\Risk_{\log,P_{\mathrm{HH}}}Use in source · 1 passage
Search aliases: Risk_log,P_HH Risk log mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 388
ition has all three bits and therefore zero conditional entropy. Hence Δ_joint^log=1 bit, k_0=2. Let Q_HH preserve the independent uniform local bit pairs but replace Y by an independent uniform bit. Because parity is independent of every two-bit local view, Q_HH preserves each (Y,X_i)-marginal. Nevertheless, Risk_log,Q_HH(V) - Risk_log,P_HH(V) =1 bit. This is an exact relational witness: the predictive capacity lies in the joint organization rather than in any local predictive marginal.
Exact mathematical passage
\Risk_{\log,Q_{\mathrm{HH}}}(V) - \Risk_{\log,P_{\mathrm{HH}}}(V) =1\text{ bit}.
\Risk_{\log,Q}Use in source · 2 passages
Search aliases: Risk_log,Q Risk log
Use in source · 08-causal-efficacy-and-reentry.tex, line 323
For every Q∈ Q, Proposition~[source reference] gives Risk_log,Q({i}) = Risk_log,P({i}) ∀ i. The assumed null gap gives Risk_log,Q(V) > Risk_log,P(V). Thus a description determined only by the collection of single-node predictive marginals cannot reproduce the intact joint capacity: it would assign the same local data to P and Q while their full-system risks differ.
Exact mathematical passage
\Risk_{\log,Q}(\{i\}) = \Risk_{\log,P}(\{i\}) \qquad\forall i.
\Risk_{\log,Q_{\mathrm{HH}}}Use in source · 1 passage
Search aliases: Risk_log,Q_HH Risk log mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 388
ition has all three bits and therefore zero conditional entropy. Hence Δ_joint^log=1 bit, k_0=2. Let Q_HH preserve the independent uniform local bit pairs but replace Y by an independent uniform bit. Because parity is independent of every two-bit local view, Q_HH preserves each (Y,X_i)-marginal. Nevertheless, Risk_log,Q_HH(V) - Risk_log,P_HH(V) =1 bit. This is an exact relational witness: the predictive capacity lies in the joint organization rather than in any local predictive marginal.
Exact mathematical passage
\Risk_{\log,Q_{\mathrm{HH}}}(V) - \Risk_{\log,P_{\mathrm{HH}}}(V) =1\text{ bit}.
\Risk_\ellUse in source · 9 passages
Search aliases: Risk_ℓ Risk ell
Use in source · 06-dynamic-workspace-theory.tex, line 260
Sufficiency has a direct decision-theoretic interpretation. Use the convention TV(P,Q)=sup_A|P(A)-Q(A)|. Let A be a finite action set and ℓ: Y× A→[0,1] a bounded loss. Define Risk_ℓ(S_t) = inf_d E [ ℓ(Y_t^+,d(S_t)) ].
Exact mathematical passage
\Risk_\ell(S_t) = \inf_{d} \mathbb E\!\left[ \ell\bigl(Y_t^+,d(S_t)\bigr) \right].
\Risk_{\ell,\mathbb P}Use in source · 1 passage
Search aliases: Risk_ℓ, P Risk ell mathbb
Use in source · 08-causal-efficacy-and-reentry.tex, line 156
Let jmath_E randomize selected communication edges while preserving their marginal message laws, rates, and timing budget. The causal transfer gap is Δ_tr^do(jmath_E) = Risk_ℓ, P^jmath_E(V) - Risk_ℓ, P(V). Unlike an observational null law, this quantity is anchored to an implemented channel intervention. A positive effect is evidence that the intact alignment of messages, rather than merely their marginal content, contributes to task performance.
Exact mathematical passage
\boxed{ \Delta_{\mathrm{tr}}^{\operatorname{do}}(\jmath_E) = \Risk_{\ell,\mathbb P^{\jmath_E}}(V) - \Risk_{\ell,\mathbb P}(V). }
\Risk_{\ell,\mathbb P^{\jmath_E}}Use in source · 1 passage
Search aliases: Risk_ℓ, P^jmath_E Risk ell mathbb jmath
Use in source · 08-causal-efficacy-and-reentry.tex, line 156
Let jmath_E randomize selected communication edges while preserving their marginal message laws, rates, and timing budget. The causal transfer gap is Δ_tr^do(jmath_E) = Risk_ℓ, P^jmath_E(V) - Risk_ℓ, P(V). Unlike an observational null law, this quantity is anchored to an implemented channel intervention. A positive effect is evidence that the intact alignment of messages, rather than merely their marginal content, contributes to task performance.
Exact mathematical passage
\boxed{ \Delta_{\mathrm{tr}}^{\operatorname{do}}(\jmath_E) = \Risk_{\ell,\mathbb P^{\jmath_E}}(V) - \Risk_{\ell,\mathbb P}(V). }
\Risk_\ell^{\iota}Use in source · 1 passage
Search aliases: Risk_ℓ^ι Risk ell iota
Use in source · 06-dynamic-workspace-theory.tex, line 446
hbf H_tmid W_t). For a countable intervention family with declared weights q_ι>0, ∑_ι q_ι=1, define δ_align^ I(W_t) = ∑_ι∈ I q_ι I_ P^ι (Y_t^+; H_tmid W_t). For bounded decision losses, Proposition~[source reference] applies under each intervention and gives the weighted bound ∑_ιq_ι [ Risk_ℓ^ι(W_t) - Risk_ℓ^ι( H_t) ] ≤ sqrtfrac δ_align^ I(W_t)2.
Exact mathematical passage
\sum_{\iota}q_\iota \left[ \Risk_\ell^{\iota}(W_t) - \Risk_\ell^{\iota}(\mathbf H_t) \right] \leq \sqrt{\frac{ \delta_{\mathrm{align}}^{\mathcal I}(W_t)}{2}}.
\mathrm{root}Use in source · 1 passage
Search aliases: root mathrm
Use in source · 19-summary-of-main-results.tex, line 138
For every finite rooted hierarchy whose children edge-cover their parent, W_a≅mathscr W(G_a) for every hierarchy node a, and in particular W_root≅mathscr W(G). If level r contributes defect δ_r and downstream collapse maps have Lipschitz constants L_s, then δ_flat^(R) ≤ ∑_r=0^R-1 ( ∏_s=r+1^R-1L_s )δ_r.
Exact mathematical passage
\boxed{W_{\mathrm{root}}\cong\mathscr W(G).}
\operatorname{Routing}Use in source · 1 passage
Search aliases: Routing operatorname
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 258
Let B_t^sys be an internal membership or routing state used by the system, and let S_t^* = argmax_S∈ S_pass B_t(S) be the population boundary defined by the external certification protocol. The strong endogenous boundary conjecture asserts that there are adaptive systems and nontrivial environments for which: · d_B(B_t^sys,S_t^*)→0, · Form_Θ_form(W_B_t^sys)=1, · CE ( B_t^sys→ Routing_t+1 )>0, · CE ( BoundaryDamage_t→ RepairAction_t+1 )>0, while the scaffold contains no direct encoding of S_t^*.
Exact mathematical passage
\boxed{ \begin{aligned} &d_B(B_t^{\mathrm{sys}},S_t^*)\to0,\\ &\operatorname{Form}_{\Theta_{\mathrm{form}}}(W_{B_t^{\mathrm{sys}}})=1,\\ &\operatorname{CE} \left( B_t^{\mathrm{sys}}\to \operatorname{Routing}_{t+1} \right)>0,\\ &\operatorname{CE} \left( \operatorname{BoundaryDamage}_t\to \operatorname{RepairAction}_{t+1} \right)>0, \end{aligned} }
\operatorname{Routing}_{t+1}Use in source · 1 passage
Search aliases: Routing_t+1 operatorname
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 258
Let B_t^sys be an internal membership or routing state used by the system, and let S_t^* = argmax_S∈ S_pass B_t(S) be the population boundary defined by the external certification protocol. The strong endogenous boundary conjecture asserts that there are adaptive systems and nontrivial environments for which: · d_B(B_t^sys,S_t^*)→0, · Form_Θ_form(W_B_t^sys)=1, · CE ( B_t^sys→ Routing_t+1 )>0, · CE ( BoundaryDamage_t→ RepairAction_t+1 )>0, while the scaffold contains no direct encoding of S_t^*.
Exact mathematical passage
\boxed{ \begin{aligned} &d_B(B_t^{\mathrm{sys}},S_t^*)\to0,\\ &\operatorname{Form}_{\Theta_{\mathrm{form}}}(W_{B_t^{\mathrm{sys}}})=1,\\ &\operatorname{CE} \left( B_t^{\mathrm{sys}}\to \operatorname{Routing}_{t+1} \right)>0,\\ &\operatorname{CE} \left( \operatorname{BoundaryDamage}_t\to \operatorname{RepairAction}_{t+1} \right)>0, \end{aligned} }
\ruleUse in source · 1 passage
Search aliases: rule
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
S^{-1}Use in source · 1 passage
Search aliases: S^-1
Use in source · 02-static-core-transfer-theory.tex, line 398
[Equivalent operations in different coordinates] Let C_1=C_2= R^2, choose S∈ GL_2( R), and set H_12=S, ρ_2(a)=Sρ_1(a)S^-1. Then H_12ρ_1(a) =Sρ_1(a) =ρ_2(a)S =ρ_2(a)H_12. The local matrices can look different while realizing the same abstract operation. This is the elementary model of representation change used throughout the theory.
Exact mathematical passage
H_{12}=S, \qquad \rho_2(a)=S\rho_1(a)S^{-1}.
S_{\mathcal U}Use in source · 2 passages
Search aliases: S_ U mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 569
l candidates may also violate their internal transfer equations. Define the local-copy space widehat C_ U = ⊕_α∈ A C_V(G_α) and the block internal discrepancy widehat D_ U = ⊕_α∈ AD_G_α. For u=(u_α)_α∈widehat C_ U, define the raw overlap synchronization operator (S_ Uu)_αβ = ρ_G_αβ^G_βu_β - ρ_G_αβ^G_αu_α. For an overlap weight λ_ov>0, set K_ U = widehat D_ U
Exact mathematical passage
(S_{\mathcal U}u)_{\alpha\beta} = \rho_{G_{\alpha\beta}}^{G_\beta}u_\beta - \rho_{G_{\alpha\beta}}^{G_\alpha}u_\alpha.
\mathfrak S_{\mathrm{pass}}Use in source · 7 passages
Search aliases: S_pass mathfrak mathrm
Use in source · 15-boundary-formation-and-stability.tex, line 163
· -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\widehat S_t \in \argmax_{S\in\mathfrak S_{\mathrm{pass}}} \widehat{\mathcal B}_t(S),
S_{t+1}Use in source · 1 passage
Search aliases: S_t+1
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 77
C_t^ctl = ( W_t,G_t,M_t,B_t,E_t ), where G_t is the represented goal, M_t is a workspace-integrity monitor, B_t is the current boundary or routing state, and E_t is the declared external context. An action is generated by A_t ∼ π_t ( ·mid W_t,G_t,M_t,B_t,E_t ). The future controlled state obeys a time-unrolled structural model S_t+1 = F_t(S_t,A_t,E_t+1,ξ_t+1), W_t+1=ω_t+1(S_t+1). The intervention semantics are inherited from Part~VII. A symbol such as do(A_t=a) is meaningful only when an impleme…
Exact mathematical passage
S_{t+1} = F_t(S_t,A_t,E_{t+1},\xi_{t+1}), \qquad W_{t+1}=\omega_{t+1}(S_{t+1}).
S_{t+1}^*Use in source · 3 passages
Search aliases: S_t+1^*
Use in source · 15-boundary-formation-and-stability.tex, line 251
[Boundary persistence under score drift] Assume S_t^* is the unique maximizer of B_t with margin Δ_t^B, and suppose sup_S∈ S_pass | B_t+1(S)- B_t(S)| ≤δ_t. If 2δ_t<Δ_t^B, then S_t+1^*=S_t^*. More generally, B_t+1(S_t+1^*) - B_t+1(S_t^*) ≤2δ_t.
Exact mathematical passage
\boxed{S_{t+1}^*=S_t^*.}
S_t^*Use in source · 15 passages
Search aliases: S_t^*
Use in source · 15-boundary-formation-and-stability.tex, line 189
[Held-out boundary recovery] Let S_pass be finite and let S_t^* = argmax_S∈ S_pass B_t(S) be unique. Define the population margin Δ_t^B = B_t(S_t^*) - max_S≠ S_t^* B_t(S)>0. If sup_S∈ S_pass | widehat B_t(S)- B_t(S) | ≤ε_t, then every empirical maximizer widehat S_t satisfies B_t(S_t^*)- B_t(widehat S_t) ≤2ε_t. If 2ε_t<Δ_t^B, then widehat S_t=S_t^*.
Exact mathematical passage
S_t^* = \argmax_{S\in\mathfrak S_{\mathrm{pass}}} \mathcal B_t(S)
s_{\alpha_0\cdots\widehat{\alpha_j}\cdots\alpha_{p+1}}Use in source · 1 passage
Search aliases: s_α_0⋯widehatα_j⋯α_p+1 alpha cdots widehat alpha cdots alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 138
For p≥0, define the finite cochain space check C^p( U;mathscr W) = ⊕_α_0<⋯<α_p mathscr W(G_α_0⋯α_p), where empty intersections contribute the zero space. The coboundary δ^p:check C^p⟶check C^p+1 is (δ^p s)_α_0⋯α_p+1 = ∑_j=0^p+1(-1)^j r_α_0⋯α_p+1^% α_0⋯widehatα_j⋯α_p+1 % s_α_0⋯widehatα_j⋯α_p+1. The restriction identities imply δ^p+1δ^p=0. For a local family w=(w_α)_α, (δ^0w)_αβ = r_αβ^βw_β - r_αβ^αw_α. Thus δ^0 is the overlap-discrepancy operator at the level of exact local workspaces.
Exact mathematical passage
\boxed{ (\delta^p s)_{\alpha_0\cdots\alpha_{p+1}} = \sum_{j=0}^{p+1}(-1)^j r_{\alpha_0\cdots\alpha_{p+1}}^% {\alpha_0\cdots\widehat{\alpha_j}\cdots\alpha_{p+1}} % s_{\alpha_0\cdots\widehat{\alpha_j}\cdots\alpha_{p+1}}. }
s_\varepsilonUse in source · 2 passages
Search aliases: s_ε varepsilon
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 303
A more stable quantity measures primitive carrier cost. Let w_ω>0 be a declared cost for each ω∈Ω, and assign a block the cost c(B)=∑_ω∈ Bw_ω. Define the sufficient support cost s_ε( D) = min_S⊆ V_ D { ∑_B∈ Sc(B): Risk_ D(S) ≤ Risk_ D(V_ D)+ε }. If D_fpreceq D_c is information faithful, then s_ε( D_f) ≤ s_ε( D_c). The fine decomposition permits every union of coarse blocks and may also permit cheaper sub-block coalitions. Equality holds whenever an optimal fine coalition is a union of complete c…
Exact mathematical passage
\boxed{ s_\varepsilon(\mathcal D) = \min_{S\subseteq V_{\mathcal D}} \left\{ \sum_{B\in S}c(B): \Risk_{\mathcal D}(S) \leq \Risk_{\mathcal D}(V_{\mathcal D})+\varepsilon \right\}. }
\mathfrak S_\etaUse in source · 2 passages
Search aliases: S_η mathfrak eta
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 838
Let S_η be an η-net of ( S,d_ S) with covering number N(η, S,d_ S). If both the population and empirical margin functions are L_q-Lipschitz, then sup_ς∈ S |widehat m_q(ς)-m_q(ς)| ≤ max_ς_j∈ S_η |widehat m_q(ς_j)-m_q(ς_j)| +2L_qη. For bounded empirical means, a valid radius is therefore ε_q,n,η(δ) = sqrt frac log(2| J_*| N(η, S,d_ S)/δ) 2n +2L_qη. The tuning parameter η balances net cardinality against interpolation error. More refined empirical
Exact mathematical passage
\mathfrak S_\eta
\mathrm{sample}Use in source · 1 passage
Search aliases: sample mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 378
In practice, the reference margin is reduced by three distinct uncertainty budgets: B_q^total = B_q^model +B_q^spec +B_q^sample. The first covers variation across observationally compatible realizations. The second covers variation across admissible specifications. The third covers finite-sample estimation. The sufficient condition widehat m_q(W;ς_0) > B_q^total (q∈ J_*) will reappear below in identified-set and confidence-envelope form. Keeping the budgets separate prevents an apparently narrow…
Exact mathematical passage
\boxed{ B_q^{\mathrm{total}} = B_q^{\mathrm{model}} +B_q^{\mathrm{spec}} +B_q^{\mathrm{sample}}. }
\mathrm{scaf}Use in source · 5 passages
Search aliases: scaf mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 309
For a family S of admissible scaffold variants, define the cross-scaffold identity defect δ_q^scaf = inf_{J_σσ'} E_σ,σ'∼π d_q ( J_σσ'q_σ,q_σ' ), where J_σσ' transports the learned object between admissible coordinate systems. A low value indicates that the same abstract organization is recovered under multiple non-solution-bearing scaffolds.
Exact mathematical passage
\boxed{ \delta_q^{\mathrm{scaf}} = \inf_{\{J_{\sigma\sigma'}\}} \mathbb E_{\sigma,\sigma'\sim\pi} d_q \left( J_{\sigma\sigma'}q_{\sigma},q_{\sigma'} \right), }
\operatorname{Scaffolded}Use in source · 1 passage
Search aliases: Scaffolded operatorname
Use in source · 24-theory-hierarchy.tex, line 74
subtopicOrthogonal formation-provenance axis Scaffolded ⟶ AdaptivelyParameterised ⟶ StructurallyAdaptive ⟶ EndogenouslyConstituted. This axis is independent of Levels~0--6. A scaffolded system can instantiate a high-level relational workspace, while an endogenously learned organization can fail every operational workspace gate.
Exact mathematical passage
\operatorname{Scaffolded} \longrightarrow \operatorname{AdaptivelyParameterised} \longrightarrow \operatorname{StructurallyAdaptive} \longrightarrow \operatorname{EndogenouslyConstituted}.
\operatorname{sech}Use in source · 1 passage
Search aliases: sech operatorname
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 146
The derivative is F_λ'(m) = λsech^2(λ m). At zero this equals λ, proving stability for λ<1 and instability for λ>1. At a nonzero fixed point, F_λ'(m_λ) = λ(1-m_λ^2) = frac(1-m_λ^2)artanh(m_λ)m_λ <1, because artanh(m) < fracm1-m^2 (0<m<1). The derivative is positive, so the nonzero fixed points are locally stable. Finally, expanding tanh(λ m) = λ m- fracλ^3m^33 +O(m^5) and solving the nonzero fixed-point equation gives the stated asymptotic.
Exact mathematical passage
F_\lambda'(m) = \lambda\operatorname{sech}^2(\lambda m).
\operatorname{sech}^2Use in source · 1 passage
Search aliases: sech^2 operatorname
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 146
The derivative is F_λ'(m) = λsech^2(λ m). At zero this equals λ, proving stability for λ<1 and instability for λ>1. At a nonzero fixed point, F_λ'(m_λ) = λ(1-m_λ^2) = frac(1-m_λ^2)artanh(m_λ)m_λ <1, because artanh(m) < fracm1-m^2 (0<m<1). The derivative is positive, so the nonzero fixed points are locally stable. Finally, expanding tanh(λ m) = λ m- fracλ^3m^33 +O(m^5) and solving the nonzero fixed-point equation gives the stated asymptotic.
Exact mathematical passage
F_\lambda'(m) = \lambda\operatorname{sech}^2(\lambda m).
\sectionUse in source · 1 passage
Search aliases: section
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
\mathrm{sel}Use in source · 3 passages
Search aliases: sel mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 934
[Validity after independent specification selection] Let widehatς be selected using D_sel, and let D_cert be independent of D_sel. For every fixed ς∈ S, let ϕ_ς( D_cert)∈{0,1} be a certificate rule satisfying sup_P:Cert(W;ς)=0 P_P(ϕ_ς=1) ≤α. Then the selected-specification procedure satisfies sup_P P_P( ϕ_widehatς=1, Cert(W;widehatς)=0 ) ≤α.
Exact mathematical passage
\mathcal D_{\mathrm{sel}}
\mathsf{selection\_history}Use in source · 1 passage
Search aliases: selection_history mathsf
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1051
The machine-readable record should include: SpecificationRecord ={ · reference, family, equivalence_classes, metric, · targets, losses, horizons, interventions, · null_panels, thresholds, selection_history, · identified_sets, uniform_bounds, gate_envelopes }. Every omitted family member requires a reason. Every changed specification requires a data-split label and time stamp. Every gate requires pointwise and family-wide status.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{SpecificationRecord} =\{& \mathsf{reference}, \mathsf{family}, \mathsf{equivalence\_classes}, \mathsf{metric},\\ &\mathsf{targets}, \mathsf{losses}, \mathsf{horizons}, \mathsf{interventions},\\ &\mathsf{null\_panels}, \mathsf{thresholds}, \mathsf{selection\_history},\\ &\mathsf{identified\_sets}, \mathsf{uniform\_bounds}, \mathsf{gate\_envelopes} \}. \end{aligned} }
\operatorname{SelfAware}Use in source · 1 passage
Search aliases: SelfAware operatorname
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1129
The following implications are not licensed: Agent_Θ_A(Workspace) centernotLongrightarrow PhenomenallyConscious(Workspace), SelfMaintaining(Workspace) centernotLongrightarrow SelfAware(Workspace), GoalPersistent(Workspace) centernotLongrightarrow MoralPatient(Workspace). A thermostat-like controller can maintain a variable without representing itself. A sophisticated planner can evaluate counterfactual actions without phenomenal experience. Conversely, failure to pass this engineering certificat…
Exact mathematical passage
\operatorname{SelfMaintaining}(\Workspace) \centernot\Longrightarrow \operatorname{SelfAware}(\Workspace),
\operatorname{SelfMaintaining}Use in source · 1 passage
Search aliases: SelfMaintaining operatorname
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1129
The following implications are not licensed: Agent_Θ_A(Workspace) centernotLongrightarrow PhenomenallyConscious(Workspace), SelfMaintaining(Workspace) centernotLongrightarrow SelfAware(Workspace), GoalPersistent(Workspace) centernotLongrightarrow MoralPatient(Workspace). A thermostat-like controller can maintain a variable without representing itself. A sophisticated planner can evaluate counterfactual actions without phenomenal experience. Conversely, failure to pass this engineering certificat…
Exact mathematical passage
\operatorname{SelfMaintaining}(\Workspace) \centernot\Longrightarrow \operatorname{SelfAware}(\Workspace),
\operatorname{SelfMaintenance}Use in source · 1 passage
Search aliases: SelfMaintenance operatorname
Use in source · 24-theory-hierarchy.tex, line 57
subtopicLevel 6: Workspace agent · η_G→ A>0, η_W→ A>0, δ_Q≤ε_Q, · Reg_t(π) ≤2ε_Q+δ_opt, k_ctl,ε≥2, SelfMaintenance.
Exact mathematical passage
\begin{aligned} &\eta_{G\to A}>0, \qquad \eta_{W\to A}>0, \qquad \delta_Q\leq\varepsilon_Q,\\ &\operatorname{Reg}_t(\pi) \leq2\varepsilon_Q+\delta_{\mathrm{opt}}, \qquad k_{\mathrm{ctl},\varepsilon}\geq2, \qquad \operatorname{SelfMaintenance}. \end{aligned}
\sinUse in source · 3 passages
Search aliases: sin
Use in source · 03-exact-shared-cores.tex, line 315
[Local compatibility without a global nonzero core] Let the only nontrivial cycle holonomy on R^2 be a rotation R_θ= cosθ · -sinθ sinθ · cosθ with θ∉2π Z. Then ker(R_θ-I)={0}. Every edge map is individually invertible and well-defined, yet the complete cycle admits no nonzero exact shared core. Pairwise translatability is therefore insufficient for global path independence.
Exact mathematical passage
R_\theta= \begin{pmatrix} \cos\theta&-\sin\theta\\ \sin\theta&\cos\theta \end{pmatrix}
\mathsf{Size}Use in source · 1 passage
Search aliases: Size mathsf
Use in source · 15-boundary-formation-and-stability.tex, line 144
A general score is B_t(S) = · a_RRet_τ(S) +a_OOut_τ(S) +a_CCOut_τ(S) · -a_DDep_τ(S) -a_ICIn_τ(S) -a_LCoh(S) · -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal B_t(S) ={}& a_R\Ret_\tau(S) +a_O\Out_\tau(S) +a_C\COut_\tau(S)\\ &-a_D\Dep_\tau(S) -a_I\CIn_\tau(S) -a_L\mathsf{Coh}(S)\\ &-a_K\mathsf{Cut}(S) -a_Z\mathsf{Size}(S) -a_T\Instability_t(S). \end{aligned} }
\smallUse in source · 1 passage
Search aliases: small
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
\operatorname{span}Use in source · 1 passage
Search aliases: span operatorname
Use in source · 03-exact-shared-cores.tex, line 302
0 · -1 . The cycle holonomy is J, hence C_*=ker(J-I)=span{(1,0)^top}. The first coordinate circulates consistently through all three strata. The second returns with its sign reversed and therefore cannot define a nonzero exact shared section. Thus d_Workspace=1.
Exact mathematical passage
C_*=\ker(J-I)=\operatorname{span}\{(1,0)^\top\}.
\specUse in source · 5 passages
Search aliases: spec
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 99
[Unitary gauge covariance of the Laplacian] If every g_i is unitary, then G_V and G_E are unitary and L_H^g=G_VL_HG_V^-1. Consequently, spec(L_H^g)=spec(L_H), P_I(L_H^g)=G_VP_I(L_H)G_V^-1 for every spectral interval I.
Exact mathematical passage
\spec(L_{H^g})=\spec(L_H), \qquad P_I(L_{H^g})=G_VP_I(L_H)G_V^{-1}
\mathrm{specific}Use in source · 7 passages
Search aliases: specific mathrm
Use in source · 08-causal-efficacy-and-reentry.tex, line 136
Define η_Workspace(r) = E_ι,ι'∼ I_Workspace(r) D ( P^ι(Y_t^+), P^ι'(Y_t^+) ), η_⊥(r) = E_jmath,jmath'∼ I_⊥(r) D ( P^jmath(Y_t^+), P^jmath'(Y_t^+) ), and Δ_specific(r) = η_Workspace(r)-η_⊥(r). A positive value supports causal concentration in the candidate workspace at the declared perturbation scale.
Exact mathematical passage
\boxed{ \Delta_{\mathrm{specific}}(r) = \eta_{\Workspace}(r)-\eta_{\perp}(r). }
\mathsf{specification}Use in source · 1 passage
Search aliases: specification mathsf
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 660
The machine-readable record should contain at least the following top-level objects: ResultRecord ={ · claim, specification, specification_family, decomposition, data_splits, formation, · workspace_extractor, goals, actions, interventions, · nulls, gates, identified_sets, specification_envelopes, uncertainty, failures, artifacts }. Each gate object records its symbol, estimator, direction, threshold, point estimate, interval, split, seed set, status, and artifact reference. Each intervention and…
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{ResultRecord} =\{& \mathsf{claim}, \mathsf{specification}, \mathsf{specification\_family}, \mathsf{decomposition}, \mathsf{data\_splits}, \mathsf{formation},\\ &\mathsf{workspace\_extractor}, \mathsf{goals}, \mathsf{actions}, \mathsf{interventions},\\ &\mathsf{nulls}, \mathsf{gates}, \mathsf{identified\_sets}, \mathsf{specification\_envelopes}, \mathsf{uncertainty}, \mathsf{failures}, \mathsf{artifacts} \}. \end{aligned} }
\mathsf{specification\_envelopes}Use in source · 1 passage
Search aliases: specification_envelopes mathsf
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 660
The machine-readable record should contain at least the following top-level objects: ResultRecord ={ · claim, specification, specification_family, decomposition, data_splits, formation, · workspace_extractor, goals, actions, interventions, · nulls, gates, identified_sets, specification_envelopes, uncertainty, failures, artifacts }. Each gate object records its symbol, estimator, direction, threshold, point estimate, interval, split, seed set, status, and artifact reference. Each intervention and…
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{ResultRecord} =\{& \mathsf{claim}, \mathsf{specification}, \mathsf{specification\_family}, \mathsf{decomposition}, \mathsf{data\_splits}, \mathsf{formation},\\ &\mathsf{workspace\_extractor}, \mathsf{goals}, \mathsf{actions}, \mathsf{interventions},\\ &\mathsf{nulls}, \mathsf{gates}, \mathsf{identified\_sets}, \mathsf{specification\_envelopes}, \mathsf{uncertainty}, \mathsf{failures}, \mathsf{artifacts} \}. \end{aligned} }
\mathsf{specification\_family}Use in source · 1 passage
Search aliases: specification_family mathsf
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 660
The machine-readable record should contain at least the following top-level objects: ResultRecord ={ · claim, specification, specification_family, decomposition, data_splits, formation, · workspace_extractor, goals, actions, interventions, · nulls, gates, identified_sets, specification_envelopes, uncertainty, failures, artifacts }. Each gate object records its symbol, estimator, direction, threshold, point estimate, interval, split, seed set, status, and artifact reference. Each intervention and…
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{ResultRecord} =\{& \mathsf{claim}, \mathsf{specification}, \mathsf{specification\_family}, \mathsf{decomposition}, \mathsf{data\_splits}, \mathsf{formation},\\ &\mathsf{workspace\_extractor}, \mathsf{goals}, \mathsf{actions}, \mathsf{interventions},\\ &\mathsf{nulls}, \mathsf{gates}, \mathsf{identified\_sets}, \mathsf{specification\_envelopes}, \mathsf{uncertainty}, \mathsf{failures}, \mathsf{artifacts} \}. \end{aligned} }
\mathsf{SpecificationRecord}Use in source · 1 passage
Search aliases: SpecificationRecord mathsf
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1051
The machine-readable record should include: SpecificationRecord ={ · reference, family, equivalence_classes, metric, · targets, losses, horizons, interventions, · null_panels, thresholds, selection_history, · identified_sets, uniform_bounds, gate_envelopes }. Every omitted family member requires a reason. Every changed specification requires a data-split label and time stamp. Every gate requires pointwise and family-wide status.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{SpecificationRecord} =\{& \mathsf{reference}, \mathsf{family}, \mathsf{equivalence\_classes}, \mathsf{metric},\\ &\mathsf{targets}, \mathsf{losses}, \mathsf{horizons}, \mathsf{interventions},\\ &\mathsf{null\_panels}, \mathsf{thresholds}, \mathsf{selection\_history},\\ &\mathsf{identified\_sets}, \mathsf{uniform\_bounds}, \mathsf{gate\_envelopes} \}. \end{aligned} }
\sqcupUse in source · 4 passages
Search aliases: sqcup
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 158
The same sample must not be used both to select a workspace and to certify its coherence, causal efficacy, or relational irreducibility. The required split is D = D_form sqcup D_cal sqcup D_cert. The formation sample selects widehatθ. The calibration sample fixes thresholds, regularization strengths, and intervention magnitudes. The certification sample evaluates the final gates without further structural selection. In a multi-environment study, the stronger requirement is E_form ∩ E_cert = ∅, s…
Exact mathematical passage
\mathcal D = \mathcal D_{\mathrm{form}} \sqcup \mathcal D_{\mathrm{cal}} \sqcup \mathcal D_{\mathrm{cert}}.
\SRWUse in source · 6 passages
Search aliases: SRW
Use in source · 09-formal-workspace-definition.tex, line 101
Symbolically, SRW(W_t;ς) = bigwedge_q∈ J(ς) Gate_q(W_t;ς). The gate set is claim-relative. A one-step operational workspace need not pass persistence or reentry gates, while a persistent reentrant workspace must. No scalar total score is sufficient: failure of a required gate cannot be hidden by high performance on another gate.
Exact mathematical passage
\boxed{ \SRW(W_t;\varsigma) = \bigwedge_{q\in\mathcal J(\varsigma)} \operatorname{Gate}_q(W_t;\varsigma). }
\mathrm{SRW}Use in source · 1 passage
Search aliases: SRW mathrm
Use in source · 23-relation-to-prior-work.tex, line 884
The strongest current candidate is not a single equation. It is the following conjunctive object: C_SRW = ( c heterogeneous core--transfer diagram and residuals, exact or spectral shared-section state, operation and predictive alignment, feasible causal interventions, coalition irreducibility under matched local-predictive nulls, non-collapse, reconstruction, and replacement identity, descent across subworkspaces without hidden centralization, formation provenance and certification leakage contr…
Exact mathematical passage
\boxed{ \mathfrak C_{\mathrm{SRW}} = \left( \begin{array}{c} \text{heterogeneous core--transfer diagram and residuals},\\ \text{exact or spectral shared-section state},\\ \text{operation and predictive alignment},\\ \text{feasible causal interventions},\\ \text{coalition irreducibility under matched local-predictive nulls},\\ \text{non-collapse, reconstruction, and replacement identity},\\ \text{descent across subworkspaces without hidden centralization},\\ \text{formation provenance and certification leakage control},\\ \text{goal-conditioned action and certificate-directed repair},\\ \text{robustness across admissible decompositions and scientific specifications},\\ \text{identified-set and uniform finite-sample certification} \end{array} \right). }
\SRW_\ThetaUse in source · 2 passages
Search aliases: SRW_Θ SRW Theta
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 98
This yields the more precise notation SRW(W;ς)=1. The earlier expression SRW_Θ(W; D) is the special case in which the remaining coordinates of ς are held fixed.
Exact mathematical passage
\SRW_\Theta(W;\mathcal D)
\operatorname{SRW}_{\Theta}Use in source · 3 passages
Search aliases: SRW_Θ operatorname Theta
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 210
The formation provenance of a workspace and its operational certification are separate coordinates. A fully scaffolded structure may satisfy every structural and causal workspace gate. A highly endogenous structure may fail to become coherent or causally useful. Symbolically, Endogenous(W) centernotLongrightarrow SRW_Θ(W), SRW_Θ(W) centernotLongrightarrow Endogenous(W). The theory therefore treats endogeneity as a provenance axis rather than a higher level on the workspace hierarchy.
Exact mathematical passage
\operatorname{Endogenous}(W) \centernot\Longrightarrow \operatorname{SRW}_{\Theta}(W),
\operatorname{SRW}_{\Theta_S}Use in source · 1 passage
Search aliases: SRW_Θ_S operatorname Theta
Use in source · 15-boundary-formation-and-stability.tex, line 134
S, define Coh(S) = tr ( P_S,dL_SP_S,d ), where P_S,d projects onto the selected low-energy workspace modes. Let Cut(S) = ∑_e:s(e)∈ S, t(e)∉ Sw_e + ∑_e:s(e)∉ S, t(e)∈ Sw_e. Let k_ε(S) be the minimal sufficient coalition size inside the candidate subsystem. A candidate is admissible only if SRW_Θ_S(W_S)=1, k_ε(S)≥2, unless the claim explicitly concerns a centralized workspace.
Exact mathematical passage
\operatorname{SRW}_{\Theta_S}(W_S)=1, \qquad k_\varepsilon(S)\geq2,
\mathrm{stab}Use in source · 1 passage
Search aliases: stab mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 395
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1 · + λ_stab J_stab + λ_leak J_leak }. The objective is schematic rather than universal. Its purpose is to expose which quantities were fixed and which were optimized. If z and …
Exact mathematical passage
\boxed{ \begin{aligned} \widehat\theta \in \argmin_{z,a,H,P,\mathcal O,B} \Bigl \{& \widehat{\mathcal R}_{\mathrm{task}} + \lambda_{\mathrm{coh}}\|D_{a,H}c\|^2 + \lambda_E\|a\|_1 + \lambda_V\|z\|_1\\ &+ \lambda_{\mathrm{stab}}\mathcal J_{\mathrm{stab}} + \lambda_{\mathrm{leak}}\mathcal J_{\mathrm{leak}} \Bigr\}. \end{aligned} }
\mathrm{static}Use in source · 1 passage
Search aliases: static mathrm
Use in source · 03-exact-shared-cores.tex, line 501
The structural workspace is therefore more accurately represented by the triple Workspace_static = ( Γ(H), O_Workspace, π_Workspace ), not merely by the vector space Γ(H).
Exact mathematical passage
\boxed{ \Workspace_{\mathrm{static}} = \bigl( \Gamma(H), \mathcal O_{\Workspace}, \pi_{\Workspace} \bigr), }
\mathsf{STD}Use in source · 16 passages
Search aliases: STD mathsf
Use in source · 23-relation-to-prior-work.tex, line 15
The audit uses five labels: ll STD · = established concept, theorem, or technique, ADP · = established machinery adapted to relational workspaces, SYN · = nontrivial synthesis of established components, CAN · = candidate original contribution requiring priority review, EMP · = empirical claim not yet established in an uncontrolled system. These labels describe the status of a claim, not its importance. A standard result may be indispensable. A synthesis may be scientifically useful without conta…
Exact mathematical passage
\begin{array}{ll} \mathsf{STD} & = \text{established concept, theorem, or technique},\\ \mathsf{ADP} & = \text{established machinery adapted to relational workspaces},\\ \mathsf{SYN} & = \text{nontrivial synthesis of established components},\\ \mathsf{CAN} & = \text{candidate original contribution requiring priority review},\\ \mathsf{EMP} & = \text{empirical claim not yet established in an uncontrolled system}. \end{array}
\mathrm{str}Use in source · 29 passages
Search aliases: str mathrm
Use in source · 06-dynamic-workspace-theory.tex, line 89
Let c(t)=(c_i(t))_i∈ V ∈ C_V(t), P_t= 1_[0,ε_t](L_t). The instantaneous structural workspace coordinate is W_t^str=P_tc(t) ∈ Γ_ε_t(H(t)). When P_t varies with time, these coordinates inhabit a moving family of subspaces. Parts~X--XII will supply the transport required to compare them across time. In what follows, all sufficiency and intervention statements are made at a fixed decision time t.
Exact mathematical passage
\boxed{ W_t^{\mathrm{str}}=P_tc(t) \in \Gamma_{\varepsilon_t}(H(t)). }
\mathrm{stress}Use in source · 2 passages
Search aliases: stress mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 975
A practical design may use: D_form sqcup D_spec sqcup D_cert sqcup D_stress. Formation learns the workspace. The specification split chooses targets, horizons, nulls, and thresholds from a predeclared menu. Certification makes the pass decision once. Stress testing explores broader shifts without retroactively changing the certified claim. Cross-fitting can recover sample efficiency, but the fold-level selection and evaluation paths must remain separated and the final uncertainty calculation mus…
Exact mathematical passage
\mathcal D_{\mathrm{form}} \sqcup \mathcal D_{\mathrm{spec}} \sqcup \mathcal D_{\mathrm{cert}} \sqcup \mathcal D_{\mathrm{stress}}.
\operatorname{StructurallyAdaptive}Use in source · 1 passage
Search aliases: StructurallyAdaptive operatorname
Use in source · 24-theory-hierarchy.tex, line 74
subtopicOrthogonal formation-provenance axis Scaffolded ⟶ AdaptivelyParameterised ⟶ StructurallyAdaptive ⟶ EndogenouslyConstituted. This axis is independent of Levels~0--6. A scaffolded system can instantiate a high-level relational workspace, while an endogenously learned organization can fail every operational workspace gate.
Exact mathematical passage
\operatorname{Scaffolded} \longrightarrow \operatorname{AdaptivelyParameterised} \longrightarrow \operatorname{StructurallyAdaptive} \longrightarrow \operatorname{EndogenouslyConstituted}.
\succeqUse in source · 3 passages
Search aliases: succeq
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 459
[Population transfer identification] Let X∈ R^d_u and Y∈ R^d_v satisfy Y=H_*X+ξ, E[ξ X^ T]=0, and assume Σ_XX = E[XX^ T] succeq κ I for some κ>0. Then H_* is the unique minimizer of R(H) = E Y-HX _2^2, with H_* = Σ_YXΣ_XX^-1. Moreover, R(H)- R(H_*) = tr ( (H-H_*)Σ_XX(H-H_*)^ T ) ≥ κ H-H_* _F^2.
Exact mathematical passage
\Sigma_{XX} = \mathbb E[XX^{\mathsf T}] \succeq \kappa I
\mathrm{suff}Use in source · 3 passages
Search aliases: suff mathrm
Use in source · 06-dynamic-workspace-theory.tex, line 219
For an arbitrary history statistic S_t=s( H_t), let K_t^S(s,·) = P(Y_t^+∈·mid S_t=s). Whenever the conditional relative entropy is finite, define the sufficiency defect δ_suff(S_t) = E [ KL ( K_t( H_t,·) middle K_t^S(S_t,·) ) ].
Exact mathematical passage
\boxed{ \delta_{\mathrm{suff}}(S_t) = \mathbb E\!\left[ \KL\!\left( K_t(\mathbf H_t,\cdot) \,\middle\|\, K_t^S(S_t,\cdot) \right) \right]. }
\sup_{\mathcal D\in\mathfrak D}Use in source · 5 passages
Search aliases: sup_ D∈ D sup mathcal in mathfrak
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 432
Let m_q(W; D) be the signed margin of gate q, oriented so that m_q(W; D)>0 means that the gate passes after its uncertainty correction. Define the decomposition envelope underline m_q = inf_ D∈ Dm_q(W; D), overline m_q = sup_ D∈ Dm_q(W; D), and its sensitivity width Δ_q^dec = overline m_q-underline m_q.
Exact mathematical passage
\underline m_q = \inf_{\mathcal D\in\mathfrak D}m_q(W;\mathcal D), \qquad \overline m_q = \sup_{\mathcal D\in\mathfrak D}m_q(W;\mathcal D),
\sup_{\mathfrak R\in\mathfrak R_{\mathrm{ID}}}Use in source · 1 passage
Search aliases: sup_ R∈ R_ID sup mathfrak in mathfrak mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 627
For robustness across specifications, define the realization-level robust margin r_ S( R) = inf_ς∈ S min_q∈ J_* m_q(W_ R;ς) and its identified range underline r_ID, S = inf_ R∈ R_ID r_ S( R), overline r_ID, S = sup_ R∈ R_ID r_ S( R).
Exact mathematical passage
\underline r_{\mathrm{ID},\mathfrak S} = \inf_{\mathfrak R\in\mathfrak R_{\mathrm{ID}}} r_{\mathfrak S}(\mathfrak R), \qquad \overline r_{\mathrm{ID},\mathfrak S} = \sup_{\mathfrak R\in\mathfrak R_{\mathrm{ID}}} r_{\mathfrak S}(\mathfrak R).
\sup_aUse in source · 1 passage
Search aliases: sup_a sup
Use in source · 19-summary-of-main-results.tex, line 450
If the interventional action-value estimator satisfies sup_a|widehat Q_t(a)-Q_t(a)|≤ε_Q and the implemented policy has optimization error at most δ_opt relative to widehat Q_t, then Reg_t(widehatπ_t) ≤ 2ε_Q+δ_opt. For deterministic greedy action, the bound is 2ε_Q. A unique true optimum with value gap greater than 2ε_Q is recovered exactly. The guarantee is relative to the declared utility, feasible action support, causal identification, and horizon.
Exact mathematical passage
\sup_a|\widehat Q_t(a)-Q_t(a)|\leq\varepsilon_Q
\sup_{A}Use in source · 1 passage
Search aliases: sup_A sup
Use in source · 06-dynamic-workspace-theory.tex, line 255
Sufficiency has a direct decision-theoretic interpretation. Use the convention TV(P,Q)=sup_A|P(A)-Q(A)|. Let A be a finite action set and ℓ: Y× A→[0,1] a bounded loss. Define Risk_ℓ(S_t) = inf_d E [ ℓ(Y_t^+,d(S_t)) ].
Exact mathematical passage
\TV(P,Q)=\sup_{A}|P(A)-Q(A)|.
\sup_{a,a',b}Use in source · 1 passage
Search aliases: sup_a,a',b sup
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 225
. For a divergence D_A, define η_G→ A = sup_g,g',w,e D_A ( P(A_t∈·midι_g,w,e), P(A_t∈·midι_g',w,e) ). Workspace-dependent action mediation is η_W→ A = sup_w,w',g,e D_A ( P(A_t∈·midι_w,g,e), P(A_t∈·midι_w',g,e) ). An action must also alter the declared future: η_A→ Y = sup_a,a',b D_Y ( P(Y_t^+∈·midι_a,b), P(Y_t^+∈·midι_a',b) ). A positive η_G→ A without η_A→ Y describes goal-sensitive output selection with no demonstrated control of the relevant environment. A positive η_A→ Y without a goal or co…
Exact mathematical passage
\eta_{A\to Y} = \sup_{a,a',b} D_Y \left( \mathbb P(Y_t^+\in\cdot\mid\iota_a,b), \mathbb P(Y_t^+\in\cdot\mid\iota_{a'},b) \right).
\sup_{a\in\mathcal A}Use in source · 1 passage
Search aliases: sup_a∈ A sup in mathcal
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 515
[Approximate counterfactual policy selection] Let A be a finite feasible action set. Let Q: A→ R be the true interventional value and let widehat Q satisfy sup_a∈ A|widehat Q(a)-Q(a)|≤ε_Q. Suppose a policy widehatπ is δ_opt-optimal for widehat Q: max_π E_a∼π[widehat Q(a)] - E_a∼widehatπ[widehat Q(a)] ≤ δ_opt. Then, for every true-value-optimal policy π^*, E_a∼π^*[Q(a)] - E_a∼widehatπ[Q(a)] ≤ 2ε_Q+δ_opt. For a deterministic greedy action widehat a∈argmax_awidehat Q(a), Q(a^*)-Q(widehat a) ≤2ε_Q. …
Exact mathematical passage
\sup_{a\in\mathcal A}|\widehat Q(a)-Q(a)|\leq\varepsilon_Q.
\sup_{a\in\mathcal A_1}Use in source · 2 passages
Search aliases: sup_a∈ A_1 sup in mathcal
Use in source · 12-identity-through-time-and-replacement.tex, line 337
For an admissible correspondence J, define the operation defect on a declared unit ball A_1 by δ_op( J) = sup_a∈ A_1 A_ W''β-β A_ W . The primary certification object is the identity profile d_id( J) = ( q_str, δ_op( J), δ_causal(β), δ_rec(β); μ^keep ). The first four coordinates must remain below declared tolerances, while the non-collapse margin μ^keep must remain above a declared lower bound. This vector, rather than a weighted average, determines whether a specific identity claim passes.
Exact mathematical passage
\delta_{\mathrm{op}}(\mathfrak J) = \sup_{a\in\mathcal A_1} \|A_{\mathcal W'}'\beta-\beta A_{\mathcal W}\|.
\sup_{a\in\mathcal A_t}Use in source · 1 passage
Search aliases: sup_a∈ A_t sup in mathcal
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 487
item[Counterfactual accuracy.] δ_Q = sup_a∈ A_t |widehat Q_t(a)-Q_t^g(amid w,e)|.
Exact mathematical passage
\delta_Q = \sup_{a\in\mathcal A_t} |\widehat Q_t(a)-Q_t^g(a\mid w,e)|.
\sup_{a\in\mathcal G}Use in source · 1 passage
Search aliases: sup_a∈ G sup in mathcal
Use in source · 02-static-core-transfer-theory.tex, line 375
The edgewise defect is Ξ_e(a) = H_eρ_s(e)(a)-ρ_t(e)(a)H_e. For a bounded generating family G⊆ A, define η_int( G) = sup_a∈ G ∑_e∈ Ew_e Ξ_e(a) ^2. When A is normed and its unit ball is appropriate, one may take G={a: a _ A≤1}. Exact representational universality means η_int=0, while approximate universality means η_int≤ε_int. The use of a generating family prevents the definition from depending on an unbounded rescaling of algebra elements.
Exact mathematical passage
\eta_{\mathrm{int}}(\mathcal G) = \sup_{a\in\mathcal G} \sum_{e\in E}w_e\|\Xi_e(a)\|^2.
\sup_{c,c'}Use in source · 1 passage
Search aliases: sup_c,c' sup
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 300
Cue dependence must be reported separately. For matched initial goal g, define δ_G^cue(τ) = sup_c,c' D_G ( P(G_t+τ∈·midι_g,do(C=c)), P(G_t+τ∈·midι_g,do(C=c')) ). High cue dependence is not a failure when the claimed agent is intentionally instruction following. It does mean that persistence cannot be attributed to an autonomous internal objective without an additional cue-removal result.
Exact mathematical passage
\delta_G^{\mathrm{cue}}(\tau) = \sup_{c,c'} D_G \left( \mathbb P(G_{t+\tau}\in\cdot\mid\iota_g,\operatorname{do}(C=c)), \mathbb P(G_{t+\tau}\in\cdot\mid\iota_g,\operatorname{do}(C=c')) \right).
\sup_{g,g',w,e}Use in source · 1 passage
Search aliases: sup_g,g',w,e sup
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 203
Goal-dependent action mediation is measured by feasible interventions on the goal channel while matching the current workspace and external context. For a divergence D_A, define η_G→ A = sup_g,g',w,e D_A ( P(A_t∈·midι_g,w,e), P(A_t∈·midι_g',w,e) ). Workspace-dependent action mediation is η_W→ A = sup_w,w',g,e D_A ( P(A_t∈·midι_w,g,e), P(A_t∈·midι_w',g,e) ). An action must also alter the declared future: η_A→ Y = sup_a,a',b D_Y ( P(Y_t^+∈·midι_a,b), P(Y_t^+∈·midι_a',b) ). A positive η_G→ A withou…
Exact mathematical passage
\eta_{G\to A} = \sup_{g,g',w,e} D_A \left( \mathbb P(A_t\in\cdot\mid\iota_g,w,e), \mathbb P(A_t\in\cdot\mid\iota_{g'},w,e) \right).
\sup_{\jmath,\jmath'}Use in source · 1 passage
Search aliases: sup_jmath,jmath' sup jmath jmath
Use in source · 08-causal-efficacy-and-reentry.tex, line 175
A stronger mediation test equalizes the workspace state after two distinct channel interventions. Let μ be a common imposed workspace distribution, implemented by a feasible stochastic intervention in the sense of Definition~[source reference]. The notation below is shorthand for that implementation. Define the residual mediation defect δ_med = sup_jmath,jmath' D ( P^jmath,do(W_t∼μ)(Y_t^+), P^jmath',do(W_t∼μ)(Y_t^+) ). A small value means that once the workspace state is equalized, little of the…
Exact mathematical passage
\delta_{\mathrm{med}} = \sup_{\jmath,\jmath'} D\!\left( \mathbb P^{\jmath,\operatorname{do}(W_t\sim\mu)}(Y_t^+), \mathbb P^{\jmath',\operatorname{do}(W_t\sim\mu)}(Y_t^+) \right).
\sup_PUse in source · 1 passage
Search aliases: sup_P sup
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 946
sel, and let D_cert be independent of D_sel. For every fixed ς∈ S, let ϕ_ς( D_cert)∈{0,1} be a certificate rule satisfying sup_P:Cert(W;ς)=0 P_P(ϕ_ς=1) ≤α. Then the selected-specification procedure satisfies sup_P P_P( ϕ_widehatς=1, Cert(W;widehatς)=0 ) ≤α.
Exact mathematical passage
\boxed{ \sup_P \mathbb P_P\left( \phi_{\widehat\varsigma}=1, \operatorname{Cert}(W;\widehat\varsigma)=0 \right) \leq\alpha. }
\sup_{P:\,\operatorname{Cert}_{\mathfrak S}(W)=0}Use in source · 1 passage
Search aliases: sup_P: Cert_ S(W)=0 sup operatorname mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 762
[Uniform finite-sample certification across specifications] Under the uniform error event above, declare a specification-robust certificate only when widehatunderline m_q,1-δ^ S>0 for every q∈ J_*. Then sup_P: Cert_ S(W)=0 P_P ( the robust certificate is declared ) ≤δ.
Exact mathematical passage
\boxed{ \sup_{P:\,\operatorname{Cert}_{\mathfrak S}(W)=0} \mathbb P_P \left( \text{the robust certificate is declared} \right) \leq\delta. }
\sup_{P:\operatorname{Cert}(W;\varsigma)=0}Use in source · 1 passage
Search aliases: sup_P:Cert(W;ς)=0 sup operatorname varsigma
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 940
em[Validity after independent specification selection] Let widehatς be selected using D_sel, and let D_cert be independent of D_sel. For every fixed ς∈ S, let ϕ_ς( D_cert)∈{0,1} be a certificate rule satisfying sup_P:Cert(W;ς)=0 P_P(ϕ_ς=1) ≤α. Then the selected-specification procedure satisfies sup_P P_P( ϕ_widehatς=1, Cert(W;widehatς)=0 ) ≤α.
Exact mathematical passage
\sup_{P:\operatorname{Cert}(W;\varsigma)=0} \mathbb P_P\bigl(\phi_\varsigma=1\bigr) \leq\alpha.
\sup_{q,\varsigma}Use in source · 1 passage
Search aliases: sup_q,ς sup varsigma
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 806
Suppose S and J_* are finite, and each margin is estimated as widehat m_q(ς) = frac1n∑_i=1^nZ_i,q,ς-θ_q,ς, 0≤ Z_i,q,ς≤1, from independent certification units. Hoeffding's inequality and a union bound give P( sup_q,ς | widehat m_q(ς)-m_q(ς) | > sqrt frac log(2| J_*|| S|/δ) 2n ) ≤δ. Thus the choice ε_n(δ) = sqrt frac log(2| J_*|| S|/δ) 2n yields an explicit conservative certificate. Dependent episodes require a bound appropriate to the true independent unit rather than token-level or edge-level ps…
Exact mathematical passage
\mathbb P\left( \sup_{q,\varsigma} \left| \widehat m_q(\varsigma)-m_q(\varsigma) \right| > \sqrt{ \frac{ \log\bigl(2|\mathcal J_*||\mathfrak S|/\delta\bigr) }{2n}} \right) \leq\delta.
\sup_{r\in\mathcal R}Use in source · 1 passage
Search aliases: sup_r∈ R sup in mathcal
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 796
[Repair selection under value-model error] Fix a damage intervention d and a finite feasible repair set R. Let V(r)=V_t^rep(r;d) be the true expected post-repair integrity margin and let widehat V obey sup_r∈ R|widehat V(r)-V(r)| ≤ ε_R. Let widehat r∈argmax_rwidehat V(r) and r^*∈argmax_r V(r). Then V(r^*)-V(widehat r) ≤ 2ε_R. If V(r^*) ≥ ρ+2ε_R, then the selected repair restores the expected reserve: V(widehat r)≥ρ. If r^* is unique and its repair-value gap exceeds 2ε_R, then widehat r=r^*.
Exact mathematical passage
\sup_{r\in\mathcal R}|\widehat V(r)-V(r)| \leq \varepsilon_R.
\sup_SUse in source · 1 passage
Search aliases: sup_S sup
Use in source · 15-boundary-formation-and-stability.tex, line 281
If the score depends on a parameter ϑ_t and satisfies sup_S | B_ϑ(S)- B_ϑ'(S)| ≤ L_Bd(ϑ,ϑ'), then the sufficient stability condition becomes 2L_Bd(ϑ_t,ϑ_t+1) < Δ_t^B.
Exact mathematical passage
\sup_S |\mathcal B_{\vartheta}(S)-\mathcal B_{\vartheta'}(S)| \leq L_Bd(\vartheta,\vartheta'),
\sup_{\substack{c\in W\\\|c\|=1}}Use in source · 1 passage
Search aliases: sup_substackc∈ W c =1 sup substack in
Use in source · 04-approximate-workspaces.tex, line 267
For c≠0, define the Rayleigh defect δ_coh(c) = frac E_H(c) c ^2. For a nonzero subspace W⊆ C_V, define δ_coh(W) = sup_substackc∈ W c =1 E_H(c). If W is L_H-invariant, then δ_coh(W) = L_H|_W . In particular, δ_coh(Γ_ε(H)) ≤ε.
Exact mathematical passage
\delta_{\mathrm{coh}}(W) = \sup_{\substack{c\in W\\\|c\|=1}} \mathcal E_H(c).
\sup_{S\in\mathfrak S_{\mathrm{pass}}}Use in source · 2 passages
Search aliases: sup_S∈ S_pass sup in mathfrak mathrm
Use in source · 15-boundary-formation-and-stability.tex, line 204
[Held-out boundary recovery] Let S_pass be finite and let S_t^* = argmax_S∈ S_pass B_t(S) be unique. Define the population margin Δ_t^B = B_t(S_t^*) - max_S≠ S_t^* B_t(S)>0. If sup_S∈ S_pass | widehat B_t(S)- B_t(S) | ≤ε_t, then every empirical maximizer widehat S_t satisfies B_t(S_t^*)- B_t(widehat S_t) ≤2ε_t. If 2ε_t<Δ_t^B, then widehat S_t=S_t^*.
Exact mathematical passage
\sup_{S\in\mathfrak S_{\mathrm{pass}}} \left| \widehat{\mathcal B}_t(S)-\mathcal B_t(S) \right| \leq\varepsilon_t,
\sup_tUse in source · 5 passages
Search aliases: sup_t sup
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 247
For every damage family, report η_D→ M, η_M→ R, η_R→ v, Δ_repair^spec, δ_rep-id, sup_t e_t. The repeated-disturbance experiment must contain: item a no-damage baseline; item damage with repair disabled; item damage with the intact repair loop; item monitor ablation; item cost-matched random repair; item off-workspace repair; item repeated and compound damage; and item a held-out disturbance distribution.
Exact mathematical passage
\eta_{D\to M}, \qquad \eta_{M\to R}, \qquad \eta_{R\to v}, \qquad \Delta_{\mathrm{repair}}^{\mathrm{spec}}, \qquad \delta_{\mathrm{rep-id}}, \qquad \sup_t e_t.
\sup_{w,w',b}Use in source · 1 passage
Search aliases: sup_w,w',b sup
Use in source · 08-causal-efficacy-and-reentry.tex, line 70
ility laws. For a matched background value b, define CE_Workspace(w,w';b) = D ( P^ι_w(Y_t^+∈·mid B_t=b), P^ι_w'(Y_t^+∈·mid B_t=b) ). For a declared comparison design ν over (w,w',b), define η_causal^ν = E_(w,w',b)∼ν [ CE_Workspace(w,w';b) ]. The maximum η_causal^max = sup_w,w',bCE_Workspace(w,w';b) may be useful for discovery, but a design-weighted effect is harder to inflate by selecting a single exceptional pair after inspection.
Exact mathematical passage
\eta_{\mathrm{causal}}^{\max} = \sup_{w,w',b}\CE_{\Workspace}(w,w';b)
\sup_{w,w',g,e}Use in source · 1 passage
Search aliases: sup_w,w',g,e sup
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 214
Goal-dependent action mediation is measured by feasible interventions on the goal channel while matching the current workspace and external context. For a divergence D_A, define η_G→ A = sup_g,g',w,e D_A ( P(A_t∈·midι_g,w,e), P(A_t∈·midι_g',w,e) ). Workspace-dependent action mediation is η_W→ A = sup_w,w',g,e D_A ( P(A_t∈·midι_w,g,e), P(A_t∈·midι_w',g,e) ). An action must also alter the declared future: η_A→ Y = sup_a,a',b D_Y ( P(Y_t^+∈·midι_a,b), P(Y_t^+∈·midι_a',b) ). A positive η_G→ A withou…
Exact mathematical passage
\eta_{W\to A} = \sup_{w,w',g,e} D_A \left( \mathbb P(A_t\in\cdot\mid\iota_w,g,e), \mathbb P(A_t\in\cdot\mid\iota_{w'},g,e) \right).
\sup_{x\in\mathcal R_r}Use in source · 1 passage
Search aliases: sup_x∈ R_r sup in mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1057
ound] Let F_r: H_r→ H_r+1, widetilde F_r: H_r→ H_r+1 be exact and implemented level-collapse maps for r=0,…,R-1. Let R_r⊆ H_r contain the exact and implemented states reachable at level r. Assume, on R_r, F_r(x)-F_r(y) ≤ L_r x-y and sup_x∈ R_r widetilde F_r(x)-F_r(x) ≤ δ_r. Then · widetilde F_R-1∘⋯∘widetilde F_0(x) - F_R-1∘⋯∘ F_0(x)
Exact mathematical passage
\sup_{x\in\mathcal R_r} \|\widetilde F_r(x)-F_r(x)\| \leq \delta_r.
\sup_{\theta\in\mathfrak T}Use in source · 1 passage
Search aliases: sup_θ∈ T sup theta in mathfrak
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 615
orem[Uniform structure-selection recovery] Let T be a finite candidate family with population score J: T→ R. Let θ_* = argmin_θ∈ TJ(θ) be unique, with margin Δ_J = min_θ≠θ_* (J(θ)-J(θ_*))>0. If a held-out estimate widehat J satisfies sup_θ∈ T |widehat J(θ)-J(θ)| ≤ε, then every empirical minimizer widehatθ obeys J(widehatθ)-J(θ_*) ≤2ε. If 2ε<Δ_J, then widehatθ=θ_*.
Exact mathematical passage
\sup_{\theta\in\mathfrak T} |\widehat J(\theta)-J(\theta)| \leq\varepsilon,
\sup_{\lambda\in\Lambda_n}Use in source · 1 passage
Search aliases: sup_λ∈Λ_n sup lambda in Lambda
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 188
Let Q(λ) be a gate-specific population order parameter and widehat Q_n(λ) its held-out estimate. If sup_λ∈Λ_n |widehat Q_n(λ)-Q(λ)| ≤ε_n on a finite evaluation grid Λ_n, then every threshold crossing with vertical margin larger than 2ε_n is recovered by the same uniform-selection argument as Theorem~[source reference]. Near a continuous transition, the margin vanishes and sample requirements necessarily grow. A broad, slowly varying crossover should not be reported as a sharp phase transition wi…
Exact mathematical passage
\sup_{\lambda\in\Lambda_n} |\widehat Q_n(\lambda)-Q(\lambda)| \leq\varepsilon_n
\sup_{\varsigma\in\mathfrak S}Use in source · 5 passages
Search aliases: sup_ς∈ S sup varsigma in mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 202
For each gate q∈ J_*, define the specification envelope underline m_q^ S(W) = inf_ς∈ Sm_q(W;ς), overline m_q^ S(W) = sup_ς∈ Sm_q(W;ς). Its sensitivity width is Δ_q^spec(W) = overline m_q^ S(W) - underline m_q^ S(W). The robust certificate margin is r_ S(W) = inf_ς∈ S min_q∈ J_*m_q(W;ς). Then Cert_ S(W)=1 Longleftrightarrow r_ S(W)>0.
Exact mathematical passage
\boxed{ \underline m_q^{\mathfrak S}(W) = \inf_{\varsigma\in\mathfrak S}m_q(W;\varsigma), \qquad \overline m_q^{\mathfrak S}(W) = \sup_{\varsigma\in\mathfrak S}m_q(W;\varsigma). }
\operatorname{supp}Use in source · 3 passages
Search aliases: supp operatorname
Use in source · 11-reconstruction-and-resilience.tex, line 299
Define the accessible block support of c≠0 by supp_E(c) = {i∈ V:E_ic≠0} and define the node-erasure distance d_er = min_c≠0|supp_E(c)|.
Exact mathematical passage
\operatorname{supp}_E(c) = \{i\in V:E_ic\neq0\}
\operatorname{supp}_EUse in source · 3 passages
Search aliases: supp_E operatorname
Use in source · 11-reconstruction-and-resilience.tex, line 299
Define the accessible block support of c≠0 by supp_E(c) = {i∈ V:E_ic≠0} and define the node-erasure distance d_er = min_c≠0|supp_E(c)|.
Exact mathematical passage
\operatorname{supp}_E(c) = \{i\in V:E_ic\neq0\}
\mathrm{sym}Use in source · 1 passage
Search aliases: sym mathrm
Use in source · 12-identity-through-time-and-replacement.tex, line 583
d path quasi-pseudometric d_path^rightarrow( R_0, R_T) = inf_ J_0:T Len( J_0:T). Concatenation gives the directed triangle inequality. Because replacement costs and intervention divergences need not be symmetric, symmetry is not assumed. When reverse correspondences exist, define the symmetrized pseudometric d_path^sym( R, R') = max{ d_path^rightarrow( R, R'), d_path^rightarrow( R', R) }. Distinct physical realizations can have zero symmetrized pseudodistance when an exact correspondence exists …
Exact mathematical passage
\boxed{ d_{\mathrm{path}}^{\mathrm{sym}}(\mathfrak R,\mathfrak R') = \max\left\{ d_{\mathrm{path}}^{\rightarrow}(\mathfrak R,\mathfrak R'), d_{\mathrm{path}}^{\rightarrow}(\mathfrak R',\mathfrak R) \right\}. }
\mathsf{SYN}Use in source · 11 passages
Search aliases: SYN mathsf
Use in source · 23-relation-to-prior-work.tex, line 15
The audit uses five labels: ll STD · = established concept, theorem, or technique, ADP · = established machinery adapted to relational workspaces, SYN · = nontrivial synthesis of established components, CAN · = candidate original contribution requiring priority review, EMP · = empirical claim not yet established in an uncontrolled system. These labels describe the status of a claim, not its importance. A standard result may be indispensable. A synthesis may be scientifically useful without conta…
Exact mathematical passage
\begin{array}{ll} \mathsf{STD} & = \text{established concept, theorem, or technique},\\ \mathsf{ADP} & = \text{established machinery adapted to relational workspaces},\\ \mathsf{SYN} & = \text{nontrivial synthesis of established components},\\ \mathsf{CAN} & = \text{candidate original contribution requiring priority review},\\ \mathsf{EMP} & = \text{empirical claim not yet established in an uncontrolled system}. \end{array}
\mathrm{sys}Use in source · 2 passages
Search aliases: sys mathrm
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 245
Let B_t^sys be an internal membership or routing state used by the system, and let S_t^* = argmax_S∈ S_pass B_t(S) be the population boundary defined by the external certification protocol. The strong endogenous boundary conjecture asserts that there are adaptive systems and nontrivial environments for which: · d_B(B_t^sys,S_t^*)→0,
Exact mathematical passage
B_t^{\mathrm{sys}}
\mathfrak TUse in source · 4 passages
Search aliases: T mathfrak
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 600
[Uniform structure-selection recovery] Let T be a finite candidate family with population score J: T→ R. Let θ_* = argmin_θ∈ TJ(θ) be unique, with margin Δ_J = min_θ≠θ_* (J(θ)-J(θ_*))>0. If a held-out estimate widehat J satisfies sup_θ∈ T |widehat J(θ)-J(θ)| ≤ε, then every empirical minimizer widehatθ obeys J(widehatθ)-J(θ_*) ≤2ε. If 2ε<Δ_J, then widehatθ=θ_*.
Exact mathematical passage
\mathfrak T
\mathsf TUse in source · 14 passages
Search aliases: T mathsf
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 453
[Population transfer identification] Let X∈ R^d_u and Y∈ R^d_v satisfy Y=H_*X+ξ, E[ξ X^ T]=0, and assume Σ_XX = E[XX^ T] succeq κ I for some κ>0. Then H_* is the unique minimizer of R(H) = E Y-HX _2^2, with H_* = Σ_YXΣ_XX^-1. Moreover, R(H)- R(H_*) = tr ( (H-H_*)Σ_XX(H-H_*)^ T ) ≥ κ H-H_* _F^2.
Exact mathematical passage
Y=H_*X+\xi, \qquad \mathbb E[\xi X^{\mathsf T}]=0,
t^-Use in source · 2 passages
Search aliases: t^-
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 847
Restoration of performance is not automatically restoration of identity. Let W_t^- be the last certified pre-damage workspace and let W_t+τ^r be the post-repair workspace. Define the repair identity defect δ_rep-id(r) = d_id ( W_t^-,W_t+τ^r ). A repair action is identity preserving at tolerance ε_id when Δ_t^rep(r;d)>0, δ_rep-id(r) ≤ ε_id. When integrity is restored but the identity defect exceeds tolerance, the result is better described as a successor or replacement workspace. This terminologi…
Exact mathematical passage
W_{t^-}
T_1Use in source · 8 passages
Search aliases: T_1
Use in source · 04-approximate-workspaces.tex, line 694
[Pathwise core--residual Duhamel formula] The deviation of full path transport from pure core transport is exactly · T_m⋯ T_1ι_i_0^C - ι_i_m^C H_m⋯ H_1 · = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r
Exact mathematical passage
\boxed{ \begin{aligned} &T_m\cdots T_1\iota_{i_0}^C - \iota_{i_m}^C H_m\cdots H_1\\ &\qquad= \sum_{r=1}^{m} T_m\cdots T_{r+1} \iota_{i_r}^R V_r H_{r-1}\cdots H_1. \end{aligned} }
T_{10}Use in source · 3 passages
Search aliases: T_10
Use in source · 19-summary-of-main-results.tex, line 205
subtopicT_10: Approximate universality theorem
Exact mathematical passage
T_{10}
T_{11}Use in source · 2 passages
Search aliases: T_11
Use in source · 19-summary-of-main-results.tex, line 219
subtopicT_11: Core--residual accumulation theorem
Exact mathematical passage
T_{11}
T_{12}Use in source · 4 passages
Search aliases: T_12
Use in source · 06-dynamic-workspace-theory.tex, line 144
[Predictive-state sufficiency and minimality, T_12] Under Definition~[source reference]: item Z_t is predictively sufficient: Y_t^+indep H_tmid Z_t. item If S_t=s( H_t) is any other history statistic satisfying Y_t^+indep H_tmid S_t, then there is a measurable map ϕ such that Z_t=ϕ(S_t) almost surely. item Consequently, any two minimal sufficient predictive states are measurably isomorphic after removal of null sets.
Exact mathematical passage
T_{12}
T_{13}Use in source · 3 passages
Search aliases: T_13
Use in source · 08-causal-efficacy-and-reentry.tex, line 246
[Operational relationality, T_13] Let Y be finite, let P be the intact law at a fixed decision time, and let W_t=π_t( H_t) be a structurally supported candidate. Let Q⊆ N_pred(P) be a nonempty, predeclared panel of validated relation-breaking nulls. Assume: item exact structural--operational alignment, I_P(Y_t^+; H_tmid W_t)=0; item a positive node-level information gap, δ_node = min_i∈ V I_P(Y_t^+; H_tmid H_t^i) >0; item a positive robust matched-null gap, δ_null = min_Q∈ Q [ H_Q(Y_t^+mid H_t) …
Exact mathematical passage
T_{13}
T_{14}Use in source · 3 passages
Search aliases: T_14
Use in source · 12-identity-through-time-and-replacement.tex, line 387
subtopic41.1 Replacement invariance theorem T_14
Exact mathematical passage
T_{14}
T_{15}Use in source · 4 passages
Search aliases: T_15
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 449
subtopic49.3 Transfer identification theorem T_15
Exact mathematical passage
T_{15}
T_{16}Use in source · 2 passages
Search aliases: T_16
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 593
subtopic49.4 Held-out structure-selection theorem T_16
Exact mathematical passage
T_{16}
T_{17}Use in source · 4 passages
Search aliases: T_17
Use in source · 15-boundary-formation-and-stability.tex, line 185
subtopic51.2 Stable boundary recovery T_17
Exact mathematical passage
T_{17}
T_{18}Use in source · 3 passages
Search aliases: T_18
Use in source · 19-summary-of-main-results.tex, line 392
subtopicT_18: Model-specific formation transition theorem
Exact mathematical passage
T_{18}
T_{19}Use in source · 3 passages
Search aliases: T_19
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 314
subtopic52.7 T_19: Cue-controlled goal-retention theorem
Exact mathematical passage
T_{19}
T_{1_i}Use in source · 1 passage
Search aliases: T_1_i
Use in source · 02-static-core-transfer-theory.tex, line 38
For every i∈ V, assign a finite-dimensional Hilbert space X_i. For every edge, assign a linear transfer T_e:X_s(e)⟶ X_t(e). The path transfer is T_γ=T_e_m⋯ T_e_2T_e_1, T_1_i=I_X_i. Accordingly, the static transfer system is a functor X:Path(G)⟶FinHilb.
Exact mathematical passage
T_\gamma=T_{e_m}\cdots T_{e_2}T_{e_1}, \qquad T_{1_i}=I_{X_i}.
T_2Use in source · 4 passages
Search aliases: T_2
Use in source · 04-approximate-workspaces.tex, line 781
For two consecutive transfers, P_i_2T_2T_1P_i_0 = H_2H_1+U_2V_1, Q_i_2T_2T_1P_i_0 = V_2H_1+K_2V_1. Thus leakage out of the core is first order in the blocks V_r, while an excursion that leaves and then returns to the core contains at least one V-block and one later U-block. For a fixed path length, if U_r , V_r =O(δ) and the diagonal blocks remain bounded, the residual-mediated correction to pure core-to-core transport is O(δ^2), whereas terminal residual leakage can be O(δ). This distinction se…
Exact mathematical passage
P_{i_2}T_2T_1P_{i_0} = H_2H_1+U_2V_1,
T_{20}Use in source · 3 passages
Search aliases: T_20
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 509
subtopic53.3 T_20: Approximate counterfactual policy theorem
Exact mathematical passage
T_{20}
T_{21}Use in source · 2 passages
Search aliases: T_21
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 786
subtopic53.8 T_21: Repair-selection margin theorem
Exact mathematical passage
T_{21}
T_{22}Use in source · 3 passages
Search aliases: T_22
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 872
subtopic53.10 T_22: Closed-loop self-maintenance theorem
Exact mathematical passage
T_{22}
T_{23}Use in source · 3 passages
Search aliases: T_23
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1065
subtopic53.14 T_23: Workspace-agency synthesis theorem
Exact mathematical passage
T_{23}
T_{24}Use in source · 3 passages
Search aliases: T_24
Use in source · 19-summary-of-main-results.tex, line 537
subtopicT_24: Gatewise certification-validity theorem
Exact mathematical passage
T_{24}
T_{25}Use in source · 3 passages
Search aliases: T_25
Use in source · 19-summary-of-main-results.tex, line 155
subtopicT_25: Faithful coarse-graining theorem
Exact mathematical passage
T_{25}
T_{26}Use in source · 2 passages
Search aliases: T_26
Use in source · 19-summary-of-main-results.tex, line 171
subtopicT_26: Bayes-risk transport theorem
Exact mathematical passage
T_{26}
T_{27}Use in source · 3 passages
Search aliases: T_27
Use in source · 19-summary-of-main-results.tex, line 186
subtopicT_27: Decomposition-transport robustness theorem
Exact mathematical passage
T_{27}
T_{28}Use in source · 3 passages
Search aliases: T_28
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 318
subtopic62.3 T_28: Specification-transport robustness theorem
Exact mathematical passage
T_{28}
T_{29}Use in source · 2 passages
Search aliases: T_29
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 451
subtopic63.1 T_29: Non-identifiability impossibility theorem
Exact mathematical passage
T_{29}
T_{2a}Use in source · 2 passages
Search aliases: T_2a
Use in source · 19-summary-of-main-results.tex, line 19
subtopicT_2a: Workspace commutant theorem O_Workspace ≅ Comm(Hol_o).
Exact mathematical passage
T_{2a}
T_3Use in source · 2 passages
Search aliases: T_3
Use in source · 19-summary-of-main-results.tex, line 26
subtopicT_3: Transfer-Laplacian kernel theorem ker L_H=Γ(H).
Exact mathematical passage
T_3
T_{30}Use in source · 2 passages
Search aliases: T_30
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 639
subtopic64.2 T_30: Joint specification-identification theorem
Exact mathematical passage
T_{30}
T_{31}Use in source · 2 passages
Search aliases: T_31
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 750
subtopic65.1 T_31: Uniform specification-certificate theorem
Exact mathematical passage
T_{31}
T_{32}Use in source · 3 passages
Search aliases: T_32
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 929
subtopic66.2 T_32: Sample-split selection theorem
Exact mathematical passage
T_{32}
T_4Use in source · 2 passages
Search aliases: T_4
Use in source · 19-summary-of-main-results.tex, line 31
subtopicT_4: Spectral stability theorem If η= widetilde L_H-L_H <g_d/2, then widetilde P_d-P_d ≤ fracηg_d-η ≤ frac2ηg_d.
Exact mathematical passage
T_4
T_5Use in source · 2 passages
Search aliases: T_5
Use in source · 19-summary-of-main-results.tex, line 41
subtopicT_5: Gauge invariance theorem Γ(H^g)=G_VΓ(H), and under unitary gauge, L_H^g=G_VL_HG_V^-1.
Exact mathematical passage
T_5
T_6Use in source · 3 passages
Search aliases: T_6
Use in source · 10-persistence.tex, line 200
subtopic32.3 Persistence theorem T_6
Exact mathematical passage
T_6
T_7Use in source · 4 passages
Search aliases: T_7
Use in source · 11-reconstruction-and-resilience.tex, line 102
subtopic35.1 Stable reconstruction theorem T_7
Exact mathematical passage
T_7
T_8Use in source · 3 passages
Search aliases: T_8
Use in source · 19-summary-of-main-results.tex, line 96
subtopicT_8: Exact gluing theorem
Exact mathematical passage
T_8
T_9Use in source · 3 passages
Search aliases: T_9
Use in source · 19-summary-of-main-results.tex, line 128
subtopicT_9: Hierarchical collapse theorem
Exact mathematical passage
T_9
T_{e_1}Use in source · 1 passage
Search aliases: T_e_1
Use in source · 02-static-core-transfer-theory.tex, line 38
For every i∈ V, assign a finite-dimensional Hilbert space X_i. For every edge, assign a linear transfer T_e:X_s(e)⟶ X_t(e). The path transfer is T_γ=T_e_m⋯ T_e_2T_e_1, T_1_i=I_X_i. Accordingly, the static transfer system is a functor X:Path(G)⟶FinHilb.
Exact mathematical passage
T_\gamma=T_{e_m}\cdots T_{e_2}T_{e_1}, \qquad T_{1_i}=I_{X_i}.
T_{e_2}Use in source · 1 passage
Search aliases: T_e_2
Use in source · 02-static-core-transfer-theory.tex, line 38
For every i∈ V, assign a finite-dimensional Hilbert space X_i. For every edge, assign a linear transfer T_e:X_s(e)⟶ X_t(e). The path transfer is T_γ=T_e_m⋯ T_e_2T_e_1, T_1_i=I_X_i. Accordingly, the static transfer system is a functor X:Path(G)⟶FinHilb.
Exact mathematical passage
T_\gamma=T_{e_m}\cdots T_{e_2}T_{e_1}, \qquad T_{1_i}=I_{X_i}.
T_{e_m}Use in source · 1 passage
Search aliases: T_e_m
Use in source · 02-static-core-transfer-theory.tex, line 38
For every i∈ V, assign a finite-dimensional Hilbert space X_i. For every edge, assign a linear transfer T_e:X_s(e)⟶ X_t(e). The path transfer is T_γ=T_e_m⋯ T_e_2T_e_1, T_1_i=I_X_i. Accordingly, the static transfer system is a functor X:Path(G)⟶FinHilb.
Exact mathematical passage
T_\gamma=T_{e_m}\cdots T_{e_2}T_{e_1}, \qquad T_{1_i}=I_{X_i}.
T_{e_r}Use in source · 1 passage
Search aliases: T_e_r
Use in source · 04-approximate-workspaces.tex, line 677
Let a path have vertices i_0xrightarrowe_1i_1xrightarrowe_2⋯ xrightarrowe_mi_m. Write T_r=T_e_r, H_r=H_e_r, V_r=V_e_r, and let ι_i^C:C_i↪ X_i, ι_i^R:R_i↪ X_i be the canonical inclusions. Empty products below are identities.
Exact mathematical passage
T_r=T_{e_r}, \quad H_r=H_{e_r}, \quad V_r=V_{e_r},
T_{e_{r+1}}Use in source · 1 passage
Search aliases: T_e_r+1
Use in source · 02-static-core-transfer-theory.tex, line 241
For a single edge, V_e=0 means T_e(c,0)=(H_ec,0), so core states remain in the core. Inductively, if the first r transfers map c to (H_e_r⋯ H_e_1c,0), applying T_e_r+1 gives (H_e_r+1H_e_r⋯ H_e_1c,0). The conclusion follows after m steps.
Exact mathematical passage
T_{e_{r+1}}
T_{e_\ell}Use in source · 1 passage
Search aliases: T_e_ℓ ell
Use in source · 19-summary-of-main-results.tex, line 222
For a path γ=e_m⋯ e_1, Q_t(γ)T_γ P_s(γ) ≤ ∑_r=1^m · ( ∏_ℓ=r+1^m T_e_ℓ ) V_e_r · × ( ∏_ℓ=1^r-1 H_e_ℓ ). The same bound controls the defect between full core-to-core path transport and the pure core product. An exact Duhamel identity yields both estimates.
Exact mathematical passage
\boxed{ \begin{aligned} \|Q_{t(\gamma)}T_\gamma P_{s(\gamma)}\| \leq \sum_{r=1}^{m} &\left( \prod_{\ell=r+1}^{m}\|T_{e_\ell}\| \right) \|V_{e_r}\|\\ &\times \left( \prod_{\ell=1}^{r-1}\|H_{e_\ell}\| \right). \end{aligned} }
T_fUse in source · 2 passages
Search aliases: T_f
Use in source · 02-static-core-transfer-theory.tex, line 201
For composable edges e:i→ j and f:j→ k, direct block multiplication gives T_fT_e = H_fH_e+U_fV_e · H_fU_e+U_fK_e V_fH_e+K_fV_e · V_fU_e+K_fK_e . The induced core-to-core block is therefore P_kT_fT_eP_i = H_fH_e+U_fV_e. The term U_fV_e is a residual-mediated correction: information leaves the candidate core at the intermediate node and later re-enters it. Consequently, the simple path product H_fH_e faithfully represents full core transport only under a preservation condition such as V_e=0, or un…
Exact mathematical passage
T_fT_e = \begin{pmatrix} H_fH_e+U_fV_e & H_fU_e+U_fK_e\\ V_fH_e+K_fV_e & V_fU_e+K_fK_e \end{pmatrix}.
T_mUse in source · 4 passages
Search aliases: T_m
Use in source · 04-approximate-workspaces.tex, line 694
[Pathwise core--residual Duhamel formula] The deviation of full path transport from pure core transport is exactly · T_m⋯ T_1ι_i_0^C - ι_i_m^C H_m⋯ H_1 · = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r
Exact mathematical passage
\boxed{ \begin{aligned} &T_m\cdots T_1\iota_{i_0}^C - \iota_{i_m}^C H_m\cdots H_1\\ &\qquad= \sum_{r=1}^{m} T_m\cdots T_{r+1} \iota_{i_r}^R V_r H_{r-1}\cdots H_1. \end{aligned} }
T_rUse in source · 3 passages
Search aliases: T_r
Use in source · 04-approximate-workspaces.tex, line 677
Let a path have vertices i_0xrightarrowe_1i_1xrightarrowe_2⋯ xrightarrowe_mi_m. Write T_r=T_e_r, H_r=H_e_r, V_r=V_e_r, and let ι_i^C:C_i↪ X_i, ι_i^R:R_i↪ X_i be the canonical inclusions. Empty products below are identities.
Exact mathematical passage
T_r=T_{e_r}, \quad H_r=H_{e_r}, \quad V_r=V_{e_r},
T_{r+1}Use in source · 2 passages
Search aliases: T_r+1
Use in source · 04-approximate-workspaces.tex, line 694
[Pathwise core--residual Duhamel formula] The deviation of full path transport from pure core transport is exactly · T_m⋯ T_1ι_i_0^C - ι_i_m^C H_m⋯ H_1 · = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r
Exact mathematical passage
\boxed{ \begin{aligned} &T_m\cdots T_1\iota_{i_0}^C - \iota_{i_m}^C H_m\cdots H_1\\ &\qquad= \sum_{r=1}^{m} T_m\cdots T_{r+1} \iota_{i_r}^R V_r H_{r-1}\cdots H_1. \end{aligned} }
T_\gammaUse in source · 5 passages
Search aliases: T_γ gamma
Use in source · 02-static-core-transfer-theory.tex, line 38
For every i∈ V, assign a finite-dimensional Hilbert space X_i. For every edge, assign a linear transfer T_e:X_s(e)⟶ X_t(e). The path transfer is T_γ=T_e_m⋯ T_e_2T_e_1, T_1_i=I_X_i. Accordingly, the static transfer system is a functor X:Path(G)⟶FinHilb.
Exact mathematical passage
T_\gamma=T_{e_m}\cdots T_{e_2}T_{e_1}, \qquad T_{1_i}=I_{X_i}.
T_\ellUse in source · 1 passage
Search aliases: T_ℓ ell
Use in source · 04-approximate-workspaces.tex, line 709
· = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r · × (∏_ℓ=1^r-1 H_ℓ ), and the same right-hand side bounds P_i_mT_m⋯ T_1P_i_0-H_m⋯ H_1 .
Exact mathematical passage
\boxed{ \begin{aligned} \|Q_{i_m}T_m\cdots T_1P_{i_0}\| \leq \sum_{r=1}^{m} &\left(\prod_{\ell=r+1}^{m}\|T_\ell\|\right) \|V_r\|\\ &\times \left(\prod_{\ell=1}^{r-1}\|H_\ell\|\right), \end{aligned} }
\tableofcontentsUse in source · 1 passage
Search aliases: tableofcontents
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
\tanhUse in source · 4 passages
Search aliases: tanh
Use in source · 19-summary-of-main-results.tex, line 395
For m_t+1=tanh(λ m_t), there is a unique zero fixed point for 0≤λ≤1. For λ>1, the zero state is unstable and exactly two stable nonzero fixed points appear. Their amplitude satisfies m_λ = sqrtfrac3(λ-1)λ^3 + O((λ-1)^3/2). This is an exact structural benchmark, not a universal law for complete relational workspaces.
Exact mathematical passage
m_{t+1}=\tanh(\lambda m_t),
\mathsf{targets}Use in source · 1 passage
Search aliases: targets mathsf
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1051
The machine-readable record should include: SpecificationRecord ={ · reference, family, equivalence_classes, metric, · targets, losses, horizons, interventions, · null_panels, thresholds, selection_history, · identified_sets, uniform_bounds, gate_envelopes }. Every omitted family member requires a reason. Every changed specification requires a data-split label and time stamp. Every gate requires pointwise and family-wide status.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{SpecificationRecord} =\{& \mathsf{reference}, \mathsf{family}, \mathsf{equivalence\_classes}, \mathsf{metric},\\ &\mathsf{targets}, \mathsf{losses}, \mathsf{horizons}, \mathsf{interventions},\\ &\mathsf{null\_panels}, \mathsf{thresholds}, \mathsf{selection\_history},\\ &\mathsf{identified\_sets}, \mathsf{uniform\_bounds}, \mathsf{gate\_envelopes} \}. \end{aligned} }
\mathrm{task}Use in source · 1 passage
Search aliases: task mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 395
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1 · + λ_stab J_stab + λ_leak J_leak }. The objective is schematic rather than universal. Its purpose is to expose which quantities were fixed and which were optimized. If z and …
Exact mathematical passage
\boxed{ \begin{aligned} \widehat\theta \in \argmin_{z,a,H,P,\mathcal O,B} \Bigl \{& \widehat{\mathcal R}_{\mathrm{task}} + \lambda_{\mathrm{coh}}\|D_{a,H}c\|^2 + \lambda_E\|a\|_1 + \lambda_V\|z\|_1\\ &+ \lambda_{\mathrm{stab}}\mathcal J_{\mathrm{stab}} + \lambda_{\mathrm{leak}}\mathcal J_{\mathrm{leak}} \Bigr\}. \end{aligned} }
\textwidthUse in source · 1 passage
Search aliases: textwidth
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
\mathrm{theorem}Use in source · 1 passage
Search aliases: theorem mathrm
Use in source · 23-relation-to-prior-work.tex, line 101
The analysis does not make one global novelty claim. It uses a priority profile p(C) = ( p_concept, p_object, p_theorem, p_certificate, p_experiment ). For example, the philosophical concept of distributed cognition may be standard while a specific mathematical object is adapted, a theorem is a specialization of known spectral theory, the certificate is a synthesis, and the empirical claim is unresolved. This prevents originality in one coordinate from being used to imply originality in every co…
Exact mathematical passage
\boxed{ \mathbf p(C) = \left( p_{\mathrm{concept}}, p_{\mathrm{object}}, p_{\mathrm{theorem}}, p_{\mathrm{certificate}}, p_{\mathrm{experiment}} \right). }
\mathsf{thresholds}Use in source · 1 passage
Search aliases: thresholds mathsf
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1051
The machine-readable record should include: SpecificationRecord ={ · reference, family, equivalence_classes, metric, · targets, losses, horizons, interventions, · null_panels, thresholds, selection_history, · identified_sets, uniform_bounds, gate_envelopes }. Every omitted family member requires a reason. Every changed specification requires a data-split label and time stamp. Every gate requires pointwise and family-wide status.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{SpecificationRecord} =\{& \mathsf{reference}, \mathsf{family}, \mathsf{equivalence\_classes}, \mathsf{metric},\\ &\mathsf{targets}, \mathsf{losses}, \mathsf{horizons}, \mathsf{interventions},\\ &\mathsf{null\_panels}, \mathsf{thresholds}, \mathsf{selection\_history},\\ &\mathsf{identified\_sets}, \mathsf{uniform\_bounds}, \mathsf{gate\_envelopes} \}. \end{aligned} }
\tilde mUse in source · 1 passage
Search aliases: tilde m tilde
Use in source · 26-discussion-limitations-and-philosophical-consequences.tex, line 28
ly privileged. Decompositions are constrained by access, causal interfaces, intervention separability, temporal continuity, and explicit shared resources. A certificate established only at one interface is a valid but limited claim. A stronger claim reports the full envelope ( widetilde m_q, underline m_q, overline m_q, Δ_q^dec ) for each required gate, where tilde m_q is the reference margin and the remaining terms summarize its behavior across D.
Exact mathematical passage
\tilde m_q
\tilde m_qUse in source · 1 passage
Search aliases: tilde m_q tilde
Use in source · 26-discussion-limitations-and-philosophical-consequences.tex, line 28
ly privileged. Decompositions are constrained by access, causal interfaces, intervention separability, temporal continuity, and explicit shared resources. A certificate established only at one interface is a valid but limited claim. A stronger claim reports the full envelope ( widetilde m_q, underline m_q, overline m_q, Δ_q^dec ) for each required gate, where tilde m_q is the reference margin and the remaining terms summarize its behavior across D.
Exact mathematical passage
\tilde m_q
\mathbf{Top}Use in source · 1 passage
Search aliases: Top mathbf
Use in source · 02-static-core-transfer-theory.tex, line 51
The finite-dimensional Hilbert assumption supplies adjoints and spectral tools. The exact compatible-section definitions require less and may later be formulated in categories such as Ban, Meas, Prob, Top, Alg.
Exact mathematical passage
\mathbf{Ban},\qquad \mathbf{Meas},\qquad \mathbf{Prob},\qquad \mathbf{Top},\qquad \mathbf{Alg}.
\topUse in source · 1 passage
Search aliases: top
Use in source · 03-exact-shared-cores.tex, line 302
0 · -1 . The cycle holonomy is J, hence C_*=ker(J-I)=span{(1,0)^top}. The first coordinate circulates consistently through all three strata. The second returns with its sign reversed and therefore cannot define a nonzero exact shared section. Thus d_Workspace=1.
Exact mathematical passage
C_*=\ker(J-I)=\operatorname{span}\{(1,0)^\top\}.
\mathrm{tot}Use in source · 6 passages
Search aliases: tot mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 577
and the block internal discrepancy widehat D_ U = ⊕_α∈ AD_G_α. For u=(u_α)_α∈widehat C_ U, define the raw overlap synchronization operator (S_ Uu)_αβ = ρ_G_αβ^G_βu_β - ρ_G_αβ^G_αu_α. For an overlap weight λ_ov>0, set K_ U = widehat D_ U [0.2em] sqrtλ_ov S_ U , L_ U^tot = K_ U^*K_ U. Its energy is E_ U^tot(u) = · ∑_α D_G_αu_α ^2
Exact mathematical passage
\boxed{ K_{\mathcal U} = \begin{pmatrix} \widehat D_{\mathcal U}\\[0.2em] \sqrt{\lambda_{\mathrm{ov}}}\,S_{\mathcal U} \end{pmatrix}, \qquad L_{\mathcal U}^{\mathrm{tot}} = K_{\mathcal U}^*K_{\mathcal U}. }
\mathrm{total}Use in source · 3 passages
Search aliases: total mathrm
Use in source · 01-foundational-thesis.tex, line 349
The claim that the workspace is not identical with either participant does not imply that it occupies a separate nonphysical location. Formally, Workspace is an invariant of R, not an additional term appended to the physical realization: R_total eq( R,ghost workspace). The phrase ``between the participants'' is therefore topological or relational: it refers to the organization of maps, cycles, artifacts, and causal dependencies.
Exact mathematical passage
\mathfrak R_{\mathrm{total}} eq(\mathfrak R,\text{ghost workspace}).
\mathrm{tr}Use in source · 13 passages
Search aliases: tr mathrm
Use in source · 02-static-core-transfer-theory.tex, line 188
Core leakage, residual contamination, and total transfer defect are measured by λ_e^out= V_e , λ_e^in= U_e , δ_e^tr = U_e + V_e . These quantities depend on the chosen norms and projectors. Their empirical meaning must therefore be tied to a declared intervention and prediction protocol.
Exact mathematical passage
\delta_e^{\mathrm{tr}} = \|U_e\|+\|V_e\|.
\operatorname{tr}Use in source · 2 passages
Search aliases: tr operatorname
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 481
thm:transfer-identification Let X∈ R^d_u and Y∈ R^d_v satisfy Y=H_*X+ξ, E[ξ X^ T]=0, and assume Σ_XX = E[XX^ T] succeq κ I for some κ>0. Then H_* is the unique minimizer of R(H) = E Y-HX _2^2, with H_* = Σ_YXΣ_XX^-1. Moreover, R(H)- R(H_*) = tr ( (H-H_*)Σ_XX(H-H_*)^ T ) ≥ κ H-H_* _F^2.
Exact mathematical passage
\boxed{ \mathcal R(H)-\mathcal R(H_*) = \operatorname{tr} \left( (H-H_*)\Sigma_{XX}(H-H_*)^{\mathsf T} \right) \geq \kappa\|H-H_*\|_F^2. }
\TVUse in source · 5 passages
Search aliases: TV
Use in source · 06-dynamic-workspace-theory.tex, line 255
Sufficiency has a direct decision-theoretic interpretation. Use the convention TV(P,Q)=sup_A|P(A)-Q(A)|. Let A be a finite action set and ℓ: Y× A→[0,1] a bounded loss. Define Risk_ℓ(S_t) = inf_d E [ ℓ(Y_t^+,d(S_t)) ].
Exact mathematical passage
\TV(P,Q)=\sup_{A}|P(A)-Q(A)|.
uUse in source · 27 passages
Search aliases: u
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
u'Use in source · 1 passage
Search aliases: u'
Use in source · 15-boundary-formation-and-stability.tex, line 95
nate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general. A useful workspace may receive substantial external input. The boundary object…
Exact mathematical passage
\boxed{ \CIn_\tau(S) = \mathbb E_{u,u'\sim\nu_{\bar S}} D\!\left( \mathcal L^{\iota_{\bar S,u}} (X_S(t+\tau)), \mathcal L^{\iota_{\bar S,u'}} (X_S(t+\tau)) \right). }
U_2Use in source · 1 passage
Search aliases: U_2
Use in source · 04-approximate-workspaces.tex, line 781
For two consecutive transfers, P_i_2T_2T_1P_i_0 = H_2H_1+U_2V_1, Q_i_2T_2T_1P_i_0 = V_2H_1+K_2V_1. Thus leakage out of the core is first order in the blocks V_r, while an excursion that leaves and then returns to the core contains at least one V-block and one later U-block. For a fixed path length, if U_r , V_r =O(δ) and the diagonal blocks remain bounded, the residual-mediated correction to pure core-to-core transport is O(δ^2), whereas terminal residual leakage can be O(δ). This distinction se…
Exact mathematical passage
P_{i_2}T_2T_1P_{i_0} = H_2H_1+U_2V_1,
U_eUse in source · 7 passages
Search aliases: U_e
Use in source · 02-static-core-transfer-theory.tex, line 146
Relative to these decompositions, every edge map has the block form T_e= H_e · U_e V_e · K_e , where H_e=P_t(e)T_eP_s(e):C_s(e)→ C_t(e), U_e=P_t(e)T_eQ_s(e):R_s(e)→ C_t(e), V_e=Q_t(e)T_eP_s(e):C_s(e)→ R_t(e), K_e=Q_t(e)T_eQ_s(e):R_s(e)→ R_t(e).
Exact mathematical passage
T_e= \begin{pmatrix} H_e & U_e\\ V_e & K_e \end{pmatrix},
U_fUse in source · 3 passages
Search aliases: U_f
Use in source · 02-static-core-transfer-theory.tex, line 201
For composable edges e:i→ j and f:j→ k, direct block multiplication gives T_fT_e = H_fH_e+U_fV_e · H_fU_e+U_fK_e V_fH_e+K_fV_e · V_fU_e+K_fK_e . The induced core-to-core block is therefore P_kT_fT_eP_i = H_fH_e+U_fV_e. The term U_fV_e is a residual-mediated correction: information leaves the candidate core at the intermediate node and later re-enters it. Consequently, the simple path product H_fH_e faithfully represents full core transport only under a preservation condition such as V_e=0, or un…
Exact mathematical passage
T_fT_e = \begin{pmatrix} H_fH_e+U_fV_e & H_fU_e+U_fK_e\\ V_fH_e+K_fV_e & V_fU_e+K_fK_e \end{pmatrix}.
\mathcal U_{\mathrm{flat}}Use in source · 2 passages
Search aliases: U_flat mathcal mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 970
Let L( T) be the leaf set. Repeated edge completeness implies that the flattened family U_flat = {G_ℓ:ℓ∈ L( T)} is itself an edge-complete cover of G. Let δ_flat^0 be its overlap coboundary and define W_flat = kerδ_flat^0. Theorem~[source reference] and Theorem~[source reference] give W_r ≅ W_flat ≅ mathscr W(G). Equivalently, Lim_ T^rec ( {mathscr W(G_ℓ)}_ℓ∈ L( T) ) ≅ Eq_ U_flat ( {mathscr W(G_ℓ)}_ℓ∈ L( T) ). The notation on the left means recursive finite descent along the tree; the right side…
Exact mathematical passage
\mathcal U_{\mathrm{flat}} = \{G_\ell:\ell\in L(\mathcal T)\}
U_rUse in source · 1 passage
Search aliases: U_r
Use in source · 04-approximate-workspaces.tex, line 794
For two consecutive transfers, P_i_2T_2T_1P_i_0 = H_2H_1+U_2V_1, Q_i_2T_2T_1P_i_0 = V_2H_1+K_2V_1. Thus leakage out of the core is first order in the blocks V_r, while an excursion that leaves and then returns to the core contains at least one V-block and one later U-block. For a fixed path length, if U_r , V_r =O(δ) and the diagonal blocks remain bounded, the residual-mediated correction to pure core-to-core transport is O(δ^2), whereas terminal residual leakage can be O(δ). This distinction se…
Exact mathematical passage
\|U_r\|,\|V_r\|=O(\delta)
u_rUse in source · 2 passages
Search aliases: u_r
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1020
At level r, let K_r be the corresponding total descent operator, γ_r = λ_min^+(K_r^*K_r), K_ru_r ≤ε_r. The nearest exact compatible state then differs from u_r by at most fracε_rsqrtγ_r. Allow an additional implementation, compression, or causal-summary defect ζ_r, and define δ_r = fracε_rsqrtγ_r + ζ_r.
Exact mathematical passage
\gamma_r = \lambda_{\min}^+(K_r^*K_r), \qquad \|K_ru_r\|\leq\varepsilon_r.
u_tUse in source · 3 passages
Search aliases: u_t
Use in source · 10-persistence.tex, line 408
Let C_V(t)= R^2 and let P_t project onto u_t=(cosθ_t,sinθ_t). If U_t^V is rotation through θ_t+1-θ_t and F_t=U_t^V, then a state x_t=u_t obeys e_t=e_t+1=0, μ_t^keep=1. The workspace changes raw coordinates but not abstract identity. If instead F_t=I, then e_t+1 = |sin(θ_t+1-θ_t)|. The same structural motion now produces a state-tracking defect because the actual update fails to transport the content with the workspace.
Exact mathematical passage
u_t=(\cos\theta_t,\sin\theta_t).
U_t^EUse in source · 4 passages
Search aliases: U_t^E
Use in source · 10-persistence.tex, line 33
To compare successive times, choose unitary identification maps U_t^V: C_V(t)⟶ C_V(t+1), U_t^E: C_E(t)⟶ C_E(t+1). They are comparison maps, not assumptions that the physical carriers are identical. Define the one-step diagram defect Δ_t^D = D_t+1U_t^V-U_t^ED_t, δ_t^D= Δ_t^D . Exact temporal compatibility is the condition Δ_t^D=0.
Exact mathematical passage
U_t^V:\mathcal C_V(t)\longrightarrow\mathcal C_V(t+1), \qquad U_t^E:\mathcal C_E(t)\longrightarrow\mathcal C_E(t+1).
U_t^VUse in source · 9 passages
Search aliases: U_t^V
Use in source · 10-persistence.tex, line 33
To compare successive times, choose unitary identification maps U_t^V: C_V(t)⟶ C_V(t+1), U_t^E: C_E(t)⟶ C_E(t+1). They are comparison maps, not assumptions that the physical carriers are identical. Define the one-step diagram defect Δ_t^D = D_t+1U_t^V-U_t^ED_t, δ_t^D= Δ_t^D . Exact temporal compatibility is the condition Δ_t^D=0.
Exact mathematical passage
U_t^V:\mathcal C_V(t)\longrightarrow\mathcal C_V(t+1), \qquad U_t^E:\mathcal C_E(t)\longrightarrow\mathcal C_E(t+1).
u_\alphaUse in source · 5 passages
Search aliases: u_α alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 567
Local candidates may also violate their internal transfer equations. Define the local-copy space widehat C_ U = ⊕_α∈ A C_V(G_α) and the block internal discrepancy widehat D_ U = ⊕_α∈ AD_G_α. For u=(u_α)_α∈widehat C_ U, define the raw overlap synchronization operator (S_ Uu)_αβ = ρ_G_αβ^G_βu_β - ρ_G_αβ^G_αu_α. For an overlap weight λ_ov>0, set K_ U = widehat D_ U
Exact mathematical passage
u=(u_\alpha)_\alpha\in\widehat{\mathcal C}_{\mathcal U}
u_\betaUse in source · 2 passages
Search aliases: u_β beta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 569
l candidates may also violate their internal transfer equations. Define the local-copy space widehat C_ U = ⊕_α∈ A C_V(G_α) and the block internal discrepancy widehat D_ U = ⊕_α∈ AD_G_α. For u=(u_α)_α∈widehat C_ U, define the raw overlap synchronization operator (S_ Uu)_αβ = ρ_G_αβ^G_βu_β - ρ_G_αβ^G_αu_α. For an overlap weight λ_ov>0, set K_ U = widehat D_ U
Exact mathematical passage
(S_{\mathcal U}u)_{\alpha\beta} = \rho_{G_{\alpha\beta}}^{G_\beta}u_\beta - \rho_{G_{\alpha\beta}}^{G_\alpha}u_\alpha.
\mathsf{uncertainty}Use in source · 1 passage
Search aliases: uncertainty mathsf
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 660
The machine-readable record should contain at least the following top-level objects: ResultRecord ={ · claim, specification, specification_family, decomposition, data_splits, formation, · workspace_extractor, goals, actions, interventions, · nulls, gates, identified_sets, specification_envelopes, uncertainty, failures, artifacts }. Each gate object records its symbol, estimator, direction, threshold, point estimate, interval, split, seed set, status, and artifact reference. Each intervention and…
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{ResultRecord} =\{& \mathsf{claim}, \mathsf{specification}, \mathsf{specification\_family}, \mathsf{decomposition}, \mathsf{data\_splits}, \mathsf{formation},\\ &\mathsf{workspace\_extractor}, \mathsf{goals}, \mathsf{actions}, \mathsf{interventions},\\ &\mathsf{nulls}, \mathsf{gates}, \mathsf{identified\_sets}, \mathsf{specification\_envelopes}, \mathsf{uncertainty}, \mathsf{failures}, \mathsf{artifacts} \}. \end{aligned} }
\mathrm{und}Use in source · 1 passage
Search aliases: und mathrm
Use in source · 03-exact-shared-cores.tex, line 156
The number of independent graph cycles is r=|E_und|-|V|+1 for a connected underlying graph, after treating parallel edges with their multiplicity.
Exact mathematical passage
r=|E_{\mathrm{und}}|-|V|+1
\underline gUse in source · 1 passage
Search aliases: underline g underline
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
\underline mUse in source · 6 passages
Search aliases: underline m underline
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 432
Let m_q(W; D) be the signed margin of gate q, oriented so that m_q(W; D)>0 means that the gate passes after its uncertainty correction. Define the decomposition envelope underline m_q = inf_ D∈ Dm_q(W; D), overline m_q = sup_ D∈ Dm_q(W; D), and its sensitivity width Δ_q^dec = overline m_q-underline m_q.
Exact mathematical passage
\underline m_q = \inf_{\mathcal D\in\mathfrak D}m_q(W;\mathcal D), \qquad \overline m_q = \sup_{\mathcal D\in\mathfrak D}m_q(W;\mathcal D),
\underline{\mathbf m}Use in source · 1 passage
Search aliases: underline m underline mathbf
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 351
Use a vector rather than one aggregate score: C_full(W) =( · d_ε, g_ε, δ_coh, δ_align^ I, Δ_joint^ℓ, k_ε, · Δ_tr( Q), η_causal^ν, Δ_specific(r), η_loop(τ), · d_id, Rec_k, underline m_ D, Δ_dec, E_form, δ^scaf, δ^leak, · Δ_J, Δ_t^B, COut_τ(widehat S), CIn_τ(widehat S), · η_G(τ), δ_G^cue(τ), η_G→ A, δ_Q, η_V→ A, η_A→ Y, · η_D→ M, η_M→ R, η_R→ v, Δ_repair^spec, δ_rep-id, sup_t e_t ). A claim passes only when every required coordinate lies in its predeclared admissible region. No weighted average ma…
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal C_{\mathrm{full}}(W) =\bigl(& d_\varepsilon, g_\varepsilon, \delta_{\mathrm{coh}}, \delta_{\mathrm{align}}^{\mathcal I}, \Delta_{\mathrm{joint}}^\ell, k_\varepsilon,\\ &\boldsymbol\Delta_{\mathrm{tr}}(\mathcal Q), \eta_{\mathrm{causal}}^\nu, \Delta_{\mathrm{specific}}(r), \eta_{\mathrm{loop}}(\tau),\\ &d_{\mathrm{id}}, \Rec_k, \underline{\mathbf m}_{\mathfrak D}, \boldsymbol\Delta_{\mathrm{dec}}, \mathbf E_{\mathrm{form}}, \delta^{\mathrm{scaf}}, \delta^{\mathrm{leak}},\\ &\Delta_J, \Delta_t^B, \COut_\tau(\widehat S), \CIn_\tau(\widehat S),\\ &\eta_G(\tau), \delta_G^{\mathrm{cue}}(\tau), \eta_{G\to A}, \delta_Q, \eta_{V\to A}, \eta_{A\to Y},\\ &\eta_{D\to M}, \eta_{M\to R}, \eta_{R\to v}, \Delta_{\mathrm{repair}}^{\mathrm{spec}}, \delta_{\mathrm{rep-id}}, \sup_t e_t \bigr). \end{aligned} }
\underline{\mathbf m}_{\mathfrak D}Use in source · 1 passage
Search aliases: underline m_ D underline mathbf mathfrak
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 351
Use a vector rather than one aggregate score: C_full(W) =( · d_ε, g_ε, δ_coh, δ_align^ I, Δ_joint^ℓ, k_ε, · Δ_tr( Q), η_causal^ν, Δ_specific(r), η_loop(τ), · d_id, Rec_k, underline m_ D, Δ_dec, E_form, δ^scaf, δ^leak, · Δ_J, Δ_t^B, COut_τ(widehat S), CIn_τ(widehat S), · η_G(τ), δ_G^cue(τ), η_G→ A, δ_Q, η_V→ A, η_A→ Y, · η_D→ M, η_M→ R, η_R→ v, Δ_repair^spec, δ_rep-id, sup_t e_t ). A claim passes only when every required coordinate lies in its predeclared admissible region. No weighted average ma…
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal C_{\mathrm{full}}(W) =\bigl(& d_\varepsilon, g_\varepsilon, \delta_{\mathrm{coh}}, \delta_{\mathrm{align}}^{\mathcal I}, \Delta_{\mathrm{joint}}^\ell, k_\varepsilon,\\ &\boldsymbol\Delta_{\mathrm{tr}}(\mathcal Q), \eta_{\mathrm{causal}}^\nu, \Delta_{\mathrm{specific}}(r), \eta_{\mathrm{loop}}(\tau),\\ &d_{\mathrm{id}}, \Rec_k, \underline{\mathbf m}_{\mathfrak D}, \boldsymbol\Delta_{\mathrm{dec}}, \mathbf E_{\mathrm{form}}, \delta^{\mathrm{scaf}}, \delta^{\mathrm{leak}},\\ &\Delta_J, \Delta_t^B, \COut_\tau(\widehat S), \CIn_\tau(\widehat S),\\ &\eta_G(\tau), \delta_G^{\mathrm{cue}}(\tau), \eta_{G\to A}, \delta_Q, \eta_{V\to A}, \eta_{A\to Y},\\ &\eta_{D\to M}, \eta_{M\to R}, \eta_{R\to v}, \Delta_{\mathrm{repair}}^{\mathrm{spec}}, \delta_{\mathrm{rep-id}}, \sup_t e_t \bigr). \end{aligned} }
\underline m_qUse in source · 3 passages
Search aliases: underline m_q underline
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 432
Let m_q(W; D) be the signed margin of gate q, oriented so that m_q(W; D)>0 means that the gate passes after its uncertainty correction. Define the decomposition envelope underline m_q = inf_ D∈ Dm_q(W; D), overline m_q = sup_ D∈ Dm_q(W; D), and its sensitivity width Δ_q^dec = overline m_q-underline m_q.
Exact mathematical passage
\underline m_q = \inf_{\mathcal D\in\mathfrak D}m_q(W;\mathcal D), \qquad \overline m_q = \sup_{\mathcal D\in\mathfrak D}m_q(W;\mathcal D),
\underline m_q^{\mathfrak S}Use in source · 2 passages
Search aliases: underline m_q^ S underline mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 202
For each gate q∈ J_*, define the specification envelope underline m_q^ S(W) = inf_ς∈ Sm_q(W;ς), overline m_q^ S(W) = sup_ς∈ Sm_q(W;ς). Its sensitivity width is Δ_q^spec(W) = overline m_q^ S(W) - underline m_q^ S(W). The robust certificate margin is r_ S(W) = inf_ς∈ S min_q∈ J_*m_q(W;ς). Then Cert_ S(W)=1 Longleftrightarrow r_ S(W)>0.
Exact mathematical passage
\boxed{ \underline m_q^{\mathfrak S}(W) = \inf_{\varsigma\in\mathfrak S}m_q(W;\varsigma), \qquad \overline m_q^{\mathfrak S}(W) = \sup_{\varsigma\in\mathfrak S}m_q(W;\varsigma). }
\underline m_q^{\mathrm{ID}}Use in source · 1 passage
Search aliases: underline m_q^ID underline mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 584
The sharp lower and upper identified margins are underline m_q^ID(ς) = inf M_q^ID(ς), overline m_q^ID(ς) = sup M_q^ID(ς). A gate is sign-identified as passing if its lower bound is positive. It is sign-identified as failing if its upper bound is nonpositive. If the interval crosses zero, the available design does not determine that gate's outcome.
Exact mathematical passage
\underline m_q^{\mathrm{ID}}(\varsigma) = \inf\mathcal M_q^{\mathrm{ID}}(\varsigma), \qquad \overline m_q^{\mathrm{ID}}(\varsigma) = \sup\mathcal M_q^{\mathrm{ID}}(\varsigma).
\underline rUse in source · 2 passages
Search aliases: underline r underline
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 627
For robustness across specifications, define the realization-level robust margin r_ S( R) = inf_ς∈ S min_q∈ J_* m_q(W_ R;ς) and its identified range underline r_ID, S = inf_ R∈ R_ID r_ S( R), overline r_ID, S = sup_ R∈ R_ID r_ S( R).
Exact mathematical passage
\underline r_{\mathrm{ID},\mathfrak S} = \inf_{\mathfrak R\in\mathfrak R_{\mathrm{ID}}} r_{\mathfrak S}(\mathfrak R), \qquad \overline r_{\mathrm{ID},\mathfrak S} = \sup_{\mathfrak R\in\mathfrak R_{\mathrm{ID}}} r_{\mathfrak S}(\mathfrak R).
\underline r_{\mathrm{ID},\mathfrak S}Use in source · 2 passages
Search aliases: underline r_ID, S underline mathrm mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 627
For robustness across specifications, define the realization-level robust margin r_ S( R) = inf_ς∈ S min_q∈ J_* m_q(W_ R;ς) and its identified range underline r_ID, S = inf_ R∈ R_ID r_ S( R), overline r_ID, S = sup_ R∈ R_ID r_ S( R).
Exact mathematical passage
\underline r_{\mathrm{ID},\mathfrak S} = \inf_{\mathfrak R\in\mathfrak R_{\mathrm{ID}}} r_{\mathfrak S}(\mathfrak R), \qquad \overline r_{\mathrm{ID},\mathfrak S} = \sup_{\mathfrak R\in\mathfrak R_{\mathrm{ID}}} r_{\mathfrak S}(\mathfrak R).
\underline\alphaUse in source · 1 passage
Search aliases: underlineα underline alpha
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
\underline\DeltaUse in source · 1 passage
Search aliases: underlineΔ underline Delta
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
\underline\Delta_BUse in source · 1 passage
Search aliases: underlineΔ_B underline Delta
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
\underline\etaUse in source · 4 passages
Search aliases: underlineη underline eta
Use in source · 09-formal-workspace-definition.tex, line 8
Let Θ = ( ε_coh, ε_align, ε_k, underlineη_c, underlineη_loop, δ_node, δ_null, δ_spec, k, ε_pers ). Let ς = ( D,Y^+,ℓ,τ, I, Q,Θ) be the complete declared scientific specification, where Q⊆ N_pred(P) is a validated null panel. A dynamic realization contains a certified stratified relational workspace when there exists a candidate W_t satisfying all gates required for the claimed level under ς. The detailed robustness and identifiability requirements for varying ς are developed in Parts~XVII and XV…
Exact mathematical passage
\Theta = \left( \varepsilon_{\mathrm{coh}}, \varepsilon_{\mathrm{align}}, \varepsilon_k, \underline\eta_c, \underline\eta_{\mathrm{loop}}, \delta_{\mathrm{node}}, \delta_{\mathrm{null}}, \delta_{\mathrm{spec}}, k, \varepsilon_{\mathrm{pers}} \right).
\underline\eta_cUse in source · 2 passages
Search aliases: underlineη_c underline eta
Use in source · 09-formal-workspace-definition.tex, line 8
Let Θ = ( ε_coh, ε_align, ε_k, underlineη_c, underlineη_loop, δ_node, δ_null, δ_spec, k, ε_pers ). Let ς = ( D,Y^+,ℓ,τ, I, Q,Θ) be the complete declared scientific specification, where Q⊆ N_pred(P) is a validated null panel. A dynamic realization contains a certified stratified relational workspace when there exists a candidate W_t satisfying all gates required for the claimed level under ς. The detailed robustness and identifiability requirements for varying ς are developed in Parts~XVII and XV…
Exact mathematical passage
\Theta = \left( \varepsilon_{\mathrm{coh}}, \varepsilon_{\mathrm{align}}, \varepsilon_k, \underline\eta_c, \underline\eta_{\mathrm{loop}}, \delta_{\mathrm{node}}, \delta_{\mathrm{null}}, \delta_{\mathrm{spec}}, k, \varepsilon_{\mathrm{pers}} \right).
\underline\eta_{\mathrm{loop}}Use in source · 2 passages
Search aliases: underlineη_loop underline eta mathrm
Use in source · 09-formal-workspace-definition.tex, line 8
Let Θ = ( ε_coh, ε_align, ε_k, underlineη_c, underlineη_loop, δ_node, δ_null, δ_spec, k, ε_pers ). Let ς = ( D,Y^+,ℓ,τ, I, Q,Θ) be the complete declared scientific specification, where Q⊆ N_pred(P) is a validated null panel. A dynamic realization contains a certified stratified relational workspace when there exists a candidate W_t satisfying all gates required for the claimed level under ς. The detailed robustness and identifiability requirements for varying ς are developed in Parts~XVII and XV…
Exact mathematical passage
\Theta = \left( \varepsilon_{\mathrm{coh}}, \varepsilon_{\mathrm{align}}, \varepsilon_k, \underline\eta_c, \underline\eta_{\mathrm{loop}}, \delta_{\mathrm{node}}, \delta_{\mathrm{null}}, \delta_{\mathrm{spec}}, k, \varepsilon_{\mathrm{pers}} \right).
\underline\muUse in source · 1 passage
Search aliases: underlineμ underline mu
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
\mathsf{uniform\_bounds}Use in source · 1 passage
Search aliases: uniform_bounds mathsf
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 1051
The machine-readable record should include: SpecificationRecord ={ · reference, family, equivalence_classes, metric, · targets, losses, horizons, interventions, · null_panels, thresholds, selection_history, · identified_sets, uniform_bounds, gate_envelopes }. Every omitted family member requires a reason. Every changed specification requires a data-split label and time stamp. Every gate requires pointwise and family-wide status.
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{SpecificationRecord} =\{& \mathsf{reference}, \mathsf{family}, \mathsf{equivalence\_classes}, \mathsf{metric},\\ &\mathsf{targets}, \mathsf{losses}, \mathsf{horizons}, \mathsf{interventions},\\ &\mathsf{null\_panels}, \mathsf{thresholds}, \mathsf{selection\_history},\\ &\mathsf{identified\_sets}, \mathsf{uniform\_bounds}, \mathsf{gate\_envelopes} \}. \end{aligned} }
V^*Use in source · 1 passage
Search aliases: V^*
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 269
For a declared graph, set of core dimensions, weights, and transfer maps, the static analysis can be executed in the following order: item Assemble the sparse block operator D_H from the edge equations sqrtw_e(c_t(e)-H_ec_s(e)). item Compute a singular-value decomposition D_H=UΣ V^*, λ_k(L_H)=σ_k(D_H)^2. Use a declared numerical tolerance to distinguish computational zero modes from positive modes. item Select a candidate rank d only at a reproducible spectral boundary with g_d>0. A large observ…
Exact mathematical passage
D_H=U\Sigma V^*, \qquad \lambda_k(L_H)=\sigma_k(D_H)^2.
V_{\mathcal D}Use in source · 1 passage
Search aliases: V_ D mathcal
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 303
A more stable quantity measures primitive carrier cost. Let w_ω>0 be a declared cost for each ω∈Ω, and assign a block the cost c(B)=∑_ω∈ Bw_ω. Define the sufficient support cost s_ε( D) = min_S⊆ V_ D { ∑_B∈ Sc(B): Risk_ D(S) ≤ Risk_ D(V_ D)+ε }. If D_fpreceq D_c is information faithful, then s_ε( D_f) ≤ s_ε( D_c). The fine decomposition permits every union of coarse blocks and may also permit cheaper sub-block coalitions. Equality holds whenever an optimal fine coalition is a union of complete c…
Exact mathematical passage
\boxed{ s_\varepsilon(\mathcal D) = \min_{S\subseteq V_{\mathcal D}} \left\{ \sum_{B\in S}c(B): \Risk_{\mathcal D}(S) \leq \Risk_{\mathcal D}(V_{\mathcal D})+\varepsilon \right\}. }
V_1Use in source · 3 passages
Search aliases: V_1
Use in source · 04-approximate-workspaces.tex, line 781
For two consecutive transfers, P_i_2T_2T_1P_i_0 = H_2H_1+U_2V_1, Q_i_2T_2T_1P_i_0 = V_2H_1+K_2V_1. Thus leakage out of the core is first order in the blocks V_r, while an excursion that leaves and then returns to the core contains at least one V-block and one later U-block. For a fixed path length, if U_r , V_r =O(δ) and the diagonal blocks remain bounded, the residual-mediated correction to pure core-to-core transport is O(δ^2), whereas terminal residual leakage can be O(δ). This distinction se…
Exact mathematical passage
P_{i_2}T_2T_1P_{i_0} = H_2H_1+U_2V_1,
V_2Use in source · 1 passage
Search aliases: V_2
Use in source · 04-approximate-workspaces.tex, line 786
For two consecutive transfers, P_i_2T_2T_1P_i_0 = H_2H_1+U_2V_1, Q_i_2T_2T_1P_i_0 = V_2H_1+K_2V_1. Thus leakage out of the core is first order in the blocks V_r, while an excursion that leaves and then returns to the core contains at least one V-block and one later U-block. For a fixed path length, if U_r , V_r =O(δ) and the diagonal blocks remain bounded, the residual-mediated correction to pure core-to-core transport is O(δ^2), whereas terminal residual leakage can be O(δ). This distinction se…
Exact mathematical passage
Q_{i_2}T_2T_1P_{i_0} = V_2H_1+K_2V_1.
v_AUse in source · 2 passages
Search aliases: v_A
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 512
Order the local coordinates as x=(g_H,d_H,g_M,p_M,p_X,v_X,d_A,v_A)^ T. The overlap discrepancies are g_H-g_M, p_M-p_X, v_X-v_A, d_A-d_H. Thus D_HAI = 1 · 0 · -1 · 0 · 0 · 0 · 0 · 0
Exact mathematical passage
x=(g_H,d_H,g_M,p_M,p_X,v_X,d_A,v_A)^{\mathsf T}.
V_{e_r}Use in source · 2 passages
Search aliases: V_e_r
Use in source · 04-approximate-workspaces.tex, line 677
Let a path have vertices i_0xrightarrowe_1i_1xrightarrowe_2⋯ xrightarrowe_mi_m. Write T_r=T_e_r, H_r=H_e_r, V_r=V_e_r, and let ι_i^C:C_i↪ X_i, ι_i^R:R_i↪ X_i be the canonical inclusions. Empty products below are identities.
Exact mathematical passage
T_r=T_{e_r}, \quad H_r=H_{e_r}, \quad V_r=V_{e_r},
V_{\mathrm{HAI}}Use in source · 1 passage
Search aliases: V_HAI mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 471
Consider four heterogeneous components: V_HAI={H,M,X,A}, where: item H is a human researcher who maintains goals and semantic direction; item M is a language-model process that constructs local formalizations; item X is an execution and verification process that compiles, tests, or falsifies candidate artifacts; and item A is a persistent artifact store containing exact source, results, and versioned handoff state. Let the abstract research state be c=(g,d,p,v)^ T∈ R^4, where: ll g=goal and acce…
Exact mathematical passage
V_{\mathrm{HAI}}=\{H,M,X,A\},
V_{\mathrm{HH}}Use in source · 1 passage
Search aliases: V_HH mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 222
Consider two researchers and one persistent notebook: V_HH={P,C,N}, where: item P is a proposer who tracks the theorem statement and open proof obligations; item C is a critic who tracks proof obligations and falsification status; item N is a notebook that tracks the theorem statement and falsification status. The abstract core is c=(q,p,f)^ T∈ R^3, with q · =statement coordinate, · p · =proof-obligation coordinate,
Exact mathematical passage
V_{\mathrm{HH}}=\{P,C,N\},
V_mUse in source · 1 passage
Search aliases: V_m
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 100
Let the vertex set of a core-transfer diagram be partitioned as V=V_1sqcup⋯sqcup V_m. Write the transfer discrepancy as D_H = D_int
Exact mathematical passage
V=V_1\sqcup\cdots\sqcup V_m.
V_{\mathrm{MA}}Use in source · 1 passage
Search aliases: V_MA mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 785
Consider three agents: V_MA={P,M,R}, called the planner, monitor, and recorder. The global workspace-control state is c_t=(g_t,b_t,h_t)∈ F_2^3, where: ll g_t=goal bit, · b_t=environment or belief bit,
Exact mathematical passage
V_{\mathrm{MA}}=\{P,M,R\},
V_rUse in source · 7 passages
Search aliases: V_r
Use in source · 04-approximate-workspaces.tex, line 677
Let a path have vertices i_0xrightarrowe_1i_1xrightarrowe_2⋯ xrightarrowe_mi_m. Write T_r=T_e_r, H_r=H_e_r, V_r=V_e_r, and let ι_i^C:C_i↪ X_i, ι_i^R:R_i↪ X_i be the canonical inclusions. Empty products below are identities.
Exact mathematical passage
T_r=T_{e_r}, \quad H_r=H_{e_r}, \quad V_r=V_{e_r},
v_tUse in source · 5 passages
Search aliases: v_t
Use in source · 10-persistence.tex, line 290
[Mean-square persistence] Suppose E[e_t+1^2mid F_t] ≤ q e_t^2+v_t, 0≤ q<1, and E[v_t]≤bar v. Then E[e_t^2] ≤ q^t E[e_0^2] + fracbar v(1-q^t)1-q, so limsup_t→∞ E[e_t^2] ≤ fracbar v1-q.
Exact mathematical passage
\mathbb E[e_{t+1}^2\mid\mathcal F_t] \leq q e_t^2+v_t, \qquad 0\leq q<1,
v_XUse in source · 2 passages
Search aliases: v_X
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 512
Order the local coordinates as x=(g_H,d_H,g_M,p_M,p_X,v_X,d_A,v_A)^ T. The overlap discrepancies are g_H-g_M, p_M-p_X, v_X-v_A, d_A-d_H. Thus D_HAI = 1 · 0 · -1 · 0 · 0 · 0 · 0 · 0
Exact mathematical passage
x=(g_H,d_H,g_M,p_M,p_X,v_X,d_A,v_A)^{\mathsf T}.
\mathcal V_\ThetaUse in source · 1 passage
Search aliases: V_Θ mathcal Theta
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 675
_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To maintain a reserve ρ>0, define the maintenance deficit e_t =(ρ-v_t)_+. Define the zero-reserve and bounded-deficit viability sets V_Θ = { S:ϕ_j(S)≥0 for every j∈ J_maint } V_Θ,e_max = { S:e(S)≤ e_max } The first set requires every protected gate to pass. The second permits a declared finite reserve deficit.
Exact mathematical passage
\boxed{ \mathcal V_\Theta = \left\{ S:\phi_j(S)\geq0\ \text{for every }j\in\mathcal J_{\mathrm{maint}} \right\} }
\mathcal V_{\Theta,e_{\max}}Use in source · 1 passage
Search aliases: V_Θ,e_max mathcal Theta max
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 684
t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To maintain a reserve ρ>0, define the maintenance deficit e_t =(ρ-v_t)_+. Define the zero-reserve and bounded-deficit viability sets V_Θ = { S:ϕ_j(S)≥0 for every j∈ J_maint } V_Θ,e_max = { S:e(S)≤ e_max } The first set requires every protected gate to pass. The second permits a declared finite reserve deficit.
Exact mathematical passage
\boxed{ \mathcal V_{\Theta,e_{\max}} = \left\{ S:e(S)\leq e_{\max} \right\} }
\varprojlimUse in source · 3 passages
Search aliases: varprojlim
Use in source · 03-exact-shared-cores.tex, line 27
Equivalently, Γ(H)=varprojlim_Path(G)C_i. A section is not a single vector copied verbatim at every vertex. It is one abstract element represented by a family of local vectors that agree under the specified translation maps.
Exact mathematical passage
\Gamma(H)=\varprojlim_{\Path(G)}C_i.
\varprojlim_{\Path(G)}Use in source · 1 passage
Search aliases: varprojlim_Path(G) varprojlim Path
Use in source · 03-exact-shared-cores.tex, line 27
Equivalently, Γ(H)=varprojlim_Path(G)C_i. A section is not a single vector copied verbatim at every vertex. It is one abstract element represented by a family of local vectors that agree under the specified translation maps.
Exact mathematical passage
\Gamma(H)=\varprojlim_{\Path(G)}C_i.
\vdotsUse in source · 1 passage
Search aliases: vdots
Use in source · 03-exact-shared-cores.tex, line 241
[Finite matrix test] Let γ_1,…,γ_r be fundamental cycle generators and suppose dim C_o=d. Define the stacked obstruction matrix M = H_γ_1-I vdots H_γ_r-I . Then C_*=ker M, d_Workspace=d-rank( M).
Exact mathematical passage
\mathcal M = \begin{pmatrix} H_{\gamma_1}-I\\ \vdots\\ H_{\gamma_r}-I \end{pmatrix}.
\vfillUse in source · 1 passage
Search aliases: vfill
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
\mathcal WUse in source · 11 passages
Search aliases: W mathcal
Use in source · 10-persistence.tex, line 85
Let P_t project onto a selected rank-d low-energy workspace cluster of L_t, and set W_t=ran P_t. Write g_t=λ_d+1(L_t)-λ_d(L_t)>0 for the separating spectral gap and η_t^L=2 D_t δ_t^D+(δ_t^D)^2.
Exact mathematical passage
\mathcal W_t=\ran P_t.
W'Use in source · 1 passage
Search aliases: W'
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 1136
Let two realizations have identical benchmark output distributions, P(Y_bench)=P'(Y_bench), but different intervention kernels: K(w,b)≠ K'(β w,b) for some matched workspace intervention. Then task behavior is preserved while d_causal(W,W')>0. The later system may be a successor or replacement rather than the same workspace under the identity criterion of Part~XII.
Exact mathematical passage
d_{\mathrm{causal}}(W,W')>0.
\mathcal W'Use in source · 8 passages
Search aliases: W' mathcal
Use in source · 12-identity-through-time-and-replacement.tex, line 213
Write A=ρ_V(a), A'=ρ_V'(a), and define δ_ρ(a)= A'J_V-J_VA , ℓ_a= (I-P)AP . Let A_ W=PAP, A_ W''=P'A'P'.
Exact mathematical passage
A_{\mathcal W}=PAP, \qquad A_{\mathcal W'}'=P'A'P'.
W'_{\mathrm{init}}Use in source · 1 passage
Search aliases: W'_init mathrm
Use in source · 12-identity-through-time-and-replacement.tex, line 303
A reconstructive handoff may also be imperfect. Let δ_rec(β) = E[d_ W'(W'_init,β W)] measure replacement initialization error. Corollary~[source reference] provides one explicit upper bound on this term.
Exact mathematical passage
\delta_{\mathrm{rec}}(\beta) = \mathbb E\bigl[d_{\mathcal W'}(W'_{\mathrm{init}},\beta W)\bigr]
W^{\mathcal D}Use in source · 1 passage
Search aliases: W^ D mathcal
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 482
Fix a reference decomposition D_0. For each D∈ D, let Φ_ D:W^ D_0⟶ W^ D be a declared workspace correspondence and let δ_ D measure its structural and causal identity defect. Assume gate q has a transport bound | m_q(Φ_ DW; D) -m_q(W; D_0) | ≤ L_qδ_ D+b_q( D), where L_q is a sensitivity constant and b_q records model mismatch not captured by the identity distance.
Exact mathematical passage
\Phi_{\mathcal D}:W^{\mathcal D_0}\longrightarrow W^{\mathcal D}
W^{\mathcal D_0}Use in source · 1 passage
Search aliases: W^ D_0 mathcal
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 482
Fix a reference decomposition D_0. For each D∈ D, let Φ_ D:W^ D_0⟶ W^ D be a declared workspace correspondence and let δ_ D measure its structural and causal identity defect. Assume gate q has a transport bound | m_q(Φ_ DW; D) -m_q(W; D_0) | ≤ L_qδ_ D+b_q( D), where L_q is a sensitivity constant and b_q records model mismatch not captured by the identity distance.
Exact mathematical passage
\Phi_{\mathcal D}:W^{\mathcal D_0}\longrightarrow W^{\mathcal D}
W^{(r)}Use in source · 2 passages
Search aliases: W^(r)
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 224
For appropriate recurrent systems, W^(r+1) = Γ_ε_r(W^(r)) may converge to a stable workspace type: d_id ( W^(r+1),W^(r) ) →0.
Exact mathematical passage
W^{(r+1)} = \Gamma_{\varepsilon_r}(W^{(r)})
W^{(r+1)}Use in source · 2 passages
Search aliases: W^(r+1)
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 224
For appropriate recurrent systems, W^(r+1) = Γ_ε_r(W^(r)) may converge to a stable workspace type: d_id ( W^(r+1),W^(r) ) →0.
Exact mathematical passage
W^{(r+1)} = \Gamma_{\varepsilon_r}(W^{(r)})
W_{\mathfrak R'}Use in source · 1 passage
Search aliases: W_ R' mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 460
[No uniformly correct decision under experimental equivalence] Let R, R'∈ M satisfy R≡_ E R' but Cert(W_ R;ς) ≠ Cert(W_ R';ς). Then the workspace certificate is not identifiable on M under E. More strongly, for every possibly randomized decision rule widehat C based only on data generated by E, P_ R ( widehat C≠ C_ R ) + P_ R' ( widehat C≠ C_ R' ) =1, where C_ R=Cert(W_ R;ς). Consequently, inf_widehat C max{ P_ R(widehat C≠ C_ R), P_ R'(widehat C≠ C_ R') } ≥frac12.
Exact mathematical passage
\operatorname{Cert}(W_{\mathfrak R};\varsigma) \neq \operatorname{Cert}(W_{\mathfrak R'};\varsigma).
W_0Use in source · 5 passages
Search aliases: W_0
Use in source · 04-approximate-workspaces.tex, line 287
[Coherence-to-core distance estimate] Let W_0=Γ(H)=ker L_H, r=dim W_0, and suppose r<N. Set γ_H=λ_r+1>0. Then every c∈ C_V satisfies dist(c,W_0)^2 ≤ frac E_H(c)γ_H. Moreover, E_H(c) ≤ L_H dist(c,W_0)^2.
Exact mathematical passage
W_0=\Gamma(H)=\ker L_H, \qquad r=\dim W_0,
W_0^\perpUse in source · 1 passage
Search aliases: W_0^⊥ perp
Use in source · 04-approximate-workspaces.tex, line 320
Write c=P_0c+Q_0c, where P_0 projects onto W_0 and Q_0=I-P_0. Since L_HP_0=0, E_H(c) = ⟨ Q_0c,L_HQ_0c⟩. The spectrum of L_H on W_0^⊥ lies in [γ_H, L_H ]. Hence γ_H Q_0c ^2 ≤ E_H(c) ≤ L_H Q_0c ^2. Finally, Q_0c =dist(c,W_0).
Exact mathematical passage
W_0^\perp
W_{12}Use in source · 1 passage
Search aliases: W_12
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 442
Let G be the directed triangle 1xrightarrow a 2 xrightarrow b 3 xrightarrow c 1 with one-dimensional vertex cores. Cover it by its three edge charts. Their local workspaces are all one-dimensional: mathscr W_12 · ={(x,ax):x∈ R}, mathscr W_23 · ={(y,by):y∈ R}, mathscr W_31 · ={(z,cz):z∈ R}. Overlap agreement requires y=ax, z=by, x=cz. Therefore (1-abc)x=0, and dimmathscr W(G) = 1, · abc=1,
Exact mathematical passage
\begin{aligned} \mathscr W_{12}&=\{(x,ax):x\in\mathbb R\},\\ \mathscr W_{23}&=\{(y,by):y\in\mathbb R\},\\ \mathscr W_{31}&=\{(z,cz):z\in\mathbb R\}. \end{aligned}
W_{23}Use in source · 1 passage
Search aliases: W_23
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 442
Let G be the directed triangle 1xrightarrow a 2 xrightarrow b 3 xrightarrow c 1 with one-dimensional vertex cores. Cover it by its three edge charts. Their local workspaces are all one-dimensional: mathscr W_12 · ={(x,ax):x∈ R}, mathscr W_23 · ={(y,by):y∈ R}, mathscr W_31 · ={(z,cz):z∈ R}. Overlap agreement requires y=ax, z=by, x=cz. Therefore (1-abc)x=0, and dimmathscr W(G) = 1, · abc=1,
Exact mathematical passage
\begin{aligned} \mathscr W_{12}&=\{(x,ax):x\in\mathbb R\},\\ \mathscr W_{23}&=\{(y,by):y\in\mathbb R\},\\ \mathscr W_{31}&=\{(z,cz):z\in\mathbb R\}. \end{aligned}
W_{31}Use in source · 1 passage
Search aliases: W_31
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 442
Let G be the directed triangle 1xrightarrow a 2 xrightarrow b 3 xrightarrow c 1 with one-dimensional vertex cores. Cover it by its three edge charts. Their local workspaces are all one-dimensional: mathscr W_12 · ={(x,ax):x∈ R}, mathscr W_23 · ={(y,by):y∈ R}, mathscr W_31 · ={(z,cz):z∈ R}. Overlap agreement requires y=ax, z=by, x=cz. Therefore (1-abc)x=0, and dimmathscr W(G) = 1, · abc=1,
Exact mathematical passage
\begin{aligned} \mathscr W_{12}&=\{(x,ax):x\in\mathbb R\},\\ \mathscr W_{23}&=\{(y,by):y\in\mathbb R\},\\ \mathscr W_{31}&=\{(z,cz):z\in\mathbb R\}. \end{aligned}
W_aUse in source · 5 passages
Search aliases: W_a
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 918
A finite workspace hierarchy is a rooted tree T. Each node a∈ T carries a subgraph G_a. The root r carries G_r=G. For every internal node a, its children Ch(a) form a finite edge-complete cover of G_a. Leaves carry primitive local workspace spaces W_ℓ=mathscr W(G_ℓ). For an internal node, define recursively W_a = ker ( δ_a^0: ⊕_b∈Ch(a)W_b ⟶ ⊕_b<cW_bc ), where the overlap spaces and restrictions are inherited from the child cover.
Exact mathematical passage
\boxed{ W_a = \ker \left( \delta_a^0: \bigoplus_{b\in\operatorname{Ch}(a)}W_b \longrightarrow \bigoplus_{b<c}W_{bc} \right), }
W_bUse in source · 2 passages
Search aliases: W_b
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 918
A finite workspace hierarchy is a rooted tree T. Each node a∈ T carries a subgraph G_a. The root r carries G_r=G. For every internal node a, its children Ch(a) form a finite edge-complete cover of G_a. Leaves carry primitive local workspace spaces W_ℓ=mathscr W(G_ℓ). For an internal node, define recursively W_a = ker ( δ_a^0: ⊕_b∈Ch(a)W_b ⟶ ⊕_b<cW_bc ), where the overlap spaces and restrictions are inherited from the child cover.
Exact mathematical passage
\boxed{ W_a = \ker \left( \delta_a^0: \bigoplus_{b\in\operatorname{Ch}(a)}W_b \longrightarrow \bigoplus_{b<c}W_{bc} \right), }
W_{B_t^{\mathrm{sys}}}Use in source · 1 passage
Search aliases: W_B_t^sys mathrm
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 258
Let B_t^sys be an internal membership or routing state used by the system, and let S_t^* = argmax_S∈ S_pass B_t(S) be the population boundary defined by the external certification protocol. The strong endogenous boundary conjecture asserts that there are adaptive systems and nontrivial environments for which: · d_B(B_t^sys,S_t^*)→0, · Form_Θ_form(W_B_t^sys)=1, · CE ( B_t^sys→ Routing_t+1 )>0, · CE ( BoundaryDamage_t→ RepairAction_t+1 )>0, while the scaffold contains no direct encoding of S_t^*.
Exact mathematical passage
\boxed{ \begin{aligned} &d_B(B_t^{\mathrm{sys}},S_t^*)\to0,\\ &\operatorname{Form}_{\Theta_{\mathrm{form}}}(W_{B_t^{\mathrm{sys}}})=1,\\ &\operatorname{CE} \left( B_t^{\mathrm{sys}}\to \operatorname{Routing}_{t+1} \right)>0,\\ &\operatorname{CE} \left( \operatorname{BoundaryDamage}_t\to \operatorname{RepairAction}_{t+1} \right)>0, \end{aligned} }
W_{bc}Use in source · 1 passage
Search aliases: W_bc
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 918
A finite workspace hierarchy is a rooted tree T. Each node a∈ T carries a subgraph G_a. The root r carries G_r=G. For every internal node a, its children Ch(a) form a finite edge-complete cover of G_a. Leaves carry primitive local workspace spaces W_ℓ=mathscr W(G_ℓ). For an internal node, define recursively W_a = ker ( δ_a^0: ⊕_b∈Ch(a)W_b ⟶ ⊕_b<cW_bc ), where the overlap spaces and restrictions are inherited from the child cover.
Exact mathematical passage
\boxed{ W_a = \ker \left( \delta_a^0: \bigoplus_{b\in\operatorname{Ch}(a)}W_b \longrightarrow \bigoplus_{b<c}W_{bc} \right), }
W_dUse in source · 1 passage
Search aliases: W_d
Use in source · 04-approximate-workspaces.tex, line 205
An equivalent index-based description fixes d and writes W_d=ran P_d, P_d=P_{λ_1,…,λ_d}(L_H), with cluster gap g_d=λ_d+1-λ_d>0. The index-based form is convenient for perturbation theorems because the workspace rank is declared explicitly.
Exact mathematical passage
W_d=\ran P_d, \qquad P_d=P_{\{\lambda_1,\ldots,\lambda_d\}}(L_H),
w_DUse in source · 1 passage
Search aliases: w_D
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
W_{\mathrm{flat}}Use in source · 2 passages
Search aliases: W_flat mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 980
Let L( T) be the leaf set. Repeated edge completeness implies that the flattened family U_flat = {G_ℓ:ℓ∈ L( T)} is itself an edge-complete cover of G. Let δ_flat^0 be its overlap coboundary and define W_flat = kerδ_flat^0. Theorem~[source reference] and Theorem~[source reference] give W_r ≅ W_flat ≅ mathscr W(G). Equivalently, Lim_ T^rec ( {mathscr W(G_ℓ)}_ℓ∈ L( T) ) ≅ Eq_ U_flat ( {mathscr W(G_ℓ)}_ℓ∈ L( T) ). The notation on the left means recursive finite descent along the tree; the right side…
Exact mathematical passage
W_{\mathrm{flat}} = \ker\delta_{\mathrm{flat}}^0.
w_IUse in source · 1 passage
Search aliases: w_I
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
W_{\mathrm{meta}}Use in source · 3 passages
Search aliases: W_meta mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 729
Define the exact meta-workspace mathscr W_meta( U) := ker B_ U ⊆ ⊕_αmathscr W_α. Theorem~[source reference] gives the canonical identification mathscr W_meta( U) ≅ mathscr W(G). Thus exact formation of a workspace from local workspaces does not create an additional mysterious carrier. It gives a second presentation of the same global compatible-section object.
Exact mathematical passage
\boxed{ \mathscr W_{\mathrm{meta}}(\mathcal U) := \ker B_{\mathcal U} \subseteq \bigoplus_\alpha\mathscr W_\alpha. }
w_NUse in source · 1 passage
Search aliases: w_N
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
W_rUse in source · 2 passages
Search aliases: W_r
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 942
[Exact hierarchical collapse] For every finite workspace hierarchy as above, there is a canonical isomorphism W_a≅mathscr W(G_a) for every node a. In particular, W_r≅mathscr W(G). Therefore recursively gluing local workspaces, using any other finite parenthesization built from edge-complete intermediate covers that retain all required overlap objects, and solving the flattened global transfer system all produce the same exact workspace up to canonical isomorphism.
Exact mathematical passage
\boxed{ W_r\cong\mathscr W(G). }
W_{\mathrm{root}}Use in source · 1 passage
Search aliases: W_root mathrm
Use in source · 19-summary-of-main-results.tex, line 138
For every finite rooted hierarchy whose children edge-cover their parent, W_a≅mathscr W(G_a) for every hierarchy node a, and in particular W_root≅mathscr W(G). If level r contributes defect δ_r and downstream collapse maps have Lipschitz constants L_s, then δ_flat^(R) ≤ ∑_r=0^R-1 ( ∏_s=r+1^R-1L_s )δ_r.
Exact mathematical passage
\boxed{W_{\mathrm{root}}\cong\mathscr W(G).}
W_SUse in source · 1 passage
Search aliases: W_S
Use in source · 15-boundary-formation-and-stability.tex, line 134
S, define Coh(S) = tr ( P_S,dL_SP_S,d ), where P_S,d projects onto the selected low-energy workspace modes. Let Cut(S) = ∑_e:s(e)∈ S, t(e)∉ Sw_e + ∑_e:s(e)∉ S, t(e)∈ Sw_e. Let k_ε(S) be the minimal sufficient coalition size inside the candidate subsystem. A candidate is admissible only if SRW_Θ_S(W_S)=1, k_ε(S)≥2, unless the claim explicitly concerns a centralized workspace.
Exact mathematical passage
\operatorname{SRW}_{\Theta_S}(W_S)=1, \qquad k_\varepsilon(S)\geq2,
\mathcal W_tUse in source · 3 passages
Search aliases: W_t mathcal
Use in source · 10-persistence.tex, line 85
Let P_t project onto a selected rank-d low-energy workspace cluster of L_t, and set W_t=ran P_t. Write g_t=λ_d+1(L_t)-λ_d(L_t)>0 for the separating spectral gap and η_t^L=2 D_t δ_t^D+(δ_t^D)^2.
Exact mathematical passage
\mathcal W_t=\ran P_t.
\mathsf W_t'Use in source · 1 passage
Search aliases: W_t' mathsf
Use in source · 08-causal-efficacy-and-reentry.tex, line 80
[Coordinate invariance of intervention effects] Let g: W_t→ W_t' be a measurable bijection and suppose the reparametrized intervention family satisfies ι_g(w)'=ι_w. Then every divergence-based causal effect is preserved: CE_Workspace'(g(w),g(w');b) = CE_Workspace(w,w';b).
Exact mathematical passage
g:\mathsf W_t\to\mathsf W_t'
W_{t+1}Use in source · 1 passage
Search aliases: W_t+1
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 77
C_t^ctl = ( W_t,G_t,M_t,B_t,E_t ), where G_t is the represented goal, M_t is a workspace-integrity monitor, B_t is the current boundary or routing state, and E_t is the declared external context. An action is generated by A_t ∼ π_t ( ·mid W_t,G_t,M_t,B_t,E_t ). The future controlled state obeys a time-unrolled structural model S_t+1 = F_t(S_t,A_t,E_t+1,ξ_t+1), W_t+1=ω_t+1(S_t+1). The intervention semantics are inherited from Part~VII. A symbol such as do(A_t=a) is meaningful only when an impleme…
Exact mathematical passage
S_{t+1} = F_t(S_t,A_t,E_{t+1},\xi_{t+1}), \qquad W_{t+1}=\omega_{t+1}(S_{t+1}).
\mathcal W_{t+1}Use in source · 1 passage
Search aliases: W_t+1 mathcal
Use in source · 10-persistence.tex, line 325
Low off-workspace error is not sufficient for meaningful persistence. The zero update F_t=0 drives every state exactly into every linear workspace while destroying all content. Define the internal transport B_t=P_t+1F_tP_t: W_t⟶ W_t+1 and its non-collapse margin μ_t^keep = σ_min(B_t|_ W_t). A content-preserving persistence claim requires μ_t^keep>0 for the relevant interval, or an information-theoretic replacement when the workspace state is stochastic. Structural tracking, state tracking, and c…
Exact mathematical passage
B_t=P_{t+1}F_tP_t:\mathcal W_t\longrightarrow\mathcal W_{t+1}
W_{t+\tau}^{r}Use in source · 2 passages
Search aliases: W_t+τ^r tau
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 848
Restoration of performance is not automatically restoration of identity. Let W_t^- be the last certified pre-damage workspace and let W_t+τ^r be the post-repair workspace. Define the repair identity defect δ_rep-id(r) = d_id ( W_t^-,W_t+τ^r ). A repair action is identity preserving at tolerance ε_id when Δ_t^rep(r;d)>0, δ_rep-id(r) ≤ ε_id. When integrity is restored but the identity defect exceeds tolerance, the result is better described as a successor or replacement workspace. This terminologi…
Exact mathematical passage
W_{t+\tau}^{r}
W_{t^-}Use in source · 2 passages
Search aliases: W_t^-
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 847
Restoration of performance is not automatically restoration of identity. Let W_t^- be the last certified pre-damage workspace and let W_t+τ^r be the post-repair workspace. Define the repair identity defect δ_rep-id(r) = d_id ( W_t^-,W_t+τ^r ). A repair action is identity preserving at tolerance ε_id when Δ_t^rep(r;d)>0, δ_rep-id(r) ≤ ε_id. When integrity is restored but the identity defect exceeds tolerance, the result is better described as a successor or replacement workspace. This terminologi…
Exact mathematical passage
W_{t^-}
W_t^{\mathrm{str}}Use in source · 3 passages
Search aliases: W_t^str mathrm
Use in source · 06-dynamic-workspace-theory.tex, line 89
Let c(t)=(c_i(t))_i∈ V ∈ C_V(t), P_t= 1_[0,ε_t](L_t). The instantaneous structural workspace coordinate is W_t^str=P_tc(t) ∈ Γ_ε_t(H(t)). When P_t varies with time, these coordinates inhabit a moving family of subspaces. Parts~X--XII will supply the transport required to compare them across time. In what follows, all sufficiency and intervention statements are made at a fixed decision time t.
Exact mathematical passage
\boxed{ W_t^{\mathrm{str}}=P_tc(t) \in \Gamma_{\varepsilon_t}(H(t)). }
w_YUse in source · 1 passage
Search aliases: w_Y
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
W_\alphaUse in source · 9 passages
Search aliases: W_α alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 99
For pairwise overlaps write mathscr W_α=mathscr W(G_α), mathscr W_αβ=mathscr W(G_αβ), and r_αβ^α: mathscr W_α→mathscr W_αβ, r_αβ^β: mathscr W_β→mathscr W_αβ. The interface is therefore a cospan mathscr W_α xrightarrow r_αβ^α mathscr W_αβ xleftarrow r_αβ^β mathscr W_β, not necessarily a direct transfer map from one complete local workspace to the other. Both charts are compared through the content they expose on their common domain.
Exact mathematical passage
\mathscr W_\alpha=\mathscr W(G_\alpha), \qquad \mathscr W_{\alpha\beta}=\mathscr W(G_{\alpha\beta}),
w_\alphaUse in source · 9 passages
Search aliases: w_α alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 153
the zero space. The coboundary δ^p:check C^p⟶check C^p+1 is (δ^p s)_α_0⋯α_p+1 = ∑_j=0^p+1(-1)^j r_α_0⋯α_p+1^% α_0⋯widehatα_j⋯α_p+1 % s_α_0⋯widehatα_j⋯α_p+1. The restriction identities imply δ^p+1δ^p=0. For a local family w=(w_α)_α, (δ^0w)_αβ = r_αβ^βw_β - r_αβ^αw_α. Thus δ^0 is the overlap-discrepancy operator at the level of exact local workspaces.
Exact mathematical passage
w=(w_\alpha)_\alpha
W_{\alpha\beta}Use in source · 6 passages
Search aliases: W_αβ alpha beta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 99
For pairwise overlaps write mathscr W_α=mathscr W(G_α), mathscr W_αβ=mathscr W(G_αβ), and r_αβ^α: mathscr W_α→mathscr W_αβ, r_αβ^β: mathscr W_β→mathscr W_αβ. The interface is therefore a cospan mathscr W_α xrightarrow r_αβ^α mathscr W_αβ xleftarrow r_αβ^β mathscr W_β, not necessarily a direct transfer map from one complete local workspace to the other. Both charts are compared through the content they expose on their common domain.
Exact mathematical passage
\mathscr W_\alpha=\mathscr W(G_\alpha), \qquad \mathscr W_{\alpha\beta}=\mathscr W(G_{\alpha\beta}),
W_\betaUse in source · 2 passages
Search aliases: W_β beta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 105
For pairwise overlaps write mathscr W_α=mathscr W(G_α), mathscr W_αβ=mathscr W(G_αβ), and r_αβ^α: mathscr W_α→mathscr W_αβ, r_αβ^β: mathscr W_β→mathscr W_αβ. The interface is therefore a cospan mathscr W_α xrightarrow r_αβ^α mathscr W_αβ xleftarrow r_αβ^β mathscr W_β, not necessarily a direct transfer map from one complete local workspace to the other. Both charts are compared through the content they expose on their common domain.
Exact mathematical passage
r_{\alpha\beta}^{\alpha}: \mathscr W_\alpha\to\mathscr W_{\alpha\beta}, \qquad r_{\alpha\beta}^{\beta}: \mathscr W_\beta\to\mathscr W_{\alpha\beta}.
w_\betaUse in source · 3 passages
Search aliases: w_β beta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 154
ndary δ^p:check C^p⟶check C^p+1 is (δ^p s)_α_0⋯α_p+1 = ∑_j=0^p+1(-1)^j r_α_0⋯α_p+1^% α_0⋯widehatα_j⋯α_p+1 % s_α_0⋯widehatα_j⋯α_p+1. The restriction identities imply δ^p+1δ^p=0. For a local family w=(w_α)_α, (δ^0w)_αβ = r_αβ^βw_β - r_αβ^αw_α. Thus δ^0 is the overlap-discrepancy operator at the level of exact local workspaces.
Exact mathematical passage
\boxed{ (\delta^0w)_{\alpha\beta} = r_{\alpha\beta}^{\beta}w_\beta - r_{\alpha\beta}^{\alpha}w_\alpha. }
w_\ThetaUse in source · 1 passage
Search aliases: w_Θ Theta
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
W_\lambdaUse in source · 3 passages
Search aliases: W_λ lambda
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 41
For a one-parameter family R_λ, define λ_str · = inf{λ: d_ε(λ)>0, g_ε(λ)>0}, λ_op · = inf{λ: δ_align(λ) ≤ε_op}, λ_causal · = inf{λ: η_causal(λ) ≥τ_causal}, λ_rel · = inf{λ: k_ε(λ)≥2, Δ_tr(λ) ≥τ_tr}, λ_form · = inf{λ: Form_Θ_form (W_λ)=1}. In general, λ_str, λ_op, λ_causal, λ_rel, λ_form can be distinct. A synchronized representation can appear before it becomes causally useful, and causal coordination can appear while remaining reducible to one centralized component.
Exact mathematical passage
\begin{aligned} \lambda_{\mathrm{str}} &= \inf\{\lambda: d_{\varepsilon}(\lambda)>0, g_{\varepsilon}(\lambda)>0\},\\ \lambda_{\mathrm{op}} &= \inf\{\lambda: \delta_{\mathrm{align}}(\lambda) \leq\varepsilon_{\mathrm{op}}\},\\ \lambda_{\mathrm{causal}} &= \inf\{\lambda: \eta_{\mathrm{causal}}(\lambda) \geq\tau_{\mathrm{causal}}\},\\ \lambda_{\mathrm{rel}} &= \inf\{\lambda: k_\varepsilon(\lambda)\geq2, \Delta_{\mathrm{tr}}(\lambda) \geq\tau_{\mathrm{tr}}\},\\ \lambda_{\mathrm{form}} &= \inf\{\lambda: \operatorname{Form}_{\Theta_{\mathrm{form}}} (W_\lambda)=1\}. \end{aligned}
W_\PiUse in source · 5 passages
Search aliases: W_Π Pi
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 125
D_∂ , D_int = ⊕_α=1^mD_α, where D_α contains the edge constraints internal to V_α, and D_∂ contains the constraints crossing between blocks. Define the internally coherent macro-state spaces W_α=ker D_α, W_Π=⊕_α=1^mW_α. Let J_Π:W_Π↪ C_V be the canonical isometric inclusion, and define the quotient discrepancy D_Π=D_∂J_Π. The quotient does not replace a group of nodes by an arbitrary summary. Its macro-state is the complete internal section space of that group, and its boundary operator retains a…
Exact mathematical passage
J_\Pi:W_\Pi\hookrightarrow\mathcal C_V
W_{\Pi}Use in source · 1 passage
Search aliases: W_Π Pi
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 119
D_∂ , D_int = ⊕_α=1^mD_α, where D_α contains the edge constraints internal to V_α, and D_∂ contains the constraints crossing between blocks. Define the internally coherent macro-state spaces W_α=ker D_α, W_Π=⊕_α=1^mW_α. Let J_Π:W_Π↪ C_V be the canonical isometric inclusion, and define the quotient discrepancy D_Π=D_∂J_Π. The quotient does not replace a group of nodes by an arbitrary summary. Its macro-state is the complete internal section space of that group, and its boundary operator retains a…
Exact mathematical passage
W_\alpha=\ker D_\alpha, \qquad W_{\Pi}=\bigoplus_{\alpha=1}^{m}W_\alpha.
W_{\varsigma}Use in source · 1 passage
Search aliases: W_ς varsigma
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 300
Changing the decomposition can alter the coordinate realization of the workspace, while changing the target or horizon can alter the relevant predictive state. Let Φ_ς:W_ς_0⟶ W_ς be the declared correspondence when such transport is needed. For each gate, assume a bound | m_q(Φ_ςW;ς) -m_q(W;ς_0) | ≤ L_qd_ S(ς,ς_0) +b_q(ς), where b_q records mismatch not represented by the metric. The mismatch may include a change of model class, imperfect target coupling, or an intervention whose implementation …
Exact mathematical passage
\Phi_{\varsigma}:W_{\varsigma_0}\longrightarrow W_{\varsigma}
W_{\varsigma_0}Use in source · 1 passage
Search aliases: W_ς_0 varsigma
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 300
Changing the decomposition can alter the coordinate realization of the workspace, while changing the target or horizon can alter the relevant predictive state. Let Φ_ς:W_ς_0⟶ W_ς be the declared correspondence when such transport is needed. For each gate, assume a bound | m_q(Φ_ςW;ς) -m_q(W;ς_0) | ≤ L_qd_ S(ς,ς_0) +b_q(ς), where b_q records mismatch not represented by the metric. The mismatch may include a change of model class, imperfect target coupling, or an intervention whose implementation …
Exact mathematical passage
\Phi_{\varsigma}:W_{\varsigma_0}\longrightarrow W_{\varsigma}
w_\tauUse in source · 1 passage
Search aliases: w_τ tau
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
w_\omegaUse in source · 2 passages
Search aliases: w_ω omega
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 297
A more stable quantity measures primitive carrier cost. Let w_ω>0 be a declared cost for each ω∈Ω, and assign a block the cost c(B)=∑_ω∈ Bw_ω. Define the sufficient support cost s_ε( D) = min_S⊆ V_ D { ∑_B∈ Sc(B): Risk_ D(S) ≤ Risk_ D(V_ D)+ε }. If D_fpreceq D_c is information faithful, then s_ε( D_f) ≤ s_ε( D_c). The fine decomposition permits every union of coarse blocks and may also permit cheaper sub-block coalitions. Equality holds whenever an optimal fine coalition is a union of complete c…
Exact mathematical passage
w_\omega>0
W_\ellUse in source · 1 passage
Search aliases: W_ℓ ell
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 914
A finite workspace hierarchy is a rooted tree T. Each node a∈ T carries a subgraph G_a. The root r carries G_r=G. For every internal node a, its children Ch(a) form a finite edge-complete cover of G_a. Leaves carry primitive local workspace spaces W_ℓ=mathscr W(G_ℓ). For an internal node, define recursively W_a = ker ( δ_a^0: ⊕_b∈Ch(a)W_b ⟶ ⊕_b<cW_bc ), where the overlap spaces and restrictions are inherited from the child cover.
Exact mathematical passage
W_\ell=\mathscr W(G_\ell).
w_\ellUse in source · 1 passage
Search aliases: w_ℓ ell
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
\widehat aUse in source · 4 passages
Search aliases: widehat a widehat
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 538
) is δ_opt-optimal for widehat Q: max_π E_a∼π[widehat Q(a)] - E_a∼widehatπ[widehat Q(a)] ≤ δ_opt. Then, for every true-value-optimal policy π^*, E_a∼π^*[Q(a)] - E_a∼widehatπ[Q(a)] ≤ 2ε_Q+δ_opt. For a deterministic greedy action widehat a∈argmax_awidehat Q(a), Q(a^*)-Q(widehat a) ≤2ε_Q. If the true optimal action a^* is unique and its value gap Δ_Q = Q(a^*)- max_a≠ a^*Q(a) satisfies Δ_Q>2ε_Q, then every greedy maximizer of widehat Q equals a^*.
Exact mathematical passage
\widehat a\in\argmax_a\widehat Q(a)
\widehat{\mathcal B}Use in source · 2 passages
Search aliases: widehat B widehat mathcal
Use in source · 15-boundary-formation-and-stability.tex, line 163
· -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\widehat S_t \in \argmax_{S\in\mathfrak S_{\mathrm{pass}}} \widehat{\mathcal B}_t(S),
\widehat{\mathcal B}_tUse in source · 2 passages
Search aliases: widehat B_t widehat mathcal
Use in source · 15-boundary-formation-and-stability.tex, line 163
· -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\widehat S_t \in \argmax_{S\in\mathfrak S_{\mathrm{pass}}} \widehat{\mathcal B}_t(S),
\widehat CUse in source · 4 passages
Search aliases: widehat C widehat
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 467
m:workspace-nonidentifiability Let R, R'∈ M satisfy R≡_ E R' but Cert(W_ R;ς) ≠ Cert(W_ R';ς). Then the workspace certificate is not identifiable on M under E. More strongly, for every possibly randomized decision rule widehat C based only on data generated by E, P_ R ( widehat C≠ C_ R ) + P_ R' ( widehat C≠ C_ R' ) =1, where C_ R=Cert(W_ R;ς). Consequently, inf_widehat C max{ P_ R(widehat C≠ C_ R), P_ R'(widehat C≠ C_ R') } ≥frac12.
Exact mathematical passage
\widehat C
\widehat cUse in source · 11 passages
Search aliases: widehat c widehat
Use in source · 11-reconstruction-and-resilience.tex, line 110
[Stable core reconstruction] Assume α_S>0 and observe y=A_Sc+η. With the canonical estimate widehat c=A_S^† y, one has widehat c-c ≤ frac η sqrtα_S.
Exact mathematical passage
\widehat c=A_S^\dagger y,
\widehat{\mathcal C}Use in source · 3 passages
Search aliases: widehat C widehat mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 556
Local candidates may also violate their internal transfer equations. Define the local-copy space widehat C_ U = ⊕_α∈ A C_V(G_α) and the block internal discrepancy widehat D_ U = ⊕_α∈ AD_G_α. For u=(u_α)_α∈widehat C_ U, define the raw overlap synchronization operator (S_ Uu)_αβ = ρ_G_αβ^G_βu_β - ρ_G_αβ^G_αu_α. For an overlap weight λ_ov>0, set K_ U = widehat D_ U
Exact mathematical passage
\widehat{\mathcal C}_{\mathcal U} = \bigoplus_{\alpha\in A}\mathcal C_V(G_\alpha)
\widehat{\mathcal C}_{\mathcal U}Use in source · 3 passages
Search aliases: widehat C_ U widehat mathcal mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 556
Local candidates may also violate their internal transfer equations. Define the local-copy space widehat C_ U = ⊕_α∈ A C_V(G_α) and the block internal discrepancy widehat D_ U = ⊕_α∈ AD_G_α. For u=(u_α)_α∈widehat C_ U, define the raw overlap synchronization operator (S_ Uu)_αβ = ρ_G_αβ^G_βu_β - ρ_G_αβ^G_αu_α. For an overlap weight λ_ov>0, set K_ U = widehat D_ U
Exact mathematical passage
\widehat{\mathcal C}_{\mathcal U} = \bigoplus_{\alpha\in A}\mathcal C_V(G_\alpha)
\widehat c_AUse in source · 1 passage
Search aliases: widehat c_A widehat
Use in source · 11-reconstruction-and-resilience.tex, line 264
[Uniform erasure resilience] The encoding family is exactly reconstructible after every loss of at most k nodes if and only if α^(k)>0. If surviving observations have the form y_V∖ A=A_V∖ Ac+η_A, |A|≤ k, then the canonical survivor decoder obeys the uniform estimate widehat c_A-c ≤ frac η_A sqrtα^(k).
Exact mathematical passage
\boxed{ \|\widehat c_A-c\| \leq \frac{\|\eta_A\|}{\sqrt{\alpha^{(k)}}}. }
\widehat DUse in source · 2 passages
Search aliases: widehat D widehat
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 562
Local candidates may also violate their internal transfer equations. Define the local-copy space widehat C_ U = ⊕_α∈ A C_V(G_α) and the block internal discrepancy widehat D_ U = ⊕_α∈ AD_G_α. For u=(u_α)_α∈widehat C_ U, define the raw overlap synchronization operator (S_ Uu)_αβ = ρ_G_αβ^G_βu_β - ρ_G_αβ^G_αu_α. For an overlap weight λ_ov>0, set K_ U = widehat D_ U
Exact mathematical passage
\widehat D_{\mathcal U} = \bigoplus_{\alpha\in A}D_{G_\alpha}.
\widehat D_{\mathcal U}Use in source · 2 passages
Search aliases: widehat D_ U widehat mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 562
Local candidates may also violate their internal transfer equations. Define the local-copy space widehat C_ U = ⊕_α∈ A C_V(G_α) and the block internal discrepancy widehat D_ U = ⊕_α∈ AD_G_α. For u=(u_α)_α∈widehat C_ U, define the raw overlap synchronization operator (S_ Uu)_αβ = ρ_G_αβ^G_βu_β - ρ_G_αβ^G_αu_α. For an overlap weight λ_ov>0, set K_ U = widehat D_ U
Exact mathematical passage
\widehat D_{\mathcal U} = \bigoplus_{\alpha\in A}D_{G_\alpha}.
\widehat H^{(1)}Use in source · 1 passage
Search aliases: widehat H^(1) widehat
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 1291
Train the same formation rule under several scaffolds Σ^(1),…,Σ^(K) that differ in node labels, coordinate systems, and communication topology but support the same abstract task. After gauge alignment, measure whether the learned organizations transport to a common equivalence class: [widehat H^(1)]_ G ≅⋯≅ [widehat H^(K)]_ G. A structure that appears only under one answer-encoding scaffold has weak endogeneity evidence. A structure that recurs across alternative scaffolds, passes held-out task a…
Exact mathematical passage
[\widehat H^{(1)}]_{\mathcal G} \cong\cdots\cong [\widehat H^{(K)}]_{\mathcal G}.
\widehat H^{(K)}Use in source · 1 passage
Search aliases: widehat H^(K) widehat
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 1291
Train the same formation rule under several scaffolds Σ^(1),…,Σ^(K) that differ in node labels, coordinate systems, and communication topology but support the same abstract task. After gauge alignment, measure whether the learned organizations transport to a common equivalence class: [widehat H^(1)]_ G ≅⋯≅ [widehat H^(K)]_ G. A structure that appears only under one answer-encoding scaffold has weak endogeneity evidence. A structure that recurs across alternative scaffolds, passes held-out task a…
Exact mathematical passage
[\widehat H^{(1)}]_{\mathcal G} \cong\cdots\cong [\widehat H^{(K)}]_{\mathcal G}.
\widehat H_\tauUse in source · 2 passages
Search aliases: widehat H_τ widehat tau
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 532
mpirical-transfer-bound For samples (X_r,Y_r)_r=1^n, write widehatΣ_XX = frac1n∑_r=1^nX_rX_r^ T, widehat M = frac1n∑_r=1^nξ_rX_r^ T. If widehatΣ_XXsucceqwidehatκ I, then ordinary least squares satisfies widehat H-H_* _F ≤ frac widehat M _Fwidehatκ. For ridge parameter τ>0, widehat H_τ-H_* _F ≤ frac widehat M _F+τ H_* _F widehatκ+τ .
Exact mathematical passage
\boxed{ \|\widehat H_\tau-H_*\|_F \leq \frac{ \|\widehat M\|_F+\tau\|H_*\|_F }{ \widehat\kappa+\tau }. }
\widehat JUse in source · 3 passages
Search aliases: widehat J widehat
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 614
[Uniform structure-selection recovery] Let T be a finite candidate family with population score J: T→ R. Let θ_* = argmin_θ∈ TJ(θ) be unique, with margin Δ_J = min_θ≠θ_* (J(θ)-J(θ_*))>0. If a held-out estimate widehat J satisfies sup_θ∈ T |widehat J(θ)-J(θ)| ≤ε, then every empirical minimizer widehatθ obeys J(widehatθ)-J(θ_*) ≤2ε. If 2ε<Δ_J, then widehatθ=θ_*.
Exact mathematical passage
\widehat J
\widehat MUse in source · 6 passages
Search aliases: widehat M widehat
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 513
[Deterministic empirical recovery bound] For samples (X_r,Y_r)_r=1^n, write widehatΣ_XX = frac1n∑_r=1^nX_rX_r^ T, widehat M = frac1n∑_r=1^nξ_rX_r^ T. If widehatΣ_XXsucceqwidehatκ I, then ordinary least squares satisfies widehat H-H_* _F ≤ frac widehat M _Fwidehatκ. For ridge parameter τ>0, widehat H_τ-H_* _F ≤ frac widehat M _F+τ H_* _F widehatκ+τ .
Exact mathematical passage
\widehat\Sigma_{XX} = \frac1n\sum_{r=1}^nX_rX_r^{\mathsf T}, \qquad \widehat M = \frac1n\sum_{r=1}^n\xi_rX_r^{\mathsf T}.
\widehat mUse in source · 8 passages
Search aliases: widehat m widehat
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 390
In practice, the reference margin is reduced by three distinct uncertainty budgets: B_q^total = B_q^model +B_q^spec +B_q^sample. The first covers variation across observationally compatible realizations. The second covers variation across admissible specifications. The third covers finite-sample estimation. The sufficient condition widehat m_q(W;ς_0) > B_q^total (q∈ J_*) will reappear below in identified-set and confidence-envelope form. Keeping the budgets separate prevents an apparently narrow…
Exact mathematical passage
\widehat m_q(W;\varsigma_0) > B_q^{\mathrm{total}} \qquad(q\in\mathcal J_*)
\widehat m_qUse in source · 8 passages
Search aliases: widehat m_q widehat
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 390
In practice, the reference margin is reduced by three distinct uncertainty budgets: B_q^total = B_q^model +B_q^spec +B_q^sample. The first covers variation across observationally compatible realizations. The second covers variation across admissible specifications. The third covers finite-sample estimation. The sufficient condition widehat m_q(W;ς_0) > B_q^total (q∈ J_*) will reappear below in identified-set and confidence-envelope form. Keeping the budgets separate prevents an apparently narrow…
Exact mathematical passage
\widehat m_q(W;\varsigma_0) > B_q^{\mathrm{total}} \qquad(q\in\mathcal J_*)
\widehat Q_nUse in source · 2 passages
Search aliases: widehat Q_n widehat
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 187
Let Q(λ) be a gate-specific population order parameter and widehat Q_n(λ) its held-out estimate. If sup_λ∈Λ_n |widehat Q_n(λ)-Q(λ)| ≤ε_n on a finite evaluation grid Λ_n, then every threshold crossing with vertical margin larger than 2ε_n is recovered by the same uniform-selection argument as Theorem~[source reference]. Near a continuous transition, the margin vanishes and sample requirements necessarily grow. A broad, slowly varying crossover should not be reported as a sharp phase transition wi…
Exact mathematical passage
\widehat Q_n(\lambda)
\widehat rUse in source · 9 passages
Search aliases: widehat r widehat
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 801
[Repair selection under value-model error] Fix a damage intervention d and a finite feasible repair set R. Let V(r)=V_t^rep(r;d) be the true expected post-repair integrity margin and let widehat V obey sup_r∈ R|widehat V(r)-V(r)| ≤ ε_R. Let widehat r∈argmax_rwidehat V(r) and r^*∈argmax_r V(r). Then V(r^*)-V(widehat r) ≤ 2ε_R. If V(r^*) ≥ ρ+2ε_R, then the selected repair restores the expected reserve: V(widehat r)≥ρ. If r^* is unique and its repair-value gap exceeds 2ε_R, then widehat r=r^*.
Exact mathematical passage
\widehat r\in\argmax_r\widehat V(r)
\widehat{\mathcal R}Use in source · 1 passage
Search aliases: widehat R widehat mathcal
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 395
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1 · + λ_stab J_stab + λ_leak J_leak }. The objective is schematic rather than universal. Its purpose is to expose which quantities were fixed and which were optimized. If z and …
Exact mathematical passage
\boxed{ \begin{aligned} \widehat\theta \in \argmin_{z,a,H,P,\mathcal O,B} \Bigl \{& \widehat{\mathcal R}_{\mathrm{task}} + \lambda_{\mathrm{coh}}\|D_{a,H}c\|^2 + \lambda_E\|a\|_1 + \lambda_V\|z\|_1\\ &+ \lambda_{\mathrm{stab}}\mathcal J_{\mathrm{stab}} + \lambda_{\mathrm{leak}}\mathcal J_{\mathrm{leak}} \Bigr\}. \end{aligned} }
\widehat{\mathfrak R}Use in source · 3 passages
Search aliases: widehat R widehat mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 690
In finite samples, the identified set is itself uncertain. Let widehat R_1-δ be a confidence region satisfying inf_ R_0∈ M P_ R_0 ( R_0∈ widehat R_1-δ ) ≥1-δ. A conservative robust lower margin is widehat r_1-δ = inf_ R∈widehat R_1-δ inf_ς∈ S min_q m_q(W_ R;ς). If widehat r_1-δ>0, a false specification-robust certificate has probability at most δ, provided that the model class and specification family were fixed before the confidence region was computed. This confidence-set approach is useful wh…
Exact mathematical passage
\widehat{\mathfrak R}_{1-\delta}
\widehat r_{1-\delta}Use in source · 2 passages
Search aliases: widehat r_1-δ widehat delta
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 704
In finite samples, the identified set is itself uncertain. Let widehat R_1-δ be a confidence region satisfying inf_ R_0∈ M P_ R_0 ( R_0∈ widehat R_1-δ ) ≥1-δ. A conservative robust lower margin is widehat r_1-δ = inf_ R∈widehat R_1-δ inf_ς∈ S min_q m_q(W_ R;ς). If widehat r_1-δ>0, a false specification-robust certificate has probability at most δ, provided that the model class and specification family were fixed before the confidence region was computed. This confidence-set approach is useful wh…
Exact mathematical passage
\widehat r_{1-\delta} = \inf_{\mathfrak R\in\widehat{\mathfrak R}_{1-\delta}} \inf_{\varsigma\in\mathfrak S} \min_q m_q(W_{\mathfrak R};\varsigma).
\widehat{\mathfrak R}_{1-\delta}Use in source · 3 passages
Search aliases: widehat R_1-δ widehat mathfrak delta
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 690
In finite samples, the identified set is itself uncertain. Let widehat R_1-δ be a confidence region satisfying inf_ R_0∈ M P_ R_0 ( R_0∈ widehat R_1-δ ) ≥1-δ. A conservative robust lower margin is widehat r_1-δ = inf_ R∈widehat R_1-δ inf_ς∈ S min_q m_q(W_ R;ς). If widehat r_1-δ>0, a false specification-robust certificate has probability at most δ, provided that the model class and specification family were fixed before the confidence region was computed. This confidence-set approach is useful wh…
Exact mathematical passage
\widehat{\mathfrak R}_{1-\delta}
\widehat{\mathcal R}_{\mathrm{task}}Use in source · 1 passage
Search aliases: widehat R_task widehat mathcal mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 395
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1 · + λ_stab J_stab + λ_leak J_leak }. The objective is schematic rather than universal. Its purpose is to expose which quantities were fixed and which were optimized. If z and …
Exact mathematical passage
\boxed{ \begin{aligned} \widehat\theta \in \argmin_{z,a,H,P,\mathcal O,B} \Bigl \{& \widehat{\mathcal R}_{\mathrm{task}} + \lambda_{\mathrm{coh}}\|D_{a,H}c\|^2 + \lambda_E\|a\|_1 + \lambda_V\|z\|_1\\ &+ \lambda_{\mathrm{stab}}\mathcal J_{\mathrm{stab}} + \lambda_{\mathrm{leak}}\mathcal J_{\mathrm{leak}} \Bigr\}. \end{aligned} }
\widehat SUse in source · 10 passages
Search aliases: widehat S widehat
Use in source · 15-boundary-formation-and-stability.tex, line 163
· -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\widehat S_t \in \argmax_{S\in\mathfrak S_{\mathrm{pass}}} \widehat{\mathcal B}_t(S),
\widehat S_tUse in source · 5 passages
Search aliases: widehat S_t widehat
Use in source · 15-boundary-formation-and-stability.tex, line 163
· -a_KCut(S) -a_ZSize(S) -a_TInstability_t(S). The coefficients and all normalizations are part of the boundary problem. No single choice is universal. The selected boundary is widehat S_t ∈ argmax_S∈ S_pass widehat B_t(S), where S_pass contains only candidates that satisfy the required workspace and anti-centralization gates.
Exact mathematical passage
\widehat S_t \in \argmax_{S\in\mathfrak S_{\mathrm{pass}}} \widehat{\mathcal B}_t(S),
\widehat uUse in source · 2 passages
Search aliases: widehat u widehat
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 689
Let m_i=|{α:i∈ V_α}| be the multiplicity of vertex i. Then J_ U^*J_ U=M_ U, (M_ Uc)_i=m_ic_i. The pseudoinverse performs coordinatewise averaging: (J_ U^† u)_i = frac1m_i ∑_α:i∈ V_α(u_α)_i. Let widehat u = P_ker K_ Uu = J_ Uwidehat c. Then widehat c = J_ U^†widehat u and u-J_ Uwidehat c ≤ frac K_ Uu sqrtγ_ U^tot. If m_min=min_i m_i, then widehat c-J_ U^† u ≤ frac K_ Uu sqrtm_minγ_ U^tot. The simple overlap average and the globally coherent least-squares assembly are close only when the total des…
Exact mathematical passage
\widehat u = P_{\ker K_{\mathcal U}}u = J_{\mathcal U}\widehat c.
\widehat WUse in source · 2 passages
Search aliases: widehat W widehat
Use in source · 11-reconstruction-and-resilience.tex, line 209
[Reconstruction-to-risk transfer] Let W be sufficient for a target Y, let losses take values in [0,1], and let a coalition construct widehat W from its local data. Then its optimal Bayes risk satisfies 0≤ Risk(S)-Risk(W) ≤ 2L_K E[d_W(W,widehat W)].
Exact mathematical passage
\widehat W
\widehat wUse in source · 4 passages
Search aliases: widehat w widehat
Use in source · 11-reconstruction-and-resilience.tex, line 222
For every pair w,widehat w, using the Bayes action for K_widehat w under the true law K_w incurs conditional regret at most 2TV(K_w,K_widehat w). This follows by inserting and subtracting the risk under K_widehat w for both the chosen action and the Bayes action for K_w. Average the bound and use the Lipschitz assumption. The coalition's optimal rule performs at least as well as this decoder-based rule.
Exact mathematical passage
w,\widehat w
\widehat{\underline m}Use in source · 2 passages
Search aliases: widehatunderline m widehat underline
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 739
Let widehat m_q(ς) estimate m_q(W;ς). Suppose there are nonnegative error radii ε_q(n,δ) such that P( sup_ς∈ S | widehat m_q(ς)-m_q(ς) | ≤ ε_q(n,δ) for all q∈ J_* ) ≥1-δ. Define the empirical lower confidence envelope widehatunderline m_q,1-δ^ S = inf_ς∈ S widehat m_q(ς) - ε_q(n,δ).
Exact mathematical passage
\boxed{ \widehat{\underline m}_{q,1-\delta}^{\mathfrak S} = \inf_{\varsigma\in\mathfrak S} \widehat m_q(\varsigma) - \varepsilon_q(n,\delta). }
\widehat{\underline m}_{q,1-\delta}^{\mathfrak S}Use in source · 2 passages
Search aliases: widehatunderline m_q,1-δ^ S widehat underline delta mathfrak
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 739
Let widehat m_q(ς) estimate m_q(W;ς). Suppose there are nonnegative error radii ε_q(n,δ) such that P( sup_ς∈ S | widehat m_q(ς)-m_q(ς) | ≤ ε_q(n,δ) for all q∈ J_* ) ≥1-δ. Define the empirical lower confidence envelope widehatunderline m_q,1-δ^ S = inf_ς∈ S widehat m_q(ς) - ε_q(n,δ).
Exact mathematical passage
\boxed{ \widehat{\underline m}_{q,1-\delta}^{\mathfrak S} = \inf_{\varsigma\in\mathfrak S} \widehat m_q(\varsigma) - \varepsilon_q(n,\delta). }
\widehat{\alpha_j}Use in source · 1 passage
Search aliases: widehatα_j widehat alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 138
For p≥0, define the finite cochain space check C^p( U;mathscr W) = ⊕_α_0<⋯<α_p mathscr W(G_α_0⋯α_p), where empty intersections contribute the zero space. The coboundary δ^p:check C^p⟶check C^p+1 is (δ^p s)_α_0⋯α_p+1 = ∑_j=0^p+1(-1)^j r_α_0⋯α_p+1^% α_0⋯widehatα_j⋯α_p+1 % s_α_0⋯widehatα_j⋯α_p+1. The restriction identities imply δ^p+1δ^p=0. For a local family w=(w_α)_α, (δ^0w)_αβ = r_αβ^βw_β - r_αβ^αw_α. Thus δ^0 is the overlap-discrepancy operator at the level of exact local workspaces.
Exact mathematical passage
\boxed{ (\delta^p s)_{\alpha_0\cdots\alpha_{p+1}} = \sum_{j=0}^{p+1}(-1)^j r_{\alpha_0\cdots\alpha_{p+1}}^% {\alpha_0\cdots\widehat{\alpha_j}\cdots\alpha_{p+1}} % s_{\alpha_0\cdots\widehat{\alpha_j}\cdots\alpha_{p+1}}. }
\widehat\deltaUse in source · 1 passage
Search aliases: widehatδ widehat delta
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 69
The notation absorbs lower-bounded and upper-bounded gates into one sign convention. If a causal effect must exceed c_0, then m_q=widehatη-c_0. If a defect must remain below ε_0, then m_q=ε_0-widehatδ. The complete certificate therefore passes exactly when every required signed margin is positive.
Exact mathematical passage
m_q=\varepsilon_0-\widehat\delta.
\widehat\etaUse in source · 1 passage
Search aliases: widehatη widehat eta
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 65
The notation absorbs lower-bounded and upper-bounded gates into one sign convention. If a causal effect must exceed c_0, then m_q=widehatη-c_0. If a defect must remain below ε_0, then m_q=ε_0-widehatδ. The complete certificate therefore passes exactly when every required signed margin is positive.
Exact mathematical passage
m_q=\widehat\eta-c_0.
\widehat\kappaUse in source · 4 passages
Search aliases: widehatκ widehat kappa
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 522
[Deterministic empirical recovery bound] For samples (X_r,Y_r)_r=1^n, write widehatΣ_XX = frac1n∑_r=1^nX_rX_r^ T, widehat M = frac1n∑_r=1^nξ_rX_r^ T. If widehatΣ_XXsucceqwidehatκ I, then ordinary least squares satisfies widehat H-H_* _F ≤ frac widehat M _Fwidehatκ. For ridge parameter τ>0, widehat H_τ-H_* _F ≤ frac widehat M _F+τ H_* _F widehatκ+τ .
Exact mathematical passage
\widehat\Sigma_{XX}\succeq\widehat\kappa I
\widehat\piUse in source · 5 passages
Search aliases: widehatπ widehat pi
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 518
[Approximate counterfactual policy selection] Let A be a finite feasible action set. Let Q: A→ R be the true interventional value and let widehat Q satisfy sup_a∈ A|widehat Q(a)-Q(a)|≤ε_Q. Suppose a policy widehatπ is δ_opt-optimal for widehat Q: max_π E_a∼π[widehat Q(a)] - E_a∼widehatπ[widehat Q(a)] ≤ δ_opt. Then, for every true-value-optimal policy π^*, E_a∼π^*[Q(a)] - E_a∼widehatπ[Q(a)] ≤ 2ε_Q+δ_opt. For a deterministic greedy action widehat a∈argmax_awidehat Q(a), Q(a^*)-Q(widehat a) ≤2ε_Q. …
Exact mathematical passage
\widehat\pi
\widehat\pi_tUse in source · 1 passage
Search aliases: widehatπ_t widehat pi
Use in source · 19-summary-of-main-results.tex, line 455
If the interventional action-value estimator satisfies sup_a|widehat Q_t(a)-Q_t(a)|≤ε_Q and the implemented policy has optimization error at most δ_opt relative to widehat Q_t, then Reg_t(widehatπ_t) ≤ 2ε_Q+δ_opt. For deterministic greedy action, the bound is 2ε_Q. A unique true optimum with value gap greater than 2ε_Q is recovered exactly. The guarantee is relative to the declared utility, feasible action support, causal identification, and horizon.
Exact mathematical passage
\boxed{ \operatorname{Reg}_t(\widehat\pi_t) \leq 2\varepsilon_Q+\delta_{\mathrm{opt}}. }
\widehat\SigmaUse in source · 4 passages
Search aliases: widehatΣ widehat Sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 513
[Deterministic empirical recovery bound] For samples (X_r,Y_r)_r=1^n, write widehatΣ_XX = frac1n∑_r=1^nX_rX_r^ T, widehat M = frac1n∑_r=1^nξ_rX_r^ T. If widehatΣ_XXsucceqwidehatκ I, then ordinary least squares satisfies widehat H-H_* _F ≤ frac widehat M _Fwidehatκ. For ridge parameter τ>0, widehat H_τ-H_* _F ≤ frac widehat M _F+τ H_* _F widehatκ+τ .
Exact mathematical passage
\widehat\Sigma_{XX} = \frac1n\sum_{r=1}^nX_rX_r^{\mathsf T}, \qquad \widehat M = \frac1n\sum_{r=1}^n\xi_rX_r^{\mathsf T}.
\widehat\varsigmaUse in source · 2 passages
Search aliases: widehatς widehat varsigma
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 933
[Validity after independent specification selection] Let widehatς be selected using D_sel, and let D_cert be independent of D_sel. For every fixed ς∈ S, let ϕ_ς( D_cert)∈{0,1} be a certificate rule satisfying sup_P:Cert(W;ς)=0 P_P(ϕ_ς=1) ≤α. Then the selected-specification procedure satisfies sup_P P_P( ϕ_widehatς=1, Cert(W;widehatς)=0 ) ≤α.
Exact mathematical passage
\widehat\varsigma
\widehat\Sigma_{XX}Use in source · 3 passages
Search aliases: widehatΣ_XX widehat Sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 513
[Deterministic empirical recovery bound] For samples (X_r,Y_r)_r=1^n, write widehatΣ_XX = frac1n∑_r=1^nX_rX_r^ T, widehat M = frac1n∑_r=1^nξ_rX_r^ T. If widehatΣ_XXsucceqwidehatκ I, then ordinary least squares satisfies widehat H-H_* _F ≤ frac widehat M _Fwidehatκ. For ridge parameter τ>0, widehat H_τ-H_* _F ≤ frac widehat M _F+τ H_* _F widehatκ+τ .
Exact mathematical passage
\widehat\Sigma_{XX} = \frac1n\sum_{r=1}^nX_rX_r^{\mathsf T}, \qquad \widehat M = \frac1n\sum_{r=1}^n\xi_rX_r^{\mathsf T}.
\widehat\Sigma_{XX}^{-1}Use in source · 1 passage
Search aliases: widehatΣ_XX^-1 widehat Sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 547
The empirical normal equations give widehat H-H_* = widehat MwidehatΣ_XX^-1. For ridge regression, widehat H_τ-H_* = (widehat M-τ H_*) (widehatΣ_XX+τ I)^-1. Taking Frobenius and operator norms yields both estimates.
Exact mathematical passage
\widehat H-H_* = \widehat M\widehat\Sigma_{XX}^{-1}.
\widetilde FUse in source · 5 passages
Search aliases: widetilde F widetilde
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1043
[Approximate hierarchical collapse bound] Let F_r: H_r→ H_r+1, widetilde F_r: H_r→ H_r+1 be exact and implemented level-collapse maps for r=0,…,R-1. Let R_r⊆ H_r contain the exact and implemented states reachable at level r. Assume, on R_r, F_r(x)-F_r(y) ≤ L_r x-y and sup_x∈ R_r widetilde F_r(x)-F_r(x) ≤ δ_r. Then · widetilde F_R-1∘⋯∘widetilde F_0(x) - F_R-1∘⋯∘ F_0(x)
Exact mathematical passage
F_r:\mathcal H_r\to\mathcal H_{r+1}, \qquad \widetilde F_r:\mathcal H_r\to\mathcal H_{r+1}
\widetilde F_0Use in source · 2 passages
Search aliases: widetilde F_0 widetilde
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1064
l H_r+1, widetilde F_r: H_r→ H_r+1 be exact and implemented level-collapse maps for r=0,…,R-1. Let R_r⊆ H_r contain the exact and implemented states reachable at level r. Assume, on R_r, F_r(x)-F_r(y) ≤ L_r x-y and sup_x∈ R_r widetilde F_r(x)-F_r(x) ≤ δ_r. Then · widetilde F_R-1∘⋯∘widetilde F_0(x) - F_R-1∘⋯∘ F_0(x) · ≤ ∑_r=0^R-1 ( ∏_s=r+1^R-1L_s ) δ_r. In particular, if L_r≤1, then the total error is at most ∑_r=0^R-1δ_r. If L_r≤ L<1 and δ_r≤δ, then total error ≤ fracδ(1-L^R)1-L ≤ fracδ1-L.
Exact mathematical passage
\boxed{ \begin{aligned} &\left\| \widetilde F_{R-1}\circ\cdots\circ\widetilde F_0(x) - F_{R-1}\circ\cdots\circ F_0(x) \right\|\\ &\qquad\leq \sum_{r=0}^{R-1} \left( \prod_{s=r+1}^{R-1}L_s \right) \delta_r. \end{aligned} }
\widetilde F_rUse in source · 3 passages
Search aliases: widetilde F_r widetilde
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1043
[Approximate hierarchical collapse bound] Let F_r: H_r→ H_r+1, widetilde F_r: H_r→ H_r+1 be exact and implemented level-collapse maps for r=0,…,R-1. Let R_r⊆ H_r contain the exact and implemented states reachable at level r. Assume, on R_r, F_r(x)-F_r(y) ≤ L_r x-y and sup_x∈ R_r widetilde F_r(x)-F_r(x) ≤ δ_r. Then · widetilde F_R-1∘⋯∘widetilde F_0(x) - F_R-1∘⋯∘ F_0(x)
Exact mathematical passage
F_r:\mathcal H_r\to\mathcal H_{r+1}, \qquad \widetilde F_r:\mathcal H_r\to\mathcal H_{r+1}
\widetilde F_{R-1}Use in source · 2 passages
Search aliases: widetilde F_R-1 widetilde
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1064
l H_r+1, widetilde F_r: H_r→ H_r+1 be exact and implemented level-collapse maps for r=0,…,R-1. Let R_r⊆ H_r contain the exact and implemented states reachable at level r. Assume, on R_r, F_r(x)-F_r(y) ≤ L_r x-y and sup_x∈ R_r widetilde F_r(x)-F_r(x) ≤ δ_r. Then · widetilde F_R-1∘⋯∘widetilde F_0(x) - F_R-1∘⋯∘ F_0(x) · ≤ ∑_r=0^R-1 ( ∏_s=r+1^R-1L_s ) δ_r. In particular, if L_r≤1, then the total error is at most ∑_r=0^R-1δ_r. If L_r≤ L<1 and δ_r≤δ, then total error ≤ fracδ(1-L^R)1-L ≤ fracδ1-L.
Exact mathematical passage
\boxed{ \begin{aligned} &\left\| \widetilde F_{R-1}\circ\cdots\circ\widetilde F_0(x) - F_{R-1}\circ\cdots\circ F_0(x) \right\|\\ &\qquad\leq \sum_{r=0}^{R-1} \left( \prod_{s=r+1}^{R-1}L_s \right) \delta_r. \end{aligned} }
\widetilde HUse in source · 5 passages
Search aliases: widetilde H widetilde
Use in source · 04-approximate-workspaces.tex, line 500
Suppose the edge maps are perturbed to widetilde H_e=H_e+Δ_e while the weights and vertex metrics remain fixed. Define δ_H^2 = max_i∈ V ∑_e:s(e)=iw_e Δ_e ^2. Let F=D_widetilde H-D_H. Then (Fc)_e=-sqrtw_e Δ_ec_s(e), F ≤δ_H. Since L_widetilde H-L_H =D_H^*F+F^*D_H+F^*F, we obtain L_widetilde H-L_H ≤ 2 D_H δ_H+δ_H^2.
Exact mathematical passage
\widetilde H_e=H_e+\Delta_e
\widetilde H_eUse in source · 1 passage
Search aliases: widetilde H_e widetilde
Use in source · 04-approximate-workspaces.tex, line 500
Suppose the edge maps are perturbed to widetilde H_e=H_e+Δ_e while the weights and vertex metrics remain fixed. Define δ_H^2 = max_i∈ V ∑_e:s(e)=iw_e Δ_e ^2. Let F=D_widetilde H-D_H. Then (Fc)_e=-sqrtw_e Δ_ec_s(e), F ≤δ_H. Since L_widetilde H-L_H =D_H^*F+F^*D_H+F^*F, we obtain L_widetilde H-L_H ≤ 2 D_H δ_H+δ_H^2.
Exact mathematical passage
\widetilde H_e=H_e+\Delta_e
\widetilde LUse in source · 8 passages
Search aliases: widetilde L widetilde
Use in source · 04-approximate-workspaces.tex, line 442
[Spectral workspace stability] Let L and widetilde L=L+E be self-adjoint positive semidefinite operators on the same N-dimensional space. Suppose λ_d(L)<λ_d+1(L), g_d=λ_d+1(L)-λ_d(L)>0, and η= E <fracg_d2. Let P_d and widetilde P_d project onto the first d eigenvectors of L and widetilde L, respectively. Then the rank-d cluster remains separated and P_d-widetilde P_d ≤ fracηg_d-η ≤ frac2ηg_d.
Exact mathematical passage
\widetilde L=L+E
\widetilde L_HUse in source · 1 passage
Search aliases: widetilde L_H widetilde
Use in source · 19-summary-of-main-results.tex, line 32
subtopicT_4: Spectral stability theorem If η= widetilde L_H-L_H <g_d/2, then widetilde P_d-P_d ≤ fracηg_d-η ≤ frac2ηg_d.
Exact mathematical passage
\eta=\|\widetilde L_H-L_H\|<g_d/2
\widetilde mUse in source · 1 passage
Search aliases: widetilde m widetilde
Use in source · 26-discussion-limitations-and-philosophical-consequences.tex, line 20
The resulting position is neither that decomposition is arbitrary nor that one partition is uniquely privileged. Decompositions are constrained by access, causal interfaces, intervention separability, temporal continuity, and explicit shared resources. A certificate established only at one interface is a valid but limited claim. A stronger claim reports the full envelope ( widetilde m_q, underline m_q, overline m_q, Δ_q^dec ) for each required gate, where tilde m_q is the reference margin and th…
Exact mathematical passage
\left( \widetilde m_q, \underline m_q, \overline m_q, \Delta_q^{\mathrm{dec}} \right)
\widetilde m_qUse in source · 1 passage
Search aliases: widetilde m_q widetilde
Use in source · 26-discussion-limitations-and-philosophical-consequences.tex, line 20
The resulting position is neither that decomposition is arbitrary nor that one partition is uniquely privileged. Decompositions are constrained by access, causal interfaces, intervention separability, temporal continuity, and explicit shared resources. A certificate established only at one interface is a valid but limited claim. A stronger claim reports the full envelope ( widetilde m_q, underline m_q, overline m_q, Δ_q^dec ) for each required gate, where tilde m_q is the reference margin and th…
Exact mathematical passage
\left( \widetilde m_q, \underline m_q, \overline m_q, \Delta_q^{\mathrm{dec}} \right)
\widetilde QUse in source · 7 passages
Search aliases: widetilde Q widetilde
Use in source · 04-approximate-workspaces.tex, line 403
[Separated spectral subspaces] Let A and B=A+E be self-adjoint operators. Let P be an A-spectral projector whose eigenvalues lie in ( -∞,a], and let widetilde Q be a B-spectral projector whose eigenvalues lie in [b,∞), with b>a. Then Pwidetilde Q ≤ frac E b-a.
Exact mathematical passage
\widetilde Q
\widetilde xUse in source · 2 passages
Search aliases: widetilde x widetilde
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1098
Let x_r and widetilde x_r be the exact and implemented states after r levels. Then widetilde x_r+1-x_r+1 · ≤ widetilde F_r(widetilde x_r)-F_r(widetilde x_r)
Exact mathematical passage
\widetilde x_r
\widetilde x_rUse in source · 2 passages
Search aliases: widetilde x_r widetilde
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1098
Let x_r and widetilde x_r be the exact and implemented states after r levels. Then widetilde x_r+1-x_r+1 · ≤ widetilde F_r(widetilde x_r)-F_r(widetilde x_r)
Exact mathematical passage
\widetilde x_r
\widetilde x_{r+1}Use in source · 1 passage
Search aliases: widetilde x_r+1 widetilde
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1100
Let x_r and widetilde x_r be the exact and implemented states after r levels. Then widetilde x_r+1-x_r+1 · ≤ widetilde F_r(widetilde x_r)-F_r(widetilde x_r) · + F_r(widetilde x_r)-F_r(x_r) · ≤ δ_r+L_r widetilde x_r-x_r . Iterating this recurrence gives the displayed product-sum estimate. The final two bounds follow by summing a finite or infinite geometric series.
Exact mathematical passage
\begin{aligned} \|\widetilde x_{r+1}-x_{r+1}\| &\leq \|\widetilde F_r(\widetilde x_r)-F_r(\widetilde x_r)\|\\ &\quad+ \|F_r(\widetilde x_r)-F_r(x_r)\|\\ &\leq \delta_r+L_r\|\widetilde x_r-x_r\|. \end{aligned}
\widetilde YUse in source · 1 passage
Search aliases: widetilde Y widetilde
Use in source · 06-dynamic-workspace-theory.tex, line 74
The target Y_t^+ can be a next output, a finite future trajectory, a research decision, a proof outcome, or any measurable downstream quantity. Every predictive workspace claim is therefore target-relative: WorkspaceFor(Y_t^+) centernotLongrightarrow WorkspaceFor(widetilde Y_t^+).
Exact mathematical passage
\operatorname{WorkspaceFor}(Y_t^+) \centernot\Longrightarrow \operatorname{WorkspaceFor}(\widetilde Y_t^+).
\widetilde Y_t^+Use in source · 1 passage
Search aliases: widetilde Y_t^+ widetilde
Use in source · 06-dynamic-workspace-theory.tex, line 74
The target Y_t^+ can be a next output, a finite future trajectory, a research decision, a proof outcome, or any measurable downstream quantity. Every predictive workspace claim is therefore target-relative: WorkspaceFor(Y_t^+) centernotLongrightarrow WorkspaceFor(widetilde Y_t^+).
Exact mathematical passage
\operatorname{WorkspaceFor}(Y_t^+) \centernot\Longrightarrow \operatorname{WorkspaceFor}(\widetilde Y_t^+).
\operatorname{Workspace}Use in source · 1 passage
Search aliases: Workspace operatorname
Use in source · 01-foundational-thesis.tex, line 359
Workspace( R) centernotLongrightarrow Conscious( R). Likewise, Distributed(Workspace) centernotLongrightarrow Person(Workspace). Workspace structure, reentry, agency, self-maintenance, and phenomenal consciousness remain formally distinct predicates. Any bridge among them would require additional theory and evidence.
Exact mathematical passage
\operatorname{Workspace}(\mathfrak R) \centernot\Longrightarrow \operatorname{Conscious}(\mathfrak R).
\Workspace'Use in source · 1 passage
Search aliases: Workspace' Workspace
Use in source · 08-causal-efficacy-and-reentry.tex, line 86
[Coordinate invariance of intervention effects] Let g: W_t→ W_t' be a measurable bijection and suppose the reparametrized intervention family satisfies ι_g(w)'=ι_w. Then every divergence-based causal effect is preserved: CE_Workspace'(g(w),g(w');b) = CE_Workspace(w,w';b).
Exact mathematical passage
\CE_{\Workspace'}(g(w),g(w');b) = \CE_{\Workspace}(w,w';b).
\mathsf{workspace\_extractor}Use in source · 1 passage
Search aliases: workspace_extractor mathsf
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 660
The machine-readable record should contain at least the following top-level objects: ResultRecord ={ · claim, specification, specification_family, decomposition, data_splits, formation, · workspace_extractor, goals, actions, interventions, · nulls, gates, identified_sets, specification_envelopes, uncertainty, failures, artifacts }. Each gate object records its symbol, estimator, direction, threshold, point estimate, interval, split, seed set, status, and artifact reference. Each intervention and…
Exact mathematical passage
\boxed{ \begin{aligned} \mathsf{ResultRecord} =\{& \mathsf{claim}, \mathsf{specification}, \mathsf{specification\_family}, \mathsf{decomposition}, \mathsf{data\_splits}, \mathsf{formation},\\ &\mathsf{workspace\_extractor}, \mathsf{goals}, \mathsf{actions}, \mathsf{interventions},\\ &\mathsf{nulls}, \mathsf{gates}, \mathsf{identified\_sets}, \mathsf{specification\_envelopes}, \mathsf{uncertainty}, \mathsf{failures}, \mathsf{artifacts} \}. \end{aligned} }
\Workspace_{\mathrm{static}}Use in source · 1 passage
Search aliases: Workspace_static Workspace mathrm
Use in source · 03-exact-shared-cores.tex, line 501
The structural workspace is therefore more accurately represented by the triple Workspace_static = ( Γ(H), O_Workspace, π_Workspace ), not merely by the vector space Γ(H).
Exact mathematical passage
\boxed{ \Workspace_{\mathrm{static}} = \bigl( \Gamma(H), \mathcal O_{\Workspace}, \pi_{\Workspace} \bigr), }
\Workspace_tUse in source · 1 passage
Search aliases: Workspace_t Workspace
Use in source · 01-foundational-thesis.tex, line 334
Persistence does not require token identity. Let R_t and R_t+1 be temporally successive realizations. Continuity is possible when there exists an admissible transport J_t: R_trightsquigarrow R_t+1 that preserves the operative core and its causal role within tolerance: d_id(Workspace_t,Workspace_t+1)≤ε. Thus a workspace may persist by reconstruction rather than by retaining an unchanged physical inscription.
Exact mathematical passage
d_{\mathrm{id}}(\Workspace_t,\Workspace_{t+1})\leq\varepsilon.
\Workspace_{t+1}Use in source · 1 passage
Search aliases: Workspace_t+1 Workspace
Use in source · 01-foundational-thesis.tex, line 334
Persistence does not require token identity. Let R_t and R_t+1 be temporally successive realizations. Continuity is possible when there exists an admissible transport J_t: R_trightsquigarrow R_t+1 that preserves the operative core and its causal role within tolerance: d_id(Workspace_t,Workspace_t+1)≤ε. Thus a workspace may persist by reconstruction rather than by retaining an unchanged physical inscription.
Exact mathematical passage
d_{\mathrm{id}}(\Workspace_t,\Workspace_{t+1})\leq\varepsilon.
\operatorname{WorkspaceFor}Use in source · 1 passage
Search aliases: WorkspaceFor operatorname
Use in source · 06-dynamic-workspace-theory.tex, line 74
The target Y_t^+ can be a next output, a finite future trajectory, a research decision, a proof outcome, or any measurable downstream quantity. Every predictive workspace claim is therefore target-relative: WorkspaceFor(Y_t^+) centernotLongrightarrow WorkspaceFor(widetilde Y_t^+).
Exact mathematical passage
\operatorname{WorkspaceFor}(Y_t^+) \centernot\Longrightarrow \operatorname{WorkspaceFor}(\widetilde Y_t^+).
\mathcal XUse in source · 2 passages
Search aliases: X mathcal
Use in source · 02-static-core-transfer-theory.tex, line 44
For every i∈ V, assign a finite-dimensional Hilbert space X_i. For every edge, assign a linear transfer T_e:X_s(e)⟶ X_t(e). The path transfer is T_γ=T_e_m⋯ T_e_2T_e_1, T_1_i=I_X_i. Accordingly, the static transfer system is a functor X:Path(G)⟶FinHilb.
Exact mathematical passage
\mathcal X:\Path(G)\longrightarrow\mathbf{FinHilb}.
\mathfrak XUse in source · 3 passages
Search aliases: X mathfrak
Use in source · 04-approximate-workspaces.tex, line 560
Define the vertex and edge direct-sum representations ρ_V(a)=⊕_i∈ Vρ_i(a), ρ_E(a)=⊕_e∈ Eρ_t(e)(a). Lift the edgewise intertwining defects to ( X_a c)_e = sqrtw_e Ξ_e(a)c_s(e). Then the exact commutator identity is D_Hρ_V(a)-ρ_E(a)D_H=- X_a. Furthermore, X_a ≤ β(a), β(a)^2 = max_i∈ V ∑_e:s(e)=iw_e Ξ_e(a) ^2.
Exact mathematical passage
(\mathfrak X_a c)_e = \sqrt{w_e}\,\Xi_e(a)c_{s(e)}.
X'Use in source · 2 passages
Search aliases: X'
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 565
[Gauge covariance of least squares] Under invertible coordinate transformations X'=g_uX, Y'=g_vY, the population least-squares solution transforms as H_*'=g_vH_*g_u^-1.
Exact mathematical passage
X'=g_uX, \qquad Y'=g_vY,
x'Use in source · 1 passage
Search aliases: x'
Use in source · 15-boundary-formation-and-stability.tex, line 80
Let ι_S,x be a feasible intervention that changes the internal workspace coordinate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general.…
Exact mathematical passage
\boxed{ \COut_\tau(S) = \mathbb E_{x,x'\sim\nu_S} D\!\left( \mathcal L^{\iota_{S,x}} (X_{\bar S}(t+\tau)), \mathcal L^{\iota_{S,x'}} (X_{\bar S}(t+\tau)) \right). }
X^{\mathsf T}Use in source · 5 passages
Search aliases: X^ T mathsf
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 453
[Population transfer identification] Let X∈ R^d_u and Y∈ R^d_v satisfy Y=H_*X+ξ, E[ξ X^ T]=0, and assume Σ_XX = E[XX^ T] succeq κ I for some κ>0. Then H_* is the unique minimizer of R(H) = E Y-HX _2^2, with H_* = Σ_YXΣ_XX^-1. Moreover, R(H)- R(H_*) = tr ( (H-H_*)Σ_XX(H-H_*)^ T ) ≥ κ H-H_* _F^2.
Exact mathematical passage
Y=H_*X+\xi, \qquad \mathbb E[\xi X^{\mathsf T}]=0,
X_1Use in source · 14 passages
Search aliases: X_1
Use in source · 07-relational-irreducibility.tex, line 377
[XOR witness pair] Under the intact law P, let X_1,X_2oversetiid∼Bernoulli(1/2), Y=X_1⊕ X_2. Then each (X_i,Y) pair is independent and uniform, so H_P(Ymid X_i)=1 bit, H_P(Ymid X_1,X_2)=0. Let Q make X_1,X_2,Y mutually independent fair bits. Then Q_(X_i,Y)=P_(X_i,Y) (i=1,2), but H_Q(Ymid X_1,X_2)=1 bit. Therefore Δ_joint^log=1 bit, k_0=2, Δ_tr(Q)=1 bit. This proves predictive relational structure relative to the declared variables. It does not, by itself, prove that any workspace variable is cau…
Exact mathematical passage
X_1,X_2\overset{\mathrm{iid}}{\sim}\operatorname{Bernoulli}(1/2), \qquad Y=X_1\oplus X_2.
X_2Use in source · 13 passages
Search aliases: X_2
Use in source · 07-relational-irreducibility.tex, line 377
[XOR witness pair] Under the intact law P, let X_1,X_2oversetiid∼Bernoulli(1/2), Y=X_1⊕ X_2. Then each (X_i,Y) pair is independent and uniform, so H_P(Ymid X_i)=1 bit, H_P(Ymid X_1,X_2)=0. Let Q make X_1,X_2,Y mutually independent fair bits. Then Q_(X_i,Y)=P_(X_i,Y) (i=1,2), but H_Q(Ymid X_1,X_2)=1 bit. Therefore Δ_joint^log=1 bit, k_0=2, Δ_tr(Q)=1 bit. This proves predictive relational structure relative to the declared variables. It does not, by itself, prove that any workspace variable is cau…
Exact mathematical passage
X_1,X_2\overset{\mathrm{iid}}{\sim}\operatorname{Bernoulli}(1/2), \qquad Y=X_1\oplus X_2.
\mathfrak X_aUse in source · 3 passages
Search aliases: X_a mathfrak
Use in source · 04-approximate-workspaces.tex, line 560
Define the vertex and edge direct-sum representations ρ_V(a)=⊕_i∈ Vρ_i(a), ρ_E(a)=⊕_e∈ Eρ_t(e)(a). Lift the edgewise intertwining defects to ( X_a c)_e = sqrtw_e Ξ_e(a)c_s(e). Then the exact commutator identity is D_Hρ_V(a)-ρ_E(a)D_H=- X_a. Furthermore, X_a ≤ β(a), β(a)^2 = max_i∈ V ∑_e:s(e)=iw_e Ξ_e(a) ^2.
Exact mathematical passage
(\mathfrak X_a c)_e = \sqrt{w_e}\,\Xi_e(a)c_{s(e)}.
X_{\bar S}Use in source · 4 passages
Search aliases: X_bar S bar
Use in source · 15-boundary-formation-and-stability.tex, line 47
For S∈ S, define Ret_τ(S) = I ( X_S(t+τ);X_S(t) mid X_bar S(t),E_t ), Dep_τ(S) = I ( X_S(t+τ);X_bar S(t) mid X_S(t),E_t ), Out_τ(S) = I ( X_bar S(t+τ);X_S(t) mid X_bar S(t),E_t ). These quantities are observational. They can be nonzero because of common causes, selection, or feedback paths and therefore cannot alone establish a causal boundary.
Exact mathematical passage
\Ret_\tau(S) = I\!\left( X_S(t+\tau);X_S(t) \mid X_{\bar S}(t),E_t \right),
X_CUse in source · 1 passage
Search aliases: X_C
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 367
Let q,p,f now be independent uniform bits and define the downstream acceptance decision Y=q⊕ p⊕ f. The interpretation is abstract: acceptance depends on the statement, the state of the proof obligations, and the current falsification record. No individual node has sufficient information: H(Ymid X_P) = H(Ymid X_C) = H(Ymid X_N) =1. Every two-node coalition has all three bits and therefore zero conditional entropy. Hence Δ_joint^log=1 bit, k_0=2. Let Q_HH preserve the independent uniform local bit…
Exact mathematical passage
H(Y\mid X_P) = H(Y\mid X_C) = H(Y\mid X_N) =1.
X_jUse in source · 1 passage
Search aliases: X_j
Use in source · 23-relation-to-prior-work.tex, line 285
Network consensus studies how local interactions drive distributed states toward agreement [source reference]. Agreement is not the same as a workspace. Consensus often removes heterogeneity by converging all nodes to a common value. Stratified relational workspaces preserve heterogeneous local representations and may require complementary disagreement: X_inot≅ X_j, E_i c≠ E_j c, (c_i)_i∈Γ(H). The global state is compatible, not necessarily copied. This distinction is central to the anti-replica…
Exact mathematical passage
X_i\not\cong X_j, \qquad E_i c\neq E_j c, \qquad (c_i)_i\in\Gamma(H).
X_MUse in source · 2 passages
Search aliases: X_M
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 803
h_t=workspace-health bit, · h_t=1 means intact. The local accessible states are X_P(t)=(g_t,b_t), X_M(t)=(b_t,h_t), X_R(t)=(g_t,h_t). This is the three-node distributed code from Topic~77. Consequently: dimΓ=3, spec(L)={0,0,0,2,2,2}, k_rec=2, d_er=2. The organization is fully scaffolded. No endogenous-formation claim is made.
Exact mathematical passage
X_P(t)=(g_t,b_t), \qquad X_M(t)=(b_t,h_t), \qquad X_R(t)=(g_t,h_t).
X_mUse in source · 1 passage
Search aliases: X_m
Use in source · 23-relation-to-prior-work.tex, line 450
Partial-information decomposition distinguishes redundant, unique, and synergistic information in multivariate systems, building on standard information-theoretic quantities [source reference]. The XOR examples in Part~XXII are canonical synergy constructions and are not new. They are used because they provide exact ground truth for relational irreducibility: I(Y;X_i)=0 for every i, I(Y;X_1,…,X_m)>0. The matched-predictive-null test is more restrictive than merely reporting synergy. It asks whet…
Exact mathematical passage
I(Y;X_i)=0 \quad\text{for every }i, \qquad I(Y;X_1,\ldots,X_m)>0.
X_NUse in source · 1 passage
Search aliases: X_N
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 367
Let q,p,f now be independent uniform bits and define the downstream acceptance decision Y=q⊕ p⊕ f. The interpretation is abstract: acceptance depends on the statement, the state of the proof obligations, and the current falsification record. No individual node has sufficient information: H(Ymid X_P) = H(Ymid X_C) = H(Ymid X_N) =1. Every two-node coalition has all three bits and therefore zero conditional entropy. Hence Δ_joint^log=1 bit, k_0=2. Let Q_HH preserve the independent uniform local bit…
Exact mathematical passage
H(Y\mid X_P) = H(Y\mid X_C) = H(Y\mid X_N) =1.
X_oUse in source · 1 passage
Search aliases: X_o
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 1083
Suppose node o contains the complete predictive state Z_t, while every other node receives only messages generated by o. The full system can have excellent performance, rich communication, and recurrent activity. Yet Y_t^+indep H_tmid X_o(t), k_0=1, Δ_joint=0. Removing the decorative nodes may change latency or style without changing the operative capacity. Multi-agent appearance therefore does not imply a relational workspace.
Exact mathematical passage
Y_t^+\indep\mathbf H_t\mid X_o(t), \qquad k_0=1, \qquad \Delta_{\mathrm{joint}}=0.
X_PUse in source · 2 passages
Search aliases: X_P
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 367
Let q,p,f now be independent uniform bits and define the downstream acceptance decision Y=q⊕ p⊕ f. The interpretation is abstract: acceptance depends on the statement, the state of the proof obligations, and the current falsification record. No individual node has sufficient information: H(Ymid X_P) = H(Ymid X_C) = H(Ymid X_N) =1. Every two-node coalition has all three bits and therefore zero conditional entropy. Hence Δ_joint^log=1 bit, k_0=2. Let Q_HH preserve the independent uniform local bit…
Exact mathematical passage
H(Y\mid X_P) = H(Y\mid X_C) = H(Y\mid X_N) =1.
X_RUse in source · 2 passages
Search aliases: X_R
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 803
h_t=workspace-health bit, · h_t=1 means intact. The local accessible states are X_P(t)=(g_t,b_t), X_M(t)=(b_t,h_t), X_R(t)=(g_t,h_t). This is the three-node distributed code from Topic~77. Consequently: dimΓ=3, spec(L)={0,0,0,2,2,2}, k_rec=2, d_er=2. The organization is fully scaffolded. No endogenous-formation claim is made.
Exact mathematical passage
X_P(t)=(g_t,b_t), \qquad X_M(t)=(b_t,h_t), \qquad X_R(t)=(g_t,h_t).
X_rUse in source · 2 passages
Search aliases: X_r
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 512
[Deterministic empirical recovery bound] For samples (X_r,Y_r)_r=1^n, write widehatΣ_XX = frac1n∑_r=1^nX_rX_r^ T, widehat M = frac1n∑_r=1^nξ_rX_r^ T. If widehatΣ_XXsucceqwidehatκ I, then ordinary least squares satisfies widehat H-H_* _F ≤ frac widehat M _Fwidehatκ. For ridge parameter τ>0, widehat H_τ-H_* _F ≤ frac widehat M _F+τ H_* _F widehatκ+τ .
Exact mathematical passage
(X_r,Y_r)_{r=1}^n
x_rUse in source · 2 passages
Search aliases: x_r
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1098
Let x_r and widetilde x_r be the exact and implemented states after r levels. Then widetilde x_r+1-x_r+1 · ≤ widetilde F_r(widetilde x_r)-F_r(widetilde x_r)
Exact mathematical passage
x_r
x_{r'}^{\mathrm{init}}Use in source · 2 passages
Search aliases: x_r'^init mathrm
Use in source · 11-reconstruction-and-resilience.tex, line 352
[Handoff initialization] If α_S>0 and the survivors observe y=A_Sc+η, initialize the replacement by x_r'^init =E_r''A_S^† y. Then x_r'^init-E_r''c ≤ frac E_r'' η sqrtα_S.
Exact mathematical passage
x_{r'}^{\mathrm{init}} =E_{r'}'A_S^\dagger y.
x_{r+1}Use in source · 1 passage
Search aliases: x_r+1
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1100
Let x_r and widetilde x_r be the exact and implemented states after r levels. Then widetilde x_r+1-x_r+1 · ≤ widetilde F_r(widetilde x_r)-F_r(widetilde x_r) · + F_r(widetilde x_r)-F_r(x_r) · ≤ δ_r+L_r widetilde x_r-x_r . Iterating this recurrence gives the displayed product-sum estimate. The final two bounds follow by summing a finite or infinite geometric series.
Exact mathematical passage
\begin{aligned} \|\widetilde x_{r+1}-x_{r+1}\| &\leq \|\widetilde F_r(\widetilde x_r)-F_r(\widetilde x_r)\|\\ &\quad+ \|F_r(\widetilde x_r)-F_r(x_r)\|\\ &\leq \delta_r+L_r\|\widetilde x_r-x_r\|. \end{aligned}
X_r^{\mathsf T}Use in source · 1 passage
Search aliases: X_r^ T mathsf
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 513
[Deterministic empirical recovery bound] For samples (X_r,Y_r)_r=1^n, write widehatΣ_XX = frac1n∑_r=1^nX_rX_r^ T, widehat M = frac1n∑_r=1^nξ_rX_r^ T. If widehatΣ_XXsucceqwidehatκ I, then ordinary least squares satisfies widehat H-H_* _F ≤ frac widehat M _Fwidehatκ. For ridge parameter τ>0, widehat H_τ-H_* _F ≤ frac widehat M _F+τ H_* _F widehatκ+τ .
Exact mathematical passage
\widehat\Sigma_{XX} = \frac1n\sum_{r=1}^nX_rX_r^{\mathsf T}, \qquad \widehat M = \frac1n\sum_{r=1}^n\xi_rX_r^{\mathsf T}.
X_SUse in source · 5 passages
Search aliases: X_S
Use in source · 15-boundary-formation-and-stability.tex, line 47
For S∈ S, define Ret_τ(S) = I ( X_S(t+τ);X_S(t) mid X_bar S(t),E_t ), Dep_τ(S) = I ( X_S(t+τ);X_bar S(t) mid X_S(t),E_t ), Out_τ(S) = I ( X_bar S(t+τ);X_S(t) mid X_bar S(t),E_t ). These quantities are observational. They can be nonzero because of common causes, selection, or feedback paths and therefore cannot alone establish a causal boundary.
Exact mathematical passage
\Ret_\tau(S) = I\!\left( X_S(t+\tau);X_S(t) \mid X_{\bar S}(t),E_t \right),
X_{s(e)}Use in source · 3 passages
Search aliases: X_s(e)
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
x_tUse in source · 6 passages
Search aliases: x_t
Use in source · 10-persistence.tex, line 131
Let the realized vertex state satisfy x_t+1=F_tx_t+ξ_t, where F_t: C_V(t)→ C_V(t+1) is the actual update and ξ_t is an unmodeled disturbance. Define the off-workspace error e_t= (I-P_t)x_t . Introduce α_t = (I-P_t+1)F_t(I-P_t) , which measures persistence of prior off-workspace error, and ℓ_t = (I-P_t+1)F_tP_t , which measures leakage of a valid workspace state under the update.
Exact mathematical passage
x_{t+1}=F_tx_t+\xi_t,
X_{t(e)}Use in source · 2 passages
Search aliases: X_t(e)
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
x_{t+1}Use in source · 1 passage
Search aliases: x_t+1
Use in source · 10-persistence.tex, line 131
Let the realized vertex state satisfy x_t+1=F_tx_t+ξ_t, where F_t: C_V(t)→ C_V(t+1) is the actual update and ξ_t is an unmodeled disturbance. Define the off-workspace error e_t= (I-P_t)x_t . Introduce α_t = (I-P_t+1)F_t(I-P_t) , which measures persistence of prior off-workspace error, and ℓ_t = (I-P_t+1)F_tP_t , which measures leakage of a valid workspace state under the update.
Exact mathematical passage
x_{t+1}=F_tx_t+\xi_t,
X_uUse in source · 1 passage
Search aliases: X_u
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 427
A learned transfer map is not absolutely identifiable when local coordinates are latent. Under local invertible changes X_u'=g_uX_u, X_v'=g_vX_v, the same abstract transfer is represented by H_uv'=g_vH_uvg_u^-1. The identifiable object is therefore the gauge class [H]_ G = { (g_t(e)H_eg_s(e)^-1)_e∈ E : (g_i)_i∈ V∈ G }. Any formation claim that compares raw matrices across independently trained systems without gauge alignment is ill posed.
Exact mathematical passage
X_u'=g_uX_u, \qquad X_v'=g_vX_v,
X_u'Use in source · 1 passage
Search aliases: X_u'
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 427
A learned transfer map is not absolutely identifiable when local coordinates are latent. Under local invertible changes X_u'=g_uX_u, X_v'=g_vX_v, the same abstract transfer is represented by H_uv'=g_vH_uvg_u^-1. The identifiable object is therefore the gauge class [H]_ G = { (g_t(e)H_eg_s(e)^-1)_e∈ E : (g_i)_i∈ V∈ G }. Any formation claim that compares raw matrices across independently trained systems without gauge alignment is ill posed.
Exact mathematical passage
X_u'=g_uX_u, \qquad X_v'=g_vX_v,
X_vUse in source · 1 passage
Search aliases: X_v
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 427
A learned transfer map is not absolutely identifiable when local coordinates are latent. Under local invertible changes X_u'=g_uX_u, X_v'=g_vX_v, the same abstract transfer is represented by H_uv'=g_vH_uvg_u^-1. The identifiable object is therefore the gauge class [H]_ G = { (g_t(e)H_eg_s(e)^-1)_e∈ E : (g_i)_i∈ V∈ G }. Any formation claim that compares raw matrices across independently trained systems without gauge alignment is ill posed.
Exact mathematical passage
X_u'=g_uX_u, \qquad X_v'=g_vX_v,
X_v'Use in source · 1 passage
Search aliases: X_v'
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 427
A learned transfer map is not absolutely identifiable when local coordinates are latent. Under local invertible changes X_u'=g_uX_u, X_v'=g_vX_v, the same abstract transfer is represented by H_uv'=g_vH_uvg_u^-1. The identifiable object is therefore the gauge class [H]_ G = { (g_t(e)H_eg_s(e)^-1)_e∈ E : (g_i)_i∈ V∈ G }. Any formation claim that compares raw matrices across independently trained systems without gauge alignment is ill posed.
Exact mathematical passage
X_u'=g_uX_u, \qquad X_v'=g_vX_v,
\xleftarrowUse in source · 1 passage
Search aliases: xleftarrow
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 113
For pairwise overlaps write mathscr W_α=mathscr W(G_α), mathscr W_αβ=mathscr W(G_αβ), and r_αβ^α: mathscr W_α→mathscr W_αβ, r_αβ^β: mathscr W_β→mathscr W_αβ. The interface is therefore a cospan mathscr W_α xrightarrow r_αβ^α mathscr W_αβ xleftarrow r_αβ^β mathscr W_β, not necessarily a direct transfer map from one complete local workspace to the other. Both charts are compared through the content they expose on their common domain.
Exact mathematical passage
\mathscr W_\alpha \xrightarrow{\ r_{\alpha\beta}^{\alpha}\ } \mathscr W_{\alpha\beta} \xleftarrow{\ r_{\alpha\beta}^{\beta}\ } \mathscr W_\beta,
Y'Use in source · 3 passages
Search aliases: Y'
Use in source · 12-identity-through-time-and-replacement.tex, line 321
Take two realizations with identical G, D, L, P, ρ. In the first, let Y=W. In the second, let Y'=1-W for a binary workspace coordinate. Then q_str=0, δ_ρ(a)=0 for every operation, while the observational and interventional outcome kernels differ maximally under the identity correspondence. Therefore no purely structural theorem can prove causal identity without an additional kernel-matching assumption.
Exact mathematical passage
Y'=1-W
\mathcal Y^+Use in source · 3 passages
Search aliases: Y^+ mathcal
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 24
A controlled relational realization extends Definition~[source reference] by the tuple A_Workspace = ( R, G, A_t, Y^+, {U_g}_g∈ G, Π, I_A, I_G, I_D, I_R ). Here: item R is the underlying relational realization; item G is a measurable goal-code space; item A_t is the feasible action set at time t; item Y^+ is the relevant future trajectory space; item U_g: Y^+→ R evaluates a trajectory under goal code g; item Π is an admissible class of workspace-level policies; item I_A and I_G are feasible acti…
Exact mathematical passage
\boxed{ \mathfrak A_{\Workspace} = \left( \mathfrak R, \mathcal G, \mathcal A_t, \mathcal Y^+, \{U_g\}_{g\in\mathcal G}, \Pi, \mathcal I_A, \mathcal I_G, \mathcal I_D, \mathcal I_R \right). }
Y^{+'}Use in source · 1 passage
Search aliases: Y^+'
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
Y_{\mathrm{bench}}Use in source · 1 passage
Search aliases: Y_bench mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 1128
Let two realizations have identical benchmark output distributions, P(Y_bench)=P'(Y_bench), but different intervention kernels: K(w,b)≠ K'(β w,b) for some matched workspace intervention. Then task behavior is preserved while d_causal(W,W')>0. The later system may be a successor or replacement rather than the same workspace under the identity criterion of Part~XII.
Exact mathematical passage
P(Y_{\mathrm{bench}})=P'(Y_{\mathrm{bench}}),
\mathsf Y_iUse in source · 6 passages
Search aliases: Y_i mathsf
Use in source · 11-reconstruction-and-resilience.tex, line 21
Let C_* be a finite-dimensional abstract core. The exact static theory provides a complete local chart overline E_i = ev_i∘Ψ:C_*⟶ C_i, where Ψ:C_*→Γ(H) is the root-to-section isomorphism. A participant or artifact need not expose that complete chart. Let O_i:C_i⟶ Y_i be the declared observation or access map and define the accessible encoding E_i=O_ioverline E_i:C_*⟶ Y_i. For notational economy, the direct sums below use the accessible spaces Y_i. Thus injectivity of a full structural chart does…
Exact mathematical passage
O_i:C_i\longrightarrow\mathsf Y_i
Y_rUse in source · 1 passage
Search aliases: Y_r
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 512
[Deterministic empirical recovery bound] For samples (X_r,Y_r)_r=1^n, write widehatΣ_XX = frac1n∑_r=1^nX_rX_r^ T, widehat M = frac1n∑_r=1^nξ_rX_r^ T. If widehatΣ_XXsucceqwidehatκ I, then ordinary least squares satisfies widehat H-H_* _F ≤ frac widehat M _Fwidehatκ. For ridge parameter τ>0, widehat H_τ-H_* _F ≤ frac widehat M _F+τ H_* _F widehatκ+τ .
Exact mathematical passage
(X_r,Y_r)_{r=1}^n
\mathsf Y_{r'}'Use in source · 1 passage
Search aliases: Y_r'' mathsf
Use in source · 11-reconstruction-and-resilience.tex, line 345
Suppose node r is removed and the surviving coalition is S=V∖{r}. A replacement node r' is to receive the encoding E_r'':C_*→ Y_r''.
Exact mathematical passage
E_{r'}':C_*\to\mathsf Y_{r'}'.
\mathsf Y_SUse in source · 1 passage
Search aliases: Y_S mathsf
Use in source · 12-identity-through-time-and-replacement.tex, line 487
[Preservation of coalition frame bounds] Identify the old and new abstract cores with ran P and ran P' through their chosen core parameterizations. Let S be a declared coalition, let A_S:ran P→ Y_S, A_S':ran P'→ Y_S' be the resulting accessible coalition encoders, and let K_S be a unitary identification of their observation spaces. Suppose A_S'β-K_SA_S ≤ δ_S^frame < sqrtα_S. Then the replacement coalition remains reconstructive and its new lower frame bound satisfies α_S' ≥ ( sqrtα_S-δ_S^frame )…
Exact mathematical passage
A_S:\ran P\to\mathsf Y_S, \qquad A_S':\ran P'\to\mathsf Y_S'
y_SUse in source · 1 passage
Search aliases: y_S
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 335
The full frame operator is F_PCN=E_P^*E_P+E_C^*E_C+E_N^*E_N=2I_3. For every two-node coalition S, λ_min(F_S)=1. Thus every two-node coalition reconstructs the complete core and, for noisy observations y_S=A_Sc+η_S, widehat c-c ≤ η_S . No individual node reconstructs c, because rank(E_P) = rank(E_C) = rank(E_N) =2<3. The realization is therefore simultaneously: individually incomplete and robust to any one-node loss.
Exact mathematical passage
y_S=A_Sc+\eta_S
\mathsf Y_S'Use in source · 1 passage
Search aliases: Y_S' mathsf
Use in source · 12-identity-through-time-and-replacement.tex, line 487
[Preservation of coalition frame bounds] Identify the old and new abstract cores with ran P and ran P' through their chosen core parameterizations. Let S be a declared coalition, let A_S:ran P→ Y_S, A_S':ran P'→ Y_S' be the resulting accessible coalition encoders, and let K_S be a unitary identification of their observation spaces. Suppose A_S'β-K_SA_S ≤ δ_S^frame < sqrtα_S. Then the replacement coalition remains reconstructive and its new lower frame bound satisfies α_S' ≥ ( sqrtα_S-δ_S^frame )…
Exact mathematical passage
A_S:\ran P\to\mathsf Y_S, \qquad A_S':\ran P'\to\mathsf Y_S'
y_{V\setminus A}Use in source · 1 passage
Search aliases: y_V∖ A setminus
Use in source · 11-reconstruction-and-resilience.tex, line 258
[Uniform erasure resilience] The encoding family is exactly reconstructible after every loss of at most k nodes if and only if α^(k)>0. If surviving observations have the form y_V∖ A=A_V∖ Ac+η_A, |A|≤ k, then the canonical survivor decoder obeys the uniform estimate widehat c_A-c ≤ frac η_A sqrtα^(k).
Exact mathematical passage
y_{V\setminus A}=A_{V\setminus A}c+\eta_A, \qquad |A|\leq k,
\mathbb ZUse in source · 1 passage
Search aliases: Z mathbb
Use in source · 03-exact-shared-cores.tex, line 322
sinθ · cosθ with θ∉2π Z. Then ker(R_θ-I)={0}. Every edge map is individually invertible and well-defined, yet the complete cycle admits no nonzero exact shared core. Pairwise translatability is therefore insufficient for global path independence.
Exact mathematical passage
\theta\notin2\pi\mathbb Z
zUse in source · 9 passages
Search aliases: z
Use in source · frontmatter.tex, line 9
[0.18em] Workspace Theory Large A Core--Transfer Framework for Distributed Cognition, Collaboration, and Epistemic Systems large Komorebi P. largebfseries Foundations, Dynamics, Agency, and Empirical Certification vfill colorRuleColorrule0.70textwidth0.8pt small August 2026 pagenumberingroman Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, estab…
Exact mathematical passage
0.18em] Workspace Theory\par} \vspace{0.55in} {\Large A Core--Transfer Framework for Distributed Cognition,\\ Collaboration, and Epistemic Systems\par} \vspace{0.8in} {\large Komorebi P.\par} \vspace{0.65in} {\large\bfseries Foundations, Dynamics, Agency, and Empirical Certification\par} \vfill {\color{RuleColor}\rule{0.70\textwidth}{0.8pt}\par} \vspace{0.25in} {\small August 2026\par} \end{titlepage} \clearpage \pagenumbering{roman} \begin{abstract} Collaborative reasoning increasingly spans people, computational models, documents, software, instruments, and persistent records. Yet the existence of many interacting components does not, by itself, establish a shared workspace, and successful group performance does not show that the operative state is genuinely distributed rather than copied, centralized, or merely correlated. Stratified Relational Workspace Theory develops a formal answer to this problem. A realization is represented by heterogeneous local state spaces connected by transfer maps. Its exact shared core is the space of global compatible sections, equivalently the fixed subspace of relational holonomy when the transfers are invertible. A transfer Laplacian identifies approximate shared directions and provides spectral stability, gauge covariance, and pathwise leakage bounds. The structural theory is joined to a dynamic and causal account. Canonical predictive states determine whether a proposed workspace retains the conditional law relevant to a declared future task. Feasible interventions, coalition risk, matched relational nulls, and reconstruction tests distinguish causally operative distributed organization from archives, replicated memory, and centralized controllers. Further results address persistence under changing realizations, stable reconstruction after component loss, identity under replacement, local-to-global gluing, hierarchical composition, learned transfer structure, boundary recovery, goal-conditioned action, and certificate-directed repair. Because distributedness can be destroyed by merging components or manufactured by splitting a centralized state into complementary shares, the theory also treats decomposition as part of the claim. Faithful coarse-graining preserves exact structural cores, while family-robust certification requires every gate to retain a positive margin across a declared set of admissible decompositions. The same discipline is applied to the complete scientific specification. Targets, losses, horizons, interventions, nulls, and thresholds are made explicit, and the theory develops specification envelopes, transport radii, experimental-equivalence classes, partial-identification bounds, and uniform finite-sample certification. A certificate is therefore distinguished from a favorable analysis: it may be pointwise valid, specification-robust, sign-identified, or statistically unresolved. The resulting rule is noncompensatory. Structural coherence, predictive alignment, causal efficacy, relational irreducibility, non-collapse, reconstructive continuity, provenance, and self-maintenance are separate claims, and failure of one cannot be hidden by success on another. Exact finite examples show how the same framework applies to human collaboration, human--AI research loops, and multi-agent control. A review of adjacent work locates the individual mathematical ingredients in established traditions including distributed cognition, local systems and sheaves, spectral perturbation, sufficient statistics, structural causal models, frame reconstruction, system identification, and feedback control. The candidate contribution is therefore not a new name for any one of these constructions. It is their integration into a single falsifiable account of persistent relational workspaces and the matched near misses that such an account must reject. The framework does not infer phenomenal consciousness, personhood, or moral status from coherence, agency, or self-maintenance. \end{abstract} \tableofcontents \clearpage \pagenumbering{arabic} \section*{Introduction} \addcontentsline{toc}{section}{Introduction} Scientific and technical work rarely resides in a single mind or device. A proof may be divided among a conjecture, a critic's counterexample, a notebook, a computer algebra system, and a verification script. A human--AI research process may distribute objectives, formal manipulations, execution, and persistent memory across different components. Multi-agent systems divide sensing, planning, communication, and repair in still other ways. In each case, it is natural to speak of a shared workspace. The phrase is useful, but without a formal criterion it can conceal several fundamentally different organizations. A common archive is not necessarily a workspace. Nor is a group whose apparent coordination is produced by one complete controller surrounded by decorative channels. Two systems can contain the same local information while differing in how that information is related, transported, and used. Likewise, a system can perform well without preserving its operative organization through interruption, replacement, or component loss. The central problem is therefore not simply whether information is shared. It is whether there is a persistent relational state whose structure and causal capacities cannot be reduced to any single declared component. The philosophical background is supplied by extended and distributed cognition, transactive memory, collective intelligence, and theories of group agency \cite{Hutchins1995,ClarkChalmers1998,Wegner1987,ListPettit2011}. Those traditions motivate the possibility that cognitive organization may span people and artifacts. The theory asks a narrower mathematical question: what would have to be measured and proved before such an organization should be called a relational workspace? The answer must distinguish physical realization from abstract identity, local representation from globally compatible content, and statistical association from causal operation. The static theory begins with an interaction graph whose vertices carry heterogeneous local state spaces and whose edges carry transfer maps. Each local state is decomposed into a transferable core and a substrate-specific residual. Exact shared content is represented by global compatible sections. When core transfers are invertible, the same object appears as the fixed subspace of the holonomy representation. Approximate shared content is extracted as a low-energy spectral subspace of a transfer Laplacian. This formulation supplies explicit obstruction, stability, gauge, and leakage calculations rather than relying on an informal appeal to shared context. Structure alone is insufficient. A proposed workspace must also retain the predictive state relevant to a declared future, respond under feasible intervention, outperform matched relational nulls, and resist reduction to an individual node or a local-storage surrogate. Persistence introduces further requirements: the workspace must remain trackable as its realization changes, preserve nontrivial content, support reconstruction after loss, and maintain an identity profile under admissible replacement. Local workspaces must glue without hidden incompatibility, and hierarchical organization must not conceal centralization. Formation claims are evaluated separately from operational claims so that a scaffolded but functional workspace is not dismissed, while an endogenously learned but causally irrelevant pattern is not promoted. A separate decomposition analysis asks which claims survive faithful coarse-graining and plausible alternative interface descriptions. This is necessary because arbitrary merging can conceal relationality, while arbitrary splitting can manufacture it. The analysis is then extended from decomposition to the full scientific specification. A workspace claim depends on its declared target, loss, horizon, intervention family, null panel, and thresholds. The theory therefore distinguishes pointwise validity from robustness across defensible specifications and distinguishes both from identifiability under the experiments that are actually available. This prevents a favorable target or threshold from being mistaken for a general result and prevents an observationally indistinguishable hidden controller from being ruled out by assertion. The theory extends to domain-relative agency only after these lower-level conditions are in place. Goals must persist without repeated external rewriting, counterfactual values must guide feasible actions, damage must be detected through the workspace, and repairs must improve a matched no-repair trajectory while preserving identity. These criteria define an engineering notion of workspace agency. They neither assert nor deny phenomenal consciousness. Consciousness, personhood, and moral status remain separate questions that require independent evidence. Most of the mathematical tools used here are established. Inverse limits, holonomy, connection Laplacians, perturbation theory, sufficient statistics, causal models, frame reconstruction, system identification, and feedback control all have substantial prior literatures. The contribution sought here is integrative: a noncompensatory framework that places these tools in one common architecture and specifies the near-miss systems that each layer must reject. Exact examples provide calibration, while the motivating human--AI collaboration is treated conservatively as a candidate case rather than as a certified instance. The paper proceeds from exact structure to approximate structure, dynamic operation, relational irreducibility, persistence, reconstruction, identity, gluing, formation, boundary discovery, agency, decomposition robustness, specification robustness, identifiability, and empirical certification. It then gives worked cases, situates the framework relative to adjacent work, and closes with its philosophical consequences, limitations, and open problems. \section*{Notation and Conventions} \addcontentsline{toc}{section}{Notation and Conventions} A concrete realization is denoted by \(\mathfrak R\). Its interaction graph is \(G=(V,E,s,t)\), with local state spaces \(X_i\) at vertices and transfer maps \(T_e:X_{s(e)}\to X_{t(e)}\) on directed edges. When a core--residual decomposition is used, \(X_i=C_i\oplus R_i\), and \(H_e\) denotes the induced core transfer. The exact structural workspace is the compatible-section space \(\Gamma(H)\); the transfer discrepancy is \(D_H\), the transfer Laplacian is \(L_H=D_H^*D_H\), and \(\Gamma_\varepsilon(H)\) denotes a selected low-energy workspace subspace. Dynamic workspace states are written \(W_t\), while \(Z_t\) denotes the canonical predictive state associated with a declared future variable \(Y_t^+\). Unless stated otherwise, the structural results use finite-dimensional real or complex Hilbert spaces and finite graphs. Probabilistic statements are made on standard Borel spaces when regular conditional laws are required. All approximate conclusions are indexed by explicit tolerances, spectral gaps, intervention families, loss functions, or null classes. A claim of relational irreducibility is always relative to a declared decomposition of the realization into components. The symbol \(\mathcal D\) denotes one such decomposition, and \(\mathfrak D\) denotes an admissible family used for robustness analysis. The complete scientific specification is \[ \varsigma=(\mathcal D,Y^+,\ell,\tau,\mathcal I,\mathcal N,\Theta),
z_eUse in source · 2 passages
Search aliases: z_e
Use in source · 04-approximate-workspaces.tex, line 57
For z=(z_e)_e∈ E∈ C_E, the adjoint is (D_H^*z)_i = ∑_e:t(e)=isqrtw_e z_e - ∑_e:s(e)=isqrtw_e H_e^*z_e. Consequently, (L_Hc)_i = · ∑_e:t(e)=iw_e(c_i-H_ec_s(e))
Exact mathematical passage
z=(z_e)_{e\in E}\in\mathcal C_E
z_iUse in source · 1 passage
Search aliases: z_i
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 374
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1
Exact mathematical passage
z_i\in\{0,1\}, \qquad a_e\in[0,1]
Z_{i,q,\varsigma}Use in source · 1 passage
Search aliases: Z_i,q,ς varsigma
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 797
Suppose S and J_* are finite, and each margin is estimated as widehat m_q(ς) = frac1n∑_i=1^nZ_i,q,ς-θ_q,ς, 0≤ Z_i,q,ς≤1, from independent certification units. Hoeffding's inequality and a union bound give P( sup_q,ς | widehat m_q(ς)-m_q(ς) | > sqrt frac log(2| J_*|| S|/δ) 2n ) ≤δ. Thus the choice ε_n(δ) = sqrt frac log(2| J_*|| S|/δ) 2n yields an explicit conservative certificate. Dependent episodes require a bound appropriate to the true independent unit rather than token-level or edge-level ps…
Exact mathematical passage
\widehat m_q(\varsigma) = \frac1n\sum_{i=1}^nZ_{i,q,\varsigma}-\theta_{q,\varsigma}, \qquad 0\leq Z_{i,q,\varsigma}\leq1,
z_{s(e)}Use in source · 1 passage
Search aliases: z_s(e)
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 380
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1
Exact mathematical passage
a_e\leq z_{s(e)}, \qquad a_e\leq z_{t(e)}.
z_{t(e)}Use in source · 1 passage
Search aliases: z_t(e)
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 380
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1
Exact mathematical passage
a_e\leq z_{s(e)}, \qquad a_e\leq z_{t(e)}.
|_{\mathcal W_t}Use in source · 1 passage
Search aliases: |_ W_t mathcal
Use in source · 10-persistence.tex, line 329
Low off-workspace error is not sufficient for meaningful persistence. The zero update F_t=0 drives every state exactly into every linear workspace while destroying all content. Define the internal transport B_t=P_t+1F_tP_t: W_t⟶ W_t+1 and its non-collapse margin μ_t^keep = σ_min(B_t|_ W_t). A content-preserving persistence claim requires μ_t^keep>0 for the relevant interval, or an information-theoretic replacement when the workspace state is stochastic. Structural tracking, state tracking, and c…
Exact mathematical passage
\boxed{ \mu_t^{\mathrm{keep}} = \sigma_{\min}(B_t|_{\mathcal W_t}). }
|_GUse in source · 1 passage
Search aliases: |_G
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 24
Let G=(V,E) be a finite directed interaction graph with local core spaces C_i, core transfers H_e, vertex space C_V(G), discrepancy operator D_G, and exact workspace mathscr W(G) := Γ(H|_G) = ker D_G.
Exact mathematical passage
\mathscr W(G) := \Gamma(H|_G) = \ker D_G.
|_{G_\alpha}Use in source · 4 passages
Search aliases: |_G_α alpha
Use in source · 02-static-core-transfer-theory.tex, line 93
Unless stated otherwise, connectedness means that |G| is connected. A root o∈ V may then be joined to every vertex by a path in the underlying graph. If G has several connected components, the theory applies to each component and Γ(H) ≅ ⊕_αΓ(H|_G_α).
Exact mathematical passage
\Gamma(H) \cong \bigoplus_{\alpha}\Gamma(H|_{G_\alpha}).
|_{\mathscr W(L)}Use in source · 1 passage
Search aliases: |_mathscr W(L) mathscr
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 70
If K⊆ L⊆ G are subgraphs, coordinate restriction gives ρ_K^L: C_V(L)⟶ C_V(K). Because every edge equation on K is also an edge equation on L, restriction maps exact sections to exact sections: r_K^L := ρ_K^L|_mathscr W(L): mathscr W(L)⟶mathscr W(K). They obey r_L^L=I, r_J^K r_K^L=r_J^L whenever J⊆ K⊆ L. Thus K↦mathscr W(K) is a contravariant system of local workspaces.
Exact mathematical passage
r_K^L := \rho_K^L|_{\mathscr W(L)}: \mathscr W(L)\longrightarrow\mathscr W(K).
|_{\ran P}Use in source · 1 passage
Search aliases: |_ran P ran
Use in source · 04-approximate-workspaces.tex, line 414
On ran P and ranwidetilde Q, set A_P=PAP|_ran P, B_Q=widetilde QBwidetilde Q|_ranwidetilde Q. The operator X=Pwidetilde Q satisfies the Sylvester equation A_PX-XB_Q=-PEwidetilde Q. Let μ=(a+b)/2. Since e^t(A_P-μ I) ≤ e^-(b-a)t/2, e^-t(B_Q-μ I) ≤ e^-(b-a)t/2, the inverse Sylvester operator has the convergent integral representation X = ∫_0^∞ e^t(A_P-μ I) (PEwidetilde Q) e^-t(B_Q-μ I) dd t. Taking norms and integrating gives the result.
Exact mathematical passage
A_P=PAP|_{\ran P}, \qquad B_Q=\widetilde QB\widetilde Q|_{\ran\widetilde Q}.
|_{\ran\widetilde Q}Use in source · 1 passage
Search aliases: |_ranwidetilde Q ran widetilde
Use in source · 04-approximate-workspaces.tex, line 414
On ran P and ranwidetilde Q, set A_P=PAP|_ran P, B_Q=widetilde QBwidetilde Q|_ranwidetilde Q. The operator X=Pwidetilde Q satisfies the Sylvester equation A_PX-XB_Q=-PEwidetilde Q. Let μ=(a+b)/2. Since e^t(A_P-μ I) ≤ e^-(b-a)t/2, e^-t(B_Q-μ I) ≤ e^-(b-a)t/2, the inverse Sylvester operator has the convergent integral representation X = ∫_0^∞ e^t(A_P-μ I) (PEwidetilde Q) e^-t(B_Q-μ I) dd t. Taking norms and integrating gives the result.
Exact mathematical passage
A_P=PAP|_{\ran P}, \qquad B_Q=\widetilde QB\widetilde Q|_{\ran\widetilde Q}.
|_WUse in source · 1 passage
Search aliases: |_W
Use in source · 04-approximate-workspaces.tex, line 274
|c =1 E_H(c). If W is L_H-invariant, then δ_coh(W) = L_H|_W . In particular, δ_coh(Γ_ε(H)) ≤ε.
Exact mathematical passage
\delta_{\mathrm{coh}}(W) = \|L_H|_W\|.
\pmUse in source · 2 passages
Search aliases: ± pm
Use in source · 04-approximate-workspaces.tex, line 364
-(a+b) · b^2+1 . Writing τ=a^2+b^2+2, the eigenvalues are λ_± = frac12 ( τ±sqrtτ^2-4(ab-1)^2 ), and det L_H=(ab-1)^2. Thus a nonzero exact shared core exists precisely when ab=1, which is exactly the trivial-holonomy condition. Away from exact consistency, λ_-λ_+=(ab-1)^2. When |ab-1| is small while λ_+ stays bounded away from zero, the soft workspace eigenvalue is quadratic in the cycle mismatch: λ_- = frac(ab-1)^2λ_+. This example connects approximate spectral coherence directly to approximate…
Exact mathematical passage
\lambda_\pm = \frac{1}{2} \left( \tau\pm\sqrt{\tau^2-4(ab-1)^2} \right),
\alpha^{(1)}Use in source · 1 passage
Search aliases: α^(1) alpha
Use in source · 11-reconstruction-and-resilience.tex, line 426
Let C_*= R^2 and define scalar node encodings E_1(c_1,c_2)=c_1, E_2(c_1,c_2)=c_2, E_3(c_1,c_2)=c_1+c_2. Every singleton has rank one, so no node reconstructs the two-dimensional core. Every pair does reconstruct. For S={1,2}, F_S=I, α_S=1. For S={1,3} or S={2,3}, the frame eigenvalues are frac3±sqrt52. Therefore m_rec=2, k_erase=1, d_er=2, α^(1)=frac3-sqrt52. This realizes a workspace core that is irreducible to any singleton while remaining reconstructible after any one node fails.
Exact mathematical passage
\boxed{ m_{\mathrm{rec}}=2, \qquad k_{\mathrm{erase}}=1, \qquad d_{\mathrm{er}}=2, \qquad \alpha^{(1)}=\frac{3-\sqrt5}{2}. }
\alpha^{(k)}Use in source · 8 passages
Search aliases: α^(k) alpha
Use in source · 11-reconstruction-and-resilience.tex, line 241
For k≥0, define the worst surviving lower frame bound α^(k) = min_substackA⊆ V |A|≤ k α_V∖ A. The sequence α^(k) is nonincreasing in k.
Exact mathematical passage
\boxed{ \alpha^{(k)} = \min_{\substack{A\subseteq V\\|A|\leq k}} \alpha_{V\setminus A}. }
\alpha_1Use in source · 1 passage
Search aliases: α_1 alpha
Use in source · 10-persistence.tex, line 250
Repeated substitution yields e_t · ≤ α_t-1⋯α_0e_0 + α_t-1⋯α_1σ_0 + ⋯ + σ_t-1, which is the first formula. Under the uniform bounds, dominate each product by the corresponding power of barα and sum the geometric series.
Exact mathematical passage
\begin{aligned} e_t &\leq \alpha_{t-1}\cdots\alpha_0e_0 + \alpha_{t-1}\cdots\alpha_1\sigma_0 + \cdots + \sigma_{t-1}, \end{aligned}
\alpha_A^{\mathrm{meta}}Use in source · 1 passage
Search aliases: α_A^meta alpha mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 882
mathscr W_meta( U)≅mathscr W(G) is a compositional statement, not a relational-irreducibility statement. A single chart may still expose enough accessible information to reconstruct the whole meta-state. A claim that the hierarchy is genuinely distributed must therefore reuse the coalition gates from Parts~VII and XI. At the chart level, one may require, for example, α_{α}^meta=0 for every α, α_A^meta>0 for some |A|≥2, or the predictive analogue k_ε^meta≥2, Δ_joint^meta>0. Capacity-matched local…
Exact mathematical passage
\alpha_{\{\alpha\}}^{\mathrm{meta}}=0 \quad\text{for every }\alpha, \qquad \alpha_A^{\mathrm{meta}}>0 \quad\text{for some }|A|\geq2,
\alpha_{j_P}Use in source · 1 passage
Search aliases: α_j_P alpha
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 618
For any P∈ H_0, choose an index j_P such that P∈ H_0j_P. The event that every gate passes is contained in the event that gate j_P passes. Hence P_P(certificate passes) ≤ P_P(G_j_P passes) ≤ α_j_P ≤ max_jα_j. Taking the supremum over P∈ H_0 proves the claim.
Exact mathematical passage
\mathbb P_P(\text{certificate passes}) \leq \mathbb P_P(G_{j_P}\text{ passes}) \leq \alpha_{j_P} \leq \max_j\alpha_j.
\alpha_{p+1}Use in source · 1 passage
Search aliases: α_p+1 alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 138
For p≥0, define the finite cochain space check C^p( U;mathscr W) = ⊕_α_0<⋯<α_p mathscr W(G_α_0⋯α_p), where empty intersections contribute the zero space. The coboundary δ^p:check C^p⟶check C^p+1 is (δ^p s)_α_0⋯α_p+1 = ∑_j=0^p+1(-1)^j r_α_0⋯α_p+1^% α_0⋯widehatα_j⋯α_p+1 % s_α_0⋯widehatα_j⋯α_p+1. The restriction identities imply δ^p+1δ^p=0. For a local family w=(w_α)_α, (δ^0w)_αβ = r_αβ^βw_β - r_αβ^αw_α. Thus δ^0 is the overlap-discrepancy operator at the level of exact local workspaces.
Exact mathematical passage
\boxed{ (\delta^p s)_{\alpha_0\cdots\alpha_{p+1}} = \sum_{j=0}^{p+1}(-1)^j r_{\alpha_0\cdots\alpha_{p+1}}^% {\alpha_0\cdots\widehat{\alpha_j}\cdots\alpha_{p+1}} % s_{\alpha_0\cdots\widehat{\alpha_j}\cdots\alpha_{p+1}}. }
\alpha_rUse in source · 2 passages
Search aliases: α_r alpha
Use in source · 10-persistence.tex, line 210
[Nonautonomous persistence theorem] Let e_t≥0 satisfy e_t+1≤α_te_t+σ_t, α_t,σ_t≥0. Then, for every t≥1, e_t ≤ · (∏_r=0^t-1α_r)e_0 · + ∑_j=0^t-1 (∏_r=j+1^t-1α_r)σ_j, where an empty product equals one. If α_t≤barα<1, σ_t≤barσ, then e_t ≤ barα^te_0 + fracbarσ(1-barα^t)1-barα, and consequently limsup_t→∞e_t ≤ fracbarσ1-barα.
Exact mathematical passage
\boxed{ \begin{aligned} e_t \leq &\left(\prod_{r=0}^{t-1}\alpha_r\right)e_0\\ &+ \sum_{j=0}^{t-1} \left(\prod_{r=j+1}^{t-1}\alpha_r\right)\sigma_j, \end{aligned} }
\alpha_SUse in source · 19 passages
Search aliases: α_S alpha
Use in source · 11-reconstruction-and-resilience.tex, line 49
For a coalition S⊆ V, define the analysis operator A_S:C_*⟶⊕_i∈ S Y_i, A_Sc=(E_ic)_i∈ S, and the coalition frame operator F_S=A_S^*A_S=∑_i∈ SE_i^*E_i. Set α_S=λ_min(F_S), β_S=λ_max(F_S). Thus α_S c ^2 ≤ A_Sc ^2 ≤ β_S c ^2.
Exact mathematical passage
\alpha_S=\lambda_{\min}(F_S), \qquad \beta_S=\lambda_{\max}(F_S).
\alpha_S'Use in source · 1 passage
Search aliases: α_S' alpha
Use in source · 12-identity-through-time-and-replacement.tex, line 503
be a declared coalition, let A_S:ran P→ Y_S, A_S':ran P'→ Y_S' be the resulting accessible coalition encoders, and let K_S be a unitary identification of their observation spaces. Suppose A_S'β-K_SA_S ≤ δ_S^frame < sqrtα_S. Then the replacement coalition remains reconstructive and its new lower frame bound satisfies α_S' ≥ ( sqrtα_S-δ_S^frame )^2. Consequently, k-failure resilience survives whenever the bound holds uniformly for every coalition remaining after at most k erasures.
Exact mathematical passage
\boxed{ \alpha_S' \geq \left( \sqrt{\alpha_S}-\delta_{S}^{\mathrm{frame}} \right)^2. }
\alpha_tUse in source · 11 passages
Search aliases: α_t alpha
Use in source · 10-persistence.tex, line 142
Let the realized vertex state satisfy x_t+1=F_tx_t+ξ_t, where F_t: C_V(t)→ C_V(t+1) is the actual update and ξ_t is an unmodeled disturbance. Define the off-workspace error e_t= (I-P_t)x_t . Introduce α_t = (I-P_t+1)F_t(I-P_t) , which measures persistence of prior off-workspace error, and ℓ_t = (I-P_t+1)F_tP_t , which measures leakage of a valid workspace state under the update.
Exact mathematical passage
\alpha_t = \left\| (I-P_{t+1})F_t(I-P_t) \right\|,
\alpha_{t-1}Use in source · 1 passage
Search aliases: α_t-1 alpha
Use in source · 10-persistence.tex, line 250
Repeated substitution yields e_t · ≤ α_t-1⋯α_0e_0 + α_t-1⋯α_1σ_0 + ⋯ + σ_t-1, which is the first formula. Under the uniform bounds, dominate each product by the corresponding power of barα and sum the geometric series.
Exact mathematical passage
\begin{aligned} e_t &\leq \alpha_{t-1}\cdots\alpha_0e_0 + \alpha_{t-1}\cdots\alpha_1\sigma_0 + \cdots + \sigma_{t-1}, \end{aligned}
\alpha_t^{(k)}Use in source · 1 passage
Search aliases: α_t^(k) alpha
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
\alpha_{V\setminus A}Use in source · 1 passage
Search aliases: α_V∖ A alpha setminus
Use in source · 11-reconstruction-and-resilience.tex, line 241
For k≥0, define the worst surviving lower frame bound α^(k) = min_substackA⊆ V |A|≤ k α_V∖ A. The sequence α^(k) is nonincreasing in k.
Exact mathematical passage
\boxed{ \alpha^{(k)} = \min_{\substack{A\subseteq V\\|A|\leq k}} \alpha_{V\setminus A}. }
\alpha_{\{i,j\}}Use in source · 1 passage
Search aliases: α_{i,j} alpha
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 171
E_{2,3}^*E_{2,3} · =diag(1,1,2). Hence α_{i,j}=1 (i≠ j), and one-node erasure recovery is exact. Every nonzero core vector is visible at at least two nodes, so d_er=2. This code is distributed but redundant: no node is sufficient, yet any one node may be lost without destroying the core.
Exact mathematical passage
\alpha_{\{i,j\}}=1 \qquad(i\neq j),
\alpha_{\{\alpha\}}^{\mathrm{meta}}Use in source · 1 passage
Search aliases: α_{α}^meta alpha alpha mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 882
mathscr W_meta( U)≅mathscr W(G) is a compositional statement, not a relational-irreducibility statement. A single chart may still expose enough accessible information to reconstruct the whole meta-state. A claim that the hierarchy is genuinely distributed must therefore reuse the coalition gates from Parts~VII and XI. At the chart level, one may require, for example, α_{α}^meta=0 for every α, α_A^meta>0 for some |A|≥2, or the predictive analogue k_ε^meta≥2, Δ_joint^meta>0. Capacity-matched local…
Exact mathematical passage
\alpha_{\{\alpha\}}^{\mathrm{meta}}=0 \quad\text{for every }\alpha, \qquad \alpha_A^{\mathrm{meta}}>0 \quad\text{for some }|A|\geq2,
\beta^tUse in source · 2 passages
Search aliases: β^t beta
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 899
enance deficit. Suppose the matched no-repair trajectory satisfies e_t+1^(0) ≤ α e_t+d_t, where d_t≥0 is exogenous damage. Suppose the implemented repair policy has the causal one-step effect e_t+1^(0)-e_t+1 ≥ κ e_t-ϵ_t. Assume 0≤β:=α-κ<1, 0≤ d_t≤overline d, 0≤ϵ_t≤overlineϵ. Then e_t ≤ β^te_0 + frac(overline d+overlineϵ)(1-β^t)1-β, and therefore limsup_t→∞e_t ≤ fracoverline d+overlineϵ1-β. If the admissible deficit is e_max and e_0≤ e_max, overline d+overlineϵ ≤ (1-β)e_max, then the interval [0,…
Exact mathematical passage
\boxed{ e_t \leq \beta^te_0 + \frac{(\overline d+\overline\epsilon)(1-\beta^t)}{1-\beta}, }
\beta_SUse in source · 4 passages
Search aliases: β_S beta
Use in source · 11-reconstruction-and-resilience.tex, line 49
For a coalition S⊆ V, define the analysis operator A_S:C_*⟶⊕_i∈ S Y_i, A_Sc=(E_ic)_i∈ S, and the coalition frame operator F_S=A_S^*A_S=∑_i∈ SE_i^*E_i. Set α_S=λ_min(F_S), β_S=λ_max(F_S). Thus α_S c ^2 ≤ A_Sc ^2 ≤ β_S c ^2.
Exact mathematical passage
\alpha_S=\lambda_{\min}(F_S), \qquad \beta_S=\lambda_{\max}(F_S).
\gamma_{\mathcal U}^{\mathrm{meta}}Use in source · 5 passages
Search aliases: γ_ U^meta gamma mathcal mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 508
Let γ_ U^meta = λ_min^+ (L_ U^meta) be the first positive eigenvalue.
Exact mathematical passage
\gamma_{\mathcal U}^{\mathrm{meta}} = \lambda_{\min}^+ \left(L_{\mathcal U}^{\mathrm{meta}}\right)
\gamma_{\mathcal U}^{\mathrm{tot}}Use in source · 4 passages
Search aliases: γ_ U^tot gamma mathcal mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 628
[Total descent kernel] For every finite edge-complete cover, ker K_ U = J_ Umathscr W(G). Consequently, if γ_ U^tot = λ_min^+ (L_ U^tot), then dist ( u, J_ Umathscr W(G) )^2 ≤ frac E_ U^tot(u) γ_ U^tot.
Exact mathematical passage
\gamma_{\mathcal U}^{\mathrm{tot}} = \lambda_{\min}^+ \left(L_{\mathcal U}^{\mathrm{tot}}\right),
\gamma_1Use in source · 2 passages
Search aliases: γ_1 gamma
Use in source · 03-exact-shared-cores.tex, line 239
[Finite matrix test] Let γ_1,…,γ_r be fundamental cycle generators and suppose dim C_o=d. Define the stacked obstruction matrix M = H_γ_1-I
Exact mathematical passage
\gamma_1,\ldots,\gamma_r
\gamma_eUse in source · 2 passages
Search aliases: γ_e gamma
Use in source · 03-exact-shared-cores.tex, line 127
Choose a spanning tree T⊆|G|. Let τ_i:o→ i be the unique tree path. Every non-tree edge e:i→ j determines a fundamental loop γ_e=τ_j^-1eτ_i with transfer H_γ_e=H_τ_j^-1H_eH_τ_i. The fundamental group of a finite graph is generated freely by these cotree loops. Hence it is enough to impose fixed-point conditions for a finite set of generators.
Exact mathematical passage
\gamma_e=\tau_j^{-1}e\tau_i
\gamma_{e_q}Use in source · 1 passage
Search aliases: γ_e_q gamma
Use in source · 03-exact-shared-cores.tex, line 141
[Finite obstruction set] Let e_1,…,e_r be the non-tree edges of a connected finite graph. Then C_* = ⋂_q=1^r ker(H_γ_e_q-I).
Exact mathematical passage
C_* = \bigcap_{q=1}^{r} \ker(H_{\gamma_{e_q}}-I).
\gamma_HUse in source · 4 passages
Search aliases: γ_H gamma
Use in source · 04-approximate-workspaces.tex, line 293
[Coherence-to-core distance estimate] Let W_0=Γ(H)=ker L_H, r=dim W_0, and suppose r<N. Set γ_H=λ_r+1>0. Then every c∈ C_V satisfies dist(c,W_0)^2 ≤ frac E_H(c)γ_H. Moreover, E_H(c) ≤ L_H dist(c,W_0)^2.
Exact mathematical passage
\gamma_H=\lambda_{r+1}>0.
\gamma_{\mathrm{HAI}}Use in source · 1 passage
Search aliases: γ_HAI gamma mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 541
0 · -1 · 0 · 0 · 0 · 0 · 1 · 0 . The rows are orthogonal with squared norm two. Therefore ker D_HAI ≅ R^4, spec(L_HAI) = {0,0,0,0,2,2,2,2}, γ_HAI=2. The full accessible frame operator is F_HMXA=2I_4. No single node is injective. Every three-node coalition reconstructs the full state, and the two opposite pairs {H,X}, {M,A} are already sufficient. Adjacent pairs observe only three of the four coordinates. Hence k_rec=2, d_er=2, while the identity of the sufficient two-node coalition depends on th…
Exact mathematical passage
\boxed{ \spec(L_{\mathrm{HAI}}) = \{0,0,0,0,2,2,2,2\}, \qquad \gamma_{\mathrm{HAI}}=2. }
\gamma_{\mathrm{HH}}Use in source · 1 passage
Search aliases: γ_HH gamma mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 317
-1 · 0 · 0 · 0 · 1 · 0 . Therefore ker D_HH = { (q,p,p,f,q,f)^ T:q,p,f∈ R } ≅ R^3. The rows are orthogonal with squared norm two, so D_HHD_HH^*=2I_3. Consequently the transfer Laplacian has spectrum spec(L_HH) = {0,0,0,2,2,2}, and the exact workspace gap is γ_HH=2. The low-energy subspace is therefore stable under any Laplacian perturbation whose operator norm is strictly below one, with the quantitative projector bound from Theorem~[source reference].
Exact mathematical passage
\gamma_{\mathrm{HH}}=2.
\gamma_{\mathrm{int}}Use in source · 2 passages
Search aliases: γ_int gamma mathrm
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 192
[Two-scale coherence bound] Let P_Π be the orthogonal projector onto J_Π W_Π. Let γ_int>0 be the smallest positive eigenvalue of D_int^*D_int, and let γ_Π>0 be the smallest positive eigenvalue of D_Π^*D_Π. Then every c∈ C_V satisfies dist(c,Γ(H)) ≤ frac D_intc sqrtγ_int + frac D_Π J_Π^*P_Π c sqrtγ_Π. The first term measures incoherence within macro-components. The second measures incompatibility among their internally coherent states.
Exact mathematical passage
\gamma_{\mathrm{int}}>0
\gamma_rUse in source · 5 passages
Search aliases: γ_r gamma
Use in source · 03-exact-shared-cores.tex, line 239
[Finite matrix test] Let γ_1,…,γ_r be fundamental cycle generators and suppose dim C_o=d. Define the stacked obstruction matrix M = H_γ_1-I
Exact mathematical passage
\gamma_1,\ldots,\gamma_r
\Gamma_{\varepsilon_r}Use in source · 1 passage
Search aliases: Γ_ε_r Gamma varepsilon
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 224
For appropriate recurrent systems, W^(r+1) = Γ_ε_r(W^(r)) may converge to a stable workspace type: d_id ( W^(r+1),W^(r) ) →0.
Exact mathematical passage
W^{(r+1)} = \Gamma_{\varepsilon_r}(W^{(r)})
\Gamma_{\varepsilon_t}Use in source · 2 passages
Search aliases: Γ_ε_t Gamma varepsilon
Use in source · 06-dynamic-workspace-theory.tex, line 89
Let c(t)=(c_i(t))_i∈ V ∈ C_V(t), P_t= 1_[0,ε_t](L_t). The instantaneous structural workspace coordinate is W_t^str=P_tc(t) ∈ Γ_ε_t(H(t)). When P_t varies with time, these coordinates inhabit a moving family of subspaces. Parts~X--XII will supply the transport required to compare them across time. In what follows, all sufficiency and intervention statements are made at a fixed decision time t.
Exact mathematical passage
\boxed{ W_t^{\mathrm{str}}=P_tc(t) \in \Gamma_{\varepsilon_t}(H(t)). }
\gamma_\PiUse in source · 3 passages
Search aliases: γ_Π gamma Pi
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 194
[Two-scale coherence bound] Let P_Π be the orthogonal projector onto J_Π W_Π. Let γ_int>0 be the smallest positive eigenvalue of D_int^*D_int, and let γ_Π>0 be the smallest positive eigenvalue of D_Π^*D_Π. Then every c∈ C_V satisfies dist(c,Γ(H)) ≤ frac D_intc sqrtγ_int + frac D_Π J_Π^*P_Π c sqrtγ_Π. The first term measures incoherence within macro-components. The second measures incompatibility among their internally coherent states.
Exact mathematical passage
\gamma_\Pi>0
\boldsymbol\DeltaUse in source · 3 passages
Search aliases: Δ boldsymbol Delta
Use in source · 07-relational-irreducibility.tex, line 340
For a predeclared null Q, define Δ_tr(Q) = Risk_ℓ,Q(V) - Risk_ℓ,P(V). For a finite validated panel Q={Q_1,…,Q_m}⊆ N_pred(P), report both the complete vector Δ_tr( Q) = ( Δ_tr(Q_1),…, Δ_tr(Q_m) ) and the robust panel minimum Δ_tr^min( Q) = min_Q∈ QΔ_tr(Q). The panel must be fixed independently of the observed favorable gap. Otherwise null selection can manufacture apparent relational dependence.
Exact mathematical passage
\boldsymbol\Delta_{\mathrm{tr}}(\mathcal Q) = \bigl( \Delta_{\mathrm{tr}}(Q_1),\ldots, \Delta_{\mathrm{tr}}(Q_m) \bigr)
\Delta^{(r)}_\ellUse in source · 1 passage
Search aliases: Δ^(r)_ℓ Delta ell
Use in source · 07-relational-irreducibility.tex, line 124
For 0≤ r≤ |V|, define the order-r coalition gap profile by Δ^(r)_ℓ = min_substackA⊆ V |A|≤ r [ Risk_ℓ(A)-Risk_ℓ(V) ]. The profile is nonincreasing in r and reaches zero by r=|V|. It records how rapidly operative capacity becomes reconstructible as larger coalitions are permitted.
Exact mathematical passage
\boxed{ \Delta^{(r)}_\ell = \min_{\substack{A\subseteq V\\|A|\leq r}} \left[ \Risk_\ell(A)-\Risk_\ell(V) \right]. }
\delta^1Use in source · 7 passages
Search aliases: δ^1 delta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 209
A different problem arises when only relative transition data are supplied. Let b=(b_αβ)∈check C^1( U;mathscr W) be a prescribed family of overlap offsets. The triple-overlap consistency condition is δ^1b=0. One seeks local potentials q=(q_α)∈check C^0 satisfying δ^0q=b. Define check H^1( U;mathscr W) = frackerδ^1imδ^0. Then the affine gluing problem is solvable precisely when [b]=0 in check H^1( U;mathscr W). A nonzero class means that all local transition statements can be mutually consistent …
Exact mathematical passage
\delta^1b=0.
\delta^2Use in source · 1 passage
Search aliases: δ^2 delta
Use in source · 04-approximate-workspaces.tex, line 798
[ Q_i_2T_2T_1P_i_0 = V_2H_1+K_2V_1. Thus leakage out of the core is first order in the blocks V_r, while an excursion that leaves and then returns to the core contains at least one V-block and one later U-block. For a fixed path length, if U_r , V_r =O(δ) and the diagonal blocks remain bounded, the residual-mediated correction to pure core-to-core transport is O(δ^2), whereas terminal residual leakage can be O(δ). This distinction separates loss of core invariance from distortion caused by tempo…
Exact mathematical passage
O(\delta^2)
\delta^{\mathrm{leak}}Use in source · 4 passages
Search aliases: δ^leak delta mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 326
The complete formation signature is E_form(W) = ( e_V,e_E,e_H,e_P,e_ O,e_B; δ^scaf, δ^leak ), where every e_q is reported as the pair e_q = ( e_q^MDL, e_q^causal ). No scalar average is permitted to hide a zero history contribution for one of the structures claimed to have been discovered.
Exact mathematical passage
\boxed{ \mathbf E_{\mathrm{form}}(W) = \left( e_V,e_E,e_H,e_P,e_{\mathcal O},e_B; \delta^{\mathrm{scaf}}, \delta^{\mathrm{leak}} \right), }
\delta^pUse in source · 4 passages
Search aliases: δ^p delta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 134
For p≥0, define the finite cochain space check C^p( U;mathscr W) = ⊕_α_0<⋯<α_p mathscr W(G_α_0⋯α_p), where empty intersections contribute the zero space. The coboundary δ^p:check C^p⟶check C^p+1 is (δ^p s)_α_0⋯α_p+1 = ∑_j=0^p+1(-1)^j r_α_0⋯α_p+1^% α_0⋯widehatα_j⋯α_p+1 % s_α_0⋯widehatα_j⋯α_p+1. The restriction identities imply δ^p+1δ^p=0. For a local family w=(w_α)_α, (δ^0w)_αβ = r_αβ^βw_β - r_αβ^αw_α. Thus δ^0 is the overlap-discrepancy operator at the level of exact local workspaces.
Exact mathematical passage
\delta^p:\check C^p\longrightarrow\check C^{p+1}
\delta^{p+1}Use in source · 1 passage
Search aliases: δ^p+1 delta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 150
pha_p), where empty intersections contribute the zero space. The coboundary δ^p:check C^p⟶check C^p+1 is (δ^p s)_α_0⋯α_p+1 = ∑_j=0^p+1(-1)^j r_α_0⋯α_p+1^% α_0⋯widehatα_j⋯α_p+1 % s_α_0⋯widehatα_j⋯α_p+1. The restriction identities imply δ^p+1δ^p=0. For a local family w=(w_α)_α, (δ^0w)_αβ = r_αβ^βw_β - r_αβ^αw_α. Thus δ^0 is the overlap-discrepancy operator at the level of exact local workspaces.
Exact mathematical passage
\delta^{p+1}\delta^p=0.
\delta^{\mathrm{scaf}}Use in source · 3 passages
Search aliases: δ^scaf delta mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 326
The complete formation signature is E_form(W) = ( e_V,e_E,e_H,e_P,e_ O,e_B; δ^scaf, δ^leak ), where every e_q is reported as the pair e_q = ( e_q^MDL, e_q^causal ). No scalar average is permitted to hide a zero history contribution for one of the structures claimed to have been discovered.
Exact mathematical passage
\boxed{ \mathbf E_{\mathrm{form}}(W) = \left( e_V,e_E,e_H,e_P,e_{\mathcal O},e_B; \delta^{\mathrm{scaf}}, \delta^{\mathrm{leak}} \right), }
\delta_{\mathcal D}Use in source · 7 passages
Search aliases: δ_ D delta mathcal
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 486
Fix a reference decomposition D_0. For each D∈ D, let Φ_ D:W^ D_0⟶ W^ D be a declared workspace correspondence and let δ_ D measure its structural and causal identity defect. Assume gate q has a transport bound | m_q(Φ_ DW; D) -m_q(W; D_0) | ≤ L_qδ_ D+b_q( D), where L_q is a sensitivity constant and b_q records model mismatch not captured by the identity distance.
Exact mathematical passage
\delta_{\mathcal D}
\Delta_1Use in source · 3 passages
Search aliases: Δ_1 Delta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 236
Equip the finite cochain spaces with Hilbert inner products and define the first vCech Laplacian Δ_1 = δ^0(δ^0)^* + (δ^1)^*δ^1. Let H^1_ U=kerΔ_1.
Exact mathematical passage
\boxed{ \Delta_1 = \delta^0(\delta^0)^* + (\delta^1)^*\delta^1. }
\delta_a^0Use in source · 1 passage
Search aliases: δ_a^0 delta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 918
A finite workspace hierarchy is a rooted tree T. Each node a∈ T carries a subgraph G_a. The root r carries G_r=G. For every internal node a, its children Ch(a) form a finite edge-complete cover of G_a. Leaves carry primitive local workspace spaces W_ℓ=mathscr W(G_ℓ). For an internal node, define recursively W_a = ker ( δ_a^0: ⊕_b∈Ch(a)W_b ⟶ ⊕_b<cW_bc ), where the overlap spaces and restrictions are inherited from the child cover.
Exact mathematical passage
\boxed{ W_a = \ker \left( \delta_a^0: \bigoplus_{b\in\operatorname{Ch}(a)}W_b \longrightarrow \bigoplus_{b<c}W_{bc} \right), }
\delta_A^ZUse in source · 4 passages
Search aliases: δ_A^Z delta
Use in source · 07-relational-irreducibility.tex, line 207
Let d_ P be a bounded metric generating the measurable structure on P( Y). Define the reconstruction defect of the canonical state from coalition A by δ_A^Z = inf_ψ_A E [ d_ P ( Z_t,ψ_A( H_t^A) ) ].
Exact mathematical passage
\delta_A^Z = \inf_{\psi_A} \mathbb E\!\left[ d_{\mathcal P}\!\left( Z_t,\psi_A(\mathbf H_t^A) \right) \right].
\Delta_A^\ellUse in source · 2 passages
Search aliases: Δ_A^ℓ Delta ell
Use in source · 08-causal-efficacy-and-reentry.tex, line 378
The resulting certification report is C_dyn(W_t) =( · δ_align^ I, {Δ_A^ℓ}_A⊆ V, k_ε, Δ_tr( Q), · η_causal^ν, Δ_specific(r), η_rec(τ), η_loop(τ) ). No single coordinate certifies a relational workspace.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal C_{\mathrm{dyn}}(W_t) =\bigl(& \delta_{\mathrm{align}}^{\mathcal I}, \{\Delta_A^\ell\}_{A\subseteq V}, k_\varepsilon, \boldsymbol\Delta_{\mathrm{tr}}(\mathcal Q),\\ &\eta_{\mathrm{causal}}^\nu, \Delta_{\mathrm{specific}}(r), \eta_{\mathrm{rec}}(\tau), \eta_{\mathrm{loop}}(\tau) \bigr). \end{aligned} }
\Delta_A^{\ell}Use in source · 1 passage
Search aliases: Δ_A^ℓ Delta ell
Use in source · 07-relational-irreducibility.tex, line 79
Define the coalition gap Δ_A^ℓ = Risk_ℓ(A)-Risk_ℓ(V) ≥0. The node-level joint advantage is Δ_joint^ℓ = min_i∈ V Δ_{i}^ℓ. Under logarithmic loss, Δ_joint^log = min_i∈ V I ( Y_t^+; H_t mid H_t^{i} ). Therefore Δ_joint^log>0 means that every individual component omits some predictive information available to the complete system.
Exact mathematical passage
\Delta_A^{\ell} = \Risk_\ell(A)-\Risk_\ell(V) \geq0.
\delta_{\mathrm{align}}Use in source · 1 passage
Search aliases: δ_align delta mathrm
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 41
For a one-parameter family R_λ, define λ_str · = inf{λ: d_ε(λ)>0, g_ε(λ)>0}, λ_op · = inf{λ: δ_align(λ) ≤ε_op}, λ_causal · = inf{λ: η_causal(λ) ≥τ_causal}, λ_rel · = inf{λ: k_ε(λ)≥2, Δ_tr(λ) ≥τ_tr}, λ_form · = inf{λ: Form_Θ_form (W_λ)=1}. In general, λ_str, λ_op, λ_causal, λ_rel, λ_form can be distinct. A synchronized representation can appear before it becomes causally useful, and causal coordination can appear while remaining reducible to one centralized component.
Exact mathematical passage
\begin{aligned} \lambda_{\mathrm{str}} &= \inf\{\lambda: d_{\varepsilon}(\lambda)>0, g_{\varepsilon}(\lambda)>0\},\\ \lambda_{\mathrm{op}} &= \inf\{\lambda: \delta_{\mathrm{align}}(\lambda) \leq\varepsilon_{\mathrm{op}}\},\\ \lambda_{\mathrm{causal}} &= \inf\{\lambda: \eta_{\mathrm{causal}}(\lambda) \geq\tau_{\mathrm{causal}}\},\\ \lambda_{\mathrm{rel}} &= \inf\{\lambda: k_\varepsilon(\lambda)\geq2, \Delta_{\mathrm{tr}}(\lambda) \geq\tau_{\mathrm{tr}}\},\\ \lambda_{\mathrm{form}} &= \inf\{\lambda: \operatorname{Form}_{\Theta_{\mathrm{form}}} (W_\lambda)=1\}. \end{aligned}
\delta_{\mathrm{align}}^{\mathcal I}Use in source · 9 passages
Search aliases: δ_align^ I delta mathrm mathcal
Use in source · 06-dynamic-workspace-theory.tex, line 434
Define the observational alignment defect by δ_align^obs(W_t) = I_ P(Y_t^+; H_tmid W_t). For a countable intervention family with declared weights q_ι>0, ∑_ι q_ι=1, define δ_align^ I(W_t) = ∑_ι∈ I q_ι I_ P^ι (Y_t^+; H_tmid W_t). For bounded decision losses, Proposition~[source reference] applies under each intervention and gives the weighted bound ∑_ιq_ι [ Risk_ℓ^ι(W_t) - Risk_ℓ^ι( H_t) ] ≤ sqrtfrac δ_align^ I(W_t)2.
Exact mathematical passage
\boxed{ \delta_{\mathrm{align}}^{\mathcal I}(W_t) = \sum_{\iota\in\mathcal I} q_\iota I_{\mathbb P^\iota} (Y_t^+;\mathbf H_t\mid W_t). }
\delta_{\mathrm{align}}^{\mathrm{obs}}Use in source · 2 passages
Search aliases: δ_align^obs delta mathrm mathrm
Use in source · 06-dynamic-workspace-theory.tex, line 425
Define the observational alignment defect by δ_align^obs(W_t) = I_ P(Y_t^+; H_tmid W_t). For a countable intervention family with declared weights q_ι>0, ∑_ι q_ι=1, define δ_align^ I(W_t) = ∑_ι∈ I q_ι I_ P^ι (Y_t^+; H_tmid W_t). For bounded decision losses, Proposition~[source reference] applies under each intervention and gives the weighted bound ∑_ιq_ι [ Risk_ℓ^ι(W_t) - Risk_ℓ^ι( H_t) ] ≤ sqrtfrac δ_align^ I(W_t)2.
Exact mathematical passage
\boxed{ \delta_{\mathrm{align}}^{\mathrm{obs}}(W_t) = I_{\mathbb P}(Y_t^+;\mathbf H_t\mid W_t). }
\delta_cUse in source · 3 passages
Search aliases: δ_c delta
Use in source · 12-identity-through-time-and-replacement.tex, line 428
· + ( A_ W'' + A_ W ) (1-sqrt1-q_*^2) ]. If, in addition, δ_causal(β)≤δ_c, δ_rec(β)≤δ_r, then d_id( R, R') ≤ · a q_*+b δ_op( J)
Exact mathematical passage
\delta_{\mathrm{causal}}(\beta)\leq\delta_c, \qquad \delta_{\mathrm{rec}}(\beta)\leq\delta_r,
\delta_{\mathrm{coh}}Use in source · 12 passages
Search aliases: δ_coh delta mathrm
Use in source · 04-approximate-workspaces.tex, line 261
For c≠0, define the Rayleigh defect δ_coh(c) = frac E_H(c) c ^2. For a nonzero subspace W⊆ C_V, define δ_coh(W) = sup_substackc∈ W
Exact mathematical passage
\delta_{\mathrm{coh}}(c) = \frac{\mathcal E_H(c)}{\|c\|^2}.
\delta_{\mathrm{coh},t}Use in source · 1 passage
Search aliases: δ_coh,t delta mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
\Delta_DUse in source · 1 passage
Search aliases: Δ_D Delta
Use in source · 12-identity-through-time-and-replacement.tex, line 86
For an approximate correspondence define Δ_D=D'J_V-J_ED, δ_D= Δ_D . If the graph weights are unchanged, define edgewise comparison defects δ_e = H_e'J_s(e)-J_t(e)H_e . The discrepancy operator has one changed source block per edge, so δ_D^2 ≤ max_i∈ V ∑_e:s(e)=iw_eδ_e^2 ≤ ∑_e∈ Ew_eδ_e^2. When a single node is replaced, every nonincident edge has δ_e=0. The replacement defect is therefore locally measurable even though its effect on the global workspace is controlled by the global spectral gap.
Exact mathematical passage
\boxed{ \Delta_D=D'J_V-J_ED, \qquad \delta_D=\|\Delta_D\|. }
\delta_DUse in source · 8 passages
Search aliases: δ_D delta
Use in source · 12-identity-through-time-and-replacement.tex, line 86
For an approximate correspondence define Δ_D=D'J_V-J_ED, δ_D= Δ_D . If the graph weights are unchanged, define edgewise comparison defects δ_e = H_e'J_s(e)-J_t(e)H_e . The discrepancy operator has one changed source block per edge, so δ_D^2 ≤ max_i∈ V ∑_e:s(e)=iw_eδ_e^2 ≤ ∑_e∈ Ew_eδ_e^2. When a single node is replaced, every nonincident edge has δ_e=0. The replacement defect is therefore locally measurable even though its effect on the global workspace is controlled by the global spectral gap.
Exact mathematical passage
\boxed{ \Delta_D=D'J_V-J_ED, \qquad \delta_D=\|\Delta_D\|. }
\delta_D^2Use in source · 5 passages
Search aliases: δ_D^2 delta
Use in source · 12-identity-through-time-and-replacement.tex, line 100
For an approximate correspondence define Δ_D=D'J_V-J_ED, δ_D= Δ_D . If the graph weights are unchanged, define edgewise comparison defects δ_e = H_e'J_s(e)-J_t(e)H_e . The discrepancy operator has one changed source block per edge, so δ_D^2 ≤ max_i∈ V ∑_e:s(e)=iw_eδ_e^2 ≤ ∑_e∈ Ew_eδ_e^2. When a single node is replaced, every nonincident edge has δ_e=0. The replacement defect is therefore locally measurable even though its effect on the global workspace is controlled by the global spectral gap.
Exact mathematical passage
\boxed{ \delta_D^2 \leq \max_{i\in V} \sum_{e:s(e)=i}w_e\delta_e^2 \leq \sum_{e\in E}w_e\delta_e^2. }
\boldsymbol\Delta_{\mathrm{dec}}Use in source · 1 passage
Search aliases: Δ_dec boldsymbol Delta mathrm
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 351
Use a vector rather than one aggregate score: C_full(W) =( · d_ε, g_ε, δ_coh, δ_align^ I, Δ_joint^ℓ, k_ε, · Δ_tr( Q), η_causal^ν, Δ_specific(r), η_loop(τ), · d_id, Rec_k, underline m_ D, Δ_dec, E_form, δ^scaf, δ^leak, · Δ_J, Δ_t^B, COut_τ(widehat S), CIn_τ(widehat S), · η_G(τ), δ_G^cue(τ), η_G→ A, δ_Q, η_V→ A, η_A→ Y, · η_D→ M, η_M→ R, η_R→ v, Δ_repair^spec, δ_rep-id, sup_t e_t ). A claim passes only when every required coordinate lies in its predeclared admissible region. No weighted average ma…
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal C_{\mathrm{full}}(W) =\bigl(& d_\varepsilon, g_\varepsilon, \delta_{\mathrm{coh}}, \delta_{\mathrm{align}}^{\mathcal I}, \Delta_{\mathrm{joint}}^\ell, k_\varepsilon,\\ &\boldsymbol\Delta_{\mathrm{tr}}(\mathcal Q), \eta_{\mathrm{causal}}^\nu, \Delta_{\mathrm{specific}}(r), \eta_{\mathrm{loop}}(\tau),\\ &d_{\mathrm{id}}, \Rec_k, \underline{\mathbf m}_{\mathfrak D}, \boldsymbol\Delta_{\mathrm{dec}}, \mathbf E_{\mathrm{form}}, \delta^{\mathrm{scaf}}, \delta^{\mathrm{leak}},\\ &\Delta_J, \Delta_t^B, \COut_\tau(\widehat S), \CIn_\tau(\widehat S),\\ &\eta_G(\tau), \delta_G^{\mathrm{cue}}(\tau), \eta_{G\to A}, \delta_Q, \eta_{V\to A}, \eta_{A\to Y},\\ &\eta_{D\to M}, \eta_{M\to R}, \eta_{R\to v}, \Delta_{\mathrm{repair}}^{\mathrm{spec}}, \delta_{\mathrm{rep-id}}, \sup_t e_t \bigr). \end{aligned} }
\Delta_eUse in source · 3 passages
Search aliases: Δ_e Delta
Use in source · 04-approximate-workspaces.tex, line 500
Suppose the edge maps are perturbed to widetilde H_e=H_e+Δ_e while the weights and vertex metrics remain fixed. Define δ_H^2 = max_i∈ V ∑_e:s(e)=iw_e Δ_e ^2. Let F=D_widetilde H-D_H. Then (Fc)_e=-sqrtw_e Δ_ec_s(e), F ≤δ_H. Since L_widetilde H-L_H =D_H^*F+F^*D_H+F^*F, we obtain L_widetilde H-L_H ≤ 2 D_H δ_H+δ_H^2.
Exact mathematical passage
\widetilde H_e=H_e+\Delta_e
\delta_eUse in source · 2 passages
Search aliases: δ_e delta
Use in source · 12-identity-through-time-and-replacement.tex, line 94
For an approximate correspondence define Δ_D=D'J_V-J_ED, δ_D= Δ_D . If the graph weights are unchanged, define edgewise comparison defects δ_e = H_e'J_s(e)-J_t(e)H_e . The discrepancy operator has one changed source block per edge, so δ_D^2 ≤ max_i∈ V ∑_e:s(e)=iw_eδ_e^2 ≤ ∑_e∈ Ew_eδ_e^2. When a single node is replaced, every nonincident edge has δ_e=0. The replacement defect is therefore locally measurable even though its effect on the global workspace is controlled by the global spectral gap.
Exact mathematical passage
\delta_e = \|H_e'J_{s(e)}-J_{t(e)}H_e\|.
\delta_e^2Use in source · 1 passage
Search aliases: δ_e^2 delta
Use in source · 12-identity-through-time-and-replacement.tex, line 100
For an approximate correspondence define Δ_D=D'J_V-J_ED, δ_D= Δ_D . If the graph weights are unchanged, define edgewise comparison defects δ_e = H_e'J_s(e)-J_t(e)H_e . The discrepancy operator has one changed source block per edge, so δ_D^2 ≤ max_i∈ V ∑_e:s(e)=iw_eδ_e^2 ≤ ∑_e∈ Ew_eδ_e^2. When a single node is replaced, every nonincident edge has δ_e=0. The replacement defect is therefore locally measurable even though its effect on the global workspace is controlled by the global spectral gap.
Exact mathematical passage
\boxed{ \delta_D^2 \leq \max_{i\in V} \sum_{e:s(e)=i}w_e\delta_e^2 \leq \sum_{e\in E}w_e\delta_e^2. }
\delta_e^{\mathrm{tr}}Use in source · 2 passages
Search aliases: δ_e^tr delta mathrm
Use in source · 02-static-core-transfer-theory.tex, line 188
Core leakage, residual contamination, and total transfer defect are measured by λ_e^out= V_e , λ_e^in= U_e , δ_e^tr = U_e + V_e . These quantities depend on the chosen norms and projectors. Their empirical meaning must therefore be tied to a declared intervention and prediction protocol.
Exact mathematical passage
\delta_e^{\mathrm{tr}} = \|U_e\|+\|V_e\|.
\delta_{\mathrm{flat}}^{(R)}Use in source · 3 passages
Search aliases: δ_flat^(R) delta mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1172
The exact theorem states recursive exact gluing = one-shot exact gluing. The approximate theorem instead supplies a measurable flattening defect: δ_flat^(R) = widetilde F_R-1⋯widetilde F_0(x) - F_R-1⋯ F_0(x) . A hierarchy is empirically justified when it reduces computation, communication, or local model complexity while keeping δ_flat^(R), predictive risk, causal-kernel mismatch, and anti-centralization gates within declared tolerances. Hierarchy by itself is not evidence of emergence.
Exact mathematical passage
\boxed{ \delta_{\mathrm{flat}}^{(R)} = \left\| \widetilde F_{R-1}\cdots\widetilde F_0(x) - F_{R-1}\cdots F_0(x) \right\|. }
\delta_{\mathrm{flat}}^0Use in source · 2 passages
Search aliases: δ_flat^0 delta mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 976
Let L( T) be the leaf set. Repeated edge completeness implies that the flattened family U_flat = {G_ℓ:ℓ∈ L( T)} is itself an edge-complete cover of G. Let δ_flat^0 be its overlap coboundary and define W_flat = kerδ_flat^0. Theorem~[source reference] and Theorem~[source reference] give W_r ≅ W_flat ≅ mathscr W(G). Equivalently, Lim_ T^rec ( {mathscr W(G_ℓ)}_ℓ∈ L( T) ) ≅ Eq_ U_flat ( {mathscr W(G_ℓ)}_ℓ∈ L( T) ). The notation on the left means recursive finite descent along the tree; the right side…
Exact mathematical passage
\delta_{\mathrm{flat}}^0
\delta_G^{\mathrm{cue}}Use in source · 4 passages
Search aliases: δ_G^cue delta mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 300
Cue dependence must be reported separately. For matched initial goal g, define δ_G^cue(τ) = sup_c,c' D_G ( P(G_t+τ∈·midι_g,do(C=c)), P(G_t+τ∈·midι_g,do(C=c')) ). High cue dependence is not a failure when the claimed agent is intentionally instruction following. It does mean that persistence cannot be attributed to an autonomous internal objective without an additional cue-removal result.
Exact mathematical passage
\delta_G^{\mathrm{cue}}(\tau) = \sup_{c,c'} D_G \left( \mathbb P(G_{t+\tau}\in\cdot\mid\iota_g,\operatorname{do}(C=c)), \mathbb P(G_{t+\tau}\in\cdot\mid\iota_g,\operatorname{do}(C=c')) \right).
\delta_H^2Use in source · 4 passages
Search aliases: δ_H^2 delta
Use in source · 04-approximate-workspaces.tex, line 504
Suppose the edge maps are perturbed to widetilde H_e=H_e+Δ_e while the weights and vertex metrics remain fixed. Define δ_H^2 = max_i∈ V ∑_e:s(e)=iw_e Δ_e ^2. Let F=D_widetilde H-D_H. Then (Fc)_e=-sqrtw_e Δ_ec_s(e), F ≤δ_H. Since L_widetilde H-L_H =D_H^*F+F^*D_H+F^*F, we obtain L_widetilde H-L_H ≤ 2 D_H δ_H+δ_H^2.
Exact mathematical passage
\boxed{ \delta_H^2 = \max_{i\in V} \sum_{e:s(e)=i}w_e\|\Delta_e\|^2. }
\delta_i^{\mathrm{local}}Use in source · 1 passage
Search aliases: δ_i^local delta mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 1066
Let every node store a complete copy of the same core: E_i=I_d for every i. Then coherence is perfect and reconstruction is robust, but k_0=1, min_iδ_i^local=0. If the archive is never used in downstream control, then also η_causal=0. This is a shared representation or archive, not a relationally irreducible workspace.
Exact mathematical passage
k_0=1, \qquad \min_i\delta_i^{\mathrm{local}}=0.
\Delta_JUse in source · 6 passages
Search aliases: Δ_J Delta
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 608
[Uniform structure-selection recovery] Let T be a finite candidate family with population score J: T→ R. Let θ_* = argmin_θ∈ TJ(θ) be unique, with margin Δ_J = min_θ≠θ_* (J(θ)-J(θ_*))>0. If a held-out estimate widehat J satisfies sup_θ∈ T |widehat J(θ)-J(θ)| ≤ε, then every empirical minimizer widehatθ obeys J(widehatθ)-J(θ_*) ≤2ε. If 2ε<Δ_J, then widehatθ=θ_*.
Exact mathematical passage
\Delta_J = \min_{\theta\neq\theta_*} \bigl(J(\theta)-J(\theta_*)\bigr)>0.
\Delta_{\mathrm{joint}}Use in source · 1 passage
Search aliases: Δ_joint Delta mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 1083
Suppose node o contains the complete predictive state Z_t, while every other node receives only messages generated by o. The full system can have excellent performance, rich communication, and recurrent activity. Yet Y_t^+indep H_tmid X_o(t), k_0=1, Δ_joint=0. Removing the decorative nodes may change latency or style without changing the operative capacity. Multi-agent appearance therefore does not imply a relational workspace.
Exact mathematical passage
Y_t^+\indep\mathbf H_t\mid X_o(t), \qquad k_0=1, \qquad \Delta_{\mathrm{joint}}=0.
\Delta_{\mathrm{joint}}^{\log}Use in source · 7 passages
Search aliases: Δ_joint^log Delta mathrm log
Use in source · 07-relational-irreducibility.tex, line 95
Define the coalition gap Δ_A^ℓ = Risk_ℓ(A)-Risk_ℓ(V) ≥0. The node-level joint advantage is Δ_joint^ℓ = min_i∈ V Δ_{i}^ℓ. Under logarithmic loss, Δ_joint^log = min_i∈ V I ( Y_t^+; H_t mid H_t^{i} ). Therefore Δ_joint^log>0 means that every individual component omits some predictive information available to the complete system.
Exact mathematical passage
\boxed{ \Delta_{\mathrm{joint}}^{\log} = \min_{i\in V} I\!\left( Y_t^+;\mathbf H_t \mid \mathbf H_t^{\{i\}} \right). }
\Delta_{\mathrm{joint}}^{\mathrm{meta}}Use in source · 1 passage
Search aliases: Δ_joint^meta Delta mathrm mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 890
nough accessible information to reconstruct the whole meta-state. A claim that the hierarchy is genuinely distributed must therefore reuse the coalition gates from Parts~VII and XI. At the chart level, one may require, for example, α_{α}^meta=0 for every α, α_A^meta>0 for some |A|≥2, or the predictive analogue k_ε^meta≥2, Δ_joint^meta>0. Capacity-matched local-memory and chart-ablation controls are still required. Hierarchical notation cannot convert a centralized copy into a relational workspac…
Exact mathematical passage
k_\varepsilon^{\mathrm{meta}}\geq2, \qquad \Delta_{\mathrm{joint}}^{\mathrm{meta}}>0.
\Delta_{\mathrm{joint}}^\ellUse in source · 2 passages
Search aliases: Δ_joint^ℓ Delta mathrm ell
Use in source · 21-empirical-certification-and-reporting-protocol.tex, line 351
Use a vector rather than one aggregate score: C_full(W) =( · d_ε, g_ε, δ_coh, δ_align^ I, Δ_joint^ℓ, k_ε, · Δ_tr( Q), η_causal^ν, Δ_specific(r), η_loop(τ), · d_id, Rec_k, underline m_ D, Δ_dec, E_form, δ^scaf, δ^leak, · Δ_J, Δ_t^B, COut_τ(widehat S), CIn_τ(widehat S), · η_G(τ), δ_G^cue(τ), η_G→ A, δ_Q, η_V→ A, η_A→ Y, · η_D→ M, η_M→ R, η_R→ v, Δ_repair^spec, δ_rep-id, sup_t e_t ). A claim passes only when every required coordinate lies in its predeclared admissible region. No weighted average ma…
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal C_{\mathrm{full}}(W) =\bigl(& d_\varepsilon, g_\varepsilon, \delta_{\mathrm{coh}}, \delta_{\mathrm{align}}^{\mathcal I}, \Delta_{\mathrm{joint}}^\ell, k_\varepsilon,\\ &\boldsymbol\Delta_{\mathrm{tr}}(\mathcal Q), \eta_{\mathrm{causal}}^\nu, \Delta_{\mathrm{specific}}(r), \eta_{\mathrm{loop}}(\tau),\\ &d_{\mathrm{id}}, \Rec_k, \underline{\mathbf m}_{\mathfrak D}, \boldsymbol\Delta_{\mathrm{dec}}, \mathbf E_{\mathrm{form}}, \delta^{\mathrm{scaf}}, \delta^{\mathrm{leak}},\\ &\Delta_J, \Delta_t^B, \COut_\tau(\widehat S), \CIn_\tau(\widehat S),\\ &\eta_G(\tau), \delta_G^{\mathrm{cue}}(\tau), \eta_{G\to A}, \delta_Q, \eta_{V\to A}, \eta_{A\to Y},\\ &\eta_{D\to M}, \eta_{M\to R}, \eta_{R\to v}, \Delta_{\mathrm{repair}}^{\mathrm{spec}}, \delta_{\mathrm{rep-id}}, \sup_t e_t \bigr). \end{aligned} }
\Delta_{\mathrm{joint}}^{\ell}Use in source · 2 passages
Search aliases: Δ_joint^ℓ Delta mathrm ell
Use in source · 07-relational-irreducibility.tex, line 86
Define the coalition gap Δ_A^ℓ = Risk_ℓ(A)-Risk_ℓ(V) ≥0. The node-level joint advantage is Δ_joint^ℓ = min_i∈ V Δ_{i}^ℓ. Under logarithmic loss, Δ_joint^log = min_i∈ V I ( Y_t^+; H_t mid H_t^{i} ). Therefore Δ_joint^log>0 means that every individual component omits some predictive information available to the complete system.
Exact mathematical passage
\boxed{ \Delta_{\mathrm{joint}}^{\ell} = \min_{i\in V} \Delta_{\{i\}}^{\ell}. }
\Delta_{\log}^{(r)}Use in source · 1 passage
Search aliases: Δ_log^(r) Delta log
Use in source · 07-relational-irreducibility.tex, line 180
[Information form of coalition size] Under the assumptions of Theorem~[source reference], k_ε = min{ |A|: I(Y_t^+; H_tmid H_t^A) ≤ε }. Equivalently, k_ε is the first r for which Δ_log^(r)≤ε.
Exact mathematical passage
\Delta_{\log}^{(r)}\leq\varepsilon
\Delta_{\mathrm{maint}}Use in source · 1 passage
Search aliases: Δ_maint Delta mathrm
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 964
Post-action health evolves according to h_t+1=h_t^-lor r_t. Define the maintenance deficit e_t=1-h_t. Under the intact policy, h_t+1=1 and e_t+1=0 for both damage states. Under the matched no-repair intervention and h_t^-=0, e_t+1^(0)=1. Thus the measured causal repair gain is Δ_maint=1. The closed-loop recurrence has β=0, overline d=0, overlineϵ=0, so Theorem~[source reference] gives sup_t e_t=0 after each repair action. Monitor-blind random repair fails the specificity control whenever it eith…
Exact mathematical passage
\boxed{ \Delta_{\mathrm{maint}}=1. }
\delta_{\mathrm{med}}Use in source · 2 passages
Search aliases: δ_med delta mathrm
Use in source · 08-causal-efficacy-and-reentry.tex, line 175
A stronger mediation test equalizes the workspace state after two distinct channel interventions. Let μ be a common imposed workspace distribution, implemented by a feasible stochastic intervention in the sense of Definition~[source reference]. The notation below is shorthand for that implementation. Define the residual mediation defect δ_med = sup_jmath,jmath' D ( P^jmath,do(W_t∼μ)(Y_t^+), P^jmath',do(W_t∼μ)(Y_t^+) ). A small value means that once the workspace state is equalized, little of the…
Exact mathematical passage
\delta_{\mathrm{med}} = \sup_{\jmath,\jmath'} D\!\left( \mathbb P^{\jmath,\operatorname{do}(W_t\sim\mu)}(Y_t^+), \mathbb P^{\jmath',\operatorname{do}(W_t\sim\mu)}(Y_t^+) \right).
\delta_{\mathrm{node}}Use in source · 4 passages
Search aliases: δ_node delta mathrm
Use in source · 08-causal-efficacy-and-reentry.tex, line 259
intact law at a fixed decision time, and let W_t=π_t( H_t) be a structurally supported candidate. Let Q⊆ N_pred(P) be a nonempty, predeclared panel of validated relation-breaking nulls. Assume: item exact structural--operational alignment, I_P(Y_t^+; H_tmid W_t)=0; item a positive node-level information gap, δ_node = min_i∈ V I_P(Y_t^+; H_tmid H_t^i) >0; item a positive robust matched-null gap, δ_null = min_Q∈ Q [ H_Q(Y_t^+mid H_t) - H_P(Y_t^+mid H_t) ] >0; item a feasible intervention design wi…
Exact mathematical passage
\delta_{\mathrm{node}} = \min_{i\in V} I_P(Y_t^+;\mathbf H_t\mid\mathbf H_t^i) >0;
\delta_{\mathrm{null}}Use in source · 3 passages
Search aliases: δ_null delta mathrm
Use in source · 08-causal-efficacy-and-reentry.tex, line 267
bseteq N_pred(P) be a nonempty, predeclared panel of validated relation-breaking nulls. Assume: item exact structural--operational alignment, I_P(Y_t^+; H_tmid W_t)=0; item a positive node-level information gap, δ_node = min_i∈ V I_P(Y_t^+; H_tmid H_t^i) >0; item a positive robust matched-null gap, δ_null = min_Q∈ Q [ H_Q(Y_t^+mid H_t) - H_P(Y_t^+mid H_t) ] >0; item a feasible intervention design with η_causal^ν>0; item positive matched causal specificity at some declared scale r, Δ_specific(r)>…
Exact mathematical passage
\delta_{\mathrm{null}} = \min_{Q\in\mathcal Q} \left[ H_Q(Y_t^+\mid\mathbf H_t) - H_P(Y_t^+\mid\mathbf H_t) \right] >0;
\delta_{\mathrm{op}}Use in source · 8 passages
Search aliases: δ_op delta mathrm
Use in source · 12-identity-through-time-and-replacement.tex, line 337
For an admissible correspondence J, define the operation defect on a declared unit ball A_1 by δ_op( J) = sup_a∈ A_1 A_ W''β-β A_ W . The primary certification object is the identity profile d_id( J) = ( q_str, δ_op( J), δ_causal(β), δ_rec(β); μ^keep ). The first four coordinates must remain below declared tolerances, while the non-collapse margin μ^keep must remain above a declared lower bound. This vector, rather than a weighted average, determines whether a specific identity claim passes.
Exact mathematical passage
\delta_{\mathrm{op}}(\mathfrak J) = \sup_{a\in\mathcal A_1} \|A_{\mathcal W'}'\beta-\beta A_{\mathcal W}\|.
\delta_{\mathrm{opt}}Use in source · 11 passages
Search aliases: δ_opt delta mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 518
[Approximate counterfactual policy selection] Let A be a finite feasible action set. Let Q: A→ R be the true interventional value and let widehat Q satisfy sup_a∈ A|widehat Q(a)-Q(a)|≤ε_Q. Suppose a policy widehatπ is δ_opt-optimal for widehat Q: max_π E_a∼π[widehat Q(a)] - E_a∼widehatπ[widehat Q(a)] ≤ δ_opt. Then, for every true-value-optimal policy π^*, E_a∼π^*[Q(a)] - E_a∼widehatπ[Q(a)] ≤ 2ε_Q+δ_opt. For a deterministic greedy action widehat a∈argmax_awidehat Q(a), Q(a^*)-Q(widehat a) ≤2ε_Q. …
Exact mathematical passage
\delta_{\mathrm{opt}}
\delta_PUse in source · 3 passages
Search aliases: δ_P delta
Use in source · 04-approximate-workspaces.tex, line 644
[Closure under projector drift] Let widetilde P_d be another rank-d orthogonal projector and set δ_P= P_d-widetilde P_d . Then (I-widetilde P_d)ρ_V(a)widetilde P_d ≤ Q_dρ_V(a)P_d +2 ρ_V(a) δ_P. Combining this estimate with Theorem~[source reference] controls operation leakage after noisy workspace extraction.
Exact mathematical passage
\delta_P=\|P_d-\widetilde P_d\|.
\Delta_QUse in source · 3 passages
Search aliases: Δ_Q Delta
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 544
a)] ≤ δ_opt. Then, for every true-value-optimal policy π^*, E_a∼π^*[Q(a)] - E_a∼widehatπ[Q(a)] ≤ 2ε_Q+δ_opt. For a deterministic greedy action widehat a∈argmax_awidehat Q(a), Q(a^*)-Q(widehat a) ≤2ε_Q. If the true optimal action a^* is unique and its value gap Δ_Q = Q(a^*)- max_a≠ a^*Q(a) satisfies Δ_Q>2ε_Q, then every greedy maximizer of widehat Q equals a^*.
Exact mathematical passage
\Delta_Q = Q(a^*)- \max_{a\neq a^*}Q(a)
\Delta_q^{\mathrm{dec}}Use in source · 2 passages
Search aliases: Δ_q^dec Delta mathrm
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 442
Let m_q(W; D) be the signed margin of gate q, oriented so that m_q(W; D)>0 means that the gate passes after its uncertainty correction. Define the decomposition envelope underline m_q = inf_ D∈ Dm_q(W; D), overline m_q = sup_ D∈ Dm_q(W; D), and its sensitivity width Δ_q^dec = overline m_q-underline m_q.
Exact mathematical passage
\Delta_q^{\mathrm{dec}} = \overline m_q-\underline m_q.
\Delta_q^{\mathrm{hist}}Use in source · 3 passages
Search aliases: Δ_q^hist Delta mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 109
component q of widehatθ, define its scaffold-only Bayes risk under loss ℓ_q by R_q^Σ = inf_f E [ ℓ_q(q,f(Σ,Ω)) ]. Define the full formation risk by R_q^Σ, H = inf_g E [ ℓ_q(q,g(Σ, D_form,Ω)) ]. The history advantage is Δ_q^hist = R_q^Σ - R_q^Σ, H. A positive history advantage means that formation history contains information about q that is not already recoverable from the declared scaffold and random seed.
Exact mathematical passage
\boxed{ \Delta_q^{\mathrm{hist}} = \mathcal R_q^{\Sigma} - \mathcal R_q^{\Sigma,\mathcal H}. }
\delta_q^{\mathrm{scaf}}Use in source · 2 passages
Search aliases: δ_q^scaf delta mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 309
For a family S of admissible scaffold variants, define the cross-scaffold identity defect δ_q^scaf = inf_{J_σσ'} E_σ,σ'∼π d_q ( J_σσ'q_σ,q_σ' ), where J_σσ' transports the learned object between admissible coordinate systems. A low value indicates that the same abstract organization is recovered under multiple non-solution-bearing scaffolds.
Exact mathematical passage
\boxed{ \delta_q^{\mathrm{scaf}} = \inf_{\{J_{\sigma\sigma'}\}} \mathbb E_{\sigma,\sigma'\sim\pi} d_q \left( J_{\sigma\sigma'}q_{\sigma},q_{\sigma'} \right), }
\Delta_q^{\mathrm{spec}}Use in source · 1 passage
Search aliases: Δ_q^spec Delta mathrm
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 214
For each gate q∈ J_*, define the specification envelope underline m_q^ S(W) = inf_ς∈ Sm_q(W;ς), overline m_q^ S(W) = sup_ς∈ Sm_q(W;ς). Its sensitivity width is Δ_q^spec(W) = overline m_q^ S(W) - underline m_q^ S(W). The robust certificate margin is r_ S(W) = inf_ς∈ S min_q∈ J_*m_q(W;ς). Then Cert_ S(W)=1 Longleftrightarrow r_ S(W)>0.
Exact mathematical passage
\Delta_q^{\mathrm{spec}}(W) = \overline m_q^{\mathfrak S}(W) - \underline m_q^{\mathfrak S}(W).
\delta_rUse in source · 11 passages
Search aliases: δ_r delta
Use in source · 12-identity-through-time-and-replacement.tex, line 428
· + ( A_ W'' + A_ W ) (1-sqrt1-q_*^2) ]. If, in addition, δ_causal(β)≤δ_c, δ_rec(β)≤δ_r, then d_id( R, R') ≤ · a q_*+b δ_op( J)
Exact mathematical passage
\delta_{\mathrm{causal}}(\beta)\leq\delta_c, \qquad \delta_{\mathrm{rec}}(\beta)\leq\delta_r,
\delta_{\mathrm{rec}}Use in source · 7 passages
Search aliases: δ_rec delta mathrm
Use in source · 12-identity-through-time-and-replacement.tex, line 303
A reconstructive handoff may also be imperfect. Let δ_rec(β) = E[d_ W'(W'_init,β W)] measure replacement initialization error. Corollary~[source reference] provides one explicit upper bound on this term.
Exact mathematical passage
\delta_{\mathrm{rec}}(\beta) = \mathbb E\bigl[d_{\mathcal W'}(W'_{\mathrm{init}},\beta W)\bigr]
\delta_{\mathrm{rep}}Use in source · 3 passages
Search aliases: δ_rep delta mathrm
Use in source · 12-identity-through-time-and-replacement.tex, line 445
· +c δ_c+d δ_r. In particular, if all local structural, operation, closure, causal, and reconstruction defects are O(δ_rep), the relevant operator norms are uniformly bounded, and g≥ g_0>0, then d_id( R, R') ≤ C_1fracδ_repg_0 +C_2δ_rep +O (fracδ_rep^2g_0). After a fixed normalization of the non-spectral terms, this recovers the schematic target d_id lesssim Cfracδ_repg_0.
Exact mathematical passage
O(\delta_{\mathrm{rep}})
\delta_{\mathrm{rep-id}}Use in source · 5 passages
Search aliases: δ_rep-id delta mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 850
Restoration of performance is not automatically restoration of identity. Let W_t^- be the last certified pre-damage workspace and let W_t+τ^r be the post-repair workspace. Define the repair identity defect δ_rep-id(r) = d_id ( W_t^-,W_t+τ^r ). A repair action is identity preserving at tolerance ε_id when Δ_t^rep(r;d)>0, δ_rep-id(r) ≤ ε_id. When integrity is restored but the identity defect exceeds tolerance, the result is better described as a successor or replacement workspace. This terminologi…
Exact mathematical passage
\delta_{\mathrm{rep-id}}(r) = d_{\mathrm{id}} \left( W_{t^-},W_{t+\tau}^{r} \right).
\delta_{\mathrm{rep}}^2Use in source · 1 passage
Search aliases: δ_rep^2 delta mathrm
Use in source · 12-identity-through-time-and-replacement.tex, line 447
· +c δ_c+d δ_r. In particular, if all local structural, operation, closure, causal, and reconstruction defects are O(δ_rep), the relevant operator norms are uniformly bounded, and g≥ g_0>0, then d_id( R, R') ≤ C_1fracδ_repg_0 +C_2δ_rep +O (fracδ_rep^2g_0). After a fixed normalization of the non-spectral terms, this recovers the schematic target d_id lesssim Cfracδ_repg_0.
Exact mathematical passage
\boxed{ d_{\mathrm{id}}(\mathfrak R,\mathfrak R') \leq C_1\frac{\delta_{\mathrm{rep}}}{g_0} +C_2\delta_{\mathrm{rep}} +O\!\left(\frac{\delta_{\mathrm{rep}}^2}{g_0}\right). }
\delta_{\mathrm{replacement}}Use in source · 1 passage
Search aliases: δ_replacement delta mathrm
Use in source · 19-summary-of-main-results.tex, line 324
operation leakage. Coalition frame bounds also persist under sufficiently small reconstructive transport error. With declared causal-kernel and reconstructive-handoff defects, d_id ≤ a q_str +b δ_op +c δ_causal +d δ_rec. Under bounded norms and a uniform spectral gap, this gives the schematic estimate d_id lesssim Cfracδ_replacementg. The causal and reconstructive terms are necessary assumptions rather than consequences of structural similarity.
Exact mathematical passage
d_{\mathrm{id}} \lesssim C\frac{\delta_{\mathrm{replacement}}}{g}.
\Delta_SUse in source · 3 passages
Search aliases: Δ_S Delta
Use in source · 11-reconstruction-and-resilience.tex, line 141
[Encoding mismatch] If the true observation is y=(A_S+Δ_S)c+η but the nominal decoder A_S^† is used, then widehat c-c ≤ frac Δ_S c + η sqrtα_S.
Exact mathematical passage
y=(A_S+\Delta_S)c+\eta
\delta_{S}^{\mathrm{frame}}Use in source · 3 passages
Search aliases: δ_S^frame delta mathrm
Use in source · 12-identity-through-time-and-replacement.tex, line 494
e bounds] Identify the old and new abstract cores with ran P and ran P' through their chosen core parameterizations. Let S be a declared coalition, let A_S:ran P→ Y_S, A_S':ran P'→ Y_S' be the resulting accessible coalition encoders, and let K_S be a unitary identification of their observation spaces. Suppose A_S'β-K_SA_S ≤ δ_S^frame < sqrtα_S. Then the replacement coalition remains reconstructive and its new lower frame bound satisfies α_S' ≥ ( sqrtα_S-δ_S^frame )^2. Consequently, k-failure res…
Exact mathematical passage
\|A_S'\beta-K_SA_S\| \leq \delta_{S}^{\mathrm{frame}} < \sqrt{\alpha_S}.
\delta_{\mathrm{spec}}Use in source · 2 passages
Search aliases: δ_spec delta mathrm
Use in source · 09-formal-workspace-definition.tex, line 8
Let Θ = ( ε_coh, ε_align, ε_k, underlineη_c, underlineη_loop, δ_node, δ_null, δ_spec, k, ε_pers ). Let ς = ( D,Y^+,ℓ,τ, I, Q,Θ) be the complete declared scientific specification, where Q⊆ N_pred(P) is a validated null panel. A dynamic realization contains a certified stratified relational workspace when there exists a candidate W_t satisfying all gates required for the claimed level under ς. The detailed robustness and identifiability requirements for varying ς are developed in Parts~XVII and XV…
Exact mathematical passage
\Theta = \left( \varepsilon_{\mathrm{coh}}, \varepsilon_{\mathrm{align}}, \varepsilon_k, \underline\eta_c, \underline\eta_{\mathrm{loop}}, \delta_{\mathrm{node}}, \delta_{\mathrm{null}}, \delta_{\mathrm{spec}}, k, \varepsilon_{\mathrm{pers}} \right).
\Delta_{\mathrm{specific}}Use in source · 7 passages
Search aliases: Δ_specific Delta mathrm
Use in source · 08-causal-efficacy-and-reentry.tex, line 136
Define η_Workspace(r) = E_ι,ι'∼ I_Workspace(r) D ( P^ι(Y_t^+), P^ι'(Y_t^+) ), η_⊥(r) = E_jmath,jmath'∼ I_⊥(r) D ( P^jmath(Y_t^+), P^jmath'(Y_t^+) ), and Δ_specific(r) = η_Workspace(r)-η_⊥(r). A positive value supports causal concentration in the candidate workspace at the declared perturbation scale.
Exact mathematical passage
\boxed{ \Delta_{\mathrm{specific}}(r) = \eta_{\Workspace}(r)-\eta_{\perp}(r). }
\delta_{\mathrm{suff}}Use in source · 3 passages
Search aliases: δ_suff delta mathrm
Use in source · 06-dynamic-workspace-theory.tex, line 219
For an arbitrary history statistic S_t=s( H_t), let K_t^S(s,·) = P(Y_t^+∈·mid S_t=s). Whenever the conditional relative entropy is finite, define the sufficiency defect δ_suff(S_t) = E [ KL ( K_t( H_t,·) middle K_t^S(S_t,·) ) ].
Exact mathematical passage
\boxed{ \delta_{\mathrm{suff}}(S_t) = \mathbb E\!\left[ \KL\!\left( K_t(\mathbf H_t,\cdot) \,\middle\|\, K_t^S(S_t,\cdot) \right) \right]. }
\delta_tUse in source · 6 passages
Search aliases: δ_t delta
Use in source · 15-boundary-formation-and-stability.tex, line 241
[Boundary persistence under score drift] Assume S_t^* is the unique maximizer of B_t with margin Δ_t^B, and suppose sup_S∈ S_pass | B_t+1(S)- B_t(S)| ≤δ_t. If 2δ_t<Δ_t^B, then S_t+1^*=S_t^*. More generally, B_t+1(S_t+1^*) - B_t+1(S_t^*) ≤2δ_t.
Exact mathematical passage
\sup_{S\in\mathfrak S_{\mathrm{pass}}} |\mathcal B_{t+1}(S)-\mathcal B_t(S)| \leq\delta_t.
\Delta_t^BUse in source · 12 passages
Search aliases: Δ_t^B Delta
Use in source · 15-boundary-formation-and-stability.tex, line 196
[Held-out boundary recovery] Let S_pass be finite and let S_t^* = argmax_S∈ S_pass B_t(S) be unique. Define the population margin Δ_t^B = B_t(S_t^*) - max_S≠ S_t^* B_t(S)>0. If sup_S∈ S_pass | widehat B_t(S)- B_t(S) | ≤ε_t, then every empirical maximizer widehat S_t satisfies B_t(S_t^*)- B_t(widehat S_t) ≤2ε_t. If 2ε_t<Δ_t^B, then widehat S_t=S_t^*.
Exact mathematical passage
\Delta_t^B = \mathcal B_t(S_t^*) - \max_{S\neq S_t^*}\mathcal B_t(S)>0.
\Delta_t^DUse in source · 3 passages
Search aliases: Δ_t^D Delta
Use in source · 10-persistence.tex, line 40
To compare successive times, choose unitary identification maps U_t^V: C_V(t)⟶ C_V(t+1), U_t^E: C_E(t)⟶ C_E(t+1). They are comparison maps, not assumptions that the physical carriers are identical. Define the one-step diagram defect Δ_t^D = D_t+1U_t^V-U_t^ED_t, δ_t^D= Δ_t^D . Exact temporal compatibility is the condition Δ_t^D=0.
Exact mathematical passage
\boxed{ \Delta_t^D = D_{t+1}U_t^V-U_t^ED_t, \qquad \delta_t^D=\|\Delta_t^D\|. }
\delta_t^DUse in source · 4 passages
Search aliases: δ_t^D delta
Use in source · 10-persistence.tex, line 40
To compare successive times, choose unitary identification maps U_t^V: C_V(t)⟶ C_V(t+1), U_t^E: C_E(t)⟶ C_E(t+1). They are comparison maps, not assumptions that the physical carriers are identical. Define the one-step diagram defect Δ_t^D = D_t+1U_t^V-U_t^ED_t, δ_t^D= Δ_t^D . Exact temporal compatibility is the condition Δ_t^D=0.
Exact mathematical passage
\boxed{ \Delta_t^D = D_{t+1}U_t^V-U_t^ED_t, \qquad \delta_t^D=\|\Delta_t^D\|. }
\Delta_{\mathrm{tr}}Use in source · 6 passages
Search aliases: Δ_tr Delta mathrm
Use in source · 07-relational-irreducibility.tex, line 328
For a predeclared null Q, define Δ_tr(Q) = Risk_ℓ,Q(V) - Risk_ℓ,P(V). For a finite validated panel Q={Q_1,…,Q_m}⊆ N_pred(P), report both the complete vector Δ_tr( Q) = ( Δ_tr(Q_1),…, Δ_tr(Q_m) ) and the robust panel minimum Δ_tr^min( Q) = min_Q∈ QΔ_tr(Q). The panel must be fixed independently of the observed favorable gap. Otherwise null selection can manufacture apparent relational dependence.
Exact mathematical passage
\boxed{ \Delta_{\mathrm{tr}}(Q) = \Risk_{\ell,Q}(V) - \Risk_{\ell,P}(V). }
\boldsymbol\Delta_{\mathrm{tr}}Use in source · 3 passages
Search aliases: Δ_tr boldsymbol Delta mathrm
Use in source · 07-relational-irreducibility.tex, line 340
For a predeclared null Q, define Δ_tr(Q) = Risk_ℓ,Q(V) - Risk_ℓ,P(V). For a finite validated panel Q={Q_1,…,Q_m}⊆ N_pred(P), report both the complete vector Δ_tr( Q) = ( Δ_tr(Q_1),…, Δ_tr(Q_m) ) and the robust panel minimum Δ_tr^min( Q) = min_Q∈ QΔ_tr(Q). The panel must be fixed independently of the observed favorable gap. Otherwise null selection can manufacture apparent relational dependence.
Exact mathematical passage
\boldsymbol\Delta_{\mathrm{tr}}(\mathcal Q) = \bigl( \Delta_{\mathrm{tr}}(Q_1),\ldots, \Delta_{\mathrm{tr}}(Q_m) \bigr)
\Delta_{\mathrm{tr}}^{\operatorname{do}}Use in source · 1 passage
Search aliases: Δ_tr^do Delta mathrm operatorname
Use in source · 08-causal-efficacy-and-reentry.tex, line 156
Let jmath_E randomize selected communication edges while preserving their marginal message laws, rates, and timing budget. The causal transfer gap is Δ_tr^do(jmath_E) = Risk_ℓ, P^jmath_E(V) - Risk_ℓ, P(V). Unlike an observational null law, this quantity is anchored to an implemented channel intervention. A positive effect is evidence that the intact alignment of messages, rather than merely their marginal content, contributes to task performance.
Exact mathematical passage
\boxed{ \Delta_{\mathrm{tr}}^{\operatorname{do}}(\jmath_E) = \Risk_{\ell,\mathbb P^{\jmath_E}}(V) - \Risk_{\ell,\mathbb P}(V). }
\Delta_{\mathrm{tr}}^{\min}Use in source · 3 passages
Search aliases: Δ_tr^min Delta mathrm min
Use in source · 07-relational-irreducibility.tex, line 349
declared null Q, define Δ_tr(Q) = Risk_ℓ,Q(V) - Risk_ℓ,P(V). For a finite validated panel Q={Q_1,…,Q_m}⊆ N_pred(P), report both the complete vector Δ_tr( Q) = ( Δ_tr(Q_1),…, Δ_tr(Q_m) ) and the robust panel minimum Δ_tr^min( Q) = min_Q∈ QΔ_tr(Q). The panel must be fixed independently of the observed favorable gap. Otherwise null selection can manufacture apparent relational dependence.
Exact mathematical passage
\Delta_{\mathrm{tr}}^{\min}(\mathcal Q) = \min_{Q\in\mathcal Q}\Delta_{\mathrm{tr}}(Q).
\Delta_{\{i\}}^{\ell}Use in source · 1 passage
Search aliases: Δ_{i}^ℓ Delta ell
Use in source · 07-relational-irreducibility.tex, line 86
Define the coalition gap Δ_A^ℓ = Risk_ℓ(A)-Risk_ℓ(V) ≥0. The node-level joint advantage is Δ_joint^ℓ = min_i∈ V Δ_{i}^ℓ. Under logarithmic loss, Δ_joint^log = min_i∈ V I ( Y_t^+; H_t mid H_t^{i} ). Therefore Δ_joint^log>0 means that every individual component omits some predictive information available to the complete system.
Exact mathematical passage
\boxed{ \Delta_{\mathrm{joint}}^{\ell} = \min_{i\in V} \Delta_{\{i\}}^{\ell}. }
\delta_\rhoUse in source · 6 passages
Search aliases: δ_ρ delta rho
Use in source · 12-identity-through-time-and-replacement.tex, line 207
Write A=ρ_V(a), A'=ρ_V'(a), and define δ_ρ(a)= A'J_V-J_VA , ℓ_a= (I-P)AP . Let A_ W=PAP, A_ W''=P'A'P'.
Exact mathematical passage
\delta_\rho(a)=\|A'J_V-J_VA\|, \qquad \ell_a=\|(I-P)AP\|.
\epsilonUse in source · 6 passages
Search aliases: ϵ epsilon
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 885
[Causal repair stabilizes maintenance deficit] Let e_t≥0 be the maintenance deficit. Suppose the matched no-repair trajectory satisfies e_t+1^(0) ≤ α e_t+d_t, where d_t≥0 is exogenous damage. Suppose the implemented repair policy has the causal one-step effect e_t+1^(0)-e_t+1 ≥ κ e_t-ϵ_t. Assume 0≤β:=α-κ<1, 0≤ d_t≤overline d, 0≤ϵ_t≤overlineϵ. Then e_t ≤ β^te_0 + frac(overline d+overlineϵ)(1-β^t)1-β, and therefore limsup_t→∞e_t ≤ fracoverline d+overlineϵ1-β. If the admissible deficit is e_max and…
Exact mathematical passage
e_{t+1}^{(0)}-e_{t+1} \geq \kappa e_t-\epsilon_t.
\varepsilon_0Use in source · 2 passages
Search aliases: ε_0 varepsilon
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 68
The notation absorbs lower-bounded and upper-bounded gates into one sign convention. If a causal effect must exceed c_0, then m_q=widehatη-c_0. If a defect must remain below ε_0, then m_q=ε_0-widehatδ. The complete certificate therefore passes exactly when every required signed margin is positive.
Exact mathematical passage
\varepsilon_0
\varepsilon_{\mathrm{align}}Use in source · 3 passages
Search aliases: ε_align varepsilon mathrm
Use in source · 06-dynamic-workspace-theory.tex, line 491
Thus neither low transfer energy nor high predictive performance alone is enough. The combined gate is δ_coh(W_t) ≤ ε_coh, δ_align^ I(W_t) ≤ ε_align.
Exact mathematical passage
\boxed{ \delta_{\mathrm{coh}}(W_t) \leq \varepsilon_{\mathrm{coh}}, \qquad \delta_{\mathrm{align}}^{\mathcal I}(W_t) \leq \varepsilon_{\mathrm{align}}. }
\varepsilon_{\mathrm{coh}}Use in source · 3 passages
Search aliases: ε_coh varepsilon mathrm
Use in source · 06-dynamic-workspace-theory.tex, line 491
Thus neither low transfer energy nor high predictive performance alone is enough. The combined gate is δ_coh(W_t) ≤ ε_coh, δ_align^ I(W_t) ≤ ε_align.
Exact mathematical passage
\boxed{ \delta_{\mathrm{coh}}(W_t) \leq \varepsilon_{\mathrm{coh}}, \qquad \delta_{\mathrm{align}}^{\mathcal I}(W_t) \leq \varepsilon_{\mathrm{align}}. }
\varepsilon_{\mathrm{ctl}}Use in source · 2 passages
Search aliases: ε_ctl varepsilon mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1028
Let Θ_A = ( τ_G, τ_G→ A, ε_Q, τ_V→ A, τ_A→ Y, τ_D→ M, τ_M→ R, τ_R→ v, τ_spec, ε_ctl, e_max ). A Θ_A-certified workspace agent is a controlled realization for which: item SRW(W_t;ς)=1; item cue-controlled goal retention exceeds τ_G; item goal-to-action mediation exceeds τ_G→ A; item counterfactual-value error is at most ε_Q; item value-to-action use exceeds τ_V→ A; item action-to-outcome control exceeds τ_A→ Y; item damage detection, monitor-to-repair mediation, and restoration exceed their thres…
Exact mathematical passage
\Theta_A = \left( \tau_G, \tau_{G\to A}, \varepsilon_Q, \tau_{V\to A}, \tau_{A\to Y}, \tau_{D\to M}, \tau_{M\to R}, \tau_{R\to v}, \tau_{\mathrm{spec}}, \varepsilon_{\mathrm{ctl}}, e_{\max} \right).
\varepsilon_{\mathrm{id}}Use in source · 2 passages
Search aliases: ε_id varepsilon mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 859
Restoration of performance is not automatically restoration of identity. Let W_t^- be the last certified pre-damage workspace and let W_t+τ^r be the post-repair workspace. Define the repair identity defect δ_rep-id(r) = d_id ( W_t^-,W_t+τ^r ). A repair action is identity preserving at tolerance ε_id when Δ_t^rep(r;d)>0, δ_rep-id(r) ≤ ε_id. When integrity is restored but the identity defect exceeds tolerance, the result is better described as a successor or replacement workspace. This terminologi…
Exact mathematical passage
\varepsilon_{\mathrm{id}}
\varepsilon_{\mathrm{int}}Use in source · 1 passage
Search aliases: ε_int varepsilon mathrm
Use in source · 02-static-core-transfer-theory.tex, line 390
a bounded generating family G⊆ A, define η_int( G) = sup_a∈ G ∑_e∈ Ew_e Ξ_e(a) ^2. When A is normed and its unit ball is appropriate, one may take G={a: a _ A≤1}. Exact representational universality means η_int=0, while approximate universality means η_int≤ε_int. The use of a generating family prevents the definition from depending on an unbounded rescaling of algebra elements.
Exact mathematical passage
\eta_{\mathrm{int}}\leq\varepsilon_{\mathrm{int}}.
\varepsilon_kUse in source · 2 passages
Search aliases: ε_k varepsilon
Use in source · 09-formal-workspace-definition.tex, line 8
Let Θ = ( ε_coh, ε_align, ε_k, underlineη_c, underlineη_loop, δ_node, δ_null, δ_spec, k, ε_pers ). Let ς = ( D,Y^+,ℓ,τ, I, Q,Θ) be the complete declared scientific specification, where Q⊆ N_pred(P) is a validated null panel. A dynamic realization contains a certified stratified relational workspace when there exists a candidate W_t satisfying all gates required for the claimed level under ς. The detailed robustness and identifiability requirements for varying ς are developed in Parts~XVII and XV…
Exact mathematical passage
\Theta = \left( \varepsilon_{\mathrm{coh}}, \varepsilon_{\mathrm{align}}, \varepsilon_k, \underline\eta_c, \underline\eta_{\mathrm{loop}}, \delta_{\mathrm{node}}, \delta_{\mathrm{null}}, \delta_{\mathrm{spec}}, k, \varepsilon_{\mathrm{pers}} \right).
\varepsilon_{\mathrm{leak}}Use in source · 1 passage
Search aliases: ε_leak varepsilon mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 356
For thresholds Θ_form, define Form_Θ_form(W)=1 only when all applicable gates pass: · e_q^MDL≥ τ_q^MDL, · · e_q^causal≥ τ_q^causal, · δ_q^scaf≤ε_q^scaf, · · δ^leak≤ε_leak, · SRW_Θ(W)=1, · · Pass(N_form)=1. The final workspace gate is included because endogenous discovery of an unstable or causally irrelevant pattern is not endogenous workspace formation.
Exact mathematical passage
\begin{aligned} & e_q^{\mathrm{MDL}}\geq \tau_q^{\mathrm{MDL}}, && e_q^{\mathrm{causal}}\geq \tau_q^{\mathrm{causal}},\\ & \delta_q^{\mathrm{scaf}}\leq\varepsilon_q^{\mathrm{scaf}}, && \delta^{\mathrm{leak}}\leq\varepsilon_{\mathrm{leak}},\\ & \operatorname{SRW}_{\Theta}(W)=1, && \operatorname{Pass}(N_{\mathrm{form}})=1. \end{aligned}
\varepsilon_nUse in source · 3 passages
Search aliases: ε_n varepsilon
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 821
sigma) = frac1n∑_i=1^nZ_i,q,ς-θ_q,ς, 0≤ Z_i,q,ς≤1, from independent certification units. Hoeffding's inequality and a union bound give P( sup_q,ς | widehat m_q(ς)-m_q(ς) | > sqrt frac log(2| J_*|| S|/δ) 2n ) ≤δ. Thus the choice ε_n(δ) = sqrt frac log(2| J_*|| S|/δ) 2n yields an explicit conservative certificate. Dependent episodes require a bound appropriate to the true independent unit rather than token-level or edge-level pseudo-replication.
Exact mathematical passage
\boxed{ \varepsilon_n(\delta) = \sqrt{ \frac{ \log\bigl(2|\mathcal J_*||\mathfrak S|/\delta\bigr) }{2n} } }
\varepsilon_{\mathrm{op}}Use in source · 1 passage
Search aliases: ε_op varepsilon mathrm
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 41
For a one-parameter family R_λ, define λ_str · = inf{λ: d_ε(λ)>0, g_ε(λ)>0}, λ_op · = inf{λ: δ_align(λ) ≤ε_op}, λ_causal · = inf{λ: η_causal(λ) ≥τ_causal}, λ_rel · = inf{λ: k_ε(λ)≥2, Δ_tr(λ) ≥τ_tr}, λ_form · = inf{λ: Form_Θ_form (W_λ)=1}. In general, λ_str, λ_op, λ_causal, λ_rel, λ_form can be distinct. A synchronized representation can appear before it becomes causally useful, and causal coordination can appear while remaining reducible to one centralized component.
Exact mathematical passage
\begin{aligned} \lambda_{\mathrm{str}} &= \inf\{\lambda: d_{\varepsilon}(\lambda)>0, g_{\varepsilon}(\lambda)>0\},\\ \lambda_{\mathrm{op}} &= \inf\{\lambda: \delta_{\mathrm{align}}(\lambda) \leq\varepsilon_{\mathrm{op}}\},\\ \lambda_{\mathrm{causal}} &= \inf\{\lambda: \eta_{\mathrm{causal}}(\lambda) \geq\tau_{\mathrm{causal}}\},\\ \lambda_{\mathrm{rel}} &= \inf\{\lambda: k_\varepsilon(\lambda)\geq2, \Delta_{\mathrm{tr}}(\lambda) \geq\tau_{\mathrm{tr}}\},\\ \lambda_{\mathrm{form}} &= \inf\{\lambda: \operatorname{Form}_{\Theta_{\mathrm{form}}} (W_\lambda)=1\}. \end{aligned}
\varepsilon_{\mathrm{pers}}Use in source · 2 passages
Search aliases: ε_pers varepsilon mathrm
Use in source · 09-formal-workspace-definition.tex, line 8
Let Θ = ( ε_coh, ε_align, ε_k, underlineη_c, underlineη_loop, δ_node, δ_null, δ_spec, k, ε_pers ). Let ς = ( D,Y^+,ℓ,τ, I, Q,Θ) be the complete declared scientific specification, where Q⊆ N_pred(P) is a validated null panel. A dynamic realization contains a certified stratified relational workspace when there exists a candidate W_t satisfying all gates required for the claimed level under ς. The detailed robustness and identifiability requirements for varying ς are developed in Parts~XVII and XV…
Exact mathematical passage
\Theta = \left( \varepsilon_{\mathrm{coh}}, \varepsilon_{\mathrm{align}}, \varepsilon_k, \underline\eta_c, \underline\eta_{\mathrm{loop}}, \delta_{\mathrm{node}}, \delta_{\mathrm{null}}, \delta_{\mathrm{spec}}, k, \varepsilon_{\mathrm{pers}} \right).
\varepsilon_QUse in source · 19 passages
Search aliases: ε_Q varepsilon
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 515
[Approximate counterfactual policy selection] Let A be a finite feasible action set. Let Q: A→ R be the true interventional value and let widehat Q satisfy sup_a∈ A|widehat Q(a)-Q(a)|≤ε_Q. Suppose a policy widehatπ is δ_opt-optimal for widehat Q: max_π E_a∼π[widehat Q(a)] - E_a∼widehatπ[widehat Q(a)] ≤ δ_opt. Then, for every true-value-optimal policy π^*, E_a∼π^*[Q(a)] - E_a∼widehatπ[Q(a)] ≤ 2ε_Q+δ_opt. For a deterministic greedy action widehat a∈argmax_awidehat Q(a), Q(a^*)-Q(widehat a) ≤2ε_Q. …
Exact mathematical passage
\sup_{a\in\mathcal A}|\widehat Q(a)-Q(a)|\leq\varepsilon_Q.
\varepsilon_qUse in source · 4 passages
Search aliases: ε_q varepsilon
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 725
Let widehat m_q(ς) estimate m_q(W;ς). Suppose there are nonnegative error radii ε_q(n,δ) such that P( sup_ς∈ S | widehat m_q(ς)-m_q(ς) | ≤ ε_q(n,δ) for all q∈ J_* ) ≥1-δ. Define the empirical lower confidence envelope widehatunderline m_q,1-δ^ S = inf_ς∈ S widehat m_q(ς) - ε_q(n,δ).
Exact mathematical passage
\varepsilon_q(n,\delta)
\varepsilon_{q,n,\eta}Use in source · 1 passage
Search aliases: ε_q,n,η varepsilon eta
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 851
,d_ S) with covering number N(η, S,d_ S). If both the population and empirical margin functions are L_q-Lipschitz, then sup_ς∈ S |widehat m_q(ς)-m_q(ς)| ≤ max_ς_j∈ S_η |widehat m_q(ς_j)-m_q(ς_j)| +2L_qη. For bounded empirical means, a valid radius is therefore ε_q,n,η(δ) = sqrt frac log(2| J_*| N(η, S,d_ S)/δ) 2n +2L_qη. The tuning parameter η balances net cardinality against interpolation error. More refined empirical-process bounds may replace this elementary covering argument without changing…
Exact mathematical passage
\boxed{ \varepsilon_{q,n,\eta}(\delta) = \sqrt{ \frac{ \log\bigl(2|\mathcal J_*| N(\eta,\mathfrak S,d_{\mathfrak S})/\delta\bigr) }{2n} } +2L_q\eta. }
\varepsilon_q^{\mathrm{scaf}}Use in source · 1 passage
Search aliases: ε_q^scaf varepsilon mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 356
For thresholds Θ_form, define Form_Θ_form(W)=1 only when all applicable gates pass: · e_q^MDL≥ τ_q^MDL, · · e_q^causal≥ τ_q^causal, · δ_q^scaf≤ε_q^scaf, · · δ^leak≤ε_leak, · SRW_Θ(W)=1, · · Pass(N_form)=1. The final workspace gate is included because endogenous discovery of an unstable or causally irrelevant pattern is not endogenous workspace formation.
Exact mathematical passage
\begin{aligned} & e_q^{\mathrm{MDL}}\geq \tau_q^{\mathrm{MDL}}, && e_q^{\mathrm{causal}}\geq \tau_q^{\mathrm{causal}},\\ & \delta_q^{\mathrm{scaf}}\leq\varepsilon_q^{\mathrm{scaf}}, && \delta^{\mathrm{leak}}\leq\varepsilon_{\mathrm{leak}},\\ & \operatorname{SRW}_{\Theta}(W)=1, && \operatorname{Pass}(N_{\mathrm{form}})=1. \end{aligned}
\varepsilon_RUse in source · 9 passages
Search aliases: ε_R varepsilon
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 796
[Repair selection under value-model error] Fix a damage intervention d and a finite feasible repair set R. Let V(r)=V_t^rep(r;d) be the true expected post-repair integrity margin and let widehat V obey sup_r∈ R|widehat V(r)-V(r)| ≤ ε_R. Let widehat r∈argmax_rwidehat V(r) and r^*∈argmax_r V(r). Then V(r^*)-V(widehat r) ≤ 2ε_R. If V(r^*) ≥ ρ+2ε_R, then the selected repair restores the expected reserve: V(widehat r)≥ρ. If r^* is unique and its repair-value gap exceeds 2ε_R, then widehat r=r^*.
Exact mathematical passage
\sup_{r\in\mathcal R}|\widehat V(r)-V(r)| \leq \varepsilon_R.
\varepsilon_rUse in source · 4 passages
Search aliases: ε_r varepsilon
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1020
At level r, let K_r be the corresponding total descent operator, γ_r = λ_min^+(K_r^*K_r), K_ru_r ≤ε_r. The nearest exact compatible state then differs from u_r by at most fracε_rsqrtγ_r. Allow an additional implementation, compression, or causal-summary defect ζ_r, and define δ_r = fracε_rsqrtγ_r + ζ_r.
Exact mathematical passage
\gamma_r = \lambda_{\min}^+(K_r^*K_r), \qquad \|K_ru_r\|\leq\varepsilon_r.
\epsilon_tUse in source · 6 passages
Search aliases: ϵ_t epsilon
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 885
[Causal repair stabilizes maintenance deficit] Let e_t≥0 be the maintenance deficit. Suppose the matched no-repair trajectory satisfies e_t+1^(0) ≤ α e_t+d_t, where d_t≥0 is exogenous damage. Suppose the implemented repair policy has the causal one-step effect e_t+1^(0)-e_t+1 ≥ κ e_t-ϵ_t. Assume 0≤β:=α-κ<1, 0≤ d_t≤overline d, 0≤ϵ_t≤overlineϵ. Then e_t ≤ β^te_0 + frac(overline d+overlineϵ)(1-β^t)1-β, and therefore limsup_t→∞e_t ≤ fracoverline d+overlineϵ1-β. If the admissible deficit is e_max and…
Exact mathematical passage
e_{t+1}^{(0)}-e_{t+1} \geq \kappa e_t-\epsilon_t.
\varepsilon_tUse in source · 9 passages
Search aliases: ε_t varepsilon
Use in source · 06-dynamic-workspace-theory.tex, line 81
Let c(t)=(c_i(t))_i∈ V ∈ C_V(t), P_t= 1_[0,ε_t](L_t). The instantaneous structural workspace coordinate is W_t^str=P_tc(t) ∈ Γ_ε_t(H(t)). When P_t varies with time, these coordinates inhabit a moving family of subspaces. Parts~X--XII will supply the transport required to compare them across time. In what follows, all sufficiency and intervention statements are made at a fixed decision time t.
Exact mathematical passage
c(t)=(c_i(t))_{i\in V} \in \mathcal C_V(t), \qquad P_t=\mathbf 1_{[0,\varepsilon_t]}(L_t).
\zeta_{s+1}Use in source · 2 passages
Search aliases: ζ_s+1 zeta
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 319
[Cue-controlled goal retention] Let G_s∈ R^d_G obey G_s+1 = R_sG_s+B_sC_s+1+ζ_s+1 (s=t,…,t+τ-1). Consider two intervention runs that set G_t=g, G_t'=g', and then use the same command trajectory and the same disturbance realization. Let R_t+τ:t = R_t+τ-1⋯ R_t. Then G_t+τ-G_t+τ' = R_t+τ:t(g-g'). If m_s ≤ σ_min(R_s), R_s ≤ M_s, then ( ∏_s=t^t+τ-1m_s ) g-g' ≤ G_t+τ-G_t+τ' ≤ ( ∏_s=t^t+τ-1M_s ) g-g' .
Exact mathematical passage
G_{s+1} = R_sG_s+B_sC_{s+1}+\zeta_{s+1} \qquad (s=t,\ldots,t+\tau-1).
\eta_AUse in source · 2 passages
Search aliases: η_A eta
Use in source · 11-reconstruction-and-resilience.tex, line 258
[Uniform erasure resilience] The encoding family is exactly reconstructible after every loss of at most k nodes if and only if α^(k)>0. If surviving observations have the form y_V∖ A=A_V∖ Ac+η_A, |A|≤ k, then the canonical survivor decoder obeys the uniform estimate widehat c_A-c ≤ frac η_A sqrtα^(k).
Exact mathematical passage
y_{V\setminus A}=A_{V\setminus A}c+\eta_A, \qquad |A|\leq k,
\eta_{\mathrm{causal}}Use in source · 3 passages
Search aliases: η_causal eta mathrm
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 41
For a one-parameter family R_λ, define λ_str · = inf{λ: d_ε(λ)>0, g_ε(λ)>0}, λ_op · = inf{λ: δ_align(λ) ≤ε_op}, λ_causal · = inf{λ: η_causal(λ) ≥τ_causal}, λ_rel · = inf{λ: k_ε(λ)≥2, Δ_tr(λ) ≥τ_tr}, λ_form · = inf{λ: Form_Θ_form (W_λ)=1}. In general, λ_str, λ_op, λ_causal, λ_rel, λ_form can be distinct. A synchronized representation can appear before it becomes causally useful, and causal coordination can appear while remaining reducible to one centralized component.
Exact mathematical passage
\begin{aligned} \lambda_{\mathrm{str}} &= \inf\{\lambda: d_{\varepsilon}(\lambda)>0, g_{\varepsilon}(\lambda)>0\},\\ \lambda_{\mathrm{op}} &= \inf\{\lambda: \delta_{\mathrm{align}}(\lambda) \leq\varepsilon_{\mathrm{op}}\},\\ \lambda_{\mathrm{causal}} &= \inf\{\lambda: \eta_{\mathrm{causal}}(\lambda) \geq\tau_{\mathrm{causal}}\},\\ \lambda_{\mathrm{rel}} &= \inf\{\lambda: k_\varepsilon(\lambda)\geq2, \Delta_{\mathrm{tr}}(\lambda) \geq\tau_{\mathrm{tr}}\},\\ \lambda_{\mathrm{form}} &= \inf\{\lambda: \operatorname{Form}_{\Theta_{\mathrm{form}}} (W_\lambda)=1\}. \end{aligned}
\eta_{\mathrm{causal},t}Use in source · 1 passage
Search aliases: η_causal,t eta mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
\eta_{\mathrm{causal}}^{\max}Use in source · 1 passage
Search aliases: η_causal^max eta mathrm max
Use in source · 08-causal-efficacy-and-reentry.tex, line 70
ility laws. For a matched background value b, define CE_Workspace(w,w';b) = D ( P^ι_w(Y_t^+∈·mid B_t=b), P^ι_w'(Y_t^+∈·mid B_t=b) ). For a declared comparison design ν over (w,w',b), define η_causal^ν = E_(w,w',b)∼ν [ CE_Workspace(w,w';b) ]. The maximum η_causal^max = sup_w,w',bCE_Workspace(w,w';b) may be useful for discovery, but a design-weighted effect is harder to inflate by selecting a single exceptional pair after inspection.
Exact mathematical passage
\eta_{\mathrm{causal}}^{\max} = \sup_{w,w',b}\CE_{\Workspace}(w,w';b)
\eta_{\mathrm{causal}}^\nuUse in source · 5 passages
Search aliases: η_causal^ν eta mathrm nu
Use in source · 08-causal-efficacy-and-reentry.tex, line 378
The resulting certification report is C_dyn(W_t) =( · δ_align^ I, {Δ_A^ℓ}_A⊆ V, k_ε, Δ_tr( Q), · η_causal^ν, Δ_specific(r), η_rec(τ), η_loop(τ) ). No single coordinate certifies a relational workspace.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal C_{\mathrm{dyn}}(W_t) =\bigl(& \delta_{\mathrm{align}}^{\mathcal I}, \{\Delta_A^\ell\}_{A\subseteq V}, k_\varepsilon, \boldsymbol\Delta_{\mathrm{tr}}(\mathcal Q),\\ &\eta_{\mathrm{causal}}^\nu, \Delta_{\mathrm{specific}}(r), \eta_{\mathrm{rec}}(\tau), \eta_{\mathrm{loop}}(\tau) \bigr). \end{aligned} }
\eta_{\mathrm{causal}}^{\nu}Use in source · 2 passages
Search aliases: η_causal^ν eta mathrm nu
Use in source · 08-causal-efficacy-and-reentry.tex, line 59
Let D be a divergence or metric on probability laws. For a matched background value b, define CE_Workspace(w,w';b) = D ( P^ι_w(Y_t^+∈·mid B_t=b), P^ι_w'(Y_t^+∈·mid B_t=b) ). For a declared comparison design ν over (w,w',b), define η_causal^ν = E_(w,w',b)∼ν [ CE_Workspace(w,w';b) ]. The maximum η_causal^max = sup_w,w',bCE_Workspace(w,w';b) may be useful for discovery, but a design-weighted effect is harder to inflate by selecting a single exceptional pair after inspection.
Exact mathematical passage
\boxed{ \eta_{\mathrm{causal}}^{\nu} = \mathbb E_{(w,w',b)\sim\nu} \left[ \CE_{\Workspace}(w,w';b) \right]. }
\eta_HUse in source · 2 passages
Search aliases: η_H eta
Use in source · 04-approximate-workspaces.tex, line 534
[Edgewise stability certificate] If η_H=2 D_H δ_H+δ_H^2 <fracg_d2, then P_d(H)-P_d(widetilde H) ≤ fracη_Hg_d-η_H.
Exact mathematical passage
\eta_H=2\|D_H\|\delta_H+\delta_H^2 <\frac{g_d}{2},
\eta_{\mathrm{int}}Use in source · 4 passages
Search aliases: η_int eta mathrm
Use in source · 02-static-core-transfer-theory.tex, line 375
The edgewise defect is Ξ_e(a) = H_eρ_s(e)(a)-ρ_t(e)(a)H_e. For a bounded generating family G⊆ A, define η_int( G) = sup_a∈ G ∑_e∈ Ew_e Ξ_e(a) ^2. When A is normed and its unit ball is appropriate, one may take G={a: a _ A≤1}. Exact representational universality means η_int=0, while approximate universality means η_int≤ε_int. The use of a generating family prevents the definition from depending on an unbounded rescaling of algebra elements.
Exact mathematical passage
\eta_{\mathrm{int}}(\mathcal G) = \sup_{a\in\mathcal G} \sum_{e\in E}w_e\|\Xi_e(a)\|^2.
\eta_LUse in source · 9 passages
Search aliases: η_L eta
Use in source · 12-identity-through-time-and-replacement.tex, line 115
The corresponding carried-Laplacian defect obeys η_L := J_V^*L'J_V-L ≤ 2 D δ_D+δ_D^2. This is Proposition~[source reference] with the time indices removed.
Exact mathematical passage
\boxed{ \eta_L := \|J_V^*L'J_V-L\| \leq 2\|D\|\delta_D+\delta_D^2. }
\eta_{R_\perp\to v}Use in source · 1 passage
Search aliases: η_R_⊥→ v eta perp to
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 777
Define the detection effect η_D→ M, mediation effect η_M→ R, restoration effect η_R→ v, and repair specificity Δ_repair^spec = η_R→ v - η_R_⊥→ v, where R_⊥ is a matched action outside the proposed repair channel.
Exact mathematical passage
\Delta_{\mathrm{repair}}^{\mathrm{spec}} = \eta_{R\to v} - \eta_{R_\perp\to v},
\eta_{\mathrm{rec}}Use in source · 4 passages
Search aliases: η_rec eta mathrm
Use in source · 08-causal-efficacy-and-reentry.tex, line 193
Temporal correlation is weaker than causal recurrence. Define the total workspace recurrence effect at lag τ by η_rec(τ) = E_(w,w',b)∼ν D ( P^ι_w(W_t+τ∈·mid B_t=b), P^ι_w'(W_t+τ∈·mid B_t=b) ). A nonzero value shows that manipulating the present workspace changes a later workspace state. It may, however, be explained by direct copying or a retained memory register.
Exact mathematical passage
\boxed{ \eta_{\mathrm{rec}}(\tau) = \mathbb E_{(w,w',b)\sim\nu} D\!\left( \mathbb P^{\iota_w}(W_{t+\tau}\in\cdot\mid B_t=b), \mathbb P^{\iota_{w'}}(W_{t+\tau}\in\cdot\mid B_t=b) \right). }
\eta_SUse in source · 2 passages
Search aliases: η_S eta
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 335
The full frame operator is F_PCN=E_P^*E_P+E_C^*E_C+E_N^*E_N=2I_3. For every two-node coalition S, λ_min(F_S)=1. Thus every two-node coalition reconstructs the complete core and, for noisy observations y_S=A_Sc+η_S, widehat c-c ≤ η_S . No individual node reconstructs c, because rank(E_P) = rank(E_C) = rank(E_N) =2<3. The realization is therefore simultaneously: individually incomplete and robust to any one-node loss.
Exact mathematical passage
y_S=A_Sc+\eta_S
\eta_t^LUse in source · 3 passages
Search aliases: η_t^L eta
Use in source · 10-persistence.tex, line 93
Let P_t project onto a selected rank-d low-energy workspace cluster of L_t, and set W_t=ran P_t. Write g_t=λ_d+1(L_t)-λ_d(L_t)>0 for the separating spectral gap and η_t^L=2 D_t δ_t^D+(δ_t^D)^2.
Exact mathematical passage
\eta_t^L=2\|D_t\|\delta_t^D+(\delta_t^D)^2.
\eta_{\Workspace}Use in source · 2 passages
Search aliases: η_Workspace eta Workspace
Use in source · 08-causal-efficacy-and-reentry.tex, line 117
Define η_Workspace(r) = E_ι,ι'∼ I_Workspace(r) D ( P^ι(Y_t^+), P^ι'(Y_t^+) ), η_⊥(r) = E_jmath,jmath'∼ I_⊥(r) D ( P^jmath(Y_t^+), P^jmath'(Y_t^+) ), and Δ_specific(r) = η_Workspace(r)-η_⊥(r). A positive value supports causal concentration in the candidate workspace at the declared perturbation scale.
Exact mathematical passage
\eta_{\Workspace}(r) = \mathbb E_{\iota,\iota'\sim\mathcal I_{\Workspace}(r)} D\!\left( \mathbb P^{\iota}(Y_t^+), \mathbb P^{\iota'}(Y_t^+) \right),
\eta_{W\to A}Use in source · 2 passages
Search aliases: η_W→ A eta to
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 214
Goal-dependent action mediation is measured by feasible interventions on the goal channel while matching the current workspace and external context. For a divergence D_A, define η_G→ A = sup_g,g',w,e D_A ( P(A_t∈·midι_g,w,e), P(A_t∈·midι_g',w,e) ). Workspace-dependent action mediation is η_W→ A = sup_w,w',g,e D_A ( P(A_t∈·midι_w,g,e), P(A_t∈·midι_w',g,e) ). An action must also alter the declared future: η_A→ Y = sup_a,a',b D_Y ( P(Y_t^+∈·midι_a,b), P(Y_t^+∈·midι_a',b) ). A positive η_G→ A withou…
Exact mathematical passage
\eta_{W\to A} = \sup_{w,w',g,e} D_A \left( \mathbb P(A_t\in\cdot\mid\iota_w,g,e), \mathbb P(A_t\in\cdot\mid\iota_{w'},g,e) \right).
\eta_{\perp}Use in source · 2 passages
Search aliases: η_⊥ eta perp
Use in source · 08-causal-efficacy-and-reentry.tex, line 126
Define η_Workspace(r) = E_ι,ι'∼ I_Workspace(r) D ( P^ι(Y_t^+), P^ι'(Y_t^+) ), η_⊥(r) = E_jmath,jmath'∼ I_⊥(r) D ( P^jmath(Y_t^+), P^jmath'(Y_t^+) ), and Δ_specific(r) = η_Workspace(r)-η_⊥(r). A positive value supports causal concentration in the candidate workspace at the declared perturbation scale.
Exact mathematical passage
\eta_{\perp}(r) = \mathbb E_{\jmath,\jmath'\sim\mathcal I_{\perp}(r)} D\!\left( \mathbb P^{\jmath}(Y_t^+), \mathbb P^{\jmath'}(Y_t^+) \right),
\thetaUse in source · 18 passages
Search aliases: θ theta
Use in source · 03-exact-shared-cores.tex, line 315
[Local compatibility without a global nonzero core] Let the only nontrivial cycle holonomy on R^2 be a rotation R_θ= cosθ · -sinθ sinθ · cosθ with θ∉2π Z. Then ker(R_θ-I)={0}. Every edge map is individually invertible and well-defined, yet the complete cycle admits no nonzero exact shared core. Pairwise translatability is therefore insufficient for global path independence.
Exact mathematical passage
R_\theta= \begin{pmatrix} \cos\theta&-\sin\theta\\ \sin\theta&\cos\theta \end{pmatrix}
\varthetaUse in source · 3 passages
Search aliases: ϑ vartheta
Use in source · 15-boundary-formation-and-stability.tex, line 280
If the score depends on a parameter ϑ_t and satisfies sup_S | B_ϑ(S)- B_ϑ'(S)| ≤ L_Bd(ϑ,ϑ'), then the sufficient stability condition becomes 2L_Bd(ϑ_t,ϑ_t+1) < Δ_t^B.
Exact mathematical passage
\vartheta_t
\Theta'Use in source · 1 passage
Search aliases: Θ' Theta
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
\vartheta'Use in source · 1 passage
Search aliases: ϑ' vartheta
Use in source · 15-boundary-formation-and-stability.tex, line 281
If the score depends on a parameter ϑ_t and satisfies sup_S | B_ϑ(S)- B_ϑ'(S)| ≤ L_Bd(ϑ,ϑ'), then the sufficient stability condition becomes 2L_Bd(ϑ_t,ϑ_t+1) < Δ_t^B.
Exact mathematical passage
\sup_S |\mathcal B_{\vartheta}(S)-\mathcal B_{\vartheta'}(S)| \leq L_Bd(\vartheta,\vartheta'),
\theta_*Use in source · 9 passages
Search aliases: θ_* theta
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 602
[Uniform structure-selection recovery] Let T be a finite candidate family with population score J: T→ R. Let θ_* = argmin_θ∈ TJ(θ) be unique, with margin Δ_J = min_θ≠θ_* (J(θ)-J(θ_*))>0. If a held-out estimate widehat J satisfies sup_θ∈ T |widehat J(θ)-J(θ)| ≤ε, then every empirical minimizer widehatθ obeys J(widehatθ)-J(θ_*) ≤2ε. If 2ε<Δ_J, then widehatθ=θ_*.
Exact mathematical passage
\theta_* = \argmin_{\theta\in\mathfrak T}J(\theta)
\Theta_AUse in source · 5 passages
Search aliases: Θ_A Theta
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1028
Let Θ_A = ( τ_G, τ_G→ A, ε_Q, τ_V→ A, τ_A→ Y, τ_D→ M, τ_M→ R, τ_R→ v, τ_spec, ε_ctl, e_max ). A Θ_A-certified workspace agent is a controlled realization for which: item SRW(W_t;ς)=1; item cue-controlled goal retention exceeds τ_G; item goal-to-action mediation exceeds τ_G→ A; item counterfactual-value error is at most ε_Q; item value-to-action use exceeds τ_V→ A; item action-to-outcome control exceeds τ_A→ Y; item damage detection, monitor-to-repair mediation, and restoration exceed their thres…
Exact mathematical passage
\Theta_A = \left( \tau_G, \tau_{G\to A}, \varepsilon_Q, \tau_{V\to A}, \tau_{A\to Y}, \tau_{D\to M}, \tau_{M\to R}, \tau_{R\to v}, \tau_{\mathrm{spec}}, \varepsilon_{\mathrm{ctl}}, e_{\max} \right).
\Theta_{\mathrm{form}}Use in source · 6 passages
Search aliases: Θ_form Theta mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 351
For thresholds Θ_form, define Form_Θ_form(W)=1 only when all applicable gates pass: · e_q^MDL≥ τ_q^MDL, · · e_q^causal≥ τ_q^causal,
Exact mathematical passage
\Theta_{\mathrm{form}}
\theta_{q,\varsigma}Use in source · 1 passage
Search aliases: θ_q,ς theta varsigma
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 797
Suppose S and J_* are finite, and each margin is estimated as widehat m_q(ς) = frac1n∑_i=1^nZ_i,q,ς-θ_q,ς, 0≤ Z_i,q,ς≤1, from independent certification units. Hoeffding's inequality and a union bound give P( sup_q,ς | widehat m_q(ς)-m_q(ς) | > sqrt frac log(2| J_*|| S|/δ) 2n ) ≤δ. Thus the choice ε_n(δ) = sqrt frac log(2| J_*|| S|/δ) 2n yields an explicit conservative certificate. Dependent episodes require a bound appropriate to the true independent unit rather than token-level or edge-level ps…
Exact mathematical passage
\widehat m_q(\varsigma) = \frac1n\sum_{i=1}^nZ_{i,q,\varsigma}-\theta_{q,\varsigma}, \qquad 0\leq Z_{i,q,\varsigma}\leq1,
\Theta_SUse in source · 1 passage
Search aliases: Θ_S Theta
Use in source · 15-boundary-formation-and-stability.tex, line 134
S, define Coh(S) = tr ( P_S,dL_SP_S,d ), where P_S,d projects onto the selected low-energy workspace modes. Let Cut(S) = ∑_e:s(e)∈ S, t(e)∉ Sw_e + ∑_e:s(e)∉ S, t(e)∈ Sw_e. Let k_ε(S) be the minimal sufficient coalition size inside the candidate subsystem. A candidate is admissible only if SRW_Θ_S(W_S)=1, k_ε(S)≥2, unless the claim explicitly concerns a centralized workspace.
Exact mathematical passage
\operatorname{SRW}_{\Theta_S}(W_S)=1, \qquad k_\varepsilon(S)\geq2,
\theta_tUse in source · 3 passages
Search aliases: θ_t theta
Use in source · 10-persistence.tex, line 408
Let C_V(t)= R^2 and let P_t project onto u_t=(cosθ_t,sinθ_t). If U_t^V is rotation through θ_t+1-θ_t and F_t=U_t^V, then a state x_t=u_t obeys e_t=e_t+1=0, μ_t^keep=1. The workspace changes raw coordinates but not abstract identity. If instead F_t=I, then e_t+1 = |sin(θ_t+1-θ_t)|. The same structural motion now produces a state-tracking defect because the actual update fails to transport the content with the workspace.
Exact mathematical passage
u_t=(\cos\theta_t,\sin\theta_t).
\vartheta_tUse in source · 2 passages
Search aliases: ϑ_t vartheta
Use in source · 15-boundary-formation-and-stability.tex, line 280
If the score depends on a parameter ϑ_t and satisfies sup_S | B_ϑ(S)- B_ϑ'(S)| ≤ L_Bd(ϑ,ϑ'), then the sufficient stability condition becomes 2L_Bd(ϑ_t,ϑ_t+1) < Δ_t^B.
Exact mathematical passage
\vartheta_t
\theta_{t+1}Use in source · 2 passages
Search aliases: θ_t+1 theta
Use in source · 10-persistence.tex, line 412
Let C_V(t)= R^2 and let P_t project onto u_t=(cosθ_t,sinθ_t). If U_t^V is rotation through θ_t+1-θ_t and F_t=U_t^V, then a state x_t=u_t obeys e_t=e_t+1=0, μ_t^keep=1. The workspace changes raw coordinates but not abstract identity. If instead F_t=I, then e_t+1 = |sin(θ_t+1-θ_t)|. The same structural motion now produces a state-tracking defect because the actual update fails to transport the content with the workspace.
Exact mathematical passage
\theta_{t+1}-\theta_t
\vartheta_{t+1}Use in source · 1 passage
Search aliases: ϑ_t+1 vartheta
Use in source · 15-boundary-formation-and-stability.tex, line 288
If the score depends on a parameter ϑ_t and satisfies sup_S | B_ϑ(S)- B_ϑ'(S)| ≤ L_Bd(ϑ,ϑ'), then the sufficient stability condition becomes 2L_Bd(ϑ_t,ϑ_t+1) < Δ_t^B.
Exact mathematical passage
2L_Bd(\vartheta_t,\vartheta_{t+1}) < \Delta_t^B.
\iota'Use in source · 1 passage
Search aliases: ι' iota
Use in source · 08-causal-efficacy-and-reentry.tex, line 117
Define η_Workspace(r) = E_ι,ι'∼ I_Workspace(r) D ( P^ι(Y_t^+), P^ι'(Y_t^+) ), η_⊥(r) = E_jmath,jmath'∼ I_⊥(r) D ( P^jmath(Y_t^+), P^jmath'(Y_t^+) ), and Δ_specific(r) = η_Workspace(r)-η_⊥(r). A positive value supports causal concentration in the candidate workspace at the declared perturbation scale.
Exact mathematical passage
\eta_{\Workspace}(r) = \mathbb E_{\iota,\iota'\sim\mathcal I_{\Workspace}(r)} D\!\left( \mathbb P^{\iota}(Y_t^+), \mathbb P^{\iota'}(Y_t^+) \right),
\iota_{a'}Use in source · 1 passage
Search aliases: ι_a' iota
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 225
. For a divergence D_A, define η_G→ A = sup_g,g',w,e D_A ( P(A_t∈·midι_g,w,e), P(A_t∈·midι_g',w,e) ). Workspace-dependent action mediation is η_W→ A = sup_w,w',g,e D_A ( P(A_t∈·midι_w,g,e), P(A_t∈·midι_w',g,e) ). An action must also alter the declared future: η_A→ Y = sup_a,a',b D_Y ( P(Y_t^+∈·midι_a,b), P(Y_t^+∈·midι_a',b) ). A positive η_G→ A without η_A→ Y describes goal-sensitive output selection with no demonstrated control of the relevant environment. A positive η_A→ Y without a goal or co…
Exact mathematical passage
\eta_{A\to Y} = \sup_{a,a',b} D_Y \left( \mathbb P(Y_t^+\in\cdot\mid\iota_a,b), \mathbb P(Y_t^+\in\cdot\mid\iota_{a'},b) \right).
\iota_{\bar S,u}Use in source · 1 passage
Search aliases: ι_bar S,u iota bar
Use in source · 15-boundary-formation-and-stability.tex, line 95
nate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general. A useful workspace may receive substantial external input. The boundary object…
Exact mathematical passage
\boxed{ \CIn_\tau(S) = \mathbb E_{u,u'\sim\nu_{\bar S}} D\!\left( \mathcal L^{\iota_{\bar S,u}} (X_S(t+\tau)), \mathcal L^{\iota_{\bar S,u'}} (X_S(t+\tau)) \right). }
\iota_{\bar S,u'}Use in source · 1 passage
Search aliases: ι_bar S,u' iota bar
Use in source · 15-boundary-formation-and-stability.tex, line 95
nate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general. A useful workspace may receive substantial external input. The boundary object…
Exact mathematical passage
\boxed{ \CIn_\tau(S) = \mathbb E_{u,u'\sim\nu_{\bar S}} D\!\left( \mathcal L^{\iota_{\bar S,u}} (X_S(t+\tau)), \mathcal L^{\iota_{\bar S,u'}} (X_S(t+\tau)) \right). }
\iota_{g(w)}'Use in source · 1 passage
Search aliases: ι_g(w)' iota
Use in source · 08-causal-efficacy-and-reentry.tex, line 82
[Coordinate invariance of intervention effects] Let g: W_t→ W_t' be a measurable bijection and suppose the reparametrized intervention family satisfies ι_g(w)'=ι_w. Then every divergence-based causal effect is preserved: CE_Workspace'(g(w),g(w');b) = CE_Workspace(w,w';b).
Exact mathematical passage
\iota_{g(w)}'=\iota_w.
\iota_i^CUse in source · 1 passage
Search aliases: ι_i^C iota
Use in source · 04-approximate-workspaces.tex, line 685
Let a path have vertices i_0xrightarrowe_1i_1xrightarrowe_2⋯ xrightarrowe_mi_m. Write T_r=T_e_r, H_r=H_e_r, V_r=V_e_r, and let ι_i^C:C_i↪ X_i, ι_i^R:R_i↪ X_i be the canonical inclusions. Empty products below are identities.
Exact mathematical passage
\iota_i^C:C_i\hookrightarrow X_i, \qquad \iota_i^R:R_i\hookrightarrow X_i
\iota_i^RUse in source · 1 passage
Search aliases: ι_i^R iota
Use in source · 04-approximate-workspaces.tex, line 685
Let a path have vertices i_0xrightarrowe_1i_1xrightarrowe_2⋯ xrightarrowe_mi_m. Write T_r=T_e_r, H_r=H_e_r, V_r=V_e_r, and let ι_i^C:C_i↪ X_i, ι_i^R:R_i↪ X_i be the canonical inclusions. Empty products below are identities.
Exact mathematical passage
\iota_i^C:C_i\hookrightarrow X_i, \qquad \iota_i^R:R_i\hookrightarrow X_i
\iota_{i_0}^CUse in source · 1 passage
Search aliases: ι_i_0^C iota
Use in source · 04-approximate-workspaces.tex, line 694
[Pathwise core--residual Duhamel formula] The deviation of full path transport from pure core transport is exactly · T_m⋯ T_1ι_i_0^C - ι_i_m^C H_m⋯ H_1 · = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r
Exact mathematical passage
\boxed{ \begin{aligned} &T_m\cdots T_1\iota_{i_0}^C - \iota_{i_m}^C H_m\cdots H_1\\ &\qquad= \sum_{r=1}^{m} T_m\cdots T_{r+1} \iota_{i_r}^R V_r H_{r-1}\cdots H_1. \end{aligned} }
\iota_{i_m}^CUse in source · 1 passage
Search aliases: ι_i_m^C iota
Use in source · 04-approximate-workspaces.tex, line 694
[Pathwise core--residual Duhamel formula] The deviation of full path transport from pure core transport is exactly · T_m⋯ T_1ι_i_0^C - ι_i_m^C H_m⋯ H_1 · = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r
Exact mathematical passage
\boxed{ \begin{aligned} &T_m\cdots T_1\iota_{i_0}^C - \iota_{i_m}^C H_m\cdots H_1\\ &\qquad= \sum_{r=1}^{m} T_m\cdots T_{r+1} \iota_{i_r}^R V_r H_{r-1}\cdots H_1. \end{aligned} }
\iota_{i_{r-1}}^CUse in source · 1 passage
Search aliases: ι_i_r-1^C iota
Use in source · 04-approximate-workspaces.tex, line 730
For every step, T_rι_i_r-1^C = ι_i_r^CH_r+ ι_i_r^RV_r. Telescope the sequence T_m⋯ T_r+1ι_i_r^C H_r⋯ H_1, r=0,1,…,m. The difference between consecutive terms is exactly the r-th summand in the displayed formula. Projection onto R_i_m or C_i_m, followed by submultiplicativity of the operator norm, gives the two bounds.
Exact mathematical passage
T_r\iota_{i_{r-1}}^C = \iota_{i_r}^CH_r+ \iota_{i_r}^RV_r.
\iota_{i_r}^CUse in source · 2 passages
Search aliases: ι_i_r^C iota
Use in source · 04-approximate-workspaces.tex, line 730
For every step, T_rι_i_r-1^C = ι_i_r^CH_r+ ι_i_r^RV_r. Telescope the sequence T_m⋯ T_r+1ι_i_r^C H_r⋯ H_1, r=0,1,…,m. The difference between consecutive terms is exactly the r-th summand in the displayed formula. Projection onto R_i_m or C_i_m, followed by submultiplicativity of the operator norm, gives the two bounds.
Exact mathematical passage
T_r\iota_{i_{r-1}}^C = \iota_{i_r}^CH_r+ \iota_{i_r}^RV_r.
\iota_{i_r}^RUse in source · 2 passages
Search aliases: ι_i_r^R iota
Use in source · 04-approximate-workspaces.tex, line 694
[Pathwise core--residual Duhamel formula] The deviation of full path transport from pure core transport is exactly · T_m⋯ T_1ι_i_0^C - ι_i_m^C H_m⋯ H_1 · = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r
Exact mathematical passage
\boxed{ \begin{aligned} &T_m\cdots T_1\iota_{i_0}^C - \iota_{i_m}^C H_m\cdots H_1\\ &\qquad= \sum_{r=1}^{m} T_m\cdots T_{r+1} \iota_{i_r}^R V_r H_{r-1}\cdots H_1. \end{aligned} }
\iota_{q\leftarrow a}Use in source · 1 passage
Search aliases: ι_q← a iota leftarrow
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 401
A feasible statement intervention must alter both local realizations of the statement coordinate: ι_q← a: (q_P,q_N)←(a,a), while holding (p,f) fixed. For configurations with fixed p and f, changing a flips the downstream decision with total-variation effect one: TV ( P(Ymidι_q←0), P(Ymidι_q←1) ) =1. A matched intervention on a residual notebook-format coordinate leaves Y unchanged. Thus the core intervention has positive causal specificity in this model.
Exact mathematical passage
\iota_{q\leftarrow a}: (q_P,q_N)\leftarrow(a,a),
\iota_{q\leftarrow0}Use in source · 1 passage
Search aliases: ι_q←0 iota leftarrow
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 407
A feasible statement intervention must alter both local realizations of the statement coordinate: ι_q← a: (q_P,q_N)←(a,a), while holding (p,f) fixed. For configurations with fixed p and f, changing a flips the downstream decision with total-variation effect one: TV ( P(Ymidι_q←0), P(Ymidι_q←1) ) =1. A matched intervention on a residual notebook-format coordinate leaves Y unchanged. Thus the core intervention has positive causal specificity in this model.
Exact mathematical passage
\TV \left( P(Y\mid\iota_{q\leftarrow0}), P(Y\mid\iota_{q\leftarrow1}) \right) =1.
\iota_{q\leftarrow1}Use in source · 1 passage
Search aliases: ι_q←1 iota leftarrow
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 407
A feasible statement intervention must alter both local realizations of the statement coordinate: ι_q← a: (q_P,q_N)←(a,a), while holding (p,f) fixed. For configurations with fixed p and f, changing a flips the downstream decision with total-variation effect one: TV ( P(Ymidι_q←0), P(Ymidι_q←1) ) =1. A matched intervention on a residual notebook-format coordinate leaves Y unchanged. Thus the core intervention has positive causal specificity in this model.
Exact mathematical passage
\TV \left( P(Y\mid\iota_{q\leftarrow0}), P(Y\mid\iota_{q\leftarrow1}) \right) =1.
\iota_{S,x}Use in source · 2 passages
Search aliases: ι_S,x iota
Use in source · 15-boundary-formation-and-stability.tex, line 77
Let ι_S,x be a feasible intervention that changes the internal workspace coordinate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general.…
Exact mathematical passage
\iota_{S,x}
\iota_{S,x'}Use in source · 1 passage
Search aliases: ι_S,x' iota
Use in source · 15-boundary-formation-and-stability.tex, line 80
Let ι_S,x be a feasible intervention that changes the internal workspace coordinate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general.…
Exact mathematical passage
\boxed{ \COut_\tau(S) = \mathbb E_{x,x'\sim\nu_S} D\!\left( \mathcal L^{\iota_{S,x}} (X_{\bar S}(t+\tau)), \mathcal L^{\iota_{S,x'}} (X_{\bar S}(t+\tau)) \right). }
\kappaUse in source · 14 passages
Search aliases: κ kappa
Use in source · 11-reconstruction-and-resilience.tex, line 95
The lower frame bound α_S measures recoverability. The upper bound β_S measures amplification in the forward encoding. Their ratio κ_S=sqrtfracβ_Sα_S is the coalition condition number.
Exact mathematical passage
\kappa_S=\sqrt{\frac{\beta_S}{\alpha_S}}
\kappa_qUse in source · 3 passages
Search aliases: κ_q kappa
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 872
A robust procedure can be valid yet uninformative when the family is too large or the data are insufficient. Each gate should therefore report an indifference region [-κ_q,κ_q]. A conclusion is: item[Robust pass] when the lower confidence envelope exceeds κ_q for every gate. item[Robust fail] when a required gate's upper confidence envelope is below -κ_q throughout the relevant family. item[Specification conflict] when well-estimated admissible specifications lie on opposite sides of the indiffe…
Exact mathematical passage
[-\kappa_q,\kappa_q]
\kappa_SUse in source · 1 passage
Search aliases: κ_S kappa
Use in source · 11-reconstruction-and-resilience.tex, line 95
The lower frame bound α_S measures recoverability. The upper bound β_S measures amplification in the forward encoding. Their ratio κ_S=sqrtfracβ_Sα_S is the coalition condition number.
Exact mathematical passage
\kappa_S=\sqrt{\frac{\beta_S}{\alpha_S}}
\lambda^3Use in source · 3 passages
Search aliases: λ^3 lambda
Use in source · 19-summary-of-main-results.tex, line 401
For m_t+1=tanh(λ m_t), there is a unique zero fixed point for 0≤λ≤1. For λ>1, the zero state is unstable and exactly two stable nonzero fixed points appear. Their amplitude satisfies m_λ = sqrtfrac3(λ-1)λ^3 + O((λ-1)^3/2). This is an exact structural benchmark, not a universal law for complete relational workspaces.
Exact mathematical passage
\boxed{ m_\lambda = \sqrt{\frac{3(\lambda-1)}{\lambda^3}} + O\bigl((\lambda-1)^{3/2}\bigr). }
\lambda_+Use in source · 3 passages
Search aliases: λ_+ lambda
Use in source · 04-approximate-workspaces.tex, line 381
-(a+b) · b^2+1 . Writing τ=a^2+b^2+2, the eigenvalues are λ_± = frac12 ( τ±sqrtτ^2-4(ab-1)^2 ), and det L_H=(ab-1)^2. Thus a nonzero exact shared core exists precisely when ab=1, which is exactly the trivial-holonomy condition. Away from exact consistency, λ_-λ_+=(ab-1)^2. When |ab-1| is small while λ_+ stays bounded away from zero, the soft workspace eigenvalue is quadratic in the cycle mismatch: λ_- = frac(ab-1)^2λ_+. This example connects approximate spectral coherence directly to approximate…
Exact mathematical passage
\lambda_-\lambda_+=(ab-1)^2.
\lambda_-Use in source · 2 passages
Search aliases: λ_- lambda
Use in source · 04-approximate-workspaces.tex, line 381
-(a+b) · b^2+1 . Writing τ=a^2+b^2+2, the eigenvalues are λ_± = frac12 ( τ±sqrtτ^2-4(ab-1)^2 ), and det L_H=(ab-1)^2. Thus a nonzero exact shared core exists precisely when ab=1, which is exactly the trivial-holonomy condition. Away from exact consistency, λ_-λ_+=(ab-1)^2. When |ab-1| is small while λ_+ stays bounded away from zero, the soft workspace eigenvalue is quadratic in the cycle mismatch: λ_- = frac(ab-1)^2λ_+. This example connects approximate spectral coherence directly to approximate…
Exact mathematical passage
\lambda_-\lambda_+=(ab-1)^2.
\lambda_cUse in source · 8 passages
Search aliases: λ_c lambda
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 7
The symbolic outline proposed a coupling threshold λ_c. A general theory must first state what is allowed to vary with λ. A threshold may concern structural coherence, causal efficacy, relational irreducibility, or the conjunction of all certification gates. These need not occur at the same parameter value.
Exact mathematical passage
\lambda_c
\lambda_{\mathrm{causal}}Use in source · 2 passages
Search aliases: λ_causal lambda mathrm
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 41
For a one-parameter family R_λ, define λ_str · = inf{λ: d_ε(λ)>0, g_ε(λ)>0}, λ_op · = inf{λ: δ_align(λ) ≤ε_op}, λ_causal · = inf{λ: η_causal(λ) ≥τ_causal}, λ_rel · = inf{λ: k_ε(λ)≥2, Δ_tr(λ) ≥τ_tr}, λ_form · = inf{λ: Form_Θ_form (W_λ)=1}. In general, λ_str, λ_op, λ_causal, λ_rel, λ_form can be distinct. A synchronized representation can appear before it becomes causally useful, and causal coordination can appear while remaining reducible to one centralized component.
Exact mathematical passage
\begin{aligned} \lambda_{\mathrm{str}} &= \inf\{\lambda: d_{\varepsilon}(\lambda)>0, g_{\varepsilon}(\lambda)>0\},\\ \lambda_{\mathrm{op}} &= \inf\{\lambda: \delta_{\mathrm{align}}(\lambda) \leq\varepsilon_{\mathrm{op}}\},\\ \lambda_{\mathrm{causal}} &= \inf\{\lambda: \eta_{\mathrm{causal}}(\lambda) \geq\tau_{\mathrm{causal}}\},\\ \lambda_{\mathrm{rel}} &= \inf\{\lambda: k_\varepsilon(\lambda)\geq2, \Delta_{\mathrm{tr}}(\lambda) \geq\tau_{\mathrm{tr}}\},\\ \lambda_{\mathrm{form}} &= \inf\{\lambda: \operatorname{Form}_{\Theta_{\mathrm{form}}} (W_\lambda)=1\}. \end{aligned}
\lambda_{\mathrm{coh}}Use in source · 1 passage
Search aliases: λ_coh lambda mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 395
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1 · + λ_stab J_stab + λ_leak J_leak }. The objective is schematic rather than universal. Its purpose is to expose which quantities were fixed and which were optimized. If z and …
Exact mathematical passage
\boxed{ \begin{aligned} \widehat\theta \in \argmin_{z,a,H,P,\mathcal O,B} \Bigl \{& \widehat{\mathcal R}_{\mathrm{task}} + \lambda_{\mathrm{coh}}\|D_{a,H}c\|^2 + \lambda_E\|a\|_1 + \lambda_V\|z\|_1\\ &+ \lambda_{\mathrm{stab}}\mathcal J_{\mathrm{stab}} + \lambda_{\mathrm{leak}}\mathcal J_{\mathrm{leak}} \Bigr\}. \end{aligned} }
\lambda_EUse in source · 1 passage
Search aliases: λ_E lambda
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 395
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1 · + λ_stab J_stab + λ_leak J_leak }. The objective is schematic rather than universal. Its purpose is to expose which quantities were fixed and which were optimized. If z and …
Exact mathematical passage
\boxed{ \begin{aligned} \widehat\theta \in \argmin_{z,a,H,P,\mathcal O,B} \Bigl \{& \widehat{\mathcal R}_{\mathrm{task}} + \lambda_{\mathrm{coh}}\|D_{a,H}c\|^2 + \lambda_E\|a\|_1 + \lambda_V\|z\|_1\\ &+ \lambda_{\mathrm{stab}}\mathcal J_{\mathrm{stab}} + \lambda_{\mathrm{leak}}\mathcal J_{\mathrm{leak}} \Bigr\}. \end{aligned} }
\lambda_e^{\mathrm{in}}Use in source · 1 passage
Search aliases: λ_e^in lambda mathrm
Use in source · 02-static-core-transfer-theory.tex, line 183
Core leakage, residual contamination, and total transfer defect are measured by λ_e^out= V_e , λ_e^in= U_e , δ_e^tr = U_e + V_e . These quantities depend on the chosen norms and projectors. Their empirical meaning must therefore be tied to a declared intervention and prediction protocol.
Exact mathematical passage
\lambda_e^{\mathrm{out}}=\|V_e\|, \qquad \lambda_e^{\mathrm{in}}=\|U_e\|,
\lambda_e^{\mathrm{out}}Use in source · 1 passage
Search aliases: λ_e^out lambda mathrm
Use in source · 02-static-core-transfer-theory.tex, line 183
Core leakage, residual contamination, and total transfer defect are measured by λ_e^out= V_e , λ_e^in= U_e , δ_e^tr = U_e + V_e . These quantities depend on the chosen norms and projectors. Their empirical meaning must therefore be tied to a declared intervention and prediction protocol.
Exact mathematical passage
\lambda_e^{\mathrm{out}}=\|V_e\|, \qquad \lambda_e^{\mathrm{in}}=\|U_e\|,
\lambda_{\mathrm{form}}Use in source · 2 passages
Search aliases: λ_form lambda mathrm
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 41
For a one-parameter family R_λ, define λ_str · = inf{λ: d_ε(λ)>0, g_ε(λ)>0}, λ_op · = inf{λ: δ_align(λ) ≤ε_op}, λ_causal · = inf{λ: η_causal(λ) ≥τ_causal}, λ_rel · = inf{λ: k_ε(λ)≥2, Δ_tr(λ) ≥τ_tr}, λ_form · = inf{λ: Form_Θ_form (W_λ)=1}. In general, λ_str, λ_op, λ_causal, λ_rel, λ_form can be distinct. A synchronized representation can appear before it becomes causally useful, and causal coordination can appear while remaining reducible to one centralized component.
Exact mathematical passage
\begin{aligned} \lambda_{\mathrm{str}} &= \inf\{\lambda: d_{\varepsilon}(\lambda)>0, g_{\varepsilon}(\lambda)>0\},\\ \lambda_{\mathrm{op}} &= \inf\{\lambda: \delta_{\mathrm{align}}(\lambda) \leq\varepsilon_{\mathrm{op}}\},\\ \lambda_{\mathrm{causal}} &= \inf\{\lambda: \eta_{\mathrm{causal}}(\lambda) \geq\tau_{\mathrm{causal}}\},\\ \lambda_{\mathrm{rel}} &= \inf\{\lambda: k_\varepsilon(\lambda)\geq2, \Delta_{\mathrm{tr}}(\lambda) \geq\tau_{\mathrm{tr}}\},\\ \lambda_{\mathrm{form}} &= \inf\{\lambda: \operatorname{Form}_{\Theta_{\mathrm{form}}} (W_\lambda)=1\}. \end{aligned}
\lambda_{k+1}Use in source · 1 passage
Search aliases: λ_k+1 lambda
Use in source · 04-approximate-workspaces.tex, line 241
The spectrum supports three distinct interpretations: rcl λ_k=0 · Longleftrightarrow · exact compatible direction, 0<λ_kll g_d · Longrightarrow · approximately transported direction, λ_k≈λ_k+1 · Longrightarrow · rank selection is unstable at that boundary. A low eigenvalue can still be scientifically spurious if it arises from a poorly chosen weight, a nearly disconnected graph, or a noncausal encoding. The causal and null gates in later parts remain necessary.
Exact mathematical passage
\begin{array}{rcl} \lambda_k=0 &\Longleftrightarrow& \text{exact compatible direction},\\ 0<\lambda_k\ll g_d &\Longrightarrow& \text{approximately transported direction},\\ \lambda_k\approx\lambda_{k+1} &\Longrightarrow& \text{rank selection is unstable at that boundary}. \end{array}
\lambda_{\mathrm{leak}}Use in source · 1 passage
Search aliases: λ_leak lambda mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 395
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1 · + λ_stab J_stab + λ_leak J_leak }. The objective is schematic rather than universal. Its purpose is to expose which quantities were fixed and which were optimized. If z and …
Exact mathematical passage
\boxed{ \begin{aligned} \widehat\theta \in \argmin_{z,a,H,P,\mathcal O,B} \Bigl \{& \widehat{\mathcal R}_{\mathrm{task}} + \lambda_{\mathrm{coh}}\|D_{a,H}c\|^2 + \lambda_E\|a\|_1 + \lambda_V\|z\|_1\\ &+ \lambda_{\mathrm{stab}}\mathcal J_{\mathrm{stab}} + \lambda_{\mathrm{leak}}\mathcal J_{\mathrm{leak}} \Bigr\}. \end{aligned} }
\lambda_{\max}Use in source · 1 passage
Search aliases: λ_max lambda max
Use in source · 11-reconstruction-and-resilience.tex, line 49
For a coalition S⊆ V, define the analysis operator A_S:C_*⟶⊕_i∈ S Y_i, A_Sc=(E_ic)_i∈ S, and the coalition frame operator F_S=A_S^*A_S=∑_i∈ SE_i^*E_i. Set α_S=λ_min(F_S), β_S=λ_max(F_S). Thus α_S c ^2 ≤ A_Sc ^2 ≤ β_S c ^2.
Exact mathematical passage
\alpha_S=\lambda_{\min}(F_S), \qquad \beta_S=\lambda_{\max}(F_S).
\lambda_{\min}Use in source · 2 passages
Search aliases: λ_min lambda min
Use in source · 11-reconstruction-and-resilience.tex, line 49
For a coalition S⊆ V, define the analysis operator A_S:C_*⟶⊕_i∈ S Y_i, A_Sc=(E_ic)_i∈ S, and the coalition frame operator F_S=A_S^*A_S=∑_i∈ SE_i^*E_i. Set α_S=λ_min(F_S), β_S=λ_max(F_S). Thus α_S c ^2 ≤ A_Sc ^2 ≤ β_S c ^2.
Exact mathematical passage
\alpha_S=\lambda_{\min}(F_S), \qquad \beta_S=\lambda_{\max}(F_S).
\lambda_{\min}^+Use in source · 3 passages
Search aliases: λ_min^+ lambda min
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 508
Let γ_ U^meta = λ_min^+ (L_ U^meta) be the first positive eigenvalue.
Exact mathematical passage
\gamma_{\mathcal U}^{\mathrm{meta}} = \lambda_{\min}^+ \left(L_{\mathcal U}^{\mathrm{meta}}\right)
\Lambda_nUse in source · 2 passages
Search aliases: Λ_n Lambda
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 188
Let Q(λ) be a gate-specific population order parameter and widehat Q_n(λ) its held-out estimate. If sup_λ∈Λ_n |widehat Q_n(λ)-Q(λ)| ≤ε_n on a finite evaluation grid Λ_n, then every threshold crossing with vertical margin larger than 2ε_n is recovered by the same uniform-selection argument as Theorem~[source reference]. Near a continuous transition, the margin vanishes and sample requirements necessarily grow. A broad, slowly varying crossover should not be reported as a sharp phase transition wi…
Exact mathematical passage
\sup_{\lambda\in\Lambda_n} |\widehat Q_n(\lambda)-Q(\lambda)| \leq\varepsilon_n
\lambda_{\mathrm{op}}Use in source · 2 passages
Search aliases: λ_op lambda mathrm
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 41
For a one-parameter family R_λ, define λ_str · = inf{λ: d_ε(λ)>0, g_ε(λ)>0}, λ_op · = inf{λ: δ_align(λ) ≤ε_op}, λ_causal · = inf{λ: η_causal(λ) ≥τ_causal}, λ_rel · = inf{λ: k_ε(λ)≥2, Δ_tr(λ) ≥τ_tr}, λ_form · = inf{λ: Form_Θ_form (W_λ)=1}. In general, λ_str, λ_op, λ_causal, λ_rel, λ_form can be distinct. A synchronized representation can appear before it becomes causally useful, and causal coordination can appear while remaining reducible to one centralized component.
Exact mathematical passage
\begin{aligned} \lambda_{\mathrm{str}} &= \inf\{\lambda: d_{\varepsilon}(\lambda)>0, g_{\varepsilon}(\lambda)>0\},\\ \lambda_{\mathrm{op}} &= \inf\{\lambda: \delta_{\mathrm{align}}(\lambda) \leq\varepsilon_{\mathrm{op}}\},\\ \lambda_{\mathrm{causal}} &= \inf\{\lambda: \eta_{\mathrm{causal}}(\lambda) \geq\tau_{\mathrm{causal}}\},\\ \lambda_{\mathrm{rel}} &= \inf\{\lambda: k_\varepsilon(\lambda)\geq2, \Delta_{\mathrm{tr}}(\lambda) \geq\tau_{\mathrm{tr}}\},\\ \lambda_{\mathrm{form}} &= \inf\{\lambda: \operatorname{Form}_{\Theta_{\mathrm{form}}} (W_\lambda)=1\}. \end{aligned}
\lambda_{\mathrm{ov}}Use in source · 3 passages
Search aliases: λ_ov lambda mathrm
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 576
ha∈ A C_V(G_α) and the block internal discrepancy widehat D_ U = ⊕_α∈ AD_G_α. For u=(u_α)_α∈widehat C_ U, define the raw overlap synchronization operator (S_ Uu)_αβ = ρ_G_αβ^G_βu_β - ρ_G_αβ^G_αu_α. For an overlap weight λ_ov>0, set K_ U = widehat D_ U
Exact mathematical passage
\lambda_{\mathrm{ov}}>0
\lambda_{r+1}Use in source · 1 passage
Search aliases: λ_r+1 lambda
Use in source · 04-approximate-workspaces.tex, line 293
[Coherence-to-core distance estimate] Let W_0=Γ(H)=ker L_H, r=dim W_0, and suppose r<N. Set γ_H=λ_r+1>0. Then every c∈ C_V satisfies dist(c,W_0)^2 ≤ frac E_H(c)γ_H. Moreover, E_H(c) ≤ L_H dist(c,W_0)^2.
Exact mathematical passage
\gamma_H=\lambda_{r+1}>0.
\lambda_{\mathrm{rel}}Use in source · 2 passages
Search aliases: λ_rel lambda mathrm
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 41
For a one-parameter family R_λ, define λ_str · = inf{λ: d_ε(λ)>0, g_ε(λ)>0}, λ_op · = inf{λ: δ_align(λ) ≤ε_op}, λ_causal · = inf{λ: η_causal(λ) ≥τ_causal}, λ_rel · = inf{λ: k_ε(λ)≥2, Δ_tr(λ) ≥τ_tr}, λ_form · = inf{λ: Form_Θ_form (W_λ)=1}. In general, λ_str, λ_op, λ_causal, λ_rel, λ_form can be distinct. A synchronized representation can appear before it becomes causally useful, and causal coordination can appear while remaining reducible to one centralized component.
Exact mathematical passage
\begin{aligned} \lambda_{\mathrm{str}} &= \inf\{\lambda: d_{\varepsilon}(\lambda)>0, g_{\varepsilon}(\lambda)>0\},\\ \lambda_{\mathrm{op}} &= \inf\{\lambda: \delta_{\mathrm{align}}(\lambda) \leq\varepsilon_{\mathrm{op}}\},\\ \lambda_{\mathrm{causal}} &= \inf\{\lambda: \eta_{\mathrm{causal}}(\lambda) \geq\tau_{\mathrm{causal}}\},\\ \lambda_{\mathrm{rel}} &= \inf\{\lambda: k_\varepsilon(\lambda)\geq2, \Delta_{\mathrm{tr}}(\lambda) \geq\tau_{\mathrm{tr}}\},\\ \lambda_{\mathrm{form}} &= \inf\{\lambda: \operatorname{Form}_{\Theta_{\mathrm{form}}} (W_\lambda)=1\}. \end{aligned}
\lambda_{\mathrm{stab}}Use in source · 1 passage
Search aliases: λ_stab lambda mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 395
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1 · + λ_stab J_stab + λ_leak J_leak }. The objective is schematic rather than universal. Its purpose is to expose which quantities were fixed and which were optimized. If z and …
Exact mathematical passage
\boxed{ \begin{aligned} \widehat\theta \in \argmin_{z,a,H,P,\mathcal O,B} \Bigl \{& \widehat{\mathcal R}_{\mathrm{task}} + \lambda_{\mathrm{coh}}\|D_{a,H}c\|^2 + \lambda_E\|a\|_1 + \lambda_V\|z\|_1\\ &+ \lambda_{\mathrm{stab}}\mathcal J_{\mathrm{stab}} + \lambda_{\mathrm{leak}}\mathcal J_{\mathrm{leak}} \Bigr\}. \end{aligned} }
\lambda_{\mathrm{str}}Use in source · 2 passages
Search aliases: λ_str lambda mathrm
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 41
For a one-parameter family R_λ, define λ_str · = inf{λ: d_ε(λ)>0, g_ε(λ)>0}, λ_op · = inf{λ: δ_align(λ) ≤ε_op}, λ_causal · = inf{λ: η_causal(λ) ≥τ_causal}, λ_rel · = inf{λ: k_ε(λ)≥2, Δ_tr(λ) ≥τ_tr}, λ_form · = inf{λ: Form_Θ_form (W_λ)=1}. In general, λ_str, λ_op, λ_causal, λ_rel, λ_form can be distinct. A synchronized representation can appear before it becomes causally useful, and causal coordination can appear while remaining reducible to one centralized component.
Exact mathematical passage
\begin{aligned} \lambda_{\mathrm{str}} &= \inf\{\lambda: d_{\varepsilon}(\lambda)>0, g_{\varepsilon}(\lambda)>0\},\\ \lambda_{\mathrm{op}} &= \inf\{\lambda: \delta_{\mathrm{align}}(\lambda) \leq\varepsilon_{\mathrm{op}}\},\\ \lambda_{\mathrm{causal}} &= \inf\{\lambda: \eta_{\mathrm{causal}}(\lambda) \geq\tau_{\mathrm{causal}}\},\\ \lambda_{\mathrm{rel}} &= \inf\{\lambda: k_\varepsilon(\lambda)\geq2, \Delta_{\mathrm{tr}}(\lambda) \geq\tau_{\mathrm{tr}}\},\\ \lambda_{\mathrm{form}} &= \inf\{\lambda: \operatorname{Form}_{\Theta_{\mathrm{form}}} (W_\lambda)=1\}. \end{aligned}
\lambda_VUse in source · 1 passage
Search aliases: λ_V lambda
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 395
Let z_i∈{0,1}, a_e∈[0,1] be node-membership and edge-activation variables satisfying a_e≤ z_s(e), a_e≤ z_t(e). A weighted learned discrepancy operator is (D_a,Hc)_e = sqrtw_ea_e ( c_t(e)-H_ec_s(e) ). One generic formation objective is widehatθ ∈ argmin_z,a,H,P, O,B { · widehat R_task + λ_coh D_a,Hc ^2 + λ_E a _1 + λ_V z _1 · + λ_stab J_stab + λ_leak J_leak }. The objective is schematic rather than universal. Its purpose is to expose which quantities were fixed and which were optimized. If z and …
Exact mathematical passage
\boxed{ \begin{aligned} \widehat\theta \in \argmin_{z,a,H,P,\mathcal O,B} \Bigl \{& \widehat{\mathcal R}_{\mathrm{task}} + \lambda_{\mathrm{coh}}\|D_{a,H}c\|^2 + \lambda_E\|a\|_1 + \lambda_V\|z\|_1\\ &+ \lambda_{\mathrm{stab}}\mathcal J_{\mathrm{stab}} + \lambda_{\mathrm{leak}}\mathcal J_{\mathrm{leak}} \Bigr\}. \end{aligned} }
\lambda_\pmUse in source · 1 passage
Search aliases: λ_± lambda pm
Use in source · 04-approximate-workspaces.tex, line 364
-(a+b) · b^2+1 . Writing τ=a^2+b^2+2, the eigenvalues are λ_± = frac12 ( τ±sqrtτ^2-4(ab-1)^2 ), and det L_H=(ab-1)^2. Thus a nonzero exact shared core exists precisely when ab=1, which is exactly the trivial-holonomy condition. Away from exact consistency, λ_-λ_+=(ab-1)^2. When |ab-1| is small while λ_+ stays bounded away from zero, the soft workspace eigenvalue is quadratic in the cycle mismatch: λ_- = frac(ab-1)^2λ_+. This example connects approximate spectral coherence directly to approximate…
Exact mathematical passage
\lambda_\pm = \frac{1}{2} \left( \tau\pm\sqrt{\tau^2-4(ab-1)^2} \right),
\muUse in source · 28 passages
Search aliases: μ mu
Use in source · 04-approximate-workspaces.tex, line 423
On ran P and ranwidetilde Q, set A_P=PAP|_ran P, B_Q=widetilde QBwidetilde Q|_ranwidetilde Q. The operator X=Pwidetilde Q satisfies the Sylvester equation A_PX-XB_Q=-PEwidetilde Q. Let μ=(a+b)/2. Since e^t(A_P-μ I) ≤ e^-(b-a)t/2, e^-t(B_Q-μ I) ≤ e^-(b-a)t/2, the inverse Sylvester operator has the convergent integral representation X = ∫_0^∞ e^t(A_P-μ I) (PEwidetilde Q) e^-t(B_Q-μ I) dd t. Taking norms and integrating gives the result.
Exact mathematical passage
\mu=(a+b)/2
\mu^{\mathrm{keep}}Use in source · 4 passages
Search aliases: μ^keep mu mathrm
Use in source · 12-identity-through-time-and-replacement.tex, line 344
For an admissible correspondence J, define the operation defect on a declared unit ball A_1 by δ_op( J) = sup_a∈ A_1 A_ W''β-β A_ W . The primary certification object is the identity profile d_id( J) = ( q_str, δ_op( J), δ_causal(β), δ_rec(β); μ^keep ). The first four coordinates must remain below declared tolerances, while the non-collapse margin μ^keep must remain above a declared lower bound. This vector, rather than a weighted average, determines whether a specific identity claim passes.
Exact mathematical passage
\boxed{ \mathbf d_{\mathrm{id}}(\mathfrak J) = \left( q_{\mathrm{str}}, \delta_{\mathrm{op}}(\mathfrak J), \delta_{\mathrm{causal}}(\beta), \delta_{\mathrm{rec}}(\beta); \mu^{\mathrm{keep}} \right). }
\mu_cUse in source · 1 passage
Search aliases: μ_c mu
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 20
[Threshold values are parameterization dependent] Suppose a model indexed by λ passes a declared formation certificate exactly for λ>λ_c. For every strictly increasing bijection f, the reparameterized family indexed by μ=f(λ) has threshold μ_c=f(λ_c). Consequently, the numerical value of a coupling threshold is not invariant without a physically or operationally fixed parameterization.
Exact mathematical passage
\mu_c=f(\lambda_c).
\mu_t^{\mathrm{keep}}Use in source · 7 passages
Search aliases: μ_t^keep mu mathrm
Use in source · 10-persistence.tex, line 329
Low off-workspace error is not sufficient for meaningful persistence. The zero update F_t=0 drives every state exactly into every linear workspace while destroying all content. Define the internal transport B_t=P_t+1F_tP_t: W_t⟶ W_t+1 and its non-collapse margin μ_t^keep = σ_min(B_t|_ W_t). A content-preserving persistence claim requires μ_t^keep>0 for the relevant interval, or an information-theoretic replacement when the workspace state is stochastic. Structural tracking, state tracking, and c…
Exact mathematical passage
\boxed{ \mu_t^{\mathrm{keep}} = \sigma_{\min}(B_t|_{\mathcal W_t}). }
\nu_{\bar S}Use in source · 1 passage
Search aliases: ν_bar S nu bar
Use in source · 15-boundary-formation-and-stability.tex, line 95
nate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general. A useful workspace may receive substantial external input. The boundary object…
Exact mathematical passage
\boxed{ \CIn_\tau(S) = \mathbb E_{u,u'\sim\nu_{\bar S}} D\!\left( \mathcal L^{\iota_{\bar S,u}} (X_S(t+\tau)), \mathcal L^{\iota_{\bar S,u'}} (X_S(t+\tau)) \right). }
\nu_SUse in source · 1 passage
Search aliases: ν_S nu
Use in source · 15-boundary-formation-and-stability.tex, line 80
Let ι_S,x be a feasible intervention that changes the internal workspace coordinate of S to x while matching background variables and intervention cost. Define outward causal efficacy COut_τ(S) = E_x,x'∼ν_S D ( L^ι_S,x (X_bar S(t+τ)), L^ι_S,x' (X_bar S(t+τ)) ). Define inward causal dependence analogously by intervening on bar S and measuring the future law of X_S: CIn_τ(S) = E_u,u'∼ν_bar S D ( L^ι_bar S,u (X_S(t+τ)), L^ι_bar S,u' (X_S(t+τ)) ). Neither term should be minimized to zero in general.…
Exact mathematical passage
\boxed{ \COut_\tau(S) = \mathbb E_{x,x'\sim\nu_S} D\!\left( \mathcal L^{\iota_{S,x}} (X_{\bar S}(t+\tau)), \mathcal L^{\iota_{S,x'}} (X_{\bar S}(t+\tau)) \right). }
\nu_{\alpha\beta}Use in source · 1 passage
Search aliases: ν_αβ nu alpha beta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 182
A family w=(w_α)_α is exactly compatible when δ^0w=0. Its direct mismatch is m_ U(w)=δ^0w. After choosing inner products and positive overlap weights, the mismatch energy is E_ov(w) = δ^0w ^2 = ∑_α<β ν_αβ r_αβ^βw_β -r_αβ^αw_α ^2. This is the appropriate obstruction when the full local states are already given. Such a family glues exactly if and only if its mismatch vector itself vanishes. No cohomological quotient is needed for that direct question.
Exact mathematical passage
\boxed{ \mathcal E_{\mathrm{ov}}(w) = \|\delta^0w\|^2 = \sum_{\alpha<\beta} \nu_{\alpha\beta} \left\| r_{\alpha\beta}^{\beta}w_\beta -r_{\alpha\beta}^{\alpha}w_\alpha \right\|^2. }
\XiUse in source · 4 passages
Search aliases: Ξ Xi
Use in source · 02-static-core-transfer-theory.tex, line 369
The edgewise defect is Ξ_e(a) = H_eρ_s(e)(a)-ρ_t(e)(a)H_e. For a bounded generating family G⊆ A, define η_int( G) = sup_a∈ G ∑_e∈ Ew_e Ξ_e(a) ^2. When A is normed and its unit ball is appropriate, one may take G={a: a _ A≤1}. Exact representational universality means η_int=0, while approximate universality means η_int≤ε_int. The use of a generating family prevents the definition from depending on an unbounded rescaling of algebra elements.
Exact mathematical passage
\Xi_e(a) = H_e\rho_{s(e)}(a)-\rho_{t(e)}(a)H_e.
\Xi_eUse in source · 4 passages
Search aliases: Ξ_e Xi
Use in source · 02-static-core-transfer-theory.tex, line 369
The edgewise defect is Ξ_e(a) = H_eρ_s(e)(a)-ρ_t(e)(a)H_e. For a bounded generating family G⊆ A, define η_int( G) = sup_a∈ G ∑_e∈ Ew_e Ξ_e(a) ^2. When A is normed and its unit ball is appropriate, one may take G={a: a _ A≤1}. Exact representational universality means η_int=0, while approximate universality means η_int≤ε_int. The use of a generating family prevents the definition from depending on an unbounded rescaling of algebra elements.
Exact mathematical passage
\Xi_e(a) = H_e\rho_{s(e)}(a)-\rho_{t(e)}(a)H_e.
\xi_rUse in source · 1 passage
Search aliases: ξ_r xi
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 513
[Deterministic empirical recovery bound] For samples (X_r,Y_r)_r=1^n, write widehatΣ_XX = frac1n∑_r=1^nX_rX_r^ T, widehat M = frac1n∑_r=1^nξ_rX_r^ T. If widehatΣ_XXsucceqwidehatκ I, then ordinary least squares satisfies widehat H-H_* _F ≤ frac widehat M _Fwidehatκ. For ridge parameter τ>0, widehat H_τ-H_* _F ≤ frac widehat M _F+τ H_* _F widehatκ+τ .
Exact mathematical passage
\widehat\Sigma_{XX} = \frac1n\sum_{r=1}^nX_rX_r^{\mathsf T}, \qquad \widehat M = \frac1n\sum_{r=1}^n\xi_rX_r^{\mathsf T}.
\xi_tUse in source · 4 passages
Search aliases: ξ_t xi
Use in source · 10-persistence.tex, line 131
Let the realized vertex state satisfy x_t+1=F_tx_t+ξ_t, where F_t: C_V(t)→ C_V(t+1) is the actual update and ξ_t is an unmodeled disturbance. Define the off-workspace error e_t= (I-P_t)x_t . Introduce α_t = (I-P_t+1)F_t(I-P_t) , which measures persistence of prior off-workspace error, and ℓ_t = (I-P_t+1)F_tP_t , which measures leakage of a valid workspace state under the update.
Exact mathematical passage
x_{t+1}=F_tx_t+\xi_t,
\xi_{t+1}Use in source · 1 passage
Search aliases: ξ_t+1 xi
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 77
C_t^ctl = ( W_t,G_t,M_t,B_t,E_t ), where G_t is the represented goal, M_t is a workspace-integrity monitor, B_t is the current boundary or routing state, and E_t is the declared external context. An action is generated by A_t ∼ π_t ( ·mid W_t,G_t,M_t,B_t,E_t ). The future controlled state obeys a time-unrolled structural model S_t+1 = F_t(S_t,A_t,E_t+1,ξ_t+1), W_t+1=ω_t+1(S_t+1). The intervention semantics are inherited from Part~VII. A symbol such as do(A_t=a) is meaningful only when an impleme…
Exact mathematical passage
S_{t+1} = F_t(S_t,A_t,E_{t+1},\xi_{t+1}), \qquad W_{t+1}=\omega_{t+1}(S_{t+1}).
\pi^*Use in source · 3 passages
Search aliases: π^* pi
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 528
thbb R be the true interventional value and let widehat Q satisfy sup_a∈ A|widehat Q(a)-Q(a)|≤ε_Q. Suppose a policy widehatπ is δ_opt-optimal for widehat Q: max_π E_a∼π[widehat Q(a)] - E_a∼widehatπ[widehat Q(a)] ≤ δ_opt. Then, for every true-value-optimal policy π^*, E_a∼π^*[Q(a)] - E_a∼widehatπ[Q(a)] ≤ 2ε_Q+δ_opt. For a deterministic greedy action widehat a∈argmax_awidehat Q(a), Q(a^*)-Q(widehat a) ≤2ε_Q. If the true optimal action a^* is unique and its value gap Δ_Q = Q(a^*)- max_a≠ a^*Q(a) sa…
Exact mathematical passage
\pi^*
\pi_1Use in source · 3 passages
Search aliases: π_1 pi
Use in source · 03-exact-shared-cores.tex, line 85
Fix a root o∈ V. For every loop class [γ]∈π_1(|G|,o), define the holonomy Hol([γ])=H_γ∈ GL(C_o). Functoriality gives a group representation hol_o: π_1(|G|,o)⟶ GL(C_o). Its image is the holonomy group Hol_o=im(hol_o).
Exact mathematical passage
[\gamma]\in\pi_1(|G|,o),
\pi_{\Workspace}Use in source · 3 passages
Search aliases: π_Workspace pi Workspace
Use in source · 03-exact-shared-cores.tex, line 438
Pointwise addition, scalar multiplication, and composition make O_Workspace a unital associative algebra. Each A=(A_i) acts on global sections by π_Workspace(A)(c_i)=(A_ic_i). Naturality guarantees that (A_ic_i) is again compatible.
Exact mathematical passage
\pi_{\Workspace}(A)(c_i)=(A_ic_i).
\rho'Use in source · 1 passage
Search aliases: ρ' rho
Use in source · 12-identity-through-time-and-replacement.tex, line 18
Let R=(G, C,D,ρ, I, K) and R'=(G', C',D',ρ', I', K') be two realizations. A correspondence begins with a graph isomorphism φ:G→ G'. After relabeling by φ, let J_i:C_i→ C_i' be unitary local identifications and define J_V=⊕_i∈ VJ_i, J_E=⊕_e∈ EJ_t(e).
Exact mathematical passage
\mathfrak R'=(G',\mathbf C',D',\rho',\mathcal I',\mathcal K')
\rho^{G_\alpha}_{G_{\alpha\beta}}Use in source · 1 passage
Search aliases: ρ^G_α_G_αβ rho alpha alpha beta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 592
[0.2em] sqrtλ_ov S_ U , L_ U^tot = K_ U^*K_ U. Its energy is E_ U^tot(u) = · ∑_α D_G_αu_α ^2 · + λ_ov ∑_α<β ρ^G_β_G_αβu_β - ρ^G_α_G_αβu_α ^2.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal E_{\mathcal U}^{\mathrm{tot}}(u) ={}& \sum_\alpha\|D_{G_\alpha}u_\alpha\|^2\\ &+ \lambda_{\mathrm{ov}} \sum_{\alpha<\beta} \left\| \rho^{G_\beta}_{G_{\alpha\beta}}u_\beta - \rho^{G_\alpha}_{G_{\alpha\beta}}u_\alpha \right\|^2. \end{aligned} }
\rho^{G_\beta}_{G_{\alpha\beta}}Use in source · 1 passage
Search aliases: ρ^G_β_G_αβ rho beta alpha beta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 592
[0.2em] sqrtλ_ov S_ U , L_ U^tot = K_ U^*K_ U. Its energy is E_ U^tot(u) = · ∑_α D_G_αu_α ^2 · + λ_ov ∑_α<β ρ^G_β_G_αβu_β - ρ^G_α_G_αβu_α ^2.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal E_{\mathcal U}^{\mathrm{tot}}(u) ={}& \sum_\alpha\|D_{G_\alpha}u_\alpha\|^2\\ &+ \lambda_{\mathrm{ov}} \sum_{\alpha<\beta} \left\| \rho^{G_\beta}_{G_{\alpha\beta}}u_\beta - \rho^{G_\alpha}_{G_{\alpha\beta}}u_\alpha \right\|^2. \end{aligned} }
\rho_1Use in source · 2 passages
Search aliases: ρ_1 rho
Use in source · 02-static-core-transfer-theory.tex, line 398
[Equivalent operations in different coordinates] Let C_1=C_2= R^2, choose S∈ GL_2( R), and set H_12=S, ρ_2(a)=Sρ_1(a)S^-1. Then H_12ρ_1(a) =Sρ_1(a) =ρ_2(a)S =ρ_2(a)H_12. The local matrices can look different while realizing the same abstract operation. This is the elementary model of representation change used throughout the theory.
Exact mathematical passage
H_{12}=S, \qquad \rho_2(a)=S\rho_1(a)S^{-1}.
\rho_2Use in source · 2 passages
Search aliases: ρ_2 rho
Use in source · 02-static-core-transfer-theory.tex, line 398
[Equivalent operations in different coordinates] Let C_1=C_2= R^2, choose S∈ GL_2( R), and set H_12=S, ρ_2(a)=Sρ_1(a)S^-1. Then H_12ρ_1(a) =Sρ_1(a) =ρ_2(a)S =ρ_2(a)H_12. The local matrices can look different while realizing the same abstract operation. This is the elementary model of representation change used throughout the theory.
Exact mathematical passage
H_{12}=S, \qquad \rho_2(a)=S\rho_1(a)S^{-1}.
\rho_EUse in source · 5 passages
Search aliases: ρ_E rho
Use in source · 04-approximate-workspaces.tex, line 554
Define the vertex and edge direct-sum representations ρ_V(a)=⊕_i∈ Vρ_i(a), ρ_E(a)=⊕_e∈ Eρ_t(e)(a). Lift the edgewise intertwining defects to ( X_a c)_e = sqrtw_e Ξ_e(a)c_s(e). Then the exact commutator identity is D_Hρ_V(a)-ρ_E(a)D_H=- X_a. Furthermore, X_a ≤ β(a), β(a)^2 = max_i∈ V ∑_e:s(e)=iw_e Ξ_e(a) ^2.
Exact mathematical passage
\rho_V(a)=\bigoplus_{i\in V}\rho_i(a), \qquad \rho_E(a)=\bigoplus_{e\in E}\rho_{t(e)}(a).
\rho_{G_{\alpha\beta}}^{G_\alpha}Use in source · 1 passage
Search aliases: ρ_G_αβ^G_α rho alpha beta alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 569
l candidates may also violate their internal transfer equations. Define the local-copy space widehat C_ U = ⊕_α∈ A C_V(G_α) and the block internal discrepancy widehat D_ U = ⊕_α∈ AD_G_α. For u=(u_α)_α∈widehat C_ U, define the raw overlap synchronization operator (S_ Uu)_αβ = ρ_G_αβ^G_βu_β - ρ_G_αβ^G_αu_α. For an overlap weight λ_ov>0, set K_ U = widehat D_ U
Exact mathematical passage
(S_{\mathcal U}u)_{\alpha\beta} = \rho_{G_{\alpha\beta}}^{G_\beta}u_\beta - \rho_{G_{\alpha\beta}}^{G_\alpha}u_\alpha.
\rho_{G_{\alpha\beta}}^{G_\beta}Use in source · 1 passage
Search aliases: ρ_G_αβ^G_β rho alpha beta beta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 569
l candidates may also violate their internal transfer equations. Define the local-copy space widehat C_ U = ⊕_α∈ A C_V(G_α) and the block internal discrepancy widehat D_ U = ⊕_α∈ AD_G_α. For u=(u_α)_α∈widehat C_ U, define the raw overlap synchronization operator (S_ Uu)_αβ = ρ_G_αβ^G_βu_β - ρ_G_αβ^G_αu_α. For an overlap weight λ_ov>0, set K_ U = widehat D_ U
Exact mathematical passage
(S_{\mathcal U}u)_{\alpha\beta} = \rho_{G_{\alpha\beta}}^{G_\beta}u_\beta - \rho_{G_{\alpha\beta}}^{G_\alpha}u_\alpha.
\rho_i^gUse in source · 1 passage
Search aliases: ρ_i^g rho
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 30
For each i∈ V, let g_i∈ GL(C_i), g=(g_i)_i∈ V. Define the vertex and edge direct sums G_V=⊕_i∈ Vg_i, G_E=⊕_e∈ Eg_t(e). The transformed transfers and local operation representations are H_e^g = g_t(e)H_eg_s(e)^-1, ρ_i^g(a) = g_iρ_i(a)g_i^-1. The fundamental covariance identity is D_H^gG_V=G_ED_H. It follows directly by evaluating the e-component: sqrtw_e ( g_t(e)c_t(e) - g_t(e)H_ec_s(e) ).
Exact mathematical passage
\rho_i^g(a) = g_i\rho_i(a)g_i^{-1}.
\rho_kUse in source · 1 passage
Search aliases: ρ_k rho
Use in source · 02-static-core-transfer-theory.tex, line 343
For composable intertwiners H_e:C_i→ C_j and H_f:C_j→ C_k, H_fH_eρ_i(a) =H_fρ_j(a)H_e =ρ_k(a)H_fH_e. Induction over path length proves the claim.
Exact mathematical passage
H_fH_e\rho_i(a) =H_f\rho_j(a)H_e =\rho_k(a)H_fH_e.
\rho_K^LUse in source · 2 passages
Search aliases: ρ_K^L rho
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 65
If K⊆ L⊆ G are subgraphs, coordinate restriction gives ρ_K^L: C_V(L)⟶ C_V(K). Because every edge equation on K is also an edge equation on L, restriction maps exact sections to exact sections: r_K^L := ρ_K^L|_mathscr W(L): mathscr W(L)⟶mathscr W(K). They obey r_L^L=I, r_J^K r_K^L=r_J^L whenever J⊆ K⊆ L. Thus K↦mathscr W(K) is a contravariant system of local workspaces.
Exact mathematical passage
\rho_K^L:\mathcal C_V(L)\longrightarrow\mathcal C_V(K).
\rho_oUse in source · 7 passages
Search aliases: ρ_o rho
Use in source · 02-static-core-transfer-theory.tex, line 353
[Holonomy commutes with abstract operations] For every loop γ:o→ o, H_γρ_o(a)=ρ_o(a)H_γ. Hence ρ_o( A) ⊆ Comm(Hol_o), where Comm(Hol_o) is the commutant of the holonomy representation.
Exact mathematical passage
H_\gamma\rho_o(a)=\rho_o(a)H_\gamma.
\rho_{s(e)}Use in source · 2 passages
Search aliases: ρ_s(e) rho
Use in source · 02-static-core-transfer-theory.tex, line 369
The edgewise defect is Ξ_e(a) = H_eρ_s(e)(a)-ρ_t(e)(a)H_e. For a bounded generating family G⊆ A, define η_int( G) = sup_a∈ G ∑_e∈ Ew_e Ξ_e(a) ^2. When A is normed and its unit ball is appropriate, one may take G={a: a _ A≤1}. Exact representational universality means η_int=0, while approximate universality means η_int≤ε_int. The use of a generating family prevents the definition from depending on an unbounded rescaling of algebra elements.
Exact mathematical passage
\Xi_e(a) = H_e\rho_{s(e)}(a)-\rho_{t(e)}(a)H_e.
\rho_{t(e)}Use in source · 3 passages
Search aliases: ρ_t(e) rho
Use in source · 02-static-core-transfer-theory.tex, line 369
The edgewise defect is Ξ_e(a) = H_eρ_s(e)(a)-ρ_t(e)(a)H_e. For a bounded generating family G⊆ A, define η_int( G) = sup_a∈ G ∑_e∈ Ew_e Ξ_e(a) ^2. When A is normed and its unit ball is appropriate, one may take G={a: a _ A≤1}. Exact representational universality means η_int=0, while approximate universality means η_int≤ε_int. The use of a generating family prevents the definition from depending on an unbounded rescaling of algebra elements.
Exact mathematical passage
\Xi_e(a) = H_e\rho_{s(e)}(a)-\rho_{t(e)}(a)H_e.
\rho_\GammaUse in source · 3 passages
Search aliases: ρ_Γ rho Gamma
Use in source · 03-exact-shared-cores.tex, line 358
[Global operation closure] Suppose every core transfer intertwines the representations of A: H_eρ_s(e)(a)=ρ_t(e)(a)H_e ∀ e∈ E, a∈ A. Then Γ(H) is an A-module under the componentwise action ρ_Γ(a)(c_i)_i∈ V = (ρ_i(a)c_i)_i∈ V. Equivalently, the holonomy-fixed root core is invariant: ρ_o(a)C_*⊆ C_* ∀ a∈ A.
Exact mathematical passage
\rho_\Gamma(a)(c_i)_{i\in V} = (\rho_i(a)c_i)_{i\in V}.
\sigma'Use in source · 2 passages
Search aliases: σ' sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 309
For a family S of admissible scaffold variants, define the cross-scaffold identity defect δ_q^scaf = inf_{J_σσ'} E_σ,σ'∼π d_q ( J_σσ'q_σ,q_σ' ), where J_σσ' transports the learned object between admissible coordinate systems. A low value indicates that the same abstract organization is recovered under multiple non-solution-bearing scaffolds.
Exact mathematical passage
\boxed{ \delta_q^{\mathrm{scaf}} = \inf_{\{J_{\sigma\sigma'}\}} \mathbb E_{\sigma,\sigma'\sim\pi} d_q \left( J_{\sigma\sigma'}q_{\sigma},q_{\sigma'} \right), }
\Sigma^{(1)}Use in source · 1 passage
Search aliases: Σ^(1) Sigma
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 1285
Train the same formation rule under several scaffolds Σ^(1),…,Σ^(K) that differ in node labels, coordinate systems, and communication topology but support the same abstract task. After gauge alignment, measure whether the learned organizations transport to a common equivalence class: [widehat H^(1)]_ G ≅⋯≅ [widehat H^(K)]_ G. A structure that appears only under one answer-encoding scaffold has weak endogeneity evidence. A structure that recurs across alternative scaffolds, passes held-out task a…
Exact mathematical passage
\Sigma^{(1)},\ldots,\Sigma^{(K)}
\Sigma^{(K)}Use in source · 1 passage
Search aliases: Σ^(K) Sigma
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 1285
Train the same formation rule under several scaffolds Σ^(1),…,Σ^(K) that differ in node labels, coordinate systems, and communication topology but support the same abstract task. After gauge alignment, measure whether the learned organizations transport to a common equivalence class: [widehat H^(1)]_ G ≅⋯≅ [widehat H^(K)]_ G. A structure that appears only under one answer-encoding scaffold has weak endogeneity evidence. A structure that recurs across alternative scaffolds, passes held-out task a…
Exact mathematical passage
\Sigma^{(1)},\ldots,\Sigma^{(K)}
\Sigma_{\mathcal O}Use in source · 1 passage
Search aliases: Σ_ O Sigma mathcal
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 57
The scaffold is itself stratified: Σ = ( Σ_V, Σ_E, Σ_H, Σ_P, Σ_ O, Σ_B, Σ_Y ). The final coordinate Σ_Y records labels, targets, privileged masks, or other supervision that could directly reveal the intended workspace. This coordinate is necessary because an architecture may appear to discover a boundary even when the desired membership mask was encoded in its training labels.
Exact mathematical passage
\boxed{ \Sigma = \bigl( \Sigma_V, \Sigma_E, \Sigma_H, \Sigma_P, \Sigma_{\mathcal O}, \Sigma_B, \Sigma_Y \bigr). }
\sigma_0Use in source · 1 passage
Search aliases: σ_0 sigma
Use in source · 10-persistence.tex, line 250
Repeated substitution yields e_t · ≤ α_t-1⋯α_0e_0 + α_t-1⋯α_1σ_0 + ⋯ + σ_t-1, which is the first formula. Under the uniform bounds, dominate each product by the corresponding power of barα and sum the geometric series.
Exact mathematical passage
\begin{aligned} e_t &\leq \alpha_{t-1}\cdots\alpha_0e_0 + \alpha_{t-1}\cdots\alpha_1\sigma_0 + \cdots + \sigma_{t-1}, \end{aligned}
\Sigma_BUse in source · 2 passages
Search aliases: Σ_B Sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 57
The scaffold is itself stratified: Σ = ( Σ_V, Σ_E, Σ_H, Σ_P, Σ_ O, Σ_B, Σ_Y ). The final coordinate Σ_Y records labels, targets, privileged masks, or other supervision that could directly reveal the intended workspace. This coordinate is necessary because an architecture may appear to discover a boundary even when the desired membership mask was encoded in its training labels.
Exact mathematical passage
\boxed{ \Sigma = \bigl( \Sigma_V, \Sigma_E, \Sigma_H, \Sigma_P, \Sigma_{\mathcal O}, \Sigma_B, \Sigma_Y \bigr). }
\Sigma_EUse in source · 1 passage
Search aliases: Σ_E Sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 57
The scaffold is itself stratified: Σ = ( Σ_V, Σ_E, Σ_H, Σ_P, Σ_ O, Σ_B, Σ_Y ). The final coordinate Σ_Y records labels, targets, privileged masks, or other supervision that could directly reveal the intended workspace. This coordinate is necessary because an architecture may appear to discover a boundary even when the desired membership mask was encoded in its training labels.
Exact mathematical passage
\boxed{ \Sigma = \bigl( \Sigma_V, \Sigma_E, \Sigma_H, \Sigma_P, \Sigma_{\mathcal O}, \Sigma_B, \Sigma_Y \bigr). }
\Sigma_HUse in source · 1 passage
Search aliases: Σ_H Sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 57
The scaffold is itself stratified: Σ = ( Σ_V, Σ_E, Σ_H, Σ_P, Σ_ O, Σ_B, Σ_Y ). The final coordinate Σ_Y records labels, targets, privileged masks, or other supervision that could directly reveal the intended workspace. This coordinate is necessary because an architecture may appear to discover a boundary even when the desired membership mask was encoded in its training labels.
Exact mathematical passage
\boxed{ \Sigma = \bigl( \Sigma_V, \Sigma_E, \Sigma_H, \Sigma_P, \Sigma_{\mathcal O}, \Sigma_B, \Sigma_Y \bigr). }
\sigma_iUse in source · 4 passages
Search aliases: σ_i sigma
Use in source · 03-exact-shared-cores.tex, line 203
Conversely, let x∈ C_o^Hol_o. Choose a path τ_i:o→ i for each vertex and define c_i=H_τ_ix. This definition is independent of the chosen path. Indeed, if σ_i:o→ i is another path, then σ_i^-1τ_i:o→ o is a loop, and invariance of x gives H_σ_i^-1H_τ_ix=x. Multiplying by H_σ_i yields H_τ_ix=H_σ_ix. For any edge e:i→ j, the paths eτ_i and τ_j both run from o to j. Path independence therefore gives H_ec_i =H_eH_τ_ix =H_τ_jx =c_j. Thus (c_i) is a global compatible section and ev_o((c_i))=x. Hence ev_…
Exact mathematical passage
\sigma_i:o\to i
\sigma_i^{-1}Use in source · 1 passage
Search aliases: σ_i^-1 sigma
Use in source · 03-exact-shared-cores.tex, line 204
Conversely, let x∈ C_o^Hol_o. Choose a path τ_i:o→ i for each vertex and define c_i=H_τ_ix. This definition is independent of the chosen path. Indeed, if σ_i:o→ i is another path, then σ_i^-1τ_i:o→ o is a loop, and invariance of x gives H_σ_i^-1H_τ_ix=x. Multiplying by H_σ_i yields H_τ_ix=H_σ_ix. For any edge e:i→ j, the paths eτ_i and τ_j both run from o to j. Path independence therefore gives H_ec_i =H_eH_τ_ix =H_τ_jx =c_j. Thus (c_i) is a global compatible section and ev_o((c_i))=x. Hence ev_…
Exact mathematical passage
\sigma_i^{-1}\tau_i:o\to o
\sigma_jUse in source · 2 passages
Search aliases: σ_j sigma
Use in source · 10-persistence.tex, line 210
[Nonautonomous persistence theorem] Let e_t≥0 satisfy e_t+1≤α_te_t+σ_t, α_t,σ_t≥0. Then, for every t≥1, e_t ≤ · (∏_r=0^t-1α_r)e_0 · + ∑_j=0^t-1 (∏_r=j+1^t-1α_r)σ_j, where an empty product equals one. If α_t≤barα<1, σ_t≤barσ, then e_t ≤ barα^te_0 + fracbarσ(1-barα^t)1-barα, and consequently limsup_t→∞e_t ≤ fracbarσ1-barα.
Exact mathematical passage
\boxed{ \begin{aligned} e_t \leq &\left(\prod_{r=0}^{t-1}\alpha_r\right)e_0\\ &+ \sum_{j=0}^{t-1} \left(\prod_{r=j+1}^{t-1}\alpha_r\right)\sigma_j, \end{aligned} }
\varsigma_jUse in source · 1 passage
Search aliases: ς_j varsigma
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 842
Let S_η be an η-net of ( S,d_ S) with covering number N(η, S,d_ S). If both the population and empirical margin functions are L_q-Lipschitz, then sup_ς∈ S |widehat m_q(ς)-m_q(ς)| ≤ max_ς_j∈ S_η |widehat m_q(ς_j)-m_q(ς_j)| +2L_qη. For bounded empirical means, a valid radius is therefore ε_q,n,η(δ) = sqrt frac log(2| J_*| N(η, S,d_ S)/δ) 2n +2L_qη. The tuning parameter η balances net cardinality against interpolation error. More refined empirical-process bounds may replace this elementary covering…
Exact mathematical passage
\sup_{\varsigma\in\mathfrak S} |\widehat m_q(\varsigma)-m_q(\varsigma)| \leq \max_{\varsigma_j\in\mathfrak S_\eta} |\widehat m_q(\varsigma_j)-m_q(\varsigma_j)| +2L_q\eta.
\sigma_kUse in source · 1 passage
Search aliases: σ_k sigma
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 269
For a declared graph, set of core dimensions, weights, and transfer maps, the static analysis can be executed in the following order: item Assemble the sparse block operator D_H from the edge equations sqrtw_e(c_t(e)-H_ec_s(e)). item Compute a singular-value decomposition D_H=UΣ V^*, λ_k(L_H)=σ_k(D_H)^2. Use a declared numerical tolerance to distinguish computational zero modes from positive modes. item Select a candidate rank d only at a reproducible spectral boundary with g_d>0. A large observ…
Exact mathematical passage
D_H=U\Sigma V^*, \qquad \lambda_k(L_H)=\sigma_k(D_H)^2.
\sigma_{\min}Use in source · 9 passages
Search aliases: σ_min sigma min
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 126
For a general invertible gauge, define m_V=σ_min(G_V), M_V= G_V , m_E=σ_min(G_E), M_E= G_E . The covariance identity yields m_E^2 E_H(c) ≤ E_H^g(G_Vc) ≤ M_E^2 E_H(c), and m_V^2 c ^2 ≤ G_Vc ^2 ≤ M_V^2 c ^2. Therefore the Rayleigh quotients obey fracm_E^2M_V^2 frac E_H(c) c ^2 ≤ frac E_H^g(G_Vc) G_Vc ^2 ≤ fracM_E^2m_V^2 frac E_H(c) c ^2. By the min--max principle, fracm_E^2M_V^2λ_k(L_H) ≤ λ_k(L_H^g) ≤ fracM_E^2m_V^2λ_k(L_H). Exact zero modes are unchanged, but fixed-metric approximate eigenvalues …
Exact mathematical passage
m_V=\sigma_{\min}(G_V), \qquad M_V=\|G_V\|,
\Sigma_PUse in source · 1 passage
Search aliases: Σ_P Sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 57
The scaffold is itself stratified: Σ = ( Σ_V, Σ_E, Σ_H, Σ_P, Σ_ O, Σ_B, Σ_Y ). The final coordinate Σ_Y records labels, targets, privileged masks, or other supervision that could directly reveal the intended workspace. This coordinate is necessary because an architecture may appear to discover a boundary even when the desired membership mask was encoded in its training labels.
Exact mathematical passage
\boxed{ \Sigma = \bigl( \Sigma_V, \Sigma_E, \Sigma_H, \Sigma_P, \Sigma_{\mathcal O}, \Sigma_B, \Sigma_Y \bigr). }
\sigma_tUse in source · 12 passages
Search aliases: σ_t sigma
Use in source · 10-persistence.tex, line 161
[Grounded coherence recurrence] Every trajectory satisfies e_t+1≤α_te_t+σ_t, where σ_t = ℓ_t P_tx_t + (I-P_t+1)ξ_t .
Exact mathematical passage
\boxed{ e_{t+1}\leq\alpha_te_t+\sigma_t,}
\sigma_{t-1}Use in source · 1 passage
Search aliases: σ_t-1 sigma
Use in source · 10-persistence.tex, line 250
Repeated substitution yields e_t · ≤ α_t-1⋯α_0e_0 + α_t-1⋯α_1σ_0 + ⋯ + σ_t-1, which is the first formula. Under the uniform bounds, dominate each product by the corresponding power of barα and sum the geometric series.
Exact mathematical passage
\begin{aligned} e_t &\leq \alpha_{t-1}\cdots\alpha_0e_0 + \alpha_{t-1}\cdots\alpha_1\sigma_0 + \cdots + \sigma_{t-1}, \end{aligned}
\Sigma_VUse in source · 1 passage
Search aliases: Σ_V Sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 57
The scaffold is itself stratified: Σ = ( Σ_V, Σ_E, Σ_H, Σ_P, Σ_ O, Σ_B, Σ_Y ). The final coordinate Σ_Y records labels, targets, privileged masks, or other supervision that could directly reveal the intended workspace. This coordinate is necessary because an architecture may appear to discover a boundary even when the desired membership mask was encoded in its training labels.
Exact mathematical passage
\boxed{ \Sigma = \bigl( \Sigma_V, \Sigma_E, \Sigma_H, \Sigma_P, \Sigma_{\mathcal O}, \Sigma_B, \Sigma_Y \bigr). }
\Sigma_{X'X'}Use in source · 1 passage
Search aliases: Σ_X'X' Sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 578
The transformed covariances are Σ_Y'X'=g_vΣ_YXg_u^ T, Σ_X'X'=g_uΣ_XXg_u^ T. Substitution into the covariance formula and inversion of the second factor give the result.
Exact mathematical passage
\Sigma_{Y'X'}=g_v\Sigma_{YX}g_u^{\mathsf T}, \qquad \Sigma_{X'X'}=g_u\Sigma_{XX}g_u^{\mathsf T}.
\Sigma_{XX}Use in source · 6 passages
Search aliases: Σ_XX Sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 459
[Population transfer identification] Let X∈ R^d_u and Y∈ R^d_v satisfy Y=H_*X+ξ, E[ξ X^ T]=0, and assume Σ_XX = E[XX^ T] succeq κ I for some κ>0. Then H_* is the unique minimizer of R(H) = E Y-HX _2^2, with H_* = Σ_YXΣ_XX^-1. Moreover, R(H)- R(H_*) = tr ( (H-H_*)Σ_XX(H-H_*)^ T ) ≥ κ H-H_* _F^2.
Exact mathematical passage
\Sigma_{XX} = \mathbb E[XX^{\mathsf T}] \succeq \kappa I
\Sigma_{XX}^{-1}Use in source · 2 passages
Search aliases: Σ_XX^-1 Sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 473
[Population transfer identification] Let X∈ R^d_u and Y∈ R^d_v satisfy Y=H_*X+ξ, E[ξ X^ T]=0, and assume Σ_XX = E[XX^ T] succeq κ I for some κ>0. Then H_* is the unique minimizer of R(H) = E Y-HX _2^2, with H_* = Σ_YXΣ_XX^-1. Moreover, R(H)- R(H_*) = tr ( (H-H_*)Σ_XX(H-H_*)^ T ) ≥ κ H-H_* _F^2.
Exact mathematical passage
\boxed{ H_* = \Sigma_{YX}\Sigma_{XX}^{-1}. }
\Sigma_YUse in source · 3 passages
Search aliases: Σ_Y Sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 57
The scaffold is itself stratified: Σ = ( Σ_V, Σ_E, Σ_H, Σ_P, Σ_ O, Σ_B, Σ_Y ). The final coordinate Σ_Y records labels, targets, privileged masks, or other supervision that could directly reveal the intended workspace. This coordinate is necessary because an architecture may appear to discover a boundary even when the desired membership mask was encoded in its training labels.
Exact mathematical passage
\boxed{ \Sigma = \bigl( \Sigma_V, \Sigma_E, \Sigma_H, \Sigma_P, \Sigma_{\mathcal O}, \Sigma_B, \Sigma_Y \bigr). }
\Sigma_{Y'X'}Use in source · 1 passage
Search aliases: Σ_Y'X' Sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 578
The transformed covariances are Σ_Y'X'=g_vΣ_YXg_u^ T, Σ_X'X'=g_uΣ_XXg_u^ T. Substitution into the covariance formula and inversion of the second factor give the result.
Exact mathematical passage
\Sigma_{Y'X'}=g_v\Sigma_{YX}g_u^{\mathsf T}, \qquad \Sigma_{X'X'}=g_u\Sigma_{XX}g_u^{\mathsf T}.
\Sigma_{YX}Use in source · 3 passages
Search aliases: Σ_YX Sigma
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 473
[Population transfer identification] Let X∈ R^d_u and Y∈ R^d_v satisfy Y=H_*X+ξ, E[ξ X^ T]=0, and assume Σ_XX = E[XX^ T] succeq κ I for some κ>0. Then H_* is the unique minimizer of R(H) = E Y-HX _2^2, with H_* = Σ_YXΣ_XX^-1. Moreover, R(H)- R(H_*) = tr ( (H-H_*)Σ_XX(H-H_*)^ T ) ≥ κ H-H_* _F^2.
Exact mathematical passage
\boxed{ H_* = \Sigma_{YX}\Sigma_{XX}^{-1}. }
\tau'Use in source · 1 passage
Search aliases: τ' tau
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
\tau^2Use in source · 1 passage
Search aliases: τ^2 tau
Use in source · 04-approximate-workspaces.tex, line 364
-(a+b) · b^2+1 . Writing τ=a^2+b^2+2, the eigenvalues are λ_± = frac12 ( τ±sqrtτ^2-4(ab-1)^2 ), and det L_H=(ab-1)^2. Thus a nonzero exact shared core exists precisely when ab=1, which is exactly the trivial-holonomy condition. Away from exact consistency, λ_-λ_+=(ab-1)^2. When |ab-1| is small while λ_+ stays bounded away from zero, the soft workspace eigenvalue is quadratic in the cycle mismatch: λ_- = frac(ab-1)^2λ_+. This example connects approximate spectral coherence directly to approximate…
Exact mathematical passage
\lambda_\pm = \frac{1}{2} \left( \tau\pm\sqrt{\tau^2-4(ab-1)^2} \right),
\tau^mUse in source · 1 passage
Search aliases: τ^m tau
Use in source · 04-approximate-workspaces.tex, line 757
[Uniform path bound] If along the path T_r ≤τ, H_r ≤ h, V_r ≤ν, then the leakage and core-transport defects are bounded by ν∑_r=1^mτ^m-rh^r-1 = displaystyle νfracτ^m-h^mτ-h, · τ≠ h, [1.1em] displaystyle mντ^m-1, · τ=h. In particular, if τ≤1 and h≤1, the bound is at most mν.
Exact mathematical passage
\boxed{ \nu\sum_{r=1}^{m}\tau^{m-r}h^{r-1} = \begin{cases} \displaystyle \nu\frac{\tau^m-h^m}{\tau-h},&\tau\neq h,\\[1.1em] \displaystyle m\nu\tau^{m-1},&\tau=h. \end{cases} }
\tau^{m-1}Use in source · 1 passage
Search aliases: τ^m-1 tau
Use in source · 04-approximate-workspaces.tex, line 757
[Uniform path bound] If along the path T_r ≤τ, H_r ≤ h, V_r ≤ν, then the leakage and core-transport defects are bounded by ν∑_r=1^mτ^m-rh^r-1 = displaystyle νfracτ^m-h^mτ-h, · τ≠ h, [1.1em] displaystyle mντ^m-1, · τ=h. In particular, if τ≤1 and h≤1, the bound is at most mν.
Exact mathematical passage
\boxed{ \nu\sum_{r=1}^{m}\tau^{m-r}h^{r-1} = \begin{cases} \displaystyle \nu\frac{\tau^m-h^m}{\tau-h},&\tau\neq h,\\[1.1em] \displaystyle m\nu\tau^{m-1},&\tau=h. \end{cases} }
\tau^{m-r}Use in source · 1 passage
Search aliases: τ^m-r tau
Use in source · 04-approximate-workspaces.tex, line 757
[Uniform path bound] If along the path T_r ≤τ, H_r ≤ h, V_r ≤ν, then the leakage and core-transport defects are bounded by ν∑_r=1^mτ^m-rh^r-1 = displaystyle νfracτ^m-h^mτ-h, · τ≠ h, [1.1em] displaystyle mντ^m-1, · τ=h. In particular, if τ≤1 and h≤1, the bound is at most mν.
Exact mathematical passage
\boxed{ \nu\sum_{r=1}^{m}\tau^{m-r}h^{r-1} = \begin{cases} \displaystyle \nu\frac{\tau^m-h^m}{\tau-h},&\tau\neq h,\\[1.1em] \displaystyle m\nu\tau^{m-1},&\tau=h. \end{cases} }
\tau_{A\to Y}Use in source · 2 passages
Search aliases: τ_A→ Y tau to
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1028
Let Θ_A = ( τ_G, τ_G→ A, ε_Q, τ_V→ A, τ_A→ Y, τ_D→ M, τ_M→ R, τ_R→ v, τ_spec, ε_ctl, e_max ). A Θ_A-certified workspace agent is a controlled realization for which: item SRW(W_t;ς)=1; item cue-controlled goal retention exceeds τ_G; item goal-to-action mediation exceeds τ_G→ A; item counterfactual-value error is at most ε_Q; item value-to-action use exceeds τ_V→ A; item action-to-outcome control exceeds τ_A→ Y; item damage detection, monitor-to-repair mediation, and restoration exceed their thres…
Exact mathematical passage
\Theta_A = \left( \tau_G, \tau_{G\to A}, \varepsilon_Q, \tau_{V\to A}, \tau_{A\to Y}, \tau_{D\to M}, \tau_{M\to R}, \tau_{R\to v}, \tau_{\mathrm{spec}}, \varepsilon_{\mathrm{ctl}}, e_{\max} \right).
\tau_{\mathrm{causal}}Use in source · 1 passage
Search aliases: τ_causal tau mathrm
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 41
For a one-parameter family R_λ, define λ_str · = inf{λ: d_ε(λ)>0, g_ε(λ)>0}, λ_op · = inf{λ: δ_align(λ) ≤ε_op}, λ_causal · = inf{λ: η_causal(λ) ≥τ_causal}, λ_rel · = inf{λ: k_ε(λ)≥2, Δ_tr(λ) ≥τ_tr}, λ_form · = inf{λ: Form_Θ_form (W_λ)=1}. In general, λ_str, λ_op, λ_causal, λ_rel, λ_form can be distinct. A synchronized representation can appear before it becomes causally useful, and causal coordination can appear while remaining reducible to one centralized component.
Exact mathematical passage
\begin{aligned} \lambda_{\mathrm{str}} &= \inf\{\lambda: d_{\varepsilon}(\lambda)>0, g_{\varepsilon}(\lambda)>0\},\\ \lambda_{\mathrm{op}} &= \inf\{\lambda: \delta_{\mathrm{align}}(\lambda) \leq\varepsilon_{\mathrm{op}}\},\\ \lambda_{\mathrm{causal}} &= \inf\{\lambda: \eta_{\mathrm{causal}}(\lambda) \geq\tau_{\mathrm{causal}}\},\\ \lambda_{\mathrm{rel}} &= \inf\{\lambda: k_\varepsilon(\lambda)\geq2, \Delta_{\mathrm{tr}}(\lambda) \geq\tau_{\mathrm{tr}}\},\\ \lambda_{\mathrm{form}} &= \inf\{\lambda: \operatorname{Form}_{\Theta_{\mathrm{form}}} (W_\lambda)=1\}. \end{aligned}
\tau_{D\to M}Use in source · 1 passage
Search aliases: τ_D→ M tau to
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1028
Let Θ_A = ( τ_G, τ_G→ A, ε_Q, τ_V→ A, τ_A→ Y, τ_D→ M, τ_M→ R, τ_R→ v, τ_spec, ε_ctl, e_max ). A Θ_A-certified workspace agent is a controlled realization for which: item SRW(W_t;ς)=1; item cue-controlled goal retention exceeds τ_G; item goal-to-action mediation exceeds τ_G→ A; item counterfactual-value error is at most ε_Q; item value-to-action use exceeds τ_V→ A; item action-to-outcome control exceeds τ_A→ Y; item damage detection, monitor-to-repair mediation, and restoration exceed their thres…
Exact mathematical passage
\Theta_A = \left( \tau_G, \tau_{G\to A}, \varepsilon_Q, \tau_{V\to A}, \tau_{A\to Y}, \tau_{D\to M}, \tau_{M\to R}, \tau_{R\to v}, \tau_{\mathrm{spec}}, \varepsilon_{\mathrm{ctl}}, e_{\max} \right).
\tau_GUse in source · 2 passages
Search aliases: τ_G tau
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1028
Let Θ_A = ( τ_G, τ_G→ A, ε_Q, τ_V→ A, τ_A→ Y, τ_D→ M, τ_M→ R, τ_R→ v, τ_spec, ε_ctl, e_max ). A Θ_A-certified workspace agent is a controlled realization for which: item SRW(W_t;ς)=1; item cue-controlled goal retention exceeds τ_G; item goal-to-action mediation exceeds τ_G→ A; item counterfactual-value error is at most ε_Q; item value-to-action use exceeds τ_V→ A; item action-to-outcome control exceeds τ_A→ Y; item damage detection, monitor-to-repair mediation, and restoration exceed their thres…
Exact mathematical passage
\Theta_A = \left( \tau_G, \tau_{G\to A}, \varepsilon_Q, \tau_{V\to A}, \tau_{A\to Y}, \tau_{D\to M}, \tau_{M\to R}, \tau_{R\to v}, \tau_{\mathrm{spec}}, \varepsilon_{\mathrm{ctl}}, e_{\max} \right).
\tau_{G\to A}Use in source · 2 passages
Search aliases: τ_G→ A tau to
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1028
Let Θ_A = ( τ_G, τ_G→ A, ε_Q, τ_V→ A, τ_A→ Y, τ_D→ M, τ_M→ R, τ_R→ v, τ_spec, ε_ctl, e_max ). A Θ_A-certified workspace agent is a controlled realization for which: item SRW(W_t;ς)=1; item cue-controlled goal retention exceeds τ_G; item goal-to-action mediation exceeds τ_G→ A; item counterfactual-value error is at most ε_Q; item value-to-action use exceeds τ_V→ A; item action-to-outcome control exceeds τ_A→ Y; item damage detection, monitor-to-repair mediation, and restoration exceed their thres…
Exact mathematical passage
\Theta_A = \left( \tau_G, \tau_{G\to A}, \varepsilon_Q, \tau_{V\to A}, \tau_{A\to Y}, \tau_{D\to M}, \tau_{M\to R}, \tau_{R\to v}, \tau_{\mathrm{spec}}, \varepsilon_{\mathrm{ctl}}, e_{\max} \right).
\tau_iUse in source · 21 passages
Search aliases: τ_i tau
Use in source · 03-exact-shared-cores.tex, line 59
Choose for each vertex i a path τ_i:o→ i. Compatibility gives c_i=H_τ_ic_o. Thus a section with c_o=0 vanishes at every vertex. Hence ev_o is injective.
Exact mathematical passage
\tau_i:o\to i
\tau_jUse in source · 4 passages
Search aliases: τ_j tau
Use in source · 03-exact-shared-cores.tex, line 131
Choose a spanning tree T⊆|G|. Let τ_i:o→ i be the unique tree path. Every non-tree edge e:i→ j determines a fundamental loop γ_e=τ_j^-1eτ_i with transfer H_γ_e=H_τ_j^-1H_eH_τ_i. The fundamental group of a finite graph is generated freely by these cotree loops. Hence it is enough to impose fixed-point conditions for a finite set of generators.
Exact mathematical passage
H_{\gamma_e}=H_{\tau_j}^{-1}H_eH_{\tau_i}.
\tau_j^{-1}Use in source · 1 passage
Search aliases: τ_j^-1 tau
Use in source · 03-exact-shared-cores.tex, line 127
Choose a spanning tree T⊆|G|. Let τ_i:o→ i be the unique tree path. Every non-tree edge e:i→ j determines a fundamental loop γ_e=τ_j^-1eτ_i with transfer H_γ_e=H_τ_j^-1H_eH_τ_i. The fundamental group of a finite graph is generated freely by these cotree loops. Hence it is enough to impose fixed-point conditions for a finite set of generators.
Exact mathematical passage
\gamma_e=\tau_j^{-1}e\tau_i
\tau_{M\to R}Use in source · 1 passage
Search aliases: τ_M→ R tau to
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1028
Let Θ_A = ( τ_G, τ_G→ A, ε_Q, τ_V→ A, τ_A→ Y, τ_D→ M, τ_M→ R, τ_R→ v, τ_spec, ε_ctl, e_max ). A Θ_A-certified workspace agent is a controlled realization for which: item SRW(W_t;ς)=1; item cue-controlled goal retention exceeds τ_G; item goal-to-action mediation exceeds τ_G→ A; item counterfactual-value error is at most ε_Q; item value-to-action use exceeds τ_V→ A; item action-to-outcome control exceeds τ_A→ Y; item damage detection, monitor-to-repair mediation, and restoration exceed their thres…
Exact mathematical passage
\Theta_A = \left( \tau_G, \tau_{G\to A}, \varepsilon_Q, \tau_{V\to A}, \tau_{A\to Y}, \tau_{D\to M}, \tau_{M\to R}, \tau_{R\to v}, \tau_{\mathrm{spec}}, \varepsilon_{\mathrm{ctl}}, e_{\max} \right).
\tau_q^{\mathrm{causal}}Use in source · 1 passage
Search aliases: τ_q^causal tau mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 356
For thresholds Θ_form, define Form_Θ_form(W)=1 only when all applicable gates pass: · e_q^MDL≥ τ_q^MDL, · · e_q^causal≥ τ_q^causal, · δ_q^scaf≤ε_q^scaf, · · δ^leak≤ε_leak, · SRW_Θ(W)=1, · · Pass(N_form)=1. The final workspace gate is included because endogenous discovery of an unstable or causally irrelevant pattern is not endogenous workspace formation.
Exact mathematical passage
\begin{aligned} & e_q^{\mathrm{MDL}}\geq \tau_q^{\mathrm{MDL}}, && e_q^{\mathrm{causal}}\geq \tau_q^{\mathrm{causal}},\\ & \delta_q^{\mathrm{scaf}}\leq\varepsilon_q^{\mathrm{scaf}}, && \delta^{\mathrm{leak}}\leq\varepsilon_{\mathrm{leak}},\\ & \operatorname{SRW}_{\Theta}(W)=1, && \operatorname{Pass}(N_{\mathrm{form}})=1. \end{aligned}
\tau_q^{\mathrm{MDL}}Use in source · 1 passage
Search aliases: τ_q^MDL tau mathrm
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 356
For thresholds Θ_form, define Form_Θ_form(W)=1 only when all applicable gates pass: · e_q^MDL≥ τ_q^MDL, · · e_q^causal≥ τ_q^causal, · δ_q^scaf≤ε_q^scaf, · · δ^leak≤ε_leak, · SRW_Θ(W)=1, · · Pass(N_form)=1. The final workspace gate is included because endogenous discovery of an unstable or causally irrelevant pattern is not endogenous workspace formation.
Exact mathematical passage
\begin{aligned} & e_q^{\mathrm{MDL}}\geq \tau_q^{\mathrm{MDL}}, && e_q^{\mathrm{causal}}\geq \tau_q^{\mathrm{causal}},\\ & \delta_q^{\mathrm{scaf}}\leq\varepsilon_q^{\mathrm{scaf}}, && \delta^{\mathrm{leak}}\leq\varepsilon_{\mathrm{leak}},\\ & \operatorname{SRW}_{\Theta}(W)=1, && \operatorname{Pass}(N_{\mathrm{form}})=1. \end{aligned}
\tau_{R\to v}Use in source · 1 passage
Search aliases: τ_R→ v tau to
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1028
Let Θ_A = ( τ_G, τ_G→ A, ε_Q, τ_V→ A, τ_A→ Y, τ_D→ M, τ_M→ R, τ_R→ v, τ_spec, ε_ctl, e_max ). A Θ_A-certified workspace agent is a controlled realization for which: item SRW(W_t;ς)=1; item cue-controlled goal retention exceeds τ_G; item goal-to-action mediation exceeds τ_G→ A; item counterfactual-value error is at most ε_Q; item value-to-action use exceeds τ_V→ A; item action-to-outcome control exceeds τ_A→ Y; item damage detection, monitor-to-repair mediation, and restoration exceed their thres…
Exact mathematical passage
\Theta_A = \left( \tau_G, \tau_{G\to A}, \varepsilon_Q, \tau_{V\to A}, \tau_{A\to Y}, \tau_{D\to M}, \tau_{M\to R}, \tau_{R\to v}, \tau_{\mathrm{spec}}, \varepsilon_{\mathrm{ctl}}, e_{\max} \right).
\tau_{\mathrm{spec}}Use in source · 2 passages
Search aliases: τ_spec tau mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1028
Let Θ_A = ( τ_G, τ_G→ A, ε_Q, τ_V→ A, τ_A→ Y, τ_D→ M, τ_M→ R, τ_R→ v, τ_spec, ε_ctl, e_max ). A Θ_A-certified workspace agent is a controlled realization for which: item SRW(W_t;ς)=1; item cue-controlled goal retention exceeds τ_G; item goal-to-action mediation exceeds τ_G→ A; item counterfactual-value error is at most ε_Q; item value-to-action use exceeds τ_V→ A; item action-to-outcome control exceeds τ_A→ Y; item damage detection, monitor-to-repair mediation, and restoration exceed their thres…
Exact mathematical passage
\Theta_A = \left( \tau_G, \tau_{G\to A}, \varepsilon_Q, \tau_{V\to A}, \tau_{A\to Y}, \tau_{D\to M}, \tau_{M\to R}, \tau_{R\to v}, \tau_{\mathrm{spec}}, \varepsilon_{\mathrm{ctl}}, e_{\max} \right).
\tau_{\mathrm{tr}}Use in source · 1 passage
Search aliases: τ_tr tau mathrm
Use in source · 20-conjectures-and-open-mathematical-directions.tex, line 41
For a one-parameter family R_λ, define λ_str · = inf{λ: d_ε(λ)>0, g_ε(λ)>0}, λ_op · = inf{λ: δ_align(λ) ≤ε_op}, λ_causal · = inf{λ: η_causal(λ) ≥τ_causal}, λ_rel · = inf{λ: k_ε(λ)≥2, Δ_tr(λ) ≥τ_tr}, λ_form · = inf{λ: Form_Θ_form (W_λ)=1}. In general, λ_str, λ_op, λ_causal, λ_rel, λ_form can be distinct. A synchronized representation can appear before it becomes causally useful, and causal coordination can appear while remaining reducible to one centralized component.
Exact mathematical passage
\begin{aligned} \lambda_{\mathrm{str}} &= \inf\{\lambda: d_{\varepsilon}(\lambda)>0, g_{\varepsilon}(\lambda)>0\},\\ \lambda_{\mathrm{op}} &= \inf\{\lambda: \delta_{\mathrm{align}}(\lambda) \leq\varepsilon_{\mathrm{op}}\},\\ \lambda_{\mathrm{causal}} &= \inf\{\lambda: \eta_{\mathrm{causal}}(\lambda) \geq\tau_{\mathrm{causal}}\},\\ \lambda_{\mathrm{rel}} &= \inf\{\lambda: k_\varepsilon(\lambda)\geq2, \Delta_{\mathrm{tr}}(\lambda) \geq\tau_{\mathrm{tr}}\},\\ \lambda_{\mathrm{form}} &= \inf\{\lambda: \operatorname{Form}_{\Theta_{\mathrm{form}}} (W_\lambda)=1\}. \end{aligned}
\tau_{V\to A}Use in source · 2 passages
Search aliases: τ_V→ A tau to
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 1028
Let Θ_A = ( τ_G, τ_G→ A, ε_Q, τ_V→ A, τ_A→ Y, τ_D→ M, τ_M→ R, τ_R→ v, τ_spec, ε_ctl, e_max ). A Θ_A-certified workspace agent is a controlled realization for which: item SRW(W_t;ς)=1; item cue-controlled goal retention exceeds τ_G; item goal-to-action mediation exceeds τ_G→ A; item counterfactual-value error is at most ε_Q; item value-to-action use exceeds τ_V→ A; item action-to-outcome control exceeds τ_A→ Y; item damage detection, monitor-to-repair mediation, and restoration exceed their thres…
Exact mathematical passage
\Theta_A = \left( \tau_G, \tau_{G\to A}, \varepsilon_Q, \tau_{V\to A}, \tau_{A\to Y}, \tau_{D\to M}, \tau_{M\to R}, \tau_{R\to v}, \tau_{\mathrm{spec}}, \varepsilon_{\mathrm{ctl}}, e_{\max} \right).
\PhiUse in source · 14 passages
Search aliases: Φ Phi
Use in source · 03-exact-shared-cores.tex, line 446
[Commutant characterization] Let |G| be connected and let H be an invertible local system. Root evaluation induces an algebra isomorphism Φ_o: O_Workspace xrightarrow ≅ Comm(Hol_o), Φ_o((A_i))=A_o, where Comm(Hol_o) = {B∈End(C_o):Bh=hB ∀ h∈Hol_o}.
Exact mathematical passage
\boxed{ \Phi_o:\mathcal O_{\Workspace} \xrightarrow{\ \cong\ } \operatorname{Comm}(\Hol_o), \qquad \Phi_o((A_i))=A_o, }
\varphiUse in source · 2 passages
Search aliases: φ varphi
Use in source · 12-identity-through-time-and-replacement.tex, line 22
Let R=(G, C,D,ρ, I, K) and R'=(G', C',D',ρ', I', K') be two realizations. A correspondence begins with a graph isomorphism φ:G→ G'. After relabeling by φ, let J_i:C_i→ C_i' be unitary local identifications and define J_V=⊕_i∈ VJ_i, J_E=⊕_e∈ EJ_t(e).
Exact mathematical passage
\varphi:G\to G'
\Phi_{\mathcal D}Use in source · 3 passages
Search aliases: Φ_ D Phi mathcal
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 482
Fix a reference decomposition D_0. For each D∈ D, let Φ_ D:W^ D_0⟶ W^ D be a declared workspace correspondence and let δ_ D measure its structural and causal identity defect. Assume gate q has a transport bound | m_q(Φ_ DW; D) -m_q(W; D_0) | ≤ L_qδ_ D+b_q( D), where L_q is a sensitivity constant and b_q records model mismatch not captured by the identity distance.
Exact mathematical passage
\Phi_{\mathcal D}:W^{\mathcal D_0}\longrightarrow W^{\mathcal D}
\phi_{\mathcal I}Use in source · 2 passages
Search aliases: ϕ_ I phi mathcal
Use in source · 06-dynamic-workspace-theory.tex, line 342
[Minimal simultaneous interventional state] The random element Z_t^ I is sufficient simultaneously for all post-intervention target laws. If a statistic S_t=s( H_t) determines the conditional target law for every ι∈ I, then there exists a measurable ϕ_ I such that Z_t^ I=ϕ_ I(S_t) a.s.
Exact mathematical passage
\phi_{\mathcal I}
\phi_{\mathrm{boundary},t}Use in source · 1 passage
Search aliases: ϕ_boundary,t phi mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
\phi_{\mathrm{causal},t}Use in source · 1 passage
Search aliases: ϕ_causal,t phi mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
\phi_{\mathrm{coh},t}Use in source · 1 passage
Search aliases: ϕ_coh,t phi mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
\phi_{\mathrm{gap},t}Use in source · 1 passage
Search aliases: ϕ_gap,t phi mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
\phi_jUse in source · 1 passage
Search aliases: ϕ_j phi
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 675
_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To maintain a reserve ρ>0, define the maintenance deficit e_t =(ρ-v_t)_+. Define the zero-reserve and bounded-deficit viability sets V_Θ = { S:ϕ_j(S)≥0 for every j∈ J_maint } V_Θ,e_max = { S:e(S)≤ e_max } The first set requires every protected gate to pass. The second permits a declared finite reserve deficit.
Exact mathematical passage
\boxed{ \mathcal V_\Theta = \left\{ S:\phi_j(S)\geq0\ \text{for every }j\in\mathcal J_{\mathrm{maint}} \right\} }
\phi_{j,t}Use in source · 2 passages
Search aliases: ϕ_j,t phi
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 635
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g,
Exact mathematical passage
\phi_{j,t} \geq0 \quad\Longleftrightarrow\quad \text{gate }j\text{ passes at time }t.
\phi_{\mathrm{keep},t}Use in source · 1 passage
Search aliases: ϕ_keep,t phi mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
\Phi_oUse in source · 5 passages
Search aliases: Φ_o Phi
Use in source · 03-exact-shared-cores.tex, line 446
[Commutant characterization] Let |G| be connected and let H be an invertible local system. Root evaluation induces an algebra isomorphism Φ_o: O_Workspace xrightarrow ≅ Comm(Hol_o), Φ_o((A_i))=A_o, where Comm(Hol_o) = {B∈End(C_o):Bh=hB ∀ h∈Hol_o}.
Exact mathematical passage
\boxed{ \Phi_o:\mathcal O_{\Workspace} \xrightarrow{\ \cong\ } \operatorname{Comm}(\Hol_o), \qquad \Phi_o((A_i))=A_o, }
\phi_{\mathrm{rec},t}Use in source · 1 passage
Search aliases: ϕ_rec,t phi mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 642
Choose a declared set J_maint of workspace gates that must be protected. Write each gate as a signed margin ϕ_j,t ≥0 Longleftrightarrow gate j passes at time t. Examples include ϕ_gap,t · =g_ε,t-underline g, ϕ_coh,t · =overlineδ_coh-δ_coh,t, ϕ_rec,t · =α_t^(k)-underlineα, ϕ_keep,t · =μ_t^keep-underlineμ, ϕ_causal,t · =η_causal,t-underlineη, ϕ_boundary,t · =Δ_t^B-underlineΔ_B. The aggregate integrity margin is v_t = min_j∈ J_maintϕ_j,t. The workspace passes the protected gates when v_t≥0. To main…
Exact mathematical passage
\begin{aligned} \phi_{\mathrm{gap},t} &=g_{\varepsilon,t}-\underline g,\\ \phi_{\mathrm{coh},t} &=\overline\delta_{\mathrm{coh}}-\delta_{\mathrm{coh},t},\\ \phi_{\mathrm{rec},t} &=\alpha_t^{(k)}-\underline\alpha,\\ \phi_{\mathrm{keep},t} &=\mu_t^{\mathrm{keep}}-\underline\mu,\\ \phi_{\mathrm{causal},t} &=\eta_{\mathrm{causal},t}-\underline\eta,\\ \phi_{\mathrm{boundary},t} &=\Delta_t^B-\underline\Delta_B. \end{aligned}
\phi_WUse in source · 1 passage
Search aliases: ϕ_W phi
Use in source · 19-summary-of-main-results.tex, line 262
On standard Borel spaces, the canonical conditional-law state Z_t = P(Y_t^+∈·mid H_t) is sufficient and minimal: Y_t^+indep H_tmid Z_t, and every sufficient statistic S_t=s( H_t) satisfies Z_t=ϕ(S_t) a.s. Moreover, a structural candidate W_t is exactly operationally aligned if and only if Z_t=ϕ_W(W_t) a.s. The countable intervention-indexed version holds for Z_t^ I.
Exact mathematical passage
Z_t=\phi_W(W_t) \qquad\text{a.s.}
\phi_{\widehat\varsigma}Use in source · 1 passage
Search aliases: ϕ_widehatς phi widehat varsigma
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 946
sel, and let D_cert be independent of D_sel. For every fixed ς∈ S, let ϕ_ς( D_cert)∈{0,1} be a certificate rule satisfying sup_P:Cert(W;ς)=0 P_P(ϕ_ς=1) ≤α. Then the selected-specification procedure satisfies sup_P P_P( ϕ_widehatς=1, Cert(W;widehatς)=0 ) ≤α.
Exact mathematical passage
\boxed{ \sup_P \mathbb P_P\left( \phi_{\widehat\varsigma}=1, \operatorname{Cert}(W;\widehat\varsigma)=0 \right) \leq\alpha. }
\Phi_{\varsigma}Use in source · 4 passages
Search aliases: Φ_ς Phi varsigma
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 300
Changing the decomposition can alter the coordinate realization of the workspace, while changing the target or horizon can alter the relevant predictive state. Let Φ_ς:W_ς_0⟶ W_ς be the declared correspondence when such transport is needed. For each gate, assume a bound | m_q(Φ_ςW;ς) -m_q(W;ς_0) | ≤ L_qd_ S(ς,ς_0) +b_q(ς), where b_q records mismatch not represented by the metric. The mismatch may include a change of model class, imperfect target coupling, or an intervention whose implementation …
Exact mathematical passage
\Phi_{\varsigma}:W_{\varsigma_0}\longrightarrow W_{\varsigma}
\phi_\varsigmaUse in source · 2 passages
Search aliases: ϕ_ς phi varsigma
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 938
[Validity after independent specification selection] Let widehatς be selected using D_sel, and let D_cert be independent of D_sel. For every fixed ς∈ S, let ϕ_ς( D_cert)∈{0,1} be a certificate rule satisfying sup_P:Cert(W;ς)=0 P_P(ϕ_ς=1) ≤α. Then the selected-specification procedure satisfies sup_P P_P( ϕ_widehatς=1, Cert(W;widehatς)=0 ) ≤α.
Exact mathematical passage
\phi_\varsigma(\mathcal D_{\mathrm{cert}})\in\{0,1\}
\PsiUse in source · 2 passages
Search aliases: Ψ Psi
Use in source · 11-reconstruction-and-resilience.tex, line 14
Let C_* be a finite-dimensional abstract core. The exact static theory provides a complete local chart overline E_i = ev_i∘Ψ:C_*⟶ C_i, where Ψ:C_*→Γ(H) is the root-to-section isomorphism. A participant or artifact need not expose that complete chart. Let O_i:C_i⟶ Y_i be the declared observation or access map and define the accessible encoding E_i=O_ioverline E_i:C_*⟶ Y_i. For notational economy, the direct sums below use the accessible spaces Y_i. Thus injectivity of a full structural chart does…
Exact mathematical passage
\overline E_i = \ev_i\circ\Psi:C_*\longrightarrow C_i,
\psi_AUse in source · 3 passages
Search aliases: ψ_A psi
Use in source · 07-relational-irreducibility.tex, line 207
Let d_ P be a bounded metric generating the measurable structure on P( Y). Define the reconstruction defect of the canonical state from coalition A by δ_A^Z = inf_ψ_A E [ d_ P ( Z_t,ψ_A( H_t^A) ) ].
Exact mathematical passage
\delta_A^Z = \inf_{\psi_A} \mathbb E\!\left[ d_{\mathcal P}\!\left( Z_t,\psi_A(\mathbf H_t^A) \right) \right].
\psi_iUse in source · 1 passage
Search aliases: ψ_i psi
Use in source · 08-causal-efficacy-and-reentry.tex, line 318
Exact alignment and Theorem~[source reference] imply that the canonical predictive state factors through W_t. If W_t=ψ_i( H_t^i) almost surely for some node, then the canonical state would also be a function of H_t^i, contradicting the positive node gap through Proposition~[source reference].
Exact mathematical passage
W_t=\psi_i(\mathbf H_t^i)
\omegaUse in source · 7 passages
Search aliases: ω omega
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 291
The scalar ω_ U(b) := P_ H^1_ Ub is an irreducible overlap-frustration measure. Its vanishing is invariant under admissible invertible coordinate changes, although its numerical norm depends on the chosen metric. It cannot be removed by adding local potentials alone.
Exact mathematical passage
\omega_{\mathcal U}(b) := \|P_{\mathcal H^1_{\mathcal U}}b\|
\omega_{\mathcal U}Use in source · 3 passages
Search aliases: ω_ U omega mathcal
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 291
The scalar ω_ U(b) := P_ H^1_ Ub is an irreducible overlap-frustration measure. Its vanishing is invariant under admissible invertible coordinate changes, although its numerical norm depends on the chosen metric. It cannot be removed by adding local potentials alone.
Exact mathematical passage
\omega_{\mathcal U}(b) := \|P_{\mathcal H^1_{\mathcal U}}b\|
\omega_{t+1}Use in source · 1 passage
Search aliases: ω_t+1 omega
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 77
C_t^ctl = ( W_t,G_t,M_t,B_t,E_t ), where G_t is the represented goal, M_t is a workspace-integrity monitor, B_t is the current boundary or routing state, and E_t is the declared external context. An action is generated by A_t ∼ π_t ( ·mid W_t,G_t,M_t,B_t,E_t ). The future controlled state obeys a time-unrolled structural model S_t+1 = F_t(S_t,A_t,E_t+1,ξ_t+1), W_t+1=ω_t+1(S_t+1). The intervention semantics are inherited from Part~VII. A symbol such as do(A_t=a) is meaningful only when an impleme…
Exact mathematical passage
S_{t+1} = F_t(S_t,A_t,E_{t+1},\xi_{t+1}), \qquad W_{t+1}=\omega_{t+1}(S_{t+1}).
\Omega_\gammaUse in source · 2 passages
Search aliases: Ω_γ Omega gamma
Use in source · 03-exact-shared-cores.tex, line 103
The obstruction associated with a loop is Ω_γ=H_γ-I_C_o. The maximal path-independent root core is C_* = ⋂_γ:o→ oker(H_γ-I). Equivalently, C_*=C_o^Hol_o=Fix(Hol_o).
Exact mathematical passage
\Omega_\gamma=H_\gamma-I_{C_o}.
\daggerUse in source · 16 passages
Search aliases: † dagger
Use in source · 11-reconstruction-and-resilience.tex, line 72
[Coalition reconstruction criterion] For a coalition S, the following are equivalent: item A_S is injective; item F_S is positive definite; item α_S>0; item there exists a linear decoder R_S with R_SA_S=I_C_*. When these conditions hold, the canonical decoder is R_S=A_S^†=F_S^-1A_S^*.
Exact mathematical passage
\boxed{ R_S=A_S^\dagger=F_S^{-1}A_S^*. }
\ell'Use in source · 1 passage
Search aliases: ℓ' ell
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 259
Let d_ S be a declared extended pseudometric on the quotient of S by specification equivalence. A convenient decomposition is d_ S(ς,ς') = · w_Dd_D( D, D') +w_Yd_Y(Y^+,Y^+') +w_ℓ d_ℓ(ℓ,ℓ') · +w_τ d_τ(τ,τ') +w_Id_I( I, I') +w_Nd_N( N, N') +w_Θ d_Θ(Θ,Θ'). No universal metric is imposed. The target term may use a divergence between conditional laws under a declared coupling. The intervention and null terms may use Hausdorff distances between implemented kernels. Threshold terms must be expressed on…
Exact mathematical passage
\begin{aligned} d_{\mathfrak S}(\varsigma,\varsigma') ={}& w_Dd_D(\mathcal D,\mathcal D') +w_Yd_Y(Y^+,Y^{+'}) +w_\ell d_\ell(\ell,\ell')\\ &+w_\tau d_\tau(\tau,\tau') +w_Id_I(\mathcal I,\mathcal I') +w_Nd_N(\mathcal N,\mathcal N') +w_\Theta d_\Theta(\Theta,\Theta'). \end{aligned}
\ell_aUse in source · 5 passages
Search aliases: ℓ_a ell
Use in source · 12-identity-through-time-and-replacement.tex, line 207
Write A=ρ_V(a), A'=ρ_V'(a), and define δ_ρ(a)= A'J_V-J_VA , ℓ_a= (I-P)AP . Let A_ W=PAP, A_ W''=P'A'P'.
Exact mathematical passage
\delta_\rho(a)=\|A'J_V-J_VA\|, \qquad \ell_a=\|(I-P)AP\|.
\ell_{\mathrm{ctl}}Use in source · 1 passage
Search aliases: ℓ_ctl ell mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 177
For the complete control state, define Risk_ctl(S) = inf_f E [ ℓ_ctl ( C_t^ctl, f( H_t^S) ) ], and let k_ctl,ε be its minimal sufficient coalition size. A strong workspace-level agency claim requires k_ctl,ε≥2. This is a location criterion. It does not yet establish goal persistence, counterfactual evaluation, or self-maintenance.
Exact mathematical passage
\Risk_{\mathrm{ctl}}(S) = \inf_f \mathbb E \left[ \ell_{\mathrm{ctl}} \left( C_t^{\mathrm{ctl}}, f(\mathcal H_t^S) \right) \right],
\ell_GUse in source · 2 passages
Search aliases: ℓ_G ell
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 142
Let H_t^S be the history available to coalition S⊆ V. For a loss ℓ_G, define goal-reconstruction risk Risk_G(S) = inf_f E [ ℓ_G ( G_t, f( H_t^S) ) ]. For tolerance ε, define k_G,ε = min { |S|: Risk_G(S) ≤ Risk_G(V)+ε }. A goal is locally stored when k_G,ε=1. It is distributed relative to the declared decomposition when k_G,ε≥2.
Exact mathematical passage
\ell_G
\ell_{\log}Use in source · 1 passage
Search aliases: ℓ_log ell log
Use in source · 06-dynamic-workspace-theory.tex, line 296
For a finite target alphabet and logarithmic scoring loss ℓ_log(y,q)=-log q(y), q∈ P( Y), the identity is exact: Risk_log(S_t)=H(Y_t^+mid S_t), Risk_log(S_t)-Risk_log( H_t) = I(Y_t^+; H_tmid S_t). Natural logarithms measure the gap in nats; base-two logarithms measure it in bits.
Exact mathematical passage
\ell_{\log}(y,q)=-\log q(y), \qquad q\in\mathcal P(\mathsf Y),
\ell_qUse in source · 3 passages
Search aliases: ℓ_q ell
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 88
For any component q of widehatθ, define its scaffold-only Bayes risk under loss ℓ_q by R_q^Σ = inf_f E [ ℓ_q(q,f(Σ,Ω)) ]. Define the full formation risk by R_q^Σ, H = inf_g E [ ℓ_q(q,g(Σ, D_form,Ω)) ]. The history advantage is Δ_q^hist = R_q^Σ - R_q^Σ, H. A positive history advantage means that formation history contains information about q that is not already recoverable from the declared scaffold and random seed.
Exact mathematical passage
\ell_q
\ell_tUse in source · 3 passages
Search aliases: ℓ_t ell
Use in source · 10-persistence.tex, line 150
Let the realized vertex state satisfy x_t+1=F_tx_t+ξ_t, where F_t: C_V(t)→ C_V(t+1) is the actual update and ξ_t is an unmodeled disturbance. Define the off-workspace error e_t= (I-P_t)x_t . Introduce α_t = (I-P_t+1)F_t(I-P_t) , which measures persistence of prior off-workspace error, and ℓ_t = (I-P_t+1)F_tP_t , which measures leakage of a valid workspace state under the update.
Exact mathematical passage
\ell_t = \left\| (I-P_{t+1})F_tP_t \right\|,
\leftarrowUse in source · 2 passages
Search aliases: ← leftarrow
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 401
A feasible statement intervention must alter both local realizations of the statement coordinate: ι_q← a: (q_P,q_N)←(a,a), while holding (p,f) fixed. For configurations with fixed p and f, changing a flips the downstream decision with total-variation effect one: TV ( P(Ymidι_q←0), P(Ymidι_q←1) ) =1. A matched intervention on a residual notebook-format coordinate leaves Y unchanged. Thus the core intervention has positive causal specificity in this model.
Exact mathematical passage
\iota_{q\leftarrow a}: (q_P,q_N)\leftarrow(a,a),
\mapstoUse in source · 1 passage
Search aliases: ↦ mapsto
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 82
aphs, coordinate restriction gives ρ_K^L: C_V(L)⟶ C_V(K). Because every edge equation on K is also an edge equation on L, restriction maps exact sections to exact sections: r_K^L := ρ_K^L|_mathscr W(L): mathscr W(L)⟶mathscr W(K). They obey r_L^L=I, r_J^K r_K^L=r_J^L whenever J⊆ K⊆ L. Thus K↦mathscr W(K) is a contravariant system of local workspaces.
Exact mathematical passage
K\mapsto\mathscr W(K)
\hookrightarrowUse in source · 2 passages
Search aliases: ↪ hookrightarrow
Use in source · 04-approximate-workspaces.tex, line 685
Let a path have vertices i_0xrightarrowe_1i_1xrightarrowe_2⋯ xrightarrowe_mi_m. Write T_r=T_e_r, H_r=H_e_r, V_r=V_e_r, and let ι_i^C:C_i↪ X_i, ι_i^R:R_i↪ X_i be the canonical inclusions. Empty products below are identities.
Exact mathematical passage
\iota_i^C:C_i\hookrightarrow X_i, \qquad \iota_i^R:R_i\hookrightarrow X_i
\partialUse in source · 5 passages
Search aliases: ∂ partial
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 104
Let the vertex set of a core-transfer diagram be partitioned as V=V_1sqcup⋯sqcup V_m. Write the transfer discrepancy as D_H = D_int D_∂ , D_int = ⊕_α=1^mD_α, where D_α contains the edge constraints internal to V_α, and D_∂ contains the constraints crossing between blocks. Define the internally coherent macro-state spaces W_α=ker D_α, W_Π=⊕_α=1^mW_α. Let J_Π:W_Π↪ C_V be the canonical isometric inclusion, and define the quotient discrepancy D_Π=D_∂J_Π. The quotient does not replace a group of node…
Exact mathematical passage
D_H = \begin{pmatrix} D_{\mathrm{int}}\\ D_{\partial} \end{pmatrix}, \qquad D_{\mathrm{int}} = \bigoplus_{\alpha=1}^{m}D_\alpha,
\notinUse in source · 3 passages
Search aliases: ∉ notin
Use in source · 03-exact-shared-cores.tex, line 322
sinθ · cosθ with θ∉2π Z. Then ker(R_θ-I)={0}. Every edge map is individually invertible and well-defined, yet the complete cycle admits no nonzero exact shared core. Pairwise translatability is therefore insufficient for global path independence.
Exact mathematical passage
\theta\notin2\pi\mathbb Z
\prodUse in source · 11 passages
Search aliases: ∏ prod
Use in source · 04-approximate-workspaces.tex, line 709
· = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r · × (∏_ℓ=1^r-1 H_ℓ ), and the same right-hand side bounds P_i_mT_m⋯ T_1P_i_0-H_m⋯ H_1 .
Exact mathematical passage
\boxed{ \begin{aligned} \|Q_{i_m}T_m\cdots T_1P_{i_0}\| \leq \sum_{r=1}^{m} &\left(\prod_{\ell=r+1}^{m}\|T_\ell\|\right) \|V_r\|\\ &\times \left(\prod_{\ell=1}^{r-1}\|H_\ell\|\right), \end{aligned} }
\prod_{r=0}^{t-1}Use in source · 2 passages
Search aliases: ∏_r=0^t-1 prod
Use in source · 10-persistence.tex, line 210
[Nonautonomous persistence theorem] Let e_t≥0 satisfy e_t+1≤α_te_t+σ_t, α_t,σ_t≥0. Then, for every t≥1, e_t ≤ · (∏_r=0^t-1α_r)e_0 · + ∑_j=0^t-1 (∏_r=j+1^t-1α_r)σ_j, where an empty product equals one. If α_t≤barα<1, σ_t≤barσ, then e_t ≤ barα^te_0 + fracbarσ(1-barα^t)1-barα, and consequently limsup_t→∞e_t ≤ fracbarσ1-barα.
Exact mathematical passage
\boxed{ \begin{aligned} e_t \leq &\left(\prod_{r=0}^{t-1}\alpha_r\right)e_0\\ &+ \sum_{j=0}^{t-1} \left(\prod_{r=j+1}^{t-1}\alpha_r\right)\sigma_j, \end{aligned} }
\prod_{r=j+1}^{t-1}Use in source · 2 passages
Search aliases: ∏_r=j+1^t-1 prod
Use in source · 10-persistence.tex, line 210
[Nonautonomous persistence theorem] Let e_t≥0 satisfy e_t+1≤α_te_t+σ_t, α_t,σ_t≥0. Then, for every t≥1, e_t ≤ · (∏_r=0^t-1α_r)e_0 · + ∑_j=0^t-1 (∏_r=j+1^t-1α_r)σ_j, where an empty product equals one. If α_t≤barα<1, σ_t≤barσ, then e_t ≤ barα^te_0 + fracbarσ(1-barα^t)1-barα, and consequently limsup_t→∞e_t ≤ fracbarσ1-barα.
Exact mathematical passage
\boxed{ \begin{aligned} e_t \leq &\left(\prod_{r=0}^{t-1}\alpha_r\right)e_0\\ &+ \sum_{j=0}^{t-1} \left(\prod_{r=j+1}^{t-1}\alpha_r\right)\sigma_j, \end{aligned} }
\prod_sUse in source · 1 passage
Search aliases: ∏_s prod
Use in source · 19-summary-of-main-results.tex, line 434
For matched future command and disturbance trajectories under G_s+1=R_sG_s+B_sC_s+1+ζ_s+1, two goal interventions satisfy G_t+τ-G_t+τ' = R_t+τ:t(g-g'). If m_s≤σ_min(R_s), R_s ≤ M_s, then (∏_s m_s) g-g' ≤ G_t+τ-G_t+τ' ≤ (∏_s M_s) g-g' . A linear action readout gives a corresponding lower bound on the induced action-mean separation. The result isolates internal retention from repeated external goal rewriting.
Exact mathematical passage
\boxed{ \left(\prod_s m_s\right)\|g-g'\| \leq \|G_{t+\tau}-G_{t+\tau}'\| \leq \left(\prod_s M_s\right)\|g-g'\|. }
\prod_{s=r+1}^{R-1}Use in source · 2 passages
Search aliases: ∏_s=r+1^R-1 prod
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 1064
l H_r+1, widetilde F_r: H_r→ H_r+1 be exact and implemented level-collapse maps for r=0,…,R-1. Let R_r⊆ H_r contain the exact and implemented states reachable at level r. Assume, on R_r, F_r(x)-F_r(y) ≤ L_r x-y and sup_x∈ R_r widetilde F_r(x)-F_r(x) ≤ δ_r. Then · widetilde F_R-1∘⋯∘widetilde F_0(x) - F_R-1∘⋯∘ F_0(x) · ≤ ∑_r=0^R-1 ( ∏_s=r+1^R-1L_s ) δ_r. In particular, if L_r≤1, then the total error is at most ∑_r=0^R-1δ_r. If L_r≤ L<1 and δ_r≤δ, then total error ≤ fracδ(1-L^R)1-L ≤ fracδ1-L.
Exact mathematical passage
\boxed{ \begin{aligned} &\left\| \widetilde F_{R-1}\circ\cdots\circ\widetilde F_0(x) - F_{R-1}\circ\cdots\circ F_0(x) \right\|\\ &\qquad\leq \sum_{r=0}^{R-1} \left( \prod_{s=r+1}^{R-1}L_s \right) \delta_r. \end{aligned} }
\prod_{s=t}^{t+\tau-1}Use in source · 2 passages
Search aliases: ∏_s=t^t+τ-1 prod tau
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 356
1 = R_sG_s+B_sC_s+1+ζ_s+1 (s=t,…,t+τ-1). Consider two intervention runs that set G_t=g, G_t'=g', and then use the same command trajectory and the same disturbance realization. Let R_t+τ:t = R_t+τ-1⋯ R_t. Then G_t+τ-G_t+τ' = R_t+τ:t(g-g'). If m_s ≤ σ_min(R_s), R_s ≤ M_s, then ( ∏_s=t^t+τ-1m_s ) g-g' ≤ G_t+τ-G_t+τ' ≤ ( ∏_s=t^t+τ-1M_s ) g-g' .
Exact mathematical passage
\boxed{ \left( \prod_{s=t}^{t+\tau-1}m_s \right) \|g-g'\| \leq \|G_{t+\tau}-G_{t+\tau}'\| \leq \left( \prod_{s=t}^{t+\tau-1}M_s \right) \|g-g'\|. }
\prod_\alphaUse in source · 2 passages
Search aliases: ∏_α prod alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 361
[Exact workspace gluing] For every finite edge-complete workspace cover U, the sequence 0 ⟶ mathscr W(G) xrightarrow R_ U check C^0( U;mathscr W) xrightarrow δ^0 check C^1( U;mathscr W) is exact. Equivalently, mathscr W(G) ≅ kerδ^0 ≅ Eq ( ∏_αmathscr W_α rightrightarrows ∏_α<βmathscr W_αβ ). Every pairwise compatible family of exact local workspace states therefore glues to a unique exact global workspace state.
Exact mathematical passage
\boxed{ \mathscr W(G) \cong \ker\delta^0 \cong \operatorname{Eq} \left( \prod_\alpha\mathscr W_\alpha \rightrightarrows \prod_{\alpha<\beta}\mathscr W_{\alpha\beta} \right). }
\prod_{\alpha<\beta}Use in source · 2 passages
Search aliases: ∏_α<β prod alpha beta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 361
[Exact workspace gluing] For every finite edge-complete workspace cover U, the sequence 0 ⟶ mathscr W(G) xrightarrow R_ U check C^0( U;mathscr W) xrightarrow δ^0 check C^1( U;mathscr W) is exact. Equivalently, mathscr W(G) ≅ kerδ^0 ≅ Eq ( ∏_αmathscr W_α rightrightarrows ∏_α<βmathscr W_αβ ). Every pairwise compatible family of exact local workspace states therefore glues to a unique exact global workspace state.
Exact mathematical passage
\boxed{ \mathscr W(G) \cong \ker\delta^0 \cong \operatorname{Eq} \left( \prod_\alpha\mathscr W_\alpha \rightrightarrows \prod_{\alpha<\beta}\mathscr W_{\alpha\beta} \right). }
\prod_{\ell=1}^{r-1}Use in source · 2 passages
Search aliases: ∏_ℓ=1^r-1 prod ell
Use in source · 04-approximate-workspaces.tex, line 709
· = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r · × (∏_ℓ=1^r-1 H_ℓ ), and the same right-hand side bounds P_i_mT_m⋯ T_1P_i_0-H_m⋯ H_1 .
Exact mathematical passage
\boxed{ \begin{aligned} \|Q_{i_m}T_m\cdots T_1P_{i_0}\| \leq \sum_{r=1}^{m} &\left(\prod_{\ell=r+1}^{m}\|T_\ell\|\right) \|V_r\|\\ &\times \left(\prod_{\ell=1}^{r-1}\|H_\ell\|\right), \end{aligned} }
\prod_{\ell=r+1}^{m}Use in source · 2 passages
Search aliases: ∏_ℓ=r+1^m prod ell
Use in source · 04-approximate-workspaces.tex, line 709
· = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r · × (∏_ℓ=1^r-1 H_ℓ ), and the same right-hand side bounds P_i_mT_m⋯ T_1P_i_0-H_m⋯ H_1 .
Exact mathematical passage
\boxed{ \begin{aligned} \|Q_{i_m}T_m\cdots T_1P_{i_0}\| \leq \sum_{r=1}^{m} &\left(\prod_{\ell=r+1}^{m}\|T_\ell\|\right) \|V_r\|\\ &\times \left(\prod_{\ell=1}^{r-1}\|H_\ell\|\right), \end{aligned} }
\sum_{B\in S}Use in source · 1 passage
Search aliases: ∑_B∈ S sum in
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 303
A more stable quantity measures primitive carrier cost. Let w_ω>0 be a declared cost for each ω∈Ω, and assign a block the cost c(B)=∑_ω∈ Bw_ω. Define the sufficient support cost s_ε( D) = min_S⊆ V_ D { ∑_B∈ Sc(B): Risk_ D(S) ≤ Risk_ D(V_ D)+ε }. If D_fpreceq D_c is information faithful, then s_ε( D_f) ≤ s_ε( D_c). The fine decomposition permits every union of coarse blocks and may also permit cheaper sub-block coalitions. Equality holds whenever an optimal fine coalition is a union of complete c…
Exact mathematical passage
\boxed{ s_\varepsilon(\mathcal D) = \min_{S\subseteq V_{\mathcal D}} \left\{ \sum_{B\in S}c(B): \Risk_{\mathcal D}(S) \leq \Risk_{\mathcal D}(V_{\mathcal D})+\varepsilon \right\}. }
\sum_{e:s(e)=i}Use in source · 5 passages
Search aliases: ∑_e:s(e)=i sum
Use in source · 04-approximate-workspaces.tex, line 58
For z=(z_e)_e∈ E∈ C_E, the adjoint is (D_H^*z)_i = ∑_e:t(e)=isqrtw_e z_e - ∑_e:s(e)=isqrtw_e H_e^*z_e. Consequently, (L_Hc)_i = · ∑_e:t(e)=iw_e(c_i-H_ec_s(e))
Exact mathematical passage
(D_H^*z)_i = \sum_{e:t(e)=i}\sqrt{w_e}\,z_e - \sum_{e:s(e)=i}\sqrt{w_e}\,H_e^*z_e.
\sum_{e:s(e)\in S,\ t(e)\notin S}Use in source · 1 passage
Search aliases: ∑_e:s(e)∈ S, t(e)∉ S sum in notin
Use in source · 15-boundary-formation-and-stability.tex, line 125
For the induced subsystem on S, define Coh(S) = tr ( P_S,dL_SP_S,d ), where P_S,d projects onto the selected low-energy workspace modes. Let Cut(S) = ∑_e:s(e)∈ S, t(e)∉ Sw_e + ∑_e:s(e)∉ S, t(e)∈ Sw_e. Let k_ε(S) be the minimal sufficient coalition size inside the candidate subsystem. A candidate is admissible only if SRW_Θ_S(W_S)=1, k_ε(S)≥2, unless the claim explicitly concerns a centralized workspace.
Exact mathematical passage
\mathsf{Cut}(S) = \sum_{e:s(e)\in S,\ t(e)\notin S}w_e + \sum_{e:s(e)\notin S,\ t(e)\in S}w_e.
\sum_{e:s(e)\notin S,\ t(e)\in S}Use in source · 1 passage
Search aliases: ∑_e:s(e)∉ S, t(e)∈ S sum notin in
Use in source · 15-boundary-formation-and-stability.tex, line 125
For the induced subsystem on S, define Coh(S) = tr ( P_S,dL_SP_S,d ), where P_S,d projects onto the selected low-energy workspace modes. Let Cut(S) = ∑_e:s(e)∈ S, t(e)∉ Sw_e + ∑_e:s(e)∉ S, t(e)∈ Sw_e. Let k_ε(S) be the minimal sufficient coalition size inside the candidate subsystem. A candidate is admissible only if SRW_Θ_S(W_S)=1, k_ε(S)≥2, unless the claim explicitly concerns a centralized workspace.
Exact mathematical passage
\mathsf{Cut}(S) = \sum_{e:s(e)\in S,\ t(e)\notin S}w_e + \sum_{e:s(e)\notin S,\ t(e)\in S}w_e.
\sum_{e:t(e)=i}Use in source · 2 passages
Search aliases: ∑_e:t(e)=i sum
Use in source · 04-approximate-workspaces.tex, line 58
For z=(z_e)_e∈ E∈ C_E, the adjoint is (D_H^*z)_i = ∑_e:t(e)=isqrtw_e z_e - ∑_e:s(e)=isqrtw_e H_e^*z_e. Consequently, (L_Hc)_i = · ∑_e:t(e)=iw_e(c_i-H_ec_s(e))
Exact mathematical passage
(D_H^*z)_i = \sum_{e:t(e)=i}\sqrt{w_e}\,z_e - \sum_{e:s(e)=i}\sqrt{w_e}\,H_e^*z_e.
\sum_{h\in\Hol_o}Use in source · 1 passage
Search aliases: ∑_h∈Hol_o sum in Hol
Use in source · 03-exact-shared-cores.tex, line 268
[Averaging projector for finite holonomy] If Hol_o is finite and acts unitarily, then P_*= frac1|Hol_o| ∑_h∈Hol_oh is the orthogonal projector onto C_*.
Exact mathematical passage
P_*= \frac{1}{|\Hol_o|} \sum_{h\in\Hol_o}h
\sum_{i=1}^3Use in source · 1 passage
Search aliases: ∑_i=1^3 sum
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 158
The positive examples use a recurring distributed code. Let c=(c_1,c_2,c_3)^ T∈ R^3 and define three local encodings E_1c=(c_1,c_2), E_2c=(c_2,c_3), E_3c=(c_1,c_3). Then ∑_i=1^3E_i^*E_i=2I_3. No individual encoding is injective, while every two-node coalition is injective. The pairwise frame operators are E_{1,2}^*E_{1,2} · =diag(1,2,1),
Exact mathematical passage
\sum_{i=1}^3E_i^*E_i=2I_3.
\sum_{i=1}^nUse in source · 1 passage
Search aliases: ∑_i=1^n sum
Use in source · 18-specification-robustness-identifiability-and-statistical-certification.tex, line 797
Suppose S and J_* are finite, and each margin is estimated as widehat m_q(ς) = frac1n∑_i=1^nZ_i,q,ς-θ_q,ς, 0≤ Z_i,q,ς≤1, from independent certification units. Hoeffding's inequality and a union bound give P( sup_q,ς | widehat m_q(ς)-m_q(ς) | > sqrt frac log(2| J_*|| S|/δ) 2n ) ≤δ. Thus the choice ε_n(δ) = sqrt frac log(2| J_*|| S|/δ) 2n yields an explicit conservative certificate. Dependent episodes require a bound appropriate to the true independent unit rather than token-level or edge-level ps…
Exact mathematical passage
\widehat m_q(\varsigma) = \frac1n\sum_{i=1}^nZ_{i,q,\varsigma}-\theta_{q,\varsigma}, \qquad 0\leq Z_{i,q,\varsigma}\leq1,
\sum_{i\in S}Use in source · 2 passages
Search aliases: ∑_i∈ S sum in
Use in source · 11-reconstruction-and-resilience.tex, line 43
For a coalition S⊆ V, define the analysis operator A_S:C_*⟶⊕_i∈ S Y_i, A_Sc=(E_ic)_i∈ S, and the coalition frame operator F_S=A_S^*A_S=∑_i∈ SE_i^*E_i. Set α_S=λ_min(F_S), β_S=λ_max(F_S). Thus α_S c ^2 ≤ A_Sc ^2 ≤ β_S c ^2.
Exact mathematical passage
\boxed{ F_S=A_S^*A_S=\sum_{i\in S}E_i^*E_i. }
\sum_{i\in V}Use in source · 1 passage
Search aliases: ∑_i∈ V sum in
Use in source · 04-approximate-workspaces.tex, line 133
[Finite rank computation] Let n_C=∑_i∈ Vdim C_i. Then dimΓ(H)=n_C-rank(D_H). Hence the exact workspace dimension can be obtained by a single rank or singular-value computation, even when holonomy is unavailable because some transfers are noninvertible.
Exact mathematical passage
n_C=\sum_{i\in V}\dim C_i.
\sum_{i\in V\setminus A}Use in source · 1 passage
Search aliases: ∑_i∈ V∖ A sum in setminus
Use in source · 11-reconstruction-and-resilience.tex, line 287
[Dimensional obstruction] Let d=dim C_*. If ∑_i∈ Sdim Y_i<d, then α_S=0, so S cannot reconstruct the core. Consequently, k-failure resilience requires ∑_i∈ V∖ Adim Y_i≥ d for every A⊆ V with |A|≤ k.
Exact mathematical passage
\sum_{i\in V\setminus A}\dim \mathsf Y_i\geq d
\sum_{j=0}^{p+1}Use in source · 1 passage
Search aliases: ∑_j=0^p+1 sum
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 138
For p≥0, define the finite cochain space check C^p( U;mathscr W) = ⊕_α_0<⋯<α_p mathscr W(G_α_0⋯α_p), where empty intersections contribute the zero space. The coboundary δ^p:check C^p⟶check C^p+1 is (δ^p s)_α_0⋯α_p+1 = ∑_j=0^p+1(-1)^j r_α_0⋯α_p+1^% α_0⋯widehatα_j⋯α_p+1 % s_α_0⋯widehatα_j⋯α_p+1. The restriction identities imply δ^p+1δ^p=0. For a local family w=(w_α)_α, (δ^0w)_αβ = r_αβ^βw_β - r_αβ^αw_α. Thus δ^0 is the overlap-discrepancy operator at the level of exact local workspaces.
Exact mathematical passage
\boxed{ (\delta^p s)_{\alpha_0\cdots\alpha_{p+1}} = \sum_{j=0}^{p+1}(-1)^j r_{\alpha_0\cdots\alpha_{p+1}}^% {\alpha_0\cdots\widehat{\alpha_j}\cdots\alpha_{p+1}} % s_{\alpha_0\cdots\widehat{\alpha_j}\cdots\alpha_{p+1}}. }
\sum_{j=0}^{t-1}Use in source · 2 passages
Search aliases: ∑_j=0^t-1 sum
Use in source · 10-persistence.tex, line 210
[Nonautonomous persistence theorem] Let e_t≥0 satisfy e_t+1≤α_te_t+σ_t, α_t,σ_t≥0. Then, for every t≥1, e_t ≤ · (∏_r=0^t-1α_r)e_0 · + ∑_j=0^t-1 (∏_r=j+1^t-1α_r)σ_j, where an empty product equals one. If α_t≤barα<1, σ_t≤barσ, then e_t ≤ barα^te_0 + fracbarσ(1-barα^t)1-barα, and consequently limsup_t→∞e_t ≤ fracbarσ1-barα.
Exact mathematical passage
\boxed{ \begin{aligned} e_t \leq &\left(\prod_{r=0}^{t-1}\alpha_r\right)e_0\\ &+ \sum_{j=0}^{t-1} \left(\prod_{r=j+1}^{t-1}\alpha_r\right)\sigma_j, \end{aligned} }
\sum_{r=1}^{m}Use in source · 4 passages
Search aliases: ∑_r=1^m sum
Use in source · 04-approximate-workspaces.tex, line 694
[Pathwise core--residual Duhamel formula] The deviation of full path transport from pure core transport is exactly · T_m⋯ T_1ι_i_0^C - ι_i_m^C H_m⋯ H_1 · = ∑_r=1^m T_m⋯ T_r+1 ι_i_r^R V_r H_r-1⋯ H_1. Consequently, Q_i_mT_m⋯ T_1P_i_0 ≤ ∑_r=1^m · (∏_ℓ=r+1^m T_ℓ ) V_r
Exact mathematical passage
\boxed{ \begin{aligned} &T_m\cdots T_1\iota_{i_0}^C - \iota_{i_m}^C H_m\cdots H_1\\ &\qquad= \sum_{r=1}^{m} T_m\cdots T_{r+1} \iota_{i_r}^R V_r H_{r-1}\cdots H_1. \end{aligned} }
\sum_{r=1}^nUse in source · 1 passage
Search aliases: ∑_r=1^n sum
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 513
[Deterministic empirical recovery bound] For samples (X_r,Y_r)_r=1^n, write widehatΣ_XX = frac1n∑_r=1^nX_rX_r^ T, widehat M = frac1n∑_r=1^nξ_rX_r^ T. If widehatΣ_XXsucceqwidehatκ I, then ordinary least squares satisfies widehat H-H_* _F ≤ frac widehat M _Fwidehatκ. For ridge parameter τ>0, widehat H_τ-H_* _F ≤ frac widehat M _F+τ H_* _F widehatκ+τ .
Exact mathematical passage
\widehat\Sigma_{XX} = \frac1n\sum_{r=1}^nX_rX_r^{\mathsf T}, \qquad \widehat M = \frac1n\sum_{r=1}^n\xi_rX_r^{\mathsf T}.
\sum_{t<T}Use in source · 1 passage
Search aliases: ∑_t<T sum
Use in source · 10-persistence.tex, line 345
A finite-horizon persistence certificate may be recorded as P_0:T = ( max_t<Tq_t^str, max_t≤ Te_t, min_t<Tμ_t^keep, ∑_t<Tσ_t ). No single coordinate of this vector subsumes the others.
Exact mathematical passage
\boxed{ \mathcal P_{0:T} = \left( \max_{t<T}q_t^{\mathrm{str}}, \max_{t\leq T}e_t, \min_{t<T}\mu_t^{\mathrm{keep}}, \sum_{t<T}\sigma_t \right). }
\sum_{t=0}^{T-1}Use in source · 1 passage
Search aliases: ∑_t=0^T-1 sum
Use in source · 12-identity-through-time-and-replacement.tex, line 565
For a sequence of realizations R_0, R_1,…, R_T, let J_t: R_t→ R_t+1 be admissible correspondences. Define the path length Len( J_0:T) = ∑_t=0^T-1Cost( J_t) and the induced directed path quasi-pseudometric d_path^rightarrow( R_0, R_T) = inf_ J_0:T Len( J_0:T). Concatenation gives the directed triangle inequality. Because replacement costs and intervention divergences need not be symmetric, symmetry is not assumed. When reverse correspondences exist, define the symmetrized pseudometric d_path^sym(…
Exact mathematical passage
\operatorname{Len}(\mathfrak J_{0:T}) = \sum_{t=0}^{T-1}\operatorname{Cost}(\mathfrak J_t)
\sum_{t\geq0}Use in source · 1 passage
Search aliases: ∑_t≥0 sum geq
Use in source · 10-persistence.tex, line 272
[Vanishing-disturbance convergence] If α_t≤barα<1 and σ_t→0, then e_t→0. More generally, if ∑_t≥0σ_t<∞, then the disturbance contribution in Theorem~[source reference] vanishes asymptotically.
Exact mathematical passage
\sum_{t\geq0}\sigma_t<\infty
\sum_\alphaUse in source · 1 passage
Search aliases: ∑_α sum alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 592
[0.2em] sqrtλ_ov S_ U , L_ U^tot = K_ U^*K_ U. Its energy is E_ U^tot(u) = · ∑_α D_G_αu_α ^2 · + λ_ov ∑_α<β ρ^G_β_G_αβu_β - ρ^G_α_G_αβu_α ^2.
Exact mathematical passage
\boxed{ \begin{aligned} \mathcal E_{\mathcal U}^{\mathrm{tot}}(u) ={}& \sum_\alpha\|D_{G_\alpha}u_\alpha\|^2\\ &+ \lambda_{\mathrm{ov}} \sum_{\alpha<\beta} \left\| \rho^{G_\beta}_{G_{\alpha\beta}}u_\beta - \rho^{G_\alpha}_{G_{\alpha\beta}}u_\alpha \right\|^2. \end{aligned} }
\sum_{\alpha:i\in V_\alpha}Use in source · 1 passage
Search aliases: ∑_α:i∈ V_α sum alpha in alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 680
Let m_i=|{α:i∈ V_α}| be the multiplicity of vertex i. Then J_ U^*J_ U=M_ U, (M_ Uc)_i=m_ic_i. The pseudoinverse performs coordinatewise averaging: (J_ U^† u)_i = frac1m_i ∑_α:i∈ V_α(u_α)_i. Let widehat u = P_ker K_ Uu = J_ Uwidehat c. Then widehat c = J_ U^†widehat u and u-J_ Uwidehat c ≤ frac K_ Uu sqrtγ_ U^tot. If m_min=min_i m_i, then widehat c-J_ U^† u ≤ frac K_ Uu sqrtm_minγ_ U^tot. The simple overlap average and the globally coherent least-squares assembly are close only when the total des…
Exact mathematical passage
\boxed{ (J_{\mathcal U}^\dagger u)_i = \frac{1}{m_i} \sum_{\alpha:i\in V_\alpha}(u_\alpha)_i. }
\sum_{\alpha<\beta}Use in source · 2 passages
Search aliases: ∑_α<β sum alpha beta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 182
A family w=(w_α)_α is exactly compatible when δ^0w=0. Its direct mismatch is m_ U(w)=δ^0w. After choosing inner products and positive overlap weights, the mismatch energy is E_ov(w) = δ^0w ^2 = ∑_α<β ν_αβ r_αβ^βw_β -r_αβ^αw_α ^2. This is the appropriate obstruction when the full local states are already given. Such a family glues exactly if and only if its mismatch vector itself vanishes. No cohomological quotient is needed for that direct question.
Exact mathematical passage
\boxed{ \mathcal E_{\mathrm{ov}}(w) = \|\delta^0w\|^2 = \sum_{\alpha<\beta} \nu_{\alpha\beta} \left\| r_{\alpha\beta}^{\beta}w_\beta -r_{\alpha\beta}^{\alpha}w_\alpha \right\|^2. }
\sum_{\alpha\in A}Use in source · 1 passage
Search aliases: ∑_α∈ A sum alpha in
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 415
[Zeroth descent cohomology] For every finite edge-complete cover, mathscr W(G) ≅ check H^0( U;mathscr W) = kerδ^0. In finite dimensions, dimmathscr W(G) = ∑_α∈ Adimmathscr W_α - rank(δ^0).
Exact mathematical passage
\boxed{ \dim\mathscr W(G) = \sum_{\alpha\in A}\dim\mathscr W_\alpha - \operatorname{rank}(\delta^0). }
\sum_\iotaUse in source · 1 passage
Search aliases: ∑_ι sum iota
Use in source · 06-dynamic-workspace-theory.tex, line 433
Define the observational alignment defect by δ_align^obs(W_t) = I_ P(Y_t^+; H_tmid W_t). For a countable intervention family with declared weights q_ι>0, ∑_ι q_ι=1, define δ_align^ I(W_t) = ∑_ι∈ I q_ι I_ P^ι (Y_t^+; H_tmid W_t). For bounded decision losses, Proposition~[source reference] applies under each intervention and gives the weighted bound ∑_ιq_ι [ Risk_ℓ^ι(W_t) - Risk_ℓ^ι( H_t) ] ≤ sqrtfrac δ_align^ I(W_t)2.
Exact mathematical passage
\sum_\iota q_\iota=1
\sum_{\iota}Use in source · 1 passage
Search aliases: ∑_ι sum iota
Use in source · 06-dynamic-workspace-theory.tex, line 446
hbf H_tmid W_t). For a countable intervention family with declared weights q_ι>0, ∑_ι q_ι=1, define δ_align^ I(W_t) = ∑_ι∈ I q_ι I_ P^ι (Y_t^+; H_tmid W_t). For bounded decision losses, Proposition~[source reference] applies under each intervention and gives the weighted bound ∑_ιq_ι [ Risk_ℓ^ι(W_t) - Risk_ℓ^ι( H_t) ] ≤ sqrtfrac δ_align^ I(W_t)2.
Exact mathematical passage
\sum_{\iota}q_\iota \left[ \Risk_\ell^{\iota}(W_t) - \Risk_\ell^{\iota}(\mathbf H_t) \right] \leq \sqrt{\frac{ \delta_{\mathrm{align}}^{\mathcal I}(W_t)}{2}}.
\sum_{\iota\in\mathcal I}Use in source · 1 passage
Search aliases: ∑_ι∈ I sum iota in mathcal
Use in source · 06-dynamic-workspace-theory.tex, line 434
Define the observational alignment defect by δ_align^obs(W_t) = I_ P(Y_t^+; H_tmid W_t). For a countable intervention family with declared weights q_ι>0, ∑_ι q_ι=1, define δ_align^ I(W_t) = ∑_ι∈ I q_ι I_ P^ι (Y_t^+; H_tmid W_t). For bounded decision losses, Proposition~[source reference] applies under each intervention and gives the weighted bound ∑_ιq_ι [ Risk_ℓ^ι(W_t) - Risk_ℓ^ι( H_t) ] ≤ sqrtfrac δ_align^ I(W_t)2.
Exact mathematical passage
\boxed{ \delta_{\mathrm{align}}^{\mathcal I}(W_t) = \sum_{\iota\in\mathcal I} q_\iota I_{\mathbb P^\iota} (Y_t^+;\mathbf H_t\mid W_t). }
\sum_{\omega\in B}Use in source · 1 passage
Search aliases: ∑_ω∈ B sum omega in
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 299
A more stable quantity measures primitive carrier cost. Let w_ω>0 be a declared cost for each ω∈Ω, and assign a block the cost c(B)=∑_ω∈ Bw_ω. Define the sufficient support cost s_ε( D) = min_S⊆ V_ D { ∑_B∈ Sc(B): Risk_ D(S) ≤ Risk_ D(V_ D)+ε }. If D_fpreceq D_c is information faithful, then s_ε( D_f) ≤ s_ε( D_c). The fine decomposition permits every union of coarse blocks and may also permit cheaper sub-block coalitions. Equality holds whenever an optimal fine coalition is a union of complete c…
Exact mathematical passage
c(B)=\sum_{\omega\in B}w_\omega.
\inftyUse in source · 11 passages
Search aliases: ∞ infty
Use in source · 04-approximate-workspaces.tex, line 402
[Separated spectral subspaces] Let A and B=A+E be self-adjoint operators. Let P be an A-spectral projector whose eigenvalues lie in ( -∞,a], and let widetilde Q be a B-spectral projector whose eigenvalues lie in [b,∞), with b>a. Then Pwidetilde Q ≤ frac E b-a.
Exact mathematical passage
( -\infty,a]
\capUse in source · 1 passage
Search aliases: ∩ cap
Use in source · 14-scaffolded-and-endogenous-formation.tex, line 171
cal D = D_form sqcup D_cal sqcup D_cert. The formation sample selects widehatθ. The calibration sample fixes thresholds, regularization strengths, and intervention magnitudes. The certification sample evaluates the final gates without further structural selection. In a multi-environment study, the stronger requirement is E_form ∩ E_cert = ∅, so that the learned organization is tested under environments not used to construct it.
Exact mathematical passage
\mathcal E_{\mathrm{form}} \cap \mathcal E_{\mathrm{cert}} = \varnothing,
\intUse in source · 2 passages
Search aliases: ∫ int
Use in source · 04-approximate-workspaces.tex, line 430
nwidetilde Q, set A_P=PAP|_ran P, B_Q=widetilde QBwidetilde Q|_ranwidetilde Q. The operator X=Pwidetilde Q satisfies the Sylvester equation A_PX-XB_Q=-PEwidetilde Q. Let μ=(a+b)/2. Since e^t(A_P-μ I) ≤ e^-(b-a)t/2, e^-t(B_Q-μ I) ≤ e^-(b-a)t/2, the inverse Sylvester operator has the convergent integral representation X = ∫_0^∞ e^t(A_P-μ I) (PEwidetilde Q) e^-t(B_Q-μ I) dd t. Taking norms and integrating gives the result.
Exact mathematical passage
X = \int_0^\infty e^{t(A_P-\mu I)} (PE\widetilde Q) e^{-t(B_Q-\mu I)}\,\dd t.
\int_{\mathsf Y}Use in source · 1 passage
Search aliases: ∫_ Y int mathsf
Use in source · 06-dynamic-workspace-theory.tex, line 168
For every bounded measurable f: Y→ R, define Z_t(f)=∫_ Yf(y) Z_t( dy). By construction, E[f(Y_t^+)mid H_t]=Z_t(f). Since Z_t is a measurable function of H_t, the tower property gives E[f(Y_t^+)mid Z_t] = E[Z_t(f)mid Z_t] = Z_t(f). Hence conditioning additionally on H_t does not change the conditional expectation, which is the stated conditional independence.
Exact mathematical passage
Z_t(f)=\int_{\mathsf Y}f(y)\,Z_t(\mathrm dy).
\int_0^\inftyUse in source · 1 passage
Search aliases: ∫_0^∞ int infty
Use in source · 04-approximate-workspaces.tex, line 430
nwidetilde Q, set A_P=PAP|_ran P, B_Q=widetilde QBwidetilde Q|_ranwidetilde Q. The operator X=Pwidetilde Q satisfies the Sylvester equation A_PX-XB_Q=-PEwidetilde Q. Let μ=(a+b)/2. Since e^t(A_P-μ I) ≤ e^-(b-a)t/2, e^-t(B_Q-μ I) ≤ e^-(b-a)t/2, the inverse Sylvester operator has the convergent integral representation X = ∫_0^∞ e^t(A_P-μ I) (PEwidetilde Q) e^-t(B_Q-μ I) dd t. Taking norms and integrating gives the result.
Exact mathematical passage
X = \int_0^\infty e^{t(A_P-\mu I)} (PE\widetilde Q) e^{-t(B_Q-\mu I)}\,\dd t.
\sim_{\mathrm{goal}}Use in source · 1 passage
Search aliases: ∼_goal sim mathrm
Use in source · 16-agency-counterfactual-control-and-self-maintenance.tex, line 110
Two goal codes are operationally equivalent, g∼_goalg', when they induce the same action ordering in every declared state and intervention background: Q_t^g(amid w) ≥ Q_t^g(a'mid w) Longleftrightarrow Q_t^g'(amid w) ≥ Q_t^g'(a'mid w). The abstract goal is the equivalence class [g]_goal. This quotient prevents a mere invertible recoding of a goal channel from being reported as a change of objective. For quantitative regret bounds, a representative normalization of U_g must nevertheless be fixed.
Exact mathematical passage
g\sim_{\mathrm{goal}}g',
\sim_YUse in source · 1 passage
Search aliases: ∼_Y sim
Use in source · 06-dynamic-workspace-theory.tex, line 112
The quotient notation [ H_t]_∼_Y expresses the right intuition but hides measurability and null-set issues. A canonical construction is obtained from regular conditional distributions.
Exact mathematical passage
[\mathbf H_t]_{\sim_Y}
\congUse in source · 28 passages
Search aliases: ≅ cong
Use in source · 01-foundational-thesis.tex, line 284
Distinct implementations may instantiate the same abstract workspace: R≠ R', R≃ R' Longrightarrow Workspace( R)≅Workspace( R').
Exact mathematical passage
\mathfrak R\neq\mathfrak R', \qquad \mathfrak R\simeq\mathfrak R' \Longrightarrow \Workspace(\mathfrak R)\cong\Workspace(\mathfrak R').
\approxUse in source · 4 passages
Search aliases: ≈ approx
Use in source · 04-approximate-workspaces.tex, line 241
The spectrum supports three distinct interpretations: rcl λ_k=0 · Longleftrightarrow · exact compatible direction, 0<λ_kll g_d · Longrightarrow · approximately transported direction, λ_k≈λ_k+1 · Longrightarrow · rank selection is unstable at that boundary. A low eigenvalue can still be scientifically spurious if it arises from a poorly chosen weight, a nearly disconnected graph, or a noncausal encoding. The causal and null gates in later parts remain necessary.
Exact mathematical passage
\begin{array}{rcl} \lambda_k=0 &\Longleftrightarrow& \text{exact compatible direction},\\ 0<\lambda_k\ll g_d &\Longrightarrow& \text{approximately transported direction},\\ \lambda_k\approx\lambda_{k+1} &\Longrightarrow& \text{rank selection is unstable at that boundary}. \end{array}
\bigoplus_{b<c}Use in source · 1 passage
Search aliases: ⊕_b<c bigoplus
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 918
A finite workspace hierarchy is a rooted tree T. Each node a∈ T carries a subgraph G_a. The root r carries G_r=G. For every internal node a, its children Ch(a) form a finite edge-complete cover of G_a. Leaves carry primitive local workspace spaces W_ℓ=mathscr W(G_ℓ). For an internal node, define recursively W_a = ker ( δ_a^0: ⊕_b∈Ch(a)W_b ⟶ ⊕_b<cW_bc ), where the overlap spaces and restrictions are inherited from the child cover.
Exact mathematical passage
\boxed{ W_a = \ker \left( \delta_a^0: \bigoplus_{b\in\operatorname{Ch}(a)}W_b \longrightarrow \bigoplus_{b<c}W_{bc} \right), }
\bigoplus_{b\in\operatorname{Ch}(a)}Use in source · 1 passage
Search aliases: ⊕_b∈Ch(a) bigoplus in operatorname
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 918
A finite workspace hierarchy is a rooted tree T. Each node a∈ T carries a subgraph G_a. The root r carries G_r=G. For every internal node a, its children Ch(a) form a finite edge-complete cover of G_a. Leaves carry primitive local workspace spaces W_ℓ=mathscr W(G_ℓ). For an internal node, define recursively W_a = ker ( δ_a^0: ⊕_b∈Ch(a)W_b ⟶ ⊕_b<cW_bc ), where the overlap spaces and restrictions are inherited from the child cover.
Exact mathematical passage
\boxed{ W_a = \ker \left( \delta_a^0: \bigoplus_{b\in\operatorname{Ch}(a)}W_b \longrightarrow \bigoplus_{b<c}W_{bc} \right), }
\bigoplus_{e\in E}Use in source · 5 passages
Search aliases: ⊕_e∈ E bigoplus in
Use in source · 04-approximate-workspaces.tex, line 15
rfectly under every transfer. Approximate theory asks three more realistic questions: item how strongly a candidate state violates edgewise compatibility; item whether a low-defect subspace is spectrally separated from incoherent directions; and item how that subspace changes when transfers, metrics, or operations are perturbed. Throughout Parts~IV--V, set C_V=⊕_i∈ VC_i, C_E=⊕_e∈ EC_t(e), with their Hilbert direct-sum inner products, and retain strictly positive weights w_e.
Exact mathematical passage
\mathcal C_V=\bigoplus_{i\in V}C_i, \qquad \mathcal C_E=\bigoplus_{e\in E}C_{t(e)},
\bigoplus_{i\in S}Use in source · 1 passage
Search aliases: ⊕_i∈ S bigoplus in
Use in source · 11-reconstruction-and-resilience.tex, line 37
For a coalition S⊆ V, define the analysis operator A_S:C_*⟶⊕_i∈ S Y_i, A_Sc=(E_ic)_i∈ S, and the coalition frame operator F_S=A_S^*A_S=∑_i∈ SE_i^*E_i. Set α_S=λ_min(F_S), β_S=λ_max(F_S). Thus α_S c ^2 ≤ A_Sc ^2 ≤ β_S c ^2.
Exact mathematical passage
A_S:C_*\longrightarrow\bigoplus_{i\in S}\mathsf Y_i, \qquad A_Sc=(E_ic)_{i\in S},
\bigoplus_{j=1}^mUse in source · 1 passage
Search aliases: ⊕_j=1^m bigoplus
Use in source · 22-integrated-worked-examples-and-case-studies.tex, line 1210
The first benchmark is the exact parity family from Topics~85--80. For m≥3, distribute m independent bits among nodes so that no individual node sees all bits, but specified coalitions do. The target is Y=⊕_j=1^m C_j. The benchmark measures: item the learned transfer-Laplacian spectrum; item coalition conditional entropy and log risk; item recovery of k_0; item robustness to edge and node ablations; item matched local-predictive null gaps; and item causal response to consistent versus inconsiste…
Exact mathematical passage
Y=\bigoplus_{j=1}^m C_j.
\bigoplus_\alphaUse in source · 2 passages
Search aliases: ⊕_α bigoplus alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 729
Define the exact meta-workspace mathscr W_meta( U) := ker B_ U ⊆ ⊕_αmathscr W_α. Theorem~[source reference] gives the canonical identification mathscr W_meta( U) ≅ mathscr W(G). Thus exact formation of a workspace from local workspaces does not create an additional mysterious carrier. It gives a second presentation of the same global compatible-section object.
Exact mathematical passage
\boxed{ \mathscr W_{\mathrm{meta}}(\mathcal U) := \ker B_{\mathcal U} \subseteq \bigoplus_\alpha\mathscr W_\alpha. }
\bigoplus_{\alpha}Use in source · 1 passage
Search aliases: ⊕_α bigoplus alpha
Use in source · 02-static-core-transfer-theory.tex, line 93
Unless stated otherwise, connectedness means that |G| is connected. A root o∈ V may then be joined to every vertex by a path in the underlying graph. If G has several connected components, the theory applies to each component and Γ(H) ≅ ⊕_αΓ(H|_G_α).
Exact mathematical passage
\Gamma(H) \cong \bigoplus_{\alpha}\Gamma(H|_{G_\alpha}).
\bigoplus_{\alpha<\beta}Use in source · 1 passage
Search aliases: ⊕_α<β bigoplus alpha beta
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 770
Suppose local operations A_α:mathscr W_α→mathscr W_α and overlap operations A_αβ:mathscr W_αβ→ mathscr W_αβ satisfy r_αβ^αA_α = A_αβr_αβ^α, r_αβ^βA_β = A_αβr_αβ^β. Then, with A^0=⊕_α A_α and A^1=⊕_α<βA_αβ, B_ UA^0=A^1B_ U. Therefore A^0ker B_ U⊆ker B_ U. The operation-closure theorem from Part~III reappears at the meta level: operations on subworkspaces descend globally precisely when they agree on interfaces.
Exact mathematical passage
A^1=\bigoplus_{\alpha<\beta}A_{\alpha\beta}
\bigoplus_{\alpha=1}^{m}Use in source · 2 passages
Search aliases: ⊕_α=1^m bigoplus alpha
Use in source · 17-decomposition-coarse-graining-and-robust-relationality.tex, line 104
Let the vertex set of a core-transfer diagram be partitioned as V=V_1sqcup⋯sqcup V_m. Write the transfer discrepancy as D_H = D_int D_∂ , D_int = ⊕_α=1^mD_α, where D_α contains the edge constraints internal to V_α, and D_∂ contains the constraints crossing between blocks. Define the internally coherent macro-state spaces W_α=ker D_α, W_Π=⊕_α=1^mW_α. Let J_Π:W_Π↪ C_V be the canonical isometric inclusion, and define the quotient discrepancy D_Π=D_∂J_Π. The quotient does not replace a group of node…
Exact mathematical passage
D_H = \begin{pmatrix} D_{\mathrm{int}}\\ D_{\partial} \end{pmatrix}, \qquad D_{\mathrm{int}} = \bigoplus_{\alpha=1}^{m}D_\alpha,
\bigoplus_{\alpha_0<\cdots<\alpha_p}Use in source · 1 passage
Search aliases: ⊕_α_0<⋯<α_p bigoplus alpha cdots alpha
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 127
For p≥0, define the finite cochain space check C^p( U;mathscr W) = ⊕_α_0<⋯<α_p mathscr W(G_α_0⋯α_p), where empty intersections contribute the zero space. The coboundary δ^p:check C^p⟶check C^p+1 is (δ^p s)_α_0⋯α_p+1 = ∑_j=0^p+1(-1)^j r_α_0⋯α_p+1^% α_0⋯widehatα_j⋯α_p+1 % s_α_0⋯widehatα_j⋯α_p+1. The restriction identities imply δ^p+1δ^p=0. For a local family w=(w_α)_α, (δ^0w)_αβ = r_αβ^βw_β - r_αβ^αw_α. Thus δ^0 is the overlap-discrepancy operator at the level of exact local workspaces.
Exact mathematical passage
\check C^p(\mathcal U;\mathscr W) = \bigoplus_{\alpha_0<\cdots<\alpha_p} \mathscr W(G_{\alpha_0\cdots\alpha_p}),
\bigoplus_{\alpha\in A}Use in source · 2 passages
Search aliases: ⊕_α∈ A bigoplus alpha in
Use in source · 13-gluing-and-workspaces-of-workspaces.tex, line 556
Local candidates may also violate their internal transfer equations. Define the local-copy space widehat C_ U = ⊕_α∈ A C_V(G_α) and the block internal discrepancy widehat D_ U = ⊕_α∈ AD_G_α. For u=(u_α)_α∈widehat C_ U, define the raw overlap synchronization operator (S_ Uu)_αβ = ρ_G_αβ^G_βu_β - ρ_G_αβ^G_αu_α. For an overlap weight λ_ov>0, set K_ U = widehat D_ U
Exact mathematical passage
\widehat{\mathcal C}_{\mathcal U} = \bigoplus_{\alpha\in A}\mathcal C_V(G_\alpha)
\bigcap_{q=1}^{r}Use in source · 1 passage
Search aliases: ⋂_q=1^r bigcap
Use in source · 03-exact-shared-cores.tex, line 141
[Finite obstruction set] Let e_1,…,e_r be the non-tree edges of a connected finite graph. Then C_* = ⋂_q=1^r ker(H_γ_e_q-I).
Exact mathematical passage
C_* = \bigcap_{q=1}^{r} \ker(H_{\gamma_{e_q}}-I).
\bigcap_{\gamma:o\to o}Use in source · 2 passages
Search aliases: ⋂_γ:o→ o bigcap gamma to
Use in source · 03-exact-shared-cores.tex, line 107
The obstruction associated with a loop is Ω_γ=H_γ-I_C_o. The maximal path-independent root core is C_* = ⋂_γ:o→ oker(H_γ-I). Equivalently, C_*=C_o^Hol_o=Fix(Hol_o).
Exact mathematical passage
\boxed{ C_* = \bigcap_{\gamma:o\to o}\ker(H_\gamma-I). }
\bigcup_{S\in\mathcal L}Use in source · 1 passage
Search aliases: ⋃_S∈ L bigcup in mathcal
Use in source · 23-relation-to-prior-work.tex, line 65
mined by mathematical and operational equivalence, not by terminology. Let C be a claim in the paper and S a prior source. Write Spreccurlyeq C when the main content of C follows from S after admissible relabeling, restriction, or direct specialization. A substantive novelty residual exists only when the claim contains content not absorbed by the closure of known sources: Res(C) = C∖ Cl ( ⋃_S∈ LS ). This is a conceptual audit device rather than a set-theoretic definition of ideas. Its purpose is…
Exact mathematical passage
\operatorname{Res}(C) = C\setminus \operatorname{Cl} \left( \bigcup_{S\in\mathcal L}S \right).
\langleUse in source · 8 passages
Search aliases: ⟨ langle
Use in source · 04-approximate-workspaces.tex, line 84
[Positivity and variational identity] The transfer Laplacian is self-adjoint and positive semidefinite. For every c∈ C_V, ⟨ c,L_Hc⟩= E_H(c)≥0.
Exact mathematical passage
\langle c,L_Hc\rangle=\mathcal E_H(c)\geq0.
\rangleUse in source · 8 passages
Search aliases: ⟩ rangle
Use in source · 04-approximate-workspaces.tex, line 84
[Positivity and variational identity] The transfer Laplacian is self-adjoint and positive semidefinite. For every c∈ C_V, ⟨ c,L_Hc⟩= E_H(c)≥0.
Exact mathematical passage
\langle c,L_Hc\rangle=\mathcal E_H(c)\geq0.
\rangle_iUse in source · 1 passage
Search aliases: ⟩_i rangle
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 181
A pure change of coordinates should transform the metric as well as the matrices. On each transformed space, define ⟨ u,v⟩_i^g = ⟨ g_i^-1u,g_i^-1v⟩_i. Use the analogous pullback metric on every edge copy. Then G_V and G_E are unitary between the original and transformed metric spaces. Consequently, the complete transfer-Laplacian spectrum is exactly preserved.
Exact mathematical passage
\langle u,v\rangle_i^g = \left\langle g_i^{-1}u,g_i^{-1}v\right\rangle_i.
\rangle_i^gUse in source · 1 passage
Search aliases: ⟩_i^g rangle
Use in source · 05-gauge-invariance-and-abstract-identity.tex, line 181
A pure change of coordinates should transform the metric as well as the matrices. On each transformed space, define ⟨ u,v⟩_i^g = ⟨ g_i^-1u,g_i^-1v⟩_i. Use the analogous pullback metric on every edge copy. Then G_V and G_E are unitary between the original and transformed metric spaces. Consequently, the complete transfer-Laplacian spectrum is exactly preserved.
Exact mathematical passage
\langle u,v\rangle_i^g = \left\langle g_i^{-1}u,g_i^{-1}v\right\rangle_i.
Source coverage
Automatic extraction covers TeX and Markdown math delimiters and common equation environments in these selected files. It does not interpret diagrams, images, PDF text, program identifiers, or historical archives. Occurrences are navigation aids, not a proof review.
Download all entries, passages and source checksums (JSON) · Collection coverage
- research/stratified-relational-workspace/README.md · 1 mathematical passage
- research/stratified-relational-workspace/audits/README.md · 0 mathematical passages
- research/stratified-relational-workspace/docs/AI_ASSISTANCE_DISCLOSURE.md · 0 mathematical passages
- research/stratified-relational-workspace/monograph/Stratified_Relational_Workspace_Theory.tex · 0 mathematical passages
- research/stratified-relational-workspace/monograph/frontmatter.tex · 3 mathematical passages
- research/stratified-relational-workspace/monograph/parts/01-foundational-thesis.tex · 57 mathematical passages
- research/stratified-relational-workspace/monograph/parts/02-static-core-transfer-theory.tex · 102 mathematical passages
- research/stratified-relational-workspace/monograph/parts/03-exact-shared-cores.tex · 159 mathematical passages
- research/stratified-relational-workspace/monograph/parts/04-approximate-workspaces.tex · 195 mathematical passages
- research/stratified-relational-workspace/monograph/parts/05-gauge-invariance-and-abstract-identity.tex · 51 mathematical passages
- research/stratified-relational-workspace/monograph/parts/06-dynamic-workspace-theory.tex · 126 mathematical passages
- research/stratified-relational-workspace/monograph/parts/07-relational-irreducibility.tex · 88 mathematical passages
- research/stratified-relational-workspace/monograph/parts/08-causal-efficacy-and-reentry.tex · 69 mathematical passages
- research/stratified-relational-workspace/monograph/parts/09-formal-workspace-definition.tex · 17 mathematical passages
- research/stratified-relational-workspace/monograph/parts/10-persistence.tex · 80 mathematical passages
- research/stratified-relational-workspace/monograph/parts/11-reconstruction-and-resilience.tex · 122 mathematical passages
- research/stratified-relational-workspace/monograph/parts/12-identity-through-time-and-replacement.tex · 123 mathematical passages
- research/stratified-relational-workspace/monograph/parts/13-gluing-and-workspaces-of-workspaces.tex · 228 mathematical passages
- research/stratified-relational-workspace/monograph/parts/14-scaffolded-and-endogenous-formation.tex · 114 mathematical passages
- research/stratified-relational-workspace/monograph/parts/15-boundary-formation-and-stability.tex · 61 mathematical passages
- research/stratified-relational-workspace/monograph/parts/16-agency-counterfactual-control-and-self-maintenance.tex · 203 mathematical passages
- research/stratified-relational-workspace/monograph/parts/17-decomposition-coarse-graining-and-robust-relationality.tex · 121 mathematical passages
- research/stratified-relational-workspace/monograph/parts/18-specification-robustness-identifiability-and-statistical-certification.tex · 173 mathematical passages
- research/stratified-relational-workspace/monograph/parts/19-summary-of-main-results.tex · 148 mathematical passages
- research/stratified-relational-workspace/monograph/parts/20-conjectures-and-open-mathematical-directions.tex · 54 mathematical passages
- research/stratified-relational-workspace/monograph/parts/21-empirical-certification-and-reporting-protocol.tex · 62 mathematical passages
- research/stratified-relational-workspace/monograph/parts/22-integrated-worked-examples-and-case-studies.tex · 196 mathematical passages
- research/stratified-relational-workspace/monograph/parts/23-relation-to-prior-work.tex · 89 mathematical passages
- research/stratified-relational-workspace/monograph/parts/24-theory-hierarchy.tex · 13 mathematical passages
- research/stratified-relational-workspace/monograph/parts/25-unified-formulation.tex · 2 mathematical passages
- research/stratified-relational-workspace/monograph/parts/26-discussion-limitations-and-philosophical-consequences.tex · 7 mathematical passages
- research/stratified-relational-workspace/monograph/references.tex · 0 mathematical passages
- research/stratified-relational-workspace/verification/README.md · 0 mathematical passages
PDF reading editions (1)
The text index does not extract PDF glyphs. Check the reading edition for notation in figures, tables, and PDF-only material.