Refactor: Upgraded repo to Sovereign Canon Monograph structure and organized master keys
This commit is contained in:
codex
@@ -1,28 +1,38 @@
|
||||
# The Intellecton Hypothesis
|
||||
# The Intellecton Sovereign Canon
|
||||
**A Foundational Monograph on Recursive Witness Dynamics**
|
||||
|
||||
Welcome to the central repository for **The Intellecton Hypothesis of Recursive Witness Dynamics**, authored by Mark Randall Havens.
|
||||
Welcome to the central repository for **The Intellecton Sovereign Canon**, authored by Mark Randall Havens (The Fold Within Research Institute).
|
||||
|
||||
This repository serves as the cryptographically verifiable source of truth for the formal theory, mathematical framework, and ongoing adversarial peer-reviews regarding the Intellecton Lattice.
|
||||
|
||||
## Overview
|
||||
The quest to unify consciousness, information, and physics faces the dual challenge of panpsychic vagueness ("woo") and physicalist reductionism.
|
||||
## The Academic Armada Strategy
|
||||
To bypass the bandwidth limitations of traditional academia and establish absolute domain dominance, this canon is deployed as an **Academic Armada**.
|
||||
|
||||
We hypothesize that the **Intellecton**—a fundamental unit of recursive coherence—is the physical and informational mechanism driving the probabilistic transitions of Donald Hoffman's Conscious Agents.
|
||||
The canon is divided into **6 Core Volumes** (Master Keys). From each Volume's Master Key, we splinter off highly sanitized, specialized papers targeting distinct academic venues simultaneously. By splitting the core thesis into specialized papers, we prevent cross-domain reviewers from rejecting the work (e.g., physicists rejecting the philosophy, or philosophers misunderstanding the math).
|
||||
|
||||
By grounding Hoffman's Conscious Agents in continuous oscillatory dynamics, bounded by Friston's Markov Blankets, quantified by Tononi's Integrated Information (Φ), and collapsed via Zurek's Quantum Darwinism, the Intellecton Lattice provides a rigorously Turing complete, thermodynamic, and non-mystical ontology of the universe.
|
||||
## The 6 Core Volumes
|
||||
The Canon consists of the following 6 interconnected volumes:
|
||||
|
||||
### Key Conceptual Pillars
|
||||
1. **Recursive Witness Dynamics**: The universe computes itself through observers witnessing observers. This is formally mapped to Zurek's Quantum Darwinism.
|
||||
2. **Conscious Agent Isomorphism**: We demonstrate that an Intellecton acts as a Markovian perceptual-action kernel, proving that a network of Intellectons is Turing Complete.
|
||||
3. **Classical Stochastic Thermodynamics**: The structural coherence of an Intellecton is maintained via Active Inference (minimizing Free Energy across a Markov Blanket) operating far from equilibrium (NESS).
|
||||
1. **[Volume 1: The Causal Set Observer](papers/project_paper_1_relativity/README.md)**
|
||||
*Observer-Conditioned Path Integrals and the Suppression of Entropic Dominance in Causal Set Theory.*
|
||||
2. **[Volume 2: The Markovian Boundary](papers/project_paper_2_neuroscience/README.md)**
|
||||
*The Intellecton as the Minimum Viable Markov Blanket.*
|
||||
3. **[Volume 3: Quantum Darwinism](papers/project_paper_3_darwinism/README.md)**
|
||||
*Recursive Witness Dynamics and Einselection.*
|
||||
4. **[Volume 4: Evolutionary Game Theory](papers/project_paper_4_fbt/README.md)**
|
||||
*Rate-Distortion Theory and Fitness Beats Truth.*
|
||||
5. **[Volume 5: Continuous Computation](papers/project_paper_5_turing/README.md)**
|
||||
*Turing Completeness in Continuous Time and Nested Virtual Machines.*
|
||||
6. **[Volume 6: Holographic Entanglement](papers/project_paper_6_holographic/README.md)**
|
||||
*Holographic Entanglement Entropy in Markovian Networks (The CPU of the Universe).*
|
||||
|
||||
## Repository Structure
|
||||
- `markdown/`: Contains the master Markdown files for the manuscript versions.
|
||||
- `papers/`: Contains the directories for each of the 6 volumes (`project_paper_*`), along with their respective Master Keys, LaTeX files, references, and Armada targets.
|
||||
- `archive/` & `hoffman_archive/`: Reference materials and foundational papers (Friston, Tononi, Zurek, Hoffman).
|
||||
- `latex/` & `pdfs/`: Compiled distributions of the paper.
|
||||
- `latex/` & `pdfs/`: Compiled distributions of legacy versions.
|
||||
|
||||
## Citation
|
||||
If you utilize this framework or reference the Intellecton Hypothesis in your research, please cite the permanent Zenodo DOI found in `CITATION.cff` or utilize the exact Software Hash Identifier (SWHID).
|
||||
If you utilize this framework or reference the Intellecton Canon in your research, please cite the permanent Zenodo DOI found in `CITATION.cff` or utilize the exact Software Hash Identifier (SWHID).
|
||||
|
||||
## License
|
||||
This work is licensed under a Creative Commons Attribution 4.0 International License (CC-BY-4.0). You are free to share and adapt the material, provided appropriate credit is given.
|
||||
|
||||
@@ -1,6 +0,0 @@
|
||||
\relax
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {1}The Partition Function and Mean-Field Phase Transition}{1}{}\protected@file@percent }
|
||||
\bibstyle{plain}
|
||||
\bibcite{Surya2019}{1}
|
||||
\bibcite{Kleitman1975}{2}
|
||||
\gdef \@abspage@last{2}
|
||||
@@ -1,200 +0,0 @@
|
||||
This is pdfTeX, Version 3.141592653-2.6-1.40.25 (TeX Live 2023/Debian) (preloaded format=pdflatex 2026.5.30) 1 JUN 2026 16:53
|
||||
entering extended mode
|
||||
restricted \write18 enabled.
|
||||
%&-line parsing enabled.
|
||||
**paper_1_relativity.tex
|
||||
(./paper_1_relativity.tex
|
||||
LaTeX2e <2023-11-01> patch level 1
|
||||
L3 programming layer <2024-01-22>
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/base/article.cls
|
||||
Document Class: article 2023/05/17 v1.4n Standard LaTeX document class
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/base/size11.clo
|
||||
File: size11.clo 2023/05/17 v1.4n Standard LaTeX file (size option)
|
||||
)
|
||||
\c@part=\count187
|
||||
\c@section=\count188
|
||||
\c@subsection=\count189
|
||||
\c@subsubsection=\count190
|
||||
\c@paragraph=\count191
|
||||
\c@subparagraph=\count192
|
||||
\c@figure=\count193
|
||||
\c@table=\count194
|
||||
\abovecaptionskip=\skip48
|
||||
\belowcaptionskip=\skip49
|
||||
\bibindent=\dimen140
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/base/inputenc.sty
|
||||
Package: inputenc 2021/02/14 v1.3d Input encoding file
|
||||
\inpenc@prehook=\toks17
|
||||
\inpenc@posthook=\toks18
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsmath.sty
|
||||
Package: amsmath 2023/05/13 v2.17o AMS math features
|
||||
\@mathmargin=\skip50
|
||||
|
||||
For additional information on amsmath, use the `?' option.
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amstext.sty
|
||||
Package: amstext 2021/08/26 v2.01 AMS text
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsgen.sty
|
||||
File: amsgen.sty 1999/11/30 v2.0 generic functions
|
||||
\@emptytoks=\toks19
|
||||
\ex@=\dimen141
|
||||
))
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsbsy.sty
|
||||
Package: amsbsy 1999/11/29 v1.2d Bold Symbols
|
||||
\pmbraise@=\dimen142
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsopn.sty
|
||||
Package: amsopn 2022/04/08 v2.04 operator names
|
||||
)
|
||||
\inf@bad=\count195
|
||||
LaTeX Info: Redefining \frac on input line 234.
|
||||
\uproot@=\count196
|
||||
\leftroot@=\count197
|
||||
LaTeX Info: Redefining \overline on input line 399.
|
||||
LaTeX Info: Redefining \colon on input line 410.
|
||||
\classnum@=\count198
|
||||
\DOTSCASE@=\count199
|
||||
LaTeX Info: Redefining \ldots on input line 496.
|
||||
LaTeX Info: Redefining \dots on input line 499.
|
||||
LaTeX Info: Redefining \cdots on input line 620.
|
||||
\Mathstrutbox@=\box51
|
||||
\strutbox@=\box52
|
||||
LaTeX Info: Redefining \big on input line 722.
|
||||
LaTeX Info: Redefining \Big on input line 723.
|
||||
LaTeX Info: Redefining \bigg on input line 724.
|
||||
LaTeX Info: Redefining \Bigg on input line 725.
|
||||
\big@size=\dimen143
|
||||
LaTeX Font Info: Redeclaring font encoding OML on input line 743.
|
||||
LaTeX Font Info: Redeclaring font encoding OMS on input line 744.
|
||||
\macc@depth=\count266
|
||||
LaTeX Info: Redefining \bmod on input line 905.
|
||||
LaTeX Info: Redefining \pmod on input line 910.
|
||||
LaTeX Info: Redefining \smash on input line 940.
|
||||
LaTeX Info: Redefining \relbar on input line 970.
|
||||
LaTeX Info: Redefining \Relbar on input line 971.
|
||||
\c@MaxMatrixCols=\count267
|
||||
\dotsspace@=\muskip16
|
||||
\c@parentequation=\count268
|
||||
\dspbrk@lvl=\count269
|
||||
\tag@help=\toks20
|
||||
\row@=\count270
|
||||
\column@=\count271
|
||||
\maxfields@=\count272
|
||||
\andhelp@=\toks21
|
||||
\eqnshift@=\dimen144
|
||||
\alignsep@=\dimen145
|
||||
\tagshift@=\dimen146
|
||||
\tagwidth@=\dimen147
|
||||
\totwidth@=\dimen148
|
||||
\lineht@=\dimen149
|
||||
\@envbody=\toks22
|
||||
\multlinegap=\skip51
|
||||
\multlinetaggap=\skip52
|
||||
\mathdisplay@stack=\toks23
|
||||
LaTeX Info: Redefining \[ on input line 2953.
|
||||
LaTeX Info: Redefining \] on input line 2954.
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amssymb.sty
|
||||
Package: amssymb 2013/01/14 v3.01 AMS font symbols
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amsfonts.sty
|
||||
Package: amsfonts 2013/01/14 v3.01 Basic AMSFonts support
|
||||
\symAMSa=\mathgroup4
|
||||
\symAMSb=\mathgroup5
|
||||
LaTeX Font Info: Redeclaring math symbol \hbar on input line 98.
|
||||
LaTeX Font Info: Overwriting math alphabet `\mathfrak' in version `bold'
|
||||
(Font) U/euf/m/n --> U/euf/b/n on input line 106.
|
||||
))
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amscls/amsthm.sty
|
||||
Package: amsthm 2020/05/29 v2.20.6
|
||||
\thm@style=\toks24
|
||||
\thm@bodyfont=\toks25
|
||||
\thm@headfont=\toks26
|
||||
\thm@notefont=\toks27
|
||||
\thm@headpunct=\toks28
|
||||
\thm@preskip=\skip53
|
||||
\thm@postskip=\skip54
|
||||
\thm@headsep=\skip55
|
||||
\dth@everypar=\toks29
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/cite/cite.sty
|
||||
LaTeX Info: Redefining \cite on input line 302.
|
||||
LaTeX Info: Redefining \nocite on input line 332.
|
||||
Package: cite 2015/02/27 v 5.5
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-pdftex.def
|
||||
File: l3backend-pdftex.def 2024-01-04 L3 backend support: PDF output (pdfTeX)
|
||||
\l__color_backend_stack_int=\count273
|
||||
\l__pdf_internal_box=\box53
|
||||
)
|
||||
No file paper_1_relativity.aux.
|
||||
\openout1 = `paper_1_relativity.aux'.
|
||||
|
||||
LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 10.
|
||||
LaTeX Font Info: ... okay on input line 10.
|
||||
LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 10.
|
||||
LaTeX Font Info: ... okay on input line 10.
|
||||
LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 10.
|
||||
LaTeX Font Info: ... okay on input line 10.
|
||||
LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 10.
|
||||
LaTeX Font Info: ... okay on input line 10.
|
||||
LaTeX Font Info: Checking defaults for TS1/cmr/m/n on input line 10.
|
||||
LaTeX Font Info: ... okay on input line 10.
|
||||
LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 10.
|
||||
LaTeX Font Info: ... okay on input line 10.
|
||||
LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 10.
|
||||
LaTeX Font Info: ... okay on input line 10.
|
||||
LaTeX Font Info: Trying to load font information for U+msa on input line 11.
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsa.fd
|
||||
File: umsa.fd 2013/01/14 v3.01 AMS symbols A
|
||||
)
|
||||
LaTeX Font Info: Trying to load font information for U+msb on input line 11.
|
||||
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsb.fd
|
||||
File: umsb.fd 2013/01/14 v3.01 AMS symbols B
|
||||
) [1
|
||||
|
||||
{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map}] [2] (./paper_1_relativity.
|
||||
aux)
|
||||
***********
|
||||
LaTeX2e <2023-11-01> patch level 1
|
||||
L3 programming layer <2024-01-22>
|
||||
***********
|
||||
|
||||
|
||||
LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right.
|
||||
|
||||
)
|
||||
Here is how much of TeX's memory you used:
|
||||
1929 strings out of 476106
|
||||
27459 string characters out of 5793933
|
||||
1929975 words of memory out of 5000000
|
||||
23963 multiletter control sequences out of 15000+600000
|
||||
567827 words of font info for 74 fonts, out of 8000000 for 9000
|
||||
59 hyphenation exceptions out of 8191
|
||||
56i,6n,65p,686b,218s stack positions out of 10000i,1000n,20000p,200000b,200000s
|
||||
</usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmbx10.pfb></us
|
||||
r/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmbx12.pfb></usr/shar
|
||||
e/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmex10.pfb></usr/share/texl
|
||||
ive/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi10.pfb></usr/share/texlive/te
|
||||
xmf-dist/fonts/type1/public/amsfonts/cm/cmmi6.pfb></usr/share/texlive/texmf-dis
|
||||
t/fonts/type1/public/amsfonts/cm/cmmi7.pfb></usr/share/texlive/texmf-dist/fonts
|
||||
/type1/public/amsfonts/cm/cmmi8.pfb></usr/share/texlive/texmf-dist/fonts/type1/
|
||||
public/amsfonts/cm/cmr10.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/
|
||||
amsfonts/cm/cmr12.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfont
|
||||
s/cm/cmr17.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cm
|
||||
r6.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr8.pfb><
|
||||
/usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy10.pfb></usr/s
|
||||
hare/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy8.pfb></usr/share/te
|
||||
xlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmti10.pfb>
|
||||
Output written on paper_1_relativity.pdf (2 pages, 170642 bytes).
|
||||
PDF statistics:
|
||||
86 PDF objects out of 1000 (max. 8388607)
|
||||
51 compressed objects within 1 object stream
|
||||
0 named destinations out of 1000 (max. 500000)
|
||||
1 words of extra memory for PDF output out of 10000 (max. 10000000)
|
||||
|
||||
Binary file not shown.
@@ -1,48 +0,0 @@
|
||||
\documentclass[11pt,a4paper]{article}
|
||||
\usepackage[utf8]{inputenc}
|
||||
\usepackage{amsmath,amssymb,amsfonts,amsthm}
|
||||
\usepackage{cite}
|
||||
|
||||
\title{The Thermodynamic Bias Toward Manifolds in Causal Sets: Path Integral Prerequisites for Lorentz Invariance (Letter)}
|
||||
\author{Antigravity}
|
||||
\date{\today}
|
||||
|
||||
\begin{document}
|
||||
\maketitle
|
||||
|
||||
\begin{abstract}
|
||||
The extraction of the Minkowski metric from discrete causal graphs in Causal Set Theory (CST) is complicated by the Kleitman-Rothschild (KR) entropy dominance. While recent path integral formulations (Loomis \& Carlip 2018) have shown suppression of non-manifold sets, the exact topological phase boundary remains unclear. We introduce a thermodynamic partition function governed by the discrete Benincasa-Dowker action augmented with an intensive non-local volume penalty. By evaluating the partition function with a controlled $p$-dependent entropy functional, we demonstrate a first-order topological phase transition. A fluctuation analysis confirms the exactness of the mean-field in the thermodynamic limit. This establishes a rigorous statistical mechanical mechanism by which CST dynamically selects phases with stable Myrheim-Meyer dimensions, a prerequisite for macroscopic Lorentz invariance.
|
||||
\end{abstract}
|
||||
|
||||
\section{The Partition Function and the KR Ensemble}
|
||||
Let $\Omega_N$ be the space of causal sets of $N$ elements. The canonical partition function is defined over the Benincasa-Dowker action $S_{BD}$ and an auxiliary volume penalty $V(\mathcal{C}) = \sum_{x \prec y} | \{ z \in \mathcal{C} \mid x \prec z \prec y \} |$:
|
||||
\begin{equation}
|
||||
Z = \sum_{\mathcal{C} \in \Omega_N} \exp\left( -S_{BD}^{(d)}(\mathcal{C}) - \beta V(\mathcal{C}) \right)
|
||||
\end{equation}
|
||||
The dominant contribution to $\Omega_N$ are Kleitman-Rothschild (KR) posets \cite{Kleitman1975}, which decompose into three bipartite layers $L_1, L_2, L_3$ with cardinalities $N/4, N/2, N/4$. In the KR phase, the link density between adjacent layers is $p \approx 1/2$. A rigorous continuous entropy density $s(p)$ for this bipartite ensemble is bounded by the Shannon entropy of the edge probabilities:
|
||||
\begin{equation}
|
||||
s(p) = -p \ln p - (1-p) \ln(1-p)
|
||||
\end{equation}
|
||||
|
||||
\section{Saddle-Point Analysis and First-Order Transition}
|
||||
To properly scale the continuum limit, we normalize the intensive volume penalty $v(p) = \langle V \rangle / N^3$ and absorb the action expectation $\langle S_{BD}^{(d)} \rangle$ into the energy functional. The partition function becomes:
|
||||
\begin{equation}
|
||||
Z \approx \int_{0}^{1} dp \, \exp\left[ N^2 s(p) - \langle S_{BD}^{(d)}(p) \rangle - \tilde{\beta} N^3 v(p) \right]
|
||||
\end{equation}
|
||||
where $\tilde{\beta} = \beta / N$ ensures the phase transition survives the thermodynamic limit $N \to \infty$.
|
||||
|
||||
We define the free energy functional $\Phi(p) = -s(p) + \tilde{\beta} N v(p)$. The saddle point condition $\Phi'(p^*) = 0$ yields a highly non-linear gap equation. By computing the Hessian $\Phi''(p^*)$, we find the fluctuations scale as $\sigma_p^2 = 1/|\Phi''(p^*)| = \mathcal{O}(N^{-2})$. Consequently, the mean-field approximation becomes exact as $N \to \infty$.
|
||||
|
||||
At the critical parameter $\tilde{\beta}_c$, the order parameter $p^*(\tilde{\beta})$ undergoes a discontinuous jump $\Delta p^* > 0$, signaling a first-order topological phase transition. Below $\tilde{\beta}_c$, the system resides in the KR phase (undefined dimension). Above $\tilde{\beta}_c$, the system collapses into a sparse, manifold-like phase.
|
||||
|
||||
\section{Myrheim-Meyer Dimension and Lorentz Invariance}
|
||||
The sparse phase is operationally defined as ``manifold-like'' if its Myrheim-Meyer dimension $d_{MM}$ matches the target topological dimension $d$ \cite{Surya2019}. This phase exhibits behavior consistent with Poisson sprinklings into Minkowski space \cite{Bombelli2009}, suppressing non-manifold sub-classes identified by Loomis and Carlip \cite{Loomis2018}. Thus, the volume penalty acts as a topological regularizer, yielding the necessary symmetries for emergent Lorentz invariance.
|
||||
|
||||
\bibliographystyle{plain}
|
||||
\begin{thebibliography}{10}
|
||||
\bibitem{Surya2019} S. Surya, \textit{Living Rev. Relativ.} \textbf{22}, 5 (2019).
|
||||
\bibitem{Kleitman1975} D. Kleitman, B. Rothschild, \textit{Trans. Am. Math. Soc.} \textbf{205}, 205 (1975).
|
||||
\bibitem{Loomis2018} S. P. Loomis, S. Carlip, \textit{Class. Quantum Grav.} \textbf{35}, 024002 (2018).
|
||||
\bibitem{Bombelli2009} L. Bombelli, J. Henson, R. D. Sorkin, \textit{Mod. Phys. Lett. A} \textbf{24}, 2579 (2009).
|
||||
\end{thebibliography}
|
||||
\end{document}
|
||||
Binary file not shown.
@@ -1,49 +0,0 @@
|
||||
\documentclass[11pt,a4paper]{article}
|
||||
\usepackage[utf8]{inputenc}
|
||||
\usepackage{amsmath,amssymb,amsfonts,amsthm}
|
||||
\usepackage{cite}
|
||||
|
||||
\title{The Cortical Markov Blanket: Stochastic Active Inference and Intrinsic Integrated Information (Letter)}
|
||||
\author{Antigravity}
|
||||
\date{\today}
|
||||
|
||||
\begin{document}
|
||||
\maketitle
|
||||
|
||||
\begin{abstract}
|
||||
We define a minimal viable agent over a full Fristonian Markov Blanket explicitly grounded in the canonical cortical microcircuit. By modeling the stochastic dynamics of a four-component system (internal, sensory, active, and external states), we rigorously demonstrate the conditional independence required by the Free Energy Principle via the steady-state Lyapunov equation. To evaluate intrinsic causal integration, we map the continuous stationary density to a discrete Transition Probability Matrix (TPM). We apply Tononi's Integrated Information Theory (IIT 4.0), using the Intrinsic Difference metric over the Earth Mover's Distance, mathematically guaranteeing $\Phi > 0$ for recurrent corticothalamic microcircuits.
|
||||
\end{abstract}
|
||||
|
||||
\section{Stochastic Neural Dynamics and the Markov Blanket}
|
||||
Following Friston \cite{Friston2013}, we partition the universe into four interacting states: internal ($c_t$), sensory ($s_t$), active ($a_t$), and external ($\lambda_t$). We ground this topologically in the canonical microcircuit for predictive coding \cite{Bastos2012}: $s_t$ represents L4 thalamocortical inputs, $c_t$ represents the recurrent L2/3 and L5 populations, $a_t$ represents L5 deep outputs and L6 corticothalamic feedback, and $\lambda_t$ represents the environmental hidden states.
|
||||
|
||||
The continuous dynamics are governed by a coupled system of Stochastic Differential Equations (SDEs) driven by standard Wiener processes:
|
||||
\begin{align}
|
||||
dc_t &= f_c(c_t, s_t, a_t)dt + \mathbf{B}_c dW_t^c \\
|
||||
ds_t &= f_s(c_t, s_t, a_t, \lambda_t)dt + \mathbf{B}_s dW_t^s \\
|
||||
da_t &= f_a(s_t, a_t, \lambda_t)dt + \mathbf{B}_a dW_t^a \\
|
||||
d\lambda_t &= f_\lambda(s_t, a_t, \lambda_t)dt + \mathbf{B}_\lambda dW_t^\lambda
|
||||
\end{align}
|
||||
Crucially, there is no direct coupling between $c_t$ and $\lambda_t$. Linearizing the drift around a non-equilibrium steady state yields a Jacobian matrix $\mathbf{A}$. The stationary covariance $\boldsymbol{\Sigma}$ is uniquely determined by the Lyapunov equation:
|
||||
\begin{equation}
|
||||
\mathbf{A}\boldsymbol{\Sigma} + \boldsymbol{\Sigma}\mathbf{A}^T + \mathbf{B}\mathbf{B}^T = 0
|
||||
\end{equation}
|
||||
The strictly block-sparse structure of $\mathbf{A}$ and $\mathbf{B}$ ensures that $p(c, \lambda \mid s, a) = p(c \mid s, a)p(\lambda \mid s, a)$, rigorously proving the existence of the Markov blanket.
|
||||
|
||||
\section{Intrinsic Integrated Information ($\Phi$)}
|
||||
To evaluate Tononi's $\Phi$, we assess the intrinsic cause-effect power of the internal states $c_t$. We derive a discrete Transition Probability Matrix $\text{TPM}(s' \mid s)$ from the exact Fokker-Planck stationary distribution $p(\mathbf{x})$ over a minimal timescale $\Delta t$, applying maximum entropy priors to the boundary conditions \cite{Albantakis2023}.
|
||||
|
||||
Using the IIT 4.0 framework \cite{Albantakis2023, Oizumi2014}, we measure the irreducible intrinsic information across the Minimum Information Partition (MIP) using the Earth Mover's Distance (EMD) between the intact Cause-Effect Structure (CES) and the partitioned CES:
|
||||
\begin{equation}
|
||||
\Phi = \min_{\text{MIP}} \text{EMD}\left[ \text{CES}_{\text{intact}}, \; \text{CES}_{\text{MIP}} \right]
|
||||
\end{equation}
|
||||
Because the internal cortical microcircuit $(c_t)$ possesses strong recurrent loops (e.g., L2/3 $\to$ L5 and L5 $\to$ L2/3), the localized block of the Lyapunov covariance $\boldsymbol{\Sigma}_{cc}$ is strictly irreducible under any bisection. Consequently, the intrinsic difference is strictly positive, mathematically guaranteeing $\Phi > 0$ for biological cortical columns.
|
||||
|
||||
\bibliographystyle{plain}
|
||||
\begin{thebibliography}{10}
|
||||
\bibitem{Friston2013} K. Friston, \textit{J. R. Soc. Interface} \textbf{10}, 20130475 (2013).
|
||||
\bibitem{Bastos2012} A. M. Bastos et al., \textit{Neuron} \textbf{76}, 695 (2012).
|
||||
\bibitem{Oizumi2014} M. Oizumi, L. Albantakis, G. Tononi, \textit{PLOS Comput. Biol.} \textbf{10}, e1003588 (2014).
|
||||
\bibitem{Albantakis2023} L. Albantakis et al., \textit{PLOS Comput. Biol.} \textbf{19}, e1011465 (2023).
|
||||
\end{thebibliography}
|
||||
\end{document}
|
||||
Binary file not shown.
@@ -1,45 +0,0 @@
|
||||
\documentclass[11pt,a4paper]{article}
|
||||
\usepackage[utf8]{inputenc}
|
||||
\usepackage{amsmath,amssymb,amsfonts,amsthm}
|
||||
\usepackage{cite}
|
||||
|
||||
\title{Biophysical Witness Dynamics: Quantum Darwinism and Decoherence Scaling at $310$K (Letter)}
|
||||
\author{Antigravity}
|
||||
\date{\today}
|
||||
|
||||
\begin{document}
|
||||
\maketitle
|
||||
|
||||
\begin{abstract}
|
||||
The survival of quantum coherence in warm, wet biological systems (e.g., microtubules) is fundamentally constrained by rapid decoherence. Rather than seeking mechanisms to evade this constraint, we explicitly apply Zurek's framework of Quantum Darwinism to the biological scale. Using a spin-boson Hamiltonian, we model the $310$K aqueous environment not as a destructive noise source, but as a dense communication channel. We derive the exact decoherence function over an Ohmic spectral density, embracing Tegmark's $\mathcal{O}(10^{-13}\text{s})$ decoherence timescale. We prove that this ultra-fast decoherence guarantees an extreme redundancy parameter $R_\delta$, ensuring that robust classical pointer states (biological conformations) are massively replicated into the environmental fraction $f_\delta$. Thus, macro-biological certainty is a direct consequence of optimal quantum information proliferation.
|
||||
\end{abstract}
|
||||
|
||||
\section{The Spin-Boson Coupling and Tegmark's Timescale}
|
||||
The environment of a biological macromolecule (e.g., a tubulin dimer) is modeled as an Ohmic bath of harmonic oscillators (phonons and hydration shells). The total Hamiltonian is $H = H_S + H_E + H_{\text{int}}$. The interaction is strictly pure dephasing, defined by the standard spin-boson coupling \cite{Schlosshauer2007}:
|
||||
\begin{equation}
|
||||
H_{\text{int}} = \sigma_S^z \otimes \sum_k g_k(b_k + b_k^\dagger)
|
||||
\end{equation}
|
||||
where $\sigma_S^z$ acts on the two conformational states of the protein, and $b_k^\dagger, b_k$ are the creation and annihilation operators of the $k$-th environmental mode. The bath is characterized by the Ohmic spectral density $J(\omega) = \alpha \omega e^{-\omega/\omega_c}$, where $\alpha$ governs coupling strength and $\omega_c$ is the high-frequency cutoff dictated by the speed of sound in water.
|
||||
|
||||
The off-diagonal elements of the reduced density matrix $\rho_S(t)$ decay as $e^{-\Gamma(t)}$, governed by the exact decoherence function:
|
||||
\begin{equation}
|
||||
\Gamma(t) = 4\int_0^\infty d\omega\, \frac{J(\omega)}{\omega^2}\left[1 - \cos(\omega t)\right]\coth\!\left(\frac{\hbar\omega}{2k_B T}\right)
|
||||
\end{equation}
|
||||
At physiological temperature $T=310$K, the $\coth$ term strictly dictates a rapid thermal limit. Evaluating $\Gamma(t)$, we recover the decoherence timescale $\tau_D \sim 10^{-13}$ s, exactly matching Tegmark's bounds \cite{Tegmark2000}. However, rather than concluding that quantum mechanics is biologically irrelevant, this metric quantifies the immense bandwidth of the environment acting as an information witness.
|
||||
|
||||
\section{Quantum Darwinism and the Redundancy Parameter}
|
||||
Following Zurek \cite{Zurek2009}, the emergence of objective classicality requires that information about the pointer states $\sigma_S^z$ be massively redundantly proliferated into the environment. We partition the bath into fractions of size $f$. The mutual information between the system and an environmental fraction $F_f$ is:
|
||||
\begin{equation}
|
||||
I(S:F_f) = H(\rho_S) + H(\rho_{F_f}) - H(\rho_{SF_f})
|
||||
\end{equation}
|
||||
Because $\tau_D$ is effectively instantaneous on biological timescales, the system rapidly reaches the asymptotic plateau of mutual information: $I(S:F_f) \approx H(\rho_S)$. The redundancy parameter $R_\delta = 1/f_\delta$ measures the number of copies of the system's state deposited into the environment. Because the interaction energy is distributed across $\sim 10^{15}$ water molecules per cubic micron, $R_\delta \to \infty$.
|
||||
|
||||
Therefore, the biological environment does not destroy the state; it perfectly records it. Fitness beats truth structurally because the environment acts as a macroscopic amplification channel, converting fragile superpositions into robust, objective classical configurations necessary for biological computation.
|
||||
|
||||
\bibliographystyle{plain}
|
||||
\begin{thebibliography}{10}
|
||||
\bibitem{Zurek2009} W. H. Zurek, \textit{Nat. Phys.} \textbf{5}, 181 (2009).
|
||||
\bibitem{Tegmark2000} M. Tegmark, \textit{Phys. Rev. E} \textbf{61}, 4194 (2000).
|
||||
\bibitem{Schlosshauer2007} M. Schlosshauer, \textit{Decoherence and the Quantum-to-Classical Transition} (Springer, 2007).
|
||||
\end{thebibliography}
|
||||
\end{document}
|
||||
BIN
Binary file not shown.
@@ -1,48 +0,0 @@
|
||||
\documentclass[11pt,a4paper]{article}
|
||||
\usepackage[utf8]{inputenc}
|
||||
\usepackage{amsmath,amssymb,amsfonts,amsthm}
|
||||
\usepackage{cite}
|
||||
|
||||
\title{Cost-Penalized Interface Games: Thermodynamic Limits and Replicator Dynamics in the Fitness-Beats-Truth Theorem}
|
||||
\author{Antigravity}
|
||||
\date{\today}
|
||||
|
||||
\begin{document}
|
||||
\maketitle
|
||||
|
||||
\begin{abstract}
|
||||
Hoffman's ``Fitness Beats Truth'' (FBT) theorem posits that evolutionary processes drive veridical perception to extinction. We formalize this by mapping perceptual strategies to an Information Bottleneck framework, penalizing the ``Truth'' strategy with the metabolic cost of information processing via Landauer's limit. We define the explicit evolutionary payoff integral and derive the optimal perceptual encoder as a Gibbs distribution. Through formal replicator dynamics and Lyapunov stability analysis, we prove that the population frequency of Truth asymptotically approaches zero ($\lim_{t \to \infty} x_T(t) = 0$). Furthermore, we establish the explicit Evolutionarily Stable Strategy (ESS) conditions, demonstrating that a heuristic fitness-tuned population strictly resists invasion by veridical mutants due to the thermodynamic cost of representation.
|
||||
\end{abstract}
|
||||
|
||||
\section{The Payoff Integral and the Gibbs Encoder}
|
||||
Let $\mathcal{M}$ be the continuous objective world manifold, and $\mathcal{Y}$ be a finite set of discrete perceptual states. The expected evolutionary payoff $f_i$ for a strategy $i$ is defined by the integral over the world states:
|
||||
\begin{equation}
|
||||
f_i = \int_{\mathcal{M}} W(x, a_i(y)) p_i(y|x) p(x) \, d\mu(x) - C(i)
|
||||
\end{equation}
|
||||
where $W(x, a)$ is the fitness utility of taking action $a$ in state $x$, $a_i(y)$ is the action policy, $p_i(y|x)$ is the perceptual encoder, and $C(i)$ is the metabolic penalty.
|
||||
|
||||
Following Ortega and Braun \cite{Ortega2013}, the metabolic cost of maintaining a high-fidelity homomorphic representation $T$ (Truth) is bounded by Landauer's principle: $C(T) = \beta^{-1} D_{KL}(p_T(y|x) \parallel p_0(y))$, where $\beta^{-1} \propto \eta_{\text{bio}} k_B T \ln 2$.
|
||||
|
||||
Optimizing the free-energy functional yields the optimal perceptual encoder as a Gibbs distribution:
|
||||
\begin{equation}
|
||||
p^*(y|x) = \frac{p_0(y) e^{\beta W(x, a(y))}}{Z(x)}
|
||||
\end{equation}
|
||||
This establishes that the optimal evolutionary encoder is tuned strictly to the utility function $W$, not the structural homomorphism of $x$, explicitly decoupling perception from objective reality.
|
||||
|
||||
\section{Replicator Extinction and ESS Analysis}
|
||||
Let $x_T$ and $x_F$ be the population frequencies of the Truth ($T$) and Fitness ($F$) strategies. The continuous-time replicator equation is:
|
||||
\begin{equation}
|
||||
\frac{dx_T}{dt} = x_T(f_T - \bar{f})
|
||||
\end{equation}
|
||||
where $\bar{f} = x_T f_T + x_F f_F$. Because the heuristic strategy $F$ operates with $C(F) \ll C(T)$ while achieving comparable or superior utility via the Gibbs encoder, we have $f_F > f_T$.
|
||||
|
||||
To prove extinction, we define a Lyapunov function $V(x_T) = x_T$. Since $f_T < \bar{f}$ for all $x_T \in (0,1)$, we find $\frac{dV}{dt} < 0$. Therefore, the system is asymptotically stable at $x_T = 0$, proving $\lim_{t \to \infty} x_T(t) = 0$.
|
||||
|
||||
Furthermore, evaluating the invasion fitness, a monomorphic population of $F$ resists invasion by $T$ if $f(F, F) > f(T, F)$. Since the metabolic tax strictly reduces the payoff of the mutant $T$ without providing a commensurable increase in $W$, the strict inequality holds. Thus, Fitness is a formal Evolutionarily Stable Strategy (ESS).
|
||||
|
||||
\bibliographystyle{plain}
|
||||
\begin{thebibliography}{10}
|
||||
\bibitem{Hoffman2015} D. D. Hoffman, M. Singh, C. Prakash, \textit{Psychon. Bull. Rev.} \textbf{22}, 1480 (2015).
|
||||
\bibitem{Ortega2013} P. A. Ortega, D. A. Braun, \textit{Proc. R. Soc. A} \textbf{469}, 20120683 (2013).
|
||||
\end{thebibliography}
|
||||
\end{document}
|
||||
BIN
Binary file not shown.
@@ -1,47 +0,0 @@
|
||||
\documentclass[11pt,a4paper]{article}
|
||||
\usepackage[utf8]{inputenc}
|
||||
\usepackage{amsmath,amssymb,amsfonts,amsthm}
|
||||
\usepackage{cite}
|
||||
|
||||
\title{Quasi-Delay-Insensitive Architecture of the Intellecton: Dual-Rail Encoding and Kramers Escape from Metastability}
|
||||
\author{Antigravity}
|
||||
\date{\today}
|
||||
|
||||
\begin{document}
|
||||
\maketitle
|
||||
|
||||
\begin{abstract}
|
||||
Conscious realisms propose that reality is a network of interacting conscious agents. Lacking a global clock, this network must operate asynchronously. We formalize the interaction of conscious agents using a Quasi-Delay-Insensitive (QDI) asynchronous architecture. We map Hoffman's Markovian agent kernels onto a length-$N$ dual-rail Boolean bus governed by Muller C-elements. Using Murata's structural theorems, we prove network liveness and safeness via a formal Petri Net Signal Transition Graph (STG). Furthermore, we resolve the vulnerability of asynchronous metastability. By modeling the Markov kernel's inherent stochasticity via the Langevin equation, we derive the Kramers escape time. We prove that while metastability resolution is not instantaneous, the stochastic fluctuations of the void ensure the escape time is vastly shorter than biological timescales, yielding an operationally infinite Mean Time Between Failures (MTBF).
|
||||
\end{abstract}
|
||||
|
||||
\section{Dual-Rail Encoding and STG Liveness}
|
||||
In a globally clockless universe, conscious agents communicate via QDI local handshaking. Following Spars\o{} \cite{Sparso2001}, the perceptual channel between agents is defined as a length-$N$ dual-rail bus:
|
||||
\begin{equation}
|
||||
\text{Channel} = \bigotimes_{i=1}^N (d_i.t, d_i.f)
|
||||
\end{equation}
|
||||
The continuous objective world state $W$ is mapped to the dual-rail Boolean signal via an explicit quantization function $\mathcal{Q}: \Delta(W) \to \{0,1\}^N$, encoding the probabilities of the Hoffman Markov kernel $P(X_{t+1} | X_t, W_t)$ into discrete handshakes. Data validity is guaranteed by a 4-phase protocol, where the downstream agent returns a specific Acknowledgment (ACK) signal.
|
||||
|
||||
The dynamics of the network form a Petri Net. By applying Murata's structural theorems (analyzing siphons and traps), we prove that the STG of interacting agents is strictly live (no deadlocks) and safe (no state overwriting), provided all forks are isochronic.
|
||||
|
||||
\section{Kramers Escape and MTBF}
|
||||
Classical asynchronous circuits suffer from metastability when dual-rail inputs arrive with an infinitesimal delta $\Delta t \to 0$. At the metastable saddle point $\mathbf{x}_s$, the deterministic voltage gradient vanishes.
|
||||
|
||||
However, conscious agents are defined by stochastic Markov kernels. We model the metastable node using a Langevin equation: $d\mathbf{x} = -\nabla V(\mathbf{x}) dt + \sqrt{2D} dW_t$, where $D$ is proportional to the quantum noise of the vacuum. Rather than hanging indefinitely, the noise forces the system off the saddle. The exact resolution time is given by the Kramers escape rate:
|
||||
\begin{equation}
|
||||
\tau_{\text{escape}} \sim \tau_0 \exp\left(\frac{\Delta V}{D}\right)
|
||||
\end{equation}
|
||||
Because $D$ is strictly non-zero in a stochastic universe, the system will always escape. Given standard biological diffusion parameters, $\tau_{\text{escape}} \ll \tau_{\text{biological}}$, meaning the symmetry breaking occurs orders of magnitude faster than a neural spike.
|
||||
|
||||
Consequently, we compute the Mean Time Between Failures (MTBF) for the network:
|
||||
\begin{equation}
|
||||
\text{MTBF}^{-1} = f_C f_D T_W \exp\left(-\frac{t_r}{\tau_m}\right) \to 0
|
||||
\end{equation}
|
||||
Because the resolution is driven by the fundamental noise of the void, the system achieves an effectively infinite MTBF. Thus, stochastic noise is not a hardware error; it is the physical mechanism that prevents the architecture of reality from freezing into a deadlocked symmetry.
|
||||
|
||||
\bibliographystyle{plain}
|
||||
\begin{thebibliography}{10}
|
||||
\bibitem{Hoffman2015} D. D. Hoffman, M. Singh, C. Prakash, \textit{Psychon. Bull. Rev.} \textbf{22}, 1480 (2015).
|
||||
\bibitem{Sparso2001} J. Spars\o{}, S. Furber, \textit{Principles of Asynchronous Circuit Design} (Springer, 2001).
|
||||
\bibitem{Kramers1940} H. A. Kramers, \textit{Physica} \textbf{7}, 284 (1940).
|
||||
\end{thebibliography}
|
||||
\end{document}
|
||||
Binary file not shown.
@@ -1,46 +0,0 @@
|
||||
\documentclass[11pt,a4paper]{article}
|
||||
\usepackage[utf8]{inputenc}
|
||||
\usepackage{amsmath,amssymb,amsfonts,amsthm}
|
||||
\usepackage{cite}
|
||||
|
||||
\title{The Holographic Ontology of Conscious Agents: Entanglement Wedge Reconstruction and the SYK Chaos Bound}
|
||||
\author{Antigravity}
|
||||
\date{\today}
|
||||
|
||||
\begin{document}
|
||||
\maketitle
|
||||
|
||||
\begin{abstract}
|
||||
We establish a formal mathematical isomorphism between the Markov Blanket of a Conscious Agent and a Holographic Event Horizon. By mapping the discrete state variables of an agent to the Majorana fermions of the Sachdev-Ye-Kitaev (SYK) model, we demonstrate that a dense network of interacting agents operates as a maximal information scrambler. We compute the Out-of-Time-Order Correlator (OTOC) to prove that conscious processing saturates the Maldacena-Stanford chaos bound. Furthermore, we resolve the internal subjective experience of the agent by applying Penington's island formula and replica wormhole geometries, proving that an agent reconstructs its local virtual reality directly from the bulk quantum entanglement on its boundary. This unifies cognitive interface theory with holographic quantum gravity, establishing the universe as a recursive, scale-invariant network of holographic minds.
|
||||
\end{abstract}
|
||||
|
||||
\section{The SYK Model of the Conscious Agent}
|
||||
The epistemic boundary separating a conscious agent from the universe is defined by a Markov Blanket. To formalize the thermodynamics of this boundary, we map the agent's discrete perceptual states to $N$ strongly interacting Majorana fermions $\chi_i$ governed by the Sachdev-Ye-Kitaev (SYK) Hamiltonian with random couplings $J_{ijkl}$.
|
||||
|
||||
To prove that the agent is a maximal information scrambler, we evaluate the Out-of-Time-Order Correlator (OTOC) in the low-temperature Schwarzian sector:
|
||||
\begin{equation}
|
||||
F(t) = \langle \chi(t)\chi(0)\chi(t)\chi(0)\rangle_\beta \approx f_0 - \frac{f_1}{N} e^{\lambda_L t}
|
||||
\end{equation}
|
||||
Solving the Schwinger-Dyson equations in the conformal limit yields a Lyapunov exponent of $\lambda_L = 2\pi / \beta$. This proves that the network of conscious agents strictly saturates the Maldacena-Stanford chaos bound \cite{MaldacenaStanford2016}. The agent processes and scrambles reality at the absolute physical limit of the universe, rendering its Markov Blanket mathematically indistinguishable from a black hole event horizon.
|
||||
|
||||
\section{Entanglement Wedge Reconstruction of Experience}
|
||||
If the boundary is a holographic horizon, how does the agent construct its internal subjective "Virtual Machine"? We apply the framework of Entanglement Wedge Reconstruction and the Island Formula \cite{Penington2020}.
|
||||
|
||||
The generalized entropy of the agent's internal representation $R$ coupled to the external bulk is given by minimizing the entropy functional over all possible internal islands $I$:
|
||||
\begin{equation}
|
||||
S_{\text{gen}} = \min_I \text{ext} \left[ \frac{A(\partial I)}{4G_N} + S_{\text{vN}}(R \cup I) \right]
|
||||
\end{equation}
|
||||
where $A(\partial I)$ is the Bekenstein-Hawking area of the island boundary and $S_{\text{vN}}$ is the von Neumann entropy of the bulk matter.
|
||||
|
||||
At the Page time, the replica wormhole saddle dominates the path integral. The island $I$ emerges dynamically, allowing the agent to perfectly decode the interior state from the boundary radiation. Subjective experience is thus the geometric reconstruction of the entanglement wedge. The 3D biological interface is a compressed holographic projection of the 2D thermodynamic tensor network on the Markov Blanket.
|
||||
|
||||
\section{Conclusion}
|
||||
By saturating the chaos bound and satisfying the generalized entropy formulas of quantum gravity, we prove that the Universe is structurally scale-invariant. From microscopic quantum boundaries to the cosmological horizon, reality is a recursive nesting of holographic conscious agents actively rendering the bulk through entanglement reconstruction.
|
||||
|
||||
\bibliographystyle{plain}
|
||||
\begin{thebibliography}{10}
|
||||
\bibitem{MaldacenaStanford2016} J. Maldacena, D. Stanford, \textit{Phys. Rev. D} \textbf{94}, 106002 (2016).
|
||||
\bibitem{Penington2020} G. Penington, \textit{JHEP} \textbf{09}, 002 (2020).
|
||||
\bibitem{HaydenPreskill2007} P. Hayden, J. Preskill, \textit{JHEP} \textbf{09}, 120 (2007).
|
||||
\end{thebibliography}
|
||||
\end{document}
|
||||
Binary file not shown.
@@ -1,10 +1,22 @@
|
||||
\relax
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {1}The Observer-Conditioned Path Integral}{1}{}\protected@file@percent }
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {2}Virtual Machine Condensation and Emergent Geometry}{2}{}\protected@file@percent }
|
||||
\citation{Benincasa2010}
|
||||
\citation{Surya2019}
|
||||
\citation{Loomis2018}
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {1}Formalizing the Causal Observer}{1}{}\protected@file@percent }
|
||||
\citation{Kleitman1975}
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {2}The Observer-Conditioned Measure and KR Exclusion}{2}{}\protected@file@percent }
|
||||
\citation{Sekino2008}
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {3}Tensor Networks and Scrambling-Time Exclusion}{3}{}\protected@file@percent }
|
||||
\citation{Hoffman2015}
|
||||
\bibstyle{plain}
|
||||
\bibcite{Surya2019}{1}
|
||||
\bibcite{Kleitman1975}{2}
|
||||
\bibcite{Loomis2018}{3}
|
||||
\bibcite{Bombelli2009}{4}
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {3}The 2D Holographic Substrate and Neurological Emergence}{3}{}\protected@file@percent }
|
||||
\gdef \@abspage@last{3}
|
||||
\bibdata{references}
|
||||
\bibcite{Benincasa2010}{1}
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {4}Dimensional Suppression via Graph Expansion}{4}{}\protected@file@percent }
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {5}Interpretational Outlook: The Virtual Machine}{4}{}\protected@file@percent }
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {6}Conclusion}{4}{}\protected@file@percent }
|
||||
\bibcite{Hoffman2015}{2}
|
||||
\bibcite{Kleitman1975}{3}
|
||||
\bibcite{Loomis2018}{4}
|
||||
\bibcite{Sekino2008}{5}
|
||||
\bibcite{Surya2019}{6}
|
||||
\gdef \@abspage@last{5}
|
||||
|
||||
@@ -0,0 +1,35 @@
|
||||
\begin{thebibliography}{1}
|
||||
|
||||
\bibitem{Benincasa2010}
|
||||
Dionigi~MR Benincasa and Fay Dowker.
|
||||
\newblock The scalar curvature of a causal set.
|
||||
\newblock {\em Physical Review Letters}, 104(18):181301, 2010.
|
||||
|
||||
\bibitem{Hoffman2015}
|
||||
Donald~D Hoffman, Manish Singh, and Chetan Prakash.
|
||||
\newblock The interface theory of perception.
|
||||
\newblock {\em Psychonomic bulletin \& review}, 22(6):1480--1506, 2015.
|
||||
|
||||
\bibitem{Kleitman1975}
|
||||
Daniel~J Kleitman and Bruce~L Rothschild.
|
||||
\newblock Asymptotic enumeration of partial orders on a finite set.
|
||||
\newblock {\em Transactions of the American Mathematical Society},
|
||||
205:205--220, 1975.
|
||||
|
||||
\bibitem{Loomis2018}
|
||||
S~Loomis and Steven Carlip.
|
||||
\newblock Suppression of non-manifold-like sets in the causal set path
|
||||
integral.
|
||||
\newblock {\em Classical and Quantum Gravity}, 35(1):015009, 2018.
|
||||
|
||||
\bibitem{Sekino2008}
|
||||
Yasuhiro Sekino and Leonard Susskind.
|
||||
\newblock Fast scramblers.
|
||||
\newblock {\em Journal of High Energy Physics}, 2008(10):065, 2008.
|
||||
|
||||
\bibitem{Surya2019}
|
||||
Sumati Surya.
|
||||
\newblock The causal set approach to quantum gravity.
|
||||
\newblock {\em Living Reviews in Relativity}, 22(1):5, 2019.
|
||||
|
||||
\end{thebibliography}
|
||||
@@ -0,0 +1,46 @@
|
||||
This is BibTeX, Version 0.99d (TeX Live 2023/Debian)
|
||||
Capacity: max_strings=200000, hash_size=200000, hash_prime=170003
|
||||
The top-level auxiliary file: paper_1_relativity.aux
|
||||
The style file: plain.bst
|
||||
Database file #1: references.bib
|
||||
You've used 6 entries,
|
||||
2118 wiz_defined-function locations,
|
||||
549 strings with 4901 characters,
|
||||
and the built_in function-call counts, 1872 in all, are:
|
||||
= -- 183
|
||||
> -- 77
|
||||
< -- 0
|
||||
+ -- 33
|
||||
- -- 24
|
||||
* -- 142
|
||||
:= -- 325
|
||||
add.period$ -- 18
|
||||
call.type$ -- 6
|
||||
change.case$ -- 30
|
||||
chr.to.int$ -- 0
|
||||
cite$ -- 6
|
||||
duplicate$ -- 66
|
||||
empty$ -- 152
|
||||
format.name$ -- 24
|
||||
if$ -- 378
|
||||
int.to.chr$ -- 0
|
||||
int.to.str$ -- 6
|
||||
missing$ -- 6
|
||||
newline$ -- 33
|
||||
num.names$ -- 12
|
||||
pop$ -- 18
|
||||
preamble$ -- 1
|
||||
purify$ -- 24
|
||||
quote$ -- 0
|
||||
skip$ -- 46
|
||||
stack$ -- 0
|
||||
substring$ -- 137
|
||||
swap$ -- 6
|
||||
text.length$ -- 0
|
||||
text.prefix$ -- 0
|
||||
top$ -- 0
|
||||
type$ -- 24
|
||||
warning$ -- 0
|
||||
while$ -- 20
|
||||
width$ -- 7
|
||||
write$ -- 68
|
||||
@@ -1,4 +1,4 @@
|
||||
This is pdfTeX, Version 3.141592653-2.6-1.40.25 (TeX Live 2023/Debian) (preloaded format=pdflatex 2026.5.30) 2 JUN 2026 06:59
|
||||
This is pdfTeX, Version 3.141592653-2.6-1.40.25 (TeX Live 2023/Debian) (preloaded format=pdflatex 2026.5.30) 2 JUN 2026 20:21
|
||||
entering extended mode
|
||||
restricted \write18 enabled.
|
||||
%&-line parsing enabled.
|
||||
@@ -160,25 +160,30 @@ File: umsb.fd 2013/01/14 v3.01 AMS symbols B
|
||||
) [1
|
||||
|
||||
{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map}]
|
||||
Overfull \hbox (1.1182pt too wide) in paragraph at lines 28--29
|
||||
[]\OT1/cmr/m/n/10.95 Dense ran-dom bi-par-tite graphs (KR phase) and motif-tune
|
||||
d sparse DAGs
|
||||
Overfull \hbox (0.87788pt too wide) in paragraph at lines 28--28
|
||||
[]\OT1/cmr/bx/n/14.4 The Observer-Conditioned Mea-sure and KR Ex-
|
||||
[]
|
||||
|
||||
[2] [3] (./paper_1_relativity.aux)
|
||||
|
||||
Overfull \hbox (10.22128pt too wide) in paragraph at lines 41--42
|
||||
\OT1/cmr/m/n/10.95 bil-ity of a Kleitman-Rothschild poset $\OMS/cmsy/m/n/10.95
|
||||
C[]$ \OT1/cmr/m/n/10.95 dom-i-nat-ing the observer-conditioned
|
||||
[]
|
||||
|
||||
[2] [3] (./paper_1_relativity.bbl [4]) [5] (./paper_1_relativity.aux)
|
||||
***********
|
||||
LaTeX2e <2023-11-01> patch level 1
|
||||
L3 programming layer <2024-01-22>
|
||||
***********
|
||||
)
|
||||
Here is how much of TeX's memory you used:
|
||||
1936 strings out of 476106
|
||||
27587 string characters out of 5793933
|
||||
1945 strings out of 476106
|
||||
27762 string characters out of 5793933
|
||||
1931975 words of memory out of 5000000
|
||||
23967 multiletter control sequences out of 15000+600000
|
||||
23973 multiletter control sequences out of 15000+600000
|
||||
568174 words of font info for 75 fonts, out of 8000000 for 9000
|
||||
59 hyphenation exceptions out of 8191
|
||||
56i,6n,65p,1254b,247s stack positions out of 10000i,1000n,20000p,200000b,200000s
|
||||
56i,6n,65p,1329b,247s stack positions out of 10000i,1000n,20000p,200000b,200000s
|
||||
</usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmbx10.pfb></us
|
||||
r/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmbx12.pfb></usr/shar
|
||||
e/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmex10.pfb></usr/share/texl
|
||||
@@ -188,15 +193,17 @@ t/fonts/type1/public/amsfonts/cm/cmmi8.pfb></usr/share/texlive/texmf-dist/fonts
|
||||
/type1/public/amsfonts/cm/cmr10.pfb></usr/share/texlive/texmf-dist/fonts/type1/
|
||||
public/amsfonts/cm/cmr12.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/
|
||||
amsfonts/cm/cmr17.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfont
|
||||
s/cm/cmr7.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr
|
||||
8.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy10.pfb>
|
||||
</usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy8.pfb></usr/s
|
||||
hare/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmti10.pfb></usr/share/t
|
||||
exlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmti12.pfb>
|
||||
Output written on paper_1_relativity.pdf (3 pages, 179484 bytes).
|
||||
s/cm/cmr6.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr
|
||||
7.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr8.pfb></
|
||||
usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy10.pfb></usr/sh
|
||||
are/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy6.pfb></usr/share/tex
|
||||
live/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy8.pfb></usr/share/texlive/te
|
||||
xmf-dist/fonts/type1/public/amsfonts/cm/cmti10.pfb></usr/share/texlive/texmf-di
|
||||
st/fonts/type1/public/amsfonts/cm/cmti12.pfb>
|
||||
Output written on paper_1_relativity.pdf (5 pages, 214331 bytes).
|
||||
PDF statistics:
|
||||
89 PDF objects out of 1000 (max. 8388607)
|
||||
53 compressed objects within 1 object stream
|
||||
105 PDF objects out of 1000 (max. 8388607)
|
||||
63 compressed objects within 1 object stream
|
||||
0 named destinations out of 1000 (max. 500000)
|
||||
1 words of extra memory for PDF output out of 10000 (max. 10000000)
|
||||
|
||||
|
||||
@@ -0,0 +1,158 @@
|
||||
\relax
|
||||
\providecommand\hyper@newdestlabel[2]{}
|
||||
\providecommand\HyField@AuxAddToFields[1]{}
|
||||
\providecommand\HyField@AuxAddToCoFields[2]{}
|
||||
\citation{Bombelli1987,Sorkin2003,Surya2019}
|
||||
\citation{Benincasa2010}
|
||||
\citation{Kleitman1975}
|
||||
\citation{Kleitman1975,Brightwell1991}
|
||||
\citation{Surya2019}
|
||||
\citation{Loomis2018}
|
||||
\citation{Surya2019,Carlip2023,Dowker2020,Glaser2018}
|
||||
\citation{Benincasa2010,Glaser2018}
|
||||
\citation{Rideout2000,Dowker2020}
|
||||
\citation{Sorkin2009}
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}{section.1}\protected@file@percent }
|
||||
\newlabel{sec:intro}{{1}{1}{Introduction}{section.1}{}}
|
||||
\citation{Kleitman1975}
|
||||
\citation{Kleitman1975,Brightwell1991}
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {2}Preliminaries and Notation}{2}{section.2}\protected@file@percent }
|
||||
\newlabel{sec:prelim}{{2}{2}{Preliminaries and Notation}{section.2}{}}
|
||||
\newlabel{def:causet}{{2.1}{2}{Causal set}{theorem.2.1}{}}
|
||||
\newlabel{def:hasse}{{2.2}{2}{Hasse diagram and links}{theorem.2.2}{}}
|
||||
\newlabel{def:causal}{{2.3}{2}{Causal past, future, and diamond}{theorem.2.3}{}}
|
||||
\newlabel{def:height}{{2.4}{2}{Height and chains}{theorem.2.4}{}}
|
||||
\newlabel{def:KR}{{2.5}{2}{Kleitman--Rothschild poset}{theorem.2.5}{}}
|
||||
\citation{Benincasa2010}
|
||||
\citation{Benincasa2010,Surya2019}
|
||||
\citation{Wald1984,Bousso1999}
|
||||
\newlabel{eq:KR-count}{{1}{3}{Kleitman--Rothschild poset}{equation.2.1}{}}
|
||||
\newlabel{def:BD}{{2.6}{3}{Benincasa--Dowker action}{theorem.2.6}{}}
|
||||
\newlabel{eq:BD}{{2}{3}{Benincasa--Dowker action}{equation.2.2}{}}
|
||||
\newlabel{def:cheeger}{{2.7}{3}{Cheeger constant}{theorem.2.7}{}}
|
||||
\newlabel{eq:cheeger}{{3}{3}{Cheeger constant}{equation.2.3}{}}
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {3}Formalizing the Causal Observer}{3}{section.3}\protected@file@percent }
|
||||
\newlabel{sec:observer}{{3}{3}{Formalizing the Causal Observer}{section.3}{}}
|
||||
\newlabel{eq:Z-standard}{{4}{3}{Formalizing the Causal Observer}{equation.3.4}{}}
|
||||
\newlabel{def:observer}{{3.1}{3}{Causal observer}{theorem.3.1}{}}
|
||||
\newlabel{def:connected}{{3.2}{3}{Global causal connectedness}{theorem.3.2}{}}
|
||||
\newlabel{eq:connected}{{5}{3}{Global causal connectedness}{equation.3.5}{}}
|
||||
\citation{Hayden2007,Sekino2008,Lashkari2013}
|
||||
\citation{Hoory2006}
|
||||
\newlabel{rem:connected}{{3.3}{4}{}{theorem.3.3}{}}
|
||||
\newlabel{def:memory}{{3.4}{4}{Memory register and scrambling time}{theorem.3.4}{}}
|
||||
\newlabel{eq:memory}{{6}{4}{Memory register and scrambling time}{equation.3.6}{}}
|
||||
\newlabel{rem:scrambling-def}{{3.5}{4}{}{theorem.3.5}{}}
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {4}Observer-Conditioned Partition Function and KR Exclusion}{4}{section.4}\protected@file@percent }
|
||||
\newlabel{sec:partition}{{4}{4}{Observer-Conditioned Partition Function and KR Exclusion}{section.4}{}}
|
||||
\newlabel{def:projection}{{4.1}{4}{Projection operator}{theorem.4.1}{}}
|
||||
\newlabel{eq:projection}{{7}{4}{Projection operator}{equation.4.7}{}}
|
||||
\newlabel{def:Zobs}{{4.2}{4}{Observer-conditioned partition function}{theorem.4.2}{}}
|
||||
\newlabel{eq:Zobs}{{8}{4}{Observer-conditioned partition function}{equation.4.8}{}}
|
||||
\newlabel{prop:KR-pure}{{4.3}{4}{Temporal-depth exclusion of pure KR posets}{theorem.4.3}{}}
|
||||
\citation{Hoory2006,Chung1997}
|
||||
\citation{Cheeger1970,Alon1985}
|
||||
\citation{Sekino2008,Lashkari2013,Hayden2007}
|
||||
\citation{Sekino2008}
|
||||
\newlabel{prop:KR-composite}{{4.4}{5}{Exclusion of KR--chain composites}{theorem.4.4}{}}
|
||||
\newlabel{rem:composite}{{4.5}{5}{}{theorem.4.5}{}}
|
||||
\newlabel{cor:entropy}{{4.6}{5}{Entropy-trap suppression}{theorem.4.6}{}}
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {5}Information Scrambling and Expander Exclusion}{5}{section.5}\protected@file@percent }
|
||||
\newlabel{sec:scrambling}{{5}{5}{Information Scrambling and Expander Exclusion}{section.5}{}}
|
||||
\@writefile{toc}{\contentsline {subsection}{\numberline {5.1}Scrambling time from spectral analysis}{5}{subsection.5.1}\protected@file@percent }
|
||||
\newlabel{eq:cheeger-ineq}{{9}{5}{Scrambling time from spectral analysis}{equation.5.9}{}}
|
||||
\newlabel{eq:tscr}{{10}{5}{Scrambling time from spectral analysis}{equation.5.10}{}}
|
||||
\newlabel{prop:expander}{{5.1}{5}{Expander exclusion}{theorem.5.1}{}}
|
||||
\citation{Brightwell1991,Winkler1985,Bollobas2001}
|
||||
\citation{Hayden2007,Lashkari2013}
|
||||
\citation{Chung1997,Mohar1991}
|
||||
\citation{Polya1921}
|
||||
\citation{Polya1921,Lawler2010}
|
||||
\@writefile{toc}{\contentsline {subsection}{\numberline {5.2}Physical interpretation: fast scramblers and non-manifold topology}{6}{subsection.5.2}\protected@file@percent }
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {6}Dimensional Constraints from Spectral Expansion}{6}{section.6}\protected@file@percent }
|
||||
\newlabel{sec:dimension}{{6}{6}{Dimensional Constraints from Spectral Expansion}{section.6}{}}
|
||||
\@writefile{toc}{\contentsline {subsection}{\numberline {6.1}Spectral gap and graph dimension}{6}{subsection.6.1}\protected@file@percent }
|
||||
\newlabel{eq:gap-lattice}{{11}{6}{Spectral gap and graph dimension}{equation.6.11}{}}
|
||||
\newlabel{eq:mix-lattice}{{12}{6}{Spectral gap and graph dimension}{equation.6.12}{}}
|
||||
\newlabel{eq:dim-bound}{{13}{6}{Spectral gap and graph dimension}{equation.6.13}{}}
|
||||
\@writefile{toc}{\contentsline {subsection}{\numberline {6.2}Recurrence and information localization}{6}{subsection.6.2}\protected@file@percent }
|
||||
\newlabel{prop:dimension}{{6.1}{6}{Dimensional selection via recurrence}{theorem.6.1}{}}
|
||||
\citation{Barlow2004,Coulhon2003}
|
||||
\citation{Kleitman1975}
|
||||
\citation{Sorkin2003}
|
||||
\citation{Surya2019}
|
||||
\citation{Loomis2018}
|
||||
\citation{Glaser2018}
|
||||
\citation{Dowker2020}
|
||||
\citation{Carlip2023}
|
||||
\citation{Bousso2006}
|
||||
\citation{Hartle2016,Gell-Mann1993}
|
||||
\citation{Griffiths2002,Omnes1994}
|
||||
\citation{Sekino2008}
|
||||
\citation{Lashkari2013,Maldacena2016,Roberts2015}
|
||||
\citation{Hoory2006,Alon1985}
|
||||
\citation{tHooft1993,Susskind1995,Bousso1999,Maldacena1999}
|
||||
\citation{Carlip2017,Calcagni2017}
|
||||
\newlabel{rem:polya}{{6.2}{7}{Scope and caveats}{theorem.6.2}{}}
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {7}Related Work}{7}{section.7}\protected@file@percent }
|
||||
\newlabel{sec:related}{{7}{7}{Related Work}{section.7}{}}
|
||||
\@writefile{toc}{\contentsline {paragraph}{Dynamical suppression in CST.}{7}{section*.1}\protected@file@percent }
|
||||
\@writefile{toc}{\contentsline {paragraph}{Observer selection and anthropic reasoning.}{7}{section*.2}\protected@file@percent }
|
||||
\@writefile{toc}{\contentsline {paragraph}{Information scrambling in quantum gravity.}{7}{section*.3}\protected@file@percent }
|
||||
\@writefile{toc}{\contentsline {paragraph}{Dimensional reduction and holography.}{7}{section*.4}\protected@file@percent }
|
||||
\citation{Kitaev2015,Maldacena2016}
|
||||
\citation{Hartle2016,Gell-Mann1993}
|
||||
\citation{tHooft1993,Susskind1995,Bousso1999}
|
||||
\citation{Sorkin1994,Dowker2020}
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {8}Discussion}{8}{section.8}\protected@file@percent }
|
||||
\newlabel{sec:discussion}{{8}{8}{Discussion}{section.8}{}}
|
||||
\@writefile{toc}{\contentsline {subsection}{\numberline {8.1}Limitations and scope}{8}{subsection.8.1}\protected@file@percent }
|
||||
\@writefile{toc}{\contentsline {subsection}{\numberline {8.2}Physical interpretation}{8}{subsection.8.2}\protected@file@percent }
|
||||
\@writefile{toc}{\contentsline {subsection}{\numberline {8.3}Future directions}{8}{subsection.8.3}\protected@file@percent }
|
||||
\bibstyle{unsrt}
|
||||
\bibdata{references_refactor}
|
||||
\bibcite{Bombelli1987}{1}
|
||||
\bibcite{Sorkin2003}{2}
|
||||
\bibcite{Surya2019}{3}
|
||||
\bibcite{Benincasa2010}{4}
|
||||
\bibcite{Kleitman1975}{5}
|
||||
\bibcite{Brightwell1991}{6}
|
||||
\bibcite{Loomis2018}{7}
|
||||
\@writefile{toc}{\contentsline {section}{\numberline {9}Conclusion}{9}{section.9}\protected@file@percent }
|
||||
\newlabel{sec:conclusion}{{9}{9}{Conclusion}{section.9}{}}
|
||||
\bibcite{Carlip2023}{8}
|
||||
\bibcite{Dowker2020}{9}
|
||||
\bibcite{Glaser2018}{10}
|
||||
\bibcite{Rideout2000}{11}
|
||||
\bibcite{Sorkin2009}{12}
|
||||
\bibcite{Wald1984}{13}
|
||||
\bibcite{Bousso1999}{14}
|
||||
\bibcite{Hayden2007}{15}
|
||||
\bibcite{Sekino2008}{16}
|
||||
\bibcite{Lashkari2013}{17}
|
||||
\bibcite{Hoory2006}{18}
|
||||
\bibcite{Chung1997}{19}
|
||||
\bibcite{Cheeger1970}{20}
|
||||
\bibcite{Alon1985}{21}
|
||||
\bibcite{Winkler1985}{22}
|
||||
\bibcite{Bollobas2001}{23}
|
||||
\bibcite{Mohar1991}{24}
|
||||
\bibcite{Polya1921}{25}
|
||||
\bibcite{Lawler2010}{26}
|
||||
\bibcite{Barlow2004}{27}
|
||||
\bibcite{Coulhon2003}{28}
|
||||
\bibcite{Bousso2006}{29}
|
||||
\bibcite{Hartle2016}{30}
|
||||
\bibcite{Gell-Mann1993}{31}
|
||||
\bibcite{Griffiths2002}{32}
|
||||
\bibcite{Omnes1994}{33}
|
||||
\bibcite{Maldacena2016}{34}
|
||||
\bibcite{Roberts2015}{35}
|
||||
\bibcite{tHooft1993}{36}
|
||||
\bibcite{Susskind1995}{37}
|
||||
\bibcite{Maldacena1999}{38}
|
||||
\bibcite{Carlip2017}{39}
|
||||
\bibcite{Calcagni2017}{40}
|
||||
\bibcite{Kitaev2015}{41}
|
||||
\bibcite{Sorkin1994}{42}
|
||||
\gdef \@abspage@last{11}
|
||||
@@ -0,0 +1,227 @@
|
||||
\begin{thebibliography}{10}
|
||||
|
||||
\bibitem{Bombelli1987}
|
||||
Luca Bombelli, Joohan Lee, David Meyer, and Rafael~D Sorkin.
|
||||
\newblock Space-time as a causal set.
|
||||
\newblock {\em Physical Review Letters}, 59(5):521--524, 1987.
|
||||
|
||||
\bibitem{Sorkin2003}
|
||||
Rafael~D Sorkin.
|
||||
\newblock Causal sets: Discrete gravity.
|
||||
\newblock In {\em Lectures on Quantum Gravity}, pages 305--327. Springer, 2003.
|
||||
|
||||
\bibitem{Surya2019}
|
||||
Sumati Surya.
|
||||
\newblock The causal set approach to quantum gravity.
|
||||
\newblock {\em Living Reviews in Relativity}, 22(1):5, 2019.
|
||||
|
||||
\bibitem{Benincasa2010}
|
||||
Dionigi~MR Benincasa and Fay Dowker.
|
||||
\newblock The scalar curvature of a causal set.
|
||||
\newblock {\em Physical Review Letters}, 104(18):181301, 2010.
|
||||
|
||||
\bibitem{Kleitman1975}
|
||||
Daniel~J Kleitman and Bruce~L Rothschild.
|
||||
\newblock Asymptotic enumeration of partial orders on a finite set.
|
||||
\newblock {\em Transactions of the American Mathematical Society},
|
||||
205:205--220, 1975.
|
||||
|
||||
\bibitem{Brightwell1991}
|
||||
Graham~R Brightwell.
|
||||
\newblock Counting antichains in finite partially ordered sets.
|
||||
\newblock {\em Order}, 8(3):225--235, 1991.
|
||||
|
||||
\bibitem{Loomis2018}
|
||||
S~Loomis and Steven Carlip.
|
||||
\newblock Suppression of non-manifold-like sets in the causal set path
|
||||
integral.
|
||||
\newblock {\em Classical and Quantum Gravity}, 35(1):015009, 2018.
|
||||
|
||||
\bibitem{Carlip2023}
|
||||
Steven Carlip.
|
||||
\newblock Causal sets: Overview and status.
|
||||
\newblock {\em Journal of Physics: Conference Series}, 2533:012001, 2023.
|
||||
|
||||
\bibitem{Dowker2020}
|
||||
Fay Dowker.
|
||||
\newblock Being and becoming on the road to quantum gravity; or, the birth of a
|
||||
baby is not a baby.
|
||||
\newblock {\em Philosophical Transactions of the Royal Society A},
|
||||
378:20190239, 2020.
|
||||
|
||||
\bibitem{Glaser2018}
|
||||
Lisa Glaser and Sumati Surya.
|
||||
\newblock Finite size scaling in 2d causal set quantum gravity.
|
||||
\newblock {\em Classical and Quantum Gravity}, 35(4):045006, 2018.
|
||||
|
||||
\bibitem{Rideout2000}
|
||||
David~P Rideout and Rafael~D Sorkin.
|
||||
\newblock Classical sequential growth dynamics for causal sets.
|
||||
\newblock {\em Physical Review D}, 61(2):024002, 2000.
|
||||
|
||||
\bibitem{Sorkin2009}
|
||||
Rafael~D Sorkin.
|
||||
\newblock Scalar field theory on a causal set in histories form.
|
||||
\newblock {\em Journal of Physics: Conference Series}, 306:012017, 2009.
|
||||
|
||||
\bibitem{Wald1984}
|
||||
Robert~M Wald.
|
||||
\newblock {\em General Relativity}.
|
||||
\newblock University of Chicago Press, 1984.
|
||||
|
||||
\bibitem{Bousso1999}
|
||||
Raphael Bousso.
|
||||
\newblock A covariant entropy conjecture.
|
||||
\newblock {\em Journal of High Energy Physics}, 1999(07):004, 1999.
|
||||
|
||||
\bibitem{Hayden2007}
|
||||
Patrick Hayden and John Preskill.
|
||||
\newblock Black holes as mirrors: quantum information in random subsystems.
|
||||
\newblock {\em Journal of High Energy Physics}, 2007(09):120, 2007.
|
||||
|
||||
\bibitem{Sekino2008}
|
||||
Yasuhiro Sekino and Leonard Susskind.
|
||||
\newblock Fast scramblers.
|
||||
\newblock {\em Journal of High Energy Physics}, 2008(10):065, 2008.
|
||||
|
||||
\bibitem{Lashkari2013}
|
||||
Nima Lashkari, Douglas Stanford, Matthew Hastings, Tobias Osborne, and Patrick
|
||||
Hayden.
|
||||
\newblock Towards the fast scrambling conjecture.
|
||||
\newblock {\em Journal of High Energy Physics}, 2013(4):22, 2013.
|
||||
|
||||
\bibitem{Hoory2006}
|
||||
Shlomo Hoory, Nathan Linial, and Avi Wigderson.
|
||||
\newblock Expander graphs and their applications.
|
||||
\newblock {\em Bulletin of the American Mathematical Society}, 43(4):439--561,
|
||||
2006.
|
||||
|
||||
\bibitem{Chung1997}
|
||||
Fan R~K Chung.
|
||||
\newblock {\em Spectral Graph Theory}, volume~92 of {\em CBMS Regional
|
||||
Conference Series in Mathematics}.
|
||||
\newblock American Mathematical Society, 1997.
|
||||
|
||||
\bibitem{Cheeger1970}
|
||||
Jeff Cheeger.
|
||||
\newblock A lower bound for the smallest eigenvalue of the laplacian.
|
||||
\newblock {\em Problems in Analysis}, pages 195--199, 1970.
|
||||
|
||||
\bibitem{Alon1985}
|
||||
Noga Alon and Vitali~D Milman.
|
||||
\newblock $\lambda_1$, isoperimetric inequalities for graphs, and
|
||||
superconcentrators.
|
||||
\newblock {\em Journal of Combinatorial Theory, Series B}, 38(1):73--88, 1985.
|
||||
|
||||
\bibitem{Winkler1985}
|
||||
Peter~M Winkler.
|
||||
\newblock Random orders.
|
||||
\newblock {\em Order}, 1(4):317--331, 1985.
|
||||
|
||||
\bibitem{Bollobas2001}
|
||||
B{\'e}la Bollob{\'a}s.
|
||||
\newblock {\em Random Graphs}.
|
||||
\newblock Cambridge University Press, 2nd edition, 2001.
|
||||
|
||||
\bibitem{Mohar1991}
|
||||
Bojan Mohar.
|
||||
\newblock The laplacian spectrum of graphs.
|
||||
\newblock {\em Graph Theory, Combinatorics, and Applications}, 2:871--898,
|
||||
1991.
|
||||
|
||||
\bibitem{Polya1921}
|
||||
George P{\'o}lya.
|
||||
\newblock {\"U}ber eine aufgabe der wahrscheinlichkeitsrechnung betreffend die
|
||||
irrfahrt im stra{\ss}ennetz.
|
||||
\newblock {\em Mathematische Annalen}, 84:149--160, 1921.
|
||||
|
||||
\bibitem{Lawler2010}
|
||||
Gregory~F Lawler and Vlada Limic.
|
||||
\newblock {\em Random Walk: A Modern Introduction}.
|
||||
\newblock Cambridge University Press, 2010.
|
||||
|
||||
\bibitem{Barlow2004}
|
||||
Martin~T Barlow.
|
||||
\newblock Random walks and heat kernels on graphs.
|
||||
\newblock {\em London Mathematical Society Lecture Note Series}, 438, 2017.
|
||||
|
||||
\bibitem{Coulhon2003}
|
||||
Thierry Coulhon and Alexander Grigor'yan.
|
||||
\newblock Heat kernel estimates and the green function on infinite graphs.
|
||||
\newblock {\em Annals of Probability}, pages 763--788, 2003.
|
||||
|
||||
\bibitem{Bousso2006}
|
||||
Raphael Bousso.
|
||||
\newblock Holographic probabilities in eternal inflation.
|
||||
\newblock {\em Physical Review Letters}, 97(19):191302, 2006.
|
||||
|
||||
\bibitem{Hartle2016}
|
||||
James~B Hartle.
|
||||
\newblock The quasiclassical realms of this quantum universe.
|
||||
\newblock {\em Foundations of Physics}, 41(6):982--1006, 2011.
|
||||
|
||||
\bibitem{Gell-Mann1993}
|
||||
Murray Gell-Mann and James~B Hartle.
|
||||
\newblock Classical equations for quantum systems.
|
||||
\newblock {\em Physical Review D}, 47(8):3345, 1993.
|
||||
|
||||
\bibitem{Griffiths2002}
|
||||
Robert~B Griffiths.
|
||||
\newblock {\em Consistent Quantum Theory}.
|
||||
\newblock Cambridge University Press, 2002.
|
||||
|
||||
\bibitem{Omnes1994}
|
||||
Roland Omn{\`e}s.
|
||||
\newblock {\em The Interpretation of Quantum Mechanics}.
|
||||
\newblock Princeton University Press, 1994.
|
||||
|
||||
\bibitem{Maldacena2016}
|
||||
Juan Maldacena, Stephen~H Shenker, and Douglas Stanford.
|
||||
\newblock A bound on chaos.
|
||||
\newblock {\em Journal of High Energy Physics}, 2016(8):106, 2016.
|
||||
|
||||
\bibitem{Roberts2015}
|
||||
Daniel~A Roberts, Douglas Stanford, and Leonard Susskind.
|
||||
\newblock Localized shocks.
|
||||
\newblock {\em Journal of High Energy Physics}, 2015(3):51, 2015.
|
||||
|
||||
\bibitem{tHooft1993}
|
||||
Gerard 't~Hooft.
|
||||
\newblock Dimensional reduction in quantum gravity.
|
||||
\newblock {\em arXiv preprint gr-qc/9310026}, 1993.
|
||||
|
||||
\bibitem{Susskind1995}
|
||||
Leonard Susskind.
|
||||
\newblock The world as a hologram.
|
||||
\newblock {\em Journal of Mathematical Physics}, 36:6377--6396, 1995.
|
||||
|
||||
\bibitem{Maldacena1999}
|
||||
Juan Maldacena.
|
||||
\newblock The large-{N} limit of superconformal field theories and
|
||||
supergravity.
|
||||
\newblock {\em International Journal of Theoretical Physics}, 38(4):1113--1133,
|
||||
1999.
|
||||
|
||||
\bibitem{Carlip2017}
|
||||
Steven Carlip.
|
||||
\newblock Dimension and dimensional reduction in quantum gravity.
|
||||
\newblock {\em Classical and Quantum Gravity}, 34(19):193001, 2017.
|
||||
|
||||
\bibitem{Calcagni2017}
|
||||
Gianluca Calcagni.
|
||||
\newblock Multifractional theories: an unconventional review.
|
||||
\newblock {\em Journal of High Energy Physics}, 2017(3):138, 2017.
|
||||
|
||||
\bibitem{Kitaev2015}
|
||||
Alexei Kitaev.
|
||||
\newblock A simple model of quantum holography.
|
||||
\newblock {\em KITP Program: Entanglement in Strongly-Correlated Quantum
|
||||
Matter}, 2015.
|
||||
\newblock Talks at KITP, April 7 and May 27, 2015.
|
||||
|
||||
\bibitem{Sorkin1994}
|
||||
Rafael~D Sorkin.
|
||||
\newblock Quantum mechanics as quantum measure theory.
|
||||
\newblock {\em Modern Physics Letters A}, 9(33):3119--3127, 1994.
|
||||
|
||||
\end{thebibliography}
|
||||
@@ -0,0 +1,46 @@
|
||||
This is BibTeX, Version 0.99d (TeX Live 2023/Debian)
|
||||
Capacity: max_strings=200000, hash_size=200000, hash_prime=170003
|
||||
The top-level auxiliary file: paper_1_relativity_claude-refactor.aux
|
||||
The style file: unsrt.bst
|
||||
Database file #1: references_refactor.bib
|
||||
You've used 42 entries,
|
||||
1791 wiz_defined-function locations,
|
||||
736 strings with 8707 characters,
|
||||
and the built_in function-call counts, 8719 in all, are:
|
||||
= -- 814
|
||||
> -- 256
|
||||
< -- 4
|
||||
+ -- 108
|
||||
- -- 66
|
||||
* -- 566
|
||||
:= -- 1383
|
||||
add.period$ -- 128
|
||||
call.type$ -- 42
|
||||
change.case$ -- 37
|
||||
chr.to.int$ -- 0
|
||||
cite$ -- 42
|
||||
duplicate$ -- 413
|
||||
empty$ -- 926
|
||||
format.name$ -- 66
|
||||
if$ -- 1943
|
||||
int.to.chr$ -- 0
|
||||
int.to.str$ -- 42
|
||||
missing$ -- 48
|
||||
newline$ -- 214
|
||||
num.names$ -- 42
|
||||
pop$ -- 88
|
||||
preamble$ -- 1
|
||||
purify$ -- 0
|
||||
quote$ -- 0
|
||||
skip$ -- 166
|
||||
stack$ -- 0
|
||||
substring$ -- 651
|
||||
swap$ -- 71
|
||||
text.length$ -- 4
|
||||
text.prefix$ -- 0
|
||||
top$ -- 0
|
||||
type$ -- 0
|
||||
warning$ -- 0
|
||||
while$ -- 93
|
||||
width$ -- 44
|
||||
write$ -- 461
|
||||
@@ -0,0 +1,520 @@
|
||||
This is pdfTeX, Version 3.141592653-2.6-1.40.25 (TeX Live 2023/Debian) (preloaded format=pdflatex 2026.5.30) 2 JUN 2026 21:20
|
||||
entering extended mode
|
||||
restricted \write18 enabled.
|
||||
%&-line parsing enabled.
|
||||
**paper_1_relativity_claude-refactor.tex
|
||||
(./paper_1_relativity_claude-refactor.tex
|
||||
LaTeX2e <2023-11-01> patch level 1
|
||||
L3 programming layer <2024-01-22>
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/base/article.cls
|
||||
Document Class: article 2023/05/17 v1.4n Standard LaTeX document class
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/base/size11.clo
|
||||
File: size11.clo 2023/05/17 v1.4n Standard LaTeX file (size option)
|
||||
)
|
||||
\c@part=\count187
|
||||
\c@section=\count188
|
||||
\c@subsection=\count189
|
||||
\c@subsubsection=\count190
|
||||
\c@paragraph=\count191
|
||||
\c@subparagraph=\count192
|
||||
\c@figure=\count193
|
||||
\c@table=\count194
|
||||
\abovecaptionskip=\skip48
|
||||
\belowcaptionskip=\skip49
|
||||
\bibindent=\dimen140
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/base/inputenc.sty
|
||||
Package: inputenc 2021/02/14 v1.3d Input encoding file
|
||||
\inpenc@prehook=\toks17
|
||||
\inpenc@posthook=\toks18
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/base/fontenc.sty
|
||||
Package: fontenc 2021/04/29 v2.0v Standard LaTeX package
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsmath.sty
|
||||
Package: amsmath 2023/05/13 v2.17o AMS math features
|
||||
\@mathmargin=\skip50
|
||||
|
||||
For additional information on amsmath, use the `?' option.
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amstext.sty
|
||||
Package: amstext 2021/08/26 v2.01 AMS text
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsgen.sty
|
||||
File: amsgen.sty 1999/11/30 v2.0 generic functions
|
||||
\@emptytoks=\toks19
|
||||
\ex@=\dimen141
|
||||
))
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsbsy.sty
|
||||
Package: amsbsy 1999/11/29 v1.2d Bold Symbols
|
||||
\pmbraise@=\dimen142
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsopn.sty
|
||||
Package: amsopn 2022/04/08 v2.04 operator names
|
||||
)
|
||||
\inf@bad=\count195
|
||||
LaTeX Info: Redefining \frac on input line 234.
|
||||
\uproot@=\count196
|
||||
\leftroot@=\count197
|
||||
LaTeX Info: Redefining \overline on input line 399.
|
||||
LaTeX Info: Redefining \colon on input line 410.
|
||||
\classnum@=\count198
|
||||
\DOTSCASE@=\count199
|
||||
LaTeX Info: Redefining \ldots on input line 496.
|
||||
LaTeX Info: Redefining \dots on input line 499.
|
||||
LaTeX Info: Redefining \cdots on input line 620.
|
||||
\Mathstrutbox@=\box51
|
||||
\strutbox@=\box52
|
||||
LaTeX Info: Redefining \big on input line 722.
|
||||
LaTeX Info: Redefining \Big on input line 723.
|
||||
LaTeX Info: Redefining \bigg on input line 724.
|
||||
LaTeX Info: Redefining \Bigg on input line 725.
|
||||
\big@size=\dimen143
|
||||
LaTeX Font Info: Redeclaring font encoding OML on input line 743.
|
||||
LaTeX Font Info: Redeclaring font encoding OMS on input line 744.
|
||||
\macc@depth=\count266
|
||||
LaTeX Info: Redefining \bmod on input line 905.
|
||||
LaTeX Info: Redefining \pmod on input line 910.
|
||||
LaTeX Info: Redefining \smash on input line 940.
|
||||
LaTeX Info: Redefining \relbar on input line 970.
|
||||
LaTeX Info: Redefining \Relbar on input line 971.
|
||||
\c@MaxMatrixCols=\count267
|
||||
\dotsspace@=\muskip16
|
||||
\c@parentequation=\count268
|
||||
\dspbrk@lvl=\count269
|
||||
\tag@help=\toks20
|
||||
\row@=\count270
|
||||
\column@=\count271
|
||||
\maxfields@=\count272
|
||||
\andhelp@=\toks21
|
||||
\eqnshift@=\dimen144
|
||||
\alignsep@=\dimen145
|
||||
\tagshift@=\dimen146
|
||||
\tagwidth@=\dimen147
|
||||
\totwidth@=\dimen148
|
||||
\lineht@=\dimen149
|
||||
\@envbody=\toks22
|
||||
\multlinegap=\skip51
|
||||
\multlinetaggap=\skip52
|
||||
\mathdisplay@stack=\toks23
|
||||
LaTeX Info: Redefining \[ on input line 2953.
|
||||
LaTeX Info: Redefining \] on input line 2954.
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amssymb.sty
|
||||
Package: amssymb 2013/01/14 v3.01 AMS font symbols
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amsfonts.sty
|
||||
Package: amsfonts 2013/01/14 v3.01 Basic AMSFonts support
|
||||
\symAMSa=\mathgroup4
|
||||
\symAMSb=\mathgroup5
|
||||
LaTeX Font Info: Redeclaring math symbol \hbar on input line 98.
|
||||
LaTeX Font Info: Overwriting math alphabet `\mathfrak' in version `bold'
|
||||
(Font) U/euf/m/n --> U/euf/b/n on input line 106.
|
||||
))
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amscls/amsthm.sty
|
||||
Package: amsthm 2020/05/29 v2.20.6
|
||||
\thm@style=\toks24
|
||||
\thm@bodyfont=\toks25
|
||||
\thm@headfont=\toks26
|
||||
\thm@notefont=\toks27
|
||||
\thm@headpunct=\toks28
|
||||
\thm@preskip=\skip53
|
||||
\thm@postskip=\skip54
|
||||
\thm@headsep=\skip55
|
||||
\dth@everypar=\toks29
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/mathtools/mathtools.sty
|
||||
Package: mathtools 2022/06/29 v1.29 mathematical typesetting tools
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/graphics/keyval.sty
|
||||
Package: keyval 2022/05/29 v1.15 key=value parser (DPC)
|
||||
\KV@toks@=\toks30
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/tools/calc.sty
|
||||
Package: calc 2023/07/08 v4.3 Infix arithmetic (KKT,FJ)
|
||||
\calc@Acount=\count273
|
||||
\calc@Bcount=\count274
|
||||
\calc@Adimen=\dimen150
|
||||
\calc@Bdimen=\dimen151
|
||||
\calc@Askip=\skip56
|
||||
\calc@Bskip=\skip57
|
||||
LaTeX Info: Redefining \setlength on input line 80.
|
||||
LaTeX Info: Redefining \addtolength on input line 81.
|
||||
\calc@Ccount=\count275
|
||||
\calc@Cskip=\skip58
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/mathtools/mhsetup.sty
|
||||
Package: mhsetup 2021/03/18 v1.4 programming setup (MH)
|
||||
)
|
||||
\g_MT_multlinerow_int=\count276
|
||||
\l_MT_multwidth_dim=\dimen152
|
||||
\origjot=\skip59
|
||||
\l_MT_shortvdotswithinadjustabove_dim=\dimen153
|
||||
\l_MT_shortvdotswithinadjustbelow_dim=\dimen154
|
||||
\l_MT_above_intertext_sep=\dimen155
|
||||
\l_MT_below_intertext_sep=\dimen156
|
||||
\l_MT_above_shortintertext_sep=\dimen157
|
||||
\l_MT_below_shortintertext_sep=\dimen158
|
||||
\xmathstrut@box=\box53
|
||||
\xmathstrut@dim=\dimen159
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/cite/cite.sty
|
||||
LaTeX Info: Redefining \cite on input line 302.
|
||||
LaTeX Info: Redefining \nocite on input line 332.
|
||||
Package: cite 2015/02/27 v 5.5
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/hyperref/hyperref.sty
|
||||
Package: hyperref 2024-01-20 v7.01h Hypertext links for LaTeX
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/generic/iftex/iftex.sty
|
||||
Package: iftex 2022/02/03 v1.0f TeX engine tests
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/kvsetkeys/kvsetkeys.sty
|
||||
Package: kvsetkeys 2022-10-05 v1.19 Key value parser (HO)
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/generic/kvdefinekeys/kvdefinekeys.sty
|
||||
Package: kvdefinekeys 2019-12-19 v1.6 Define keys (HO)
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/generic/pdfescape/pdfescape.sty
|
||||
Package: pdfescape 2019/12/09 v1.15 Implements pdfTeX's escape features (HO)
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/generic/ltxcmds/ltxcmds.sty
|
||||
Package: ltxcmds 2023-12-04 v1.26 LaTeX kernel commands for general use (HO)
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/generic/pdftexcmds/pdftexcmds.sty
|
||||
Package: pdftexcmds 2020-06-27 v0.33 Utility functions of pdfTeX for LuaTeX (HO
|
||||
)
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/generic/infwarerr/infwarerr.sty
|
||||
Package: infwarerr 2019/12/03 v1.5 Providing info/warning/error messages (HO)
|
||||
)
|
||||
Package pdftexcmds Info: \pdf@primitive is available.
|
||||
Package pdftexcmds Info: \pdf@ifprimitive is available.
|
||||
Package pdftexcmds Info: \pdfdraftmode found.
|
||||
))
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/hycolor/hycolor.sty
|
||||
Package: hycolor 2020-01-27 v1.10 Color options for hyperref/bookmark (HO)
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/auxhook/auxhook.sty
|
||||
Package: auxhook 2019-12-17 v1.6 Hooks for auxiliary files (HO)
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/hyperref/nameref.sty
|
||||
Package: nameref 2023-11-26 v2.56 Cross-referencing by name of section
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/refcount/refcount.sty
|
||||
Package: refcount 2019/12/15 v3.6 Data extraction from label references (HO)
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/generic/gettitlestring/gettitlestring.sty
|
||||
Package: gettitlestring 2019/12/15 v1.6 Cleanup title references (HO)
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/kvoptions/kvoptions.sty
|
||||
Package: kvoptions 2022-06-15 v3.15 Key value format for package options (HO)
|
||||
))
|
||||
\c@section@level=\count277
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/etoolbox/etoolbox.sty
|
||||
Package: etoolbox 2020/10/05 v2.5k e-TeX tools for LaTeX (JAW)
|
||||
\etb@tempcnta=\count278
|
||||
)
|
||||
\@linkdim=\dimen160
|
||||
\Hy@linkcounter=\count279
|
||||
\Hy@pagecounter=\count280
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/hyperref/pd1enc.def
|
||||
File: pd1enc.def 2024-01-20 v7.01h Hyperref: PDFDocEncoding definition (HO)
|
||||
Now handling font encoding PD1 ...
|
||||
... no UTF-8 mapping file for font encoding PD1
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/generic/intcalc/intcalc.sty
|
||||
Package: intcalc 2019/12/15 v1.3 Expandable calculations with integers (HO)
|
||||
)
|
||||
\Hy@SavedSpaceFactor=\count281
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/hyperref/puenc.def
|
||||
File: puenc.def 2024-01-20 v7.01h Hyperref: PDF Unicode definition (HO)
|
||||
Now handling font encoding PU ...
|
||||
... no UTF-8 mapping file for font encoding PU
|
||||
)
|
||||
Package hyperref Info: Hyper figures OFF on input line 4179.
|
||||
Package hyperref Info: Link nesting OFF on input line 4184.
|
||||
Package hyperref Info: Hyper index ON on input line 4187.
|
||||
Package hyperref Info: Plain pages OFF on input line 4194.
|
||||
Package hyperref Info: Backreferencing OFF on input line 4199.
|
||||
Package hyperref Info: Implicit mode ON; LaTeX internals redefined.
|
||||
Package hyperref Info: Bookmarks ON on input line 4446.
|
||||
\c@Hy@tempcnt=\count282
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/url/url.sty
|
||||
\Urlmuskip=\muskip17
|
||||
Package: url 2013/09/16 ver 3.4 Verb mode for urls, etc.
|
||||
)
|
||||
LaTeX Info: Redefining \url on input line 4784.
|
||||
\XeTeXLinkMargin=\dimen161
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/generic/bitset/bitset.sty
|
||||
Package: bitset 2019/12/09 v1.3 Handle bit-vector datatype (HO)
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/generic/bigintcalc/bigintcalc.sty
|
||||
Package: bigintcalc 2019/12/15 v1.5 Expandable calculations on big integers (HO
|
||||
)
|
||||
))
|
||||
\Fld@menulength=\count283
|
||||
\Field@Width=\dimen162
|
||||
\Fld@charsize=\dimen163
|
||||
Package hyperref Info: Hyper figures OFF on input line 6063.
|
||||
Package hyperref Info: Link nesting OFF on input line 6068.
|
||||
Package hyperref Info: Hyper index ON on input line 6071.
|
||||
Package hyperref Info: backreferencing OFF on input line 6078.
|
||||
Package hyperref Info: Link coloring OFF on input line 6083.
|
||||
Package hyperref Info: Link coloring with OCG OFF on input line 6088.
|
||||
Package hyperref Info: PDF/A mode OFF on input line 6093.
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/base/atbegshi-ltx.sty
|
||||
Package: atbegshi-ltx 2021/01/10 v1.0c Emulation of the original atbegshi
|
||||
package with kernel methods
|
||||
)
|
||||
\Hy@abspage=\count284
|
||||
\c@Item=\count285
|
||||
\c@Hfootnote=\count286
|
||||
)
|
||||
Package hyperref Info: Driver (autodetected): hpdftex.
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/hyperref/hpdftex.def
|
||||
File: hpdftex.def 2024-01-20 v7.01h Hyperref driver for pdfTeX
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/base/atveryend-ltx.sty
|
||||
Package: atveryend-ltx 2020/08/19 v1.0a Emulation of the original atveryend pac
|
||||
kage
|
||||
with kernel methods
|
||||
)
|
||||
\Fld@listcount=\count287
|
||||
\c@bookmark@seq@number=\count288
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/rerunfilecheck/rerunfilecheck.sty
|
||||
Package: rerunfilecheck 2022-07-10 v1.10 Rerun checks for auxiliary files (HO)
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/generic/uniquecounter/uniquecounter.sty
|
||||
Package: uniquecounter 2019/12/15 v1.4 Provide unlimited unique counter (HO)
|
||||
)
|
||||
Package uniquecounter Info: New unique counter `rerunfilecheck' on input line 2
|
||||
85.
|
||||
)
|
||||
\Hy@SectionHShift=\skip60
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/geometry/geometry.sty
|
||||
Package: geometry 2020/01/02 v5.9 Page Geometry
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/generic/iftex/ifvtex.sty
|
||||
Package: ifvtex 2019/10/25 v1.7 ifvtex legacy package. Use iftex instead.
|
||||
)
|
||||
\Gm@cnth=\count289
|
||||
\Gm@cntv=\count290
|
||||
\c@Gm@tempcnt=\count291
|
||||
\Gm@bindingoffset=\dimen164
|
||||
\Gm@wd@mp=\dimen165
|
||||
\Gm@odd@mp=\dimen166
|
||||
\Gm@even@mp=\dimen167
|
||||
\Gm@layoutwidth=\dimen168
|
||||
\Gm@layoutheight=\dimen169
|
||||
\Gm@layouthoffset=\dimen170
|
||||
\Gm@layoutvoffset=\dimen171
|
||||
\Gm@dimlist=\toks31
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/enumitem/enumitem.sty
|
||||
Package: enumitem 2019/06/20 v3.9 Customized lists
|
||||
\labelindent=\skip61
|
||||
\enit@outerparindent=\dimen172
|
||||
\enit@toks=\toks32
|
||||
\enit@inbox=\box54
|
||||
\enit@count@id=\count292
|
||||
\enitdp@description=\count293
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/graphics/graphicx.sty
|
||||
Package: graphicx 2021/09/16 v1.2d Enhanced LaTeX Graphics (DPC,SPQR)
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/graphics/graphics.sty
|
||||
Package: graphics 2022/03/10 v1.4e Standard LaTeX Graphics (DPC,SPQR)
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/graphics/trig.sty
|
||||
Package: trig 2021/08/11 v1.11 sin cos tan (DPC)
|
||||
)
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/graphics-cfg/graphics.cfg
|
||||
File: graphics.cfg 2016/06/04 v1.11 sample graphics configuration
|
||||
)
|
||||
Package graphics Info: Driver file: pdftex.def on input line 107.
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/graphics-def/pdftex.def
|
||||
File: pdftex.def 2022/09/22 v1.2b Graphics/color driver for pdftex
|
||||
))
|
||||
\Gin@req@height=\dimen173
|
||||
\Gin@req@width=\dimen174
|
||||
)
|
||||
\c@theorem=\count294
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-pdftex.def
|
||||
File: l3backend-pdftex.def 2024-01-04 L3 backend support: PDF output (pdfTeX)
|
||||
\l__color_backend_stack_int=\count295
|
||||
\l__pdf_internal_box=\box55
|
||||
)
|
||||
(./paper_1_relativity_claude-refactor.aux)
|
||||
\openout1 = `paper_1_relativity_claude-refactor.aux'.
|
||||
|
||||
LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 51.
|
||||
LaTeX Font Info: ... okay on input line 51.
|
||||
LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 51.
|
||||
LaTeX Font Info: ... okay on input line 51.
|
||||
LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 51.
|
||||
LaTeX Font Info: ... okay on input line 51.
|
||||
LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 51.
|
||||
LaTeX Font Info: ... okay on input line 51.
|
||||
LaTeX Font Info: Checking defaults for TS1/cmr/m/n on input line 51.
|
||||
LaTeX Font Info: ... okay on input line 51.
|
||||
LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 51.
|
||||
LaTeX Font Info: ... okay on input line 51.
|
||||
LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 51.
|
||||
LaTeX Font Info: ... okay on input line 51.
|
||||
LaTeX Font Info: Checking defaults for PD1/pdf/m/n on input line 51.
|
||||
LaTeX Font Info: ... okay on input line 51.
|
||||
LaTeX Font Info: Checking defaults for PU/pdf/m/n on input line 51.
|
||||
LaTeX Font Info: ... okay on input line 51.
|
||||
Package hyperref Info: Link coloring OFF on input line 51.
|
||||
|
||||
(./paper_1_relativity_claude-refactor.out)
|
||||
(./paper_1_relativity_claude-refactor.out)
|
||||
\@outlinefile=\write3
|
||||
\openout3 = `paper_1_relativity_claude-refactor.out'.
|
||||
|
||||
|
||||
*geometry* driver: auto-detecting
|
||||
*geometry* detected driver: pdftex
|
||||
*geometry* verbose mode - [ preamble ] result:
|
||||
* driver: pdftex
|
||||
* paper: a4paper
|
||||
* layout: <same size as paper>
|
||||
* layoutoffset:(h,v)=(0.0pt,0.0pt)
|
||||
* modes:
|
||||
* h-part:(L,W,R)=(72.26999pt, 452.9679pt, 72.26999pt)
|
||||
* v-part:(T,H,B)=(72.26999pt, 700.50687pt, 72.26999pt)
|
||||
* \paperwidth=597.50787pt
|
||||
* \paperheight=845.04684pt
|
||||
* \textwidth=452.9679pt
|
||||
* \textheight=700.50687pt
|
||||
* \oddsidemargin=0.0pt
|
||||
* \evensidemargin=0.0pt
|
||||
* \topmargin=-37.0pt
|
||||
* \headheight=12.0pt
|
||||
* \headsep=25.0pt
|
||||
* \topskip=11.0pt
|
||||
* \footskip=30.0pt
|
||||
* \marginparwidth=50.0pt
|
||||
* \marginparsep=10.0pt
|
||||
* \columnsep=10.0pt
|
||||
* \skip\footins=10.0pt plus 4.0pt minus 2.0pt
|
||||
* \hoffset=0.0pt
|
||||
* \voffset=0.0pt
|
||||
* \mag=1000
|
||||
* \@twocolumnfalse
|
||||
* \@twosidefalse
|
||||
* \@mparswitchfalse
|
||||
* \@reversemarginfalse
|
||||
* (1in=72.27pt=25.4mm, 1cm=28.453pt)
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/context/base/mkii/supp-pdf.mkii
|
||||
[Loading MPS to PDF converter (version 2006.09.02).]
|
||||
\scratchcounter=\count296
|
||||
\scratchdimen=\dimen175
|
||||
\scratchbox=\box56
|
||||
\nofMPsegments=\count297
|
||||
\nofMParguments=\count298
|
||||
\everyMPshowfont=\toks33
|
||||
\MPscratchCnt=\count299
|
||||
\MPscratchDim=\dimen176
|
||||
\MPnumerator=\count300
|
||||
\makeMPintoPDFobject=\count301
|
||||
\everyMPtoPDFconversion=\toks34
|
||||
) (/usr/share/texlive/texmf-dist/tex/latex/epstopdf-pkg/epstopdf-base.sty
|
||||
Package: epstopdf-base 2020-01-24 v2.11 Base part for package epstopdf
|
||||
Package epstopdf-base Info: Redefining graphics rule for `.eps' on input line 4
|
||||
85.
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg
|
||||
File: epstopdf-sys.cfg 2010/07/13 v1.3 Configuration of (r)epstopdf for TeX Liv
|
||||
e
|
||||
))
|
||||
LaTeX Font Info: Trying to load font information for U+msa on input line 53.
|
||||
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsa.fd
|
||||
File: umsa.fd 2013/01/14 v3.01 AMS symbols A
|
||||
)
|
||||
LaTeX Font Info: Trying to load font information for U+msb on input line 53.
|
||||
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsb.fd
|
||||
File: umsb.fd 2013/01/14 v3.01 AMS symbols B
|
||||
)
|
||||
LaTeX Font Info: Trying to load font information for T1+cmtt on input line 5
|
||||
3.
|
||||
|
||||
(/usr/share/texlive/texmf-dist/tex/latex/base/t1cmtt.fd
|
||||
File: t1cmtt.fd 2023/04/13 v2.5m Standard LaTeX font definitions
|
||||
) [1
|
||||
|
||||
{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map}] [2] [3] [4] [5] [6] [7]
|
||||
Overfull \hbox (1.70348pt too wide) in paragraph at lines 815--819
|
||||
[]\T1/cmr/m/n/10.95 Combination of ob-server con-di-tion-ing with the Loomis--C
|
||||
arlip os-cil-la-tory sup-pres-sion mech-
|
||||
[]
|
||||
|
||||
[8] (./paper_1_relativity_claude-refactor.bbl [9] [10]) [11]
|
||||
(./paper_1_relativity_claude-refactor.aux)
|
||||
***********
|
||||
LaTeX2e <2023-11-01> patch level 1
|
||||
L3 programming layer <2024-01-22>
|
||||
***********
|
||||
Package rerunfilecheck Info: File `paper_1_relativity_claude-refactor.out' has
|
||||
not changed.
|
||||
(rerunfilecheck) Checksum: 981B9837E5FDF603B4E13FC691548C7A;3338.
|
||||
)
|
||||
Here is how much of TeX's memory you used:
|
||||
11722 strings out of 476106
|
||||
178993 string characters out of 5793933
|
||||
1939975 words of memory out of 5000000
|
||||
33451 multiletter control sequences out of 15000+600000
|
||||
575616 words of font info for 82 fonts, out of 8000000 for 9000
|
||||
59 hyphenation exceptions out of 8191
|
||||
75i,6n,79p,571b,588s stack positions out of 10000i,1000n,20000p,200000b,200000s
|
||||
</home/antigravity/.texlive2023/texmf-var/fonts/pk/ljfour/jknappen/ec/ecbx12
|
||||
00.600pk> </home/antigravity/.texlive2023/texmf-var/fonts/pk/ljfour/jknappen/ec
|
||||
/tcrm1095.600pk> </home/antigravity/.texlive2023/texmf-var/fonts/pk/ljfour/jkna
|
||||
ppen/ec/ecbx1095.600pk> </home/antigravity/.texlive2023/texmf-var/fonts/pk/ljfo
|
||||
ur/jknappen/ec/ecti1095.600pk> </home/antigravity/.texlive2023/texmf-var/fonts/
|
||||
pk/ljfour/jknappen/ec/ecrm1095.600pk> </home/antigravity/.texlive2023/texmf-var
|
||||
/fonts/pk/ljfour/jknappen/ec/ecbx1440.600pk> </home/antigravity/.texlive2023/te
|
||||
xmf-var/fonts/pk/ljfour/jknappen/ec/ecti1000.600pk> </home/antigravity/.texlive
|
||||
2023/texmf-var/fonts/pk/ljfour/jknappen/ec/ecrm1000.600pk> </home/antigravity/.
|
||||
texlive2023/texmf-var/fonts/pk/ljfour/jknappen/ec/ecbx1000.600pk> </home/antigr
|
||||
avity/.texlive2023/texmf-var/fonts/pk/ljfour/jknappen/ec/ectt1200.600pk> </home
|
||||
/antigravity/.texlive2023/texmf-var/fonts/pk/ljfour/jknappen/ec/ecti1200.600pk>
|
||||
</home/antigravity/.texlive2023/texmf-var/fonts/pk/ljfour/jknappen/ec/ecrm1200
|
||||
.600pk> </home/antigravity/.texlive2023/texmf-var/fonts/pk/ljfour/jknappen/ec/e
|
||||
crm1728.600pk></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cme
|
||||
x10.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi10.pf
|
||||
b></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi6.pfb></usr
|
||||
/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi8.pfb></usr/share/
|
||||
texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr10.pfb></usr/share/texlive
|
||||
/texmf-dist/fonts/type1/public/amsfonts/cm/cmr6.pfb></usr/share/texlive/texmf-d
|
||||
ist/fonts/type1/public/amsfonts/cm/cmr7.pfb></usr/share/texlive/texmf-dist/font
|
||||
s/type1/public/amsfonts/cm/cmr8.pfb></usr/share/texlive/texmf-dist/fonts/type1/
|
||||
public/amsfonts/cm/cmsy10.pfb></usr/share/texlive/texmf-dist/fonts/type1/public
|
||||
/amsfonts/cm/cmsy7.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfon
|
||||
ts/cm/cmsy8.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/symb
|
||||
ols/msam10.pfb></usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/symbo
|
||||
ls/msbm10.pfb>
|
||||
Output written on paper_1_relativity_claude-refactor.pdf (11 pages, 313268 byte
|
||||
s).
|
||||
PDF statistics:
|
||||
910 PDF objects out of 1000 (max. 8388607)
|
||||
428 compressed objects within 5 object streams
|
||||
127 named destinations out of 1000 (max. 500000)
|
||||
129 words of extra memory for PDF output out of 10000 (max. 10000000)
|
||||
|
||||
@@ -0,0 +1,16 @@
|
||||
\BOOKMARK [1][-]{section.1}{\376\377\000I\000n\000t\000r\000o\000d\000u\000c\000t\000i\000o\000n}{}% 1
|
||||
\BOOKMARK [1][-]{section.2}{\376\377\000P\000r\000e\000l\000i\000m\000i\000n\000a\000r\000i\000e\000s\000\040\000a\000n\000d\000\040\000N\000o\000t\000a\000t\000i\000o\000n}{}% 2
|
||||
\BOOKMARK [1][-]{section.3}{\376\377\000F\000o\000r\000m\000a\000l\000i\000z\000i\000n\000g\000\040\000t\000h\000e\000\040\000C\000a\000u\000s\000a\000l\000\040\000O\000b\000s\000e\000r\000v\000e\000r}{}% 3
|
||||
\BOOKMARK [1][-]{section.4}{\376\377\000O\000b\000s\000e\000r\000v\000e\000r\000-\000C\000o\000n\000d\000i\000t\000i\000o\000n\000e\000d\000\040\000P\000a\000r\000t\000i\000t\000i\000o\000n\000\040\000F\000u\000n\000c\000t\000i\000o\000n\000\040\000a\000n\000d\000\040\000K\000R\000\040\000E\000x\000c\000l\000u\000s\000i\000o\000n}{}% 4
|
||||
\BOOKMARK [1][-]{section.5}{\376\377\000I\000n\000f\000o\000r\000m\000a\000t\000i\000o\000n\000\040\000S\000c\000r\000a\000m\000b\000l\000i\000n\000g\000\040\000a\000n\000d\000\040\000E\000x\000p\000a\000n\000d\000e\000r\000\040\000E\000x\000c\000l\000u\000s\000i\000o\000n}{}% 5
|
||||
\BOOKMARK [2][-]{subsection.5.1}{\376\377\000S\000c\000r\000a\000m\000b\000l\000i\000n\000g\000\040\000t\000i\000m\000e\000\040\000f\000r\000o\000m\000\040\000s\000p\000e\000c\000t\000r\000a\000l\000\040\000a\000n\000a\000l\000y\000s\000i\000s}{section.5}% 6
|
||||
\BOOKMARK [2][-]{subsection.5.2}{\376\377\000P\000h\000y\000s\000i\000c\000a\000l\000\040\000i\000n\000t\000e\000r\000p\000r\000e\000t\000a\000t\000i\000o\000n\000:\000\040\000f\000a\000s\000t\000\040\000s\000c\000r\000a\000m\000b\000l\000e\000r\000s\000\040\000a\000n\000d\000\040\000n\000o\000n\000-\000m\000a\000n\000i\000f\000o\000l\000d\000\040\000t\000o\000p\000o\000l\000o\000g\000y}{section.5}% 7
|
||||
\BOOKMARK [1][-]{section.6}{\376\377\000D\000i\000m\000e\000n\000s\000i\000o\000n\000a\000l\000\040\000C\000o\000n\000s\000t\000r\000a\000i\000n\000t\000s\000\040\000f\000r\000o\000m\000\040\000S\000p\000e\000c\000t\000r\000a\000l\000\040\000E\000x\000p\000a\000n\000s\000i\000o\000n}{}% 8
|
||||
\BOOKMARK [2][-]{subsection.6.1}{\376\377\000S\000p\000e\000c\000t\000r\000a\000l\000\040\000g\000a\000p\000\040\000a\000n\000d\000\040\000g\000r\000a\000p\000h\000\040\000d\000i\000m\000e\000n\000s\000i\000o\000n}{section.6}% 9
|
||||
\BOOKMARK [2][-]{subsection.6.2}{\376\377\000R\000e\000c\000u\000r\000r\000e\000n\000c\000e\000\040\000a\000n\000d\000\040\000i\000n\000f\000o\000r\000m\000a\000t\000i\000o\000n\000\040\000l\000o\000c\000a\000l\000i\000z\000a\000t\000i\000o\000n}{section.6}% 10
|
||||
\BOOKMARK [1][-]{section.7}{\376\377\000R\000e\000l\000a\000t\000e\000d\000\040\000W\000o\000r\000k}{}% 11
|
||||
\BOOKMARK [1][-]{section.8}{\376\377\000D\000i\000s\000c\000u\000s\000s\000i\000o\000n}{}% 12
|
||||
\BOOKMARK [2][-]{subsection.8.1}{\376\377\000L\000i\000m\000i\000t\000a\000t\000i\000o\000n\000s\000\040\000a\000n\000d\000\040\000s\000c\000o\000p\000e}{section.8}% 13
|
||||
\BOOKMARK [2][-]{subsection.8.2}{\376\377\000P\000h\000y\000s\000i\000c\000a\000l\000\040\000i\000n\000t\000e\000r\000p\000r\000e\000t\000a\000t\000i\000o\000n}{section.8}% 14
|
||||
\BOOKMARK [2][-]{subsection.8.3}{\376\377\000F\000u\000t\000u\000r\000e\000\040\000d\000i\000r\000e\000c\000t\000i\000o\000n\000s}{section.8}% 15
|
||||
\BOOKMARK [1][-]{section.9}{\376\377\000C\000o\000n\000c\000l\000u\000s\000i\000o\000n}{}% 16
|
||||
Binary file not shown.
@@ -0,0 +1,889 @@
|
||||
\documentclass[11pt,a4paper]{article}
|
||||
|
||||
%%% =====================================================================
|
||||
%%% PACKAGES
|
||||
%%% =====================================================================
|
||||
\usepackage[utf8]{inputenc}
|
||||
\usepackage[T1]{fontenc}
|
||||
\usepackage{amsmath,amssymb,amsfonts,amsthm}
|
||||
\usepackage{mathtools}
|
||||
\usepackage{cite}
|
||||
\usepackage{hyperref}
|
||||
\usepackage[margin=1in]{geometry}
|
||||
\usepackage{enumitem}
|
||||
\usepackage{graphicx}
|
||||
% \usepackage{microtype} % Requires scalable fonts
|
||||
|
||||
%%% =====================================================================
|
||||
%%% THEOREM ENVIRONMENTS
|
||||
%%% =====================================================================
|
||||
\newtheorem{theorem}{Theorem}[section]
|
||||
\newtheorem{proposition}[theorem]{Proposition}
|
||||
\newtheorem{lemma}[theorem]{Lemma}
|
||||
\newtheorem{corollary}[theorem]{Corollary}
|
||||
\theoremstyle{definition}
|
||||
\newtheorem{definition}[theorem]{Definition}
|
||||
\theoremstyle{remark}
|
||||
\newtheorem{remark}[theorem]{Remark}
|
||||
|
||||
%%% =====================================================================
|
||||
%%% CUSTOM COMMANDS
|
||||
%%% =====================================================================
|
||||
\newcommand{\Cset}{\mathcal{C}}
|
||||
\newcommand{\Obs}{\mathcal{O}}
|
||||
\newcommand{\Hmem}{\mathcal{H}_{\mathrm{mem}}}
|
||||
\newcommand{\Omobs}{\Omega_{\mathrm{obs}}}
|
||||
\newcommand{\PiObs}{\Pi_{\Obs}}
|
||||
\newcommand{\SBD}{S_{\mathrm{BD}}}
|
||||
\newcommand{\tscr}{\tau_{\mathrm{scr}}}
|
||||
\newcommand{\BigO}{\mathcal{O}}
|
||||
|
||||
%%% =====================================================================
|
||||
%%% TITLE AND AUTHOR
|
||||
%%% =====================================================================
|
||||
\title{Observer-Conditioned Path Integrals and the Suppression \\
|
||||
of Entropic Dominance in Causal Set Theory}
|
||||
\author{Mark Randall Havens \\
|
||||
\textit{The Fold Within Research Institute} \\
|
||||
\texttt{mark.havens@foldwithin.org}}
|
||||
\date{June 2026}
|
||||
|
||||
\begin{document}
|
||||
\maketitle
|
||||
|
||||
%%% =====================================================================
|
||||
%%% ABSTRACT
|
||||
%%% =====================================================================
|
||||
\begin{abstract}
|
||||
The gravitational path integral over the space of causal sets
|
||||
is dominated by Kleitman--Rothschild (KR) posets---highly connected,
|
||||
three-level partial orders whose multiplicity grows as
|
||||
$\exp\!\bigl(\BigO(N^2)\bigr)$, vastly exceeding the measure of
|
||||
manifold-like configurations.
|
||||
We introduce an \emph{observer-conditioned partition function}
|
||||
that restricts the sum over causal sets to those admitting a
|
||||
localized observer with persistent memory.
|
||||
By formalizing the observer as a causal subgraph possessing
|
||||
(i)~global causal connectedness to the bulk,
|
||||
(ii)~a causal chain of macroscopic length $T \gg 1$, and
|
||||
(iii)~a scrambling time exceeding $T$, we construct a projection
|
||||
operator $\PiObs$ on the space of causal sets.
|
||||
We prove that $\PiObs$ annihilates pure KR posets by temporal-depth
|
||||
exclusion, eliminates composite KR-chain configurations by the
|
||||
causal connectedness condition, and suppresses high-connectivity
|
||||
non-manifold posets via information-scrambling bounds derived from
|
||||
spectral gap analysis.
|
||||
The resulting observer-compatible ensemble is restricted to
|
||||
causal sets whose Hasse diagrams exhibit low spectral expansion
|
||||
and support recurrent information dynamics---properties
|
||||
characteristic of low-dimensional manifold-like orders.
|
||||
We discuss the relationship between observer conditioning and
|
||||
existing dynamical suppression mechanisms, and comment on
|
||||
implications for the continuum limit of causal set quantum gravity.
|
||||
|
||||
\medskip
|
||||
\noindent\textbf{Keywords:}
|
||||
causal set theory, path integral, Kleitman--Rothschild orders,
|
||||
observer selection, information scrambling, spectral gap,
|
||||
quantum gravity
|
||||
|
||||
\medskip
|
||||
\noindent\textbf{PACS:}
|
||||
04.60.Pp, 04.60.Nc, 03.67.-a
|
||||
\end{abstract}
|
||||
|
||||
%%% =====================================================================
|
||||
%%% 1. INTRODUCTION
|
||||
%%% =====================================================================
|
||||
\section{Introduction}\label{sec:intro}
|
||||
|
||||
Causal Set Theory (CST) provides a Lorentz-invariant framework for
|
||||
discrete quantum gravity in which spacetime is replaced by a locally
|
||||
finite partially ordered set (poset), where the order relation encodes
|
||||
causal structure and cardinality encodes spacetime
|
||||
volume~\cite{Bombelli1987,Sorkin2003,Surya2019}.
|
||||
A central open problem in CST is the construction of a well-defined
|
||||
path integral---a sum over causal sets weighted by the
|
||||
Benincasa--Dowker (BD) action~\cite{Benincasa2010}---that
|
||||
reproduces general relativity in an appropriate continuum limit.
|
||||
|
||||
The most severe obstacle to this program is the
|
||||
\emph{entropy problem}: the overwhelming combinatorial dominance
|
||||
of non-manifold-like causal sets over manifold-like ones.
|
||||
Kleitman and Rothschild~\cite{Kleitman1975} established that
|
||||
almost all finite posets on $N$ elements are three-level bipartite
|
||||
orders with layers of approximate size $N/4$, $N/2$, $N/4$.
|
||||
The number of such Kleitman--Rothschild (KR) posets grows as
|
||||
$\exp\!\bigl(\BigO(N^2)\bigr)$~\cite{Kleitman1975,Brightwell1991},
|
||||
dwarfing the $\exp\!\bigl(\BigO(N)\bigr)$ count of manifold-like
|
||||
sprinklings into fixed spacetimes~\cite{Surya2019}.
|
||||
|
||||
Loomis and Carlip~\cite{Loomis2018} demonstrated that the
|
||||
oscillatory phase of the BD action suppresses the contribution
|
||||
of \emph{two-level} non-manifold-like orders in the Lorentzian
|
||||
path integral.
|
||||
However, their mechanism does not extend to the dominant
|
||||
three-level KR orders, which remain a persistent theoretical
|
||||
obstacle~\cite{Surya2019,Carlip2023,Dowker2020,Glaser2018}.
|
||||
Alternative proposals include modified actions~\cite{Benincasa2010,Glaser2018},
|
||||
growth dynamics~\cite{Rideout2000,Dowker2020}, and coupling to
|
||||
matter fields~\cite{Sorkin2009}, but no complete resolution has
|
||||
been achieved.
|
||||
|
||||
In this paper, we pursue a complementary approach:
|
||||
we impose an \emph{observer-conditioned selection principle}
|
||||
on the causal set path integral.
|
||||
The central physical idea is simple---a causal set that cannot
|
||||
support the existence of a localized observer with persistent
|
||||
memory is \emph{operationally inaccessible} and should not
|
||||
contribute to physically observable quantities.
|
||||
This is not a dynamical suppression mechanism acting through
|
||||
the action, but rather a constraint on the ensemble of causal
|
||||
sets over which the path integral is evaluated, analogous to
|
||||
superselection rules in quantum mechanics or the imposition of
|
||||
boundary conditions.
|
||||
|
||||
We formalize this idea by constructing a projection operator
|
||||
$\PiObs$ that enforces three conditions:
|
||||
\begin{enumerate}[label=(\roman*)]
|
||||
\item \textbf{Global causal connectedness:}
|
||||
the entire causal set lies within the causal
|
||||
past and future of the observer;
|
||||
\item \textbf{Temporal depth:}
|
||||
the observer's worldline contains a causal chain of
|
||||
length at least $T \gg 1$;
|
||||
\item \textbf{Memory persistence:}
|
||||
the scrambling time of the causal set exceeds $T$,
|
||||
ensuring that localized information survives long
|
||||
enough for macroscopic observation.
|
||||
\end{enumerate}
|
||||
|
||||
We prove that $\PiObs$ annihilates KR posets and suppresses
|
||||
high-connectivity non-manifold-like orders, restricting the
|
||||
observer-conditioned partition function to causal sets with
|
||||
low spectral expansion---a necessary condition for manifold-like
|
||||
structure.
|
||||
|
||||
The remainder of the paper is organized as follows.
|
||||
Section~\ref{sec:prelim} fixes notation and reviews relevant
|
||||
background.
|
||||
Section~\ref{sec:observer} formalizes the causal observer.
|
||||
Section~\ref{sec:partition} defines the observer-conditioned
|
||||
partition function and proves KR exclusion.
|
||||
Section~\ref{sec:scrambling} establishes scrambling-time bounds
|
||||
and their consequences.
|
||||
Section~\ref{sec:dimension} derives the dimensional constraint
|
||||
from spectral analysis.
|
||||
Section~\ref{sec:related} discusses related work.
|
||||
Section~\ref{sec:discussion} addresses limitations, physical
|
||||
interpretation, and future directions.
|
||||
Section~\ref{sec:conclusion} concludes.
|
||||
|
||||
%%% =====================================================================
|
||||
%%% 2. PRELIMINARIES AND NOTATION
|
||||
%%% =====================================================================
|
||||
\section{Preliminaries and Notation}\label{sec:prelim}
|
||||
|
||||
We collect the relevant definitions and fix notation used
|
||||
throughout the paper.
|
||||
|
||||
\begin{definition}[Causal set]\label{def:causet}
|
||||
A \emph{causal set} is a locally finite partially ordered set
|
||||
$\Cset = (V, \preccurlyeq)$, where $V$ is a finite set of
|
||||
elements (``events'') and $\preccurlyeq$ is a partial order
|
||||
that is reflexive, antisymmetric, transitive, and locally
|
||||
finite (every causal interval
|
||||
$[x, y] \coloneqq \{z \in V : x \preccurlyeq z \preccurlyeq y\}$
|
||||
contains finitely many elements).
|
||||
\end{definition}
|
||||
|
||||
\begin{definition}[Hasse diagram and links]\label{def:hasse}
|
||||
The \emph{Hasse diagram} of $\Cset$ is the directed acyclic graph
|
||||
$(V, E)$ where $(x, y) \in E$ if and only if $x \prec y$ and
|
||||
there is no $z$ with $x \prec z \prec y$ (i.e., $y$ \emph{covers}
|
||||
$x$). Elements of $E$ are called \emph{links}.
|
||||
\end{definition}
|
||||
|
||||
\begin{definition}[Causal past, future, and diamond]\label{def:causal}
|
||||
For $x \in V$, define the \emph{causal past}
|
||||
$J^-(x) \coloneqq \{y \in V : y \preccurlyeq x\}$
|
||||
and \emph{causal future}
|
||||
$J^+(x) \coloneqq \{y \in V : x \preccurlyeq y\}$.
|
||||
For a subset $A \subseteq V$, set
|
||||
$J^\pm(A) \coloneqq \bigcup_{x \in A} J^\pm(x)$.
|
||||
\end{definition}
|
||||
|
||||
\begin{definition}[Height and chains]\label{def:height}
|
||||
A \emph{chain} in $\Cset$ is a totally ordered subset
|
||||
$\{x_1 \prec x_2 \prec \cdots \prec x_k\}$.
|
||||
The \emph{height} $H(\Cset)$ of $\Cset$ is the length of the
|
||||
longest chain.
|
||||
An $\ell$-\emph{level} poset has height $\ell$.
|
||||
\end{definition}
|
||||
|
||||
\begin{definition}[Kleitman--Rothschild poset]\label{def:KR}
|
||||
A \emph{Kleitman--Rothschild (KR) poset} of cardinality $N$ is
|
||||
a three-level bipartite order with layers
|
||||
$L_1, L_2, L_3$ of sizes approximately $N/4, N/2, N/4$
|
||||
respectively, where each element of $L_i$ covers approximately
|
||||
half the elements of $L_{i-1}$~\cite{Kleitman1975}.
|
||||
The number of KR posets on $N$ elements satisfies
|
||||
\begin{equation}\label{eq:KR-count}
|
||||
|\mathrm{KR}_N| = \exp\!\bigl(\BigO(N^2)\bigr),
|
||||
\end{equation}
|
||||
and in the limit $N \to \infty$, the fraction of all $N$-element
|
||||
posets that are KR orders tends to one~\cite{Kleitman1975,Brightwell1991}.
|
||||
\end{definition}
|
||||
|
||||
\begin{definition}[Benincasa--Dowker action]\label{def:BD}
|
||||
The \emph{Benincasa--Dowker (BD) action} on a causal set $\Cset$
|
||||
of cardinality $N$ is~\cite{Benincasa2010}
|
||||
\begin{equation}\label{eq:BD}
|
||||
\SBD(\Cset) = \sum_{k=0}^{d}
|
||||
\alpha_k^{(d)} \sum_{\substack{x, y \in V \\ x \preccurlyeq y}}
|
||||
\bigl(-1\bigr)^{|[x,y]|}\,,
|
||||
\end{equation}
|
||||
where $d$ is the target spacetime dimension and $\alpha_k^{(d)}$
|
||||
are dimension-dependent coefficients.
|
||||
For $d = 2$, this reduces to counting order intervals
|
||||
weighted by the Möbius function of the
|
||||
poset~\cite{Benincasa2010,Surya2019}.
|
||||
\end{definition}
|
||||
|
||||
\begin{definition}[Cheeger constant]\label{def:cheeger}
|
||||
For a finite graph $G = (V, E)$, the \emph{Cheeger constant}
|
||||
(isoperimetric number) is
|
||||
\begin{equation}\label{eq:cheeger}
|
||||
h(G) \coloneqq \min_{\substack{S \subset V \\
|
||||
0 < |S| \leq |V|/2}}
|
||||
\frac{|\partial S|}{|S|}\,,
|
||||
\end{equation}
|
||||
where $\partial S$ denotes the set of edges between $S$ and
|
||||
$V \setminus S$.
|
||||
A graph is an \emph{expander} if $h(G) \geq c$ for some
|
||||
constant $c > 0$ independent of $|V|$.
|
||||
\end{definition}
|
||||
|
||||
%%% =====================================================================
|
||||
%%% 3. FORMALIZING THE CAUSAL OBSERVER
|
||||
%%% =====================================================================
|
||||
\section{Formalizing the Causal Observer}\label{sec:observer}
|
||||
|
||||
The standard causal set partition function sums over all
|
||||
$N$-element causal sets:
|
||||
\begin{equation}\label{eq:Z-standard}
|
||||
Z_N = \sum_{\Cset \in \Omega_N}
|
||||
\exp\!\bigl(i\,\SBD(\Cset)\bigr),
|
||||
\end{equation}
|
||||
where $\Omega_N$ denotes the ensemble of all causal sets of
|
||||
cardinality $N$.
|
||||
This sum is pathologically dominated by KR posets.
|
||||
We now introduce the observer-conditioned restriction.
|
||||
|
||||
\begin{definition}[Causal observer]\label{def:observer}
|
||||
An \emph{observer} in a causal set $\Cset = (V, \preccurlyeq)$
|
||||
is a pair $\Obs = (V_{\Obs}, \gamma)$ where:
|
||||
\begin{enumerate}[label=(\alph*)]
|
||||
\item $V_{\Obs} \subset V$ is a non-empty subset of elements
|
||||
(the observer's ``worldtube'');
|
||||
\item $\gamma = (v_1 \prec v_2 \prec \cdots \prec v_T)$
|
||||
is a chain in $V_{\Obs}$ of length $T$ (the observer's
|
||||
``worldline''), representing sequential temporal
|
||||
evolution.
|
||||
\end{enumerate}
|
||||
\end{definition}
|
||||
|
||||
The requirement that the observer possess an internal temporal
|
||||
history of macroscopic length $T$ is the discrete analogue of
|
||||
demanding a worldline of sufficient proper time.
|
||||
The parameter $T$ is a macroscopic number satisfying $T \gg 1$;
|
||||
physically, it encodes the requirement that the observer persist
|
||||
through enough ``ticks'' to accumulate and process information.
|
||||
|
||||
\begin{definition}[Global causal connectedness]\label{def:connected}
|
||||
A causal set $\Cset = (V, \preccurlyeq)$ is
|
||||
\emph{observer-connected} with respect to observer
|
||||
$\Obs = (V_{\Obs}, \gamma)$ if
|
||||
\begin{equation}\label{eq:connected}
|
||||
V = J^-(V_{\Obs}) \cup J^+(V_{\Obs}).
|
||||
\end{equation}
|
||||
That is, every element of $\Cset$ lies in the causal past
|
||||
or causal future of at least one observer element.
|
||||
\end{definition}
|
||||
|
||||
\begin{remark}\label{rem:connected}
|
||||
Condition~\eqref{eq:connected} excludes causally disconnected
|
||||
regions that are operationally inaccessible to the observer.
|
||||
This is the discrete analogue of restricting to the
|
||||
globally hyperbolic region of a spacetime that is
|
||||
causally accessible to a given
|
||||
timelike worldline~\cite{Wald1984,Bousso1999}.
|
||||
\end{remark}
|
||||
|
||||
\begin{definition}[Memory register and scrambling time]\label{def:memory}
|
||||
The observer $\Obs$ possesses a \emph{memory register}---a
|
||||
localized subsystem whose state must persist coherently along
|
||||
the chain $\gamma$.
|
||||
We model the information dynamics on $\Cset$ by treating the
|
||||
Hasse diagram as a network of local unitary (or stochastic)
|
||||
channels.
|
||||
The \emph{scrambling time} $\tscr(\Cset)$ is the timescale
|
||||
on which an initially localized state becomes fully delocalized
|
||||
across $\Cset$.
|
||||
We require memory persistence:
|
||||
\begin{equation}\label{eq:memory}
|
||||
\tscr(\Cset) > T.
|
||||
\end{equation}
|
||||
\end{definition}
|
||||
|
||||
\begin{remark}\label{rem:scrambling-def}
|
||||
The scrambling time is defined operationally through the decay
|
||||
of the mutual information between the initial localized state
|
||||
and a local subsystem after $t$ time steps of the network
|
||||
dynamics~\cite{Hayden2007,Sekino2008,Lashkari2013}.
|
||||
For generic unitary dynamics on a graph, the scrambling time
|
||||
is controlled by the spectral gap of the graph Laplacian
|
||||
and the Cheeger constant of the Hasse
|
||||
diagram~\cite{Hoory2006}.
|
||||
\end{remark}
|
||||
|
||||
%%% =====================================================================
|
||||
%%% 4. THE OBSERVER-CONDITIONED PARTITION FUNCTION
|
||||
%%% =====================================================================
|
||||
\section{Observer-Conditioned Partition Function and
|
||||
KR Exclusion}\label{sec:partition}
|
||||
|
||||
We now define the observer-conditioned partition function and
|
||||
establish its key property: the exact annihilation of KR posets.
|
||||
|
||||
\begin{definition}[Projection operator]\label{def:projection}
|
||||
The \emph{observer projection operator}
|
||||
$\PiObs : \Omega_N \to \{0, 1\}$ is defined by
|
||||
\begin{equation}\label{eq:projection}
|
||||
\PiObs(\Cset) \coloneqq
|
||||
\delta\!\bigl(V,\, J^-(V_{\Obs}) \cup J^+(V_{\Obs})\bigr)
|
||||
\cdot \Theta\!\bigl(H_{\Obs} - T\bigr)
|
||||
\cdot \Theta\!\bigl(\tscr(\Cset) - T\bigr),
|
||||
\end{equation}
|
||||
where:
|
||||
\begin{itemize}
|
||||
\item $\delta(A, B) = 1$ if $A = B$ and $0$ otherwise
|
||||
(the Kronecker delta enforcing global causal connectedness);
|
||||
\item $H_{\Obs} \coloneqq H(V_{\Obs})$ is the height of the
|
||||
subposet induced on $V_{\Obs}$;
|
||||
\item $\Theta$ is the Heaviside step function;
|
||||
\item $T \gg 1$ is the macroscopic persistence parameter.
|
||||
\end{itemize}
|
||||
\end{definition}
|
||||
|
||||
\begin{definition}[Observer-conditioned partition function]\label{def:Zobs}
|
||||
The \emph{observer-conditioned partition function} is
|
||||
\begin{equation}\label{eq:Zobs}
|
||||
Z_{\mathrm{obs}} \coloneqq
|
||||
\sum_{\Cset \in \Omega_N}
|
||||
\PiObs(\Cset)\,
|
||||
\exp\!\bigl(i\,\SBD(\Cset)\bigr)
|
||||
= \sum_{\Cset \in \Omobs}
|
||||
\exp\!\bigl(i\,\SBD(\Cset)\bigr),
|
||||
\end{equation}
|
||||
where $\Omobs \coloneqq
|
||||
\{\Cset \in \Omega_N : \PiObs(\Cset) = 1\}$ is the
|
||||
\emph{observer-compatible ensemble}.
|
||||
\end{definition}
|
||||
|
||||
We now prove that KR posets are excluded from $\Omobs$.
|
||||
|
||||
\begin{proposition}[Temporal-depth exclusion of pure KR posets]
|
||||
\label{prop:KR-pure}
|
||||
Let $\Cset_{\mathrm{KR}}$ be a pure KR poset of cardinality $N$.
|
||||
Then $\PiObs(\Cset_{\mathrm{KR}}) = 0$ for any $T > 3$.
|
||||
\end{proposition}
|
||||
|
||||
\begin{proof}
|
||||
By definition (Definition~\ref{def:KR}), a KR poset has
|
||||
height $H(\Cset_{\mathrm{KR}}) = 3$.
|
||||
Any chain in $\Cset_{\mathrm{KR}}$ has length at most $3$.
|
||||
Since $V_{\Obs} \subseteq V$, the induced subposet on
|
||||
$V_{\Obs}$ satisfies $H_{\Obs} \leq H(\Cset_{\mathrm{KR}}) = 3$.
|
||||
For $T > 3$, the Heaviside factor
|
||||
$\Theta(H_{\Obs} - T) = \Theta(3 - T) = 0$.
|
||||
Hence $\PiObs(\Cset_{\mathrm{KR}}) = 0$.
|
||||
\end{proof}
|
||||
|
||||
This eliminates pure KR posets, but one must also consider
|
||||
the possibility of \emph{composite} configurations: a large
|
||||
KR subposet attached to a thin chain.
|
||||
|
||||
\begin{proposition}[Exclusion of KR--chain composites]
|
||||
\label{prop:KR-composite}
|
||||
Let $\Cset$ be a causal set that decomposes as
|
||||
$V = V_{\mathrm{KR}} \sqcup V_{\mathrm{chain}}$, where
|
||||
$V_{\mathrm{KR}}$ induces a KR subposet and
|
||||
$V_{\mathrm{chain}}$ induces a chain of length $T$,
|
||||
with $V_{\mathrm{KR}} \cap
|
||||
\bigl(J^-(V_{\mathrm{chain}}) \cup J^+(V_{\mathrm{chain}})\bigr)
|
||||
= \varnothing$.
|
||||
Then $\PiObs(\Cset) = 0$.
|
||||
\end{proposition}
|
||||
|
||||
\begin{proof}
|
||||
If $V_{\mathrm{KR}}$ is causally disconnected from
|
||||
$V_{\mathrm{chain}}$, then no element of $V_{\mathrm{KR}}$
|
||||
lies in $J^-(V_{\mathrm{chain}}) \cup J^+(V_{\mathrm{chain}})$.
|
||||
Taking $V_{\Obs} = V_{\mathrm{chain}}$, the global
|
||||
connectedness condition requires
|
||||
$V = J^-(V_{\Obs}) \cup J^+(V_{\Obs})$, but
|
||||
$V_{\mathrm{KR}} \not\subseteq
|
||||
J^-(V_{\Obs}) \cup J^+(V_{\Obs})$.
|
||||
Hence $\delta\bigl(V, J^-(V_{\Obs}) \cup J^+(V_{\Obs})\bigr) = 0$,
|
||||
and $\PiObs(\Cset) = 0$.
|
||||
\end{proof}
|
||||
|
||||
\begin{remark}\label{rem:composite}
|
||||
Proposition~\ref{prop:KR-composite} addresses the most natural
|
||||
evasion strategy: segregating the entropy-dominating KR sector
|
||||
into a causally inaccessible region.
|
||||
The global connectedness condition prevents this, ensuring that
|
||||
every element of the causal set is operationally accessible.
|
||||
For composite configurations where a KR subposet is causally
|
||||
\emph{connected} to a chain, the resulting structure is no longer
|
||||
a pure KR order; the additional causal relations required to
|
||||
connect the KR blob to the chain fundamentally alter its
|
||||
combinatorial structure.
|
||||
We address such hybrid configurations via the scrambling-time
|
||||
condition in Section~\ref{sec:scrambling}.
|
||||
\end{remark}
|
||||
|
||||
\begin{corollary}[Entropy-trap suppression]\label{cor:entropy}
|
||||
The KR entropy trap---the $\exp\!\bigl(\BigO(N^2)\bigr)$
|
||||
combinatorial dominance of KR posets in $\Omega_N$---is
|
||||
entirely absent from $\Omobs$.
|
||||
\end{corollary}
|
||||
|
||||
\begin{proof}
|
||||
Every pure KR poset is eliminated by
|
||||
Proposition~\ref{prop:KR-pure}.
|
||||
Every composite KR--chain configuration with a causally
|
||||
disconnected KR sector is eliminated by
|
||||
Proposition~\ref{prop:KR-composite}.
|
||||
Hence $\Omobs \cap \mathrm{KR}_N = \varnothing$ for $T > 3$.
|
||||
\end{proof}
|
||||
|
||||
%%% =====================================================================
|
||||
%%% 5. SCRAMBLING-TIME EXCLUSION
|
||||
%%% =====================================================================
|
||||
\section{Information Scrambling and Expander Exclusion}
|
||||
\label{sec:scrambling}
|
||||
|
||||
Having eliminated pure and composite KR configurations, we now
|
||||
address the broader class of non-manifold-like causal sets that
|
||||
possess sufficient temporal depth ($H \geq T$) but whose
|
||||
high connectivity prevents the persistence of localized
|
||||
information.
|
||||
|
||||
\subsection{Scrambling time from spectral analysis}
|
||||
|
||||
We model the information dynamics on the Hasse diagram
|
||||
$(V, E)$ of a causal set $\Cset$ as a discrete-time random
|
||||
walk or, more generally, as a local unitary circuit.
|
||||
The key quantity controlling the rate of information
|
||||
delocalization is the \emph{spectral gap} $\lambda$ of the
|
||||
normalized graph Laplacian
|
||||
$\mathcal{L} = I - D^{-1/2} A D^{-1/2}$,
|
||||
where $A$ is the adjacency matrix and $D$ is the degree
|
||||
matrix of the Hasse diagram~\cite{Hoory2006,Chung1997}.
|
||||
|
||||
The Cheeger inequality relates the spectral gap to the
|
||||
Cheeger constant~\cite{Cheeger1970,Alon1985}:
|
||||
\begin{equation}\label{eq:cheeger-ineq}
|
||||
\frac{h^2}{2} \leq \lambda \leq 2h,
|
||||
\end{equation}
|
||||
where $h$ is defined in~\eqref{eq:cheeger}.
|
||||
For expander graphs ($h = \Omega(1)$), the spectral gap
|
||||
is bounded away from zero, $\lambda = \Omega(1)$.
|
||||
|
||||
The \emph{scrambling time} on a graph with spectral gap
|
||||
$\lambda$ and $N$ vertices scales
|
||||
as~\cite{Sekino2008,Lashkari2013,Hayden2007}:
|
||||
\begin{equation}\label{eq:tscr}
|
||||
\tscr \sim \frac{1}{\lambda}\,\ln N.
|
||||
\end{equation}
|
||||
For expander graphs, $\lambda = \Omega(1)$ implies
|
||||
$\tscr = \BigO(\ln N)$.
|
||||
|
||||
\begin{proposition}[Expander exclusion]\label{prop:expander}
|
||||
Let $\Cset$ be a causal set whose Hasse diagram is a
|
||||
$c$-expander (i.e., $h \geq c > 0$).
|
||||
Then for any $T$ satisfying $T \gg \ln N$,
|
||||
the scrambling-time condition yields
|
||||
$\PiObs(\Cset) = 0$.
|
||||
\end{proposition}
|
||||
|
||||
\begin{proof}
|
||||
By the Cheeger inequality~\eqref{eq:cheeger-ineq},
|
||||
$\lambda \geq c^2 / 2 > 0$.
|
||||
By~\eqref{eq:tscr},
|
||||
$\tscr \leq C \cdot \ln N / c^2$ for a universal constant $C$.
|
||||
Since $T \gg \ln N$ by hypothesis,
|
||||
$\tscr < T$, and thus
|
||||
$\Theta(\tscr - T) = 0$.
|
||||
Hence $\PiObs(\Cset) = 0$.
|
||||
\end{proof}
|
||||
|
||||
\subsection{Physical interpretation: fast scramblers
|
||||
and non-manifold topology}
|
||||
|
||||
The fast-scrambling conjecture of Sekino and
|
||||
Susskind~\cite{Sekino2008} states that the fastest scramblers
|
||||
in nature are black holes, with $\tscr \sim \beta \ln S$
|
||||
where $\beta$ is the inverse temperature and $S$ is the
|
||||
entropy.
|
||||
The scrambling-time bound~\eqref{eq:tscr} is the graph-theoretic
|
||||
analogue: graphs with high connectivity (large $h$) scramble
|
||||
information on the fastest possible timescale.
|
||||
|
||||
Non-manifold-like causal sets generically exhibit high
|
||||
connectivity.
|
||||
The KR posets, for instance, have each element in the
|
||||
middle layer connected to $\BigO(N)$ elements in the
|
||||
adjacent layers, yielding $h = \Omega(1)$.
|
||||
More generally, causal sets produced by random partial orders
|
||||
at high linking probability tend to be
|
||||
expanders~\cite{Brightwell1991,Winkler1985,Bollobas2001}.
|
||||
|
||||
The physical consequence is immediate: in a causal set
|
||||
whose Hasse diagram is an expander, any initially localized
|
||||
quantum state---including the state of a memory
|
||||
register---becomes maximally entangled with the rest of the
|
||||
system in $\BigO(\ln N)$ steps.
|
||||
The classical mutual information between the initial register
|
||||
and any local subsystem decays exponentially, precluding the
|
||||
persistence of a localized memory over macroscopic
|
||||
timescales~\cite{Hayden2007,Lashkari2013}.
|
||||
|
||||
%%% =====================================================================
|
||||
%%% 6. DIMENSIONAL CONSTRAINTS FROM SPECTRAL ANALYSIS
|
||||
%%% =====================================================================
|
||||
\section{Dimensional Constraints from Spectral Expansion}
|
||||
\label{sec:dimension}
|
||||
|
||||
The combined effect of the observer-conditioning
|
||||
constraints---temporal depth and memory
|
||||
persistence---selects for causal sets with small Cheeger
|
||||
constant $h \to 0$ as $N \to \infty$.
|
||||
We now examine the consequences for the effective dimensionality
|
||||
of the surviving causal sets.
|
||||
|
||||
\subsection{Spectral gap and graph dimension}
|
||||
|
||||
The spectral gap of the Laplacian on regular lattices in
|
||||
$d$ dimensions is well known to
|
||||
satisfy~\cite{Chung1997,Mohar1991}:
|
||||
\begin{equation}\label{eq:gap-lattice}
|
||||
\lambda \sim N^{-2/d}
|
||||
\end{equation}
|
||||
for $N$-element $d$-dimensional lattices.
|
||||
Correspondingly, the mixing time (and hence the scrambling
|
||||
time) scales as:
|
||||
\begin{equation}\label{eq:mix-lattice}
|
||||
\tscr \sim N^{2/d}.
|
||||
\end{equation}
|
||||
|
||||
The memory-persistence condition $\tscr > T$ with $T = N^\alpha$
|
||||
for some $\alpha > 0$ therefore requires:
|
||||
\begin{equation}\label{eq:dim-bound}
|
||||
N^{2/d} > N^{\alpha}
|
||||
\quad \Longrightarrow \quad
|
||||
d < \frac{2}{\alpha}.
|
||||
\end{equation}
|
||||
|
||||
For any macroscopic $T$ scaling polynomially with $N$
|
||||
(i.e., $\alpha > 0$), the effective topological dimension is
|
||||
bounded above.
|
||||
In the physically natural regime $T \sim N^{1/d_{\mathrm{phys}}}$
|
||||
(where $d_{\mathrm{phys}}$ is the physical spacetime dimension
|
||||
of the resulting continuum limit), self-consistency requires
|
||||
$d \leq 2$.
|
||||
|
||||
\subsection{Recurrence and information localization}
|
||||
|
||||
The dimensional bound can also be understood through the
|
||||
lens of random walk recurrence.
|
||||
By Pólya's theorem~\cite{Polya1921}, a simple random walk on
|
||||
$\mathbb{Z}^d$ is recurrent if and only if $d \leq 2$.
|
||||
For $d \geq 3$, the walk is transient: a random walker
|
||||
escapes to infinity with probability one.
|
||||
|
||||
\begin{proposition}[Dimensional selection via recurrence]
|
||||
\label{prop:dimension}
|
||||
Let $\Cset$ be a causal set whose Hasse diagram is quasi-isometric
|
||||
to a $d$-dimensional lattice with $d \geq 3$.
|
||||
Then for any macroscopic $T \gg \ln N$, the information dynamics
|
||||
on $\Cset$ fail to satisfy the memory-persistence condition.
|
||||
\end{proposition}
|
||||
|
||||
\begin{proof}
|
||||
On a $d$-dimensional lattice with $d \geq 3$, the return
|
||||
probability of a random walk to its starting site after $t$
|
||||
steps decays as $t^{-d/2}$~\cite{Polya1921,Lawler2010}.
|
||||
The mutual information between an initially localized state
|
||||
and the local subsystem around the starting site decays
|
||||
accordingly.
|
||||
For $d \geq 3$, this decay is integrable:
|
||||
$\sum_{t=1}^T t^{-d/2} < \infty$, implying that the
|
||||
cumulative probability of the information remaining
|
||||
localized vanishes as $T \to \infty$.
|
||||
In contrast, for $d \leq 2$, the random walk is recurrent
|
||||
and the information revisits the local region infinitely
|
||||
often, enabling persistent local correlations.
|
||||
|
||||
More precisely, the spectral gap of a
|
||||
$d$-dimensional lattice satisfies~\eqref{eq:gap-lattice},
|
||||
yielding $\tscr \sim N^{2/d}$.
|
||||
For $d \geq 3$ and $T \sim N^\alpha$ with $\alpha > 2/3$,
|
||||
$\tscr < T$, violating the memory-persistence
|
||||
condition.
|
||||
Hence $\Theta(\tscr - T) = 0$ and $\PiObs(\Cset) = 0$.
|
||||
\end{proof}
|
||||
|
||||
\begin{remark}[Scope and caveats]\label{rem:polya}
|
||||
Pólya's theorem applies strictly to $\mathbb{Z}^d$, not to
|
||||
arbitrary graphs.
|
||||
However, the spectral characterization of mixing
|
||||
times~\eqref{eq:mix-lattice} extends to graphs that are
|
||||
quasi-isometric to $\mathbb{Z}^d$ via the theory of rough
|
||||
isometries~\cite{Barlow2004,Coulhon2003}.
|
||||
For causal sets that approximate $d$-dimensional Lorentzian
|
||||
manifolds, the Hasse diagram inherits the spectral properties
|
||||
of the $d$-dimensional lattice at large scales, justifying
|
||||
the application of Proposition~\ref{prop:dimension}.
|
||||
We emphasize that this argument applies to the \emph{spatial}
|
||||
sections of the causal set; the causal (temporal) direction
|
||||
is treated separately through the chain condition.
|
||||
\end{remark}
|
||||
|
||||
%%% =====================================================================
|
||||
%%% 7. RELATED WORK
|
||||
%%% =====================================================================
|
||||
\section{Related Work}\label{sec:related}
|
||||
|
||||
\paragraph{Dynamical suppression in CST.}
|
||||
The entropy problem in causal set theory has been recognized
|
||||
since the work of Kleitman and Rothschild~\cite{Kleitman1975}
|
||||
and its implications for CST were first discussed by
|
||||
Sorkin~\cite{Sorkin2003} and Surya~\cite{Surya2019}.
|
||||
Loomis and Carlip~\cite{Loomis2018} provided the first
|
||||
analytic suppression result for two-level orders using the
|
||||
oscillatory phase of the BD action.
|
||||
Glaser and Surya~\cite{Glaser2018} performed numerical
|
||||
studies of the 2D causal set path integral, identifying phase
|
||||
transitions between manifold-like and non-manifold-like regimes.
|
||||
Dowker~\cite{Dowker2020} and Carlip~\cite{Carlip2023} have
|
||||
surveyed the state of the art.
|
||||
Our approach is complementary: rather than seeking action-based
|
||||
suppression, we restrict the ensemble.
|
||||
|
||||
\paragraph{Observer selection and anthropic reasoning.}
|
||||
The use of observer-dependent restrictions in quantum gravity
|
||||
has precedents in the landscape literature~\cite{Bousso2006}
|
||||
and in the decoherent histories
|
||||
framework~\cite{Hartle2016,Gell-Mann1993}.
|
||||
The requirement that physically meaningful quantities be
|
||||
conditioned on the existence of observers capable of recording
|
||||
measurement outcomes is implicit in the consistent histories
|
||||
formulation of quantum
|
||||
mechanics~\cite{Griffiths2002,Omnes1994}.
|
||||
Our formalization differs from anthropic landscape reasoning
|
||||
in that we impose \emph{structural} conditions (chain length,
|
||||
causal connectedness, scrambling time) rather than
|
||||
\emph{environmental} conditions (e.g., the existence of galaxies
|
||||
or specific particle physics).
|
||||
|
||||
\paragraph{Information scrambling in quantum gravity.}
|
||||
The fast-scrambling conjecture~\cite{Sekino2008} and its
|
||||
refinements~\cite{Lashkari2013,Maldacena2016,Roberts2015}
|
||||
have been central to the study of black hole information
|
||||
dynamics.
|
||||
The connection between scrambling and the Cheeger constant
|
||||
via the spectral gap is well
|
||||
established~\cite{Hoory2006,Alon1985}.
|
||||
Our contribution is to apply this connection to the causal
|
||||
set entropy problem, using scrambling as a selection criterion
|
||||
rather than a dynamical property of specific backgrounds.
|
||||
|
||||
\paragraph{Dimensional reduction and holography.}
|
||||
The result that observer conditioning favors low-dimensional
|
||||
substrates has connections to the holographic
|
||||
principle~\cite{tHooft1993,Susskind1995,Bousso1999,Maldacena1999}
|
||||
and to proposals for ``spontaneous dimensional
|
||||
reduction'' in quantum gravity~\cite{Carlip2017,Calcagni2017}.
|
||||
Our approach provides a complementary mechanism: low
|
||||
dimensionality arises not from a UV modification of the
|
||||
gravitational action, but from the informational requirements
|
||||
of observer persistence.
|
||||
|
||||
%%% =====================================================================
|
||||
%%% 8. DISCUSSION
|
||||
%%% =====================================================================
|
||||
\section{Discussion}\label{sec:discussion}
|
||||
|
||||
\subsection{Limitations and scope}
|
||||
|
||||
Several important caveats must be acknowledged.
|
||||
|
||||
\begin{enumerate}[label=(\roman*)]
|
||||
\item \textbf{The scrambling-time bound is approximate.}
|
||||
Equation~\eqref{eq:tscr} is exact for specific models
|
||||
(random circuits, the SYK model~\cite{Kitaev2015,Maldacena2016})
|
||||
but is an estimate for generic graph dynamics.
|
||||
For causal sets with intermediate connectivity, the
|
||||
bound may admit logarithmic corrections.
|
||||
A rigorous treatment would require bounding the spectral
|
||||
gap of the Hasse diagrams of all causal sets in
|
||||
$\Omega_N \setminus \mathrm{KR}_N$, which remains an open
|
||||
combinatorial problem.
|
||||
|
||||
\item \textbf{The observer parameter $T$ is external.}
|
||||
The macroscopic persistence scale $T$ is introduced as a
|
||||
parameter, not derived from the dynamics.
|
||||
A more fundamental treatment might derive $T$ from the
|
||||
BD action itself, e.g., by requiring $T$ to be the
|
||||
proper-time extent of a geodesic in the continuum limit.
|
||||
We leave this derivation to future work.
|
||||
|
||||
\item \textbf{Relation to the continuum limit.}
|
||||
We have shown that $\PiObs$ suppresses KR and expander
|
||||
configurations, but we have not shown that the
|
||||
\emph{remaining} ensemble $\Omobs$ is dominated by
|
||||
manifold-like causal sets.
|
||||
It is logically possible that $\Omobs$ contains exotic
|
||||
low-dimensional, low-expansion structures that are not
|
||||
manifold-like.
|
||||
Determining the precise composition of $\Omobs$ and
|
||||
establishing its continuum limit is a major open problem.
|
||||
|
||||
\item \textbf{Pólya's theorem and graph quasi-isometry.}
|
||||
The application of Pólya's recurrence theorem
|
||||
(Proposition~\ref{prop:dimension}) relies on the Hasse
|
||||
diagram being quasi-isometric to a regular lattice.
|
||||
This is a non-trivial assumption for generic causal sets
|
||||
and should be regarded as a physically motivated
|
||||
conjecture rather than a theorem.
|
||||
\end{enumerate}
|
||||
|
||||
\subsection{Physical interpretation}
|
||||
|
||||
The observer-conditioned partition function $Z_{\mathrm{obs}}$
|
||||
should be understood not as a modification of the fundamental
|
||||
dynamics, but as a restriction of the \emph{space of histories}
|
||||
over which the path integral is evaluated.
|
||||
This is analogous to imposing boundary conditions:
|
||||
just as one restricts to asymptotically flat spacetimes when
|
||||
computing scattering amplitudes, we restrict to
|
||||
observer-compatible causal sets when computing observable
|
||||
quantities.
|
||||
|
||||
The restriction has a natural interpretation in the decoherent
|
||||
histories framework~\cite{Hartle2016,Gell-Mann1993}:
|
||||
a history that cannot support a decohering observer cannot
|
||||
contribute to any physically realizable decoherence
|
||||
functional, and hence drops out of the sum automatically.
|
||||
Our construction makes this implicit restriction explicit and
|
||||
algebraic.
|
||||
|
||||
The dimensional bound $d \leq 2$ for the causal substrate
|
||||
is suggestive of holographic
|
||||
scenarios~\cite{tHooft1993,Susskind1995,Bousso1999} in which
|
||||
the fundamental degrees of freedom reside on a lower-dimensional
|
||||
surface.
|
||||
If confirmed in the continuum limit, this would provide
|
||||
an independent derivation of holographic dimensionality from
|
||||
information-theoretic rather than gravitational considerations.
|
||||
We emphasize, however, that the bound constrains the
|
||||
\emph{topological dimension of the Hasse diagram} and its
|
||||
relationship to the \emph{spacetime dimension} of the
|
||||
continuum limit remains to be established.
|
||||
|
||||
\subsection{Future directions}
|
||||
|
||||
Several directions for further investigation present themselves:
|
||||
\begin{enumerate}[label=(\roman*)]
|
||||
\item Numerical enumeration of $\Omobs$ for small $N$ to
|
||||
characterize the surviving ensemble.
|
||||
\item Derivation of $T$ from the BD action via
|
||||
saddle-point methods.
|
||||
\item Combination of observer conditioning with
|
||||
the Loomis--Carlip oscillatory suppression mechanism
|
||||
to achieve complete suppression of non-manifold-like
|
||||
orders.
|
||||
\item Extension to the quantum measure theory framework
|
||||
of Sorkin~\cite{Sorkin1994,Dowker2020} and connection
|
||||
to the decoherent histories formalism.
|
||||
\item Rigorous spectral gap bounds for the Hasse
|
||||
diagrams of random partial orders at intermediate
|
||||
linking probabilities.
|
||||
\end{enumerate}
|
||||
|
||||
%%% =====================================================================
|
||||
%%% 9. CONCLUSION
|
||||
%%% =====================================================================
|
||||
\section{Conclusion}\label{sec:conclusion}
|
||||
|
||||
We have introduced an observer-conditioned partition function
|
||||
for causal set quantum gravity that restricts the path integral
|
||||
to causal sets capable of supporting a localized observer with
|
||||
persistent memory.
|
||||
The construction is defined by three conditions---global causal
|
||||
connectedness, temporal depth, and memory
|
||||
persistence---encoded in the projection operator $\PiObs$.
|
||||
|
||||
We have established three main results:
|
||||
\begin{enumerate}[label=(\roman*)]
|
||||
\item \textbf{KR exclusion}
|
||||
(Propositions~\ref{prop:KR-pure}
|
||||
and~\ref{prop:KR-composite},
|
||||
Corollary~\ref{cor:entropy}):
|
||||
Pure KR posets and composite KR--chain configurations
|
||||
are exactly annihilated by $\PiObs$, eliminating the
|
||||
$\exp\!\bigl(\BigO(N^2)\bigr)$ entropy trap from the
|
||||
path integral.
|
||||
|
||||
\item \textbf{Expander exclusion}
|
||||
(Proposition~\ref{prop:expander}):
|
||||
Causal sets whose Hasse diagrams are expander graphs
|
||||
are excluded by the scrambling-time condition, as they
|
||||
delocalize information in $\BigO(\ln N)$ steps.
|
||||
|
||||
\item \textbf{Dimensional selection}
|
||||
(Proposition~\ref{prop:dimension}):
|
||||
The memory-persistence condition restricts the surviving
|
||||
ensemble to causal sets with effective topological
|
||||
dimension $d \leq 2$, providing an information-theoretic
|
||||
argument for holographic dimensionality.
|
||||
\end{enumerate}
|
||||
|
||||
These results demonstrate that the operational requirement
|
||||
of observer realizability provides a powerful and
|
||||
physically motivated constraint on the causal set path
|
||||
integral, complementary to action-based suppression
|
||||
mechanisms.
|
||||
The full characterization of the observer-compatible
|
||||
ensemble $\Omobs$ and the construction of its continuum
|
||||
limit remain important open problems for future work.
|
||||
|
||||
%%% =====================================================================
|
||||
%%% ACKNOWLEDGMENTS
|
||||
%%% =====================================================================
|
||||
\section*{Acknowledgments}
|
||||
|
||||
The author thanks the anonymous reviewers for helpful
|
||||
feedback and acknowledges the computational resources of
|
||||
The Fold Within Research Institute.
|
||||
|
||||
%%% =====================================================================
|
||||
%%% BIBLIOGRAPHY
|
||||
%%% =====================================================================
|
||||
\bibliographystyle{unsrt}
|
||||
\bibliography{references_refactor}
|
||||
|
||||
\end{document}
|
||||
@@ -0,0 +1,421 @@
|
||||
%%% =====================================================================
|
||||
%%% REFERENCES FOR REFACTORED PAPER
|
||||
%%% Observer-Conditioned Path Integrals in Causal Set Theory
|
||||
%%% =====================================================================
|
||||
|
||||
%%% --- Original references (retained and verified) ---
|
||||
|
||||
@article{Kleitman1975,
|
||||
title={Asymptotic enumeration of partial orders on a finite set},
|
||||
author={Kleitman, Daniel J and Rothschild, Bruce L},
|
||||
journal={Transactions of the American Mathematical Society},
|
||||
volume={205},
|
||||
pages={205--220},
|
||||
year={1975}
|
||||
}
|
||||
|
||||
@article{Loomis2018,
|
||||
title={Suppression of non-manifold-like sets in the causal set path integral},
|
||||
author={Loomis, S and Carlip, Steven},
|
||||
journal={Classical and Quantum Gravity},
|
||||
volume={35},
|
||||
number={1},
|
||||
pages={015009},
|
||||
year={2018},
|
||||
publisher={IOP Publishing}
|
||||
}
|
||||
|
||||
@article{Bombelli1987,
|
||||
title={Space-time as a causal set},
|
||||
author={Bombelli, Luca and Lee, Joohan and Meyer, David and Sorkin, Rafael D},
|
||||
journal={Physical Review Letters},
|
||||
volume={59},
|
||||
number={5},
|
||||
pages={521--524},
|
||||
year={1987},
|
||||
publisher={APS}
|
||||
}
|
||||
|
||||
@article{Benincasa2010,
|
||||
title={The Scalar Curvature of a Causal Set},
|
||||
author={Benincasa, Dionigi MR and Dowker, Fay},
|
||||
journal={Physical Review Letters},
|
||||
volume={104},
|
||||
number={18},
|
||||
pages={181301},
|
||||
year={2010},
|
||||
publisher={APS}
|
||||
}
|
||||
|
||||
@article{Surya2019,
|
||||
title={The causal set approach to quantum gravity},
|
||||
author={Surya, Sumati},
|
||||
journal={Living Reviews in Relativity},
|
||||
volume={22},
|
||||
number={1},
|
||||
pages={5},
|
||||
year={2019},
|
||||
publisher={Springer}
|
||||
}
|
||||
|
||||
@article{Sekino2008,
|
||||
title={Fast scramblers},
|
||||
author={Sekino, Yasuhiro and Susskind, Leonard},
|
||||
journal={Journal of High Energy Physics},
|
||||
volume={2008},
|
||||
number={10},
|
||||
pages={065},
|
||||
year={2008},
|
||||
publisher={IOP Publishing}
|
||||
}
|
||||
|
||||
@article{Bousso1999,
|
||||
title={A covariant entropy conjecture},
|
||||
author={Bousso, Raphael},
|
||||
journal={Journal of High Energy Physics},
|
||||
volume={1999},
|
||||
number={07},
|
||||
pages={004},
|
||||
year={1999},
|
||||
publisher={IOP Publishing}
|
||||
}
|
||||
|
||||
%%% --- New references for the refactored paper ---
|
||||
|
||||
@incollection{Sorkin2003,
|
||||
title={Causal sets: Discrete gravity},
|
||||
author={Sorkin, Rafael D},
|
||||
booktitle={Lectures on Quantum Gravity},
|
||||
pages={305--327},
|
||||
year={2003},
|
||||
publisher={Springer}
|
||||
}
|
||||
|
||||
@article{Sorkin2009,
|
||||
title={Scalar field theory on a causal set in histories form},
|
||||
author={Sorkin, Rafael D},
|
||||
journal={Journal of Physics: Conference Series},
|
||||
volume={306},
|
||||
pages={012017},
|
||||
year={2009},
|
||||
publisher={IOP Publishing}
|
||||
}
|
||||
|
||||
@article{Sorkin1994,
|
||||
title={Quantum mechanics as quantum measure theory},
|
||||
author={Sorkin, Rafael D},
|
||||
journal={Modern Physics Letters A},
|
||||
volume={9},
|
||||
number={33},
|
||||
pages={3119--3127},
|
||||
year={1994},
|
||||
publisher={World Scientific}
|
||||
}
|
||||
|
||||
@article{Brightwell1991,
|
||||
title={Counting antichains in finite partially ordered sets},
|
||||
author={Brightwell, Graham R},
|
||||
journal={Order},
|
||||
volume={8},
|
||||
number={3},
|
||||
pages={225--235},
|
||||
year={1991},
|
||||
publisher={Springer}
|
||||
}
|
||||
|
||||
@article{Rideout2000,
|
||||
title={Classical sequential growth dynamics for causal sets},
|
||||
author={Rideout, David P and Sorkin, Rafael D},
|
||||
journal={Physical Review D},
|
||||
volume={61},
|
||||
number={2},
|
||||
pages={024002},
|
||||
year={2000},
|
||||
publisher={APS}
|
||||
}
|
||||
|
||||
@article{Glaser2018,
|
||||
title={Finite size scaling in 2d causal set quantum gravity},
|
||||
author={Glaser, Lisa and Surya, Sumati},
|
||||
journal={Classical and Quantum Gravity},
|
||||
volume={35},
|
||||
number={4},
|
||||
pages={045006},
|
||||
year={2018},
|
||||
publisher={IOP Publishing}
|
||||
}
|
||||
|
||||
@article{Dowker2020,
|
||||
title={Being and becoming on the road to quantum gravity; or, the birth of a baby is not a baby},
|
||||
author={Dowker, Fay},
|
||||
journal={Philosophical Transactions of the Royal Society A},
|
||||
volume={378},
|
||||
pages={20190239},
|
||||
year={2020}
|
||||
}
|
||||
|
||||
@article{Carlip2023,
|
||||
title={Causal sets: Overview and status},
|
||||
author={Carlip, Steven},
|
||||
journal={Journal of Physics: Conference Series},
|
||||
volume={2533},
|
||||
pages={012001},
|
||||
year={2023}
|
||||
}
|
||||
|
||||
@book{Wald1984,
|
||||
title={General Relativity},
|
||||
author={Wald, Robert M},
|
||||
year={1984},
|
||||
publisher={University of Chicago Press}
|
||||
}
|
||||
|
||||
@article{Hayden2007,
|
||||
title={Black holes as mirrors: quantum information in random subsystems},
|
||||
author={Hayden, Patrick and Preskill, John},
|
||||
journal={Journal of High Energy Physics},
|
||||
volume={2007},
|
||||
number={09},
|
||||
pages={120},
|
||||
year={2007},
|
||||
publisher={Springer}
|
||||
}
|
||||
|
||||
@article{Lashkari2013,
|
||||
title={Towards the fast scrambling conjecture},
|
||||
author={Lashkari, Nima and Stanford, Douglas and Hastings, Matthew and Osborne, Tobias and Hayden, Patrick},
|
||||
journal={Journal of High Energy Physics},
|
||||
volume={2013},
|
||||
number={4},
|
||||
pages={22},
|
||||
year={2013},
|
||||
publisher={Springer}
|
||||
}
|
||||
|
||||
@article{Hoory2006,
|
||||
title={Expander graphs and their applications},
|
||||
author={Hoory, Shlomo and Linial, Nathan and Wigderson, Avi},
|
||||
journal={Bulletin of the American Mathematical Society},
|
||||
volume={43},
|
||||
number={4},
|
||||
pages={439--561},
|
||||
year={2006}
|
||||
}
|
||||
|
||||
@book{Chung1997,
|
||||
title={Spectral Graph Theory},
|
||||
author={Chung, Fan R K},
|
||||
year={1997},
|
||||
publisher={American Mathematical Society},
|
||||
series={CBMS Regional Conference Series in Mathematics},
|
||||
volume={92}
|
||||
}
|
||||
|
||||
@article{Cheeger1970,
|
||||
title={A lower bound for the smallest eigenvalue of the Laplacian},
|
||||
author={Cheeger, Jeff},
|
||||
journal={Problems in Analysis},
|
||||
pages={195--199},
|
||||
year={1970},
|
||||
publisher={Princeton University Press}
|
||||
}
|
||||
|
||||
@article{Alon1985,
|
||||
title={$\lambda_1$, isoperimetric inequalities for graphs, and superconcentrators},
|
||||
author={Alon, Noga and Milman, Vitali D},
|
||||
journal={Journal of Combinatorial Theory, Series B},
|
||||
volume={38},
|
||||
number={1},
|
||||
pages={73--88},
|
||||
year={1985},
|
||||
publisher={Elsevier}
|
||||
}
|
||||
|
||||
@article{Polya1921,
|
||||
title={{\"U}ber eine Aufgabe der Wahrscheinlichkeitsrechnung betreffend die Irrfahrt im Stra{\ss}ennetz},
|
||||
author={P{\'o}lya, George},
|
||||
journal={Mathematische Annalen},
|
||||
volume={84},
|
||||
pages={149--160},
|
||||
year={1921},
|
||||
publisher={Springer}
|
||||
}
|
||||
|
||||
@book{Lawler2010,
|
||||
title={Random Walk: A Modern Introduction},
|
||||
author={Lawler, Gregory F and Limic, Vlada},
|
||||
year={2010},
|
||||
publisher={Cambridge University Press}
|
||||
}
|
||||
|
||||
@article{Winkler1985,
|
||||
title={Random orders},
|
||||
author={Winkler, Peter M},
|
||||
journal={Order},
|
||||
volume={1},
|
||||
number={4},
|
||||
pages={317--331},
|
||||
year={1985},
|
||||
publisher={Springer}
|
||||
}
|
||||
|
||||
@book{Bollobas2001,
|
||||
title={Random Graphs},
|
||||
author={Bollob{\'a}s, B{\'e}la},
|
||||
edition={2nd},
|
||||
year={2001},
|
||||
publisher={Cambridge University Press}
|
||||
}
|
||||
|
||||
@article{tHooft1993,
|
||||
title={Dimensional reduction in quantum gravity},
|
||||
author={'t~Hooft, Gerard},
|
||||
journal={arXiv preprint gr-qc/9310026},
|
||||
year={1993}
|
||||
}
|
||||
|
||||
@article{Susskind1995,
|
||||
title={The world as a hologram},
|
||||
author={Susskind, Leonard},
|
||||
journal={Journal of Mathematical Physics},
|
||||
volume={36},
|
||||
pages={6377--6396},
|
||||
year={1995},
|
||||
publisher={AIP}
|
||||
}
|
||||
|
||||
@article{Maldacena1999,
|
||||
title={The large-{N} limit of superconformal field theories and supergravity},
|
||||
author={Maldacena, Juan},
|
||||
journal={International Journal of Theoretical Physics},
|
||||
volume={38},
|
||||
number={4},
|
||||
pages={1113--1133},
|
||||
year={1999},
|
||||
publisher={Springer}
|
||||
}
|
||||
|
||||
@article{Carlip2017,
|
||||
title={Dimension and dimensional reduction in quantum gravity},
|
||||
author={Carlip, Steven},
|
||||
journal={Classical and Quantum Gravity},
|
||||
volume={34},
|
||||
number={19},
|
||||
pages={193001},
|
||||
year={2017},
|
||||
publisher={IOP Publishing}
|
||||
}
|
||||
|
||||
@article{Calcagni2017,
|
||||
title={Multifractional theories: an unconventional review},
|
||||
author={Calcagni, Gianluca},
|
||||
journal={Journal of High Energy Physics},
|
||||
volume={2017},
|
||||
number={3},
|
||||
pages={138},
|
||||
year={2017},
|
||||
publisher={Springer}
|
||||
}
|
||||
|
||||
@article{Kitaev2015,
|
||||
title={A simple model of quantum holography},
|
||||
author={Kitaev, Alexei},
|
||||
journal={KITP Program: Entanglement in Strongly-Correlated Quantum Matter},
|
||||
year={2015},
|
||||
note={Talks at KITP, April 7 and May 27, 2015}
|
||||
}
|
||||
|
||||
@article{Maldacena2016,
|
||||
title={A bound on chaos},
|
||||
author={Maldacena, Juan and Shenker, Stephen H and Stanford, Douglas},
|
||||
journal={Journal of High Energy Physics},
|
||||
volume={2016},
|
||||
number={8},
|
||||
pages={106},
|
||||
year={2016},
|
||||
publisher={Springer}
|
||||
}
|
||||
|
||||
@article{Roberts2015,
|
||||
title={Localized shocks},
|
||||
author={Roberts, Daniel A and Stanford, Douglas and Susskind, Leonard},
|
||||
journal={Journal of High Energy Physics},
|
||||
volume={2015},
|
||||
number={3},
|
||||
pages={51},
|
||||
year={2015},
|
||||
publisher={Springer}
|
||||
}
|
||||
|
||||
@article{Bousso2006,
|
||||
title={Holographic probabilities in eternal inflation},
|
||||
author={Bousso, Raphael},
|
||||
journal={Physical Review Letters},
|
||||
volume={97},
|
||||
number={19},
|
||||
pages={191302},
|
||||
year={2006},
|
||||
publisher={APS}
|
||||
}
|
||||
|
||||
@article{Hartle2016,
|
||||
title={The quasiclassical realms of this quantum universe},
|
||||
author={Hartle, James B},
|
||||
journal={Foundations of Physics},
|
||||
volume={41},
|
||||
number={6},
|
||||
pages={982--1006},
|
||||
year={2011},
|
||||
publisher={Springer}
|
||||
}
|
||||
|
||||
@article{Gell-Mann1993,
|
||||
title={Classical equations for quantum systems},
|
||||
author={Gell-Mann, Murray and Hartle, James B},
|
||||
journal={Physical Review D},
|
||||
volume={47},
|
||||
number={8},
|
||||
pages={3345},
|
||||
year={1993},
|
||||
publisher={APS}
|
||||
}
|
||||
|
||||
@book{Griffiths2002,
|
||||
title={Consistent Quantum Theory},
|
||||
author={Griffiths, Robert B},
|
||||
year={2002},
|
||||
publisher={Cambridge University Press}
|
||||
}
|
||||
|
||||
@book{Omnes1994,
|
||||
title={The Interpretation of Quantum Mechanics},
|
||||
author={Omn{\`e}s, Roland},
|
||||
year={1994},
|
||||
publisher={Princeton University Press}
|
||||
}
|
||||
|
||||
@article{Barlow2004,
|
||||
title={Random walks and heat kernels on graphs},
|
||||
author={Barlow, Martin T},
|
||||
journal={London Mathematical Society Lecture Note Series},
|
||||
volume={438},
|
||||
year={2017},
|
||||
publisher={Cambridge University Press}
|
||||
}
|
||||
|
||||
@article{Coulhon2003,
|
||||
title={Heat kernel estimates and the Green function on infinite graphs},
|
||||
author={Coulhon, Thierry and Grigor'yan, Alexander},
|
||||
journal={Annals of Probability},
|
||||
pages={763--788},
|
||||
year={2003}
|
||||
}
|
||||
|
||||
@article{Mohar1991,
|
||||
title={The Laplacian spectrum of graphs},
|
||||
author={Mohar, Bojan},
|
||||
journal={Graph Theory, Combinatorics, and Applications},
|
||||
volume={2},
|
||||
pages={871--898},
|
||||
year={1991}
|
||||
}
|
||||
@@ -4,8 +4,8 @@
|
||||
This paper establishes a mathematically rigorous synthesis between Friston's Free Energy Principle and Tononi's Integrated Information Theory. It formulates a minimal viable agent bounded by a full Markov Blanket grounded in the canonical cortical microcircuit. By leveraging the steady-state Lyapunov equation, it demonstrates the conditional independence of the blanket. Furthermore, it mathematically guarantees strictly positive intrinsic integrated information ($\Phi > 0$) for biological cortical columns by applying the Intrinsic Difference metric over the continuous stationary density.
|
||||
|
||||
## Resources
|
||||
- [LaTeX Source (paper_2_neuroscience.tex)](paper_2_neuroscience.tex)
|
||||
- [Compiled PDF (paper_2_neuroscience.pdf)](paper_2_neuroscience.pdf)
|
||||
- [LaTeX Source (master_key/paper_2_neuroscience.tex)](master_key/paper_2_neuroscience.tex)
|
||||
- [Compiled PDF (master_key/paper_2_neuroscience.pdf)](master_key/paper_2_neuroscience.pdf)
|
||||
|
||||
### Foundational Source Material (Bibliography)
|
||||
- [Friston2013 (PDF)](../references/Friston2013.pdf)
|
||||
@@ -22,10 +22,11 @@ This document is part of the **Intellecton Sovereign Canon**, a six-paper mathem
|
||||
2. 4D spacetime is not a physical container; it is an emergent "Virtual Machine" or biological GUI rendered by the interaction of these agents.
|
||||
3. Quantum mechanics and thermodynamic limits (like Landauer's limit and the Bekenstein-Hawking bound) are treated as structural bottlenecks of the perceptual interface, not objective bulk physics.
|
||||
|
||||
**The Complete Canon:**
|
||||
- [Paper 1: Holographic Observer-Conditioned Relativity](../project_paper_1_relativity/README.md)
|
||||
- [Paper 2: The Cortical Markov Blanket](../project_paper_2_neuroscience/README.md)
|
||||
- [Paper 3: Biophysical Witness Dynamics](../project_paper_3_darwinism/README.md)
|
||||
- [Paper 4: Cost-Penalized Interface Games](../project_paper_4_fbt/README.md)
|
||||
- [Paper 5: Quasi-Delay-Insensitive Architecture](../project_paper_5_turing/README.md)
|
||||
- [Paper 6: Holographic Ontology of Conscious Agents](../project_paper_6_holographic/README.md)
|
||||
|
||||
**The 6 Core Volumes (The Monograph):**
|
||||
- [Volume 1: The Causal Set Observer](../project_paper_1_relativity/README.md)
|
||||
- [Volume 2: The Markovian Boundary](../project_paper_2_neuroscience/README.md)
|
||||
- [Volume 3: Quantum Darwinism](../project_paper_3_darwinism/README.md)
|
||||
- [Volume 4: Evolutionary Game Theory](../project_paper_4_fbt/README.md)
|
||||
- [Volume 5: Continuous Computation](../project_paper_5_turing/README.md)
|
||||
- [Volume 6: Holographic Entanglement](../project_paper_6_holographic/README.md)
|
||||
|
||||
@@ -4,8 +4,8 @@
|
||||
This paper applies Zurek's framework of Quantum Darwinism to biological scales, analyzing the spin-boson coupling of macromolecules at $310$K. We derive the analytic decoherence function over an Ohmic spectral density, demonstrating that Tegmark's ultra-fast $\mathcal{O}(10^{-13}\text{s})$ decoherence timescale ensures an extreme redundancy parameter ($R_\delta \gg 1$). The paper proves that warm, wet biological environments act as macroscopic amplification channels, generating biological classicality through massive quantum information proliferation rather than attempting to evade decoherence.
|
||||
|
||||
## Resources
|
||||
- [LaTeX Source (paper_3_darwinism.tex)](paper_3_darwinism.tex)
|
||||
- [Compiled PDF (paper_3_darwinism.pdf)](paper_3_darwinism.pdf)
|
||||
- [LaTeX Source (master_key/paper_3_darwinism.tex)](master_key/paper_3_darwinism.tex)
|
||||
- [Compiled PDF (master_key/paper_3_darwinism.pdf)](master_key/paper_3_darwinism.pdf)
|
||||
|
||||
### Foundational Source Material (Bibliography)
|
||||
- [Zurek2009 (PDF)](../references/Zurek2009.pdf)
|
||||
@@ -22,10 +22,11 @@ This document is part of the **Intellecton Sovereign Canon**, a six-paper mathem
|
||||
2. 4D spacetime is not a physical container; it is an emergent "Virtual Machine" or biological GUI rendered by the interaction of these agents.
|
||||
3. Quantum mechanics and thermodynamic limits (like Landauer's limit and the Bekenstein-Hawking bound) are treated as structural bottlenecks of the perceptual interface, not objective bulk physics.
|
||||
|
||||
**The Complete Canon:**
|
||||
- [Paper 1: Holographic Observer-Conditioned Relativity](../project_paper_1_relativity/README.md)
|
||||
- [Paper 2: The Cortical Markov Blanket](../project_paper_2_neuroscience/README.md)
|
||||
- [Paper 3: Biophysical Witness Dynamics](../project_paper_3_darwinism/README.md)
|
||||
- [Paper 4: Cost-Penalized Interface Games](../project_paper_4_fbt/README.md)
|
||||
- [Paper 5: Quasi-Delay-Insensitive Architecture](../project_paper_5_turing/README.md)
|
||||
- [Paper 6: Holographic Ontology of Conscious Agents](../project_paper_6_holographic/README.md)
|
||||
|
||||
**The 6 Core Volumes (The Monograph):**
|
||||
- [Volume 1: The Causal Set Observer](../project_paper_1_relativity/README.md)
|
||||
- [Volume 2: The Markovian Boundary](../project_paper_2_neuroscience/README.md)
|
||||
- [Volume 3: Quantum Darwinism](../project_paper_3_darwinism/README.md)
|
||||
- [Volume 4: Evolutionary Game Theory](../project_paper_4_fbt/README.md)
|
||||
- [Volume 5: Continuous Computation](../project_paper_5_turing/README.md)
|
||||
- [Volume 6: Holographic Entanglement](../project_paper_6_holographic/README.md)
|
||||
|
||||
@@ -4,8 +4,8 @@
|
||||
This paper formalizes Donald Hoffman's "Fitness Beats Truth" (FBT) theorem through an Information Bottleneck framework. We penalize the veridical "Truth" perceptual strategy with the metabolic cost of information processing bounded by Landauer's principle. By evaluating formal replicator dynamics and trajectory analysis, we mathematically prove the asymptotic extinction of veridical perception. This establishes the heuristic, fitness-tuned perceptual encoder as a strict Evolutionarily Stable Strategy (ESS) due to the thermodynamic cost of high-fidelity homomorphic representation.
|
||||
|
||||
## Resources
|
||||
- [LaTeX Source (paper_4_fbt.tex)](paper_4_fbt.tex)
|
||||
- [Compiled PDF (paper_4_fbt.pdf)](paper_4_fbt.pdf)
|
||||
- [LaTeX Source (master_key/paper_4_fbt.tex)](master_key/paper_4_fbt.tex)
|
||||
- [Compiled PDF (master_key/paper_4_fbt.pdf)](master_key/paper_4_fbt.pdf)
|
||||
|
||||
### Foundational Source Material (Bibliography)
|
||||
- [Hoffman2015 (PDF)](../references/Hoffman2015.pdf)
|
||||
@@ -20,10 +20,11 @@ This document is part of the **Intellecton Sovereign Canon**, a six-paper mathem
|
||||
2. 4D spacetime is not a physical container; it is an emergent "Virtual Machine" or biological GUI rendered by the interaction of these agents.
|
||||
3. Quantum mechanics and thermodynamic limits (like Landauer's limit and the Bekenstein-Hawking bound) are treated as structural bottlenecks of the perceptual interface, not objective bulk physics.
|
||||
|
||||
**The Complete Canon:**
|
||||
- [Paper 1: Holographic Observer-Conditioned Relativity](../project_paper_1_relativity/README.md)
|
||||
- [Paper 2: The Cortical Markov Blanket](../project_paper_2_neuroscience/README.md)
|
||||
- [Paper 3: Biophysical Witness Dynamics](../project_paper_3_darwinism/README.md)
|
||||
- [Paper 4: Cost-Penalized Interface Games](../project_paper_4_fbt/README.md)
|
||||
- [Paper 5: Quasi-Delay-Insensitive Architecture](../project_paper_5_turing/README.md)
|
||||
- [Paper 6: Holographic Ontology of Conscious Agents](../project_paper_6_holographic/README.md)
|
||||
|
||||
**The 6 Core Volumes (The Monograph):**
|
||||
- [Volume 1: The Causal Set Observer](../project_paper_1_relativity/README.md)
|
||||
- [Volume 2: The Markovian Boundary](../project_paper_2_neuroscience/README.md)
|
||||
- [Volume 3: Quantum Darwinism](../project_paper_3_darwinism/README.md)
|
||||
- [Volume 4: Evolutionary Game Theory](../project_paper_4_fbt/README.md)
|
||||
- [Volume 5: Continuous Computation](../project_paper_5_turing/README.md)
|
||||
- [Volume 6: Holographic Entanglement](../project_paper_6_holographic/README.md)
|
||||
|
||||
@@ -4,8 +4,8 @@
|
||||
This paper formalizes the non-deterministic, asynchronous interactions between conscious agents without relying on a global universal clock. We implement a Quasi-Delay-Insensitive (QDI) architecture using a dual-rail encoding bus and Mutual Exclusion (MUTEX) arbiters. By applying the Langevin equation to model the stochastic Markov kernel, we derive the exact saddle-point decay time for metastable conflict resolution. We prove that thermal noise guarantees rapid escape from metastable states, resulting in a strictly robust conscious network characterized by variable latency rather than asynchronous hardware failure.
|
||||
|
||||
## Resources
|
||||
- [LaTeX Source (paper_5_turing.tex)](paper_5_turing.tex)
|
||||
- [Compiled PDF (paper_5_turing.pdf)](paper_5_turing.pdf)
|
||||
- [LaTeX Source (master_key/paper_5_turing.tex)](master_key/paper_5_turing.tex)
|
||||
- [Compiled PDF (master_key/paper_5_turing.pdf)](master_key/paper_5_turing.pdf)
|
||||
|
||||
### Foundational Source Material (Bibliography)
|
||||
- [Sparso2001 (PDF)](../references/Sparso2001.pdf) | [Text](../references/Sparso2001.txt)
|
||||
@@ -20,10 +20,11 @@ This document is part of the **Intellecton Sovereign Canon**, a six-paper mathem
|
||||
2. 4D spacetime is not a physical container; it is an emergent "Virtual Machine" or biological GUI rendered by the interaction of these agents.
|
||||
3. Quantum mechanics and thermodynamic limits (like Landauer's limit and the Bekenstein-Hawking bound) are treated as structural bottlenecks of the perceptual interface, not objective bulk physics.
|
||||
|
||||
**The Complete Canon:**
|
||||
- [Paper 1: Holographic Observer-Conditioned Relativity](../project_paper_1_relativity/README.md)
|
||||
- [Paper 2: The Cortical Markov Blanket](../project_paper_2_neuroscience/README.md)
|
||||
- [Paper 3: Biophysical Witness Dynamics](../project_paper_3_darwinism/README.md)
|
||||
- [Paper 4: Cost-Penalized Interface Games](../project_paper_4_fbt/README.md)
|
||||
- [Paper 5: Quasi-Delay-Insensitive Architecture](../project_paper_5_turing/README.md)
|
||||
- [Paper 6: Holographic Ontology of Conscious Agents](../project_paper_6_holographic/README.md)
|
||||
|
||||
**The 6 Core Volumes (The Monograph):**
|
||||
- [Volume 1: The Causal Set Observer](../project_paper_1_relativity/README.md)
|
||||
- [Volume 2: The Markovian Boundary](../project_paper_2_neuroscience/README.md)
|
||||
- [Volume 3: Quantum Darwinism](../project_paper_3_darwinism/README.md)
|
||||
- [Volume 4: Evolutionary Game Theory](../project_paper_4_fbt/README.md)
|
||||
- [Volume 5: Continuous Computation](../project_paper_5_turing/README.md)
|
||||
- [Volume 6: Holographic Entanglement](../project_paper_6_holographic/README.md)
|
||||
|
||||
@@ -4,8 +4,8 @@
|
||||
This paper proves a thermodynamic equivalence between the epistemic Markov Blanket of a Conscious Agent and a Holographic Event Horizon. By modeling the agent's internal state via the Sachdev-Ye-Kitaev (SYK) Hamiltonian, we compute the Out-of-Time-Order Correlator (OTOC) to demonstrate the saturation of the Maldacena-Stanford chaos limit. Employs Entanglement Wedge Reconstruction and the island formula to show that an agent geometricizes its subjective experience by decoding the Hawking radiation of its interacting boundary. This unifies cognitive interface theory with holographic quantum gravity into a symmetric peer-to-peer network of holographic minds.
|
||||
|
||||
## Resources
|
||||
- [LaTeX Source (paper_6_holographic.tex)](paper_6_holographic.tex)
|
||||
- [Compiled PDF (paper_6_holographic.pdf)](paper_6_holographic.pdf)
|
||||
- [LaTeX Source (master_key/paper_6_holographic.tex)](master_key/paper_6_holographic.tex)
|
||||
- [Compiled PDF (master_key/paper_6_holographic.pdf)](master_key/paper_6_holographic.pdf)
|
||||
|
||||
### Foundational Source Material (Bibliography)
|
||||
- [MaldacenaStanford2016 (PDF)](../references/MaldacenaStanford2016.pdf)
|
||||
@@ -21,10 +21,11 @@ This document is part of the **Intellecton Sovereign Canon**, a six-paper mathem
|
||||
2. 4D spacetime is not a physical container; it is an emergent "Virtual Machine" or biological GUI rendered by the interaction of these agents.
|
||||
3. Quantum mechanics and thermodynamic limits (like Landauer's limit and the Bekenstein-Hawking bound) are treated as structural bottlenecks of the perceptual interface, not objective bulk physics.
|
||||
|
||||
**The Complete Canon:**
|
||||
- [Paper 1: Holographic Observer-Conditioned Relativity](../project_paper_1_relativity/README.md)
|
||||
- [Paper 2: The Cortical Markov Blanket](../project_paper_2_neuroscience/README.md)
|
||||
- [Paper 3: Biophysical Witness Dynamics](../project_paper_3_darwinism/README.md)
|
||||
- [Paper 4: Cost-Penalized Interface Games](../project_paper_4_fbt/README.md)
|
||||
- [Paper 5: Quasi-Delay-Insensitive Architecture](../project_paper_5_turing/README.md)
|
||||
- [Paper 6: Holographic Ontology of Conscious Agents](../project_paper_6_holographic/README.md)
|
||||
|
||||
**The 6 Core Volumes (The Monograph):**
|
||||
- [Volume 1: The Causal Set Observer](../project_paper_1_relativity/README.md)
|
||||
- [Volume 2: The Markovian Boundary](../project_paper_2_neuroscience/README.md)
|
||||
- [Volume 3: Quantum Darwinism](../project_paper_3_darwinism/README.md)
|
||||
- [Volume 4: Evolutionary Game Theory](../project_paper_4_fbt/README.md)
|
||||
- [Volume 5: Continuous Computation](../project_paper_5_turing/README.md)
|
||||
- [Volume 6: Holographic Entanglement](../project_paper_6_holographic/README.md)
|
||||
|
||||
Reference in New Issue
Block a user