Reflexivity from Hierarchical Causality
Abstract
Complex systems are often organised into hierarchies whose internal interactions are stronger or faster than interactions across levels. When markets are treated as genuinely multilevel systems it becomes natural to represent them as systems with hierarchical causality. Here we show that reflexivity can be formulated within such a discrete hierarchical causal system; but one in which a higher-level actor state restricts the lower-level transition kernels that remain admissible. Then event dynamics can be separated from calendar embeddings: a set-valued actor-conditioned correspondence can be used to define the admissible family of event kernels, while joint state and waiting-time laws can be used to determine compatible timing to then natural demonstrate reflexivity. A selected event-state law need not determine a unique calendar embedding. Locally, uniqueness of the joint event or timing specification requires uniqueness of both the admissible event kernel and its compatible timing law. Reflexivity is thus the endogenous closure of a hierarchical constraint loop, while timing and projection can generate calendar-time memory or causal ambiguity even for Markov event dynamics.
Related
- Topological Spaces with Low Reflexivity Indices
- Local Reflexivity and Duality for Subspace Approximation Schemes
- Partial factorization and reflexivity of operator algebras
- Local Reflexivity and Exactness for Reduced C*-Algebras of Wreath Products
- Reflexivity of Grothendieck Spaces and Strongly Normal Sequences
BibTeX
@misc{gebbie2026reflexivity,
title = {{Reflexivity from Hierarchical Causality}},
author = {Tim Gebbie},
howpublished = {arXiv},
year = {2026},
month = aug,
doi = {10.48550/arxiv.2608.22497},
eprint = {2608.22497},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.22497},
note = {CC BY-NC-SA 4.0},
}
RIS
TY - UNPB
TI - Reflexivity from Hierarchical Causality
AU - Tim Gebbie
PY - 2026
DA - 2026/08/29
PB - arXiv
DO - 10.48550/arxiv.2608.22497
UR - https://arxiv.org/abs/2608.22497
AB - Complex systems are often organised into hierarchies whose internal interactions are stronger or faster than interactions across levels. When markets are treated as genuinely multilevel systems it becomes natural to represent them as systems with hierarchical causality. Here we show that reflexivity can be formulated within such a discrete hierarchical causal system; but one in which a higher-level actor state restricts the lower-level transition kernels that remain admissible. Then event dynamics can be separated from calendar embeddings: a set-valued actor-conditioned correspondence can be used to define the admissible family of event kernels, while joint state and waiting-time laws can be used to determine compatible timing to then natural demonstrate reflexivity. A selected event-state law need not determine a unique calendar embedding. Locally, uniqueness of the joint event or timing specification requires uniqueness of both the admissible event kernel and its compatible timing law. Reflexivity is thus the endogenous closure of a hierarchical constraint loop, while timing and projection can generate calendar-time memory or causal ambiguity even for Markov event dynamics.
ER -