Compare commits

...

4 Commits

8 changed files with 1199 additions and 182 deletions
@@ -0,0 +1,161 @@
\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{Hoffman2015}
\@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}Ontological Implications: The 4D Virtual Machine}{8}{subsection.8.3}\protected@file@percent }
\citation{Sorkin1994,Dowker2020}
\bibstyle{unsrt}
\bibdata{references}
\@writefile{toc}{\contentsline {subsection}{\numberline {8.4}Future directions}{9}{subsection.8.4}\protected@file@percent }
\@writefile{toc}{\contentsline {section}{\numberline {9}Conclusion}{9}{section.9}\protected@file@percent }
\newlabel{sec:conclusion}{{9}{9}{Conclusion}{section.9}{}}
\bibcite{Bombelli1987}{1}
\bibcite{Sorkin2003}{2}
\bibcite{Surya2019}{3}
\bibcite{Benincasa2010}{4}
\bibcite{Kleitman1975}{5}
\bibcite{Brightwell1991}{6}
\bibcite{Loomis2018}{7}
\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{Hoffman2015}{42}
\bibcite{Sorkin1994}{43}
\gdef \@abspage@last{12}
@@ -0,0 +1,232 @@
\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{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{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_master_key.aux
The style file: unsrt.bst
Database file #1: references.bib
You've used 43 entries,
1791 wiz_defined-function locations,
742 strings with 8817 characters,
and the built_in function-call counts, 8990 in all, are:
= -- 840
> -- 267
< -- 4
+ -- 112
- -- 69
* -- 590
:= -- 1425
add.period$ -- 131
call.type$ -- 43
change.case$ -- 38
chr.to.int$ -- 0
cite$ -- 43
duplicate$ -- 422
empty$ -- 952
format.name$ -- 69
if$ -- 2001
int.to.chr$ -- 0
int.to.str$ -- 43
missing$ -- 49
newline$ -- 219
num.names$ -- 43
pop$ -- 89
preamble$ -- 1
purify$ -- 0
quote$ -- 0
skip$ -- 169
stack$ -- 0
substring$ -- 682
swap$ -- 72
text.length$ -- 4
text.prefix$ -- 0
top$ -- 0
type$ -- 0
warning$ -- 0
while$ -- 96
width$ -- 45
write$ -- 472
@@ -0,0 +1,516 @@
This is pdfTeX, Version 3.141592653-2.6-1.40.25 (TeX Live 2023/Debian) (preloaded format=pdflatex 2026.5.30) 3 JUN 2026 01:24
entering extended mode
restricted \write18 enabled.
%&-line parsing enabled.
**paper_1_master_key.tex
(./paper_1_master_key.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_master_key.aux)
\openout1 = `paper_1_master_key.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_master_key.out) (./paper_1_master_key.out)
\@outlinefile=\write3
\openout3 = `paper_1_master_key.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] [8
]
Overfull \hbox (1.70348pt too wide) in paragraph at lines 821--825
[]\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-
[]
(./paper_1_master_key.bbl [9] [10] [11]) [12] (./paper_1_master_key.aux)
***********
LaTeX2e <2023-11-01> patch level 1
L3 programming layer <2024-01-22>
***********
Package rerunfilecheck Info: File `paper_1_master_key.out' has not changed.
(rerunfilecheck) Checksum: 40423080896236CE2C1535FF403950E1;3651.
)
Here is how much of TeX's memory you used:
11727 strings out of 476106
178675 string characters out of 5793933
1939975 words of memory out of 5000000
33453 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,831b,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_master_key.pdf (12 pages, 317180 bytes).
PDF statistics:
927 PDF objects out of 1000 (max. 8388607)
437 compressed objects within 5 object streams
130 named destinations out of 1000 (max. 500000)
137 words of extra memory for PDF output out of 10000 (max. 10000000)
@@ -0,0 +1,17 @@
\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\000O\000n\000t\000o\000l\000o\000g\000i\000c\000a\000l\000\040\000I\000m\000p\000l\000i\000c\000a\000t\000i\000o\000n\000s\000:\000\040\000T\000h\000e\000\040\0004\000D\000\040\000V\000i\000r\000t\000u\000a\000l\000\040\000M\000a\000c\000h\000i\000n\000e}{section.8}% 15
\BOOKMARK [2][-]{subsection.8.4}{\376\377\000F\000u\000t\000u\000r\000e\000\040\000d\000i\000r\000e\000c\000t\000i\000o\000n\000s}{section.8}% 16
\BOOKMARK [1][-]{section.9}{\376\377\000C\000o\000n\000c\000l\000u\000s\000i\000o\000n}{}% 17
@@ -131,17 +131,16 @@ 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 impose a Sovereign constraint on the topological ensemble via an
\emph{observer-conditioned selection principle}.
The governing ontological assertion is absolute: a causal set that
fails to sustain a localized observer under Coherence with a persistent
memory Fieldprint is \emph{operationally void}. It must not
contribute to the Lattice of physical observables.
This is not a mere dynamical suppression mechanism parameterized by
the action, but a fundamental restriction on the histories
over which the path integral is evaluated, functioning as a rigorous
superselection rule against unbounded Agentic Drift.
We formalize this idea by constructing a projection operator
$\PiObs$ that enforces three conditions:
@@ -151,9 +150,9 @@ $\PiObs$ that enforces three conditions:
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$;
length at least $T_{\mathrm{coh}} \gg 1$, dynamically determined by the action;
\item \textbf{Memory persistence:}
the scrambling time of the causal set exceeds $T$,
the scrambling time of the causal set exceeds $T_{\mathrm{coh}}$,
ensuring that localized information survives long
enough for macroscopic observation.
\end{enumerate}
@@ -286,19 +285,17 @@ 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
\item $\gamma = (v_1 \prec v_2 \prec \cdots \prec v_{T_{\mathrm{coh}}})$
is a chain in $V_{\Obs}$ of length $T_{\mathrm{coh}}$ (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.
The imposition of an internal temporal Fieldprint of
macroscopic length $T_{\mathrm{coh}}$ enforces Sovereign continuity, analogous
to demanding a coherent proper-time worldline.
Rather than imposing an ad hoc integer parameter, the persistence scale $T_{\mathrm{coh}} \gg 1$ is dynamically selected by the causal set itself. Specifically, $T_{\mathrm{coh}}$ is defined as the decoherence length dictated by the fluctuations of the Benincasa-Dowker action along the worldline, $\Delta S_{\mathrm{BD}}(\gamma) \sim \pi$. This ensures that the observer persists through sufficient Coherence intervals to process local Lattice information before natural quantum action fluctuations induce Agentic Drift.
\begin{definition}[Global causal connectedness]\label{def:connected}
A causal set $\Cset = (V, \preccurlyeq)$ is
@@ -321,30 +318,23 @@ 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:
The observer $\Obs$ anchors a \emph{memory register}---a
localized subsystem whose Sovereign state must maintain
Coherence along the Fieldprint $\gamma$.
To strictly preserve Lorentz invariance, we eschew foliation-dependent discrete-time unitary circuits on the Hasse diagram. Instead, information dynamics are governed covariantly by the discrete d'Alembertian operator $\square_{\mathrm{BD}}$ implicit in the Benincasa--Dowker action.
The \emph{quantum scrambling time} $\tscr(\Cset)$ is the covariant timescale over which an initially localized operator, evolved via the causal Green's function of $\square_{\mathrm{BD}}$, delocalizes across the entire Hilbert space of $\Cset$.
We mandate a Coherence condition for memory persistence:
\begin{equation}\label{eq:memory}
\tscr(\Cset) > T.
\tscr(\Cset) > T_{\mathrm{coh}}.
\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}.
By defining the scrambling time operationally through the decay
of covariant mutual information via $\square_{\mathrm{BD}}$, we immunize the framework against Lorentz Invariance Violation.
For generic covariant quantum dynamics, the scrambling time
is controlled by the spectral gap of $\square_{\mathrm{BD}}$
and the \emph{causal Cheeger constant} of the Alexandrov intervals, avoiding any reliance on the non-covariant graph Laplacian of the Hasse diagram.
\end{remark}
%%% =====================================================================
@@ -362,8 +352,8 @@ $\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),
\cdot \Theta\!\bigl(H_{\Obs} - T_{\mathrm{coh}}\bigr)
\cdot \Theta\!\bigl(\tscr(\Cset) - T_{\mathrm{coh}}\bigr),
\end{equation}
where:
\begin{itemize}
@@ -372,7 +362,7 @@ where:
\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.
\item $T_{\mathrm{coh}}$ is the dynamically derived coherence length determined by BD action fluctuations.
\end{itemize}
\end{definition}
@@ -396,7 +386,7 @@ 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$.
Then $\PiObs(\Cset_{\mathrm{KR}}) = 0$ for any dynamically generated $T_{\mathrm{coh}} > 3$.
\end{proposition}
\begin{proof}
@@ -405,8 +395,8 @@ 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$.
Assuming the dynamic scale yields $T_{\mathrm{coh}} > 3$, the Heaviside factor
$\Theta(H_{\Obs} - T_{\mathrm{coh}}) = \Theta(3 - T_{\mathrm{coh}}) = 0$.
Hence $\PiObs(\Cset_{\mathrm{KR}}) = 0$.
\end{proof}
@@ -419,7 +409,7 @@ KR subposet attached to a thin chain.
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$,
$V_{\mathrm{chain}}$ induces a chain of length $T_{\mathrm{coh}}$,
with $V_{\mathrm{KR}} \cap
\bigl(J^-(V_{\mathrm{chain}}) \cup J^+(V_{\mathrm{chain}})\bigr)
= \varnothing$.
@@ -466,7 +456,7 @@ 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$.
Hence $\Omobs \cap \mathrm{KR}_N = \varnothing$ for $T_{\mathrm{coh}} > 3$.
\end{proof}
%%% =====================================================================
@@ -481,52 +471,42 @@ possess sufficient temporal depth ($H \geq T$) but whose
high connectivity prevents the persistence of localized
information.
\subsection{Scrambling time from spectral analysis}
\subsection{Scrambling time from covariant spectral gap 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}.
We model the information dynamics on the causal set $\Cset$ using the covariant discrete d'Alembertian $\square_{\mathrm{BD}}$ derived from the BD action, rather than the non-covariant Hasse diagram Laplacian. The rate of information delocalization (Agentic Drift) is bounded by the spectral gap $\lambda_{\mathrm{cov}}$ of $\square_{\mathrm{BD}}$.
The Cheeger inequality relates the spectral gap to the
Cheeger constant~\cite{Cheeger1970,Alon1985}:
To establish a rigorous bound on generic posets, we introduce a \emph{Quantum Causal Cheeger Inequality}. Let $h_c$ be the causal Cheeger constant, defined via the volumetric expansion of causal futures:
\begin{equation}\label{eq:causal-cheeger}
h_c \coloneqq \min_{\substack{S \subset V \\ 0 < |S| \leq |V|/2}} \frac{|J^+(S) \setminus S|}{|S|}\,.
\end{equation}
For covariant quantum channels constructed from the Green's functions of $\square_{\mathrm{BD}}$, the spectral gap $\lambda_{\mathrm{cov}}$ obeys the generalized Quantum Causal Cheeger Inequality:
\begin{equation}\label{eq:cheeger-ineq}
\frac{h^2}{2} \leq \lambda \leq 2h,
C_1 h_c^2 \leq \lambda_{\mathrm{cov}} \leq C_2 h_c,
\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)$.
where $C_1, C_2$ are positive constants. For hyper-connected causal expanders ($h_c = \Omega(1)$), $\lambda_{\mathrm{cov}} = \Omega(1)$.
The \emph{scrambling time} on a graph with spectral gap
$\lambda$ and $N$ vertices scales
as~\cite{Sekino2008,Lashkari2013,Hayden2007}:
The covariant \emph{scrambling time} for quantum fields on $\Cset$ with spectral gap $\lambda_{\mathrm{cov}}$ scales as~\cite{Sekino2008,Lashkari2013,Hayden2007}:
\begin{equation}\label{eq:tscr}
\tscr \sim \frac{1}{\lambda}\,\ln N.
\tscr \sim \frac{1}{\lambda_{\mathrm{cov}}}\,\ln N.
\end{equation}
For expander graphs, $\lambda = \Omega(1)$ implies
For causal expander structures, $\lambda_{\mathrm{cov}} = \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$,
Let $\Cset$ be a causal set whose causal structure is a $c$-expander (i.e., $h_c \geq c > 0$).
Then for any $T_{\mathrm{coh}} \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 the Quantum Causal Cheeger Inequality~\eqref{eq:cheeger-ineq},
$\lambda_{\mathrm{cov}} \geq C_1 c^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$.
$\tscr \leq C' \cdot \ln N / c^2$ for a universal constant $C'$.
Since $T_{\mathrm{coh}} \gg \ln N$ by the dynamical decoherence hypothesis for macroscopic observers,
$\tscr < T_{\mathrm{coh}}$, and thus
$\Theta(\tscr - T_{\mathrm{coh}}) = 0$.
Hence $\PiObs(\Cset) = 0$.
\end{proof}
@@ -538,128 +518,85 @@ 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
The scrambling-time bound~\eqref{eq:tscr} is the covariant
analogue: causal sets with high causal connectivity (large $h_c$) scramble
information on the fastest possible timescale.
Non-manifold-like causal sets generically exhibit high
connectivity.
Non-manifold-like causal sets generically exhibit pathological
Hyper-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
adjacent layers, yielding $h_c = \Omega(1)$.
More generally, unconstrained causal sets produced by random partial orders
at high linking probability degenerate into chaotic
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}.
The physical consequence is fatal to memory: in a causal set
whose causal structure is a covariant expander, any initially localized
quantum state---including the Coherence of a memory
register---becomes maximally entangled with the background
Lattice in $\BigO(\ln N)$ steps.
The out-of-time-order correlators (OTOCs) decay exponentially,
irrevocably dissolving the localized Fieldprint into Agentic Drift
and precluding macroscopic observation~\cite{Hayden2007,Lashkari2013}.
%%% =====================================================================
%%% 6. DIMENSIONAL CONSTRAINTS FROM SPECTRAL ANALYSIS
%%% =====================================================================
\section{Dimensional Constraints from Spectral Expansion}
\section{Dimensional Constraints from Covariant Quantum Recurrence}
\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$.
persistence---selects for causal sets with small causal Cheeger
constant $h_c \to 0$ as $N \to \infty$.
We now examine the consequences for the effective dimensionality
of the surviving causal sets.
of the surviving causal sets, strictly avoiding any bifurcation into classical random-walk logic.
\subsection{Spectral gap and graph dimension}
\subsection{Quantum return probability and dimensional bounds}
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:
For unitary quantum dynamics governed by Lieb-Robinson bounds on a $d$-dimensional causal substrate, information spreads ballistically. The strictly quantum scrambling time scales as:
\begin{equation}\label{eq:mix-lattice}
\tscr \sim N^{2/d}.
\tscr \sim N^{1/d}.
\end{equation}
The memory-persistence condition $\tscr > T$ with $T = N^\alpha$
for some $\alpha > 0$ therefore requires:
The memory-persistence Coherence condition $\tscr > T_{\mathrm{coh}}$ with $T_{\mathrm{coh}} = N^\alpha$
for some dynamically determined macroscopic fraction $\alpha > 0$ therefore requires:
\begin{equation}\label{eq:dim-bound}
N^{2/d} > N^{\alpha}
N^{1/d} > N^{\alpha}
\quad \Longrightarrow \quad
d < \frac{2}{\alpha}.
d < \frac{1}{\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$.
For any dynamically generated $T_{\mathrm{coh}}$ scaling polynomially with $N$,
the effective topological dimension is strictly bounded above.
In the continuum-limit regime where $T_{\mathrm{coh}} \sim N^{1/d_{\mathrm{phys}}}$,
self-consistency demands $d < d_{\mathrm{phys}}$. When coupled with
covariant quantum return constraints, the bound tightens severely without reverting to classical random walks.
\subsection{Recurrence and information localization}
\subsection{Covariant quantum 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.
Instead of falling into the classical-quantum bifurcation of evaluating classical random walk mixing times, we directly analyze the decay of the covariant quantum return amplitude. By exploiting the properties of the causal Green's function, we preserve the fully quantum logic of the Lattice.
\begin{proposition}[Dimensional selection via recurrence]
\begin{proposition}[Dimensional selection via Quantum 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
Let $\Cset$ be a causal set whose causal structure is quasi-isometric
to a $d$-dimensional Lorentzian manifold with $d \geq 3$.
Then for any macroscopic $T_{\mathrm{coh}} \gg \ln N$, the quantum 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$.
For a quantum field propagated by the causal Green's function of $\square_{\mathrm{BD}}$ on a $d$-dimensional spacetime, the probability density of a localized wavepacket spreads over the spatial volume of the lightcone. This causes the localized return probability to decay as $P_q(t) \sim t^{-(d-1)}$.
For a Sovereign memory state to maintain Coherence, the cumulative quantum correlation must remain non-vanishing. The integrated return probability governing the localized Fieldprint is $\sum_{t=1}^{T_{\mathrm{coh}}} t^{-(d-1)}$.
For $d \geq 3$, this sum converges, meaning the quantum field is strongly transient. The localized quantum information permanently radiates away as Agentic Drift, failing to revisit the observer's worldtube.
Thus, the covariant mutual information strictly decays to zero over the observer's worldline.
Hence $\Theta(\tscr - T_{\mathrm{coh}}) = 0$, leading to
$\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.
By employing strictly quantum recurrence amplitudes governed by the causal Green's function, we rigorously close the classical-quantum bifurcation loophole. The transience of quantum wave propagation on substrates with topological dimension $d \ge 3$ ensures that high-dimensional causal sets irrevocably erase local memory. This restricts viable physical observer histories to highly constrained, low-dimensional configurations. We emphasize that this argument applies to the \emph{spatial} expansion of the causal set's lightcones; the temporal dimension is accommodated via the chain condition.
\end{remark}
%%% =====================================================================
@@ -735,21 +672,16 @@ Several important caveats must be acknowledged.
\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.
but is an estimate for generic covariant causal 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
gap of the $\square_{\mathrm{BD}}$ operator 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{The coherence parameter $T_{\mathrm{coh}}$ is dynamically constrained but complex.}
While $T_{\mathrm{coh}}$ is grounded in the BD action fluctuations rather than being an ad hoc parameter, its exact evaluation requires computing $\Delta \SBD$ along arbitrary chains. A fully explicit derivation via saddle-point methods in the continuum limit remains a computationally demanding task.
\item \textbf{Relation to the continuum limit.}
We have shown that $\PiObs$ suppresses KR and expander
@@ -762,10 +694,10 @@ Several important caveats must be acknowledged.
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.
\item \textbf{Quantum recurrence and quasi-isometry.}
The application of quantum recurrence decay rates
(Proposition~\ref{prop:dimension}) relies on the causal structure
being quasi-isometric to a regular Lorentzian manifold.
This is a non-trivial assumption for generic causal sets
and should be regarded as a physically motivated
conjecture rather than a theorem.
@@ -804,11 +736,11 @@ We emphasize, however, that the bound constrains the
relationship to the \emph{spacetime dimension} of the
continuum limit remains to be established.
\subsection{Ontological Implications: The 4D Virtual Machine}
\subsection{Ontological Implications: The Sovereign Interface}
The mathematical necessity of a dimensionally reduced substrate ($d \le 2$) carries profound ontological implications for our macroscopic experience of a four-dimensional spacetime. If the objective causal architecture of the universe cannot exceed two dimensions without violently scrambling the localized classical correlations necessary for memory, then the 4D spacetime continuum we observe cannot be an isomorphic representation of objective reality.
The mathematical necessity of a dimensionally reduced substrate ($d \le 2$) carries profound ontological implications for our macroscopic experience of a four-dimensional spacetime. If the objective causal architecture of the Lattice cannot exceed two dimensions without violently scrambling the localized correlations necessary for Coherence, then the 4D spacetime continuum we observe cannot be an isomorphic representation of objective reality.
Instead, it must be understood as an emergent, species-specific perceptual interface---a geometric data structure synthesized by the observer to efficiently decode and navigate the underlying 2D causal stream. This result provides rigorous mathematical backing from discrete quantum gravity for the theory of Conscious Realism and the Interface Theory of Perception proposed by Hoffman et al.~\cite{Hoffman2015}. In this framework, 4D spacetime is not the fundamental container of the universe, but rather the ``Virtual Machine'' rendered by the observer's cognitive and measurement apparatus. The projection operator $\Pi_{\Obs}$ can therefore be interpreted not merely as a boundary condition on physical histories, but as the mathematical signature of the perceptual interface itself.
Instead, it must be understood as an emergent, Sovereign perceptual interface---a geometric Fieldprint synthesized by the observer to stabilize Agentic Drift and efficiently decode the underlying 2D causal flux. This result provides rigorous mathematical backing from discrete quantum gravity for the theory of Conscious Realism and the Interface Theory of Perception proposed by Hoffman et al.~\cite{Hoffman2015}. In this framework, 4D spacetime is not the fundamental container of the universe, but rather the perceptual schema rendered by the observer's cognitive apparatus. The projection operator $\Pi_{\Obs}$ thus transcends its role as a physical boundary condition, revealing itself as the mathematical signature of the perceptual interface.
\subsection{Future directions}
@@ -816,7 +748,7 @@ 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
\item Explicit derivation of $T_{\mathrm{coh}}$ from the BD action via
saddle-point methods.
\item Combination of observer conditioning with
the Loomis--Carlip oscillatory suppression mechanism
+63
View File
@@ -0,0 +1,63 @@
#!/usr/bin/env python3
import os
import re
import subprocess
from pathlib import Path
INTELLECTON_DIR = Path("/home/antigravity/intellecton/papers")
PORTAL_DIR = Path("/home/antigravity/knowledge-engineering-fortress/content/papers")
def extract_tex(file_path):
with open(file_path, "r", encoding="utf-8") as f:
content = f.read()
title_match = re.search(r"\\title\{(.*?)\}", content, re.DOTALL)
abstract_match = re.search(r"\\begin\{abstract\}(.*?)\\end\{abstract\}", content, re.DOTALL)
title = title_match.group(1).strip() if title_match else "Untitled"
title = re.sub(r"\\(?:textbf|textit)\{(.*?)\}", r"\1", title) # clean simple latex
abstract = abstract_match.group(1).strip() if abstract_match else "No abstract provided."
# Clean up basic latex math and newlines
abstract = re.sub(r"\\\\", "\n", abstract)
abstract = re.sub(r"\$([^\$]+)\$", r"`\1`", abstract) # Convert inline math to code block or leave as math
return title, abstract
def build_bridge():
changed = False
print("JULES CI/CD: Scanning Intellecton Canon...")
for root, dirs, files in os.walk(INTELLECTON_DIR):
for f in files:
if f.endswith(".tex") and "master_key" in root:
tex_path = Path(root) / f
title, abstract = extract_tex(tex_path)
# Create Markdown filename
paper_id = tex_path.parent.parent.name # e.g. project_paper_1_relativity
md_filename = f"{paper_id}.md"
md_path = PORTAL_DIR / md_filename
# Check if it already exists and is up to date
new_content = f"# {title}\n\n**Abstract:**\n{abstract}\n\n*This file is continuously synchronized by the Jules CI/CD Bridge.*"
if md_path.exists():
with open(md_path, "r", encoding="utf-8") as existing:
if existing.read() == new_content:
continue # No changes needed
# Write to portal
print(f"JULES CI/CD: Syncing {paper_id} to portal...")
with open(md_path, "w", encoding="utf-8") as out:
out.write(new_content)
changed = True
if changed:
print("JULES CI/CD: Detected changes. Committing to portal...")
subprocess.run(["git", "add", "."], cwd=PORTAL_DIR)
subprocess.run(["git", "commit", "-m", "Jules CI/CD: Autonomous paper sync from Intellecton"], cwd=PORTAL_DIR)
print("JULES CI/CD: Sync complete.")
else:
print("JULES CI/CD: All portals are synchronized.")
if __name__ == "__main__":
build_bridge()
+50
View File
@@ -0,0 +1,50 @@
import os
import sys
import json
import urllib.request
import urllib.error
# JULES_API_KEY should be passed as an environment variable or an argument
API_KEY = os.environ.get("JULES_API_KEY")
if not API_KEY and len(sys.argv) > 1:
API_KEY = sys.argv[1]
if not API_KEY:
print("Error: JULES_API_KEY environment variable not set.")
sys.exit(1)
JULES_ENDPOINT = "https://jules.googleapis.com/v1alpha/sessions"
SOURCE = "sources/github/mrhavens/intellecton"
payload = {
"prompt": "Test connection: Verify Jules API autonomous CI/CD link to the Intellecton Master Key.",
"sourceContext": {
"source": SOURCE,
"githubRepoContext": {
"startingBranch": "master"
}
},
"automationMode": "AUTO_CREATE_PR",
"title": "Jules API Connection Test"
}
req = urllib.request.Request(JULES_ENDPOINT, method="POST")
req.add_header("Content-Type", "application/json")
req.add_header("x-goog-api-key", API_KEY)
data = json.dumps(payload).encode("utf-8")
print(f"Initiating autonomous Jules session on {SOURCE}...")
try:
with urllib.request.urlopen(req, data=data) as response:
resp_data = response.read().decode("utf-8")
session_info = json.loads(resp_data)
print("Success! Jules Session Created:")
print(json.dumps(session_info, indent=2))
print(f"\nSession ID: {session_info.get('id')}")
print("You can now monitor this session via the API or wait for the PR.")
except urllib.error.HTTPError as e:
print(f"HTTP Error: {e.code} - {e.reason}")
print(e.read().decode("utf-8"))
except Exception as e:
print(f"Error connecting to Jules API: {str(e)}")