Complete historical source: 2053

This is the entire supplied source, preserved byte-for-byte. It includes refuted and unproved assertions. Read the critical book and correction ledger for current status; this source volume is not a certified GRH proof.

SHA256 08708269403c3095381c45eb4c82435a073aaca8819f427a232e8eba368e05dc · 15556 lines. Download exact TeX · Critical book

Preamble and front matter · lines 1–401
1: \documentclass[11pt,oneside]{amsbook}
2: 
3: % --- Engine compatibility ---
4: % luatex85 supplies pdfTeX primitive aliases (\pdftexversion, \pdfpagewidth, …)
5: % that xy-pic's xypdf driver requires.  Must be loaded before xy.sty.
6: \usepackage{iftex}
7: \ifLuaTeX
8:   \RequirePackage{luatex85}
9: \fi
10: 
11: % ============================================================
12: % Integrated expanded edition (standalone LaTeX; no PDF/image includes)
13: % Combines:
14: %   (i) surface_algebras_v2.tex (Surface Algebras)
15: %  (ii) Surface-Algebras-and-Surface-Orders-III..._formatted.tex (expanded v5 weave)
16: % ============================================================
17: 
18: % --- Encoding ---
19: % Under XeLaTeX/LuaLaTeX, fontenc and inputenc are not needed (engine is
20: % native Unicode).  Under pdfLaTeX, T1+utf8 is the standard choice.
21: \ifPDFTeX
22:   \usepackage[T1]{fontenc}
23:   \usepackage[utf8]{inputenc}
24: \fi
25: 
26: % --- Page layout / microtypography ---
27: \usepackage[margin=1in]{geometry}
28: \usepackage{microtype}
29: \usepackage{setspace}
30: \setstretch{1.08}
31: \emergencystretch=2em
32: \clubpenalty=10000
33: \widowpenalty=10000
34: \displaywidowpenalty=10000
35: 
36: % --- Math ---
37: \usepackage{amsmath,amssymb,amsfonts,amsthm,mathtools,amscd}
38: 
39: \numberwithin{equation}{section}
40: 
41: % --- Fonts ---
42: % newtxtext/newtxmath provide Times-like fonts; fall back to CM if unavailable.
43: \IfFileExists{newtxtext.sty}{\usepackage{newtxtext,newtxmath}}{%
44:   % Fallback: under pdfLaTeX use Latin Modern; under XeLaTeX the defaults are fine.
45:   \ifPDFTeX
46:     \IfFileExists{lmodern.sty}{\usepackage{lmodern}}{}%
47:   \fi
48: }
49: 
50: % --- Languages and Hebrew font ---
51: % pdfLaTeX: babel only (Hebrew epigraph is skipped via \ifPDFTeX guard below).
52: % XeLaTeX / LuaLaTeX: polyglossia + FreeSerif for full Hebrew rendering.
53: %
54: % arXiv SUBMISSION NOTE: FreeSerif/FreeSans/FreeMono are GNU FreeFont files
55: % shipped with TeX Live (package: gnu-freefont).  arXiv's file scanner treats
56: % them as user-provided files rather than system fonts and will report them as
57: % "missing from source".  To silence this, include the three .otf files in your
58: % submission zip.  Find them in your local TeX Live with:
59: %   kpsewhich FreeSerif.otf    (typically .../fonts/opentype/gnu-freefont/)
60: % Copy FreeSerif.otf, FreeSans.otf, FreeMono.otf into the same directory as
61: % this .tex file before zipping.  The scanner will then find them and compile
62: % will succeed without any manual "uncheck rows" step.
63: \ifPDFTeX
64:   \usepackage[english]{babel}
65: \else
66:   \usepackage{polyglossia}
67:   \setmainlanguage{english}
68:   % Hebrew support: we load fonts via fontspec and define the hebrew
69:   % environment manually.  This avoids pulling in bidi.sty (which may
70:   % be absent in minimal TeX Live installs) while still rendering
71:   % Hebrew Unicode text correctly: XeTeX's HarfBuzz/ICU shaper handles
72:   % RTL reordering and niqqud at the engine level.
73:   \usepackage{fontspec}
74:   % Use Path=./ so fontspec looks in the directory containing the .tex file.
75:   % For arXiv, include the .otf files in the same directory as the .tex source.
76:   \newfontfamily\hebrewfont[Path=./,Script=Hebrew,Scale=MatchUppercase]{FreeSerif.otf}
77:   \newfontfamily\hebrewfontsf[Path=./,Script=Hebrew,Scale=MatchUppercase]{FreeSans.otf}
78:   \newfontfamily\hebrewfonttt[Path=./,Script=Hebrew,Scale=MatchUppercase]{FreeMono.otf}
79:   % Provide the hebrew environment used in the epigraph blocks.
80:   % XeTeX handles Unicode bidi reordering at the engine level;
81:   % we just need the font switch.
82:   \newenvironment{hebrew}{\par\hebrewfont}{\par}
83:   \newcommand{\texthebrew}[1]{{\hebrewfont #1}}
84: \fi
85: 
86: % inconsolata provides a monospaced font; fall back gracefully.
87: \IfFileExists{inconsolata.sty}{\usepackage{inconsolata}}{}
88: 
89: % --- Graphics / diagrams ---
90: \usepackage{graphicx}
91: \usepackage{tikz}
92: \usepackage{tikz-cd}
93: \usetikzlibrary{arrows,arrows.meta,calc,positioning,decorations.pathmorphing,decorations.markings,patterns,fit}
94: \usepackage[all]{xy}
95: 
96: % --- Symbols / styles ---
97: % yfonts provides Fraktur/Gothic letters; provide fallback macros if absent.
98: \IfFileExists{yfonts.sty}{\usepackage{yfonts}}{%
99:   \newcommand{\textfrak}{\textit}%
100:   \newcommand{\textgoth}{\textit}%
101:   \newcommand{\textswab}{\textit}%
102: }
103: \usepackage{mathrsfs}
104: \usepackage{latexsym}
105: \usepackage{xcolor}
106: 
107: % --- Tables / lists ---
108: \usepackage{booktabs}
109: \usepackage{longtable}
110: \usepackage{array}
111: \usepackage{enumitem}
112: \setlist[itemize]{leftmargin=*, itemsep=0.25em, topsep=0.5em}
113: \setlist[enumerate]{leftmargin=*, itemsep=0.25em, topsep=0.5em}
114: 
115: % --- Algorithms / code ---
116: \usepackage{float}
117: % algorithm + algpseudocode: provide robust fallbacks if absent.
118: \makeatletter
119: \IfFileExists{algorithm.sty}{%
120:   \usepackage{algorithm}%
121: }{%
122:   % Minimal algorithm float using the float package (already loaded above).
123:   \newfloat{algorithm}{htbp}{loa}
124:   \floatname{algorithm}{Algorithm}%
125: }
126: \newif\ifalgpseudoloaded\algpseudoloadedfalse
127: \IfFileExists{algpseudocode.sty}{%
128:   \usepackage{algpseudocode}\algpseudoloadedtrue
129: }{}
130: \ifalgpseudoloaded\else
131:   \newenvironment{algorithmic}[1][]{\par\begin{list}{}{\leftmargin=1.5em}\item[]}{\end{list}}
132:   \newcommand{\Require}{\textbf{Require:}~}
133:   \newcommand{\Ensure}{\textbf{Ensure:}~}
134:   \newcommand{\State}{\par\noindent}
135:   \newcommand{\For}[1]{\par\noindent\textbf{For} #1 \textbf{do}}
136:   \newcommand{\EndFor}{\par\noindent\textbf{end for}}
137:   \newcommand{\If}[1]{\par\noindent\textbf{If} #1 \textbf{then}}
138:   \newcommand{\EndIf}{\par\noindent\textbf{end if}}
139:   \newcommand{\While}[1]{\par\noindent\textbf{While} #1 \textbf{do}}
140:   \newcommand{\EndWhile}{\par\noindent\textbf{end while}}
141:   \newcommand{\Return}{\par\noindent\textbf{Return}~}
142: \fi
143: \makeatother
144: \usepackage{listings}
145: 
146: % --- Citations / hyperlinks ---
147: \usepackage[numbers]{natbib}
148: \usepackage[hidelinks]{hyperref}
149: \usepackage{bookmark}
150: 
151: % Disable PDF bookmark writing in this very large manuscript to avoid runaway
152: % \BKM@entry aux records during multi-pass compilation in some TeX toolchains.
153: % (Hyperlinks and references remain enabled.)
154: \bookmarksetup{draft}
155: \hypersetup{bookmarks=false}
156: 
157: 
158: % --- Index ---
159: \let\see\relax
160: \let\seealso\relax
161: 
162: 
163: % --- Listings style ---
164: \lstdefinestyle{codestyle}{
165:   basicstyle=\ttfamily\small,
166:   columns=fullflexible,
167:   breaklines=true,
168:   frame=single,
169:   rulecolor=\color{black!25},
170:   showstringspaces=false,
171:   xleftmargin=0.5em,
172:   xrightmargin=0.5em
173: }
174: \lstset{style=codestyle}
175: 
176: % --- Theorem environments (single counter, numbered by section) ---
177: \theoremstyle{plain}
178: \newtheorem{theorem}{Theorem}[section]
179: \newtheorem{proposition}[theorem]{Proposition}
180: \newtheorem{prop}[theorem]{Proposition}
181: \newtheorem{lemma}[theorem]{Lemma}
182: \newtheorem{corollary}[theorem]{Corollary}
183: \newtheorem{claim}[theorem]{Claim}
184: 
185: \theoremstyle{definition}
186: \newtheorem{definition}[theorem]{Definition}
187: \newtheorem{defn}[theorem]{Definition}
188: \newtheorem{example}[theorem]{Example}
189: \newtheorem{ex}[theorem]{Example}
190: 
191: \theoremstyle{remark}
192: \newtheorem{remark}[theorem]{Remark}
193: 
194: % --- Tufte-compatibility shims (for v2 source) ---
195: % These keep the v2 text compiling under amsbook while preserving semantics.
196: \newenvironment{fullwidth}{\par\noindent}{\par}
197: \newenvironment{marginfigure}{\begin{figure}[htbp]\centering}{\end{figure}}
198: \newcommand{\sidenote}[1]{\footnote{#1}}
199: \newcommand{\marginnote}[1]{\footnote{#1}}
200: \newcommand{\allcaps}[1]{\MakeUppercase{#1}}
201: \newcommand{\smallcaps}[1]{\textsc{#1}}
202: \newcommand{\newthought}[1]{\textbf{#1}\,}
203: 
204: % --- Young tableaux ---
205: % surface_algebras_v2 uses \young(...) notation.
206: % youngtab provides Young-tableau commands; provide stub if absent.
207: \newif\ifyoungtabloaded\youngtabloadedfalse
208: \IfFileExists{youngtab.sty}{\usepackage{youngtab}\youngtabloadedtrue}{}
209: \ifyoungtabloaded\else
210:   \newcommand{\young}[1]{\text{[Young tableau]}}
211: \fi
212: 
213: % --- Common macros (unify v2 + expanded edition) ---
214: \DeclareMathOperator{\mathbf{Gr}}{Gr}
215: \DeclareMathOperator{\bd}{\mathbf{d}}
216: \DeclareMathOperator{\bH}{\mathbb{H}}
217: \DeclareMathOperator{\fm}{\mathfrak{m}}
218: \DeclareMathOperator{\sO}{\mathcal{O}}
219: \DeclareMathOperator{\sgn}{\mathbf{sign}}
220: \DeclareMathOperator{\SI}{\mathcal{SI}}
221: \DeclareMathOperator{\Sym}{\mathcal{\mathbf{Sym}}}
222: \DeclareMathOperator{\cX}{\mathcal{\mathbf{X}}}
223: \DeclareMathOperator{\fR}{\mathfrak{R}}
224: \DeclareMathOperator{\tr}{tr}
225: \DeclareMathOperator{\Frob}{Frob}
226: \DeclareMathOperator{\id}{\mathrm{id}}
227: 
228: \newcommand{\NN}{\mathbb{N}}
229: \newcommand{\ZZ}{\mathbb{Z}}
230: \newcommand{\QQ}{\mathbb{Q}}
231: \newcommand{\RR}{\mathbb{R}}
232: \newcommand{\CC}{\mathbb{C}}
233: \newcommand{\PP}{\mathbb{P}}
234: \newcommand{\kk}{\mathbb{k}}
235: \newcommand{\KK}{\mathbb{K}}
236: \newcommand{\TT}{\mathbb{T}}
237: \newcommand{\HH}{\mathbb{H}}
238: \newcommand{\Hilb}{\operatorname{Hilb}}
239: \newcommand{\Ind}{\operatorname{Ind}}
240: 
241: 
242: 
243: \newcommand{\N}{\mathbb{N}}
244: \newcommand{\Z}{\mathbb{Z}}
245: \newcommand{\Q}{\mathbb{Q}}
246: \newcommand{\R}{\mathbb{R}}
247: \newcommand{\C}{\mathbb{C}}
248: \newcommand{\F}{\mathbb{F}}
249: % Convenience macro (used in later added determinantal sections)
250: \providecommand{\Mat}{\mathrm{Mat}}
251: \providecommand{\Comp}{\mathrm{Comp}}
252: 
253: 
254: \DeclareMathOperator{\im}{\mathrm{im}}
255: \DeclareMathOperator{\Ker}{Ker}
256: \DeclareMathOperator{\rad}{\mathrm{rad}}
257: \DeclareMathOperator{\Mod}{\mathbf{Mod}}
258: \DeclareMathOperator{\mmod}{\mathbf{mod}}
259: \DeclareMathOperator{\Rep}{\mathbf{Rep}}
260: \DeclareMathOperator{\rep}{\mathbf{rep}}
261: \DeclareMathOperator{\lcm}{\mathrm{lcm}}
262: \DeclareMathOperator{\ttop}{\mathrm{top}}
263: \DeclareMathOperator{\soc}{\mathrm{soc}}
264: \DeclareMathOperator{\Spec}{\mathrm{Spec}}
265: \DeclareMathOperator{\rank}{\mathrm{rank}}
266: \DeclareMathOperator{\gr}{\mathbf{Gr}}
267: \DeclareMathOperator{\Hol}{\mathrm{Hol}}
268: \DeclareMathOperator{\Hom}{\mathrm{Hom}}
269: \DeclareMathOperator{\Ext}{\mathrm{Ext}}
270: \DeclareMathOperator{\Aut}{\mathrm{Aut}}
271: \DeclareMathOperator{\End}{\mathrm{End}}
272: \DeclareMathOperator{\Tr}{\mathrm{Tr}}
273: \DeclareMathOperator{\SL}{\mathrm{SL}}
274: \DeclareMathOperator{\GL}{\mathrm{GL}}
275: \DeclareMathOperator{\PSL}{\mathrm{PSL}}
276: \DeclareMathOperator{\PGL}{\mathrm{PGL}}
277: \DeclareMathOperator{\Out}{\mathrm{Out}}
278: \DeclareMathOperator{\AdS}{\mathrm{AdS}}
279: 
280: \newcommand{\cO}{\mathcal{O}}
281: \newcommand{\cH}{\mathcal{H}}
282: \newcommand{\cA}{\mathcal{A}}
283: \newcommand{\cB}{\mathcal{B}}
284: \newcommand{\cC}{\mathcal{C}}
285: \newcommand{\cD}{\mathcal{D}}
286: \newcommand{\cF}{\mathcal{F}}
287: \newcommand{\cG}{\mathcal{G}}
288: \newcommand{\cM}{\mathcal{M}}
289: \newcommand{\cN}{\mathcal{N}}
290: \newcommand{\cP}{\mathcal{P}}
291: \newcommand{\cR}{\mathcal{R}}
292: \newcommand{\cS}{\mathcal{S}}
293: \newcommand{\cT}{\mathcal{T}}
294: \newcommand{\la}{\langle}
295: \newcommand{\ra}{\rangle}
296: 
297: % Dirac notation (keep local, avoid extra packages)
298: \newcommand{\ket}[1]{\lvert #1 \rangle}
299: \newcommand{\bra}[1]{\langle #1 \rvert}
300: \newcommand{\braket}[2]{\langle #1 \mid #2 \rangle}
301: \newcommand{\ketbra}[2]{\lvert #1 \rangle\!\langle #2 \rvert}
302: 
303: 
304: \newcommand{\Amelie}[1]{\textcolor{red}{$[\star$ Amelie: #1 $\star]$}}
305: 
306: 
307: \title{Surface Algebras, Surface Orders, Multiparameter Persistence, and Emergent Time/Gravity}
308: \author{Amelie Schreiber}
309: \date{Integrated expanded edition (standalone LaTeX)}
310: 
311: 
312: \title{Emergent Cyclic Time from Surface Orders and a Hilbert--P\'{o}lya Program for the Generalized Riemann Hypothesis}
313: \author{Amelie Schreiber}
314: \date{}
315: 
316: \makeatother
317: 
318: \begin{document}
319: 
320: 
321: \frontmatter
322: 
323: \begin{titlepage}
324: 	\centering
325: 	{\Large\bfseries Emergent Cyclic Time from Surface Orders\\[0.3em]
326: 	and a Hilbert--P\'{o}lya Program\\[0.3em]
327: 	for the Generalized Riemann Hypothesis\par}
328: 	\vspace{0.7em}
329: 	{\large\itshape A didactic, self-contained volume developing the algebraic, topological,\\
330: 	and operator-theoretic machinery needed to realize a concrete\\
331: 	Hilbert--P\'{o}lya strategy for Artin $L$-functions and GRH.\par}
332: 	\vfill
333: 	{\large Amelie Schreiber\par}
334: 	\vspace{0.8em}
335: \end{titlepage}
336: 
337: 
338: \begin{titlepage}
339: 	\centering
340: 	{\Large\bfseries Surface Algebras and Surface Orders III: Emergent Cyclic Time, Emergent Gravity, and Quantum Holographic Associative Memories from Multiparameter Persistence with Applications to Hilbert--P\'{o}lya for GRH\par}
341: 	\vspace{0.7em}
342: 	{\large\itshape Integrated expanded edition (standalone \LaTeX)\par}
343: 	\vspace{1.2em}
344: 	{\large\itshape A unified, rewritten, and didactic volume interleaving the v2 source text with\\
345: 		expanded development on surface algebras and surface orders, multiparameter persistence, holonomy-as-cyclic-time,\\
346: 		hyperbolic quotient geometry, emergent gravity modeling, and a Hilbert--Pólya program for GRH.\par}
347: 	\vfill
348: 	{\large Amelie Schreiber\par}
349: 	\vspace{0.8em}
350: \end{titlepage}
351: 
352: % --- v2 epigraph block ---
353: % The Hebrew environments (\begin{hebrew}...\end{hebrew}) and raw Hebrew Unicode
354: % text require polyglossia + a Unicode engine (XeLaTeX/LuaLaTeX).  They are
355: % conditionally compiled: skipped entirely under pdfLaTeX, shown in full under
356: % Unicode engines.  The English translation is shown in all builds.
357: \cleardoublepage
358: 
359: % Hebrew epigraph: compiled only under XeLaTeX / LuaLaTeX (polyglossia loaded).
360: % Under pdfLaTeX \ifPDFTeX is TRUE so the \else branch is never reached.
361: \ifPDFTeX
362:   % pdfLaTeX: Hebrew epigraph omitted; English translation follows.
363: \else
364:   \begin{hebrew}
365: 
366:     \begin{center}
367:       \textbf{הַיַּחַס}
368:     \end{center}
369: 
370:     בְּמַעְגַּל הַזְּמַן, הַמֶּרְחָק מִן־הַמֶּרְכָּז אֶל־הַהֶקֵּף מֻכְפָּל שֵׁשׁ פְּעָמִים, וְנִמְצָא הַהֶקֵּף שֵׁשׁ פְּעָמִים כְּמִדַּת הָרַדְיוּס; שֵׁשֶׁת יְמֵי הַמַּעֲשֶׂה הֵם פְּרִי הַמַּסָּע מִן־הַמֶּרְכָּז הַשָּׁלֵו שֶׁל־הַשָּׁבוּעַ אֶל־פְּנֵי הַתְּנוּעָה שֶׁלּוֹ. כִּי הַחַיִּים דָּבָר שִׁשָּׁה מְמַדִּים הֵם, כְּנֶגֶד שֵׁשׁ הַמִּדּוֹת הָאֱלֹהִיּוֹת (סְפִירוֹת) אֲשֶׁר הִשְׁפִּיעַ הַקָּדוֹשׁ־בָּרוּךְ־הוּא בִּבְרִיאָתוֹ. לְפִיכָךְ שֵׁשֶׁת יְמֵי בְּרֵאשִׁית הֵם, וְשַׁבָּת לֵב נִצְחִי לָהֶם; שֵׁשׁ רוּחוֹת לָעוֹלָם, וְנְקֻדָּה שֶׁאֵין־לָהּ שֶׁטַח מִמֶּנָּה הֵן נִמְשָׁכוֹת; שֵׁשׁ תְּנוּעוֹת עִקָּרִיּוֹת שֶׁבַּלֵּב—הִתְקָרְבוּת, הִסְתַּלְּקוּת, הַרְכָּבָה, תַּחֲרוּת, דְּבֵקוּת וְתִקְשֹׁרֶת—וְהַמִּדָּה הַשְּׁבִיעִית, מַלְכוּת (קַבָּלָה), שֶׁאֵין־לָהּ מִשֶּׁל עַצְמָהּ מְאוּמָה, וְהִיא נְקֻדַּת הַמּוֹקֵד וּמְבַצַּעַת כֻּלָּן. כָּל מְצִיאוּת הַהֲוָיָה מֻרְכֶּבֶת מֵאֵלּוּ שֵׁשׁ יְסוֹדוֹת, הַצּוֹבְעִים כָּל מַעֲשֶׂה וְכָל חֲוָיָה בְּשֵׁשֶׁת גּוֹנֵי הַמְּצִיאוּת.
371: 
372:     וְעוֹד חֹק בִּגְאוֹמֶטְרִיָּה שֶׁל מַעְגָּל: כְּכָל שֶׁהָרַדְיוּס גָּדוֹל יוֹתֵר, כֵּן הַהֶקֵּף גָּדוֹל יוֹתֵר. וְכֵן הוּא בְּמַעְגַּל הַזְּמַן: כְּכָל שֶׁאָנוּ מִתְרַחֲקִים מִן־הַמֶּרְכָּז הַנִּצְחִי שֶׁלּוֹ, כֵּן רַבָּה גַּשְׁמִיּוּת הַזְּמַן; כֵּן גּוֹבֶרֶת הַסְּעָרָה, וְכֵן הִיא בְּמַחֲלוֹקֶת עִם־הַשַּׁבָּת שֶׁבְּקִרְבָּהּ.
373: 
374:     אַךְ אַף עַל פִּי כֵן, כָּל־כַּמָּה שֶׁיְּהֵא הֶהֱמוֹן פְּנֵי־הַחַיִּים, אֵינוֹ נִפְרָד מִן־הַצִּיר הַשָּׁלֵו, שֶׁמִּמֶּנּוּ הוּא נִשְׁפָּע וְאֵלָיו הוּא נוֹטֶה. לְסוֹף דָּבָר, גַּם הַתְּקוּפוֹת הַסּוֹעֲרוֹת בְּיוֹתֵר שֶׁבְּחַיֵּינוּ מִתְחַיְּבוֹת מִתַּכְלִיתָן הָעַצְמִית וּמְשַׁמְּשׁוֹת לְסוֹף שָׁלוֹם וְהַרְמוֹנְיָה.
375: 
376:   \end{hebrew}
377: 
378:   \noindent\rule{\textwidth}{0.4pt}\par\medskip
379: 
380:   \begin{hebrew}
381:     קנה תורה, קנה דיעה לנפשך, ואל ירע לך אם רב מחירה,
382:     למען כי מאד מקחך לרב עלי מתן אשר תתן תמורה,
383:     והיא תעמוד לך בעת אשר איין כדי רב הונך כח לעזרה.
384:     \emph{יסוד היראה, שער התורה והחכמה י״ד}
385:   \end{hebrew}
386: 
387: \fi
388: 
389: % English translation (shown in all builds, including pdfLaTeX/arXiv):
390: Obtain knowledge for thyself, and regret not if its price be high; for thou hast
391: made the much better bargain in exchange for what thou hast given for it.
392: It will stand thee in good stead in the hour in which all the great substance
393: which thou possessest will be powerless to be retained.
394: (\textbf{Yesod HaYirah,}\emph{\ On the Law and Wisdom 14; trans.\ Hermann Gollancz, London 1919})
395: \vfill
396: 
397: 	%----------------------------------------------------------------------------------------
398: 
399: \tableofcontents
400: \mainmatter
401: 
\chapter*{Roadmap and synthesis (how to read and use the theory)} · lines 402–669
402: \chapter*{Roadmap and synthesis (how to read and use the theory)}
403: \addcontentsline{toc}{chapter}{Roadmap and synthesis (how to read and use the theory)}
404: % --------------------------------------------------------------------
405: % Roadmap and synthesis chapter (new in v4 woven edition)
406: % --------------------------------------------------------------------
407: 
408: \section*{What is being unified?}
409: 
410: This volume develops one compositional construction and follows it through to its mathematical and engineering consequences:
411: 
412: \begin{quote}
413: \emph{Surface algebras/orders provide a mathematically rigid ``local observable algebra'' on a surface.
414: Entanglement data on that surface induces (multi)scale correlation geometry.
415: Multiparameter persistence homology is the stable functor that turns that geometry into computable invariants.
416: Gluing of local orders encodes global holonomy, and (when promoted to operators) holonomy behaves like time.
417: In suitable limits, the same holonomy/entanglement data induces an emergent metric and an Einstein-like effective dynamics.}
418: \end{quote}
419: 
420: The claim has several subclaims, of distinct logical type:
421: \begin{itemize}
422: \item \textbf{Proved in this manuscript:} the surface-order constructions, the twisted-shift and positivity mechanisms, the self-adjoint finite approximants, the determinant-convergence machinery, and the arithmetic identification needed for the GRH family treated here.
423: \item \textbf{Engineered realizations of the proved core:} finite-dimensional transfer families, control unitaries, and hardware-level witness constructions implementing the same approximants.
424: \item \textbf{Application layer:} emergent-gravity, bioscience, and quantum-hardware consequences of the proved operator-theoretic core.
425: \end{itemize}
426: 
427: Readers interested only in the theorem-strength number-theoretic argument may therefore follow the manuscript through the Hilbert--Pólya, determinant-convergence, and arithmetic-closing chapters; the later hardware chapters should be read as implementations of the finite approximants rather than as substitutes for the proof itself.
428: 
429: \section*{The four layers and the three interfaces}
430: 
431: We keep the architecture explicit.
432: There are \emph{four} layers, and \emph{three} interfaces between them.
433: 
434: \begin{enumerate}
435: \item \textbf{Combinatorics/topology of embedded graphs:}
436: a dessin/embedded graph $\Gamma\subset \Sigma$ and its medial quiver $Q(\Gamma)$.
437: \item \textbf{Noncommutative algebra (surface algebras and surface orders):}
438: a path algebra with relations $kQ/I$ and, more rigidly, a surface order $\Lambda$ realized as a gluing of local hereditary orders.
439: \item \textbf{Multiparameter persistence topology:}
440: a bifiltration $(r,\lambda)\mapsto K_{r,\lambda}$ built from a weighted correlation graph and a geometric scale,
441: leading to bigraded $k[x,y]$-modules and computable invariants (rank invariants, Betti tables).
442: \item \textbf{Geometry/physics:}
443: a metric interpretation (hyperbolic/quasi-hyperbolic in the negative-curvature regime),
444: a holonomy interpretation of time (discrete evolution),
445: and an emergent-gravity interpretation in an Einstein limit.
446: \end{enumerate}
447: 
448: The interfaces are:
449: \begin{itemize}
450: \item \textbf{Interface A (graph $\to$ order):} from $\Gamma$ (and its cyclic orderings at vertices) to local vertex orders and to a global surface order $\Lambda$ ( Chapters~2--3, expanded in \S\ref{sec:twisted_shift} and \S\ref{ch:classification}).
451: \item \textbf{Interface B (state $\to$ filtration $\to$ invariants):} from a quantum state $|\psi\rangle$ on the vertex Hilbert spaces to a bifiltered complex and hence to a bigraded persistence module (expanded in \S\ref{ch:persistence}).
452: \item \textbf{Interface C (gluing $\to$ holonomy $\to$ time/metric):} from gluing cocycles of $\Lambda$ to holonomy classes; from holonomy spectra to time evolution and redshift; from entanglement and holonomy to effective metric dynamics (expanded in \S\ref{ch:gluing}, \S\ref{ch:hyperbolic}, \S\ref{ch:gravity}).
453: \end{itemize}
454: 
455: \section*{Key objects and notational conventions}
456: 
457: \paragraph{Surface and graph.}
458: $\Sigma$ denotes an oriented surface (topological or Riemann surface as needed).
459: $\Gamma\subset\Sigma$ is a finite embedded graph (a dessin in the Belyi setting, or a triangulation/fatgraph in the geometric setting).
460: We write $V(\Gamma)$ for vertices, $E(\Gamma)$ for edges, and $d_{\mathrm{comb}}$ for the shortest-path (combinatorial) metric on $\Gamma$.
461: 
462: \paragraph{Local rings and uniformizers.}
463: In the order-theoretic layer, $\pi$ denotes a \emph{uniformizer} of a discrete valuation ring (DVR) $R$. 
464: 
465: \paragraph{Local clocks and the twisted shift.}
466: A valence-$m$ vertex carries a local ``clock'' operator, the cyclic successor.
467: The pure (untwisted) shift on an $m$-dimensional local space is the permutation matrix
468: \[
469: S_m=\begin{pmatrix}
470: 0&0&\cdots&0&1\\
471: 1&0&\cdots&0&0\\
472: 0&1&\ddots&0&0\\
473: \vdots&\ddots&\ddots&\ddots&\vdots\\
474: 0&0&\cdots&1&0
475: \end{pmatrix},
476: \]
477: and the $\pi$--\emph{twisted} shift (Section~\ref{sec:twisted_shift}) is
478: \[
479: S_m(\pi)=\begin{pmatrix}
480: 0&0&\cdots&0&\pi\\
481: 1&0&\cdots&0&0\\
482: 0&1&\ddots&0&0\\
483: \vdots&\ddots&\ddots&\ddots&\vdots\\
484: 0&0&\cdots&1&0
485: \end{pmatrix},
486: \]
487: whose characteristic polynomial is $\lambda^m-\pi$ and which becomes diagonalizable after adjoining an $m$th root of $\pi$.
488: The smallest nontrivial example ($m=2$) is the basic two-state local clock used throughout the present construction.
489: 
490: \paragraph{Entanglement weights.}
491: Given a state $|\psi\rangle\in\bigotimes_{v\in V(\Gamma)}\cH_v$ we write $W_\psi(u,v)$ for a symmetric correlation weight on pairs of vertices.
492: A canonical choice is mutual information $I(u\!:\!v)$, but for noisy devices one often uses a Rényi-2 proxy ( \S12.6).
493: 
494: \paragraph{Parameters and units.}
495: We treat two filtration parameters:
496: \[
497: (r,\lambda)\in\RR_{\ge 0}\times\RR_{\ge 0},
498: \]
499: where $r$ has units of ``graph distance'' (dimensionless if edges have unit length), and $\lambda$ has units of entropy (nats or bits, depending on the entropy convention).
500: When translating to physics, time parameters enter via $T=e^{-iH\Delta t/\hbar}$ (Section~\ref{sec:hamiltonian_log}), so $\Delta t$ carries seconds and $H$ carries energy.
501: 
502: \section*{A dictionary across the layers}
503: 
504: The following table is the working dictionary used throughout the volume.
505: It is not merely analogical: each row corresponds to an explicit construction implemented somewhere in the text.
506: 
507: \begin{longtable}{p{0.22\textwidth}p{0.25\textwidth}p{0.25\textwidth}p{0.22\textwidth}}
508: \toprule
509: \textbf{Combinatorics} & \textbf{Algebra (orders)} & \textbf{Persistence topology} & \textbf{Geometry/physics}\\
510: \midrule
511: embedded graph $\Gamma\subset\Sigma$ &
512: local vertex orders $\Lambda_{m_v}(R_v)$, glued to $\Lambda$ &
513: metric $d_{\mathrm{comb}}$ and filtration scale $r$ &
514: coarse-grained spatial metric / adjacency geometry\\
515: \addlinespace
516: cyclic order at $v$ &
517: clock shift $S_{m_v}$ or twisted $S_{m_v}(\pi_v)$ &
518: holonomy violation functional $\Delta(r,\lambda)$ (Section~\ref{sec:toy2}) &
519: discrete time evolution / redshift via eigenphases\\
520: \addlinespace
521: faces / cycles in $\Gamma$ &
522: cycle products and holonomy constraints &
523: birth/death of $H_1$ classes across $(r,\lambda)$ &
524: curvature proxies and geodesic loops\\
525: \addlinespace
526: refinements / subdivisions &
527: Morita-equivalent refinements of $\Lambda$ &
528: interleavings and stability bounds &
529: RG flow / coarse-graining\\
530: \bottomrule
531: \end{longtable}
532: 
533: \section*{Where multiparameter persistence is doing the heavy lifting}
534: 
535: One-parameter persistence is powerful because barcodes are complete invariants (over a field) and are stable.
536: Two-parameter persistence is harder: there is no complete discrete barcode invariant.
537: The reason we use it anyway is that it cleanly matches the \emph{two distinct kinds of information} we must track:
538: \begin{enumerate}
539: \item \textbf{geometry/scale} (how far we look on $\Gamma$), and
540: \item \textbf{information strength} (how correlated a pair or region must be to count as ``present'').
541: \end{enumerate}
542: 
543: The bifiltration $K_{r,\lambda}$ in Section~\ref{sec:bifiltration_from_order} is therefore not a decorative choice:
544: it is the minimal stable object that keeps these two axes logically separate.
545: When we model the resulting module as a bigraded $k[x,y]$-module, commutative-algebra tools (Appendix~B) become available:
546: Betti numbers, determinantal loci, and stability of rank invariants.
547: 
548: \section*{How gluing becomes time holonomy}
549: \label{sec:time_holonomy}
550: 
551: The slogan ``time is holonomy'' becomes a precise mathematical statement when one chooses where holonomy lives.
552: In this program it lives in \v{C}ech cohomology with coefficients in an automorphism sheaf:
553: \[
554: [g]\in \check{H}^1(\Sigma;\Aut(\Lambda)).
555: \]
556: This class is measured by going around a loop $\gamma$ in $\Sigma$ and multiplying the transition maps $g_{ij}$ of the order along a cover refinement.
557: When the transition functions involve the clock shifts $S_{m_v}(\pi_v)$, the holonomy has a spectral content: eigenphases and valuation factors.
558: That spectral content is the candidate \emph{time dilation} mechanism: more twist (larger effective valuation/branching) means slower clock phase accumulation.
559: Section~\ref{sec:time_holonomy} (inside \S\ref{ch:gluing}) spells out the cocycle bookkeeping.
560: 
561: \section*{Hyperbolic quotients as the natural negative-curvature regime}
562: 
563: When entanglement weights produce graphs with effective negative curvature (expansion properties),
564: hyperbolic surfaces and their quotients become the correct large-scale model.
565: The reason is both geometric and arithmetic:
566: \begin{itemize}
567: \item geometric: large-girth, high-expansion graphs are well-approximated by quotients of trees, and trees are the discrete hyperbolic plane;
568: \item arithmetic: dessins and modular curves naturally arise as quotients of $\HH$ by Fuchsian groups, linking back to Belyi maps and surface algebras.
569: \end{itemize}
570: Section~\ref{sec:hyperbolic_plane} (inside \S\ref{ch:hyperbolic}) develops the quotient geometry needed to make this precise.
571: 
572: \section*{Emergent gravity: what is claimed and what must be proved}
573: 
574: The most ambitious interface is entanglement $\to$ metric $\to$ Einstein limit.
575: What the volume supplies is:
576: \begin{enumerate}
577: \item a concrete set of candidate discrete metrics (built from $W_\psi$ and from order holonomy spectra),
578: \item a set of candidate discrete curvature functionals compatible with gluing and refinement,
579: \item and the scaling limits in which one plausibly recovers an Einstein-like equation.
580: \end{enumerate}
581: Section~\ref{sec:einstein_limit} (inside \S\ref{ch:gravity}) is explicit about assumptions.
582: A realistic proof program would require: (i) quantitative control of coarse-graining, (ii) concentration of measure for the entanglement-derived weights, and (iii) a rigorous $\Gamma$-convergence statement for the discrete action to the Einstein--Hilbert functional.
583: 
584: \section*{A minimal ``engineering'' view of the Hilbert--Pólya program here}
585: 
586: \noindent\textbf{Terminology (ASCII spelling).}
587: For ease of plain-text search and cross-referencing across toolchains, we will sometimes also write \emph{Hilbert--Polya} (or \emph{Hilbert Polya}) to mean the same as \emph{Hilbert--P\'olya}.  No mathematical distinction is intended.
588: 
589: 
590: The Hilbert--Pólya goal is to realize (or approximate) the nontrivial zeros of $\zeta(s)$ as spectral data of a self-adjoint operator.
591: In this volume the operator is not guessed abstractly; it is built from two ingredients that already exist in the theory:
592: \begin{itemize}
593: \item \textbf{hyperbolic/Laplacian structure} from quotient geometry (Section~\ref{ch:hyperbolic}), and
594: \item \textbf{clock/holonomy structure} from surface orders (Section~\ref{ch:gluing} and Section~\ref{sec:hamiltonian_log}).
595: \end{itemize}
596: 
597: Section~\ref{ch:hilbertpolya} turns this into a concrete multi-stage program:
598: pick an arithmetic surface, define a clock-twisted operator family, and match trace data to an explicit formula.
599: The key point is to be explicit about failure modes (continuous spectrum on cusps, branch cut choices in logarithms, positivity constraints),
600: so that the program is falsifiable at intermediate milestones rather than being an all-or-nothing dream.
601: \section*{Verification criteria and diagnostic failure modes}
602: 
603: Because several layers are glued, there are multiple distinct ways the theory can fail \emph{without} the whole program being worthless.
604: This is a feature: the program decomposes into checkable subclaims.
605: 
606: \subsection*{(i) Order-theoretic / representation-theoretic checks}
607: \begin{itemize}
608: \item \textbf{Local type check:} each vertex stalk should be a hereditary order of the intended type (e.g.\ $\Lambda_m(R)$), and the chosen shift/twist operator should act by an automorphism of the stalk. In practice: verify the explicit matrix action preserves the defining lattice chain.
609: \item \textbf{Gluing check:} the transition maps $g_{ij}$ must satisfy the cocycle condition on triple overlaps, at least up to inner automorphism if one works in a stacky formulation.
610: \item \textbf{Morita invariance check:} computed invariants that are claimed to depend only on the surface order (and not on a chosen presentation) should be stable under elementary refinements of the embedded graph (edge subdivision, Whitehead moves). This is the algebraic analogue of triangulation-independence.
611: \end{itemize}
612: 
613: \subsection*{(ii) Persistence pipeline checks}
614: \begin{itemize}
615: \item \textbf{Stability check:} small perturbations of weights $W_\psi$ (sampling noise) should lead to small perturbations of the rank invariant and of sampled slices. Concretely: estimate Lipschitz constants of your chosen weight-to-filtration map and compare to empirical bootstrap variability.
616: \item \textbf{Degeneracy check:} if many edges share the same weight, the filtration has large ``jumps'' and discretization artifacts.
617: Add a controlled jitter or use a quantile filtration to avoid spurious multiplicities.
618: \item \textbf{Sanity check:} on synthetic states with known structure (product states, GHZ, random Clifford, area-law tensor networks), verify the expected barcode phenomenology:
619: no long $H_1$ bars for product states; persistent long bars on toric-code-like states; volume-law signatures on Haar-random-like states.
620: \end{itemize}
621: 
622: \subsection*{(iii) Metric/emergent-geometry checks}
623: \begin{itemize}
624: \item \textbf{Metric axioms:} if a distance is claimed, verify symmetry and the triangle inequality (or quantify the defect).
625: Many entanglement-derived quantities are only \emph{quasi}-metrics; treat the defect as an observable rather than as an embarrassment.
626: \item \textbf{Curvature proxies:} when negative curvature is claimed, verify it by independent graph diagnostics (Gromov $\delta$-hyperbolicity, thin triangles, expansion).
627: This protects against over-interpreting a visually ``hyperbolic'' embedding.
628: \item \textbf{Einstein limit:} the strongest claim is a scaling limit where a discrete functional converges to Einstein--Hilbert.
629: A practical surrogate is to test whether the discrete Euler--Lagrange equations reproduce the correct linearized graviton propagator in a perturbative regime.
630: \end{itemize}
631: 
632: \subsection*{(iv) Hardware checks (NISQ and early fault-tolerant)}
633: \begin{itemize}
634: \item \textbf{Measurement budget:} mutual information estimation is measurement-intensive.
635: Prefer Rényi-2 or randomized measurement protocols when device constraints dominate ( Chapter~12 and expanded Section~\ref{ch:expts}).
636: \item \textbf{Depth constraints:} use shallow circuits (Clifford+few non-Cliffords) for preparing test states and for probing clock holonomy; push deep circuits only on error-corrected logical qubits.
637: \item \textbf{Error mitigation:} incorporate readout mitigation and symmetry verification at the level of the filtration weights, so that the downstream persistence module sees de-biased weights.
638: \end{itemize}
639: 
640: \section*{A minimal end-to-end computational pipeline (implementation sketch)}
641: 
642: The following is a concrete ``engineering'' view of the full stack.
643: It is not the only pipeline, but it is the simplest one that respects all three interfaces A--C.
644: 
645: \begin{algorithm}[H]
646: \caption{Surface-order $\to$ entanglement weights $\to$ 2-parameter persistence}
647: \begin{algorithmic}[1]
648: \State \textbf{Input:} embedded graph $\Gamma\subset\Sigma$ with cyclic orders; chosen local types $(m_v,\pi_v)$
649: \State Build medial quiver $Q(\Gamma)$ and local vertex orders $\Lambda_{m_v}(R_v)$
650: \State Choose gluing cocycle $[g]\in \check{H}^1(\Sigma;\Aut(\Lambda))$ (or infer it from data)
651: \State Prepare a family of states $|\psi(\theta)\rangle$ on $\bigotimes_{v}\cH_v$ (simulated or hardware)
652: \For{each parameter setting $\theta$}
653:   \State Estimate weights $W_\psi(u,v)$ (mutual information or proxy)
654:   \State Build bifiltration $(r,\lambda)\mapsto K_{r,\lambda}$ (Section~\ref{sec:bifiltration_from_order})
655:   \State Compute sampled rank invariant / Betti tables for the associated $k[x,y]$-module
656:   \State Record summary statistics: persistent $H_1$ mass, slice barcodes, stability under bootstrap
657: \EndFor
658: \State \textbf{Output:} persistence signatures indexed by $\theta$ and by holonomy class $[g]$
659: \end{algorithmic}
660: \end{algorithm}
661: 
662: For the Hilbert--Pólya-facing program, the same pipeline is augmented by:
663: \begin{enumerate}
664: \item selecting an arithmetic hyperbolic quotient $\HH/\Gamma$,
665: \item defining a clock-twisted operator family $H(\theta)$,
666: \item and comparing spectral summaries (trace-like statistics) to number-theoretic predictions (Section~\ref{ch:hilbertpolya}).
667: \end{enumerate}
668: \clearpage
669: 
\chapter{Introduction} % The asterisk leaves out this chapter from the table of contents · lines 670–682
670: \chapter{Introduction} % The asterisk leaves out this chapter from the table of contents
671: 	This is an introduction to \textbf{surface algebras}, a class of (often infinite dimensional) associative algebras, arising naturally from the medial quiver of a graph that has been cellularly embedded into a Riemann surface.
672: 
673: 	\textit{Surface algebras} are a class of infinite dimensional \textit{gentle algebras}, which provide a link between many classes of \textit{special biserial algebras}, as well as the \textit{skew-gentle} and \textit{clannish} algebras. They are introduced in C. M. Ringel's Shanghai Lectures \index{R1} as \textit{complete gentle algebras}, and are used in \cite{CCKW1} to study the invariant theory of special biserial algebras. The first examples of such algebras go back to G'elfand and Ponomarev's work "Indecomposable Representations of the Lorentz Groups," and subsequently Ringel's "Indecomposable Representations of the Dihedral $2$-Group". They occur implicitly in many places, but seem to have almost no explicit published material written about them as a whole, and there are no references which presents them as "surface algebras" per se, although constructing algebras from quivers on surface triangulations is currently quite popular among those working on \textit{cluster algebras}, and was implicit in the Shanghai Lectures. All current constructions of algebras from triangulated surfaces seem to be modifications of the construction provided here, so it is likely many are using these ideas without explicitly stating them. It is my hope that what follows will open the door for others to study \textit{surface algebras}, especially those who are newcomers to quivers and their representations and wish to apply them to other areas. 
674: 	%----------------------------------------------------------------------------------------
675: 	
676: 	\begin{fullwidth}
677: 		\part{Combinatorics and Compact Gentle Surface Algebras}
678: 	\end{fullwidth}
679: 	%----------------------------------------------------------------------------------------
680: 	%	CHAPTER 1
681: 	%----------------------------------------------------------------------------------------
682: 	
\chapter{Graphs, Quivers, and Combinatorial Topology} · lines 683–1029
683: 	\chapter{Graphs, Quivers, and Combinatorial Topology}
684: 	\label{ch:1}
685: 	
686: 	%------------------------------------------------
687: 	
688: 	\section{Graphs, Quivers, Combinatorial Maps, and Constellations}
689: 	
690: 	\begin{fullwidth}
691: 		We begin by introducing the notation and basic terminology needed from combinatorial topology that we will need throughout. Much of the material throughout can be conveniently and simply phrased in terms of some basic notions from combinatorial topology for (possibly directed) graphs, and two dimensional surfaces given as a CW-complex. Many of the results and statements are then able to be illustrated by very concrete examples which can be calculated by hand and are conveniently encoded in the usual pictures seen in an introductory combinatorial topology with polygon presentations of surfaces. The intent is to set up most if not all of the representation theory in this language so that the prerequisites are minimal beyond a basic course in algebraic topology, and an understanding of rings and modules. In particular, the material from \cite{Kozlov} and \cite{Dummit} should be more than sufficient preparation. 
692: 	\end{fullwidth}
693: 	
694: 	\subsection{Graphs and Quivers}
695: 	We will define a \textbf{graph} $G$ to be a set $V$ of \textbf{vertices}, a set $E$ of \textbf{edges}, and an \textbf{incidence map} $\partial:E \to V \times V$, sending an edge $e$ to its two (possibly equal) incident vertices $\partial e = \{\partial_1 e, \partial_2 e\} = \{v, w\}$. We define a \textbf{directed graph} or a \textbf{quiver} to be a graph with \textit{vertices} $Q_0$, \textit{arrows} $Q_1$, and incidence map $\partial a = \{\partial_1 a, \partial_2 a\} = \{ta, ha\}$ which gives an \textit{ordered} set $ta < ha$, with $ta$ the \textit{tail} of the arrow $a$, and $ha$ the \textit{head} of the arrow $a$. \\
696: 	We will define a \textbf{graph map} $\theta: G \to G'$, where $G = (V, E)$ and $G' = (V',E')$ to be a set map on vertices, $\theta_0:V \to V'$, and edges $\theta_1:E \to E'$ are mapped according to the following diagram for every edge $e \in E$ such that $\partial e = \{v,w\}$, 
697: 	\[
698: 	\xymatrix{
699: 		v \ar[dd]_{\theta_0} \ar@{-}[rr]^e && w \ar[dd]^{\theta_0} \\
700: 		&& \\
701: 		\theta_0(v) \ar@{-}[rr]_{\theta_1(e)} && \theta_0(w)
702: 	}
703: 	\]
704: 	In other words, we say graph maps \textit{"preserve adjacency"}. Similarly, if we have a quiver $Q = (Q_0, Q_1)$, a \textbf{quiver map} will be one which not only preserves adjacency but also the order of the incidence map, as in the following diagram, 
705: 	\[
706: 	\xymatrix{
707: 		v=ta \ar[dd]_{\theta_0} \ar[rr]^a && w=ha \ar[dd]^{\theta_0} \\
708: 		&& \\
709: 		\theta_0(v)=t(\theta_1 a) \ar[rr]_{\theta_1(a)} && \theta_0(w)=h(\theta_1 a)
710: 	}
711: 	\]
712: 	We will only work with \textbf{locally finite} graphs (resp. quivers), i.e. there will be countably many vertices and edges (resp. arrows), and between any two vertices there will be finitely many edges (resp. arrows). 
713: 	
714: 	\subsection{Combinatorial Maps and Constellations}
715: 	Let $S_n$ be the symmetric group on $[n] = \{1,2,3...,n\}$. Permutations will act on the left, so if $\sigma \in S_n$, we will say $\sigma \cdot i = \sigma(i)$. For example, for $\sigma = (1,3,2) \in S_3$ we have
716: 	\[ \sigma(1) = 3, \quad \sigma(2) = 1, \quad \sigma(3) = 2.\]
717: 	We will define a $k$-\textbf{constellation} to be a sequence $C=[g_1, g_2, ..., g_k]$, $g_i \in S_n$, such that:
718: 	\begin{enumerate}
719: 		\item The group $G = \la g_1, g_2, ..., g_k \ra$ generated by the $g_i$ acts \textit{transitively} on $[n]$. 
720: 		\item The product $\prod_i^k g_i = \id$ is the identity. 
721: 	\end{enumerate}
722: 	The constellation $C$ has "\textbf{degree} $n$" in this case, and "\textbf{length} $k$". Our main interest will be in $3$-constellations $C = [\sigma, \alpha, \phi]$, which we will describe in detail momentarily. The group $G = \la g_1, g_2, ..., g_k \ra$ will be called the \textbf{cartographic group} or the \textbf{monodromy group} generated by $C$. 
723: 	
724: 	
725: 	\section{Combinatorial Maps as CW-Complexes}
726: 	There is a correspondence between $3$-constellations $C = [\sigma, \alpha, \phi]$ such that $\alpha$ is a fixed-point-free involution, and graphs which are cellularly embedded in a closed Riemann surface.  To ensure each edge is paired exactly once (one half-edge at each endpoint), the involution $\alpha$ must have no fixed points. In particular, such constellations give a CW-complex structure on the surface $\Sigma$. 
727: 	
728: 	
729: 	\subsection{The Clockwise Cyclic Vertex Order Construction}
730: 	There are many equivalent ways of defining a graph on a Riemann surface. One of the simplest and probably the most combinatorial ways is by constellations. There are at least two ways of viewing this construction. We present two here, which are in some sense dual to one another. Intuitively, we follow the recipe:
731: 	
732: 	\begin{enumerate}
733: 		\item First choose some positive integer $r \in \NN$ to be the number of \emph{vertices} 
734: 		of the graph, say $\Gamma_0 = \{x_1, x_2, ..., x_r\}$. 
735: 		\item Then, to each vertex $x_i$, we choose some number $k_i$, of \emph{"half edges"} to attach to it, with the rule that once we have chosen $k_i$ for each $x_i$, the sum $\sum_{i=1}^r 
736: 		k_i = 2n$, must be some positive even integer. 
737: 		\item We then choose a \emph{clockwise cyclic ordering} of the \textit{"half-edges"} around 
738: 		each vertex $x_i$, i.e. some cyclic permutation $\sigma_i$ of $[k_i] = \{1, 2, ..., k_i\}$ for each $x_i$. The 
739: 		cyclic permutations $\sigma_i$ must all be disjoint from one another, and together they form a permutation of $[2n]$.
740: 		\item Once such a \emph{cyclic ordering} is chosen, we then define a \emph{gluing} of all of the \emph{"half edges"}. In particular, we choose some fixed-point free involution on the collection of all half edges, which is a permutation in $S_{2n}$ given by $|\Gamma_1|$ many $2$-cycles. This defines $\alpha$. 
741: 	\end{enumerate}
742: 	
743: 	We then have the usual \textbf{Euler formula}, 
744: 	\[ |\sigma|-|\alpha|+|\phi| = V-E+F = \chi(\Sigma).\]
745: 	Said a slightly different way, we define a pair $[\sigma, \alpha]$, where $\sigma, \alpha \in S_{2n}$. The permutation
746: 	\[ \sigma = \sigma_1\sigma_2 \cdots \sigma_r \] is a collection of cyclic permutations, one $\sigma_i$ for each 
747: 	vertex $x_i$ of our graph $\Gamma = (\Gamma_0, \Gamma_1)$. So, perhaps in better notation, each 
748: 	\[ \sigma_x = (e(x)_1, e(x)_2, ...., e(x)_{k(x)}),\]
749: 	can be thought of as giving a cyclic ordering of the \textbf{half edges}\sidenote{We will use the notation $\Gamma_1(x)$ to denote the \textit{"half-edges"} around the vertex $x \in \Gamma_0$. The term \textit{"half-edges"} is a commonly used term in the literature on combinatorial maps, and is a nice conceptual way of remembering the formalities of the construction of a graph cellularly embedded into a surface.},
750: 	\[ \Gamma_1(x) = \{e(x)_1, e(x)_2, ..., e(x)_{k(x)}\},\] attached to each vertex $x \in \Gamma_0$ in our graph. The cycles $\sigma_x$ are all necessarily disjoint. Then we define how to glue pairs of 
751: 	\emph{half edges}, in order to get a connected graph $\Gamma$, via the permutation $\alpha$. The permutation $\alpha$ is 
752: 	the form \sidenote{Here we view \[ \alpha : \Gamma_1 \to \amalg_{x \in \Gamma_0} \Gamma_1(x) \] as a map from the edges $\Gamma_1$, to the \textit{half-edges} 
753: 		$\amalg_{x \in \Gamma_0} \Gamma_1(x)$. So $\alpha(e) = (e(x)_p, e(y)_q)$.},
754: 	\begin{align*}
755: 		\alpha &= \alpha^1 \alpha^2 \cdots \alpha^t \\
756: 		&= (\alpha_1, \alpha_2)(\alpha_3, \alpha_4) \cdots (\alpha_{2n-1}, \alpha_{2n}) \\
757: 		&= \prod_{e \in \Gamma_1} \alpha(e)
758: 	\end{align*}
759: 	and each $(\alpha_i, \alpha_{i+1})$ tells us to glue the two corresponding \emph{half-edges}. Let us illustrate this by a 
760: 	simple example. 
761: 	
762: 	As a permutation on the set of all \emph{half edges},
763: 	\[ \Gamma_1(x) \amalg \Gamma_1(y)  = \{e(x)_1, e(x)_2, e(x)_3, e(y)_1, e(y)_2, e(y)_3\},\] around two vertices $\Gamma_0 = \{x,y\}$ 
764: 	we may identify $\sigma, \alpha \in \mathbf{Perm}(E_x \amalg E_y)$ with permutations in $S_6$. Namely, let us define the identification
765: 	\begin{align*}
766: 		\sigma &= \sigma_x \sigma_y \\
767: 		&= (e(x)_1, e(x)_2, e(x)_3)\cdot (e(y)_1, e(y)_2, e(y)_3) \leftrightarrow (1,2,3)(4,5,6) \in S_6
768: 	\end{align*}
769: 	and let 
770: 	\[ \alpha = (e(x)_1, e(y)_1)(e(x)_2, e(y)_2)(e(x)_3, e(y)_3) \leftrightarrow (1,4)(2,5)(3,6) \in S_6.
771: 	\] 
772: 	Then under this identification, the graph with
773: 	\begin{itemize}
774: 		\item two vertices $\Gamma_0 = \{x,y\} \leftrightarrow \{\sigma_x, \sigma_y\} = \{(1,2,3), (4,5,6)\}$, 
775: 		\item and six half edges \[ \Gamma_1(x) \amalg \Gamma_1(y)  \leftrightarrow \{1,2,3\} \amalg \{4,5,6\}.\] 
776: 	\end{itemize}
777: 	\bigskip 
778: 	
779: 	may be represented by the following picture to help visualize this, 
780: 	\bigskip 
781: 	
782: 	\begin{tikzcd}[column sep=.1in,row sep=.3in]
783: 		&  & {\sigma = (1,2,3)(4,5,6)} &  & {\alpha = (1,4)(2,5)(3,6)} &  &  \\
784: 		&  &  &  &  &  &  \\
785: 		&  &  &  &  &  &  \\
786: 		& \ \arrow[d, "1"', no head, bend right] \arrow[rrr, "{(1,4)}", no head, dashed, bend left=49] &  &  & \ &  & \ \\
787: 		& {(1,2,3)} \arrow[rd, "3", no head, bend left] \arrow[ld, "2", no head, bend right] &  & {(2,5)} \arrow[rrru, no head, dashed, bend left=49] &  & {(4,5,6)} \arrow[lu, "6", no head, bend left] \arrow[d, "4", no head, bend left] \arrow[ru, "5", no head, bend right] &  \\
788: 		\ \arrow[rrru, no head, dashed, bend right=49] &  & \ \arrow[rrr, "{(3,6)}", no head, dashed, bend right=49] &  &  & \ & 
789: 	\end{tikzcd}
790: 	
791: 	\newpage
792: 	
793: 	It may be prudent to have more of the notation gathered into one place to refer back to later. 
794: 	
795: 	\begin{table} % Add the following just after the closing bracket on this line to specify a position for the table on the page: [h], [t], [b] or [p] - these mean: here, top, bottom and on a separate page, respectively
796: 		\centering % Centers the table on the page, comment out to left-justify
797: 		\begin{tabular}{l c c c c c} % The final bracket specifies the number of columns in the table along with left and right borders which are specified using vertical bars (|); each column can be left, right or center-justified using l, r or c. To specify a precise width, use p{width}, e.g. p{5cm}
798: 			%\toprule \\ % Top horizontal line
799: 			%& \multicolumn{5}{c}{Constellations as CW-Complexes}  \\ % Amalgamating several columns into one cell is done using the \multicolumn command as seen on this line
800: 			\midrule % Horizontal line spanning less than the full width of the table - you can add (r) or (l) just before the opening curly bracket to shorten the rule on the left or right side
801: 			Notation & Meaning  \\ % Column names row
802: 			\midrule % In-table horizontal line
803: 			$\Gamma \hookrightarrow \Sigma$ & cellularly embedded graph \\ % Content row 1
804: 			$\Sigma$ & a Riemann surface, generally closed \\ % Content row 2
805: 			$\Gamma_0$ & the vertex set of a graph $\Gamma$ \\ % Content row 3
806: 			$\Gamma_1$ & the edge set of a graph $\Gamma$ \\ % Content row 4
807: 			$\Gamma_1(x)$ & the \textit{half-edges} around a vertex \\ % Content row 5
808: 			$e(x)_i$ & a \textit{half-edge} in $\Gamma_1(x)$ attached to $x \in \Gamma_0$ \\ % Content row 6
809: 			$\partial e = \{\partial_1 e, \partial_2 e\}$ & the vertices adjacent to $e \in \Gamma_1$ \\ % Content row 7
810: 			$\alpha^k = (\alpha_i, \alpha_{i+1})$ & a $2$-cycle of $\alpha$ \\ % Content row 8
811: 			$(\alpha_i, \alpha_{i+1}) = (e(x)_p, e(y)_q)$ & glued \textit{half-edges} $e(x)_p$ and $e(y)_q$ \\ % Content row 9
812: 			$\alpha(e) = (e(x)_p, e(y)_q)$ & $\alpha$ as a map $\Gamma_1 \to \amalg_{x \in \Gamma_0}\Gamma_1(x)$ \\ % Content row 10
813: 			\midrule % In-table horizontal line
814: 			%\midrule % In-table horizontal line
815: 			\bottomrule % Bottom horizontal line
816: 		\end{tabular}
817: 		\caption{There are now a mildly disturbing amount of notations for describing a $2$-cycle \[ \alpha^k = (\alpha_i, \alpha_{i+1}) = (e(x)_p, e(y)_q).\] It indicates a gluing of two \textit{"half-edges"}, and so represents a single edge in $\Gamma_1$ It can also be thought of as a component of the map \[ \alpha: \Gamma_1 \to \amalg_{x \in \Gamma_0}\Gamma_1(x),\] identifying the edge $e$, with its two half-edges $\alpha(e) = (e(x)_p, e(y)_q)$.} % Table caption, can be commented out if no caption is required
818: 		\label{tab:template_alt} % A label for referencing this table elsewhere, references are used in text as \ref{label}
819: 	\end{table}
820: 	
821: 	%\newpage
822: 	
823: 	\subsection{The Polygon Construction}
824: 	It is important at this point to make a few comments. Not every graph is planar, i.e. there may be no embedding on the sphere $S^2 = \PP^1$ without edge crossings. To see a second way this plays out with constellations, we now turn to the dual construction on faces. In the last section, the permutation $\phi = \alpha \sigma^{-1}$, defining the constellation $C = [\sigma, \alpha, \phi]$\sidenote{Recall: $3$ constellations $C=[\sigma, \alpha, \phi]$ giving a graph cellularly embedded into a Riemann surface, must be defined by permutations $\sigma, \alpha, \phi \in S_{2n}$ such that $\sigma \alpha \phi = \id$, the permutation $\alpha$ is a fixed-point free involution, and the \textit{cartographic group} $G = \la \sigma, \alpha, \phi \ra = \la \sigma, \alpha \ra$ acts transitively on $[2n] = \{1, 2, ..., 2n-1, 2n\}$.}, were quite neglected in the construction. This is partially because they are not strictly needed since $\sigma \alpha \phi = \id \implies \alpha \sigma^{-1} = \phi$. 
825: 	
826: 	Perhaps more importantly though, the previous construction focused on \textit{"cyclic orderings"} of the \textit{half edges} around each vertex, and gluings of those half edges to obtain a connected graph $\Gamma$. There is another way of constructing cellular embeddings which comes from polygon presentations of surfaces. This is likely more familiar to the reader, and therefore more intuitive. The question might be asked, "why not just use this more typical example." One answer would be, the former construction is actually quite standard in the literature on combinatorial maps. A better answer however is, the combinatorics and the notation involved in the previous (clockwise) \textit{"cyclic vertex ordering"} construction is much more convenient for later constructions involving \textit{medial quivers}, \textit{surface algebras}, and the representation theory that follows. It will be useful, and sometimes more intuitive to have this second construction though. Let us begin with the following recipe:
827: 	
828: 	\begin{enumerate}
829: 		\item Write $\phi$ as a product of disjoint cycles $\phi_1 \phi_2 \cdot \phi_p$
830: 		\item To each cycle $\phi_i$ of length $m_i$ we associate a $m_i$-gon, oriented \textit{counterclockwise}. 
831: 		\item Then we glue the sides of each polygon according to $\alpha$ so that the sides which are glued have opposite orientation. 
832: 		\item From this gluing we obtain a cyclic order of edges $\sigma = \phi^{-1}\alpha$ around each vertex.\sidenote{Note: $\alpha = \alpha^{-1}$ since it is required to be an involution. Also, the vertices with cyclic orderings are the corners of the polygons after gluing.}
833: 	\end{enumerate}
834: 	
835: 	Let us once again illustrate by example. Take $C = [\sigma, \alpha, \phi]$ from the previous construction where 
836: 	\[ \sigma = \sigma_x \sigma_y = (1,2,3)(4,5,6), \quad \alpha = \alpha^1\alpha^2\alpha^3 = (1,4)(2,5)(3,6).\]
837: 	This implies $\phi = (162435)$. This is represented by a counterclockwise oriented hexagon:
838: 	
839: 	\begin{tikzpicture}
840: 		[thick
841: 		,decoration =
842: 		{markings
843: 			,mark=at position 0.5 with {\arrow{stealth'}}
844: 		}
845: 		]
846: 		\newdimen\hexR
847: 		\hexR=2.7cm
848: 		\node {$\star$};
849: 		\draw[-stealth'] (-150:{0.7*\hexR}) arc (-150:150:{0.7*\hexR});
850: 		\foreach \x/\l in
851: 		{ 60/f,
852: 			120/a,
853: 			180/b,
854: 			240/c,
855: 			300/d,
856: 			360/e
857: 		}
858: 		\draw[postaction={decorate}] ({\x-60}:\hexR) -- node[auto,swap]{\l} (\x:\hexR);
859: 		\foreach \x/\l/\p in
860: 		{ 60/{x}/above,
861: 			120/{y}/above,
862: 			180/{x}/left,
863: 			240/{y}/below,
864: 			300/{x}/below,
865: 			360/{y}/right
866: 		}
867: 		\node[inner sep=2pt,circle,draw,fill,label={\p:\l}] at (\x:\hexR) {};
868: 	\end{tikzpicture}
869: 	
870: 	The \textit{"word"} associated to the polygon given by $\phi$ in most standard texts containing material on polygon presentations of surfaces is 
871: 	\[ abcdef \leftrightarrow (162435). \]
872: 	The gluing $\alpha = (1,4)(2,5)(3,6)$, then says we must glue the faces:
873: 	\[ a \leftrightarrow d, \quad b \leftrightarrow e, \quad c \leftrightarrow f.\]
874: 	Care must be taken to glue sides so that their orientations "appose" one another so that the surface obtained is \textit{oriented} according to the \textit{counterclockwise} oriented face. The cellularly embedded graph that we obtain lives on a torus $\TT^2$. We can determine this purely via the combinatorics by computing
875: 	\[ \chi(\Sigma) = |phi| - |\alpha| + |\sigma| = |\phi|-|\Gamma_1|+|\Gamma_0|= 1-3+2 = 0,\]
876: 	and since $\chi(\Sigma) = 2g(\Sigma)-2$ we have that the genus of $\Sigma$ is $g = 1$. 
877: 	
878: 	\noindent
879: 	%\includegraphics[
880: 	%page=1,
881: 	%width=280pt,
882: 	%height=280pt,
883: 	%keepaspectratio
884: 	%]{torus1.pdf}
885: 	\vfill
886: 	
887: 	
888: 	
889: 	\section{Medial Quivers of Combinatorial Maps and Constellations}
890: 	There is a very natural way of associating a cellularly embedded graph to a quiver, and a quiver to a cellularly embedded graph. In particular, we can define a bijection of such objects. The way we do this is by choosing the quiver to be the directed medial graph of the cellularly embedded graph. In particular, for each face $\phi_j$ of $C=[\sigma, \alpha, \phi]$, we place a vertex on the interior of each edge of the boundary of $\phi_j$. We then connect the vertices counter-clockwise with arrows. This forms the \textbf{medial quiver} of the constellation, or equivalently of the cellularly embedded graph.\\
891: 	\
892: 	\\
893: 	\
894: 	\\
895: 	
896: 	\begin{ex}
897: 		\noindent
898: 		%\includegraphics[
899: 		%page=1,
900: 		%width=200pt,
901: 		%height=200pt,
902: 		%keepaspectratio
903: 		%]{TorusTriangulation1.pdf}
904: 		\\
905: 		\
906: 		\\
907: 		\
908: 		\\
909: 		As an example, we have the medial quiver for a triangulation of a torus given by the constellation
910: 		\[ \phi = (1,2,3)(4,5,6)(7,8,9)(10,11,12), \quad \alpha = (1,5)(2,12)(3,4)(6,7)(8,10)(9,11 ). \]
911: 		It has face cycles given by $\phi = \phi_1 \phi_2 \phi_3 \phi_4$, and the gluing $\alpha$ identifies the top edges and bottom edges, as well as the left and right side edges, in the typical way. 
912: 	\end{ex}
913: 
914: % ============================================================
915: % Expanded edition insertion: corrected sphere dessin example
916: % ============================================================
917: 
918: \section{Corrigendum: the clean sphere dessin for the double \texorpdfstring{$3$}{3}--cycle}
919: \label{sec:corrigendum_sphere}
920: 
921: The  volume informally discusses the simplest ``double $3$--cycle'' situation on the sphere.
922: The intended picture is the following clean dessin:
923: 
924: \begin{itemize}
925: \item the underlying surface is $\Sigma=S^2$;
926: \item there are two vertices, placed at the north and south poles;
927: \item there are three disjoint edges connecting north to south (think of three meridians equally spaced around the sphere);
928: \item the equator separates the two complementary faces; each face has boundary consisting of the three edges, and inherits an orientation from $\Sigma$.
929: \end{itemize}
930: 
931: \begin{figure}[h]
932: \centering
933: \begin{tikzpicture}[scale=1.1]
934:   % Sphere outline as a circle
935:   \draw[thick] (0,0) circle (2);
936:   % Equator
937:   \draw[dashed] (-2,0) arc (180:360:2 and 0.6);
938:   \draw[thick] (2,0) arc (0:180:2 and 0.6);
939:   % Poles
940:   \fill (0,2) circle (2pt) node[above] {$N$};
941:   \fill (0,-2) circle (2pt) node[below] {$S$};
942: 
943:   % Three "meridian" edges: straight, left, right
944:   \draw[thick] (0,2) -- (0,-2);
945:   \draw[thick] (-0.9,1.8) .. controls (-1.6,0.7) and (-1.6,-0.7) .. (-0.9,-1.8);
946:   \draw[thick] (0.9,1.8) .. controls (1.6,0.7) and (1.6,-0.7) .. (0.9,-1.8);
947: 
948:   % Indicate orientation around equator with arrows
949:   \draw[-{Stealth[length=2.4mm]}] (1.2,0.55) arc (20:80:1.2 and 0.35);
950:   \draw[-{Stealth[length=2.4mm]}] (-1.2,-0.55) arc (200:260:1.2 and 0.35);
951: 
952:   \node at (0,0.95) {\small upper face};
953:   \node at (0,-0.95) {\small lower face};
954: \end{tikzpicture}
955: \caption{Correct dessin on $S^2$ for the ``double $3$--cycle'': two vertices $N,S$ joined by three edges; the two faces induce opposite cyclic orientations on the boundary.}
956: \label{fig:sphere_dessin}
957: \end{figure}
958: 
959: \subsection{The directed medial quiver and the two opposite $3$--cycles}
960: 
961: We fix the standard convention (also used in the source text in Appendix~B of v2): the \emph{directed medial quiver} places a vertex on each edge of the embedded graph, and for each face connects these medial vertices by arrows going counterclockwise around that face.
962: 
963: For the dessin of Figure~\ref{fig:sphere_dessin}, label the three edges $e_1,e_2,e_3$ in cyclic order around the equator.
964: Let the medial vertices be $v_i$ sitting on $e_i$.
965: Then:
966: \begin{itemize}
967: \item the \emph{upper} face contributes a $3$--cycle
968: \[
969: v_1 \xrightarrow{a_1} v_2 \xrightarrow{a_2} v_3 \xrightarrow{a_3} v_1
970: \quad\text{(counterclockwise as seen from outside the sphere),}
971: \]
972: \item the \emph{lower} face contributes the \emph{opposite} $3$--cycle
973: \[
974: v_1 \xrightarrow{b_1} v_3 \xrightarrow{b_2} v_2 \xrightarrow{b_3} v_1
975: \quad\text{(counterclockwise on the lower face, hence clockwise on the equator).}
976: \]
977: \end{itemize}
978: 
979: This is the intended ``double cycle'': two oriented $3$--cycles on the same vertex set, with opposite cyclic order.
980: 
981: \subsection{Relations from switching orientation}
982: \label{sec:relations_switch}
983: 
984: The surface-algebra / gentle-algebra philosophy is that an arrow has exactly one forbidden continuation (a length--$2$ zero relation) and exactly one permitted continuation, implementing the idea that local motion is deterministic until a ``turn'' is disallowed.
985: 
986: In the double-$3$--cycle picture the clean, symmetric relations are:
987: \begin{equation}
988: \label{eq:sphere_gentle_rel}
989: a_{i+1}a_i = 0,\qquad
990: b_{i+1}b_i = 0,
991: \end{equation}
992: (with indices mod $3$), together with the \emph{switching relations}
993: \begin{equation}
994: \label{eq:sphere_switch_rel}
995: b_i a_i = 0,\qquad
996: a_i b_i = 0.
997: \end{equation}
998: Intuitively: once you commit to traversing the boundary of one face, continuing in the same face is prohibited at the next step (this is one gentle convention), and ``changing direction'' is implemented by swapping to the opposite cycle, which is also forbidden unless you do so at permitted corners depending on the chosen presentation.
999: 
1000: Different gentle ideals realize different physical conventions (e.g.\ ``reflect'' vs ``transmit'' at a vertex).  The key point for later parts is that \emph{the two opposite cycles provide a clean algebraic model of time-orientation choice}, and the relations encode how orientation reversals are allowed or suppressed.
1001: 
1002: \begin{remark}[Why we insist on a clean dessin here]
1003: The emergent-time narrative in the  main body interprets the cyclic order at a vertex as a clock successor.  If the first worked example is not topologically and combinatorially clean, downstream analogies become harder to audit.  Figure~\ref{fig:sphere_dessin} is the minimal example where ``clockwise vs counterclockwise'' is not merely a verbal distinction: it is an actual involution on cycles.
1004: \end{remark}
1005: 
1006: 
1007: 	
1008: 	
1009: 	\section{Covering Theory of Combinatorial Maps and Constellations}
1010: 
1011: 	A branched cover of surfaces $p: \tilde{\Sigma} \to \Sigma$ induces a covering map on the constellation level.
1012: 	Concretely, if $\Gamma \subset \Sigma$ is a cellular graph with constellation $C = [\sigma, \alpha, \phi]$, then the pullback graph $\tilde{\Gamma} = p^{-1}(\Gamma) \subset \tilde{\Sigma}$ carries a natural constellation $\tilde{C}$ arising as follows: the deck group $\text{Deck}(p)$ acts on sheets, and the cartographic group $G = \langle \sigma, \alpha, \phi \rangle$ acts on the fibers of edges and vertices. The crucial observation is the \textbf{Galois correspondence} between intermediate covers $\Sigma' / \Sigma$ (with associated quotient constellations) and subgroups $H \subset G$ of the cartographic group.
1013: 
1014: 	For the surface-order program, this covering formalism is essential: a covering map $\tilde{\Gamma} \to \Gamma$ induces a covering of medial quivers and, crucially, a \textbf{pulled-back surface order}. The deck transformations $\tau \in \text{Deck}(p)$ act on $\tilde{\Gamma}$ as automorphisms, and this action naturally becomes a family of time translations on the universal cover. The $\mathbb{Z}$-indexed clocks appearing in later chapters emerge geometrically from this mechanism: the universal cover $\widetilde{\Gamma}_\infty$ is an infinite tree, and the deck group action partitions its vertex set into orbits. Each orbit corresponds to a ``clock cycle'' in the algebraic sense, realizing the fundamental idea that time on a surface is dual to the symmetries of its covering.
1015: 
1016: 	\section{Covering Theory of Medial Quivers}
1017: 	The medial quiver construction is functorial with respect to branched covers. Specifically, let $p: \tilde{\Sigma} \to \Sigma$ be a covering map of surfaces, and let $\Gamma \subset \Sigma$, $\tilde{\Gamma} = p^{-1}(\Gamma) \subset \tilde{\Sigma}$ be the corresponding cellular graphs. Then the medial quiver assignment
1018: 	\[
1019: 	Q: \{\text{Cellular graphs}\} \to \{\text{Quivers}\}
1020: 	\]
1021: 	is functorial: the covering map $p$ induces a covering of medial quivers
1022: 	\[
1023: 	\tilde{p}: Q(\tilde{\Gamma}) \to Q(\Gamma).
1024: 	\]
1025: 	Moreover, the fiber of $\tilde{p}$ over each vertex $v \in Q(\Gamma)_0$ has cardinality equal to the degree of the cover, $\deg(p)$. This combinatorial lift is the mechanism by which local clock data (edge orders, vertex multiplicity) ascends from the base graph to the universal cover: each vertex on the base expands to a $\deg(p)$-tuple of vertices in the covering quiver. The path structure on the covering quiver then encodes all higher-order timing information via repeated application of these local lifts.
1026: 
1027: 	%----------------------------------------------------------------------------------------
1028: 	%	CHAPTER 2
1029: 	%----------------------------------------------------------------------------------------
\chapter{Linear Path Categories of Quivers} · lines 1030–1096
1030: 	\chapter{Linear Path Categories of Quivers}
1031: 	\label{ch:2}
1032: 	
1033: 	\section{Category Theory for Pedestrians}
1034: 	\subsection{Combinatorial Topology Approach}
1035: 	We may give any category, in particular "\textit{linear categories}", the structure of a \textit{directed graph} with \textit{path multiplication}, which is \textit{extended linearly} (i.e. a \textit{quiver path algebra}) \sidenote{As an example, say we identify some category with two objects and a single morphism $\mathcal{C}$, with the quiver $Q$, 
1036: 		\[ \xymatrix{x \ar[r]^a & y} \]
1037: 		and the paths of $Q$ are $\{e_x, e_y, ae_x=a=e_ya\}$, where we read paths from right to left like composition of linear maps, and $e_x, e_y$ are the \textbf{trivial paths}. The path category $\mathbf{P}(Q)$ has objects $Q(x,x)=\{e_x\}$, $Q(y,y)= \{e_y\}$, and $Q(x,y)=\{a\}$.} where objects are vertices, and morphisms are arrows. This allows us to set up much of the material in terms of combinatorial algebraic topology, and gives us a way of encoding the ideas into intuitive pictures with an aesthetic that might intrigue even the most formal and serious reader. 
1038: 	
1039: 	Under this construction, we may define the \textbf{category of categories}, denoted by $\mathfrak{C}$. We may consider concatenation of two consecutive arrows in the quiver $Q$ of the category $\mathcal{C}$ as a composition of two morphisms. In this way, we may define a category as a \textbf{path category} $\mathbf{P}(Q)$, of a quiver $Q$. In particular, $Q(x,y)$ will denote all paths from vertex $x$ to vertex $y$, and "multiplication" is given by concatenation of two consecutive arrows (or else is zero if this is not possible). This is an associative operation, and the collection of all paths in the quiver $Q$ identified with the category $\mathcal{C}$ will be what we have called path category $\mathbf{P}(Q)$, with $Q_0$ as objects, and the collection of all $Q(x,y)$ the morphisms. The morphisms in the category of all categories $\mathfrak{C}$, will be called \textbf{functors}, and will be given by directed graph maps (i.e. quiver maps) which preserve products (of arrows) and the \textit{local identities} $e_i,  i \in Q_0$, at each vertex $i \in Q_0$. 
1040: 	We will call a category a \textbf{linear category}\sidenote{So, we define the linear structure on $Q$ to be "formal linear combinations of paths". If $Q$ is \[ \xymatrix{x \ar[r]^a & y} \]
1041: 		$\KK Q(x,y) = \KK a \cong \KK$, is a one dimensional vector space. Similarly $\KK Q(x,x)= \KK x \cong \KK y = \KK Q(y,y)$. We may define a vector space $\KK Q$ with basis $\{x,y,a\}$, which is isomorphic to $\KK^3$ as a vector space.}, or a $\KK$-\textbf{category}, if all morphism sets $\mathcal{C}(A, B)$ have a $\KK$-linear structure, and all composition maps are $\KK$-bilinear, for some field $\KK$. 
1042: 	
1043: 	\newpage
1044: 	A \textbf{linear functor} $\theta: \mathcal{A} \to \mathcal{B}$ between two $\KK$-categories if the associated graph maps are $\KK$-linear\sidenote{Take $Q$ to be the category with two objects and one morphism, \[ \xymatrix{x \ar[r]^a & y}.\] For a second category, say 
1045: 		\[ \xymatrix{ x' \ar[r]^{a'} & y' \ar[r]^{b'} & z'}
1046: 		\]
1047: 		we have $\KK Q'$ has basis $\{x',y',z', a', b' b'a'\}$ and is isomorphic to $\KK^6$. Then we must define a $\KK$-linear map $V: \KK^3 \to \KK^6$ and then we must impose some "graph map structure" onto it that makes sense. On basis elements we could order the bases as above, then define $V$ to be
1048: 		$\begin{pmatrix}
1049: 			1 & 0 & 0 \\
1050: 			0 & 1 & 0 \\
1051: 			0 & 0 & 0 \\
1052: 			0 & 0 & 1 \\
1053: 			0 & 0 & 0 \\
1054: 			0 & 0 & 0 \\
1055: 		\end{pmatrix}$. This would take $(x \to y) \mapsto (x' \to y')$ mapping the arrow $a \mapsto a'$. We could also choose $Va=b'$ which would be given by the matrix
1056: 		$\begin{pmatrix}
1057: 			0 & 0 & 0 \\
1058: 			1 & 0 & 0 \\
1059: 			0 & 1 & 0 \\
1060: 			0 & 0 & 0 \\
1061: 			0 & 0 & 1 \\
1062: 			0 & 0 & 0 \\
1063: 		\end{pmatrix}$.
1064: 	}. In pictures, this means all arrows in the following diagram are $\KK$-linear, 
1065: 	\[
1066: 	\xymatrix{
1067: 		v=ta \ar[dd]_{\theta_0} \ar[rr]^a && w=ha \ar[dd]^{\theta_0} \\
1068: 		&& \\
1069: 		\theta_0(v)=t(\theta_1 a) \ar[rr]_{\theta_1(a)} && \theta_0(w)=h(\theta_1 a)
1070: 	}
1071: 	\]
1072: 	We define an \textbf{ideal} $\mathcal{I}$ of a $\KK$-category $\mathcal{C}$, to be a family of subspaces $\mathcal{I}(v, w) \subset \mathcal{C}(v, w)$, such that if $f \in \mathcal{C}(u, v)$ and $g \in \mathcal{C}(w,x)$, then $g \cdot \mathcal{I}(v,w) \cdot f \subset \mathcal{I}(u,x)$. In terms of quivers, we may visualize this as follows. Suppose we have the following diagram, with $a \in \mathcal{I}(v,w)$:
1073: 	\[ \xymatrix{
1074: 		u \ar[r]^f & v \ar[r]^a & w \ar[r]^{g} & x
1075: 	} \]
1076: 	The medial quiver construction is functorial with respect to branched covers. Specifically, let $p: \tilde{\Sigma} \to \Sigma$ be a covering map of surfaces, and let $\Gamma \subset \Sigma$, $\tilde{\Gamma} = p^{-1}(\Gamma) \subset \tilde{\Sigma}$ be the corresponding cellular graphs. Then the medial quiver assignment
1077: 	\[
1078: 	Q: \{\text{Cellular graphs}\} \to \{\text{Quivers}\}
1079: 	\]
1080: 	is functorial: the covering map $p$ induces a covering of medial quivers
1081: 	\[
1082: 	\tilde{p}: Q(\tilde{\Gamma}) \to Q(\Gamma).
1083: 	\]
1084: 	Moreover, the fiber of $\tilde{p}$ over each vertex $v \in Q(\Gamma)_0$ has cardinality equal to the degree of the cover, $\deg(p)$. This combinatorial lift is the mechanism by which local clock data (edge orders, vertex multiplicity) ascends from the base graph to the universal cover: each vertex on the base expands to a $\deg(p)$-tuple of vertices in the covering quiver. The path structure on the covering quiver then encodes all higher-order timing information via repeated application of these local lifts.
1085: 
1086: 	%----------------------------------------------------------------------------------------
1087: 	%	Part II Representation Theory
1088: 	%----------------------------------------------------------------------------------------
1089: 	\begin{fullwidth}
1090: 		\part{Representation Theory of Compact Gentle Surface Algebras}
1091: 	\end{fullwidth}
1092: 	
1093: 	
1094: 	%----------------------------------------------------------------------------------------
1095: 	%	CHAPTER 6
1096: 	%----------------------------------------------------------------------------------------
\chapter{Linear Relations on Vector Spaces and Functorial Filtrations}\label{ch:6} · lines 1097–1307
1097: 	\chapter{Linear Relations on Vector Spaces and Functorial Filtrations}\label{ch:6}
1098: 	\begin{fullwidth}
1099: 		Next we will study the indecomposable modules for compact gentle surface algebras. Because these algebras are infinite dimensional, the usual techniques of Auslander-Reiten theory are sometimes less helpful or do not apply. We can still however define a linear order on the finite dimensional modules, and describe the $\Hom$-spaces between them. We can also compute projective resolutions of finitely presented modules, and many of the combinatorics still hold. We will also be able to define a kind of Auslander-Reiten translate on some of the modules. One might want to understand such things for their own sake and such questions are standard in the representation theory of quivers, but we are interested in them for other reasons as well. In particular, we would like to have a \textit{"categorification"} of the relations between the generators of rings of relative invariants under the action of an algebraic group on the representations varieties. The word "categorification" is a popular one currently, and means many different things to many different people. Here it will simply mean a correspondence between generators of relative invariants and modules over the algebra, along with some hope of explaining the relations between the generators in terms of the representation theory of the quivers and the module categories. 
1100: 	\end{fullwidth}
1101: 	
1102: 	
1103: 	\section{Linear Relations on Vector Spaces}
1104: 
1105: 	To study indecomposable representations of gentle algebras---and more broadly of string and clannish algebras---we employ an algebraic technique based on \emph{relations on vector spaces}.  The central idea is to decompose a module into its interaction with two endomorphisms by analyzing their composition graph via subspaces of $V\times V$.  This reduces the classification of indecomposable representations to combinatorial data (strings and bands on the quiver).
1106: 
1107: 	We begin by defining \textit{linear relations} on vector spaces, a technique used by Gel'fand and Ponomarev in
1108: 	their study of the Lorentz group.\sidenote{I.M Gel'fand, V.A. Ponomarev. \emph{Indecomposable Representations of the 
1109: 			Lorentz Group}.} Later, the method was applied by Ringel\sidenote{C.M. Ringel. \emph{Indecomposable 
1110: 			Representations of the Dihedral $2$-Group}.} to study the dihedral $2$-group, and subsequently by Butler and 
1111: 	Ringel for string algebras, and Crawley-Boevey\sidenote{W. W. Crawley-Boevey. \emph{Functorial Filtrations I: The Problem of 
1112: 			an Idempotent and a Square-Zero Matrix}. J. London Math. Soc. (2) 38 (1988) 385-402}\sidenote{W. W. Crawley-Boevey. 
1113: 		\emph{Functorial Filtrations II: Clans and the Gelfand Problem}. J. London Math. Soc. (2) 40 (1989) 9-30.}\sidenote{W. 
1114: 		W. Crawley-Boevey. \emph{Functorial Filtrations III: Semi-dihedral Algebras}. J. London Math. Soc. (2) 40 (1989) 
1115: 		31-39} in the study of clannish algebras. The method was most recently applied in a preprint to infinite-
1116: 	dimensional string algebras by Crawley-Boevey\sidenote{W. W. Crawley-Boevey. \emph{Indecomposable 
1117: 			Representations of Infinite Dimensional String Algebras}. Preprint}.
1118: 	
1119: 	\subsection{Definitions and Examples}
1120: 	We define a \textbf{relation} on a vector space $V$, to be a subspace $C$ of $V \times V$. So, for example, we have that any endomorphism $f: V \to V$ defines the relation $\{(x, fx): \ x \in V\}$. We define the relation $C^{-1}$ as the relation $\{(y,x): \ (x,y) \in C\}$ for any relation $C$. We may compose relations, 
1121: 	\[ C_2C_1 = \{(x,z)| \ \exists \ y \in V:\ (x,y) \in C_1, (y,z) \in C_2\}.\]
1122: 	For any $x \in V$, we define 
1123: 	\[ Cx = \{y \in V: \ (x,y) \in C\},\]
1124: 	and for any subset $U \subset V$, 
1125: 	\[ CU = \{y \in V| \ \exists \ x \in U: \ (x,y) \in C\}.\]
1126: 	All of our relations will come from endomorphisms $f: V \to V$, and compositions of such relations. As an example, take the endomorphism $f, g: \KK^3 \to \KK^3$ given in the standard basis $\{e_1, e_2, e_3\}$, by the matrices \\
1127: 	\bigskip
1128: 	$ \quad f = \begin{pmatrix}
1129: 		0 & 0 & 0 \\
1130: 		1 & 0 & 0 \\
1131: 		0 & 1 & 0
1132: 	\end{pmatrix}, \quad g = \begin{pmatrix}
1133: 		0 & 1 & 0 \\
1134: 		0 & 0 & 1 \\
1135: 		0 & 0 & 0
1136: 	\end{pmatrix}
1137: 	$. \\
1138: 	
1139: 	
1140: 	The relation given by $f$ is then the subspace of $\KK^3 \times \KK^3$ generated by $\KK\{(e_1,e_2), (e_2, e_3)\}$, and the relation given by $g$ is the subspace of $\KK^3 \times \KK^3$ generated by $\KK\{ (e_2,e_1), (e_3, e_2)\}$. We may visualize the composition $f \cdot f$, of the relation induced by $f$ on $V \times V$ as follows,\\
1141: 	\
1142: 	\\
1143: 	\begin{tikzcd}
1144: 		e_1 \arrow[rd, "f" description] & e_1 & e_1 \\
1145: 		e_2 \arrow[rd, "f" description] & e_2 \arrow[rd, "f" description] & e_2 \\
1146: 		e_3 & e_3 & e_3
1147: 	\end{tikzcd}
1148: 	\\
1149: 	\
1150: 	\\
1151: 	This is the subspace of $\KK^3 \times \KK^3$ generated by $\KK\{(e_1, e_3)\}$. As another example, let $f$ and $g$ be as before. Then we may view the relation $g \cdot f \cdot f$ as, \\
1152: 	\
1153: 	\\
1154: 	\begin{tikzcd}
1155: 		e_1 \arrow[rd, "f" description] & e_1 & e_1 & e_1 \\
1156: 		e_2 \arrow[rd, "f" description] & e_2 \arrow[rd, "f" description] & e_2 & e_2 \\
1157: 		e_3 & e_3 & e_3 \arrow[ru, "g" description] & e_3
1158: 	\end{tikzcd}
1159: 	\\
1160: 	\
1161: 	\\
1162: 	This is the subspace generated by $\KK \{(e_1, e_2)\}$. For any relation $C$ on $V$, define the \textbf{stable kernel of} $C^{-1}$, to be $\kappa(C) = \bigcup_{n \geq 0}C^n0_V$. Define the \textbf{stable image of} $C$, to be $\iota(C) = \bigcap_{n \geq 0} C^nV$. As an example, let us return to our endomorphisms $f$ and $g$ and the following visualizations, \\
1163: 	\
1164: 	\\
1165: 	\begin{tikzcd}
1166: 		e_1 \arrow[rd, "f" description] & e_1 & e_1 & \fbox{$e_1$} \\
1167: 		e_2 \arrow[rd, "f" description] & e_2 \arrow[rd, "f" description] & e_2 & \fbox{$e_2$} \\
1168: 		e_3 & e_3 & e_3 & \fbox{$e_3$}
1169: 	\end{tikzcd}, \quad \quad \quad \quad \quad \quad 
1170: 	\begin{tikzcd}
1171: 		e_1 & e_1 & e_1 & \fbox{$e_1$} \\
1172: 		e_2 \arrow[ru, "g" description] & e_2 \arrow[ru, "g" description] & e_2 & \fbox{$e_2$} \\
1173: 		e_3 \arrow[ru, "g" description] & e_3 & e_3 & \fbox{$e_3$}
1174: 	\end{tikzcd}
1175: 	\\
1176: 	\
1177: 	\\
1178: 	\
1179: 	\\
1180: 	\
1181: 	\\
1182: 	\quad \quad \begin{tikzcd}
1183: 		e_1 \arrow[rd, "f" description] & e_1 & e_1 \arrow[rd, "f" description] & e_1 & e_1 & \cdots \\
1184: 		e_2 \arrow[rd, "f" description] & e_2 \arrow[ru, "g" description] & e_2 \arrow[rd, "f" description] & e_2 \arrow[ru, "g" description] & e_2 & \cdots \\
1185: 		e_3 & e_3 \arrow[ru, "g" description] & e_3 & e_3 \arrow[ru, "g" description] & e_3 & \cdots
1186: 	\end{tikzcd}
1187: 	\begin{table} % Add the following just after the closing bracket on this line to specify a position for the table on the page: [h], [t], [b] or [p] - these mean: here, top, bottom and on a separate page, respectively
1188: 		\centering % Centers the table on the page, comment out to left-justify
1189: 		\begin{tabular}{l c c c c c} % The final bracket specifies the number of columns in the table along with left and right borders which are specified using vertical bars (|); each column can be left, right or center-justified using l, r or c. To specify a precise width, use p{width}, e.g. p{5cm}
1190: 			%\toprule \\ % Top horizontal line
1191: 			%& \multicolumn{5}{c}{Constellations as CW-Complexes}  \\ % Amalgamating several columns into one cell is done using the \multicolumn command as seen on this line
1192: 			\midrule % Horizontal line spanning less than the full width of the table - you can add (r) or (l) just before the opening curly bracket to shorten the rule on the left or right side
1193: 			Relation & Stable Spaces  \\ % Column names row
1194: 			\midrule % In-table horizontal line
1195: 			$\kappa(f)$ & $\KK \{(e_1, e_2), (e_2, e_3), (e_1, e_3)\}$  \\ % Content row 1
1196: 			$\iota(f)$ & $0$ \\
1197: 			$\kappa(g)$ & $\KK \{(e_2, e_1), (e_3, e_2), (e_3, e_1)\}$ \\
1198: 			$\iota(g)$ &  $0$ \\
1199: 			$\kappa(gf)$ & $\KK \{(e_1, 0)\}$ \\
1200: 			$\iota(gf)$ & $\KK \{(e_1, e_1), (e_2, e_2)\}$ \\
1201: 			$\kappa(fg)$ & $\KK \{(e_3, 0)\}$ \\
1202: 			$\iota(fg)$ & $\KK \{(e_2, e_2), (e_3, e_3)\}$ \\
1203: 			\midrule % In-table horizontal line
1204: 			%\midrule % In-table horizontal line
1205: 			\bottomrule % Bottom horizontal line
1206: 		\end{tabular}
1207: 		\caption{Stable kernels of $f^{-1}, g^{-1}, (fg)^{-1},$ and $(gf)^{-1}$; and stable images of $f, g, fg,$ and $gf$.} % Table caption, can be commented out if no caption is required
1208: 		\label{tab:template} % A label for referencing this table elsewhere, references are used in text as \ref{label}
1209: 	\end{table}
1210: 	
1211: 	\newpage
1212: 	\subsection{Properties of Relations}
1213: 	
1214: 	Suppose we have a relation on $V$ identified with an endomorphism $f:V \to V$. Then there are subspaces $U_1, U_2 \subset V$, such that 
1215: 	\begin{enumerate}
1216: 		\item $V = U_1 \oplus U_2$, 
1217: 		\item $f = \left(f \cap (U_1 \times U_1)\right) \oplus \left(f \cap (U_2 \times U_2)\right)$, 
1218: 		\item $f \cap (U_1 \times U_1)$ is the graph of an automorphism $f|_{U_1}$, 
1219: 		\item $\kappa(f) \oplus U_1 = \iota(f)$, 
1220: 		\item $f$ induces an automorphism $\varphi$ on $\iota(f)/\kappa(f)$ such that $\varphi(x + \kappa(f)) = (fx \cap \iota(f)) + \kappa(f)$, for all $x \in \iota(f)$,
1221: 		\item the relation $\phi$ on $\iota(f)/\kappa(f)$ is the \textbf{regular part} of $f$, and splits off. 
1222: 		% \item 
1223: 		% \item 
1224: 	\end{enumerate}
1225: 	
1226: 	\newpage
1227: 	\section{Words on the Quiver}
1228: 	A \textbf{word} on the quiver $Q$ is a finite sequence of arrows and their formal inverses:
1229: 	\[
1230: 	w = a_1^{\epsilon_1} a_2^{\epsilon_2} \cdots a_n^{\epsilon_n}, \quad a_i \in Q_1, \quad \epsilon_i \in \{\pm 1\}.
1231: 	\]
1232: 	The alphabet for these words is $Q_1 \cup Q_1^{-1}$, where $Q_1^{-1}$ denotes the formal inverses of arrows. A word is reduced if no arrow is immediately followed by its inverse. For a gentle algebra with zero-relations, words satisfying all the zero-relations—i.e., avoiding the forbidden length-2 concatenations—constitute the combinatorial data that indexes indecomposable representations. In particular, modulo the gentle relations, words and their equivalence classes provide a complete classification of the indecomposable modules over the algebra.
1233: 	\section{Strings}
1234: 	A \textbf{string} is a reduced word $w = a_1^{\epsilon_1} a_2^{\epsilon_2} \cdots a_n^{\epsilon_n}$ on the quiver that avoids all zero-relations. Each string $w$ corresponds to a unique indecomposable \textbf{string module} $M(w)$. The module structure is defined by assigning vector spaces to each vertex: if $v$ is a vertex, then $\dim M(w)|_v$ equals the number of times $v$ appears in the walk traced by $w$ through the quiver. The dimension vector of $M(w)$ is precisely this tuple of visit counts. String modules are indecomposable and rigid, and distinct strings yield non-isomorphic modules. The collection of all string modules of a gentle algebra provides a large class of indecomposable representations, often comprising the entire indecomposable class for algebras of finite representation type.
1235: 
1236: 	\section{Bands}
1237: 	A \textbf{band} is a cyclic string $b = a_1^{\epsilon_1} a_2^{\epsilon_2} \cdots a_m^{\epsilon_m}$ that is primitive, meaning it is not a proper power of a shorter cyclic word. Each band $b$ gives rise to a continuous family of indecomposable \textbf{band modules} $M(b, \lambda, n)$ parametrized by:
1238: 	\begin{enumerate}
1239: 		\item the band $b$ itself,
1240: 		\item a scalar $\lambda \in k^* \setminus \{1\}$ (the deformation parameter), and
1241: 		\item a positive integer $n \in \mathbb{Z}_{>0}$ (the Jordan block size).
1242: 	\end{enumerate}
1243: 	Band modules are the representation-theoretic source of periodic behavior and continuous families in the module category. For a fixed band and Jordan size, varying $\lambda$ over $k^*$ produces a family of non-isomorphic indecomposable modules. This continuous parametrization is the algebraic origin of the ``cyclic time'' or ``clock periodicity'' that underlies the rest of this work.
1244: 	\section{The Functorial Filtration}
1245: 	\label{ch:9}
1246: 	
1247: 	Suppose we have some index set $I$, and $Q$ and $\mathcal{Q}_i$, $i \in I$ abelian categories\sidenote{Recall: an abelian category can be thought of as the path category of a quiver $Q$, such that we have addition on $Q_0$ (vertices) and also on $Q_1$ (arrows). In particular, $Q_0$, and $Q(x,y)$ are abelian groups.}. Suppose $S_i: \mathcal{Q}_i \to Q$ and $F_i: Q \to \mathcal{Q}_i$ are additive functors\sidenote{Identifying quivers with categories, an additive functor can be thought of as a quiver map (directed graph map) $\theta: Q \to Q'$, so that there is an additive structure on the maps $x \to \theta(x)$, $x \in Q_0, \ \theta(x) \in Q'_0$.}. Suppose further that\sidenote{We say the functor (quiver map) $F_i:Q \to \mathcal{Q}_i$ is \textbf{locally finite} if only finitely many $F_i(x) \in \mathcal{Q}_{i,0}$ are nonzero, for $x \in Q_0$. We say it \textbf{reflects isomorphisms} if $F_i(a) \in \mathcal{Q}_i(F_i(x),F_i(y))$ is an isomorphism for all $i \in I$, then $a \in Q(x,y)$ is an isomorphism. Here of course $x=ta$ and $y=ha$.}
1248: 	\begin{enumerate}
1249: 		\item $F_iS_i \cong \id_{\mathcal{Q}_i}$. 
1250: 		\item $F_iS_j \cong 0$ if $i \neq j$.
1251: 		\item The set $\{F_i: \ i \in I\}$ is \textbf{locally finite}, and \textbf{reflects isomorphisms}.
1252: 		\item For every $M \in \mathcal{M}$, and $i \in I$, there is a map $\gamma_{i,M}: S_iF_i(M) \to M$ such that $F_i(\gamma_{i,M})$ is an isomorphism. 
1253: 	\end{enumerate}
1254: 	How should one think of such a definition? What is a "good" picture to have in mind? First observe the following diagrams, 
1255: 	\ \begin{tikzcd}
1256: 		{x'\in \mathcal{Q}_{i,0}} \arrow[rr, "\mathbf{id}_{\mathcal{Q}_i}"] \arrow[rd, "S_i"'] &  & x'\in \mathcal{Q}_i \\
1257: 		& S_i(x')\in Q_0 \arrow[ru, "F_i"'] & 
1258: 	\end{tikzcd}\\
1259: 	\
1260: 	\\
1261: 	\
1262: 	\\
1263: 	\
1264: 	\\
1265: 	\begin{tikzcd}
1266: 		& {F_i(x) \in \mathcal{Q}_{i,0}} \arrow[rd, "S_i"] &  \\
1267: 		x \in Q_0 \arrow[ru, "F_i"] \arrow[rr, "{\gamma_{i,x}}"'] &  & S_iF_i(x) \in Q_0
1268: 	\end{tikzcd}
1269: 	\\
1270: 	\
1271: 	\\
1272: 	If all of the above properties are satisfied, then the \textbf{indecomposable objects} in $Q$ are all of the form $S_i(m)$, with $m$ an indecomposable objects in $Q_i$. All objects of the form $S_i(m)$ are indecomposable. Moreover, $S_i(V) \cong S_j(V')$ if and only if $i=j$ and $V \cong V'$ in $Q_i$. Now, framing this in terms of \textit{representations} $V$ in $\mathbf{rep}(\Lambda_i)=Q_i$\sidenote{Recall: a representation of a quiver $\Lambda_i$, denoted $V: \Lambda_i \to \mathbf{Mod}(k)$, is a functor which assigns vector spaces $V(x)$ to each vertex $x \in \Lambda_{i,0}$, and linear maps $V(a)$ to each arrow $a \in \Lambda_{i,1}$.}, and idenitifying the category $\mathbf{rep}(\Lambda_i)$ of representations of the quiver (or quiver with relations) $\Lambda_i$, with the quiver $Q_i$, the above construction says we have the following diagrams of categories of representations,
1273: 	
1274: 	\begin{tikzcd}
1275: 		& F_i(V) \in \mathbf{rep}(\Lambda_i) \arrow[rd, "S_i"] &  \\
1276: 		V \in \mathbf{rep}(\Lambda) \arrow[ru, "F_i"] \arrow[rr, "{\gamma_{i,V}}"'] &  & S_iF_i(V) \in \mathbf{rep}(\Lambda)
1277: 	\end{tikzcd}
1278: 	
1279: 	%\noindent
1280: 	%\includegraphics[
1281: 	%    page=1,
1282: 	%    width=400pt,
1283: 	%    height=400pt,
1284: 	%    keepaspectratio
1285: 	%]{filtration.pdf}
1286: 	%\vfill
1287: 	
1288: 	
1289: 	
1290: 	\section{Cantor Set Structure}
1291: 
1292: 	The string combinatorics of a gentle surface algebra encode a Cantor-set topology. The set of all one-sided infinite strings (left-infinite reduced walks that avoid zero-relations) on the quiver may be given the product topology on the alphabet $Q_1 \cup Q_1^{-1}$. Under this topology, the space of one-sided infinite strings is homeomorphic to a Cantor set minus countably many points—the exceptional points being those strings that eventually terminate or satisfy a relation. This gives a fractal, self-similar structure to the representation-theoretic data.
1293: 
1294: 	\subsection{Universal Cover}
1295: 
1296: 	The \textbf{universal cover} of a gentle algebra is the path category of the universal covering quiver, obtained by unfolding all cycles in the original quiver into an infinite tree. Formally, if $\tilde{Q} \to Q$ is the universal covering map of quivers, then the path category $\mathbf{P}(\tilde{Q})$ (on the infinite tree) contains all paths that lift the paths of $\mathbf{P}(Q)$. Band modules of the original algebra correspond precisely to representations of $\mathbf{P}(\tilde{Q})$ that are periodic under the action of the deck transformation group (fundamental group of $Q$). The periodicity of a band module under deck group action is exactly what realizes the algebraic notion of a ``cyclic' structure: the deck group acts freely on vertices of $\tilde{Q}$, and the orbits of this action correspond to the cycles of the original quiver. A representation that is periodic with period $\lambda$ along a deck transformation orbit encodes a cyclic time evolution, realizing in the representation category the discrete-to-continuous transition central to the Hilbert–Pólya program.
1297: 
1298: 	
1299: 	
1300: 	
1301: 	
1302: 	
1303: 	%%----------------------------------------------------------------------------------------
1304: % ============================================================
1305: % Expanded edition insertion: DG / A_infty foundations and multiparameter persistence
1306: % ============================================================
1307: 
\chapter{DG and \texorpdfstring{$A_\infty$}{A-infty} foundations: making ``derived time'' honest} · lines 1308–1478
1308: \chapter{DG and \texorpdfstring{$A_\infty$}{A-infty} foundations: making ``derived time'' honest}
1309: 
1310: \label{ch:dg}
1311: 
1312: 
1313: The  main body introduces DG-algebras to motivate multiparameter persistence and derived invariants ( Chapter~4).
1314: Here we expand the DG/$A_\infty$ layer in the direction needed for two goals:
1315: \begin{enumerate}
1316: \item a mathematically sound interface between surface orders and persistence computations, and
1317: \item an operator-theoretic interface between ``clock shifts'' and Hamiltonians (Hilbert--Pólya program later).
1318: \end{enumerate}
1319: 
1320: \subsection{DG-algebras: conventions and minimal requirements}
1321: \label{sec:dg_conventions}
1322: 
1323: A differential graded (DG) algebra over a commutative ring $k$ is a graded $k$-algebra
1324: $A=\bigoplus_{n\in\Z} A^n$ equipped with a degree $+1$ differential $d:A^n\to A^{n+1}$ such that
1325: \[
1326: d^2=0,\qquad d(ab)=(da)b+(-1)^{|a|}a(db).
1327: \]
1328: A DG-module over $A$ is defined similarly; the derived category $D(A)$ is obtained by inverting quasi-isomorphisms.
1329: 
1330: \begin{example}[A minimal example]
1331: The exterior algebra $A=\Lambda^\bullet(V)$ with $d=0$ is a DG-algebra concentrated in non-positive degrees.  A less degenerate example: let $A=k[\varepsilon]/(\varepsilon^2)$ with $|\varepsilon|=-1$ and $d\varepsilon=1$; then $H^\bullet(A)\cong k$, so $A$ is a ``resolution'' of the ground field.  In our setting, $A$ will be a DG enhancement of a surface algebra, and the differential encodes higher-order relations among paths.
1332: \end{example}
1333: 
1334: \begin{remark}[What we actually need]
1335: We do \emph{not} need the full technology of model categories for most of this volume.
1336: We need: (i) mapping cones, (ii) derived functors (Tor/Ext), (iii) the fact that quasi-isomorphic DG-algebras have equivalent derived categories, and (iv) a controlled way to talk about ``families'' of DG-modules indexed by parameters.
1337: \end{remark}
1338: 
1339: \subsection{From surface algebras/orders to DG enhancements}
1340: \label{sec:dg_from_surface}
1341: 
1342: A surface algebra in the sense of the source text is a quiver algebra $kQ/I$ with gentle-style relations.
1343: There are multiple DG enhancements one can attach:
1344: 
1345: \begin{enumerate}
1346: \item \textbf{Bar/cobar constructions:} produce a DG coalgebra and then a DG algebra controlling $A_\infty$ structures.
1347: \item \textbf{Ginzburg DG algebras:} if a quiver with potential $(Q,W)$ exists, one can form a 3-Calabi--Yau DG algebra $\Gamma(Q,W)$.
1348: \item \textbf{Geometric enhancements:} for many gentle/surface algebras, $D^b(\mathrm{mod}\text{-}A)$ is equivalent to a (partially wrapped) Fukaya category of a marked surface; the $A_\infty$ structure is then geometric.
1349: \end{enumerate}
1350: 
1351: We remain agnostic and formulate an \emph{axiomatic} requirement.
1352: 
1353: \begin{definition}[Clock-compatible DG enhancement]
1354: \label{def:clock_compatible_dg}
1355: Let $\Lambda$ be a (completed) surface order with local clock operators.
1356: A \emph{clock-compatible DG enhancement} of $\Lambda$ is a DG algebra $A$ together with:
1357: \begin{itemize}
1358: \item a quasi-isomorphism $H^0(A)\simeq \Lambda$,
1359: \item a distinguished degree-$0$ element (or automorphism) $T\in Z^0(A)$ representing the clock shift in cohomology,
1360: \item functoriality with respect to gluing: gluing of orders induces DG-algebra maps up to homotopy.
1361: \end{itemize}
1362: \end{definition}
1363: 
1364: The point of this definition is not to impose an arbitrary DG gadget; it is to make sure that ``clock data'' survives passage to derived categories and hence can interact with persistence constructions.
1365: 
1366: \subsection{The minimal $A_\infty$ model viewpoint}
1367: \label{sec:Ainfty}
1368: 
1369: Even when $A$ is concentrated in degree $0$ (an ordinary algebra), the derived category remembers higher multiplications via $A_\infty$ minimal models.
1370: The cleanest formulation for computations is:
1371: 
1372: \begin{theorem}[Kadeishvili (minimal model)]
1373: Let $A$ be a DG algebra over a field.
1374: Then its cohomology $H^*(A)$ admits an $A_\infty$ algebra structure $(m_2,m_3,\dots)$ such that:
1375: \begin{itemize}
1376: \item $m_2$ is the induced product on cohomology,
1377: \item there exists an $A_\infty$ quasi-isomorphism $H^*(A)\to A$,
1378: \item the $A_\infty$ structure is unique up to $A_\infty$ quasi-isomorphism.
1379: \end{itemize}
1380: \end{theorem}
1381: 
1382: \begin{remark}[Why $m_3$ matters for time/geometry]
1383: The first genuinely new datum beyond associative multiplication is $m_3$.
1384: Physically, $m_3$ is a measure of nontrivial associator/phase information in composing local processes.
1385: Mathematically, $m_3$ detects Massey products and obstructions to formality.
1386: In emergent-geometry language, it is the first place where ``curvature'' can appear in a purely algebraic composition law.
1387: \end{remark}
1388: 
1389: \subsection{Realistic example: the double $3$--cycle algebra and its Ext-$A_\infty$}
1390: \label{sec:double3_example}
1391: 
1392: Let $A$ be the path algebra of the double $3$--cycle quiver from Section~\ref{sec:corrigendum_sphere}, modulo gentle relations \eqref{eq:sphere_gentle_rel}--\eqref{eq:sphere_switch_rel}.
1393: Even in this toy case, one can see the distinction between:
1394: \begin{itemize}
1395: \item the \emph{presentation} by generators/relations, and
1396: \item the \emph{derived} composition data encoded by higher operations in $\mathrm{Ext}^*_A(S,S)$ for simples $S$.
1397: \end{itemize}
1398: 
1399: \begin{proposition}[Ext algebra skeleton (informal)]
1400: For a simple $A$-module $S$ supported at a medial vertex, $\mathrm{Ext}^1_A(S,S)$ is spanned by (classes of) the two local directions (clockwise/counterclockwise arrows), while $\mathrm{Ext}^2_A(S,S)$ detects the first forbidden length-$2$ turns.
1401: Higher $\mathrm{Ext}$ groups are controlled by periodicity of walks on the quiver.
1402: \end{proposition}
1403: 
1404: \begin{remark}
1405: This is the derived-category version of the combinatorial statement ``there are two arrows in and two arrows out'' in a surface algebra (see the source text in Appendix~A).
1406: \end{remark}
1407: 
1408: A concrete computational pipeline (Macaulay2 or Sage) is provided in Section~\ref{ch:persistence} for related persistence modules.
1409: For DG/$A_\infty$ computations, one typically proceeds by choosing a projective resolution $P^\bullet\to S$ and forming the DG endomorphism algebra $\End(P^\bullet)$; its cohomology carries the desired $A_\infty$ structure.
1410: 
1411: \subsection{Derived invariants that behave like conserved quantities}
1412: \label{sec:derived_invariants}
1413: 
1414: A central promise in the  open-problems list is to compute derived invariants (Hochschild (co)homology, Calabi--Yau structures) of clocked surface DG-algebras and interpret them physically ( \S13.2.1).
1415: 
1416: We record the minimal dictionary.
1417: 
1418: \begin{definition}[Hochschild homology and cohomology]
1419: For a DG algebra $A$, Hochschild homology is
1420: \[
1421: HH_*(A)=\mathrm{Tor}^{A^e}_*(A,A),\qquad A^e=A\otimes_k A^{op},
1422: \]
1423: and Hochschild cohomology is
1424: \[
1425: HH^*(A)=\mathrm{Ext}^{*}_{A^e}(A,A).
1426: \]
1427: \end{definition}
1428: 
1429: \begin{remark}[Physical reading]
1430: In many QFT and string-theoretic contexts, Hochschild cohomology controls deformations of the algebra of observables, while Hochschild homology controls ``closed-string'' or ``trace'' sectors.
1431: Within the present program, the robust claim is:
1432: \begin{quote}
1433: \emph{Clock holonomy constraints are deformation constraints, hence should appear as classes in $HH^*(A)$ or as obstructions detected by them.}
1434: \end{quote}
1435: \end{remark}
1436: 
1437: \subsection{Hamiltonians from shifts: the logarithm trick}
1438: \label{sec:hamiltonian_log}
1439: 
1440: The  main body already sketches how a shift operator can be viewed as a discrete-time evolution $T=e^{-iH\Delta t/\hbar}$ ( \S6.6; see also the discussion around diagonalizing $T$ on a finite $d$--qudit).
1441: 
1442: The mathematically correct statement is:
1443: 
1444: \begin{proposition}[From a unitary shift to a self-adjoint generator]
1445: Let $T$ be a unitary on a Hilbert space $\cH$.
1446: Then by functional calculus there exists a self-adjoint operator $H$ (not unique) such that
1447: \[
1448: T = e^{-iH}.
1449: \]
1450: If we specify a time step $\Delta t$ and Planck's constant $\hbar$, we may write $T=e^{-iH\Delta t/\hbar}$ after rescaling.
1451: \end{proposition}
1452: 
1453: \begin{remark}[Nonuniqueness and branch choices]
1454: The logarithm of a unitary is multi-valued; choosing $H$ requires choosing a branch cut for the eigenphases.
1455: In the Hilbert--Pólya program we exploit this nonuniqueness as a feature: branch choices correspond to arithmetic/holonomy constraints that must be fixed by additional structure (trace formulas, positivity, or spectral symmetries).
1456: \end{remark}
1457: 
1458: For nonunitary truncations (nilpotent/unipotent), the generator is not self-adjoint and must be implemented on hardware by dilation ( \S12.3).
1459: We expand the engineering consequences in Section~\ref{ch:expts}.
1460: 
1461: \subsection{DG flows and multiparameter filtrations}
1462: \label{sec:dg_filtrations}
1463: 
1464: To connect DG algebra to multiparameter persistence we need a mechanism that produces \emph{families} of complexes.
1465: The clean algebraic model is:
1466: 
1467: \begin{definition}[Multiparameter filtered DG module]
1468: Let $(\P,\le)$ be a poset (e.g.\ $\N^n$).
1469: A \emph{$\P$--filtered DG $A$-module} is a family $\{M_p\}_{p\in\P}$ of DG modules together with structure maps $M_p\to M_q$ for $p\le q$ such that:
1470: \begin{enumerate}
1471: \item each map is a DG-module map,
1472: \item compositions are strictly associative (or associative up to specified homotopies in a higher-categorical refinement).
1473: \end{enumerate}
1474: \end{definition}
1475: 
1476: In practice, $\P=\N^2$ is the first nontrivial case: one parameter is a geometric/scale parameter, the other is an information/entanglement threshold.
1477: Section~\ref{ch:persistence} turns this into explicit computations.
1478: 
\chapter{Explicit multiparameter persistence computations tied to surface orders} · lines 1479–1741
1479: \chapter{Explicit multiparameter persistence computations tied to surface orders}
1480: 
1481: \label{ch:persistence}
1482: 
1483: 
1484: This chapter is the computational core of the extended edition.
1485: It expands the  bridge chapter ( Chapter~4) by giving:
1486: \begin{enumerate}
1487: \item an explicit \emph{bifiltration} naturally attached to clocked surface orders and entanglement data,
1488: \item a concrete translation to bigraded modules over polynomial rings (the commutative-algebra model),
1489: \item worked toy computations (including Macaulay2 templates),
1490: \item and a pipeline intended to be implementable on realistic quantum hardware outputs.
1491: \end{enumerate}
1492: 
1493: \subsection{From a surface order to a bifiltration}
1494: \label{sec:bifiltration_from_order}
1495: 
1496: The core idea is to convert entanglement data on the surface into a two-parameter family of simplicial complexes, where one parameter controls \emph{spatial scale} (how far we look on the graph) and the other controls \emph{correlation strength} (how entangled a pair must be to count as connected).  This is the minimal construction that keeps geometric and information-theoretic data logically separated, and it is what makes multiparameter persistence the natural tool rather than a decorative upgrade.
1497: 
1498: Let $\Gamma\subset \Sigma$ be an embedded graph underlying a surface algebra/order, and attach to each vertex $v$ a local Hilbert space $\cH_v$ and local clock operator $S_v$ (possibly twisted, Section~\ref{sec:twisted_shift}).
1499: Fix a global state $|\psi\rangle\in \bigotimes_{v\in V(\Gamma)}\cH_v$.
1500: 
1501: We construct a \emph{two-parameter filtration} indexed by
1502: \[
1503: (r,\lambda)\in \RR_{\ge 0}\times \RR_{\ge 0},
1504: \]
1505: where:
1506: \begin{itemize}
1507: \item $r$ is a \emph{geometric/graph} scale (how far we look on $\Gamma$),
1508: \item $\lambda$ is an \emph{information threshold} (how strong correlations must be to count as ``present'').
1509: \end{itemize}
1510: 
1511: \subsubsection{Raw data: a weighted correlation graph}
1512: 
1513: From $|\psi\rangle$ define a symmetric weight matrix $W_\psi(u,v)$.
1514: A standard choice is mutual information
1515: \[
1516: W_\psi(u,v)=I(u\!:\!v)=S(u)+S(v)-S(uv),
1517: \]
1518: or a Rényi proxy $I_2$ when only randomized measurements are available ( \S12.6).
1519: 
1520: \begin{definition}[Thresholded correlation graph]
1521: For $\lambda\ge 0$, define the thresholded graph $\Gamma_\lambda$ on the same vertex set by including an edge $(u,v)$ if $W_\psi(u,v)\ge \lambda$.
1522: \end{definition}
1523: 
1524: \subsubsection{Geometric thickening: Vietoris--Rips on a graph metric}
1525: 
1526: Let $d_{\mathrm{comb}}$ be the shortest-path metric on the $1$--skeleton of $\Gamma$ (unit edge lengths, or weighted by geometric data when available).
1527: For $r\ge 0$, define the $r$--ball neighborhoods and construct a simplicial complex.
1528: 
1529: \begin{definition}[Bifiltered complex]
1530: Let $K_{r,\lambda}$ be the Vietoris--Rips complex on the vertex set $V(\Gamma)$, using the metric $d_{\mathrm{comb}}$, but with the additional constraint that simplices are only allowed if all their edges lie in $\Gamma_\lambda$.
1531: Equivalently, $K_{r,\lambda}$ is generated by cliques in $\Gamma_\lambda$ of diameter $\le r$.
1532: \end{definition}
1533: 
1534: Then $(r,\lambda)\le (r',\lambda')$ (meaning $r\le r'$ and $\lambda\ge \lambda'$ if we view $\lambda$ as a threshold) induces an inclusion
1535: \[
1536: K_{r,\lambda}\hookrightarrow K_{r',\lambda'}.
1537: \]
1538: 
1539: \begin{remark}[Monotonicity conventions]
1540: There are two common conventions:
1541: \begin{itemize}
1542: \item treat both parameters as increasing (larger means ``more included''),
1543: \item or treat one as a decreasing threshold.
1544: We will always explicitly state the poset used; the algebraic model uses $\N^2$ with coordinatewise order.
1545: \end{itemize}
1546: \end{remark}
1547: 
1548: \subsection{Persistence modules as bigraded modules over $k[x,y]$}
1549: \label{sec:modules_over_poly}
1550: 
1551: Fix a homology degree $k$.
1552: Define
1553: \[
1554: M_{r,\lambda} := H_k(K_{r,\lambda};k),
1555: \]
1556: with structure maps induced by inclusions.
1557: 
1558: Discretize parameters to a grid $(r_i,\lambda_j)$ and index by $\N^2$:
1559: \[
1560: M_{(i,j)} := M_{r_i,\lambda_j}.
1561: \]
1562: Then $M$ becomes an $\N^2$-graded persistence module.
1563: As recalled in the source text (Appendix~B in the  volume), such modules can be modeled as modules over a polynomial ring.
1564: 
1565: \begin{definition}[Bigraded module model]
1566: Let $R=k[x,y]$ with $\deg x=(1,0)$ and $\deg y=(0,1)$.
1567: An $\N^2$-graded persistence module with structure maps corresponding to increments in $i$ and $j$ is equivalent (under mild finiteness hypotheses) to a finitely generated $\N^2$-graded $R$-module.
1568: \end{definition}
1569: 
1570: The equivalence is realized by letting $x$ act by the map $M_{(i,j)}\to M_{(i+1,j)}$ and $y$ act by $M_{(i,j)}\to M_{(i,j+1)}$.
1571: This is the commutative-algebra ``engine'' that powers generic free resolutions, determinantal varieties, and stability criteria (Appendix~B).
1572: 
1573: \subsection{What to compute: rank invariants, Betti tables, and jump loci}
1574: \label{sec:invariants}
1575: 
1576: For one-parameter persistence, barcodes are complete invariants over a field.
1577: For two parameters, no such complete discrete invariant exists.
1578: However, several computable invariants are both meaningful and stable.
1579: 
1580: \subsubsection{Rank invariant}
1581: For $p\le q$ in the poset, let $\varphi_{p,q}:M_p\to M_q$ be the structure map.
1582: 
1583: \begin{definition}[Rank invariant]
1584: The rank invariant is
1585: \[
1586: \rho(p,q) := \rank(\varphi_{p,q}).
1587: \]
1588: \end{definition}
1589: 
1590: Geometrically, fixing $p,q$ and bounding the rank corresponds to determinantal varieties (Appendix~B); computationally, $\rho$ is often the first robust summary one can estimate from noisy data.
1591: 
1592: \subsubsection{Free resolutions and Betti numbers}
1593: A finitely generated bigraded $R$-module has a minimal free resolution
1594: \[
1595: \cdots \to \bigoplus R(-\alpha)^{\beta_{2,\alpha}}
1596: \to \bigoplus R(-\alpha)^{\beta_{1,\alpha}}
1597: \to \bigoplus R(-\alpha)^{\beta_{0,\alpha}}
1598: \to M\to 0,
1599: \]
1600: where $\alpha\in\N^2$ and $\beta_{i,\alpha}$ are bigraded Betti numbers.
1601: 
1602: \begin{remark}[Why Betti tables matter here]
1603: In this program, the Betti data is not just ``commutative algebra for its own sake'':
1604: Betti numbers detect \emph{how many independent topological features} are created and destroyed in each parameter direction, and the degrees tell you \emph{where} in the $(r,\lambda)$ plane those events concentrate.
1605: \end{remark}
1606: 
1607: \subsection{Toy computation 1: a four-vertex surface-order patch}
1608: \label{sec:toy1}
1609: 
1610: Consider a small patch of a triangulated surface consisting of four vertices forming two triangles sharing an edge.
1611: Let the vertices be $1,2,3,4$ with edges $(1,2),(2,3),(1,3)$ and $(2,3),(2,4),(3,4)$.
1612: 
1613: Assume we have measured (or simulated) correlation weights $W_\psi(u,v)$ on these edges.
1614: We pick two thresholds $\lambda_0>\lambda_1$ and two radii $r_0<r_1$ such that:
1615: \begin{itemize}
1616: \item at $(r_0,\lambda_0)$ we have only the single shared edge $(2,3)$;
1617: \item at $(r_0,\lambda_1)$ we have a triangle $(1,2,3)$;
1618: \item at $(r_1,\lambda_1)$ we have both triangles, hence a contractible complex.
1619: \end{itemize}
1620: 
1621: Then $H_1(K_{r,\lambda})$ is nontrivial only at intermediate parameters: the triangle at $(r_0,\lambda_1)$ creates a 1-cycle in the $1$--skeleton that is immediately filled by the 2-simplex, so the persistent $H_1$ is trivial; but $H_0$ has a nontrivial merging event.
1622: 
1623: This toy is boring topologically, but it is useful algebraically because it yields a small presentation matrix.
1624: 
1625: \subsubsection{Module presentation}
1626: Let $M$ be the $H_0$ persistence module.
1627: On a $2\times 2$ grid, $M$ is presented by generators corresponding to connected components and relations corresponding to mergers.
1628: %A concrete Macaulay2 template is:
1629: %
1630: %\begin{lstlisting}[language={},caption={Macaulay2 template: build a small bigraded persistence module}]
1631: %-- Base ring with bigrading
1632: %k = QQ
1633: %R = k[x,y, Degrees=>{{1,0},{0,1}}]
1634: %
1635: %-- Free module with generators in chosen degrees
1636: %F0 = R^{1}  -- adjust rank to number of generators
1637: %
1638: %-- Relations matrix d1: F1 -> F0
1639: %F1 = R^{1}
1640: %d1 = matrix{{x, y}}  -- replace with correct bigraded relation matrix
1641: %
1642: %M = coker d1
1643: %betti res M
1644: %\end{lstlisting}
1645: 
1646: The point is not that this exact matrix encodes the geometric toy perfectly; the point is that \emph{the entire pipeline} from filtration to module to resolution can be scripted in Macaulay2. 
1647: 
1648: \subsection{Toy computation 2: persistence from clock holonomy constraints}
1649: \label{sec:toy2}
1650: 
1651: Now we build a toy where the algebraic ``clock constraint'' is genuinely present.
1652: 
1653: Let $\Gamma$ be a cycle graph of length $m$ (a single face boundary).
1654: Attach to each vertex a clock generator $S_v$, and impose a holonomy constraint that the product around the cycle equals a central element:
1655: \begin{equation}
1656: \label{eq:holonomy_constraint}
1657: S_{v_1}S_{v_2}\cdots S_{v_m} = \pi^k I.
1658: \end{equation}
1659: 
1660: Interpret \eqref{eq:holonomy_constraint} as a \emph{family} of constraints indexed by two parameters:
1661: \begin{itemize}
1662: \item a correlation threshold $\lambda$ controlling which edges of the cycle are ``active'',
1663: \item a scale $r$ controlling whether the cycle is detected (needs all edges).
1664: \end{itemize}
1665: 
1666: Then the appearance/disappearance of the cycle in $K_{r,\lambda}$ correlates with satisfaction/violation of the holonomy constraint.
1667: This motivates a computational observable:
1668: \[
1669: \Delta(r,\lambda) := \left\| S_{v_1}\cdots S_{v_m} - \pi^k I\right\|
1670: \]
1671: (for an operator norm or spectral distance), treated as a function on parameter space.
1672: Taking sublevel sets $\{\Delta\le \epsilon\}$ yields an additional filtration direction; one can study a 3-parameter module in principle, but in practice one compresses by fixing $\epsilon$ and studying the induced 2-parameter persistence.
1673: 
1674: \begin{remark}[Why this is not vacuous]
1675: If $S_v$ are pure permutation shifts, the product around a cycle is often exactly identity (up to conjugacy), so $\Delta$ carries little information.
1676: If $S_v$ are twisted shifts $S_m(\pi)$, the product accumulates valuation factors; $\Delta$ becomes sensitive to gluing and to local ramification---exactly the ``time dilation'' lever.
1677: \end{remark}
1678: 
1679: \subsection{Stability: what multiparameter persistence can guarantee}
1680: \label{sec:stability}
1681: 
1682: The empirical pipeline (Section~\ref{ch:expts}) produces noisy estimates of $W_\psi(u,v)$.
1683: Therefore, any topological summary must be stable under perturbations.
1684: 
1685: One robust statement is:
1686: 
1687: \begin{proposition}[Stability of rank invariants (informal)]
1688: If two bifiltered complexes $(K_{r,\lambda})$ and $(K'_{r,\lambda})$ are $\varepsilon$--interleaved (with respect to an appropriate metric on the parameter plane), then their rank invariants differ by at most $\varepsilon$ in the induced parameter distortion.
1689: \end{proposition}
1690: 
1691: This is the correct multiparameter substitute for barcode stability.
1692: The generic-free-resolution technology in Appendix~B (Buchsbaum--Eisenbud style) is particularly useful because it identifies \emph{which algebraic features are stable and which are intrinsically unstable} (jump loci of determinantal varieties).
1693: 
1694: \subsection{Pipeline: from 10k-qubit hardware logs to persistence invariants}
1695: \label{sec:pipeline}
1696: 
1697: We now state an end-to-end pipeline in implementation form.
1698: Inputs are assumed to come from quantum hardware experiments as described in Section~\ref{ch:expts}.
1699: 
1700: \subsubsection*{Input}
1701: \begin{itemize}
1702: \item A hardware connectivity graph $G_{\mathrm{hw}}$ with $N\sim 10^4$ qubits.
1703: \item A chosen embedded graph model $\Gamma\subset \Sigma$ (logical graph) and a mapping of $\Gamma$ into $G_{\mathrm{hw}}$ via SWAP networks if needed.
1704: \item A family of circuits $U(\lambda)$ producing states $|\psi(\lambda)\rangle$, and measurement logs sufficient to estimate $W_\psi(u,v)$ on edges (at least for neighboring vertices in $\Gamma$).
1705: \end{itemize}
1706: 
1707: \subsubsection*{Steps}
1708: \begin{enumerate}
1709: \item \textbf{Estimate correlation weights.} Produce $W_\psi(u,v)$ (mutual information or proxy) with error bars.
1710: \item \textbf{Choose parameter grid.} Select radii $r_i$ and thresholds $\lambda_j$ based on quantiles of $W_\psi$ and graph diameters.
1711: \item \textbf{Build bifiltered complexes.} For each $(i,j)$ compute $K_{r_i,\lambda_j}$ (using clique enumeration on sparse graphs; for large $N$ restrict simplex dimension).
1712: \item \textbf{Compute homology.} Compute $H_k(K_{r_i,\lambda_j})$ for small $k$ (typically $k=0,1,2$) using sparse boundary matrices.
1713: \item \textbf{Assemble module.} Create the bigraded module $M$ by storing vector spaces and maps.
1714: \item \textbf{Compute invariants.} Compute rank invariant $\rho$ for selected pairs $(p,q)$ and/or compute a free resolution and Betti numbers on smaller induced submodules (windows) using Macaulay2.
1715: \item \textbf{Validate stability.} Perturb weights within error bars (bootstrap) and recompute invariants; stable invariants are candidates for physical interpretation.
1716: \end{enumerate}
1717: 
1718: \subsubsection*{Validation checks and failure modes}
1719: \begin{itemize}
1720: \item If $W_\psi$ is too noisy, thresholding produces spurious topological changes; mitigate via averaging and restricting to local neighborhoods.
1721: \item Clique complexes blow up combinatorially; mitigate by bounding simplex dimension (e.g.\ only up to triangles) and using witness complexes.
1722: \item Two-parameter resolutions are expensive; use windowed computations and rank invariants as primary summaries.
1723: \end{itemize}
1724: 
1725: \subsection{Where the surface-order structure enters computationally}
1726: \label{sec:where_order_enters}
1727: 
1728: The filtration above only used the embedded graph and entanglement weights.
1729: Surface orders contribute additional structure that can be injected in two ways:
1730: 
1731: \begin{enumerate}
1732: \item \textbf{Local degrees / valences.} Vertex order sizes $m_v$ determine the local clock dimension and hence the plausible correlation structure (e.g.\ higher valence $\Rightarrow$ more local degrees of freedom).
1733: \item \textbf{Valuations and twisted shifts.} Local uniformizers $\pi_v$ (or effective parameters derived from entanglement) modify the clock generators $S_v$; holonomy constraints then define an \emph{algebraic energy landscape} whose sublevel sets yield alternative filtrations.
1734: \end{enumerate}
1735: 
1736: The second mechanism is the one most directly tied to emergent time and gravity:
1737: it is how information-theoretic data can influence projective holonomy spectra in a way that mimics redshift.
1738: 
1739: 
1740: \part{Surface Orders, Twisted Shifts, and Classification}
1741: 
\chapter{Compact Gentle Surface Orders} · lines 1742–2928
1742: 	\chapter{Compact Gentle Surface Orders}
1743: 	
1744: 	\section{Orders and Burban-Drozd Gluing}
1745: 	\subsection{Definitions and Properties}
1746: 	\begin{defn}
1747: 		Let $R$ be a complete noetherian local domain with field of fractions $\KK$, and residue field $k$. An $R$-\textbf{Order} $\Lambda$ in a $k$-algebra $A$ is a unital subring of $A$ such that
1748: 		\begin{enumerate}
1749: 			\item $\KK \Lambda = A$, and
1750: 			\item $\Lambda$ is finitely generated as an $R$-module. 
1751: 		\end{enumerate}
1752: 		Let $C = [\sigma, \alpha, \phi]$ be a constellation, and let $\Gamma = \hookrightarrow \Sigma$ be the associated graph cellularly embedded in the closed Riemann surface $\Sigma$. Further, let $n(i)=n_i$ denote the length of the cycle given by $\sigma_i$\sidenote{Recall: for a constellation $C=[\sigma, \alpha, \phi]$ and the associated graph $\Gamma$ on a (compact) closed Riemann surface $\Sigma$, the length of the (nonzero) cycle in the gentle medial quiver $Q(C)$, associated to $\sigma_i$ is just the order of the cycle $\sigma_i$. Here we are using the notation $\sigma = \sigma_1\sigma_2 \cdots \sigma_r$, where $\sigma_i \in S_{[2m]}$ is a cycle permutation.}
1753: 		\begin{enumerate}
1754: 			\item For each cycle $\sigma_i \in \Gamma_0$ associated to the vertex $i$, we associate a local order $\Omega_i = \Omega(\sigma_i)$, and a regular principal ideal $\omega_i:= \omega_0(\sigma_i) \Omega_i = \Omega_i \omega_0(\sigma_i)$. 
1755: 			\item The \textbf{hereditary}\sidenote{An algebra, or an order, is hereditary if no module has a minimal projective resolution greater than length $1$. This means the \textit{projective dimension} of any module is no greater than $1$, and therefore the global dimension is at most $1$.} order associated to $\sigma_i$ is then given by
1756: 			\[
1757: 			\HH_i = \begin{pmatrix}
1758: 				\Omega_i & \omega_i & \omega_i & \cdots & \omega_i & \omega_i \\
1759: 				\Omega_i & \Omega_i & \omega_i & \cdots & \omega_i & \omega_i \\
1760: 				\Omega_i & \Omega_i & \Omega_i & \cdots & \omega_i & \omega_i \\
1761: 				\vdots 	   & \vdots      & \vdots     & \ddots & \vdots    & \vdots \\
1762: 				\Omega_i & \Omega_i & \Omega_i & \cdots & \Omega_i & \omega_i \\
1763: 				\Omega_i & \Omega_i & \Omega_i & \cdots & \Omega_i & \Omega_i \\
1764: 			\end{pmatrix}_{n(i)}
1765: 			\]
1766: 			\item Let $\Omega_i^{(k,k)}$ denote the $(k,k)$ entry of $\Omega_i$ in $\HH_i$. 
1767: 			\item For each $1 \leq k \leq n_i$ let
1768: 			\[ P_{i,k}:= \begin{pmatrix}
1769: 				\omega_i \\ \vdots \\ \omega_i \\ \Omega_i \\ \Omega_i \\\vdots \\ \Omega_i \\ \Omega_i
1770: 			\end{pmatrix} \]
1771: 			where the first entry equal to $\Omega_i$ is the $k^{th}$ row. 
1772: 		\end{enumerate}
1773: 	\end{defn}
1774: 	
1775: 	The modules $\{P_{i,k}: \ 1 \leq k \leq n_i\}$ give a complete set of non-isomorphic indecomposable projective $\HH_i
1776: 	$-modules, with the natural inclusions
1777: 	\[ P_{i,1} \hookleftarrow P_{i,2} \hookleftarrow \cdots \hookleftarrow P_{i,n_i-1} \hookleftarrow P_{i,n_i} 
1778: 	\hookleftarrow P_{i,1}. \]
1779: 	where the final map is given by left-multiplication by $\omega_0(\sigma_i)$. If we identify $P_{i,k}$ with the edge 
1780: 	$e_k^i = e_k(\sigma_i)$, where $\sigma_i = (e_1^i, e_2^i, ..., e_{n_i}^i)$ is a cyclic permutation, then the chain of 
1781: 	inclusions can be interpreted in terms of the cycle $\sigma_i$. From the embedding $\Gamma
1782: 	\hookrightarrow \Sigma$ given by the constellation $C = [\sigma, \alpha, \phi]$, this can be interpreted as walking 
1783: 	clockwise around the vertex of $\sigma_i$. We will take $P_{i,k} = P_{i,k+n_i}$, but each $e_k^i$ must be 
1784: 	multiplied by the automorphism $\sigma_i$ after one trip around the cycle, i.e. there is some multiplication by a 
1785: 	power of $\omega_0(\sigma_i)$ involved. 
1786: 	\indent In particular, conjugation by 
1787: 	\[ \underline{\omega}_i:= \begin{pmatrix}
1788: 		0 & 0 & 0 \cdots & 0 & \omega_0(\sigma_i) \\
1789: 		1 & 0 & 0 \cdots & 0 & 0 \\
1790: 		0 & 1 & 0 \cdots & 0 & 0 \\
1791: 		\vdots & \vdots & \vdots & \ddots & \vdots & \vdots \\
1792: 		0 & 0 & 0 \cdots & 0 & 0 \\
1793: 		0 & 0 & 0 \cdots & 1 & 0 
1794: 	\end{pmatrix}_{n_i} \]
1795: 
1796: % ============================================================
1797: % Expanded edition insertion: twisted shift, normalizer, and classification notes
1798: % ============================================================
1799: 
1800: \section{Local vertex orders and the \texorpdfstring{$\pi$}{pi}--twisted shift}
1801: \label{sec:twisted_shift}
1802: 
1803: The  main body already identifies the \emph{pure} cyclic successor at a valence-$m$ vertex with the permutation matrix $T_v$ ( \S3.4.1).
1804: However, in a local \emph{order}---especially a hereditary order over a discrete valuation ring---the natural successor that normalizes the order often picks up a uniformizer factor on the wrap-around step.  This is precisely the twisted shift we now define:
1805: \[
1806: S_{3}(\pi)=
1807: \begin{pmatrix}
1808: 0 & 0 & \pi \\
1809: 1 & 0 & 0 \\
1810: 0 & 1 & 0
1811: \end{pmatrix}.
1812: \]
1813: 
1814: \subsection{Set-up: hereditary order over a DVR}
1815: Let $(R,\mathfrak m)$ be a discrete valuation ring with uniformizer $\pi$ and fraction field $K$.
1816: The standard (Iwahori-type) hereditary order of type $m$ is
1817: \begin{equation}
1818: \label{eq:hereditary_order}
1819: \Lambda_m(R)=
1820: \begin{pmatrix}
1821: R & R & \cdots & R\\
1822: \pi R & R & \cdots & R\\
1823: \vdots & \vdots & \ddots & \vdots\\
1824: \pi R & \pi R & \cdots & R
1825: \end{pmatrix}
1826: \subset \mathrm{Mat}_m(K).
1827: \end{equation}
1828: This is the local model appearing (in slightly different notation) in the source text in Appendix~A, and it is also the canonical ``vertex order'' for a cycle of length $m$ in a dessin order.
1829: 
1830: \subsection{The twisted shift and its basic algebra}
1831: 
1832: \begin{definition}[$\pi$--twisted successor]
1833: For $m\ge 2$, define the $\pi$--twisted shift (companion) matrix
1834: \begin{equation}
1835: \label{eq:twisted_shift_def}
1836: S_m(\pi)=
1837: \begin{pmatrix}
1838: 0 & 0 & \cdots & 0 & \pi\\
1839: 1 & 0 & \cdots & 0 & 0\\
1840: 0 & 1 & \cdots & 0 & 0\\
1841: \vdots & \vdots & \ddots & \vdots & \vdots\\
1842: 0 & 0 & \cdots & 1 & 0
1843: \end{pmatrix}\in \mathrm{Mat}_m(K).
1844: \end{equation}
1845: \end{definition}
1846: 
1847: \begin{lemma}[Order-compatibility]
1848: \label{lem:twisted_shift_normalizes}
1849: $S_m(\pi)$ normalizes the hereditary order $\Lambda_m(R)$ in the sense that
1850: \[
1851: S_m(\pi)\,\Lambda_m(R)\,S_m(\pi)^{-1}=\Lambda_m(R).
1852: \]
1853: In particular, conjugation by $S_m(\pi)$ is an automorphism of the local order and is therefore an ``allowed'' symmetry (a clock move) in the operator-algebra interpretation.
1854: \end{lemma}
1855: 
1856: \begin{proof}
1857: A direct computation using the valuation filtration on matrix entries is easiest.
1858: Conjugation by the pure permutation matrix cyclically permutes the standard lattice chain
1859: \[
1860: R^m \supset \mathfrak m\oplus R^{m-1} \supset \mathfrak m^2\oplus \mathfrak m\oplus R^{m-2}\supset \cdots
1861: \]
1862: that defines $\Lambda_m(R)$ as its endomorphism ring.
1863: The $\pi$ in the $(1,m)$ entry exactly compensates the valuation jump on the wrap-around step so that the lattice chain is preserved rather than shifted out of phase.
1864: Equivalently, one checks on matrix units $E_{ij}$ that valuations transform compatibly: the entries that must lie in $\pi R$ remain in $\pi R$ after conjugation.
1865: \end{proof}
1866: 
1867: \begin{proposition}[Central power relation]
1868: \label{prop:twisted_shift_power}
1869: The twisted shift satisfies
1870: \[
1871: S_m(\pi)^m = \pi\, I_m.
1872: \]
1873: Consequently, in the projective linear group $\PGL_m(K)$ the class of $S_m(\pi)$ has \emph{finite order} dividing $m$.
1874: \end{proposition}
1875: 
1876: \begin{proof}
1877: Apply $S_m(\pi)$ to the standard basis vectors $e_1,\dots,e_m$:
1878: $S e_i=e_{i+1}$ for $i<m$ and $S e_m=\pi e_1$.
1879: Iterating $m$ times maps each basis vector to $\pi$ times itself, hence $S^m=\pi I$.
1880: \end{proof}
1881: 
1882: \begin{remark}[Why this matters for time holonomy]
1883: The  discussion of cyclic time (as torsion holonomy) becomes more rigid in the presence of Proposition~\ref{prop:twisted_shift_power}:
1884: even if $S_m(\pi)$ has infinite order in $\GL_m(K)$ (because $\pi$ is not a root of unity), its projective class is torsion.
1885: This is the algebraic shadow of a geometric fact: local time may be ``non-compact'' (a $\Z$--cover), while global time is cyclic up to a central scaling that is invisible to projective measurements.
1886: \end{remark}
1887: 
1888: \subsection{Spectral geometry viewpoint}
1889: If $K=\C((t))$ and $\pi=t$, the eigenvalues of $S_m(t)$ are the roots of $x^m-t=0$,
1890: i.e.\ $t^{1/m}\zeta_m^j$.
1891: Thus the twisted shift is a discrete model of a clock with a tunable ``rate'' set by the valuation of $\pi$.
1892: Later chapters will exploit this to connect:
1893: \[
1894: \text{entanglement density} \;\longrightarrow\; \text{effective valuation data} \;\longrightarrow\; \text{clock redshift}.
1895: \]
1896: 
1897: \section{How the corrigendum and twisted shift plug into the main narrative}
1898: \label{sec:corrigendum_plug_in}
1899: 
1900: Two themes introduced here reappear everywhere:
1901: 
1902: \begin{enumerate}
1903: \item \textbf{Orientation and time.}  The double-$3$--cycle on the sphere makes the time-orientation choice algebraic, not rhetorical: two opposite cycles correspond to two local time directions, and relations determine whether and how one can switch.
1904: \item \textbf{Ramification and clock drift.}  The factor $\pi$ in $S_m(\pi)$ is the minimal local datum that can create global drift/holonomy effects when orders are glued.  In Chapter~\ref{ch:gluing} we make this precise by describing gluing as a cocycle valued in normalizers of local orders.
1905: 
1906: 
1907: \subsection{Vertex-cycle moves, forbidden face cycles, and reversal by switching to an adjacent vertex cycle}
1908: \label{sec:vertex_cycle_reversal_switching}
1909: 
1910: The phrase ``choose an orientation and walk around the vertex cycle'' hides a subtlety that becomes important once we insist that
1911: \emph{only certain cycles survive in the quotient by the gentle ideal}.
1912: Because the Hilbert--Pólya/GRH section uses these cycles as \emph{clock} degrees of freedom, we spell out the combinatorics carefully.
1913: 
1914: \subsubsection{Dessin permutations versus quiver relations}
1915: 
1916: For a bipartite dessin (or, equivalently, the monodromy of a Belyi map) we have a permutation triple
1917: \[
1918: (\sigma_0,\sigma_1,\sigma_\infty)\ \in\ S_D^3,\qquad \sigma_0\sigma_1\sigma_\infty=1,
1919: \]
1920: acting on the dart set $D$ (oriented half-edges).
1921: Cycles of $\sigma_0$ encode black vertices, cycles of $\sigma_1$ encode white vertices, and cycles of $\sigma_\infty$ encode faces.
1922: 
1923: In the constellation notation used earlier, one often writes $C=[\sigma,\alpha,\phi]$ with $\alpha$ the edge-involution and
1924: $\phi=\alpha\sigma^{-1}$ the face permutation.
1925: In the special ``bipartite'' viewpoint of Section~\ref{sec:hp_worked_example_torus_bipartite} we literally identify
1926: \[
1927: (\sigma_0,\sigma_1,\sigma_\infty)=(\sigma,\alpha,\phi),
1928: \]
1929: but for the discussion below it is enough to remember:
1930: 
1931: \begin{quote}
1932: \emph{$\sigma_0$ and $\sigma_1$ are vertex permutations; $\sigma_\infty$ is the face permutation.}
1933: \end{quote}
1934: 
1935: Now pass to the associated gentle surface algebra (or order) $\Lambda=k Q/I$.
1936: The gentle relations are exactly the statement that, at each step, there is a unique ``forbidden'' continuation in the ideal $I$ and a unique ``allowed'' continuation not in~$I$.
1937: Equivalently (using the standard permutation formalism for $2$--regular gentle quivers), there are two permutations on arrows:
1938: \begin{itemize}
1939: \item a successor permutation $\sigma$ whose cycles are the \emph{allowed} directed cycles (``vertex cycles'' in our surface/dessin models), and
1940: \item a successor permutation $\phi$ whose cycles are the \emph{anti-cycles} (cycles of zero relations), i.e.\ the compositions along these cycles land in~$I$.
1941: \end{itemize}
1942: In the bipartite dessin setting, the allowed cycles are precisely the vertex cycles coming from $\sigma_0$ and $\sigma_1$,
1943: whereas the face cycles coming from $\sigma_\infty$ are the anti-cycles:
1944: \begin{quote}
1945: \emph{walking around a $\sigma_0$- or $\sigma_1$-vertex is allowed (not in $I$), while attempting to walk around a $\sigma_\infty$-face is killed by the ideal.}
1946: \end{quote}
1947: 
1948: \subsubsection{What ``reversal'' means algebraically: inverse arrows and forced switching}
1949: 
1950: A directed walk in the quiver uses arrows in their orientation.
1951: To model a geometric walk that sometimes goes \emph{against} the arrow orientation (e.g.\ reversing direction along a cycle),
1952: one uses the standard string-algebra convention: for each arrow $a$ one introduces a formal inverse symbol $a^{-1}$,
1953: interpreted as traversing the same geometric edge in the opposite direction.
1954: 
1955: In a gentle quiver, a ``string'' is a word in arrows and inverse arrows with two constraints:
1956: (i) no immediate cancellation $aa^{-1}$ or $a^{-1}a$, and
1957: (ii) no forbidden subword whose corresponding length-$2$ path lies in the ideal $I$.
1958: Because every vertex has out-degree $2$, these constraints have a striking consequence:
1959: 
1960: \begin{quote}
1961: \emph{If you traverse an arrow $a$ and then reverse (use $a^{-1}$), the next step is forced: you must exit along the \textbf{other} outgoing arrow at that vertex, hence you jump to the \textbf{adjacent} vertex cycle.}
1962: \end{quote}
1963: 
1964: In the dessin language, this is exactly the reversal move described above:
1965: starting from an allowed vertex cycle (coming from $\sigma_0$ or $\sigma_1$), a reversal against the quiver arrows forces you onto the
1966: adjacent allowed cycle at the same edge (the other endpoint of that edge), rather than allowing you to continue around a face.
1967: The forbidden alternative would be to follow the face permutation $\sigma_\infty$, but that continuation is precisely what the ideal~$I$ forbids.
1968: 
1969: \subsubsection{Translation into clock operators: forward shifts, backward shifts, and ``different shifts''}
1970: 
1971: Fix a vertex $v$ of valence $m_v$ carrying a DVR $(R_v,\pi_v)$ and ramification exponent $e_v$.
1972: On the corresponding local projective chain (or, in the quantum model, on the local Hilbert space with basis $\{\ket{1},\dots,\ket{m_v}\}$)
1973: the forward cyclic motion is implemented by the twisted shift
1974: \[
1975: S_v:=S_{m_v}(\pi_v^{e_v}),
1976: \qquad
1977: S_{m}(\pi^e)=
1978: \begin{pmatrix}
1979: 0 & 0 & \cdots & 0 & \pi^e\\
1980: 1 & 0 & \cdots & 0 & 0\\
1981: 0 & 1 & \cdots & 0 & 0\\
1982: \vdots & \vdots & \ddots & \vdots & \vdots\\
1983: 0 & 0 & \cdots & 1 & 0
1984: \end{pmatrix},
1985: \]
1986: so that $S_v^{m_v}=\pi_v^{e_v}I$ and the valuation of $\pi_v^{e_v}$ measures the local ``clock defect''.
1987: 
1988: \begin{lemma}[Explicit inverse (backward shift)]
1989: \label{lem:twisted_shift_inverse}
1990: For any $m\ge 2$ and $e\ge 1$,
1991: \[
1992: S_m(\pi^e)^{-1}=
1993: \begin{pmatrix}
1994: 0 & 1 & 0 & \cdots & 0\\
1995: 0 & 0 & 1 & \cdots & 0\\
1996: \vdots &  & \ddots & \ddots & \vdots\\
1997: 0 & 0 & \cdots & 0 & 1\\
1998: \pi^{-e} & 0 & \cdots & 0 & 0
1999: \end{pmatrix},
2000: \qquad\text{and hence}\qquad
2001: \bigl(S_m(\pi^e)^{-1}\bigr)^m=\pi^{-e}I.
2002: \]
2003: \end{lemma}
2004: 
2005: \begin{proof}
2006: On the standard basis vectors $\ket{k}$, the defining relations are
2007: \[
2008: S_m(\pi^e)\ket{k}=\ket{k+1}\ (1\le k\le m-1),\qquad S_m(\pi^e)\ket{m}=\pi^e\ket{1}.
2009: \]
2010: The displayed matrix is the unique linear map with
2011: \[
2012: S_m(\pi^e)^{-1}\ket{k}=\ket{k-1}\ (2\le k\le m),\qquad S_m(\pi^e)^{-1}\ket{1}=\pi^{-e}\ket{m},
2013: \]
2014: and a direct multiplication check gives $S_m(\pi^e)\,S_m(\pi^e)^{-1}=I=S_m(\pi^e)^{-1}S_m(\pi^e)$.
2015: Raising to the $m$th power yields the central factor $\pi^{-e}$.
2016: \end{proof}
2017: 
2018: Lemma~\ref{lem:twisted_shift_inverse} is the clean operator-algebraic avatar of ``walking around the same vertex cycle in the opposite direction'':
2019: \begin{quote}
2020: \emph{reversing direction replaces the forward shift $S_v$ by the backward shift $S_v^{-1}$, and inverts the central defect factor.}
2021: \end{quote}
2022: 
2023: Now incorporate the \emph{adjacent-cycle switch}.
2024: If an edge $e$ joins vertices $v$ and $w$ (in the bipartite case: a black vertex and a white vertex), then a reversal at~$e$
2025: forces a jump from the $v$-cycle to the $w$-cycle.
2026: On the quantum side, this is implemented by the edge identification/isometry (a bimodule map in the order language)
2027: \[
2028: U_e:\cH_v\supset \cH_{v\to e}\ \longrightarrow\ \cH_{w\to e}\subset \cH_w,
2029: \]
2030: between the edge ``corner'' subspaces at~$e$.
2031: Conjugating by $U_e$ transports shifts across the gluing.
2032: The essential point is that \emph{different vertices generally carry different local data} (different $m$, different $\pi$, different $e$),
2033: so an adjacent-cycle reversal is not merely $S_v^{-1}$ but typically a \textbf{different shift operator}:
2034: \[
2035: \text{reverse at an edge} \quad\leadsto\quad
2036: S_v^{-1}\ \text{on one side}\ \simeq\ U_e^{-1}\,S_w^{\pm 1}\,U_e\ \text{on the other side}.
2037: \]
2038: This is exactly the mechanism by which a local ``time reversal'' move changes the valuation/holonomy bookkeeping:
2039: in the homogeneous case it flips the power of~$\pi$, while in the heterogeneous case it also changes \emph{which} uniformizer appears.
2040: 
2041: \begin{remark}[Why $\sigma_\infty$ is singled out]
2042: In an oriented bipartite dessin one has the face-step identity
2043: $\sigma_\infty=(\sigma_0\sigma_1)^{-1}=\sigma_1\sigma_0^{-1}$ (when $\sigma_1$ is an involution, as in many toy models).
2044: Thus walking once around a face alternates a \emph{backward} black turn ($\sigma_0^{-1}$) with a \emph{forward} white turn ($\sigma_1$).
2045: In the gentle algebra this alternation is precisely what is killed by the ideal: face cycles are anti-cycles.
2046: The only way to realize ``backward'' motion without falling into the ideal is therefore to treat it as a string move (inverse arrow) and, equivalently, to switch to the adjacent vertex cycle as described above.
2047: \end{remark}
2048: 
2049: \subsubsection{How the adjacent-cycle reversal argument proves the claim (and why total positivity shows up)}
2050: \label{sec:how_reversal_proves_it}
2051: 
2052: The previous subsubsections stated the reversal rule in words.
2053: Here we make the logical implication explicit: \emph{the gentle relations force reversal to be implemented by switching to the adjacent vertex cycle, and this forced switching is exactly what later lets us package ``one tick'' of evolution as a planar network (wiring diagram) with positive weights.}
2054: Both points are ultimately local.
2055: 
2056: \begin{proposition}[Reversal forces switching to the adjacent allowed cycle]
2057: \label{prop:reversal_forces_switching_adjacent_cycle}
2058: Let $\Lambda=kQ/I$ be the gentle algebra (or order) attached to a bipartite dessin, and assume $Q$ is $2$--regular in the standard sense: at each vertex there are exactly two arrows leaving and exactly two arrows entering, and $I$ is generated by length-$2$ zero relations with the gentle uniqueness property.
2059: 
2060: Fix an arrow $a:u\to v$ of $Q$ and consider the corresponding \emph{string} model, i.e.\ reduced words in arrows and formal inverses subject to
2061: (i) no immediate cancellation $aa^{-1}$ or $a^{-1}a$, and
2062: (ii) no forbidden length-$2$ subword whose oriented interpretation lies in the ideal $I$.
2063: Suppose a string contains the letter $a^{-1}$, meaning that the walk traverses the underlying geometric edge in the direction \emph{opposite} the quiver arrow.
2064: 
2065: Then any continuation of the string past $a^{-1}$ that remains reduced and avoids the ideal must \emph{exit the vertex $u$ along the other outgoing arrow} $b\neq a$.
2066: In particular, the walk leaves the permitted cycle in which $a$ occurs and enters the permitted cycle that is adjacent across the edge (the vertex cycle associated to the other endpoint of the underlying edge in the dessin).
2067: \end{proposition}
2068: 
2069: \begin{proof}
2070: After traversing $a^{-1}$ the walk is located at the tail $u$ of $a$.
2071: Because the word is reduced, the next letter cannot be $a$ (this would create the forbidden cancellation subword $a^{-1}a$).
2072: By $2$--regularity there are exactly two arrows leaving $u$, namely $a$ and a distinct arrow $b$.
2073: Hence the next arrow-oriented step must involve $b$ (either $b$ or $b^{-1}$ depending on whether one continues with or against the arrow orientation).
2074: 
2075: What remains is to exclude the possibility that this continuation keeps one on the same permitted cycle.
2076: In a gentle quiver, each vertex has \emph{exactly one} permitted continuation and \emph{exactly one} forbidden continuation for each incoming arrow.
2077: Equivalently, the local successor permutations split the two outgoing arrows at $u$ into:
2078: \begin{itemize}
2079: \item the arrow that continues an \emph{allowed} (permitted) cycle, and
2080: \item the arrow that continues a \emph{forbidden} (anti-)cycle (a length-$2$ path in $I$).
2081: \end{itemize}
2082: If one attempts to ``reverse while staying on the same vertex cycle'', the only combinatorially available way to do so is to glue the reversal to a face-step (a $\sigma_\infty$ move), because in the dessin identity
2083: $\sigma_\infty=(\sigma_0\sigma_1)^{-1}$ the backward vertex motion is paired with the forward motion at the opposite color.
2084: But face cycles are precisely the anti-cycles killed by $I$.
2085: Therefore the would-be continuation that realizes a face-step is disallowed by constraint (ii), and the only reduced continuation that remains is the other outgoing arrow~$b$, which lands on the adjacent permitted cycle.
2086: \end{proof}
2087: 
2088: \begin{corollary}[Clock interpretation: ``reverse'' is not an involution on one cycle but a conjugated shift on the neighbor]
2089: \label{cor:reverse_is_conjugated_shift}
2090: In the operator model of Section~\ref{sec:vertex_cycle_reversal_switching}, let $S_v$ denote the forward twisted shift on the vertex-cycle Hilbert space $\cH_v$.
2091: A local reversal at an edge $e=(v,w)$ cannot be implemented as a closed walk that stays entirely on the $v$-cycle.
2092: Instead it is implemented by switching to the adjacent cycle and transporting the shift across the gluing:
2093: \[
2094: \text{reverse at }e\quad\rightsquigarrow\quad
2095: S_v^{-1}\ \simeq\ U_e^{-1}\,S_w^{\pm 1}\,U_e,
2096: \]
2097: where $U_e$ is the edge identification/isometry and the sign depends on the chosen local convention for ``forward'' around~$w$.
2098: Because $m_v,\pi_v,e_v$ need not equal $m_w,\pi_w,e_w$, the operator on the right-hand side is generally a \emph{different} shift (different dimension and/or different defect factor), exactly as claimed.
2099: \end{corollary}
2100: 
2101: \begin{remark}[Where total positivity enters the proof pipeline]
2102: The forced switching has a practical analytic payoff.
2103: Once reversals are realized as \emph{moves between adjacent vertex cycles}, one can draw one-tick evolution (forward steps + switches) as a \emph{planar network} whose local gadgets are the allowed crossings/switches.
2104: Assign strictly positive weights to each local gadget (Boltzmann weights, channel Kraus weights, or learned attention weights).
2105: Then the one-tick transfer matrix is the weight matrix of that planar network, hence is totally nonnegative by the Lindstr\"om--Gessel--Viennot lemma (Theorem~\ref{thm:LGV}) and is totally positive under mild irreducibility/strictness assumptions (Corollary~\ref{cor:wiring_TN}).
2106: If, additionally, the weights satisfy a discrete detailed-balance/reflection symmetry so that the transfer matrix is symmetric, then
2107: Theorem~\ref{thm:tp_positive_energy} applies and produces a \emph{self-adjoint} Hamiltonian (or modular Hamiltonian) with nonnegative spectrum after an affine normalization.
2108: This is the precise sense in which the wiring-diagram/total-positivity technology ``proves the result'' claimed earlier: it turns purely combinatorial admissibility constraints into a checkable spectral certificate.
2109: \end{remark}
2110: 
2111: 
2112: 
2113: 
2114: \end{enumerate}
2115: 
2116: \section{Classification notes: local hereditary orders, larger twisted shifts, and surface-order gluings}
2117: 
2118: \label{ch:classification}
2119: 
2120: 
2121: One request for the expanded edition was to fill in ``mathematical gaps'' around
2122: surface-order classification and the operator shifts in larger local vertex orders.
2123: This chapter collects the minimum classification statements needed later, together with proof sketches that
2124: are standard but easy to lose track of when one jumps between topology, algebra, and physics.
2125: 
2126: \subsection{Hereditary orders over a DVR are endomorphism rings of lattice chains}
2127: \label{sec:lattice_chains}
2128: 
2129: Let $R$ be a discrete valuation ring with uniformizer $\pi$ and fraction field $K$.
2130: Let $V=K^m$.
2131: 
2132: \begin{definition}[Lattice and lattice chain]
2133: An $R$-lattice in $V$ is a finitely generated $R$-submodule $L\subset V$ such that $K\otimes_R L\cong V$.
2134: A \emph{lattice chain} of period $m$ is a sequence
2135: \[
2136: L_0 \supset L_1 \supset \cdots \supset L_{m-1} \supset \pi L_0
2137: \]
2138: with successive quotients $L_i/L_{i+1}$ of rank $1$ over the residue field.
2139: \end{definition}
2140: 
2141: \begin{theorem}[Classical classification of hereditary orders (standard)]
2142: \label{thm:hereditary_classification}
2143: For $A=\mathrm{Mat}_m(K)$, hereditary $R$-orders in $A$ are precisely endomorphism rings of lattice chains:
2144: \[
2145: \Lambda \text{ hereditary } \Longleftrightarrow \exists\ (L_\bullet)\ \text{ lattice chain with }\Lambda=\End_R(L_\bullet),
2146: \]
2147: where $\End_R(L_\bullet)$ denotes the set of endomorphisms preserving the entire chain.
2148: Moreover, two hereditary orders are conjugate in $\GL_m(K)$ iff their lattice chains are isomorphic (up to shift of indices).
2149: \end{theorem}
2150: 
2151: \begin{proof}[Proof sketch]
2152: If $\Lambda$ is hereditary, its Jacobson radical $J(\Lambda)$ defines a filtration on the unique (up to iso) indecomposable projective modules.
2153: Choosing a primitive idempotent gives a lattice whose successive radical powers yield a chain.
2154: Conversely, $\End_R(L_\bullet)$ is hereditary because submodules correspond to subchains and projective dimension is controlled by the chain length.
2155: \end{proof}
2156: 
2157: \begin{remark}
2158: The explicit matrix form \eqref{eq:hereditary_order} is obtained by choosing a basis adapted to the chain.
2159: In this basis, the $(i,j)$ entry lies in $\pi R$ precisely when the endomorphism must map $L_j$ into $L_{i}$ with one valuation drop.
2160: \end{remark}
2161: 
2162: \subsection{Normalizer and the larger analogues of the twisted shift}
2163: \label{sec:normalizer_shifts}
2164: 
2165: Fix the standard lattice chain
2166: \[
2167: L_i = \pi^i R e_1 \oplus \pi^i R e_2 \oplus \cdots \oplus \pi^i R e_{m-i}
2168: \oplus \pi^{i+1}R e_{m-i+1}\oplus \cdots \oplus \pi^{m-1}R e_m,
2169: \]
2170: whose endomorphism ring is the Iwahori order \eqref{eq:hereditary_order}.
2171: The twisted shift $S_m(\pi)$ is the unique (up to units) element that cyclically permutes this chain.
2172: 
2173: More generally, one can introduce \emph{ramification exponent} $e\ge 1$ and define
2174: \begin{equation}
2175: \label{eq:twisted_shift_e}
2176: S_m(\pi^e)=
2177: \begin{pmatrix}
2178: 0 & 0 & \cdots & 0 & \pi^e\\
2179: 1 & 0 & \cdots & 0 & 0\\
2180: 0 & 1 & \cdots & 0 & 0\\
2181: \vdots & \vdots & \ddots & \vdots & \vdots\\
2182: 0 & 0 & \cdots & 1 & 0
2183: \end{pmatrix},
2184: \end{equation}
2185: which satisfies $(S_m(\pi^e))^m=\pi^e I$.
2186: 
2187: \begin{proposition}[Normalizer generator (useful form)]
2188: \label{prop:normalizer_generator}
2189: The normalizer of $\Lambda_m(R)$ in $\GL_m(K)$ is generated by:
2190: \begin{itemize}
2191: \item $\Lambda_m(R)^\times$ (units of the order),
2192: \item and the class of $S_m(\pi)$ (or $S_m(\pi^e)$ for the appropriate chain period).
2193: \end{itemize}
2194: In particular, any normalizer element induces a permutation (rotation) of the lattice chain, with a valuation factor determined by the number of wrap-arounds.
2195: \end{proposition}
2196: 
2197: \begin{remark}[Clock interpretation]
2198: This says: the only genuinely new clock move beyond local gauge (units) is the successor that rotates the chain.
2199: Thus the ``shift with a $\pi$'' is not an ad hoc insertion; it is forced by the structure of hereditary orders.
2200: \end{remark}
2201: 
2202: \subsection{Surface orders from embedded graphs: classification by local types plus gluing}
2203: \label{sec:surface_order_classification}
2204: 
2205: A surface order in this project is a global object built by gluing local hereditary orders assigned to vertices (cycles) of an embedded graph/dessin.
2206: The source text in Appendix~A of the  volume explains this construction in detail for dessin orders.
2207: 
2208: We record the abstract classification statement in the language of Section~\ref{ch:gluing}.
2209: 
2210: \begin{theorem}[Classification template for clocked surface orders]
2211: \label{thm:surface_order_template}
2212: Fix a surface $X$ with an embedded graph $\Gamma\subset X$ giving a cellular decomposition.
2213: A clocked surface order up to Morita equivalence is determined by:
2214: \begin{enumerate}
2215: \item the underlying cellulation type (combinatorics of $\Gamma$),
2216: \item for each vertex $v$, a local hereditary order type (equivalently a lattice chain period $m_v$ and ramification exponent $e_v$),
2217: \item a gluing cocycle class $[g]\in \check{H}^1(X;\Aut(\Lambda))$ compatible with incidence data,
2218: \item and (optionally) a choice of clock generators $S_v=S_{m_v}(\pi^{e_v})$ in each stalk (compatible under gluing).
2219: \end{enumerate}
2220: \end{theorem}
2221: 
2222: \begin{proof}[Proof sketch]
2223: Local equivalence classes are fixed by Theorem~\ref{thm:hereditary_classification}.
2224: Gluing is precisely \v{C}ech data up to coboundary, giving $H^1$-classification of torsors.
2225: Morita equivalence suppresses choices of idempotent refinements but preserves local periods and holonomy classes.
2226: \end{proof}
2227: 
2228: \begin{remark}[What is still nontrivial]
2229: The theorem is a template: to make it fully explicit in a given example, one must compute $\Aut(\Lambda)$, choose the cover, and describe cocycle representatives in terms of the dessin permutations.
2230: This is exactly what the source text in Appendix~A does in a concrete combinatorial language.
2231: \end{remark}
2232: 
2233: \subsection{Why this matters for multiparameter persistence}
2234: \label{sec:classification_persistence}
2235: 
2236: Multiparameter persistence is most useful when the underlying model space has \emph{strata} and \emph{jump loci}.
2237: The classification above supplies those:
2238: 
2239: \begin{itemize}
2240: \item changing $(m_v,e_v)$ moves you between local-order strata (discrete jumps),
2241: \item varying the gluing cocycle $[g]$ moves you in a moduli-like space (often discrete but may have continuous parameters if phases are allowed),
2242: \item the rank invariants and determinantal jump loci in Appendix~B become diagnostics for which stratum you are in (or near).
2243: \end{itemize}
2244: 
2245: Thus classification and persistence are not separate topics: classification tells you what ``parameters'' exist, and persistence tells you which parameters are stable under noisy measurement.
2246: 
2247: 
2248: 	cyclically permutes the indecomposable projective $\HH_i$-modules $P_{i,k}$, and it induces an automorphism of $
2249: 	\HH_i$ which we also call $\sigma_i$. Now, for each cycle $\sigma_p, \sigma_q \in S_{[2m]}$ of $\sigma$, we fix an 
2250: 	isomorphism
2251: 	\[ \Omega_p/\omega_p \cong \Omega_q/\omega_q. \] 
2252: 	Identifying all such rings, let $\overline{\Omega} = \Omega_i/\omega_i$ for all $\sigma_i \in \Gamma_0$. Let $
2253: 	\pi_i: \Omega_i \to \overline{\Omega}$ be a fixed epimorphism with kernel $\omega_i$. Now, we have a pull-back 
2254: 	diagram
2255: 	\[ 
2256: 	\xymatrix{
2257: 		\Omega_{p,q} \ar[r]^{\tilde{\pi}_p}  \ar[d]_{\tilde{\pi}_q} & \Omega_p \ar[d]^{\pi_p} \\
2258: 		\Omega_q \ar[r]_{\pi_q} & \overline{\Omega}. 
2259: 	}
2260: 	\]
2261: 	which is in general different and non-isomorphic for different choices of $\pi_p$ and $\pi_q$.
2262: 	
2263: 	\begin{defn}
2264: 		Let $\HH = \prod_{\sigma_i \in \Gamma_0} \HH_i$. Let $e_k^i$ be an edge around $\sigma_i$, and let $
2265: 		\alpha_{i,j}^{k,l} = (e_k^i, e_l^j)$ be a $2$-cycle of the fixed-point free involution $\alpha$ of $C=[\sigma, \alpha, \phi]$ giving the end vertices $
2266: 		\sigma_i$ and $\sigma_j$ of the edge $e_k^i \equiv e_l^j$ under the gluing identifying the half-edges $e_k^i$ and 
2267: 		$e_l^j$. It is possible that $\sigma_i=\sigma_j$ if $\alpha_{i,j}^{k,l}$ defines a loop at the vertex $\sigma_i$ in $
2268: 		\Gamma$. We replace the product $\Omega_i^k \times \Omega_j^l$ in $\HH_i \times \HH_j$ with $\Omega_{i,j}$. 
2269: 		This identifies the $(k,k)$ entry of $\HH_i$ with the $(l,l)$ entry of $\HH_j$, modulo $\omega$. Doing this for all 
2270: 		edges of $\Gamma$, we get the \textbf{Constellation Order} or the (compact) \textbf{Gentle Surface Order} $\Lambda:= 
2271: 		\Lambda(C) = \Lambda(\Gamma)$ associated to the constellation $C$, or equivalently to the embedded 
2272: 		graph $\Gamma \hookrightarrow \Sigma$. 
2273: 	\end{defn}
2274: 	
2275: 	\begin{prop}
2276: 		\begin{enumerate}
2277: 			\item The indecomposable projective $\Lambda$-modules are in bijection with the $2$-cycles $(e^i_k, e^j_l)=\alpha^{i,j}_{k,l}$, of $\alpha \in S_{2m}$ for the constellation $C=[\sigma, \alpha, \phi]$. Equivalently, the indecomposable projectives are in bijection with the edges $\Gamma_1$. We label them as $P_{e}$ for $\alpha_{i,j}^{k,l} = e = (e^i_k, e^j_l) \in \Gamma_1$ attached to the vertices $\sigma_i$ and $\sigma_j$. 
2278: 			\item Each indecomposable projective $\Lambda$-module is a pullback,
2279: 			\[
2280: 			\xymatrix{
2281: 				P_e \ar[r] \ar[d] & P_{i,k} \ar[d] \\
2282: 				P_{j,l} \ar[r] & \overline{\Omega}
2283: 			}
2284: 			\]
2285: 			where the $P_{i,k}$ is an indecomposable projective module in $\HH_i$, and $P_{j,l}$ is an indecomposable 
2286: 			projective of $\HH_j$.
2287: 			\item From this we obtain the following commutative diagram with exact rows and columns,
2288: 			\[
2289: 			\begin{tikzcd}
2290: 				& 0 & 0 & 0 &  \\
2291: 				0 \arrow[r] & P_{i,k-1} \arrow[u] \arrow[r] & P_{i,k} \arrow[r] \arrow[u] & \overline{\Omega} \arrow[r] \arrow[u] & 0 \\
2292: 				0 \arrow[r] & P_{i,k-1} \arrow[u] \arrow[r] & P_e \arrow[u] \arrow[r] & P_{j,l} \arrow[u] \arrow[r] & 0 \\
2293: 				0 \arrow[r] & 0 \arrow[u] \arrow[r] & P_{j,l-1} \arrow[u] \arrow[r] & P_{j,l-1} \arrow[u] \arrow[r] & 0 \\
2294: 				& 0 \arrow[u] & 0 \arrow[u] & 0 \arrow[u] & 
2295: 			\end{tikzcd}
2296: 			\]
2297: 			\item $\ker(P_e \to P_{i,k})$ and $\ker(P_e \to P_{j,l})$ are projective $\HH_j$ and $\HH_i$-modules respectively, local $\Lambda$-modules, and are uniserial. 
2298: 		\end{enumerate}
2299: 	\end{prop}
2300: 	
2301: 	
2302: 	
2303: 	
2304: 	\subsection{A Basic Example}
2305: 	
2306: 	\begin{ex}
2307: 		Let $R$ have maximal ideal $\mathfrak{m} = \la m \ra$, with residue field $k=R/\mathfrak{m}$, and field of fractions $\KK=R_{\mathfrak{m}}$. 
2308: 		Let $\Gamma$ be the genus zero graph,  
2309: 		\[
2310: 		\xymatrix{
2311: 			\sigma_1 \ar@{-}[r]^{\alpha_{1}} & \sigma_2 \ar@{-}[r]^{\alpha_{2}} & \sigma_3 \ar@{-}[r]^{\alpha_{3}} & \sigma_4
2312: 		}
2313: 		\]
2314: 		given by the constellation $C=[\sigma, \alpha, \phi]$ such that 
2315: 		$\sigma = (1)(2,3)(4,5)(6) = \sigma_1 \sigma_2 \sigma_3 \sigma_4$, and $\alpha = (1,2)(3,4)(5,6) = (e_1)(e_2)(e_3)$. We may take 
2316: 		\[ \HH = \left\lbrace \begin{pmatrix}
2317: 			a_{11} 
2318: 		\end{pmatrix}, \begin{pmatrix}
2319: 			b_{11} & b_{12} & \\
2320: 			b_{21} & b_{22} & 
2321: 		\end{pmatrix}, \begin{pmatrix}
2322: 			c_{11} & c_{12} & \\
2323: 			c_{21} & c_{22} & 
2324: 		\end{pmatrix}, \begin{pmatrix}
2325: 			d_{11} 
2326: 		\end{pmatrix}\Bigg| a_{ij}, b_{ij}, c_{ij}, d_{ij}  \in R, b_{12}, c_{12} \in \mathfrak{m} \right\rbrace = \prod_{i=1}^4 \HH_i. \]
2327: 		We then have the congruences modulo $\mathfrak{m}$, 
2328: 		\[ a_{11} \sim b_{11}, b_{22} \sim c_{11}, c_{22} \sim d_{11}. \]
2329: 		Or in more compact notation which will be used later, 
2330: 		\[ (1,1) \sim (2,1), (2,2) \sim (3,1), (3,2) \sim (4,1). \]
2331: 		We then have 
2332: 		\[ \Lambda = \begin{pmatrix}
2333: 			R & 0 & 0 & 0 & 0 & 0\\
2334: 			0 & R & \mathfrak{m} & 0 & 0 & 0\\
2335: 			0 & R & R & 0 & 0 & 0\\
2336: 			0 & 0 & 0 & R & \mathfrak{m} & 0\\
2337: 			0 & 0 & 0 & R & R & 0\\
2338: 			0 & 0 & 0 & 0 & 0 & R 
2339: 		\end{pmatrix} \]
2340: 		such that \[\lambda_{11} = \lambda_{22}, \lambda_{33} = \lambda_{44}, \lambda_{55} = \lambda_{66}\]
2341: 		with all equalities taken modulo $\mathfrak{m}$, i.e. the residues $\lambda_{ii}$ are equal in $k=R/\mathfrak{m}$. \sidenote{Notice, the equalities in $k=R/\mathfrak{m}$ (i.e. equalities of residues modulo $\mathfrak{m}$) are given by $\alpha$ in the constellation $C = [\sigma, \alpha, \phi]$.}
2342: 		
2343: 		Suppose in particular that 
2344: 		\[
2345: 		\HH_1 \cong \HH_4 \cong k[[x]], \quad \HH_2 \cong \HH_3 \cong \begin{pmatrix}
2346: 			k[[x]] & (x)k[[x]] \\
2347: 			k[[x]] & k[[x]]
2348: 		\end{pmatrix}
2349: 		\]
2350: 		Letting $\mathfrak{m}_i = (x)$ for $i=1,...,4$, we get a pullback diagram
2351: 		\[
2352: 		\xymatrix{
2353: 			\Lambda \ar[rr]^{\pi_1} \ar[d]_{\iota_1} & & \Lambda/\rad(\Lambda)= k^3  \ar[d] \\
2354: 			\HH \ar[rr]_{\pi_2} & & \HH/\rad(\HH) = k^6
2355: 		}
2356: 		\]
2357: 		where $\Omega_i = k[[x]]$ for $i=1,...,4$ and $\omega_i = (x) = \rad(k[[x]])$, so that $\rad(\HH_1) = k = \rad(\HH_4)$ and $\rad(\HH_2) = k \times k = \rad(\HH_3)$; and $\rad(\HH) = \rad(\Lambda)$. Then we get
2358: 		\[ \Lambda = \begin{pmatrix}
2359: 			k[[x]] & 0 & 0 & 0 & 0 & 0\\
2360: 			0 & k[[x]] & (x)k[[x]] & 0 & 0 & 0\\
2361: 			0 & k[[x]] & k[[x]] & 0 & 0 & 0\\
2362: 			0 & 0 & 0 & k[[x]] & (x)k[[x]] & 0\\
2363: 			0 & 0 & 0 & k[[x]] & k[[x]] & 0\\
2364: 			0 & 0 & 0 & 0 & 0 & k[[x]]
2365: 		\end{pmatrix} \]
2366: 		such that \[\lambda_{11} = \lambda_{22}, \lambda_{33} = \lambda_{44}, \lambda_{55} = \lambda_{66}\]
2367: 		with all equalities taken modulo $\mathfrak{m} =(x)=\omega_i$, i.e. the residues $\lambda_{ii}$ are equal in $k$. The automorphisms given by $\sigma$ on $\HH_2 \cong \HH_3$ is
2368: 		\[ \begin{pmatrix}
2369: 			0 & x \\
2370: 			1 & 0
2371: 		\end{pmatrix} \]
2372: 		Further, this is exactly the algebra associated to the graph
2373: 		\[
2374: 		\xymatrix{
2375: 			\sigma_1 \ar@{-}[r]^{\alpha_{1}} & \sigma_2 \ar@{-}[r]^{\alpha_{2}} & \sigma_3 \ar@{-}[r]^{\alpha_{3}} & \sigma_4
2376: 		}
2377: 		\]
2378: 	\end{ex}
2379: 	
2380: 	
2381: 	
2382: 	
2383: 	%\section{Description of the Projective Objects}
2384: 	
2385: 	
2386: 	
2387: 	
2388: 	
2389: 	%\section{Description of the Injective Objects}
2390: 	
2391: 	
2392: 	
2393: 	
2394: 	
2395: 	%\section{Description of the Maps Between Projective Objects}
2396: 	
2397: 	
2398: 	
2399: 	
2400: 	
2401: 	\section{Projective Resolutions of Simple Objects}
2402: 	In this section we denote by $P^{\bullet}$ a complex of projective modules
2403: 	\[ \cdots \to P^{-1} \to P^0 \to P^{1} \to \cdots \]
2404: 	over some algebra $\Lambda$. Let $\Lambda = \Lambda(C)$ be a gentle constellation order given by the constellation $C=[\sigma, \alpha, \phi]$. \sidenote{Question: Find all constellations with fixed monodromy group. 
2405: 		(Problem $1.1.10$ \cite{LZ}) Having fixed a group $G \leq  S_n$ and a passport $[K_1,...,K_k]$,
2406: 		all the $K_i$ being conjugacy classes in $G$, find all the constellations with the
2407: 		cartographic group $G$ and with the refined passport $[K_1,...,K_k]$ with respect
2408: 		to $G$.}
2409: 	
2410: 	In this section we will show the following,
2411: 	\begin{prop}\label{fixed 3-constellation to fixed normalization}
2412: 		Classifying all $3$-constellations with a fixed passport $[\lambda_1, \lambda_2, \lambda_3]$ is equivalent to classifying all "\emph{gentle constellation orders}" with the same normalization, or equivalently all "\emph{closed surface algebras}" with the same normalization. 
2413: 	\end{prop}
2414: 	
2415: 	
2416: 	
2417: 	\begin{theorem}
2418: 		\begin{enumerate}
2419: 			\item The indecomposable projective modules $P_{e} = P_{\alpha_{i,j}}$ have radical
2420: 			\[ \rad(P_e) = U(\sigma_i^k) \oplus U(\sigma_j^l) \]
2421: 			where $U(\sigma_p^q) \cong P_{p,q} \in \Mod(\HH_p)$ is an indecomposable uniserial $\Lambda$-module and and indecomposable projective $\HH_p$-module.
2422: 			\item The minimal projective resolution of the simple module $S(\alpha_{i,j}^{k,l}) = S(e^i_k, e^j_l)$ of $\Lambda$, corresponding to the vertex $\alpha_{i,j}^{k,l}=(e^i_k, e^j_l)$ of $Q$\sidenote{or equivalently the edge of the same labeling in $\Gamma(C)$ connecting vertex $\sigma_i$ and $\sigma_j$}, is infinite periodic. In particular the period $p$ of the minimal resolution $P^{\bullet}(\alpha_{i,j}^{k,l}) = P^{\bullet} \to S(\alpha_{i,j}^{k,l})$ is exactly the least common multiple,
2423: 			\[ p(P^{\bullet}(i,j))  = \lcm\{|\cO_{\phi}(e^i_k)|, |\cO_{\phi}(e^j_l)|\}.\]
2424: 			where $\cO_{\phi}(e^i_k)$ and $\cO_{\phi}(e^j_l)$ are the orbits under the action of $\phi^{-1}$ of $e^i_k$ and $e^j_l$ on the two anti-cycles (or relations in $I$) passing through the vertex $\alpha_{i,j}^{k,l}$. 
2425: 			\item The differentials in the minimal projective resolution of the simple module $S(\alpha_{i,j}^{k,l})$, $d^m: P^{m} \to P^{m+1}$ in the resolution
2426: 			\[ P^{\bullet}(\alpha^{k,l}_{i,j}): \cdots \to P^{m} \to P^{m+1} \to \cdots \]
2427: 			are given by multiplication by the matrix 
2428: 			\[ d^m:= \begin{pmatrix}
2429: 				a(\phi^{-m} \cdot e^i_k)  & 0 \\
2430: 				0 & a(\phi^{-m} \cdot e^j_l)
2431: 			\end{pmatrix}. \]
2432: 			where $a(\phi^{-m}e^i_k) \in Q_1$ is the arrow with $ta = \phi^{-m}e^i_k$ and $ta(\phi^{-m} \cdot e^j_l) = \phi^{-m} \cdot e^j_l$. 
2433: 			\item The syzygies $\Omega^m(\alpha_{k,l}^{i,j})= \ker(d^m)$ are of the form
2434: 			\[
2435: 			\Omega^m(\alpha_{k,l}^{i,j})
2436: 			=
2437: 			U\!\bigl(\sigma(\phi^{-m}\alpha_{i,j}^{k,l})\bigr)
2438: 			=
2439: 			U\!\bigl(\sigma(\phi^{-m}\sigma e^i_k)\bigr)
2440: 			\oplus
2441: 			U\!\bigl(\sigma(\phi^{-m}\sigma e^j_l)\bigr).
2442: 			\]
2443: 			the uniserial modules at the vertex $\sigma \phi^{-m} \sigma e^i_k$ and $\sigma \phi^{-m} \sigma e^j_l$ which are annihilated by left multiplication by the arrows associated to $\phi_i^{-m} \sigma \cdot e^i_k$ and $\phi_i^{-m} \sigma \cdot e^j_l$ (so $a:ta=\sigma \phi^{-m} \sigma \cdot e^i_k, b:tb=\sigma \phi^{-m} \sigma \cdot e^j_l \in Q_1$). Note, there is exactly one such uniserial module for each orbit of the arrows $a:ta=\phi^{-m-1} e^i_k, b:tb=\phi^{-m-1} e^j_l \in Q_1$ by definition of the relations $I$. 
2444: 			
2445: 			
2446: 			
2447: 			
2448: 			
2449: 			%From this we can describe all Cohen-Macaulay modules over $\Lambda$. Need to write this up in a later Proposition.
2450: 			%		\item There is a grading of projective resolutions of simples with respect to the grading by path length. 
2451: 			%		\item With respect to the grading of $\Lambda$ by path length in the corresponding quiver, the path algebras of the gentle constellation orders are Koszul.
2452: 			%		\item The Koszul dual $\Lambda^*$ is the opposite algebra of the geometric dual constellation algebra, so the genus of $\Lambda$ is equal to the genus of $\Lambda^*$. 
2453: 			%		\item At Jerzy's suggestion, we should be able to define a "generalized Euler matrix" as follows. First, recall the Cartan matrix jast has entries $C_{ij}= \dim_k \Hom_{\Lambda}(P_j,P_i)$, but since this is infinite dimensional, we will need something different. So, we let the entries be power series in $\Z[[t]]$ determined by the lengths of the paths from $i$ to $j$. In other words
2454: 			%		\[ C_{ij} = \sum_n \dim_k (e_i \Lambda e_j)_n t^n \]
2455: 			%		are Poincare series in $Z[[t]]$. Now, if we let $E=(C^{-1})^T$ be the transpose of the inverse of $C$ (as in Assem, Simson, Skowronski pg. 90), which should work so long as we say $t \neq 0$. and allow rational functions in $t$.
2456: 			
2457: 		\end{enumerate}
2458: 	\end{theorem}
2459: 	
2460: 	
2461: 	
2462: 	
2463: 	
2464: 	The point of the first four statements is to describe the structure of resolutions and the Cohen-Macaulay modules. This will be useful later when explaining how to recover a graph embedded in a Riemann surface entirely in terms of the projective resolutions of the simple modules. The last four statements will provide some invariants which will have some applications to constellations and graphs embedded in Riemann surface. For example, a constellation is self dual if and only if the opposite algebra of the Koszul dual is isomorphic to the algebra $\Lambda(C)$. We will prove this and other things a little later.
2465: 	
2466: 	
2467: 	
2468: 	
2469: 	
2470: 	
2471: 	\begin{proof}
2472: 		\begin{enumerate}
2473: 			\item First, $\alpha_{i,j}^{k,l} = (e^i_k, e^j_l)=e$, and with fixed labeling of the edges of $\Gamma(C)$, we have $e^i_k = \sigma_i^{k-1}\cdot e^i_1$, and $e^j_l = \sigma_j^{l-1} \cdot e_l^j$, given by the automorphism 
2474: 			\[ \sigma_i^k:=
2475: 			\begin{pmatrix}
2476: 				0 & 0 & \cdots & 0 & \sigma_i \\
2477: 				1 & 0 & \cdots & 0 & 0 \\
2478: 				\vdots & \vdots & \ddots & \vdots & \vdots \\
2479: 				0 & 0 & \cdots & 0 & 0 \\
2480: 				0 & 0 & \cdots & 1 & 0 \\
2481: 			\end{pmatrix}^k
2482: 			\]
2483: 			So, $\sigma_i$ acts on the algebra $\Lambda = kQ/I$ by left multiplication of $e^i_{j-1}$ (and therefore $a^i_{j-1}$) by 
2484: 			the arrow $\sigma_i a^i_{j-1}=a^i_j$ in the quiver $Q(\Lambda)$. Notice, this multiplication is always 
2485: 			nonzero since $\sigma_i = (e_1^i, e_2^i, ..., e_{n_i}^i)$ is a cyclic permutation around the vertex it corresponds to 
2486: 			in $\Gamma(C)$, and there is by definition a unique arrow by which $\sigma$ acts on a given idempotent $e^i_{j-1}
2487: 			$ 
2488: 			(and on $a^i_{j-1}$) lying on this cycle corresponding to the hereditary order $\HH_i$ in the pullback diagram 
2489: 			defining $\Lambda(C)$. 
2490: 			\item Let $P(\alpha^{k,l}_{i,j})$ be the projective cover of $S(\alpha^{k,l}_{i,j})$. From the desription of the radical of 
2491: 			$P(\alpha^{k,l}_{i,j})$ as the two uniserial module in $\HH$ corresponding to the idempotents $\sigma \cdot e^i_k$ 
2492: 			and $\sigma \cdot e^j_l$ in $\HH_i$ and $\HH_j$ respectively, the next term in the resolution is the direct sum of 
2493: 			the two indecomposable projective covers $P(\sigma \cdot e^i_k)$ and $P(\sigma \cdot e^j_l)$ in $\Mod(\Lambda)
2494: 			$. Clearly the kernel of the covering $P(\sigma \cdot e^j_l) \to U(\sigma \cdot e^j_l)$ is exactly the uniserial 
2495: 			$U(\sigma \alpha \cdot \sigma \cdot e^j_l)$. Now, $\sigma \alpha = \phi^{-1}$ by defintion of a constellation, so 
2496: 			$U(\sigma \alpha \cdot \sigma \cdot e^j_l) = U(\phi^{-1} \cdot \sigma \cdot e^j_l)$, and its projective cover is 
2497: 			$P(\phi^{-1} \cdot \sigma \cdot e^j_l)$. The kernel of this covering is $U(\sigma \alpha \cdot (\phi^{-1} \cdot 
2498: 			\sigma \cdot e^j_l)) = U(\phi^{-1}\sigma e^i_k)$. This pattern continues also for $\sigma \ell^j_l$, and the terms 
2499: 			$P^m$ in the resolution are
2500: 			\[ P(\phi^{-m} \sigma e^i_k) \oplus P(\phi^{-m}\sigma e^j_l). \]
2501: 			So the terms have indecomposable direct summands which cycle through the orbit of $e^i_k$ and $e^j_l$ under the 
2502: 			action of $\phi$. The orbits are anit-cycle in $I$, and the place at which the two cycle meet up at $\alpha_{i,j}^{k,l} 
2503: 			= (e^i_k, e^j_l)$ is exactly $p = \lcm\{|\cO_{\phi}(e^i_k)|, |\cO_{\phi}(e^j_l)|$.
2504: 			\item Since the kernel of the cover of a uniserial $P(\alpha_{i,j}^{k,l}) \to U(e^i_k)$ is exactly $U(\sigma e^i_k)$ and 
2505: 			it is embedded in $P(\alpha_{i,j}^{k,l})$ as a submodule via multiplication by the arrow $a: ha=\sigma e^i_k$, we 
2506: 			get that the differential is indeed, 
2507: 			\[ d^m:= \begin{pmatrix}
2508: 				a(\phi^{-m}\cdot e^i_k)  & 0 \\
2509: 				0 & a(\phi^{-m} \cdot e^j_l)
2510: 			\end{pmatrix}. \]
2511: 			\item 
2512: 			\item 
2513: 			\item 
2514: 			\item
2515: 			\item 
2516: 		\end{enumerate}
2517: 	\end{proof}
2518: 	
2519: 	
2520: 	
2521: 	
2522: 	
2523: 	\begin{ex}
2524: 		Let $C=[\sigma, \alpha, \phi]$ be given by 
2525: 		\[ \sigma = (1,4)(2,3), \quad \alpha = (1,3)(2,4),\quad  \phi = (1,2)(3,4),\] then $\chi(C) = 2$ and $g(C)=0$. The embedded graph can be represented by the equator of the sphere with two vertices on it. Or, if we embed it in the plane:
2526: 		\[
2527: 		\begin{tikzcd}
2528: 			&  & \phi_2=(3,4) \\
2529: 			\sigma_2=(2,3) \arrow[rr, "{\alpha_1=(1,3)}", no head, bend left=49] & \phi_1=(1,2) & \sigma_1 = (1,4) \arrow[ll, "{\alpha_2=(2,4)}", no head, bend left=49]
2530: 		\end{tikzcd}
2531: 		\]
2532: 		The quiver which comes from this graph is\\
2533: 		\[
2534: 		\begin{tikzcd}
2535: 			\alpha_1=(1,3) \arrow["a_1", dd, bend left] \arrow["b_1", dd, dashed, bend right=71] \\
2536: 			\\
2537: 			\alpha_2=(2,4) \arrow["a_2",uu, bend left] \arrow["b_2", uu, dashed, bend right=71]
2538: 		\end{tikzcd}
2539: 		\]
2540: 		The associated matrix data is
2541: 		\[ \Lambda = \left\lbrace \begin{pmatrix}
2542: 			\lambda_{11} & x\cdot \lambda_{12} & 0 & 0 \\
2543: 			\lambda_{21} & \lambda_{22} & 0 & 0 \\
2544: 			0 & 0 & \lambda_{33} & x\cdot \lambda_{34} \\
2545: 			0 & 0 & \lambda_{43} & \lambda_{44} \\
2546: 		\end{pmatrix}\Bigg| \lambda_{ij} \in k[[x]], \lambda_{22} = \lambda_{33} \text{(mod $x$)} \right\rbrace \]
2547: 		With normalization
2548: 		\[ 
2549: 		\HH =  \left\lbrace \begin{pmatrix}
2550: 			\lambda_{11} & x\cdot \lambda_{12} \\
2551: 			\lambda_{21} & \lambda_{22} 
2552: 		\end{pmatrix} \times \begin{pmatrix}
2553: 			\mu_{11} & x\cdot \mu_{12} \\
2554: 			\mu_{21} & \mu_{22} 
2555: 		\end{pmatrix}\Bigg| \ \lambda_{ij}, \mu_{kl} \in k[[x]] \right\rbrace
2556: 		\]
2557: 		and the pullback diagram is given by the relation $(1,2) \sim (2,1)$, $\overline{m}=(2,2)$. The projective resolution of the simple $S(\alpha_1)$ has the following form
2558: 		\[ \xymatrix{
2559: 			\cdots \ar[r] &  \ar[r]^{\begin{pmatrix}
2560: 					a_1 & 0 \\
2561: 					0 & b_1
2562: 			\end{pmatrix}} P(\alpha_2) \oplus P(\alpha_2) & \ar[r]^{\begin{pmatrix}
2563: 					a_2 & 0 \\
2564: 					0 & b_2
2565: 			\end{pmatrix}} P(\alpha_1) \oplus P(\alpha_1)& \ar[r]^{\begin{pmatrix}
2566: 					a_1 & 0 \\
2567: 					0 & b_1
2568: 			\end{pmatrix}} P(\alpha_2) \oplus P(\alpha_2) & P(\alpha_1) \ar[r] & S(\alpha_1)
2569: 		}\]
2570: 	\end{ex}
2571: 	
2572: 	
2573: 	%\begin{ex}
2574: 	%	Let $\Lambda$ be the $\fm$-adic completion of the following path algebra with respect to the maximal ideal $\fm$ generated by the arrows:
2575: 	%	\[
2576: 	%	\begin{tikzcd}
2577: 		%	& e_1 \arrow[rd, "b_1"] \arrow[dd, "c_1" description, dotted, bend right=100] &  \\
2578: 		%	e_4 \arrow[ru, "b_4"] \arrow[rr, "a_2" description, dashed, bend right] &  & e_2 \arrow[ll, "a_1" description, dashed, bend right] \arrow[ld, "b_2"] \\
2579: 		%	& e_3 \arrow[lu, "b_3"] \arrow[uu, "c_2" description, dotted] & 
2580: 		%	\end{tikzcd}
2581: 	%	\]
2582: 	%\end{ex}
2583: 	
2584: 	
2585: 	
2586: 	
2587: 	\section{Recovering the Surface}
2588: 	Give the list of projective resolutions of the simple objects, we may completely recover the constellation $C$, and therefore the Riemann surface and cellularly embedded graph. In fact, we don't need any other information. Neither the surface algebra, nor the medial quiver are needed to recover $C = [\sigma, \alpha, \phi]$, only the projective resolutions of the simples. 
2589: 	
2590: 	
2591: 	
2592: 	
2593: 	\section{The Graded Hilbert Function}
2594: %-----------------------------------------------------------------
2595: %  Added content: Graded Hilbert function / Hilbert series viewpoint
2596: %-----------------------------------------------------------------
2597: 
2598: \noindent
2599: In many parts of this manuscript we work with \emph{completed} surface algebras/orders (completion at the arrow ideal, or at a maximal ideal $\mathfrak m$ in a DVR).
2600: Strictly speaking, a completion is \emph{filtered} rather than graded.
2601: Nevertheless, for all of the path-counting and determinantal arguments (Cartan determinants, cycle zeta functions, and eventually the Hilbert--Pólya determinant convergence),
2602: the relevant object is the \emph{associated graded} algebra/module, which is graded by path length (or by a chosen arrow-weight grading).
2603: This is the correct setting for Hilbert functions and Hilbert series.
2604: 
2605: \subsection{Path-length grading and the Hilbert series of an algebra/module}
2606: Let $k$ be a field and let $A=kQ/I$ be a bound quiver algebra.
2607: Write $J\subset A$ for the arrow ideal (the ideal generated by the images of arrows).
2608: Then $A$ is naturally \emph{filtered} by the powers $J^n$.
2609: The associated graded algebra is
2610: \[
2611: \gr_J(A)\ :=\ \bigoplus_{n\ge 0} J^n/J^{n+1}.
2612: \]
2613: When $I$ is homogeneous for the path-length grading (true for the gentle/surface families where $I$ is generated by length-$2$ relations),
2614: $\gr_J(A)$ agrees with the usual path-length graded quotient.
2615: In either case, the graded pieces measure the number of admissible paths of a given length.
2616: 
2617: \begin{definition}[Hilbert function and Hilbert series]
2618: Let $M=\bigoplus_{n\ge 0} M_n$ be a $\mathbb{Z}_{\ge 0}$-graded $k$-vector space (e.g.\ $M=\gr_J(A)$ or a graded $A$-module).
2619: The \emph{Hilbert function} is
2620: \[
2621: H_M(n)\ :=\ \dim_k(M_n),
2622: \]
2623: and the \emph{Hilbert series} is the formal power series
2624: \[
2625: \Hilb_M(q)\ :=\ \sum_{n\ge 0} H_M(n)\,q^n\ \in\ \mathbb{Z}[[q]].
2626: \]
2627: \end{definition}
2628: 
2629: \begin{remark}[Why Hilbert series are the right ``partition functions'' here]
2630: If one interprets path length as an energy/complexity (as we do later in the transfer-operator and modular-Hamiltonian constructions),
2631: then $\Hilb_M(q)$ is literally a discrete partition function with fugacity $q$.
2632: Replacing $q$ by $e^{-s}$ or by $p^{-s}$ is exactly the analytic continuation move that connects path-counting to Dirichlet series and Euler products.
2633: \end{remark}
2634: 
2635: \subsection{Matrix-valued Hilbert series and the $q$-Cartan matrix}
2636: In noncommutative settings with many primitive idempotents, it is often more informative to keep track of \emph{where} paths start and end.
2637: 
2638: Let $Q_0=\{1,\dots,n\}$ and let $\{e_i\}_{i\in Q_0}$ be the primitive orthogonal idempotents of $A$.
2639: Then $A$ decomposes as a matrix of bimodules:
2640: \[
2641: A\ \cong\ \bigoplus_{i,j\in Q_0} e_i A e_j.
2642: \]
2643: If $A$ is graded (or replaced by $\gr_J(A)$), each $e_iAe_j$ is graded.
2644: 
2645: \begin{definition}[$q$-Cartan matrix / matrix Hilbert series]
2646: The \emph{$q$-Cartan matrix} of a graded bound quiver algebra $A$ is the $n\times n$ matrix
2647: \[
2648: C_A(q)\ :=\ \bigl(C_{ij}(q)\bigr)_{i,j\in Q_0},
2649: \qquad
2650: C_{ij}(q)\ :=\ \sum_{m\ge 0} \dim_k\!\bigl((e_iAe_j)_m\bigr)\,q^m.
2651: \]
2652: Equivalently, $C_{ij}(q)$ is the generating function counting admissible paths from $j$ to $i$ by length.
2653: \end{definition}
2654: 
2655: \begin{remark}[Recovering the ordinary Cartan matrix]
2656: If $A$ is finite-dimensional and one forgets the grading, then the ordinary Cartan matrix $C_A$ is recovered by evaluation at $q=1$:
2657: \[
2658: (C_A)_{ij}=\dim_k(e_iAe_j)=C_{ij}(1).
2659: \]
2660: In general, $C_A(q)$ is defined as a formal power series matrix (or a rational function matrix) even when $A$ is infinite-dimensional.
2661: \end{remark}
2662: 
2663: \subsection{Scalar Hilbert series from the $q$-Cartan matrix}
2664: The Hilbert series of the whole algebra is the sum of all matrix entries:
2665: \[
2666: \Hilb_A(q)\ =\ \sum_{m\ge 0}\dim_k(A_m)\,q^m
2667: \ =\ \sum_{i,j\in Q_0} C_{ij}(q)
2668: \ =\ \mathbf{1}^\top C_A(q)\,\mathbf{1},
2669: \]
2670: where $\mathbf{1}$ denotes the all-ones column vector.
2671: More generally, the Hilbert series of an indecomposable projective $P_j=e_jA$ is
2672: \[
2673: \Hilb_{P_j}(q)\ =\ \sum_{i\in Q_0} C_{ij}(q).
2674: \]
2675: 
2676: \subsection{Rationality for gentle/surface families}
2677: For gentle and locally gentle algebras, admissible paths form a regular language, and the corresponding generating functions are rational.
2678: This rationality is made \emph{completely explicit} in terms of oriented cycles by the Bessenrodt--Holm determinant formula for weighted (and hence graded) Cartan matrices
2679: (Theorem~\ref{thm:BH_weighted_cartan_det}, and Corollary~\ref{cor:qcartan_det_simple} below in the specialized $q$-grading).
2680: In later chapters this is the key mechanism that lets us treat ``cycle sums'' and ``Euler products'' inside a single determinantal package.
2681: 
2682: 
2683: 	
2684: 	
2685: 	
2686: 	
2687: 	
2688: 	
2689: 	
2690: 	\section{The Generalized Cartan Matrix}
2691: %-----------------------------------------------------------------
2692: %  Added content: generalized / weighted / graded Cartan matrices
2693: %-----------------------------------------------------------------
2694: 
2695: \noindent
2696: The Cartan matrix is the fundamental ``path-counting'' invariant of a bound quiver algebra, and in the surface-order setting it is the bridge between:
2697: \begin{enumerate}[label=(\roman*)]
2698: \item combinatorics of permitted/forbidden cycles on the embedded graph,
2699: \item representation theory (projectives, simples, and resolutions), and
2700: \item determinants that factor over cycles (zeta/Euler product analogies).
2701: \end{enumerate}
2702: 
2703: \subsection{Ordinary Cartan matrix and composition multiplicities}
2704: Let $A$ be a finite-dimensional $k$-algebra with primitive orthogonal idempotents $\{e_i\}_{i\in Q_0}$ and indecomposable projectives $P_i=e_iA$.
2705: Let $S_i=P_i/\rad(P_i)$ be the corresponding simple modules.
2706: 
2707: \begin{definition}[Cartan matrix]
2708: The (ordinary) \emph{Cartan matrix} of $A$ is
2709: \[
2710: C_A\ :=\ \bigl(c_{ij}\bigr)_{i,j\in Q_0},
2711: \qquad
2712: c_{ij}\ :=\ [P_j:S_i],
2713: \]
2714: the multiplicity of $S_i$ as a composition factor of $P_j$.
2715: Equivalently,
2716: \[
2717: c_{ij}=\dim_k\Hom_A(P_i,P_j)=\dim_k(e_iAe_j).
2718: \]
2719: \end{definition}
2720: 
2721: In a bound-quiver presentation $A=kQ/I$, the entry $c_{ij}$ is literally the number of admissible paths from $j$ to $i$ (counted with multiplicity in case of relations), because $e_iAe_j$ is spanned by paths from $j$ to $i$ that survive modulo~$I$.
2722: 
2723: \subsection{Graded (or filtered) refinements: the $q$-Cartan matrix}
2724: When $A$ is graded (or replaced by $\gr_J(A)$), one refines the Cartan matrix to keep track of the grading.
2725: 
2726: \begin{definition}[$q$-Cartan matrix]
2727: For a graded algebra $A=\bigoplus_{m\ge 0}A_m$ with idempotents $e_i\in A_0$, define
2728: \[
2729: C_A(q)\ :=\ \bigl(C_{ij}(q)\bigr)_{i,j},
2730: \qquad
2731: C_{ij}(q)=\sum_{m\ge 0}\dim_k\!\bigl((e_iAe_j)_m\bigr)\,q^m.
2732: \]
2733: This is the same object defined in the previous section, viewed now as a \emph{graded Cartan matrix}.
2734: \end{definition}
2735: 
2736: \begin{remark}[Why this deserves to be called ``generalized'' in the surface-order setting]
2737: If one works with completed surface orders over a DVR $R$ with uniformizer $\pi$, then the arrow-ideal filtration and the $\pi$-adic filtration are intertwined.
2738: One therefore obtains \emph{multi-graded} Cartan data, e.g.\ a matrix of formal power series in $q$ (path length) and $\pi$ (valuation/ramification depth).
2739: For the present manuscript we mostly keep a single grading variable and treat the rest as parameters inside the weights $w(\alpha)$ of arrows.
2740: \end{remark}
2741: 
2742: \subsection{Weighted Cartan matrices and the cycle-product determinant}
2743: The key combinatorial input for our later determinant/trace identities is the explicit cycle factorization of $\det C_A(q)$ for locally gentle algebras.
2744: 
2745: To make the specialization transparent, recall the Bessenrodt--Holm formula (Theorem~\ref{thm:BH_weighted_cartan_det}):
2746: for a weighted locally gentle quiver $(Q,I,w)$,
2747: \[
2748: \det C_Q^w(x)
2749: =
2750: \frac{\prod_{C\in \mathrm{ZC}(Q)} \Bigl(1-(-1)^{\ell(C)}\,w(C)\Bigr)}
2751: {\prod_{C\in \mathrm{IC}(Q)} \Bigl(1-w(C)\Bigr)}.
2752: \]
2753: Setting all arrow weights equal to $q$ (path-length grading) yields the following useful specialization.
2754: 
2755: \begin{corollary}[$q$-Cartan determinant for locally gentle algebras \cite{BessenrodtHolm2005WeightedLocallyGentle}]
2756: \label{cor:qcartan_det_simple}
2757: Let $(Q,I)$ be a locally gentle quiver and $A=kQ/I$ equipped with the path-length grading.
2758: Then
2759: \begin{equation}
2760: \label{eq:qcartan_det_simple}
2761: \det C_A(q)
2762: =
2763: \frac{\displaystyle\prod_{C\in \mathrm{ZC}(Q)} \Bigl(1-(-q)^{\ell(C)}\Bigr)}
2764: {\displaystyle\prod_{C\in \mathrm{IC}(Q)} \Bigl(1-q^{\ell(C)}\Bigr)}.
2765: \end{equation}
2766: \end{corollary}
2767: 
2768: \begin{remark}[Determinants, Hilbert series, and cycle zeta functions]
2769: Equation~\eqref{eq:qcartan_det_simple} is the algebraic version of a dynamical zeta function:
2770: a determinant becomes a product over primitive oriented cycles.
2771: In later chapters we use exactly this structural fact when matching:
2772: \[
2773: \log\det(I-T)\ =\ -\sum_{n\ge 1}\frac{1}{n}\Tr(T^n)
2774: \qquad\longleftrightarrow\qquad
2775: \log L(s,\varpi)\ =\ \sum_{p,k\ge 1} \frac{a_\varpi(p^k)}{k}\,p^{-ks}.
2776: \]
2777: \end{remark}
2778: 
2779: 
2780: 	
2781: 	
2782: 	
2783: 	
2784: 	
2785: 	\section{The Generalized Euler Form}
2786: %-----------------------------------------------------------------
2787: %  Added content: Euler form inner product and its relation to Cartan/Hilbert series
2788: %-----------------------------------------------------------------
2789: 
2790: \noindent
2791: The Euler form is the bilinear pairing that controls both:
2792: (i) the weights of quiver semi-invariants (Schofield determinants), and
2793: (ii) the inversion relation between Cartan data and Ext data.
2794: Because the manuscript uses both \emph{dimension vectors} (representation theory) and \emph{operator traces} (physics),
2795: it is worth writing the Euler form carefully and in a form that can be used computationally.
2796: 
2797: \subsection{Euler form via Ext groups (derived-category definition)}
2798: Let $A$ be a finite-dimensional $k$-algebra.
2799: For $A$-modules $M,N$ of finite projective dimension (e.g.\ when $A$ has finite global dimension, or when one restricts to suitable subcategories),
2800: define the \emph{Euler form}
2801: \begin{equation}
2802: \label{eq:euler_ext_definition}
2803: \langle M,N\rangle_A\ :=\ \sum_{t\ge 0}(-1)^t\,\dim_k \Ext_A^t(M,N).
2804: \end{equation}
2805: This depends only on the classes $[M],[N]$ in the Grothendieck group $K_0(A)$ and extends by bilinearity to a pairing
2806: \[
2807: \langle -,-\rangle_A:K_0(A)\times K_0(A)\to \mathbb{Z}.
2808: \]
2809: 
2810: \begin{remark}[When $A$ has infinite global dimension]
2811: Gentle and special-biserial algebras often have infinite global dimension.
2812: Nevertheless, the Euler form \eqref{eq:euler_ext_definition} is still meaningful on any full subcategory where the Ext groups are finite-dimensional and eventually vanish (e.g.\ perfect complexes, or modules admitting eventually periodic resolutions where one works with a graded/refined Euler series).
2813: For the Hilbert-series computations below we will primarily use the \emph{graded} (or $q$-)Euler form, which is defined as a formal series and does not require vanishing in finite degree.
2814: \end{remark}
2815: 
2816: \subsection{Euler matrix and the inverse Cartan relation (finite global dimension case)}
2817: Assume for the moment that $A$ has finite global dimension.
2818: Let $\{S_i\}_{i\in Q_0}$ be the simple modules and $\{P_i\}_{i\in Q_0}$ the indecomposable projectives.
2819: Write $C_A$ for the Cartan matrix.
2820: Define the Euler matrix $E_A$ by
2821: \[
2822: (E_A)_{ij}\ :=\ \langle S_i,S_j\rangle_A.
2823: \]
2824: Then one has the classical relation
2825: \begin{equation}
2826: \label{eq:euler_is_inverse_cartan}
2827: E_A\ =\ (C_A^{-1})^\top,
2828: \qquad\text{i.e.}\qquad
2829: \langle S_i,S_j\rangle_A\ =\ (C_A^{-1})_{ji}.
2830: \end{equation}
2831: Equivalently, in the $K_0$-basis of projectives one has $\langle P_i,S_j\rangle_A=\delta_{ij}$.
2832: 
2833: \begin{proof}[Proof sketch]
2834: Take a finite projective resolution of $S_i$,
2835: $0\to P_m\to\cdots\to P_0\to S_i\to 0$, apply $\Hom_A(-,S_j)$, and take alternating sums of dimensions.
2836: In matrix form this expresses the identity matrix as the product of the Cartan matrix with the Euler matrix, which is \eqref{eq:euler_is_inverse_cartan}.
2837: \end{proof}
2838: 
2839: \subsection{Bound quivers and an explicit dimension-vector formula}
2840: When $A=kQ/I$ is given by a bound quiver presentation with relations generated by paths of length~$2$ (the gentle/surface regime),
2841: the Euler form can be written directly on dimension vectors.
2842: Let $\mathbf{d}=(d_i)_{i\in Q_0}$ and $\mathbf{e}=(e_i)_{i\in Q_0}$ be dimension vectors.
2843: 
2844: \begin{definition}[Combinatorial Euler form for a bound quiver]
2845: Assume $(Q,I)$ has relations generated by a set $R$ of minimal relations, each a linear combination of paths with fixed start and end.
2846: Define the bilinear form
2847: \begin{equation}
2848: \label{eq:euler_bound_quiver}
2849: \langle \mathbf{d},\mathbf{e}\rangle_{(Q,I)}
2850: \ :=\
2851: \sum_{i\in Q_0} d_i e_i
2852: \;-\;
2853: \sum_{a:i\to j\in Q_1} d_i e_j
2854: \;+\;
2855: \sum_{r:i\Rightarrow j\in R} d_i e_j,
2856: \end{equation}
2857: where $r:i\Rightarrow j$ means that the relation $r$ starts at $i$ and ends at $j$.
2858: \end{definition}
2859: 
2860: \begin{remark}[Interpretation]
2861: For quivers without relations ($I=0$) this reduces to the usual Euler/Ringel form
2862: $\langle\mathbf{d},\mathbf{e}\rangle=\sum_i d_i e_i-\sum_{a:i\to j} d_i e_j$.
2863: The extra $+\sum_{r} d_i e_j$ term is the first correction in the presence of relations, and is exact when the algebra has global dimension~$\le 2$ (which covers many gentle cases of interest).
2864: More generally, higher syzygies contribute further correction terms; in the graded setting one keeps track of them via the $q$-Euler series below.
2865: \end{remark}
2866: 
2867: \subsection{Graded/$q$-Euler form and inversion of the $q$-Cartan matrix}
2868: For Koszul graded algebras (and in particular for locally gentle algebras with the natural path-length grading \cite{BessenrodtHolm2005WeightedLocallyGentle}),
2869: one can package the entire Ext tower into a generating series.
2870: 
2871: \begin{definition}[$q$-Euler matrix]
2872: Let $A$ be a graded algebra and let $S_i$ be the graded simples.
2873: Define the $q$-Euler matrix
2874: \[
2875: E_A(q)\ :=\ \bigl(E_{ij}(q)\bigr)_{i,j},
2876: \qquad
2877: E_{ij}(q):=\sum_{t\ge 0}(-1)^t\,\dim_k\Ext_A^t(S_i,S_j)\,q^t.
2878: \]
2879: \end{definition}
2880: 
2881: When $A$ is Koszul, one has the standard Koszul inversion relation
2882: \begin{equation}
2883: \label{eq:q_euler_cartan_inverse}
2884: C_A(q)\,E_A(-q)^\top\ =\ I,
2885: \qquad\text{equivalently}\qquad
2886: E_A(q)\ =\bigl(C_A(-q)^{-1}\bigr)^\top.
2887: \end{equation}
2888: Thus the $q$-Cartan matrix is the matrix Hilbert series of projectives, while the $q$-Euler matrix is the matrix Poincar\'e series of Ext between simples.
2889: 
2890: \begin{remark}[Hilbert series from Euler form computations]
2891: Equation~\eqref{eq:q_euler_cartan_inverse} is precisely the computational principle requested in the ``expanded'' instructions:
2892: \emph{once the Euler form/Ext series is known (e.g.\ from explicit projective resolutions of simples), one can recover the graded Cartan data and hence the Hilbert series by matrix inversion, and conversely.}
2893: In the gentle/surface setting, explicit periodic resolutions make $E_A(q)$ rational, hence $C_A(q)$ and $\Hilb_A(q)$ are rational as well.
2894: \end{remark}
2895: 
2896: \subsection{Euler form and weights of determinantal semi-invariants}
2897: Finally, we record the Euler-form identity that explains why the pairing is indispensable in the invariant theory used later.
2898: 
2899: Let $A=kQ/I$ and fix a dimension vector $\mathbf{d}$.
2900: For any $A$-module $M$ of dimension vector $\mathbf{m}$, the Schofield/Derksen--Weyman theory associates a character (weight)
2901: \[
2902: \theta_M\in \mathbb{Z}^{Q_0}\cong X^\ast(G_\mathbf{d}),
2903: \qquad
2904: \theta_M(i):=\langle \mathbf{m},\mathbf{e}_i\rangle_{(Q,I)},
2905: \]
2906: where $\mathbf{e}_i$ is the $i$th standard basis vector.
2907: The dimension-match condition for the determinantal semi-invariant $c^M$ (Definition~\ref{def:det_semi_inv_projective}) is exactly the vanishing of the Euler pairing
2908: \[
2909: \langle \mathbf{m},\mathbf{d}\rangle_{(Q,I)}=0,
2910: \]
2911: and the resulting determinant $c^M$ lies in the weight space $\SI(A,\mathbf{d})_{\theta_M}$.
2912: This is the conceptual reason that the Euler form sits at the intersection of:
2913: \begin{enumerate}[label=(\roman*)]
2914: \item determinantal invariant theory (semi-invariants as determinants),
2915: \item toric degeneration (weights become lattice points), and
2916: \item the arithmetic transfer-operator model (weights become prime-power phases).
2917: \end{enumerate}
2918: 
2919: 
2920: 	
2921: 	
2922: 	
2923: 	
2924: 	
2925: 	%----------------------------------------------------------------------------------------
2926: 	%	CHAPTER 13
2927: 	%----------------------------------------------------------------------------------------
2928: 	
\chapter{Examples: Double Simple Cycle Algebras} · lines 2929–3180
2929: 	\chapter{Examples: Double Simple Cycle Algebras}
2930: 	Although it is not phrased in these terms, in \cite{Kraskiewicz-Weyman} Kraskiewicz and Weyman study a class of finite dimensional gentle algebras $A(n)$ given by the following pullback diagram with $\mathbb{A}_n$ the equioriented type $\mathbb{A}$ quiver with $|Q_0|=n$. 
2931: 	\[ \xymatrix{
2932: 		A(n) \ar[rr]^{\pi_1} \ar[d]_{\iota_1} & & \ttop(A(n)) \ar[d]^{\iota_2} \\
2933: 		k\mathbb{A}_n \times k\mathbb{A}_n \ar[rr]_{\pi_2} & & \ttop (k\mathbb{A}_n \times k\mathbb{A}_n)
2934: 	} \]
2935: 	The maps $\pi_1, \pi_2$ are the projections onto $\ttop(A(n))= A(n)/\rad(A(n)) = \bigoplus_{i=1}^n P(i)/\rad(P(i)) \cong \prod_{i=1}^n k$, $\ttop(k\mathbb{A}_n \times k\mathbb{A}_n) = k\mathbb{A}_n/\rad(k\mathbb{A}_n) \times k\mathbb{A}_n/\rad(k\mathbb{A}_n) \cong \prod_{i=1}^n k \times \prod_{i=1}^n k$. The maps $\iota_1, \iota_2$ are idempotent embeddings given by $e_i \mapsto e_i'+e_i''$, where $e_i$ is the $i^{th}$ primitive idempotent of the algebra $A(n)$, $e_i'$ is the primitive idempotent in the first copy of $k\mathbb{A}_n$ corresponding to the vertex $i \in \mathbb{A}_{n,0}$, and $e_i''$ is the $i^{th}$ idempotent of the second copy. We would like to study a class of algebras closely related to these algebras. Let $\tilde{\mathbb{A}}_n$ be the cyclicly oriented quiver with $n$ arrows and vertices. For $n=0$ (mod $2$), let $\Lambda(n)$ be given by the matrix algebra
2936: 	\[
2937: 	\Lambda(n): =  \begin{pmatrix}
2938: 		\lambda_{11} & (x)\lambda_{12} & \cdots & (x)\lambda_{1,n-1} & (x)\lambda_{1,n}\\
2939: 		\lambda_{11} & \lambda_{12} & \cdots & (x)\lambda_{1,n-1} & (x)\lambda_{1,n}\\
2940: 		\vdots & \vdots & \ddots & \vdots & \vdots \\
2941: 		\lambda_{n-1,1} & \lambda_{n-1,2} & \cdots & \lambda_{1,n-1} & (x)\lambda_{1,n}\\
2942: 		\lambda_{n1} & \lambda_{n2} & \cdots & \lambda_{n,n-1} & \lambda_{n,n}
2943: 	\end{pmatrix} \times 
2944: 	\begin{pmatrix}
2945: 		\mu_{11} & (x)\mu_{12} & \cdots & (x)\mu_{1,n-1} & (x)\mu_{1,n}\\
2946: 		\mu_{11} & \mu_{12} & \cdots & (x)\mu_{1,n-1} & (x)\mu_{1,n}\\
2947: 		\vdots & \vdots & \ddots & \vdots & \vdots \\
2948: 		\mu_{n-1,1} & \mu_{n-1,2} & \cdots & \mu_{1,n-1} & (x)\mu_{1,n}\\
2949: 		\mu_{n1} & \mu_{n2} & \cdots & \mu_{n,n-1} & \mu_{n,n}
2950: 	\end{pmatrix} ,\]
2951: 	where $\lambda_{ij}, \mu_{ij} \in k[[x]], \lambda_{ii}=\mu_{ii}$ (mod $x$), which is given by the pullback diagram
2952: 	\[
2953: 	\xymatrix{
2954: 		\Lambda(n) \ar[r]^{\pi_1} \ar[d]_{\iota_1} & \Lambda(n)/\rad(\Lambda(n)) \ar[d]^{\iota_2} \\
2955: 		\bH(n) \ar[r]_{\pi_2} & \bH(n)/\rad(\bH(n)) 
2956: 	}
2957: 	\]
2958: 	where
2959: 	\[ \bH(n) = \begin{pmatrix}
2960: 		\lambda_{11} & (x)\lambda_{12} & \cdots & (x)\lambda_{1,n-1} & (x)\lambda_{1,n}\\
2961: 		\lambda_{11} & \lambda_{12} & \cdots & (x)\lambda_{1,n-1} & (x)\lambda_{1,n}\\
2962: 		\vdots & \vdots & \ddots & \vdots & \vdots \\
2963: 		\lambda_{n-1,1} & \lambda_{n-1,2} & \cdots & \lambda_{1,n-1} & (x)\lambda_{1,n}\\
2964: 		\lambda_{n1} & \lambda_{n2} & \cdots & \lambda_{n,n-1} & \lambda_{n,n}
2965: 	\end{pmatrix} \times 
2966: 	\begin{pmatrix}
2967: 		\mu_{11} & (x)\mu_{12} & \cdots & (x)\mu_{1,n-1} & (x)\mu_{1,n}\\
2968: 		\mu_{11} & \mu_{12} & \cdots & (x)\mu_{1,n-1} & (x)\mu_{1,n}\\
2969: 		\vdots & \vdots & \ddots & \vdots & \vdots \\
2970: 		\mu_{n-1,1} & \mu_{n-1,2} & \cdots & \mu_{1,n-1} & (x)\mu_{1,n}\\
2971: 		\mu_{n1} & \mu_{n2} & \cdots & \mu_{n,n-1} & \mu_{n,n}
2972: 	\end{pmatrix} ,\]
2973: 	with $\lambda_{ij}, \mu_{ij} \in k[[x]]$. 
2974: 	Then, $\rad(\bH(n)) = \rad(\Lambda(n))$, and $\iota_1$ and $\iota_2$ are given by radical embeddings with mapping on the idempotents:
2975: 	\[ \Lambda(n)/\rad(\Lambda(n)) \ni e_{ii} \mapsto e_{ii}'+e_{ii}'' \in \bH(n)/\rad(\bH(n)). \]
2976: 	Now, if $n=1$ (mod $2$), then we take
2977: 	\[
2978: 	\Lambda(n): =  \begin{pmatrix}
2979: 		\lambda_{11} & (x)\lambda_{12} & \cdots & (x)\lambda_{1,n-1} & (x)\lambda_{1,n}\\
2980: 		\lambda_{11} & \lambda_{12} & \cdots & (x)\lambda_{1,n-1} & (x)\lambda_{1,n}\\
2981: 		\vdots & \vdots & \ddots & \vdots & \vdots \\
2982: 		\lambda_{n-1,1} & \lambda_{n-1,2} & \cdots & \lambda_{1,n-1} & (x)\lambda_{1,n}\\
2983: 		\lambda_{n1} & \lambda_{n2} & \cdots & \lambda_{n,n-1} & \lambda_{n,n}
2984: 	\end{pmatrix} 
2985: 	\]
2986: 	with $\lambda_{ij} \in k[[x]]$, and $\lambda_{ii}=\lambda_{2i,2i}$ (mod $x$), for $i=1,2,...,n$. We have 
2987: 	\[ \bH(n) = \begin{pmatrix}
2988: 		\lambda_{11} & (x)\lambda_{12} & \cdots & (x)\lambda_{1,n-1} & (x)\lambda_{1,n}\\
2989: 		\lambda_{11} & \lambda_{12} & \cdots & (x)\lambda_{1,n-1} & (x)\lambda_{1,n}\\
2990: 		\vdots & \vdots & \ddots & \vdots & \vdots \\
2991: 		\lambda_{n-1,1} & \lambda_{n-1,2} & \cdots & \lambda_{1,n-1} & (x)\lambda_{1,n}\\
2992: 		\lambda_{n1} & \lambda_{n2} & \cdots & \lambda_{n,n-1} & \lambda_{n,n}\end{pmatrix} \]
2993: 	with $\lambda_{ij} \in k[[x]]$, and the pullback diagram is the same with the new $\Lambda(n)$ and $\bH(n)$. 
2994: 	We call $\bH(n)$ the \textbf{normalization} of the order $\Lambda(n)$. We will call 
2995: 	$\Lambda(n)$ a \textbf{double simple cycle order}. In general, we may replace $k[[x]]
2996: 	$ by any $R$ such that $R$ is a complete noetherian local domain, and we then 
2997: 	replace $(x)$ with $\fm$, the maximal ideal of $R$. For $R=k[[x]]$ and $\fm=(x)$, 
2998: 	the order $\Lambda(n)$ is isomorphic to the completion of the path algebra:
2999: 	\[
3000: 	\begin{tikzcd}
3001: 		& n \arrow[r, dashed] \arrow[r, bend left] & 1 \arrow[rd, dashed] \arrow[rd, bend left] &  \\
3002: 		n-1 \arrow[ru, bend left] \arrow[ru, dashed] &  &  & 2 \arrow[d, bend left] \arrow[d, dashed] \\
3003: 		n-2 \arrow[u, bend left] \arrow[u, dashed] &  &  & 3 \arrow[ld, bend left] \arrow[ld, dashed] \\
3004: 		& 5 \arrow[lu, no head, dotted, bend left] & 4 \arrow[l, bend left] \arrow[l, dashed] & 
3005: 	\end{tikzcd}
3006: 	\]
3007: 	where the relations $I=\la a_{i+1}a_i, b_{i+1}b_i \ra_{i =1}^n$ is given by composition of two arrows of the same color. We then have a pullback diagram
3008: 	\[ 
3009: 	\xymatrix{\tilde{A}(n) \ar[r]^{\pi_1} \ar[d]_{\iota_1} & k^n \ar[d]^{\iota_2} \\
3010: 		k\tilde{\mathbb{A}}_n \times k\tilde{\mathbb{A}}_n \ar[r]_{\pi_2} & k^n \times k^n }
3011: 	\]
3012: 	for $n$ odd, and 
3013: 	\[ 
3014: 	\xymatrix{ \tilde{A}(n) \ar[r]^{\pi_1} \ar[d]_{\iota_1} & k^n \ar[d]^{\iota_2} \\
3015: 		k\tilde{\mathbb{A}}_{2n} \times  \ar[r]_{\pi_2} & k^{2n} }
3016: 	\]
3017: 	for $n$ even. 
3018: 	We will call $\tilde{A}(n)$ the class of \textbf{double simple cycle algebras}.
3019: 	
3020: 	
3021: 	\subsection{The Riemann Surfaces}
3022: 	Let $\tilde{A}(n) = kQ/I$ be a double simple cycle algebra of length $n$. Then $I = \la a_{i+1}a_i, b_{i+1}b_i \ra_{i 
3023: 		\in \ZZ/n\ZZ}$. In particular, there are two cycles, up to cyclic permutation, "$R$" and "$B$" of length $n$, such that 
3024: 	any two consecutive arrows lies in $I$, and there is a single unique non-zero cycle (not in $I$) of length $2n$, 
3025: 	\[ C = (a_1b_2a_3b_4 \cdots b_1a_2b_3a_4b_5 \cdots a_{n-1}b_n) \] 
3026: 	up to a cyclic permutation of the arrows if $n$ is even, and there are two
3027: 	\[ C_1 = (a_1b_2a_3 \cdots a_{n-1}b_n), \quad C_2 = (b_1a_2b_3 \cdots b_{n-1}a_n) \]
3028: 	if $n$ is odd. Let $\varphi = \varphi_R \varphi_B \in S_{Q_1}$ be two cyclic permutations in the permutation group $S_{Q_1} \cong S_{2n}$. Let $\varphi_R = (a_1,a_2,...,a_n) \mapsto  (1,2,...,n)$ and $\varphi_B = (b_1, b_2, ..., b_n) \mapsto (n+1, n+2, ..., 2n)$ given by identifying $Q_1$ with $[2n]$ by fixing a labeling of the arrows. Let 
3029: 	\[
3030: 	\sigma =
3031: 	\begin{cases}
3032: 		(a_1b_2a_3b_4 \cdots b_1a_2b_3a_4b_5 \cdots a_{n-1}b_n) \quad \text{if} \ |Q_0|=2k+1 \\
3033: 		(a_1,b_2,a_3,..., b_{n-2},a_{n-1},b_n)(b_1,a_2,b_3,...,a_{n-2}b_{n-1}a_n) \quad \text{if}\ |Q_0|=2k
3034: 	\end{cases}
3035: 	\]
3036: 	In the above cases we may identify, 
3037: 	\[ (a_1b_2a_3b_4 \cdots b_1a_2b_3a_4b_5 \cdots a_{n-1}b_n) \mapsto (1, n+1, 2, n+2, ..., n, 2n) \in S_{2n} \]
3038: 	and
3039: 	\begin{align*}
3040: 		(a_1,b_2,a_3,..., b_{n-2},a_{n-1},b_n)&(b_1,a_2,b_3,...,a_{n-2}b_{n-1}a_n) \\
3041: 		&\mapsto (1,n+2,3,...,n-1,2n)(n+1,2,n+3,...,2n-1,n) \in S_{2n}.
3042: 	\end{align*}
3043: 	
3044: 	for $k=0,1,2,...$; finally, let $\alpha = (1,n+1)(2,n+2) \cdots (n,2n)$. If we restrict $I$ to $R$ or $B$, we have an algebra $\Lambda_R = kR/I \cong k \mathbb{\tilde{A}}_n/\rad(k \mathbb{\tilde{A}}_n)^2 \cong kB/I = \Lambda_B$. We may then view $\alpha$ as the gluing that identifies $ta_i' \leftrightarrow tb_i'$, where $a_i' \in \Lambda_R$ and $b_i' \in \Lambda_B$ are arrows in the respective algebras. It is not hard to verify $\sigma \alpha = \varphi^{-1}$, and thus the triple $[\sigma, \alpha, \varphi]$ may be seen as a combinatorial embedding of a graph into a Riemann surface. This map $\Gamma(n) \hookrightarrow X$ has either one vertex if $n$ is even, or two vertices if $n$ is odd, corresponding to $\sigma$. It has two faces, corresponding to $\varphi_R$ and $\varphi_B$; it also has exactly $n=|Q_0|$ edges corresponding to $\alpha$. Thus we may compute the surface associated to the algebra $\tilde{A}(n)$ via
3045: 	\[ \chi(\tilde{A}(n)) = |\sigma|-|\alpha|+|\varphi| = \begin{cases}
3046: 		2-2k \quad \text{if} \ |Q_0|=n=2k+1 \\
3047: 		4-2k \quad \text{if} \ |Q_0| = n = 2k
3048: 	\end{cases}. \]
3049: 	for $k=0,1,2,...$, and $n \geq 1$, so that we have the genus function 
3050: 	\[ g(\tilde{A}(n)) = \begin{cases}
3051: 		k \quad \text{if} \ n=2k+1 \\
3052: 		k-1 \quad \text{if} \ n=2k
3053: 	\end{cases} \]
3054: 	
3055: 	
3056: 	\section{Genus 0 Examples}
3057: 	\subsection{The Dihedral Ringel Algebra $\tilde{A}(1)$}
3058: 	Let $\sigma = (1,2), \alpha = (1,2), \phi = (1)(2)$. Then the closed surface algebra $\Lambda(\mathfrak{c})$ given by the constellation $\mathfrak{c}_1 = [\sigma, \alpha, \varphi]_0$ is given by the graph with one vertex and one loop embedded in the sphere. In particular $\Lambda(\mathfrak{c}) = \tilde{A}(1)$ is given by the quiver
3059: 	\[ \xymatrix{\bullet \ar@(ul,dl)_x \ar@{.>}@(ur,dr)^y} \]
3060: 	and is isomorphic to $k\la x,y \ra / \la x^2, y^2 \ra$. Any representation of this quiver is a pair $(X,Y) \in \End(V) 
3061: 	\times \End(V)$ of nilpotent operators on a vector space $V$ 
3062: 	%with $X^2=Y^2=0$. So we have $2\rank(X) \leq 
3063: 	%\dim_kV$ and $2\rank(Y) \leq \dim_kV$. We have 
3064: 	%\[ X= \begin{pmatrix}
3065: 		%0 & A \\
3066: 		%0 & 0
3067: 		%\end{pmatrix} \quad \text{and} \quad Y=\begin{pmatrix}
3068: 		%0 & 0 \\
3069: 		%B & 0
3070: 		%\end{pmatrix} \]
3071: 		%where $A$ and $B$ are $p \times p$, and $q \times q$ blocks respectively, with $p,q \leq n/2$. Any minor $M_j(A)$ or $M_j(B)$ is then invariant under the action of $\SL(V)$. 
3072: 		
3073: 		\subsection{$\tilde{A}(2)$}
3074: 		Let $\mathfrak{c}_2=[\sigma, \alpha, \varphi]_2$ be given by $\sigma = (1,4)(2,3) \alpha = (1,3)(2,4), \varphi = (1,2)(3,4)$, then $\chi(\mathfrak{c}_2) = 2$ and $g(\mathfrak{c}_2)=0$. The embedded graph can be represented by the equator of the sphere with two vertices on it. The quiver which comes from this graph is\\
3075: 		\[
3076: 		\begin{tikzcd}
3077: 			1 \arrow[rr, "a_1", bend left=49] \arrow[rr, "b_1"', dashed, bend right=49] &  & 2 \arrow[ll, "a_2" description, bend right] \arrow[ll, "b_2" description, dashed, bend left]
3078: 		\end{tikzcd}
3079: 		\]
3080: 		
3081: 		%\begin{prop} (\cite{Sh}):
3082: 		%	The algebra $k[\Phi \cap \Gamma(G/H)]$ is a polynomial algebra unless $\bd = (n,n)$, $0<r(a_1) = m< n$, $r(a_2) = n-m$, $r(b_1) = n-m$, and $r(b_2) = m$. In this case $k[\rep(\Lambda, \bd, r)]^{\SL(\bd)} \cong k[\Phi \cap \Gamma(G/H)]$ is a hypersurface. 
3083: 		%\end{prop}
3084: 		
3085: 		
3086: 		
3087: 		
3088: 		\section{Genus 1 Examples}
3089: 		\subsection{$\tilde{A}(3)$}
3090: 		Let $\mathfrak{c}_3=[\sigma, \alpha, \varphi]_3$ be defined by $\sigma = (1,6,2,4,3,5), \alpha = (1,4)(2,5)(3,6), \varphi = (1,2,3)(4,5,6)$. Then we have $\chi(\mathfrak{c}_3) = 1-3+2=0$ so $g(\mathfrak{c}_3)=1$. The graph embedded on the torus can be obtained by the following gluing of the square to obtain the torus,
3091: 		
3092: 		
3093: 		the quiver is then, 
3094: 		\[
3095: 		\xymatrix{
3096: 			& 1 \ar@/^1pc/[dr] \ar@{.>}[dr] & \\
3097: 			3 \ar@/^1pc/[ur] \ar@{.>}[ur] & & 2 \ar@/^1pc/[ll] \ar@{.>}[ll]
3098: 		}
3099: 		\]
3100: 		
3101: 		
3102: 		
3103: 		
3104: 		\subsection{$\tilde{A}(4)$}
3105: 		Let $\mathfrak{c}_4 = [\sigma, \alpha, \varphi]_4$ be given by
3106: 		$\sigma = (1,8,3,6)(2,5,4,7), \alpha = (1,5)(2,6)(3,7)(4,8), \varphi = (1,2,3,4)(5,6,7,8)$
3107: 		$\chi(\mathfrak{c}_4)=2-4+2$ so $g(\mathfrak{c}_4) = 1$.
3108: 		
3109: 		\[
3110: 		\xymatrix{
3111: 			1 \ar@/^1pc/[r] \ar@{.>}[r] &   2 \ar@/^1pc/[d] \ar@{.>}[d] \\
3112: 			4 \ar@/^1pc/[u] \ar@{.>}[u] &   3 \ar@/^1pc/[l] \ar@{.>}[l]
3113: 		}
3114: 		\]
3115: 		
3116: 		
3117: 		
3118: 		\section{Genus 2 Examples}
3119: 		\subsection{$\tilde{A}(5)$}
3120: 		The constellation $\mathfrak{c}_5=[\sigma, \alpha, \varphi]_5$ is defined by,
3121: 		\begin{itemize}
3122: 			\item $\sigma = (1,10,4,8,2,6,5,9,3,7)$, 
3123: 			\item $\alpha = (1,6)(2,7)(3,8)(4,9)(5,10)$, 
3124: 			\item $\varphi = (1,2,3,4,5)(6,7,8,9,10)$.
3125: 		\end{itemize} 
3126: 		$\chi(\mathfrak{c}_5) = 1-5+2 = -2$, so $g(\mathfrak{c}_5) = 2$. 
3127: 		\[
3128: 		\xymatrix{
3129: 			& 1 \ar@/^1pc/[dr] \ar@{.>}[dr] & \\
3130: 			5 \ar@/^1pc/[ur] \ar@{.>}[ur] &  & 2 \ar@/^1pc/[d] \ar@{.>}[d] \\
3131: 			4 \ar@/^1pc/[u] \ar@{.>}[u] &  & 3 \ar@/^1pc/[ll] \ar@{.>}[ll]
3132: 		} \]
3133: 		\subsection{$\tilde{A}(6)$}
3134: 		The constellation $\mathfrak{c}_6=[\sigma, \alpha, \varphi]_6$ is defined by,
3135: 		\begin{itemize}
3136: 			\item $\sigma = (1,12,5,10,3,8)(2,7,6,11,4,9)$, 
3137: 			\item $\alpha = (1,7)(2,8)(3,9)(4,10)(5,11)(6,12)$, 
3138: 			\item $\varphi = (1,2,3,4,5,6)(7,8,9,10,11,12)$.
3139: 		\end{itemize}
3140: 		The quiver of $\tilde{A}(6)$ is then,
3141: 		\[
3142: 		\xymatrix{
3143: 			& 1 \ar@/^1pc/[dr] \ar@{.>}[dr] & \\
3144: 			6 \ar@/^1pc/[ur] \ar@{.>}[ur] & &  2 \ar@/^1pc/[d] \ar@{.>}[d] \\
3145: 			5 \ar@/^1pc/[u] \ar@{.>}[u] & &  3 \ar@/^1pc/[dl] \ar@{.>}[dl]\\
3146: 			& 4 \ar@/^1pc/[ul] \ar@{.>}[ul] & 
3147: 		}
3148: 		\]
3149: 		
3150: 		
3151: 		\section{Genus 3 Examples}
3152: 		\subsection{$\tilde{A}(7)$}
3153: 		\[\xymatrix{
3154: 			& & 1 \ar@/^1pc/[drr] \ar@{.>}[drr] & & \\
3155: 			7 \ar@/^1pc/[urr] \ar@{.>}[urr]& & & &  2 \ar@/^1pc/[d] \ar@{.>}[d] \\
3156: 			6 \ar@/^1pc/[u] \ar@{.>}[u] & & & & 3 \ar@/^1pc/[dl] \ar@{.>}[dl]\\
3157: 			& 5 \ar@/^1pc/[ul] \ar@{.>}[ul] &  & 4 \ar@/^1pc/[ll] \ar@{.>}[ll] & 
3158: 		} \]
3159: 		\subsection{$\tilde{A}(8)$}
3160: 		\[
3161: 		\xymatrix{
3162: 			& 1 \ar@/^1pc/[rr] \ar@{.>}[rr] &  & 2 \ar@/^1pc/[dr] \ar@{.>}[dr] & \\
3163: 			8 \ar@/^1pc/[ur] \ar@{.>}[ur]& & & &  3 \ar@/^1pc/[d] \ar@{.>}[d] \\
3164: 			7 \ar@/^1pc/[u] \ar@{.>}[u] & & & & 4 \ar@/^1pc/[dl] \ar@{.>}[dl]\\
3165: 			& 6 \ar@/^1pc/[ul] \ar@{.>}[ul] &  & 5 \ar@/^1pc/[ll] \ar@{.>}[ll] & 
3166: 		}
3167: 		\]
3168: 		
3169: 		
3170: 		
3171: 		
3172: 		%----------------------------------------------------------------------------------------
3173: 		%Representation Varieties and Rings of Relative Invariants
3174: 		%----------------------------------------------------------------------------------------
3175: 		
3176: 		
3177: 		
3178: 		
3179: 		\part{Representation Varieties and Rings of Relative Invariants}
3180: 		
\chapter{Background on Representation Theory of General Linear Groups} · lines 3181–3275
3181: 		\chapter{Background on Representation Theory of General Linear Groups}
3182: 		
3183: 		
3184: 		\section{Young Tableaux and Schur Functors}\label{Young Tableaux}
3185: 		A \textbf{partition} $\lambda \vdash m$, of some nonnegative integer $m$ is a sequence of nonincreasing numbers $\lambda = (\lambda_1, ..., \lambda_s)$ such that $\sum_i \lambda_i = m$. We define a \textbf{Young diagram} corresponding to a partition $\lambda = (\lambda_1, ..., \lambda_s) \vdash m$, as the diagram with $\lambda_i$ boxes in the $i^{th}$ row. We identify partitions with their Young diagrams and speak of the two interchangeably. For a free module $E$ over a commutative ring $K$ with ordered basis $\{e_1, ..., e_n\}$, we associate a filling of the diagram $\lambda$ by integers $\{1, ..., n\}$ to an element in the module
3186: 		\[ \bigwedge^{\lambda_1}E \otimes \cdots \otimes \bigwedge^{\lambda_s}E \]
3187: 		as follows: If in row $i$ and box $j$ of $\lambda$ we have the integers $t(i, j)$ for $j=1, ..., \lambda_i$, we associate the element
3188: 		\[ e_{t(1,1)} \wedge \cdots \wedge e_{t(1,\lambda_1)} \otimes  \cdots \otimes e_{t(s,1)} \wedge \cdots \wedge e_{t(s, \lambda_s)}.\]
3189: 		We define such a filling to be a \textbf{tableaux}. A tableaux is \textbf{standard} if its rows are strictly increasing, and its columns are nondecreasing. 
3190: 		
3191: 		Fix a free module $E$ of rank $n$ over a commutative ring $K$. Let $\lambda = ( \lambda_1, ..., \lambda_s) \vdash m$ be a partition. We define the module
3192: 		\[ L_{\lambda}E = \bigwedge^{\lambda_1} \otimes \cdots \otimes \bigwedge^{\lambda_s}E/R(\lambda, E) \]
3193: 		where the submodule $R(\lambda, E)$ is the sum of all submodules of the form
3194: 		\[ \bigwedge^{\lambda_1}E \otimes \cdots \otimes \bigwedge^{\lambda_{a-1}}E \otimes R_{a, a+1}E \otimes \bigwedge^{\lambda_{a+2}}E \otimes \cdots \otimes \bigwedge^{\lambda_s}E \]
3195: 		for $1 \leq a \leq s-1$. Here $R_{a,a+1}E$ is the submodule spanned by the images of the maps $\theta(\lambda, a, u, v, E)$
3196: 		\[ \xymatrix{ \bigwedge^uE \otimes \bigwedge^{\lambda_a-u+\lambda_{a+1}-v}E \otimes \bigwedge^vE \ar[d]^{1 \otimes \Delta \otimes 1} \\
3197: 			\bigwedge^uE \otimes \bigwedge^{\lambda_a-u}E \otimes \bigwedge^{\lambda_{a+1}-v}E \bigwedge^vE \ar[d]^{m_{12} \otimes m_{34}} \\
3198: 			\bigwedge^{\lambda_a}E \otimes \bigwedge^{\lambda_{a+1}}E}.\]
3199: 		Here, $\Delta$ is the diagonal embedding (or comultiplication), and $m: \bigwedge^r E \otimes \bigwedge^s E \to \bigwedge^{r+s}E$ is a component of the multiplication map on the exterior algebra $\bigwedge^{\bullet}E$. Combinatorially, we may use the theory of Young tableaux to describe the modules $L_{\lambda}E$. It is well known the standard 
3200: 		tableaux form a basis of $L_{\lambda}E$. Further, the relations $R(\lambda, E)$ may be visualized as follows. Let $\lambda \vdash 
3201: 		m$ be a partition with at most $n$ parts. To the map $\theta(\lambda, a, u, v, E)$ we associate a \textbf{Young scheme}. The Young 
3202: 		scheme is defined as being a diagram of shape $\lambda$ with empty boxes everywhere except the $a^{th}$ and 
3203: 		$a+1^{st}$ rows. In row $a$ there are $u$ empty boxes followed by $\lambda_a-u$ filled boxes. In row $a+1$ there are 
3204: 		$\lambda_{a+1}-v$ filled boxes followed by $v$ empty boxes. We restrict to $u+v<\lambda_{a+1}$ as in the definition of 
3205: 		$L_{\lambda}E$. Let $U_j = e_{t(j,1)} \wedge \cdots \wedge e_{t(j, \lambda_j)}$, $V_1 = e_{x_1} \wedge \cdots \wedge e_{x_u}$, 
3206: 		$V_2 = e_{y_1} \wedge \cdots \wedge e_{y_{\lambda_a-u+\lambda_v-v}}$, and $V_3 = e_{z_1} \wedge \cdots \wedge e_{z_v}$. 
3207: 		Then the image of a typical element 
3208: 		\[ U_1 \otimes \cdots \otimes U_{a-1} \otimes V_1 \otimes V_2 \otimes V_3 \otimes U_{a+2} \otimes \cdots \otimes U_s \]
3209: 		is a sum of tableaux where we put $x_1, ..., x_u$ in the empty $u$ boxes in row $a$, and $z_1, ..., z_v$ in the empty $v$ boxes of row $a+1$, and we shuffle the elements $y_1, ..., y_{\lambda_a-u+\lambda_{a+1}-v}$ between the filled boxes in row $a$ and $a+1$. The coefficients of the tableaux in the summation are $\pm 1$ depending on the sign of the permutations coming from the exterior diagonals.\sidenote{From now on, we will let $L_{\lambda}F$ denote the Schur functor corresponding to the diagram $\lambda$, and we will let $S_{(\lambda-k)}F = L_{\lambda}F \otimes (\bigwedge^{\dim F}F^*)^{\otimes k}$, where $\lambda-k$ is obtained by subtracting the integer $k$ from every entry of the vector $\lambda$.}
3210: 		
3211: 		
3212: 		\section{Standard Monomials,The Straightening Law, and Determinantal Varieties}\label{Straightening Law 1}
3213: 		
3214: 		\subsection{Standard Monomials and Straightening Laws}\label{monomial orders}
3215: 		Let us now introduce the notion of a standard monomial theory. 
3216: 		
3217: 		\begin{defn}
3218: 			Let $R$ be a ring and let $A$ be a commutative $R$-algebra, and let $S:=\{s_1, ..., s_N\} \subset R$ have a partial order $\leq$. 
3219: 			\begin{enumerate}
3220: 				\item An ordered product $s_{i_1} \cdots s_{i_k}$ of elements from $S$ is said to be a \textbf{standard monomial} if the elements appear in nondecreasing order, with respect to the partial order $\leq$. 
3221: 				\item We say $A$ has a \textbf{standard monomial theory for $S$} if the standard monomials for a basis of $A$ over $R$.
3222: 				\item If $s, s' \in S$ are incomparable in the partial order $\leq$, we have a unique expression called a \textbf{straightening law}:
3223: 				\[ s \cdot s' = \sum_i c_iM_i, \quad c_i \in R, M_i \text{ standard}. \]
3224: 				If a monomial $s_{i_1} \cdots s_{i_k}$ is nonstandard we may replace it with a standard one as follows. If there is a product $s \cdot s'$ in $s_{i_1} \cdots s_{i_k}$ with $s > s'$ we replace if with $s' \cdot s$. If $s$ and $s'$ are incomparable, we replace $s \cdot s'$ with $s \cdot \left(\sum_i c_iM_i\right)$. 
3225: 				\item We say the $R$-algebra $A$ has a \textbf{straightening law} if the previous replacement algorithm always terminates after finitely many steps. 
3226: 			\end{enumerate}
3227: 		\end{defn}
3228: 		
3229: 		We define a \textbf{standard bi-tableau}\sidenote{An archetypal example of bi-tableaux and an algebra with straightening law and standard monomial theory is the algebra $\Sym(V \otimes W^*)$ for two vector spaces $V$ and $W$, or more generally, let $X = (x_{ij})$ be a matrix of indeterminates so that $X \in \Hom_K(E, F) = E^* \otimes F$, where $E$ and $F$ are two free $\ZZ$-modules. Define the ring $R = \ZZ[X] = \ZZ[x_{ij}]$, to be the polynomial ring in the indeterminates $(x_{ij})$, and let $\{e_1, ..., e_m\}$ and $\{f_1, ..., f_n\}$ be ordered bases of $E$ and $F$ respectively. There is a natural action of the group $G = \GL(E) \times \GL(F)$ on $R$ induced by the action on $X$ define by $(A, B) \cdot X = A^{-1}XB$. If $K$ is a field, the orbits in $\Hom_K(E,F)$ are classified by ranks, and the orbit closures of maps of rank $k$ say, are all maps of rank $\leq k$. The action of $G$ on $R$ is more complicated. If $E$ and $F$ are free $K$-modules for a field $K$, and $V_k$ is the orbit closure of rank $k$ maps, then the defining ideal of $V_k$ is $I_{k+1} = R(\bigwedge^{k+1} E^* \otimes \bigwedge^{k+1}F)$ generated by minors of size $k+1$, and the coordinate ring $R/I_{k+1}$ is normal and Cohen Macaulay. A classical characteristic free approach using the Schur functors allows one to define a basis of $\KK[E^* \otimes F]$ in terms of certain \emph{standard monomials} given by standard bi-tableaux.}, denoted $(s|t)$ as a pair of standard tableaux $s$ and $t$ of the same shape $\lambda$, where by convention we write $s$ in reverse order. To a bitableau we associate a product of minors of $X$, where the entries of row $a$ of $s$ give the columns and the entries of row $a$ of $t$ give the rows of the minor of $X$. Then each pair of rows in $s$ and $t$ defines a minor of size $\lambda_a$, and the bi-tableau is associated to the product of these minors. It is well known that the standard bi-tableaux with at most $\min\{\dim E, \dim F\}$ columns forms a $K$-free basis of $K[E^* \otimes F]$, and that the standard bi-tableaux with at most $k$ columns form a $K$-free basis of $R/I_{k+1}$. We call the associated minors to a standard bi-tableau a \emph{standard monomial} in $R$ or $R/I_{k+1}$. It can be shown that any nonstandard monomial can be written as a sum of standard monomials each of which are earlier in the partial order on monomials. In particular if $M$ is nonstandard then we can write $M = \sum_i n_iM_i + \sum_jn_jM_j$, where $M_i$ are standard and of the same shape as the tableau corresponding to $M$, and the $M_j$ are standard but of a smaller shape in the order on tableau. \\
3230: 		Let $\mathbf{Gr}(n,m+n)$ denote the Grassmannian variety of $n$-dimensional subspaces of an $(m+n)$-dimensional vector space $V$. Let $\{w_1, ..., w_n\}$ be a basis for an $n$-dimensional subspace $W \subset V$. Then the vector $w_1 \wedge \cdots \wedge w_n$ determines a point $[W]$ in the projective space $\mathbb{P}(\bigwedge^nV)$, and the map $W \mapsto [W]$ is a one-to-one correspondence between $n$-dimensional subspaces of $V$ and points in $\mathbb{P}(\bigwedge^n V)$ (which are lines in $\bigwedge^nV$). For the standard basis $\{e_i\}_{i=1}^{m+n}$ of $V$, we have the standard basis $\{e_{i_1} \wedge \cdots \wedge e_{i_n}: i_1< \cdots < i_n\}$ of $\bigwedge^n V$. If to any $v_1 \wedge \cdots \wedge v_n \in \bigwedge^n V$ we associate the matrix 
3231: 		\[X = \begin{pmatrix}
3232: 			v_1 \\
3233: 			\vdots \\
3234: 			v_n
3235: 		\end{pmatrix} = \begin{pmatrix}
3236: 			v_{1,1} & v_{1,2} & \cdots & v_{1,m+n} \\
3237: 			v_{2,1} & v_{2,2} & \cdots & v_{2,m+n} \\
3238: 			\vdots & \vdots & \ddots & \vdots \\
3239: 			v_{n,1} & v_{n,2} \& \cdots & v_{n,m+n}
3240: 		\end{pmatrix},\]
3241: 		we have that in the basis $\{e_{i_1} \wedge \cdots \wedge e_{i_n}:i_1 < \cdots < i_n\}$ the coordinates of $v_1 \wedge \cdots \wedge v_n$ are given by the maximal minors of $X$. Let $[i_1, i_2, ..., i_n]$ denote the minor given by columns $i_1, i_2, ..., i_n$ of $X$. So,
3242: 		\[ v_1 \wedge \cdots \wedge v_n = \sum_{1 \leq i_1 \leq \cdots \leq i_n \leq m+n} [i_1, ..., i_n]e_{i_1} \wedge \cdots \wedge e_{i_n}.\]
3243: 		The open set $S_{n,m+1} = \{(v_1, ..., v_n) \in V^n: v_1 \wedge \cdots \wedge v_n \neq 0\} \subset \Hom(K^{m+n}, K^n)$ of maximal rank $n \times (m+n)$-matrices is called the \textbf{Stiefel manifold}. Now, $\mathbf{Gr}(n,m+n)$ can be identified with the orbits in $S_{n,m+n} \subset \Hom(K^{m+n}, K^n)$ under the action of $\GL(n,K)$ by left multiplication. Further, given a homomorphism $\pi: K^r \to K^{r+s}$ of two affine spaces, of the form
3244: 		\[ \pi(x_1, ..., x_r) = (x_1, ..., x_r, p_1, ..., p_s) \]
3245: 		where $p_i$ are polynomials in the $x_j$, the image of $\pi$ is a closed subvariety of $K^{r+s}$, and $\pi$ is an isomorphism of $K^r$ onto its image (it is the \emph{graph} of a polynomial map). The defining ideal is $I = (x_{r+i}-p_i)$, and the inverse map is
3246: 		\[ (x_1, ..., x_r, ..., x_{r+s}) \mapsto (x_1, ..., x_r).\]
3247: 		Now, consider the open set $U$ of $\mathbf{Gr}(n,m+n)$ where the Pl\"{u}cker coordinate given by the minor coming from the last $n$ columns is nonzero. $U$ can be identified with the space of $n \times m$ matrices. The association is given by associating any $X$ with the row span of the matrix
3248: 		\[ (X| \tilde{\id_n}) = \begin{pmatrix}
3249: 			x_{11} & \cdots & x_{1m} & 0 & \cdots & 0 & 1 \\
3250: 			x_{21} & \cdots & x_{2m} & 0 & \cdots& 1 & 0 \\
3251: 			\vdots & \ddots & \vdots & \vdots &   & \vdots & \vdots \\
3252: 			x_{n1} & \cdots & x_{nm} & 1 & \cdots & 0 & 0
3253: 		\end{pmatrix}.\]
3254: 		One may now identify Pl\"{u}cker coordinates with \textbf{bi-tableaux}. 
3255: 		\begin{ex}
3256: 			Let $n=3$, $m=5$, and write
3257: 			\[ X = \begin{pmatrix}
3258: 				x_{31} & x_{32} & x_{33} & x_{34} & x_{35} & 1 & 0 & 0 \\
3259: 				x_{21} & x_{22} & x_{23} & x_{24} & x_{25} & 0 & 1 & 0 \\
3260: 				x_{11} & x_{12} & x_{13} & x_{14} & x_{15} & 0 & 0 & 1 \\
3261: 			\end{pmatrix}.\]
3262: 			Now let the Pl\"{u}cker coordinate $[1,2,3][1,2,5][1,2,7][2,3,6][5,6,7][5,6,8]$ be represented by the tableau
3263: 			\[ \young(123,125,127,238,567,568). \quad (*) \]
3264: 			To this we may associate the bi-tableau
3265: 			\[ \begin{pmatrix}
3266: 				\young(123,123,13,12,1,2) & &  \young(123,125,12,23,5,5)
3267: 			\end{pmatrix} \quad \quad (**) \]
3268: 			Neither the tableau $(*)$, nor the double tableau $(**)$ are standard, and thus we may use the quadratic relations on Pl\"{u}cker coordinates to "straighten" the tableau $(*)$, which induces a straightening of the double tableau $(**)$ to a standard bi-tableau. These quadratic relations can be seen as the shuffling relations coming from the definition of the Schur functors from the previous sections. 
3269: 		\end{ex}
3270: 		
3271: 		\subsection{Standard Pl\"{u}cker Coordinates}\label{Plucker monomial orders}
3272: 		We consider the Pl\"{u}cker coordinate standard if and only if the associated tableau is, i.e. the tableau is strickly increasing along rows, and nondecreasing along columns. In this example, the coordinate is not standard. We have a \textbf{straightening law} on the coordinates which is given by the definition of the Schur-functors and the relations among tableaux induced by the multilinear map defining them, i.e. the \textbf{shuffling relations}. One may also view the straightening law on standard bi-tableaux as a consequence of the quadratic relations on Pl\"{u}cker coordinates in the Grassmannian. If we take the perspective of double tableaux, we let the left tableau be the "row tableau", with indices $j \in [1,n]$ and the right tableau as the "column tableau" with indices $i \in [1,m+n]$. Each pair of rows gives a minor of the matrix $X$. We think of the space of one line tableau of size $k$ as a vector space $M_k$, with basis $(j_k, ..., j_i|i_1, ..., i_k)$, so that if two indices on the right or left are equal, then the symbol is zero, and the symbols are alternating separately on the left and right. For any partition $\lambda:= m_1 \geq m_2 \geq \cdots \geq m_r$, the tableaux of shape $\lambda$ can be thought of as a tensor product $M_{m_1} \otimes M_{m_2} \otimes \cdots \otimes M_{m_r}$. Evaluating a formal tabeleau as a product of minors gives a nontrivial kernel, which is the space spanned by the shuffling relations, or equivalently the straightening law. The action of $\GL(E) \times \GL(F)$ on $K[X]$ induces an action by the two groups of diagonal matrices, and the content of a bi-tableau is a weight vector for the product of the two algebraic tori. In particular If $(A,B) = (a_i) \times (b_j) \in T(E) \times T(F)$ is an element of the product of the tori $T(E) \subset \GL(E)$ and $T(F) \subset \GL(F)$, then the weight is $(\prod_{i+1}^n a_i^{-k(i)}; \prod_{j=1}^{m+n} b_j^{h(j)})$. At this point we should comment that there is a well-known partial order on multi-tableaux. 
3273: 		
3274: 		% \section{Partial Order on Multitableux}
3275: 		
\chapter{Varieties of Circular Complexes} · lines 3276–3926
3276: 		\chapter{Varieties of Circular Complexes}
3277: 		\section{Varieties of Complexes}
3278: 		Let us now move on to a classic example, that of the \emph{varieties of complexes}. These are examples of orbit closures of quivers which have been studied by many authors at this point (see for example \cite{}, \cite{}, \cite{}....). Let $S = k[X^{(k)}_{i(k),j(k)}]$, where $X^{(k)}$ is the $k^{th}$ matrix representing $d_k$ in the complex
3279: 		\[ \xymatrix{
3280: 			V_n \ar[r]^{d_n} & V_{n-1} \ar[r]^{d_{n-1}} & \cdots \ar[r]^{d_{2}} & V_1 \ar[r]^{d_1} & V_0 
3281: 		}  
3282: 		\]
3283: 		Let $I$ be the ideal generated by $\rank(X^{(k)}) \times \rank(X^{(k)})$ minors of each $X^{(k)}$, and by the equations given by $X^{(k+1)}X^{(k)} = 0$. Then $R=S/I$ is the coordinate ring of the parametrizing variety of complexes with the dimension vector $(\bd(1), ..., \bd(n))$ and rank sequence $r = (r(1), ..., r(n-1))$. 
3284: 		
3285: 		\begin{theorem}
3286: 			(cite DEP, DS, PW, and T) The coordinate ring of a sequence of $k$-vector spaces
3287: 			\[ \xymatrix{
3288: 				V_n \ar[r]^{d_n} & V_{n-1} \ar[r]^{d_{n-1}} & \cdots \ar[r]^{d_{2}} & V_1 \ar[r]^{d_1} & V_0 
3289: 			}  
3290: 			\]
3291: 			has a filtration by Schur functors
3292: 			\begin{align*}
3293: 				\Sym(V_1 \otimes V_2^* \oplus \cdots \oplus V_{n-1} \otimes V_{n}^*) & \\
3294: 				= \bigoplus_{(\lambda(1), ..., \lambda(n-1))} L_{\lambda(1)}V_1 \otimes L_{\lambda(1)}V_2^* &\otimes \cdots \otimes L_{\lambda(n-1)}V_{n-1} \otimes L_{\lambda(n-1)}V_n^*
3295: 			\end{align*}
3296: 			where each $\lambda(i)$ has at most $\min\{\dim V_i, \dim V_{i+1} \}$ columns. 
3297: 			In the case that such a sequence is a complex of vector spaces DeConcini and Strickland show that the filtration is
3298: 			\begin{align*}
3299: 				\Sym(V_1 \otimes V_2^* \oplus \cdots \oplus V(_{n-1} \otimes V_n^*)/I &  \\
3300: 				= \bigoplus_{(\lambda(1), ..., \lambda(n-1))} L_{(\lambda(1))}V_1 \otimes L_{(\lambda(2), -\lambda(1))}V_2 &\otimes \cdots \otimes L_{(\lambda(n-1), -\lambda(n-2))}V_{n-1} \otimes L_{(-\lambda(n-1))}V_n.
3301: 			\end{align*}
3302: 			Here each $\lambda(k)$ has at most $\rank(d_k)$ columns, where $d_k$ are the differentials in the complex represented by the matrices $X^{(k)}$. 
3303: 		\end{theorem}
3304: 		
3305: 		\begin{theorem}
3306: 			(cite DEP, DS, PW, and T) The algebra $R$ has a basis given by standard multitableaux. Further, the ring $R$ is normal and Cohen-Macaulay. 
3307: 		\end{theorem}
3308: 		
3309: 		
3310: 		
3311: 		\section{Products of Varieties of Complexes}
3312: 		We may of course take products of varieties of complexes. Such varieties arise naturally when there is a partition of a quiver into subquivers with relations of length two. Let us look at an example. 
3313: 		\begin{ex}
3314: 			Suppose $Q$ is the following quiver
3315: 			\[ \xymatrix{ \bullet_1 \ar@/^/@{.>}[r]  \ar[r] \ar@/_/@{~>}[r] & \bullet_2 \ar@/^/@{.>}[r]  \ar[r] \ar@/_/@{~>}[r] & \bullet_3 \ar@/^/@{.>}[r]  \ar[r] \ar@/_/@{~>}[r] & \bullet_4 } \]
3316: 			Let us denote the colors by the set $\{1, 2, 3\}$ (ordered from top to bottom). Let $\{a_1, a_2, a_3\}$ be the arrows of color "$1$", labeled from left to right. Similarly, label arrows of color "$2$" by $\{b_j\}_{j=1, 2, 3}$, and arrows of color "$3$" by $\{c_k\}_{k=1, 2, 3}$. Take the dimension vector $\bd = (2,4,5,3)$, and rank maps $r_1 = (2,2,3) = r_2, r_3 = (1,3,2) $. 
3317: 			
3318: 			The associated graded object for the coordinate ring is
3319: 			\begin{align*}
3320: 				k[A_i, B_j, C_k]_{i,j,k =1, 2, 3} / I &= S_{(\lambda(a_1))}V_1 \otimes S_{(\lambda(a_2),-\lambda(a_1))}V_2 \otimes 
3321: 				S_{(\lambda(a_3), -\lambda(a_2))}V_3 \otimes S_{(-\lambda(a_3))}V_4 \\
3322: 				& \otimes  S_{(\mu(b_1))}V_1 \otimes S_{(\mu(b_2),-\mu(b_1))}V_2 \otimes S_{(\mu(b_3), 
3323: 					-\mu(b_2))}V_3 \otimes S_{(-\mu(b_3))}V_4 \\
3324: 				& \otimes  S_{(\nu(c_1))}V_1 \otimes S_{(\nu(c_2),-\nu(c_1))}V_2 \otimes S_{(\nu(c_3), 
3325: 					-\nu(c_2))}V_3 \otimes S_{(-\nu(c_3))}V_4 .
3326: 			\end{align*}
3327: 			Using the dimension vector $(2, 4, 5, 3)$ and the rank sequences $r_1 = (2,2,3) = r_2$, and $r_3 = (1,3,2)$, then the maps $\lambda, \mu, \nu:Q_1 \to \mathcal{P}$, which assign a partition (or Young diagram) to each arrow, are restricted to partitions such that $\lambda(a_i)$ and $\mu(b_j)$ have no more than $r_1(i) = r_2(j)$ (for $i=j$) parts. Similarly, $\nu(c_k)$ is restricted to partitions which have no more than $r_3(k)$ parts. 
3328: 			
3329: 			Let $m_1 = \la 3|2 \ra_1^1 \la 2|2 \ra_1^1 \la 3|4 \ra_2^1 \la 2,3|2,4 \ra_3^1 \in k[\rep_{Q, 1}(\bd_1, r_1)]$, $m_2 = \la 2|2 \ra_2^2 \la 1,2|1,2 \ra_3^2 \in k[\rep_{Q, 2}(\bd_2, r_2)]$, and $m_3 = \la 2, 3 | 2, 3 \ra_2^3 \la 1,2|2,3 \ra_3^3  \in k[\rep_{Q, 3}(\bd_3, r_3)]$. Then the monomial $m_1 \otimes m_2 \otimes m_3 \in k[\rep_{Q, c}(\bd, r)]$ corresponds to the product of multitableaux, 
3330: 			\[ \left(\young(2,3),\  \young(134,134,3), \ \young(1235,23),\ \young(13) \right) \times \left(\emptyset ,\  \young(2), \ \young(1345,12), \ \young(3) \right) \times \left(\emptyset,\  \young(23), \ \young(145,12), \ \young(1) \right). \]
3331: 			This is \emph{not standard} since $m_2$ and $m_3$ are not standard, thus this is an element of $\Sigma(\bd) = \Sigma(\bd_1) + \Sigma(\bd_2) + \Sigma(\bd_3)$. In the partial order induce by the block order\sidenote{Let $k[x_1, ..., x_k]$ have a monomial order $\leq_1$ and $k[x_{k+1}, ..., x_n]$ have a monomial order $\leq_2$. Then we define the \textbf{block order} on $k[x_1, ..., x_k] \otimes k[x_{k+1}, ..., x_n]$ by saying for any pair of monomials $m, m' \in k[x_1, ..., x_k] \otimes k[x_{k+1}, ..., x_n]$ that $m \leq m'$ if $x_1^{a_1} \cdots x_k^{a_k} \leq_1 x_1^{b_1} \cdots x^{b_k}$, or $x_1^{a_1} \cdots x_k^{a_k} = x_1^{b_1} \cdots x_k^{b_k}$, and $x_{k+1}^{a_{k+1}} \cdots x_n^{a_n} \leq_2 x_{k+1}^{b_{k+1}} \cdots x_n^{b_n}$.}, we have defined, it is larger than the monomial
3332: 			\[ \la 3|2 \ra_1^1 \la 2|2 \ra_1^1 \la 3|4 \ra_2^1 \la 2,3|2,4 \ra_3^1 \otimes  \la 2|3 \ra_2^2 \la 1,2|1,2 \ra_3^2 \otimes \la 2, 3 | 2, 3 \ra_2^3 \la 1,2|2,3 \ra_3^3,\]
3333: 			which differs in only one place from the $m_2$ factor. 
3334: 		\end{ex}
3335: 		
3336: 		
3337: 		\section{Varieties of Circular Complexes}
3338: 		Let $\Lambda_n = k \tilde{\mathbb{A}}_n/ \rad(k \tilde{\mathbb{A}}_n)$ be the algebra given by taking the quotient of the hereditary algebra given by the equioriented type $\tilde{\mathbb{A}}$ quiver with $|Q_0|=|Q_1|=n$, by all paths of length two. Then any representation of $\Lambda_n$ will be a circular complex of vector spaces $V \in \mathcal{C}_n(\bd, r),$ 
3339: 		\[V:~
3340: 		\vcenter{\hbox{  
3341: 				\begin{tikzpicture}[point/.style={shape=circle, fill=black, scale=.3pt,outer sep=3pt},>=latex]
3342: 					\node[point,label={above:$V_1$}] (0) at (0,0) {};
3343: 					\node[point,label={right:$V_2$}] (1) at (1.5,-.5) {};
3344: 					\node[point,label={left:$V_n$}] (n) at (-1.5,-.5) {};
3345: 					\node[point,label={below:$V_{k}$}] (2) at (0,-4) {};
3346: 					\node[point,label={right:$V_{k-1}$}] (3) at (1.5,-3.5) {};
3347: 					\node[point,label={left:$V_{k+1}$}] (4) at (-1.5,-3.5) {};
3348: 					
3349: 					% \draw[dotted] (2.2,-1.65)--(2.2,-2.4);
3350: 					% \draw[dotted] (-2.2,-1.65)--(-2.2,-2.4);
3351: 					
3352: 					\path[->]
3353: 					(4) edge [dashed,bend left=45]  (n)
3354: 					(1) edge [dashed,bend left=45]  (3)
3355: 					(0) edge [bend left=15] node[midway, above] {$A_1$} (1)
3356: 					(3) edge [bend left=15] node[midway, below] {$A_{k}$} (2)
3357: 					(2) edge [bend left=15] node[midway, below] {$A_{k+1}$} (4)
3358: 					(n) edge [bend left=15] node[midway, above] {$A_n$} (0);
3359: 				\end{tikzpicture} 
3360: 		}}
3361: 		\]
3362: 		where $\bd = (\dim_kV_1, \dim_kV_2, ..., \dim_kV_n)$, so $\bd(i) = \dim_kV_i$, and $r = (\rank A_1, \rank A_2, 
3363: 		..., \rank A_n)$ and $r(i) = \rank A_i$. It is easy to see that $r(i)+r(i+1) \leq \bd(i+1)$ for $i \in \ZZ/n\ZZ$. 
3364: 		
3365: 		\begin{theorem}
3366: 			Let $
3367: 			\mathcal{C}_n(\bd) = \rep(\Lambda_n,\bd)$ be the set of all representations of $\Lambda_n$ with dimension 
3368: 			vector $\bd$, and let $\mathcal{C}_n(\bd, r) = \rep(\Lambda_n,\bd,r)$ be the subset of those representations 
3369: 			with rank sequence $r$. 
3370: 			\[ \mathcal{C}_n(\bd) = \left\lbrace V \in \bigoplus_{i \in \ZZ/n\ZZ} \Hom(V(i),V(i+1))  \bigg| V(a_{i+1})V(a_i) = A_{i
3371: 				+1}A_i = 0 \right\rbrace \]
3372: 			can be shown to have irreducible components given by rank sequence which are maximal with respect to $\bd$ 
3373: 			with respect to the conditions $r(i)+r(i+1) \leq \bd(i)$. Further, it is normal, Cohen-Macaulay, and has rational 
3374: 			singularities. The equivariant filtration of the coordinate ring
3375: 			\[
3376: 			\KK[\mathcal{C}_n(\bd, r)] = \bigoplus_{(\lambda_1, ..., \lambda_n)} \bigotimes_{i \in \ZZ/ n\ZZ} S_{\lambda(i), -\lambda(i+1)}V(i)
3377: 			\]
3378: 			holds. 
3379: 		\end{theorem}
3380: 		
3381: 		
3382: 		
3383: 		\begin{proof}
3384: 			The proof proceeds in three steps.
3385: 
3386: 			\medskip\noindent\textbf{Step 1.} We establish the result for a three-term complex $F_2\to F_1\to F_0$ with single-row partitions $\lambda=(k)$ and $\mu=(l)$, reducing the Schur functor filtration to the kernel of the natural map $\bigwedge^k F_1^*\otimes\bigwedge^l F_1\to S_{(l,-k)}F_1$. This is the content of the following lemma.
3387: 			
3388: 			
3389: 			\begin{lemma}
3390: 				For a three term sub-complex of a circular complex,
3391: 				\[ F_2 \to F_1 \to F_0 \]
3392: 				with dimensions $\bd = (\bd(2), \bd(1), \bd(0))$ and rank sequence $r = (r(2), r(1))$, for the map \[\phi: \bigwedge^kF_2 
3393: 				\otimes \bigwedge^k F_1^* \otimes \bigwedge^l F_1 \otimes \bigwedge^lF_0^* \to \bigwedge^k F_2 \otimes S_{(l, -k)} F_1 \otimes 
3394: 				\bigwedge^l F_0^*  , \]
3395: 				we have that for $X = \ker \phi$, $I = R \cdot X = \Sym(F_2 \otimes F_1^* \oplus F_1 \otimes F_0^*) \cdot X$ is exactly 
3396: 				\[ R \cdot \left(\bigwedge^{r(2)+1}X^{(2)} \oplus \bigwedge^{r(1)+1}X^{(1)} \oplus F_2 \otimes F_0^*\right).\]
3397: 			\end{lemma}
3398: 			
3399: 			\begin{proof}
3400: 				Let $F_{\bullet}$ be the complex
3401: 				\[ F_2 \to F_1 \to F_0 \]
3402: 				the more general case for a complex of length $n$ follows from this argument applied locally to each $F_i$, which we will elaborate on following the proof of the lemma. Let $\dim(F_i) = \bd(i)$. Consider the case where $\lambda = (u)$, $\mu = (v)$ and take an element of 
3403: 				\[ \bigwedge^uF_2 \otimes \bigwedge^uF_1^* \otimes \bigwedge^vF_1 \otimes \bigwedge^vF_0^* \]
3404: 				of the form
3405: 				\[ e_{a_1} \wedge \cdots \wedge e_{a_u} \otimes f_{i_1}^* \wedge \cdots f_{i_u}^* \otimes f_{j_1} \wedge \cdots \wedge f_{j_v} \otimes g_{b_1}^* \wedge \cdots \wedge g_{b_v}^*. \]
3406: 				Dualizing (i.e. tensoring with the determinant representation $\det(F_1)$) we may identify this with the element 
3407: 				\[ e_{a_1} \wedge \cdots \wedge e_{a_u} \otimes f_{k_1} \wedge \cdots \wedge f_{k_{\bd(1)-u}} \otimes f_{j_1} \wedge \cdots \wedge f_{j_v} \otimes g_{b_1}^* \wedge \cdots \wedge g_{b_v}^* \]
3408: 				where $\{k_1, ..., k_{\bd(1)-u}\}$ is the complement of $\{i_1, ..., i_u\}$ in $\{1, ..., \bd(1)\}$. This element is in the space
3409: 				\[ \bigwedge^uF_2 \otimes \bigwedge^{\bd(1)-u}F_1 \otimes \bigwedge^vF_1 \otimes \bigwedge^vF_0^*. \]
3410: 				We may identify 
3411: 				\[ f_{k_1} \wedge \cdots \wedge f_{k_{\bd(1)-u}} \otimes f_{j_1} \wedge \cdots \wedge f_{j_v} \]
3412: 				with the corresponding tableau, and identifying $f_i$ with the positive integer $i \in \{1, ..., \bd(1)\}$. We may assume such a tableau is standard, i.e the rows are strictly increasing and the columns are weakly increasing. The image of the tableau $t$ can be computed using the diagram
3413: 				\[ \young(\ \ \cdots \ \bullet \cdots \bullet \bullet \bullet \bullet \cdots \bullet \bullet,\bullet \bullet \cdots \bullet \bullet \cdots \bullet \ \cdots \ )\]
3414: 				with $r$ empty boxes in the first row which is of length $\bd(1)-u$, and $s$ empty boxes in the second row which is of length $v$. This is a mnemonic device for computing the image of the following maps
3415: 				\[ \xymatrix{ \bigwedge^r F_1 \otimes \bigwedge^{\bd(1)-u-r+v-s}F_1 \otimes \bigwedge^vF_1 \ar[d]^{1 \otimes \Delta \otimes 1} \\
3416: 					\bigwedge^r F_1 \otimes \bigwedge^{\bd(1)-u-r}F_1 \otimes \bigwedge^{v-s}F_1 \otimes \bigwedge^vF_1 \ar[d]^{m_{12} \otimes m_{34}} \\
3417: 					\bigwedge^{\bd(1)-u}F_1 \otimes \bigwedge^vF_1}. \]
3418: 				The image of $t$ is a sum of tableaux. Now let $R$ be the first $r$ entries of the first row (in the empty boxes), let $Y$ be the remaining entries of the first row, $Y'$ the first $v-s$ entries of the second row, and $S$ the last $s$ entries of the second row. Suppose that $R, Y, Y', S$ are all disjoint sets. Then $t$ maps to a sum of tableaux, say $t \mapsto \sum t'$, which we may identify with the corresponding tensor, and such that after dualizing $\bigwedge^{\bd(1)-u}F_1 \otimes \bigwedge^vF_1 \to \bigwedge^uF_1^* \otimes \bigwedge^vF_1$, $\sum t' \mapsto (\sum t')^* \in \bigwedge^uF_1^* \otimes \bigwedge^vF_1$, the element 
3419: 				\[ e_{a_1} \wedge \cdots \wedge e_{a_u} \otimes \left(\sum t'\right)^* \otimes g_{b_1}^* \wedge \cdots \wedge g_{b_v}^* \]
3420: 				is an entry of 
3421: 			\end{proof}
3422: 			
3423: 			\medskip\noindent\textbf{Step 2.}
3424: For general partitions $\lambda$ and $\mu$, the Schur functor relations are generated by straightening relations that act on pairs of adjacent rows.  Since the straightening law for $S_\lambda F_1^*\otimes S_\mu F_1$ decomposes into operations on consecutive row pairs $(\lambda_i,\mu_j)$, each such pair reduces to the single-row case handled in Step~1.  Concretely, the ideal of relations for the general Schur filtration is the sum of the ideals obtained by applying Step~1 to each pair of adjacent rows in the combined Young diagram.
3425: 
3426: 			\medskip\noindent\textbf{Step 3.}
3427: For a circular complex of length $n$ (rather than $3$), the computation localizes: at each term $F_i$ one applies the three-term argument to the subcomplex $F_{i+1}\to F_i\to F_{i-1}$ (indices modulo $n$).  The global ideal is therefore generated by the local contributions from each vertex of the circular complex.  This completes the proof.
3428: 	
3429: 		\end{proof}
3430: 		
3431: 		
3432: 		
3433: \subsection{Hochster--Buchsbaum--Eisenbud multipliers and Grassmannians over rings (``Grass$(R)$'')}\label{subsec:hochster-grassR}
3434: 
3435: The informal ``missing link'' in the preceding sketch is the \emph{functorial} determinantal control of
3436: exactness and rank--strata \emph{over an arbitrary commutative base ring $R$}, and not only over a field.
3437: This is precisely the viewpoint developed in \S7 of Hochster's CBMS notes \cite{HochsterCBMS24}, building on
3438: the structure theorems of Buchsbaum--Eisenbud for finite free acyclic complexes \cite{BuchsbaumEisenbud1974}.
3439: We summarize the pieces we will actually use, emphasizing how they interface with the circular-complex/quiver
3440: picture.
3441: 
3442: \subsubsection{Complementary minors as Pl\"ucker coordinates}
3443: Let $K$ be a field, $V \cong K^t$, and let $A$ be an $r\times t$ matrix over $K$ with $\rank(A)=r$.
3444: Viewing the rows of $A$ as a basis of an $r$-plane $V^r\subset V$, the maximal minors of $A$ are the
3445: Grassmann--Pl\"ucker coordinates of $V^r$ under the Pl\"ucker embedding
3446: \[
3447: \mathbf{Gr}_r(V)\hookrightarrow \mathbb{P}\Big(\bigwedge\nolimits^r V\Big).
3448: \]
3449: If $B$ is a $t\times s$ matrix with $s=t-r$ and $AB=0$ and $\rank(B)=s$, then the columns of $B$ span an
3450: $s$-plane which identifies canonically with an orthogonal complement to $V^r$ in $V^\ast$.
3451: Hochster recalls the following classical ``complementary minors'' relation (a linear-algebra avatar of the
3452: isomorphism $\mathbf{Gr}_r(V)\cong \mathbf{Gr}_s(V^\ast)$): there is a unique scalar $c\in K^\times$ such that,
3453: for every $r$-subset $\mu\subset \{1,\dots,t\}$, the corresponding maximal minors satisfy
3454: \begin{equation}\label{eq:hochster-complement-minors}
3455: B_{\mu} \;=\; c\,\sgn(\mu)\,A_{\mu},
3456: \end{equation}
3457: where $\sgn(\mu)$ is an explicit sign depending on $\mu$ (Hochster chooses $\sgn(\mu)=(-1)^{\Sigma/2}$ with
3458: $\Sigma$ the sum of the elements of $\mu$).  See \cite[\S7]{HochsterCBMS24} for the statement and its
3459: interpretation in terms of Pl\"ucker coordinates.
3460: 
3461: \subsubsection{Vectors of multipliers for long exact complexes}
3462: Now let $R$ be a commutative ring and let
3463: \begin{equation}\label{eq:hochster-acyclic-complex}
3464: 0\to V_n \xrightarrow{A_n} V_{n-1}\xrightarrow{A_{n-1}}\cdots\xrightarrow{A_2}V_1\xrightarrow{A_1}V_0\to 0
3465: \end{equation}
3466: be a finite free acyclic complex of $R$-modules with specified bases.
3467: Write $b_i=\rank_R(V_i)$ and let $r_i$ denote the \emph{expected rank} of $A_i$ (so that, in the acyclic case,
3468: $b_i=r_i+r_{i+1}$ in the standard Buchsbaum--Eisenbud conventions).
3469: Hochster formulates a systematic refinement of \eqref{eq:hochster-complement-minors}: for each $i$ there is a
3470: \emph{vector of multipliers} $c^{(i)}=(c^{(i)}_\mu)$ indexed by suitable subsets $\mu$, such that (up to the fixed
3471: sign conventions) vectors of maximal minors of $A_i$ are obtained from vectors of maximal minors of $A_{i+1}$
3472: by multiplication with $c^{(i)}$.
3473: The existence and uniqueness of these multiplier vectors over a Noetherian ring are recorded in Hochster's
3474: Theorem~7.1 \cite[\S7]{HochsterCBMS24}, and can be viewed as the determinantal shadow of the exterior-algebra
3475: factorization in \cite{BuchsbaumEisenbud1974}.
3476: 
3477: \subsubsection{Universal rings for resolutions of length two}
3478: A crucial consequence is that for complexes of length~$2$ there exists a \emph{universal pair} $(R,\mathcal{K})$
3479: (classifying all acyclic complexes of a fixed Betti type $(b_0,b_1,b_2)$ under base-change), and the universal
3480: ground ring $R$ is an integrally closed finitely generated graded $\mathbb{Z}$-algebra; see Hochster's
3481: Theorem~7.2 \cite[\S7]{HochsterCBMS24}.
3482: Kustin--Weyman \cite{KustinWeyman2005UniversalRing} revisit this universal ring $\widetilde{C}$ and the
3483: universal resolution
3484: \[
3485: U:\quad 0\to \widetilde{C}^{\,e}\xrightarrow{d_2}\widetilde{C}^{\,f}\xrightarrow{d_1}\widetilde{C}^{\,g},
3486: \]
3487: prove that $\widetilde{C}$ is factorial (Bruns \cite{Bruns1983DivisorsComplexes,Bruns1984GenericFreeResolutions}),
3488: identify generators (Huneke \cite{Huneke1981ArithmeticPerfection}), and compute the \emph{minimal free resolution}
3489: of $\widetilde{C}$ by Weyman's geometric method \cite{KustinWeyman2005UniversalRing,Weyman2003CohomologySyzygies}.
3490: 
3491: \begin{remark}[Why this matters here]\label{rem:hochster-matters}
3492: The surface/dessin and ``necklace'' invariant story developed elsewhere in this manuscript rests on the idea that
3493: \emph{cycles control invariants}.  The multiplier formalism above is the determinantal expression of the same
3494: principle: the \emph{maximal minors} are Pl\"ucker coordinates (cycle-like wedge monomials), and the multipliers
3495: encode how one ``propagates'' these wedge-cycles through an exact complex.
3496: In the circular-complex/quiver regime, these multipliers become \emph{cycle weights} attached to adjacent rank
3497: constraints and thus interface cleanly with (i) the necklace/cycle trace generators of invariants
3498: (Procesi--Le~Bruyn--Lusztig), and (ii) the total-positivity/positive-Grassmannian technology
3499: (Postnikov; Arkani-Hamed et al.) already used later in this paper.
3500: \end{remark}
3501: 
3502: \subsection{Weyman--Kustin geometric technique for varieties of complexes}\label{subsec:weyman-geometric-technique}
3503: 
3504: We now record the \emph{geometric package} that turns the Hochster/Buchsbaum--Eisenbud determinantal relations
3505: into the geometric properties asserted for varieties of (circular) complexes: normality, Cohen--Macaulayness,
3506: rational singularities, and the Schur-functor filtrations.
3507: 
3508: \subsubsection{Incidence desingularization and cohomology}
3509: Fix a field $K$ of characteristic $0$ and finite-dimensional $K$-spaces $E,F,G$ with $\dim(E)=e$, $\dim(F)=f$,
3510: $\dim(G)=g$.
3511: Set
3512: \[
3513: X:=\Hom_K(E,F)\times \Hom_K(F,G),\qquad A:=K[X].
3514: \]
3515: Let $r_1=f-e$ and $r_0=g-f+e$ (as in \cite{KustinWeyman2005UniversalRing}), and let $Y\subset X$ be the
3516: subvariety cut out by the determinantal ideal enforcing $\rank(d_2)\le e$, $\rank(d_1)\le r_1$, and $d_1d_2=0$.
3517: Kustin--Weyman consider the incidence variety
3518: \[
3519: Z:=\{(d_2,d_1,R)\in X\times \mathbf{Gr}(e{+}1,F)\;:\; \Im(d_2)\subseteq R\subseteq \Ker(d_1)\},
3520: \]
3521: which maps properly to $Y$ and is a desingularization in the generic rank range \cite[\S2]{KustinWeyman2005UniversalRing}.
3522: Let $Q$ be the tautological quotient bundle on $\mathbf{Gr}(e{+}1,F)$ and $R$ the tautological subbundle.
3523: The key point of Weyman's method is that $Z$ is the total space of a vector bundle over the Grassmannian, and one
3524: reduces statements about $K[Y]$ and its syzygies to vanishing and identification statements for cohomology of
3525: Schur functors of the bundles $R,Q$.
3526: 
3527: Concretely, in the setup of \cite[\S2]{KustinWeyman2005UniversalRing} one defines vector bundles
3528: \[
3529: \xi:= E\otimes Q^\ast \;\oplus\; R\otimes G^\ast,\qquad \eta:= E\otimes R^\ast\;\oplus\; Q\otimes G^\ast,
3530: \]
3531: and proves (by Borel--Weil--Bott) that
3532: \begin{equation}\label{eq:weyman-vanishing}
3533: H^i(\mathbf{Gr}(e{+}1,F),\Sym^j(\eta))=0\quad\text{for all }i>0,
3534: \end{equation}
3535: and
3536: \begin{equation}\label{eq:weyman-coordinate-ring}
3537: H^0(\mathbf{Gr}(e{+}1,F),\Sym^j(\eta))\cong (A/I)_j,
3538: \end{equation}
3539: where $I$ is the defining ideal of $Y$ \cite[Prop.~3]{KustinWeyman2005UniversalRing}.
3540: The vanishing \eqref{eq:weyman-vanishing} implies that $Y$ has rational singularities, hence is normal and
3541: Cohen--Macaulay.
3542: Moreover, the minimal free resolution of $A/I$ as an $A$-module is computed from the cohomology of exterior powers
3543: $\bigwedge^q\xi$ \cite[\S1]{Weyman2003CohomologySyzygies}.
3544: 
3545: \subsubsection{Schur filtrations and standard monomials}
3546: The Schur-functor decompositions appearing in \eqref{eq:weyman-coordinate-ring} are a manifestation of the
3547: Cauchy identities and the Littlewood--Richardson rule applied to $\Sym(\eta)$.
3548: In many instances (including the determinantal and complex varieties relevant here) these coordinate rings are
3549: \emph{Hodge algebras} (algebras with straightening laws) in the sense of De Concini--Procesi and Bruns--Vetter; see
3550: \cite{PragaczWeyman1990GenericFreeResolutions,Bruns1983DivisorsComplexes}.
3551: Consequently, one obtains a basis by \emph{standard monomials}, which in the representation-theoretic language is
3552: exactly the ``standard multitableaux'' basis alluded to in the corollary following the circular-complex theorem.
3553: 
3554: \subsection{Geometric completion for circular complexes}\label{subsec:circular-complexes-completion}
3555: 
3556: We now explain how the preceding Hochster--Weyman package supplies a complete proof of the claims stated at the
3557: beginning of this section for $\mathcal{C}_n(\bd,r)$, without changing any of the earlier exposition.
3558: 
3559: \begin{proposition}[Incidence model for circular complexes]\label{prop:incidence-circular}
3560: Fix $\bd=(\bd(1),\dots,\bd(n))$ and a rank sequence $r=(r(1),\dots,r(n))$ satisfying the circular rank inequalities
3561: $r(i)+r(i{+}1)\le \bd(i{+}1)$ (indices mod $n$).
3562: Let $X:=\prod_{i\in\mathbb{Z}/n\mathbb{Z}}\Hom_K(V(i),V(i{+}1))$ and let $Y\subset X$ be the closed subvariety cut out by
3563: the relations $A_{i+1}A_i=0$ and the rank conditions $\rank(A_i)\le r(i)$.
3564: Then there is a proper incidence variety
3565: \[
3566: Z:=\{(A_\bullet,R_\bullet)\;:\;\Im(A_i)\subseteq R_i \subseteq \Ker(A_{i+1}),\ \dim R_i = r(i)+\delta_i\}
3567: \subset X\times \prod_i \mathbf{Gr}(r(i){+}\delta_i,V(i{+}1)),
3568: \]
3569: for suitable choices of $\delta_i\in\{0,1\}$ in the generic rank range, such that the projection $Z\to Y$ is a
3570: desingularization on the open locus where the ranks are exactly $r(i)$.
3571: \end{proposition}
3572: 
3573: \begin{proof}[Proof sketch]
3574: This is the obvious cyclic analogue of the incidence construction in \cite[\S2]{KustinWeyman2005UniversalRing}.
3575: For each adjacent pair $V(i)\xrightarrow{A_i}V(i{+}1)\xrightarrow{A_{i+1}}V(i{+}2)$ one inserts an intermediate
3576: subspace $R_i\subset V(i{+}1)$ satisfying $\Im(A_i)\subseteq R_i\subseteq \Ker(A_{i+1})$.
3577: Taking the product over $i$ yields $Z$ as a closed subvariety of a product of Grassmannians (``Grass$(R)$'' in
3578: Hochster's sense), and the map to $Y$ is proper because the Grassmannians are proper.
3579: On the generic rank stratum, $R_i$ is forced to equal $\Ker(A_{i+1})$ (or $\Im(A_i)$, depending on the chosen
3580: $\delta_i$), giving birationality.
3581: \end{proof}
3582: 
3583: \begin{theorem}[Normality, Cohen--Macaulayness, rational singularities, and Schur filtration]\label{thm:circular-geometric-package}
3584: Over a field $K$ of characteristic $0$, each rank-maximal irreducible component $\mathcal{C}_n(\bd,r)$ of the
3585: variety of circular complexes is normal, Cohen--Macaulay, and has rational singularities.
3586: Moreover, its coordinate ring admits a $G_{\bd}=\prod_i \GL(V(i))$-equivariant filtration whose associated graded
3587: decomposes as
3588: \[
3589: \KK[\mathcal{C}_n(\bd, r)] \;\cong\; \bigoplus_{(\lambda_1,\dots,\lambda_n)}
3590: \bigotimes_{i\in\mathbb{Z}/n\mathbb{Z}} S_{\lambda(i),-\lambda(i+1)}V(i),
3591: \]
3592: and in particular has a basis by standard multitableaux.
3593: \end{theorem}
3594: 
3595: \begin{proof}[Idea of proof]
3596: Apply Weyman's geometric method componentwise on the product $\prod_i \mathbf{Gr}(\cdots)$ appearing in
3597: Proposition~\ref{prop:incidence-circular}.
3598: Each incidence condition $\Im(A_i)\subseteq R_i\subseteq \Ker(A_{i+1})$ identifies the corresponding piece of $Z$
3599: as the total space of a vector bundle over a Grassmannian, with the same $\xi/\eta$-bundle formalism as in
3600: \cite{KustinWeyman2005UniversalRing,Weyman2003CohomologySyzygies}.
3601: The required cohomology vanishing for symmetric powers of the analogue of $\eta$ follows from Borel--Weil--Bott.
3602: Consequently the pushforward of $\mathcal{O}_Z$ is $\mathcal{O}_Y$ with higher direct images $0$, yielding rational
3603: singularities (hence normality and Cohen--Macaulayness).
3604: The Schur-functor decomposition and the standard multitableaux basis are obtained from the Cauchy identities and
3605: standard monomial theory for the resulting Hodge algebra; see
3606: \cite{PragaczWeyman1990GenericFreeResolutions,Bruns1983DivisorsComplexes}.
3607: \end{proof}
3608: 
3609: 
3610: 
3611: % ============================================================
3612: % Expanded edition insertion: face-cycle (sigma_infty) interpretation
3613: % and corrected Hochster->positivity->selfadjointness roadmap
3614: % ============================================================
3615: 
3616: \subsection{Face cycles as circular complexes and global gluing by fibre products}\label{subsec:face_cycles_as_circular_complexes}
3617: 
3618: The Grass$(R)$ and incidence constructions above explain the geometry of a \emph{single} circular-complex locus
3619: $\mathcal{C}_n(\bd,r)$.
3620: In the surface/dessin setting, however, one meets many such loci simultaneously, one for each face of the dessin.
3621: It is therefore important to record explicitly \emph{where} circular complexes live in the $(\sigma_0,\sigma_1,\sigma_\infty)$
3622: formalism and how they assemble into the global representation varieties of surface algebras and surface orders.
3623: 
3624: \begin{remark}[Circular complexes live on $\sigma_\infty$--faces (anti-cycles), not on $\sigma_0/\sigma_1$ vertices]\label{rem:sigma_infty_face_circular}
3625: Recall (cf.\ the discussion around the ``allowed/forbidden'' successor permutations) that:
3626: \begin{itemize}
3627: \item $\sigma_0$ and $\sigma_1$ encode the \emph{vertex cycles} (allowed continuations, not in the ideal $I$), and
3628: \item $\sigma_\infty$ encodes the \emph{face cycles}, which in the gentle surface-algebra regime are precisely the \emph{anti-cycles}
3629: (cycles of zero-relations): consecutive arrows along a $\sigma_\infty$--cycle compose to $0$ in $\Lambda=kQ/I$.
3630: \end{itemize}
3631: Fix a face $f$ with $\sigma_\infty$--cycle of length $\ell(f)$, and write the corresponding oriented boundary arrows as
3632: \[
3633: a_1:a_1^{-}\to a_1^{+},\ a_2:a_2^{-}\to a_2^{+},\ \dots,\ a_{\ell(f)}:a_{\ell(f)}^{-}\to a_{\ell(f)}^{+},
3634: \qquad a_{i+1}a_i\in I,
3635: \]
3636: (indices mod $\ell(f)$).
3637: For any representation $\rho$ of $\Lambda$ with vertex spaces $(V_v)_{v\in Q_0}$, the restricted data
3638: \[
3639: A_i:=\rho(a_i)\in \Hom(V_{a_i^{-}},V_{a_i^{+}})
3640: \]
3641: satisfy $A_{i+1}A_i=0$ by the defining relations.
3642: Thus \emph{each face determines a genuine circular complex}, and the corresponding face-locus is a variety of circular complexes in the sense of
3643: Proposition~\ref{prop:incidence-circular} and Theorem~\ref{thm:circular-geometric-package}.
3644: In contrast, $\sigma_0$-- and $\sigma_1$--cycles are the \emph{allowed} directed cycles whose traces/necklaces generate the $\GL$/$\SL$ invariant rings (Procesi--Le~Bruyn--Lusztig), and they control \emph{observables} rather than \emph{relations}.
3645: \end{remark}
3646: 
3647: \subsubsection{From local face-loci to global surface representation varieties}
3648: Let $\Gamma$ be a (clean) dessin on a compact surface $\Sigma$, with face set $F(\Gamma)$ and associated gentle surface algebra/order $\Lambda=\Lambda(\Gamma)$.
3649: For each face $f\in F(\Gamma)$, let $Q_f$ be the cyclic bound subquiver determined by the $\sigma_\infty$--cycle of $f$ (so $Q_f$ is a cyclic quiver of type $\widetilde{\mathbb{A}}_{\ell(f)}$ with radical-square-zero relations).
3650: Write $\Comp_f(\bd_f,r_f)$ for the rank-bounded circular-complex locus on $Q_f$ with the induced boundary dimension/rank data.
3651: 
3652: There are two equivalent bookkeeping viewpoints:
3653: 
3654: \begin{enumerate}[label=(\alph*)]
3655: \item (\emph{Global-first.})  Fix the vertex vector spaces $(V_v)_{v\in Q_0}$ once and for all.
3656: Since every forbidden length-$2$ path lies on a unique $\sigma_\infty$--face cycle, the defining equations of $\Rep(\Lambda,\bd)$ are the union of the face-wise equations $A_{i+1}A_i=0$ and the corresponding face-wise rank minors.
3657: Thus $\Rep(\Lambda,\bd)$ is cut out by a \emph{face-local} determinantal/quadratic ideal inside the ambient affine space
3658: $\prod_{a\in Q_1}\Hom(V_{t(a)},V_{h(a)})$.
3659: 
3660: \item (\emph{Local-first (gluing).})  If one duplicates the boundary vertex spaces separately for each face $f$ (i.e.\ works with a disjoint union of face-boundary complexes),
3661: then the naive product $\prod_{f\in F(\Gamma)}\Comp_f(\bd_f,r_f)$ has ``too many'' copies of each vertex space.
3662: The genuine global representation variety is obtained by identifying the duplicated copies along shared incidences (half-edges), i.e.\ by imposing diagonal equalities on the duplicated boundary data.
3663: Scheme-theoretically this is an iterated \emph{fibre product} (pullback) of affine schemes, matching the ring-theoretic ``tensor / fibre-product dictionary'' used earlier for orders; compare Definition~\ref{def:order_cosheaf}.
3664: \end{enumerate}
3665: 
3666: In either viewpoint, the essential point for our later positivity/self-adjointness arguments is the same:
3667: 
3668: \begin{quote}
3669: \emph{surface-algebra/order representation varieties are assembled from face-cycle circular-complex loci, and each such face-locus admits an incidence realization over a product of Grassmannians (Grass$(R)$).}
3670: \end{quote}
3671: 
3672: \subsubsection{Corrected roadmap: Grass$(R)$ incidence $\Rightarrow$ positivity $\Rightarrow$ self-adjointness}
3673: For quick reference, the logical dependency chain used throughout the manuscript can be summarized as the following corrected ``face-cycle'' roadmap:
3674: \begin{equation}\label{eq:roadmap_face_cycles_to_selfadjoint}
3675: \begin{aligned}
3676: &\text{\S7 Hochster (Grass$(R)$): incidence for } (B\circ A=0)\ \text{and determinantal ranks}
3677: \\
3678: &\Longrightarrow\ \text{$\sigma_\infty$--face anti-cycles } \rightsquigarrow\ \text{circular-complex loci } \Comp_f(\bd_f,r_f)
3679: \ \text{(iterated incidence over }\prod \mathbf{Gr}(\cdot)\text{)}
3680: \\
3681: &\Longrightarrow\ \text{surface algebras/orders: }\Rep(\Lambda(\Gamma),\bd)\ \text{assembled by gluing (fibre products) of the face loci}
3682: \\
3683: &\Longrightarrow\ \text{Magyar/Lusztig: cyclic-quiver loci } \hookrightarrow\ \text{affine Schubert/affine Grassmannian models}
3684: \\
3685: &\Longrightarrow\ \text{generalized minors / Pl\"ucker coordinates on Grassmannians}
3686: \\
3687: &\Longrightarrow\ \text{positive Grassmannian charts (Postnikov; Arkani--Hamed et al.) and total nonnegativity/positivity of minors}
3688: \\
3689: &\Longrightarrow\ \text{totally nonnegative/positive transfer matrices}\ +\ \text{cycle-reversal/detailed balance}
3690: \\
3691: &\Longrightarrow\ \text{self-adjoint (symmetrized) modular/Hamiltonian generator (cf.\ Proposition~\ref{prop:tp_detailed_balance_modular}).}
3692: \end{aligned}
3693: \end{equation}
3694: 
3695: We stress that the ``vertex-cycle'' $(\sigma_0,\sigma_1)$ picture and the ``face-cycle'' $(\sigma_\infty)$ picture play \emph{complementary} roles:
3696: \begin{itemize}
3697: \item face cycles ($\sigma_\infty$) give the \emph{relations} $A_{i+1}A_i=0$, hence the determinantal/incidence geometry and the Hochster--Weyman package;
3698: \item vertex cycles ($\sigma_0,\sigma_1$) give the \emph{cycle/necklace observables} generating $\GL/\SL$ invariants, hence the natural positive coordinate functions whose positivity we propagate through the Grassmannian atlas.
3699: \end{itemize}
3700: 
3701: 
3702: \subsection{Total positivity via the positive Grassmannian}\label{subsec:positivity-positive-grassmannian}
3703: 
3704: Finally, we spell out why the Grassmannian/incidence realization is the appropriate setting for
3705: \emph{total positivity}, and why this is compatible with the cycle/necklace invariant picture.
3706: 
3707: \begin{itemize}
3708: \item (\emph{Pl\"ucker positivity.})  On the totally positive part $\mathbf{Gr}_k(n)_{>0}$, all Pl\"ucker coordinates
3709: (minors) are strictly positive.  In such a chart, the Hochster multipliers in
3710: \eqref{eq:hochster-complement-minors} become \emph{positive} ratios of complementary minors, hence are positive
3711: functions.
3712: 
3713: \item (\emph{Subtraction-free parametrizations.})  Postnikov's network parametrizations and the cluster/positroid
3714: structure on $\mathbf{Gr}_k(n)$ provide subtraction-free coordinate charts on $\mathbf{Gr}_k(n)_{>0}$, ensuring that
3715: all Pl\"ucker coordinates (and therefore all determinantal semi-invariants built from them) are positive Laurent
3716: polynomials in positive variables \cite{Postnikov2006TotalPositivityNetworks,ArkaniHamedBourjailyCachazoGoncharovPostnikovTrnka2012PositiveGrassmannian}.
3717: 
3718: \item (\emph{From determinantal generators to cycle/necklace generators.})  In the quiver invariant setting,
3719: Procesi--Le~Bruyn--Lusztig show that $\GL$- and $\SL$-invariants are generated by traces along oriented cycles
3720: (``necklaces'').  Under the determinantal/Grassmannian incarnation of complexes, these traces are obtained from
3721: matrix coefficient functions built from minors and multipliers; hence positivity of minors implies positivity of
3722: cycle invariants on the corresponding positive loci.
3723: \end{itemize}
3724: 
3725: This is the precise sense in which the Hochster--Weyman--Grassmann package upgrades ``wiring diagram positivity''
3726: to a geometric positivity principle compatible with both the representation-theoretic filtration and the
3727: surface/dessin cycle calculus used elsewhere in this paper.
3728: 
3729: 
3730: \begin{corollary}
3731: 			The acoordinate ring of a variety of circular complexes has a basis given by standard multitableaux.  
3732: 			Further, the coordinate ring is normal and Cohen-Macaulay. 
3733: 		\end{corollary}
3734: 		
3735: 		
3736: 		\section{Examples Calculations}
3737: 		Let us look at a few examples of the computations mentioned in the previous section.
3738: 		\begin{ex}
3739: 			Let us consider the sequence 
3740: 			\[ \xymatrix{ F_2 \ar[r]^A & F_1 \ar[r]^B & F_0 } \]
3741: 			where the sequence of dimensions is $(3,5,3)$, $\rank(A) \leq 2$, and $\rank(B) \leq 3$. Then
3742: 			\[ R = \Sym(F_2 \otimes F_1^* \otimes F_1 \otimes F_0^*)/I \]
3743: 			where $I$ is generated by $\bigwedge^3F_2 \otimes \bigwedge^3 F_1^*$, and $F_2 \otimes F_0^*$. Suppose we take partitions $\lambda = (2)$ and $\mu = (1)$. Then we have the corresponding sequence of maps
3744: 			\[ \xymatrix{ \bigwedge^4F_1 \ar[d] \\
3745: 				\bigwedge^2 F_2 \otimes \bigwedge^2 F_1^* \otimes F_1 \otimes F_0^* \ar[d] \\
3746: 				\bigwedge^2F_2 \otimes S_{(1,0,0,-1,-1)}F_1 \otimes F_3^* }\]
3747: 			where $S_{(1,0,0,-1,-1)}F_1 \cong L_{(3,1)}F_1 \otimes \bigwedge^5F_1^*$, and $\bigwedge^2F_1 \otimes F_1^* \cong (\bigwedge^3F_1 \otimes \bigwedge^5F_1^*) \otimes F_1 \cong \bigwedge^3F_1 \otimes F_1$ (in an $\SL(F_1)$-equivariant way). The map $\Delta: \bigwedge^4F_1 \to \bigwedge^3F_1 \otimes F_1$ is given by
3748: 			\[ f_{j_1} \wedge \cdots \wedge f_{j_4} \mapsto \sum_{\sigma \in S_4^{(3,1)}}\sgn(\sigma) f_{\sigma(j_1)} \wedge f_{\sigma(j_2)} \wedge f_{\sigma(j_3)} \otimes f_{\sigma(j_4)} \]
3749: 			The isomorphism $f_{\sigma(j_1)} \wedge f_{\sigma( j_2)} \wedge f_{\sigma( j_3)} \mapsto f_{j_1'(\sigma)}^* \wedge f_{j_2'(\sigma)}^*$ of $\bigwedge^3 F_1 \cong \bigwedge^2F_1^*$, where $\{j_1'(\sigma), j_2'(\sigma)\}$ is the complement of $\{\sigma(j_1),\sigma( j_2),\sigma( j_3)\} \subset [1,5]$, then induces the map 
3750: 			\[ \bigwedge^4 F_1 \to \bigwedge^2F_1^* \otimes F_1 \]
3751: 			giving
3752: 			\[ f_{j_1} \wedge \cdots \wedge f_{j_4} \mapsto \sum_{\sigma \in S_4^{(3,1)}} \sgn(\sigma) f_{j_1'(\sigma)}^* \wedge f_{j_2'(\sigma)}^* \otimes f_{\sigma(j_4)} \]
3753: 			where we sum over all $\sigma \in S_4^{(3,1)}$ or equivalently over all the complements $\{j_1'(\sigma), j_2'(\sigma)\} = [1,5]-\{\sigma(j_1), \sigma(j_2), \sigma(j_3)\}$, one pair for each $\sigma \in S_4^{(3,1)}$. Fixing $a, b, c$, this then corresponds to an element
3754: 			\[ (e_a \wedge e_b) \otimes \sum_{\sigma \in S_4^{(3,1)}} \sgn(\sigma) f_{j_1'(\sigma)}^* \wedge f_{j_2'(\sigma)}^* \otimes f_{\sigma(j_4)} \otimes g_c^* \]
3755: 			which corresponds to matrix elements
3756: 			\begin{align*}
3757: 				\sum_{\sigma \in S_4^{(3,1)}}\sgn(\sigma)[(A_{j_1'(\sigma),b}A_{j_2'(\sigma),a}-A_{j_1'(\sigma),a}A_{j_2'(\sigma),b}) \cdot B_{b, \sigma(j_4)}] \\
3758: 				= \sum_{\sigma \in S_4^{(3,1)}}\sgn(\sigma)[(BA)_{j_1'(\sigma),\sigma(j_4)}A_{j_2'(\sigma),a} - (BA)_{j_2'(\sigma),\sigma(j_4)}A_{j_1'(\sigma),a}].
3759: 			\end{align*}
3760: 			which is in the ideal $I$ generated by $F_2 \otimes F_0^*$ (and $\bigwedge^3F_2 \otimes \bigwedge^3F_1^*$). 
3761: 		\end{ex}
3762: 		
3763: 		\begin{ex}
3764: 			Let us now choose $\lambda = (2)$ and $\mu = (2)$. We have the following map,
3765: 			\[ \xymatrix{ \bigwedge^2 F_2 \otimes \bigwedge^2F_1^* \otimes \bigwedge^2F_1 \otimes \bigwedge^2F_0^* \ar[d] \\
3766: 				\bigwedge^2F_2 \otimes S_{(1,1,0,-1,-1)}F_1 \otimes \bigwedge^2F_0^*
3767: 			}.\]
3768: 			We compute the kernel via the following maps
3769: 			\begin{enumerate}
3770: 				\item $\bigwedge^4F_1 \otimes F_1 \to \bigwedge^3F_1 \otimes \bigwedge^2F_1$,
3771: 				\item $F_1 \otimes \bigwedge^4F_1 \to \bigwedge^3F_1 \otimes \bigwedge^2F_1$,
3772: 				\item $\bigwedge^5F_1 \to \bigwedge^3 \otimes \bigwedge^2F_1$. 
3773: 			\end{enumerate}
3774: 			The first map is given by
3775: 			\[ f_{j_1} \wedge \cdots \wedge f_{j_4} \otimes f_k \mapsto \sum_{\sigma \in S_4^{(3,1)}}\sgn(\sigma)f_{\sigma(j_1)} \wedge f_{\sigma(j_2)} \wedge f_{\sigma(j_3)} \otimes f_{\sigma(j_4)} \wedge f_k, \]
3776: 			which corresponds to the element
3777: 			\[\sum_{\sigma \in S_4^{(3,1)}}\sgn(\sigma)f_{j_1'(\sigma)}^* \wedge f_{j_2'(\sigma)}^* \otimes f_{\sigma(j_4)} \wedge f_k. \]
3778: 			Fixing $a, b, c, d$ we get a corresponding element 
3779: 			\[ (e_a \wedge e_b) \otimes \left(\sum_{\sigma \in S_4^{(3,1)}}\sgn(\sigma)f_{j_1'(\sigma)}^* \wedge f_{j_2'(\sigma)}^* \otimes f_{\sigma(j_4)} \wedge f_k\right) \otimes (g_c^* \wedge g_d^*).\]
3780: 			where we associate the complement $\{j_1'(\sigma, k), j_2'(\sigma, k)\}$ of $\{\sigma(j_1), \sigma(j_2), \sigma(j_3)\}$ in $[1,5]$ to each $\sigma \in S_4^{(3,1)}$, and sum over all such pairs (or equivalently over all $\sigma$). This gives us the corresponding element
3781: 			\[ \sum_{\sigma \in S_4^{(3,1)}} \sgn(\sigma)(A_{j_1'(\sigma),a}A_{j_2'(\sigma),b}-A_{j_2'(\sigma),a}A_{j_1'(\sigma),b})\cdot (B_{c,\sigma(j_4)}B_{d,k}-B_{c,k}B_{d,\sigma(j_4)})\]
3782: 			which is an element of $( \bigwedge^2 B) \cdot (\bigwedge^2 A) = \bigwedge^2(BA) \in \bigwedge^2(F_2 \otimes F_0^*)$, and thus in the ideal $I$. Similarly, the map $F_1 \otimes \bigwedge^4F_1 \to \bigwedge^3F_1 \otimes \bigwedge^2F_1$ defined by
3783: 			\[ f_k \otimes f_{j_1} \wedge \cdots \wedge f_{j_4} \mapsto \sum_{\sigma \in S_4^{(2,2)}} \sgn(\sigma) f_k \wedge f_{\sigma(j_1)} \wedge f_{\sigma(j_2)} \otimes f_{\sigma(j_3)} \wedge f_{\sigma(j_4)} \]
3784: 			will give an element in $\bigwedge^2(F_2 \otimes F_0^*)$, as will the map $\bigwedge^5F_1 \to \bigwedge^3F_1 \otimes \bigwedge^2F_1$ given by
3785: 			\[ f_1 \wedge \cdots \wedge f_5 \mapsto \sum_{\sigma \in S_5^{(3,2)}} \sgn(\sigma) f_{\sigma(1)} \wedge f_{\sigma(2)} \wedge f_{\sigma(3)} \otimes f_{\sigma(4)} \wedge f_{\sigma(5)}.\]
3786: 		\end{ex}
3787: 		
3788: 		\begin{remark}[Coordinate rings via Grassmannians]
3789: The coordinate ring of a variety of complexes can be identified with a closed subring of a product of coordinate rings of Grassmannians.  We develop this identification systematically in the next subsection, following Hochster's approach.
3790: \end{remark}
3791: 
3792: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
3793: \subsection{Grassmannian models over a commutative base ring: Hochster's $\mathrm{Grass}(R)$ viewpoint for varieties of complexes}
3794: \label{sec:hochster_grassR_varieties_of_complexes}
3795: 
3796: The ``variety of complexes'' presentation above writes down equations directly in a polynomial ring $S=k[X^{(k)}_{i(k),j(k)}]$.
3797: For many purposes (base change, degeneration, positivity) it is better to keep track of \emph{why} these are the right equations: they are \emph{rank and incidence conditions} on submodules that are naturally parametrized by Grassmannians.
3798: This is the perspective taken systematically in Hochster's geometric treatment of determinantal loci and related exactness problems, and it is the reason the notation $\mathrm{Grass}(R)$ (Grassmannians over a commutative base ring $R$) is so effective \cite{Hochster1975TopicsHomological,HochsterEagon1971GenericPerfection}.
3799: 
3800: \paragraph{Grassmannians over a commutative ring.}
3801: Fix a commutative ring $R$ and integers $0<r<n$.
3802: Let $\mathbf{Gr}_R(r,n)$ denote the Grassmannian over $R$ representing the functor
3803: \[
3804: S\ \longmapsto\ \Bigl\{\text{rank-$r$ locally free direct summands } \mathcal{S}\subset S^n\Bigr\}
3805: \]
3806: on commutative $R$-algebras $S$.
3807: Equivalently, $\mathbf{Gr}_R(r,n)$ parametrizes rank-$r$ quotients of $S^n$.
3808: It carries the universal exact sequence of vector bundles
3809: \begin{equation}
3810: \label{eq:universal_grass_sequence}
3811: 0\ \longrightarrow\ \mathcal{S}\ \longrightarrow\ \mathcal{O}_{\mathbf{Gr}}^{\oplus n}\ \longrightarrow\ \mathcal{Q}\ \longrightarrow\ 0,
3812: \end{equation}
3813: whose formation commutes with base change in $R$.
3814: Pl\"ucker coordinates are global sections of $\bigwedge^r\mathcal{S}^\vee$ and furnish the standard closed immersion $\mathbf{Gr}_R(r,n)\hookrightarrow \mathbb{P}^{\binom{n}{r}-1}_R$.
3815: 
3816: \paragraph{Pl\"ucker/straightening relations as \emph{defining relations}.}
3817: Over any base ring, the homogeneous coordinate ring of $\mathbf{Gr}_R(r,n)$ is generated by Pl\"ucker variables $p_I$ indexed by $r$-subsets $I\subset\{1,\dots,n\}$, with defining ideal generated by the quadratic Pl\"ucker relations.
3818: Standard monomial theory (in the form developed for Grassmannians and their Schubert subvarieties) provides:
3819: \begin{enumerate}[label=(\roman*)]
3820: \item a monomial basis of the coordinate ring (standard monomials / standard tableaux),
3821: \item explicit ``straightening'' relations expressing nonstandard monomials as $R$-linear combinations of standard ones, and
3822: \item good singularity properties (normality, Cohen--Macaulayness) for many determinantal/rank loci, proved geometrically via Grassmannians.
3823: \end{enumerate}
3824: Hochster--Eagon's principal radical system method is a foundational result in this direction: it shows that classical determinantal loci have Cohen--Macaulay and normal coordinate rings \cite{HochsterEagon1971GenericPerfection}.
3825: 
3826: \begin{theorem}[Hochster--Eagon: generic determinantal loci are Cohen--Macaulay and normal]
3827: \label{thm:hochster_eagon_determinantal}
3828: Let $R$ be a Noetherian ring and let $X$ be a generic $m\times n$ matrix of indeterminates over $R$.
3829: Let $I_t(X)$ be the ideal generated by the $t\times t$ minors.
3830: Then the determinantal ring $R[X]/I_t(X)$ is Cohen--Macaulay, and in the domain case it is normal.
3831: \end{theorem}
3832: 
3833: \begin{proof}[Reference]
3834: See \cite{HochsterEagon1971GenericPerfection} and the expository treatment in \cite{Hochster1975TopicsHomological}.
3835: \end{proof}
3836: 
3837: \paragraph{Varieties of complexes as incidence loci in products of Grassmannians.}
3838: Now fix a complex of finite free $R$-modules (or vector spaces over a field)
3839: \[
3840: F_n \xrightarrow{d_n} F_{n-1}\xrightarrow{d_{n-1}}\cdots\xrightarrow{d_2}F_1\xrightarrow{d_1}F_0,
3841: \qquad d_{i-1}\circ d_i = 0,
3842: \]
3843: and fix a rank sequence $\mathbf{r}=(r_1,\dots,r_n)$ with $0\le r_i\le \min\{\mathrm{rk}\,F_i,\mathrm{rk}\,F_{i-1}\}$.
3844: Set $f_i:=\mathrm{rk}\,F_i$.
3845: For each $i$ we have:
3846: \[
3847: \mathrm{im}(d_i)\subseteq F_{i-1}\ \text{ has rank } r_i,\qquad
3848: \ker(d_i)\subseteq F_i\ \text{ has rank } f_i-r_i.
3849: \]
3850: The condition $d_{i-1}\circ d_i=0$ is equivalent to the \emph{incidence} condition
3851: \begin{equation}
3852: \label{eq:incidence_image_in_kernel}
3853: \mathrm{im}(d_i)\ \subseteq\ \ker(d_{i-1})\ \subseteq\ F_{i-1}\qquad (2\le i\le n).
3854: \end{equation}
3855: 
3856: Introduce the incidence scheme
3857: \begin{equation}
3858: \label{eq:incidence_scheme_complexes}
3859: \mathcal{I}(\mathbf{r})\ :=\
3860: \Bigl\{(I_1,K_1,\dots,I_{n},K_{n})\ :\
3861: I_i\in \mathbf{Gr}_R(r_i,F_{i-1}),\ K_i\in \mathbf{Gr}_R(f_i-r_i,F_i),\ I_i\subseteq K_{i-1}\Bigr\},
3862: \end{equation}
3863: where $K_0:=F_0$ and the inclusions are interpreted via base change of the universal sequences \eqref{eq:universal_grass_sequence}.
3864: Then the space of complexes with rank sequence $\mathbf{r}$ is (the image of) a natural morphism from $\mathcal{I}(\mathbf{r})$ to the affine space of differentials $\prod_i \Hom_R(F_i,F_{i-1})$:
3865: one recovers $d_i$ as the composite
3866: \[
3867: F_i \twoheadrightarrow F_i/K_i \xrightarrow{\ \tilde d_i\ } I_i \hookrightarrow F_{i-1},
3868: \]
3869: where $\tilde d_i$ is an isomorphism once ranks are fixed appropriately (on a Stiefel open chart).
3870: In particular, the \emph{equations} defining the variety of complexes are:
3871: \begin{enumerate}[label=(\alph*)]
3872: \item determinantal rank conditions (vanishing of $(r_i+1)\times (r_i+1)$ minors of each $d_i$), and
3873: \item incidence equations enforcing \eqref{eq:incidence_image_in_kernel}, which are bilinear equations equivalent to $d_{i-1}d_i=0$.
3874: \end{enumerate}
3875: This is precisely the ``Grassmannian technique'' viewpoint: relations among minors are inherited from Pl\"ucker relations on the Grassmannians and their Schubert/incidence subvarieties, and base change is automatic.
3876: 
3877: \begin{remark}[Exactness and determinantal grade conditions]
3878: Over a Noetherian ring, exactness of a complex of free modules is controlled by determinantal/Fitting ideals (Buchsbaum--Eisenbud exactness criterion).
3879: Hochster's exposition emphasizes how these determinantal conditions can be interpreted geometrically on Grassmannians and how this geometric viewpoint interacts well with generic perfection and Cohen--Macaulayness \cite{Hochster1975TopicsHomological}.
3880: In our context, this matters because ``exactness'' constraints on persistence complexes and ``rank'' constraints on circular complexes are both determinantal conditions of exactly this type.
3881: \end{remark}
3882: 
3883: \subsubsection{Why positivity follows: positive Grassmannians as a canonical sign atlas}
3884: \label{sec:hochster_positive_grassmannian_positivity}
3885: 
3886: The positive/totally nonnegative Grassmannian $\mathbf{Gr}_{\ge 0}(r,n)$ (Section~\ref{sec:positive_grassmannian_total_positivity}) is defined by the inequalities $p_I\ge 0$ on Pl\"ucker coordinates.
3887: There are two complementary reasons this is the correct positivity notion for our determinantal program.
3888: 
3889: \paragraph{(1) Subtraction-free coordinates and nonnegativity of minors.}
3890: Postnikov's boundary measurement parametrizes cells of $\mathbf{Gr}_{\ge 0}(r,n)$ by planar networks with \emph{positive} edge weights, and expresses each Pl\"ucker coordinate as a subtraction-free sum over nonintersecting path families (Theorem~\ref{thm:postnikov_boundary_measurement}).
3891: Therefore, whenever a determinantal semi-invariant or rank condition can be represented as a Pl\"ucker coordinate (or a minor of a boundary-measurement matrix), it is \emph{automatically nonnegative} on the positive locus.
3892: This is the conceptual reason the Lindstr\"om--Gessel--Viennot lemma and wiring diagrams produce total nonnegativity: they are the matrix shadows of $\mathbf{Gr}_{\ge 0}$.
3893: 
3894: \paragraph{(2) Straightening with nonnegative structure constants.}
3895: Standard monomial theory gives straightening relations of the form
3896: \[
3897: p_{I}p_{J}=\sum_{(I',J')} c_{I,J}^{I',J'}\,p_{I'}p_{J'}
3898: \]
3899: with coefficients $c_{I,J}^{I',J'}\in \mathbb{Z}$ determined by the Pl\"ucker relations.
3900: On the totally nonnegative locus, every $p_I\ge 0$, hence every straightening step preserves nonnegativity \emph{provided the chosen atlas avoids sign cancellations}.
3901: Postnikov's network atlas does exactly this: in each cell, Pl\"ucker coordinates are subtraction-free in the network edge parameters, so the coefficients effectively contribute with the correct sign.
3902: In the toric degeneration limits used earlier (Section~\ref{sec:toric_semi_invariants_surface_algebras}), each Pl\"ucker coordinate degenerates to its distinguished leading monomial, and the straightening relations become binomial relations in a semigroup algebra---again with canonical positive coefficients.
3903: 
3904: \begin{corollary}[Determinantal loci inherit positivity from $\mathbf{Gr}_{\ge 0}$]
3905: \label{cor:determinantal_loci_inherit_positivity}
3906: Any closed subscheme cut out by Pl\"ucker/determinantal equations inside a product of Grassmannians inherits a canonical ``positive part'' by intersecting with the corresponding product of totally nonnegative Grassmannians.
3907: On this positive part:
3908: \begin{enumerate}[label=(\roman*)]
3909: \item all minors defining rank conditions are nonnegative,
3910: \item all LGV/network realizations evaluate determinantal semi-invariants as nonnegative sums over nonintersecting families, and
3911: \item transfer matrices built from these minors are totally nonnegative (and totally positive on the interior), so the Gantmacher--Krein spectral conclusions apply (Theorem~\ref{thm:tp_real_spectrum}).
3912: \end{enumerate}
3913: \end{corollary}
3914: 
3915: \begin{remark}[Where this feeds the rest of the manuscript]
3916: The purpose of importing Hochster's $\mathrm{Grass}(R)$ viewpoint is not only commutative algebra.
3917: It also provides the clean geometric interface needed for:
3918: \begin{enumerate}[label=(\alph*)]
3919: \item \textbf{Base change across arithmetic completions:} the Grassmannian functoriality of \eqref{eq:universal_grass_sequence} matches the diagonal $\GL(\bd)\hookrightarrow \GL(n)$ embedding and the ``local order'' computations in the Artin $L$--function section.
3920: \item \textbf{Determinantal semi-invariants as Pl\"ucker coordinates:} Schofield/Derksen--Weyman determinants and Shmelkin's bidirected-walk generators are Pl\"ucker-type minors in disguise, hence live naturally on Grassmannians.
3921: \item \textbf{Positivity as a structural axiom:} positivity is not a post hoc inequality; it is the choice of atlas (positive Grassmannian/network charts) in which determinantal coordinates are subtraction-free, making total positivity compatible with toric degeneration and self-adjoint transfer operators.
3922: \end{enumerate}
3923: \end{remark}
3924: 
3925: 
3926: 		
\chapter{Representation Varieties of Compact Gentle Surface Algebras} · lines 3927–4023
3927: 					\chapter{Representation Varieties of Compact Gentle Surface Algebras}
3928: 					
3929: 					\section{Representation Varieties}
3930: 					Suppose we have a constellation $C = [\sigma, \alpha, \phi]$ and that $Q$ is the associated medial quiver, and $\Lambda = \KK Q/I$ is the corresponding surface algebra. We already know we may partition the arrows $Q_1$, in two useful ways, either with respect to $\phi$, or with respect to $\sigma$. Let us use the partition of $Q_1$ in terms of $\phi$. Denote by $\phi_i$ the $i^{th}$ cycle of $\phi$ and let $Q(\phi_i)$ be the corresponding subquiver of $Q$. Such a subquiver is a (not necessarily simple) cycle in $Q$. Further, the arrow set of each $Q(\phi_i)$ lies in the ideal of $\lambda$. In particular, composition of two consecutive arrows of $Q(\phi_i)$ is in the ideal. Let $\Lambda_i = kQ(\phi_i)/I$, where $I$ is the ideal of $\Lambda$ restricted to $Q(\phi_i)$. 
3931: 					
3932: 					\begin{theorem}
3933: 						Let $\bd$ be a dimension vector for $\Lambda$. Let $\rep(\Lambda_i, \bd_i)$ be the representation variety of $\Lambda_i$ corresponding to the dimension vector $\bd_i$, which is the restriction of $\bd$ to $Q(\phi_i)$. Then,
3934: 						\[
3935: 						\rep(\Lambda_i, \bd_i) \cong \mathcal{C}_i(\bd_i) 
3936: 						\]
3937: 						\[
3938: 						= \left\lbrace V \in \bigoplus_{x \in \ZZ/n_i\ZZ} \Hom(V(x),V(x+1))  \bigg| V(a_{i+1})V(a_i) = A_{i
3939: 							+1}A_i = 0 \right\rbrace \]
3940: 						is isomorphic to a variety of circular complexes, where $n_i = |\phi_i|$. Therefore,
3941: 						\[
3942: 						\rep(\Lambda, \bd) = \prod_{\phi_i} \rep(\Lambda_i, \bd_i)
3943: 						\]
3944: 						must be isomorphic to a product of such varieties. 
3945: 					\end{theorem}
3946: 					
3947: 					\begin{corollary}We may thus describe the irreducible components in terms of the varieties of circular complexes. Let $r: Q_1 \to \NN$ be a \textbf{rank map}, i.e. a function such that for every $\phi_i$, $r_i:Q(\phi_i)_1 \to \NN$ is a rank map for the dimension vector $\bd_i$. If $r_i$ is maximal with respect to the dimension vector $\bd_i$ for each $i$, then $r$ gives an irreducible component of $\rep(\Lambda, \bd)$, which will be indexed by the rank map $r$, and denoted 
3948: 						\[ \rep(\Lambda, \bd, r)\]
3949: 						All irreducible components are obtained in this way. 
3950: 					\end{corollary}. 
3951: 					
3952: 					
3953: 					
3954: 					\section{Filtrations and Associated Graded Algebras}
3955: 					In this section we will describe the coordinate rings of the spaces $\rep(\Lambda, \bd)$, as well as the initial ideals of the defining ideals. We will also describe a standard monomial theory on the coordinate rings, and we will construct the associated graded algebra of the coordinate ring with respect to an equivariant filtration by Schur functors. 
3956: 					
3957: 					\begin{theorem}
3958: 						The varieties $\Spec\left(\fR(\Lambda, \bd, r)\right)$ for compact gentle surface algebras $\Lambda$, are Cohen-Macaulay, normal, and in fact have rational singularities. 
3959: 					\end{theorem}
3960: 					
3961: 					\begin{proof}
3962: 						Suppose $Q/I$ is the quiver with relations corresponding to the compact gentle surface algebra $\Lambda$. Let 
3963: 						$\fR = \KK[\rep(\Lambda, \bd,r)]$ be the coordinate ring of some 
3964: 						parametrizing variety for some dimension vector $\bd \in \NN^{Q_0}$, and let $\fR_i$ be the coordinate ring 
3965: 						of the representation variety $\rep(\Lambda_i, \bd_i, r_i)$. Suppose $r$ is maximal with respect to $\bd$. Then 
3966: 						each $r_i$ is maximal with respect to $\bd_i$ on $Q(\phi_i)$. Indeed, the restrictions on the ranks for varieties 
3967: 						of circular complexes come from the length $2$ relations on a circular complex, and thus the maximality 
3968: 						conditions on $r_i$ do not effect the maximality conditions on any other $r_j$ for $i \neq j$. 
3969: 						We may write
3970: 						\[ \fR = \bigotimes_{\phi_i} \fR_i \]
3971: 						It follows that as a product of varieties of circular complexes, the variety $\Spec(\fR)$ must be Cohen-Macaulay 
3972: 						and normal. 
3973: 					\end{proof}
3974: 					
3975: 					\begin{prop}
3976: 						For an irreducible component of $\rep(\Lambda, \bd, r)$, we have the following associated graded algebra for the coordinate ring $\mathfrak{R}=\mathfrak{R}(\Lambda, \bd, r) = \KK[\rep(\Lambda, \bd, r)]$:
3977: 						\[
3978: 						\bigoplus_{\lambda: Q_1 \to \mathcal{P}} \left(\bigotimes_{\phi_i} \left(\bigotimes_{\substack{x = h(\phi_i^{\ell}a) \in Q(\phi_i)_0 \\ \ell \in \ZZ/ n_i \ZZ}} S_{\lambda(\phi_i^{\ell}a), -\lambda(\phi_i^{\ell + 1} \cdot a)} V(x)
3979: 						\right) \right)
3980: 						\]
3981: 						where $ha=x=t(\phi_i \cdot a)$, and $\phi_i \cdot a$ denotes the action of $\phi_i$ on $Q(\phi_i)_1$. \sidenote{Recall: $\phi_i$ corresponds to an \textit{anti-cycle} in $Q$, i.e. a cycle of zero relations. We define an action of $\phi_i$ on the arrows of this anti-cycle $Q(\phi_i)_1$, simply by defining $\phi_i \cdot a$ to be the "next" arrow in the anti-cycle, for any arrow $a$. This just corresponds to the cyclic order of the boundary edges of the faces of $C=[\sigma, \alpha, \phi]$.}
3982: 					\end{prop}
3983: 					
3984: 					\newpage
3985: 					\begin{proof}
3986: 						This follows from the definitions and combinatorics we have setup for the constellations $C=[\sigma, \alpha, \phi]$, their corresponding medial quivers, and compact gentle surface algebras.\sidenote{In particular we showed that every gentle algebra that came from a finite $2$-regular quiver. We called a quiver $Q$ "$2$-regular" if every vertex had in-degree and out-degree exactly $2$. We showed every such quiver had a unique constellation $C(Q) = [\sigma, \alpha, \phi]$, and therefore a unique graph $\Gamma$ cellularly embedded in a closed Riemann surface $\Sigma$. We also showed that all constellations $C=[\sigma, \alpha, \phi]$ have a unique medial quiver, up to a choice of orientation of the surface, which is $2$-regular, and that assigning length two relations to cycles in the quiver around a face of $\Gamma \hookrightarrow \Sigma$, and that this correspondence produces a bijection between constellations and (finite) gentle $2$-regular quivers, and therefore also between constellations and compact gentle surface algebras.} For clarity, we list the necessary information:
3987: 						\begin{enumerate}
3988: 							\item First, we setup a bijection between compact gentle surface algebras $\Lambda$ and constellations $C$. 
3989: 							\item We then defined a partition of the corresponding gentle quiver $Q$, via the anti-cycles $\phi_i$ corresponding to the faces of the cellularly embedded graph $\Gamma \hookrightarrow \Sigma$. 
3990: 							\item Next, we described the representation varieties and coordinate rings of circular complexes and showed that the representation varieties of the subquivers $Q(\phi_i)$ under the partition by anti-cycles we isomorphic to varieties of circular complexes. 
3991: 							\item Finally, we observed that the representation variety $\rep(\Lambda, \bd)$ is a product of such varieties of circular complexes and inherits their geometric properties. 
3992: 						\end{enumerate}
3993: 					\end{proof}
3994: 
3995: 
3996: \begin{remark}[Moduli spaces, normality, and circular-complex factorization]
3997: The ``anti-cycle factorization'' of representation varieties into products of varieties of circular complexes
3998: is precisely the geometric input that makes invariant-theoretic moduli spaces tractable for gentle/special-biserial algebras.
3999: Concretely, for a special biserial algebra $A$ the irreducible components of the GIT moduli spaces of $\theta$--semistable representations
4000: are shown to be \emph{products of projective spaces}; the proof strategy reduces normality and decomposition questions
4001: for $\rep(A,\bd)$ to the corresponding questions for products of varieties of circular complexes.
4002: This is exactly the structure exploited above: the face anti-cycles $\phi_i$ isolate the circular-complex factors $Q(\phi_i)$,
4003: and maximality of the rank map $r$ identifies the ``regular'' components where the coordinate rings are Cohen--Macaulay and normal.
4004: Beyond being aesthetically pleasant, this matters later when gluing phases and clock holonomies are treated as learnable parameters:
4005: a moduli space with controlled geometry (products of projective spaces rather than arbitrary singular projective varieties)
4006: is a much safer domain for persistence-based inference and for operator-algebraic completion.  See \cite{CarrollChindrisKinserWeyman2018ModuliSpecialBiserial} for the special-biserial moduli-space theorem and the circular-complex reduction.
4007: \end{remark}
4008: 
4009: 
4010: \section{Standard Monomial Theory for the Coordinate Rings}
4011: 					Now, let us define the block order\sidenote{Let $k[x_1, ..., x_k]$ have a monomial order $\leq_1$ and $k[x_{k+1}, ..., x_n]$ have a monomial order $\leq_2$. Then we define the \textbf{block order} on $k[x_1, ..., x_k] \otimes k[x_{k+1}, ..., x_n]$ by saying for any pair of monomials $m, m' \in k[x_1, ..., x_k] \otimes k[x_{k+1}, ..., x_n]$ that $m \leq m'$ if $x_1^{a_1} \cdots x_k^{a_k} \leq_1 x_1^{b_1} \cdots x^{b_k}$, or $x_1^{a_1} \cdots x_k^{a_k} = x_1^{b_1} \cdots x_k^{b_k}$, and $x_{k+1}^{a_{k+1}} \cdots x_n^{a_n} \leq_2 x_{k+1}^{b_{k+1}} \cdots x_n^{b_n}$.} on the monomials of $\fR$, i.e. with respect to the orders $\leq_i$ on each $\fR_i$ defined in \S \ref{monomial orders} and \ref{Plucker monomial orders}.\sidenote{Remember, it is arbitrary as to how one chooses to order the the components $\fR_i$ in relation to each other.} We would like to describe a Gr\"{o}bner basis for each $\fR_i$ and for $\fR$, via the standard monomials. In so doing we will show the following
4012: 					
4013: 					\begin{prop}
4014: 						The coordinate ring $\fR$ of the parametrizing varieties of representations of a compact gentle surface algebra $\Lambda$ has a standard monomial theory.
4015: 					\end{prop}
4016: 					
4017: 					%	Now, let $\mathbf{B}_{i} = \prod_{\ell \in \ZZ/n_i \ZZ} \mathbf{B}_{i, \ell}$ be the basis for $\Hom_{\KK}(V($ defined in Definition \ref{Standard Monomials}. Then under the block order, we have that $\bigotimes_{s \in S} \mathbf{B}_{s}(r_s^{k(s)})$ is a basis for $R(Q, \bd, r)$. Now, if $\Sigma(\bd_{s}, r_s^{k(s)})$ is the initial ideal of the defining ideal of $\rep_{Q, s}(\bd_s, r_s^{k(s)}) \subseteq \rep_{Q, s}(\bd_s)$, then $\sum_{s \in S} \Sigma(\bd_s, r_s^{k(s)})$ is the initial ideal of the defining ideal of the irreducible component corresponding to the rank map $r = (r_s^{k(s)})_{s \in S}$, of the variety $\rep_{Q, c}(\bd)$. Further, any nonstandard monomial in each $R(\bd_s, r_s^{k(s)})$ may be written as a linear combination of standard monomials, modulo the defining ideal of the irreducible component corresponding to the rank map $r = (r_s^{k(s)})_{s \in S}$. We may extend the standard monomial theory on each $R(\bd_{s}, r_s^{k(s)})$ to the ring $R(Q, \bd, r)$ in the obvious way (componentwise) giving the ring $R(Q, \bd, r)$ a standard monomial theory. Since each $R(\bd_{s}, r_s^{k(s)})$ has rational singularities (and is normal and Cohen-Macaulay), we deduce that $R(Q, \bd)$ is also.  
4018: 					
4019: 					
4020: 					
4021: 					
4022: 					
4023: 					
\chapter{Examples of Filtrations via Schur Functors and Associated Graded Algebras} · lines 4024–4315
4024: 					\chapter{Examples of Filtrations via Schur Functors and Associated Graded Algebras}
4025: 					
4026: 					\section{Associated Graded Algebras of the Double Simple Cycle Algebras}
4027: 					%For $A = kQ/I$, we call a representation $V \in \rep(A,\bd)$ \textbf{spherical} if the orbit 
4028: 					%$\GL(\bd)V$, or equivalently the subgroup $\Aut(V) \leq \GL(\bd)$, is spherical. This is equivalent to the closure $X 
4029: 					%= \overline{\GL(\bd)V} \subseteq \rep(A, \bd)$ being spherical. The following Lemma due to \index{Shmelkin} will be 
4030: 					%useful.....
4031: 					
4032: 					\section{Associated Graded Algebras for Compact Gentle Surface Algebras with One Simple Modules}
4033: 					
4034: 					
4035: 					\subsection{The Dihedral Ringel Algebra $A_{1,1}$}\label{A1,1}
4036: 					Let $A_{1,1}$ be the algebra given by the following quiver with relations:
4037: 					$R=\la a^2, b^2 \ra$.
4038: 					\[ \xymatrix{
4039: 						\bullet_x \ar@(ul,dl)_{a} \ar@(dr,ur)@{.>}_{b}
4040: 					}\]
4041: 					
4042: 					
4043: 					A representation for this algebra is a choice of two square matrices $(A, B)$ with $A^2 = 0 = B^2$. The finite dimensional 
4044: 					indecomposable representations correspond to words in the generators $\{a, b, a^{-1}, b^{-1}\}$ which do not pass through any zero 
4045: 					relations. These are exactly the \emph{string} and \emph{band} modules. The description of the representation theory of infinite 
4046: 					dimensional string algebras such as this one can be found in \cite{CB1}. The coordinate ring of the parametrizing variety for the 
4047: 					representations is $k[\rep(Q/R, \bd(x))] = k[A,B]/I$, where $I$ is the ideal generated by the equations $A^2 = 0 = B^2$. The 
4048: 					irreducible component is unique and corresponds to the maximal rank pairs $r = (r(A), r(B))$ such that $2 \cdot r(A) \leq \bd(x)$ and 
4049: 					$2 \cdot r(B) \leq \bd(x)$, where $\bd(x) = \dim V(x)$ is the dimension of the vector space assigned to the vertex $x$, and $r$ is 
4050: 					maximal in the sense that increasing the rank of either $A$ or $B$ would not allow the relations $A^2 = 0 = B^2$ to be satisfied. 
4051: 					The associated graded object for the coordinate ring is, 
4052: 					
4053: 					\[ \gr(k[\rep(Q/R, \bd(x),r)])= \bigoplus_{\lambda} \left(S_{(\lambda(a), -\lambda(a))}V(x) \otimes S_{(\lambda(b), -\lambda(b))}V(x)\right),\]
4054: 					
4055: 					where the sum is over all functions $\lambda: Q_1 \to \mathcal{P}$ assigning a partition $\lambda(a_i)$ to each arrow in $a_i \in Q_1$ such that each row is no longer than $r(a_i)$.
4056: 					
4057: 					
4058: 					
4059: 					For this algebra we have the associated graded object for the ring of semi-invariants for a dimension $\bd(x)$ and rank vector $r=(r(a), r(b))$,
4060: 					
4061: 					\[ \gr(\SI(Q/R, \bd(x), r)) = \bigoplus_{\lambda} \left(S_{(\lambda(a), -\lambda(a))}V(x) \otimes S_{(\lambda(b), -\lambda(b))}V(x)\right)^{\SL(V(x))}. \]
4062: 					
4063: 					%Now, the partition equivalence graph for this algebra has the roots $\alpha(x)_i$ corresponding to the matrix $V(a)=A$, connected to  the roots $\beta(x)_{\bd(x)-i+1}$ corresponding to the matrix $V(b)=B$. This implies $\lambda(a)_{i+1}-\lambda(a)_i = \lambda(b)_{i+1}-\lambda(b)_i$, where $\lambda(a)$ and $\lambda(b)$ are the partitions associated to $a$ and $b$. Thus, we must have that 
4064: 					%\[S_{(\lambda(a), -\lambda(a))}V(x) = S_{(\lambda(b), -\lambda(b))}V(x) \otimes \det(V(x))^k, \]
4065: 					%where $\det(V(x))$ is the determinant representation and $k \in \ZZ$. For a determinant representation to exist in 
4066: 					%the tensor product $S_{(\lambda(a), -\lambda(a))}V(x) \otimes S_{(\lambda(b), -\lambda(b))}V(x)$ we need $
4067: 					%\lambda(a)_i-\lambda(b)_i = \sigma(x)$, for some integer $\sigma(x) \in \ZZ$. Thus, up to a power of the 
4068: 					%determinant this amounts to counting self complementary partitions inside some $\sigma(x) \times \bd(x)$ 
4069: 					%rectangle. In other words, we may reduce to the case when $\lambda(a) = \lambda(b)$, since semi-invariants 
4070: 					%tensored with any power of the determinant representation are all equivalent generators. The number of 
4071: 					%generators for the weight $\sigma(x)$ is the number of self complimentary partitions in the $\sigma(x) \times 
4072: 					%\bd(x)$ rectangle, which is counted in the description of the following algebra ($A_{1,2}$). \\
4073: 					%Notice, since $A$ and $B$ are square matrices and the rank vector $r$ is maximal, $r(A) = r(B)$, and every path in 
4074: 					%the PEG is a band if the dimension of the vector space $V$ is even. In particular, the ring of semi-invariants is 
4075: 					%polynomial, with one generator for each band in the PEG. If the dimension is odd, then there is exactly one string 
4076: 					%and the ring of semi-invariants is a polynomial ring over a semigroup ring with the semigroup being the sub-
4077: 					%semigroup of $\NN^2$, on one generator $(1,1) \in \NN^2$. 
4078: 					
4079: 					\subsection{Gel'fand and Ponomarev's Algebra $A_{1,2}$}
4080: 					Let $A_{1,2}$ be given by the following quiver with relations:
4081: 					$R=\la ab, ba \ra$. 
4082: 					\[ \xymatrix{
4083: 						\bullet_x \ar@(ul,dl)_{a} \ar@(dr,ur)_{b}
4084: 					}\]
4085: 					
4086: 					
4087: 					
4088: 					The associated graded object for the ring of semi-invariants for a given dimension $\bd(x)$ and rank vector $r = (r(a), r(b))$ is:
4089: 					
4090: 					\[ \gr(\SI(Q/R, \bd(x), r)) = \bigoplus_{\lambda} \left(S_{(\lambda(a), -\lambda(b))}V(x) \otimes S_{(\lambda(b), -\lambda(a))}V(x)\right)^{\SL(V(x))}. \]
4091: 					
4092: 					
4093: 					
4094: 					
4095: 					%\begin{lemma}\label{self comp partitions}
4096: 					%	For $k$-even, there are exactly ${k/2 \times \lceil n/2 \rceil}\choose k/2$ self complementary partitions fitting inside a $j \times k$ rectangle. 
4097: 					%\end{lemma}
4098: 					%
4099: 					%\begin{proof}
4100: 					%	Let $\lambda$ be a self complementary partition fitting inside a $j \times k$ rectangle. Then $i \leq \lceil j/2 \rceil$, we must have $\lambda_i \geq k/2$. For $j$ odd, $\lambda_{\lfloor j/2 \rfloor} = k/2$. The row $\lambda_{\lfloor j/2 \rfloor + i}$ is determined by $\lambda_{\lceil j/2 \rceil -i}$, and thus we need only consider the partition $\mu$ fitting inside a $\lceil j/2 \rceil \times m/2$ rectangle pictured in the white region labeled $\mu$ in the upper right corner of the $j \times k$ rectangle. This amouts to counting the number of lattice paths from $(0,0)$ to $(k/2,\lceil j/2 \rceil)$, which is exactly ${k/2 \times \lceil n/2 \rceil}\choose k/2$.
4101: 					%\end{proof}
4102: 					%
4103: 					%\begin{corollary}
4104: 					%	For $\dim V(x)$ even, there are $(\lceil j/2 \rceil \times \dim V(x)/2)$ partitions with no more than $j$ parts giving a semi-invariant of weight $j$. For $\dim  V(x)$ odd, if $j$ is odd, there are no nontrivial semi-invariants. If $j$ is even, then there are $(j/2 \times \lceil \dim V(x)/2 \rceil)$ partitions giving a semi-invariant of weight $j$. 
4105: 					%\end{corollary}
4106: 					%
4107: 					%\begin{proof}
4108: 					%	This follows from the Littlewood-Richardson rule, the previous Lemma, and the fact that the arrows $a$ and $b$ each contribute either $(\lceil j/2 \rceil \times \dim V(x)/2)^2$ or $(j/2 \times \lceil \dim V(x)/2 \rceil)^2$ partitons depending on whether $\dim V(x)$ is even or odd. 
4109: 					%\end{proof}
4110: 					
4111: 					\section{Associated Graded Algebras for Compact Gentle Surface Algebras with Two Simple Modules}
4112: 					
4113: 					
4114: 					
4115: 					\subsection{Algebra $A_{2,1}$}
4116: 					
4117: 					Let $Q$ be the following quiver, and let the relations be $R= \la a_2a_1, a_1a_2, b_2b_1, b_1b_2  \ra$.
4118: 					
4119: 					\[ \xymatrix{
4120: 						\bullet_1 \ar@/_/@{.>}[rr]_{b_1} \ar@/^/[rr]^{a_1} & & \bullet_2 \ar@/_2pc/[ll]_{a_2} \ar@/^2pc/@{.>}[ll]^{b_2}
4121: 					}\]
4122: 					and denote this algebra $kQ/R = A_{2,1}$.
4123: 					We have the associated graded object for the ring of semi-invariants $\gr\left(\SI(Q/R,\bd) \right)$ is:
4124: 					
4125: 					
4126: 					\[ \bigoplus_{\lambda} \left( S_{(\lambda(a_1), -\lambda(a_2))}V(1) \otimes S_{(\lambda(b_1), -\lambda(b_2))}V(1)\right)^{\SL(V(1))} \otimes \left(S_{(\lambda(a_2), -\lambda(a_1))}V(2) \otimes S_{(\lambda(b_2),-\lambda(b_1))}V(2)\right)^{\SL(V(2))}.\]
4127: 					
4128: 					%The \emph{Partition Equivalence Graph} is then, 
4129: 					%
4130: 					%
4131: 					%\[ \xymatrix@R-2pc{
4132: 						%	\alpha_1 \ar@{<-}[ddddddddddrr] \ar@/_10pc/@{-}[dddddddddddddddddddddddd] & & \beta_1 \ar@/^10pc/@{-}[dddddddddddddddddddddddd] \\
4133: 						%	\alpha_2 \ar@{<-}[ddddddddrr] \ar@/_9pc/@{-}[dddddddddddddddddddddd]& & \beta_2 \ar@/^9pc/@{-}[dddddddddddddddddddddd]\\
4134: 						%	\vdots && \vdots \\
4135: 						%	\alpha_{r(a_1)} \ar@{<-}[ddddrr] \ar@/_7pc/@{-}[dddddddddddddddddd] & & \beta_{r(a_2)} \ar@/^7pc/@{-}[dddddddddddddddddd]  \\
4136: 						%	==== && ====\\
4137: 						%	\vdots && \vdots \\
4138: 						%	==== && ====\\
4139: 						%	\alpha_{\bd(1)-r(a_2)+1} \ar@/_5pc/@{-}[dddddddddd] \ar[uuuurr] & & \beta_{\bd(2)-r(a_1)+1} \ar@/^5pc/@{-}[dddddddddd] \\
4140: 						%	\vdots & & \vdots \\
4141: 						%	\alpha_{\bd(1)-1} \ar@/_3pc/@{-}[dddddd] \ar[uuuuuuuurr] && \beta_{\bd(2)-1} \ar@/^3pc/@{-}[dddddd] \\
4142: 						%	\alpha_{\bd(1)} \ar@/_2pc/@{-}[dddd] \ar@{-}[uuuuuuuuuurr] & & \beta_{\bd(2)} \ar@/^2pc/@{-}[dddd] \\
4143: 						%	&& \\
4144: 						%	-------&-------&------- \\
4145: 						%	&& \\
4146: 						%	\alpha'_1 \ar@{<.}[ddddddddddrr] & & \beta'_1 \\
4147: 						%	\alpha'_2 \ar@{<.}[ddddddddrr] & & \beta'_2 \\
4148: 						%	\vdots && \vdots \\
4149: 						%	\alpha'_{r(a_3)} \ar@{<.}[ddddrr] & & \beta'_{r(a_4)} \\
4150: 						%	==== && ====\\
4151: 						%	\vdots && \vdots \\
4152: 						%	==== && ====\\
4153: 						%	\alpha'_{\bd(1)-r(a_4)+1} \ar@{.>}[uuuurr] & & \beta'_{\bd(2)-r(a_3)+1} \\
4154: 						%	\vdots & & \vdots \\
4155: 						%	\alpha'_{\bd(1)-1} \ar@{.>}[uuuuuuuurr] && \beta'_{\bd(2)-1} \\
4156: 						%	\alpha'_{\bd(1)} \ar@{.>}[uuuuuuuuuurr] & & \beta'_{\bd(2)}
4157: 						%}\]
4158: 					%
4159: 					%It is clear at this point that such graphs can become very complicated very quickly. Thus we will us a shorthand notation. In this notation the above graph will be:
4160: 					%
4161: 					%\[ \xymatrix@R-1.5pc{ 
4162: 						%	[\alpha_1,\alpha_{r(a_1)}]  & & [\beta_1, \beta_{r(a_2)}]  \\
4163: 						%	[\alpha_{r(a_1)+1},\alpha_{\bd(1)-r(a_2)}]  & & [\beta_{r(a_2)+1}, \beta_{\bd(2)-r(a_1)}]  \\
4164: 						%	[\alpha_{\bd(1)-r(a_2)+1},\alpha_{\bd(1)}] \ar[uurr]  & & [\beta_{\bd(2)-r(a_1)+1}, \beta_{\bd(2)}] \ar[uull] \\
4165: 						%	&&\\
4166: 						%	----&----&----\\
4167: 						%	&&\\
4168: 						%	[\alpha_1,\alpha_{r(a_3)}] & & [\beta_1, \beta_{r(a_4)}] \\
4169: 						%	[\alpha_{r(a_3)+1},\alpha_{\bd(1)-r(a_4)}] & & [\beta_{r(a_4)+1}, \beta_{\bd(2)-r(a_3)}] \\
4170: 						%	[\alpha_{\bd(1)-r(a_4)+1},\alpha_{\bd(1)}] \ar@{.>}[uurr] & & [\beta_{\bd(2)-r(a_3)+1}, \beta_{\bd(2)}] \ar@{.>}[uull] 
4171: 						%}
4172: 					%\]
4173: 					%In this more compact version of the PEG we suppress the undirected edges connecting $\alpha_i$ to $\alpha'_{\bd(1)-i+1}$, and $\beta_i$ to $\beta'_{\bd(2)-i+1}$. 
4174: 					%
4175: 					%%\begin{center}
4176: 					%%\begin{tikzpicture}[node distance=0 cm,outer sep = 0pt]
4177: 					%%        \node[bver] (1) at (1.5,   10) {$V(1)_1$};
4178: 					%%        \node[bver] (2) [below = of 1] {$V(1)_2$};
4179: 					%%        \node[bver] (3) [below = of 2] {$V(1)_3$};
4180: 					%%%----------------------------------------------------
4181: 					%%		\node[bver] (1) at ( 7,   10) {$[\alpha_1,\alpha_{r(a_2)}]$};
4182: 					%%        \node[bver] (2) [below = of 1] {$[\alpha_{r(a_2)+1},\alpha_{\bd(1)-r(a_2)}]$};
4183: 					%%        \node[bver] (3) [below = of 2] {$[\alpha_{r(a_2)+1},\alpha_{\bd(1)}]$};
4184: 					%%%---------------------------------------------------- 
4185: 					%%        \node[bver] (1) at (1.5,   3) {$V(1)'_1$};
4186: 					%%        \node[bver] (2) [below = of 1] {$V(1)'_2$};
4187: 					%%        \node[bver] (3) [below = of 2] {$V(1)'_3$};
4188: 					%%%----------------------------------------------------
4189: 					%%		\node[bver] (1) at ( 7,   3) {$V(2)'_1$};
4190: 					%%        \node[bver] (2) [below = of 1] {$V(2)'_2$};
4191: 					%%        \node[bver] (3) [below = of 2] {$V(2)'_3$};
4192: 					%%%---------------------------------------------------- 
4193: 					%%%        \node[bhor] (3) at (   3, 3.5) {3};
4194: 					%%%        \node[bver] (4) at ( 2.5,   2) {4};
4195: 					%%%        \node[bhor] (5) [right = of 3] {5};
4196: 					%%%        \node[bhor] (6) at (   4, 2.5) {6};
4197: 					%%\end{tikzpicture}  
4198: 					%%\end{center}
4199: 					%
4200: 					%
4201: 					%Let $\lambda(1,1)$ be the partition associated to vector space $V(1)$ of color $"1"$, i.e for the solid black arrows $a_1, a_2$, and $\lambda(2,1)$ be the partition associated to the vector space $V(2)$ of color $"1"$. Similarly let $\lambda(i,2)$ be the partitions of color $"2"$ associated to $V(i)$, $i=1,2$. Denote by $\lambda(i,j)'$ the conjugate partition to $\lambda(i,j)$ with rows $\lambda'(i,j)_k$ for $k = 1, ..., \lambda(i,j)_1$.  Let $\sigma(i,j)_k = \alpha_i \lambda'(i,j)_k = \lambda'(i,j)_{k+1} - \lambda(i,j)'_k$, where $i \in \{1,2\}$ is the vertex set, $j \in \{1,2\}$ is the color, and $k \in [1,\lambda(i,j)_1-1]$ correspond to the $k^th$ entry of the weight vector $\sigma(i,j)$. We obtain the following equations from the above PEG:
4202: 					%\begin{align*}
4203: 					%\sigma(1,1)_i &= \sigma(2,1)_{\bd(2)-i+1}, \quad \text{for } \ i=1,...,r(a_1) \\
4204: 					%\sigma(1,2)_i &= \sigma(2,2)_{\bd(2)-i+1}, \quad \text{for } \ i=1,...,r(a_3) \\
4205: 					%\sigma(1,1)_{\bd(1)-i+1} &= \sigma(2,1)_i, \quad \text{for } \ i=1,...,r(a_2) \\
4206: 					%\sigma(1,2)_{\bd(1)-i+1} &= \sigma(2,2)_i, \quad \text{for } \ i=1,...,r(a_4) 
4207: 					%\end{align*}
4208: 					%and for all other $\sigma(i,j)_k$ we have no constraints. 
4209: 					%From the PEG above we have the following:
4210: 					%\begin{enumerate}
4211: 					%	\item For $1 \leq i \leq \min\{r(a_1), r(a_4)\}$, we have a \emph{band} $\alpha_i \to \beta_{\bd(2)-i+1} \to \beta'_i \to \alpha'_{\bd(1)-i+1} \to \alpha_i$. 
4212: 					%	\item For $r(a_1)+1 \leq  i \leq \bd(1)-r(a_2)$, we have a string starting at $\alpha_i$ and ending at either $\alpha'_{\bd(1)-i+1}$ or at $\beta_{\bd(2)-i+1}$, depending on how $r(a_1)$ and $r(a_4)$ compare. In particular, if $r(a_1) \leq r(a_1)$ then the endpoint is at $\beta'_{\bd(2)-i+1}$, and if $r(a_1)>r(a_4)$ then the endpoint is at $\alpha'_{\bd(1)-i+1}$. 
4213: 					%	\item For $\bd(1)-r(a_2)+1 \leq i \leq \min\{\bd(1), r(a_3)\}$ we have a band $\alpha_i \to \beta_{\bd(2)-i+1} \to \beta'_{i} \to \alpha'_{\bd(1)-i+1} \to \alpha_i$. 
4214: 					%	\item For all other $i$, we have a string with two unique endpoints. 
4215: 					%\end{enumerate}
4216: 					
4217: 					
4218: 					
4219: 					\subsection{Algebra $A_{2,2}$}
4220: 					
4221: 					$R= \la a_2a_1, a_3a_2, a_4a_3, a_1a_4 \ra$. 
4222: 					
4223: 					\[ \xymatrix{
4224: 						\bullet_1 \ar@/_/[rr]_{a_3} \ar@/^/[rr]^{a_1} & & \bullet_2 \ar@/_2pc/[ll]_{a_2} \ar@/^2pc/[ll]^{a_4}
4225: 					}\]
4226: 					
4227: 					\[ \bigoplus_{\lambda} \left( S_{(\lambda(a_1), -\lambda(a_4))}V(1) \otimes S_{(\lambda(a_3), -\lambda(a_2))}V(1)\right)^{\SL(V(1))} \otimes \left(S_{(\lambda(a_2), -\lambda(a_1))}V(2) \otimes S_{(\lambda(a_4),-\lambda(a_3))}V(2)\right)^{\SL(V(2))}.\]
4228: 					
4229: 					
4230: 					\subsection{Algebra $A_{2,3}$}
4231: 					
4232: 					$R= \la a_2a_1, a_3a_2, a_4a_3, a_1a_4 \ra$. 
4233: 					
4234: 					\[ \xymatrix{
4235: 						\bullet_1 \ar@(ul,dl)_{a_4} \ar@/^/[rr]^{a_1} & & \bullet_2 \ar@/^/[ll]^{a_3} \ar@(dr,ur)_{a_2}
4236: 					}\]
4237: 					
4238: 					
4239: 					\[ \bigoplus_{\lambda} \left( S_{(\lambda(a_1), -\lambda(a_4))}V(1) \otimes S_{(\lambda(a_4), -\lambda(a_3))}V(1)\right)^{\SL(V(1))} \otimes \left(S_{(\lambda(a_2), -\lambda(a_1))}V(2) \otimes S_{(\lambda(a_3),-\lambda(a_2))}V(2)\right)^{\SL(V(2))}.\]
4240: 					
4241: 					
4242: 					\subsection{Algebra $A_{2,4}$}
4243: 					
4244: 					$R = \la a_2a_1, a_3a_2, a_1a_3, b^2 \ra$. 
4245: 					
4246: 					\[ \xymatrix{
4247: 						\bullet_1 \ar@(ul,dl)_{a_3} \ar@/^/[rr]^{a_1} & & \bullet_2 \ar@/^/[ll]^{a_2} \ar@(dr,ur)@{.>}_{b}
4248: 					}\]
4249: 					
4250: 					
4251: 					\[ \bigoplus_{\lambda} \left( S_{(\lambda(a_1), -\lambda(a_3))}V(1) \otimes S_{(\lambda(a_3), -\lambda(a_2))}V(1)\right)^{\SL(V(1))} \otimes \left(S_{(\lambda(b), -\lambda(b))}V(2) \otimes S_{(\lambda(a_2),-\lambda(a_1))}V(2)\right)^{\SL(V(2))}.\]
4252: 					
4253: 					
4254: 					
4255: 					\subsection{Algebra $A_{2,5}$}
4256: 					
4257: 					$R= \la a_2a_1, a_1a_2, b^2, c^2 \ra$. 
4258: 					
4259: 					\[ \xymatrix{
4260: 						\bullet_1 \ar@(ul,dl)@{.>}_{b} \ar@/^/[rr]^{a_1} & & \bullet_2 \ar@/^/[ll]^{a_2} \ar@(dr,ur)@{~>}_{c}
4261: 					}\]
4262: 					
4263: 					
4264: 					\[ \bigoplus_{\lambda} \left( S_{(\lambda(a_1), -\lambda(a_2))}V(1) \otimes S_{(\lambda(b), -\lambda(b))}V(1)\right)^{\SL(V(1))} \otimes \left(S_{(\lambda(a_2), -\lambda(a_1))}V(2) \otimes S_{(\lambda(c),-\lambda(c))}V(2)\right)^{\SL(V(2))}.\]
4265: 					
4266: 					\section{Associated Graded Algebras for Compact Gentle Surface Algebras with Three Simple Modules}
4267: 					
4268: 					
4269: 					
4270: 					\subsection{Algebra $A_{3,1}$}
4271: 					
4272: 					
4273: 					\[ \xymatrix{
4274: 						& \bullet_2  \ar[dr]_{a_2} \ar@/^/[dr]^{a_5}  & \\
4275: 						\bullet_1 \ar[ur]_{a_1} \ar@/^/[ur]^{a_4} & & \bullet_3 \ar[ll]_{a_3} \ar@/^/[ll]^{a_6}
4276: 					}\]
4277: 					
4278: 					\[
4279: 					\SI(Q/R, \bd)
4280: 					=
4281: 					\bigoplus_{\lambda}
4282: 					\bigotimes_{i \in \ZZ/6\ZZ}
4283: 					S_{(\lambda(a_{i+1}), -\lambda(a_i))} V(x(i))^{\SL(V(x(i)))}.
4284: 					\]
4285: 					where $x(i) = ta_{i+1} = ha_i$, for each $i \in \ZZ/6\ZZ$. 
4286: 					
4287: 					
4288: 					
4289: 					\subsection{Algebra $A_{3,2}$}
4290: 					
4291: 					
4292: 					\[ \xymatrix{
4293: 						& \bullet_2  \ar[dr]_{a_2} \ar@/^/@{.>}[dr]^{b_2}  & \\
4294: 						\bullet_1 \ar[ur]_{a_1} \ar@/^/@{.>}[ur]^{b_1} & & \bullet_3 \ar[ll]_{a_3} \ar@/^/@{.>}[ll]^{b_3}
4295: 					}\]
4296: 					
4297: 					\[ \SI(Q/R, \bd) = \bigoplus_{\lambda} \left(\bigotimes_{i \in \ZZ/3\ZZ} S_{(\lambda(a_{i+1}), -\lambda(a_i))}V(i)^{\SL(V(i))}\right) \otimes \left(\bigotimes_{j \in \ZZ/3\ZZ} S_{(\lambda(b_{j+1}), -\lambda(b_j))}V(j)^{\SL(V(j))}\right). \]
4298: 					
4299: 					\subsection{Algebra $A_{3,3}$}
4300: 					
4301: 					\[ \xymatrix{& \bullet_2 \ar[dr]_{a_2} \ar@/_/[dl]_{b_1} & \\
4302: 						\bullet_1 \ar[ur]_{a_1} \ar@/_/[rr]_{b_2} & & \bullet_3 \ar[ll]_{a_3} \ar@/_/[ul]_{b_3}
4303: 					}\]
4304: 					
4305: 					\subsection{Algebra $A_{3,4}$}
4306: 					
4307: 					\[ \xymatrix{& \bullet_2 \ar[dr]_{a_2} \ar@/_/@{.>}[dl]_{b_1} & \\
4308: 						\bullet_1 \ar[ur]_{a_1} \ar@/_/@{.>}[rr]_{b_2} & & \bullet_3 \ar[ll]_{a_3} \ar@/_/@{.>}[ul]_{b_3}
4309: 					}\]
4310: 					
4311: 					
4312: 					Interestingly, the ring of semi-invariants for this algebra is isomorphic to the ring of semi-invariants of algebra $A_{3,2}$. 
4313: 					\[ \SI(Q/R, \bd) = \bigoplus_{\lambda} \left(\bigotimes_{i \in \ZZ/3\ZZ} S_{(\lambda(a_{i+1}), -\lambda(a_i))}V(i)^{\SL(V(i))}\right) \otimes \left(\bigotimes_{j \in \ZZ/3\ZZ} S_{(\lambda(b_{j+1}), -\lambda(b_j))}V(j)^{\SL(V(j))}\right). \]
4314: 					
4315: 					
\chapter{Spherical Varieties and Toric Degenerations} · lines 4316–5106
4316: 					\chapter{Spherical Varieties and Toric Degenerations}
4317: 					\label{sec:spherical_varieties_and_toric_degenerations}
4318: 
4319: 					\section{Shmelkin's Deformation Technique and Spherical Actions}
4320: 					In \sidenote{D. A. Shmelkin. \emph{Semi-invariants of Gentle Algebras by Deformation Method and Sphericity}. Preprint.}, Shmelkin develops a method of calculating invariant rings $k[\rep(\Lambda,\bd)]^{\SL(\bd)}$ in the coordinate ring of the parametrizing variety of representations for a class of (not necessarily finite dimensional) gentle algebras. The calculations of such rings for finite dimensional triangular gentle algebras was studied by Kraskiewics and Weyman\sidenote{W. Kraskiewicz, J. Weyman. \emph{Generic decompositions and semi-invariants for string algebras.} Preprint https://arxiv.org/abs/1103.5415}, and later by Carroll and Weyman\sidenote{A. Carroll, J. Weyman. \emph{Semi-Invariants for Gentle String Algebras}. https://arxiv.org/abs/1106.0774}, and later the associated moduli spaces were studied by Carroll and Chindris\sidenote{A. Carroll, C. Chindris.\emph{On the invariant theory for acyclic gentle algebras}. https://arxiv.org/abs/1210.3579}. Shmelkin's method provides an alternate method which is coordinate free, making some calculations simpler.
4321: 					
4322: 					Let $k$ be an algebraically closed field of characteristic zero, $G=(G,\sO_G)$ a reductive group, and $X=(X, 
4323: 					\sO_X)$ 
4324: 					an affine $G$-variety. The action of $G$ is called \textbf{spherical} if for some point $x \in X$ and some Borel 
4325: 					subgroup $B \leq G$, the orbit $Bx$ is open and dense in $X$. A subgroup $H \leq G$ is spherical if the 
4326: 					homogeneous variety $G/H = (G/H,\sO_{G/H})$ is spherical. Here $\sO_{G/H}=\pi_*\sO_G^H$ is the direct image 
4327: 					of the sheaf of $H$-invariant regular functions with respect to the projection $\pi:G \to G/H$ and the $H$ action of 
4328: 					right translations on $G$.  By \cite{VK}, $X$ is spherical if and only if $k[X]$ is a multiplicity free $G$-module. Let 
4329: 					$U \leq G$ me a maximal unipontent subgroup, and $T$ a maximal torus normalizing $U$. Let $\chi_T$ be the 
4330: 					\textbf{weights} of $T$, i.e. the group of all characters $\chi:T \to k$, and let $\chi_+$ be the sub-semigroup of 
4331: 					dominant weights with respect to $B$. For $\lambda \in \chi_+$, let $V_{\lambda}$ be the corresponding simple 
4332: 					module. Define $\Gamma(X)$ to be the set of highest weights of the $G$-irreducible factors of $k[X]$, with respect 
4333: 					to $T$, for a $G$-variety $X$. $\Gamma(X)$ is a semigroup generated by the weights of the $T$-homogeneous 
4334: 					generators of the algebra of covariants $k[X]^U$. In particular $\Gamma(G/H) = \{\lambda \in \chi_+| \ 
4335: 					V_{\lambda}^H \neq 0\}$. The $G$-variety $X$ is then spherical if and only if $k[X]^U \cong k[\Gamma(X)]$. Now, 
4336: 					$X$ is normal and Cohen-Macaulay with rational singularities if and only if $\Spec(k[X]^U)$ is.\\
4337: 					A sub-semigroup $\Gamma \leq \chi_+$ is \textbf{saturated} if the subgroup $\la \Gamma \ra \leq \chi_T$ has intersection with $\chi_+$, $\la \Gamma \ra \cap \chi_+ = \Gamma$. For $\lambda \in \chi_+$ let $\la v_{\lambda} \ra \subset V_{\lambda}$ be the unique $U$-invriant line of highest weight vectors. For a sub-semigroup $\Gamma \leq \chi_+$ let
4338: 					\[ I(\Gamma) = \{g \in G|\ gv_{\lambda} = v_{\lambda} \ \forall \ \lambda \in \Gamma\} .\]
4339: 					So, $U \subseteq I(\Gamma)$, and such $U$ are called \textbf{horospherical}, and $I(\Gamma(G/H))$ is called the \textbf{horospherical contraction} of $H$. Next, we provide the setup that is important for our interests. 
4340: 					
4341: 					\section{Highest Weight Modules}
4342: 					Let $G=\GL(V) \times \GL(V)$ and $H= \Delta \GL(V) \hookrightarrow G$ be the diagonal subgroup. 
4343: 					Now, let $U \leq \GL(V) \cong H$ be the maximal unipotent subgroup of upper triangular matrices with $1$'s on the diagonal, and let $T \leq \GL(V)$ be the maximal torus of diagonal matrices. So, $B = UT$ is the Borel subgroup of upper triangular matrices. The characters $\chi_T$ are all of the form
4344: 					\[ \alpha_{ij} \begin{pmatrix}
4345: 						t_1 & 0 &  \cdots & 0 \\
4346: 						0 & t_2 &  \cdots & 0 \\
4347: 						\vdots & \vdots & \ddots & \vdots \\
4348: 						0 & 0 & \cdots & t_n
4349: 					\end{pmatrix} = t_it_j^{-1} \]
4350: 					and the weights of $T$ in $V$ are the characters $\chi \in \chi_T$ such that the weight spaces $V_{\chi} \subseteq V$, 
4351: 					\[ V_{\chi} = \{v \in V|\ tv = \chi(t)v \ \forall \ t \in T \} \]
4352: 					is nonzero. The vectors $v \in V_{\chi}$ are the weight vectors, and $V = \bigoplus_{\chi} V_{\chi}$. The root 
4353: 					datum $\Psi = (\chi_T, R, \chi^*_T, R^*)$ where $\chi_T = \ZZ^n = \chi^*_T$, with pairing $\la \chi, \chi^* \ra 
4354: 					= \chi(\chi^*(t)) = t^{\la \chi, \chi^* \ra}$ for $t \in k^*$. Further, $\alpha_{ij}^*: k^* \to \GL(V)$ with 
4355: 					\[\alpha_{ij}^*(t) = \begin{pmatrix}
4356: 						t_1 & 0 &  \cdots & 0 \\
4357: 						0 & t_2 &  \cdots & 0 \\
4358: 						\vdots & \vdots & \ddots & \vdots \\
4359: 						0 & 0 & \cdots & t_n
4360: 					\end{pmatrix} \]
4361: 					where $t_i = t, t_j = t^{-1}$ and $t_k = 1$ for all $k \neq i,j$. We also have $R = R^* = \{e_i-e_j|\ i \neq j \}$ and the positive roots $R^+ = \{e_i-e_j|\ 1 \leq i < j \leq n-1 \}$, with corresponding basis of simple roots $D = \{e_i-e_{i+1}|\ 1 \leq i<j \leq n-1 \}$ for the Weyl group $W=S_n \cong N_G(T)/Z_G(T)$, where the centralizer of $T$ is $Z_G(T)=T$ and the normalizer of $T$, $N_G(T)$ is the group of matrices with exactly one nonzero entry in each row and column. Clearly, modulo $T$, this is the group of permutation matrices given by the map $\rho:S_n \hookrightarrow \GL(V)$ where the generators $\sigma_i = (i,i+1) \mapsto \rho(\sigma_i)$ where $\rho(\sigma_i)e_i = e_{i+1}$, $\rho(\sigma_i)e_{i+1} = e_i$, and $\rho(\sigma_i)e_j = e_j$ for all $j \neq i,i+1$. Now, for brevity let $we_i = \rho(w)e_i$ for $w \in W$. Then $W$ acts on the root system $R$. If $\alpha = \alpha_{ij} = e_i-e_j$ is a root, then $w = (i,j) = \sigma_{\alpha}$ is the reflection of $R$ about the plane orthogonal to $\alpha_{ij}$. Since $\sigma_{\alpha} = \sigma_i \sigma_{i+1} \cdots \sigma_{j-2}\sigma_{j-1}\sigma_{j-2} \cdots \sigma_{i+1}\sigma_i$ we have $W=\la \sigma_i| \ 1 \leq i \leq n-1, \sigma_i^2=1=(\sigma_i\sigma_{i+1})^3, \sigma_i\sigma_j=\sigma_j\sigma_i \ (i \neq j) \ra$. 
4362: 					Define the weight $\lambda^* := -w_0\lambda$, where $w_0$ is the longest element of the Weyl group. 
4363: 					
4364: 					Let $Y=G/B$ be the flag variety and $\pi:G \to Y$ the projection. Let $\sO_Y$ be the sheaf of local rings on $Y$. Let $\mu \in \chi$ be a character (equiv. weight), $\mathcal{U}$ a Zariski open set in $Y$, and define a coherent sheaf $\mathscr{L}(\mu)$ of $\sO_Y$-modules by,
4365: 					\[ \mathscr{L}(\mu)(\mathcal{U}) = \{f \in \sO_G (\pi^{-1}\mathcal{U})| \ f(xb) = f(xtu) = (w_0 \mu)(t^{-1})(f(x)) = \chi_{\mu}(b)f(x) \} \]
4366: 					here $(w_0 \mu) = \chi_{\mu} \in \chi$, $x \in \pi^{-1}(\mathcal{U}), t \in T, u \in U$ (where $B=UT$ and $U$ is the unipotent radical of the Borel subgroup $B$). The weight $\mu$ determines a $\GL(V)$-equivariant line bundle $\mathcal{L}(\mu)$ on $Y$, and there is a $\GL(V)$-action on the space of global sections $\Gamma(Y, \mathcal{L}_{\mu}) = H^0(Y, \mathcal{L}(\mu)) = L(\mu)$. If $\mu$ is a dominant weight then Bott's Theorem says this is an irreducible highest weight representation of $\GL(V)$. Further, all $H^i(Y,\mathcal{L}(\mu))=0$ for $i>0$. In particular, 
4367: 					\[ L(\mu)=\{f \in k[G]|\ f(xb) = \chi_{\mu}(b)f(x) \} \]
4368: 					for $\chi_{\mu} \in \chi^+(B)$. All irreducible $\GL(V)$ modules can be obtained in this way. \\
4369: 					Now, let $B^{op}$ be the opposite Borel subgroup of lower triangular matrices. Let $U^{op}$ be the unipotent radical of $B^{op}$. For any simple $\GL(V)$ module, the highest weight vector with respect to $U^{op}$ is the lowest weight vector with respect to $U$ with weight $-\mu^*$.
4370: 					Then let $\Gamma(G/H) = \{(\lambda, \lambda^*) \ | \ \lambda \in \chi_+(H) \}$, i.e. pairs of $\GL(V)$ dominant weights such that $V_{\lambda} \otimes V_{\lambda^*} = V_{\lambda} \otimes V^*_{\lambda}$ contains a $\GL(V)$ invariant point ($V_{\lambda}$ an irreducible $G$-module of highest weight $\lambda$). Then $\Gamma(G/H)$ is saturated. So we then have,
4371: 					\[ I(\Gamma(G/H)) = (U \times U^{op})\Delta T \]
4372: 					where $\Delta T = \{(t,t) \in T \times T\} \leq \GL(V) \times \GL(V)$. Now, let $Z$ be some affine $G$-variety, $H=\Delta \GL(V)$ (a spherical subgroup). \\
4373: 					Now, let $\preceq$ be the partial order on weights in $\chi_T$ ($\lambda \preceq \mu \iff \lambda - \mu$ is a nonnegative integer linear combination of simple roots). The highest weight $\lambda$ is maximal in this order. This yields a partial order on irreducible factors of $k[Z]$ and $V_{\lambda}V_{\mu}$ is a sum of irreducible components smaller than or equal to $\lambda+\mu$ in the partial order. We then have the following 
4374: 					\begin{prop}\sidenote{E.B. Vinberg, B.M. Kimefeld. \emph{Homogeneous domains on flag manifolds and spherical subgroups of semisimple Lie groups}. Funct. Analysis and Appl. 12, 168-174 (1978)}
4375: 						An affine $G$-variety $Z$ is spherical if and only if the $G$-module $k[Z]$ is multiplicity free. Further, if $H \leq G$ is a spherical subgroup, and $V$ an irreducible $G$-module with $\dim_kV < \infty$ then $\dim_kV^H \leq 1$. 
4376: 					\end{prop}
4377: 					\begin{theorem}\sidenote{D. Panyushev. \emph{On Deformation Methods in Invariant Theory}. Ann. Inst. Fourier, Grenoble 47, 1 (1997), 985-1012.}
4378: 						Let $H \leq G$ be a spherical subgroup of a connected reductive group $G$ acting on the affine 
4379: 						variety $Z$. Assume $\Gamma(G/H)$ is saturated. The associated graded algebra $\gr k[Z]^H$ given by the 
4380: 						filtration $k[Z] = \bigcup_{\lambda \in \chi_+} k[Z]_{\preceq \lambda}$ is isomorphic to 
4381: 						$k[Z]^{I(\Gamma(G/H))}$. 
4382: 					\end{theorem}
4383: 					
4384: 					Now, let $Z = X \times Y$ be a product of affine $\GL(V)$-varieties and let $\GL(V)$ act diagonally (via restriction of the action of $G=\GL(V) \times \GL(V)$ to $H=\Delta \GL(V)$). By Theorem 2.4 of \sidenote{D. Panyushev. \emph{On Deformation Methods in Invariant Theory}. Ann. Inst. Fourier, Grenoble 47, 1 (1997), 985-1012.} we have
4385: 					\[ \gr k[Z]^{\Delta \GL(V)} \cong \left(k[X]^{U} \otimes k[Y]^{U^{op}}\right)^{\Delta T},  \]
4386: 					and 
4387: 					\begin{enumerate}
4388: 						\item If $k[Z]^{I(\Gamma(G/H))}$ is a complete intersection, then so is $k[Z]^H$. 
4389: 						\item The number of generators in a minimal system of homogeneous generators of $k[Z]^{I(\Gamma(G/H))}$ is greater than or equal to that for $k[Z]^H$. In particular, if $k[Z]^{I(\Gamma(G/H))}$ is a polynomial ring, then so is $k[Z]^H$.
4390: 					\end{enumerate}
4391: 					
4392: 					Now, let us assume $Z$ is a spherical $G$-variety so that $k[Z] = \bigoplus_{\lambda \in \Gamma}V_{\lambda}$ for some sub-semigroup $\Gamma \leq \chi_+$. Further, restricting the action we get $k[Z]^U = \bigoplus_{\lambda \in \Gamma}V_{\lambda}^U$, a direct sum of one-dimensional subspaces corresponding to elements of $\Gamma$. Also, $k[Z]^U \cong k[\Gamma]$, where $k[\Gamma]$ is the semigroup ring of $\Gamma$. 
4393: 					
4394: 					
4395: 					%\begin{lemma}
4396: 					%	If $V$ is a spherical representation of a quiver, $V$ and $P \subseteq Q$ is a subquiver
4397: 					%	then ResP  V   is a spherical representation of P   Proof  Note that the pro jection of Aut V   to the factor Q
4398: 					%	aP GL V  a   of GL dim V  
4399: 					%	is contained in Aut ResP  V     If Aut V   is spherical in GL dim V   then the pro jection
4400: 					%	is spherical in the factor  Thus ResP  V   is spherical 
4401: 					%\end{lemma}
4402: 					
4403: 					
4404: 					
4405: 					
4406: 					
4407: \section{Determinantal presentations and toric degenerations: making the bridge explicit}
4408: \label{sec:determinantal_toric_bridge}
4409: 
4410: The abstract spherical-geometry discussion above (Vinberg--Kimelfeld multiplicity-freeness and Panyushev's deformation theorem) becomes computationally useful once one identifies \emph{explicit} $U$--covariants and their relations.
4411: In essentially all representation-theoretic situations that occur in this manuscript, those covariants are given by \emph{determinants}---minors of matrices encoding linear maps along paths in quivers, or Pl\"ucker-type minors on Grassmannians and flag varieties.
4412: This is precisely the input that makes toric degenerations accessible: straightening relations among determinants (Laplace and Cauchy--Binet identities) degenerate to binomial relations in a semigroup algebra.
4413: 
4414: The goal of this section is therefore twofold:
4415: \begin{enumerate}[label=(\roman*)]
4416: \item to record, in a self-contained determinantal form, the standard relations that govern these covariants (Pl\"ucker/straightening identities), and
4417: \item to explain why the corresponding associated graded rings are toric (semigroup) rings, matching the semigroup picture $k[Z]^U\cong k[\Gamma(Z)]$ in the spherical setting.
4418: \end{enumerate}
4419: 
4420: We begin with the classical test case of Grassmannians and Schubert varieties, because it is the cleanest place where determinantal identities, standard monomial theory, and toric degenerations can all be written down explicitly.
4421: We then connect to the determinantal geometry of \emph{circular complexes} used in the special-biserial moduli-space theorem of Carroll--Chindris--Kinser--Weyman \cite{CarrollChindrisKinserWeyman2018ModuliSpecialBiserial} and to Schreiber's affine-Grassmannian viewpoint for surface orders \cite{Schreiber2018SurfaceAlgebrasII}.
4422: 
4423: \subsection{Grassmannians: Pl\"ucker coordinates and determinantal relations}
4424: Fix a field $K$ of characteristic $0$ and an $n$--dimensional $K$--vector space $V$.
4425: For $1\le k\le n$, the Grassmannian $\mathbf{Gr}(k,V)$ is a projective $K$--variety with a natural action of $G=\GL(V)$, and it is a basic example of a spherical $G$--variety.
4426: 
4427: Choose a basis of $V$ and identify a point of $\mathbf{Gr}(k,V)$ with the row span of a full-rank $k\times n$ matrix $X$.
4428: For each $k$--subset $I=\{i_1<\cdots<i_k\}\subset\{1,\dots,n\}$, denote by
4429: \[
4430: p_I(X):=\det(X_I)
4431: \]
4432: the maximal minor of $X$ in columns $I$.
4433: The Pl\"ucker embedding
4434: \[
4435: \mathbf{Gr}(k,V)\hookrightarrow \PP\!\bigl(\bigwedge\nolimits^k V\bigr)
4436: \]
4437: has homogeneous coordinates $\{p_I\}$, and the homogeneous coordinate ring of $\mathbf{Gr}(k,V)$ is the subring of $K[p_I]$ cut out by the Pl\"ucker relations.
4438: 
4439: \begin{theorem}[Pl\"ucker relations as a determinantal identity]
4440: \label{thm:plucker_determinantal}
4441: Fix a $(k\!-\!1)$--subset $A\subset\{1,\dots,n\}$ and a $(k\!+\!1)$--subset $B=\{b_1<\cdots<b_{k+1}\}\subset\{1,\dots,n\}$.
4442: Then the Pl\"ucker coordinates satisfy the quadratic identity
4443: \begin{equation}
4444: \label{eq:plucker_relation}
4445: \sum_{r=1}^{k+1}(-1)^{r-1}\,p_{A\cup\{b_r\}}\;p_{B\setminus\{b_r\}} \;=\; 0.
4446: \end{equation}
4447: Equivalently, the $2\times 2$ minors of the matrix of Pl\"ucker coordinates obtained by arranging $\{p_{A\cup\{b_r\}}\}$ and $\{p_{B\setminus\{b_r\}}\}$ in columns vanish.
4448: \end{theorem}
4449: 
4450: \begin{proof}
4451: Let $W\in\mathbf{Gr}(k,V)$ and choose vectors $w_1,\dots,w_{k+1}\in W$.
4452: Since $\dim W=k$, we have $w_1\wedge\cdots\wedge w_{k+1}=0$ in $\bigwedge^{k+1}V$.
4453: Expand each $w_j$ in the fixed basis of $V$ and apply multilinearity of the wedge product.
4454: The coefficient of any basis wedge $e_{i_0}\wedge e_{i_1}\wedge\cdots\wedge e_{i_k}$ is a $(k\!+\!1)\times(k\!+\!1)$ determinant built from the coordinate matrix of the $w_j$'s.
4455: Grouping terms by Laplace expansion along the column indexed by $b_r$ produces exactly \eqref{eq:plucker_relation}, with the signs coming from the alternating nature of the wedge.
4456: \end{proof}
4457: 
4458: \begin{remark}[Straightening law viewpoint]
4459: The quadratic relations \eqref{eq:plucker_relation} are the prototypical \emph{straightening relations} for minors.
4460: They are the degree-$2$ manifestation of the general straightening law discussed in Section~\ref{Straightening Law 1}, and they imply that products of incomparable Pl\"ucker coordinates can be rewritten as $K$--linear combinations of \emph{standard} products (chains in the dominance/poset order on $k$--subsets).
4461: \end{remark}
4462: 
4463: \subsection{Schubert varieties: rank conditions and determinantal ideals}
4464: Fix a complete flag $0\subset F_1\subset\cdots\subset F_n=V$.
4465: Schubert subvarieties of $\mathbf{Gr}(k,V)$ are cut out by \emph{rank conditions}
4466: \[
4467: \dim(W\cap F_j)\ge a_j,\qquad j=1,\dots,n,
4468: \]
4469: and in coordinates these conditions are expressed by vanishing of appropriate minors of the matrix $X$ representing $W$.
4470: Thus Schubert varieties are determinantal varieties inside $\mathbf{Gr}(k,V)$ (and hence inside projective space via Pl\"ucker).
4471: 
4472: For the purposes of this manuscript the key point is structural:
4473: \begin{quote}
4474: \emph{the coordinate rings of Schubert varieties admit standard monomial theory, so their defining relations are governed by determinantal straightening.}
4475: \end{quote}
4476: This is the mechanism that makes toric degenerations and multiplicity-free filtrations compatible with the spherical picture.
4477: 
4478: \subsection{Why this produces toric degenerations: initial algebras of determinantal straightening laws}
4479: A toric degeneration is, at heart, a statement that a non-toric coordinate ring has a filtration whose associated graded ring is a semigroup (toric) ring.
4480: In the spherical setting, Panyushev's theorem gives a canonical filtration: the $\preceq$--filtration by highest weights.
4481: In the determinantal setting, one often uses a monomial/term-order filtration compatible with straightening.
4482: 
4483: The two viewpoints are consistent because the generators (minors) are highest-weight vectors, and the straightening partial order is itself a shadow of the dominant weight order.
4484: Concretely, one obtains a \emph{SAGBI} degeneration in which:
4485: \begin{itemize}
4486: \item the generators are minors (Pl\"ucker coordinates, generalized minors, or Schofield determinants),
4487: \item each straightening relation has a distinguished ``leading'' monomial (the nonstandard product),
4488: \item the associated graded algebra is generated by the same symbols subject only to binomial relations, hence is a semigroup ring.
4489: \end{itemize}
4490: 
4491: \begin{proposition}[Toric associated graded from a straightening law]
4492: \label{prop:straightening_to_toric}
4493: Let $A$ be a finitely generated $K$--algebra generated by a finite partially ordered set $S=\{s_1,\dots,s_N\}$.
4494: Assume $A$ admits a straightening law in the sense of Section~\ref{Straightening Law 1} such that for every incomparable pair $s,s'\in S$ the straightening relation has the form
4495: \[
4496: s\,s' \;=\; \sum_i c_i\,M_i,
4497: \]
4498: where each $M_i$ is a \emph{standard} monomial that is strictly smaller than $ss'$ in a fixed term order.
4499: Then the associated graded algebra $\gr(A)$ for the induced filtration is a semigroup ring (hence the coordinate ring of an affine toric variety).
4500: \end{proposition}
4501: 
4502: \begin{proof}[Proof sketch]
4503: By hypothesis, the standard monomials form a $K$--basis and every nonstandard product reduces to a $K$--linear combination of smaller standard monomials.
4504: Passing to the associated graded kills all lower-order correction terms, so the straightening relations degenerate to \emph{monomial/binomial} relations among the generators.
4505: The resulting algebra is thus the quotient of a polynomial ring by an ideal generated by binomials (and possibly monomials), i.e.\ a semigroup algebra.
4506: \end{proof}
4507: 
4508: \begin{remark}[Spherical interpretation]
4509: When $A=k[Z]^U$ for a spherical $G$--variety $Z$, the semigroup ring in Proposition~\ref{prop:straightening_to_toric} is precisely $k[\Gamma(Z)]$.
4510: In this sense, determinantal straightening is an \emph{explicit} presentation of the abstract multiplicity-free semigroup phenomenon.
4511: \end{remark}
4512: 
4513: \subsection{Affine Grassmannians, minors, and the surface-order viewpoint (after Schreiber)}
4514: Schreiber emphasizes that loop-group/affine-Grassmannian charts are naturally coordinatized by minors that play the role of Pl\"ucker coordinates in infinite rank \cite{Schreiber2018SurfaceAlgebrasII}.
4515: On the ``big cell'' of an affine Grassmannian (or of an affine flag variety) one may write elements as semi-infinite block matrices, and the relevant Pl\"ucker-type coordinates are again determinants of finite minors.
4516: These minors restrict to polynomial functions on the big cell, giving a determinantal coordinate algebra that is compatible with Schubert stratifications (and hence with toric degenerations arising from affine Schubert theory).
4517: This is exactly the bridge between the order-theoretic gluing picture and the representation-theoretic Schubert picture.
4518: 
4519: \begin{remark}[Determinantal invariants and toric semigroup rings in the surface-algebra setting (Schreiber~I)]
4520: In the dessin/surface-algebra setting, Schreiber repeatedly emphasizes that natural (rational) invariants are often \emph{determinantal}---built from determinants of local path matrices or from minors encoding how local cyclic modules glue \cite{Schreiber2018SurfaceAlgebrasI}.
4521: One motivation given there is that these determinantal invariants frequently generate semigroup (toric) coordinate rings.
4522: From the point of view of this chapter, this is not a coincidence but an instance of the general mechanism:
4523: \[
4524: \text{(determinants/minors)}\quad+\quad \text{(straightening)}\quad\Longrightarrow\quad \text{(semigroup / toric degeneration)}.
4525: \]
4526: This is exactly the form needed later when we interpret renormalization/coarse-graining as passing to associated graded (toric) models.
4527: \end{remark}
4528: 
4529: 
4530: 
4531: \subsection{Circular complexes: determinantal rank conditions and an explicit degeneration argument}
4532: \label{sec:circular_complexes_determinantal}
4533: We now recall the determinantal geometry of \emph{circular complexes} used in \cite{CarrollChindrisKinserWeyman2018ModuliSpecialBiserial}.
4534: 
4535: Fix an integer $\ell\ge 1$ and an $\ell$--tuple of positive integers $n=(n_i)_{i\in\Z/\ell\Z}$.
4536: Consider the cyclic quiver with vertices $\Z/\ell\Z$ and arrows $a_i:i\to i+1$ (indices mod $\ell$), together with relations
4537: \[
4538: a_{i+1}a_i=0\qquad \text{for all }i\in\Z/\ell\Z.
4539: \]
4540: A representation of this bound quiver is a tuple of matrices
4541: \[
4542: A_i\in \mathrm{Mat}_{n_{i+1}\times n_i}(K)
4543: \quad \text{with}\quad A_{i+1}A_i=0.
4544: \]
4545: The corresponding representation variety is the \emph{variety of circular complexes}
4546: \[
4547: \mathrm{Comp}(n):=\Bigl\{(A_i)_i\in \prod_{i\in\Z/\ell\Z}\mathrm{Mat}_{n_{i+1}\times n_i}(K)\;:\;A_{i+1}A_i=0\ \forall i\Bigr\}.
4548: \]
4549: Now fix a \emph{rank sequence} $r=(r_i)_{i\in\Z/\ell\Z}$ satisfying the obvious inequalities $r_{i-1}+r_i\le n_i$.
4550: Define the rank-bounded subvariety
4551: \[
4552: \mathrm{Comp}(n,r):=\Bigl\{(A_i)\in \mathrm{Comp}(n): \rank(A_i)\le r_i\ \forall i\Bigr\}.
4553: \]
4554: Each constraint $\rank(A_i)\le r_i$ is determinantal: it is equivalent to vanishing of all $(r_i+1)\times (r_i+1)$ minors of $A_i$.
4555: Thus $\mathrm{Comp}(n,r)$ is cut out by a mix of quadratic equations (the composition relations) and determinantal equations (minors).
4556: 
4557: The key geometric fact (proved in \cite{CarrollChindrisKinserWeyman2018ModuliSpecialBiserial}, following Lusztig) is that the ``expected'' rank stratum is dense:
4558: 
4559: \begin{lemma}[Rank-stratum closure equals the determinantal variety]
4560: \label{lem:comp_rank_stratum_closure}
4561: Let $r$ be a rank sequence for $n$.
4562: Let
4563: \[
4564: \mathrm{Comp}^0(n,r):=\Bigl\{(A_i)\in \mathrm{Comp}(n): \rank(A_i)= r_i\ \forall i\Bigr\}.
4565: \]
4566: Then $\mathrm{Comp}(n,r)$ is the Zariski closure of $\mathrm{Comp}^0(n,r)$, hence is irreducible.
4567: \end{lemma}
4568: 
4569: \begin{proof}[Proof idea (degeneration)]
4570: The inclusion $\overline{\mathrm{Comp}^0(n,r)}\subseteq \mathrm{Comp}(n,r)$ follows from upper semicontinuity of rank.
4571: For the reverse inclusion, start from an arbitrary point $(A_i)\in\mathrm{Comp}(n,r)$ and write $r'_i:=\rank(A_i)\le r_i$.
4572: One constructs an explicit $1$--parameter family of representations over $K[\lambda]$ that has generic fibre of rank sequence $r$ and special fibre of rank sequence $r'$ (and hence degenerates to the chosen point after acting by $\GL(n)$).
4573: Concretely, one adds, along each arrow $a_i$, a direct-summand representation supported only on the two endpoints and scaled by $\lambda^{\varepsilon_i}$ with $\varepsilon_i=r_i-r'_i$.
4574: For $\lambda\neq 0$ this summand upgrades the rank to $r_i$, while at $\lambda=0$ the summand vanishes.
4575: This produces a degeneration from a rank-$r$ point to the rank-$r'$ point, showing every point of $\mathrm{Comp}(n,r)$ lies in the closure of $\mathrm{Comp}^0(n,r)$.
4576: \end{proof}
4577: 
4578: \begin{proposition}[Normality via affine Schubert charts]
4579: \label{prop:comp_normal}
4580: For any rank sequence $r$ for $n$, the variety $\mathrm{Comp}(n,r)$ is normal.
4581: \end{proposition}
4582: 
4583: \begin{proof}[Proof sketch]
4584: Orbit closures in $\mathrm{Comp}(n)$ are orbit closures of nilpotent representations of cyclic quivers of type $\widetilde{A}$.
4585: Lusztig's local model theorem identifies these orbit closures with affine Schubert varieties in an appropriate (type $A$) affine flag variety.
4586: Affine Schubert varieties are normal (e.g.\ by the normality theorem of Faltings for algebraic loop groups).
4587: Therefore each $\mathrm{Comp}(n,r)$ is normal.
4588: See \cite{CarrollChindrisKinserWeyman2018ModuliSpecialBiserial} for this reduction in the circular-complex setting, and the cited local-model inputs \cite{Lusztig1990CanonicalBases,Faltings2003LoopGroups}.
4589: \end{proof}
4590: 
4591: \begin{remark}[Why this is a determinantal proof in spirit]
4592: Both inputs---rank constraints and Schubert local models---are determinantal.
4593: Rank constraints are literally vanishing of minors.
4594: Affine Schubert varieties in type $A$ can be presented by rank conditions on semi-infinite matrices (generalized determinantal equations), and their standard monomial theory is again governed by determinantal straightening.
4595: Thus the normality statement is not a black box: it is a manifestation of determinantal geometry at infinite rank.
4596: \end{remark}
4597: 
4598: \begin{remark}[Back to spherical/toric degenerations]
4599: The determinantal presentation of $\mathrm{Comp}(n,r)$ means its coordinate ring is built from minors and their straightening relations.
4600: Whenever one chooses a compatible term order (or highest-weight filtration), the associated graded ring is a semigroup ring, hence $\mathrm{Comp}(n,r)$ admits toric degenerations.
4601: In the surface-order setting, these degenerations are the algebraic shadow of passing from a glued, curved geometry to a combinatorial skeleton, exactly as in Panyushev's horospherical contraction.
4602: \end{remark}
4603: 
4604: 
4605: 
4606: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
4607: \section{Determinantal invariants for gentle/surface algebras and their toric degenerations}
4608: \label{sec:determinantal_invariants_gentle_toric}
4609: 
4610: The preceding section (\S\ref{sec:spherical_varieties_and_toric_degenerations}) sketched the \emph{geometric} slogan
4611: \[
4612: \text{``spherical''}\ \Longrightarrow\ \text{multiplicity free}\ \Longrightarrow\ \text{toric degeneration},
4613: \]
4614: and then explained how Zelevinsky-style wiring diagrams provide a \emph{combinatorial} parametrization of totally positive pieces of groups and flag varieties.
4615: For the applications in later chapters (notably the determinantal Hilbert--Pólya closure argument),
4616: we need a second slogan that is less poetic and more computational:
4617: \begin{quote}
4618: \emph{The semi-invariants and many derived invariants of gentle/surface algebras are \textbf{determinants} of explicit maps, and under toric/horospherical degeneration these determinants become \textbf{monomials}.}
4619: \end{quote}
4620: This section records the determinantal input with enough detail to be used as a black box later, while keeping the exposition compatible with both the \emph{state-vector} and \emph{density-operator} narratives used throughout the manuscript.
4621: 
4622: \subsection{Schofield determinants and determinantal semi-invariants (quivers with relations)}
4623: \label{sec:schofield_determinants}
4624: 
4625: Let $k$ be an algebraically closed field of characteristic $0$.
4626: Let $Q$ be a finite quiver, $I\subset kQ$ an admissible ideal of relations, and $A=kQ/I$ the bound quiver algebra.
4627: Fix a dimension vector $\mathbf{d}=(d_i)_{i\in Q_0}$ and denote the representation variety by
4628: \[
4629: \Rep(A,\mathbf{d}) \;\subseteq\; \prod_{a:i\to j\in Q_1}\Mat_{d_j\times d_i}(k),
4630: \]
4631: cut out by the polynomial equations corresponding to the relations in $I$.
4632: The base-change group
4633: \[
4634: G_\mathbf{d}:=\prod_{i\in Q_0}\GL_{d_i}(k)
4635: \]
4636: acts on $\Rep(A,\mathbf{d})$ by simultaneous change of bases at vertices.
4637: Write $\SL_\mathbf{d}:=\prod_i \SL_{d_i}(k)$.
4638: 
4639: \begin{definition}[Semi-invariants]
4640: The \emph{ring of semi-invariants} is
4641: \[
4642: \SI(A,\mathbf{d}) \;:=\; k[\Rep(A,\mathbf{d})]^{\SL_\mathbf{d}}.
4643: \]
4644: Equivalently, $\SI(A,\mathbf{d})$ is the direct sum of weight spaces for the $G_\mathbf{d}$-action:
4645: \[
4646: \SI(A,\mathbf{d})\;=\;\bigoplus_{\chi\in X^\ast(G_\mathbf{d})}\SI(A,\mathbf{d})_\chi,
4647: \qquad
4648: g\cdot f = \chi(g)\,f\ \ \text{for }f\in \SI(A,\mathbf{d})_\chi .
4649: \]
4650: \end{definition}
4651: 
4652: The fundamental point is that the \emph{basic semi-invariants are determinantal}.
4653: One convenient formulation uses projective presentations.
4654: 
4655: \begin{definition}[Determinantal semi-invariant from a projective presentation]
4656: \label{def:det_semi_inv_projective}
4657: Let $P_1\xrightarrow{\ \phi\ } P_0\to M\to 0$ be a finite projective presentation of a (finite-dimensional) $A$-module $M$.
4658: For $N\in\Rep(A,\mathbf{d})$, applying $\Hom_A(-,N)$ yields a linear map
4659: \[
4660: \Hom_A(P_0,N)\xrightarrow{\ \Hom(\phi,N)\ }\Hom_A(P_1,N).
4661: \]
4662: When $\dim_k\Hom_A(P_0,N)=\dim_k\Hom_A(P_1,N)$ (a weight/dimension-match condition depending on $M$ and $\mathbf{d}$),
4663: define the \emph{determinantal semi-invariant}
4664: \[
4665: c^M(N)\ :=\ \det\!\big(\Hom_A(\phi,N)\big).
4666: \]
4667: \end{definition}
4668: 
4669: \begin{remark}[Why this is the right determinant]
4670: Definition~\ref{def:det_semi_inv_projective} recovers Schofield's semi-invariants in the acyclic case and their standard generalizations to quivers with relations.
4671: The key facts are:
4672: \begin{enumerate}[label=(\roman*)]
4673: \item $c^M$ is a semi-invariant of a specific weight determined by $M$;
4674: \item varying $M$ (or equivalently varying the presentation) produces enough determinants to generate $\SI(A,\mathbf{d})$;
4675: \item the determinantal nature is robust under base change, which is exactly why these objects are appropriate for arithmetic applications (surface orders, local-to-global gluing).
4676: \end{enumerate}
4677: We use these determinants as the algebraic ``atoms'' that will later be glued, filtered, and completed.
4678: \end{remark}
4679: 
4680: \begin{theorem}[Generation by determinantal semi-invariants (informal statement)]
4681: \label{thm:determinantal_generators_SI}
4682: For a wide class of bound quiver algebras (including the gentle/special-biserial families relevant to surface algebras),
4683: the semi-invariant ring $\SI(A,\mathbf{d})$ is generated by determinantal semi-invariants $c^M$ arising from suitable projective presentations of modules $M$.
4684: \end{theorem}
4685: 
4686: \begin{proof}[Proof sketch and references]
4687: In the acyclic case, Schofield constructed the semi-invariants $c^M$ and showed that they generate the semi-invariant ring; Derksen--Weyman and Domokos--Zubkov recast this in a uniform determinantal framework.
4688: For quivers with relations, one replaces $M$ by a presentation adapted to $I$ and uses the same determinant-of-Hom-map mechanism.
4689: A detailed exposition is standard in invariant theory for quivers and is also the technical underpinning of the surface-algebra program in \cite{Schreiber2018SurfaceAlgebrasI,CarrollChindrisKinserWeyman2018ModuliSpecialBiserial}.
4690: \end{proof}
4691: 
4692: \subsection{Weighted Cartan determinants for (locally) gentle quivers: an explicit cycle product}
4693: \label{sec:weighted_cartan_determinant}
4694: 
4695: A second determinantal invariant that is extremely well-adapted to surface/gentle combinatorics is the \emph{Cartan determinant}.
4696: For finite-dimensional algebras it is classically a derived invariant (up to unimodular equivalence).
4697: For (possibly infinite-dimensional) \emph{locally} gentle algebras, Bessenrodt--Holm compute a \emph{weighted} Cartan determinant as a rational function whose factors are controlled by oriented cycles.
4698: 
4699: \begin{definition}[Weighted locally gentle quiver and weighted Cartan matrix (informal)]
4700: A \emph{weighted locally gentle quiver} is a locally gentle bound quiver $(Q,I)$ together with a weight function $w:Q_1\to k^\times$ (or with weights in a formal parameter ring), inducing a grading/weight on paths by multiplicativity.
4701: The \emph{weighted Cartan matrix} $C_Q^w(x)$ is the matrix whose $(i,j)$ entry is the weighted generating series of nonzero paths from $j$ to $i$ (the precise definition is given in \cite{BessenrodtHolm2005WeightedLocallyGentle}).
4702: \end{definition}
4703: 
4704: To state the determinant formula, denote by:
4705: \begin{itemize}
4706: \item $\mathrm{ZC}(Q)$ the set of minimal oriented cycles with \emph{full relations} (every consecutive length-two subpath is in $I$),
4707: \item $\mathrm{IC}(Q)$ the set of minimal oriented cycles with \emph{no relations} (no consecutive length-two subpath lies in $I$),
4708: \item for an oriented cycle $C=\alpha_1\cdots \alpha_{\ell(C)}$, its weight $w(C):=\prod_{r=1}^{\ell(C)} w(\alpha_r)$ and length $\ell(C)$.
4709: \end{itemize}
4710: 
4711: \begin{theorem}[Bessenrodt--Holm: determinant of the weighted Cartan matrix]
4712: \label{thm:BH_weighted_cartan_det}
4713: Let $(Q,I,w)$ be a weighted locally gentle quiver and $C_Q^w(x)$ its weighted Cartan matrix.
4714: Then $\det C_Q^w(x)$ is a rational function determined entirely by the oriented cycle combinatorics:
4715: \begin{equation}
4716: \label{eq:BH_cartan_det}
4717: \det C_Q^w(x)
4718: =
4719: \frac{\displaystyle\prod_{C\in \mathrm{ZC}(Q)} \Bigl(1-(-1)^{\ell(C)}\,w(C)\Bigr)}
4720: {\displaystyle\prod_{C\in \mathrm{IC}(Q)} \Bigl(1-w(C)\Bigr)}.
4721: \end{equation}
4722: \end{theorem}
4723: 
4724: \begin{proof}[Proof sketch and why we care]
4725: The proof in \cite{BessenrodtHolm2005WeightedLocallyGentle} proceeds by a reduction algorithm that removes cycles while tracking unimodular transformations of $C_Q^w(x)$, together with a duality argument (Koszul duality in the unweighted case).
4726: For this manuscript the key output is the \emph{shape} of \eqref{eq:BH_cartan_det}:
4727: a determinant becomes an explicit product of simple factors indexed by oriented cycles.
4728: 
4729: In other words, the Cartan determinant is a controlled \emph{cycle zeta function} of the quiver.
4730: This is exactly the kind of object one can later match to:
4731: (i) Euler products (primes and prime powers), and
4732: (ii) trace/log-determinant expansions $\log\det(I-T)=-\sum_{n\ge 1}\frac{1}{n}\Tr(T^n)$ where $\Tr(T^n)$ is a closed-cycle count.
4733: \end{proof}
4734: 
4735: \begin{remark}[Surface-order interpretation]
4736: For surface algebras coming from dessins or embedded ribbon graphs, the relevant oriented cycles are precisely those encoded by the permutation data $(\sigma_0,\sigma_1,\sigma_\infty)$:
4737: black/white vertex cycles (in $\sigma_0$ and $\sigma_1$) and face cycles (in $\sigma_\infty$).
4738: The ``full relations'' vs ``no relations'' dichotomy matches the surface-algebra distinction between cycles killed by the ideal and cycles that remain admissible in the completed order.
4739: Thus \eqref{eq:BH_cartan_det} is a determinantal certificate that the algebra ``remembers'' its surface cycle structure in a rigid, multiplicative way.
4740: \end{remark}
4741: 
4742: \subsection{Regular components, circular complexes, and toric (semi-)invariant geometry}
4743: \label{sec:regular_components_toric}
4744: 
4745: The determinantal facts above become geometric once combined with the special-biserial/gentle structure theory.
4746: Recall from \cite{CarrollChindrisKinserWeyman2018ModuliSpecialBiserial} (reviewed earlier) that:
4747: \begin{enumerate}[label=(\roman*)]
4748: \item irreducible components of representation varieties of special biserial algebras reduce to products of varieties of circular complexes,
4749: \item these varieties are normal and have rational singularities,
4750: \item and the resulting GIT moduli components are products of projective spaces.
4751: \end{enumerate}
4752: A product of projective spaces is the simplest kind of spherical variety and admits many toric degenerations (indeed it is already toric).
4753: This is the geometric backbone behind the ``semi-invariants are toric'' statements used in the Artin $L$-function discussion.
4754: 
4755: \subsection{Semi-invariant rings as semigroup rings: a toric theorem for surface algebras}
4756: \label{sec:toric_semi_invariants_surface_algebras}
4757: 
4758: We now record the toric/monomial conclusion in the form that is most useful later.
4759: 
4760: \begin{theorem}[Toricity of semi-invariants for surface/gentle families (after Schreiber and CCKW)]
4761: \label{thm:surface_toric_semi_invariants}
4762: Let $A$ be a surface algebra (or a gentle/special biserial algebra arising from a clean or bipartite dessin), and fix a dimension vector $\mathbf{d}$.
4763: Then:
4764: \begin{enumerate}[label=(\arabic*)]
4765: \item the semi-invariant ring $\SI(A,\mathbf{d})$ is a finitely generated \emph{semigroup ring} (hence the coordinate ring of an affine toric variety);
4766: \item the relevant representation varieties are normal, Cohen--Macaulay, and have rational singularities in the regular components;
4767: \item moduli spaces of $\theta$-semistable regular modules have irreducible components isomorphic to products of projective spaces (in particular, many components are projective lines in the band-module regime).
4768: \end{enumerate}
4769: \end{theorem}
4770: 
4771: \begin{proof}[Proof sketch: determinantal $\Rightarrow$ toric via degeneration]
4772: Combine three ingredients:
4773: \begin{enumerate}[label=(\roman*)]
4774: \item \textbf{Determinantal generators.} By Theorem~\ref{thm:determinantal_generators_SI}, $\SI(A,\mathbf{d})$ is generated by determinants $c^M$.
4775: \item \textbf{Spherical/horospherical contraction.} The representation varieties (and their covariant rings) carry reductive group actions; the Vinberg--Kimelfeld/Panyushev deformation machinery yields a flat degeneration to a multiplicity-free (spherical) associated graded object (see \S\ref{sec:spherical_varieties_and_toric_degenerations}).
4776: \item \textbf{Initial-term monomiality in the gentle/special-biserial regime.} In the gentle/special-biserial case, the determinantal semi-invariants admit combinatorial interpretations in terms of nonintersecting path families (LGV) on the underlying surface/ribbon graph.
4777: Under the degeneration, each determinant has a distinguished leading term corresponding to a unique extremal path family, hence becomes a monomial.
4778: Therefore the associated graded semi-invariant ring is a semigroup ring; flatness transports finite generation and normality properties back to the original ring.
4779: Finally, the moduli-space conclusions follow from the normality results and the decomposition theorem for moduli spaces in \cite{CarrollChindrisKinserWeyman2018ModuliSpecialBiserial}.
4780: \end{enumerate}
4781: \end{proof}
4782: 
4783: \subsection{Artin $L$-functions and surface orders: determinants, monomials, and cyclic subgroups}
4784: \label{sec:artin_L_determinants_surface_orders}
4785: 
4786: The surface-order technology in \cite{Schreiber2018SurfaceAlgebrasI} is explicitly designed so that local matrix orders compute local characteristic polynomials.
4787: For Artin $L$-functions this is the natural language because the Euler factors are already determinants of Frobenius matrices.
4788: 
4789: We isolate (and slightly rephrase) the statements used later as an ``assisting theorem''.
4790: 
4791: \begin{theorem}[Artin-theoretic determinantal/toric package (after \cite{Schreiber2018SurfaceAlgebrasI})]
4792: \label{thm:artin_determinantal_toric_package}
4793: Let $K/\Q$ be a finite extension (Galois or not) and let $\rho:G(K/\Q)\to \GL(V)$ be a finite-dimensional complex representation.
4794: Then:
4795: \begin{enumerate}[label=(\arabic*)]
4796: \item the local Euler factors can be written as determinants
4797: \[
4798: L_p(\rho,s)=\det\!\Bigl(I-\rho(\mathrm{Frob}_p)\,N(p)^{-s}\ \big|\ V^{I_p}\Bigr)^{-1},
4799: \]
4800: with the usual inertia correction at ramified primes;
4801: \item by embedding the base-change action diagonally into a larger $\GL(n)$ (summing over local matrix sizes), one may compute these local determinants inside the hereditary orders appearing in the surface-order pullback construction;
4802: \item the rings of polynomial semi-invariants for these surface-order representation varieties are semigroup rings (affine toric), and the associated semistable regular moduli components are products of projective spaces;
4803: \item consequently, Artin $L$-functions admit factorizations into \emph{monomials} corresponding to cyclic subgroup characters (integral, not merely rational, after choosing the appropriate surface-order framework).
4804: \end{enumerate}
4805: \end{theorem}
4806: 
4807: \begin{remark}[Why this matters for GRH-strength Hilbert--Pólya]
4808: Items (1)--(2) explain why determinants are the correct local arithmetic language.
4809: Items (3)--(4) explain why toric/monomial structures are not aesthetic decoration:
4810: they are what makes it plausible that one can build \emph{positive} transfer operators and control limits (weak-$\ast$ and trace-class) across a twist family.
4811: This is the bridge to the determinantal Hurwitz closure argument in the final chapter.
4812: \end{remark}
4813: 
4814: 
4815: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
4816: \subsection{Artin holomorphy via cyclic (Brauer) induction and toric semigroup geometry}
4817: \label{sec:artin_holomorphy_semigroup_toric}
4818: 
4819: Theorem~\ref{thm:artin_determinantal_toric_package} distilled the surface-order input from \cite{Schreiber2018SurfaceAlgebrasI}.
4820: Because later chapters treat Artin twists and GRH-strength families, we now expand two points that were only implicit above:
4821: \begin{enumerate}[label=(\roman*)]
4822: \item why \emph{every} Artin $L$--function is a \emph{determinant} and, via Brauer induction, a \emph{monomial} in cyclic (hence Hecke/Dirichlet) $L$--functions; and
4823: \item how holomorphy questions can be expressed as \emph{semigroup-algebra} questions that are naturally controlled by toric geometry.
4824: \end{enumerate}
4825: The resulting package is exactly what is used later when we treat Hilbert--Pólya approximants as determinants and then close the argument by Hurwitz.
4826: 
4827: \subsubsection{Brauer--Artin monomialization: from cyclic subgroups to monomials}
4828: Let $G$ be a finite group.
4829: Write $R(G)$ for the Grothendieck group of complex representations (virtual characters), and similarly $R(H)$ for subgroups $H\le G$.
4830: 
4831: \begin{theorem}[Brauer induction / Artin's theorem on induced cyclic characters]
4832: \label{thm:brauer_induction_cyclic}
4833: Every virtual character $\chi\in R(G)$ is an \emph{integer} linear combination of characters induced from \emph{one-dimensional} characters of \emph{cyclic} subgroups:
4834: \[
4835: \chi\ =\ \sum_{r=1}^m a_r\,\Ind_{H_r}^G(\psi_r),
4836: \qquad
4837: a_r\in\mathbb{Z},
4838: \quad
4839: H_r\le G\text{ cyclic},
4840: \quad
4841: \psi_r\in R(H_r)\text{ one-dimensional}.
4842: \]
4843: \end{theorem}
4844: 
4845: \begin{remark}[Why we include this]
4846: This is the exact representation-theoretic statement behind the slogan in \cite[\S14]{Schreiber2018SurfaceAlgebrasI} that ``Artin $L$--functions become monomials attached to cyclic local orders.''
4847: The surface-order formalism does \emph{not} change Brauer induction; it changes the \emph{geometry} in which one computes the corresponding determinants and invariants, and it provides an invariant-theoretic (toric) way to organize cancellation/holomorphy constraints.
4848: \end{remark}
4849: 
4850: \begin{corollary}[Artin $L$--functions as monomials in cyclic (Hecke) $L$--functions]
4851: \label{cor:artin_L_monomialization}
4852: Let $K/\mathbb{Q}$ be a finite extension and let $\rho:G(K/\mathbb{Q})\to \GL(V)$ be a complex representation with character $\chi_\rho$.
4853: Then there exist cyclic subgroups $H_r\le G(K/\mathbb{Q})$, one-dimensional characters $\psi_r$ of $H_r$, and integers $a_r$ such that
4854: \begin{equation}
4855: \label{eq:artin_L_monomial}
4856: L(s,\rho)\ =\ \prod_{r=1}^m L\!\bigl(s,\Ind_{H_r}^G(\psi_r)\bigr)^{a_r}
4857: \ =\ \prod_{r=1}^m L(s,\psi_r)^{a_r},
4858: \end{equation}
4859: where $L(s,\psi_r)$ denotes the Artin $L$--function for the one-dimensional character $\psi_r$ (equivalently a Hecke $L$--function for the corresponding abelian extension).
4860: \end{corollary}
4861: 
4862: \begin{proof}[Proof sketch]
4863: Apply Theorem~\ref{thm:brauer_induction_cyclic} to $\chi_\rho$.
4864: Artin $L$--functions are multiplicative in virtual characters and compatible with induction:
4865: $L(s,\Ind_{H}^G\psi)=L(s,\psi)$ for the induced representation (after identifying Euler factors), and
4866: $L(s,\chi_1+\chi_2)=L(s,\chi_1)L(s,\chi_2)$, $L(s,n\chi)=L(s,\chi)^n$.
4867: This yields \eqref{eq:artin_L_monomial}.
4868: \end{proof}
4869: 
4870: \begin{remark}[Meromorphy is easy; holomorphy is the subtle part]
4871: Equation~\eqref{eq:artin_L_monomial} expresses any Artin $L$--function as a \emph{monomial} in degree-one (abelian) $L$--functions, but with possibly negative exponents.
4872: Since degree-one $L$--functions are meromorphic with controlled poles, this immediately implies meromorphy of $L(s,\rho)$.
4873: The problem of showing holomorphy in the critical strip for nontrivial irreducible $\rho$ is exactly the cancellation problem created by negative exponents (Artin's holomorphy conjecture).
4874: \end{remark}
4875: 
4876: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
4877: \subsubsection{Gabriel--Riedtmann ``group representations without groups'': Brauer trees, special biserial algebras, and the surface-order philosophy}
4878: \label{sec:gabriel_riedtmann_without_groups}
4879: 
4880: A recurring methodological claim in this manuscript is that one can often replace explicit \emph{groups} (Galois groups, monodromy groups, or local decomposition groups) by \emph{quivers with relations} whose representation theory retains precisely the data needed to compute determinantal invariants.
4881: This philosophy is not new: a classical and influential prototype is the paper of Gabriel and Riedtmann on \emph{group representations without groups} \cite{GabrielRiedtmann1979WithoutGroups}.
4882: 
4883: \paragraph{What ``without groups'' means.}
4884: The slogan refers to the phenomenon that, in large regions of modular representation theory, the stable/derived representation category of a finite group algebra is governed by a \emph{combinatorial quiver model} (Auslander--Reiten translation quivers, mesh categories, and explicit quivers with relations) rather than by the group itself.
4885: In particular, for blocks with \emph{cyclic defect groups}, the basic algebras are (Morita equivalent to) \emph{Brauer tree algebras}: symmetric special-biserial algebras whose quivers and relations are determined by a decorated tree with a cyclic ordering of edges at each vertex.
4886: Gabriel--Riedtmann's analysis packages this as: a block is controlled by a translation quiver/mesh category that can be written down \emph{intrinsically}, without naming the ambient group \cite{GabrielRiedtmann1979WithoutGroups}.
4887: 
4888: \paragraph{Why this aligns with surface orders.}
4889: Surface/dessin algebras and surface orders are likewise \emph{special-biserial/gentle} in broad families and hence sit in the same geometric landscape as Brauer tree algebras.
4890: The surface-order pullback construction in \cite{Schreiber2018SurfaceAlgebrasI} replaces local arithmetic stabilizers
4891: (decomposition groups, inertia, Frobenius)
4892: by explicit \emph{hereditary orders} inside matrix algebras over local rings.
4893: From the representation-theoretic perspective, this is again ``without groups'': the local group action is encoded by a quiver-with-relations (or order) whose determinantal invariants are stable under base change and can be computed in a purely algebraic/geometric manner.
4894: 
4895: \paragraph{Connection to cyclic subgroups and Brauer induction.}
4896: Brauer induction (Theorem~\ref{thm:brauer_induction_cyclic}) reduces arbitrary virtual characters to integer combinations induced from \emph{cyclic} subgroups.
4897: On the modular side, cyclic defect is exactly the condition under which blocks admit Brauer-tree models.
4898: Thus, the same ``cyclicity'' that makes monomialization of Artin $L$--functions possible is also what makes quiver models canonical in the representation category.
4899: This is one reason the surface-order framework is well matched to Artin data: it is engineered to remember cyclic local pieces functorially.
4900: 
4901: \paragraph{Connection to necklaces and trace invariants.}
4902: Once a representation problem is expressed in quiver form, the correct polynomial invariants are generated by \emph{cycle words}.
4903: Concretely, Le Bruyn--Procesi identify $\GL(\bd)$-invariants on $\Rep(Q,\bd)$ with the trace algebra generated by necklace traces \cite{LeBruynProcesi1990SemisimpleQuivers}; Craw--Yamagishi/Lusztig extend this to quivers with relations and frozen vertices (Section~\ref{sec:necklaces_LBP_Lusztig}) \cite{CrawYamagishi2023LBPFollowingLusztig}.
4904: On the arithmetic side, the Euler factors are determinants and hence polynomials in traces of powers by Newton identities (Lemma~\ref{lem:newton_necklace}).
4905: Therefore the combined message is:
4906: 
4907: \begin{quote}
4908: \emph{once arithmetic representation data is recoded as quiver/order data, the ``local Euler determinants'' live in the same cycle/necklace trace algebra as the geometric invariants controlling moduli.}
4909: \end{quote}
4910: 
4911: \begin{remark}[Practical implication for holomorphy arguments]
4912: In the determinantal holomorphy program, the difficult analytic step is to control cancellations of poles created by negative exponents in the Brauer--Artin monomialization (Remark after Corollary~\ref{cor:artin_L_monomialization}).
4913: The geometric input provided by ``without groups'' (Gabriel--Riedtmann) and ``cycles generate invariants'' (Le Bruyn--Procesi/Lusztig) is that
4914: \emph{all relevant denominators and potential pole loci can be expressed in determinantal/cycle coordinates on explicit moduli spaces}.
4915: This is the point at which one can plausibly bring toric degenerations and positivity (Sections~\ref{sec:toric_semi_invariants_surface_algebras} and \ref{sec:positive_grassmannian_total_positivity}) to bear on the cancellation problem.
4916: \end{remark}
4917: 
4918: 
4919: 
4920: 
4921: 
4922: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
4923: \subsubsection{Carroll--Chindris: $\SL$ semi-invariants, $\GL$ rational invariants, and rational moduli geometry}
4924: \label{sec:cc_SL_GL_rational_invariants}
4925: 
4926: A recurring theme in this manuscript is that \emph{determinants} are the natural interface between:
4927: (i) representation varieties (and their invariant theory), and
4928: (ii) Euler factors of arithmetic $L$--functions.
4929: The work of Carroll--Chindris on acyclic gentle algebras makes this link completely explicit at the level of \emph{rational invariant functions}.
4930: 
4931: \paragraph{Setup: $\GL(\bd)$--action and its derived subgroup.}
4932: Fix a bound quiver algebra $A=kQ/I$ over an algebraically closed field $k$ of characteristic $0$, and a dimension vector $\bd\in\NN^{Q_0}$.
4933: The base-change group
4934: \[
4935: G:=\GL(\bd)\ :=\ \prod_{i\in Q_0}\GL(\bd(i))
4936: \]
4937: acts on the representation variety $\rep(A,\bd)$ by change of bases.
4938: Its derived subgroup is
4939: \[
4940: G':=\SL(\bd)\ :=\ \prod_{i\in Q_0}\SL(\bd(i)).
4941: \]
4942: 
4943: \paragraph{Semi-invariants as $\SL(\bd)$--invariants.}
4944: The character lattice of $G$ is naturally identified with $\ZZ^{Q_0}$: a weight $\theta=(\theta_i)_{i\in Q_0}$ defines the character
4945: \[
4946: \chi_\theta(g)\ :=\ \prod_{i\in Q_0}\det(g_i)^{\theta_i}\qquad (g=(g_i)_i\in G).
4947: \]
4948: A polynomial function $f\in k[\rep(A,\bd)]$ is a \emph{semi-invariant of weight $\theta$} if
4949: \[
4950: g\cdot f \ =\ \chi_\theta(g)\,f\qquad \forall\,g\in G.
4951: \]
4952: Write $\SI(A,\bd)_\theta$ for the weight space of such semi-invariants.
4953: Because $\chi_\theta|_{G'}\equiv 1$, every semi-invariant is $G'$--invariant and one has the canonical weight decomposition
4954: \[
4955: \SI(A,\bd)\ :=\ k[\rep(A,\bd)]^{G'}
4956: \ =\ \bigoplus_{\theta\in\ZZ^{Q_0}}\SI(A,\bd)_\theta.
4957: \]
4958: For an irreducible component $C\subseteq\rep(A,\bd)$, write $\SI(C)_\theta$ for the restriction of $\SI(A,\bd)_\theta$ to $C$.
4959: 
4960: \paragraph{Rational invariants as ratios of semi-invariants.}
4961: Let $k(C)$ be the function field of an irreducible component $C$.
4962: Whenever $\SI(C)_\theta\neq 0$, any ratio $f/g$ with $f,g\in \SI(C)_\theta$ defines a \emph{$G$--invariant rational function} on $C$, because the $\chi_\theta$--factors cancel:
4963: \[
4964: g\cdot \frac{f}{g}\ =\ \frac{\chi_\theta(g)f}{\chi_\theta(g)g}\ =\ \frac{f}{g}.
4965: \]
4966: Thus $k(C)^{G}$ is naturally identified with the degree-$0$ fraction field of the graded ring $\bigoplus_{n\ge 0}\SI(C)_{n\theta}$ when $\theta$ is chosen so that the stable locus is nonempty.
4967: 
4968: \begin{lemma}[Function field of the moduli equals the field of rational invariants]
4969: \label{lem:cc_function_field_equals_invariants}
4970: Let $C\subseteq\rep(A,\bd)$ be an irreducible component and let $\theta\in\ZZ^{Q_0}$ be a weight such that the $\theta$--stable locus $C^s_\theta$ is nonempty.
4971: Then the moduli space
4972: \[
4973: M(C)^{ss}_\theta \ :=\ \operatorname{Proj}\!\Bigl(\bigoplus_{n\ge 0}\SI(C)_{n\theta}\Bigr)
4974: \]
4975: contains an open subset $M(C)^{s}_\theta$ which is a geometric quotient of $C^s_\theta$ by $\PGL(\bd)$, and one has an identification of function fields
4976: \[
4977: k(C)^{\GL(\bd)}\ \cong\ k\!\bigl(M(C)^{ss}_\theta\bigr).
4978: \]
4979: \end{lemma}
4980: 
4981: \begin{proof}[Proof (recorded in \cite{CarrollChindris2012InvariantGentle})]
4982: This is precisely the content of King-style GIT for quiver moduli, and is stated as Remark~3 in \cite{CarrollChindris2012InvariantGentle}:
4983: $M(C)^{s}_\theta$ is the rational quotient of $C$ by $\GL(\bd)$, hence the corresponding function fields agree.
4984: \end{proof}
4985: 
4986: \paragraph{Carroll--Chindris geometric traits for acyclic gentle algebras.}
4987: For triangular (acyclic) gentle algebras $A=kQ/I$, Carroll--Chindris prove two structural results that are especially relevant for our later ``determinant $\Rightarrow$ holomorphy'' logic:
4988: \begin{enumerate}[label=(\alph*)]
4989: \item \textbf{$\GL$--rational invariants are rational.}
4990: For every irreducible component $C\subseteq\rep(A,\bd)$, the invariant field $k(C)^{\GL(\bd)}$ is a purely transcendental extension of $k$, with transcendence degree determined by the \emph{generic decomposition} of $C$ into indecomposable regular components \cite[Theorem~1(1)]{CarrollChindris2012InvariantGentle}.
4991: \item \textbf{Regular moduli are products of projective spaces.}
4992: If $C$ is an irreducible regular component and $\theta$ is chosen so that $C^{ss}_\theta\neq\emptyset$ and the $\theta$--stable summands are regular, then $M(C)^{ss}_\theta$ is a product of projective spaces \cite[Theorem~1(2)]{CarrollChindris2012InvariantGentle}.
4993: \end{enumerate}
4994: 
4995: \paragraph{Determinantal coordinates.}
4996: Even more concretely, Carroll--Chindris exhibit a transcendence basis for $k(C)^{\GL(\bd)}$ in terms of \emph{ratios of generalized Schofield determinantal semi-invariants} \cite[Theorem~2]{CarrollChindris2012InvariantGentle}.
4997: This is exactly the algebraic structure we want for the analytic package later:
4998: \[
4999: \text{``$\GL$--invariant rational function''} \quad=\quad
5000: \text{``ratio of determinants''}.
5001: \]
5002: 
5003: \begin{remark}[Why this matters for holomorphy in the Hilbert--P\'olya program]
5004: The relevance for holomorphy is twofold.
5005: \begin{enumerate}[label=(\roman*)]
5006: \item \textbf{Determinants are holomorphic in analytic parameters.}
5007: Schofield semi-invariants are determinants of explicit linear maps built functorially from $\rep(A,\bd)$ (cf.\ Theorem~\ref{thm:determinantal_generators_SI}).
5008: Whenever the underlying matrix entries depend holomorphically on a spectral parameter $s$ (e.g.\ through weights like $u_p=p^{-s}$ or more general ``clock'' phases), the numerator and denominator determinants are holomorphic in $s$.
5009: \item \textbf{Pole loci are geometric boundary divisors.}
5010: On a product of projective spaces, the possible poles/zeros of a ratio of homogeneous coordinates occur only along explicit boundary divisors.
5011: Under toric degeneration, these divisors become coordinate hyperplanes, so ``no poles'' becomes a statement about \emph{nonnegativity of exponent vectors} in an affine semigroup.
5012: This is the geometric origin of the semigroup-algebra holomorphy criterion in Proposition~\ref{prop:toric_holomorphy_criterion}.
5013: \end{enumerate}
5014: \end{remark}
5015: 
5016: \paragraph{Hilbert--P\'olya / Hilbert--Polya bridge.}
5017: The relevance of the Carroll--Chindris picture for the \emph{Hilbert--P\'olya (Hilbert--Polya)} program is that it provides, on the \emph{representation-theoretic side}, a \emph{canonical determinantal coordinate system}:
5018: the generic $\GL(\bd)$--quotient $C/\!/\GL(\bd)$ is controlled by ratios of Schofield-type determinants.
5019: In the analytic part of the manuscript we package these ratios into \emph{spectral determinants} of self-adjoint (or symmetrizable) transfer operators; the point is that the \emph{same objects} now serve two roles:
5020: \begin{enumerate}[label=(\roman*)]
5021: \item as algebraic coordinates on moduli (hence rational/toric control of poles and zeros as divisors), and
5022: \item as Euler-factor building blocks of operator determinants (hence holomorphy and zero-location by operator theory).
5023: \end{enumerate}
5024: This is the explicit place where invariant theory feeds the Hilbert--P\'olya operator construction rather than appearing as a parallel narrative.
5025: 
5026: 
5027: 
5028: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
5029: \subsubsection{Semigroup algebras of holomorphic $L$--functions and a toric holomorphy criterion}
5030: Fix a point $s_0\in\mathbb{C}$ (typically $s_0\neq 0,1$).
5031: Consider the multiplicative semigroup of Artin $L$--functions that are holomorphic at $s_0$.
5032: 
5033: \begin{definition}[Holomorphy semigroup at $s_0$]
5034: \label{def:holomorphy_semigroup}
5035: Let $\mathcal{L}$ be the set of Artin $L$--functions for a fixed extension $K/F$ (or a fixed global Galois group $G$).
5036: Define
5037: \[
5038: H(s_0)\ :=\ \{\,L(s,\chi)\in \mathcal{L}\ :\ L(s,\chi)\ \text{is holomorphic at }s=s_0\,\},
5039: \]
5040: with multiplication induced by multiplication of meromorphic functions.
5041: \end{definition}
5042: 
5043: \begin{definition}[Semigroup algebra of holomorphy]
5044: Given a field $k\subset \mathbb{C}$, define the semigroup algebra
5045: \[
5046: k[H(s_0)]\ :=\ \Bigl\{\sum_{\ell} c_\ell\,h_\ell\ :\ c_\ell\in k,\ h_\ell\in H(s_0)\Bigr\},
5047: \]
5048: with multiplication induced by $H(s_0)$.
5049: \end{definition}
5050: 
5051: The point is that $k[H(s_0)]$ is naturally an \emph{affine semigroup ring} once one fixes a finite generating set of cyclic $L$--functions (coming from Brauer induction).
5052: Affine semigroup rings are precisely coordinate rings of affine toric varieties.
5053: 
5054: \begin{proposition}[Toric holomorphy criterion (algebraic form)]
5055: \label{prop:toric_holomorphy_criterion}
5056: Assume that:
5057: \begin{enumerate}[label=(\alph*)]
5058: \item the cyclic/degree-one $L$--functions appearing in \eqref{eq:artin_L_monomial} generate $H(s_0)$ as a semigroup, and
5059: \item the semigroup algebra $k[H(s_0)]$ is (graded) isomorphic to a polynomial ring $k[x_1,\dots,x_r]$.
5060: \end{enumerate}
5061: Then every Artin $L$--function $L(s,\rho)$ that is \emph{meromorphic} at $s_0$ is in fact \emph{holomorphic} at $s_0$ unless it contains the trivial character as a summand (the known pole case).
5062: In particular, Artin holomorphy at $s_0$ reduces to checking that $k[H(s_0)]$ is polynomial.
5063: \end{proposition}
5064: 
5065: \begin{proof}[Idea]
5066: If $k[H(s_0)]\cong k[x_1,\dots,x_r]$, then the semigroup $H(s_0)$ is free on $r$ generators and has unique factorization in the multiplicative sense.
5067: A monomial expression with integer exponents in the generators is holomorphic at $s_0$ if and only if all exponents are $\ge 0$ (negative exponents would introduce poles because generators are holomorphic and nonvanishing at $s_0$).
5068: Therefore any cancellation mechanism that would allow a negative exponent while remaining holomorphic is forbidden by freeness/unique factorization.
5069: This pins down the only possible poles to the known trivial-character factors.
5070: \end{proof}
5071: 
5072: \begin{remark}[Where surface algebras enter]
5073: Theorem~14.3 of \cite{Schreiber2018SurfaceAlgebrasI} asserts that the relevant (semi)invariant rings for surface-order representation varieties are affine toric (semigroup) rings and that regular moduli components are products of projective spaces (often $\mathbb{P}^1$ in the band-module regime).
5074: In the cleanest cases, these toric coordinate rings \emph{are} polynomial rings, and Proposition~\ref{prop:toric_holomorphy_criterion} becomes a concrete holomorphy certificate.
5075: Even when the ring is not polynomial, toric normality/Cohen--Macaulayness gives strong control over factorization and valuation semigroups, which is the correct algebraic substrate for the pole-cancellation problem.
5076: \end{remark}
5077: 
5078: \subsubsection{How this feeds the Hilbert--Pólya/Hurwitz closure}
5079: From the perspective of Chapter~\ref{ch:hilbertpolya_density}, the only analytic facts needed about $\Lambda(s,\varpi)$ are:
5080: \begin{enumerate}[label=(\roman*)]
5081: \item holomorphy in the open strip $0<\Re(s)<1$, and
5082: \item a convergent logarithmic derivative expansion \eqref{eq:log_derivative_generic} in $\Re(s)>1$.
5083: \end{enumerate}
5084: The semigroup/toric perspective is precisely what makes (i) plausible from the surface-order model:
5085: it turns holomorphy into a \emph{finitary} statement about exponent vectors in a semigroup.
5086: Once holomorphy is granted, the Hurwitz closure theorem (Theorem~\ref{thm:hurwitz_hp_implies_grh}) becomes the \emph{final analytic step}:
5087: all remaining work is pushed into constructing self-adjoint determinantal approximants and proving their convergence (Theorem~\ref{thm:determinantal_HP_GRH}).
5088: 
5089: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
5090: \subsection{Back to spherical varieties: why toric degeneration is the correct organizing principle}
5091: \label{sec:back_to_spherical_toric_det}
5092: 
5093: The spherical/toric framework is not limited to quivers.
5094: A general theorem of Alexeev--Brion \cite{AlexeevBrion2004ToricDegenerations} asserts that any affine (resp.\ polarized projective) spherical variety admits a flat degeneration to an affine (resp.\ polarized projective) toric variety.
5095: In practice this is implemented by filtrations coming from highest-weight combinatorics (string polytopes, Newton--Okounkov bodies, etc.).
5096: We will not reprove those deep results here; for us they serve as an organizing principle:
5097: \begin{quote}
5098: \emph{once one has determinantal generators, one should search for a filtration/degeneration where those determinants become monomials.}
5099: \end{quote}
5100: In the gentle/surface setting, the LGV interpretation of minors and the Bessenrodt--Holm cycle determinant formula give precisely the kind of explicit control that makes the degeneration \emph{computable} rather than merely existential.
5101: 
5102: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
5103: 
5104: 
5105: \part{Geometric Methods: Coverings and Hom-Controlled Functors}
5106: 
\chapter{Hom-controlled Functors and Covering Theory}\label{ch:homcontrolled} · lines 5107–5463
5107: \chapter{Hom-controlled Functors and Covering Theory}\label{ch:homcontrolled}
5108: 
5109: This chapter upgrades the earlier, mostly combinatorial use of coverings (Chapter~2.5--2.6) into a
5110: representation-theoretic \emph{control principle}: many hard questions about the module category of a
5111: (surface/gentle) algebra $\Lambda$ can be reduced to easier questions on a (typically infinite) covering
5112: $\widetilde{\Lambda}$, provided one works with functors that are \emph{Hom-controlled} in the sense of
5113: Zwara.
5114: 
5115: \section{Hom-controlled functors: the control axiom}
5116: Let $\mathcal{A},\mathcal{B}$ be $k$-linear additive categories (for us $\mathcal{A}=\mathrm{mod}\text{-}\widetilde{\Lambda}$
5117: and $\mathcal{B}=\mathrm{mod}\text{-}\Lambda$), and let $F:\mathcal{A}\to\mathcal{B}$ be an additive functor.
5118: 
5119: \begin{definition}[Hom-controlled functor (Zwara-style)]
5120: We say that $F$ is \emph{Hom-controlled} if there exists a (typically finite) indexing set $\Omega=\Omega(X,Y)$
5121: and a canonical decomposition
5122: \[
5123: \mathrm{Hom}_{\mathcal{B}}(F X, F Y)\;\cong\;\bigoplus_{\omega\in\Omega}\mathrm{Hom}_{\mathcal{A}}(X, \omega\cdot Y)
5124: \]
5125: functorial in $(X,Y)$, where $\omega\cdot Y$ denotes a (deck-group) action on objects in $\mathcal{A}$,
5126: and such that composition in $\mathcal{B}$ corresponds to the obvious convolution on the right-hand side.
5127: \end{definition}
5128: 
5129: \begin{remark}[Why this is the right notion here]
5130: In Galois covering situations, $\Omega$ is (a set of representatives of) the covering group $G$ and
5131: $\omega\cdot Y$ is the translate $gY$. The point is not just a vector-space isomorphism: \emph{functoriality}
5132: and \emph{composition-compatibility} mean that vanishing/nonvanishing of morphisms, dimensions of Hom,
5133: and irreducibility properties can be read off from the cover.
5134: \end{remark}
5135: 
5136: \subsection{Zwara's Hom-order and degeneration heuristics}
5137: A robust way to organize orbit closures in representation varieties is via \emph{Hom-dimension inequalities}.
5138: Zwara's key observation (in various forms, depending on finiteness hypotheses) is that degenerations force
5139: monotonicity of Hom-dimensions:
5140: \[
5141: M \leadsto N \quad\Longrightarrow\quad \dim_k\mathrm{Hom}_\Lambda(X,M)\;\le\;\dim_k\mathrm{Hom}_\Lambda(X,N)
5142: \quad\text{for all }X,
5143: \]
5144: and similarly for $\mathrm{Hom}(M,X)$. In the gentle/surface regime we use this \emph{not} as an all-purpose
5145: classification theorem, but as a \emph{control heuristic}:
5146: \begin{itemize}
5147: \item lift the problem to $\widetilde{\Lambda}$ (where indecomposables are strings/bands and Hom is combinatorial),
5148: \item compute Hom-dimensions upstairs,
5149: \item push the inequalities (and their sharpness) back downstairs using Hom-controlledness.
5150: \end{itemize}
5151: This is particularly effective when $\Lambda$ decomposes face-wise into circular-complex factors
5152: (Chapter~21--22): the cover replaces cyclic constraints by line constraints.
5153: 
5154: \section{(1) Cyclic quivers and circular-complex algebras}
5155: \subsection{The covering picture}
5156: Let $Q=\widetilde{A}_n$ be the oriented $n$-cycle with radical-square-zero relations (so representations are
5157: \emph{circular complexes}, Chapter~21). Its universal cover is the bi-infinite line quiver $\widetilde{Q}\simeq A_\infty$
5158: with the lifted relations, and the deck group is $\mathbb{Z}$ acting by translation.
5159: 
5160: Write $\Lambda=\;kQ/I$ and $\widetilde{\Lambda}=k\widetilde{Q}/\widetilde{I}$. The push-down functor
5161: \[
5162: F:\mathrm{mod}\text{-}\widetilde{\Lambda}\longrightarrow \mathrm{mod}\text{-}\Lambda
5163: \]
5164: is induced by identifying vertices modulo $n$ and summing the translated structure maps.
5165: 
5166: \subsection{Hom-control for the push-down}
5167: In this setting, $F$ is Hom-controlled with $\Omega\simeq\mathbb{Z}$ (or a finite window when supports are
5168: finite), and one has a canonical decomposition
5169: \[
5170: \mathrm{Hom}_\Lambda(FX,FY)\;\cong\;\bigoplus_{t\in\mathbb{Z}}\mathrm{Hom}_{\widetilde{\Lambda}}(X, \tau^t Y),
5171: \]
5172: where $\tau^t$ is the translation action on the cover (deck action).
5173: Consequences:
5174: \begin{itemize}
5175: \item \textbf{Hom computations reduce to string calculus upstairs.} For $\widetilde{\Lambda}$, indecomposables are
5176: strings (and, in periodic situations, bands), so $\mathrm{Hom}$ is computed by overlaps of words.
5177: \item \textbf{AR-components downstairs are orbit-quotients upstairs.} Components in the Auslander--Reiten quiver of
5178: $\Lambda$ arise as $\mathbb{Z}$-orbit quotients of components for $\widetilde{\Lambda}$; this is the clean mechanism by
5179: which tubes appear in cyclic settings.
5180: \item \textbf{Degeneration control.} Zwara-type Hom-inequalities can be tested upstairs and then transported
5181: downstairs using the decomposition formula.
5182: \end{itemize}
5183: 
5184: \section{(2) Self-injective algebras and AR-translation via coverings}
5185: Many surface-adjacent self-injective algebras (notably symmetric special-biserial algebras such as Brauer-graph
5186: algebras, Chapter~34) admit presentations as \emph{orbit algebras} of repetitive constructions or as quotients of
5187: gentle covers. In such cases, the stable module category $\underline{\mathrm{mod}}\text{-}\Lambda$ carries a triangulated
5188: structure and the AR-translation satisfies $\tau \simeq \Omega^2\nu$ (with $\nu$ the Nakayama functor; for symmetric
5189: algebras, $\nu\simeq\mathrm{id}$, hence $\tau\simeq\Omega^2$).
5190: 
5191: \subsection{Hom-controlled lift of almost split sequences}
5192: Let $\widetilde{\Lambda}$ be a (locally gentle) cover of a self-injective $\Lambda$ with deck group $G$.
5193: Under mild finiteness assumptions on supports, the push-down $F$ is Hom-controlled and preserves
5194: irreducibility of morphisms up to $G$-orbits. In practice this means:
5195: \begin{itemize}
5196: \item almost split sequences in $\mathrm{mod}\text{-}\Lambda$ can be lifted to $G$-equivariant families of almost split
5197: sequences upstairs, and
5198: \item the AR-quiver of $\Lambda$ is obtained from the AR-quiver of $\widetilde{\Lambda}$ by identifying vertices and
5199: arrows along $G$-orbits (a stable translation-quiver quotient).
5200: \end{itemize}
5201: 
5202: \subsection{Connection to Paquette et al.\ theorems and the surface/AR dictionary}
5203: The manuscript already flags a ``Liu--Paquette--'' theorem as the entry point for describing Auslander--Reiten
5204: quivers of gentle surface algebras (Chapter~9 in the roadmap). The Hom-controlled viewpoint supplies the
5205: \emph{mechanism} behind such theorems in the two settings mentioned thus far:
5206: \begin{enumerate}
5207: \item \textbf{Cyclic quivers / circular complexes:} the AR-components predicted by the surface combinatorics
5208: (face cycles, anti-cycles, and their lengths) arise as orbit-quotients of the universal cover, hence can be
5209: recovered from string/band combinatorics plus the deck action.
5210: \item \textbf{Self-injective surface-adjacent algebras:} the stable AR-quiver is governed by the repetitive (or
5211: covering) construction; Paquette-type surface/arc models for $\mathrm{mod}\text{-}\Lambda$ (and for the derived/stable
5212: categories) can be interpreted as giving a geometric fundamental domain for the covering action on the AR
5213: quiver, with $\tau$ identified with the surface ``rotation''/shift on arcs.
5214: \end{enumerate}
5215: 
5216: \begin{remark}[What to check in computations]
5217: For a concrete algebra in this manuscript (e.g.\ a double simple cycle order or a Brauer graph algebra),
5218: to \emph{use} this chapter one typically:
5219: (i) writes an explicit covering quiver $\widetilde{Q}$ (often the universal cover),
5220: (ii) identifies the deck group action $G$,
5221: (iii) computes strings/bands and Hom-spaces upstairs,
5222: (iv) quotients by $G$ to read off AR-components and mesh relations downstairs,
5223: and (v) uses Zwara's Hom-inequalities as a sanity check on proposed degenerations or closure relations in the
5224: representation varieties.
5225: \end{remark}
5226: 
5227: 
5228: %
5229: 					%
5230: 					%
5231: 					%
5232: 					%
5233: 					%
5234: 					
5235: % === BEGIN AR TIKZ + PROOFS INSERT ===
5236: \section{Hom-controlled push-down along Galois coverings (Zwara--Riedtmann)}
5237: \label{sec:homcontrolled_pushdown_proofs}
5238: 
5239: \subsection{Setup: coverings of bound quivers and the push-down functor}
5240: Let $k$ be algebraically closed. Let $(\widetilde Q,\widetilde I)\to(Q,I)$ be a (connected) \emph{Galois covering}
5241: of bound quivers with deck group $G$ (in the sense of Riedtmann's covering theory for locally bounded categories).
5242: Write $\widetilde\Lambda := k\widetilde Q/\widetilde I$ and $\Lambda := kQ/I$.
5243: Assume $\widetilde\Lambda$ is \emph{locally bounded} and \emph{locally finite} so that the categories of finitely
5244: presented representations $\rep^+(\widetilde\Lambda)$ and $\rep(\Lambda)$ are Krull--Schmidt and Hom-finite.
5245: 
5246: There is a canonical \emph{push-down} (a.k.a.\ covering) functor
5247: \[
5248: F_\lambda:\rep^+(\widetilde\Lambda)\longrightarrow \rep(\Lambda),
5249: \]
5250: defined on objects by \emph{orbit-summing along fibers}:
5251: for a vertex $x\in Q_0$, choose a lift $\tilde x\in\widetilde Q_0$ and set
5252: \[
5253: (F_\lambda M)(x)\ :=\ \bigoplus_{g\in G} M(g\tilde x),
5254: \qquad
5255: (F_\lambda M)(a)\ :=\ \bigoplus_{g\in G} M(g\tilde a),
5256: \]
5257: where $\tilde a$ is a chosen lift of $a$. One checks independence of choices by the $G$-equivariance of the covering.
5258: 
5259: \subsection{Zwara's ``Hom-control'' identity for coverings}
5260: The key mechanism is that $F_\lambda$ is exact and controls Homs by a \emph{direct-sum decomposition} over the deck group.
5261: 
5262: \begin{theorem}[Hom-controlled decomposition for a Galois push-down]
5263: \label{thm:homcontrolled_galois}
5264: Let $F_\lambda:\rep^+(\widetilde\Lambda)\to\rep(\Lambda)$ be the push-down of a Galois covering with deck group $G$.
5265: For any $M,N\in\rep^+(\widetilde\Lambda)$ there is a natural isomorphism
5266: \[
5267: \Hom_\Lambda(F_\lambda M,\;F_\lambda N)\ \cong\ \bigoplus_{g\in G}\Hom_{\widetilde\Lambda}(M,\;{}^{g}N),
5268: \]
5269: where ${}^{g}N$ denotes the $G$-translate (pullback along the deck transformation $g$).
5270: In particular,
5271: \[
5272: \dim_k\Hom_\Lambda(F_\lambda M,F_\lambda N)\ =\ \sum_{g\in G}\dim_k\Hom_{\widetilde\Lambda}(M,{}^{g}N),
5273: \]
5274: so $F_\lambda$ is Hom-controlled in the strong sense: the Hom-dimension is determined by finitely many
5275: translated Hom-dimensions on the cover.
5276: \end{theorem}
5277: 
5278: \begin{proof}
5279: Write $x\in Q_0$ and fix lifts $\tilde x\in\widetilde Q_0$.
5280: By definition $(F_\lambda M)(x)=\bigoplus_{g\in G}M(g\tilde x)$ and similarly for $N$.
5281: A $\Lambda$-morphism $\varphi:F_\lambda M\to F_\lambda N$ is a collection of linear maps
5282: $\varphi_x:(F_\lambda M)(x)\to(F_\lambda N)(x)$ commuting with all arrow maps.
5283: Writing $\varphi_x$ in block form with respect to the direct-sum decompositions along $G$,
5284: we can project to the $(1,g)$-block
5285: \[
5286: \varphi_{x}^{(g)}:\ M(\tilde x)\longrightarrow N(g\tilde x).
5287: \]
5288: Naturality with respect to arrows forces these blocks to form a morphism of $\widetilde\Lambda$-representations
5289: $M\to {}^{g}N$. Conversely, given a family $(f_g:M\to {}^{g}N)_{g\in G}$, define $\varphi_x$ by putting the
5290: $(h,hg)$-block equal to $({}^{h}f_g)_{x}:M(h\tilde x)\to N(hg\tilde x)$; the $G$-equivariance of the covering
5291: ensures this is well-defined and yields a $\Lambda$-morphism.
5292: These constructions are inverse to each other and are compatible with composition, giving the stated isomorphism.
5293: \end{proof}
5294: 
5295: \subsection{Geometric consequence: smoothness on module schemes}
5296: Let $\rep(\Lambda,\mathbf d)$ denote the representation variety of dimension vector $\mathbf d$ (and similarly on the cover).
5297: Zwara's theory shows that Hom-control implies smoothness of the induced morphisms on module schemes and rank schemes.
5298: 
5299: \begin{corollary}[Smoothness along covering images]
5300: \label{cor:smooth_covering}
5301: Fix dimension data so that $F_\lambda$ maps $\rep^+(\widetilde\Lambda,\tilde{\mathbf d})$ into $\rep(\Lambda,\mathbf d)$.
5302: Then the induced morphism of schemes (on the corresponding strata)
5303: \[
5304: f_{\mathbf d}:\rep^+(\widetilde\Lambda,\tilde{\mathbf d})\longrightarrow \rep(\Lambda,\mathbf d)
5305: \]
5306: is smooth. In particular, for any $M$ on the cover, the étale-local singularity type of the orbit closure
5307: $\overline{\mathcal O_{F_\lambda M}}$ in $\rep(\Lambda,\mathbf d)$ agrees with that of
5308: $\overline{\mathcal O_M}$ in $\rep(\widetilde\Lambda,\tilde{\mathbf d})$ up to a smooth factor.
5309: \end{corollary}
5310: 
5311: \begin{proof}
5312: The tangent space at a representation can be identified with derivations modulo inner derivations,
5313: and the obstruction space is governed by $\Ext^1$. The decomposition of Theorem~\ref{thm:homcontrolled_galois}
5314: shows that the linear maps controlling first-order deformations split into a direct sum over $G$,
5315: hence the differential of $f_{\mathbf d}$ is surjective (formally smooth). Finite-type hypotheses then imply smoothness.
5316: This is precisely the covering-specialized instance of Zwara's smoothness theorem for Hom-controlled functors.
5317: \end{proof}
5318: 
5319: \section{Auslander--Reiten components and TikZ illustrations}
5320: \label{sec:ar_tikz}
5321: 
5322: This section provides \emph{explicit} translation-quiver pictures for the AR component types that occur in
5323: gentle/surface settings: (i) string components with local meshes (diamonds), (ii) homogeneous tubes for bands,
5324: and (iii) components containing projectives/injectives (preprojective/preinjective).
5325: 
5326: \subsection{String components: a 9-vertex mesh (hook/cohook diamond)}
5327: In a gentle algebra, irreducible maps between string modules are generated by the elementary operations
5328: of adding/removing a hook or a cohook at either end of the defining string.
5329: When both ends allow both moves, the local AR mesh consists of 9 indecomposables.
5330: 
5331: \begin{figure}[t]
5332: 	\centering
5333: 	\begin{tikzpicture}[scale=1.0, every node/.style={circle, draw, inner sep=1.6pt}]
5334: 		% 9 vertices in left-to-right diamond (45° rotation)
5335: 		% Leftmost vertex
5336: 		\node (x) at (-2.4, 0) {$X$};
5337: 		
5338: 		% Second layer (up-left, center-left, down-left)
5339: 		\node (hl) at (-1.2, 1.2) {$H_LX$};
5340: 		\node (cl) at (-1.2, -1.2) {$C_LX$};
5341: 		
5342: 		% Third layer (up-center, center, down-center)
5343: 		\node (hlhr) at (0, 2.4) {$H_LH_RX$};
5344: 		\node (clhr) at (0, 0) {$C_LH_RX$};
5345: 		\node (hlcr) at (0, -2.4) {$H_LC_RX$};
5346: 		
5347: 		% Fourth layer (up-right, center-right, down-right)
5348: 		\node (hr) at (1.2, 1.2) {$H_RX$};
5349: 		\node (cr) at (1.2, -1.2) {$C_RX$};
5350: 		
5351: 		% Rightmost vertex
5352: 		\node (clcr) at (2.4, 0) {$C_LC_RX$};
5353: 		
5354: 		% Horizontal flow from left to right
5355: 		\draw[->] (x) -- (hl);
5356: 		\draw[->] (x) -- (cl);
5357: 		\draw[->] (hl) -- (hlhr);
5358: 		\draw[->] (hl) -- (clhr);
5359: 		\draw[->] (cl) -- (clhr);
5360: 		\draw[->] (cl) -- (hlcr);
5361: 		\draw[->] (hlhr) -- (hr);
5362: 		\draw[->] (clhr) -- (hr);
5363: 		\draw[->] (clhr) -- (cr);
5364: 		\draw[->] (hlcr) -- (cr);
5365: 		\draw[->] (hr) -- (clcr);
5366: 		\draw[->] (cr) -- (clcr);
5367: 		
5368: 		% τ-translation arc (left to right, outer curve)
5369: 		\draw[->, dashed] (clcr) .. controls (-0.75, 0) .. (x) 
5370: 		node[midway, left=0.5cm] {$\tau$};
5371: 	\end{tikzpicture}
5372: 	\caption{A schematic local AR mesh (diamond) in a string component. Solid arrows are irreducibles generated by hook/cohook moves; the dashed arrow indicates the Auslander--Reiten translation $\tau$ between opposite corners.}
5373: 	\label{fig:ar_diamond}
5374: \end{figure}
5375: 
5376: \subsection{Band components: a homogeneous tube}
5377: Band modules form 1-parameter families; the corresponding stable component is a tube (a translation quiver of type
5378: $\mathbb Z A_\infty/\langle\tau^r\rangle$ for some rank $r$, with $r=1$ in the homogeneous case).
5379: 
5380: \begin{figure}[t]
5381: \centering
5382: \begin{tikzpicture}[scale=1.0, every node/.style={circle, draw, inner sep=1.2pt}]
5383: % two rows representing a tube, identified cyclically
5384: \foreach \i in {0,...,7}{
5385:   \node (a\i) at (\i*1.0,0) {$M_{\i}$};
5386:   \node (b\i) at (\i*1.0,-1.4) {$\tau M_{\i}$};
5387:   \draw[->] (b\i) -- (a\i);
5388:   \ifnum\i>0
5389:     \pgfmathtruncatemacro{\j}{\i-1}
5390:     \draw[->] (a\j) -- (a\i);
5391:     \draw[->] (b\j) -- (b\i);
5392:   \fi
5393: }
5394: % wrap arrows (tube identification)
5395: \draw[->] (a7) to[bend left=25] (a0);
5396: \draw[->] (b7) to[bend left=25] (b0);
5397: \end{tikzpicture}
5398: \caption{A schematic homogeneous tube component: $\tau$ acts by shifting one ``row'' down; horizontal arrows represent irreducible maps within the tube. The wrap-around indicates the cyclic identification (tube periodicity).}
5399: \label{fig:ar_tube}
5400: \end{figure}
5401: 
5402: \subsection{Preprojective/preinjective components}
5403: Components containing projectives/injectives in gentle/surface algebras are typically of
5404: $\mathbb Z A_\infty$-type (or finite truncations), with projectives at one ``end''.
5405: 
5406: \begin{figure}[t]
5407: \centering
5408: \begin{tikzpicture}[scale=1.0, every node/.style={circle, draw, inner sep=1.2pt}]
5409: \node (p0) at (0,0) {$P_0$};
5410: \node (p1) at (1.6,0.8) {$P_1$};
5411: \node (p2) at (3.2,1.6) {$P_2$};
5412: \node (p3) at (4.8,2.4) {$P_3$};
5413: 
5414: \node (m1) at (1.6,-0.8) {$M_1$};
5415: \node (m2) at (3.2,0.0) {$M_2$};
5416: \node (m3) at (4.8,0.8) {$M_3$};
5417: 
5418: \draw[->] (p0) -- (p1);
5419: \draw[->] (p1) -- (p2);
5420: \draw[->] (p2) -- (p3);
5421: 
5422: \draw[->] (p0) -- (m1);
5423: \draw[->] (m1) -- (m2);
5424: \draw[->] (m2) -- (m3);
5425: \draw[->] (p1) -- (m2);
5426: \draw[->] (p2) -- (m3);
5427: 
5428: \draw[->, dashed] (m3) to[bend left=25] (m2) node[midway, right] {$\tau^{-1}$};
5429: \end{tikzpicture}
5430: \caption{A schematic preprojective component (finite window): projectives $P_i$ lie on a boundary; irreducible maps propagate ``away'' from projectives. The dashed arrow indicates the $\tau^{-1}$ direction schematically.}
5431: \label{fig:ar_preprojective}
5432: \end{figure}
5433: 
5434: \section{Self-injective algebras: stable AR translation and the Nakayama functor}
5435: \label{sec:selfinjective_tau}
5436: 
5437: Let $\Lambda$ be a finite-dimensional self-injective algebra. Write $\nu$ for the Nakayama functor
5438: $\nu := D\Hom_\Lambda(-,\Lambda)$ and $\Omega$ for the syzygy functor on the stable category $\underline{\mathrm{mod}}\,\Lambda$.
5439: 
5440: \begin{theorem}[Stable AR translation for self-injective algebras]
5441: \label{thm:tau_selfinjective}
5442: In the stable category $\underline{\mathrm{mod}}\,\Lambda$ of a self-injective algebra, the Auslander--Reiten translation satisfies
5443: \[
5444: \tau \ \cong\ \Omega^2\circ \nu.
5445: \]
5446: If $\Lambda$ is moreover symmetric (so $\nu\cong \mathrm{Id}$), then $\tau \cong \Omega^2$.
5447: \end{theorem}
5448: 
5449: \begin{proof}
5450: For any finite-dimensional algebra, $\tau \cong D\Tr$ on nonprojective modules, where $\Tr$ is the transpose.
5451: For self-injective $\Lambda$, the stable category is Frobenius and $\Omega$ is an autoequivalence.
5452: One identifies $D\Tr$ with $\Omega^2\nu$ by comparing the standard projective presentation
5453: $P_1\to P_0\to M\to 0$ and its dual, using that injectives coincide with projectives and that $\nu$ accounts for the
5454: twist between left and right projectives in the duality. Concretely, the AR sequence ending in $M$ is obtained from a
5455: minimal projective resolution of $M$ by splicing, and the middle term identifies with $\Omega^{-1}\nu^{-1}\Omega M$,
5456: yielding $\tau\simeq \Omega^2\nu$. Symmetry implies $\nu\simeq \mathrm{Id}$, giving $\tau\simeq\Omega^2$.
5457: \end{proof}
5458: 
5459: % === END AR TIKZ + PROOFS INSERT ===
5460: 
5461: 
5462: \part{Total Positivity, Wiring Diagrams, and Positivity of Energy}
5463: 
\chapter{Braid Group Action on Local Roots of Unity} · lines 5464–5766
5464: 					\chapter{Braid Group Action on Local Roots of Unity}
5465: 					
5466: 					\begin{marginfigure}%
5467: %						\includegraphics[width=\linewidth]{helix}
5468: %						\caption{This is a margin figure.  The helix is defined by 
5469: %							$x = \cos(2\pi z)$, $y = \sin(2\pi z)$, and $z = [0, 2.7]$.  The figure was
5470: %							drawn using Asymptote (\protect\url{http://asymptote.sf.net/}).}
5471: %						\label{fig:marginfig}
5472: 					\end{marginfigure}
5473: 					
5474: 					\section{Zelevinsky's Total Positivity and Wiring Diagrams}
5475: \label{sec:zelevinsky_total_positivity}
5476: 
5477: This section provides a \emph{positivity technology} that we will reuse in several later places:
5478: \begin{itemize}
5479: \item in the QFT discussion (Wick rotation/transfer matrices), where positivity of Euclidean evolution underlies positivity of energy,
5480: \item in the renormalization-as-channel viewpoint, where we want certificates that coarse-grained transfer maps have controlled spectra, and
5481: \item in the Hilbert--Pólya/GRH program, where the analytic difficulty is to extract a \emph{self-adjoint} generator from arithmetic/geometric input without hidden tuning.
5482: \end{itemize}
5483: The relevant mathematics is the theory of \emph{total positivity} and its combinatorial parametrization by \emph{wiring diagrams} (planar networks), developed in depth by
5484: Berenstein--Fomin--Zelevinsky and Fomin--Zelevinsky \cite{BFZ1996TotallyPositive,FominZelevinsky2000TotalPositivity}, building on classical work of Gantmacher--Krein and Karlin \cite{Karlin1968TotalPositivity,Pinkus1996TotallyPositive}.
5485: 
5486: \subsection{Totally nonnegative and totally positive matrices}
5487: 
5488: \begin{definition}[Total nonnegativity and total positivity]
5489: A real matrix $A\in M_n(\R)$ is \emph{totally nonnegative} (TN) if every minor of $A$ is $\ge 0$.
5490: It is \emph{totally positive} (all minors strictly positive) if every minor of $A$ is $>0$.
5491: We write $A\in GL_n^{\ge 0}$ (resp.\ $GL_n^{>0}$) if $A$ is invertible and totally nonnegative (resp.\ totally positive).
5492: \end{definition}
5493: 
5494: Total positivity is much stronger than entrywise positivity.
5495: For example, a totally positive matrix is automatically invertible, and the inverse has a controlled sign pattern (checkerboard up to a positive diagonal scaling) \cite[Ch.\ 1--2]{Pinkus1996TotallyPositive}.
5496: Two structural properties make total positivity / total nonnegativity useful as a \emph{certificate} in physics-style constructions:
5497: 
5498: \begin{enumerate}[label=(\roman*)]
5499: \item \textbf{Spectral reality and simplicity.}
5500: Totally positive matrices are \emph{oscillatory} in the Gantmacher--Krein sense, which forces all eigenvalues to be real, positive, and simple.
5501: \item \textbf{Variation-diminishing (stability).}
5502: TN matrices are variation-diminishing: multiplying by a TN matrix cannot increase the number of sign changes of a vector, a discrete analogue of monotonicity/causality constraints.
5503: \end{enumerate}
5504: 
5505: We isolate the spectral statement we will use.
5506: 
5507: \begin{theorem}[Gantmacher--Krein: totally positive $\Rightarrow$ real, simple, positive spectrum]
5508: \label{thm:tp_real_spectrum}
5509: If $A\in GL_n^{>0}$ is totally positive, then $A$ is diagonalizable over $\R$ with eigenvalues
5510: \[
5511: \lambda_1>\lambda_2>\cdots>\lambda_n>0.
5512: \]
5513: Moreover, the eigenvectors have strictly controlled sign-variation (the $k$th eigenvector has exactly $k-1$ sign changes).
5514: \end{theorem}
5515: 
5516: \begin{proof}[Proof sketch / reference]
5517: A totally positive matrix is an \emph{oscillatory matrix}: it is TN and some power has all minors strictly positive.
5518: The classical Gantmacher--Krein oscillation theorem then implies that the spectrum is real, positive, and simple, with the stated nodal/sign-variation properties of eigenvectors.
5519: A modern reference is \cite[Thm.\ 2.5 and surrounding discussion]{Pinkus1996TotallyPositive}.
5520: \end{proof}
5521: 
5522: \subsection{Planar networks and the Lindstr\"om--Gessel--Viennot lemma}
5523: 
5524: Total nonnegativity admits a concrete combinatorial realization via planar directed networks.
5525: 
5526: \begin{definition}[Weighted planar network and its weight matrix]
5527: Fix $n$ sources $s_1,\dots,s_n$ and $n$ sinks $t_1,\dots,t_n$ arranged on the boundary of a planar disk in that cyclic order.
5528: Let $\mathcal{N}$ be a finite directed acyclic planar graph embedded in the disk, with all sources on one side and all sinks on the opposite side.
5529: Assign a nonnegative weight $w(e)\ge 0$ to each directed edge $e$.
5530: For a directed path $P=e_1\cdots e_m$, define its weight $w(P)=\prod_{r=1}^m w(e_r)$.
5531: The \emph{weight matrix} $A(\mathcal{N})\in M_n(\R)$ is
5532: \[
5533: A(\mathcal{N})_{ij}:=\sum_{P:s_i\rightsquigarrow t_j} w(P),
5534: \]
5535: the sum of weights of all directed paths from $s_i$ to $t_j$ (finite because the network is acyclic).
5536: \end{definition}
5537: 
5538: \begin{theorem}[Lindstr\"om--Gessel--Viennot (LGV)]
5539: \label{thm:LGV}
5540: For any subsets $I,J\subset\{1,\dots,n\}$ with $|I|=|J|=k$, the minor
5541: $\det A(\mathcal{N})_{I,J}$ equals the sum of weights of all families of $k$ pairwise vertex-disjoint directed paths connecting $\{s_i\}_{i\in I}$ to $\{t_j\}_{j\in J}$, with the appropriate sign determined by the induced matching.
5542: In particular, if all edge weights are nonnegative then every minor of $A(\mathcal{N})$ is nonnegative, hence $A(\mathcal{N})$ is TN.
5543: \end{theorem}
5544: 
5545: \begin{proof}[Proof sketch / reference]
5546: Expand the determinant by permutations.
5547: A sign-reversing involution cancels collections of paths with intersections, leaving only vertex-disjoint families.
5548: See \cite{GesselViennot1985Nonintersecting,Lindstrom1973Paths} for proofs.
5549: \end{proof}
5550: 
5551: \begin{corollary}[Wiring/network $\Rightarrow$ total nonnegativity]
5552: \label{cor:wiring_TN}
5553: If $\mathcal{N}$ is a weighted planar network with nonnegative edge weights, then its weight matrix $A(\mathcal{N})$ is totally nonnegative.
5554: If in addition every relevant nonintersecting family exists and all edge weights are \emph{strictly} positive, then $A(\mathcal{N})$ is totally positive.
5555: \end{corollary}
5556: 
5557: 
5558: \subsection{Positive Grassmannians and positive geometry: Postnikov and Arkani--Hamed et al.}
5559: \label{sec:positive_grassmannian_total_positivity}
5560: 
5561: The wiring-diagram technology above can be phrased more invariantly in the language of \emph{positive Grassmannians} and \emph{boundary measurement maps}.
5562: This matters for two reasons:
5563: \begin{enumerate}[label=(\roman*)]
5564: \item it supplies a conceptual explanation of why planar networks parametrize totally nonnegative objects (and why different network moves preserve positivity), and
5565: \item it provides a bridge to the modern ``positive geometry'' viewpoint in mathematical physics, where positivity is not merely a technical lemma but a \emph{structural axiom}.
5566: \end{enumerate}
5567: 
5568: \paragraph{Totally nonnegative Grassmannian.}
5569: For $0<k<n$, the \emph{totally nonnegative Grassmannian} $\mathbf{Gr}_{\ge 0}(k,n)$ is the subset of the real Grassmannian $\mathbf{Gr}(k,n)$ consisting of $k$-planes whose Pl\"ucker coordinates can be chosen to be all nonnegative (and not all zero).
5570: Equivalently, $\mathbf{Gr}_{\ge 0}(k,n)$ is the closure of the locus where all Pl\"ucker coordinates are strictly positive.
5571: 
5572: \begin{theorem}[Postnikov: boundary measurements parametrize cells of $\mathbf{Gr}_{\ge 0}(k,n)$]
5573: \label{thm:postnikov_boundary_measurement}
5574: Let $\mathcal{N}$ be a planar directed network embedded in a disk with $n$ labeled boundary vertices, with positive edge weights.
5575: Postnikov's \emph{boundary measurement map} assigns to $\mathcal{N}$ a point in $\mathbf{Gr}_{\ge 0}(k,n)$ (for an appropriate $k$ determined by the source/sink data) whose Pl\"ucker coordinates are given by weighted sums of collections of nonintersecting directed paths in $\mathcal{N}$.
5576: Moreover, every cell of $\mathbf{Gr}_{\ge 0}(k,n)$ admits such a parametrization by a planar network, and network moves (square moves, reductions) correspond to changing coordinates within the same cell decomposition.
5577: \end{theorem}
5578: 
5579: \begin{proof}[Reference]
5580: This is the main structural output of Postnikov's work connecting planar networks, total positivity, and Grassmannian stratifications; see \cite{Postnikov2006TotalPositivityNetworks}.
5581: \end{proof}
5582: 
5583: \begin{remark}[Relation to LGV and total nonnegativity]
5584: The LGV lemma (Theorem~\ref{thm:LGV}) is the ``matrix'' shadow of the boundary measurement story:
5585: minors of a path matrix are sums of nonintersecting families, hence nonnegative.
5586: Postnikov upgrades this from matrices to \emph{Pl\"ucker coordinates} and supplies a cell stratification and coordinate atlas on the positive locus.
5587: Thus, in this manuscript, whenever we realize a transfer matrix or a semi-invariant minor by a planar network,
5588: we are implicitly working in a chart on a positive Grassmannian cell.
5589: \end{remark}
5590: 
5591: \paragraph{Positive geometry in scattering amplitudes (Arkani--Hamed et al.).}
5592: The positive Grassmannian reappears in mathematical physics through the identification of on-shell diagrams with cells of $\mathbf{Gr}_{\ge 0}(k,n)$ and the emergence of canonical differential forms with logarithmic singularities on boundaries.
5593: In particular, Arkani--Hamed and collaborators build a dictionary between:
5594: \begin{center}
5595: on-shell diagrams $\leftrightarrow$ plabic graphs $\leftrightarrow$ positive Grassmannian cells,
5596: \end{center}
5597: and propose ``positive geometries'' (including the \emph{amplituhedron}) whose canonical forms encode amplitudes \cite{ArkaniHamedBourjailyCachazoGoncharovPostnikovTrnka2012PositiveGrassmannian,ArkaniHamedTrnka2013Amplituhedron,ArkaniHamedHodgesTrnka2014PositiveAmplitudes}.
5598: For our purposes, the relevance is methodological: it is an independent, physics-driven validation that \emph{positivity constraints organize large determinantal computations} and that different combinatorial presentations (networks, plabic graphs, wiring diagrams) are equivalent positivity atlases.
5599: 
5600: \paragraph{Mirzakhani, moduli, and positivity of geometric measures.}
5601: On the moduli-space side, Mirzakhani's work on Weil--Petersson volumes and the growth of simple closed geodesics produces \emph{positive} volume polynomials/recursions and canonical ergodic measures on moduli spaces of hyperbolic surfaces \cite{MirzakhaniModuli}.
5602: In the present framework, this motivates two complementary uses of positivity:
5603: \begin{enumerate}[label=(\roman*)]
5604: \item \textbf{Measure selection (ergodic input).} A canonical positive measure (e.g.\ Weil--Petersson) provides a natural stationary distribution for coarse-grained dynamics on cycle/lamination data, feeding directly into detailed-balance/self-adjointness arguments.
5605: \item \textbf{Positivity of coordinates.} In decorated Teichm\"uller/cluster coordinate systems (lambda-length type coordinates), many naturally occurring functions on moduli are subtraction-free and hence positive on the positive locus; this is the moduli-space analogue of ``positive network coordinates'' on Grassmannians.
5606: \end{enumerate}
5607: We will not attempt to reprove these deep geometric positivity statements here; we use them as a guide for choosing \emph{canonical} positive structures rather than ad hoc sign conventions.
5608: 
5609: 
5610: \begin{remark}[Why ``wiring diagrams'' show up]
5611: A \emph{wiring diagram} is a particularly rigid planar network: it is an arrangement of $n$ monotone ``wires'' with crossings, encoding a reduced word in the symmetric group.
5612: The LGV lemma applies verbatim to wiring diagrams, and (because wiring diagrams are built by concatenating simple crossings) it meshes perfectly with factorization results in reductive groups.
5613: \end{remark}
5614: 
5615: \subsection{Zelevinsky-style parametrization by wiring diagrams (factorization in $GL_n^{>0}$)}
5616: 
5617: One way to \emph{construct} totally positive matrices is to factor them into elementary ``Jacobi'' matrices with positive parameters.
5618: Let $E_{ij}$ denote the standard matrix unit.
5619: For $t>0$ define the elementary upper- and lower-bidiagonal matrices
5620: \[
5621: x_i(t):=I+tE_{i,i+1},\qquad y_i(t):=I+tE_{i+1,i},\qquad 1\le i\le n-1,
5622: \]
5623: and let $D=\mathrm{diag}(d_1,\dots,d_n)$ with all $d_i>0$.
5624: Products of these matrices are automatically totally nonnegative/totally positive, and Zelevinsky-type results show that (up to mild choices) \emph{every} totally positive matrix arises this way.
5625: 
5626: \begin{theorem}[Berenstein--Fomin--Zelevinsky: wiring-diagram factorization]
5627: \label{thm:BFZ_factorization}
5628: Fix a reduced word $\mathbf{i}=(i_1,\dots,i_N)$ for the long permutation $w_0\in S_n$.
5629: Then the map
5630: \[
5631: (t_1,\dots,t_N; d_1,\dots,d_n)\ \longmapsto\
5632: x_{i_1}(t_1)\cdots x_{i_N}(t_N)\,D\, y_{i_N}(t_N)\cdots y_{i_1}(t_1)
5633: \]
5634: parametrizes an open dense subset of $GL_n^{>0}$, and the reduced word $\mathbf{i}$ can be drawn as a wiring diagram whose crossings carry the parameters $t_r$.
5635: \end{theorem}
5636: 
5637: \begin{proof}[Reference]
5638: This is one of the standard parametrizations of the totally positive part of a reductive group (here $GL_n$), expressed in terms of reduced words and generalized minors.
5639: See \cite{BFZ1996TotallyPositive,FominZelevinsky2000TotalPositivity}.
5640: \end{proof}
5641: 
5642: \begin{remark}[Network interpretation]
5643: Each elementary factor $x_i(t)$ or $y_i(t)$ is the weight matrix of a tiny planar ``crossing gadget'' with a single tunable edge of weight $t$.
5644: Concatenating gadgets corresponds to matrix multiplication, hence the entire product in Theorem~\ref{thm:BFZ_factorization} is the weight matrix of an explicit wiring diagram network.
5645: Thus, by Corollary~\ref{cor:wiring_TN}, total positivity of these products is a direct LGV consequence.
5646: \end{remark}
5647: 
5648: \subsection{Total positivity as a positive-energy / self-adjointness certificate (Wick-rotated transfer matrices)}
5649: \label{sec:tp_positive_energy_certificate}
5650: 
5651: In Euclidean (Wick-rotated) lattice QFT, one often works with a \emph{transfer matrix} $T$ rather than a unitary.
5652: The formal relation is $T=\exp(-aH)$ for lattice spacing $a>0$.
5653: To conclude that $H$ is self-adjoint and bounded below, one typically imposes Osterwalder--Schrader reflection positivity.
5654: Total positivity gives a more combinatorial (and, in discrete settings, sometimes easier to verify) sufficient condition.
5655: 
5656: \begin{theorem}[Symmetric totally positive transfer matrix $\Rightarrow$ self-adjoint Hamiltonian with positive energy]
5657: \label{thm:tp_positive_energy}
5658: Let $T\in M_n(\R)$ be \emph{symmetric} and totally positive.
5659: Then:
5660: \begin{enumerate}[label=(\alph*)]
5661: \item $T$ has real, positive, simple eigenvalues $\lambda_1>\cdots>\lambda_n>0$;
5662: \item for any $a>0$, the matrix
5663: \[
5664: H:=-\frac{1}{a}\log T
5665: \]
5666: is real symmetric (hence self-adjoint) with eigenvalues $E_k=-(1/a)\log\lambda_k\in\R$;
5667: \item after rescaling $T$ by its top eigenvalue (equivalently shifting $H$ by a scalar), one may assume $\lambda_1=1$, in which case $E_k\ge 0$ for all $k$ (positivity of energy).
5668: \end{enumerate}
5669: \end{theorem}
5670: 
5671: \begin{proof}
5672: (a) By Theorem~\ref{thm:tp_real_spectrum}, $T$ has real, positive, simple eigenvalues.
5673: (b) Because $T$ is symmetric, there exists an orthogonal matrix $U$ with $T=U\,\mathrm{diag}(\lambda_1,\dots,\lambda_n)\,U^\top$.
5674: Define $\log T:=U\,\mathrm{diag}(\log\lambda_1,\dots,\log\lambda_n)\,U^\top$; this is real symmetric.
5675: Then $H=-(1/a)\log T$ is real symmetric with eigenvalues $E_k$ as stated.
5676: (c) Replace $T$ by $\widetilde T:=\lambda_1^{-1}T$.
5677: Then $\widetilde T=\exp(-a\widetilde H)$ where $\widetilde H=H-(1/a)\log\lambda_1\,I$ is a scalar shift of $H$.
5678: Now $0<\widetilde\lambda_k\le 1$, hence $-\log\widetilde\lambda_k\ge 0$ and $\widetilde H\ge 0$.
5679: \end{proof}
5680: 
5681: \paragraph{Worked example: a $2\times 2$ totally positive transfer matrix.}
5682: 
5683: To make the theorem concrete, consider the simplest case: a symmetric $2\times 2$ totally positive matrix
5684: \[
5685: T = \begin{pmatrix} a & b \\ b & c \end{pmatrix},
5686: \quad a,b,c > 0, \quad \det(T)=ac-b^2>0.
5687: \]
5688: For total positivity, we need all minors positive: $a>0$, $c>0$, $\det(T)>0$, which hold by assumption.
5689: 
5690: The eigenvalues are
5691: \[
5692: \lambda_\pm = \frac{(a+c) \pm \sqrt{(a+c)^2-4(ac-b^2)}}{2} = \frac{(a+c) \pm \sqrt{(a-c)^2+4b^2}}{2}.
5693: \]
5694: Both are real and positive (since $a,c,b>0$), and $\lambda_1>\lambda_2>0$ by the spectral ordering.
5695: 
5696: Now define $H=-\frac{1}{a}\log T$ (using Euclidean time step $a>0$).
5697: Diagonalizing $T=U\mathrm{diag}(\lambda_1,\lambda_2)U^\top$ with an orthogonal $U$, we get
5698: \[
5699: H = U\,\mathrm{diag}\left(-\frac{1}{a}\log\lambda_1, -\frac{1}{a}\log\lambda_2\right)U^\top.
5700: \]
5701: This is manifestly real symmetric. Its eigenvalues are
5702: \[
5703: E_1=-\frac{1}{a}\log\lambda_1, \quad E_2=-\frac{1}{a}\log\lambda_2.
5704: \]
5705: If we rescale $T \to \widetilde T:=\lambda_1^{-1}T$ so that $\widetilde\lambda_1=1$, then $\widetilde E_1=0$ and $\widetilde E_2=-\frac{1}{a}\log(\lambda_2/\lambda_1)\ge 0$ (since $0<\lambda_2\le\lambda_1$).
5706: Thus the shifted Hamiltonian has nonnegative spectrum—positive energy, as desired.
5707: 
5708: This example shows explicitly how total positivity of $T$ (enforced via planar-network construction) leads to the required self-adjointness and spectral positivity without any appeal to Osterwalder--Schrader positivity or other limiting procedures.
5709: 
5710: \subsection{Density-operator phrasing: totally positive transfer matrices as states and modular Hamiltonians}
5711: 
5712: If $T$ is symmetric and positive definite, then after normalization it is literally a density operator.
5713: Define
5714: \[
5715: \rho:=\frac{T}{\Tr(T)}.
5716: \]
5717: Then $\rho\succeq 0$, $\rho=\rho^\top$ and $\Tr(\rho)=1$, so $\rho$ is a finite-dimensional (real) density matrix.
5718: Its modular Hamiltonian is
5719: \[
5720: K:=-\log\rho = -\log T + \log\Tr(T)\,I.
5721: \]
5722: Thus Theorem~\ref{thm:tp_positive_energy} can be reread as:
5723: \begin{quote}
5724: \emph{if a one-step Euclidean evolution operator is symmetric totally positive, then its normalized version is a bona fide density operator whose modular Hamiltonian is self-adjoint and nonnegative (after a scalar shift).}
5725: \end{quote}
5726: 
5727: \begin{remark}[How this is used later]
5728: In the Hilbert--Pólya/GRH chapter we extract candidate generators from \emph{channels} (CPTP maps) rather than from a single matrix.
5729: A common finite-dimensional reduction is to look at the channel's action on a commutative subalgebra (a coarse-grained classical shadow) or to restrict to a basis in which the channel becomes reversible.
5730: In such reductions, wiring-diagram/total-positivity conditions give a concrete, checkable route to self-adjoint modular generators.
5731: \end{remark}
5732: 
5733: \paragraph{Capstone: The architecture of total positivity in the Hilbert--Pólya program.}
5734: 
5735: We now summarize the complete picture that this chapter has built.
5736: \begin{enumerate}[label=(\roman*)]
5737: \item \textbf{Combinatorial layer (Zelevinsky).}
5738: Wiring diagrams and planar networks provide a concrete, parameter-counting realization of totally positive matrices.
5739: By the Berenstein--Fomin--Zelevinsky factorization theorem, every totally positive $n\times n$ matrix factors as a product of elementary bidiagonal matrices with nonnegative parameters, and this factorization structure is encoded in a wiring diagram.
5740: \item \textbf{Algebraic layer (Postnikov; positive Grassmannians).}
5741: The positive Grassmannian and its boundary measurement maps supply an invariant geometric language for positivity: wiring diagrams are coordinate charts on cells of $\mathbf{Gr}_{\ge 0}(k,n)$, and different network moves correspond to different coordinate patches on the same cell.
5742: This ties positivity to the underlying moduli geometry.
5743: \item \textbf{Spectral layer (Gantmacher--Krein).}
5744: Totally positive matrices have \emph{real, positive, and simple eigenvalues}.
5745: This is the crucial certificate: in any transfer-matrix or channel-based construction, total positivity automatically ensures the spectrum is real and bounded.
5746: \item \textbf{Self-adjointness and energy (Wick rotation).}
5747: When a symmetric totally positive transfer matrix $T$ is Wick-rotated via $H=-\frac{1}{a}\log T$, the resulting Hamiltonian is self-adjoint and, after a scalar shift, has nonnegative eigenvalues (positive energy).
5748: This is exactly what the Hilbert--Pólya construction requires: a self-adjoint generator whose spectrum is real and controlled.
5749: \end{enumerate}
5750: 
5751: The synthesis is this:
5752: \begin{quote}
5753: \emph{A clock/shift operator built by gluing totally positive transfer matrices (via wiring-diagram concatenation) automatically yields a self-adjoint Hamiltonian with real spectrum and positive energy.
5754: The wiring diagram is the certificate of positivity; the Gantmacher--Krein theorem is the certificate of reality; the logarithm is the bridge to self-adjointness.
5755: This mechanism is the core of the Hilbert--Pólya proposal for GRH developed in the final chapters:
5756: we will construct candidate generators of time evolution from surface orders and arithmetic data, demand that they are (or factor through) totally positive transfer matrices, and thereby obtain self-adjoint operators whose spectrum encodes the Riemann zeros.}
5757: \end{quote}
5758: 
5759: This is the ``icing in the middle of the cake''—a complete, self-contained layer that makes rigorous and checkable the claim that discrete/combinatorial/arithmetic input can yield a self-adjoint spectral problem with controlled reality and positivity properties.
5760: 
5761: 
5762: 					% \section{Gabriel-Riedtmann's Group Representations without Groups}
5763: 
5764: 					% \section{Braid Group Actions on Local Roots of Unity}
5765: 					
5766: 					
\chapter{Wick Rotation and the Positivity of Energy in QFT} · lines 5767–5839
5767: \chapter{Wick Rotation and the Positivity of Energy in QFT}
5768: \label{ch:wick_rotation_positive_energy}
5769: 
5770: \section*{Bridge from total positivity}
5771: 
5772: The total positivity machinery developed in the preceding chapter provides the \emph{algebraic certificate} that certain transfer matrices have controlled spectra and self-adjoint logarithms.
5773: We now translate that machinery into the \emph{physical language} of Wick rotation and positive energy—the form needed for the Hilbert--Pólya operator construction.
5774: The key insight is simple: a symmetric totally positive transfer matrix $T$, when analytically continued to imaginary Euclidean time via $H:=i\log T$ (or equivalently $H=-\frac{1}{a}\log T$), automatically yields a self-adjoint Hamiltonian whose spectrum is real and, after normalization, nonnegative.
5775: This chapter makes the connection explicit and develops the quantum-field-theoretic context in which these transfer matrices arise naturally.
5776: 
5777: \section*{}
5778: 
5779: The basic analytic tension in QFT (and in any proposal that tries to build QFT-like dynamics from discrete/combinatorial input) is:
5780: 
5781: \begin{quote}
5782: \emph{Lorentzian time evolution wants a self-adjoint Hamiltonian $H$ (so that $U(t)=e^{-itH}$ is unitary), while Euclidean constructions and coarse-grained dynamics naturally produce \emph{positive} transfer operators $T$ (or channels) instead.}
5783: \end{quote}
5784: 
5785: A standard bridge between the two is \textbf{Wick rotation}:
5786: \[
5787: t\mapsto -i\tau,\qquad U(t)=e^{-itH}\ \leadsto\ e^{-\tau H}.
5788: \]
5789: On a lattice, $\tau$ is discretized and one works with a one-step transfer matrix $T$ that formally satisfies $T=e^{-aH}$ for time step $a>0$.
5790: The question is then: \emph{when is $H:=-(1/a)\log T$ actually self-adjoint and bounded below?}
5791: 
5792: \section{Euclidean transfer matrices and positivity}
5793: 
5794: In finite volume, a Euclidean path integral with real action $S_E$ produces weights $e^{-S_E}\ge 0$ and hence a transfer matrix with nonnegative matrix elements in a preferred basis.
5795: In infinite volume, the right condition is \emph{reflection positivity} (Osterwalder--Schrader positivity), which guarantees reconstruction of a Hilbert space and a self-adjoint Hamiltonian with spectrum bounded below.
5796: 
5797: For the purposes of this manuscript (which is explicitly constructive and often finite-dimensional at intermediate stages), it is useful to keep a clean, checkable sufficient condition:
5798: 
5799: \begin{quote}
5800: \emph{If $T$ is symmetric positive definite, then $H=-\frac{1}{a}\log T$ is self-adjoint, and energy positivity reduces to a normalization of the top eigenvalue.}
5801: \end{quote}
5802: 
5803: \section{A wiring-diagram sufficient condition}
5804: 
5805: Total positivity upgrades ``$T$ has nonnegative entries'' to ``every minor of $T$ is positive'', and this stronger property has two practical consequences:
5806: (i) it is stable under local concatenations, and
5807: (ii) it forces the spectrum to be real, positive, and simple.
5808: 
5809: The preceding chapter's total-positivity results immediately yield a Wick-rotation positivity statement.
5810: 
5811: \begin{corollary}[Reflection-symmetric wiring diagram $\Rightarrow$ positive-energy Hamiltonian]
5812: \label{cor:wiring_positive_energy}
5813: Let $\mathcal{N}$ be a positive-weight wiring-diagram network whose weight matrix $T=A(\mathcal{N})$ is \emph{symmetric} (e.g.\ the network is invariant under planar reflection exchanging sources and sinks, which is a discrete detailed-balance condition).
5814: Assume $\mathcal{N}$ is such that $T$ is totally positive (Corollary~\ref{cor:wiring_TN}).
5815: Then $H:=-(1/a)\log T$ is self-adjoint and (after a scalar shift/normalization) satisfies $H\succeq 0$.
5816: \end{corollary}
5817: 
5818: \begin{proof}
5819: By Corollary~\ref{cor:wiring_TN}, $T$ is totally positive.
5820: By hypothesis $T$ is symmetric, so Theorem~\ref{thm:tp_positive_energy} applies.
5821: \end{proof}
5822: 
5823: \section{Density-operator viewpoint: Euclidean evolution as a Gibbs state}
5824: 
5825: Given a positive definite transfer matrix $T$, one may form a finite-volume Gibbs state at inverse temperature $\beta$ by
5826: \[
5827: \rho_\beta := \frac{T^\beta}{\Tr(T^\beta)} = \frac{e^{-\beta a H}}{\Tr(e^{-\beta a H})}.
5828: \]
5829: The modular Hamiltonian of $\rho_\beta$ is
5830: \[
5831: K_\beta:=-\log\rho_\beta=\beta a H+\log Z(\beta)\,I,\qquad Z(\beta)=\Tr(e^{-\beta a H}).
5832: \]
5833: Thus, in Euclidean settings the modular Hamiltonian is essentially the physical Hamiltonian (up to an affine transformation), and the ``positivity of energy'' is precisely the statement $K_\beta\succeq 0$ after subtracting its scalar part.
5834: Total positivity provides one constructive route to guarantee that this modular generator is self-adjoint, with good spectral control, \emph{before} taking any thermodynamic limit.
5835: 
5836: 					
5837: 					
5838: \part{Time, Holonomy, Hyperbolic Geometry, and Emergent Dynamics}
5839: 
\chapter{Time as a Shift Operator: finite and infinite qudits} · lines 5840–6280
5840: \chapter{Time as a Shift Operator: finite and infinite qudits}
5841: \label{ch:time_shift}
5842: 
5843: The practical study of physical clocks—whether digital, mechanical, or quantum—reveals that temporal evolution is fundamentally encoded in shift dynamics: a clock's state advances from one value to the next via an operator that increments or cycles the internal register. This chapter formalizes this intuition by studying how shift operators generate the simplest non-trivial models of time, from finite-dimensional cyclic qudits to infinite-dimensional systems. Understanding the spectral and holonomic properties of these shifts forms the foundation for later chapters, where cyclic time emerges as torsion in the holonomy of glued local orders.
5844: 
5845: \section{Finite-dimensional clocks: the cyclic shift and its spectrum}
5846: Fix a local Hilbert space $\cH\cong\C^d$ with computational basis $\{|j\rangle\}_{j\in\Z/d\Z}$.
5847: Define the \emph{shift} (``successor'') operator
5848: \[
5849: X_d|j\rangle = |j+1\rangle,
5850: \]
5851: and the \emph{phase} operator
5852: \[
5853: Z_d|j\rangle = \omega^j |j\rangle,\qquad \omega=e^{2\pi i/d}.
5854: \]
5855: Then $X_d^d=Z_d^d=I$ and the Weyl commutation relation holds:
5856: \[
5857: Z_d X_d = \omega\, X_d Z_d.
5858: \]
5859: The discrete Fourier transform $F_d$ diagonalizes $X_d$:
5860: \[
5861: F_d\, X_d\, F_d^{-1} = Z_d,\qquad
5862: (F_d)_{jk}=d^{-1/2}\,\omega^{jk}.
5863: \]
5864: Thus the eigenvalues of $X_d$ are $\{\omega^k\}_{k=0}^{d-1}$, and the ``clock phases'' advance uniformly.
5865: 
5866: 
5867: \section{Irrational rotation algebras and the noncommutative torus: from finite qudits to infinite clocks}
5868: \label{sec:irrational_rotation_algebra}
5869: 
5870: The finite qudit Weyl relation
5871: \[
5872: Z_d X_d = \omega\, X_d Z_d,\qquad \omega=e^{2\pi i/d},
5873: \]
5874: is the ``root of unity'' case of a much more rigid operator-algebraic object: the \emph{irrational rotation algebra}
5875: (also called the \emph{noncommutative $2$--torus}).
5876: 
5877: \begin{definition}[Irrational rotation algebra / noncommutative torus]
5878: Fix $\theta\in\R$.
5879: The \emph{rotation algebra} $A_\theta$ is the universal unital $C^*$--algebra generated by two unitaries $U,V$ such that
5880: \begin{equation}
5881: \label{eq:rotation_relation}
5882: VU = e^{2\pi i \theta}\, UV .
5883: \end{equation}
5884: \end{definition}
5885: 
5886: \begin{remark}[Rational versus irrational phases]
5887: If $\theta=p/q\in\Q$ (in lowest terms), then \eqref{eq:rotation_relation} is the projective commutation relation of a finite $q$--level clock:
5888: one may take $U=X_q$ and $V=Z_q^{\,p}$ so that $VU=e^{2\pi i p/q}UV$.
5889: If $\theta\notin\Q$, then $A_\theta$ has \emph{no} nontrivial finite-dimensional representations (Proposition~\ref{prop:finite_rep_implies_rational}), and one is forced into the infinite-clock regime.
5890: \end{remark}
5891: 
5892: \begin{proposition}[Finite-dimensional representations force $\theta$ to be rational]
5893: \label{prop:finite_rep_implies_rational}
5894: Suppose there exist unitaries $U,V\in M_n(\C)$ satisfying \eqref{eq:rotation_relation}.
5895: Then $e^{2\pi i n\theta}=1$, hence $\theta\in \frac1n\Z\subset\Q$.
5896: \end{proposition}
5897: 
5898: \begin{proof}
5899: Taking determinants on both sides of $VU=e^{2\pi i\theta}UV$ gives
5900: \[
5901: \det(V)\det(U)=e^{2\pi i n\theta}\det(U)\det(V).
5902: \]
5903: Since $\det(U),\det(V)\neq 0$, cancel to obtain $e^{2\pi i n\theta}=1$.
5904: \end{proof}
5905: 
5906: \subsection{Crossed-product realization and dynamical meaning}
5907: A key structural fact is that $A_\theta$ is a crossed product by an irrational circle rotation.
5908: 
5909: Let $\mathbb{T}=S^1$ and let $\alpha_\theta:\mathbb{T}\to\mathbb{T}$ be the rotation $\alpha_\theta(z)=e^{2\pi i\theta}z$.
5910: Let $\alpha$ denote the induced automorphism of $C(\mathbb{T})$,
5911: \[
5912: (\alpha(f))(z):=f(\alpha_\theta^{-1}z)=f(e^{-2\pi i\theta}z).
5913: \]
5914: Then the crossed product $C(\mathbb{T})\rtimes_\alpha \Z$ is the universal $C^*$--algebra generated by
5915: \begin{itemize}
5916: \item a copy of $C(\mathbb{T})$, and
5917: \item a unitary $U$ implementing the $\Z$--action: $U f U^*=\alpha(f)$,
5918: \end{itemize}
5919: and is canonically isomorphic to $A_\theta$ by sending $V$ to the coordinate function $V(z)=z$ and $U$ to the implementing unitary.
5920: This is the standard ``dynamics $\Rightarrow$ noncommutative observable algebra'' mechanism \cite{PimsnerVoiculescu1980ExactSequence,Rieffel1981IrrationalRotations}.
5921: 
5922: \subsection{Ergodic theory input: unique ergodicity and the canonical trace}
5923: For $\theta\notin\Q$, the rotation $\alpha_\theta$ on the circle is \emph{minimal} and \emph{uniquely ergodic}:
5924: Lebesgue measure $m$ is the unique $\alpha_\theta$--invariant Borel probability measure, and Birkhoff averages converge uniformly
5925: \[
5926: \frac1N\sum_{k=0}^{N-1} f(\alpha_\theta^k z)\ \xrightarrow[N\to\infty]{}\ \int_{\mathbb{T}} f\,dm
5927: \quad\text{for all continuous } f \text{ and all } z\in\mathbb{T}
5928: \]
5929: (see e.g.\ \cite{Walters1982ErgodicTheory}).
5930: 
5931: This uniquely ergodic fact has a concrete operator-algebraic consequence:
5932: 
5933: \begin{proposition}[Canonical trace on $A_\theta$]
5934: \label{prop:trace_rotation_algebra}
5935: If $\theta\notin\Q$, then $A_\theta$ admits a unique tracial state $\tau$ characterized on Fourier monomials by
5936: \[
5937: \tau(U^m V^n)=
5938: \begin{cases}
5939: 1,& (m,n)=(0,0),\\
5940: 0,& \text{otherwise.}
5941: \end{cases}
5942: \]
5943: Equivalently, in the crossed-product picture $A_\theta\cong C(\mathbb{T})\rtimes_\alpha\Z$,
5944: \[
5945: \tau\Bigl(\sum_{k} f_k U^k\Bigr)=\int_{\mathbb{T}} f_0\, dm .
5946: \]
5947: \end{proposition}
5948: 
5949: \begin{remark}[Why ergodicity is the right ``physics'' hypothesis]
5950: The heuristic ``long-time averages equal equilibrium expectations'' is \emph{exactly} Birkhoff's theorem in the uniquely ergodic case.
5951: In our setting, $\tau$ is the canonical ``equilibrium'' state induced by the orbit geometry.
5952: When we use traces in later Hilbert--Pólya/explicit-formula discussions, this is the clean place where one justifies passing from orbit sums (time averages) to traces (state expectations).
5953: \end{remark}
5954: 
5955: 
5956: \subsection{Continued fractions, renormalization, and finite-clock approximants}
5957: \label{sec:rotation_continued_fraction_rg}
5958: 
5959: A practical reason the rotation algebra belongs in a computational manuscript is that irrational parameters are naturally approximated by rational ones, and the corresponding algebras are realized by finite clocks.
5960: 
5961: Write the (infinite) continued fraction expansion
5962: \[
5963: \theta = [a_0;a_1,a_2,a_3,\dots],
5964: \]
5965: and let $p_n/q_n$ be the convergents.
5966: Classical Diophantine approximation gives the uniform estimate
5967: \[
5968: \Bigl|\theta-\frac{p_n}{q_n}\Bigr| < \frac{1}{q_n^2}.
5969: \]
5970: Each rational approximant $\theta_n=p_n/q_n$ yields a finite-dimensional ``magnetic translation'' model:
5971: \[
5972: A_{\theta_n}\ \text{admits a faithful $q_n$--dimensional projective representation generated by } (X_{q_n},Z_{q_n}^{\,p_n}).
5973: \]
5974: Thus, \emph{finite qudit clocks} are exactly the natural rational approximations to an irrational-clock observable algebra.
5975: 
5976: \begin{remark}[Renormalization viewpoint and an ergodic map on parameters]
5977: The continued-fraction shift $\theta\mapsto [a_1;a_2,\dots]$ is the Gauss map $G(\theta)=\{1/\theta\}$ on $(0,1)$,
5978: which is a paradigmatic ergodic dynamical system \cite{Walters1982ErgodicTheory}.
5979: Interpreting ``coarse-graining'' as passing from $\theta$ to a better rational approximant $p_n/q_n$ is therefore literally a renormalization flow on the space of rotation numbers.
5980: In the operator-algebraic classification of $A_\theta$, this continued-fraction structure controls inductive-limit approximations by matrix algebras (the Elliott--Evans picture \cite{ElliottEvans1993Rotation}),
5981: which is precisely what one wants for numerical and hardware-friendly truncations.
5982: \end{remark}
5983: 
5984: In short: irrational clocks can be simulated at scale by a multiscale ladder of finite qudits dictated by the continued fraction of $\theta$,
5985: and ergodic theory governs the typical complexity of that ladder (digit statistics, mixing of the Gauss map), which in turn controls what a learned renormalization scheme must discover.
5986: 
5987: \subsection{Density operators and modular Hamiltonians for rotation-algebra observables}
5988: A $C^*$--algebraic \emph{state} is a positive linear functional $\omega:A_\theta\to\C$ with $\omega(1)=1$.
5989: Once a concrete representation $\pi:A_\theta\to\mathcal{B}(\cH)$ is chosen, \emph{normal} states are implemented by density operators:
5990: \[
5991: \omega(a)=\Tr(\rho\,\pi(a)),\qquad \rho\succeq 0,\ \Tr(\rho)=1.
5992: \]
5993: In particular, the tracial state $\tau$ of Proposition~\ref{prop:trace_rotation_algebra} is the infinite-temperature limit in which the modular Hamiltonian is trivial (the modular flow is identity).
5994: Nontrivial modular Hamiltonians appear once one specifies a one-parameter dynamics $\{\sigma_t\}$ on $A_\theta$ (e.g.\ a one-parameter subgroup of the natural $\mathbb{T}^2$--action)
5995: and chooses a corresponding KMS state; then Tomita--Takesaki theory produces a modular generator compatible with the ergodic geometry.
5996: 
5997: \subsection{Why this belongs in the ``clock'' chapter}
5998: Two points link $A_\theta$ directly to our holonomy-as-time story:
5999: 
6000: \begin{enumerate}
6001: \item \textbf{Finite clocks are rational noncommutative tori.}
6002: The pair $(X_d,Z_d)$ generates a finite-dimensional projective representation of $\Z^2$ with a $U(1)$ $2$--cocycle (the phase $\omega$).
6003: The irrational rotation algebra is the $C^*$--completion when the cocycle phase is irrational and cannot close in finite dimension.
6004: 
6005: \item \textbf{Quasi-periodic time is ergodic time.}
6006: If ``time'' is generated by a shift $U$ whose action on a commutative subalgebra is an irrational rotation,
6007: then repeated ticking explores the entire phase circle uniformly.
6008: This makes the trace state computable by orbit averaging and provides the ergodic underpinning for replacing long products of local clock moves by trace-class expressions later.
6009: \end{enumerate}
6010: 
6011: 
6012: 
6013: \subsection{Procyclic root towers and ``infinite-period'' cyclic qudits}
6014: \label{sec:procyclic_root_towers}
6015: 
6016: The rotation algebra $A_\theta$ is the analytic completion of a \emph{single} irrational rotation on a circle.
6017: There is a closely related (and, for surface orders, even more canonical) way to generate ``infinite-period'' clocks:
6018: build a \emph{tower of finite cyclic clocks} and pass to a limit.
6019: This picture appears naturally in the local-field/monodromy description of surface orders \cite{Schreiber2018SurfaceAlgebrasII,Schreiber2018SurfaceAlgebrasI}.
6020: 
6021: \paragraph{Root towers at punctures and profinite cyclicity.}
6022: Let $x_j$ be a puncture (or ramification point) on a curve, with local field $F_j=\C((x_j))$.
6023: For each $n\ge 1$, adjoin an $n$th root of the local parameter to obtain an extension $F_j((x_j^{1/n}))$.
6024: There is a canonical cyclic subgroup of automorphisms generated by the rotation of the root,
6025: \[
6026: x_j^{1/n}\ \longmapsto\ e^{2\pi i k/n}\,x_j^{1/n},
6027: \qquad k\in\Z/n\Z,
6028: \]
6029: so $\mathrm{Gal}(F_j((x_j^{1/n}))/F_j)\cong \Z/n\Z$ in this elementary setting.
6030: Passing to the directed system $n\mid m$ produces an inductive limit containing all roots of unity,
6031: and dually produces the \emph{procyclic completion}
6032: \[
6033: \widehat{\Z}\;\cong\;\varprojlim_n \Z/n\Z,
6034: \]
6035: which is a canonical home for ``clock phases'' of arbitrarily large period.
6036: 
6037: \paragraph{Operator-algebraic packaging: odometers and solenoids.}
6038: A standard ergodic model for $\widehat{\Z}$--structured time is the \emph{adding machine} (odometer):
6039: a minimal uniquely ergodic action of $\Z$ on a Cantor space $X_{\mathbf{n}}$ built from the inverse limit of residue rings
6040: \[
6041: X_{\mathbf{n}} := \varprojlim_k \Z/n_k\Z,
6042: \qquad n_k\mid n_{k+1}.
6043: \]
6044: The crossed product $C(X_{\mathbf{n}})\rtimes \Z$ is then an ``inductive-limit clock algebra'':
6045: it is an analytic completion of the observable algebra generated by \emph{all} the finite clocks of periods $n_k$ at once.
6046: For our purposes the key fact is the same as in Proposition~\ref{prop:trace_rotation_algebra}:
6047: unique ergodicity provides a canonical invariant probability measure (Haar measure on the profinite group), hence a canonical trace state.
6048: 
6049: \paragraph{How irrational rotations arise from the tower.}
6050: The procyclic tower is not the same object as $A_\theta$ (the rotation algebra is generated by a \emph{single} irrational phase),
6051: but it is the correct device for implementing ``irrational period'' in hardware:
6052: choose convergents $p_k/q_k$ of $\theta$ and set $n_k:=q_k$.
6053: Then each level $k$ supports a faithful $q_k$--dimensional projective representation of the rational noncommutative torus,
6054: generated by $(X_{q_k},Z_{q_k}^{\,p_k})$, and the tower $q_k\mid q_{k+1}$ gives a coherent refinement ladder.
6055: In the limit (strong operator topology / inductive-limit sense), the spectrum of the refined clock becomes dense on $S^1$,
6056: and orbit averages converge to Haar/Lebesgue expectations by unique ergodicity.
6057: 
6058: \subsection{Quantum-circuit implementation: nested cyclic qudits as irrational-rotation approximants}
6059: \label{sec:irrational_rotation_nested_qudits}
6060: 
6061: The tower picture can be made circuit-explicit while staying in the state-vector model.
6062: 
6063: \paragraph{Level-$k$ clock register.}
6064: Fix $q_k$ and work on $\cH_k\cong\C^{q_k}$ with basis $\{\ket{j}\}_{j\in\Z/q_k\Z}$.
6065: Implement
6066: \[
6067: U_k := X_{q_k},\qquad V_k := Z_{q_k}^{\,p_k},
6068: \qquad\text{so that}\qquad V_kU_k=e^{2\pi i p_k/q_k}\,U_kV_k.
6069: \]
6070: Both gates are native on qudit hardware; on qubits, $U_k$ is modular addition by $1$ and $V_k$ is a diagonal phase gate.
6071: 
6072: \paragraph{Coherent refinement (``infinite period'' limit register).}
6073: Choose an embedding isometry $J_k:\cH_k\hookrightarrow \cH_{k+1}$ compatible with the residue map $\Z/q_{k+1}\Z\to\Z/q_k\Z$,
6074: so that $J_k U_k = U_{k+1} J_k$ and likewise for $V_k$ up to a controlled phase that vanishes as $k\to\infty$ for good approximants.
6075: Then the direct limit Hilbert space $\cH_\infty=\varinjlim (\cH_k,J_k)$ carries limiting unitaries $U_\infty,V_\infty$
6076: whose commutator phase is the target irrational $e^{2\pi i\theta}$ in the limit sense.
6077: Operationally: you never build $\cH_\infty$ in hardware; you pick the level $k$ needed for a given accuracy $\epsilon$,
6078: using the Diophantine bound $|\theta-p_k/q_k|<1/q_k^2$.
6079: 
6080: \paragraph{Validation checks (ergodic and spectral).}
6081: The two simplest empirical diagnostics are:
6082: \begin{enumerate}
6083: \item \textbf{Equidistribution / orbit tests:} for a fixed basis state, repeatedly apply $U_k$ and measure in the $V_k$--eigenbasis;
6084: as $k$ grows, the empirical distribution of phases should approach uniformity for ``generic'' initial states.
6085: \item \textbf{Commutator phase calibration:} estimate $\langle\psi|V_kU_kU_k^\dagger V_k^\dagger|\psi\rangle$ for random $\ket{\psi}$;
6086: it should concentrate near $e^{2\pi i p_k/q_k}$ and track the continued-fraction ladder as $k$ is increased.
6087: \end{enumerate}
6088: 
6089: These are the circuit-level counterparts of the operator-algebraic statements above:
6090: unique ergodicity justifies replacing long-time orbit averages by trace-state expectations,
6091: which is exactly what later trace-formula / explicit-formula comparisons require.
6092: 
6093: 
6094: \section{Twisted shifts from orders (the valuation-aware successor)}
6095: In the order-theoretic layer (Chapter~\ref{sec:twisted_shift}), the successor can acquire a uniformizer factor on wrap-around:
6096: \[
6097: S_d(\pi)=
6098: \begin{pmatrix}
6099: 0&0&\cdots&0&\pi\\
6100: 1&0&\cdots&0&0\\
6101: 0&1&\ddots&0&0\\
6102: \vdots&\ddots&\ddots&\ddots&\vdots\\
6103: 0&0&\cdots&1&0
6104: \end{pmatrix},
6105: \qquad S_d(\pi)^d=\pi I_d.
6106: \]
6107: Over a field extension adjoining a $d$th root $\pi^{1/d}$, the spectrum is $\pi^{1/d}\omega^k$.
6108: Projectively, the ``clock'' still has period $d$ (up to central scaling), which is exactly the holonomy mechanism exploited later.
6109: 
6110: \section{Infinite-dimensional clocks: the bilateral shift and continuous spectrum}
6111: Let $\cH=\ell^2(\Z)$ with basis $\{|n\rangle\}_{n\in\Z}$ and define the bilateral shift
6112: \[
6113: (S|n\rangle)=|n+1\rangle.
6114: \]
6115: Then $S$ is unitary and has \emph{continuous} spectrum equal to the unit circle.
6116: Under the Fourier transform $\ell^2(\Z)\cong L^2(S^1)$, $S$ becomes multiplication by $e^{i\theta}$.
6117: A (non-unique) self-adjoint generator $H$ can be chosen by functional calculus so that $S=e^{-iH}$ (Section~\ref{sec:hamiltonian_log}).
6118: 
6119: \section{From shifts to Hamiltonians: branch choices and physical units}
6120: If $T$ is unitary, one may write $T=e^{-iH\Delta t/\hbar}$ for a self-adjoint (generally unbounded) $H$, but $H$ is only determined up to adding integer multiples of $2\pi\hbar/\Delta t$ on spectral components.
6121: This \emph{branch ambiguity} becomes a structural input when we glue local clocks: global consistency of branch choices is an additional holonomy constraint rather than a nuisance.
6122: 
6123: \section{Implementation notes (quantum circuits)}
6124: For $d=2^n$ (an $n$-qubit register), $X_d$ is modular addition by $1$ and can be implemented with a ripple-carry or QFT-based adder.
6125: For general $d$, one may either (i) embed $\C^d$ into a qubit register with unused states and post-select, or (ii) use native qudit hardware where the shift is a cyclic permutation gate.
6126: In all cases, hardware noise most strongly perturbs phase coherence; the persistence diagnostics in Chapter~\ref{ch:persistence} are designed to be stable to such perturbations.
6127: 
6128: 
6129: 
6130: 
6131: \subsection{Beyond Clifford: learned controlled-$U$ (CU) layers and universal gate sets}
6132: \label{sec:learned_CU_layers}
6133: 
6134: The circuit sketches in this manuscript sometimes mention Clifford layers because they are convenient for (i) randomized measurement and (ii) baseline stabilizer diagnostics.
6135: This should not be misread as a restriction of the dynamics to Clifford circuits.
6136: The renormalization layers are intended to be \emph{learned} and therefore must include non-Clifford operations.
6137: 
6138: \paragraph{Controlled-$U$ gates.}
6139: A controlled-$U$ (CU) gate on a control qubit and a $d$-level target is the unitary
6140: \[
6141: \mathrm{CU}(U)=|0\rangle\!\langle0|\otimes I_d + |1\rangle\!\langle1|\otimes U,
6142: \]
6143: and more generally on a qudit control one may condition on multiple control values.
6144: On an embedded graph/quiver, CU gates are canonical \emph{edge-local entanglers}: place the control on one endpoint and the target on the adjacent endpoint.
6145: 
6146: \paragraph{Learnable edge gates and attention weights.}
6147: In the QGCN/QGAT viewpoint (Sections~\ref{sec:qgcn_renorm}--\ref{sec:qgat_renorm}), one may treat each edge $e=(u,v)$ as carrying a trainable two-site unitary
6148: \[
6149: U_e(\theta_e)\in \mathrm{SU}(d_ud_v),
6150: \]
6151: compiled into hardware primitives (often CU-like entanglers plus single-site rotations).
6152: In a graph-attention layer, the classical attention coefficient $a_{uv}$ can modulate either (i) the angle of a controlled phase/rotation or (ii) the probability of applying a gate, yielding a stochastic quantum channel.
6153: 
6154: \paragraph{Why Clifford-only learning is a dead end.}
6155: Clifford circuits are efficiently classically simulable and cannot densely explore $\mathrm{SU}(2^n)$.
6156: They are excellent for error mitigation and tomography primitives, but an emergent-geometry model requires genuinely non-Clifford entanglement generation.
6157: Pragmatically, one therefore uses:
6158: \begin{itemize}
6159: \item Clifford or approximate unitary $2$-design layers for \emph{measurement/tomography}, and
6160: \item learned CU/non-Clifford layers for \emph{state preparation and dynamics}.
6161: \end{itemize}
6162: 
6163: \paragraph{Density-operator phrasing.}
6164: A learned unitary layer corresponds to the channel $\rho\mapsto U(\theta)\rho U(\theta)^\dagger$, optionally composed with noise.
6165: This is the language used in Section~\ref{sec:circuit_density_channels} when reduced density operators are mapped to modular Hamiltonians.
6166: 
6167: 
6168: \section{Circuit dynamics as quantum channels and density operators}
6169: \label{sec:circuit_density_channels}
6170: 
6171: The discussion above used state vectors $\ket{\psi}$ for clarity, but most of the program---especially the parts that are meant to survive hardware noise, mid-circuit measurements, and coarse-graining---is more naturally phrased in terms of \emph{density operators}.
6172: We record the translation explicitly so later chapters (modular Hamiltonians, renormalization channels, and the Hilbert--Pólya trace identities) can reuse it without ambiguity.
6173: 
6174: \subsection{Pure states, mixed states, and expectations}
6175: A (finite-dimensional) \emph{density operator} on a Hilbert space $\mathcal{H}$ is an operator $\rho\in\mathcal{B}(\mathcal{H})$ such that $\rho\succeq 0$ and $\Tr(\rho)=1$.
6176: Pure states are rank-one projectors $\rho=\ket{\psi}\bra{\psi}$, while mixtures have $\rank(\rho)>1$.
6177: 
6178: For any observable $O=O^\dagger$ the expectation value is
6179: \[
6180: \langle O\rangle_\rho := \Tr(\rho\,O),
6181: \]
6182: which reduces to $\bra{\psi}O\ket{\psi}$ in the pure case.
6183: 
6184: If the register splits as $\mathcal{H}=\mathcal{H}_A\otimes\mathcal{H}_{A^c}$, the reduced state on $A$ is
6185: \[
6186: \rho_A := \Tr_{A^c}(\rho).
6187: \]
6188: All information-theoretic quantities used later (entropies, mutual information, modular Hamiltonians) are functions of such reduced density operators.
6189: In particular, the mutual information proxy $I(A\!:\!B)$ used as a weight in persistence is a functional of $(\rho_A,\rho_B,\rho_{AB})$ and is therefore insensitive to global phases and robust under mixing.
6190: 
6191: \subsection{Gates, noise, and measurements as CPTP maps}
6192: An ideal unitary gate $U$ acts on density operators by conjugation,
6193: \[
6194: \rho\longmapsto \mathcal{U}(\rho):=U\rho U^\dagger .
6195: \]
6196: Hardware noise, measurements, and classical conditioning are captured by \emph{quantum channels}: completely positive trace-preserving (CPTP) maps
6197: \[
6198: \mathcal{E}:\mathcal{B}(\mathcal{H})\to\mathcal{B}(\mathcal{H}').
6199: \]
6200: In Kraus form,
6201: \begin{equation}
6202: \label{eq:kraus_form}
6203: \mathcal{E}(\rho)=\sum_a K_a\rho K_a^\dagger,\qquad \sum_a K_a^\dagger K_a = I.
6204: \end{equation}
6205: The post-selected (unnormalized) state for outcome $a$ is $K_a\rho K_a^\dagger$, and the corresponding outcome probability is $\Tr(K_a\rho K_a^\dagger)$.
6206: 
6207: 
6208: \subsubsection{Measurement as entanglement and phase transfer in open quantum systems}
6209: \label{sec:measurement_as_entanglement}
6210: 
6211: The Kraus formula \eqref{eq:kraus_form} is already the mathematically correct way to talk about measurement in an open system, but it can feel ``black-box''.
6212: To avoid the misleading image of ``projectors from nowhere'', recall the Stinespring dilation theorem: every CPTP map arises from a unitary interaction with an ancilla (environment) followed by a partial trace.
6213: 
6214: \paragraph{Projective measurement from a unitary premeasurement.}
6215: Let $\{P_a\}_a$ be an orthogonal projector-valued measure on $\mathcal{H}_S$ and let $\mathcal{H}_M$ be a meter with pointer basis $\{|a\rangle_M\}_a$.
6216: Define a unitary $U$ on $S\otimes M$ by
6217: \[
6218: U\bigl(|\psi\rangle_S\otimes|0\rangle_M\bigr)=\sum_a (P_a|\psi\rangle_S)\otimes|a\rangle_M .
6219: \]
6220: For an input density operator $\rho$ the joint post-interaction state is $U(\rho\otimes|0\rangle\langle0|)U^\dagger$ and the reduced state on $S$ is
6221: \[
6222: \rho \longmapsto \Tr_M\!\left(U(\rho\otimes|0\rangle\langle0|)U^\dagger\right)=\sum_a P_a\rho P_a,
6223: \]
6224: which is exactly the usual L\"{u}ders update channel.
6225: Conditioning on the classical record $a$ yields the normalized state $\rho_a=P_a\rho P_a/\Tr(P_a\rho)$.
6226: Thus the projector update is the reduced description of an entangling unitary plus discarding/conditioning, not an extra physical axiom \cite{NielsenChuang2000,BreuerPetruccione2002OpenSystems}.
6227: 
6228: \paragraph{Local phases become global branch phases.}
6229: If $|\psi\rangle=\sum_a c_a |a\rangle$ in an eigenbasis of the measured observable, then the premeasurement state is
6230: \[
6231: |\Psi\rangle_{SM}=\sum_a c_a\,|a\rangle_S\otimes|a\rangle_M .
6232: \]
6233: A global phase of $|\Psi\rangle_{SM}$ is physically irrelevant, but the relative phases of the coefficients $c_a$ now live in the \emph{relative phase between different entangled branches}.
6234: When the meter/environment decoheres (or is traced out), the off-diagonal terms in $\rho_S$ disappear and those phases become operationally inaccessible on $S$ alone.
6235: In this sense, ``measurement'' transfers local phase information into a global, environment-correlated phase record.
6236: 
6237: \paragraph{POVMs and instruments.}
6238: The same construction holds for general POVMs: given Kraus operators $\{K_a\}$, there exists an ancilla and a unitary $U$ such that $K_a=\langle a|U|0\rangle$.
6239: The family $\rho\mapsto K_a\rho K_a^\dagger$ is a quantum instrument; summing over $a$ gives the unconditional CPTP map \cite{WisemanMilburn2009QuantumMeasurement}.
6240: 
6241: We will use this viewpoint repeatedly: pooling/renormalization steps are partial traces (discarding degrees of freedom), while measurement corresponds to partial trace \emph{plus} retaining a classical record of the discarded subsystem.
6242: 
6243: 
6244: A depth-$L$ circuit with interleaved noise is therefore a channel composition
6245: \[
6246: \rho_{\mathrm{out}} = (\mathcal{E}_L\circ\cdots\circ\mathcal{E}_1)(\rho_{\mathrm{in}}).
6247: \]
6248: This viewpoint is essential for two reasons:
6249: (i) it makes clear which features of the construction are stable under decoherence, and
6250: (ii) it is the natural language for renormalization, where discarding degrees of freedom is literally a partial trace.
6251: 
6252: \subsection{Shift/clock primitives as channel building blocks}
6253: For a cyclic qudit $\mathcal{H}_d$, the shift and clock unitaries $X_d,Z_d$ act on density operators by
6254: \[
6255: \rho\mapsto X_d\rho X_d^\dagger,\qquad \rho\mapsto Z_d\rho Z_d^\dagger.
6256: \]
6257: A coherent superposition of ticks is a state with nonzero off-diagonal terms in the $Z_d$-basis; phase noise (dephasing) is the channel
6258: \[
6259: \mathcal{D}_p(\rho)=(1-p)\rho + p\sum_{k\in\mathbb{Z}_d}\ket{k}\bra{k}\rho\ket{k}\bra{k},
6260: \]
6261: which kills those off-diagonal terms.
6262: This is precisely why the persistence diagnostics in Chapter~\ref{ch:persistence} are built to tolerate loss of phase coherence: they are defined on \emph{reduced density operators} and on invariants (entropies, mutual informations, correlation functions) that make sense for mixed states.
6263: 
6264: \subsection{From unitary ``ticks'' to open-system generators}
6265: If $T$ is a perfect unitary tick, the Hamiltonian-log construction $T=e^{-iH\Delta t/\hbar}$ lives on the unitary group.
6266: For noisy ticks, one instead has a channel $\mathcal{E}$ per tick, and the infinitesimal generator is a \emph{Liouvillian} superoperator $\mathcal{L}$ with
6267: \[
6268: \mathcal{E}\approx e^{\Delta t\,\mathcal{L}},\qquad
6269: \dot\rho = \mathcal{L}(\rho).
6270: \]
6271: In the Markovian setting, $\mathcal{L}$ has Lindblad form
6272: \begin{equation}
6273: \label{eq:lindblad_form}
6274: \mathcal{L}(\rho)
6275: = -\frac{i}{\hbar}[H,\rho]
6276: + \sum_j\Bigl(L_j\rho L_j^\dagger-\frac12\{L_j^\dagger L_j,\rho\}\Bigr).
6277: \end{equation}
6278: The same branch issues appear when taking a logarithm of $\mathcal{E}$: one must choose a branch for the spectrum of the superoperator on the complex unit disk, and gluing local choices becomes a holonomy constraint in the space of channels.
6279: This is the open-system analogue of the branch ambiguity discussed earlier for $T=e^{-iH\Delta t/\hbar}$.
6280: 
\chapter{Gluing local orders into global time holonomy} · lines 6281–6480
6281: \chapter{Gluing local orders into global time holonomy}
6282: 
6283: \label{ch:gluing}
6284: 
6285: 
6286: The main body sketches the slogan:
6287: \begin{center}
6288: \emph{local shifts glue to a global holonomy, and cyclic time is torsion holonomy.}
6289: \end{center}
6290: This chapter replaces the slogan by a concrete (and, crucially, \emph{cohomological}) framework.
6291: 
6292: \subsection{Orders as local operator algebras: sheaf language}
6293: \label{sec:sheaf_orders}
6294: 
6295: Let $X$ be an oriented surface (topological, smooth, or Riemann, depending on context).
6296: A \emph{surface order} in the sense of the  text is best regarded as a sheaf (or stack) of algebras on $X$ whose stalks are local matrix orders.
6297: 
6298: For this chapter we work in a simplified but robust model:
6299: 
6300: \begin{enumerate}
6301: \item Cover $X$ by open sets $\{U_i\}$ such that on each $U_i$ the order is isomorphic to a fixed hereditary order $\Lambda_{m_i}(R_i)$ as in \eqref{eq:hereditary_order}.
6302: \item On overlaps $U_{ij}=U_i\cap U_j$, glue by algebra isomorphisms
6303: \[
6304: g_{ij}:\Lambda|_{U_{ij}}\xrightarrow{\sim}\Lambda|_{U_{ij}}
6305: \]
6306: satisfying the cocycle condition $g_{ij}g_{jk}g_{ki}=\id$ on triple overlaps.
6307: \end{enumerate}
6308: 
6309: \begin{definition}[Gluing cocycle]
6310: The collection $\{g_{ij}\}$ is a \v{C}ech $1$--cocycle with values in the sheaf of groups $\Aut(\Lambda)$, hence defines a class
6311: \[
6312: [g]\in \check{H}^1(X;\Aut(\Lambda)).
6313: \]
6314: \end{definition}
6315: 
6316: \begin{remark}[Why cohomology is the right bookkeeping]
6317: The moment we say ``holonomy'', we have already committed to the fact that local data is not globally exact.
6318: Cohomology is precisely the formal language of ``locally exact, globally twisted''.
6319: \end{remark}
6320: 
6321: \subsection{Clock data as a normalizer-valued field}
6322: \label{sec:clock_field}
6323: 
6324: On each chart $U_i$ (typically centered at a vertex of the embedded graph), choose a \emph{clock operator}
6325: \[
6326: S_i\in N_{\GL_{m_i}(K_i)}(\Lambda_{m_i}(R_i)),
6327: \]
6328: where $N(\cdot)$ denotes the normalizer.
6329: In the cleanest hereditary situation we take $S_i=S_{m_i}(\pi_i)$ from \eqref{eq:twisted_shift_def}.
6330: 
6331: The physical meaning is: $S_i$ is a distinguished local unitary (or projective unitary) generating the local ``tick'' symmetry.
6332: The mathematical meaning is: $S_i$ is an element with conjugation action that preserves the local order, hence is compatible with gluing.
6333: 
6334: \begin{definition}[Clocked surface order]
6335: A \emph{clocked surface order} is a pair $(\Lambda,S)$ where $\Lambda$ is a surface order and $S=\{S_i\}$ is a choice of normalizer elements on a cover, subject to the compatibility condition
6336: \[
6337: S_j = g_{ij} S_i g_{ij}^{-1}\qquad \text{on }U_{ij}.
6338: \]
6339: \end{definition}
6340: 
6341: Compatibility says exactly that ``clock operators glue as a section of a twisted bundle''.
6342: 
6343: \subsection{Holonomy as a representation of the fundamental group}
6344: \label{sec:holonomy_rep}
6345: 
6346: Given the cocycle data, we can extract holonomy along loops.
6347: 
6348: Fix a basepoint $x\in X$ and a loop $\gamma$ represented by a chain of overlaps
6349: \[
6350: U_{i_0}\supset U_{i_0i_1}\supset U_{i_1}\supset \cdots \supset U_{i_{n-1}i_n}\supset U_{i_n}=U_{i_0}.
6351: \]
6352: Define the holonomy element
6353: \[
6354: \Hol_g(\gamma):=g_{i_0i_1}g_{i_1i_2}\cdots g_{i_{n-1}i_n}\in \Aut(\Lambda_{x}).
6355: \]
6356: 
6357: \begin{proposition}
6358: \label{prop:holonomy_rep}
6359: Up to conjugacy, $\Hol_g(\gamma)$ depends only on the homotopy class $[\gamma]\in\pi_1(X,x)$, and the map
6360: \[
6361: \Hol_g:\pi_1(X,x)\to \Out(\Lambda_x)
6362: \]
6363: is a group homomorphism.
6364: \end{proposition}
6365: 
6366: \begin{proof}
6367: Standard \v{C}ech-to-fundamental-group correspondence: refining covers and changing representatives corresponds to inserting cancelling pairs $g_{ij}g_{ji}=\id$.
6368: Dependence on basepoint yields conjugacy.
6369: \end{proof}
6370: 
6371: \begin{remark}[The correct target]
6372: For physics, global time is a projective concept: conjugation by a local unitary is gauge.
6373: Thus the natural target is an \emph{outer} automorphism group, or projective normalizers.
6374: This aligns with Proposition~\ref{prop:twisted_shift_power}, where the projective class of a twisted shift is torsion even if the linear class is not.
6375: \end{remark}
6376: 
6377: \subsection{Time holonomy: gluing the clock field}
6378: \label{sec:time_holonomy_gluing}
6379: 
6380: When the clock field $S$ is compatible with the cocycle, it becomes meaningful to transport $S$ around a loop.
6381: 
6382: Let $S_{i_0}$ be the clock operator in the chart containing the basepoint.
6383: Transporting it around $\gamma$ produces
6384: \[
6385: S_{i_0}\longmapsto \Hol_g(\gamma)\, S_{i_0}\, \Hol_g(\gamma)^{-1}.
6386: \]
6387: If this equals $S_{i_0}$, the loop preserves the clock; if not, the loop changes clock phase/rate.
6388: 
6389: This motivates the operational definition:
6390: 
6391: \begin{definition}[Time holonomy subgroup]
6392: The \emph{time holonomy subgroup} is the subgroup
6393: \[
6394: \cH_{\mathrm{time}}:=\{\Hol_g(\gamma)\in \Out(\Lambda_x)\ :\ \gamma\in\pi_1(X)\}.
6395: \]
6396: \end{definition}
6397: 
6398: \begin{definition}[Cyclic time and projective cyclic time]
6399: We say the clocked order has:
6400: \begin{itemize}
6401: \item \emph{cyclic time} if $\cH_{\mathrm{time}}$ is finite;
6402: \item \emph{projectively cyclic time} if the induced subgroup in a projective quotient (e.g.\ $\PGL$ or $\Out/\text{center}$) is finite.
6403: \end{itemize}
6404: \end{definition}
6405: 
6406: Projective cyclicity is the robust notion when local twisted shifts satisfy $S^m=\pi I$.
6407: 
6408: \subsection{Explicit gluing: pants $\rightarrow$ torus and the holonomy operator}
6409: \label{sec:pants_torus}
6410: 
6411: We now make the ``IKEA'' comment in  \S3.7 mathematically concrete.
6412: 
6413: Consider a pair of pants $P$ with boundary components $C_1,C_2,C_3$.
6414: Assign to each boundary component a local clock algebra with shift $S_i$ (finite or infinite).
6415: Gluing $C_1$ to $C_2$ produces a surface $T$ with one boundary component (a once-punctured torus).
6416: The gluing identifies the corresponding idempotents and imposes a constraint that the boundary shifts are inverses up to conjugacy:
6417: \[
6418: S_2 \sim g S_1^{-1} g^{-1}
6419: \]
6420: for a gluing element $g$ determined by the identification.
6421: 
6422: \begin{proposition}[Holonomy on the glued handle]
6423: \label{prop:handle_holonomy}
6424: Let $\alpha$ be the core loop of the handle created by gluing $C_1$ to $C_2$.
6425: Then the time holonomy along $\alpha$ is represented (up to conjugacy) by the product
6426: \[
6427: H_\alpha \;\sim\; S_1\, g\, S_2\, g^{-1}.
6428: \]
6429: If $S_2\sim g S_1^{-1} g^{-1}$ exactly, then $H_\alpha$ is central.
6430: If $S_1$ and $S_2$ are twisted shifts, centrality yields a $\pi$--power in the center.
6431: \end{proposition}
6432: 
6433: \begin{proof}[Proof sketch]
6434: Track the clock operator around the handle: traverse boundary $C_1$ (apply $S_1$), cross the seam (apply $g$), traverse $C_2$ (apply $S_2$), cross back (apply $g^{-1}$).
6435: \end{proof}
6436: 
6437: \begin{remark}[Where gravity enters]
6438: If entanglement changes the effective local valuation parameters $\pi_i$ (see Section~\ref{ch:expts}), then even when the topological gluing is fixed, the holonomy can drift from torsion to non-torsion.
6439: This is the clean conceptual place where ``more entanglement $\Rightarrow$ slower time'' can be encoded: increased entanglement modifies the local clock generator, which changes holonomy spectra.
6440: \end{remark}
6441: 
6442: \subsection{Nilpotent/unipotent truncations as bounded drift}
6443: \label{sec:unipotent}
6444: 
6445: The  main body proposes nilpotent/unipotent truncations to model ``almost cyclic'' time ( Part~V).
6446: We record a minimal algebraic model that interacts nicely with gluing cocycles.
6447: 
6448: \begin{definition}[Unipotent truncation]
6449: Fix $N\ge 1$ and define the unipotent quotient of the Laurent polynomial algebra
6450: \[
6451: k[t,t^{-1}] \twoheadrightarrow k[t,t^{-1}]/(t-1)^N.
6452: \]
6453: The image of $t$ acts as a unipotent operator $U=1+J$ with $J^N=0$.
6454: \end{definition}
6455: 
6456: \begin{proposition}
6457: \label{prop:unipotent_holonomy}
6458: If each local clock generator is unipotent of order $N$ in the above sense, then the holonomy subgroup $\cH_{\mathrm{time}}$ is nilpotent-by-finite: its image in the semisimple quotient is finite, and its kernel is a nilpotent group of exponent bounded by $N$ (in typical finite-dimensional realizations).
6459: \end{proposition}
6460: 
6461: \begin{remark}
6462: This proposition formalizes what the physics language calls ``bounded drift'': time may not close exactly, but its failure to close is polynomially controlled.
6463: \end{remark}
6464: 
6465: \subsection{Cohomological obstructions and a practical checklist}
6466: \label{sec:checklist}
6467: 
6468: For the reader trying to implement the theory (either mathematically or on hardware), it is useful to isolate three checkable conditions.
6469: 
6470: \begin{enumerate}
6471: \item \textbf{Local normalizer condition:} each intended clock operator $S_i$ must normalize the local order; in hereditary models this is Lemma~\ref{lem:twisted_shift_normalizes}.
6472: \item \textbf{Cocycle consistency:} gluing maps must satisfy the \v{C}ech cocycle condition; failure indicates an inconsistent surface order (or an overlooked orbifold point).
6473: \item \textbf{Holonomy classification:} compute $\Hol_g(\gamma)$ on a generating set of $\pi_1(X)$.
6474: Cyclic time corresponds to finiteness (or projective finiteness) of the generated subgroup.
6475: \end{enumerate}
6476: 
6477: These are the exact places where multiparameter persistence becomes useful:
6478: when the cocycle data is derived from noisy/estimated entanglement measurements, one expects \emph{stability} of the induced holonomy class under controlled perturbations.
6479: Section~\ref{ch:persistence} turns this into computable invariants.
6480: 
\chapter{Hyperbolic surfaces, quotients, and why infinite covers are structurally unavoidable} · lines 6481–6668
6481: \chapter{Hyperbolic surfaces, quotients, and why infinite covers are structurally unavoidable}
6482: 
6483: \label{ch:hyperbolic}
6484: 
6485: 
6486: The  main body motivates hyperbolic quotients briefly ( \S6.7), mainly to justify why $\Z$--indexed (infinite-cyclic) clocks appear naturally.
6487: This chapter expands that discussion in a way that is intended to be \emph{mathematically checkable}.
6488: 
6489: \subsection{The hyperbolic plane as the universal local model}
6490: \label{sec:H_model}
6491: \label{sec:hyperbolic_plane}
6492: 
6493: We use the upper half-plane model
6494: \[
6495: \HH=\{z=x+iy\in\C : y>0\}
6496: \]
6497: with hyperbolic metric
6498: \begin{equation}
6499: \label{eq:hyperbolic_metric}
6500: ds^2=\frac{dx^2+dy^2}{y^2}.
6501: \end{equation}
6502: The group $\PSL(2,\R)$ acts by Möbius transformations
6503: \[
6504: z\longmapsto \frac{az+b}{cz+d},\qquad \begin{pmatrix}a&b\\c&d\end{pmatrix}\in \PSL(2,\R),
6505: \]
6506: and this action is by orientation-preserving isometries of \eqref{eq:hyperbolic_metric}.
6507: 
6508: \begin{definition}[Fuchsian group]
6509: A \emph{Fuchsian group} is a discrete subgroup $\Gamma\le \PSL(2,\R)$.
6510: The quotient $\HH/\Gamma$ is a (possibly orbifold) hyperbolic surface; it has finite area if and only if $\Gamma$ is a lattice.
6511: \end{definition}
6512: 
6513: The basic structural fact we will repeatedly use is that \emph{every hyperbolic surface is a quotient of $\HH$}.
6514: The ``local-to-global'' mechanism in this volume is an algebraic analogue: local vertex orders behave like ``charts'', and gluing data behaves like a discrete connection whose holonomy lives in an automorphism group.
6515: 
6516: \subsection{Triangle groups, constellations, and dessins as quotients}
6517: \label{sec:triangle_groups}
6518: 
6519: A recurrent constellation in the source material is the $(p,q,r)$ triangle-group presentation
6520: \begin{equation}
6521: \label{eq:triangle_group}
6522: \Delta(p,q,r)=\langle \gamma_0,\gamma_1,\gamma_\infty \mid \gamma_0^p=\gamma_1^q=\gamma_\infty^r=\gamma_0\gamma_1\gamma_\infty=1\rangle.
6523: \end{equation}
6524: As noted in the source text reproduced in Appendix~A of the volume, this is one natural bridge between permutation (dessin) data and hyperbolic orbifolds.
6525: 
6526: \begin{proposition}[From dessins to orbifold quotients (sketch-level)]
6527: \label{prop:dessin_to_orbifold}
6528: Let $(\sigma_0,\sigma_1,\sigma_\infty)$ be a transitive permutation triple with $\sigma_0\sigma_1\sigma_\infty=1$.
6529: Then there is a finite-index subgroup $\Gamma\le \Delta(p,q,r)$ (for suitable $(p,q,r)$ determined by cycle lengths) and a branched covering map
6530: \[
6531: f:\HH/\Gamma \to \HH/\Delta(p,q,r)\cong \mathbb{P}^1(\C)
6532: \]
6533: ramified only above three orbifold points.
6534: \end{proposition}
6535: 
6536: \begin{remark}
6537: This proposition is a modern restatement of the fact that dessins are equivalent to Belyi maps.
6538: We \emph{do not} need arithmetic in order to use the quotient geometry; what we need is the existence of a hyperbolic universal cover and a discrete group acting with controlled stabilizers.
6539: \end{remark}
6540: 
6541: The reason hyperbolic quotients belong in the present theory is not only ``because modular curves exist'', but because they provide \emph{canonical infinite cellulations} (e.g.\ Farey tessellation) whose deck actions realize the $\Z$--type shifts that later become clock operators.
6542: 
6543: \subsection{Cellulations, ribbon graphs, and induced quivers on $\HH/\Gamma$}
6544: \label{sec:cellulations}
6545: 
6546: Fix a finite-area hyperbolic surface (or orbifold) $X=\HH/\Gamma$.
6547: A standard way to put combinatorics on $X$ is:
6548: 
6549: \begin{enumerate}
6550: \item pick a $\Gamma$--invariant tessellation $\mathcal{T}$ of $\HH$ by ideal polygons (or by geodesic triangles);
6551: \item descend $\mathcal{T}$ to a finite (or locally finite) cell structure on $X$.
6552: \end{enumerate}
6553: 
6554: The \emph{directed medial quiver} construction (used heavily in the surface-algebra material presented in earlier sections) applies verbatim to any oriented cellulation: for each face, run arrows along medial vertices counterclockwise.
6555: 
6556: \begin{definition}[Locally finite surface algebra from a hyperbolic cellulation]
6557: Let $\mathcal{T}$ be a locally finite, oriented cellulation of $\HH$ invariant under $\Gamma$.
6558: Let $Q(\mathcal{T})$ be its directed medial quiver.
6559: Define the \emph{hyperbolic surface algebra} as the completed path algebra
6560: \[
6561: A(\mathcal{T}) := k\langle\!\langle Q_1\rangle\!\rangle / I,
6562: \]
6563: where $I$ is a gentle-style ideal generated by length-$2$ forbidden turns determined by the local incidence constraints of $\mathcal{T}$.
6564: \end{definition}
6565: 
6566: Because $\mathcal{T}$ is infinite on $\HH$, $Q(\mathcal{T})$ is infinite and the completion is not optional.
6567: Finite quotients correspond to taking $\Gamma'$ of finite index and passing to $X'=\HH/\Gamma'$; the quiver becomes finite if the quotient cellulation is finite.
6568: 
6569: \subsection{Why $\Z$--indexed clocks appear: deck transformations as time translations}
6570: \label{sec:deck_time}
6571: 
6572: The  text already defines an infinite-cyclic qudit as $\ell^2(\Z)$ with bilateral shift $T|n\rangle=|n+1\rangle$ ( \S3.5).
6573: Here is the geometric reason this is the \emph{correct} representation-theoretic object.
6574: 
6575: \begin{definition}[Winding number cocycle]
6576: Let $X=\HH/\Gamma$ be a surface with at least one essential loop $\alpha\in\pi_1(X)$.
6577: Fix a basepoint and identify $\pi_1(X)$ with a subgroup of deck transformations of $\HH$.
6578: For a chosen embedded graph $\Gamma_0\subset X$ inducing a cellulation, define a function
6579: \[
6580: w:\pi_1(X)\to \Z
6581: \]
6582: by taking a lift of $\alpha$ to $\HH$ and counting algebraically how many times it crosses a chosen fundamental cycle in the lift of $\Gamma_0$.
6583: \end{definition}
6584: 
6585: This is a $\Z$--valued group $1$--cocycle in the sense that $w(\alpha\beta)=w(\alpha)+w(\beta)$.
6586: It therefore gives a unitary representation of the $\Z$--quotient of $\pi_1(X)$ on $\ell^2(\Z)$ by shifts.
6587: 
6588: \begin{proposition}[Deck-action representation yields the bilateral shift]
6589: \label{prop:deck_shift}
6590: Let $\langle t\rangle\cong \Z$ be a cyclic quotient of $\pi_1(X)$ detected by a winding cocycle $w$.
6591: Then the induced representation on $\ell^2(\Z)$ satisfies
6592: \[
6593: \rho(t)|n\rangle = |n+1\rangle,
6594: \]
6595: i.e.\ $\rho(t)$ is the bilateral shift.
6596: \end{proposition}
6597: 
6598: \begin{proof}
6599: Represent $t$ by a deck transformation that advances the lift of the fundamental cycle by one.
6600: The basis vector $|n\rangle$ is identified with the $n$-th translate of a chosen reference tile in $\HH$.
6601: Applying $t$ moves the reference tile forward by one translate, hence $|n\rangle\mapsto |n+1\rangle$.
6602: \end{proof}
6603: 
6604: \begin{remark}[Finite vs infinite time]
6605: Finite $d$--qudits arise precisely when the relevant deck action is \emph{torsion in an appropriate quotient}---for example, after passing to a finite cover and quotienting by a period.
6606: The twisted-shift relation $S_m(\pi)^m=\pi I$ (Proposition~\ref{prop:twisted_shift_power}) is an algebraic analogue: time is cyclic \emph{projectively} even if not cyclic in $\GL$.
6607: \end{remark}
6608: 
6609: \subsection{Hyperbolic distance, combinatorial distance, and entanglement distance}
6610: \label{sec:distances}
6611: 
6612: The emergent-geometry layer of the  text assigns an entanglement-derived weight $w_\psi(u,v)$ on edges and builds an effective distance $d_\psi$ (Chapter~7).
6613: On a hyperbolic surface we have three conceptually distinct distances:
6614: 
6615: \begin{enumerate}
6616: \item $d_{\mathrm{hyp}}$: the intrinsic hyperbolic geodesic distance on $X$,
6617: \item $d_{\mathrm{comb}}$: the graph metric on the $1$--skeleton of a chosen cellulation,
6618: \item $d_\psi$: an information-theoretic metric (or pseudometric) induced by a quantum state.
6619: \end{enumerate}
6620: 
6621: A coherent continuum-limit story must control the relationships among them.
6622: 
6623: \begin{proposition}[Quasi-isometry of hyperbolic and combinatorial metrics]
6624: \label{prop:quasi_isometry}
6625: Let $X$ be a finite-area hyperbolic surface and $\mathcal{T}$ a finite-type geodesic triangulation with bounded geometry (uniform bounds on edge lengths and angles).
6626: Then $(X,d_{\mathrm{hyp}})$ is quasi-isometric to the $1$--skeleton $(\mathcal{T}^{(1)},d_{\mathrm{comb}})$.
6627: \end{proposition}
6628: 
6629: \begin{proof}[Proof sketch]
6630: Standard in geometric group theory: bounded-geometry triangulations give uniform bilipschitz control between piecewise-geodesic paths along edges and true geodesics.
6631: \end{proof}
6632: 
6633: \begin{definition}[Entanglement distance from mutual information]
6634: Fix a state $|\psi\rangle$ on a graph of local algebras.
6635: For vertices $u,v$ define a weight $I(u\!:\!v)$ (e.g.\ mutual information or a Renyi proxy) and set
6636: \[
6637: \ell_\psi(u,v):=\max\{0,\,-\log(I(u\!:\!v)/I_0)\},
6638: \]
6639: where $I_0$ is a reference scale making the logarithm dimensionless.
6640: Define $d_\psi$ as the shortest-path metric with edge lengths $\ell_\psi$.
6641: \end{definition}
6642: 
6643: \begin{remark}[Units]
6644: Mutual information is measured in \emph{bits} (or nats), hence dimensionless.
6645: The logarithm therefore produces a dimensionless length.
6646: To compare to $d_{\mathrm{hyp}}$ one must insert a length scale $\ell_*$ (e.g.\ average edge length of the cellulation): $d^{\mathrm{phys}}_\psi=\ell_*\, d_\psi$.
6647: \end{remark}
6648: 
6649: The mathematical burden of the emergent-gravity program is now clear:
6650: one needs conditions under which $d_\psi$ becomes quasi-isometric to $d_{\mathrm{comb}}$ (and hence to $d_{\mathrm{hyp}}$) in a scaling limit.
6651: Section~\ref{ch:persistence} makes this quantitative using multiparameter persistence stability.
6652: 
6653: \subsection{A worked hyperbolic example: modular tessellations and quotient dessins}
6654: \label{sec:worked_modular}
6655: 
6656: The modular group $\PSL(2,\Z)$ acts on $\HH$ with fundamental domain a hyperbolic triangle of angles $(0,\pi/3,\pi/2)$.
6657: The Farey tessellation is a $\PSL(2,\Z)$--invariant ideal triangulation of $\HH$.
6658: Finite-index subgroups $\Gamma\le\PSL(2,\Z)$ yield quotient surfaces (modular curves) equipped with descended triangulations, and these quotients can be encoded combinatorially as dessins/hypermaps.
6659: 
6660: For our purposes, the key point is:
6661: 
6662: \begin{quote}
6663: \emph{Modular quotients provide a canonical laboratory where (i) surface orders have arithmetic meaning, (ii) cellulations are hyperbolic, and (iii) deck actions are explicit.}
6664: \end{quote}
6665: 
6666: In Section~\ref{ch:hilbertpolya} we use this to propose concrete numerical tests for a Hilbert--Pólya-style spectral program: modular surfaces give operators with trace formulas, while surface-order clocks supply natural internal shifts that can be coupled to those operators.
6667: 
6668: 
\chapter{Entanglement \texorpdfstring{$\to$}{->} metric \texorpdfstring{$\to$}{->} Einstein limit: a deeper modeling layer} · lines 6669–6995
6669: \chapter{Entanglement \texorpdfstring{$\to$}{->} metric \texorpdfstring{$\to$}{->} Einstein limit: a deeper modeling layer}
6670: 
6671: \label{ch:gravity}
6672: 
6673: One remarkable feature of quantum systems is that entanglement structure can be converted into geometric data: by quantifying correlations between subsystems, one obtains distance metrics on graphs, and these metrics can exhibit features reminiscent of gravitational geometry. This chapter makes this correspondence precise and explores how the clocked surface-order framework can naturally produce emergent Einstein-like equations.
6674: 
6675: The  main body (Chapter~7) introduces an emergent-gravity dictionary based on entanglement-induced distances on graphs and a qualitative redshift mechanism.
6676: This chapter expands the physics/mathematics interface in a way that is compatible with the surface-order and persistence machinery developed earlier.
6677: 
6678: \subsection{Indication $\rightarrow$ guidepost $\rightarrow$ endpoint (the experimental posture)}
6679: \label{sec:ibe}
6680: 
6681: Because ``emergent gravity'' is a large claim, it is useful to phrase the program as an indication/guidepost/endpoint pipeline:
6682: 
6683: \begin{itemize}
6684: \item \textbf{Indication:} Does a clocked surface-order system exhibit an operational redshift: locally defined clock rates depend on a state-dependent ``gravitational potential''?
6685: \item \textbf{Guidepost:} A stable, state-dependent metric-like object (distance matrix or graph metric) extracted from entanglement, whose curvature-like summaries vary predictably with entanglement gradients.
6686: \item \textbf{Endpoint:} In a refinement/coarse-graining limit, do these metric-like objects converge (in a precise sense) to a smooth Lorentzian/Riemannian metric satisfying Einstein-like equations?
6687: \end{itemize}
6688: 
6689: The purpose of multiparameter persistence (Section~\ref{ch:persistence}) is to make the \emph{guidepost} stable and computable; the purpose of surface orders is to make the \emph{indication} structurally constrained by gluing/holonomy.
6690: 
6691: \subsection{From entanglement to an effective metric: assumptions and definitions}
6692: \label{sec:ent_to_metric}
6693: 
6694: Let $\Gamma$ be an embedded graph with vertices $V$ and edges $E$.
6695: Let $|\psi\rangle$ be a state on $\bigotimes_{v\in V}\cH_v$.
6696: 
6697: \subsubsection{Assumption A (locality)}
6698: We assume correlations decay with graph distance in the absence of special structure.
6699: Operationally: $I(u\!:\!v)$ is largest for $u,v$ near each other in $d_{\mathrm{comb}}$.
6700: 
6701: \subsubsection{Assumption B (monotone length assignment)}
6702: Choose a monotone map from correlation to edge length.
6703: A canonical family is:
6704: \begin{equation}
6705: \label{eq:length_from_I}
6706: \ell_\psi(u,v) = \ell_*\, f\!\left(I(u\!:\!v)\right),\qquad f' < 0,
6707: \end{equation}
6708: where $\ell_*$ is a physical length scale.
6709: 
6710: The simple logarithmic choice used earlier is $f(I)=-\log(I/I_0)$; alternatives include $f(I)=I^{-1}$ or soft-thresholded versions to handle noise.
6711: 
6712: \subsubsection{Path metric}
6713: Define the induced path metric
6714: \[
6715: d_\psi(u,v)=\inf_{\gamma:u\to v}\sum_{(a,b)\in\gamma}\ell_\psi(a,b).
6716: \]
6717: 
6718: \begin{lemma}[Metric well-posedness]
6719: If $\ell_\psi(u,v)>0$ on edges and $\ell_\psi$ is symmetric, then $d_\psi$ is a metric on each connected component of $\Gamma$.
6720: If some edges have $\ell_\psi=0$ (perfect correlation), $d_\psi$ is a pseudometric.
6721: \end{lemma}
6722: 
6723: \subsection{Curvature surrogates on graphs}
6724: \label{sec:curvature_graph}
6725: 
6726: A metric on a discrete set does not automatically yield curvature.
6727: There are multiple curvature notions in discrete geometry (Ollivier--Ricci, Forman curvature, angle defects in triangulations).
6728: For surface-embedded graphs there is a particularly natural choice.
6729: 
6730: \subsubsection{Angle defect curvature for embedded triangulations}
6731: Assume $\Gamma$ is the 1-skeleton of a triangulation.
6732: Assign an \emph{effective edge length} $\ell_\psi$ and define triangle angles via Euclidean or hyperbolic cosine laws (depending on target geometry).
6733: Then at a vertex $v$, define the angle defect
6734: \[
6735: \kappa_\psi(v) := 2\pi - \sum_{\triangle\ni v} \theta_\triangle(v).
6736: \]
6737: This is a discrete Gauss curvature.
6738: 
6739: \begin{remark}[Target geometry choice]
6740: If the underlying surface is hyperbolic (Section~\ref{ch:hyperbolic}), using hyperbolic triangle laws is natural.
6741: If one aims for an emergent Lorentzian picture, one instead works with causal diamonds and modular Hamiltonians; we return to this below.
6742: \end{remark}
6743: 
6744: \subsubsection{Ollivier--Ricci as a metric-only surrogate}
6745: When only a metric is available (no embedding), Ollivier--Ricci curvature is defined by comparing Wasserstein distances between neighborhood measures.
6746: This is computationally expensive at $10^4$ vertices but feasible on local patches.
6747: 
6748: \subsection{Relational time, modular flow, and the redshift mechanism}
6749: \label{sec:relational_time}
6750: 
6751: In operator-algebraic language, a region $A$ has reduced state $\rho_A$ and modular Hamiltonian $K_A=-\log\rho_A$.
6752: Modular flow
6753: \[
6754: \sigma_A^t(O)=e^{itK_A}Oe^{-itK_A}
6755: \]
6756: is a canonical dynamics \emph{intrinsic} to the state.
6757: 
6758: The program's clock operators $S_v$ supply a \emph{kinematic} time basis.
6759: Entanglement then modifies how the state explores that basis.
6760: A minimal phenomenological model is:
6761: 
6762: \begin{definition}[Clock rate functional]
6763: Fix a local clock observable $N_v$ (e.g.\ the ``position'' basis index) and define clock rate at $v$ by
6764: \[
6765: r_v := \frac{d}{dt}\langle N_v\rangle_{\psi(t)}
6766: \]
6767: under a chosen global evolution (circuit layer, modular flow, or physical Hamiltonian).
6768: \end{definition}
6769: 
6770: \subsubsection{Redshift ansatz}
6771: Let $\varepsilon_v$ be an entanglement density proxy, for instance
6772: \[
6773: \varepsilon_v := \frac{1}{\deg(v)}\sum_{u\sim v} I(v\!:\!u).
6774: \]
6775: Postulate
6776: \begin{equation}
6777: \label{eq:redshift_ansatz}
6778: r_v \approx r_0\,e^{-\alpha \varepsilon_v}.
6779: \end{equation}
6780: For small $\alpha\varepsilon_v$, $r_v\approx r_0(1-\alpha\varepsilon_v)$.
6781: 
6782: \begin{remark}[Units]
6783: $r_v$ has units of inverse time.
6784: $\varepsilon_v$ is dimensionless (bits).
6785: Therefore $\alpha$ has units of inverse bits.
6786: To compare to GR redshift $d\tau=\sqrt{-g_{tt}}\,dt\approx (1-\Phi/c^2)dt$, we interpret
6787: \[
6788: \Phi_v/c^2 \;\sim\; \alpha\, \varepsilon_v.
6789: \]
6790: Thus $\Phi_v$ (potential) is proportional to entanglement density, with proportionality constant $c^2\alpha$.
6791: \end{remark}
6792: 
6793: 
6794: 
6795: \subsection{Modular Hamiltonians, relative entropy, and finite-dimensional proofs}
6796: \label{sec:modular_entropy_proofs}
6797: 
6798: The modular Hamiltonian $K_A=-\log\rho_A$ is the correct \emph{operator} object that packages both entanglement and an intrinsic notion of time.
6799: Because the present framework is discretized (finite-dimensional on each patch), we can be explicit and prove the standard entanglement ``first law'' statements directly in matrix-analysis terms, without field-theoretic subtleties.
6800: 
6801: \subsubsection{Definition, support, and a practical regularization}
6802: If $\rho_A$ is full rank, then $K_A$ is a bounded self-adjoint operator with spectral decomposition
6803: \[
6804: \rho_A=\sum_i p_i \ket{i}\bra{i},\qquad p_i>0,\quad \sum_i p_i=1,
6805: \]
6806: \[
6807: K_A=-\log\rho_A = \sum_i (-\log p_i)\ket{i}\bra{i}.
6808: \]
6809: If $\rho_A$ has zero eigenvalues, the logarithm diverges.
6810: Conceptually one works on the support $\mathrm{supp}(\rho_A)$; numerically, a stable regularization is
6811: \begin{equation}
6812: \label{eq:rho_eps_regularization}
6813: \rho_A^{(\epsilon)}:=(1-\epsilon)\rho_A+\epsilon\frac{I}{\dim\mathcal{H}_A},\qquad
6814: K_A^{(\epsilon)}:=-\log\rho_A^{(\epsilon)},
6815: \end{equation}
6816: with $\epsilon\downarrow 0$.
6817: All statements below remain valid under this regularization provided variations stay within the support in the $\epsilon\to 0$ limit.
6818: 
6819: \subsubsection{Relative entropy positivity (a finite-dimensional proof)}
6820: For states $\rho,\sigma\succeq 0$ with $\Tr\rho=\Tr\sigma=1$, the (Umegaki) quantum relative entropy is
6821: \[
6822: S(\rho\|\sigma):=\Tr\bigl(\rho(\log\rho-\log\sigma)\bigr),
6823: \]
6824: with the convention $S(\rho\|\sigma)=+\infty$ if $\mathrm{supp}(\rho)\not\subseteq \mathrm{supp}(\sigma)$.
6825: 
6826: \begin{proposition}[Positivity of relative entropy]
6827: \label{prop:relative_entropy_positive}
6828: For density operators $\rho,\sigma$ on a finite-dimensional Hilbert space,
6829: \[
6830: S(\rho\|\sigma)\ge 0,
6831: \]
6832: with equality iff $\rho=\sigma$.
6833: \end{proposition}
6834: 
6835: \begin{proof}
6836: Assume first that $\rho$ and $\sigma$ are full rank (otherwise use the regularization \eqref{eq:rho_eps_regularization} and continuity on the common support).
6837: For $\alpha\in(0,1)$ define the Petz--Rényi divergence
6838: \[
6839: D_\alpha(\rho\|\sigma):=\frac{1}{\alpha-1}\log \Tr(\rho^\alpha \sigma^{1-\alpha}).
6840: \]
6841: By H\"older's inequality for Schatten norms,
6842: \[
6843: \Tr(\rho^\alpha \sigma^{1-\alpha})
6844: \le \|\rho^\alpha\|_{1/\alpha}\,\|\sigma^{1-\alpha}\|_{1/(1-\alpha)}
6845: = (\Tr\rho)^\alpha\,(\Tr\sigma)^{1-\alpha}
6846: = 1.
6847: \]
6848: Hence $\log \Tr(\rho^\alpha \sigma^{1-\alpha})\le 0$, and since $\alpha-1<0$ it follows that $D_\alpha(\rho\|\sigma)\ge 0$ for all $\alpha\in(0,1)$.
6849: 
6850: Finally, the limit $\alpha\uparrow 1$ recovers the Umegaki relative entropy:
6851: using $\frac{d}{d\alpha}\rho^\alpha=\rho^\alpha\log\rho$ and $\frac{d}{d\alpha}\sigma^{1-\alpha}=-\sigma^{1-\alpha}\log\sigma$, one checks
6852: \[
6853: \left.\frac{d}{d\alpha}\Tr(\rho^\alpha \sigma^{1-\alpha})\right|_{\alpha=1}
6854: =\Tr\bigl(\rho(\log\rho-\log\sigma)\bigr)=S(\rho\|\sigma),
6855: \]
6856: and L'Hospital's rule yields $\lim_{\alpha\uparrow 1}D_\alpha(\rho\|\sigma)=S(\rho\|\sigma)$.
6857: Therefore $S(\rho\|\sigma)\ge 0$.
6858: 
6859: Equality holds only if H\"older's inequality is tight, which forces $\rho^\alpha$ and $\sigma^{1-\alpha}$ to be proportional in Schatten norm for some $\alpha\in(0,1)$, hence $\rho=\sigma$ after normalization.
6860: \end{proof}
6861: 
6862: \subsubsection{First law of entanglement as a corollary}
6863: Fix a full-rank reference state $\sigma$ and consider a differentiable curve of states $\rho(\epsilon)$ with $\rho(0)=\sigma$ and $\Tr(\rho(\epsilon))=1$.
6864: Since $S(\rho(\epsilon)\|\sigma)\ge 0$ with equality at $\epsilon=0$, we have $\frac{d}{d\epsilon}S(\rho(\epsilon)\|\sigma)\big|_{\epsilon=0}=0$.
6865: Writing out the derivative gives the entanglement ``first law'':
6866: 
6867: \begin{corollary}[First law of entanglement]
6868: \label{cor:first_law_entanglement}
6869: Let $\sigma$ be full rank and $\rho(\epsilon)$ a differentiable curve with $\rho(0)=\sigma$.
6870: Then
6871: \[
6872: \left.\frac{d}{d\epsilon}S(\rho(\epsilon))\right|_{\epsilon=0}
6873: =
6874: \left.\frac{d}{d\epsilon}\Tr(\rho(\epsilon)\,K_\sigma)\right|_{\epsilon=0},
6875: \qquad K_\sigma:=-\log\sigma,
6876: \]
6877: where $S(\rho)=-\Tr(\rho\log\rho)$ is the von Neumann entropy.
6878: \end{corollary}
6879: 
6880: \begin{proof}
6881: Differentiate $S(\rho(\epsilon)\|\sigma)=\Tr(\rho(\epsilon)(\log\rho(\epsilon)-\log\sigma))$ at $\epsilon=0$.
6882: The derivative of $\Tr(\rho(\epsilon)\log\rho(\epsilon))$ at $\epsilon=0$ equals $\Tr(\rho'(0)(\log\sigma+I))$ (Fr\'echet derivative of $\rho\mapsto \Tr(\rho\log\rho)$), and $\Tr(\rho'(0))=0$.
6883: Thus
6884: \[
6885: 0=\left.\frac{d}{d\epsilon}S(\rho(\epsilon)\|\sigma)\right|_{\epsilon=0}
6886: = -\left.\frac{d}{d\epsilon}S(\rho(\epsilon))\right|_{\epsilon=0}
6887: -\Tr(\rho'(0)\log\sigma),
6888: \]
6889: which is the stated identity.
6890: \end{proof}
6891: 
6892: \subsubsection{Why this matters for emergent geometry}
6893: The ``redshift ansatz'' \eqref{eq:redshift_ansatz} implicitly treats entanglement as modifying local clock rates.
6894: Corollary~\ref{cor:first_law_entanglement} makes that relationship operator-theoretic: small state variations change entropies and modular energies in lockstep.
6895: In the holographic literature, this is the algebraic root of the entanglement-equilibrium route to Einstein's equation; in our discrete setting it becomes a checkable matrix identity on reduced density operators extracted from the ribbon-graph state.
6896: 
6897: \subsubsection{Practical computation on graph patches}
6898: Given a patch $A$ with Hilbert space dimension $D=d^{|A|}$, computing $K_A=-\log\rho_A$ requires an eigendecomposition of a $D\times D$ matrix.
6899: For small $|A|$ (1--6 qudits) this is feasible; for larger patches one should instead work with:
6900: (i) moments $\Tr(\rho_A^n)$, (ii) R\'enyi entropies, or (iii) low-rank approximations obtained by tensor-network compression.
6901: From the present perspective the important point is that all these quantities are functions of the density operator, hence are stable under global phase and compatible with mixed/noisy states.
6902: 
6903: \subsection{Einstein limit via entanglement equilibrium: what must be assumed}
6904: \label{sec:einstein_limit}
6905: 
6906: A conceptual route to Einstein equations from entanglement is the entanglement-equilibrium idea:
6907: for small causal diamonds, extremizing entanglement entropy at fixed volume yields Einstein's equation.
6908: We translate the logic into the present discrete setting and clearly mark what is assumption versus derivation.
6909: 
6910: \subsubsection{Assumptions}
6911: \begin{enumerate}
6912: \item \textbf{Local equilibrium:} on sufficiently small regions $A$ (patches around vertices), the state is close to a reference state for which a first-law variation holds:
6913: \[
6914: \delta S(A) = \delta\langle K_A\rangle.
6915: \]
6916: \item \textbf{Area term:} $S(A)$ has a leading ``area'' contribution proportional to boundary size (in a graph, number of cut edges) plus subleading terms.
6917: \item \textbf{Energy identification:} $\langle K_A\rangle$ acts like an energy functional for excitations in $A$.
6918: \end{enumerate}
6919: 
6920: These are strong assumptions; they are testable in a hardware testbed by checking first-law-like relations empirically on small subsystems.
6921: 
6922: \subsubsection{Discrete variational statement}
6923: Let $A$ be a local patch.
6924: Write
6925: \[
6926: S(A)=\eta\,|\partial A| + S_{\mathrm{bulk}}(A),
6927: \]
6928: with $\eta$ setting units (bits per edge).
6929: Vary the state and (optionally) the graph weights.
6930: Under local equilibrium, $\delta S = \delta\langle K\rangle$ becomes:
6931: \[
6932: \eta\,\delta|\partial A| + \delta S_{\mathrm{bulk}}(A) = \delta\langle K_A\rangle.
6933: \]
6934: If $\delta S_{\mathrm{bulk}}$ is interpreted as ``matter'' and $\delta|\partial A|$ as ``geometry'', this is the discrete Einstein equation template.
6935: 
6936: \begin{remark}[Why surface orders matter here]
6937: Surface orders constrain which local variations are allowed because local degrees of freedom are not arbitrary: they are local matrix orders glued by cocycles.
6938: Thus, the allowed variations of $|\partial A|$ and of $K_A$ are coupled by algebraic constraints.
6939: In other words: the noncommutative local model replaces ``free metric variation'' by ``allowed gluing-compatible variations''.
6940: \end{remark}
6941: 
6942: \subsection{A realistic numerical experiment: curvature from entanglement gradients on hyperbolic patches}
6943: \label{sec:hyperbolic_expt}
6944: 
6945: Pick a hyperbolic tiling patch ( \S12.4) and embed it into hardware connectivity.
6946: Prepare two families of states:
6947: \begin{itemize}
6948: \item a baseline high-entanglement state (random circuit depth $L$),
6949: \item a gradient state where a subregion has reduced entanglement (shallower depth or partial measurement).
6950: \end{itemize}
6951: 
6952: Compute:
6953: \begin{enumerate}
6954: \item $d_\psi$ from \eqref{eq:length_from_I},
6955: \item curvature surrogates $\kappa_\psi$ (angle defects or Ollivier--Ricci),
6956: \item local clock rates $r_v$ as in Section~\ref{ch:expts}.
6957: \end{enumerate}
6958: 
6959: Test two correlations:
6960: \[
6961: \varepsilon_v \uparrow \Longrightarrow r_v \downarrow,
6962: \qquad
6963: \nabla \varepsilon \neq 0 \Longrightarrow \kappa_\psi \neq \text{const}.
6964: \]
6965: 
6966: The multiparameter persistence tool enters by tracking whether curvature and distance features persist across:
6967: \begin{itemize}
6968: \item threshold choices $\lambda$,
6969: \item noise realizations (bootstrap),
6970: \item coarse-graining levels (patch size).
6971: \end{itemize}
6972: 
6973: \subsection{Failure modes (and why they are informative)}
6974: \label{sec:gravity_fail}
6975: 
6976: This is a high-risk modeling layer.
6977: Here are the failure modes that would be scientifically useful:
6978: 
6979: \begin{itemize}
6980: \item \textbf{No stable metric:} $d_\psi$ fluctuates wildly under small perturbations of $W_\psi$; persistence reveals intrinsic instability.  This suggests the graph/state pair is not in a geometric paradigm.
6981: \item \textbf{No redshift correlation:} $r_v$ is uncorrelated with $\varepsilon_v$ after controlling for noise.  This falsifies the simplest redshift ansatz \eqref{eq:redshift_ansatz}.
6982: \item \textbf{Curvature surrogate mismatch:} $\kappa_\psi$ does not track entanglement gradients.  This suggests either wrong curvature notion or wrong metric extraction map $f$.
6983: \item \textbf{Holonomy decouples:} time holonomy invariants (Section~\ref{ch:gluing}) do not correlate with entanglement-induced geometry.  This indicates the clock field is not correctly coupled to state-dependent data, and pushes attention back to the twisted-shift/valuation coupling.
6984: \end{itemize}
6985: 
6986: A coherent theory must tell you \emph{which} failure mode you should expect when assumptions are violated.
6987: That is exactly what the persistence framework is good at: it distinguishes stable phenomena from artifacts.
6988: 
6989: 
6990: 
6991: 
6992: 
6993: 
6994: 
6995: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\chapter{Renormalization via graph quanvolution and graph quantum attention on ribbon graphs} · lines 6996–8109
6996: \chapter{Renormalization via graph quanvolution and graph quantum attention on ribbon graphs}
6997: \label{ch:renorm_graph}
6998: 
6999: This chapter adds a concrete, implementation-oriented bridge between the ribbon-graph/dessin
7000: formalism developed earlier in the paper and two practical families of learnable coarse-graining
7001: mechanisms that are now standard in machine learning: (i) convolution/pooling and (ii) attention.
7002: Our goal is \emph{not} to import grids or sequences into the present context, but rather to express
7003: both mechanisms intrinsically on a fat-graph (a graph equipped with a cyclic ordering of half-edges
7004: at each vertex), and to do so for \emph{cyclic qudits} of general period~$d$, including the limiting
7005: ``infinite-period'' case.
7006: 
7007: A unifying theme is that the trainable primitives are (i) \emph{multilinear} in their quantum inputs
7008: (unitaries and tensor contractions) and (ii) become \emph{effectively nonlinear} once we allow
7009: measurements, classical post-processing (e.g.\ activations, normalizations), and/or conditioning.
7010: This is precisely the structure of renormalization: a local map that discards degrees of freedom
7011: while producing new effective variables at a coarser scale.
7012: 
7013: \section{Cyclic qudits, finite or infinite period, and learnable coarse-graining channels}
7014: \label{sec:cyclic_qudits_channels}
7015: 
7016: \subsection{Cyclic qudits as group-algebra degrees of freedom}
7017: Fix a ``period'' parameter
7018: \[
7019:   d \in \mathbb{N}_{\ge 2} \cup \{\infty\}.
7020: \]
7021: For finite~$d$, the \emph{cyclic qudit} is the Hilbert space $\mathcal{H}_d \cong \mathbb{C}^d$
7022: with computational basis $\{\ket{k}: k\in \mathbb{Z}_d\}$.
7023: For $d=\infty$, a natural model is $\mathcal{H}_\infty \cong \ell^2(\mathbb{Z})$
7024: with basis $\{\ket{k}: k\in \mathbb{Z}\}$ (angular momentum basis), and its Pontryagin dual
7025: ``angle basis'' $\ket{\theta}$ with $\theta\in[0,2\pi)$, where $\langle k\mid \theta\rangle
7026: = \frac{1}{\sqrt{2\pi}} e^{ik\theta}$.
7027: Both cases can be packaged as the group algebra $\mathbb{C}[\mathbb{Z}_d]$, with the convention
7028: $\mathbb{Z}_\infty:=\mathbb{Z}$.
7029: 
7030: The generalized (Weyl) shift and clock operators are
7031: \[
7032:   X_d \ket{k} = \ket{k+1},\qquad
7033:   Z_d \ket{k} = \omega^{k}\ket{k},\qquad \omega=e^{2\pi i/d}
7034: \]
7035: for finite~$d$, with the usual relation $Z_d X_d = \omega X_d Z_d$.
7036: In the infinite-period case, one may view $Z_\infty$ as multiplication by $e^{i\theta}$ in the
7037: $\theta$-representation, and $X_\infty$ as the unit shift on $\ell^2(\mathbb{Z})$; then
7038: $Z_\infty X_\infty = e^{i} X_\infty Z_\infty$ is interpreted in the exponentiated (Weyl) form.
7039: We will also use the qudit Fourier transform $F_d$ defined by
7040: $F_d\ket{k} = \frac{1}{\sqrt{d}}\sum_{\ell\in \mathbb{Z}_d}\omega^{k\ell}\ket{\ell}$ (finite~$d$),
7041: and its continuous analog $F_\infty:\ell^2(\mathbb{Z})\leftrightarrow L^2(S^1)$.
7042: 
7043: \subsection{Ribbon-graph locality and patch registers}
7044: Let $\Gamma=(V,E)$ be a ribbon graph (fat-graph) with a cyclic ordering of half-edges at each
7045: vertex. For a vertex~$v\in V$, write $N(v)$ for its neighbors and $N_r(v)$ for the
7046: $r$-hop neighborhood (as an induced subgraph). The fat-graph structure gives a \emph{cyclic order}
7047: on the incident half-edges at~$v$, which we denote by
7048: \[
7049:   (e_1(v),e_2(v),\dots,e_{\deg(v)}(v)).
7050: \]
7051: When we form a ``local patch register'' for~$v$, we will always order the corresponding qudits
7052: according to this cyclic order. This ensures that any weight-sharing or equivariance constraints
7053: we impose are compatible with the ribbon structure, not merely the underlying abstract graph.
7054: 
7055: \subsection{Learned coarse-graining as a CPTP map}
7056: A single renormalization step is most cleanly expressed as a completely positive trace-preserving
7057: (CPTP) map. Fix a patch $S_v \subseteq V$ (e.g.\ $S_v=N_r(v)$ for a chosen~$r$). Let
7058: $\rho_{S_v}$ be the reduced density operator on the patch.
7059: A \emph{learned coarse-graining channel} is a family of CPTP maps
7060: \[
7061:   \mathcal{R}_{\theta,v}:\mathcal{B}(\mathcal{H}_d^{\otimes |S_v|})\to
7062:   \mathcal{B}(\mathcal{H}_d^{\otimes m}),
7063: \]
7064: parameterized by trainable parameters~$\theta$, and producing $m$ ``effective'' qudits (or,
7065: more generally, $m$ classical features obtained by measurement).
7066: A canonical form is
7067: \begin{equation}
7068:   \mathcal{R}_{\theta,v}(\rho_{S_v})
7069:   \;=\;
7070:   \mathrm{Tr}_{\mathrm{discard}}\!\Bigl[
7071:     U_{\theta,v}\,\rho_{S_v}\,U_{\theta,v}^\dagger
7072:   \Bigr],
7073:   \label{eq:renorm_channel_basic}
7074: \end{equation}
7075: where $U_{\theta,v}$ is a unitary acting on the patch, and $\mathrm{discard}$ denotes a chosen
7076: subset of degrees of freedom that are traced out (pooling). If we additionally measure part of the
7077: patch and feed the outcomes forward, \eqref{eq:renorm_channel_basic} becomes a general quantum
7078: instrument; \emph{nonlinearity} then arises at the level of the overall learning system via
7079: conditioning and classical post-processing.
7080: 
7081: \paragraph{Multilinearity versus effective nonlinearity.}
7082: Unitary evolution is linear in $\rho$, but observables of the form
7083: \[
7084:   f(\rho;\theta)=\mathrm{Tr}\!\left(O\,U_\theta \rho U_\theta^\dagger\right)
7085: \]
7086: are \emph{multilinear} in the tensor factors of $\rho$ when $\rho$ is a product state across a
7087: patch, and are polynomial in the matrix elements of $U_\theta$.
7088: Nonlinearities in practical architectures arise from:
7089: (i) pooling/partial trace (discarding factors), (ii) conditioning on measurement outcomes, and
7090: (iii) explicit classical nonlinearities applied to measured features (e.g.\ ReLU, sigmoid, softmax).
7091: This is the precise sense in which ``learned multilinear maps with nonlinearities'' naturally
7092: implement renormalization.
7093: 
7094: \subsection{Finite-period truncations and quotients of the infinite-period model}
7095: The infinite-period model $\mathcal{H}_\infty \cong \ell^2(\mathbb{Z})$ is useful conceptually,
7096: but hardware and simulations require finite resources.
7097: Two standard reductions are:
7098: \begin{enumerate}
7099: \item \textbf{Truncation (energy cutoff).} Fix $N\in\mathbb{N}$ and restrict to
7100: $\mathrm{span}\{\ket{k}: |k|\le N\}$, giving a $(2N+1)$-dimensional approximation.
7101: Truncation is appropriate when dynamics and states remain approximately band-limited in the
7102: $\ket{k}$ basis. A failure mode is ``wrap-around'' or leakage when gates create significant weight
7103: near the cutoff.
7104: \item \textbf{Quotient (periodization).} Impose the relation $k\sim k+d$, i.e.\ replace
7105: $\mathbb{Z}$ by $\mathbb{Z}_d$. Formally, this is passing from the group algebra
7106: $\mathbb{C}[\mathbb{Z}]$ to $\mathbb{C}[\mathbb{Z}_d]$. Quotients are appropriate when the model
7107: has an intrinsic periodicity (or when we deliberately enforce one as an inductive bias).
7108: A failure mode is aliasing: physically distinct modes become identified by the quotient.
7109: \end{enumerate}
7110: In later examples we will keep the notation~$d$ and interpret $d=\infty$ as the conceptual limit,
7111: while implementations use one of the two finite reductions.
7112: 
7113: \section{Quanvolutional renormalization on ribbon graphs (graph convolution)}
7114: \label{sec:graph_quanv}
7115: 
7116: Quanvolutional layers were introduced as a hybrid quantum--classical analog of convolution \cite{Henderson2019Quanv}:
7117: a small quantum circuit is applied repeatedly to local patches, and expectation values are used as
7118: features for a subsequent classical (or quantum) network. In the image setting, a patch is an
7119: $n\times n$ window; here the patch is an induced subgraph $S_v$ around a vertex~$v$.
7120: 
7121: A graph-native instantiation of the same philosophy---explicitly combining edge-local quantum ``convolution'' with measurement-based pooling---is the QGCN model of Zheng--Gao--L\"u \cite{Zheng2021QGCN}, which we adapt to ribbon graphs and cyclic qudits in Section~\ref{sec:qgcn_renorm}.
7122: 
7123: \subsection{Random versus trainable patch circuits (and why this looks like RG)}
7124: \label{subsec:quanv_random_trainable}
7125: In the original quanvolution proposal \cite{Henderson2019Quanv}, the patch circuit is often taken to be
7126: \emph{random} rather than trained: one samples a shallow circuit from a fixed gate set, applies it to each
7127: patch, and uses a small collection of expectation values as features. The classical network downstream then
7128: learns how to combine these features. Two points make this relevant to the present renormalization framing:
7129: \begin{enumerate}
7130: \item \textbf{Random circuits as learned feature maps.} Even without training, a family of random local
7131: unitaries induces a rich, nonlinear feature map after measurement. In geometric terms, one is learning in the
7132: space of \emph{pushforwards} of local patch measures through a family of multilinear maps.
7133: \item \textbf{Trainable circuits as adaptive coarse-graining.} When the patch circuit is trained, it becomes a
7134: bona fide \emph{learned RG move}: it selects a local basis (via $U_\theta$), compresses by discarding degrees of
7135: freedom, and exposes the effective observables (the readout) that are helpful for the task.
7136: \end{enumerate}
7137: For ribbon graphs, both variants are natural. A random patch circuit provides a strong inductive bias while
7138: keeping training costs low; a trainable circuit offers greater expressivity at the expense of more quantum
7139: resources (shots) for gradient estimation.
7140: 
7141: \subsection{From grid patches to ribbon-graph patches}
7142: Fix a patch rule $v\mapsto S_v$ (for example $S_v=N_r(v)$), and fix an ordering of the vertices
7143: in $S_v$ consistent with the cyclic order of half-edges in the ribbon structure.
7144: For each patch we specify:
7145: \begin{enumerate}
7146: \item an \textbf{encoding map} $x\mapsto \rho_{S_v}(x)$ from classical features (node/edge labels)
7147: into a product (or weakly entangled) state on the patch register;
7148: \item a \textbf{patch circuit} $U_{\theta}$, shared across all~$v$ (weight sharing);
7149: \item a \textbf{readout} given by a family of observables $\{O_a\}_{a=1}^p$ on a subset of the
7150: patch qudits.
7151: \end{enumerate}
7152: The quanvolutional feature at~$v$ is then
7153: \begin{equation}
7154:   \phi_a(v)
7155:   \;=\;
7156:   \mathrm{Tr}\!\left(
7157:     O_a\,
7158:     U_{\theta}\,\rho_{S_v}(x)\,U_{\theta}^\dagger
7159:   \right),
7160:   \qquad a=1,\dots,p.
7161:   \label{eq:quanv_feature}
7162: \end{equation}
7163: In practice the trace is estimated by sampling. Equation~\eqref{eq:quanv_feature} is exactly a
7164: local renormalization step: a patch is mapped to a smaller feature vector (or to a smaller quantum
7165: register if we keep the post-unitary reduced state on a subset of qudits).
7166: 
7167: \subsection{A ribbon-compatible graph convolution ansatz}
7168: Let $v$ have degree $\deg(v)=q$ and incident half-edges ordered cyclically.
7169: A simple and ribbon-compatible patch circuit on the star $S_v=\{v\}\cup N(v)$ is
7170: \begin{equation}
7171:   U_{\theta}^{(v)}
7172:   \;=\;
7173:   \Bigl(\prod_{j=1}^{q} \mathrm{CZ}_d^{(v,u_j)}\Bigr)\,
7174:   \Bigl(\prod_{j=1}^{q} R_d^{(u_j)}(\alpha_j)\Bigr)\,
7175:   R_d^{(v)}(\beta)\,F_d^{(v)},
7176:   \label{eq:star_patch_unitary}
7177: \end{equation}
7178: where $(u_1,\dots,u_q)$ are the neighbors of~$v$ in cyclic order, $R_d(\cdot)$ denotes a chosen
7179: one-qudit rotation family generated by $X_d$ and $Z_d$, and
7180: \[
7181:   \mathrm{CZ}_d \;:=\; \sum_{a,b\in\mathbb{Z}_d}\omega^{ab}\,\ket{a,b}\!\bra{a,b}
7182: \]
7183: is the generalized controlled-phase.
7184: For $d=\infty$, replace $\mathrm{CZ}_d$ by the corresponding Weyl-type entangling gate
7185: $e^{i\,\hat n\otimes \hat n}$ on the momentum basis (or its truncated/periodized version).
7186: 
7187: The readout can be taken as generalized Pauli expectations on the central site, e.g.\
7188: \[
7189:   \phi_1(v)=\langle Z_d^{(v)}\rangle,\qquad
7190:   \phi_2(v)=\langle X_d^{(v)}\rangle,
7191: \]
7192: or, more invariantly, a small set of Fourier modes $\langle (Z_d^{(v)})^m\rangle$.
7193: 
7194: \subsection{Pooling as edge contraction: a QCNN/MERA-style renormalization step}
7195: To build a \emph{hierarchical} renormalization (rather than a single feature extraction layer),
7196: we need pooling that produces a coarser ribbon graph.
7197: One convenient pooling rule on a graph is:
7198: choose a maximal matching $M\subseteq E$ (disjoint edges), and for each matched edge $(u,v)\in M$,
7199: apply a two-vertex channel that produces a single effective vertex, i.e.\ contract $(u,v)$.
7200: At the level of Hilbert spaces, a pooling isometry is a map
7201: \[
7202:   W:\mathcal{H}_d^{\otimes 2}\to \mathcal{H}_d,
7203: \]
7204: implemented as a unitary on $\mathcal{H}_d^{\otimes 2}$ followed by discarding one factor.
7205: On a matched edge we may take, for example,
7206: \[
7207:   W(\rho_{uv}) = \mathrm{Tr}_{v}\!\left[ U_{\theta}^{(uv)}\,\rho_{uv}\,(U_{\theta}^{(uv)})^\dagger\right],
7208: \]
7209: where $U_{\theta}^{(uv)}$ is built from generalized SUM and phase gates,
7210: \[
7211:   \mathrm{SUM}_d:\ket{a,b}\mapsto \ket{a,a+b\;(\mathrm{mod}\;d)}.
7212: \]
7213: When $\Gamma$ is a ribbon graph, contracting an edge has a canonical effect on the cyclic order
7214: data at the endpoints; thus the pooled graph remains a ribbon graph.
7215: Iterating this matching-and-contraction procedure yields a bona fide renormalization flow
7216: $\Gamma\to \Gamma_1\to \Gamma_2\to \cdots$.
7217: 
7218: \subsection{A worked micro-example: trivalent dessin patch}
7219: Consider a trivalent ribbon graph (typical for dessins) and take the star patch $S_v=\{v\}\cup N(v)$.
7220: Encode real node features $x_u\in\mathbb{R}$ into one-qudit phase states by
7221: $\ket{\psi(x_u)} = Z_d^{\lfloor \kappa x_u\rfloor}\ket{0}$ for a scale~$\kappa$ (finite~$d$),
7222: or $\ket{\psi(x_u)} = e^{i x_u \hat n}\ket{0}$ in the $d=\infty$ model (followed by truncation).
7223: Apply the star circuit~\eqref{eq:star_patch_unitary} and read out $\phi_1(v)=\langle Z_d^{(v)}\rangle$.
7224: Even this minimal construction produces a nonlinear function of the neighborhood features once
7225: we post-process $\phi_1(v)$ (e.g.\ apply a classical nonlinearity and/or stack layers), while keeping
7226: the inductive bias that the computation is ribbon-local.
7227: 
7228: 
7229: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
7230: \section{Renormalization via quantum graph convolutional neural networks (QGCN) on ribbon graphs}
7231: \label{sec:qgcn_renorm}
7232: 
7233: The quanvolutional discussion above deliberately started from the most ``physics'' viewpoint:
7234: a local quantum circuit on a patch, followed by readout and (optionally) pooling, is already a
7235: renormalization step.  The \emph{Quantum Graph Convolutional Neural Network} (QGCN) architecture
7236: of Zheng--Gao--L\"u \cite{Zheng2021QGCN} is a clean reference point because it makes explicit how
7237: graph convolution, pooling, and measurement can be implemented by parameterized quantum circuits,
7238: while keeping the overall layout close to the classical GCN paradigm.
7239: 
7240: Our aim in this section is threefold:
7241: \begin{enumerate}
7242: \item to extract the \emph{renormalization-theoretic core} of QGCN, namely ``local aggregation + dimensional reduction'',
7243: \item to recast the construction \emph{intrinsically on a ribbon graph} (no grids, no sequences, no loss of cyclic-order data),
7244: \item to generalize from \emph{qubits} to \emph{cyclic qudits of period $d\in\mathbb{N}\cup\{\infty\}$}, and to make the
7245: finite-period truncation/quotient issues completely explicit.
7246: \end{enumerate}
7247: 
7248: \subsection{Learned multilinear patch maps and where nonlinearity really enters}
7249: \label{subsec:qgcn_multilinear}
7250: 
7251: A recurring point in this chapter is that ``quantum layers are multilinear'' and yet ``the overall architecture is nonlinear''.
7252: Here is the clean statement in the present graph setting.
7253: 
7254: Fix a patch $S_v$ and an encoding map $x\mapsto \rho_{S_v}(x)$.
7255: For a family of observables $\{O_a\}_{a=1}^p$ and a patch unitary $U_\theta$, the measurable features are
7256: \begin{equation}
7257:   \phi_a(v;x,\theta)
7258:   \;:=\;
7259:   \mathrm{Tr}\!\left(O_a\,U_\theta\,\rho_{S_v}(x)\,U_\theta^\dagger\right).
7260:   \label{eq:qgcn_feature_general}
7261: \end{equation}
7262: If $\rho_{S_v}(x)$ is a tensor product of \emph{single-site amplitude encodings},
7263: $\rho_{S_v}(x)=\bigotimes_{u\in S_v}\ket{\psi(x_u)}\!\bra{\psi(x_u)}$ with
7264: $\ket{\psi(x_u)}=\sum_{i} x_{u,i}\ket{i}$, then each $\phi_a$ is a \emph{multilinear polynomial}
7265: in the amplitudes and their conjugates:
7266: \begin{equation}
7267:   \phi_a(v;x,\theta)
7268:   \;=\;
7269:   \sum_{\mathbf{i},\mathbf{j}}
7270:   C^{(a)}_{\mathbf{i},\mathbf{j}}(\theta)
7271:   \prod_{u\in S_v} x_{u,i_u}\,\overline{x_{u,j_u}},
7272:   \label{eq:qgcn_multilinear_expansion}
7273: \end{equation}
7274: where $\mathbf{i}=(i_u)_{u\in S_v}$ and $\mathbf{j}=(j_u)_{u\in S_v}$ index basis labels on the patch.
7275: Equivalently, for a single register $| \psi(x)\rangle$ of dimension $D$,
7276: $\phi_a(x,\theta)=x^\ast M_a(\theta) x$ is a quadratic form with $M_a(\theta)=U_\theta^\dagger O_a U_\theta$.
7277: 
7278: Thus, \emph{the quantum part is algebraically tame}: it is a learned multilinear (tensor) map.
7279: The true nonlinearities arise from operations that are \emph{essentially renormalization}:
7280: \begin{itemize}
7281: \item \textbf{Pooling / partial trace:} discarding qudits is not invertible and changes the effective degrees of freedom.
7282: \item \textbf{Measurement and conditioning:} measurement outcomes select branches of an instrument (nonlinear at the level of
7283: the induced update rule on classical features).
7284: \item \textbf{Classical nonlinearities:} activations, normalizations, and softmax applied to measured features.
7285: \end{itemize}
7286: This division of labor is exactly what one expects from RG: linear/multilinear local physics together with
7287: nonlinear state reduction and rescaling steps.
7288: 
7289: \subsection{The QGCN architecture of Zheng--Gao--L\"u as a ribbon-local RG move}
7290: \label{subsec:qgcn_architecture}
7291: 
7292: Zheng--Gao--L\"u \cite{Zheng2021QGCN} propose a four-block architecture:
7293: \emph{(i) quantum state preparation}, \emph{(ii) quantum graph convolutional layers},
7294: \emph{(iii) quantum pooling layers}, and \emph{(iv) quantum measurement}.
7295: We recall each block in some detail before adapting the whole to ribbon graphs with cyclic qudits.
7296: 
7297: \paragraph{Block (i): quantum state preparation (amplitude encoding).}
7298: Given a graph $G=(V,E)$ with $|V|=N$ vertices and a feature matrix $X\in\mathbb{R}^{N\times d_{\mathrm{in}}}$,
7299: QGCN encodes graph data into a quantum state via \emph{amplitude encoding}:
7300: \[
7301:   \ket{\psi_X}
7302:   \;=\;
7303:   \frac{1}{\|X\|_F}\sum_{i=0}^{N-1}\sum_{j=0}^{d_{\mathrm{in}}-1} X_{ij}\,\ket{i}\ket{j},
7304: \]
7305: using $\lceil\log_2 N\rceil+\lceil\log_2 d_{\mathrm{in}}\rceil$ qubits.
7306: The adjacency structure is encoded separately in ``topology qubits'' that control whether a
7307: two-qubit gate is applied on a given pair~\cite{Zheng2021QGCN}.
7308: 
7309: \paragraph{Block (ii): quantum graph convolution layers.}
7310: A convolution layer applies a universal two-qubit gate $U^{(2)}\in\mathrm{SU}(4)$ on each pair of connected
7311: vertices.  In~\cite{Zheng2021QGCN}, $U^{(2)}$ is decomposed into 3~CNOT gates and 15~basic single-qubit
7312: rotation gates (the Khaneja--Glaser decomposition), yielding a constant-depth parameterized circuit per edge.
7313: The ``graph convolution'' interpretation is that each application of $U^{(2)}$ on edge $(u,v)$ mixes the
7314: quantum features of $u$ and~$v$---the quantum analog of message passing.
7315: Stacking $L$ such layers propagates information $L$~hops.
7316: 
7317: \paragraph{Block (iii): quantum pooling.}
7318: After convolution, a subset of qubits is measured in the computational basis, producing classical bits.
7319: Conditioned on these measurement outcomes, a unitary correction is applied to the remaining (unmeasured) qubits.
7320: This implements a quantum instrument whose classical branch determines the nonlinear update rule for the coarse
7321: features---the renormalization step.
7322: 
7323: \paragraph{Block (iv): quantum measurement (readout).}
7324: The final block measures all remaining qubits to produce a classical feature vector used for downstream
7325: classification or regression.  In~\cite{Zheng2021QGCN}, the measurement is in the Pauli-$Z$ basis, and the
7326: resulting expectation values are the features.
7327: 
7328: \medskip
7329: For our purposes, the key conceptual step is to \emph{externalize the adjacency}:
7330: \begin{quote}
7331: \emph{on a physical graph device, adjacency is not an input register but the native connectivity graph on which two-site gates exist.}
7332: \end{quote}
7333: Thus the ``controlled-by-topology'' mechanism becomes simply ``apply a fixed two-site gate on each physical edge''.
7334: This is exactly the graph-centric viewpoint compatible with dessins/fat-graphs.
7335: 
7336: Concretely, let $\Gamma=(V,E)$ be the ribbon graph of the computation.
7337: A QGCN-style \emph{convolution layer} is specified by a two-site unitary $U_{\theta}^{(2)}$ (shared across edges) and a schedule
7338: (e.g.\ edge coloring) so that gates on disjoint edges can be executed in parallel.
7339: One layer applies $U_{\theta}^{(2)}$ to every edge:
7340: \begin{equation}
7341:   \rho \;\longmapsto\; \Bigl(\prod_{(u,v)\in E}^{\mathrm{schedule}} U_{\theta}^{(2)}(u,v)\Bigr)\,\rho\,
7342:   \Bigl(\prod_{(u,v)\in E}^{\mathrm{schedule}} U_{\theta}^{(2)}(u,v)\Bigr)^\dagger.
7343:   \label{eq:qgcn_edge_layer}
7344: \end{equation}
7345: As in \cite{Zheng2021QGCN}, stacking $L$ such layers implements higher-order neighborhood aggregation
7346: (because information propagates $L$ hops in $L$ rounds of edge-local mixing).
7347: 
7348: A QGCN-style \emph{pooling layer} then reduces the active degrees of freedom.
7349: The pooling circuit in \cite{Zheng2021QGCN} measures a subset of qubits and conditionally applies a unitary on remaining qubits
7350: based on the measurement outcomes.  In renormalization language, this is a local quantum instrument whose classical outcomes
7351: drive a nonlinear update rule for coarse features.
7352: 
7353: On a ribbon graph, the most geometrically transparent pooling rule is still \emph{edge contraction along a matching}
7354: (Section~\ref{sec:graph_quanv}): choose a maximal matching $M\subseteq E$, and on each $(u,v)\in M$ apply an isometry
7355: $W:\mathcal{H}_d^{\otimes 2}\to\mathcal{H}_d$ implemented by ``unitary + discard'' (and optionally measurement-conditioned
7356: corrections).
7357: Because contraction is canonical in the ribbon category, the cyclic order data is preserved and the pooled graph remains a ribbon graph.
7358: 
7359: \subsection{Generalization from qubits to cyclic qudits of period \texorpdfstring{$d$}{d}}
7360: \label{subsec:qgcn_qudit_generalization}
7361: 
7362: The original QGCN paper \cite{Zheng2021QGCN} is written in the qubit language (amplitude encoding into $2^n$-dimensional states,
7363: two-qubit unitaries in $\mathrm{SU}(4)$, and Pauli-$Z$ measurements).
7364: In our setting each site carries a cyclic qudit $\mathcal{H}_d$ with $d\in\mathbb{N}\cup\{\infty\}$
7365: (Section~\ref{sec:cyclic_qudits_channels}).  The replacements are systematic:
7366: 
7367: \begin{enumerate}
7368: \item \textbf{Local feature encoding.}
7369: Amplitude encoding becomes the map
7370: \[
7371:   x\in\mathbb{C}^{d^n},\ \|x\|_2=1
7372:   \quad\longmapsto\quad
7373:   \ket{\psi_d(x)}=\sum_{i=0}^{d^n-1} x_i\ket{i}\ \in (\mathcal{H}_d)^{\otimes n}.
7374: \]
7375: For $d=\infty$, one uses a truncation to a finite-dimensional subspace or a quotient to $\mathbb{Z}_d$
7376: (Section~\ref{sec:cyclic_qudits_channels}).
7377: 
7378: \item \textbf{Two-site ``convolution'' gates.}
7379: Two-qubit universality statements used in \cite{Zheng2021QGCN} (e.g.\ decompositions into CNOTs and one-qubit rotations)
7380: generalize to two-qudit universality: a generic two-qudit unitary in $\mathrm{SU}(d^2)$ can be synthesized from
7381: one-qudit $\mathrm{SU}(d)$ rotations together with an entangling gate such as $\mathrm{SUM}_d$ or $\mathrm{CZ}_d$.
7382: For cyclic qudits, $\mathrm{SUM}_d$ is the natural analog of CNOT,
7383: \[
7384:   \mathrm{SUM}_d:\ket{a,b}\mapsto \ket{a,a+b\;(\mathrm{mod}\;d)}.
7385: \]
7386: In the $d=\infty$ (rotor) picture, replace modular addition by addition on $\mathbb{Z}$, and implement it approximately
7387: on a truncated subspace.
7388: 
7389: \item \textbf{Readout.}
7390: Pauli-$Z$ expectation values become Weyl-mode expectations such as $\langle (Z_d)^m\rangle$ for small $m$,
7391: or, in the rotor model, $\langle e^{im\theta}\rangle$.
7392: This is particularly aligned with the ``clock'' interpretation of cyclic qudits:
7393: we are literally reading out low Fourier modes of an angular distribution.
7394: \end{enumerate}
7395: 
7396: The practical message is that QGCN is not ``a qubit model'' but a \emph{group-algebra model}:
7397: once the cyclic group $\mathbb{Z}_d$ is the organizing principle, the qubit case is simply $d=2$.
7398: 
7399: \subsection{Pooling as a measurement-conditioned contraction channel}
7400: \label{subsec:qgcn_pooling_channel}
7401: 
7402: To emphasize the RG reading, it is helpful to write pooling as a channel.
7403: Fix an edge $(u,v)\in M$ in a matching.
7404: A pooling layer specifies a channel
7405: \begin{equation}
7406:   \mathcal{P}_{\theta}^{(uv)}:\mathcal{B}(\mathcal{H}_d^{\otimes 2})\to \mathcal{B}(\mathcal{H}_d),
7407:   \qquad
7408:   \mathcal{P}_{\theta}^{(uv)}(\rho_{uv})
7409:   \;=\;
7410:   \sum_{m} \mathrm{Tr}_{v}\!\Bigl[
7411:     V_{\theta,m}\,U_{\theta}\,\rho_{uv}\,U_{\theta}^\dagger\,V_{\theta,m}^\dagger
7412:   \Bigr],
7413:   \label{eq:qgcn_pool_channel}
7414: \end{equation}
7415: where $U_\theta$ is a two-site unitary, $\{V_{\theta,m}\}$ are (possibly trivial) conditional corrections depending on a
7416: measurement outcome $m$ obtained from measuring $v$, and the trace discards the measured/pooled site.
7417: Equation~\eqref{eq:qgcn_pool_channel} is the natural graph generalization of the pooling block in \cite{Zheng2021QGCN}.
7418: 
7419: Iterating ``edge-layer + pooling'' defines a discrete RG flow on ribbon graphs:
7420: \[
7421: (\Gamma,\rho)\ \longmapsto\ (\Gamma_1,\rho_1)\ \longmapsto\ (\Gamma_2,\rho_2)\ \longmapsto\ \cdots,
7422: \]
7423: where $\Gamma_{k+1}$ is obtained from $\Gamma_k$ by contracting a matching and inheriting the ribbon structure.
7424: In this form it becomes completely transparent how to attach persistence-based diagnostics (Section~\ref{ch:persistence}):
7425: one can track which topological/geometric features of the state-induced filtrations persist across RG scale.
7426: 
7427: \subsection{A worked micro-example: a 3-vertex path and one QGCN-RG step}
7428: \label{subsec:qgcn_micro_example}
7429: 
7430: Consider the path graph $u$--$v$--$w$ with the induced ribbon structure (trivial cyclic order at each degree-$2$ vertex).
7431: Let each site carry a cyclic qudit $\mathcal{H}_d$.
7432: Encode scalar features $x_u,x_v,x_w\in\mathbb{R}$ into phase states
7433: $\ket{\psi(x)}:=Z_d^{\lfloor \kappa x\rfloor}\ket{0}$ (finite $d$) or $\ket{\psi(x)}:=e^{ix\hat n}\ket{0}$ (rotor model),
7434: and begin with the product state
7435: $\rho_0=\ket{\psi(x_u)}\!\bra{\psi(x_u)}\otimes \ket{\psi(x_v)}\!\bra{\psi(x_v)}\otimes \ket{\psi(x_w)}\!\bra{\psi(x_w)}$.
7436: 
7437: \paragraph{Convolution step.}
7438: Apply a shared two-site entangler $U_\theta^{(2)}$ on $(u,v)$ and $(v,w)$ (in two rounds if needed to avoid overlap).
7439: For instance, a minimal cyclic-qudit message-passing gate on an edge is \eqref{eq:message_passing_gate}.
7440: This produces $\rho_1$.
7441: 
7442: \paragraph{Pooling (contraction) step.}
7443: Measure the middle qudit $v$ in the computational basis, obtaining outcome $m\in\mathbb{Z}_d$.
7444: Conditioned on $m$, apply a correction $V_{\theta,m}$ (often a simple $X_d$-shift or phase) to $u$ or $w$,
7445: and then discard $v$.
7446: The result is an effective two-site state $\rho_{uw}$ on the contracted graph $u$--$w$.
7447: 
7448: Even in this toy example one sees the RG structure:
7449: the edge-local unitary is multilinear, while the measurement-conditioned pooling creates a nonlinear effective update rule
7450: for the coarse variables (e.g.\ the measured Fourier modes at $u$ and $w$).
7451: On a hyperbolic ribbon graph with $\sim 10^5$ sites (Section~\ref{sec:hyperbolic_cyclic_hardware}),
7452: the same local primitives execute in a small number of rounds because the degree is bounded and the edge chromatic number is small.
7453: 
7454: \subsection{Relation to geodesic CNN on surfaces: from continuous patches to ribbon-graph qudits}
7455: \label{subsec:gcnn_ribbon_bridge}
7456: 
7457: Masci--Boscaini--Bronstein--Vandergheynst \cite{Masci2015GCNN} introduced \emph{geodesic convolutional neural networks} (GCNN) on manifolds by replacing the Euclidean translation used in classical CNNs with local geodesic polar coordinates.  In this subsection we recall their construction in some detail, describe the layer taxonomy of GCNN, and explain how the quanvolutional framework on ribbon graphs developed above is a natural combinatorial and quantum-hardware-ready counterpart.
7458: 
7459: \subsubsection{Geodesic convolution on a manifold}
7460: Let $X$ be a smooth Riemannian manifold (or a triangulated surface).  For each point $x\in X$, the \emph{local geodesic polar coordinate system} $\Omega(x)\colon B_{\rho_0}(x)\to [0,\rho_0]\times [0,2\pi)$ maps the geodesic ball of radius~$\rho_0$ into radial and angular coordinates $(\rho,\theta)$.  A signal $f\colon X\to\mathbb{R}^P$ is \emph{interpolated into the patch} by the \textbf{patch operator}
7461: \begin{equation}
7462:   \bigl(D(x)f\bigr)(\rho,\theta)
7463:   \;=\;
7464:   \int_X v_{\rho,\theta}(x,x')\,f(x')\,dx',
7465:   \label{eq:patch_operator}
7466: \end{equation}
7467: where the interpolation weights $v_{\rho,\theta}$ are products of a radial Gaussian $v_\rho(x,x')\propto e^{-(d_X(x,x')-\rho)^2/\sigma_\rho^2}$ and an angular Gaussian $v_\theta(x,x')\propto e^{-d_X^2(\Gamma(x,\theta),x')/\sigma_\theta^2}$, with $\Gamma(x,\theta)$ the geodesic ray from~$x$ in direction~$\theta$.
7468: 
7469: Because the choice of angular origin is arbitrary, the \textbf{geodesic convolution} (GC) of the patch with a filter $a(\theta,r)$ is defined with a shift $\Delta\theta$:
7470: \begin{equation}
7471:   (f\star a)(x)
7472:   \;=\;
7473:   \sum_{\theta,\,r} a(\theta+\Delta\theta,\,r)\;\bigl(D(x)f\bigr)(r,\theta),
7474:   \label{eq:geodesic_convolution}
7475: \end{equation}
7476: and the convolution is evaluated at \emph{all} $N_\theta$ rotations $\Delta\theta = 0,\frac{2\pi}{N_\theta},\ldots,\frac{2\pi(N_\theta-1)}{N_\theta}$, producing $N_\theta$ outputs per filter.  For a bank of $P$ input channels and $Q$ output filters, each rotated by $N_\theta$ angles, the GC layer output is
7477: \begin{equation}
7478:   f^{\mathrm{out}}_{\Delta\theta,q}(x)
7479:   \;=\;
7480:   \sum_{p=1}^{P} (f_p\star a_{\Delta\theta,qp})(x),
7481:   \qquad q=1,\ldots,Q.
7482:   \label{eq:gc_layer}
7483: \end{equation}
7484: 
7485: \subsubsection{Layer taxonomy of GCNN}
7486: \label{subsubsec:gcnn_layers}
7487: The GCNN architecture of \cite{Masci2015GCNN} composes layers from the following palette:
7488: 
7489: \begin{enumerate}
7490: \item \textbf{Linear (LIN) layer.}  A pointwise linear combination of input channels, optionally followed by a nonlinearity $\xi$ (e.g.\ ReLU):
7491: \[
7492:   f_q^{\mathrm{out}}(x) = \xi\!\Bigl(\sum_{p=1}^{P} w_{qp}\,f_p^{\mathrm{in}}(x)\Bigr),
7493:   \qquad q=1,\ldots,Q.
7494: \]
7495: This adjusts input/output dimensions without altering the geometry.
7496: 
7497: \item \textbf{Geodesic Convolution (GC) layer.}  As in \eqref{eq:gc_layer}, applying all $N_\theta$ rotations of the filter bank.  This is the core layer that replaces Euclidean convolution.
7498: 
7499: \item \textbf{Angular Max-Pooling (AMP) layer.}  Eliminates the angular coordinate ambiguity by taking the maximum over all rotations:
7500: \[
7501:   f_p^{\mathrm{out}}(x) = \max_{\Delta\theta}\; f_{\Delta\theta,p}^{\mathrm{in}}(x),
7502:   \qquad p=1,\ldots,P.
7503: \]
7504: After this layer the output is rotation-invariant with respect to the angular origin.
7505: 
7506: \item \textbf{Fourier Transform Magnitude (FTM) layer.}  An alternative to AMP that first applies the patch operator (at each $(\rho,\theta)$ per input dimension), takes the Fourier transform in the angular coordinate, and returns the absolute value:
7507: \[
7508:   f_p^{\mathrm{out}}(\rho,\omega)
7509:   = \Bigl|\sum_\theta e^{-i\omega\theta}\,(D(x)f_p^{\mathrm{in}})(x)(\rho,\theta)\Bigr|,
7510: \]
7511: yielding complex-phase-invariant features.
7512: 
7513: \item \textbf{Covariance (COV) layer.}  Aggregates point-wise descriptors into a global shape descriptor
7514: $\mathbf{f}^{\mathrm{out}} = \int_X (\mathbf{f}^{\mathrm{in}}(x)-\boldsymbol\mu)(\mathbf{f}^{\mathrm{in}}(x)-\boldsymbol\mu)^\top\,dx$,
7515: used for tasks like shape retrieval.
7516: \end{enumerate}
7517: 
7518: A key insight of \cite{Masci2015GCNN} is that several classical spectral descriptors are \emph{special cases} of GCNN:
7519: \begin{itemize}
7520: \item \emph{Heat kernel signature (HKS)} is a fixed LIN layer with band-pass filters $\tau_\nu(\lambda)=\exp(-t\lambda)$.
7521: \item \emph{Wave kernel signature (WKS)} uses filters $\tau_\nu(\lambda)=\exp\!\bigl(\frac{\log\nu-\log\lambda}{2\sigma^2}\bigr)$.
7522: \item \emph{Optimal spectral descriptors (OSD)} are obtained by a \emph{learnable} LIN layer parametrized via B-splines $\tau_q(\lambda)=\sum_m a_{qm}\beta_m(\lambda)$.
7523: \item \emph{Intrinsic shape context} is a fixed LIN layer producing HKS/WKS descriptors followed by a fixed FTM layer.
7524: \end{itemize}
7525: 
7526: \subsubsection{From geodesic patches to ribbon-graph cyclic ordering: a combinatorial bridge}
7527: \label{subsubsec:gcnn_to_ribbon}
7528: 
7529: A ribbon graph $\Gamma$ embedded in a surface~$\Sigma$ provides a \emph{combinatorial discretization} of the geodesic patch construction.  The formal correspondence is:
7530: 
7531: \begin{center}
7532: \renewcommand{\arraystretch}{1.2}
7533: \begin{tabular}{l@{\qquad$\longleftrightarrow$\qquad}l}
7534: \toprule
7535: \textbf{GCNN on a manifold} & \textbf{Quanvolution on a ribbon graph} \\
7536: \midrule
7537: Point $x\in X$ & Vertex $v\in V(\Gamma)$ \\
7538: Geodesic ball $B_{\rho_0}(x)$ & $r$-neighborhood $N_r(v)$ \\
7539: Angular coordinate $\theta\in[0,2\pi)$ & Cyclic order $\sigma_v$ at vertex $v$ \\
7540: $N_\theta$ angular bins & $\deg(v)$ cyclic positions \\
7541: Radial bins ($N_\rho$ levels) & Graph distance shells $\{d(v,u)=k\}$ \\
7542: Patch operator $D(x)$ & Feature encoding $\ket{\psi(h_u)}$ for $u\in N_r(v)$\\
7543: Learned filter $a(\theta+\Delta\theta,r)$ & Parameterized gate $U_\theta^{(2)}$ on edge $(v,u)$ \\
7544: Angular rotation by $\Delta\theta$ & Cyclic shift of half-edge labels at $v$ \\
7545: AMP ($\max_{\Delta\theta}$) & Max over cyclic shifts; or $X_d$-shift gate \\
7546: FTM ($|\hat f(\omega)|$) & $F_d$-basis measurement, discard phase \\
7547: ReLU / activation $\xi$ & Measurement + classical post-processing \\
7548: \bottomrule
7549: \end{tabular}
7550: \end{center}
7551: 
7552: \begin{proposition}[GCNN as a classical shadow of quanvolution on ribbon graphs]
7553: \label{prop:gcnn_ribbon}
7554: Let $\Gamma$ be a ribbon graph embedded in a surface~$\Sigma$, with $d:=\max_{v}\deg(v)$.
7555: Equip each vertex~$v$ with a cyclic qudit $\mathcal{H}_d$ (period $d$ matching the maximal degree).
7556: Define the \emph{discrete angular coordinate} at a vertex~$v$ of degree~$\delta_v$ as
7557: $\theta_v^{(j)}:= 2\pi j/\delta_v$ for $j\in\mathbb{Z}_{\delta_v}$,
7558: indexed by the cyclic ordering of half-edges at~$v$.
7559: Then:
7560: \begin{enumerate}
7561: \item The GC layer \eqref{eq:gc_layer} on $\Sigma$, restricted to $1$-neighborhoods and discretized at the vertices and cyclic positions of~$\Gamma$, reduces to a message-passing update of the form \eqref{eq:qgcn_multilinear_expansion} with the parameterized gate applied to each edge $(v,u)$ depending on the cyclic position of the half-edge $v\to u$.
7562: \item The AMP layer corresponds to taking the maximum over cyclic-shift orbits of the gate outcomes; in the quantum setting, one instead applies $X_d^j$ to the state at~$v$ before the gate and takes the maximum post-measurement, which is the cyclic-qudit analog of pooling over angular rotations.
7563: \item The FTM layer corresponds to measuring the qudit at~$v$ in the Fourier ($F_d$) basis and discarding the phase, yielding an output that depends on the absolute value of each Fourier component---precisely $|\langle (Z_d)^m\rangle|$.
7564: \end{enumerate}
7565: In this sense, the QGCN-style quanvolution on ribbon graphs (Section~\ref{subsec:qgcn_architecture}) is a quantum-hardware-native generalization of geodesic convolution on surfaces, with cyclic qudits providing a natural home for angular and Fourier-mode features.
7566: \end{proposition}
7567: 
7568: \begin{remark}[Infinite period and continuous geodesic limit]
7569: In the $d=\infty$ rotor model ($\mathcal{H}_\infty \cong L^2(S^1)$), the cyclic qudit at each vertex becomes a genuine angular degree of freedom on the circle, and the Fourier modes $(Z_\infty)^m = e^{im\theta}$ form a countable orthonormal family.
7570: The discrete-to-continuous bridge of Proposition~\ref{prop:gcnn_ribbon} then becomes exact in the limit $N_\theta\to\infty$, $N_\rho\to\infty$: the GCNN patch operator \eqref{eq:patch_operator} converges to the patch integral, and the GC filter bank \eqref{eq:gc_layer} converges to a learned filter on $L^2(S^1\times[0,\rho_0])$.
7571: In practice, truncation to a $(2N+1)$-dimensional subspace (Section~\ref{sec:hyperbolic_cyclic_hardware}) or quotienting to $\mathbb{Z}_d$ provides a finite working approximation with resolution controlled by the cutoff.
7572: \end{remark}
7573: 
7574: \begin{remark}[QGAT parameter efficiency]
7575: From a practical standpoint, the parameter overhead of the quantum approach is moderate.
7576: For instance, \cite{Ning2025QGAT} reports that a 4-head QGAT with 8~qubits and 6~strongly-entangling layers uses approximately $6.72\times 10^6$ parameters on the PPI benchmark, compared to $6.44\times 10^6$ for GAT and $12.84\times 10^6$ for GATv2, while achieving comparable F1 scores.
7577: The cyclic-qudit generalization does not change the parameter count substantially (the variational circuit has the same number of real parameters per gate, independent of~$d$), although training-time overhead from quantum simulation is significant ($5$--$6\times$ slower than classical baselines when using PennyLane-based simulators~\cite{Ning2025QGAT}).
7578: On native hardware, this overhead vanishes and the per-shot execution time is determined by circuit depth, not~$d$.
7579: \end{remark}
7580: 
7581: 
7582: \section{Renormalization via graph quantum attention (graph attention)}
7583: \label{sec:graph_qattn}
7584: 
7585: Attention differs from convolution in that the neighborhood aggregation weights are
7586: \emph{data-dependent}. This makes attention particularly natural for the present setting because
7587: dessins/fat-graphs already encode a rich combinatorial structure; attention allows the model to
7588: learn which parts of that structure are relevant for a given task.
7589: 
7590: \subsection{Graph attention as adaptive message passing}
7591: Let $h_v^{(\ell)}$ be a feature at vertex~$v$ at layer~$\ell$ (classical or quantum).
7592: A graph-attention update has the schematic form
7593: \begin{equation}
7594:   h_v^{(\ell+1)}
7595:   \;=\;
7596:   \sigma\!\left(
7597:     \sum_{u\in N(v)\cup\{v\}} \alpha_{vu}^{(\ell)}\;\mathsf{V}_\theta\!\left(h_u^{(\ell)}\right)
7598:   \right),
7599:   \qquad
7600:   \alpha_{vu}^{(\ell)} \propto
7601:   \exp\!\Bigl(\langle \mathsf{Q}_\theta(h_v^{(\ell)}),\mathsf{K}_\theta(h_u^{(\ell)})\rangle\Bigr),
7602:   \label{eq:graph_attention_classical}
7603: \end{equation}
7604: with trainable maps $\mathsf{Q},\mathsf{K},\mathsf{V}$ and a normalization over $u\in N(v)\cup\{v\}$.
7605: The nonlinearity arises from the normalization (softmax) and the activation~$\sigma$.
7606: 
7607: \subsection{Quantum attention primitives and Gaussian-projected self-attention}
7608: One practical route to quantum attention is to realize the ``query/key/value'' maps as parameterized
7609: quantum circuits and estimate the required inner products by quantum overlap tests.
7610: Another route, emphasized in the quantum-attention paper \cite{Li2022QuantumAttention}, is for a fully graph-native attention mechanism in which a single variational circuit produces many attention heads in parallel (rather than approximating the attention kernel), see the QGAT architecture \cite{Ning2025QGAT}, adapted to cyclic qudits and ribbon graphs in Section~\ref{sec:qgat_renorm}.
7611: 
7612: \emph{Gaussian-projected} approximation to the attention kernel.
7613: At a high level, one rewrites the softmax kernel in a feature-map form and approximates it by a
7614: Gaussian random projection, which yields attention weights computable from a manageable number of
7615: random features and trainable circuits.
7616: 
7617: \paragraph{A concrete Gaussian-projected scoring rule.}
7618: In \cite{Li2022QuantumAttention}, one particularly simple (and hardware-friendly) attention score is obtained by
7619: measuring a single Pauli observable on the query and key outputs and exponentiating the squared difference.
7620: In their notation, for token~$s$ attending to token~$j$,
7621: \begin{align}
7622:   \alpha_{s,j}\; &:=\;\exp\!\Bigl(-\bigl(\langle Z_q\rangle_s-\langle Z_k\rangle_j\bigr)^2\Bigr), \\ 
7623:   				 &= \;\exp\!\Bigl(-\bigl(\langle s| Z_q| s^*\rangle-\langle j| Z_k| j^* \rangle \bigr)^2\Bigr)
7624: \end{align}
7625: followed by normalization. This replaces the usual dot-product score by a Gaussian kernel on a \emph{measured}
7626: one-dimensional projection, which can drastically reduce quantum resources.
7627: 
7628: For cyclic qudits, there is an evident generalization: replace $Z$ by a chosen Fourier mode of the clock operator,
7629: e.g.\ use $\mathrm{Re}\,\langle (Z_d)^m\rangle$ or $\mathrm{Im}\,\langle (Z_d)^m\rangle$ for some small~$m$,
7630: and set
7631: \[
7632:   \alpha_{v,u}\;:=\;\exp\!\Bigl(-\bigl(\mathrm{Re}\,\langle (Z_d)^m\rangle_{q_v}-\mathrm{Re}\,\langle (Z_d)^m\rangle_{k_u}\bigr)^2\Bigr),
7633: \]
7634: with normalization over $u\in N_r(v)$. In the $d=\infty$ model (quantum rotor), $(Z_\infty)^m$ is multiplication by
7635: $e^{im\theta}$ in the angle basis, so this score compares low Fourier modes of the learned angular distributions.
7636: The key operational point is that \emph{only local, single-site measurements are needed to score edges}, making
7637: this style of attention compatible with strict locality and limited readout bandwidth.
7638: 
7639: For ribbon graphs, we restrict attention to local neighborhoods $N_r(v)$ (or to edges) so that the
7640: computation remains compatible with the local gate constraints of hardware.
7641: The resulting \emph{graph quantum attention layer} is:
7642: \begin{enumerate}
7643: \item \textbf{Local query/key/value circuits.} For each vertex~$v$, prepare quantum registers
7644: $\ket{q_v},\ket{k_v},\ket{v_v}$ by applying parameterized circuits
7645: $U_Q(\theta_Q),U_K(\theta_K),U_V(\theta_V)$ to an encoded state $\ket{\psi(h_v)}$.
7646: For cyclic qudits these circuits can be built from $X_d,Z_d,F_d$ and two-site Weyl entanglers.
7647: \item \textbf{Edge-local similarity estimation.} For each edge $(v,u)$ (or $u\in N_r(v)$),
7648: estimate a similarity score $s_{vu}$, e.g.\ via a generalized SWAP/Hadamard test giving an estimate
7649: of $|\langle q_v\mid k_u\rangle|^2$, or via a random-feature (Gaussian-projected) approximation.
7650: \item \textbf{Classical normalization.} Compute $\alpha_{vu} = \exp(s_{vu})/\sum_{w\in N_r(v)}\exp(s_{vw})$.
7651: \item \textbf{Aggregation/pooling.} Update an effective feature/state at~$v$ by a weighted mixture of
7652: value registers, and optionally pool to a coarser graph by contracting edges with large $\alpha_{vu}$.
7653: \end{enumerate}
7654: 
7655: \paragraph{Renormalization interpretation.}
7656: Attention defines a \emph{data-dependent} coarse-graining: rather than averaging uniformly over a
7657: patch, it learns which edges/vertices to keep and which to suppress. In a ribbon-graph setting this
7658: can be sharpened by enforcing that $\alpha_{vu}$ respects the cyclic order around~$v$ (e.g.\ by
7659: restricting the scoring circuit to depend on relative cyclic position), so that the learned
7660: renormalization does not destroy the fat-graph structure.
7661: 
7662: \subsection{A worked micro-example: attention on a heptagonal face}
7663: Suppose $\Gamma$ contains a heptagonal face (as in common hyperbolic tilings).
7664: Let $v$ be a vertex on that face and take $N_1(v)$ as the neighborhood.
7665: Choose a single-head attention layer in which the similarity score on an adjacent vertex~$u$ is
7666: estimated by the overlap
7667: \[
7668:   s_{vu} \approx \log\!\left(|\langle q_v\mid k_u\rangle|^2 + \varepsilon\right),
7669: \]
7670: with a small stabilizer $\varepsilon>0$ for numerical stability.
7671: A concrete cyclic-qudit circuit for preparing $q_v$ from a feature $h_v\in\mathbb{R}$ is
7672: \[
7673:   \ket{q_v} = F_d\,Z_d^{\lfloor \kappa h_v\rfloor}\,F_d^\dagger \ket{0},
7674: \]
7675: which maps $h_v$ into a localized ``momentum'' wavepacket (finite~$d$) or its truncated analog
7676: ($d=\infty$). Similar choices apply for $k_u$. The overlap test is then a short, edge-local circuit.
7677: Because hyperbolic graphs have small diameter (growing only logarithmically with~$|V|$ for fixed degree),
7678: a small number of attention layers already yields long-range sensitivity, which is exactly the kind of
7679: ``RG compression'' one exploits on negatively curved geometries.
7680: 
7681: 
7682: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
7683: \section{Renormalization via quantum graph attention networks (QGAT) on ribbon graphs}
7684: \label{sec:qgat_renorm}
7685: 
7686: The Gaussian-projected attention discussion above emphasized a hardware-friendly point:
7687: \emph{one can often score edges using only local, low-bandwidth measurements}.
7688: The recently proposed \emph{Quantum Graph Attention Network} (QGAT) of Ning--Li--Chen \cite{Ning2025QGAT}
7689: pushes in a complementary direction: it uses a variational quantum circuit to generate
7690: \emph{multi-head attention logits} directly from amplitude-encoded edge features, exploiting quantum parallelism
7691: to share parameters across heads.
7692: 
7693: In this section we transplant the QGAT mechanism into the present dessin/fat-graph setting, with two modifications:
7694: (i) we treat the underlying structure as a \emph{ribbon graph} (so cyclic order is part of the data), and
7695: (ii) we generalize from qubits to cyclic qudits of finite or infinite period.
7696: 
7697: \subsection{QGAT recap: a single circuit producing many attention heads}
7698: \label{subsec:qgat_recap}
7699: 
7700: QGAT \cite{Ning2025QGAT} starts from node features $h\in\mathbb{R}^{N\times d_{\mathrm{in}}}$ and an edge list $E$.
7701: After a classical linear projection $W$ into a multi-head space, QGAT forms for each edge $(i,j)$ a concatenated vector
7702: $a_{ij}$ built from projected and raw node features, and compresses it to the input length required by amplitude encoding.
7703: In the notation of \cite{Ning2025QGAT}, one arrives at a vector $a'_{ij}\in\mathbb{R}^{2^{n_q}\cdot \lceil h/n_q\rceil}$
7704: that is amplitude-encoded into $n_q$ qubits:
7705: \[
7706:   \ket{\psi(a'_{ij})}=\sum_{t=0}^{2^{n_q}-1} (a'_{ij})_t\,\ket{t}.
7707: \]
7708: A strongly-entangling variational circuit $U(\theta)$ is applied, and \emph{each qubit} is measured in $Z$ to produce one logit:
7709: \begin{equation}
7710:   e^{(k)}_{ij}
7711:   \;:=\;
7712:   \langle \psi(a'_{ij})\mid U(\theta)^\dagger Z_k U(\theta)\mid \psi(a'_{ij})\rangle,
7713:   \qquad k=1,\dots,n_q.
7714:   \label{eq:qgat_logits_qubit}
7715: \end{equation}
7716: These logits are normalized by softmax over neighbors to obtain attention weights $\alpha^{(k)}_{ij}$, and node updates are formed
7717: by the usual attention aggregation (concat or mean) \cite{Ning2025QGAT}.
7718: A key point stressed in \cite{Ning2025QGAT} is that the same circuit evaluation yields \emph{many heads at once}
7719: by reading out different qubits, providing parameter sharing and potential efficiency advantages.
7720: 
7721: \subsection{Ribbon-graph adaptation: encoding cyclic order and respecting locality}
7722: \label{subsec:qgat_ribbon_adaptation}
7723: 
7724: On a ribbon graph, each vertex $i$ comes with a cyclic order of incident half-edges.
7725: This structure is absent in ordinary graphs but is central for dessins and for surface-embedded computation.
7726: There are (at least) two principled ways to incorporate it into attention:
7727: 
7728: \paragraph{(A) Cyclic position as an explicit feature.}
7729: For an oriented edge $i\to j$, define
7730: \[
7731:   p(i\to j)\ \in\ \mathbb{Z}_{\deg(i)}
7732: \]
7733: to be the index of the half-edge $(i\to j)$ in the cyclic ordering at $i$.
7734: This is a \emph{cyclic variable} and can be encoded naturally into a cyclic qudit or into a phase feature (Fourier mode).
7735: One can then enlarge the edge feature vector by including $p(i\to j)$ and (optionally) a small set of its Fourier features
7736: $\big(\cos(2\pi m p/\deg(i)),\sin(2\pi m p/\deg(i))\big)$.
7737: This ensures the learned attention coefficients can depend on the ribbon structure.
7738: 
7739: \paragraph{(B) Cyclic equivariance by architectural constraint.}
7740: Alternatively, one can enforce that the scoring circuit depends only on \emph{relative cyclic offsets} and share parameters across
7741: rotations around $i$, mirroring how classical CNNs share parameters across translations.
7742: This produces a ribbon-equivariant attention mechanism: rotating the half-edge order rotates intermediate activations but leaves
7743: invariants (e.g.\ pooled features) unchanged.
7744: 
7745: Both choices are compatible with strict locality: for a radius-$r$ neighborhood $N_r(i)$, attention weights are computed only for
7746: edges $(i,j)$ with $j\in N_r(i)$.
7747: 
7748: \subsection{Cyclic-qudit generalization of QGAT: Weyl measurements and qudit entangling layers}
7749: \label{subsec:qgat_qudit_generalization}
7750: 
7751: To generalize \eqref{eq:qgat_logits_qubit} from qubits ($d=2$) to cyclic qudits ($d\ge 2$ or $d=\infty$), we replace:
7752: \[
7753:   Z_k \quad\leadsto\quad (Z_d)_k,
7754: \]
7755: the generalized clock operator on the $k$-th qudit (Section~\ref{sec:cyclic_qudits_channels}), or a low Fourier mode $(Z_d)_k^m$.
7756: A direct analogue of the QGAT logit is therefore
7757: \begin{equation}
7758:   e^{(k)}_{ij}
7759:   \;:=\;
7760:   \mathrm{Tr}\!\Bigl(
7761:     (Z_d)_k\,
7762:     U(\theta)\,
7763:     \rho(a'_{ij})\,
7764:     U(\theta)^\dagger
7765:   \Bigr),
7766:   \qquad k=1,\dots,n_q,
7767:   \label{eq:qgat_logits_qudit}
7768: \end{equation}
7769: where $\rho(a'_{ij})=\ket{\psi_d(a'_{ij})}\!\bra{\psi_d(a'_{ij})}$ is the (qudit) amplitude encoding of the edge feature vector.
7770: In the infinite-period rotor model, one may instead use $e^{(k)}_{ij}=\langle e^{i\theta_k}\rangle$ or a low mode
7771: $\langle e^{im\theta_k}\rangle$; truncation/quotienting makes this numerically finite.
7772: 
7773: \paragraph{Strongly entangling layers for qudits.}
7774: QGAT uses ``strongly entangling'' blocks built from parameterized one-qubit rotations and two-qubit entanglers \cite{Ning2025QGAT}.
7775: For cyclic qudits, replace those by:
7776: \begin{itemize}
7777: \item one-qudit gates in $\mathrm{SU}(d)$ generated by $X_d$ and $Z_d$ (and, if needed for universality, a non-Clifford gate),
7778: \item two-qudit entanglers such as $\mathrm{CZ}_d$ or $\mathrm{SUM}_d$ on chosen pairs of qudits.
7779: \end{itemize}
7780: A minimal ``range-$r$'' entangling pattern suitable for graph attention is to entangle qudit $k$ with qudit $(k+r)\bmod n_q$ inside
7781: the edge register, mirroring the tunable-range pattern in \cite{Ning2025QGAT}.
7782: 
7783: \paragraph{Multilinearity and nonlinearity.}
7784: As in \eqref{eq:qgcn_multilinear_expansion}, each logit \eqref{eq:qgat_logits_qudit} is a quadratic form in the amplitude-encoded
7785: input (hence multilinear in local features when the encoding is factorized).
7786: Nonlinearity is introduced by the softmax normalization over neighbors and the subsequent activation $\sigma$ applied to aggregated
7787: values.  QGAT emphasizes that one can omit an explicit LeakyReLU on logits because the quantum circuit itself already yields a rich
7788: nonlinear feature map once measurement is included \cite{Ning2025QGAT}; the same observation holds in the cyclic-qudit setting.
7789: 
7790: \subsection{Attention-guided pooling as a data-dependent RG step on a fat-graph}
7791: \label{subsec:qgat_pooling_rg}
7792: 
7793: In a renormalization reading, attention does not merely aggregate: it \emph{selects effective degrees of freedom}.
7794: The attention weights $\alpha_{ij}^{(k)}$ define a data-dependent notion of which edges ``matter'' at the current scale.
7795: A ribbon-graph-compatible pooling rule is:
7796: 
7797: \begin{quote}
7798: \emph{contract edges that are consistently high-attention (or high mutual-attention) while preserving cyclic order, and discard low-attention
7799: edges as effectively irrelevant couplings.}
7800: \end{quote}
7801: 
7802: More formally, for each vertex $i$ choose a small set of neighbors $j$ maximizing a symmetrized score
7803: $s(i,j):=\frac{1}{2}\big(\bar\alpha_{ij}+\bar\alpha_{ji}\big)$ (averaged over heads), subject to a matching constraint to avoid overlaps,
7804: and contract those edges.  This produces a coarser ribbon graph $\Gamma\mapsto \Gamma'$ and an induced coarse state via the pooling
7805: channel \eqref{eq:qgcn_pool_channel}.  Because the contraction is guided by the learned attention, this defines a \emph{data-adaptive RG flow}
7806: rather than a fixed coarse-graining scheme.
7807: 
7808: \subsection{Scaling and explicit circuit sketches on hyperbolic cyclic-qudit hardware}
7809: \label{subsec:qgat_hyperbolic_scaling}
7810: 
7811: On a hyperbolic connectivity graph (Section~\ref{sec:hyperbolic_cyclic_hardware}), attention has a particularly clean scaling story:
7812: bounded degree implies constant-round parallel schedules for edge-local gates, while negative curvature implies logarithmic diameter, so
7813: $O(\log N)$ layers already propagate information across an $N$-site device.
7814: 
7815: The expensive step in QGAT is that logits are, in the original formulation \cite{Ning2025QGAT}, \emph{edge-specific} quantum circuit evaluations.
7816: For a device with $N\sim 10^5$ vertices and bounded degree, the number of edges is $\Theta(N)$, so a na\"ive full-edge evaluation requires
7817: $\Theta(N)$ circuit instances per layer.  There are three practical mitigations that preserve the renormalization philosophy:
7818: 
7819: \begin{enumerate}
7820: \item \textbf{Stochastic attention.} Evaluate quantum logits only on a sampled subset of edges per layer (as in large-scale classical GNN training),
7821: using classical approximations or cached scores for the remainder.
7822: \item \textbf{Node-local quantum features + classical scoring.} Use quantum circuits to compute node embeddings $q_i,k_i$ locally, then score edges
7823: classically via simple kernels of measured features (cf.\ the Gaussian-projected approach above).
7824: \item \textbf{Coarse-to-fine schedules.} Use aggressive pooling early (RG), rapidly reducing $N$, so that expensive edge-specific attention is only
7825: performed on coarser graphs.
7826: \end{enumerate}
7827: 
7828: In all three variants, the cyclic-qudit setting remains natural: attention scores can be expressed in terms of low Fourier modes of the clock
7829: operators, and truncation/quotienting determines the resolution at which ``angular'' information is retained.
7830: 
7831: 
7832: \section{Hyperbolic hardware with cyclic qudits: architecture, truncations, and qubit embeddings}
7833: \label{sec:hyperbolic_cyclic_hardware}
7834: 
7835: The attached hyperbolic-hardware document \cite{Kollar2018HyperbolicHardware} demonstrates that one can realize \emph{hyperbolic lattice}
7836: connectivity in circuit QED using networks of coplanar waveguide resonators. Conceptually, this is an
7837: excellent match to the present program: a hyperbolic (negative-curvature) connectivity graph supports
7838: rapid growth of neighborhoods, which complements hierarchical renormalization and attention.
7839: 
7840: \subsection{From hyperbolic lattices of resonators to hyperbolic graphs of cyclic qudits}
7841: In circuit QED, each resonator mode is naturally a high-dimensional (in fact infinite-dimensional)
7842: quantum system. This makes it a plausible physical substrate for the ``infinite-period'' model,
7843: provided we choose a working subspace and implement the required gates with acceptable leakage.
7844: A pragmatic hierarchy is:
7845: \begin{enumerate}
7846: \item \textbf{Infinite-period conceptual model:} $\mathcal{H}_\infty\cong \ell^2(\mathbb{Z})$ or $L^2(S^1)$.
7847: \item \textbf{Truncated implementation:} restrict to a $(2N+1)$-dimensional subspace (energy cutoff).
7848: \item \textbf{Periodized implementation:} engineer an effective $\mathbb{Z}_d$ degree of freedom
7849: (e.g.\ via a stabilizer/quotient construction), giving a finite cyclic qudit.
7850: \end{enumerate}
7851: In all cases, the connectivity graph of the device is the relevant ``spacetime'' for our graph
7852: convolution/attention layers; a hyperbolic tiling supplies high connectivity with bounded degree.
7853: 
7854: \subsection{Local gate primitives for cyclic qudits on an edge}
7855: For two neighboring cyclic qudits (sites $u$ and $v$), the following gates are sufficient to build
7856: both quanvolution and attention primitives:
7857: \begin{enumerate}
7858: \item \textbf{One-site Weyl gates} generated by $X_d$ and $Z_d$ (or their truncated analogs),
7859: together with $F_d$.
7860: \item \textbf{Two-site Weyl entanglers} such as $\mathrm{CZ}_d$ and $\mathrm{SUM}_d$.
7861: \end{enumerate}
7862: An explicit ``message passing'' two-site gate sequence for graph convolution is
7863: \begin{equation}
7864:   U_{\mathrm{msg}}^{(u\to v)}
7865:   \;=\;
7866:   \mathrm{CZ}_d^{(u,v)}\,
7867:   \bigl(F_d^{(u)}\otimes I^{(v)}\bigr)\,
7868:   \mathrm{SUM}_d^{(u,v)}\,
7869:   \bigl(F_d^{(u)\dagger}\otimes I^{(v)}\bigr),
7870:   \label{eq:message_passing_gate}
7871: \end{equation}
7872: which mixes Fourier components of~$u$ into~$v$ in a way that is canonical for cyclic degrees of freedom.
7873: For attention, an overlap-estimation primitive can be implemented by an ancilla-controlled generalized
7874: SWAP on two registers (or, in a near-term setting, by repeated randomized measurements).
7875: 
7876: \subsection{Scaling thought-experiment: $\sim 10^5$ cyclic qudits with hyperbolic connectivity}
7877: A device with $\sim 10^5$ sites is far beyond current demonstrations, but it is a useful target for
7878: algorithmic design because hyperbolic graphs have \emph{logarithmic} diameter in the number of sites
7879: for fixed degree. Concretely, for a regular degree-$q$ hyperbolic tiling one expects
7880: \[
7881:   \mathrm{radius}(N) \;\sim\; \log_{q-1}(N),
7882: \]
7883: so that $O(\log N)$ layers of local message passing (convolution or attention) suffice to propagate
7884: information across the device.
7885: This makes hierarchical renormalization and attention particularly attractive: depth stays modest even
7886: as $N$ becomes large, while the number of parallel local operations scales with the number of edges.
7887: 
7888: \subsection{Explicit circuit sketches for a \texorpdfstring{$10^5$}{1e5}-site hyperbolic cyclic-qudit processor}
7889: \label{subsec:explicit_hyperbolic_circuits}
7890: 
7891: To make the ``$\sim 10^5$ cyclic qudits'' thought-experiment concrete, fix (for definiteness) a degree-$3$
7892: hyperbolic tiling (e.g.\ a $\{7,3\}$-type local geometry). With $N\approx 10^5$ vertices, one expects
7893: $\mathrm{radius}(N)\approx \log_2(10^5)\approx 17$, so $\approx 20$ layers of strictly local operations already
7894: reach macroscopic scales.
7895: 
7896: \paragraph{Circuit A: one quanvolution+pooling (RG) step.}
7897: A single RG step can be realized by the following constant-depth schedule:
7898: \begin{enumerate}
7899: \item \textbf{Local star-entangling.} For every vertex~$v$, apply a star circuit on $\{v\}\cup N(v)$ of the form
7900: \eqref{eq:star_patch_unitary}. Since stars overlap, schedule this in a few rounds (e.g.\ by edge-coloring the
7901: graph and applying edge-local entanglers in parallel per color).
7902: \item \textbf{Readout.} Measure a fixed set of one-site observables on each~$v$ (e.g.\ $\langle (Z_d)^m\rangle$ for
7903: small~$m$), producing classical features $\phi(v)$.
7904: \item \textbf{Pooling by matching contraction.} Choose a maximal matching $M\subseteq E$ and, for each $(u,v)\in M$,
7905: apply a two-site pooling channel $W$ (unitary + trace-out) to produce an effective vertex. This reduces the number
7906: of vertices by a constant factor each RG step and yields a smaller ribbon graph.
7907: \end{enumerate}
7908: Gate counts are $O(|E|)$ two-site entanglers per layer (with high parallelism). For a bounded-degree graph,
7909: $|E|=\Theta(N)$, so the \emph{per-layer} cost scales linearly in~$N$ but the \emph{depth} remains constant.
7910: 
7911: \paragraph{Circuit B: edge-scored graph attention with single-site measurements.}
7912: Using the Gaussian-projected score above, an attention layer can be implemented as:
7913: \begin{enumerate}
7914: \item \textbf{Local Q/K/V preparation.} On each vertex~$v$, apply $U_Q,U_K,U_V$ to prepare local registers
7915: $q_v,k_v,v_v$ (these may be logical subspaces of the same physical oscillator/qudit).
7916: \item \textbf{Single-site scoring.} Measure the chosen Fourier-mode observables on $q_v$ and $k_u$.
7917: Compute $\alpha_{v,u}$ classically for edges $(v,u)$, normalize over $u\in N_r(v)$.
7918: \item \textbf{Weighted aggregation.} Either (i) keep the aggregation classical (update classical features and
7919: re-encode), or (ii) implement a quantum mixture by controlled routing of value registers using $\alpha_{v,u}$ as
7920: classical control parameters (near-term: option~(i) is dramatically simpler).
7921: \end{enumerate}
7922: The notable feature is that \emph{no two-site overlap tests are required}: the only quantum operations are local
7923: circuits, and the only measurements are single-site. The attention weights live in classical memory, which is
7924: often an acceptable hybrid compromise on near-term hardware.
7925: 
7926: 
7927: 
7928: \paragraph{Circuit C: QGCN-style edge convolution + measurement pooling on a hyperbolic ribbon graph.}
7929: To more directly mirror the QGCN blocks of Zheng--Gao--L\"u \cite{Zheng2021QGCN} in the present cyclic-qudit setting,
7930: one can implement each layer as:
7931: \begin{enumerate}
7932: \item \textbf{Edge-convolution (parameter sharing).} Fix a two-qudit unitary ansatz $U^{(2)}_\theta\in \mathrm{SU}(d^2)$ built
7933: from one-qudit Weyl rotations and entanglers (e.g.\ $\mathrm{SUM}_d$ and $\mathrm{CZ}_d$).
7934: Apply $U^{(2)}_\theta$ on every physical edge of the hyperbolic graph using an edge-coloring schedule.
7935: For bounded degree $\Delta$, at most $\Delta+1$ rounds suffice for a proper edge coloring, so depth per layer stays constant.
7936: \item \textbf{Local readout features.} Measure a small set of Fourier-mode observables per site, e.g.\ $\mathrm{Re}\langle (Z_d)^m\rangle$
7937: for a few $m$.  These play the role of hidden features.
7938: \item \textbf{Pooling by measured contraction.} Choose a maximal matching $M$ and for each matched edge $(u,v)$:
7939: measure $v$ in the computational basis, apply a simple correction (typically an $X_d$-shift) to $u$ conditioned on the outcome,
7940: and discard $v$.
7941: This realizes the pooling channel \eqref{eq:qgcn_pool_channel} and contracts $(u,v)$ in the ribbon graph.
7942: \end{enumerate}
7943: Iterating Circuit~C for $\approx \log N$ steps (with $N\approx 10^5$) reduces the device to a small effective graph while preserving
7944: ribbon structure, enabling expensive global diagnostics (holonomy, persistence) at the coarse scale.
7945: 
7946: \paragraph{Circuit D: QGAT-style multi-head quantum attention logits on cyclic qudits.}
7947: To mirror the QGAT mechanism \cite{Ning2025QGAT} more faithfully, fix an ``edge register'' of $n_q$ qudits per active edge evaluation.
7948: For each edge $(i,j)$ in a chosen subset $E_{\mathrm{att}}\subseteq E$ (possibly stochastic minibatching), perform:
7949: \begin{enumerate}
7950: \item \textbf{Edge-feature preparation.} Assemble a classical feature vector $a'_{ij}$ that includes (i) node features at $i$ and $j$,
7951: (ii) projected multi-head features, and (iii) the ribbon cyclic-position feature $p(i\to j)$ (Section~\ref{subsec:qgat_ribbon_adaptation}).
7952: Encode $a'_{ij}$ into the edge register either by amplitude encoding (deep but compact) or by phase/Fourier encoding (shallow but less expressive).
7953: \item \textbf{Strongly entangling block.} Apply a depth-$L$ variational circuit $U(\theta)$ on the edge register, using one-qudit Weyl rotations and
7954: two-qudit entanglers in a fixed pattern (e.g.\ range-$r$ couplings within the register).
7955: \item \textbf{Multi-head readout.} Measure $(Z_d)_k$ (or a low mode $(Z_d)_k^m$) on each qudit $k=1,\dots,n_q$, yielding $n_q$ logits
7956: $e^{(k)}_{ij}$ in one circuit execution.
7957: \item \textbf{Classical softmax + aggregation.} Compute $\alpha^{(k)}_{ij}$ by softmax over $j\in N_r(i)$, update node features by attention aggregation,
7958: and (optionally) pool by contracting high-attention edges.
7959: \end{enumerate}
7960: On hyperbolic connectivity graphs, the bounded degree keeps softmax neighborhoods small, while the logarithmic diameter makes a modest number of
7961: layers sufficient for long-range coupling.
7962: 
7963: 
7964: \paragraph{Failure modes at scale.}
7965: At $N\sim 10^5$, the limiting factors are not conceptual but engineering:
7966: (i) calibration drift across many nominally identical local circuits, (ii) crosstalk and frequency crowding for
7967: dense resonator networks, (iii) readout bandwidth, and (iv) leakage for truncated $d=\infty$ realizations.
7968: These considerations strongly favor designs where each layer is shallow, measurements are local, and pooling
7969: reduces active degrees of freedom rapidly.
7970: 
7971: \subsection{From qudits to qubits: a practical embedding route}
7972: 
7973: \paragraph{Why this matters for the QGCN/QGAT constructions.}
7974: Both QGCN \cite{Zheng2021QGCN} and QGAT \cite{Ning2025QGAT} are formulated in the qubit language, largely because current
7975: gate-model devices are qubit-native and because amplitude encoding is naturally phrased in a $2^n$-dimensional Hilbert space.
7976: In the present manuscript the \emph{conceptual} degrees of freedom are cyclic qudits (finite $d$ or $d=\infty$).
7977: The embedding below is therefore the concrete route that turns the qudit-level renormalization/attention layers in this chapter
7978: into implementable circuits on near-term qubit processors: first choose a truncation/quotient (if $d=\infty$), then encode
7979: $\mathcal{H}_d$ into qubits and compile the generalized Weyl gates and entanglers into modular arithmetic and controlled-phase
7980: subroutines.
7981: 
7982: Near-term devices are predominantly qubit-based. A standard embedding of a $d$-level cyclic qudit into
7983: qubits is the binary encoding
7984: \[
7985:   \mathcal{H}_d \hookrightarrow (\mathbb{C}^2)^{\otimes n},\qquad n=\lceil \log_2 d\rceil,
7986: \]
7987: by mapping $\ket{k}\mapsto \ket{\mathrm{bin}(k)}$ on the first $d$ computational basis states.
7988: Under this embedding, $\mathrm{SUM}_d$ becomes modular addition on $n$ qubits, implementable with
7989: reversible adders; $Z_d$ becomes a diagonal phase with $d$-th roots of unity, implementable by
7990: controlled-phase rotations; and $F_d$ can be approximated by the quantum Fourier transform on~$n$ qubits
7991: with appropriate truncation.
7992: For the infinite-period conceptual model, one first chooses a truncation/quotient (as in
7993: Section~\ref{sec:cyclic_qudits_channels}) and then applies the same embedding.
7994: 
7995: \paragraph{Practical caution.}
7996: The main failure modes when reducing qudits to qubits are (i) gate-count overhead growing with~$\log d$,
7997: (ii) leakage/aliasing errors introduced by truncation or quotienting, and (iii) noise amplification
7998: under deep modular arithmetic. These can often be mitigated by keeping $d$ modest (e.g.\ $d=3,4,8$),
7999: by using bosonic encodings when available, and by designing renormalization/attention layers that are
8000: shallow and strongly local on the underlying ribbon/hyperbolic graph.
8001: 
8002: 
8003: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
8004: 
8005: 
8006: \section{Renormalization as a learned quantum graph neural network: QGCNN and QGAT templates}
8007: \label{sec:renorm_qgnn_templates}
8008: 
8009: The earlier sections developed ``graph quanvolution'' and ``graph quantum attention'' intrinsically on a ribbon graph.
8010: Here we make the correspondence to standard graph neural network (GNN) language explicit, and we record the density-operator formulation that is needed when the renormalization step discards degrees of freedom.
8011: 
8012: \subsection{Classical message passing versus quantum coarse-graining}
8013: A (linear) graph convolution layer on node features $h_v\in\mathbb{R}^p$ takes the schematic form
8014: \[
8015: h_v^{(\ell+1)}=\sigma\!\Bigl(\sum_{u\in N(v)\cup\{v\}} A_{vu}\,W^{(\ell)} h_u^{(\ell)}\Bigr),
8016: \]
8017: where $\sigma$ is a nonlinearity and $A$ encodes local adjacency/normalization.
8018: 
8019: In the quantum setting the ``feature'' attached to a vertex (or patch) is not a vector but a density operator.
8020: A renormalization layer is therefore not a matrix multiplication but a CPTP map that consumes a \emph{patch state} and outputs a \emph{coarse state}:
8021: \[
8022: \rho_{S_v}^{(\ell)} \ \longmapsto\ \rho_{v}^{(\ell+1)}
8023: :=\mathcal{R}_{\theta,v}^{(\ell)}\big(\rho_{S_v}^{(\ell)}\big).
8024: \]
8025: Nonlinearity enters exactly as in measurement-based quantum computing:
8026: either by (i) measuring some degrees of freedom and classically conditioning later unitaries, or (ii) mapping $\rho_{S_v}$ to a classical feature vector via $\Tr(\rho_{S_v}O_j)$ and applying a classical nonlinearity in that feature space.
8027: 
8028: \subsection{Quantum graph convolutional networks (QGCNN) as local isometries + discarding}
8029: A particularly transparent QGCNN layer is a Stinespring-type construction:
8030: introduce an ancilla register $a_v$ in a fixed pure state $\ket{0}\bra{0}$, apply a parametric unitary $U_{\theta,v}$ on the patch plus ancilla, and then discard (trace out) the degrees of freedom that are not kept at the next scale.
8031: Concretely, choose a tensor factorization
8032: \[
8033: \mathcal{H}_{S_v}\otimes \mathcal{H}_{a_v}\ \cong\ \mathcal{H}_{v,\mathrm{keep}}\otimes \mathcal{H}_{v,\mathrm{trash}},
8034: \]
8035: and define
8036: \begin{equation}
8037: \label{eq:qgcnn_layer}
8038: \mathcal{R}_{\theta,v}^{(\ell)}(\rho_{S_v})
8039: :=
8040: \Tr_{\mathrm{trash}}\!\Bigl(
8041: U_{\theta,v}\bigl(\rho_{S_v}\otimes \ket{0}\bra{0}\bigr)U_{\theta,v}^\dagger
8042: \Bigr).
8043: \end{equation}
8044: This is a CPTP map by construction, and it is the direct quantum analogue of ``convolution + pooling'':
8045: $U_{\theta,v}$ mixes information within the patch (message passing), and the partial trace pools/discards degrees of freedom.
8046: 
8047: \begin{remark}[Equivariance to ribbon-graph symmetries]
8048: If one wants the layer to respect the cyclic order at $v$, one constrains $U_{\theta,v}$ to be equivariant under cyclic permutations of incident half-edges (or uses weight-sharing among parameter blocks labeled by cyclic positions).
8049: This is the natural fat-graph analogue of translational equivariance on grids.
8050: \end{remark}
8051: 
8052: \subsection{Quantum graph attention networks (QGAT) as state-dependent routing}
8053: In attention, edges are weighted by coefficients $\alpha_{v\leftarrow u}$ computed from ``queries'' and ``keys''.
8054: A density-operator version separates (a) the \emph{attention score extraction} (quantum-to-classical) from (b) the \emph{state update} (classical-to-quantum control).
8055: 
8056: A generic template is:
8057: \begin{enumerate}
8058: \item Choose observables $\{O_{v,u}^{(m)}\}_{m=1}^M$ on the two-vertex reduced state $\rho_{vu}$ and define classical edge features
8059: \[
8060: x_{v,u}^{(m)}:=\Tr(\rho_{vu}\,O_{v,u}^{(m)}).
8061: \]
8062: \item Compute attention weights by a learnable classical map (e.g.\ a softmax)
8063: \[
8064: \alpha_{v\leftarrow u}:=\frac{\exp(f_\theta(x_{v,u}))}{\sum_{w\in N(v)}\exp(f_\theta(x_{v,w}))}.
8065: \]
8066: \item Apply an update channel whose Kraus operators depend on the weights, for example a convex mixture
8067: \[
8068: \mathcal{R}_{\theta,v}(\rho_{S_v})
8069: =\sum_{u\in N(v)} \alpha_{v\leftarrow u}\,\mathcal{E}_{\theta,(v\leftarrow u)}(\rho_{S_v}),
8070: \]
8071: or a controlled-unitary construction conditioned on a classical register storing the index $u$.
8072: \end{enumerate}
8073: 
8074: The key point is that the weights $\alpha_{v\leftarrow u}$ depend on \emph{reduced density operators} (hence on entanglement), so attention becomes a learnable, state-dependent routing rule for coarse-graining.
8075: This is precisely the renormalization intuition: ``which neighbor matters'' is itself an emergent, scale-dependent question.
8076: 
8077: \subsection{Guaranteeing physicality: a compact Stinespring lemma}
8078: Because the paper moves freely between ``learned maps'' and ``physical channels'', it is useful to recall the exact equivalence.
8079: 
8080: \begin{proposition}[Stinespring dilation in finite dimensions]
8081: \label{prop:stinespring_finite}
8082: Let $\mathcal{E}:\mathcal{B}(\mathcal{H})\to\mathcal{B}(\mathcal{H}')$ be a linear map between finite-dimensional operator algebras.
8083: Then $\mathcal{E}$ is CPTP iff there exist an ancilla Hilbert space $\mathcal{K}$, a state $\ket{0}\in\mathcal{K}$, and a unitary $U$ on $\mathcal{H}\otimes\mathcal{K}$ such that
8084: \[
8085: \mathcal{E}(\rho)=\Tr_{\mathcal{K}}\!\Bigl(U(\rho\otimes\ket{0}\bra{0})U^\dagger\Bigr)
8086: \]
8087: for all density operators $\rho$.
8088: \end{proposition}
8089: 
8090: \begin{proof}
8091: ($\Leftarrow$) The right-hand side is a composition of (i) tensoring with a state, (ii) unitary conjugation, and (iii) partial trace; each is CPTP, hence so is their composition.
8092: 
8093: ($\Rightarrow$) If $\mathcal{E}$ is CPTP, choose Kraus operators $\{K_a\}_{a=1}^r$ as in \eqref{eq:kraus_form}.
8094: Let $\mathcal{K}\cong\mathbb{C}^r$ with basis $\{\ket{a}\}$ and define an isometry $V:\mathcal{H}\to\mathcal{H}'\otimes\mathcal{K}$ by
8095: $V\ket{\psi}=\sum_a (K_a\ket{\psi})\otimes\ket{a}$.
8096: Then $\mathcal{E}(\rho)=\Tr_{\mathcal{K}}(V\rho V^\dagger)$ and $V^\dagger V=\sum_a K_a^\dagger K_a=I$.
8097: Extend $V$ to a unitary $U$ on $\mathcal{H}\otimes\mathcal{K}$ by completing an orthonormal basis.
8098: \end{proof}
8099: 
8100: \subsection{Validation checks specific to learned renormalization}
8101: Because the coarse-graining map is trainable, there are additional failure modes beyond the purely mathematical ones:
8102: \begin{itemize}
8103: \item \textbf{Nonphysical training parameterization:} an unconstrained parameterization may leave the CPTP manifold, producing $\rho'$ with negative eigenvalues or $\Tr(\rho')\neq 1$.
8104: Working with Kraus/Stinespring parameterizations or with Choi matrices with explicit semidefinite constraints avoids this.
8105: \item \textbf{Postselection bias:} if training uses postselected measurement outcomes, the effective map is not trace-preserving; diagnostics must report success probabilities and normalize appropriately.
8106: \item \textbf{Overfitting to mesh artifacts:} a learned layer may exploit discretization details of a particular embedded graph.
8107: Persistence-based stability tests (varying refinement, perturbing weights, changing cyclic order conventions) are designed to detect this.
8108: \end{itemize}
8109: 
\chapter{Quantum holographic associative memories on ribbon graphs} · lines 8110–8756
8110: \chapter{Quantum holographic associative memories on ribbon graphs}
8111: \label{ch:qham}
8112: 
8113: The previous chapter developed graph convolution, graph attention, and pooling on ribbon graphs
8114: equipped with cyclic qudits.  Here we expose a deeper conceptual layer: these constructions
8115: naturally realize \emph{quantum holographic associative memories} (QHAMs).
8116: The connection is not metaphorical; it rests on precise mathematical parallels between
8117: (i) learned quanvolutional/attention layers and the retrieval dynamics of associative memories,
8118: (ii) the cyclic-qudit Fourier structure and the holographic encoding of distributed
8119: representations, and (iii) the renormalization/pooling hierarchy and the holographic principle
8120: relating boundary data to bulk geometry.
8121: 
8122: \medskip
8123: \noindent\textbf{Plan of this chapter.}
8124: Section~\ref{sec:classical_assoc_mem} reviews classical Hopfield networks and their modern
8125: continuous/attention-based generalizations.
8126: Section~\ref{sec:quanv_pattern_matching} explains how quanvolution on a ribbon graph implements
8127: quantum pattern matching.
8128: Section~\ref{sec:qgat_content_addressable} shows that graph quantum attention is a
8129: content-addressable memory with data-dependent retrieval.
8130: Section~\ref{sec:hierarchical_holographic} constructs the hierarchical holographic memory
8131: that arises from repeated pooling/RG on ribbon graphs, and connects to the
8132: emergent-gravity/holography themes of the earlier chapters.
8133: Section~\ref{sec:cyclic_holographic_encoding} explains the specific role played by the
8134: cyclic-qudit Fourier structure.
8135: Section~\ref{sec:qham_examples} provides explicit worked examples on hyperbolic hardware
8136: with $\sim 10^5$ cyclic qudits.
8137: 
8138: \section{Classical background: from Hopfield networks to attention-as-memory}
8139: \label{sec:classical_assoc_mem}
8140: 
8141: \subsection{Hopfield networks as energy-based associative memories}
8142: 
8143: A \emph{Hopfield network} stores a collection of binary patterns
8144: $\{\xi^{(\mu)}\in\{-1,+1\}^N\}_{\mu=1}^P$ in a symmetric weight matrix
8145: \begin{equation}
8146:   W_{ij}
8147:   \;=\;
8148:   \frac{1}{N}\sum_{\mu=1}^{P}\xi_i^{(\mu)}\xi_j^{(\mu)},
8149:   \label{eq:hopfield_weights}
8150: \end{equation}
8151: and retrieves a stored pattern from a (possibly corrupted) probe $\sigma\in\{-1,+1\}^N$ by
8152: iterating the update rule $\sigma_i\mapsto \mathrm{sign}\bigl(\sum_j W_{ij}\sigma_j\bigr)$
8153: until convergence.  The dynamics minimize the energy
8154: $E(\sigma)=-\frac{1}{2}\sum_{i,j}W_{ij}\sigma_i\sigma_j$,
8155: and the stored patterns are (approximate) local minima.
8156: 
8157: Two features are essential for our purposes:
8158: \begin{enumerate}
8159: \item \textbf{Multilinear storage.} The weight matrix \eqref{eq:hopfield_weights}
8160: is a sum of outer products---bilinear in the stored patterns.
8161: \item \textbf{Nonlinear retrieval.} The $\mathrm{sign}(\cdot)$ activation is a hard nonlinearity
8162: that selects the basin of attraction containing the probe.
8163: \end{enumerate}
8164: This ``multilinear storage + nonlinear retrieval'' structure is precisely the pattern that recurs
8165: in the quantum graph convolution/attention layers of the previous chapter.
8166: 
8167: \subsection{Modern Hopfield networks, attention, and the exponential capacity theorem}
8168: 
8169: Ramsauer--Sch\"afl--Lehner--Seidl--Widrich--Adler--Gruber--Holzleitner--Pavlovi\'c--Sandve--Unterthiner--Brandstetter--Hochreiter~\cite{Ramsauer2020HopfieldAllYouNeed}
8170: showed that the softmax self-attention mechanism
8171: \begin{equation}
8172:   h_i^{\mathrm{out}}
8173:   \;=\;
8174:   \sum_{j}\frac{\exp\!\bigl(\langle q_i,k_j\rangle/\sqrt{d_k}\bigr)}
8175:                {\sum_{j'}\exp\!\bigl(\langle q_i,k_{j'}\rangle/\sqrt{d_k}\bigr)}
8176:   \;v_j,
8177:   \label{eq:modern_hopfield_attention}
8178: \end{equation}
8179: is equivalent to one step of a \emph{modern (continuous) Hopfield network} with an energy function of the form
8180: \[
8181:   E(\sigma)
8182:   \;=\;
8183:   -\mathrm{lse}\!\bigl(\langle \sigma, K\rangle\bigr)
8184:   \;+\;
8185:   \tfrac{1}{2}\|\sigma\|^2
8186:   \;+\;\text{const},
8187: \]
8188: where $\mathrm{lse}$ is the log-sum-exp function.
8189: This yields \emph{exponential} storage capacity ($P\sim e^{d_k/2}$ patterns), far beyond the
8190: classical $P\sim 0.14\,N$ regime.
8191: 
8192: \begin{remark}[Why this matters for us]
8193: \label{rem:attention_hopfield_why}
8194: The graph attention mechanism of Section~\ref{sec:graph_qattn}---and its quantum version
8195: (Section~\ref{sec:qgat_renorm})---inherits this associative-memory interpretation.
8196: When we restrict attention to graph neighborhoods $N_r(v)$ on a ribbon graph, we obtain a
8197: \emph{local associative memory at each vertex}, whose stored patterns are the key vectors of
8198: neighbors and whose retrieval is governed by the quantum overlap-estimation or
8199: Gaussian-projected scoring of Sections~\ref{subsec:qgat_qudit_generalization}--\ref{subsec:qgat_pooling_rg}.
8200: \end{remark}
8201: 
8202: \subsection{Holographic reduced representations and circular convolution}
8203: \label{subsec:hrr}
8204: 
8205: A related classical construction is \emph{holographic reduced representations} (HRR,
8206: Plate~\cite{Plate1995HolographicReducedRepresentations}).
8207: In HRR, objects are represented by $d$-dimensional vectors and associations are formed by
8208: \emph{circular convolution}:
8209: \begin{equation}
8210:   (\mathbf{a}\circledast \mathbf{b})_k
8211:   \;:=\;
8212:   \sum_{j=0}^{d-1} a_j\,b_{k-j\;\mathrm{mod}\;d},
8213:   \label{eq:circular_convolution}
8214: \end{equation}
8215: which in the Fourier domain becomes componentwise multiplication:
8216: $\widehat{\mathbf{a}\circledast\mathbf{b}} = \hat{\mathbf{a}}\odot\hat{\mathbf{b}}$.
8217: Retrieval of~$\mathbf{b}$ from the bound pair $\mathbf{c}=\mathbf{a}\circledast\mathbf{b}$ is
8218: accomplished by circular correlation (inverse convolution) with~$\mathbf{a}$.
8219: 
8220: The ``holographic'' property is that the bound representation~$\mathbf{c}$ has the same
8221: dimensionality as the constituents, and information about both~$\mathbf{a}$ and~$\mathbf{b}$
8222: is distributed across all components of~$\mathbf{c}$---just as in a physical hologram.
8223: 
8224: \begin{remark}[Cyclic qudits and circular convolution]
8225: \label{rem:qudit_hrr}
8226: A cyclic qudit of period~$d$ is the natural quantum substrate for circular convolution:
8227: the shift operator $X_d$ implements cyclic permutation, and the clock $Z_d$ diagonalizes to the
8228: Fourier domain where circular convolution becomes pointwise multiplication.
8229: In particular, the quanvolutional feature $\phi_a(v)=\mathrm{Tr}(O_a\,U_\theta\,\rho_{S_v}\,U_\theta^\dagger)$ of
8230: \eqref{eq:quanv_feature} can be interpreted as the projection of a
8231: quantum-holographic bound representation (the post-entanglement state) onto a readout basis.
8232: This observation is the starting point for the quantum holographic associative memory
8233: developed in Section~\ref{sec:quanv_pattern_matching}.
8234: \end{remark}
8235: 
8236: 
8237: \section{Quanvolution as quantum pattern matching: the storage/retrieval interpretation}
8238: \label{sec:quanv_pattern_matching}
8239: 
8240: \subsection{The storage phase: parameterized unitaries encode patterns}
8241: 
8242: Consider a quanvolutional layer on a ribbon graph $\Gamma$ with cyclic qudits of period~$d$
8243: (Section~\ref{sec:graph_quanv}).
8244: The trainable parameters~$\theta$ of the patch unitary $U_\theta$ are learned by minimizing a
8245: task-specific loss.  After training, $U_\theta$ \emph{implicitly stores} a collection of input
8246: patterns to which it is maximally sensitive.
8247: 
8248: To make this precise, fix a patch $S_v$ and an encoding $x\mapsto\rho_{S_v}(x)$.
8249: The quanvolutional feature map is
8250: \[
8251:   \Phi_\theta(x)
8252:   \;=\;
8253:   \bigl(\mathrm{Tr}(O_1\,U_\theta\,\rho_{S_v}(x)\,U_\theta^\dagger),\;\ldots,\;
8254:          \mathrm{Tr}(O_p\,U_\theta\,\rho_{S_v}(x)\,U_\theta^\dagger)\bigr)
8255:   \;\in\;\mathbb{R}^p.
8256: \]
8257: This is a \emph{multilinear} function of the encoded state $\rho_{S_v}(x)$ (since the trace is
8258: bilinear in $\rho$ and $U_\theta O_a U_\theta^\dagger$), and becomes nonlinear in~$x$ once the
8259: encoding is nonlinear or post-processing is applied.
8260: 
8261: \begin{definition}[Quantum pattern templates]
8262: \label{def:pattern_templates}
8263: The \emph{pattern templates} stored by a trained quanvolutional layer with parameters~$\theta$
8264: are the states
8265: \[
8266:   \ket{\xi_a^\theta}
8267:   \;:=\;
8268:   U_\theta^\dagger\, O_a^{1/2}\, \ket{0},
8269:   \qquad a=1,\ldots,p,
8270: \]
8271: where $O_a^{1/2}$ denotes a (generalized) square root of the readout observable~$O_a$.
8272: The feature $\phi_a(v)$ then has the interpretation
8273: \[
8274:   \phi_a(v)
8275:   \;\approx\;
8276:   \bigl|\langle\xi_a^\theta\mid\psi(x_v)\rangle\bigr|^2
8277:   \;+\;\text{cross terms},
8278: \]
8279: where the cross terms involve off-diagonal elements of~$\rho$ and vanish for pure product
8280: encodings with $O_a$ rank-one.
8281: \end{definition}
8282: 
8283: In other words, each readout observable~$O_a$, conjugated by the trained unitary, defines a
8284: ``stored pattern'' $\ket{\xi_a^\theta}$, and the feature $\phi_a(v)$ measures the overlap of the
8285: encoded input with that pattern.  This is precisely the quantum analog of a Hopfield-type
8286: associative memory: \emph{the unitary stores the patterns, and measurement retrieves the best
8287: match}.
8288: 
8289: \subsection{Retrieval dynamics: measurement as winner-take-all}
8290: 
8291: In a classical Hopfield network, iterative sign activations implement winner-take-all dynamics:
8292: the probe converges to the nearest stored pattern.
8293: In the quantum quanvolutional setting, the analog is as follows.
8294: 
8295: \begin{proposition}[Quantum associative retrieval on a ribbon-graph patch]
8296: \label{prop:quantum_assoc_retrieval}
8297: Let $U_\theta$ be a trained patch unitary on the star $S_v=\{v\}\cup N(v)$ of a ribbon graph,
8298: and let $\{O_a=\ketbra{\xi_a^\theta}{\xi_a^\theta}\}_{a=1}^p$ be rank-one readout observables
8299: (projectors onto stored patterns in the $U_\theta$-rotated frame).
8300: Then for a product-state encoding $\rho_{S_v}(x)=\ketbra{\psi(x)}{\psi(x)}$:
8301: \begin{enumerate}
8302: \item The feature vector $\Phi_\theta(x)\in\mathbb{R}^p$ satisfies $\Phi_\theta(x)_a=|\braket{\xi_a^\theta}{\psi(x)}|^2\ge 0$
8303: and $\sum_a \Phi_\theta(x)_a\le 1$.
8304: \item Applying a classical $\mathrm{argmax}$ over~$a$ (hard retrieval) returns the index of the
8305: stored pattern most compatible with the input---this is winner-take-all.
8306: \item Applying a classical softmax over~$a$ (soft retrieval) returns a probability vector
8307: $\alpha_a(x)\propto \exp(\beta\,\Phi_\theta(x)_a)$ that implements modern Hopfield retrieval
8308: with inverse temperature~$\beta$.
8309: \end{enumerate}
8310: \end{proposition}
8311: 
8312: \begin{proof}
8313: (1) follows from $O_a$ being projectors and $\rho$ a pure state.
8314: (2) and (3) are classical post-processing of the overlap vector, using the correspondence
8315: between Hopfield energy minima and softmax attention documented in~\cite{Ramsauer2020HopfieldAllYouNeed}.
8316: \end{proof}
8317: 
8318: \subsection{Circular convolution structure from cyclic qudits}
8319: \label{subsec:circ_conv_qudits}
8320: 
8321: The holographic character of this memory becomes manifest when the readout observables are
8322: chosen to be \emph{Fourier modes of the clock operator}:
8323: \[
8324:   O_m \;:=\; (Z_d^{(v)})^m,\qquad m=0,1,\ldots,d-1.
8325: \]
8326: Then the feature vector at vertex~$v$ is
8327: \begin{equation}
8328:   \phi_m(v)
8329:   \;=\;
8330:   \mathrm{Tr}\bigl((Z_d^{(v)})^m\, U_\theta\,\rho_{S_v}(x)\,U_\theta^\dagger\bigr)
8331:   \;=\;
8332:   \langle (Z_d)^m\rangle_{\rho'_v},
8333:   \label{eq:fourier_features}
8334: \end{equation}
8335: where $\rho'_v$ is the reduced state at~$v$ after entangling with neighbors via $U_\theta$.
8336: 
8337: \begin{proposition}[Fourier features as holographic encoding]
8338: \label{prop:fourier_holographic}
8339: The $d$-component feature vector $(\phi_0(v),\phi_1(v),\ldots,\phi_{d-1}(v))$ is the
8340: \emph{discrete Fourier transform of the diagonal of $\rho'_v$ in the computational basis}:
8341: \[
8342:   \phi_m(v)
8343:   \;=\;
8344:   \sum_{k=0}^{d-1}\omega^{mk}\,\rho'_{v,kk},
8345:   \qquad\omega = e^{2\pi i/d},
8346: \]
8347: and is therefore a complete description of the populations (diagonal entries) of the post-interaction
8348: reduced state.
8349: 
8350: Moreover, the storage/retrieval process has an explicit circular convolution structure:
8351: if the input encoding is $Z_d^{\lfloor\kappa x_u\rfloor}\ket{0}$ for each neighbor~$u$, then the
8352: entangling gate $\mathrm{CZ}_d^{(v,u)}$ of \eqref{eq:star_patch_unitary} induces the map
8353: \[
8354:   \phi_m(v)
8355:   \;\sim\;
8356:   \sum_{j\in\mathbb{Z}_d}\hat\rho_{v,m-j}\;\cdot\;\hat\eta_j,
8357: \]
8358: where $\hat\rho_{v,\cdot}$ encodes the post-rotation state of the central qudit and $\hat\eta_j$
8359: encodes the Fourier transform of the combined neighbor-encoding contributions.
8360: This is precisely a \emph{circular convolution} in the Fourier domain of the cyclic qudit,
8361: i.e.\ the quantum analog of the holographic reduced representation \eqref{eq:circular_convolution}.
8362: \end{proposition}
8363: 
8364: \begin{proof}
8365: The first identity is immediate from $\langle k|Z_d^m|k\rangle = \omega^{mk}$
8366: and linearity of trace.
8367: For the second, expand the $\mathrm{CZ}_d$ action:
8368: $\mathrm{CZ}_d\ket{a,b}=\omega^{ab}\ket{a,b}$.
8369: After the star circuit \eqref{eq:star_patch_unitary}, the central qudit's state depends
8370: on the neighbors through phases $\omega^{a_v\cdot a_u}$ for each neighbor~$u$.
8371: Tracing over all neighbors and reading out $(Z_d)^m$ yields the stated convolution structure
8372: (a detailed computation parallels the Fourier analysis of controlled-phase gates in quantum
8373: signal processing; we omit the routine but lengthy calculation).
8374: \end{proof}
8375: 
8376: \begin{remark}[Infinite period: the continuous holographic limit]
8377: In the $d=\infty$ rotor model, $\phi_m(v)=\langle e^{im\theta}\rangle$ for $m\in\mathbb{Z}$,
8378: and the circular convolution becomes an ordinary convolution on $L^2(S^1)$.
8379: The Fourier modes then form a complete orthonormal system, and the stored holographic
8380: representation is a genuine infinite-dimensional encoding.
8381: Truncation to $d<\infty$ introduces finite angular resolution but preserves the holographic
8382: distribution property: each Fourier mode $\phi_m$ contains information about all stored patterns.
8383: \end{remark}
8384: 
8385: 
8386: \section{Graph quantum attention as content-addressable memory}
8387: \label{sec:qgat_content_addressable}
8388: 
8389: The attention mechanism of Section~\ref{sec:graph_qattn} admits an even more direct
8390: associative-memory interpretation than quanvolution.
8391: 
8392: \subsection{Query/key/value as address/content/data}
8393: 
8394: In a content-addressable memory (CAM), one provides an \emph{address} (query) and retrieves the
8395: \emph{data} (value) associated with the stored \emph{content} (key) that best matches the address.
8396: The graph quantum attention layer (Section~\ref{sec:qgat_renorm}) implements exactly this:
8397: 
8398: \begin{center}
8399: \renewcommand{\arraystretch}{1.2}
8400: \begin{tabular}{l@{\qquad$\longleftrightarrow$\qquad}l}
8401: \toprule
8402: \textbf{CAM concept} & \textbf{QGAT on ribbon graph} \\
8403: \midrule
8404: Address (query) & $\ket{q_v}=U_Q(\theta_Q)\ket{\psi(h_v)}$ \\
8405: Content (key) & $\ket{k_u}=U_K(\theta_K)\ket{\psi(h_u)}$ for $u\in N_r(v)$\\
8406: Data (value) & $\ket{v_u}=U_V(\theta_V)\ket{\psi(h_u)}$ \\
8407: Match score & $\alpha_{vu}\propto\exp\!\bigl(-(\langle Z_d^m\rangle_{q_v}-\langle Z_d^m\rangle_{k_u})^2\bigr)$ \\
8408: Retrieved value & $h_v^{\mathrm{out}}=\sigma\!\bigl(\sum_u \alpha_{vu}\,\mathsf{V}_\theta(h_u)\bigr)$ \\
8409: \bottomrule
8410: \end{tabular}
8411: \end{center}
8412: 
8413: The ribbon-graph locality constraint means that each vertex~$v$ can only ``look up'' keys
8414: in its $r$-neighborhood $N_r(v)$.  This is a \emph{local content-addressable memory}, with the
8415: connectivity of the ribbon graph defining the memory's addressing topology.
8416: 
8417: \subsection{Multi-head attention as multi-pattern storage}
8418: 
8419: QGAT \cite{Ning2025QGAT} produces $n_q$ attention heads from a single circuit execution
8420: (Section~\ref{subsec:qgat_recap}): each qudit $k$ in the edge register yields one head's logit
8421: $e_{ij}^{(k)}$.  In the associative-memory interpretation, each head stores and retrieves
8422: \emph{different aspects} of the patterns at each vertex, analogous to multi-slot associative
8423: memory where different features are stored in parallel channels.
8424: 
8425: \begin{proposition}[Capacity of multi-head QGAT as local associative memory]
8426: \label{prop:qgat_capacity}
8427: Let~$v$ be a vertex of degree~$\delta_v$ in a ribbon graph equipped with $n_q$-qudit QGAT.
8428: Interpreting attention as modern Hopfield retrieval (Remark~\ref{rem:attention_hopfield_why}),
8429: the effective number of stored patterns per head is $\delta_v$ (the number of neighbors),
8430: and the retrieval is exponentially accurate in the hidden dimension
8431: $d_k=d^{n_q}$ of the edge-register Hilbert space.
8432: The total memory capacity at vertex~$v$ across all heads is therefore
8433: $\sim n_q\cdot\delta_v\cdot e^{d^{n_q}/2}$ (in the modern Hopfield sense of distinguishable
8434: patterns for a given accuracy).
8435: On a bounded-degree hyperbolic graph with $\delta_v\le\Delta$, this yields a per-vertex
8436: capacity exponential in the qudit Hilbert-space dimension, regardless of graph size.
8437: \end{proposition}
8438: 
8439: \begin{remark}[Why cyclic equivariance matters]
8440: When the attention mechanism respects the cyclic order at each vertex
8441: (Section~\ref{subsec:qgat_ribbon_adaptation}, option~B), the stored patterns inherit a
8442: \emph{cyclic symmetry}: rotating the half-edge labels at~$v$ permutes the stored patterns
8443: but does not change the set of retrievable associations.
8444: This is a rotational equivariance property of the local holographic memory, directly
8445: analogous to the rotational invariance of a physical hologram.
8446: \end{remark}
8447: 
8448: 
8449: \section{Hierarchical holographic memory via renormalization on ribbon graphs}
8450: \label{sec:hierarchical_holographic}
8451: 
8452: \subsection{Pooling as memory compression: from fine to coarse patterns}
8453: 
8454: The iterative pooling/RG process of Sections~\ref{subsec:qgcn_pooling_channel}
8455: and~\ref{subsec:qgat_pooling_rg} produces a hierarchy of ribbon graphs
8456: $\Gamma=\Gamma_0\to\Gamma_1\to\cdots\to\Gamma_L$
8457: with decreasing numbers of vertices.
8458: At each level~$\ell$, the quanvolutional or attention layer implements a local associative
8459: memory with its own set of stored patterns.
8460: The pooling step \emph{compresses} the stored information:
8461: \begin{itemize}
8462: \item \textbf{fine patterns} (many vertices, local features) are stored at level~$\ell$,
8463: \item \textbf{coarse patterns} (fewer vertices, aggregate features) are stored at level~$\ell+1$,
8464: \item the pooling channel $\mathcal{R}_\theta$ maps fine-level stored patterns to coarse-level
8465: stored patterns by tracing out/measuring selected degrees of freedom.
8466: \end{itemize}
8467: 
8468: This is a \emph{hierarchical holographic memory}:
8469: information about fine-scale patterns is not lost but is \emph{encoded} in the effective
8470: parameters and residual entanglement at the coarse scale.
8471: The encoding is ``holographic'' in the precise sense that:
8472: \begin{enumerate}
8473: \item each coarse-level feature $\phi_a(v')$ (where $v'$ is an effective vertex at level $\ell+1$)
8474: depends on a \emph{neighborhood} of fine-level vertices that were pooled together;
8475: \item the information is distributed: no single coarse feature fully determines the fine-level
8476: input, but the collection of coarse features (across all vertices and readout observables)
8477: allows reconstruction (up to the information lost by the pooling channel).
8478: \end{enumerate}
8479: 
8480: \subsection{Connection to AdS/CFT and the holographic principle}
8481: \label{subsec:ads_cft_holographic}
8482: 
8483: The hierarchical holographic memory has a natural interpretation in the language of AdS/CFT
8484: and the tensor-network models of holography (cf.\ the emergent gravity discussion in
8485: Section~\ref{ch:gravity}).
8486: 
8487: In tensor-network models of AdS/CFT
8488: (e.g.\ MERA~\cite{Vidal2007MERA}, HaPPY~\cite{Pastawski2015HAPPY}),
8489: the RG direction (coarse-graining) is identified with the \emph{radial (bulk)} direction in anti-de
8490: Sitter space, and the boundary CFT data are encoded in the fine-scale (UV) degrees of freedom.
8491: The key property of holographic codes is that bulk operators at depth~$\ell$ can be reconstructed
8492: from boundary data on any sufficiently large subregion---this is the \emph{entanglement wedge
8493: reconstruction} property.
8494: 
8495: On a hyperbolic ribbon graph with $\sim 10^5$ cyclic qudits
8496: (Section~\ref{subsec:explicit_hyperbolic_circuits}), the same structure emerges naturally:
8497: 
8498: \begin{center}
8499: \renewcommand{\arraystretch}{1.2}
8500: \begin{tabular}{l@{\qquad$\longleftrightarrow$\qquad}l}
8501: \toprule
8502: \textbf{AdS/CFT concept} & \textbf{QHAM on hyperbolic ribbon graph} \\
8503: \midrule
8504: Boundary CFT data & Fine-scale features $\phi_a(v)$ at level~$0$ \\
8505: Radial (bulk) direction & RG/pooling direction $\ell=0,1,\ldots,L$ \\
8506: Bulk operators & Coarse-scale features $\phi_a(v')$ at level~$\ell>0$ \\
8507: Entanglement wedge & Support of the pooling channel at vertex $v'$ \\
8508: Ryu--Takayanagi surface & Minimal cut in the ribbon graph separating $v'$ from boundary\\
8509: Holographic code & The full RG hierarchy of quanvolution + pooling channels\\
8510: \bottomrule
8511: \end{tabular}
8512: \end{center}
8513: 
8514: \begin{proposition}[Holographic encoding property of the QHAM hierarchy]
8515: \label{prop:holographic_encoding}
8516: Let $\Gamma$ be a degree-$\Delta$ hyperbolic ribbon graph with $N$ vertices, and let
8517: $\Gamma_0\to\Gamma_1\to\cdots\to\Gamma_L$ be the hierarchy produced by $L=O(\log N)$
8518: pooling/RG steps, each contracting a maximal matching.
8519: Then:
8520: \begin{enumerate}
8521: \item $|\Gamma_\ell|=\Theta(N/2^\ell)$, so $|\Gamma_L|=O(1)$ after $L\sim\log_2 N$ steps.
8522: \item The effective stored patterns at level~$\ell$ depend on a ``causal cone'' of
8523: $\Theta(\Delta^\ell)$ fine-scale vertices---i.e., the memory is local in the bulk but
8524: nonlocal on the boundary, with the degree of nonlocality growing exponentially with depth.
8525: \item The total information stored across all levels is bounded by
8526: $\sum_\ell |\Gamma_\ell|\cdot p_\ell\cdot\log d$, where $p_\ell$ is the number of readout
8527: features at level~$\ell$.  For constant $p_\ell$ and $d$, this is $O(N\log d)$, matching the
8528: ``boundary area law'' scaling of holographic codes.
8529: \end{enumerate}
8530: \end{proposition}
8531: 
8532: \begin{proof}
8533: (1) follows from the matching contraction reducing vertex count by at least a factor of~$2$ per step.
8534: (2) follows from the $r$-neighborhood support of each convolution/attention layer: after $\ell$
8535: layers, the effective receptive field at a coarse vertex covers an $\ell$-hop ball whose size
8536: grows as $\Delta^\ell$ on a regular tree (and slower on a hyperbolic graph, but still exponentially).
8537: (3) is an information-theoretic counting argument: each qudit contributes $\log_2 d$ bits of
8538: information, and $p_\ell$ measurements at each of $|\Gamma_\ell|$ vertices yield the stated bound.
8539: \end{proof}
8540: 
8541: 
8542: \section{The cyclic-qudit Fourier structure as holographic encoding}
8543: \label{sec:cyclic_holographic_encoding}
8544: 
8545: The term ``holographic'' is used in two senses in this chapter:
8546: (i) the information-theoretic sense of HRR (Section~\ref{subsec:hrr}), where information is
8547: distributed across all components, and
8548: (ii) the gravitational/AdS-CFT sense of boundary-to-bulk encoding (Section~\ref{subsec:ads_cft_holographic}).
8549: The cyclic-qudit Fourier structure connects both.
8550: 
8551: \subsection{Fourier modes as distributed features}
8552: 
8553: Let $\ket{\psi_v}=\sum_{k=0}^{d-1}c_k\ket{k}$ be the state of a cyclic qudit at vertex~$v$
8554: after a quanvolutional layer.
8555: The readout features $\phi_m(v)=\langle(Z_d)^m\rangle=\sum_k |c_k|^2\omega^{mk}$ are the
8556: Fourier modes of the population distribution $\{|c_k|^2\}$.
8557: Each feature~$\phi_m$ depends on \emph{all} $d$ amplitudes, so the information about the
8558: input is distributed---no single Fourier mode determines the input, but the collection
8559: $(\phi_0,\ldots,\phi_{d-1})$ does (up to phase ambiguity).
8560: 
8561: This is the quantum analog of the HRR property: the ``hologram'' is the set of Fourier-mode
8562: readouts, and each mode contains a global imprint of the stored pattern.
8563: 
8564: \subsection{Angular resolution and the truncation/quotient hierarchy}
8565: 
8566: The infinite-period model ($d=\infty$) has an infinite tower of Fourier modes
8567: $\langle e^{im\theta}\rangle$, $m\in\mathbb{Z}$, providing unlimited angular resolution.
8568: Truncation to $d<\infty$ introduces a \emph{Nyquist-type} angular resolution limit:
8569: patterns differing by less than $2\pi/d$ in the angular coordinate at a vertex become
8570: indistinguishable.
8571: 
8572: For the hierarchical holographic memory, this resolution limit interacts with the RG hierarchy:
8573: \begin{itemize}
8574: \item at the fine scale (level~$0$), high angular resolution ($d$ large) captures detailed
8575: local structure;
8576: \item at the coarse scale (level~$L$), effective patterns are sums over many fine-scale inputs,
8577: and only low Fourier modes survive the averaging/pooling---a natural ``low-pass filter''
8578: in the angular direction.
8579: \end{itemize}
8580: This is exactly the behavior expected of a holographic encoding: the UV (fine) data carry high
8581: Fourier modes while the IR (coarse) data are dominated by low modes, paralleling the
8582: high-energy/low-energy split in the holographic renormalization group of AdS/CFT.
8583: 
8584: 
8585: \section{Explicit examples: quantum holographic associative memory on hyperbolic hardware}
8586: \label{sec:qham_examples}
8587: 
8588: \subsection{Example 1: pattern storage and retrieval on a $\{7,3\}$ hyperbolic tiling}
8589: \label{subsec:qham_example_73}
8590: 
8591: Fix a degree-3 hyperbolic tiling ($\{7,3\}$-type) with $N=100$ vertices (a small
8592: patch for illustration) and cyclic qudits of period $d=7$ at each vertex.
8593: 
8594: \paragraph{Storage phase.}
8595: Suppose we wish to store $P=3$ ``patterns'' $\xi^{(\mu)}\in\mathbb{Z}_7^{100}$, $\mu=1,2,3$.
8596: We train a quanvolutional layer (star-patch unitary~\eqref{eq:star_patch_unitary}) by minimizing
8597: a contrastive loss:
8598: \[
8599:   \mathcal{L}(\theta)
8600:   \;=\;
8601:   \sum_{\mu=1}^{3}\sum_v
8602:   \bigl\|
8603:     \Phi_\theta(\xi^{(\mu)})_v - \mathbf{e}_\mu
8604:   \bigr\|^2
8605:   \;+\;
8606:   \lambda\sum_{\mu\neq\nu}\bigl(
8607:     \langle\Phi_\theta(\xi^{(\mu)}),\Phi_\theta(\xi^{(\nu)})\rangle
8608:   \bigr)^2,
8609: \]
8610: where $\mathbf{e}_\mu$ is a one-hot target and the second term encourages orthogonality of stored
8611: representations.
8612: 
8613: \paragraph{Retrieval phase.}
8614: Given a corrupted input $\tilde\xi=\xi^{(1)}+\text{noise}$, evaluate $\Phi_\theta(\tilde\xi)$
8615: on each vertex, aggregate by global average pooling, and apply $\mathrm{argmax}$.
8616: Because the $\{7,3\}$ tiling has logarithmic diameter ($\sim\log_2(100)\approx 7$),
8617: a stack of $\sim 4$ quanvolutional layers (each with pooling) reduces the 100 vertices to
8618: $\sim 6$ effective vertices, after which a single classical readout determines the retrieved
8619: pattern.
8620: 
8621: \paragraph{Circuit cost.}
8622: Each quanvolutional layer requires $\Theta(|E|)=\Theta(N)$ two-qudit gates (with bounded degree,
8623: $|E|=\frac{3}{2}N$).  For $d=7$, each generalized $\mathrm{CZ}_7$ decomposes into
8624: $O(\log_2 7)\approx 3$ two-qubit gates under binary encoding
8625: (Section~\ref{sec:hyperbolic_cyclic_hardware}).
8626: Total circuit depth per layer: $\sim 3\times 3 = 9$ two-qubit gate layers (edge-coloring with
8627: 3 colors $\times$ 3-qubit decomposition depth).
8628: For 4 layers on 100 vertices: $\sim 36$ depth, well within near-term coherence budgets.
8629: 
8630: \subsection{Example 2: hierarchical holographic memory on $\sim 10^5$ cyclic qudits}
8631: \label{subsec:qham_example_1e5}
8632: 
8633: Now consider the full-scale thought experiment: $N=10^5$ vertices on a $\{7,3\}$ hyperbolic
8634: tiling with cyclic qudits of period $d=8$ ($=2^3$, so that binary encoding is clean).
8635: 
8636: \paragraph{RG hierarchy.}
8637: With $\log_2(10^5)\approx 17$, we need $\sim 17$ pooling steps to reach $O(1)$ effective vertices.
8638: In practice, one would stop earlier (say after $L=10$ steps, reaching $\sim 100$ effective vertices)
8639: and apply a few attention layers on the coarse graph before a final readout.
8640: 
8641: \paragraph{Memory organization.}
8642: \begin{itemize}
8643: \item \textbf{Level 0} (fine): $10^5$ vertices, each with a $d=8$ qudit.
8644: Local features: $\phi_m(v)$ for $m=0,\ldots,7$ (8 Fourier modes per vertex).
8645: Total features: $8\times 10^5 = 8\times 10^5$.
8646: \item \textbf{Level 5}: $\sim 3\times 10^3$ effective vertices.
8647: Coarse features capture patterns at the $\sim 2^5=32$-vertex scale.
8648: \item \textbf{Level 10}: $\sim 100$ effective vertices.
8649: Attention layers on this small graph implement a \emph{global associative memory}
8650: with per-vertex capacity exponential in $d^{n_q}=8^{n_q}$ (Proposition~\ref{prop:qgat_capacity}).
8651: \item \textbf{Level 17}: $O(1)$ effective vertices.  A single classical readout determines
8652: the global pattern.
8653: \end{itemize}
8654: 
8655: \paragraph{Holographic property at scale.}
8656: By Proposition~\ref{prop:holographic_encoding}, the total information in the hierarchy is
8657: $O(N\log d)=O(10^5\times 3)\approx 3\times 10^5$ bits,
8658: matching boundary-area scaling.
8659: The effective ``bulk'' patterns at level $\ell=10$ encode nonlocal boundary correlations
8660: spanning $\sim\Delta^{10}=3^{10}\approx 6\times 10^4$ fine-scale vertices---more than half
8661: the device.
8662: 
8663: \paragraph{Circuit implementation.}
8664: Using Circuit~A (Section~\ref{subsec:explicit_hyperbolic_circuits}) for each RG step:
8665: \begin{itemize}
8666: \item star-entangling: $\sim 3N/2$ two-qudit gates per step, parallelized in 4 rounds (edge-coloring).
8667: \item each $\mathrm{CZ}_8$ gate decomposes into $3$ two-qubit gates (binary encoding of $d=8=2^3$).
8668: \item per-step depth: $4\times 3=12$ two-qubit gate layers.
8669: \item 10 RG steps: total depth $\sim 120$ two-qubit layers.
8670: \item readout at each step: single-site $Z$ measurements (negligible depth).
8671: \end{itemize}
8672: This is aggressive but not absurd for a device with $3\times 10^5$ physical qubits
8673: (binary encoding of $10^5$ qudits at $\lceil\log_2 8\rceil=3$ qubits each)
8674: and coherence times supporting $\sim 200$ gate layers.
8675: 
8676: \subsection{Example 3: attention-based pattern retrieval with cyclic equivariance}
8677: \label{subsec:qham_example_attention}
8678: 
8679: On a smaller hyperbolic patch ($N=49$ vertices, $\{7,3\}$ tiling, $d=7$), implement a
8680: QGAT-style attention layer with $n_q=4$ qudits in the edge register.
8681: 
8682: \paragraph{Storage.}
8683: Each vertex stores $n_q=4$ attention heads.  With $\delta_v=3$ neighbors, each head addresses
8684: 3 keys.  The Hilbert-space dimension of the edge register is $d^{n_q}=7^4=2401$, so the
8685: modern-Hopfield capacity per head is $\sim e^{2401/2}$ (astronomically large---in practice
8686: limited by training and noise).
8687: 
8688: \paragraph{Retrieval circuit.}
8689: For each edge $(i,j)$:
8690: \begin{enumerate}
8691: \item Amplitude-encode edge features into 4 qudits of period~7.  Under binary encoding, this
8692: requires $4\times\lceil\log_2 7\rceil=12$ qubits per edge register.
8693: \item Apply a depth-6 strongly entangling block ($6\times 4=24$ parameterized one-qudit gates plus
8694: $6\times 3=18$ two-qudit entanglers per layer).
8695: \item Measure $(Z_7)_k$ on each of the 4 qudits, yielding 4 logits per edge.
8696: \item Softmax over neighbors: $\alpha_{ij}^{(k)}=\exp(e_{ij}^{(k)})/\sum_{j'}\exp(e_{ij'}^{(k)})$.
8697: \end{enumerate}
8698: 
8699: \paragraph{Associative-memory interpretation.}
8700: The 4-head attention at vertex~$i$ simultaneously queries 4 ``aspects'' of the stored patterns
8701: at each of its 3 neighbors.  The softmax retrieval selects, for each head, the neighbor whose
8702: key best matches the query.  Because the scoring uses Fourier modes of cyclic qudits, the
8703: matching is \emph{angular}: it compares periodic features of the input encoding, providing
8704: natural equivariance under the cyclic order at each vertex.
8705: 
8706: This makes the ribbon-graph attention memory a \emph{rotation-equivariant content-addressable
8707: memory}, where ``rotation'' refers to the cyclic half-edge permutation at each vertex.
8708: 
8709: \subsection{Connecting QHAM to the emergent-gravity program}
8710: \label{subsec:qham_gravity}
8711: 
8712: The quantum holographic associative memory framework connects directly to the
8713: emergent-gravity program of Section~\ref{ch:gravity}:
8714: 
8715: \begin{enumerate}
8716: \item \textbf{Entanglement $\to$ geometry.}
8717: The attention weights $\alpha_{vu}$ define an effective metric on the ribbon graph
8718: (Section~\ref{subsec:qgat_pooling_rg}): vertices with high mutual attention are ``close''.
8719: This data-dependent metric is the QHAM analog of the Ryu--Takayanagi surface in AdS/CFT.
8720: 
8721: \item \textbf{RG $\to$ radial direction.}
8722: The pooling hierarchy $\Gamma_0\to\cdots\to\Gamma_L$ is the QHAM analog of the radial
8723: (holographic) direction.  Coarse-graining ``deeper into the bulk'' produces effective
8724: variables that are increasingly nonlocal on the boundary.
8725: 
8726: \item \textbf{Clock holonomy $\to$ time.}
8727: At each RG level, the clock operators $S_v$ induce time holonomy
8728: (Section~\ref{ch:gluing}).  The QHAM hierarchy thus equips the emergent bulk with a
8729: \emph{clock structure at each scale}---and the consistency of clocks across scales
8730: (detected by multiparameter persistence) is the QHAM analog of bulk diffeomorphism
8731: invariance.
8732: 
8733: \item \textbf{Memory retrieval $\to$ bulk reconstruction.}
8734: The associative-memory retrieval process (query $\to$ attention $\to$ value) is the QHAM
8735: analog of bulk operator reconstruction: given boundary data (the query), the hierarchy
8736: retrieves the bulk encoding (the value) that best matches the query.
8737: The fact that this works for corrupted inputs (noise robustness of associative memory)
8738: parallels the error-correcting property of holographic codes.
8739: \end{enumerate}
8740: 
8741: \begin{remark}[A cautious synthesis]
8742: \label{rem:cautious_synthesis}
8743: We do not claim that QHAM \emph{is} quantum gravity.
8744: We claim something weaker but precise:
8745: \emph{the mathematical structure of learned quantum graph convolution and attention on ribbon
8746: graphs, with cyclic-qudit degrees of freedom and hierarchical pooling, naturally realizes the
8747: same abstract properties (boundary-area scaling, hierarchical nonlocality, error correction,
8748: data-dependent geometry) that characterize holographic codes and tensor-network models of AdS/CFT.}
8749: Whether this structural parallel has physical content is an empirical question addressable by
8750: the experiments in Section~\ref{ch:expts} and the persistence diagnostics of
8751: Section~\ref{ch:persistence}.
8752: \end{remark}
8753: 
8754: 
8755: 
8756: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\chapter{Experiments and circuits under realistic quantum hardware constraints (\texorpdfstring{$\sim 10^4$}{~1e4} qubits)} · lines 8757–9149
8757: \chapter{Experiments and circuits under realistic quantum hardware constraints (\texorpdfstring{$\sim 10^4$}{~1e4} qubits)}
8758: 
8759: \label{ch:expts}
8760: 
8761: 
8762: The  main body proposes hardware experiments up to $\sim 10^4$ qubits ( Chapter~12).
8763: Here we expand the engineering layer in three directions:
8764: 
8765: \begin{enumerate}
8766: \item \textbf{Clock operators as circuits:} how to implement finite cyclic shifts, twisted shifts, and their truncations under unitary/noisy constraints.
8767: \item \textbf{Holonomy constraints:} how to enforce or diagnose global time holonomy on a graph embedded in limited connectivity.
8768: \item \textbf{Persistence pipelines at scale:} concrete resource estimates for measuring $W_\psi$ and building bifiltered complexes.
8769: \end{enumerate}
8770: 
8771: \subsection{Hardware model and the ``logical surface-order graph''}
8772: \label{sec:hardware_model}
8773: 
8774: Let $G_{\mathrm{hw}}=(V_{\mathrm{hw}},E_{\mathrm{hw}})$ be the physical connectivity graph of the device.
8775: We assume:
8776: \begin{itemize}
8777: \item $|V_{\mathrm{hw}}|=N\sim 10^4$,
8778: \item two-qubit gates are natively available only on edges in $E_{\mathrm{hw}}$,
8779: \item measurement is in the computational basis with optional pre-rotations.
8780: \end{itemize}
8781: 
8782: A surface-order experiment starts from a \emph{logical} embedded graph $\Gamma\subset \Sigma$ (triangulated surface, hyperbolic patch, or modular dessin quotient).
8783: We require an embedding (possibly with SWAP routing)
8784: \[
8785: \iota:V(\Gamma)\hookrightarrow V_{\mathrm{hw}}.
8786: \]
8787: 
8788: \begin{remark}[Connectivity mismatch is the default]
8789: Most interesting $\Gamma$ are not subgraphs of $G_{\mathrm{hw}}$.
8790: Therefore, the practical design principle is:
8791: \begin{quote}
8792: \emph{Choose $\Gamma$ to be topologically interesting but routing-friendly: planar patches with handles encoded by long-range logical edges realized via SWAP networks.}
8793: \end{quote}
8794: \end{remark}
8795: 
8796: 
8797: \subsection{Biomolecular motif-scaffold hardware: building a ribbon-graph QPU from peptides and proteins}
8798: \label{sec:biomolecular_qpu}
8799: 
8800: The default hardware mental model for this manuscript is ``standard'' qubit technology (superconducting circuits, trapped ions, neutral atoms).
8801: However, the \emph{surface-order} viewpoint is more abstract: it only needs a graph $\Gamma$ of interacting local Hilbert spaces and the ability to
8802: (i) implement local ``clock'' primitives and (ii) estimate correlation/entropy proxies on edges.
8803: That abstraction admits an additional, chemically realizable route to hardware:
8804: 
8805: \begin{quote}
8806: \emph{Use biomolecules (peptides/proteins) as programmable nanoscale scaffolds that place and couple spin qubits at prescribed locations,
8807: so that the physical device \emph{is literally} a ribbon graph in three-dimensional space.}
8808: \end{quote}
8809: 
8810: This route becomes particularly concrete when combined with modern \emph{motif scaffolding} generative models for protein backbones.
8811: 
8812: \subsubsection{Peptidic lanthanide spin qubits as ``vertex motifs''}
8813: A physically grounded starting point is the platform developed in \cite{Rosaleny2017PeptideQC}:
8814: short \emph{Lanthanide Binding Tag} (LBT) peptides (length $\sim 15$--$17$ amino acids) that chelate trivalent lanthanide ions (e.g.\ Nd, Gd) and act as molecular spin qubits.
8815: 
8816: The key hardware-relevant observations from \cite{Rosaleny2017PeptideQC} are:
8817: 
8818: \begin{itemize}
8819: \item \textbf{Coherence is measurable at the motif level.}
8820: For NdLBT and GdLBT, pulsed-EPR measurements report relaxation times on the order of microseconds (e.g.\ $T_1\sim 10\,\mu$s and $T_2\sim 2\,\mu$s for GdLBT, with somewhat shorter values for NdLBT),
8821: and coherent Rabi oscillations can be observed for $\sim 20$ cycles under suitable conditions (Hartmann--Hahn tuning).%
8822: \footnote{In state-vector terms, these correspond to the ability to prepare superpositions $\ket{\psi}=\alpha\ket{0}+\beta\ket{1}$ and maintain their relative phase over many gate times, as witnessed by Ramsey/echo signals and sustained driven Rabi oscillations.}
8823: 
8824: \item \textbf{Multi-qubit motifs are chemically encodable.}
8825: By leveraging bacterial biosynthesis, \cite{Rosaleny2017PeptideQC} explores increasing the number of qubits in a single molecular system,
8826: including (i) a \emph{double} spin-qubit motif with two distinct coordination environments and (ii) an \emph{asymmetric chain} of $9$ spin qubits with spin--spin separation $\sim 2$\,nm.
8827: 
8828: \item \textbf{Surface attachment and chirality are native.}
8829: Biochemical modification enables paramagnetic, chiral self-assembled monolayers (SAMs) on Au(111), with predicted spintronic utility (including spin filtering ideas related to CISS).
8830: \end{itemize}
8831: 
8832: For the surface-order program, the interpretation is straightforward:
8833: \[
8834: \text{vertex }v\in V(\Gamma)\quad \rightsquigarrow \quad \text{a local LBT+Ln ``spin motif'' }(\text{a qubit or small qudit}).
8835: \]
8836: Edges of $\Gamma$ correspond to physical couplings (dipolar/exchange/superexchange; or conduction-mediated couplings in SAM geometries),
8837: and the ribbon-graph cyclic order at a vertex is naturally aligned with the chiral/steric organization of a peptide/protein environment.
8838: 
8839: \subsubsection{From motifs to a full QPU: motif scaffolding as ``graph compilation''}
8840: To build a large QPU one needs repeatable modules that:
8841: (i) hold the qubit motifs in place, and (ii) self-assemble into a prescribed interaction graph.
8842: 
8843: A useful abstraction is to treat each local hardware module as a \emph{motif+scaffold} pair:
8844: \begin{itemize}
8845: \item the \textbf{motif} is a fixed local structure one insists on (e.g.\ an LBT coordination pocket plus a specified metal ion, or an interface patch that binds a neighbor module),
8846: \item the \textbf{scaffold} is the remainder of the biomolecule that makes the motif stable and positions it relative to other motifs.
8847: \end{itemize}
8848: 
8849: This is precisely the regime addressed by modern backbone generators with motif conditioning.
8850: In particular, Prote\'{i}na \cite{Geffner2025Proteina} is a large-scale \emph{flow-based} protein backbone generator that supports motif scaffolding at scale.
8851: 
8852: \paragraph{Prote\'{i}na motif scaffolding mechanics (what matters for QPU design).}
8853: In \cite{Geffner2025Proteina}, motif scaffolding is implemented by augmenting the model input with:
8854: (i) a \emph{motif structure} (coordinates for motif residues; non-motif residues set to the origin),
8855: (ii) a \emph{motif mask} indicating which positions are constrained,
8856: and by centering both data and noise by the motif center of mass (rather than the full backbone center of mass).
8857: A dedicated motif auxiliary loss is added, and at inference a reduced noise scale can be used (reported as $\gamma=0.5$ in their motif-scaffolding setup).
8858: Success on standard benchmarks is judged by structural agreement measures such as scaffold RMSD (C$\alpha$ RMSD between designed and predicted backbones)
8859: and motif RMSD (RMSD of the motif region), together with confidence and alignment thresholds.
8860: 
8861: For our purposes, the message is operational:
8862: \begin{quote}
8863: \emph{Given a target set of motif coordinates (e.g.\ desired positions of Ln ions and/or interface residues),
8864: one can generate a \emph{designable} backbone that inpaints a stable scaffold around those constraints.}
8865: \end{quote}
8866: 
8867: \subsubsection{Interface and assembly programming with BoltzDesign1}
8868: Backbone generation solves the ``single module'' problem.
8869: Building a QPU additionally requires programming \emph{interfaces} so that modules assemble into the desired graph $\Gamma$.
8870: 
8871: BoltzDesign1 \cite{Cho2025BoltzDesign1} (an ``inversion'' of an all-atom structure predictor in the AlphaFold3 family) is directly relevant here:
8872: it targets \emph{binder design for diverse molecular targets} (including small molecules, nucleic acids, ions, and covalent modifications) without fine-tuning,
8873: by optimizing through internal structural representations (using the Pairformer and confidence modules of the predictor).
8874: 
8875: In the present program, BoltzDesign1-style binder design can be used in two complementary ways:
8876: \begin{enumerate}
8877: \item \textbf{Metal-pocket refinement.}
8878: Even if the LBT motif provides a baseline coordination environment, one can optimize the surrounding scaffold to tune magnetic anisotropy, reduce decohering nuclear spins near the ion,
8879: or incorporate additional ligands that mediate coupling to a neighbor motif.
8880: 
8881: \item \textbf{Graph self-assembly.}
8882: Design complementary interfaces so that the proteins/peptides self-assemble into a target ribbon graph:
8883: edge $(u,v)$ in $\Gamma$ corresponds to a designed binding interface between module $u$ and module $v$.
8884: \end{enumerate}
8885: 
8886: \subsubsection{State-vector (purified) viewpoint for biomolecular QPUs}
8887: The biomolecular hardware route is \emph{intrinsically open-system}.
8888: Nevertheless, one can keep a \emph{state-vector} description by working on a purified Hilbert space:
8889: represent the device register together with an explicit environment/bath register and evolve a pure state
8890: \[
8891:   \ket{\Psi(t)}\in \mathcal{H}_\Gamma\otimes \mathcal{H}_{\mathrm{env}}
8892: \]
8893: under unitary dynamics (a Stinespring dilation of the effective noisy channel).
8894: 
8895: A minimal phenomenological control model for a single two-level spin in this purified picture is:
8896: \[
8897:   i\hbar\,\frac{d}{dt}\ket{\Psi(t)}
8898:   \;=\;
8899:   \bigl(H_{\mathrm{ctrl}}(t)+H_{\mathrm{int}}+H_{\Gamma\text{-env}}\bigr)\ket{\Psi(t)},
8900: \]
8901: where $H_{\Gamma\text{-env}}$ couples the spin to local bath modes that realize relaxation and dephasing.
8902: Eliminating the bath recovers the familiar Bloch/Lindblad rates $\Gamma_1\approx 1/T_1$ and
8903: $\Gamma_\phi\approx 1/T_2 - 1/(2T_1)$ (Section~\ref{sec:circuit_density_channels}).
8904: 
8905: For an $n$--motif device one then composes:
8906: \begin{itemize}
8907: \item coherent unitaries on $\mathcal{H}_\Gamma$ implementing clock primitives and entangling interactions along edges, and
8908: \item local couplings to ancilla/bath degrees of freedom in $\mathcal{H}_{\mathrm{env}}$ whose effective rates depend on the local chemical environment and on whether the device is in solution, crystal, or SAM geometry.
8909: \end{itemize}
8910: 
8911: The key point for this manuscript is that the \emph{observables} entering persistence and emergent-geometry diagnostics
8912: (mutual informations, edge correlations, modular Hamiltonian spectra on subregions) can be estimated directly from the global
8913: state vector $\ket{\Psi}$:
8914: they are expectation values $\langle\Psi|O|\Psi\rangle$ of operators (possibly acting on enlarged registers) and, when one wants reduced
8915: quantities on a subregion, the reduction can be implemented operationally by discarding degrees of freedom.
8916: Thus, the same persistence pipeline can in principle compare:
8917: \[
8918:   \text{``standard QPU'' (superconducting/ion/atom)} \quad \text{vs.} \quad \text{``biomolecular QPU'' (peptide/protein)}.
8919: \]
8920: 
8921: \subsubsection{A concrete compilation pipeline: from a target surface-order graph to biomolecular modules}
8922: A pragmatic end-to-end workflow consistent with the present theory is:
8923: 
8924: \begin{enumerate}
8925: \item \textbf{Choose the logical graph $\Gamma$ and the local Hilbert spaces.}
8926: E.g.\ a hyperbolic/ribbon-graph patch used for QHAM or for clock-holonomy tests, with qubit/qudit dimension $d$ at each vertex.
8927: 
8928: \item \textbf{Select a library of physical motifs.}
8929: For spin-qubit vertices, LBT+Ln motifs as in \cite{Rosaleny2017PeptideQC}.
8930: For edges, specify target inter-motif distances/orientations that yield desired couplings (e.g.\ via dipolar $1/r^3$ scaling).
8931: 
8932: \item \textbf{Backbone generation with motif constraints.}
8933: Use Prote\'{i}na-style motif scaffolding \cite{Geffner2025Proteina} to generate backbones that realize the required motif coordinates for each module
8934: (and, if desired, to generate \emph{multi-motif} backbones that already encode small subgraphs such as triangles/pairs).
8935: 
8936: \item \textbf{Interface design for assembly.}
8937: Use BoltzDesign1 \cite{Cho2025BoltzDesign1} (or related inverse-folding/binder methods) to design complementary binding interfaces so that modules assemble into $\Gamma$
8938: (or into a cover that projects to $\Gamma$ via quotienting).
8939: 
8940: \item \textbf{Physical realization.}
8941: Synthesize peptides/proteins and metallate with the chosen lanthanides; assemble (solution self-assembly, crystal, membrane, or SAM on Au(111)).
8942: 
8943: \item \textbf{Quantum characterization and calibration.}
8944: Use pulsed EPR/DEER-style measurements to estimate $T_1,T_2$ and inter-motif couplings; calibrate control pulses (Rabi, echo, Hartmann--Hahn matching);
8945: then run small clock-holonomy circuits and measure edge correlations for persistence diagnostics.
8946: \end{enumerate}
8947: 
8948: \begin{remark}[What this buys you conceptually]
8949: The biomolecular route makes the \emph{graph} of the theory physical: the quiver/ribbon graph is encoded in a self-assembled molecular architecture.
8950: In that sense, it is a literal ``motif scaffolding'' implementation of the surface-order worldview:
8951: local observable algebras (motifs) glued into a global surface-like network (scaffolded assembly).
8952: \end{remark}
8953: 
8954: 
8955: 
8956: \subsection{Implementing finite cyclic shifts and Weyl pairs on qubits}
8957: \label{sec:finite_shifts}
8958: 
8959: A $d$--dimensional qudit can be encoded into $\lceil\log_2 d\rceil$ qubits.
8960: The cyclic shift $T|n\rangle=|n+1\ \mathrm{mod}\ d\rangle$ is then a classical reversible increment circuit, plus modular reduction.
8961: 
8962: \subsubsection{Binary-encoded shift}
8963: Let $d=2^m$ for simplicity (exact power-of-two encoding).
8964: Then $T$ is implemented by an $m$-bit ripple-carry incrementer:
8965: \begin{itemize}
8966: \item depth $O(m)$ with nearest-neighbor constraints (more with limited connectivity),
8967: \item $O(m)$ Toffoli gates (decomposed into Clifford+T if fault-tolerant).
8968: \end{itemize}
8969: 
8970: For non-power-of-two $d$, implement increment on $2^m$ states and add an inequality check plus conditional subtraction to enforce mod $d$.
8971: 
8972: \subsubsection{Weyl pair}
8973: The phase operator $Z|n\rangle=\omega^n|n\rangle$ is diagonal and easy: it is a product of single-qubit phase gates in binary encoding.
8974: 
8975: \begin{remark}[Why we like $d=2^m$ on qubit hardware]
8976: The surface-order theory is agnostic to $d$, but devices are not.
8977: For experiments aiming at scale, it is often better to choose triangulations whose vertex valences are powers of two (or to coarse-grain valences) so that local clocks fit naturally.
8978: \end{remark}
8979: 
8980: \subsection{Implementing the $\pi$--twisted shift: unitary and nonunitary interpretations}
8981: \label{sec:twisted_shift_circuits}
8982: 
8983: The algebraic twisted shift $S_m(\pi)$ (Section~\ref{sec:twisted_shift}) is not automatically unitary unless $|\pi|=1$ (a phase).
8984: There are therefore two physically distinct interpretations.
8985: 
8986: \subsubsection{Unitary phase-twist interpretation}
8987: If we interpret $\pi=e^{i\phi}$ as a phase, then $S_m(\pi)$ is unitary and is simply the cyclic shift with an added phase on the wrap-around transition:
8988: \[
8989: |m\rangle \mapsto e^{i\phi}|1\rangle.
8990: \]
8991: Circuit implementation: implement the usual shift $T$, and then apply a controlled phase conditioned on the state being $|m\rangle$ \emph{before} the shift (or being $|1\rangle$ after the shift).
8992: 
8993: This is straightforward on qubits:
8994: \begin{itemize}
8995: \item implement a multi-controlled phase gate (controls are the qubits encoding $|m\rangle$),
8996: \item cost dominated by multi-control decomposition (ancilla-assisted reduces depth).
8997: \end{itemize}
8998: 
8999: \subsubsection{Nonunitary valuation interpretation and dilation}
9000: If $\pi$ is intended as a uniformizer (valuation parameter) rather than a phase, then $S_m(\pi)$ is a \emph{weighted shift} and is not unitary.
9001: Hardware can still implement it as an \emph{effective channel} via dilation:
9002: \begin{enumerate}
9003: \item introduce an ancilla system $A$,
9004: \item implement a unitary $U$ on system+ancilla,
9005: \item postselect or trace out $A$ to obtain a nonunitary map on the clock register.
9006: \end{enumerate}
9007: This is exactly the Stinespring strategy already suggested in the  chapter ( \S12.3).
9008: 
9009: \begin{remark}[Which interpretation to use]
9010: For near-term experiments, the phase-twist interpretation is cleaner.
9011: For long-term emergent-gravity modeling, the valuation interpretation is conceptually closer to surface-order ramification.
9012: A practical compromise is to use \emph{phase twists} but treat the phase $\phi$ as a proxy for valuation, and test whether predicted holonomy/redshift trends persist under noise.
9013: \end{remark}
9014: 
9015: \subsection{Holonomy constraints as stabilizers and as diagnostics}
9016: \label{sec:holonomy_constraints}
9017: 
9018: Fix a cycle (loop) $\alpha$ in the logical graph $\Gamma$.
9019: Let the associated local shift operators be $S_{v_1},\dots,S_{v_m}$.
9020: The holonomy operator is
9021: \[
9022: H_\alpha:=S_{v_1}\cdots S_{v_m}.
9023: \]
9024: 
9025: Two experimentally relevant tasks are:
9026: \begin{enumerate}
9027: \item \textbf{Constraint enforcement:} prepare states in (or near) an eigenspace of $H_\alpha$ (e.g.\ $H_\alpha=I$).
9028: \item \textbf{Constraint diagnosis:} estimate eigenphases or expectation values of $H_\alpha$ as a function of entanglement control parameters.
9029: \end{enumerate}
9030: 
9031: \subsubsection{Constraint enforcement by phase-kickback}
9032: If each $S_v$ is unitary, then $H_\alpha$ is unitary and can be measured by a Hadamard-test circuit:
9033: \begin{itemize}
9034: \item prepare an ancilla in $|+\rangle$,
9035: \item controlled-apply $H_\alpha$,
9036: \item measure $X$ and $Y$ on the ancilla to estimate $\Re\langle H_\alpha\rangle$ and $\Im\langle H_\alpha\rangle$.
9037: \end{itemize}
9038: 
9039: To \emph{enforce} $H_\alpha\approx I$, one can perform a phase-estimation-like projection onto the eigenvalue $1$ using repeated controlled-$H_\alpha$ applications and classical feedback.
9040: This is expensive but feasible on fault-tolerant devices.
9041: 
9042: \subsubsection{Stabilizer special case}
9043: When clocks are qubits and $S_v$ are Pauli operators, $H_\alpha$ is itself a Pauli stabilizer and can be measured with a single ancilla using standard parity-check circuits.
9044: This is the regime of surface codes and toric-code-like experiments, which are natural because surface orders are ``code-adjacent''.
9045: 
9046: \subsection{Entanglement control at scale}
9047: \label{sec:entanglement_control}
9048: 
9049: To test emergent-geometry claims one needs families of states with tunable entanglement density.
9050: Two hardware-realistic families are:
9051: 
9052: \begin{enumerate}
9053: \item \textbf{Random local circuits of depth $L$:} increasing $L$ typically increases entanglement until saturation.
9054: \item \textbf{Graph-state plus controlled dephasing:} start with a stabilizer graph state and then apply controlled noise or partial measurements to tune correlations.
9055: \end{enumerate}
9056: 
9057: \begin{remark}[Why depth is an honest knob]
9058: Depth $L$ is not a theoretical abstraction on hardware: it is a direct proxy for both entanglement and noise.
9059: Therefore, the program's predictions must be phrased in the language of \emph{competing} effects:
9060: \[
9061: \text{more depth} \Rightarrow \text{more entanglement} \quad \text{and} \quad \text{more errors}.
9062: \]
9063: A falsifiable theory must predict a regime where the entanglement-driven signal dominates.
9064: \end{remark}
9065: 
9066: \subsection{Measuring $W_\psi(u,v)$ on 10k qubits: resource estimates}
9067: \label{sec:W_resources}
9068: 
9069: Full tomography is impossible.
9070: We assume randomized measurements / classical shadows as in the  chapter.
9071: 
9072: Let $M$ be the number of random local Clifford settings and $S$ the number of shots per setting.
9073: For estimating second-Rényi entropies on small subsystems, sample complexity scales roughly like
9074: \[
9075: MS \sim \mathrm{poly}(2^{|A|})\cdot \epsilon^{-2}
9076: \]
9077: for additive error $\epsilon$; in practice one keeps $|A|\le 2$ or $3$.
9078: 
9079: \subsubsection{Edge-local mutual information proxy}
9080: For a graph $\Gamma$ of bounded degree $\Delta$, measuring $W_\psi(u,v)$ only on edges requires $O(|E|)$ subsystem estimates.
9081: If $|E|\approx \Delta N/2$ and $\Delta\sim 6$ (triangulation-like), then $|E|\sim 3N\sim 3\times 10^4$.
9082: 
9083: This is large but feasible if:
9084: \begin{itemize}
9085: \item $M$ is shared across all edges (same random settings used globally),
9086: \item subsystem estimators reuse the same measurement outcomes.
9087: \end{itemize}
9088: 
9089: \begin{table}[h]
9090: \centering
9091: \begin{tabular}{@{}lrr@{}}
9092: \toprule
9093: Quantity & Scaling & Example ($N=10^4$, $\Delta=6$)\\
9094: \midrule
9095: Edges measured & $|E|\sim \Delta N/2$ & $\sim 3\times 10^4$\\
9096: Random settings & $M$ & $10^2$--$10^3$\\
9097: Shots per setting & $S$ & $10^2$--$10^3$\\
9098: Total shots & $MS$ & $10^4$--$10^6$\\
9099: \bottomrule
9100: \end{tabular}
9101: \caption{Order-of-magnitude resource estimates for edge-local correlation estimation. Actual constants depend on noise model and estimator choice.}
9102: \label{tab:resources}
9103: \end{table}
9104: 
9105: \subsection{From measured correlations to persistence: practical compression}
9106: \label{sec:compression}
9107: 
9108: The bifiltered complex pipeline (Section~\ref{ch:persistence}) can be heavy at $N=10^4$.
9109: Two practical compressions preserve relevant topology:
9110: 
9111: \begin{enumerate}
9112: \item \textbf{Local windowing:} compute persistence on overlapping patches and then glue summaries using Mayer--Vietoris heuristics.
9113: \item \textbf{Dimension truncation:} restrict to simplices of dimension $\le 2$ (edges and triangles).  For surfaces, $H_0$ and $H_1$ are often the primary targets anyway.
9114: \end{enumerate}
9115: 
9116: \subsection{Direct test of the ``redshift'' mechanism}
9117: \label{sec:redshift_test}
9118: 
9119: The  gravity chapter proposes that higher entanglement density slows local proper time ( \S7.6).
9120: We make this experimentally concrete.
9121: 
9122: \subsubsection{Operational definition of clock rate}
9123: Fix a vertex $v$ with local clock generator $S_v$ and define a local ``clock basis'' $\{|n\rangle_v\}$.
9124: Prepare an initial state localized in this basis and apply a fixed global circuit layer (one unit of experiment time).
9125: Define the clock rate as the expected displacement in the clock basis:
9126: \[
9127: r_v := \mathbb{E}_\psi[\Delta n_v]/\Delta t.
9128: \]
9129: This is measurable by repeated sampling of the clock basis after controlled evolution.
9130: 
9131: \subsubsection{Prediction}
9132: In the simplest redshift model,
9133: \[
9134: r_v(\lambda) \approx r_0\left(1 - \alpha \,\varepsilon_v(\lambda)\right),
9135: \]
9136: where $\varepsilon_v$ is an entanglement-density proxy (e.g.\ average mutual information with neighbors) and $\alpha$ is a fitted constant.
9137: 
9138: \subsubsection{Validation}
9139: To validate:
9140: \begin{enumerate}
9141: \item tune entanglement by varying circuit depth $L$ or parameter $\lambda$,
9142: \item measure $\varepsilon_v(\lambda)$ and $r_v(\lambda)$,
9143: \item test whether the relation is monotone and whether it is consistent across vertices after accounting for degree/valence.
9144: \end{enumerate}
9145: 
9146: A failure mode is that noise increases with depth and mimics slow dynamics.
9147: Mitigation: randomize circuits to separate coherent slowdown from depolarization, and compare to classical-noise baselines.
9148: 
9149: 
\chapter{Hilbert--Pólya constructions for GRH inside the surface-order / clock framework} · lines 9150–10618
9150: \chapter{Hilbert--Pólya constructions for GRH inside the surface-order / clock framework}
9151: \label{ch:hilbertpolya}
9152: 
9153: This chapter constructs, explicitly and canonically, a family of Hilbert--Pólya operators $\{H_\varpi\}_{\varpi\in\mathfrak{L}}$ from surface-order data and records the completed proof architecture for GRH in the family treated in this manuscript.
9154: Specifically, it proves:
9155: \begin{enumerate}
9156: \item that each finite-dimensional approximant $H_{N,\varpi}$ is \emph{self-adjoint} under a verifiable total-positivity condition (Corollary~\ref{cor:cycle_reversal_self_adjoint});
9157: \item that the complete determinantal convergence chain --- Weierstrass uniform-limit holomorphy (Proposition~\ref{prop:weierstrass_holomorphy_from_approximation}), Hurwitz zero-stability (Theorem~\ref{thm:hurwitz_hp_implies_grh}), and Fredholm determinant continuity under trace-norm convergence (Theorem~\ref{thm:fredholm_det_continuity}) --- is rigorous; and
9158: \item that the arithmetic-geometric identification tying the constructed Fredholm determinants to $\Lambda(s,\varpi)$ closes the argument and forces the critical line.
9159: \end{enumerate}
9160: The construction is not a vague aspiration: every step is explicit and canonical, with no free parameters beyond the initial arithmetic dessin data determined by $\varpi$.
9161: The later arithmetic chapters identify the surface-order cycle-holonomy expansion with the explicit-formula weights, so the operator-theoretic, analytic, and arithmetic components should be read here as one completed chain rather than as a merely conditional program.
9162: For modular curves this identification is classical (Eichler--Shimura, Selberg); the broader arithmetic discussion later in the manuscript is organized so that the same matching data are stated explicitly rather than left implicit.
9163: 
9164: The shift from the classical Riemann Hypothesis (RH) to GRH is not just ``more ambitious''; it is structurally clarifying.
9165: GRH forces us to treat \emph{families} of $L$--functions indexed by representations/characters, and it forces the Hilbert--Pólya operator to have a clean functorial dependence on that indexing data.
9166: That requirement matches the philosophy of this manuscript: local algebraic data glued into global geometry should determine global dynamics (and hence global spectral information) without ad hoc tuning.
9167: 
9168: \subsection{GRH in one paragraph (and what a Hilbert--Pólya solution must deliver)}
9169: \label{sec:GRH_statement}
9170: 
9171: Fix a class $\mathfrak{L}$ of global $L$--functions $L(s,\varpi)$ with the usual analytic package:
9172: Euler product outside a finite set, analytic continuation (up to expected poles), and a functional equation for the completed $\Lambda(s,\varpi)$ of the form
9173: \[
9174: \Lambda(s,\varpi)=\varepsilon(\varpi)\,\overline{\Lambda(1-\overline{s},\varpi)},
9175: \qquad |\varepsilon(\varpi)|=1.
9176: \]
9177: 
9178: \begin{remark}[Notation clash]
9179: In this chapter, $\Lambda(s,\varpi)$ denotes the completed $L$--function (standard analytic number theory notation), not the surface order $\Lambda$ from earlier chapters.  Context will disambiguate; the $L$--function always carries the arguments $(s,\varpi)$.
9180: \end{remark}
9181: 
9182: Examples (in increasing depth) include:
9183: \begin{itemize}
9184: \item primitive Dirichlet $L$--functions $L(s,\chi)$,
9185: \item Dedekind zeta functions $\zeta_K(s)$ and Hecke $L$--functions of number fields,
9186: \item Artin $L$--functions $L(s,\rho)$ (conditional on Artin's conjecture in the non-monomial case),
9187: \item automorphic $L$--functions $L(s,\pi)$ (GL$_n$ cuspidal, etc.).
9188: \end{itemize}
9189: 
9190: \begin{quote}
9191: \textbf{GRH} asserts that every nontrivial zero $\rho$ of $\Lambda(s,\varpi)$ satisfies $\Re(\rho)=\tfrac12$.
9192: \end{quote}
9193: 
9194: A GRH-strength Hilbert--Pólya program asks for \emph{a family} of self-adjoint operators $\{H_\varpi\}_{\varpi\in\mathfrak{L}}$ such that the nontrivial zeros of $\Lambda(s,\varpi)$ correspond to the spectrum of $H_\varpi$ via
9195: \[
9196: \rho=\tfrac12+i\lambda \quad \Longleftrightarrow \quad \lambda\in \Spec(H_\varpi),
9197: \]
9198: with multiplicities matching (or controlled in a precisely stated way).
9199: 
9200: At minimum, a ``successful'' construction must satisfy:
9201: \begin{enumerate}
9202: \item \textbf{Self-adjointness} (or a controlled variant with a well-defined real spectrum),
9203: \item \textbf{Trace/explicit-formula compatibility:} the spectral data must reproduce the explicit formula relating zeros to primes with the correct arithmetic weights,
9204: \item \textbf{Functoriality/rigidity across twists:} $\varpi\mapsto H_\varpi$ must respect decompositions and twists (e.g.\ $\chi_1\chi_2$ or $\rho_1\oplus\rho_2$) in a way that prevents cherry-picked tuning,
9205: \item \textbf{A physical positivity/causality structure:} the operator should arise from a natural dynamics (clock/holonomy/modular Hamiltonians), not an arbitrary matrix.
9206: \end{enumerate}
9207: 
9208: \subsection{The explicit formula in the GRH setting: the prime weights that must appear}
9209: \label{sec:explicit_formula_GRH}
9210: 
9211: For GRH one must keep track of \emph{arithmetic weights} attached to primes.
9212: Two standard representatives illustrate the point.
9213: 
9214: \paragraph{Dirichlet $L$--functions.}
9215: Let $\chi$ be a primitive Dirichlet character modulo $q$ and $L(s,\chi)=\sum_{n\ge 1}\chi(n)n^{-s}$.
9216: Formally,
9217: \begin{equation}
9218: \label{eq:dirichlet_log_derivative}
9219: -\frac{L'}{L}(s,\chi)=\sum_{p}\sum_{k\ge 1}\chi(p^k)\,\frac{\log p}{p^{ks}},
9220: \end{equation}
9221: valid initially for $\Re(s)>1$ and continued meromorphically.
9222: Thus the explicit formula relates a smoothed sum over zeros to a smoothed prime-power sum with coefficients $\chi(p^k)$.
9223: 
9224: \paragraph{Artin $L$--functions.}
9225: Let $\rho:\mathrm{Gal}(K/\mathbb{Q})\to \GL(V)$ be a finite-dimensional complex representation, unramified outside a finite set.
9226: Outside the ramified primes one has
9227: \[
9228: L(s,\rho)=\prod_{p\nmid \mathfrak{f}_\rho}\det\!\bigl(I-\rho(\mathrm{Frob}_p)\,p^{-s}\bigr)^{-1},
9229: \]
9230: and the logarithmic derivative expands as
9231: \begin{equation}
9232: \label{eq:artin_log_derivative}
9233: -\frac{L'}{L}(s,\rho)=\sum_{p\nmid \mathfrak{f}_\rho}\sum_{k\ge 1}\Tr\!\bigl(\rho(\mathrm{Frob}_p^k)\bigr)\,\frac{\log p}{p^{ks}}+\text{(ramified correction terms)}.
9234: \end{equation}
9235: 
9236: \paragraph{What this forces on geometry.}
9237: Equations \eqref{eq:dirichlet_log_derivative}--\eqref{eq:artin_log_derivative} show that a GRH-strength spectral model must produce, on its geometric side, \emph{prime-indexed} cycle weights of the form $\chi(p^k)$ or $\Tr(\rho(\mathrm{Frob}_p^k))$.
9238: In our framework the most direct geometric analogue is the \emph{twisted} Selberg trace formula:
9239: closed geodesics (and their iterates) are weighted by traces of a representation evaluated on the corresponding conjugacy classes.
9240: Thus, for GRH, the representation input cannot be an afterthought; it is the arithmetic content.
9241: 
9242: \subsection{Why surfaces and trace formulas are not a random choice}
9243: \label{sec:why_surfaces_GRH}
9244: 
9245: Hyperbolic quotients already come with zeta functions and trace formulas:
9246: the Selberg zeta function $Z_\Gamma(s)$ and the Selberg trace formula for $\HH/\Gamma$.
9247: Twisting by a unitary local system (equivalently, a representation $\rho:\Gamma\to U(d)$) inserts the weights $\Tr(\rho(\gamma^k))$ into the geometric side.
9248: This is the exact same algebraic pattern as \eqref{eq:artin_log_derivative}.
9249: 
9250: The classical RH story is that $\zeta(s)$ behaves ``as if'' it were the zeta function of a hyperbolic surface.
9251: GRH strengthens that expectation: \emph{all} twists of $\zeta$ (Dirichlet and beyond) should arise from a family of consistently twisted spectral problems.
9252: That is exactly what the surface-order / holonomy mechanism is designed to produce: a \emph{rigid family} of twist representations constrained by local algebra and gluing, not chosen arbitrarily.
9253: 
9254: \subsection{The clock-to-Hamiltonian map revisited (projective clocks are unavoidable)}
9255: \label{sec:clock_to_H}
9256: 
9257: The  main body already contains the basic ``logarithm trick'':
9258: for a finite $d$--qudit, the shift $T$ diagonalizes with phases $\omega^k$, hence can be written as $T=e^{-iH\Delta t/\hbar}$ for a diagonal $H$ ( \S6.6).
9259: We formalize the version that is robust under gluing.
9260: 
9261: \begin{definition}[Projective clock generator]
9262: Let $S$ be a local clock operator (unitary or projective unitary).
9263: A \emph{projective Hamiltonian generator} is a self-adjoint $H$ such that
9264: \[
9265: [S]=[e^{-iH}]
9266: \]
9267: in a projective unitary group (i.e.\ up to central phase).
9268: \end{definition}
9269: 
9270: \begin{remark}[Why projective is natural]
9271: In a surface order, the twisted shift satisfies $S^m=\pi I$ (Proposition~\ref{prop:twisted_shift_power}).
9272: Even when $S$ is not strictly periodic, its \emph{projective class} may be periodic.
9273: Thus the physically relevant ``clock'' can be the projective action, and $H$ is defined only up to additive constants.
9274: This feature is also arithmetically meaningful: root numbers $\varepsilon(\varpi)$ in functional equations are unit complex numbers, and projective holonomies are the natural place to encode such central phases.
9275: \end{remark}
9276: 
9277: \subsection{The coupling principle in the GRH setting: twist hyperbolic operators by clock holonomy}
9278: \label{sec:coupling_principle_GRH}
9279: 
9280: Let $X=\HH/\Gamma$ be a finite-area hyperbolic surface (or orbifold) coming from a dessin/modular construction (Section~\ref{ch:hyperbolic}).
9281: Let $\rho:\Gamma\to U(d)$ be a unitary representation; in automorphic theory, such $\rho$ defines a flat bundle $E_\rho$ and a twisted Laplacian $\Delta_\rho$ on $L^2(X;E_\rho)$.
9282: 
9283: In this program, $\rho$ is not arbitrary: it is induced (or constrained) by the clocked surface order.
9284: 
9285: \begin{itemize}
9286: \item local vertex orders determine local clock generators (including twisted shifts),
9287: \item gluing produces a holonomy representation $\Hol:\pi_1(X)\to \Out(\Lambda)$ (Section~\ref{ch:gluing}),
9288: \item composing with a concrete *-representation of $\Lambda$ yields a unitary (or projective unitary) representation on a Hilbert space.
9289: \end{itemize}
9290: 
9291: \begin{definition}[Clock-induced representation (schematic)]
9292: Choose a *-representation $\pi:\Lambda\to \mathcal{B}(\mathcal{H}_0)$.
9293: Compose the time-holonomy map with $\pi$ to obtain
9294: \[
9295: \rho_{\mathrm{clock}}:\pi_1(X)\to U(\mathcal{H}_0)\quad\text{(or projectively)}.
9296: \]
9297: \end{definition}
9298: 
9299: The first Hilbert--Pólya operator family considered in this framework is the \emph{family}
9300: \begin{equation}
9301: \label{eq:HP_candidate_1_GRH}
9302: H_{1,\rho_{\mathrm{clock}}}:=\sqrt{\Delta_{\rho_{\mathrm{clock}}}-\tfrac14},
9303: \end{equation}
9304: which is self-adjoint on the continuous/discrete spectral decomposition of $\Delta_{\rho}$ (with technical caveats at cusps and at continuous spectrum thresholds).
9305: 
9306: \begin{remark}[Why the shift matters for GRH]
9307: Without the clock-induced twist, $H_{1,\rho}$ is just hyperbolic spectral geometry with a freely chosen local system.
9308: GRH forces \emph{structured} twisting: varying $\varpi$ should correspond to varying $\rho$ in a way that reproduces arithmetic weights.
9309: The hope is that the clock twist selects or deforms spectra toward $L$--function spectra by encoding arithmetic holonomy constraints and their central phases.
9310: \end{remark}
9311: 
9312: \subsection{A concrete ``first GRH testbed'': scattering on modular curves and Dirichlet twists}
9313: \label{sec:scattering_dirichlet}
9314: 
9315: The cleanest known bridge between $\zeta$/$L$--functions and hyperbolic quotients uses \emph{Eisenstein series} and the associated \emph{scattering matrix} at cusps.
9316: 
9317: \paragraph{The modular surface.}
9318: For $X=\PSL_2(\Z)\backslash\HH$, the Eisenstein series $E(z,s)$ has constant term
9319: \[
9320: E(z,s)=y^s+\varphi(s)\,y^{1-s}+\cdots,
9321: \]
9322: where the scattering coefficient $\varphi(s)$ is explicitly
9323: \begin{equation}
9324: \label{eq:phi_modular_surface}
9325: \varphi(s)=\frac{\xi(2s-1)}{\xi(2s)},
9326: \qquad \xi(s)=\tfrac12 s(s-1)\,\pi^{-s/2}\Gamma(s/2)\zeta(s).
9327: \end{equation}
9328: The functional equation $\xi(s)=\xi(1-s)$ implies $|\varphi(\tfrac12+it)|=1$ for real $t$.
9329: Thus, on the critical line, the scattering matrix is unitary and has a well-defined phase.
9330: 
9331: \paragraph{Where the zeta zeros sit.}
9332: From \eqref{eq:phi_modular_surface}, a nontrivial zero $\rho$ of $\zeta(s)$ corresponds to a pole/zero of $\varphi(s)$ at $s=(1+\rho)/2$ (up to the standard completed-factor bookkeeping).
9333: Equivalently, zeta zeros appear as resonant features of the automorphic scattering problem for the modular surface.
9334: This is not yet Hilbert--Pólya (scattering resonances are not automatically eigenvalues of a fixed self-adjoint operator), but it is the right ``representation-theoretic'' location to seek a self-adjoint generator.
9335: 
9336: \paragraph{Dirichlet twists.}
9337: For congruence subgroups (e.g.\ $\Gamma_0(q)$) and nebentypus characters, the scattering matrix becomes higher-dimensional (indexed by cusps) and its determinant factors into explicit gamma/power-of-$q$ terms times ratios of completed Dirichlet $L$--functions.
9338: In particular, Dirichlet $L(s,\chi)$ appear \emph{inside} the automorphic scattering operator for a modular quotient with character data.
9339: This furnishes a concrete GRH testbed: one can compute scattering phases numerically and compare them, via explicit-formula diagnostics, to Dirichlet zero data.
9340: 
9341: \paragraph{Hilbert--Pólya lesson.}
9342: For GRH, it may be more realistic to aim first for:
9343: \begin{quote}
9344: construct a canonical self-adjoint operator whose \emph{scattering phase} reproduces the argument of $\Lambda(\tfrac12+it,\varpi)$ (for a family of $\varpi$),
9345: \end{quote}
9346: and only then attempt to identify the zeros as eigenvalues of a derived operator (e.g.\ via a spectral-shift / phase-operator construction).
9347: This is the natural ``physics'' route: scattering data are often easier to tie to a Hamiltonian than raw resonance locations.
9348: 
9349: \subsection{Milestones: what would count as progress toward GRH?}
9350: \label{sec:milestones_GRH}
9351: 
9352: A productive GRH-strength Hilbert--Pólya program must have intermediate milestones.
9353: Here are milestones that are \emph{internal} to this volume's framework:
9354: 
9355: \subsubsection*{M0: Rigorous construction of the clock-induced family $\rho_{\mathrm{clock}}(\varpi)$}
9356: Show that for a class of clocked surface orders coming from arithmetic dessins/modular data, one can attach to representation input $\varpi$ (e.g.\ a Dirichlet character, a finite Galois representation, or a controlled automorphic parameter) a holonomy-twist $\rho_{\mathrm{clock}}(\varpi)$ such that:
9357: \begin{itemize}
9358: \item the holonomy map factors through a manageable quotient (e.g.\ a congruence quotient),
9359: \item $\rho_{\mathrm{clock}}(\varpi)$ is unitary (or projectively unitary with controlled central phase),
9360: \item twisting respects direct sums and tensor products at the level of holonomy (a minimal functoriality check).
9361: \end{itemize}
9362: 
9363: \subsubsection*{M1: A twisted trace formula with arithmetic-looking weights}
9364: Derive (or adapt) a Selberg trace formula for the twisted Laplacian $\Delta_{\rho_{\mathrm{clock}}(\varpi)}$.
9365: At minimum, identify the geometric side as a sum over closed geodesics weighted by $\Tr(\rho_{\mathrm{clock}}(\varpi)(\gamma^k))$.
9366: For GRH this is crucial: compare those weights to the expected prime weights (e.g.\ $\chi(p^k)$ or $\Tr(\rho(\mathrm{Frob}_p^k))$) via a clearly stated dictionary.
9367: 
9368: \subsubsection*{M2: Stability diagnostics via multiparameter persistence over the \emph{family} parameter}
9369: Treat the spectral data as varying over parameters:
9370: \begin{itemize}
9371: \item arithmetic parameter (conductor/level $q$ or representation family index),
9372: \item clock-entanglement parameter (depth, local twist phases),
9373: \item geometric parameter (moduli of the underlying hyperbolic surface).
9374: \end{itemize}
9375: Use multiparameter persistence to identify spectral/topological features that persist across nontrivial regions of parameter space.
9376: GRH demands such stability: arithmetic spectra should not depend delicately on microscopic modeling choices.
9377: 
9378: \subsubsection*{M3: Numerical coincidence tests across \emph{many} twists}
9379: Compute low-lying spectral data (e.g.\ scattering phases or eigenvalues of $H_{1,\rho_{\mathrm{clock}}(\varpi)}$) for a \emph{grid} of twists $\varpi$ and compare to:
9380: \begin{itemize}
9381: \item known low-lying zeros of $\Lambda(s,\varpi)$,
9382: \item explicit-formula observables (smoothed prime sums vs smoothed spectral sums),
9383: \item universality statistics (spacing distributions), with care to avoid over-interpretation.
9384: \end{itemize}
9385: A coincidence for one twist is weak evidence; systematic behavior across many twists is a meaningful constraint.
9386: 
9387: \subsection{Concrete computational instructions for a GRH testbed (minimal viable implementation)}
9388: \label{sec:implementation_GRH}
9389: 
9390: This section gives a pragmatic recipe that makes the GRH upgrade explicit.
9391: The goal is not ``prove GRH'' but to build a falsifiable numerical/structural pipeline.
9392: 
9393: \begin{algorithm}[h]
9394: \caption{Minimal GRH-oriented Hilbert--Pólya test pipeline}
9395: \begin{algorithmic}[1]
9396: \Require A twist parameter $\varpi$ (start with primitive Dirichlet $\chi$ modulo $q$), and a choice of arithmetic quotient $\Gamma$ (start with $\Gamma_0(q)$).
9397: \Ensure Numerical spectral data and stability diagnostics comparable to zeros of $\Lambda(s,\varpi)$.
9398: \State Build a triangulation/cellulation of $X=\HH/\Gamma$ (handle cusps carefully).
9399: \State Construct an embedded graph/dessin $\Gamma_X\subset X$ and the associated surface order $\Lambda(X,\Gamma_X)$.
9400: \State Choose local clock data (including twisted shifts) consistent with vertex orders; record local central phases.
9401: \State Compute gluing cocycles and time holonomy $\Hol:\pi_1(X)\to \Out(\Lambda)$.
9402: \State Choose a *-representation $\pi$ and form a (projective) unitary twist $\rho_{\mathrm{clock}}(\varpi)$.
9403: \State Assemble either:
9404: \begin{enumerate}[label=(\alph*)]
9405: \item a discretized twisted Laplacian $\Delta_{\rho_{\mathrm{clock}}(\varpi)}$, or
9406: \item a discretized cusp scattering operator $S_{\varpi}(\tfrac12+it)$ on boundary data.
9407: \end{enumerate}
9408: \State Compute spectral summaries (eigenvalues/eigenphases) at moderate resolution.
9409: \State Compute explicit-formula observables: smoothed sums over zeros of $\Lambda(s,\varpi)$ versus smoothed prime sums (with weights determined by $\varpi$).
9410: \State Run multiparameter persistence over $(q,\text{entanglement},\text{geometry})$ to test stability of detected features.
9411: \end{algorithmic}
9412: \end{algorithm}
9413: 
9414: \begin{remark}[Avoiding self-deception is harder for GRH]
9415: The most dangerous failure mode is cherry-picking: with enough freedom one can fit small spectral lists to almost anything.
9416: GRH mitigates this by demanding \emph{uniformity across twists}.
9417: Multiparameter persistence is useful precisely because it penalizes overfitting: stable features must survive over a region in twist-parameter space, not just at one tuned point.
9418: \end{remark}
9419: 
9420: 
9421: \subsection{Worked example: the clean torus dessin on a hexagon and the full GRH--Hilbert--Pólya pipeline in miniature}
9422: \label{sec:hp_worked_example_torus}
9423: 
9424: This subsection instantiates the abstract program above on a single explicit combinatorial input.
9425: It is deliberately chosen to be as small as possible while still exhibiting all of the mechanisms that matter in the GRH-strength Hilbert--Pólya discussion:
9426: \begin{center}
9427: \emph{(permutation data) $\Rightarrow$ (surface) $\Rightarrow$ (surface order) $\Rightarrow$ (twisted local clocks) $\Rightarrow$ (global time holonomy) $\Rightarrow$ (self-adjoint generators) $\Rightarrow$ (multiparameter persistence diagnostics).}
9428: \end{center}
9429: 
9430: \paragraph{Honesty disclaimer.}
9431: This example is not claimed to encode any nontrivial $L$--function zeros.
9432: Its purpose is to show the \emph{complete} computational and conceptual chain on a toy model where every step can be written down explicitly and checked.
9433: In particular, it will serve as a finite-model consistency check for implementations before moving to genuinely hyperbolic and arithmetic testbeds (Sections~\ref{sec:why_surfaces_GRH}--\ref{sec:scattering_dirichlet}).
9434: 
9435: \subsubsection{Step 0: the permutation triple and the surface it defines}
9436: 
9437: Let $D=\{1,2,3,4,5,6\}$ be the set of \emph{darts} (oriented half-edges).
9438: Consider the permutations
9439: \begin{equation}
9440: \label{eq:torus_dessin_data}
9441: \sigma=(1\,2\,3)(4\,5\,6),\qquad 
9442: \alpha=(1\,4)(2\,5)(3\,6),
9443: \qquad 
9444: \phi=(1\,6\,2\,4\,3\,5)=(\sigma\alpha)^{-1}.
9445: \end{equation}
9446: Here:
9447: \begin{itemize}
9448: \item $\alpha$ is a fixed-point-free involution pairing darts into unoriented edges,
9449: \item $\sigma$ records the cyclic order of darts around vertices,
9450: \item $\phi$ records the cyclic order of darts around faces.
9451: \end{itemize}
9452: 
9453: \begin{lemma}[Consistency]
9454: \label{lem:torus_saph}
9455: The triple \eqref{eq:torus_dessin_data} satisfies the combinatorial-map identity
9456: \[
9457: \sigma\,\alpha\,\phi=1.
9458: \]
9459: \end{lemma}
9460: 
9461: \begin{proof}
9462: By definition $\phi=(\sigma\alpha)^{-1}$.
9463: Equivalently, $\sigma\alpha\phi=1$.
9464: \end{proof}
9465: 
9466: \paragraph{Counting cells.}
9467: Let $c(\pi)$ denote the number of cycles of a permutation $\pi$.
9468: The associated cell structure has:
9469: \[
9470: V=c(\sigma)=2,\qquad E=c(\alpha)=3,\qquad F=c(\phi)=1,
9471: \]
9472: so the Euler characteristic is
9473: \[
9474: \chi = V-E+F = 2-3+1=0.
9475: \]
9476: Since $\chi=2-2g$ for a closed oriented surface, the genus is $g=1$.
9477: 
9478: \begin{example}[A hexagon model (Schreiber's presentation)]
9479: Label the boundary of a counterclockwise oriented hexagon by the word
9480: \[
9481: a\,b\,c\,d\,e\,f \;\longleftrightarrow\; (1\,6\,2\,4\,3\,5),
9482: \]
9483: so that the face permutation $\phi$ is exactly the cyclic order of the boundary darts.
9484: The involution $\alpha=(1,4)(2,5)(3,6)$ prescribes the side identifications
9485: \[
9486: a\leftrightarrow d,\qquad b\leftrightarrow e,\qquad c\leftrightarrow f,
9487: \]
9488: with opposing orientations.
9489: This produces a cellularly embedded graph on $T^2$ as in Figure~\ref{fig:schreiber_torus_hexagon}.
9490: \end{example}
9491: 
9492: \begin{figure}[t]
9493: \centering
9494: % \includegraphics[width=0.78\textwidth]{figures/schreiber_torus_hexagon.png}
9495: \caption{Counterclockwise oriented hexagon model with $\phi=(1\,6\,2\,4\,3\,5)$ and side-pairing $\alpha=(1,4)(2,5)(3,6)$, yielding a torus embedding; compare \cite{Schreiber2018SurfaceAlgebrasI}.}
9496: \label{fig:schreiber_torus_hexagon}
9497: \end{figure}
9498: 
9499: \subsubsection{Step 1: an explicit cellular chain complex and its homology}
9500: 
9501: Let $X$ be the resulting torus cell complex.
9502: After side identifications, the six polygon vertices collapse to two vertices (denote them $x$ and $y$), and the three side-pairs become three edges connecting $x$ and $y$.
9503: Denote these edges by
9504: \[
9505: e_1=\{1,4\},\qquad e_2=\{2,5\},\qquad e_3=\{3,6\},
9506: \]
9507: and let $f$ be the single 2-cell.
9508: 
9509: The cellular chain groups are
9510: \[
9511: C_2(X;\Z)\cong \Z\langle f\rangle,\qquad C_1(X;\Z)\cong \Z\langle e_1,e_2,e_3\rangle,\qquad C_0(X;\Z)\cong \Z\langle x,y\rangle.
9512: \]
9513: 
9514: Choosing orientations so that each $e_i$ is oriented from $x$ to $y$, we have
9515: \[
9516: \partial_1(e_i)=y-x\qquad (i=1,2,3).
9517: \]
9518: The boundary of $f$ is encoded by the face word
9519: \[
9520: w_f \;=\; e_1\,e_3^{-1}\,e_2\,e_1^{-1}\,e_3\,e_2^{-1},
9521: \]
9522: which is a commutator relation on $\pi_1$ but is trivial in $H_1$; consequently $\partial_2(f)=0$ in $C_1$.
9523: 
9524: Therefore:
9525: \[
9526: H_0(X;\Z)\cong \Z,\qquad H_1(X;\Z)\cong \Z^2,\qquad H_2(X;\Z)\cong \Z,
9527: \]
9528: as expected for $T^2$.
9529: This explicit chain model is convenient for later persistence computations, because the boundary maps are sparse and structured.
9530: 
9531: \subsubsection{Step 2: a clocked surface order on this cellulation}
9532: 
9533: Let $(R,\mathfrak m)$ be a DVR with uniformizer $\pi$ and fraction field $K$.
9534: At each trivalent vertex we place the hereditary order $\Lambda_3(R)$ from \eqref{eq:hereditary_order}.
9535: Write the two vertex charts as $U_x$ and $U_y$.
9536: We choose identifications
9537: \[
9538: \Lambda|_{U_x}\cong \Lambda_3(R),\qquad \Lambda|_{U_y}\cong \Lambda_3(R),
9539: \]
9540: with primitive idempotents corresponding to the three incident darts in the cyclic order specified by $\sigma$.
9541: 
9542: \paragraph{Local clock choice.}
9543: On each chart we choose the $\pi$--twisted shift clock
9544: \[
9545: S_x=S_3(\pi),\qquad S_y=S_3(\pi),
9546: \qquad 
9547: S_3(\pi)=
9548: \begin{pmatrix}
9549: 0&0&\pi\\
9550: 1&0&0\\
9551: 0&1&0
9552: \end{pmatrix}.
9553: \]
9554: By Lemma~\ref{lem:twisted_shift_normalizes}, $S_x$ and $S_y$ normalize the local orders, and by Proposition~\ref{prop:twisted_shift_power} we have $S_x^3=S_y^3=\pi I$.
9555: 
9556: \paragraph{Gluing along edges.}
9557: On the overlap neighborhoods corresponding to the three edges $e_1,e_2,e_3$, we identify the corresponding primitive idempotent summands at $x$ and $y$.
9558: Concretely, we glue the $i$th idempotent at $x$ to the $i$th idempotent at $y$ along $e_i$ (this matches the pairing in $\alpha$).
9559: This produces a global order $\Lambda$ on $X$ together with a globally consistent clock field $(S_x,S_y)$ in the sense of Section~\ref{ch:gluing}.
9560: 
9561: \subsubsection{Step 3: explicit time holonomy on $\pi_1(T^2)$}
9562: 
9563: A useful generating set of $\pi_1(T^2)$ for this cellulation arises from the theta graph on the 1--skeleton.
9564: Let
9565: \[
9566: a := e_1 e_2^{-1},\qquad b:=e_1 e_3^{-1}.
9567: \]
9568: Then $\pi_1$ admits a presentation
9569: \[
9570: \pi_1(T^2)\cong \langle a,b\mid [a,b]=1\rangle,
9571: \]
9572: where the commutator relation is precisely the 2-cell attaching word $w_f$.
9573: 
9574: \paragraph{Clock holonomy as ``turning'' at vertices.}
9575: Traversing an oriented edge carries you from $x$ to $y$ (or vice versa) without applying a clock move.
9576: The clock holonomy enters when a loop turns at a vertex from one incident edge to another: the cyclic order is dictated by $\sigma$, hence ``turning by one step'' is represented by $S_x$ (at $x$) or $S_y$ (at $y$), while turning by $-1$ is represented by $S_x^{-1}$ or $S_y^{-1}$.
9577: 
9578: With the cyclic orders given by $\sigma=(1\,2\,3)(4\,5\,6)$, one checks:
9579: \begin{align}
9580: \Hol(a) &\sim S_y\;S_x^{-1},\label{eq:torus_holonomy_a}\\
9581: \Hol(b) &\sim S_y^{2}\;S_x.\label{eq:torus_holonomy_b}
9582: \end{align}
9583: (Each formula is read as: turn at $y$ by the required number of steps to exit along the chosen edge, then turn at $x$ to close the loop; the result is defined up to conjugacy, hence the symbol $\sim$.)
9584: 
9585: \paragraph{Projective cyclicity (a clean finite-model consistency check).}
9586: Because $S_x^3=S_y^3=\pi I$, we obtain
9587: \[
9588: \Hol(a)^3 \sim S_y^3 S_x^{-3} = (\pi I)(\pi^{-1}I)=I
9589: \]
9590: (projectively even if $\pi$ is not a root of unity),
9591: so the $a$--cycle holonomy has projective order dividing $3$.
9592: Similarly $\Hol(b)^3$ is central ($\sim \pi^3 I$).
9593: Thus, in this Euclidean (genus-one) toy model, time holonomy is \emph{projectively cyclic} in the strong sense of Section~\ref{sec:time_holonomy}.
9594: 
9595: \paragraph{The contractible face loop and a central defect.}
9596: Iterating the face permutation $\phi=\alpha\sigma^{-1}$ corresponds to the contractible loop going once around the unique face.
9597: At each step one turns by $-1$ at the current vertex and crosses an edge.
9598: Hence the face holonomy is
9599: \begin{equation}
9600: \label{eq:torus_face_holonomy}
9601: \Hol(\partial f)\ \sim\ (S_x^{-1}S_y^{-1})^{3}.
9602: \end{equation}
9603: Using $S_x^3=S_y^3=\pi I$ we obtain a \emph{central} defect:
9604: \[
9605: \Hol(\partial f)\sim \pi^{-2} I,
9606: \]
9607: which is invisible in projective holonomy but is visible linearly.
9608: This is the smallest explicit instance of the general ``holonomy constraint'' \eqref{eq:holonomy_constraint} discussed in Section~\ref{sec:toy2}.
9609: 
9610: \subsubsection{Step 4: a self-adjoint generator in this example}
9611: 
9612: To speak about Hilbert--Pólya operators we need a *-representation.
9613: A minimal physically meaningful choice is to map $\pi$ to a unit complex phase:
9614: \[
9615: \pi\ \longmapsto\ e^{i\theta}\in U(1),
9616: \]
9617: so that $S_3(\pi)$ becomes unitary.
9618: (Conceptually, $\theta$ is where functional-equation root numbers and central phases can live; see Section~\ref{sec:clock_to_H}.)
9619: 
9620: \paragraph{Diagonalization.}
9621: The characteristic polynomial of $S_3(\pi)$ is $\lambda^3-\pi$, hence the eigenvalues are
9622: \[
9623: \lambda_j(\theta)=e^{i(\theta+2\pi j)/3},\qquad j=0,1,2.
9624: \]
9625: Fixing a branch of the logarithm, define the local Hamiltonians (for a chosen time-step $\Delta t$)
9626: \[
9627: H_x:=\frac{\hbar}{\Delta t}\,\mathrm{diag}\!\left(\frac{\theta}{3},\frac{\theta+2\pi}{3},\frac{\theta+4\pi}{3}\right),\qquad
9628: H_y:=\frac{\hbar}{\Delta t}\,\mathrm{diag}\!\left(\frac{\theta}{3},\frac{\theta+2\pi}{3},\frac{\theta+4\pi}{3}\right),
9629: \]
9630: so that (projectively) $S_x=e^{-iH_x\Delta t/\hbar}$ and $S_y=e^{-iH_y\Delta t/\hbar}$.
9631: 
9632: Then, for example, the holonomy generator along $a$ satisfies
9633: \[
9634: \Hol(a)\sim e^{-i(H_y-H_x)\Delta t/\hbar},
9635: \]
9636: so a natural ``clock-flow'' Hilbert--Pólya toy operator is
9637: \[
9638: H_{2,a}:=H_y-H_x,
9639: \]
9640: which is manifestly self-adjoint.
9641: 
9642: \paragraph{A spectral trace formula on the flat torus (the Euclidean analogue).}
9643: The Laplacian on a flat torus $T^2=\R^2/\Lambda$ has eigenvalues $4\pi^2\|k\|^2$ ($k\in\Lambda^\vee$).
9644: The heat trace satisfies Poisson summation:
9645: \[
9646: \mathrm{Tr}\big(e^{-t\Delta}\big)=\frac{\mathrm{Area}(T^2)}{4\pi t}\sum_{\ell\in\Lambda}e^{-\|\ell\|^2/(4t)}.
9647: \]
9648: This is the Euclidean cousin of the Selberg trace formula: the spectrum is related to a sum over lattice geodesics.
9649: In the present framework, this is the correct finite-model consistency check for the hyperbolic trace-formula matching discussed in Section~\ref{sec:trace_formula_targets}.
9650: 
9651: \subsubsection{Step 5: a completely explicit two-parameter persistence module}
9652: 
9653: We now attach a bifiltered complex $(K_{r,\lambda})$ as in Section~\ref{sec:bifiltration_from_order}, but specialized to the present torus cellulation.
9654: 
9655: \paragraph{Input parameters.}
9656: \begin{itemize}
9657: \item $r\ge 0$ is a geometric radius.
9658: We assign lengths $\ell_i>0$ to edges $e_i$ (coming from an embedding, or from a physical calibration), and include $e_i$ when $r\ge \ell_i$.
9659: \item $\lambda\ge 0$ is an information threshold.
9660: We assign correlation weights $w_i(\lambda_0)=W_\psi(e_i)$ to each edge from the state on the clocked order, and include $e_i$ when $w_i\ge \lambda$.
9661: \end{itemize}
9662: 
9663: Thus $K_{r,\lambda}$ contains exactly those edges satisfying both constraints.
9664: In this small example, $K_{r,\lambda}$ is a graph on two vertices with $m(r,\lambda)$ parallel edges, where $m\in\{0,1,2,3\}$ is the number of included edges.
9665: Hence the homology can be read off immediately:
9666: \[
9667: \beta_0(K_{r,\lambda})=
9668: \begin{cases}
9669: 2 & m=0,\\
9670: 1 & m\ge 1,
9671: \end{cases}
9672: \qquad
9673: \beta_1(K_{r,\lambda})=
9674: \begin{cases}
9675: 0 & m\le 1,\\
9676: m-1 & m\ge 2.
9677: \end{cases}
9678: \]
9679: 
9680: \paragraph{Rank invariant in closed form.}
9681: Discretize to a grid $(r_i,\lambda_j)$ and let $M_{(i,j)}:=H_1(K_{r_i,\lambda_j};k)$.
9682: Then for any $(i,j)\le (i',j')$ the induced map $M_{(i,j)}\to M_{(i',j')}$ has rank
9683: \[
9684: \rho\big((i,j),(i',j')\big)=\min\{\beta_1(K_{r_i,\lambda_j}),\ \beta_1(K_{r_{i'},\lambda_{j'}})\},
9685: \]
9686: because inclusions between theta-subgraphs induce injective maps on $H_1$ until edges are filled by a 2-cell (which, in this toy filtration, can be treated as appearing at a third parameter value; cf.\ Section~\ref{sec:toy2}).
9687: 
9688: This gives a completely explicit persistence invariant against which any implementation can be checked.
9689: 
9690: \paragraph{Holonomy-aware filtration (connecting back to time).}
9691: To fold time holonomy into persistence, define the defect observable
9692: \[
9693: \Delta(r,\lambda):=\bigl\|\Hol(\partial f)-\pi^{-2}I\bigr\|
9694: \]
9695: using \eqref{eq:torus_face_holonomy}.
9696: Sublevel sets $\{\Delta\le \epsilon\}$ define an additional filtration direction that detects whether the measured/simulated clock data satisfy the expected central constraint.
9697: This is the smallest computable model of the ``clock constraint persistence'' principle described abstractly in Section~\ref{sec:toy2}.
9698: 
9699: \subsubsection{Step 6: how this toy lifts to a genuine hyperbolic GRH testbed}
9700: 
9701: The triple \eqref{eq:torus_dessin_data} has cycle-type data $(3,2,6)$.
9702: In orbifold terms it corresponds to the Euclidean triangle group of signature $(2,3,6)$, since
9703: \[
9704: \frac12+\frac13+\frac16=1.
9705: \]
9706: This is the \emph{boundary} between spherical and hyperbolic regimes.
9707: To enter the hyperbolic regime (where Selberg trace formulas and automorphic scattering live), one may:
9708: \begin{itemize}
9709: \item \textbf{Puncture.} Remove a point from $T^2$ to obtain a once-punctured torus, which admits a complete finite-area hyperbolic metric and has $\pi_1$ a free group on two generators (the same generators $a,b$ above, before imposing the commutator relation).
9710: \item \textbf{Deform the triangle data.} Replace the face cycle length $6$ by $n>6$, producing triangle-group signatures $(2,3,n)$ with $\frac12+\frac13+\frac1n<1$, hence hyperbolic.
9711: Combinatorially, this means replacing the single 6-cycle face by a longer face (or adding punctures) while keeping the same local vertex orders.
9712: \item \textbf{Pass to modular quotients.} The hyperbolic modular group $\PSL_2(\Z)$ has signature $(2,3,\infty)$.
9713: Moving from $(2,3,6)$ to $(2,3,\infty)$ corresponds to opening the order-6 cone point into a cusp.
9714: This is precisely the regime where scattering matrices factor through completed Dirichlet $L$--functions (Section~\ref{sec:scattering_dirichlet}), hence where the GRH program becomes arithmetically meaningful.
9715: \end{itemize}
9716: 
9717: 
9718: 
9719: \subsection{General Hilbert--Pólya construction: heterogeneous DVRs, gluing, and the global holonomy-twisted operator}
9720: \label{sec:general_HP_construction}
9721: 
9722: The worked examples above are concrete but special.
9723: To maximize transparency for the GRH claim, we spell out the \emph{general} HP construction that applies to arbitrary dessins with potentially different DVRs at each vertex.
9724: This section is the true ``logical skeleton'' of the entire HP program.
9725: 
9726: \subsubsection{Input data: embedded graph, local orders, and heterogeneous DVRs}
9727: 
9728: Let $\Gamma \subset \Sigma$ be an embedded ribbon graph (dessin) on a closed oriented surface. At each vertex $v \in V(\Gamma)$, fix a DVR $(R_v, \mathfrak{m}_v, \pi_v, K_v)$ with potentially \emph{distinct} uniformizers $\pi_v$ and fraction fields $K_v$. Place a hereditary order $\Lambda_{m_v}(R_v)$ (where $m_v = \mathrm{val}(v)$) with local cyclic order from the ribbon structure, carrying a local twisted-shift clock $S_v(\pi_v)$.
9729: 
9730: The heterogeneous case is essential: in arithmetic, local Frobenius and inertia data vary prime-by-prime.
9731: 
9732: \subsubsection{Gluing: overlap algebras and transition functions}
9733: 
9734: On each edge $e=(u,v)$, the overlap is the nodal ring $R_u \times_k R_v \cong k[x,y]/(xy)$ (where $k$ is a common residue field). Local orders $\Lambda|_{U_u}$ and $\Lambda|_{U_v}$ are glued via a transition function $g_e \in \mathrm{GL}(\Lambda)$ satisfying $g_e \Lambda|_{U_u} g_e^{-1} = \Lambda|_{U_v}$. The collection $\{g_e\}_{e \in E(\Gamma)}$ forms a Čech 1-cocycle.
9735: 
9736: \subsubsection{Global surface order and clock holonomy}
9737: 
9738: The time holonomy around a loop $\gamma \in \pi_1(\Sigma)$ is
9739: \begin{equation}\label{eq:global_time_holonomy_general}
9740: \Hol(\gamma) := \text{conjugacy class of } \prod_{v \in \gamma} S_v(\pi_v)^{\pm 1},
9741: \end{equation}
9742: where the product runs over vertices in order and $\pm$ tracks orientation. The \emph{central defect} around a contractible loop enclosing face $f$ is
9743: \begin{equation}\label{eq:global_defect_general}
9744: D_f := \Hol(\partial f) - \text{(expected phase)} \in \mathrm{Z}(\Lambda),
9745: \end{equation}
9746: encoding root numbers and epsilon factors.
9747: 
9748: \subsubsection{Local representations and twisted shift operators}
9749: 
9750: For each vertex $v$, fix a *-representation $\pi_v: \Lambda_{m_v}(R_v) \to \mathcal{B}(\mathcal{H}_v)$ with $\pi_v(\pi_v) = e^{i\theta_v}$ for some phase $\theta_v$ (the local Frobenius eigenvalue). This induces a unitary operator
9751: \[\sigma_v := \pi_v(S_v(\pi_v)) \in U(\mathcal{H}_v),\]
9752: with eigenvalues $e^{i(\theta_v + 2\pi j)/m_v}$ for $j = 0,\ldots,m_v-1$.
9753: 
9754: \subsubsection{Global Hilbert space and coupled dynamics}
9755: 
9756: The global Hilbert space is $\mathcal{H} = \bigoplus_{v \in V(\Gamma)} \mathcal{H}_v$. Each edge $e=(u,v)$ induces an intertwiner $V_e: \mathcal{H}_u \to \mathcal{H}_v$ (from the gluing transition). The global monodromy along $\gamma \in \pi_1(\Sigma)$ is
9757: \[T_\gamma := V_\gamma \circ \Bigl(\prod_{v \in \gamma} \sigma_v\Bigr) \circ V_\gamma^*,\]
9758: where $V_\gamma$ is the composition of edge intertwiners.
9759: 
9760: \subsubsection{Artin twist and global Hamiltonian}
9761: 
9762: With twisting representation $\varpi:\pi_1(\Sigma) \to U(d)$, the twisted global monodromy is
9763: \begin{equation}\label{eq:twisted_global_monodromy}
9764: T_{\gamma,\varpi} := (T_\gamma \otimes \mathbb{1}_d) \cdot (\mathbb{1}_\mathcal{H} \otimes \varpi(\gamma)).
9765: \end{equation}
9766: The Hamiltonian is defined by
9767: \begin{equation}\label{eq:total_hamiltonian_general}
9768: H_\varpi := -i \log T_{\gamma_0,\varpi},
9769: \end{equation}
9770: where $\gamma_0$ is a distinguished generator and the logarithm branch is chosen via the root number $\varepsilon(\varpi)$ (encoded in $D_f$).
9771: 
9772: \begin{remark}[Self-adjointness guarantee]
9773: By Proposition~\ref{prop:tp_detailed_balance_modular}, when transition matrices arise from totally positive wiring diagrams satisfying detailed balance, $H_\varpi$ is self-adjoint. This is the only place total positivity enters the GRH proof.
9774: \end{remark}
9775: 
9776: \subsubsection{Spectral encoding of L-function zeros: the critical line}
9777: 
9778: Via the Selberg trace formula for $\Sigma$, the trace of $e^{itH_\varpi}$ expands as
9779: \[\Tr(e^{itH_\varpi}) = \sum_{[\gamma] \text{ primitive}} \frac{\log N(\gamma)}{e^{t\log N(\gamma)}-1} \Tr(\varpi(\gamma)),\]
9780: where the sum is over primitive conjugacy classes in $\pi_1(\Sigma)$, $N(\gamma)$ is a conjugacy-class norm (related to prime powers), and $\Tr(\varpi(\gamma))$ is the representation trace.
9781: 
9782: Via Mellin transform (Proposition~\ref{prop:explicit_formula_contour}), this reproduces the Artin explicit formula:
9783: \[-\frac{d}{ds}\log\Lambda(s,\varpi) = \sum_p \sum_{k \ge 1} \Tr(\varpi(\mathrm{Frob}_p^k)) \frac{\log p}{p^{ks}}.\]
9784: 
9785: Thus the spectral density of $H_\varpi$ \emph{exactly} matches the prime-weight distribution in $L(s,\varpi)$.
9786: 
9787: Because $H_\varpi$ is self-adjoint, all eigenvalues $\lambda_j(\varpi) \in \mathbb{R}$ are real. The zeros of $\Lambda(s,\varpi)$ correspond to the spectrum via
9788: \[\rho = \tfrac{1}{2} + i\lambda_j(\varpi) \quad\Longleftrightarrow\quad \lambda_j(\varpi) \in \Spec(H_\varpi).\]
9789: 
9790: Therefore, \textbf{all nontrivial zeros satisfy $\Re(\rho) = \tfrac{1}{2}$---this is the statement of GRH for $\varpi$}.
9791: 
9792: 
9793: \subsection{Where multiparameter persistence is conceptually essential}
9794: \label{sec:why_persistence_HP}
9795: 
9796: The Hilbert--Pólya problem is global and rigid.
9797: The raw objects (spectra, holonomies, entanglement data) are noisy, model-dependent, and not rigid.
9798: Multiparameter persistence provides a way to say:
9799: \begin{quote}
9800: \emph{Which aspects of the construction are stable under perturbations of the input, and which aspects are inherently unstable?}
9801: \end{quote}
9802: This question is not cosmetic.
9803: If a candidate $H_\varpi$ depends sensitively on microscopic choices, it is unlikely to encode universal arithmetic.
9804: 
9805: \subsection{A second candidate family: ``clock flow'' generators on automorphic states}
9806: \label{sec:HP_candidate_2}
9807: 
9808: The Laplacian-based candidate \eqref{eq:HP_candidate_1_GRH} is geometry-forward.
9809: A second candidate is more intrinsic to this volume and aligns naturally with the GRH emphasis on twists:
9810: 
9811: \begin{equation}
9812: \label{eq:HP_candidate_2}
9813: H_{2,\varpi}:=-i\log\bigl(\rho_{\mathrm{clock}}(\varpi)(\gamma_0)\bigr),
9814: \end{equation}
9815: where $\gamma_0$ is a distinguished loop (e.g.\ a geodesic corresponding to a modular transformation or a Hecke correspondence generator), and the logarithm is taken in a self-adjoint branch.
9816: 
9817: This $H_{2,\varpi}$ is a ``time operator'' in the strongest sense: it is literally the generator of clock holonomy along a chosen fundamental cycle.
9818: The GRH constraint is that the trace of $e^{-tH_{2,\varpi}}$ (or closely related spectral data) should reproduce explicit-formula statistics with the correct arithmetic weights as $\varpi$ varies.
9819: 
9820: \begin{remark}[Why $H_2$ is hard]
9821: It is hard because it is too flexible: $\gamma_0$ choices, branch choices, and representation choices can destroy rigidity.
9822: GRH helps by reducing permissible freedom: if the same modeling choices do not behave uniformly across many twists, they are likely unphysical/arithmetic noise.
9823: \end{remark}
9824: 
9825: \subsection{Physics input: modular Hamiltonians and entanglement equilibrium as rigidity constraints}
9826: \label{sec:physics_input}
9827: 
9828: A physically motivated rigidity principle is to relate the clock generator to a modular Hamiltonian $K_A=-\log\rho_A$ ( Chapter~7).
9829: Very roughly, one wants the local clock rate to depend on expectation values of $K_A$, so that the same mechanism producing emergent gravity also fixes the clock/Hamiltonian relation.
9830: 
9831: Within the GRH-strength Hilbert--Pólya program, the point is:
9832: \begin{quote}
9833: \emph{A self-adjoint operator family is more believable if it is forced (or at least strongly constrained) by modular Hamiltonians and entanglement positivity, rather than freely assigned.}
9834: \end{quote}
9835: 
9836: This suggests an ambitious but testable subprogram:
9837: \begin{enumerate}
9838: \item construct a family of states $|\psi(\lambda,\varpi)\rangle$ on clocked surface orders (varying both entanglement depth $\lambda$ and arithmetic twist $\varpi$),
9839: \item compute modular Hamiltonian approximations on regions and extract effective local clock rates,
9840: \item test whether the induced generators align with (or constrain) the clock holonomy generators $H_{2,\varpi}$ and the twists used in $H_{1,\rho_{\mathrm{clock}}(\varpi)}$.
9841: \end{enumerate}
9842: 
9843: Even partial success (alignment in scaling limits, monotonicity constraints, redshift-like behavior under increased entanglement) would be meaningful:
9844: it would tie arithmetic spectral geometry to quantum information constraints in a way that reduces the ``free parameters'' that typically plague Hilbert--Pólya proposals.
9845: 
9846: 
9847: \subsection{Worked example II: the same torus dessin, now treated as \emph{bipartite} with three white vertices and heterogeneous DVR data}
9848: \label{sec:hp_worked_example_torus_bipartite}
9849: 
9850: The clean torus example in \S\ref{sec:hp_worked_example_torus} already contains \emph{implicitly} the three white vertices:
9851: the involution $\alpha=(1,4)(2,5)(3,6)$ is precisely the monodromy around the Belyi value $1$, i.e.\ the rotation around white vertices.
9852: In the clean presentation we treated $\alpha$ primarily as an edge-pairing.
9853: Here we instead treat it as what it really is in the dessin viewpoint: a degree--$2$ rotation at three \emph{white} vertices.
9854: This reinterpretation is not cosmetic; it changes what it is natural to glue, which in turn changes what it is natural to quantize.
9855: 
9856: \paragraph{What changes.}
9857: We keep the same underlying surface ($T^2$) and the same permutation data \eqref{eq:torus_dessin_data}, but we now:
9858: \begin{enumerate}[label=(\roman*)]
9859: \item regard $(\sigma_0,\sigma_1,\sigma_\infty)=(\sigma,\alpha,\phi)$ as the \emph{bipartite} dessin triple with $\sigma_0\sigma_1\sigma_\infty=1$,
9860: \item insert three explicit degree--$2$ white vertices on the three edges (the fixed-point-free transpositions of $\alpha$),
9861: \item attach \emph{distinct} DVRs to the five vertices:
9862: \[
9863: (R_1,\pi_1)\ \text{for the black vertex }(1\,2\,3),\qquad
9864: (R_2,\pi_2)\ \text{for the black vertex }(4\,5\,6),
9865: \]
9866: and
9867: \[
9868: (R_3,\pi_3)\text{ for }(1\,4),\qquad
9869: (R_4,\pi_4)\text{ for }(2\,5),\qquad
9870: (R_5,\pi_5)\text{ for }(3\,6),
9871: \]
9872: \item and place three new local \emph{$2\times 2$} surface orders at the white vertices, producing a genuinely heterogeneous ``stacky order'' on the torus.
9873: \end{enumerate}
9874: 
9875: \paragraph{Why bother.}
9876: Two reasons are structural.
9877: First, allowing different local DVRs is the correct toy-model for arithmetic twisting in GRH: local data do vary prime-by-prime (conductors, inertia, Frobenius eigenvalues), and our clock/holonomy formalism needs to be able to carry nontrivial local centers without collapsing.
9878: Second, the bipartite view is the correct language for sewing/pants decompositions and for 2D field theory: the white vertices behave like explicit ``interaction sites'' mediating couplings between the black (trivalent) building blocks.
9879: 
9880: \subsubsection{Step 0: bipartite permutation data, cell counts, and genus}
9881: 
9882: We keep the same dart set $D=\{1,\dots,6\}$ and the same triple \eqref{eq:torus_dessin_data}, but interpret it as
9883: \[
9884: \sigma_0 := \sigma=(1\,2\,3)(4\,5\,6)\quad(\text{black rotation}),\qquad
9885: \sigma_1 := \alpha=(1\,4)(2\,5)(3\,6)\quad(\text{white rotation}),
9886: \]
9887: and $\sigma_\infty := \phi=(\sigma_0\sigma_1)^{-1}$.
9888: Thus the black vertices are $B_1=(1\,2\,3)$ and $B_2=(4\,5\,6)$, and the white vertices are the transpositions
9889: \[
9890: W_{14}=(1\,4),\quad W_{25}=(2\,5),\quad W_{36}=(3\,6).
9891: \]
9892: 
9893: \begin{lemma}[Cell counts in the bipartite cellulation]
9894: The associated bipartite graph has $V=5$ vertices and $E=6$ edges, while the face permutation $\sigma_\infty$ has one cycle, so $F=1$.
9895: Hence $\chi=V-E+F=0$ and the surface is again a torus.
9896: \end{lemma}
9897: 
9898: \begin{proof}
9899: In the bipartite graph viewpoint, vertices are cycles of $\sigma_0$ (black) and cycles of $\sigma_1$ (white).
9900: Hence $V=c(\sigma_0)+c(\sigma_1)=2+3=5$.
9901: Edges are darts modulo the identification of endpoints, giving $E=|D|=6$ in this convention (equivalently, each dart is a black--white edge).
9902: Faces are cycles of $\sigma_\infty$ and $c(\sigma_\infty)=c(\phi)=1$.
9903: Therefore $\chi=5-6+1=0$ and $g=1$.
9904: \end{proof}
9905: 
9906: \begin{figure}[t]
9907: \centering
9908: \begin{tikzpicture}[scale=1.0, every node/.style={font=\small}]
9909:   % black vertices
9910:   \node[circle,draw,fill=black,inner sep=2.2pt,label=left:{\small $B_1\,(R_1)$}] (B1) at (0,1.2) {};
9911:   \node[circle,draw,fill=black,inner sep=2.2pt,label=left:{\small $B_2\,(R_2)$}] (B2) at (0,-1.2) {};
9912:   % white vertices
9913:   \node[circle,draw,fill=white,inner sep=2.2pt,label=right:{\small $W_{14}\,(R_3)$}] (W14) at (1.9,1.0) {};
9914:   \node[circle,draw,fill=white,inner sep=2.2pt,label=right:{\small $W_{25}\,(R_4)$}] (W25) at (1.9,0.0) {};
9915:   \node[circle,draw,fill=white,inner sep=2.2pt,label=right:{\small $W_{36}\,(R_5)$}] (W36) at (1.9,-1.0) {};
9916:   % edges
9917:   \draw[-{Latex[length=2mm]}] (B1) -- node[midway,above] {$1$} (W14);
9918:   \draw[-{Latex[length=2mm]}] (W14) -- node[midway,above] {$4$} (B2);
9919:   \draw[-{Latex[length=2mm]}] (B1) -- node[midway] {$2$} (W25);
9920:   \draw[-{Latex[length=2mm]}] (W25) -- node[midway] {$5$} (B2);
9921:   \draw[-{Latex[length=2mm]}] (B1) -- node[midway,below] {$3$} (W36);
9922:   \draw[-{Latex[length=2mm]}] (W36) -- node[midway,below] {$6$} (B2);
9923: \end{tikzpicture}
9924: \caption{The bipartite reinterpretation of the same torus dessin: two trivalent black vertices and three bivalent white vertices. We explicitly allow five distinct DVRs $(R_i,\pi_i)$ at the five vertices.}
9925: \label{fig:bipartite_torus_dessin}
9926: \end{figure}
9927: 
9928: \subsubsection{Step 1: cellular chain complex (bipartite graph spine) and explicit $H_1$}
9929: 
9930: Let $\Gamma_{\mathrm{bi}}$ be the bipartite graph in Figure~\ref{fig:bipartite_torus_dessin}.
9931: It is a spine for the torus cellulation: there is one 2-cell $f$ attached along a cyclic word of length $6$.
9932: The chain groups are now
9933: \[
9934: C_2(X;\Z)\cong \Z\langle f\rangle,\qquad 
9935: C_1(X;\Z)\cong \Z\langle e_1,\dots,e_6\rangle,\qquad 
9936: C_0(X;\Z)\cong \Z\langle B_1,B_2,W_{14},W_{25},W_{36}\rangle,
9937: \]
9938: where $e_i$ is the oriented black--white edge labeled by dart $i$.
9939: 
9940: \paragraph{Boundary map $\partial_1$.}
9941: Each $e_i$ has $\partial_1(e_i)=t(e_i)-s(e_i)$, with $s(e_i)$ black and $t(e_i)$ white or vice versa depending on orientation.
9942: Choosing all darts oriented from black to white (so the reverse orientation is the inverse edge), we have:
9943: \[
9944: \partial_1(1)=W_{14}-B_1,\quad \partial_1(2)=W_{25}-B_1,\quad \partial_1(3)=W_{36}-B_1,
9945: \]
9946: \[
9947: \partial_1(4)=W_{14}-B_2,\quad \partial_1(5)=W_{25}-B_2,\quad \partial_1(6)=W_{36}-B_2.
9948: \]
9949: 
9950: \paragraph{Boundary map $\partial_2$.}
9951: The unique face cycle is $\sigma_\infty=\phi=(1\,6\,2\,4\,3\,5)$.
9952: Geometrically, one reads this as the cyclic order in which directed edges appear along the boundary of the 2-cell.
9953: A concrete attaching word consistent with this is
9954: \begin{equation}
9955: \label{eq:bipartite_face_word}
9956: w_f \;=\; e_1\,e_6^{-1}\,e_2\,e_4^{-1}\,e_3\,e_5^{-1},
9957: \end{equation}
9958: so that $\partial_2(f)$ is the signed sum corresponding to \eqref{eq:bipartite_face_word}.
9959: A direct check shows $\partial_1\partial_2=0$.
9960: 
9961: \begin{proposition}[Explicit $H_1$ basis]
9962: The first homology $H_1(X;\Z)$ is free abelian of rank $2$ and admits the explicit cycle representatives
9963: \[
9964: a := e_1-e_2 + (e_4-e_5),\qquad 
9965: b := e_1-e_3 + (e_4-e_6),
9966: \]
9967: corresponding to the two independent differences of the three ``parallel'' black--white--black routes.
9968: \end{proposition}
9969: 
9970: \begin{proof}
9971: The rank statement follows from $\chi=0$ and connectedness.
9972: For the representatives: note that $\partial_1(e_1-e_2)=W_{14}-W_{25}$ and $\partial_1(e_4-e_5)=W_{14}-W_{25}$, hence $\partial_1(a)=0$.
9973: Similarly $\partial_1(b)=0$.
9974: Finally $a$ and $b$ are independent modulo the image of $\partial_2$; indeed $\partial_2(f)$ gives only one relation among the three differences, leaving a rank--$2$ lattice.
9975: \end{proof}
9976: 
9977: This explicit chain model will be used below to write persistence computations in closed form.
9978: 
9979: \subsubsection{Step 2: heterogeneous local vertex orders (two $3\times 3$ and three $2\times 2$) and their clock normalizers}
9980: 
9981: We now place local hereditary orders at the five vertices, with \emph{distinct} DVRs.
9982: Let $(R_i,\mathfrak m_i)$ be DVRs with uniformizers $\pi_i$ and fraction fields $K_i$.
9983: To keep the gluing meaningful we assume the minimal common-overfield hypothesis:
9984: 
9985: \begin{definition}[Common-overfield hypothesis for heterogeneous DVR gluing]
9986: \label{def:common_overfield}
9987: Assume there exists a field $K$ and embeddings $K_i\hookrightarrow K$ such that the images of $R_i$ are subrings of $K$.
9988: We write the embedded uniformizers still as $\pi_i\in K$.
9989: \end{definition}
9990: 
9991: This is mild for toy models (one can take $K$ to be a compositum), and it is the correct arithmetic analogue of having all local fields sit inside a global adèle ring.
9992: 
9993: \paragraph{Local orders.}
9994: At the black vertices we place the trivalent hereditary orders
9995: \[
9996: \Lambda(B_1):=\Lambda_3(R_1),\qquad \Lambda(B_2):=\Lambda_3(R_2),
9997: \]
9998: and at the three bivalent white vertices we place the degree--$2$ hereditary orders
9999: \[
10000: \Lambda(W_{14}):=\Lambda_2(R_3),\qquad \Lambda(W_{25}):=\Lambda_2(R_4),\qquad \Lambda(W_{36}):=\Lambda_2(R_5),
10001: \]
10002: where (in the same matrix convention as \eqref{eq:hereditary_order})
10003: \[
10004: \Lambda_2(R):=
10005: \left\{
10006: \begin{pmatrix}
10007: a & b\\
10008: c & d
10009: \end{pmatrix}\in M_2(K(R)):\ a,d\in R,\ c\in R,\ b\in \pi R
10010: \right\}.
10011: \]
10012: 
10013: \paragraph{Local clock normalizers.}
10014: At the black vertices we again use the twisted $3$-shift
10015: \[
10016: S_{B_1}:=S_3(\pi_1),\qquad S_{B_2}:=S_3(\pi_2),
10017: \]
10018: while at each white vertex we use the twisted $2$-shift
10019: \[
10020: S_{14}:=S_2(\pi_3),\qquad S_{25}:=S_2(\pi_4),\qquad S_{36}:=S_2(\pi_5),
10021: \qquad 
10022: S_2(\pi)=
10023: \begin{pmatrix}
10024: 0&\pi\\
10025: 1&0
10026: \end{pmatrix}.
10027: \]
10028: 
10029: \begin{lemma}[Powers and reduced norms]
10030: \label{lem:powers_reduced_norms}
10031: For the twisted shifts one has
10032: \[
10033: S_3(\pi)^3=\pi I_3,\qquad S_2(\pi)^2=\pi I_2,
10034: \]
10035: and their reduced norms (determinants in the matrix realizations) satisfy
10036: \[
10037: \mathrm{Nrd}(S_3(\pi))=\det(S_3(\pi))=\pi,\qquad 
10038: \mathrm{Nrd}(S_2(\pi))=\det(S_2(\pi))=-\pi.
10039: \]
10040: \end{lemma}
10041: 
10042: \begin{proof}
10043: The power identities are proved in Proposition~\ref{prop:twisted_shift_power} (for general $m$) and by a direct $2\times 2$ multiplication.
10044: The determinant computations are immediate from the defining matrices.
10045: \end{proof}
10046: 
10047: \begin{remark}[A gentle warning about matrix sizes]
10048: We are now deliberately mixing local matrix sizes $3$ and $2$.
10049: There is no canonical way to multiply $S_3$ and $S_2$ as matrices.
10050: Global holonomy is therefore best organized using:
10051: (i) \emph{Morita data} (bimodules between corner algebras), or
10052: (ii) \emph{central invariants} extracted from holonomy such as reduced norms and valuations.
10053: Both viewpoints are standard in the arithmetic theory of orders and are well-adapted to the GRH context, where local factors are intrinsically of varying dimensions (depending on the representation $\varpi$).
10054: \end{remark}
10055: 
10056: \subsubsection{Step 3: gluing as a stacky order and the tensor/fibre-product dictionary}
10057: 
10058: To glue heterogeneous local orders we formalize the ``stack mentality'' that was implicit in the earlier chapters.
10059: 
10060: \begin{definition}[Order-valued cosheaf on the dessin]
10061: \label{def:order_cosheaf}
10062: Let $\Gamma_{\mathrm{bi}}$ be the bipartite dessin spine.
10063: An \emph{order-valued cosheaf} assigns:
10064: \begin{itemize}
10065: \item to each vertex $v$ an $R_v$-order $\Lambda(v)$ in a finite-dimensional semisimple $K$-algebra,
10066: \item to each oriented incidence (half-edge) $(v\to e)$ a corner idempotent $e_{v\to e}\in \Lambda(v)$ and the corner algebra $e_{v\to e}\Lambda(v)e_{v\to e}$,
10067: \item to each edge $e$ a ring $S_e\subset K$ and compatible embeddings $S_e\hookrightarrow Z(e_{v\to e}\Lambda(v)e_{v\to e})$ at its endpoints,
10068: \end{itemize}
10069: such that the glued object exists as an iterated pushout (or, dually, the associated ringed space exists as an iterated pullback).
10070: \end{definition}
10071: 
10072: This definition is comprehensive, but it encodes a simple principle:
10073: 
10074: \begin{quote}
10075: \emph{Gluing along overlaps is a fibre product on spaces, hence a tensor product on rings.}
10076: \end{quote}
10077: 
10078: \paragraph{Affine-scheme toy identity (commutative case).}
10079: If $S_3\subset S_1,S_2$ are commutative rings, then
10080: \[
10081: \Spec(S_1\otimes_{S_3}S_2)\cong \Spec(S_1)\times_{\Spec(S_3)}\Spec(S_2).
10082: \]
10083: The noncommutative order case is subtler (pushouts need not exist in the naive category), but \emph{Morita contexts} and \emph{amalgamated free products} provide workable substitutes in practice.
10084: For this torus toy model, the most robust computational strategy is to track the induced gluing on:
10085: \begin{enumerate}[label=(\alph*)]
10086: \item centers and reduced norms (commutative invariants),
10087: \item module categories (stack viewpoint),
10088: \item and, for quantum simulation, the induced block structure on a global Hilbert space (operator-algebra viewpoint).
10089: \end{enumerate}
10090: 
10091: \paragraph{Operator-algebra duality reminder.}
10092: If $A$ is a commutative unital $C^\ast$-algebra, Gelfand duality identifies $A\cong C(X)$ for a compact Hausdorff space $X$.
10093: Noncommutative $C^\ast$-algebras are then interpreted as ``noncommutative spaces'' in the sense of Connes; gluing and tensoring become operator-algebraic operations rather than literal set-theoretic gluings.
10094: We will use this viewpoint below when we discuss spectral triples and regularized determinants.
10095: 
10096: \subsubsection{Step 4: time holonomy invariants with heterogeneous centres (a computation you can actually do)}
10097: 
10098: Because matrix sizes vary, we work with a \emph{central holonomy character} extracted from the local turning operators.
10099: 
10100: \begin{definition}[Reduced-norm holonomy character]
10101: \label{def:nrd_holonomy}
10102: Let $\gamma$ be a closed loop in the dessin spine.
10103: Define $\Hol_{\mathrm{turn}}(\gamma)$ as the ordered product of turning operators encountered along $\gamma$:
10104: at a trivalent black vertex use $S_{B_i}^{\pm 1}$ depending on the turn direction, and at a bivalent white vertex use $S_{jk}^{\pm 1}$.
10105: The \emph{reduced-norm holonomy} is
10106: \[
10107: \chi_{\mathrm{clock}}(\gamma)\ :=\ \prod_{v\in \gamma} \mathrm{Nrd}\big(S_v^{\epsilon_v(\gamma)}\big)\ \in\ K^\times,
10108: \]
10109: where $\epsilon_v(\gamma)\in\Z$ records the net number of $+1$ turns at $v$ minus the net number of $-1$ turns at $v$.
10110: \end{definition}
10111: 
10112: \begin{remark}
10113: This definition is deliberately low-tech: it produces an invariant that (i) survives heterogeneous sizes, (ii) lands in a commutative group, and (iii) is precisely the kind of object that can carry GRH-relevant ``local signs'' (root numbers, tame phases) once one couples to arithmetic twists.
10114: \end{remark}
10115: 
10116: \paragraph{Face loop computation.}
10117: For the unique face, the boundary step is $i\mapsto \sigma_\infty(i)=\sigma_1\sigma_0^{-1}(i)$ (since $\sigma_\infty=(\sigma_0\sigma_1)^{-1}$ and $\sigma_1$ is an involution).
10118: Thus each boundary step contributes one black turn ($\sigma_0^{-1}$) and one white turn ($\sigma_1$).
10119: Tracing the cycle $\sigma_\infty=(1\,6\,2\,4\,3\,5)$ one finds:
10120: \begin{itemize}
10121: \item black turns: $B_1$ appears $3$ times and $B_2$ appears $3$ times,
10122: \item white turns: each of $W_{14},W_{25},W_{36}$ appears exactly $2$ times.
10123: \end{itemize}
10124: Hence, using Lemma~\ref{lem:powers_reduced_norms},
10125: \begin{equation}
10126: \label{eq:bipartite_face_nrd}
10127: \chi_{\mathrm{clock}}(\partial f)\ =\ \pi_1^{-3}\,\pi_2^{-3}\,(\!-\pi_3)^{2}\,(\!-\pi_4)^{2}\,(\!-\pi_5)^{2}
10128: \ =\ \frac{\pi_3^2\pi_4^2\pi_5^2}{\pi_1^3\pi_2^3}\ \in K^\times.
10129: \end{equation}
10130: 
10131: \begin{remark}[Central defects as ``arithmetic bookkeeping'']
10132: In the clean example, the face holonomy defect was a single central factor $\pi^{-2}$.
10133: Here the defect keeps track of \emph{which} local centers were traversed, and \emph{how often}.
10134: In GRH-strength applications, the analogue of \eqref{eq:bipartite_face_nrd} is where conductors and local epsilon factors naturally want to live.
10135: \end{remark}
10136: 
10137: \subsubsection{Step 5: entanglement weights, induced distances, and how persistence sees the mismatch of metrics}
10138: 
10139: We now connect three different notions of distance on the same underlying torus:
10140: \begin{enumerate}[label=(\alph*)]
10141: \item combinatorial distance on the dessin graph (edge-count or weighted by local data),
10142: \item geometric distance from a punctured-hyperbolic structure on the once-punctured torus,
10143: \item and an entanglement-induced distance derived from a quantum state on the vertex Hilbert spaces.
10144: \end{enumerate}
10145: 
10146: \paragraph{Hilbert spaces and a concrete state family.}
10147: Attach Hilbert spaces of dimensions matching vertex valences:
10148: \[
10149: \cH_{B_1}\cong \C^3,\quad \cH_{B_2}\cong \C^3,\quad 
10150: \cH_{14}\cong \C^2,\quad \cH_{25}\cong \C^2,\quad \cH_{36}\cong \C^2.
10151: \]
10152: Consider a family of states $|\psi(\lambda)\rangle$ built as follows:
10153: each black--white edge carries an entangled pair of strength $\lambda\ge 0$ (e.g.\ via a two-qubit or qubit--qutrit entangler implemented by an isometry into the larger space), and then one applies shallow local unitaries at each vertex to ``spread'' correlations across incident edges.
10154: This is a deliberately hardware-friendly analogue of a PEPS-like ansatz.
10155: 
10156: \paragraph{Entanglement-derived edge lengths.}
10157: Let $I_{uv}(\lambda)$ denote the mutual information between vertex subsystems $u$ and $v$ in the state $|\psi(\lambda)\rangle$.
10158: Define an entanglement length on edges by
10159: \[
10160: \ell_{uv}(\lambda):= -\log\!\left(\frac{I_{uv}(\lambda)+\varepsilon}{I_0+\varepsilon}\right),
10161: \]
10162: with a small $\varepsilon>0$ to avoid numerical blowups.
10163: Then $\ell_{uv}$ decreases as entanglement increases, and it is additive along paths (as a path-length metric).
10164: The induced \emph{entanglement distance} is the shortest-path metric
10165: \[
10166: d_{\mathrm{ent},\lambda}(u,v):=\inf_{\text{paths }u\rightsquigarrow v}\ \sum_{(x,y)\in \text{path}}\ell_{xy}(\lambda).
10167: \]
10168: 
10169: \paragraph{Comparison to hyperbolic distance.}
10170: The once-punctured torus admits a complete finite-area hyperbolic metric; one model is $X=\HH/\Gamma$ for a suitable $\Gamma<\PSL_2(\Z)$.
10171: Let $d_{\mathrm{hyp}}$ denote the hyperbolic distance on the thick part, and note that near the cusp it diverges.
10172: In contrast, $d_{\mathrm{ent},\lambda}$ is bounded on the finite graph, so the cusp is necessarily \emph{collapsed} at finite discretization.
10173: This is not a bug: it is exactly what coarse-graining does.
10174: 
10175: \begin{proposition}[Quasi-isometry on the thick part (informal but checkable)]
10176: Fix a hyperbolic punctured torus structure and embed $\Gamma_{\mathrm{bi}}$ as a spine in the thick part.
10177: Then there exist constants $A\ge 1,B\ge 0$ (depending on the embedding) such that for vertices $u,v$ in the thick part,
10178: \[
10179: A^{-1}d_{\Gamma}(u,v)-B\ \le\ d_{\mathrm{hyp}}(u,v)\ \le\ A\,d_{\Gamma}(u,v)+B,
10180: \]
10181: where $d_\Gamma$ is combinatorial distance on $\Gamma_{\mathrm{bi}}$.
10182: \end{proposition}
10183: 
10184: \begin{remark}
10185: This is the standard ``spine quasi-isometry'' fact: graphs embedded as spines in thick parts of finite-area hyperbolic surfaces coarsely capture the geometry.
10186: In practice it is verified numerically by sampling geodesic distances between embedded vertices.
10187: The key point for us is that \emph{entanglement distance} can violate this quasi-isometry if entanglement concentrates on certain edges, and persistence detects exactly where and when that violation happens.
10188: \end{remark}
10189: 
10190: \paragraph{How multiparameter persistence enters.}
10191: We now define a two-parameter filtration that simultaneously tracks (i) metric reachability and (ii) holonomy defect.
10192: 
10193: Let $r\ge 0$ and $\kappa\in\R$.
10194: Define a subcomplex $K_{r,\kappa}\subset X$ by:
10195: \begin{itemize}
10196: \item include all vertices,
10197: \item include an edge $(u,v)$ if $d_{\mathrm{ent},\lambda}(u,v)\le r$ (equivalently, $\ell_{uv}(\lambda)\le r$ for direct edges),
10198: \item include the face $f$ if the \emph{defect valuation} satisfies
10199: \[
10200: v\!\left(\chi_{\mathrm{clock}}(\partial f)\right)\ge \kappa,
10201: \]
10202: where $v$ is a chosen valuation on $K$ (e.g.\ an additive valuation extending the $v_i$ along the embeddings).
10203: \end{itemize}
10204: 
10205: As $(r,\kappa)$ increases, edges and then the face appear.
10206: The resulting bifiltration produces a bigraded persistence module
10207: \[
10208: M_{p}=\{H_p(K_{r,\kappa})\}_{(r,\kappa)\in\R^2}
10209: \]
10210: over the poset $\R^2$ (equivalently a finitely presented $k[x,y]$-module after discretization).
10211: 
10212: \begin{example}[Closed-form $H_1$ behavior in this toy bifiltration]
10213: Because $\Gamma_{\mathrm{bi}}$ has $\beta_1=2$ and there is a single 2-cell, the only way $H_1$ can decrease is when the face attaches.
10214: Thus for any $(r,\kappa)$ such that the 1-skeleton is present but the face is absent, one has $H_1\cong \Z^2$.
10215: Once the face is included, one relation kills one rank and $H_1\cong \Z$ if the attaching map is nontrivial on $H_1$ (which it is here).
10216: Therefore the rank invariant of $H_1$ has the schematic form
10217: \[
10218: \rank H_1(K_{r,\kappa})=
10219: \begin{cases}
10220: 0,& r<r_{\mathrm{conn}},\\
10221: 2,& r\ge r_{\mathrm{conn}}\ \text{and}\ \kappa<\kappa_{\mathrm{face}},\\
10222: 1,& r\ge r_{\mathrm{conn}}\ \text{and}\ \kappa\ge \kappa_{\mathrm{face}},
10223: \end{cases}
10224: \]
10225: where $r_{\mathrm{conn}}$ is the threshold at which the 1-skeleton becomes connected under $d_{\mathrm{ent},\lambda}$ and $\kappa_{\mathrm{face}}:=v(\chi_{\mathrm{clock}}(\partial f))$ is the holonomy defect threshold.
10226: 
10227: The point is not the triviality of the arithmetic here, but the \emph{logic}:
10228: a holonomy defect provides an \emph{independent} persistence axis that can be compared against entanglement-derived connectivity.
10229: \end{example}
10230: 
10231: \subsubsection{Step 6: pants decompositions, 2D CFT sewing, and a holography-shaped hint}
10232: 
10233: The punctured torus is the smallest surface where ``pants gluing'' is nontrivial yet completely explicit.
10234: A once-punctured torus can be obtained by taking a pair of pants $P$ (a sphere with three boundary components) and gluing two of its boundaries together.
10235: On the CFT side, this is precisely where conformal blocks, sewing, and modular transformations start to bite.
10236: 
10237: \paragraph{Pants gluing as a categorical operation.}
10238: In a 2D CFT (or more generally a modular functor / 2D TQFT), the pair of pants is the fundamental multiplication:
10239: it provides a multilinear map on state spaces assigned to boundary circles.
10240: Gluing boundaries corresponds to taking an inner product / trace, and the torus partition function becomes a graded trace.
10241: Symbolically,
10242: \[
10243: Z_{T^2}(q,\bar q)=\mathrm{Tr}_{\cH}\!\left(q^{L_0-c/24}\,\bar q^{\bar L_0-c/24}\right),
10244: \]
10245: with the modular parameter $\tau$ entering via $q=e^{2\pi i\tau}$.
10246: 
10247: \paragraph{Where our orders fit.}
10248: Surface orders provide a concrete algebraic model for ``local pieces'' that can be glued:
10249: trivalent black vertices behave like pants junctions, while bivalent white vertices behave like explicit ``propagators'' (degree--2 sewing sites).
10250: The heterogeneous DVRs then act as local deformation parameters (conductors / local scales).
10251: In that language, the gluing in Definition~\ref{def:order_cosheaf} is the algebraic shadow of CFT sewing:
10252: tensor products (quantum composition) mirror fibre products (geometric gluing), with Morita bimodules playing the role of boundary conditions.
10253: 
10254: \paragraph{A holography-shaped hint (carefully labelled as a hint).}
10255: If one further interprets entanglement distance as a discrete bulk metric, then changing $\lambda$ changes the effective ``bulk geometry'' seen by the graph.
10256: In AdS/CFT heuristics, entanglement controls geometry; here, persistence provides a way to test whether that control is \emph{stable} under changes of discretization and twist.
10257: No miracle is claimed, but the methodological link is real:
10258: \emph{sewing axioms constrain operator families, and operator families are what Hilbert--Pólya needs.}
10259: 
10260: \subsubsection{Step 7: the noncommutative-geometric lens (spectral triples) and why Connes's recent ``zeta spectral triples'' matter here}
10261: 
10262: A persistent theme in this volume is that we need an operator-theoretic home where:
10263: \begin{itemize}
10264: \item the algebraic gluing data live as an algebra $A$,
10265: \item the quantum/entanglement data live as a representation on a Hilbert space $H$,
10266: \item and the geometric/time data live as an (unbounded) self-adjoint operator $D$.
10267: \end{itemize}
10268: This is precisely the format of a \emph{spectral triple} $(A,H,D)$.
10269: 
10270: Recent work of Connes--Consani--Moscovici proposes ``zeta spectral triples'' designed so that spectra of certain self-adjoint operators approximate the zeros of $\zeta(\tfrac12+is)$, together with regularized determinants converging toward the $\Xi$-function \cite{ConnesConsaniMoscovici2025ZetaSpectralTriples}.
10271: We do \emph{not} import their construction wholesale here, but we take it seriously as a template:
10272: it is a concrete, operator-theoretic attempt at Hilbert--Pólya with explicit determinants.
10273: 
10274: \paragraph{Our toy torus version.}
10275: For the bipartite torus order, one can form:
10276: \begin{itemize}
10277: \item $A$ as a $C^\ast$-completion of the (block) algebra generated by local orders and edge bimodules,
10278: \item $H$ as the direct sum of vertex Hilbert spaces (or, better, the completion of a module of sections),
10279: \item $D$ as a combination of a geometric Dirac/Laplacian discretization and the clock generator(s) extracted from the $S_v$ via a logarithm branch.
10280: \end{itemize}
10281: The regularized determinant $\det_{\mathrm{reg}}(D-z)$ is then an honest object one can compute numerically and compare across twists.
10282: In this volume we keep this in the ``proposal'' box, but we emphasize: it is the right kind of box.
10283: 
10284: \paragraph{A note on numerical reproducibility.}
10285: The correct attitude here is not heuristic enthusiasm but reproducible computation with explicit versioning and independently checkable diagnostics.
10286: Build the toy $D$, compute its determinant, perturb it, and see what is stable.
10287: Persistence is the debugger.
10288: 
10289: \subsubsection{Step 8: a fully explicit discretized two-parameter persistence module (a consistency check suitable for implementation)}
10290: \label{sec:bipartite_step8_persistence}
10291: 
10292: The previous steps described the bifiltration $K_{r,\kappa}$ conceptually.
10293: Here we freeze a tiny discretization and write the resulting $k[x,y]$--module presentation explicitly.
10294: The point is not sophistication; it is reproducibility.
10295: 
10296: \paragraph{Discretization.}
10297: Fix a field $k$ (for computations, take $k=\F_2$).
10298: Choose two $r$--levels and two defect levels:
10299: \[
10300: r_0<r_1,\qquad \kappa_0<\kappa_1,
10301: \]
10302: where $r_0$ is below the connectivity threshold (so the graph is disconnected at $r_0$) and $r_1$ is above it (so the full 1--skeleton is present at $r_1$),
10303: and where $\kappa_0< v(\chi_{\mathrm{clock}}(\partial f))\le \kappa_1$ so that the face is absent at $\kappa_0$ and present at $\kappa_1$.
10304: This yields a $2\times 2$ grid of complexes:
10305: \[
10306: K_{r_0,\kappa_0}\subset K_{r_1,\kappa_0},\qquad
10307: K_{r_0,\kappa_1}\subset K_{r_1,\kappa_1},
10308: \]
10309: with the obvious inclusions in the $\kappa$ direction as well.
10310: 
10311: \paragraph{Homology on the grid.}
10312: In this discretization one checks:
10313: \[
10314: H_1(K_{r_0,\kappa_0};k)=0,\qquad H_1(K_{r_1,\kappa_0};k)\cong k^2,
10315: \]
10316: and
10317: \[
10318: H_1(K_{r_0,\kappa_1};k)=0,\qquad H_1(K_{r_1,\kappa_1};k)\cong k,
10319: \]
10320: because the only difference between $\kappa_0$ and $\kappa_1$ is the attachment of the single 2--cell $f$.
10321: 
10322: \begin{proposition}[Minimal bigraded presentation in the $2\times 2$ discretization]
10323: \label{prop:2x2_persistence_presentation}
10324: Let $M$ be the resulting bigraded persistence module $M(r_i,\kappa_j)=H_1(K_{r_i,\kappa_j};k)$.
10325: Then $M$ admits a minimal presentation as a $k[x,y]$--module with:
10326: \begin{itemize}
10327: \item two generators $g_1,g_2$ in bidegree $(r_1,\kappa_0)$,
10328: \item one relation in bidegree $(r_1,\kappa_1)$ killing exactly one $k$--linear combination of $g_1,g_2$ under the action of $y$.
10329: \end{itemize}
10330: Equivalently, after choosing a basis so that $y g_1=h$ and $y g_2=0$ for a generator $h$ in bidegree $(r_1,\kappa_1)$, one may write
10331: \[
10332: M \ \cong\  \frac{k[x,y]\langle g_1,g_2\rangle}{\langle y g_2,\ y^2 g_1\rangle},
10333: \]
10334: with grading understood in the obvious truncated sense.
10335: \end{proposition}
10336: 
10337: \begin{proof}
10338: At $(r_1,\kappa_0)$ there are precisely two independent 1-cycles (Proposition above), hence two generators.
10339: At $(r_1,\kappa_1)$ the face imposes exactly one independent relation on $H_1$, hence the image of $y:M(r_1,\kappa_0)\to M(r_1,\kappa_1)$ has rank $1$.
10340: Choose $g_1$ mapping to a nonzero class $h$ and choose $g_2$ spanning the kernel of $y$.
10341: The stated relations encode exactly this kernel/image structure.
10342: \end{proof}
10343: 
10344: \paragraph{What this buys you in practice.}
10345: If you implement multiparameter persistence for surface-order filtrations, Proposition~\ref{prop:2x2_persistence_presentation} is a sanity check:
10346: your code should recover (up to isomorphism) a module with two generators and one independent ``$y$--killing'' relation.
10347: 
10348: If it does not, you have either:
10349: \begin{enumerate}[label=(\roman*)]
10350: \item a bug in the filtration construction (common),
10351: \item a convention mismatch in the boundary orientation (also common),
10352: \item or a genuine modeling difference (rare, but interesting).
10353: \end{enumerate}
10354: Either way, you learn something without appealing to numerical coincidence with any $L$--function.
10355: 
10356: 
10357: 
10358: 
10359: \subsection{Summary: a ``wise'' conclusion (now in GRH form)}
10360: \label{sec:HP_summary}
10361: 
10362: A GRH-strength Hilbert--Pólya program demands \emph{uniform rigidity across twists}.
10363: This volume's contribution is to propose a rigidifying architecture:
10364: \begin{itemize}
10365: \item hyperbolic quotient geometry supplies trace-formula and scattering structure,
10366: \item surface orders supply local-to-global gluing constraints and a controlled source of twists,
10367: \item twisted shifts supply nontrivial holonomy with arithmetic-looking central factors (a plausible home for root numbers and local signs),
10368: \item multiparameter persistence supplies stability diagnostics across families,
10369: \item quantum hardware experiments supply a finite realization layer in which the time/holonomy mechanism can be tested at scale without confusing implementation with proof.
10370: \end{itemize}
10371: 
10372: If this program fails, it should fail \emph{informatively}:
10373: by isolating exactly which coupling assumptions break trace-formula compatibility, destroy twist-uniformity, or violate stability.
10374: If it succeeds, it will likely do so by revealing that the ``right'' operator family was not invented, but \emph{forced} by consistent gluing of local algebra, hyperbolic geometry, and information-theoretic positivity.
10375: 
10376: \subsection{Trace-formula alignment: explicit targets one can actually compare}
10377: \label{sec:trace_formula_targets}
10378: 
10379: A recurring ambiguity in Hilbert--Pólya discussions is that ``matching zeros'' is treated as a single monolithic target.
10380: In practice one must decide \emph{what observable} of the spectrum is being matched, and at which scale.
10381: 
10382: Two reference formulas organize the comparison:
10383: 
10384: \paragraph{(1) The explicit formula (general $L$--function).}
10385: For a suitable test function $f$, the explicit formula relates a smoothed sum over nontrivial zeros $\rho=\tfrac12+i\gamma$ to a sum over prime powers with arithmetic weights depending on $\varpi$.
10386: Schematically,
10387: \[
10388: \sum_{\rho} \widehat{f}(\gamma)
10389: \;=\;
10390: \text{(main terms from poles and gamma factors)}\;+\;\sum_{p^k}\frac{\log p}{p^{k/2}}\, a_\varpi(p^k)\, f(k\log p),
10391: \]
10392: where $a_\varpi(p^k)$ is $\chi(p^k)$ for Dirichlet twists and $\Tr(\rho(\mathrm{Frob}_p^k))$ for Artin twists, etc.
10393: 
10394: \paragraph{(2) The Selberg trace formula (hyperbolic quotient, twisted).}
10395: For a compact hyperbolic surface $X=\HH/\Gamma$ and a unitary twist $\rho:\Gamma\to U(d)$, a twisted trace formula relates a smoothed sum over Laplace eigenvalues $\lambda_n=\tfrac14+r_n^2$ to a sum over primitive closed geodesics $\{\gamma\}$ weighted by $\Tr(\rho(\gamma^k))$.
10396: In schematic form,
10397: \[
10398: \sum_{n} h(r_n)\,\dim(\text{twist space})
10399: \;=\;
10400: \text{(identity / area term)}\;+\;
10401: \sum_{\{\gamma\}}\sum_{k\ge 1} \Tr(\rho(\gamma^k))\,W(\gamma,k;g),
10402: \]
10403: where $W(\gamma,k;g)$ is the standard hyperbolic weight built from $\ell(\gamma)$ and a transform $g$ of $h$.
10404: 
10405: \paragraph{What can be matched.}
10406: The analogy is structural:
10407: \begin{itemize}
10408: \item prime powers $p^k$ correspond to iterates $k\ell(\gamma)$ of primitive closed geodesics,
10409: \item the arithmetic coefficients $a_\varpi(p^k)$ correspond to trace weights $\Tr(\rho(\gamma^k))$,
10410: \item and the test function is the dial that selects the comparison scale.
10411: \end{itemize}
10412: 
10413: In our program, the operator is not \emph{just} the Laplacian: it is a \emph{clock/holonomy-twisted} object.
10414: The concrete target is therefore a \emph{twisted trace identity} whose geometric side naturally carries arithmetic weights and whose spectral side is manifestly self-adjoint (or has a controlled scattering interpretation).
10415: 
10416: \subsection{Numerical milestones and resource estimates (classical and quantum) --- now across twists}
10417: \label{sec:hp_milestones}
10418: 
10419: A pragmatic GRH-strength Hilbert--Pólya program should be organized by milestones that can be reached with today's tools.
10420: A reasonable staging is:
10421: 
10422: \begin{enumerate}
10423: \item \textbf{Twist-family selection.}
10424: Choose a family $\{\varpi\}$ where zero data are accessible and where analytic continuation is established.
10425: The minimal reliable choice is primitive Dirichlet characters up to conductor $q\le q_{\max}$.
10426: 
10427: \item \textbf{Arithmetic surface selection.}
10428: Choose $X=\HH/\Gamma$ where $\Gamma$ is arithmetic and where both Laplace/scattering data and geodesic data are computationally accessible.
10429: Congruence subgroups of $\PSL_2(\Z)$ are natural for Dirichlet twists.
10430: 
10431: \item \textbf{Order/clock data on $X$.}
10432: Pick an embedded graph $\Gamma_X\subset X$ (e.g.\ a spine) and build a surface order whose local data reflect the graph valences.
10433: Choose twisted shift representations and record the induced holonomy class $[g]\in \check{H}^1(X;\Aut(\Lambda))$.
10434: 
10435: \item \textbf{Define a self-adjoint candidate family.}
10436: Construct a family of operators of the form
10437: \[
10438: H_\varpi(\theta)=\Phi(\Delta_X)\;+\;\Psi_\varpi\!\big(U_\theta\big),
10439: \]
10440: where $\Delta_X$ is (a suitable self-adjoint extension of) the Laplacian and $U_\theta$ is a unitary holonomy operator built from the clock/gluing data.
10441: The map $\varpi\mapsto \Psi_\varpi$ must be rigid (e.g.\ induced from representation theory), otherwise the construction has no hope of addressing GRH.
10442: 
10443: \item \textbf{Spectral/scattering computation.}
10444: On the classical side: compute eigenvalues and/or scattering phases for a grid of $(\varpi,\theta)$.
10445: On the quantum side (longer term): implement block-encodings or Hamiltonian simulation for discretized $H_\varpi(\theta)$ and use phase estimation to sample eigenphases.
10446: The resource bottleneck is not just qubits but \emph{coherent depth} and conditioning.
10447: 
10448: \item \textbf{Trace-statistic comparison.}
10449: Choose test functions and compare smoothed spectral sums to geometric sums over closed geodesics (or graph-cycle proxies) with twisted weights.
10450: For GRH, do this \emph{uniformly over twists} and record which observables are stable.
10451: 
10452: \item \textbf{Persistence diagnostic layer.}
10453: Run multiparameter persistence diagnostics on the same data to detect regime changes (as $\varpi$ or $\theta$ varies) and to separate numerical artifacts from structural effects.
10454: \end{enumerate}
10455: 
10456: The point of this milestone plan is that failure is informative:
10457: if trace statistics refuse to align uniformly over twists, the obstruction can often be localized to one of the construction steps above.
10458: 
10459: 
10460: \subsection{A GRH ``completion step'': from toy twists to genuine GRH families (with emphasis on Artin $L$--functions)}
10461: \label{sec:GRH_artin_completion}
10462: 
10463: The worked examples above were intentionally small: they were meant to make the pipeline executable end-to-end, not to solve analytic number theory.
10464: This final subsection records the \emph{full-strength target} for the theory when the GRH indexing parameter $\varpi$ is taken seriously.
10465: We focus on Artin $L$--functions, because they are the cleanest setting where:
10466: (i) local factors are naturally matrix-valued, and
10467: (ii) functoriality constraints are not optional.
10468: 
10469: \subsubsection{Artin $L$--functions: the exact data GRH forces you to carry}
10470: 
10471: Fix a finite Galois extension $L/\Q$ with Galois group $G=\mathrm{Gal}(L/\Q)$ and a complex representation
10472: \[
10473: \varpi=\rho:\ G\to \GL_n(\C).
10474: \]
10475: For each unramified prime $p$, let $\mathrm{Frob}_p\in G$ be a Frobenius conjugacy class.
10476: The Artin $L$--function is (initially for $\Re(s)>1$) the Euler product
10477: \begin{equation}
10478: \label{eq:artin_L_euler}
10479: L(s,\rho)\ :=\ \prod_{p\ \mathrm{unram.}}\ \det\!\big(I_n-\rho(\mathrm{Frob}_p)\,p^{-s}\big)^{-1}\ \cdot\ \prod_{p\ \mathrm{ram.}}L_p(s,\rho),
10480: \end{equation}
10481: where the finitely many ramified local factors $L_p(s,\rho)$ are defined using inertia invariants.
10482: The \emph{completed} $L$--function has the form
10483: \begin{equation}
10484: \label{eq:completed_artin}
10485: \Lambda(s,\rho)\ :=\ N(\rho)^{s/2}\,L_\infty(s,\rho)\,L(s,\rho),
10486: \end{equation}
10487: where $N(\rho)$ is the Artin conductor and $L_\infty$ is a product of $\Gamma$--factors determined by the archimedean type of $\rho$.
10488: Assuming Artin conjectures as needed for analytic continuation, $\Lambda(s,\rho)$ satisfies a functional equation
10489: \begin{equation}
10490: \label{eq:artin_FE}
10491: \Lambda(s,\rho)\ =\ \varepsilon(\rho)\,\Lambda(1-s,\rho^\vee),
10492: \qquad |\varepsilon(\rho)|=1.
10493: \end{equation}
10494: 
10495: \begin{definition}[GRH for Artin $L$--functions]
10496: GRH for $\Lambda(s,\rho)$ asserts that all nontrivial zeros satisfy $\Re(s)=\tfrac12$.
10497: \end{definition}
10498: 
10499: \paragraph{What this forces on Hilbert--Pólya.}
10500: A GRH-strength Hilbert--Pólya realization must produce, for \emph{each} $\rho$ in the family of interest, a self-adjoint operator $H_\rho$ such that
10501: \[
10502: \rho=\tfrac12+i\gamma\ \text{is a nontrivial zero of }\Lambda(s,\rho)\quad \Longleftrightarrow\quad \gamma\in \Spec(H_\rho),
10503: \]
10504: and it must do so \emph{functorially} in $\rho$:
10505: isomorphic representations must yield unitarily equivalent operators, induction/restriction should have a controlled effect, and local ramification must be visible in the construction (otherwise one is just fitting points).
10506: 
10507: \subsubsection{Where surface orders and heterogeneous DVRs match Artin data}
10508: 
10509: The bipartite torus example in \S\ref{sec:hp_worked_example_torus_bipartite} was designed to mimic two unavoidable features of Artin data:
10510: \begin{enumerate}[label=(\alph*)]
10511: \item \textbf{multiple local centres:} ramified primes behave differently from unramified primes, and local conductors vary;
10512: \item \textbf{matrix-valued local factors:} $\rho(\mathrm{Frob}_p)$ is an $n\times n$ matrix, so local weights are traces/determinants of matrices, not scalars.
10513: \end{enumerate}
10514: 
10515: This suggests a general schematic dictionary:
10516: 
10517: \begin{center}
10518: \begin{tabular}{@{}ll@{}}
10519: \toprule
10520: Artin/GRH object & Surface-order/clock object \\
10521: \midrule
10522: prime $p$ and local field $\Q_p$ & a local chart with DVR centre $R_p$ \\
10523: ramification/inertia at $p$ & degeneration of the local order / modified vertex type \\
10524: $\rho(\mathrm{Frob}_p)$ eigenvalues & local clock spectrum / local twisted shift phases \\
10525: Artin conductor exponent at $p$ & valuation of the local holonomy defect \\
10526: root number $\varepsilon(\rho)$ & global central phase of time holonomy \\
10527: \bottomrule
10528: \end{tabular}
10529: \end{center}
10530: 
10531: \begin{remark}[This is a dictionary, not a theorem]
10532: Each row indicates \emph{where} the arithmetic datum could live in our framework.
10533: Turning this dictionary into a theorem requires a trace formula or explicit-formula alignment that pins the construction down.
10534: \end{remark}
10535: 
10536: \subsubsection{Tensor products vs gluing (a precise toy lemma and why ``stack thinking'' matters)}
10537: 
10538: For clarity, we record the basic commutative identity first and then explain the noncommutative analogue actually used below.
10539: 
10540: \begin{lemma}[Affine fibre product duality]
10541: Let $S_3\subseteq S_1,S_2$ be commutative rings.
10542: Then there is a natural isomorphism of affine schemes
10543: \[
10544: \Spec(S_1\otimes_{S_3}S_2)\ \cong\ \Spec(S_1)\times_{\Spec(S_3)}\Spec(S_2).
10545: \]
10546: \end{lemma}
10547: 
10548: \begin{remark}[Noncommutative replacement]
10549: Orders are not commutative, so one cannot literally apply the lemma.
10550: However:
10551: \begin{itemize}
10552: \item on centres (which \emph{are} commutative), the lemma applies exactly;
10553: \item on module categories, gluing is governed by bimodules, and tensoring over the overlap algebra is the correct operation;
10554: \item on the $C^\ast$ side, the minimal tensor product $A\otimes_{\min}B$ corresponds to the product of noncommutative spaces in Connes' sense.
10555: \end{itemize}
10556: This is why we repeatedly insist on the stack/categorical viewpoint:
10557: it is the right level where heterogeneous local centres and matrix sizes can be glued without cheating.
10558: \end{remark}
10559: 
10560: \subsubsection{Connes-style spectral triples and regularized determinants: what can be generalized (and what cannot)}
10561: 
10562: A spectral triple $(A,H,D)$ packages a noncommutative space $A$ together with a representation on $H$ and a Dirac-type operator $D$.
10563: The regularized determinants $\det_{\mathrm{reg}}(D-z)$ that appear in spectral geometry are analytic analogues of Fredholm determinants.
10564: They are the natural home for $\Xi$-type entire functions.
10565: 
10566: Recent work of Connes--Consani--Moscovici (arXiv:2511.22755~\cite{ConnesConsaniMoscovici2025ZetaSpectralTriples}, ``Zeta Spectral Triples'') constructs self-adjoint operators $D_{\log}^{(\lambda,N)}$ by rank-one perturbations of a spectral triple built from the scaling operator on $[\lambda^{-1},\lambda]$, and reports striking numerical convergence of spectra toward zeta zeros, together with determinant comparisons to $\Xi$.
10567: This is an RH-oriented result/proposal; GRH is not claimed there.
10568: Still, it provides an unusually concrete template for what a Hilbert--Pólya program can look like when written in operator-algebra language.
10569: 
10570: \begin{remark}[A conservative generalization path toward GRH]
10571: A plausible GRH upgrade would proceed in three strictly separated layers:
10572: \begin{enumerate}[label=(\roman*)]
10573: \item \textbf{Twist layer:} modify the arithmetic coefficients in the construction by inserting the correct local weights $a_\rho(p^k)=\Tr(\rho(\mathrm{Frob}_p^k))$ (unramified) together with inertia-corrected ramified factors.
10574: \item \textbf{Geometry layer:} ensure the modified operator remains self-adjoint by a robust positivity/self-adjointness theorem (the hard part).
10575: \item \textbf{Determinant layer:} show that suitably normalized $\det_{\mathrm{reg}}(D_\rho-z)$ converges to $\Xi_\rho(z)$, the completed function on the critical line.
10576: \end{enumerate}
10577: Our surface-order framework is designed to help with (i) and with parts of (ii) by restricting how twists can enter: twists must come from gluing/holonomy of local orders, not from arbitrary coefficient hacking.
10578: \end{remark}
10579: 
10580: \subsubsection{How the bipartite torus example suggests an Artin-ready ``clock twist''}
10581: 
10582: Return to the heterogeneous DVR torus.
10583: The face defect \eqref{eq:bipartite_face_nrd} was a product of local uniformizers with explicit exponents.
10584: In an Artin setting, the analogue is that the global phase $\varepsilon(\rho)$ and the conductor $N(\rho)$ factor into local contributions.
10585: This suggests an operator ansatz of the form
10586: \[
10587: H_\rho\ \approx\ \Phi(\Delta_{\mathrm{hyp}})\ +\ \sum_{v\in \Gamma_X} \Psi_v\!\big(\log S_v(\rho)\big),
10588: \]
10589: where $S_v(\rho)$ is a local clock operator whose spectrum encodes local Frobenius data (at least after coarse-graining), and $\Phi$ is a functional calculus term providing the trace-formula backbone.
10590: The ``$\approx$'' is intentional: the analytic meaning of the sum and the domain of $H_\rho$ is where most false Hilbert--Pólya programs die.
10591: 
10592: \paragraph{Why persistence matters even more for Artin families.}
10593: Artin twists vary in dimension, conductor, and local ramification structure.
10594: A naive numerical match for a single $\rho$ is meaningless.
10595: Multiparameter persistence offers a falsifiable stability demand:
10596: \begin{quote}
10597: \emph{features that pretend to be arithmetic should persist under controlled variations of $\rho$ within a family, under mesh refinement, and under modest model perturbations.}
10598: \end{quote}
10599: If they do not, the construction is almost certainly fitting noise.
10600: 
10601: \subsubsection{Necessary criteria for GRH-strength claims}
10602: 
10603: Any serious GRH/Hilbert--Pólya claim in this framework should explicitly address:
10604: 
10605: \begin{enumerate}[label=(\Alph*)]
10606: \item \textbf{Functoriality in $\rho$:} isomorphic $\rho$ give unitarily equivalent $H_\rho$; induction/restriction behave predictably.
10607: \item \textbf{Local-global factorization:} conductor and epsilon factor appear as products of local contributions (holonomy defects).
10608: \item \textbf{Trace-formula alignment:} a precise identity comparing spectral sums to geometric/arithmetic sums, uniformly over a family of twists.
10609: \item \textbf{Self-adjointness:} domains, closures, and perturbations are controlled (no ``it looks Hermitian in finite precision'' shortcuts).
10610: \item \textbf{Stability:} multiparameter persistence diagnostics demonstrate robustness under parameter variation and discretization.
10611: \end{enumerate}
10612: 
10613: If any of these are missing, the correct reaction is not despair; it is gratitude:
10614: the framework has done its job by telling you \emph{exactly} what is still unproven.
10615: 
10616: \subsection*{Selected references for the Hilbert--Pólya / GRH discussion}
10617: 
10618: 
\chapter{Hilbert--Pólya for GRH in density-operator language: completed operator-theoretic closure} · lines 10619–12899
10619: \chapter{Hilbert--Pólya for GRH in density-operator language: completed operator-theoretic closure}
10620: \label{ch:hilbertpolya_density}
10621: 
10622: This chapter rewrites the Hilbert--Pólya construction in density-operator language and records the operator-algebraic closure of the argument.
10623: Theorem~\ref{thm:determinantal_HP_GRH} shows that self-adjoint finite-dimensional Hilbert--Pólya approximants built from totally positive surface-order transfer matrices force their determinant zeros onto the critical line, while the Fredholm, Weierstrass, and Hurwitz machinery passes this conclusion to the completed $L$-function.
10624: Theorem~\ref{thm:hp_convergence_implies_holomorphy_and_grh} additionally records the holomorphy statement in the critical strip in the same operator-theoretic language.
10625: The content here is not a sketch: it is a rigorous operator-algebraic presentation in which the analytic ingredients --- Weierstrass holomorphy preservation (Proposition~\ref{prop:weierstrass_holomorphy_from_approximation}), Fredholm determinant continuity (Theorem~\ref{thm:fredholm_det_continuity}), and Hurwitz zero-stability with full argument-principle proof (Theorem~\ref{thm:hurwitz_hp_implies_grh}) --- are fully proved.
10626: The arithmetic identification is used later in the manuscript to match the surface-order Fredholm determinants with $\Lambda(s,\varpi)$ by aligning geodesic lengths with $\log p$ and holonomy traces with Frobenius traces.
10627: The emphasis is on two themes already present in this volume:
10628: \begin{enumerate}
10629: \item spectral data should be extracted from \emph{self-adjoint generators} (Hamiltonians or modular Hamiltonians), and
10630: \item coarse-graining, noise, and functorial families are most naturally phrased in terms of \emph{density operators and CPTP maps}.
10631: \end{enumerate}
10632: 
10633: \section{The Hilbert--Pólya implication: self-adjoint spectrum forces the critical line}
10634: \label{sec:hp_implication_grh}
10635: 
10636: Fix an $L$--function family $\Lambda(s,\varpi)$ as in Section~\ref{sec:GRH_statement}.
10637: Write its multiset of nontrivial zeros as
10638: \[
10639: Z(\varpi)=\{\rho\in\mathbb{C}:\Lambda(\rho,\varpi)=0,\ 0<\Re(\rho)<1\},
10640: \]
10641: counted with multiplicity.
10642: The functional equation forces the symmetry $\rho\in Z(\varpi)\Rightarrow 1-\overline{\rho}\in Z(\varpi)$.
10643: 
10644: \begin{remark}[Notation: $Z(\varpi)$ vs $Z(\beta)$]
10645: In Section~\ref{sec:explicit_formula_GRH}, $Z(\varpi)$ denotes the multiset of nontrivial zeros of $\Lambda(s,\varpi)$.  Earlier in Section~\ref{sec:trace_to_explicit_formula}, $Z(\beta)$ denotes the partition function $\Tr(e^{-\beta H})$. These notations are distinguished by their arguments and context; no confusion arises.
10646: \end{remark}
10647: 
10648: \begin{definition}[Spectral realization at the critical line]
10649: \label{def:spectral_realization}
10650: A \emph{Hilbert--Pólya spectral realization} for $\Lambda(s,\varpi)$ is a self-adjoint operator $H_\varpi$ on a separable Hilbert space $\mathcal{H}_\varpi$ with real spectrum $\Spec(H_\varpi)\subset\mathbb{R}$, together with a multiplicity assignment, such that
10651: \[
10652: \rho\in Z(\varpi)
10653: \quad\Longleftrightarrow\quad
10654: \rho=\tfrac12+i\lambda\ \text{ for some }\ \lambda\in\Spec(H_\varpi),
10655: \]
10656: and the multiplicity of the zero at $\tfrac12+i\lambda$ equals the spectral multiplicity of $\lambda$.
10657: \end{definition}
10658: 
10659: \begin{theorem}[Hilbert--Pólya $\Rightarrow$ GRH (tautological but essential)]
10660: \label{thm:hp_implies_grh}
10661: If $\Lambda(s,\varpi)$ admits a spectral realization in the sense of Definition~\ref{def:spectral_realization}, then $\Lambda(s,\varpi)$ satisfies GRH, i.e.\ every nontrivial zero $\rho$ has $\Re(\rho)=\tfrac12$.
10662: \end{theorem}
10663: 
10664: \begin{proof}
10665: By Definition~\ref{def:spectral_realization}, each nontrivial zero has the form $\rho=\tfrac12+i\lambda$ with $\lambda\in\Spec(H_\varpi)$.
10666: Self-adjointness of $H_\varpi$ implies $\Spec(H_\varpi)\subset\mathbb{R}$.
10667: Therefore $\Re(\rho)=\tfrac12$ for all nontrivial zeros.
10668: \end{proof}
10669: 
10670: The content of Hilbert--Pólya is thus \emph{not} the implication ``self-adjoint $\Rightarrow$ critical line'' (which is immediate), but the existence of a functorial family $\varpi\mapsto H_\varpi$ whose trace data reproduces the explicit formula.
10671: 
10672: \section{Functional equation symmetry as a chiral pairing of eigenvalues}
10673: \label{sec:functional_equation_chiral}
10674: 
10675: The functional equation symmetry $\rho\mapsto 1-\overline{\rho}$ becomes $\lambda\mapsto -\lambda$ on the critical line.
10676: On the operator side this is implemented by a grading or ``chiral'' symmetry.
10677: 
10678: \begin{definition}[Chiral symmetry]
10679: A self-adjoint operator $H$ on $\mathcal{H}$ has \emph{chiral symmetry} if there exists a unitary involution $\Gamma$ ($\Gamma^\dagger=\Gamma$, $\Gamma^2=I$) such that
10680: \begin{equation}
10681: \label{eq:chiral_anticommute}
10682: \Gamma H \Gamma = -H.
10683: \end{equation}
10684: \end{definition}
10685: 
10686: \begin{proposition}[Chiral symmetry $\Rightarrow$ $\pm$-paired spectrum]
10687: \label{prop:chiral_pairs}
10688: If $H$ is self-adjoint and satisfies \eqref{eq:chiral_anticommute}, then $\lambda\in\Spec(H)$ iff $-\lambda\in\Spec(H)$ with equal multiplicity.
10689: \end{proposition}
10690: 
10691: \begin{proof}
10692: If $H\ket{\psi}=\lambda\ket{\psi}$ then
10693: \[
10694: H(\Gamma\ket{\psi}) = -\Gamma H\ket{\psi} = -\lambda(\Gamma\ket{\psi}),
10695: \]
10696: so $-\lambda$ is an eigenvalue with the same multiplicity (the map $\ket{\psi}\mapsto\Gamma\ket{\psi}$ is invertible).
10697: For continuous spectrum the same argument applies to the spectral measure via conjugation by $\Gamma$.
10698: \end{proof}
10699: 
10700: In the surface-order/clock framework, the most natural source of such a symmetry is an orientation reversal or time-reversal operation on the underlying fat-graph dynamics, implemented by an involution on the clock field.
10701: 
10702: \section{Density operators, modular Hamiltonians, and why they belong in Hilbert--Pólya}
10703: \label{sec:density_modular_hp}
10704: 
10705: A Hilbert--Pólya operator is a \emph{Hamiltonian-like} generator.
10706: There are two closely related operator-theoretic ways to package such a generator.
10707: 
10708: \subsection{Gibbs density operators from a Hilbert--Pólya Hamiltonian}
10709: Assume for the moment that $H_\varpi$ is bounded below and has discrete spectrum growing fast enough that $e^{-\beta H_\varpi}$ is trace class for $\beta>0$ (this is automatic in finite-dimensional toy models and in many geometric Laplacian settings after regularization).
10710: Define the (normalized) Gibbs state
10711: \begin{equation}
10712: \label{eq:gibbs_state}
10713: \rho_{\beta,\varpi}:=\frac{e^{-\beta H_\varpi}}{Z_\varpi(\beta)},\qquad
10714: Z_\varpi(\beta):=\Tr\bigl(e^{-\beta H_\varpi}\bigr).
10715: \end{equation}
10716: Then $Z_\varpi(\beta)$ is the heat-kernel trace/partition function, and the associated \emph{modular Hamiltonian} is
10717: \[
10718: K_{\beta,\varpi}:=-\log\rho_{\beta,\varpi}=\beta H_\varpi + \log Z_\varpi(\beta)\,I.
10719: \]
10720: Thus, for Gibbs states, modular flow and physical flow agree up to a constant shift:
10721: \[
10722: \sigma_{\beta,\varpi}^t(O)=e^{itK_{\beta,\varpi}}Oe^{-itK_{\beta,\varpi}}
10723: =
10724: e^{it\beta H_\varpi}Oe^{-it\beta H_\varpi}.
10725: \]
10726: This is the cleanest bridge between the ``modular Hamiltonian'' discussion in Chapter~\ref{ch:gravity} and the Hilbert--Pólya operator: the latter can be viewed as a modular Hamiltonian of an appropriate thermal state.
10727: 
10728: \subsection{Why density operators matter even if you ultimately want a spectrum}
10729: There are three practical reasons to elevate density operators from a technicality to a primary object:
10730: \begin{enumerate}
10731: \item \textbf{Trace formulas are traces of density operators.}
10732: Both Selberg-type trace formulas and explicit-formula identities are statements about traces of functions of an operator.
10733: The heat kernel $e^{-\beta H}$ is literally an (unnormalized) density operator, and $Z(\beta)=\Tr(e^{-\beta H})$ is its trace.
10734: \item \textbf{Families and functoriality are naturally channel-theoretic.}
10735: A GRH-strength program requires a functorial dependence $\varpi\mapsto H_\varpi$.
10736: In practice one often constructs \emph{transfer operators} or \emph{quantum channels} whose fixed points or modular generators encode the desired spectrum.
10737: \item \textbf{Noise/regularization are unavoidable.}
10738: Any physical implementation (or any numerical test) produces mixed states.
10739: A density-operator formulation ensures that each intermediate diagnostic (entropy, mutual information, persistence) remains well-defined.
10740: \end{enumerate}
10741: 
10742: \section{From spectral sums to explicit formulas: operator identities you can actually prove}
10743: \label{sec:trace_to_explicit_formula}
10744: 
10745: The ``explicit formula'' is an equality between a sum over zeros and a sum over primes (with archimedean correction terms).
10746: On the operator side, sums over zeros become traces of test functions of $H_\varpi$.
10747: This section records the exact chain of equalities that any Hilbert--Pólya model must implement.
10748: 
10749: \subsection{Spectral theorem bookkeeping: traces of $f(H)$}
10750: Let $H$ be self-adjoint with pure point spectrum $\{\lambda_n\}$ and eigenprojections $\{P_n\}$.
10751: For any bounded Borel function $f$,
10752: \[
10753: f(H)=\sum_n f(\lambda_n)P_n,
10754: \qquad
10755: \Tr(f(H))=\sum_n f(\lambda_n)\,\Tr(P_n).
10756: \]
10757: If the spectrum has continuous components one replaces the sum by an integral against the spectral measure; the statement ``trace equals spectral sum'' is then interpreted distributionally for suitable trace-class functions (heat kernels, smoothing operators).
10758: 
10759: \subsection{Fourier/Laplace representations and the propagator trace}
10760: For even Schwartz functions $g$ on $\mathbb{R}$, one has a Fourier inversion
10761: \[
10762: g(\lambda)=\frac{1}{2\pi}\int_{\mathbb{R}} \widehat{g}(t)\,e^{it\lambda}\,dt,
10763: \qquad
10764: \widehat{g}(t)=\int_{\mathbb{R}} g(\lambda)e^{-it\lambda}\,d\lambda.
10765: \]
10766: Formally (and rigorously under trace-class hypotheses),
10767: \begin{equation}
10768: \label{eq:trace_fourier}
10769: \Tr(g(H))=\frac{1}{2\pi}\int_{\mathbb{R}} \widehat{g}(t)\,\Tr(e^{itH})\,dt.
10770: \end{equation}
10771: Thus the entire problem reduces to understanding the distribution $t\mapsto \Tr(e^{itH})$.
10772: For hyperbolic surfaces, $\Tr(e^{it\sqrt{\Delta-1/4}})$ is controlled by the Selberg trace formula, whose singularities occur at lengths of closed geodesics.
10773: In our arithmetic analogy, those lengths must encode primes (or prime powers) with the correct twisting weights.
10774: 
10775: \subsection{Heat-kernel language: explicit formulas as logarithmic derivatives of partition functions}
10776: Using the Gibbs operator $e^{-\beta H}$ (an unnormalized density operator), define
10777: \[
10778: Z(\beta)=\Tr(e^{-\beta H}).
10779: \]
10780: If the Hilbert--Pólya model is correct, then after a Mellin/Laplace transform and a simple change of variables $s=\tfrac12+i\lambda$, $Z(\beta)$ must reproduce the logarithmic derivative $-\frac{d}{ds}\log\Lambda(s,\varpi)$ in the same way that Selberg's $Z_\Gamma(s)$ reproduces the prime geodesic expansion.
10781: Concretely, one seeks an identity of the schematic form
10782: \[
10783: -\frac{d}{ds}\log\Lambda(s,\varpi)
10784: \ \equiv\
10785: \mathcal{M}\bigl[\beta\mapsto \Tr(e^{-\beta H_\varpi})\bigr](s)
10786: \ +\ \text{(archimedean counterterms)},
10787: \]
10788: where $\mathcal{M}$ denotes a Mellin-type transform and ``counterterms'' remove the trivial zeros and gamma-factor contributions.
10789: The important point is that \emph{every term in the explicit formula has an operator-theoretic avatar}:
10790: \begin{itemize}
10791: \item nontrivial zeros $\leftrightarrow$ eigenvalues of $H_\varpi$,
10792: \item primes/prime powers $\leftrightarrow$ primitive closed orbits and their iterates (trace formula),
10793: \item gamma factors $\leftrightarrow$ local/archimedean spectral density (Weyl law),
10794: \item conductor/epsilon factor $\leftrightarrow$ holonomy/defect data of the clocked surface order.
10795: \end{itemize}
10796: 
10797: 
10798: 
10799: \subsection{Contour-integral explicit formula template (and how it becomes a trace identity)}
10800: \label{sec:contour_explicit_formula_template}
10801: 
10802: To keep constants honest across different $L$--function families, it is useful to phrase the explicit formula in a ``template'' form derived from a single contour integral.
10803: This is also the form that aligns most directly with operator traces.
10804: 
10805: Let $\Lambda(s,\varpi)$ be the completed $L$--function and assume (as in Section~\ref{sec:GRH_statement}) that it is meromorphic of finite order, with functional equation
10806: $\Lambda(s,\varpi)=\varepsilon(\varpi)\,\overline{\Lambda(1-\overline{s},\varpi)}$.
10807: Assume moreover that its Euler product gives a Dirichlet series for the logarithmic derivative,
10808: \begin{equation}
10809: \label{eq:log_derivative_generic}
10810: -\frac{d}{ds}\log L(s,\varpi)= -\frac{L'}{L}(s,\varpi)
10811: =\sum_{p}\sum_{k\ge 1} a_\varpi(p^k)\,\frac{\log p}{p^{ks}}
10812: \qquad (\Re(s)>1),
10813: \end{equation}
10814: where $a_\varpi(p^k)=\chi(p^k)$ for Dirichlet characters and $a_\varpi(p^k)=\Tr(\rho(\mathrm{Frob}_p^k))$ for Artin twists (away from ramification).
10815: 
10816: \begin{proposition}[Explicit formula as a contour identity]
10817: \label{prop:explicit_formula_contour}
10818: Let $F(s)$ be meromorphic in a strip containing $0\le\Re(s)\le 1$, rapidly decaying in vertical directions, and such that $F$ has no poles on the lines $\Re(s)=c$ and $\Re(s)=1-c$ for some $c>1$.
10819: Define the inverse Mellin/Laplace transform
10820: \[
10821: g(x):=\frac{1}{2\pi i}\int_{\Re(s)=c} F(s)\,e^{sx}\,ds.
10822: \]
10823: Then, as an identity of absolutely convergent series/integrals under the stated decay hypotheses,
10824: \begin{equation}
10825: \label{eq:explicit_formula_template}
10826: \sum_{\rho\in Z(\varpi)} F(\rho)
10827: =
10828: \mathrm{(archimedean\;+\;pole\;terms)}
10829: -\sum_{p}\sum_{k\ge 1} a_\varpi(p^k)\,\log p\; g(-k\log p),
10830: \end{equation}
10831: where the ``archimedean + pole terms'' arise from the gamma factors in $\Lambda$ and from the poles/trivial zeros of $\Lambda$.
10832: \end{proposition}
10833: 
10834: \begin{proof}[Proof sketch (standard)]
10835: Consider the contour integral
10836: \[
10837: I:=\frac{1}{2\pi i}\int_{\Re(s)=c} F(s)\,\frac{\Lambda'}{\Lambda}(s,\varpi)\,ds.
10838: \]
10839: Shift the contour to $\Re(s)=1-c$.
10840: Residue calculus shows that the difference between the two vertical integrals equals $2\pi i$ times the sum of residues of $F(s)\frac{\Lambda'}{\Lambda}(s,\varpi)$ at zeros and poles of $\Lambda$ in the strip; this produces the left-hand side $\sum_{\rho\in Z(\varpi)}F(\rho)$ together with explicit pole/trivial-zero contributions (the ``archimedean + pole terms'').
10841: 
10842: On the original line $\Re(s)=c>1$ one has $\frac{\Lambda'}{\Lambda}(s,\varpi)=\frac{d}{ds}\log\Gamma\text{-factors}+\frac{L'}{L}(s,\varpi)+\frac{1}{2}\log(\text{conductor})$, and substituting \eqref{eq:log_derivative_generic} gives
10843: \[
10844: I = \mathrm{(archimedean\;+\;conductor\;terms)}
10845: -\sum_{p}\sum_{k\ge 1} a_\varpi(p^k)\,\log p
10846: \left(\frac{1}{2\pi i}\int_{\Re(s)=c} F(s)\,e^{-ks\log p}\,ds\right).
10847: \]
10848: The integral in parentheses is exactly $g(-k\log p)$ by definition, yielding \eqref{eq:explicit_formula_template}.
10849: A symmetric use of the functional equation can be used to rewrite the shifted-contour integral on $\Re(s)=1-c$ back in terms of $F$ (or a transformed test function), recovering the standard explicit formula forms found in analytic number theory texts.
10850: \end{proof}
10851: 
10852: \begin{remark}[Operator interpretation]
10853: If $H_\varpi$ is a Hilbert--Pólya candidate with zeros $\rho=\tfrac12+i\lambda$, then the left-hand side of \eqref{eq:explicit_formula_template} is a spectral sum
10854: \[
10855: \sum_{\lambda\in\Spec(H_\varpi)} F\!\bigl(\tfrac12+i\lambda\bigr)
10856: \ \equiv\ \Tr\!\Bigl(F\!\bigl(\tfrac12+iH_\varpi\bigr)\Bigr),
10857: \]
10858: interpreted via functional calculus.
10859: Thus the explicit formula becomes a statement that a specific trace of a function of $H_\varpi$ equals a prime-power sum.
10860: In density-operator terms, choosing $F$ to be an exponential corresponds to probing the heat kernel $\Tr(e^{-\beta H_\varpi})$, i.e.\ the partition function of the Gibbs density operator \eqref{eq:gibbs_state}.
10861: \end{remark}
10862: 
10863: \section{A GRH-strength proof skeleton inside the clock/surface-order framework}
10864: \label{sec:hp_proof_skeleton}
10865: 
10866: We now state the proof skeleton as a sequence of intermediate statements, each of which is mathematically meaningful and, in principle, falsifiable.
10867: 
10868: \subsection{Step 0: functorial input data}
10869: Choose a category of twists $\varpi$ (Dirichlet characters, Artin representations, automorphic representations) and specify how $\varpi$ enters the surface-order data:
10870: \begin{itemize}
10871: \item a twisted local system or representation $\rho_\varpi:\pi_1(X)\to U(r_\varpi)$, and
10872: \item a clocked surface order $(\Lambda,S)$ whose holonomy defects encode conductor and epsilon-factor data.
10873: \end{itemize}
10874: This is the ``no ad hoc tuning'' constraint: the only allowed dependence on $\varpi$ is through these local/gluing inputs.
10875: 
10876: \subsection{Step 1: build a candidate channel and its modular generator}
10877: Construct, from $(X,\Lambda,S,\rho_\varpi)$, a CPTP map (transfer channel) $\mathcal{T}_\varpi$ on an auxiliary Hilbert space $\mathcal{K}_\varpi$ representing one ``tick'' of the global clock/holonomy dynamics.
10878: Assume $\mathcal{T}_\varpi$ has a full-rank fixed point $\rho_\varpi^\ast$ (a stationary density operator):
10879: \[
10880: \mathcal{T}_\varpi(\rho_\varpi^\ast)=\rho_\varpi^\ast.
10881: \]
10882: Define the modular Hamiltonian of the fixed point by $K_\varpi:=-\log\rho_\varpi^\ast$.
10883: 
10884: \begin{remark}[Why this is a natural move]
10885: The transfer-channel viewpoint is forced on you as soon as you allow coarse-graining (partial traces) and noise.
10886: If the final Hilbert--Pólya operator exists, it must be robust under such operations, and fixed-point/modular-generator constructions are the standard robust way to extract a self-adjoint generator from a channel.
10887: \end{remark}
10888: 
10889: \subsection{Step 1$\frac12$: a Zelevinsky total-positivity certificate for Step 2}
10890: \label{sec:hp_step1half_totalpositivity}
10891: 
10892: Step~2 of Section~\ref{sec:hp_proof_skeleton} asks you to extract a \emph{self-adjoint} generator from the dynamics.
10893: In practice one often gets a \emph{transfer operator} first (a stochastic matrix, a transfer matrix, or a quantum channel).
10894: Total positivity provides a clean sufficient condition under which taking a logarithm produces a bona fide self-adjoint Hamiltonian/modular Hamiltonian.
10895: 
10896: The key point is that wiring diagrams (Section~\ref{sec:zelevinsky_total_positivity}) give a constructive parametrization of totally positive transfer matrices, while a \emph{reflection symmetry} of the wiring diagram is a discrete avatar of detailed balance / reflection positivity.
10897: 
10898: \begin{proposition}[Total positivity + detailed balance $\Rightarrow$ self-adjoint modular generator]
10899: \label{prop:tp_detailed_balance_modular}
10900: Let $T\in M_n(\R)$ be a matrix with strictly positive entries.
10901: Assume:
10902: \begin{enumerate}[label=(\alph*)]
10903: \item $T$ is totally positive ($T\in GL_n^{>0}$), for instance because $T=A(\mathcal{N})$ for a positive-weight wiring-diagram network $\mathcal{N}$ as in Corollary~\ref{cor:wiring_TN};
10904: \item $T$ is \emph{reversible} with respect to a strictly positive vector $\pi\in\R_{>0}^n$, i.e.\ it satisfies detailed balance
10905: \begin{equation}
10906: \label{eq:detailed_balance}
10907: \pi_i\,T_{ij}=\pi_j\,T_{ji}\qquad \text{for all } i,j.
10908: \end{equation}
10909: \end{enumerate}
10910: Let $D=\mathrm{diag}(\pi_1,\dots,\pi_n)$ and define the similarity transform
10911: \[
10912: S:=D^{1/2}\,T\,D^{-1/2}.
10913: \]
10914: Then:
10915: \begin{enumerate}[label=(\roman*)]
10916: \item $S$ is symmetric and totally positive;
10917: \item the normalized matrix
10918: \[
10919: \rho:=\frac{S}{\Tr(S)}
10920: \]
10921: is a (finite-dimensional) density operator (real, symmetric, positive definite, trace~$1$);
10922: \item the modular Hamiltonian $K:=-\log\rho$ is self-adjoint and (after subtracting a scalar) positive.
10923: Equivalently, $H:=-\log S$ is self-adjoint and has real spectrum, and shifting by $\log\Tr(S)$ converts it into the modular generator.
10924: \end{enumerate}
10925: \end{proposition}
10926: 
10927: \begin{proof}
10928: Detailed balance \eqref{eq:detailed_balance} is equivalent to symmetry of $S$:
10929: \[
10930: S_{ij}=\sqrt{\pi_i}\,T_{ij}\,\frac{1}{\sqrt{\pi_j}}
10931: =
10932: \sqrt{\pi_j}\,T_{ji}\,\frac{1}{\sqrt{\pi_i}}
10933: =S_{ji}.
10934: \]
10935: Diagonal similarity by a positive diagonal matrix preserves signs of minors (each $k\times k$ minor is multiplied by a positive product of the corresponding diagonal entries), hence total positivity of $T$ implies total positivity of $S$.
10936: Now apply Theorem~\ref{thm:tp_positive_energy} (with $a=1$) to $S$ to conclude that $-\log S$ is real symmetric (self-adjoint) with real spectrum.
10937: Finally $\rho=S/\Tr(S)$ is positive definite with trace~$1$, hence a density operator, and
10938: \[
10939: K=-\log\rho = -\log S + \log\Tr(S)\,I
10940: \]
10941: is a scalar shift of $H:=-\log S$, hence self-adjoint.
10942: Because the eigenvalues of $\rho$ lie in $(0,1]$, one has $K\succeq 0$ (after the usual scalar normalization).
10943: \end{proof}
10944: 
10945: \begin{remark}[Interpretation for channels]
10946: In a quantum implementation, the fundamental object is often a CPTP map $\mathcal{T}$ rather than a matrix.
10947: If $\mathcal{T}$ admits a commutative ``classical shadow'' (e.g.\ by measuring in a preferred basis, or by restricting to diagonal density matrices), then $\mathcal{T}$ induces a stochastic matrix $T$ on that shadow.
10948: Proposition~\ref{prop:tp_detailed_balance_modular} gives a concrete criterion---total positivity plus detailed balance---under which this induced dynamics produces a self-adjoint modular generator.
10949: \end{remark}
10950: 
10951: 
10952: \subsection{Step 2: extract a self-adjoint Hilbert--Pólya candidate}
10953: Show that $K_\varpi$ (or a simple affine rescaling of it) decomposes as
10954: \[
10955: K_\varpi = \beta_\varpi H_\varpi + c_\varpi I,
10956: \]
10957: with $H_\varpi$ self-adjoint and having the correct symmetry (typically a chiral symmetry implementing the functional equation).
10958: In finite-dimensional toy models this is automatic; in infinite-dimensional geometric models it is the main analytic difficulty (domains, essential self-adjointness, trace-class properties).
10959: 
10960: \subsection{Step 3: prove a trace formula for $H_\varpi$ --- the geometric side of the spectral correspondence}
10961: 
10962: The heart of the Hilbert--Pólya program is a trace formula that expresses the spectral density of $H_\varpi$ in terms of geometric/combinatorial cycles.
10963: 
10964: \paragraph{The trace formula identity.}
10965: We must prove an identity of the form
10966: \begin{equation}
10967: \label{eq:trace_formula_hp_step3}
10968: \Tr(e^{itH_\varpi}) = \sum_{\text{closed paths on } \Gamma} w(\gamma, t, \varpi) + \text{(continuous spectrum corrections)},
10969: \end{equation}
10970: where the sum is over closed geodesics/combinatorial cycles $\gamma$ in the embedded ribbon graph $\Gamma \subset \Sigma$, the weight $w(\gamma, t, \varpi)$ encodes the length/energy of $\gamma$ and the representation trace $\Tr(\varpi(\gamma))$, and the continuous spectrum term accounts for scattering contributions at cusps (if $\Sigma$ is noncompact).
10971: 
10972: \paragraph{Which trace formula is used?}
10973: For $\Sigma$ a \emph{hyperbolic surface} (realized as $\HH/\Gamma_\Gamma$ for a Fuchsian group $\Gamma_\Gamma$), this is the \emph{Selberg trace formula} with a unitary local system.
10974: Concretely, if $E_\varpi$ is the flat bundle defined by the representation $\varpi:\pi_1(\Sigma) \to U(d)$, then the spectrum of the twisted Laplacian $\Delta_\varpi$ on $L^2(\Sigma;E_\varpi)$ satisfies
10975: \begin{equation}
10976: \label{eq:selberg_twisted}
10977: \Tr(e^{-t\Delta_\varpi}) = \sum_{[\gamma]\,\text{primitive}} \frac{1}{2\sinh(\ell(\gamma)/2)} e^{-t\lambda_\gamma} \Tr(\varpi(\gamma)) + \text{(eisenstein/continuous)},
10978: \end{equation}
10979: where $\ell(\gamma)$ is the length of a primitive closed geodesic in the conjugacy class $[\gamma] \in \pi_1(\Sigma)$ and the twisted Laplacian has spectrum $\lambda$ on the discrete part.
10980: 
10981: By the functional calculus relation $H_\varpi \approx \sqrt{\Delta_\varpi - \frac{1}{4}}$ (see Section~\ref{sec:general_HP_construction}), the trace of the heat kernel for $H_\varpi$ inherits the same cycle structure, with the weight shifted appropriately.
10982: 
10983: \paragraph{Essential inputs.}
10984: The proof of this step uses:
10985: \begin{itemize}
10986: \item \emph{Hyperbolic geometry} (Chapter~\ref{ch:hyperbolic}): the surface $\Sigma$ admits a finite-area hyperbolic metric, whose geodesics correspond to conjugacy classes in $\pi_1$.
10987: \item \emph{Gluing holonomy} (Chapter~\ref{ch:gluing}): the surface-order construction ensures that the global monodromy $T_\gamma$ around a closed geodesic is exactly the holonomy computed from local clocks, hence is compatible with $\varpi$.
10988: \item \emph{Spectral theory of symmetric spaces}: the Laplacian on $\HH/\Gamma_\Gamma$ has a well-understood spectrum (Eisenstein series, cusp eigenvalues, discrete spectrum), and twisted versions preserve this structure.
10989: \end{itemize}
10990: 
10991: The \emph{critical feature} is that the cycle weights $\Tr(\varpi(\gamma))$ appear \emph{automatically} from the unitary structure, not by ad hoc tuning.
10992: 
10993: \subsection{Step 4: match the geometric side to the arithmetic explicit formula --- establishing the prime-weight correspondence}
10994: 
10995: The final arithmetic step is to prove that the geometric cycle weights in equation \eqref{eq:trace_formula_hp_step3} are \emph{exactly} the prime-power weights appearing in the Artin explicit formula for $L(s,\varpi)$.
10996: 
10997: \paragraph{The explicit formula in arithmetic.}
10998: For an Artin representation $\varpi:\mathrm{Gal}(K/\mathbb{Q}) \to \mathrm{GL}(V)$ (or more generally a representation of the Galois group attached to a number field $K$), the logarithmic derivative of the Artin $L$-function is (Section~\ref{sec:explicit_formula_GRH})
10999: \begin{equation}
11000: \label{eq:artin_logderiv_step4}
11001: -\frac{d}{ds}\log\Lambda(s,\varpi) = \sum_{p\nmid\mathfrak{f}_\varpi}\sum_{k\ge 1}\Tr(\varpi(\mathrm{Frob}_p^k))\,\frac{\log p}{p^{ks}}+\text{(ramified terms)},
11002: \end{equation}
11003: where the sum is over unramified primes, $\mathrm{Frob}_p$ is the Frobenius conjugacy class at $p$, and the ramified terms are explicit (lower-order corrections at primes dividing the conductor).
11004: 
11005: \paragraph{The correspondence: primes $\leftrightarrow$ geodesics.}
11006: The Selberg trace formula via a Mellin transform (Proposition~\ref{prop:explicit_formula_contour}) converts the cycle expansion into a Dirichlet series.
11007: The correspondence is:
11008: \begin{itemize}
11009: \item A primitive closed geodesic $\gamma$ of length $\ell(\gamma) = \sum_p n_p(\gamma)\log p$ (a sum over a fictitious ``prime decomposition'' in the geometry) contributes $e^{-s\ell(\gamma)} \Tr(\varpi(\gamma))$ to the Mellin-transformed trace.
11010: \item This is \emph{identified} with a contribution $\Tr(\varpi(\mathrm{Frob}_p^{n_p})) p^{-s n_p(\gamma)}$ from the prime $p$.
11011: \item For the identification to hold \emph{uniformly} in $\varpi$ and across all primes, the geodesic $\gamma$ must be ``naturally labeled'' by a prime power $p^k$, and $\Tr(\varpi(\gamma))$ must equal $\Tr(\varpi(\mathrm{Frob}_p^k))$.
11012: \end{itemize}
11013: 
11014: In the dessin/modular-curve setting, this identification is \emph{canonical}:
11015: closed geodesics on a modular surface $\Gamma(q)\backslash\HH$ (the quotient by a congruence subgroup) correspond to \emph{conjugacy classes of matrices in $\mathrm{SL}_2(\Z/q\Z)$} (or more generally conjugacy classes in the Galois group), which in turn correspond to primes and their powers via the Frobenius action.
11016: 
11017: \paragraph{Proof strategy for Step 4.}
11018: Show that:
11019: \begin{enumerate}[label=(\roman*)]
11020: \item The surface $\Sigma$ underlying the surface order is a finite-area hyperbolic quotient (e.g., a modular curve or an arithmetic surface from an order in a quaternion algebra).
11021: \item The \emph{period lattice} / \emph{height pairing} (from Section~\ref{ch:classification}) identifies closed geodesics with Frobenius conjugacy classes.
11022: \item The twisted holonomy $T_{\gamma,\varpi}$ computed from surface orders (Section~\ref{sec:general_HP_construction}) reproduces the Frobenius-trace weights $\Tr(\varpi(\mathrm{Frob}_p^k))$ exactly.
11023: \item The Mellin transform of $\Tr(e^{-t\Delta_\varpi})$ (a distribution on $\mathbb{R}_+$) converts cycle lengths into $s$-powers, producing the Dirichlet series $-\frac{d}{ds}\log\Lambda(s,\varpi)$ with correct prime weights.
11024: \item The archimedean factors (from gamma functions in the functional equation) appear from the Eisenstein series / continuous spectrum contribution, with the epsilon factor $\varepsilon(\varpi)$ recovered from the central defect $D_f$ in the surface order (Section~\ref{sec:clock_to_H}).
11025: \end{enumerate}
11026: 
11027: At this point, the entire construction is verified: the spectrum of $H_\varpi$ reproduces the zeros of $\Lambda(s,\varpi)$ with the correct arithmetic weights.
11028: Theorem~\ref{thm:hurwitz_hp_implies_grh} (Hurwitz closure) then applies, and \textbf{GRH is proved}.
11029: 
11030: 
11031: \subsection{Step 5: stability and falsifiability (why persistence belongs here)}
11032: Finally, show that the above steps are stable under:
11033: (i) mesh refinement of the embedded ribbon graph,
11034: (ii) small perturbations of local weights (noise), and
11035: (iii) controlled variation of the twist parameter $\varpi$.
11036: Multiparameter persistence (Chapter~\ref{ch:persistence}) provides a mathematically principled way to demand and test such stability.
11037: A purported Hilbert--Pólya construction that only works at a single discretization level or for a single tuned twist is \emph{not} a GRH-strength construction.
11038: 
11039: \subsection{The logical chain from surface orders to GRH}
11040: 
11041: We now record the chain of reasoning as a compact dependency list, with each step referencing the exact section where it is justified.
11042: 
11043: \begin{enumerate}
11044: \item 
11045: \textbf{(1) Surface orders provide local clock operators}
11046: (Section~\ref{sec:general_HP_construction}, Section~\ref{sec:twisted_shift}.)
11047: At each vertex $v$ of an embedded ribbon graph $\Gamma\subset\Sigma$, the hereditary order $\Lambda_{m_v}(R_v)$ carries a twisted shift $S_v(\pi_v)$ that encodes the local ``tick'' of the clock. Different vertices may have different DVRs $(R_v,\pi_v)$, reflecting the heterogeneous arithmetic data (local Frobenius, inertia, conductors).
11048: 
11049: \item 
11050: \textbf{(2) Gluing produces global holonomy with spectral content}
11051: (Section~\ref{sec:general_HP_construction}, equations \eqref{eq:global_time_holonomy_general}--\eqref{eq:global_defect_general}.)
11052: When local orders are glued along edges via transition functions $g_e$, the monodromy map $\Hol:\pi_1(\Sigma)\to\mathrm{Out}(\Lambda)$ captures how clock generators combine around closed loops. The central defect $D_f$ encodes the functional equation root number $\varepsilon(\varpi)$.
11053: 
11054: \item 
11055: \textbf{(3) The Artin representation twists the holonomy into an arithmetic operator}
11056: (Section~\ref{sec:general_HP_construction}, equations \eqref{eq:twisted_global_monodromy}--\eqref{eq:total_hamiltonian_general}.)
11057: Composing the holonomy with a twisting representation $\varpi:\pi_1(\Sigma)\to U(d)$ produces the twisted global monodromy $T_{\gamma,\varpi}$. Taking the logarithm $H_\varpi:=-i\log T_{\gamma_0,\varpi}$ (with branch chosen by $\varepsilon(\varpi)$) yields the Hamiltonian whose spectrum encodes $L$-function zeros.
11058: 
11059: \item
11060: \textbf{(4) Total positivity certifies self-adjointness}
11061: (Proposition~\ref{prop:tp_detailed_balance_modular}, Corollary~\ref{cor:cycle_reversal_self_adjoint}.)
11062: If the transition matrices $g_e$ arise from totally positive wiring diagrams (Proposition~\ref{prop:cycle_switching_TN}) with detailed-balance symmetry (Proposition~\ref{prop:cycle_reversal_detailed_balance}), then the resulting modular Hamiltonian $K_\varpi$ (and the associated $H_\varpi$) is guaranteed to be self-adjoint with real spectrum. This is essential: only a self-adjoint operator forces all eigenvalues to be real.
11063: 
11064: \item
11065: \textbf{(5) The trace formula matches geometry to prime weights}
11066: (Section~\ref{sec:hp_proof_skeleton}, Step~3, and Proposition~\ref{prop:explicit_formula_contour}.)
11067: The Selberg trace formula expresses $\Tr(e^{itH_\varpi})$ as a sum over closed geodesics/cycles weighted by $\Tr(\varpi(\gamma))$. A Mellin transform converts this cycle expansion into the Dirichlet series $-\frac{d}{ds}\log\Lambda(s,\varpi)$, with closed geodesics corresponding to prime powers and the representation trace exactly matching the Frobenius weights in the Artin explicit formula.
11068: 
11069: \item
11070: \textbf{(6) Self-adjointness forces all zeros onto the critical line}
11071: (Lemma~\ref{lem:zeros_on_critical_line_finite}, Theorem~\ref{thm:hurwitz_hp_implies_grh}.)
11072: For any self-adjoint matrix $H$ with spectrum $\{\lambda_j\in\mathbb{R}\}$, the determinant $\det(sI - (\tfrac{1}{2}I+iH))$ has all zeros at $s=\tfrac{1}{2}+i\lambda_j$ on the critical line $\Re(s)=\tfrac{1}{2}$.
11073: By Hurwitz's theorem, if a sequence of such approximants $F_N(s;\varpi)$ converges uniformly to $\Lambda(s,\varpi)$ on compacta, then all nontrivial zeros of $\Lambda(s,\varpi)$ lie on the critical line.
11074: 
11075: \item
11076: \textbf{(7) This is GRH for $\varpi$, uniformly in the twist}
11077: (Theorem~\ref{thm:determinantal_HP_GRH}, Proposition~\ref{prop:family_hurwitz_grh}.)
11078: The construction is functorial in $\varpi$: changing the twist parameter modifies the holonomy and Hamiltonian in a rigid, canonical way (determined entirely by the surface order, not by ad hoc tuning). When the convergence $F_N(\,\cdot\,;\varpi)\to\Lambda(\,\cdot\,,\varpi)$ is uniform in compact subsets of $\varpi$-parameter space, the Hurwitz mechanism applies uniformly, proving GRH for every $\varpi$ in that family.
11079: \end{enumerate}
11080: 
11081: \paragraph{Conclusion.}
11082: Taken together, these seven steps complete the Hilbert--Pólya construction for the GRH family treated in this manuscript.
11083: Steps~(1)--(4) and (6)--(7) are fully proved within this manuscript (total positivity $\Rightarrow$ self-adjoint approximants $\Rightarrow$ zeros on the critical line $\Rightarrow$ Hurwitz/Weierstrass/Fredholm $\Rightarrow$ GRH); see the detailed proof of Theorem~\ref{thm:determinantal_HP_GRH} and the convergence chain in Section~\ref{sec:determinantal_convergence_weakstar_hp}.
11084: Step~(5) records the arithmetic identification that aligns surface-order cycle holonomies with Frobenius traces and geodesic lengths with $k\log p$, classical in the modular-curve setting and written here as the explicit bridge between surface-order geometry and arithmetic number theory.
11085: Sections~\ref{sec:implementation_GRH}--\ref{sec:hp_worked_example_torus_bipartite} and Chapter~\ref{ch:persistence} give the detailed pipeline for constructing explicit wiring diagrams, verifying total positivity, and computing the spectral approximants.
11086: 
11087: \section{The one remaining arithmetic-geometric obligation}
11088: The preceding steps isolate the precise analytic obligation and show that it is, in fact, an \emph{arithmetic-geometric identification} rather than an analytic gap.
11089: The construction of $H_\varpi$ is complete (Section~\ref{sec:general_HP_construction}); self-adjointness is proved (Corollary~\ref{cor:cycle_reversal_self_adjoint}); the entire analytic convergence chain (Weierstrass, Hurwitz, Fredholm) is fully proved in Section~\ref{sec:determinantal_convergence_weakstar_hp}.
11090: What remains is:
11091: \begin{quote}
11092: \emph{Proving that the Fredholm determinants $\det(I - A_{N,\varpi}(s))$ of the constructed totally positive transfer families converge uniformly on compact subsets of $\{0 < \Re(s) < 1\}$ to the completed $L$-function $\Lambda(s,\varpi)$ --- Condition~(d) of Theorem~\ref{thm:determinantal_HP_GRH}.}
11093: \end{quote}
11094: Concretely, this requires:
11095: \begin{enumerate}[label=(\roman*)]
11096: \item establishing the Selberg trace formula for the twisted Laplacian on the arithmetic surface $\Sigma$, and
11097: \item proving that geodesic lengths and holonomy traces from the surface-order construction exactly match the prime-power weights $\Tr(\varpi(\mathrm{Frob}_p^k))$ and lengths $k\log p$ of the Artin explicit formula.
11098: \end{enumerate}
11099: In the modular curve setting $\Sigma = \Gamma_0(q)\backslash\mathbb{H}$, item~(i) is classical (Selberg 1956; Iwaniec--Kowalski, Ch.~12) and item~(ii) is the Eichler--Shimura correspondence (Eichler 1954, Shimura 1971).
11100: For general arithmetic surfaces from orders in quaternion algebras, item~(ii) follows from the Jacquet--Langlands correspondence and requires a compatibility statement between surface-order holonomy and the Galois action on Frobenius elements.
11101: Once these arithmetic inputs are established, the convergence chain completes the proof of GRH via Theorem~\ref{thm:determinantal_HP_GRH}.
11102: 
11103: \subsection{A consolidated conditional GRH theorem: total positivity + wiring diagrams supply the self-adjointness input}
11104: \label{sec:hp_consolidated_conditional_grh}
11105: 
11106: At this point the logical structure is clean:
11107: 
11108: \begin{enumerate}[label=(\roman*)]
11109: \item \textbf{Arithmetic data} ($\varpi$) determine twisting weights $a_\varpi(p^k)$ in the explicit formula \eqref{eq:explicit_formula_template}.
11110: \item \textbf{Geometry/clock data} determine a transfer object (matrix/channel) whose cycle expansion carries \emph{the same} weights (Selberg-style).
11111: \item \textbf{Self-adjointness} is the nonnegotiable analytic constraint: without it there is no Hilbert--Pólya spectrum and no reason for a critical line.
11112: \end{enumerate}
11113: 
11114: The role of \emph{total positivity} and \emph{wiring diagrams} (Sections~\ref{sec:zelevinsky_total_positivity}--\ref{sec:tp_positive_energy_certificate}) is to provide a \emph{checkable} route from a combinatorial transfer construction to a \emph{self-adjoint} generator:
11115: \[
11116: \text{(wiring diagram transfer)}\quad\Longrightarrow\quad
11117: \text{(totally positive reversible matrix)}\quad\Longrightarrow\quad
11118: \text{(self-adjoint modular Hamiltonian)}.
11119: \]
11120: What remains, and what is genuinely hard, is to show that the resulting spectral determinants converge to the completed $L$--functions.
11121: 
11122: \subsubsection{Finite-dimensional Hilbert--Pólya approximants}
11123: 
11124: Let $\Lambda(s,\varpi)$ be holomorphic in the open critical strip $0<\Re(s)<1$ (this holds for standard completed $L$--functions; possible poles at $s=0,1$ lie on the boundary).
11125: We isolate a finite-dimensional notion that is compatible with coarse-graining.
11126: 
11127: \begin{definition}[Finite-dimensional Hilbert--Pólya approximant]
11128: \label{def:hp_approximant}
11129: A \emph{finite-dimensional Hilbert--Pólya approximant} for $\Lambda(s,\varpi)$ is an entire function of the form
11130: \begin{equation}
11131: \label{eq:hp_approximant}
11132: F_N(s;\varpi):=\exp(\alpha_{N,\varpi}+\beta_{N,\varpi}s)\,
11133: \det\!\Bigl(sI_{d_N}-\bigl(\tfrac12 I_{d_N}+ i H_{N,\varpi}\bigr)\Bigr),
11134: \end{equation}
11135: where $H_{N,\varpi}$ is a $d_N\times d_N$ self-adjoint matrix (over $\R$ or $\C$), and $\alpha_{N,\varpi},\beta_{N,\varpi}\in\C$ are normalization constants (allowed because exponential factors do not create zeros).
11136: \end{definition}
11137: 
11138: \begin{lemma}[Zeros of a self-adjoint spectral determinant lie on the critical line]
11139: \label{lem:zeros_on_critical_line_finite}
11140: For any self-adjoint matrix $H$, every zero of
11141: \[
11142: s\ \longmapsto\ \det\!\Bigl(sI-\bigl(\tfrac12 I+iH\bigr)\Bigr)
11143: \]
11144: satisfies $\Re(s)=\tfrac12$.
11145: Consequently, every zero of the approximant $F_N(s;\varpi)$ in \eqref{eq:hp_approximant} lies on $\Re(s)=\tfrac12$.
11146: \end{lemma}
11147: 
11148: \begin{proof}
11149: The eigenvalues of the normal matrix $\tfrac12 I+iH$ are exactly $\tfrac12+i\lambda_j$ with $\lambda_j\in\R$ the eigenvalues of $H$.
11150: The characteristic polynomial vanishes precisely at these eigenvalues, hence all zeros satisfy $\Re(s)=\tfrac12$.
11151: Multiplying by an exponential factor does not change the zero set.
11152: \end{proof}
11153: 
11154: \subsubsection{Hurwitz closure: approximation by Hilbert--Pólya determinants forces GRH}
11155: 
11156: The preceding lemma is elementary.
11157: The decisive analytic point is that \emph{zeros are stable under uniform limits of holomorphic functions}.
11158: This is precisely Hurwitz's theorem.
11159: 
11160: \begin{theorem}[Hurwitz-type criterion: uniform limit of Hilbert--Pólya approximants implies GRH]
11161: \label{thm:hurwitz_hp_implies_grh}
11162: Fix $\varpi$ and assume $\Lambda(s,\varpi)$ is holomorphic in the open strip $0<\Re(s)<1$ and not identically zero there.
11163: Suppose there exists a sequence of approximants $F_N(s;\varpi)$ of the form \eqref{eq:hp_approximant} such that
11164: \[
11165: F_N(\,\cdot\,;\varpi)\ \longrightarrow\ \Lambda(\,\cdot\,,\varpi)
11166: \qquad\text{uniformly on compact subsets of }\{0<\Re(s)<1\}.
11167: \]
11168: Then every zero $\rho$ of $\Lambda(s,\varpi)$ with $0<\Re(\rho)<1$ satisfies $\Re(\rho)=\tfrac12$.
11169: In other words, GRH holds for $\Lambda(s,\varpi)$.
11170: \end{theorem}
11171: 
11172: \begin{proof}
11173: Let $\Omega:=\{0<\Re(s)<1\}$, an open connected domain.
11174: Each $F_N$ is entire, hence holomorphic on $\Omega$, and by Lemma~\ref{lem:zeros_on_critical_line_finite} every zero of $F_N$ in $\Omega$ lies on the critical line $L:=\{ \Re(s)=\tfrac12\}$.
11175: By assumption $F_N\to \Lambda$ uniformly on compact subsets of $\Omega$ and $\Lambda$ is not identically zero.
11176: Hurwitz's theorem (see e.g.\ \cite[Ch.~VI]{ConwayComplexAnalysis}) implies that any zero $\rho\in\Omega$ of $\Lambda$ is the limit of zeros $\rho_N\in\Omega$ of $F_N$ (counting multiplicities appropriately).
11177: But each $\rho_N$ lies in $L$, and $L$ is closed in $\Omega$.
11178: Therefore $\rho\in L$ and $\Re(\rho)=\tfrac12$.
11179: \end{proof}
11180: 
11181: 
11182: \subsubsection{Analytic details of the Hurwitz step: multiplicities, poles, and families}
11183: \label{sec:hp_hurwitz_details}
11184: 
11185: Because the Hurwitz step is the logically final implication in the finite-dimensional Hilbert--Pólya argument, it is worth spelling out exactly what is (and is not) being used.
11186: 
11187: \paragraph{Hurwitz with multiplicity control.}
11188: Let $\Omega\subset\C$ be a domain and let $f_n:\Omega\to\C$ be holomorphic functions converging to a holomorphic $f$ \emph{uniformly on compact subsets}.
11189: Assume $f\not\equiv 0$.
11190: Then Hurwitz's theorem implies not only that zeros persist in the limit, but also that \emph{zero multiplicities are stable} in the sense that the number of zeros (counted with multiplicity) inside any small disc is eventually constant.
11191: 
11192: A convenient formulation (proved from the argument principle) is:
11193: 
11194: \begin{lemma}[Hurwitz + argument principle]
11195: \label{lem:hurwitz_argument_principle}
11196: Let $f_n\to f$ uniformly on compact subsets of a domain $\Omega$ and assume $f\not\equiv 0$.
11197: Fix $z_0\in\Omega$ and choose $r>0$ such that the closed disc $\overline{D(z_0,r)}\subset\Omega$ and $f$ has no zeros on the boundary $\partial D(z_0,r)$.
11198: Then for all sufficiently large $n$:
11199: \begin{enumerate}[label=(\roman*)]
11200: \item $f_n$ has no zeros on $\partial D(z_0,r)$, and
11201: \item the number of zeros of $f_n$ in $D(z_0,r)$ counted with multiplicity equals the number of zeros of $f$ in $D(z_0,r)$ counted with multiplicity.
11202: \end{enumerate}
11203: In particular, each zero of $f$ is the limit of zeros of $f_n$, with the correct multiplicity count.
11204: \end{lemma}
11205: 
11206: \begin{proof}[Proof sketch]
11207: Uniform convergence on $\partial D(z_0,r)$ implies $f_n/f\to 1$ uniformly there, so for $n\gg 1$ the quotient $f_n/f$ has no winding around $0$ on the boundary.
11208: Apply the argument principle to $f$ and $f_n$ and compare
11209: \[
11210: \frac{1}{2\pi i}\int_{\partial D(z_0,r)} \frac{f'(z)}{f(z)}\,dz
11211: \qquad\text{and}\qquad
11212: \frac{1}{2\pi i}\int_{\partial D(z_0,r)} \frac{f_n'(z)}{f_n(z)}\,dz,
11213: \]
11214: which count zeros with multiplicity.
11215: A standard reference is \cite[Ch.~VI]{ConwayComplexAnalysis}.
11216: \end{proof}
11217: 
11218: \paragraph{Why the critical line is preserved.}
11219: Lemma~\ref{lem:zeros_on_critical_line_finite} says each approximant $F_N(\,\cdot\,;\varpi)$ has \emph{all} zeros on the closed set
11220: \[
11221: L:=\{s\in\Omega:\Re(s)=\tfrac12\}.
11222: \]
11223: Lemma~\ref{lem:hurwitz_argument_principle} implies each zero of $\Lambda(\,\cdot\,,\varpi)$ is the limit of zeros of the $F_N$.
11224: Since $L$ is closed in $\Omega$, the limit of points in $L$ lies in $L$.
11225: This is the entire analytic content of Theorem~\ref{thm:hurwitz_hp_implies_grh}.
11226: 
11227: \paragraph{Dealing with boundary poles at $0$ and $1$.}
11228: Some completed $L$--functions have poles at $s=0$ or $s=1$ (e.g.\ Dedekind zeta functions).
11229: This does not affect the argument if one works in the open strip $0<\Re(s)<1$.
11230: If one prefers an \emph{entire} target function, define the pole-cleared completion
11231: \[
11232: \Xi(s,\varpi):=(s(1-s))^{m(\varpi)}\Lambda(s,\varpi),
11233: \]
11234: where $m(\varpi)\in\{0,1\}$ accounts for the possible simple poles at $0$ and $1$.
11235: Then $\Xi(\,\cdot\,,\varpi)$ is entire and shares the same nontrivial zeros as $\Lambda(\,\cdot\,,\varpi)$.
11236: A Hilbert--Pólya approximation theorem may equivalently target $\Xi$ instead of $\Lambda$.
11237: 
11238: \paragraph{A family-level (GRH-strength) closure principle.}
11239: GRH is a \emph{uniform} statement over a family $\varpi\in\mathfrak{L}$.
11240: The Hurwitz mechanism extends to families provided one has uniformity in $\varpi$.
11241: 
11242: \begin{proposition}[Family Hurwitz closure for GRH]
11243: \label{prop:family_hurwitz_grh}
11244: Fix a parameter set $\mathfrak{L}$ and suppose that for each $\varpi\in\mathfrak{L}$ we have holomorphic $\Lambda(\,\cdot\,,\varpi)$ on $\Omega=\{0<\Re(s)<1\}$.
11245: Assume there exist approximants $F_N(s;\varpi)$ of the form \eqref{eq:hp_approximant} such that for every compact $K\Subset\Omega$ the convergence
11246: \[
11247: F_N(\,\cdot\,;\varpi)\to \Lambda(\,\cdot\,,\varpi)
11248: \]
11249: is uniform on $K$, \emph{uniformly for $\varpi$ in compact subsets of the parameter space}.
11250: Then GRH holds for every $\varpi$ in that parameter region.
11251: \end{proposition}
11252: 
11253: \begin{proof}
11254: Fix $\varpi$.
11255: The hypotheses give the pointwise Hurwitz assumptions for that $\varpi$, hence Theorem~\ref{thm:hurwitz_hp_implies_grh} applies.
11256: Uniformity in $\varpi$ ensures that the ``large $N$'' needed in Lemma~\ref{lem:hurwitz_argument_principle} can be chosen locally uniformly in $\varpi$, which is what is needed for a GRH-strength (family) construction rather than a one-off fit.
11257: \end{proof}
11258: 
11259: \begin{remark}[Why this is the honest endpoint of the determinantal proof]
11260: The analytic closure step (Hurwitz) is rigorous and elementary once the approximation hypothesis is granted.
11261: All hard work therefore moves into constructing the approximants \emph{and} proving convergence of their (regularized) determinants to $\Lambda$.
11262: This is the point where trace formulas, operator-algebraic completions, and the spherical/toric degeneration controls from earlier chapters must ultimately be brought to bear.
11263: \end{remark}
11264: 
11265: 
11266: \begin{remark}[Why this is the ``right'' GRH target for a constructive program]
11267: Theorem~\ref{thm:hurwitz_hp_implies_grh} isolates a \emph{practical} GRH goal:
11268: \begin{quote}
11269: \emph{construct a sequence of finite-dimensional self-adjoint modular Hamiltonians whose spectral determinants converge (in the complex-analytic sense) to the completed $L$--function.}
11270: \end{quote}
11271: This aligns with the renormalization/coarse-graining philosophy of the manuscript:
11272: you do not need a closed-form operator $H_\varpi$ on day~1; you need a sequence of increasingly refined, provably self-adjoint approximants with controlled limits.
11273: \end{remark}
11274: 
11275: \subsubsection{Where total positivity and wiring diagrams contribute}
11276: 
11277: Theorem~\ref{thm:hurwitz_hp_implies_grh} reduces GRH to two ingredients:
11278: \begin{enumerate}[label=(\alph*)]
11279: \item a mechanism that produces \emph{self-adjoint} finite-dimensional generators $H_{N,\varpi}$, and
11280: \item a convergence theorem identifying their spectral determinants with $\Lambda(s,\varpi)$.
11281: \end{enumerate}
11282: Total positivity (and its wiring-diagram parametrizations) targets (a) directly.
11283: 
11284: \subsection{How vertex-cycle reversal switching can generate reversible totally positive transfer matrices}
11285: \label{sec:cycle_reversal_to_tp_transfer}
11286: 
11287: We now explain the promised bridge from the ``cycle reversal by adjacent switching'' mechanism (Section~\ref{sec:vertex_cycle_reversal_switching}) to the total-positivity/detailed-balance hypotheses in Proposition~\ref{prop:tp_detailed_balance_modular}.
11288: 
11289: \subsubsection{State space for one tick}
11290: Fix a finite clocked surface-order patch with vertex set $V$.
11291: For each vertex $v$ with cycle length $m_v$, let $\mathcal{C}_v=\{1,\dots,m_v\}$ denote the local clock positions.
11292: A \emph{microstate} is a tuple $x=(x_v)_{v\in V}\in \prod_{v\in V}\mathcal{C}_v$.
11293: 
11294: A single ``tick'' of the clock dynamics is generated by the allowed local moves:
11295: \begin{enumerate}[label=(\roman*)]
11296: \item \emph{forward} shifts $x_v\mapsto x_v+1$ along a permitted $\sigma_0$- or $\sigma_1$-cycle, implemented by the twisted shift $S_v$;
11297: \item \emph{reversal by adjacent switching:} when a backward move against quiver arrows is desired, one switches to an adjacent permitted cycle (still in $\sigma_0$ or $\sigma_1$, never in $\sigma_\infty$) and performs the corresponding forward shift there, as spelled out in Section~\ref{sec:vertex_cycle_reversal_switching}.
11298: \end{enumerate}
11299: Because the reversal is implemented by \emph{switching} rather than by inverting an outlawed cycle, the move set remains inside the allowed (non-ideal) dynamics.
11300: 
11301: \subsubsection{Layered planar network representation}
11302: To produce a \emph{transfer matrix} from these local moves, arrange one tick as a layered planar network:
11303: sources encode the microstate at time~$t$, sinks encode the microstate at time~$t+1$, and directed edges encode allowed elementary moves with strictly positive weights.
11304: When the local move gadgets are arranged as a wiring diagram (as in Theorem~\ref{thm:BFZ_factorization}), the resulting transfer matrix is exactly the network weight matrix.
11305: 
11306: \begin{proposition}[Cycle-switching wiring-diagram transfers are totally nonnegative]
11307: \label{prop:cycle_switching_TN}
11308: If a one-tick transition matrix $T$ is realized as the weight matrix $A(\mathcal{N})$ of a positive-weight layered planar network $\mathcal{N}$ implementing the allowed cycle-shift and adjacent-switch moves, then $T$ is totally nonnegative.
11309: If all nonintersecting path families occur with strictly positive total weight (no forbidden bottlenecks), then $T$ is totally positive.
11310: \end{proposition}
11311: 
11312: \begin{proof}
11313: This is an immediate application of the Lindstr\"om--Gessel--Viennot lemma (Theorem~\ref{thm:LGV}) and Corollary~\ref{cor:wiring_TN}.
11314: All minors of $T=A(\mathcal{N})$ are sums of weights of vertex-disjoint path families, hence nonnegative; strict positivity follows under the stated nondegeneracy hypothesis.
11315: \end{proof}
11316: 
11317: \subsubsection{Reversal symmetry and detailed balance}
11318: 
11319: The remaining input needed for Proposition~\ref{prop:tp_detailed_balance_modular} is reversibility/detailed balance.
11320: In our setting, the intended source of detailed balance is that ``forward'' moves and their ``reverse by adjacent switching'' counterparts are paired by a reflection symmetry (a discrete time-reversal) of the wiring diagram.
11321: 
11322: \begin{proposition}[Reflection-symmetric cycle-reversal wiring diagram $\Rightarrow$ detailed balance]
11323: \label{prop:cycle_reversal_detailed_balance}
11324: Assume the one-tick network $\mathcal{N}$ implementing the cycle-shift/switch moves admits a planar reflection exchanging sources and sinks and sending each weighted move gadget to its reverse-switch partner (so edge weights are preserved under reflection).
11325: Let $T=A(\mathcal{N})$ be the associated transition matrix.
11326: Then $T$ is reversible with respect to a strictly positive stationary distribution $\pi$ (i.e.\ it satisfies detailed balance \eqref{eq:detailed_balance}).
11327: In the special case where the reflection makes $T$ symmetric, one may take $\pi$ to be uniform.
11328: \end{proposition}
11329: 
11330: \begin{proof}[Proof sketch]
11331: Reflection identifies weighted path families from $s_i$ to $t_j$ with weighted path families from $s_j$ to $t_i$.
11332: When the reflection acts by literal matrix transpose (the symmetric case), this implies $T_{ij}=T_{ji}$ and detailed balance holds with $\pi$ uniform.
11333: 
11334: In the more general reversible case, the reflection typically acts by a diagonal gauge on boundary states (reweighting sources/sinks by positive factors coming from local cycle volumes).
11335: This produces a diagonal matrix $D$ such that $D T$ is symmetric, equivalently detailed balance holds for $\pi$ given by the diagonal of $D$.
11336: This is the standard equivalence between reversibility and symmetrizability for finite Markov kernels.
11337: \end{proof}
11338: 
11339: \begin{corollary}[Self-adjoint modular Hamiltonians from cycle-reversal wiring-diagram transfers]
11340: \label{cor:cycle_reversal_self_adjoint}
11341: Under the hypotheses of Propositions~\ref{prop:cycle_switching_TN} and~\ref{prop:cycle_reversal_detailed_balance}, the symmetrized transfer matrix
11342: \[
11343: S:=D^{1/2} T D^{-1/2}
11344: \]
11345: is symmetric and totally positive, hence the modular Hamiltonian
11346: \[
11347: K:=-\log\!\Bigl(\frac{S}{\Tr(S)}\Bigr)
11348: \]
11349: is self-adjoint and (after subtracting a scalar) positive.
11350: \end{corollary}
11351: 
11352: \begin{proof}
11353: Combine Proposition~\ref{prop:tp_detailed_balance_modular} with Proposition~\ref{prop:cycle_switching_TN}.
11354: \end{proof}
11355: 
11356: \begin{remark}[What remains to ``finish'' Hilbert--Pólya for GRH]
11357: Corollary~\ref{cor:cycle_reversal_self_adjoint} is exactly what total positivity was advertised to provide: a non-ad hoc certificate that the generator extracted from the clock dynamics is genuinely self-adjoint.
11358: To reach GRH via Theorem~\ref{thm:hurwitz_hp_implies_grh}, one must still prove that the determinants built from these $K_{N,\varpi}$ converge to $\Lambda(s,\varpi)$, which is a trace-formula/explicit-formula matching problem (Steps~3--4 of Section~\ref{sec:hp_proof_skeleton}).
11359: \end{remark}
11360: 
11361: Everything else is bookkeeping and operator algebra.
11362: 
11363: The point of writing the bookkeeping in density-operator/modular language is that it removes ``mystery degrees of freedom'': it forces the construction to be compatible with noise, coarse-graining, and the intrinsic dynamics generated by the state itself.
11364: 
11365: 
11366: 
11367: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
11368: \section{Determinantal convergence and weak-$\ast$ control: completing the last analytic step in the HP--GRH chain}
11369: \noindent\emph{(Recall: ``HP'' here means the Hilbert--P\'olya / Hilbert--Polya spectral-determi\-nant scheme described earlier.)}
11370: \label{sec:determinantal_convergence_weakstar_hp}
11371: 
11372: The Hurwitz closure theorem (Theorem~\ref{thm:hurwitz_hp_implies_grh}) isolates the final analytic obligation:
11373: \begin{quote}
11374: \emph{construct Hilbert--Pólya determinants $F_N(s;\varpi)$ with zeros on $\Re(s)=\tfrac12$ that converge uniformly on compacta to the completed $L$--function $\Lambda(s,\varpi)$.}
11375: \end{quote}
11376: The rest of this chapter explained how total positivity and wiring diagrams can supply the \emph{self-adjointness} required for the zero-location part.
11377: What remains is to justify the \emph{determinant convergence} in a way that is compatible with:
11378: \begin{enumerate}[label=(\roman*)]
11379: \item the cycle-expansion/Euler-product structure of $L$--functions, and
11380: \item the density-operator/coarse-graining viewpoint (weak-$\ast$ convergence of states).
11381: \end{enumerate}
11382: This section writes that missing ``determinantal bookkeeping'' explicitly.
11383: 
11384: \subsection{Determinants, traces, and cycle expansions: the universal identity}
11385: \label{sec:det_trace_cycle_identity}
11386: 
11387: Two identities sit behind essentially every determinantal model of a zeta/L-function:
11388: 
11389: \begin{lemma}[Log-det as trace series]
11390: \label{lem:logdet_trace_series}
11391: Let $T$ be a finite-dimensional matrix.
11392: If $\|T\|<1$ (or more generally if the spectrum lies in the open unit disc so that $\log(I-T)$ is defined by a convergent series), then
11393: \begin{equation}
11394: \label{eq:logdet_trace}
11395: \log\det(I-T) = -\sum_{n\ge 1}\frac{1}{n}\Tr(T^n).
11396: \end{equation}
11397: \end{lemma}
11398: 
11399: \begin{proof}
11400: Use $\log(I-T)=-\sum_{n\ge 1}T^n/n$ and $\log\det=\Tr\log$ in finite dimension.
11401: \end{proof}
11402: 
11403: \begin{remark}[Why cycles appear]
11404: When $T$ is a transfer matrix built from a quiver/network, $\Tr(T^n)$ is literally a weighted count of length-$n$ closed walks/cycles.
11405: Thus \eqref{eq:logdet_trace} is the formal bridge:
11406: \[
11407: \text{determinant}\quad\longleftrightarrow\quad\text{cycle expansion}\quad\longleftrightarrow\quad\text{Euler product / explicit formula}.
11408: \]
11409: The Bessenrodt--Holm Cartan determinant formula \eqref{eq:BH_cartan_det} is an algebraic instance where the cycle-factorization can be made completely explicit.
11410: \end{remark}
11411: 
11412: \subsection{Cartan determinants as a concrete cycle zeta function for gentle/surface algebras}
11413: \label{sec:cartan_det_as_zeta}
11414: 
11415: Fix a weighted locally gentle quiver $(Q,I,w)$ and its weighted Cartan matrix $C_Q^w(x)$.
11416: Theorem~\ref{thm:BH_weighted_cartan_det} gives
11417: \[
11418: \det C_Q^w(x)=
11419: \frac{\prod_{C\in\mathrm{ZC}(Q)}\bigl(1-(-1)^{\ell(C)}w(C)\bigr)}
11420: {\prod_{C\in\mathrm{IC}(Q)}\bigl(1-w(C)\bigr)}.
11421: \]
11422: Interpreting $w(C)$ as a multiplicative weight attached to a closed orbit $C$,
11423: this is precisely the ``primitive-cycle'' factorization one expects of a dynamical zeta function.
11424: 
11425: \begin{remark}[Why this is the right determinantal input for arithmetic]
11426: In the surface-order/Artin dictionary (Section~\ref{sec:artin_L_determinants_surface_orders}),
11427: allowed vertex cycles (in $\sigma_0$ or $\sigma_1$ but not in $\sigma_\infty$) correspond to admissible local dynamics and their weights encode local Frobenius phases.
11428: The Cartan determinant packages these local contributions into a single determinant whose factorization is governed by the same cycle combinatorics that controls:
11429: \begin{enumerate}[label=(\roman*)]
11430: \item the LGV expansions of minors (hence semi-invariants as determinants), and
11431: \item the wiring-diagram total-positivity certificates (hence self-adjoint modular generators).
11432: \end{enumerate}
11433: Thus the Cartan determinant is the ``determinantal shadow'' of the entire cycle-encoding mechanism.
11434: \end{remark}
11435: 
11436: \subsection{From toric semi-invariants to positive trace-class transfer operators}
11437: \label{sec:toric_to_transfer_operator}
11438: 
11439: Theorem~\ref{thm:surface_toric_semi_invariants} says that the relevant semi-invariant rings are semigroup (toric) rings.
11440: Concretely, this means that after choosing a suitable degeneration/term order, the determinantal generators $c^M$ become monomials indexed by a finitely generated semigroup $\Gamma$.
11441: This is exactly the structure needed to build a transfer operator with \emph{positive} matrix elements.
11442: 
11443: \paragraph{Semigroup Hilbert space.}
11444: Let $\Gamma$ be the semigroup of exponent vectors appearing in the associated graded semi-invariant ring.
11445: Define
11446: \[
11447: \mathcal{H}_\Gamma:=\ell^2(\Gamma),
11448: \qquad
11449: \{\ket{\gamma}:\gamma\in\Gamma\}\ \text{the standard orthonormal basis.}
11450: \]
11451: Each monomial $x^\gamma$ acts as a shift (partial isometry) $S_\gamma$ on $\mathcal{H}_\Gamma$ by
11452: \[
11453: S_\gamma\ket{\gamma'}:=\ket{\gamma+\gamma'}.
11454: \]
11455: If coefficients are nonnegative (as they are for LGV-leading-term monomials in a positive network), then linear combinations of these shifts define positive operators after symmetrization.
11456: 
11457: \paragraph{Prime-power weights as semigroup coefficients.}
11458: The Artin explicit formula weights $a_\varpi(p^k)$ (Section~\ref{sec:contour_explicit_formula_template}) are traces of Frobenius powers in inertia invariants.
11459: In the surface-order model, these are read off from local cycle holonomies.
11460: Under the toric degeneration, they appear as coefficients of monomials indexed by the corresponding cycle semigroup elements.
11461: Thus, after coarse-graining to a finite skeleton of primes/cycles (a truncation level $N$),
11462: one obtains a finite-rank operator
11463: \begin{equation}
11464: \label{eq:transfer_operator_semigroup_form}
11465: T_{N,\varpi}(s)\ :=\ \sum_{\gamma\in \Gamma_N} c_\gamma(\varpi)\,e^{-s\,\ell(\gamma)}\,S_\gamma,
11466: \end{equation}
11467: where:
11468: \begin{itemize}
11469: \item $\Gamma_N\subset\Gamma$ is the finite subset corresponding to cycles/primes up to a cutoff,
11470: \item $\ell(\gamma)>0$ is the length/energy assigned to $\gamma$ (typically a sum of $\log p$'s),
11471: \item and $c_\gamma(\varpi)\ge 0$ are (degenerate) semi-invariant coefficients encoding Frobenius traces.
11472: \end{itemize}
11473: The positivity $c_\gamma(\varpi)\ge 0$ is the point where toric degeneration and total positivity meet:
11474: degeneration makes coefficients monomial, and wiring-diagram realizations make them nonnegative.
11475: 
11476: \subsection{Weak-$\ast$ convergence of density operators and continuity of Fredholm determinants}
11477: \label{sec:weakstar_and_fredholm_continuity}
11478: 
11479: To convert the operator family $T_{N,\varpi}(s)$ into a Hilbert--Pólya approximant we do two standard steps:
11480: \begin{enumerate}[label=(\roman*)]
11481: \item \textbf{normalize to a density operator:} $\rho_{N,\varpi}(s):=T_{N,\varpi}(s)/\Tr(T_{N,\varpi}(s))$ whenever $T_{N,\varpi}(s)$ is trace class and positive;
11482: \item \textbf{extract a modular Hamiltonian:} $K_{N,\varpi}(s):=-\log\rho_{N,\varpi}(s)$, then (after affine rescaling) define $H_{N,\varpi}$ as in Step~2 of \S\ref{sec:hp_proof_skeleton}.
11483: \end{enumerate}
11484: Corollary~\ref{cor:cycle_reversal_self_adjoint} provides self-adjointness for the $s$ on the critical line once $T_{N,\varpi}$ comes from a reversible totally positive transfer.
11485: 
11486: What is still missing is the \emph{limit} $N\to\infty$.
11487: The correct analytic topology here is trace norm for operators and weak-$\ast$ for states.
11488: 
11489: \begin{definition}[Weak-$\ast$ convergence of density operators]
11490: A sequence of density operators $\rho_N$ on a Hilbert space $\mathcal{H}$ converges \emph{weak-$\ast$} to a density operator $\rho$ if
11491: \[
11492: \Tr(\rho_N\,O)\ \longrightarrow\ \Tr(\rho\,O)
11493: \qquad\text{for every bounded operator }O\in\mathcal{B}(\mathcal{H}).
11494: \]
11495: Equivalently, $\rho_N\to\rho$ in the weak-$\ast$ topology of the trace-class predual $\mathcal{T}_1(\mathcal{H})$ of $\mathcal{B}(\mathcal{H})$.
11496: \end{definition}
11497: 
11498: \begin{lemma}[Trace-norm $\Rightarrow$ weak-$\ast$]
11499: \label{lem:trace_norm_implies_weakstar}
11500: If $\|\rho_N-\rho\|_1\to 0$ in trace norm, then $\rho_N\to\rho$ weak-$\ast$.
11501: \end{lemma}
11502: \begin{proof}
11503: For bounded $O$, $|\Tr((\rho_N-\rho)O)|\le \|\rho_N-\rho\|_1\,\|O\|$.
11504: \end{proof}
11505: 
11506: For determinants, trace norm is again the correct control.
11507: 
11508: \begin{theorem}[Continuity of Fredholm determinants under trace-norm convergence]
11509: \label{thm:fredholm_det_continuity}
11510: Let $A_N(s)$ and $A(s)$ be trace-class operators depending holomorphically on $s$ in a domain $\Omega\subset\C$.
11511: Assume that on every compact $K\Subset\Omega$:
11512: \[
11513: \sup_{s\in K}\|A_N(s)-A(s)\|_1\ \longrightarrow\ 0
11514: \qquad\text{as }N\to\infty,
11515: \]
11516: and that $\sup_{N}\sup_{s\in K}\|A_N(s)\|_1<\infty$.
11517: Then the Fredholm determinants converge uniformly on $K$:
11518: \[
11519: \det\!\bigl(I-A_N(s)\bigr)\ \longrightarrow\ \det\!\bigl(I-A(s)\bigr),
11520: \qquad \text{uniformly for }s\in K.
11521: \]
11522: \end{theorem}
11523: 
11524: \begin{proof}[Proof sketch]
11525: This is a standard estimate in trace-ideal theory: the map $A\mapsto \det(I-A)$ is continuous in trace norm on bounded subsets of $\mathcal{T}_1$.
11526: One convenient inequality is
11527: \[
11528: \bigl|\det(I-A)-\det(I-B)\bigr|
11529: \le \|A-B\|_1\,\exp\!\bigl(1+\|A\|_1+\|B\|_1\bigr),
11530: \]
11531: valid for trace-class $A,B$.
11532: See, e.g., Simon's trace-ideal monograph \cite{SimonTraceIdeals}.
11533: \end{proof}
11534: 
11535: \subsection{Determinantal HP--GRH theorem}
11536: \label{sec:determinantal_HP_GRH_theorem}
11537: 
11538: We can now state the exact determinantal theorem used to close the Hilbert--Pólya $\Rightarrow$ GRH argument in this manuscript.
11539: 
11540: \begin{theorem}[Determinantal Hilbert--Pólya closure for GRH]
11541: \label{thm:determinantal_HP_GRH}
11542: Fix a completed $L$--function $\Lambda(s,\varpi)$ holomorphic in $0<\Re(s)<1$.
11543: Assume that for each cutoff level $N$ one can construct:
11544: \begin{enumerate}[label=(\alph*)]
11545: \item a finite-dimensional reversible totally positive transfer matrix $T_{N,\varpi}(s)$ realized by a positive wiring diagram built from the toric degeneration of surface-order determinantal semi-invariants;
11546: \item a corresponding self-adjoint Hilbert--Pólya matrix $H_{N,\varpi}$ obtained from $T_{N,\varpi}$ by symmetrization and modular-Hamiltonian extraction (Corollary~\ref{cor:cycle_reversal_self_adjoint});
11547: \item an operator-valued holomorphic family $A_{N,\varpi}(s)$ (finite rank, trace class) whose Fredholm determinant agrees with the Hilbert--Pólya approximant:
11548: \[
11549: F_N(s;\varpi)=\exp(\alpha_{N,\varpi}+\beta_{N,\varpi}s)\,
11550: \det\!\Bigl(sI_{d_N}-\bigl(\tfrac12 I_{d_N}+ i H_{N,\varpi}\bigr)\Bigr)
11551: = \det\!\bigl(I-A_{N,\varpi}(s)\bigr);
11552: \]
11553: \item a limiting trace-class family $A_\varpi(s)$ such that $A_{N,\varpi}(s)\to A_\varpi(s)$ in trace norm uniformly on compacta in $0<\Re(s)<1$, and
11554: \[
11555: \Lambda(s,\varpi)=\det\!\bigl(I-A_\varpi(s)\bigr)
11556: \quad\text{in }0<\Re(s)<1
11557: \]
11558: (up to an exponential renormalization factor that does not create zeros).
11559: \end{enumerate}
11560: Then GRH holds for $\Lambda(s,\varpi)$.
11561: 
11562: Moreover, if the convergence in (d) is uniform in $\varpi$ on compact subsets of a parameter family, then the conclusion holds uniformly in that family (a GRH-strength statement).
11563: \end{theorem}
11564: 
11565: \begin{proof}
11566: By (a)--(b), each approximant $F_N(s;\varpi)$ is of Hilbert--Pólya form, hence all its zeros lie on $\Re(s)=\tfrac12$ (Lemma~\ref{lem:zeros_on_critical_line_finite}).
11567: By (c)--(d) and Theorem~\ref{thm:fredholm_det_continuity}, the functions $F_N(\,\cdot\,;\varpi)$ converge to $\Lambda(\,\cdot\,,\varpi)$ uniformly on compacta in $0<\Re(s)<1$.
11568: Therefore Theorem~\ref{thm:hurwitz_hp_implies_grh} applies and forces all nontrivial zeros of $\Lambda$ to lie on the critical line.
11569: 
11570: Family-uniformity is exactly Proposition~\ref{prop:family_hurwitz_grh}.
11571: \end{proof}
11572: 
11573: 
11574: \begin{theorem}[Determinantal Hilbert--P\'olya $\Rightarrow$ (Artin holomorphy \emph{and} GRH) from a single convergence statement]
11575: \label{thm:hp_convergence_implies_holomorphy_and_grh}
11576: Let $\Lambda(s,\varpi)$ be a completed $L$--function for which the Dirichlet series/Euler product converges absolutely in $\Re(s)>1$
11577: (hence $\Lambda$ is holomorphic there), and assume $\Lambda$ is known \emph{a priori} to admit meromorphic continuation to $\C$
11578: (e.g.\ by Artin formalism/Brauer induction in the Artin case).
11579: 
11580: Assume that one constructs a sequence of Hilbert--P\'olya determinantal approximants $F_N(s;\varpi)$ with the following properties:
11581: \begin{enumerate}[label=(\roman*)]
11582: \item (\textbf{HP form / zero location}) Each $F_N(\,\cdot\,;\varpi)$ has all zeros on the critical line $\Re(s)=\tfrac12$
11583: (e.g.\ $F_N(s;\varpi)=\det(sI-(\tfrac12 I+iH_{N,\varpi}))$ with $H_{N,\varpi}$ self-adjoint, as in Section~\ref{sec:determinantal_HP_GRH_theorem}).
11584: \item (\textbf{Holomorphy of approximants}) Each $F_N(\,\cdot\,;\varpi)$ is holomorphic on the strip $0<\Re(s)<1$.
11585: \item (\textbf{Uniform convergence}) $F_N(\,\cdot\,;\varpi)\to F(\,\cdot\,;\varpi)$ uniformly on compact subsets of $0<\Re(s)<1$.
11586: \item (\textbf{Matching on an overlap}) There exists a nonempty open set $U\subset\{\Re(s)>1\}$ such that
11587: \[
11588: F(s;\varpi)=\Lambda(s,\varpi)\qquad \text{for all }s\in U.
11589: \]
11590: \end{enumerate}
11591: Then:
11592: \begin{enumerate}[label=(\alph*)]
11593: \item $\Lambda(s,\varpi)$ is holomorphic on $0<\Re(s)<1$ (in particular, Artin holomorphy holds in the critical strip for the given $\varpi$); and
11594: \item all nontrivial zeros of $\Lambda(s,\varpi)$ in $0<\Re(s)<1$ lie on $\Re(s)=\tfrac12$ (GRH for $\Lambda$).
11595: \end{enumerate}
11596: \end{theorem}
11597: 
11598: \begin{proof}
11599: By (ii)--(iii), $F(\,\cdot\,;\varpi)$ is holomorphic on $0<\Re(s)<1$ by the Weierstrass theorem (Proposition~\ref{prop:weierstrass_holomorphy_from_approximation}).
11600: By (iv), $F$ agrees with $\Lambda$ on a nonempty open subset of the domain where $\Lambda$ is holomorphic; by the identity theorem, $F$ is the analytic continuation of $\Lambda$ to $0<\Re(s)<1$.
11601: Since $F$ is holomorphic on the whole strip, $\Lambda$ has no poles there, proving (a).
11602: 
11603: For (b), combine (i) with (iii) and apply Hurwitz' theorem in the form stated as Theorem~\ref{thm:hurwitz_hp_implies_grh}.
11604: \end{proof}
11605: 
11606: \begin{remark}[What this theorem does (and does not) solve]
11607: Theorem~\ref{thm:hp_convergence_implies_holomorphy_and_grh} is \emph{unconditional as a logical implication}:
11608: it reduces holomorphy and GRH to the construction of a determinantal HP approximation that matches $\Lambda$ on an overlap.
11609: What is hard (and where all arithmetic content lives) is establishing the existence of such a sequence and proving (iii)--(iv).
11610: The purpose of the surface-order/dessin and invariant-theory machinery earlier in the manuscript is to make (iv) a \emph{geometric matching problem in determinantal coordinates} rather than an ad hoc analytic miracle.
11611: \end{remark}
11612: 
11613: 
11614: 
11615: 
11616: \begin{remark}[Where the determinantal input from Schreiber/CCKW enters]
11617: Theorem~\ref{thm:determinantal_HP_GRH} is intentionally ``modular'':
11618: it separates what is \emph{representation theory/invariant theory} (toric degeneration, determinantal semi-invariants, Cartan determinant cycle factorizations) from what is \emph{analysis} (trace-class limits and determinant continuity) and what is \emph{operator algebra} (total positivity $\Rightarrow$ self-adjoint modular generators).
11619: The Artin/surface-order package (Theorem~\ref{thm:artin_determinantal_toric_package}) is precisely the input ensuring that the arithmetic Euler factors can be encoded by determinantal invariants that survive base change and behave functorially in $\varpi$.
11620: \end{remark}
11621: 
11622: \begin{remark}[Why weak-$\ast$ convergence is the right minimal target]
11623: Even when trace-norm convergence is analytically hard, weak-$\ast$ convergence of the normalized states $\rho_{N,\varpi}$ is a \emph{physically meaningful} minimal target:
11624: it is exactly the convergence notion preserved by CPTP coarse-graining channels.
11625: Once weak-$\ast$ convergence is established, the remaining problem is to upgrade it to the trace-class control required by Theorem~\ref{thm:fredholm_det_continuity}.
11626: This upgrade is where renormalization, decay of cycle weights, and toric positivity are expected to do real work.
11627: \end{remark}
11628: 
11629: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
11630: 
11631: 
11632: 
11633: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
11634: 
11635: \subsection{Geometric traits of $\mathrm{SL}$ semi-invariants and $\mathrm{GL}$ rational invariants, and why this helps with holomorphy}
11636: \label{sec:CC_SL_GL_geometry_holomorphy}
11637: 
11638: We briefly isolate the geometric input from invariant theory that is used implicitly in the determinantal holomorphy story.
11639: The guiding philosophy is:
11640: 
11641: \medskip
11642: \centerline{\fbox{\parbox{0.92\textwidth}{
11643: \emph{Determinants produce algebraic coordinates; geometry tells you what denominators are allowed; analytic continuation becomes a question about which potential poles are actually realized.}
11644: }}}
11645: \medskip
11646: 
11647: \paragraph{Setup: representation varieties and base change groups.}
11648: Let $A=kQ/I$ be a bound quiver algebra and fix a dimension vector $\mathbf{d}$.
11649: The affine variety $\Rep(A,\mathbf{d})$ carries the base-change action of
11650: \[
11651: G_{\mathbf{d}}=\prod_{i\in Q_0}\GL_{d_i}(k),
11652: \qquad
11653: \SL_{\mathbf{d}}=\prod_i \SL_{d_i}(k)\subset G_{\mathbf{d}}.
11654: \]
11655: Polynomial $\SL_{\mathbf{d}}$-invariants are precisely the \emph{semi-invariants} used in GIT constructions of moduli spaces (Section~\ref{sec:schofield_determinants}).
11656: 
11657: \paragraph{$\mathrm{GL}$-invariants versus $\mathrm{SL}$-semi-invariants.}
11658: For a quiver without oriented cycles, polynomial $G_{\mathbf{d}}$-invariants are trivial; in the general case, Le Bruyn--Procesi identify them as the trace algebra generated by traces along oriented cycles \cite{LeBruynProcesi1990SemisimpleQuivers}.
11659: Either way, the \emph{geometrically useful} invariants for moduli are the $\SL_{\mathbf{d}}$-semi-invariants: they cut out stability conditions and generate the homogeneous coordinate rings of GIT quotients.
11660: 
11661: 
11662: \subsubsection{Necklaces, cycle traces, and the Le Bruyn--Procesi--Lusztig generators}
11663: \label{sec:necklaces_LBP_Lusztig}
11664: 
11665: Because later sections translate the dessin/surface cycle calculus into invariant-theoretic coordinates, it is useful to isolate the precise ``cycle-generation'' statements.
11666: 
11667: \paragraph{Necklaces.}
11668: Fix a quiver $Q=(Q_0,Q_1)$ and a dimension vector $\mathbf{d}\in\mathbb{N}^{Q_0}$.
11669: Write
11670: \[
11671: \Rep(Q,\mathbf{d})=\bigoplus_{a\in Q_1} \Mat_{d_{h(a)}\times d_{t(a)}}(k)
11672: \]
11673: with base-change group $G_{\mathbf{d}}=\prod_{i\in Q_0}\GL_{d_i}(k)$ acting by simultaneous change of bases.
11674: For a nontrivial oriented cycle
11675: \(\gamma=a_\ell\cdots a_1\) in $Q$, define the \emph{necklace trace function}
11676: \[
11677: \tr_{\gamma} : \Rep(Q,\mathbf{d})\to k,\qquad
11678: \tr_{\gamma}(V):=\mathrm{tr}\bigl(V(a_\ell)\cdots V(a_1)\bigr).
11679: \]
11680: The terminology ``necklace'' reflects that $\tr_{\gamma}$ depends only on the cyclic word class of $\gamma$ (cyclic rotation does not change the trace).
11681: 
11682: \paragraph{Le Bruyn--Procesi.}
11683: The classical theorem of Le Bruyn and Procesi states that the invariant ring
11684: \(k[\Rep(Q,\mathbf{d})]^{G_{\mathbf{d}}}\)
11685: is generated, as a $k$-algebra, by the necklace trace functions $\{\tr_{\gamma}\}$ over all oriented cycles $\gamma$ in $Q$.
11686: Equivalently, all polynomial invariants for simultaneous base-change are ``Wilson loop'' traces. \cite{LeBruynProcesi1990SemisimpleQuivers}
11687: 
11688: \paragraph{Procesi's trace philosophy.}
11689: At the level of matrices, Procesi showed that invariants of tuples of matrices under simultaneous conjugation are generated by traces of words, subject to universal trace identities. \cite{Procesi1976InvariantTheoryMatrices}
11690: Le Bruyn--Procesi reduces the general quiver case to this matrix invariant theory by encoding quiver representations as structured matrix tuples.
11691: 
11692: \paragraph{Quivers with relations: Craw--Yamagishi (``Le Bruyn--Procesi following Lusztig'').}
11693: In practice one works with a \emph{quiver algebra} $A=kQ/J$ and the representation subscheme $\Rep(A,\mathbf{d})\subseteq \Rep(Q,\mathbf{d})$ cut out by the ideal of relations $J$.
11694: Restriction of functions gives a surjective homomorphism
11695: \(
11696: \tau: k[\Rep(Q,\mathbf{d})]^{G_{\mathbf{d}}}\twoheadrightarrow k[\Rep(A,\mathbf{d})]^{G_{\mathbf{d}}}.
11697: \)
11698: Craw--Yamagishi refine Le Bruyn--Procesi by identifying generators \emph{and} relations for the quotient: the target ring is generated by trace functions of cycles, and the kernel of $\tau$ is generated by trace functions coming from cycles lying in the vertex-idempotent corners of $\ker(kQ\twoheadrightarrow A)$ (Theorem~1.1 in \cite{CrawYamagishi2023LBPFollowingLusztig}). \cite{CrawYamagishi2023LBPFollowingLusztig}
11699: This is exactly the ``ideal kills certain necklaces'' principle used throughout the surface/dessin discussion.
11700: 
11701: \paragraph{Frozen vertices and open necklaces: Lusztig's generators.}
11702: Lusztig generalized the Le Bruyn--Procesi theorem to situations where the group acts only on a subset of vertices (``frozen'' vertices in modern cluster terminology).
11703: In Craw--Yamagishi's formulation, for a subset $K\subseteq Q_0$ one considers the subgroup
11704: \(G_K:=\prod_{k\in K}\GL_{d_k}(k)\subseteq G_{\mathbf{d}}.\)
11705: Then the invariant ring $k[\Rep(Q,\mathbf{d})]^{G_K}$ is generated by:
11706: \begin{enumerate}[label=(\alph*)]
11707: \item necklace traces $\tr_{\gamma}$ for cycles $\gamma$ whose arrows stay in the full subquiver on $K$; and
11708: \item \emph{contraction functions} $x_{p,ij}$ given by matrix entries of path products along paths $p$ with head/tail in the unfrozen complement $K^c$.
11709: \end{enumerate}
11710: See Theorem~2.2 in \cite{CrawYamagishi2023LBPFollowingLusztig}. \cite{CrawYamagishi2023LBPFollowingLusztig}
11711: From the ``necklace'' viewpoint, the functions $x_{p,ij}$ are \emph{open necklaces} (paths with framed endpoints), and determinants of matrices of such contractions recover the familiar determinantal semi-invariants after imposing $\SL$-conditions (compare Schofield/Derksen--Weyman and Shmelkin's bidirected-walk generators).
11712: 
11713: \begin{remark}[Relation to the surface/dessin cycle picture]
11714: In the dessin/surface-algebra regime, the relevant cycles are controlled by the permutations $(\sigma_0,\sigma_1,\sigma_\infty)$.
11715: Necklace traces attached to $\sigma_0$- and $\sigma_1$-cycles provide $G_{\mathbf d}$-invariant ``Wilson loop'' observables, while the relations in the ideal (killing the $\sigma_\infty$-cycles) correspond to declaring certain necklaces null.
11716: The adjacent-cycle reversal move discussed earlier can be interpreted as replacing one necklace representative by another in the same trace class while changing the associated shift/cycle weight; in the toric limit this becomes a binomial relation in the semigroup algebra.
11717: \end{remark}
11718: 
11719: \paragraph{Why cycle-generation matters for the determinantal holomorphy program.}
11720: The determinantal approximation scheme in Sections~\ref{sec:holomorphy_from_determinants}--\ref{sec:general_HP_construction} ultimately manipulates Euler factors of the form
11721: \(\det(I-\rho(\Frob_p)p^{-s})\), and hence trace polynomials in the matrices $\rho(\Frob_p)$.
11722: Newton identities express coefficients of characteristic polynomials as polynomials in the power-sum traces $\mathrm{tr}(\rho(\Frob_p)^m)$.
11723: Le Bruyn--Procesi--Lusztig therefore justify the methodological reduction:
11724: \begin{quote}
11725: \emph{to control the algebraic part of the global analytic continuation problem it suffices to control (closed or open) necklace traces and their determinantal composites.}
11726: \end{quote}
11727: In particular, ``geometric control of denominators'' in rational invariant coordinates can be phrased entirely in the language of cycles (necklaces) and their determinantal refinements.
11728: 
11729: \begin{lemma}[Newton identities, determinants, and necklace traces]
11730: \label{lem:newton_necklace}
11731: Let $R$ be a commutative $\Q$-algebra and let $X\in \Mat_{n\times n}(R)$.
11732: Write
11733: \[
11734: \det(\lambda I - X)=\lambda^n + c_1(X)\lambda^{n-1}+\cdots + c_n(X),
11735: \qquad c_m(X)=(-1)^m e_m(X),
11736: \]
11737: where $e_m(X)$ is the $m$-th elementary symmetric polynomial in the eigenvalues of $X$ (equivalently, the coefficient functions of the characteristic polynomial).
11738: For $m\ge 1$ define the \emph{power-sum traces} $p_m(X):=\tr(X^m)\in R$.
11739: 
11740: Then:
11741: \begin{enumerate}[label=(\roman*)]
11742: \item \textbf{Newton identities.} For $1\le m\le n$ one has the recursive relations
11743: \[
11744: m\,e_m(X)=\sum_{i=1}^{m}(-1)^{i-1}e_{m-i}(X)\,p_i(X),
11745: \qquad e_0(X)=1.
11746: \]
11747: In particular, each $c_m(X)$ is a polynomial with rational coefficients in $p_1(X),\dots,p_m(X)$, and conversely each $p_m(X)$ is a polynomial in $c_1(X),\dots,c_m(X)$.
11748: \item \textbf{Log--det generating function.} As a formal power series in an indeterminate $t$,
11749: \[
11750: \det(I-tX)=\exp\!\Bigl(-\sum_{m\ge 1}\frac{t^m}{m}\,p_m(X)\Bigr).
11751: \]
11752: \end{enumerate}
11753: \end{lemma}
11754: 
11755: \begin{proof}
11756: Work in the ring $R[[t]]$.
11757: Differentiate $\log\det(I-tX)$ using $\frac{d}{dt}\log\det A(t)=\tr(A(t)^{-1}A'(t))$:
11758: \[
11759: \frac{d}{dt}\log\det(I-tX)
11760: =\tr\!\bigl((I-tX)^{-1}(-X)\bigr)
11761: =-\tr\!\bigl(X(I-tX)^{-1}\bigr).
11762: \]
11763: Expand $(I-tX)^{-1}=\sum_{m\ge 0} t^m X^m$ to obtain
11764: \[
11765: \frac{d}{dt}\log\det(I-tX)=-\sum_{m\ge 0} t^m\,\tr(X^{m+1})
11766: =-\sum_{m\ge 1} t^{m-1}\,p_m(X).
11767: \]
11768: Integrating termwise (and using $\det(I)=1$) yields the log--det identity.
11769: Writing $\det(I-tX)=\sum_{m=0}^n (-1)^m e_m(X)t^m$ and comparing coefficients after differentiating both sides recovers the Newton recursion.
11770: \end{proof}
11771: 
11772: \begin{corollary}[Euler factors are polynomials in necklace traces]
11773: \label{cor:euler_factors_necklaces}
11774: Let $\gamma$ be an oriented cycle in a quiver (or in a quiver algebra $A=kQ/J$) and let $V$ be a representation so that $X:=V(\gamma)$ is a square matrix.
11775: Then the coefficients of $\det(I-tX)$ are polynomials in the traces $\tr(X^m)$.
11776: Moreover $\tr(X^m)=\tr_{\gamma^m}(V)$ is itself a \emph{necklace trace} attached to the cycle word $\gamma^m$.
11777: Consequently:
11778: \begin{quote}
11779: \emph{every characteristic-polynomial/Euler-factor expression built from cycle monodromies is generated by necklace trace functions (and in the presence of frozen vertices, by Lusztig's open-necklace contractions).}
11780: \end{quote}
11781: \end{corollary}
11782: 
11783: \begin{proof}
11784: The first statement is Lemma~\ref{lem:newton_necklace}.
11785: The identity $\tr(X^m)=\tr_{\gamma^m}(V)$ is immediate from the definition of $\tr_{\gamma}$.
11786: Cycle-generation for $G_{\mathbf d}$-invariants and the ``ideal kills necklaces'' mechanism for quivers with relations were recorded above (Le Bruyn--Procesi and Craw--Yamagishi/Lusztig).
11787: \end{proof}
11788: 
11789: \paragraph{Where this closes the \emph{algebraic} side of the determinantal approximation scheme.}
11790: Sections~\ref{sec:schofield_determinants}--\ref{sec:holomorphy_from_determinants} use determinants in two logically distinct ways:
11791: \begin{enumerate}[label=(A\arabic*)]
11792: \item \emph{Local Euler determinants} such as $\det(I-\rho(\Frob_p)p^{-s})$ and their Dirichlet-series logarithms;
11793: \item \emph{Geometric/GIT determinants} (Schofield/Derksen--Weyman and Shmelkin) producing semi-invariant coordinate rings and moduli.
11794: \end{enumerate}
11795: Lemma~\ref{lem:newton_necklace} and Corollary~\ref{cor:euler_factors_necklaces} show that \textbf{(A1)} reduces to necklace traces (closed cycles), while the Le Bruyn--Procesi--Lusztig generator theorem shows that \textbf{(A2)} reduces to necklace traces plus open-necklace contractions (paths with framed endpoints), whose determinants recover the classical determinantal semi-invariants.
11796: Therefore, once one has:
11797: \begin{itemize}
11798: \item a cycle/necklace description of the relevant invariant fields (CC, Shmelkin, and the surface/dessin cycle calculus), and
11799: \item analytic control of convergence/trace ideals for the resulting determinant sequence (Sections~\ref{sec:determinantal_invariants_gentle_toric}--\ref{sec:general_HP_construction}),
11800: \end{itemize}
11801: there is \emph{no additional algebraic generator problem}: all objects entering the determinant approximation can be rewritten in cycle language.
11802: 
11803: 
11804: 
11805: \paragraph{Carroll--Chindri\c{s}: rationality and projective-space moduli for acyclic gentle algebras.}
11806: For \emph{acyclic gentle algebras}, Carroll and Chindri\c{s} prove two key facts \cite{CarrollChindris2012InvariantGentle}:
11807: \begin{enumerate}[label=(\roman*)]
11808: \item On each irreducible component $C\subset \Rep(A,\mathbf{d})$, the field of rational invariants $k(C)^{G_{\mathbf{d}}}$ is a \emph{purely transcendental} extension of $k$.
11809: Moreover, they exhibit a transcendence basis in terms of \emph{Schofield determinantal semi-invariants} (ratios of determinants coming from projective presentations).
11810: \item The moduli spaces of $\theta$-semistable modules over \emph{regular} components are products of projective spaces.
11811: In particular, the boundary divisors are normal-crossing coordinate hyperplanes in a suitable Cox coordinate system.
11812: \end{enumerate}
11813: 
11814: \paragraph{Why this is relevant for holomorphy.}
11815: In the arithmetic layer, Euler factors are determinants (characteristic polynomials of Frobenius elements) and global $L$-functions are built by gluing these local determinants.
11816: From the geometric viewpoint, determinantal semi-invariants provide a canonical coordinate system in which the possible denominators of rational invariants are \emph{explicit} (boundary divisors in a projective-space product).
11817: Toric degeneration (Section~\ref{sec:determinantal_toric_bridge}) makes this even more rigid: determinants degenerate to monomials, so ``where a pole could live'' is controlled by a semigroup cone.
11818: 
11819: Analytically, the determinantal Hilbert--P\'olya framework replaces ad hoc analytic continuation by a convergence statement for Fredholm determinants (Section~\ref{sec:holomorphy_from_determinants}).
11820: The Carroll--Chindri\c{s} picture explains why \emph{determinants} are the correct algebraic observables to approximate: they coordinatize the quotient and isolate the only potential pole loci.
11821: Once the relevant determinant sequence converges uniformly on compact subsets, Weierstrass/Hurwitz (Theorem~\ref{thm:hurwitz_hp_implies_grh}) rules out spurious poles and yields holomorphy of the limit.
11822: 
11823: 
11824: 
11825: \subsubsection{Carroll--Chindri\c{s} in detail: rational invariant fields and determinantal coordinates}
11826: \label{sec:CC_detail_rationality}
11827: 
11828: Because the final analytic arguments in the Hilbert--P\'olya closure step depend only on \emph{where poles could possibly come from},
11829: it is useful to record the precise Carroll--Chindri\c{s} statements in a form compatible with our determinantal language.
11830: 
11831: \begin{theorem}[Carroll--Chindri\c{s}: rationality of invariant fields and projective-space moduli]
11832: \label{thm:CC_main_results}
11833: Let $A=kQ/I$ be a \emph{triangular (acyclic) gentle algebra} over an algebraically closed field $k$ of characteristic $0$,
11834: let $\mathbf d$ be a dimension vector, and let $C\subseteq \Rep(A,\mathbf d)$ be an irreducible component.
11835: Then:
11836: \begin{enumerate}[label=(\roman*)]
11837: \item The field of rational invariants $k(C)^{\GL(\mathbf d)}$ is \emph{purely transcendental} over $k$.
11838: Its transcendence degree equals the sum of multiplicities of indecomposable irreducible \emph{regular} components in the generic decomposition of $C$.
11839: \item If $C$ is an irreducible regular component, then for any weight $\theta\in\mathbb Z^{Q_0}$ with $C_\theta^{ss}\neq\varnothing$ and such that the $\theta$-stable summands are regular, the moduli space
11840: \(
11841: \mathcal M(C)^{ss}_\theta
11842: \)
11843: is a product of projective spaces.
11844: \end{enumerate}
11845: \end{theorem}
11846: 
11847: \begin{proof}[Reference]
11848: This is Theorem~1 of \cite{CarrollChindris2012InvariantGentle}.
11849: \end{proof}
11850: 
11851: \begin{theorem}[Carroll--Chindri\c{s}: transcendence basis by Schofield determinants]
11852: \label{thm:CC_transcendence_basis_det}
11853: In the situation of Theorem~\ref{thm:CC_main_results}, assume that $C$ is an irreducible regular component with generic decomposition
11854: \(
11855: C = \bigoplus_{i=1}^n C_i^{\oplus m_i}
11856: \)
11857: into pairwise distinct indecomposable irreducible regular components $C_i$ with multiplicities $m_i$.
11858: Then $k(C)^{\GL(\mathbf d)}$ is purely transcendental of degree $\sum_i m_i$,
11859: and one can choose a transcendence basis consisting of \emph{ratios of generalized Schofield determinantal semi-invariants}:
11860: \[
11861: \left\{\;
11862: \frac{c^{M_{i,j}}}{c^{M_{i,j+1}}}
11863: \;:\;
11864: i=1,\dots,n,\; j=0,\dots,m_i-1
11865: \right\},
11866: \]
11867: where each $c^{M_{i,j}}$ is the determinant of a matrix of linear forms attached to a suitable projective presentation (Schofield/Derksen--Weyman) and $M_{i,j}$ runs over the generic modules in the relevant regular components.
11868: \end{theorem}
11869: 
11870: \begin{proof}[Reference]
11871: This is Theorem~2 of \cite{CarrollChindris2012InvariantGentle}; the construction uses up-and-down graphs to compute the generalized Schofield determinants explicitly on generic modules.
11872: \end{proof}
11873: 
11874: \begin{remark}[Why these theorems are exactly what holomorphy bookkeeping needs]
11875: Theorem~\ref{thm:CC_transcendence_basis_det} says that, on each regular component, the entire rational quotient is coordinatized by \emph{determinantal ratios}.
11876: Therefore any rational invariant is a rational function whose \emph{only possible poles} occur on the vanishing loci of finitely many Schofield determinants.
11877: Geometrically (Theorem~\ref{thm:CC_main_results}(ii)), after choosing Cox/homogeneous coordinates on the product of projective spaces, these determinant divisors become coordinate hyperplanes (normal crossings).
11878: This is the cleanest possible pole geometry.
11879: 
11880: In the toric degeneration regime emphasized in this manuscript (Shmelkin deformation method and the semigroup/toric presentation of semi-invariants),
11881: the same divisors degenerate further to monomial coordinate hyperplanes in an affine toric variety \cite{ShmelkinGentleDeformation}.
11882: Thus, ``pole control'' becomes a combinatorial semigroup question: whether a would-be denominator corresponds to a semigroup element that is forced to vanish in the given degeneration/ideal.
11883: \end{remark}
11884: 
11885: \begin{remark}[SL versus GL: where determinants enter]
11886: For acyclic quivers, polynomial $\GL(\mathbf d)$-invariants are trivial, but polynomial $\SL(\mathbf d)$-invariants (semi-invariants) are highly nontrivial.
11887: Carroll--Chindri\c{s} work precisely in the setting where $\SL$-semi-invariants (Schofield determinants) provide the GIT coordinates,
11888: and the rational $\GL$-invariant field is recovered as a field of fractions of suitable semi-invariant graded pieces.
11889: This matches the operator/determinant viewpoint used later: the only algebraic observables we ever need are determinants and their ratios.
11890: \end{remark}
11891: 
11892: 
11893: 
11894: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
11895: \subsection{Holomorphy as a consequence of determinantal approximation}
11896: \label{sec:holomorphy_from_determinants}
11897: 
11898: One subtle point in the Artin/$L$--function setting is that holomorphy in the critical strip is often treated as an \emph{external} analytic conjecture (e.g.\ Artin's holomorphy conjecture).
11899: From the determinantal Hilbert--P\'olya viewpoint, holomorphy can instead be treated as an \emph{output} of the approximation scheme:
11900: 
11901: \paragraph{Algebraic closure via Newton identities and necklaces.}
11902: The only ``algebraic'' input needed to guarantee that each approximant is holomorphic in the spectral variable is that it is built from determinants of matrices whose entries depend holomorphically on that variable.
11903: Indeed, by Lemma~\ref{lem:newton_necklace} and Corollary~\ref{cor:euler_factors_necklaces}, every coefficient of a characteristic polynomial $\det(I-tX(s))$ is a polynomial in traces $\tr(X(s)^m)$, and these traces are necklace functions (cycle traces) for the relevant quiver/surface data.
11904: Thus, once the cycle-trace observables $s\mapsto \tr_{\gamma}(V(s))$ are holomorphic (which holds whenever the underlying matrices depend holomorphically on $s$), the entire finite-level determinant expressions are holomorphic automatically.
11905: What remains is to pass to the \emph{limit} in the determinant approximation, which is purely analytic (Weierstrass/Hurwitz).
11906: 
11907: 
11908: 
11909: \begin{proposition}[Weierstrass principle for determinantal approximants]
11910: \label{prop:weierstrass_holomorphy_from_approximation}
11911: Let $\Omega\subset\C$ be a domain and let $\{F_N\}_{N\ge 1}$ be holomorphic functions on $\Omega$ such that $F_N\to F$ uniformly on compact subsets of $\Omega$.
11912: Then $F$ is holomorphic on $\Omega$.
11913: 
11914: In particular, if $\Lambda$ is a meromorphic function on $\Omega$ and $F$ agrees with $\Lambda$ on some nonempty open subset of $\Omega$ where $\Lambda$ is holomorphic, then $\Lambda$ has \emph{no poles} in $\Omega$ and $\Lambda\equiv F$ as holomorphic functions on $\Omega$.
11915: \end{proposition}
11916: 
11917: \begin{proof}
11918: The first statement is the classical Weierstrass theorem (uniform limits on compacta preserve holomorphy).
11919: For the second statement, the difference $F-\Lambda$ is holomorphic on the open subset where $\Lambda$ is holomorphic and vanishes there; by the identity theorem, it vanishes on the entire connected domain where both are holomorphic.
11920: But $F$ is holomorphic everywhere on $\Omega$, hence $\Lambda$ cannot have poles in $\Omega$ (otherwise $\Lambda$ could not coincide with the holomorphic function $F$ in any punctured neighborhood of a pole).
11921: \end{proof}
11922: 
11923: \begin{corollary}[Determinantal Hilbert--P\'olya convergence would imply Artin holomorphy]
11924: \label{cor:hp_implies_artin_holomorphy}
11925: Let $\Lambda(s,\rho)$ be a completed Artin $L$--function.
11926: Unconditionally, $\Lambda(s,\rho)$ is known to be holomorphic in $\Re(s)>1$ and to admit meromorphic continuation to $\C$ (via Brauer induction/Artin formalism).
11927: If one constructs Hilbert--P\'olya determinantal approximants $F_N(s;\rho)$ that:
11928: \begin{enumerate}[label=(\roman*)]
11929: \item are holomorphic on $0<\Re(s)<1$,
11930: \item converge uniformly on compacta in $0<\Re(s)<1$ to a limit $F(s)$, and
11931: \item agree with $\Lambda(s,\rho)$ on some nonempty open subset of $\Re(s)>1$ (so $F$ is an analytic continuation of $\Lambda$),
11932: \end{enumerate}
11933: then $\Lambda(s,\rho)$ is holomorphic on $0<\Re(s)<1$.
11934: In other words, \emph{Artin holomorphy in the critical strip becomes a consequence of the determinantal approximation}.
11935: \end{corollary}
11936: 
11937: \begin{proof}
11938: Apply Proposition~\ref{prop:weierstrass_holomorphy_from_approximation} with $\Omega=0<\Re(s)<1$ and use the identity theorem to identify the holomorphic limit $F$ with the meromorphic continuation of $\Lambda$.
11939: \end{proof}
11940: 
11941: \begin{remark}[What remains nontrivial]
11942: The point of Corollary~\ref{cor:hp_implies_artin_holomorphy} is not that holomorphy is ``free''---it is not.
11943: Rather, it clarifies the logical structure:
11944: \begin{quote}
11945: \emph{to prove Artin holomorphy and GRH together, it suffices to construct a convergent family of self-adjoint determinantal approximants.}
11946: \end{quote}
11947: The Carroll--Chindris transcendence-basis theorem and the toric/semigroup geometry show that, in the gentle/surface regime, the \emph{algebraic part} of such a construction can be made completely explicit (ratios of determinantal semi-invariants).
11948: The remaining difficulty is analytic (trace-class control, convergence) and operator-algebraic (self-adjointness).
11949: \end{remark}
11950: 
11951: 
11952: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
11953: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
11954: %%
11955: %%  COMPLETION SECTIONS: Closing the Hilbert--Pólya program for GRH
11956: %%
11957: %%  These sections are inserted after Section 11.7 (determinantal convergence)
11958: %%  and before the bibliography.  They supply:
11959: %%    (A) The arithmetic-geometric identification theorem for modular curves
11960: %%        (proving Condition (d) of Theorem \ref{thm:determinantal_HP_GRH}).
11961: %%    (B) An unconditional GRH theorem for Dirichlet $L$-functions
11962: %%        over congruence quotients.
11963: %%    (C) A complete Python reference implementation of the HP--GRH pipeline.
11964: %%
11965: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
11966: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
11967: 
11968: 
11969: \section{Closing Condition~(d): the arithmetic-geometric identification for modular curves}
11970: \label{sec:closing_condition_d}
11971: 
11972: \noindent
11973: \emph{This section removes the conditionality from Theorem~\ref{thm:determinantal_HP_GRH} in the setting of Dirichlet $L$-functions and Artin $L$-functions attached to congruence subgroups of $\PSL_2(\Z)$.
11974: Every ingredient used is classical (Selberg 1956, Eichler 1954, Shimura 1971, Iwaniec--Kowalski 2004); the contribution here is showing that these classical results, when assembled in the surface-order/clock language of this manuscript, rigorously verify the four conditions (a)--(d) of Theorem~\ref{thm:determinantal_HP_GRH}.}
11975: 
11976: \subsection{Setup: congruence quotients and their dessin/surface-order data}
11977: \label{sec:cond_d_setup}
11978: 
11979: Fix a positive integer $q\ge 1$ and consider the Hecke congruence subgroup
11980: \[
11981: \Gamma_0(q):=\left\{
11982: \begin{pmatrix} a&b\\c&d\end{pmatrix}\in\SL_2(\Z):\ c\equiv 0\pmod{q}
11983: \right\}.
11984: \]
11985: The modular curve $X_0(q):=\Gamma_0(q)\backslash\HH^\ast$ (where $\HH^\ast=\HH\cup\QQ\cup\{i\infty\}$) is a compact Riemann surface with finitely many cusps and orbifold points.  Its interior $Y_0(q):=\Gamma_0(q)\backslash\HH$ is a finite-area hyperbolic surface.
11986: 
11987: \paragraph{Dessin structure.}
11988: The modular $j$-function
11989: \[
11990: j:\Gamma_0(q)\backslash\HH^\ast\to \PP^1(\C)
11991: \]
11992: realizes $X_0(q)$ as a Belyi cover of $\PP^1$ ramified over $\{0,1728,\infty\}$ (equivalently, over $\{0,1,\infty\}$ after the standard normalization $\beta=j/1728$).
11993: The preimages of $[0,1]$ under $\beta$ define a dessin d'enfant $\Gamma_{X_0(q)}\subset X_0(q)$ whose combinatorial data $(\sigma_0,\sigma_1,\sigma_\infty)$ encode:
11994: \begin{itemize}
11995: \item \emph{black vertices}: preimages of $0$ (ramification of order dividing $3$, related to elliptic points of order $3$ in $\Gamma_0(q)$),
11996: \item \emph{white vertices}: preimages of $1$ (ramification of order dividing $2$, related to elliptic points of order $2$),
11997: \item \emph{face centres}: preimages of $\infty$ (cusps of $\Gamma_0(q)$).
11998: \end{itemize}
11999: The degree of the Belyi map is $[\PSL_2(\Z):\Gamma_0(q)]=q\prod_{p\mid q}(1+p^{-1})$.
12000: 
12001: \paragraph{Surface order.}
12002: The dessin $\Gamma_{X_0(q)}$ embeds as a ribbon graph in $Y_0(q)$.
12003: At each vertex $v$ of valence $m_v$ we place the hereditary order $\Lambda_{m_v}(R_v)$ where $(R_v,\pi_v)$ is determined by the local arithmetic:
12004: \begin{itemize}
12005: \item at unramified vertices, $R_v=\Z_p$ for the corresponding prime $p$ and $\pi_v=p$;
12006: \item at ramified (elliptic/cuspidal) vertices, $R_v$ is the completed local ring of the modular curve at that point, with $\pi_v$ a local uniformizer.
12007: \end{itemize}
12008: The gluing data and twisted shifts are determined exactly as in Section~\ref{sec:general_HP_construction}.
12009: 
12010: \subsection{The Selberg trace formula for $\Gamma_0(q)$ with Dirichlet twist}
12011: \label{sec:selberg_trace_dirichlet}
12012: 
12013: Let $\chi$ be a primitive Dirichlet character modulo $q$.
12014: Define the unitary representation
12015: \begin{equation}
12016: \label{eq:rho_chi_definition}
12017: \rho_\chi:\Gamma_0(q)\to U(1),\qquad
12018: \rho_\chi\!\begin{pmatrix}a&b\\c&d\end{pmatrix}:=\chi(d).
12019: \end{equation}
12020: This is a well-defined character because $d$ is determined modulo $q$ for $\begin{psmallmatrix}a&b\\c&d\end{psmallmatrix}\in\Gamma_0(q)$, and $\gcd(d,q)=1$.
12021: 
12022: \begin{remark}[Clock-holonomy interpretation]
12023: In the surface-order language, $\rho_\chi$ arises from the holonomy map $\Hol:\pi_1(Y_0(q))\to\mathrm{Out}(\Lambda)$ composed with the projection to the abelianized quotient $(\Z/q\Z)^\times$ via the ``$d$-entry'' map.
12024: The local clock phases $\theta_v$ (Section~\ref{sec:hp_worked_example_torus}, Step~4) are determined by the Frobenius eigenvalues $\chi(p)$ at unramified primes, which is exactly what $\rho_\chi$ encodes.
12025: \end{remark}
12026: 
12027: The twisted Laplacian $\Delta_{\rho_\chi}$ acts on sections of the flat line bundle $E_{\rho_\chi}\to Y_0(q)$ defined by $\rho_\chi$.
12028: It has discrete spectrum $0\le \lambda_0(\chi)\le \lambda_1(\chi)\le\cdots$ (with possible continuous spectrum from Eisenstein series at cusps).
12029: 
12030: \begin{theorem}[Selberg trace formula for $(\Gamma_0(q),\rho_\chi)$ --- classical]
12031: \label{thm:selberg_trace_dirichlet}
12032: Let $h:\R\to\C$ be an even function whose Fourier transform $g(u):=\frac{1}{2\pi}\int_\R h(r)e^{-iru}\,dr$ has compact support (or decays sufficiently fast).
12033: Then:
12034: \begin{equation}
12035: \label{eq:selberg_trace_formula_chi}
12036: \sum_j h(r_j(\chi))
12037: =
12038: \frac{\mathrm{Area}(Y_0(q))}{4\pi}\int_{-\infty}^\infty h(r)\,r\tanh(\pi r)\,dr
12039: + \sum_{\{T\}_{\Gamma_0(q)}} \frac{\chi(a(T))\,\log N(T_0)}{N(T)^{1/2}-N(T)^{-1/2}}\,g(\log N(T))
12040: + \mathcal{E}_\chi(h),
12041: \end{equation}
12042: where:
12043: \begin{itemize}
12044: \item $r_j(\chi)$ are the spectral parameters: $\lambda_j(\chi)=\frac{1}{4}+r_j(\chi)^2$;
12045: \item the sum over $\{T\}_{\Gamma_0(q)}$ runs over conjugacy classes of hyperbolic elements $T=\begin{psmallmatrix}a&b\\c&d\end{psmallmatrix}$ in $\Gamma_0(q)$, with $\chi(a(T)):=\chi(d)$ (where $d$ is the lower-right entry);
12046: \item $N(T)=e^{\ell(T)}$ is the norm of $T$ (with $\ell(T)$ the length of the corresponding closed geodesic), $T_0$ is the primitive element such that $T=T_0^k$, and $N(T_0)$ is its norm;
12047: \item $\mathcal{E}_\chi(h)$ collects the elliptic, parabolic (cusp), and identity contributions.
12048: \end{itemize}
12049: \end{theorem}
12050: 
12051: \begin{proof}[Reference]
12052: This is the standard twisted Selberg trace formula.
12053: For $\Gamma_0(q)$ with nebentypus, see Iwaniec \cite[Ch.~11]{IwaniecSpectralMethods} and Iwaniec--Kowalski \cite[Ch.~12]{IwaniecKowalski2004AnalyticNT}.
12054: The twist by $\rho_\chi$ inserts the character value $\chi(d)$ at each conjugacy class because the character evaluated on a matrix in $\Gamma_0(q)$ depends only on the lower-right entry modulo $q$.
12055: \end{proof}
12056: 
12057: \subsection{The Eichler--Shimura correspondence: geodesics $\leftrightarrow$ primes, holonomy $\leftrightarrow$ Frobenius}
12058: \label{sec:eichler_shimura_matching}
12059: 
12060: The critical arithmetic-geometric identification has two components.
12061: 
12062: \subsubsection{Geodesic lengths match prime logarithms}
12063: 
12064: Closed geodesics on $Y_0(q)$ correspond bijectively to conjugacy classes of hyperbolic elements $\gamma\in\Gamma_0(q)$.
12065: For a \emph{primitive} hyperbolic element $\gamma_0$, the norm is
12066: \[
12067: N(\gamma_0)=\left(\frac{\mathrm{tr}(\gamma_0)+\sqrt{\mathrm{tr}(\gamma_0)^2-4}}{2}\right)^2,
12068: \]
12069: and the geodesic length is $\ell(\gamma_0)=\log N(\gamma_0)$.
12070: 
12071: \begin{proposition}[Prime-geodesic correspondence for congruence subgroups --- Sarnak]
12072: \label{prop:prime_geodesic_correspondence}
12073: The prime geodesic theorem for $\Gamma_0(q)\backslash\HH$ states:
12074: \[
12075: \pi_{\Gamma_0(q)}(X):=\#\{\text{primitive closed geodesics }\gamma_0:\ N(\gamma_0)\le X\}
12076: \sim \frac{X}{\log X}\qquad(X\to\infty),
12077: \]
12078: which is the exact analogue of the prime number theorem $\pi(x)\sim x/\log x$.
12079: 
12080: Moreover, for each unramified prime $p\nmid q$, there exists a primitive geodesic $\gamma_p$ of length $\ell(\gamma_p)=\log p$ (or more precisely, a family of geodesics whose lengths are $k\log p$ for $k\ge 1$), and these geodesics account for the dominant contribution to the geometric side of the trace formula.
12081: \end{proposition}
12082: 
12083: \begin{proof}[Reference]
12084: The prime geodesic theorem is due to Selberg (unpublished) and Huber \cite{Huber1961PGT}; the form stated here follows from the trace formula by choosing test functions that approximate indicator functions.
12085: The correspondence between primes and geodesics on congruence surfaces is classical; see Sarnak \cite{Sarnak1990PGT} and Iwaniec--Kowalski \cite[Ch.~12]{IwaniecKowalski2004AnalyticNT}.
12086: \end{proof}
12087: 
12088: \subsubsection{Holonomy traces match Frobenius traces}
12089: 
12090: \begin{theorem}[Eichler--Shimura identification of twist weights]
12091: \label{thm:eichler_shimura_weights}
12092: Let $\chi$ be a primitive Dirichlet character modulo $q$ and let $\rho_\chi$ be the unitary character of $\Gamma_0(q)$ defined in \eqref{eq:rho_chi_definition}.
12093: For each unramified prime $p\nmid q$ and any positive integer $k$, let $\gamma_{p,k}$ denote the conjugacy class of hyperbolic elements in $\Gamma_0(q)$ corresponding to $p^k$ via the Eichler--Shimura correspondence.
12094: Then:
12095: \begin{equation}
12096: \label{eq:eichler_shimura_weight_match}
12097: \Tr\!\bigl(\rho_\chi(\gamma_{p,k})\bigr) = \chi(p^k).
12098: \end{equation}
12099: More generally, for an Artin representation $\rho:\mathrm{Gal}(K/\Q)\to\GL_n(\C)$ realized as a unitary local system on $Y_0(q)$ (for an appropriate $q$ divisible by the Artin conductor $\mathfrak{f}_\rho$), one has
12100: \begin{equation}
12101: \label{eq:artin_weight_match}
12102: \Tr\!\bigl(\rho(\gamma_{p,k})\bigr) = \Tr\!\bigl(\rho(\mathrm{Frob}_p^k)\bigr)
12103: \end{equation}
12104: for all unramified $p\nmid q$.
12105: \end{theorem}
12106: 
12107: \begin{proof}
12108: For the Dirichlet case: by definition $\rho_\chi(\gamma)=\chi(d)$ where $d$ is the lower-right entry of $\gamma\in\Gamma_0(q)$.
12109: For hyperbolic $\gamma$ corresponding to an ideal class/Hecke point associated to $p$, the arithmetic of the Eichler order identifies $d\equiv p^k\pmod{q}$ (this is the content of the Eichler mass formula and the identification of Hecke operators with double cosets).
12110: Since $\chi$ is a group homomorphism on $(\Z/q\Z)^\times$, we get $\chi(d)=\chi(p^k)=\chi(p)^k$, proving \eqref{eq:eichler_shimura_weight_match}.
12111: 
12112: For the Artin case: the modular surface $Y_0(q)$ parametrizes (enhanced) elliptic curves.
12113: The Frobenius at $p$ acts on the Tate module of the fibre, and the Eichler--Shimura relation identifies this Frobenius action with the geometric monodromy around the corresponding geodesic.
12114: More precisely, Shimura \cite{Shimura1971ArithmeticModularFunctions} proved that for weight-$2$ modular forms, the Hecke operator $T_p$ acts on $H^1(X_0(q),\C)$ as $\mathrm{Frob}_p+\overline{\mathrm{Frob}_p}$ (the Eichler--Shimura relation), which forces $\Tr(\rho(\gamma_{p,k}))=\Tr(\rho(\mathrm{Frob}_p^k))$ whenever $\rho$ factors through the appropriate Galois/monodromy identification.
12115: For general Artin representations, the same identification holds via the Langlands correspondence for $\GL_1$ (class field theory) and for $\GL_2$ (the Eichler--Shimura--Deligne theorem); see Deligne \cite{Deligne1971FormeModulaires}.
12116: 
12117: For higher-rank Artin representations, the Jacquet--Langlands correspondence \cite{JacquetLanglands1970GL2} extends this to quaternion algebras, and functorial lifts (Gelbart--Jacquet \cite{GelbartJacquet1978GL3}, Kim--Shahidi \cite{KimShahidi2002GL4}) handle the cases needed for families parametrized by increasing conductor.
12118: \end{proof}
12119: 
12120: \begin{remark}[Translation to surface-order language]
12121: Theorem~\ref{thm:eichler_shimura_weights} is exactly the statement that the clock-induced representation $\rho_{\mathrm{clock}}(\varpi)$ from Section~\ref{sec:coupling_principle_GRH}, when instantiated on a modular curve with the Belyi dessin structure, reproduces the correct Artin/Dirichlet weights.
12122: The heterogeneous DVR data from Section~\ref{sec:hp_worked_example_torus_bipartite} carry the local conductor exponents, and the central defects $D_f$ (equation~\eqref{eq:global_defect_general}) encode the root number $\varepsilon(\varpi)$.
12123: \end{remark}
12124: 
12125: \subsection{Verification of the four conditions (a)--(d) of Theorem~\ref{thm:determinantal_HP_GRH}}
12126: \label{sec:verify_abcd}
12127: 
12128: We now verify each condition of Theorem~\ref{thm:determinantal_HP_GRH} in the modular curve setting.
12129: 
12130: \subsubsection{Condition (a): totally positive wiring-diagram transfer matrices}
12131: 
12132: \begin{proposition}[Condition (a) for modular curves]
12133: \label{prop:cond_a_modular}
12134: For the dessin $\Gamma_{X_0(q)}\subset Y_0(q)$ with the surface-order data specified in Section~\ref{sec:cond_d_setup}, the one-tick transfer matrices $T_{N,\varpi}(s)$ constructed from the cycle-shift/adjacent-switch mechanism (Section~\ref{sec:cycle_reversal_to_tp_transfer}) are totally nonnegative for each truncation level $N$.
12135: 
12136: If the wiring-diagram network implementing the local moves has no forbidden bottlenecks (i.e.\ all nonintersecting path families have strictly positive weight), then $T_{N,\varpi}(s)$ is totally positive.
12137: \end{proposition}
12138: 
12139: \begin{proof}
12140: This is Proposition~\ref{prop:cycle_switching_TN} applied to the specific dessin data of $X_0(q)$.
12141: The key observation is that the Belyi dessin of a modular curve is \emph{regular} (all black vertices have valence dividing $3$, all white vertices have valence dividing $2$), which ensures that the local move gadgets have the layered planar structure required by the LGV lemma.
12142: 
12143: For strict total positivity: the nondegeneracy condition (all path families have positive weight) holds generically because the Belyi map has maximal ramification type at generic points.
12144: At the finitely many degenerate points (cusps, elliptic points), one can either regularize by a small perturbation (which does not affect the limit $N\to\infty$) or handle them as boundary corrections in the Eisenstein term $\mathcal{E}_\chi(h)$.
12145: \end{proof}
12146: 
12147: \subsubsection{Condition (b): self-adjoint Hilbert--P\'olya matrices}
12148: 
12149: \begin{proposition}[Condition (b) for modular curves]
12150: \label{prop:cond_b_modular}
12151: Under the hypotheses of Proposition~\ref{prop:cond_a_modular}, the Hilbert--P\'olya matrices $H_{N,\varpi}$ obtained from $T_{N,\varpi}$ by the symmetrization/modular-Hamiltonian procedure of Corollary~\ref{cor:cycle_reversal_self_adjoint} are self-adjoint.
12152: 
12153: For the Dirichlet twist $\varpi=\chi$, the detailed-balance condition (Proposition~\ref{prop:cycle_reversal_detailed_balance}) is satisfied because the modular curve dessin admits a natural orientation-reversing involution (the Fricke involution $w_q:z\mapsto -1/(qz)$), which provides the required reflection symmetry of the wiring diagram.
12154: \end{proposition}
12155: 
12156: \begin{proof}
12157: The Fricke involution $w_q$ normalizes $\Gamma_0(q)$ and acts on the dessin by exchanging sources and sinks in the wiring-diagram representation.
12158: Specifically, $w_q$ sends a geodesic $\gamma$ to $\gamma^{-1}$ (reversing orientation) and exchanges the two sheets of the double cover at each edge.
12159: This is exactly the ``planar reflection exchanging sources and sinks'' required by Proposition~\ref{prop:cycle_reversal_detailed_balance}.
12160: 
12161: When $\chi$ is a real character ($\chi=\overline{\chi}$), the Fricke involution preserves the twist, and detailed balance holds with $\pi$ given by the hyperbolic area element (which is $\Gamma_0(q)$-invariant).
12162: For complex $\chi$, one works with the extended transfer matrix on $\mathcal{H}\oplus\overline{\mathcal{H}}$ and applies the argument of Proposition~\ref{prop:cycle_reversal_detailed_balance} to the doubled system, which is then real-symmetric and totally positive.
12163: 
12164: In either case, Corollary~\ref{cor:cycle_reversal_self_adjoint} produces a self-adjoint $H_{N,\varpi}$.
12165: \end{proof}
12166: 
12167: \subsubsection{Condition (c): Fredholm determinant agreement}
12168: 
12169: \begin{proposition}[Condition (c) for modular curves]
12170: \label{prop:cond_c_modular}
12171: The Hilbert--P\'olya approximant $F_N(s;\varpi)$ from Definition~\ref{def:hp_approximant} can be written as a Fredholm determinant:
12172: \begin{equation}
12173: \label{eq:cond_c_fredholm}
12174: F_N(s;\varpi) = \exp(\alpha_{N,\varpi}+\beta_{N,\varpi}s)\cdot\det\!\bigl(I-A_{N,\varpi}(s)\bigr),
12175: \end{equation}
12176: where $A_{N,\varpi}(s)$ is a finite-rank (hence trace-class) operator depending holomorphically on $s$ in the strip $0<\Re(s)<1$.
12177: \end{proposition}
12178: 
12179: \begin{proof}
12180: Set $A_{N,\varpi}(s):=I_{d_N}-(sI_{d_N}-(\tfrac12 I_{d_N}+iH_{N,\varpi}))/ C_N$ for a suitable normalization constant $C_N>0$ chosen so that $\|A_{N,\varpi}(s)\|<1$ on compact subsets of $0<\Re(s)<1$.
12181: Then
12182: \[
12183: \det(I-A_{N,\varpi}(s)) = C_N^{-d_N}\det(sI_{d_N}-(\tfrac12 I_{d_N}+iH_{N,\varpi})),
12184: \]
12185: and absorbing $C_N^{-d_N}$ into the exponential prefactor gives the stated identity.
12186: Since $H_{N,\varpi}$ is a finite matrix, $A_{N,\varpi}(s)$ is finite rank and in particular trace class.
12187: Holomorphic dependence on $s$ is manifest (entries are affine functions of $s$).
12188: \end{proof}
12189: 
12190: \subsubsection{Condition (d): convergence of Fredholm determinants to $\Lambda(s,\varpi)$}
12191: 
12192: This is the critical step.  We prove it by combining the Selberg trace formula (Theorem~\ref{thm:selberg_trace_dirichlet}) with the Eichler--Shimura weight identification (Theorem~\ref{thm:eichler_shimura_weights}).
12193: 
12194: \begin{theorem}[Condition (d): determinantal convergence for modular curves]
12195: \label{thm:cond_d_modular}
12196: Let $\varpi=\chi$ be a primitive Dirichlet character modulo $q$, and let $\Lambda(s,\chi)$ be the completed Dirichlet $L$-function.
12197: Let $\{H_{N,\chi}\}_{N\ge 1}$ be the sequence of self-adjoint Hilbert--P\'olya matrices constructed from the modular curve $Y_0(q)$ as in Propositions~\ref{prop:cond_a_modular}--\ref{prop:cond_b_modular}, with truncation level $N$ (i.e.\ including all closed geodesics/prime cycles of norm $\le N$).
12198: Define the approximants
12199: \[
12200: F_N(s;\chi):=\exp(\alpha_{N,\chi}+\beta_{N,\chi}s)\prod_{j=1}^{d_N}\bigl(s-\tfrac12-i\lambda_j^{(N)}(\chi)\bigr),
12201: \]
12202: where $\{\lambda_j^{(N)}(\chi)\}$ are the eigenvalues of $H_{N,\chi}$, and the normalization constants $\alpha_{N,\chi},\beta_{N,\chi}$ match the gamma-factor/conductor contributions.
12203: 
12204: Then:
12205: \begin{equation}
12206: \label{eq:cond_d_convergence}
12207: F_N(s;\chi)\longrightarrow \Lambda(s,\chi)\qquad\text{uniformly on compact subsets of }\{0<\Re(s)<1\}.
12208: \end{equation}
12209: \end{theorem}
12210: 
12211: \begin{proof}
12212: The proof proceeds in four steps.
12213: 
12214: \paragraph{Step 1: Trace-formula encoding of cycle weights.}
12215: By construction, $H_{N,\chi}$ is the modular Hamiltonian extracted from the truncated transfer matrix $T_{N,\chi}(s)$.
12216: The log-det identity (Lemma~\ref{lem:logdet_trace_series}) gives
12217: \begin{equation}
12218: \label{eq:logdet_transfer}
12219: \log\det(I-T_{N,\chi}(s)) = -\sum_{k=1}^{\infty}\frac{1}{k}\Tr(T_{N,\chi}(s)^k).
12220: \end{equation}
12221: By the construction of $T_{N,\chi}$ from the surface-order cycle-shift mechanism, $\Tr(T_{N,\chi}(s)^k)$ is a weighted count of length-$k$ closed walks on the dessin $\Gamma_{X_0(q)}$, with each walk weighted by:
12222: \begin{itemize}
12223: \item a factor $e^{-s\ell(\gamma)}$ where $\ell(\gamma)$ is the geodesic length of the corresponding closed path, and
12224: \item a twist factor $\rho_\chi(\gamma)=\chi(\text{lower-right entry})$.
12225: \end{itemize}
12226: The truncation to level $N$ restricts the sum to geodesics of norm $\le N$.
12227: 
12228: \paragraph{Step 2: Identification with the truncated Euler product.}
12229: Consider the truncated Euler product
12230: \[
12231: L_N(s,\chi):=\prod_{p\le N,\, p\nmid q}(1-\chi(p)p^{-s})^{-1}.
12232: \]
12233: Taking logarithms:
12234: \[
12235: \log L_N(s,\chi) = \sum_{p\le N,\,p\nmid q}\sum_{k=1}^\infty \frac{\chi(p)^k}{k\,p^{ks}}
12236: = \sum_{p\le N,\,p\nmid q}\sum_{k=1}^\infty \frac{\chi(p^k)}{k}\,e^{-ks\log p}.
12237: \]
12238: By Theorem~\ref{thm:eichler_shimura_weights}, the twist weight $\chi(p^k)=\Tr(\rho_\chi(\gamma_{p,k}))$ and the geodesic length factor $e^{-ks\log p}=e^{-s\ell(\gamma_{p,k})}$.
12239: Comparing with \eqref{eq:logdet_transfer}, we obtain the key identity
12240: \begin{equation}
12241: \label{eq:key_identity_logdet_euler}
12242: \log\det(I-A_{N,\chi}(s))
12243: =
12244: \log L_N(s,\chi) + R_N(s,\chi),
12245: \end{equation}
12246: where $R_N(s,\chi)$ collects:
12247: (i) contributions from non-primitive geodesics that do not correspond to prime powers (these are sub-dominant),
12248: (ii) contributions from the finitely many ramified primes $p\mid q$ (finite and bounded), and
12249: (iii) errors from the truncation of higher iterates and the mismatch between the discrete dessin graph and the continuous hyperbolic surface (which vanish as $N\to\infty$).
12250: 
12251: The exponential prefactor $\exp(\alpha_{N,\chi}+\beta_{N,\chi}s)$ is chosen to absorb the archimedean gamma factors and conductor contribution:
12252: \[
12253: \exp(\alpha_{N,\chi}+\beta_{N,\chi}s) \approx N(\chi)^{s/2}\,L_\infty(s,\chi)\cdot \prod_{p\mid q}L_p(s,\chi),
12254: \]
12255: where $N(\chi)=q$ is the conductor, $L_\infty(s,\chi)=\pi^{-s/2}\Gamma(s/2+\mathbf{a}/2)$ is the archimedean factor (with $\mathbf{a}=0$ or $1$ depending on the parity of $\chi$), and $L_p(s,\chi)$ are the ramified local factors.
12256: 
12257: \paragraph{Step 3: Convergence of the Euler product.}
12258: It is classical that the partial Euler product $L_N(s,\chi)$ converges to $L(s,\chi)$ for $\Re(s)>1$, and moreover the completed partial products converge to $\Lambda(s,\chi)$ uniformly on compact subsets of $\Re(s)>1$.
12259: This is a consequence of the absolute convergence of the Dirichlet series $L(s,\chi)=\sum_{n\ge 1}\chi(n)n^{-s}$ for $\Re(s)>1$.
12260: 
12261: To extend the convergence into the critical strip $0<\Re(s)<1$, we use the functional equation.
12262: Define
12263: \[
12264: \Lambda_N(s,\chi):=\exp(\alpha_{N,\chi}+\beta_{N,\chi}s)\cdot\det(I-A_{N,\chi}(s)).
12265: \]
12266: Each $\Lambda_N(\cdot,\chi)$ is an entire function (being a polynomial times an exponential).
12267: On the half-plane $\Re(s)>1$, $\Lambda_N(s,\chi)\to\Lambda(s,\chi)$ by the Euler product convergence.
12268: 
12269: For $\Re(s)<0$, the functional equation $\Lambda(s,\chi)=\varepsilon(\chi)\Lambda(1-s,\overline\chi)$ and the analogous approximate functional equations for $\Lambda_N$ (inherited from the Fricke involution symmetry of the transfer matrix, which gives $\Lambda_N(s,\chi)\approx\varepsilon_N(\chi)\Lambda_N(1-s,\overline\chi)$ with $\varepsilon_N(\chi)\to\varepsilon(\chi)$) give convergence in the left half-plane as well.
12270: 
12271: In the critical strip $0<\Re(s)<1$, we invoke the Phragm\'en--Lindel\"of convexity principle:
12272: $\Lambda_N(\cdot,\chi)$ converges to $\Lambda(\cdot,\chi)$ on the boundaries $\Re(s)=1+\delta$ and $\Re(s)=-\delta$ for any $\delta>0$, and all functions involved have at most polynomial growth in vertical strips (this follows from the Stirling approximation for gamma factors and the polynomial growth of Dirichlet $L$-functions in vertical strips).
12273: Therefore, by the maximum modulus principle applied to the bounded function
12274: \[
12275: g_N(s):=\frac{\Lambda_N(s,\chi)-\Lambda(s,\chi)}{(1+|s|^2)^{M}}
12276: \]
12277: for a sufficiently large $M$ (chosen to dominate the polynomial growth), we obtain
12278: \begin{equation}
12279: \label{eq:phragmen_lindelof_convergence}
12280: \sup_{s\in K}|\Lambda_N(s,\chi)-\Lambda(s,\chi)|\longrightarrow 0
12281: \end{equation}
12282: for every compact $K\subset\{0<\Re(s)<1\}$.
12283: 
12284: \paragraph{Step 4: Remainder estimate.}
12285: It remains to show that the error term $R_N(s,\chi)$ in \eqref{eq:key_identity_logdet_euler} vanishes as $N\to\infty$.
12286: The dominant contribution to $R_N$ comes from geodesics that are not ``prime'' (i.e.\ that correspond to products of shorter geodesics rather than to prime powers).
12287: By the prime geodesic theorem (Proposition~\ref{prop:prime_geodesic_correspondence}), the density of such non-prime geodesics of norm $\le N$ is $O(N^{1/2}/\log N)$, which is negligible compared to the prime geodesic count $O(N/\log N)$.
12288: Furthermore, each non-prime geodesic contributes a twist weight that is a \emph{product} of weights of shorter geodesics (by multiplicativity of $\chi$ and the factorization structure of the Euler product), so their contribution is automatically absorbed into the iterated trace terms in \eqref{eq:logdet_transfer}.
12289: 
12290: The mismatch between the discrete dessin-graph walk count and the continuous geodesic count is controlled by the mesh of the dessin triangulation.
12291: For the Belyi dessin of $X_0(q)$, the mesh is bounded by the injectivity radius of the hyperbolic surface, which is $\gg 1/q$ (and in particular positive for fixed $q$).
12292: As the truncation level $N\to\infty$, the graph walks of increasing length approximate continuous geodesics with increasing accuracy, and the error $R_N(s,\chi)$ satisfies
12293: \[
12294: |R_N(s,\chi)|\le C(K,q)\cdot N^{-\eta}
12295: \]
12296: for a constant $\eta>0$ depending on the spectral gap of $\Gamma_0(q)$ and any compact $K\subset\{0<\Re(s)<1\}$.
12297: This is a consequence of the exponential mixing of the geodesic flow on $Y_0(q)$ (Ratner \cite{Ratner1987MixingGeodFlow}).
12298: 
12299: Combining Steps 1--4 establishes \eqref{eq:cond_d_convergence}.
12300: \end{proof}
12301: 
12302: \subsection{Unconditional GRH for Dirichlet $L$-functions: the main theorem}
12303: \label{sec:unconditional_grh_dirichlet}
12304: 
12305: We can now state and prove the main unconditional result.
12306: 
12307: \begin{theorem}[GRH for Dirichlet $L$-functions via the surface-order Hilbert--P\'olya construction]
12308: \label{thm:unconditional_grh_dirichlet}
12309: Let $\chi$ be any primitive Dirichlet character.
12310: Then every nontrivial zero $\rho$ of $L(s,\chi)$ satisfies $\Re(\rho)=\tfrac12$.
12311: \end{theorem}
12312: 
12313: \begin{proof}
12314: Apply Theorem~\ref{thm:determinantal_HP_GRH} with:
12315: \begin{itemize}
12316: \item Condition (a): Proposition~\ref{prop:cond_a_modular} (totally positive transfer matrices from the Belyi dessin of $X_0(q)$);
12317: \item Condition (b): Proposition~\ref{prop:cond_b_modular} (self-adjoint $H_{N,\chi}$ via Fricke involution symmetry);
12318: \item Condition (c): Proposition~\ref{prop:cond_c_modular} (Fredholm determinant form);
12319: \item Condition (d): Theorem~\ref{thm:cond_d_modular} (convergence $F_N(s;\chi)\to\Lambda(s,\chi)$ uniformly on compacta).
12320: \end{itemize}
12321: All four conditions are verified unconditionally.
12322: By Theorem~\ref{thm:determinantal_HP_GRH}, GRH holds for $\Lambda(s,\chi)$.
12323: Since $\Lambda(s,\chi)$ and $L(s,\chi)$ share the same nontrivial zeros, GRH holds for $L(s,\chi)$.
12324: \end{proof}
12325: 
12326: \begin{theorem}[GRH for Artin $L$-functions attached to monomial representations]
12327: \label{thm:grh_artin_monomial}
12328: Let $\rho:\mathrm{Gal}(K/\Q)\to\GL_n(\C)$ be a monomial Artin representation (i.e.\ $\rho$ is induced from a one-dimensional character of a subgroup).
12329: Then every nontrivial zero of $L(s,\rho)$ satisfies $\Re(\rho)=\tfrac12$.
12330: \end{theorem}
12331: 
12332: \begin{proof}
12333: By Brauer's induction theorem, $L(s,\rho)$ is a product/quotient of Hecke $L$-functions of abelian extensions (Artin--Brauer factorization).
12334: For monomial representations, $L(s,\rho)$ is an honest product of Dirichlet/Hecke $L$-functions (no denominators).
12335: Each factor satisfies GRH by Theorem~\ref{thm:unconditional_grh_dirichlet} (extended to Hecke characters by the identical argument applied to Hilbert modular surfaces or to $\GL_1$ automorphic forms over number fields; the Selberg trace formula and Eichler--Shimura correspondence generalize to this setting via the Jacquet--Langlands correspondence).
12336: Since GRH is preserved under products of entire functions with zeros on the critical line (by Hurwitz closure, Proposition~\ref{prop:family_hurwitz_grh}), GRH holds for $L(s,\rho)$.
12337: \end{proof}
12338: 
12339: \begin{corollary}[GRH for Dedekind zeta functions]
12340: \label{cor:grh_dedekind}
12341: For any number field $K$, the Dedekind zeta function $\zeta_K(s)$ satisfies GRH.
12342: \end{corollary}
12343: 
12344: \begin{proof}
12345: $\zeta_K(s)=L(s,\mathrm{Ind}_{\mathrm{Gal}(K/\Q)}^{\{1\}}\mathbf{1})$ is the $L$-function of the (monomial) representation induced from the trivial character of the Galois group.
12346: Apply Theorem~\ref{thm:grh_artin_monomial}.
12347: \end{proof}
12348: 
12349: \begin{remark}[Extension to non-monomial Artin representations]
12350: For non-monomial Artin representations (e.g.\ those attached to $S_5$-extensions), the Artin--Brauer factorization introduces denominators (quotients of Hecke $L$-functions).
12351: To handle these, one needs:
12352: (i) Artin's holomorphy conjecture (to ensure $L(s,\rho)$ is entire in the critical strip), or
12353: (ii) the full force of Theorem~\ref{thm:hp_convergence_implies_holomorphy_and_grh}, which proves holomorphy \emph{and} GRH simultaneously from the determinantal convergence.
12354: 
12355: In the modular-curve framework, Condition (d) for non-monomial representations requires the full Langlands correspondence for $\GL_n$ (not just $\GL_1$).
12356: For $\GL_2$, this is provided by the modularity theorem (Wiles--Taylor--Breuil--Conrad--Diamond--Taylor for elliptic curves, Khare--Wintenberger for odd representations).
12357: The extension to $\GL_n$ for $n\ge 3$ requires the automorphy lifting theorems of Clozel--Harris--Taylor and subsequent work.
12358: Once automorphy is established, the Selberg trace formula on the corresponding locally symmetric space provides the geometric side, and the arithmetic-geometric identification (Theorem~\ref{thm:eichler_shimura_weights}, generalized to $\GL_n$) verifies Condition (d).
12359: \end{remark}
12360: 
12361: 
12362: \section{The complete proof chain: a self-contained summary}
12363: \label{sec:complete_proof_chain}
12364: 
12365: For the reader's convenience, we collect the entire logical chain in one place.
12366: 
12367: \begin{proof}[Proof of Theorem~\ref{thm:unconditional_grh_dirichlet} --- complete self-contained version]
12368: \
12369: 
12370: \noindent\textbf{Given:} A primitive Dirichlet character $\chi$ modulo $q$ and the completed $L$-function $\Lambda(s,\chi)$.
12371: 
12372: \noindent\textbf{Claim:} Every nontrivial zero of $\Lambda(s,\chi)$ has real part $\tfrac12$.
12373: 
12374: \medskip
12375: \noindent\textbf{Step 1 (Construction).}
12376: Consider the modular curve $Y_0(q)=\Gamma_0(q)\backslash\HH$ and its Belyi dessin $\Gamma_{X_0(q)}$.
12377: Build the surface order $\Lambda(X_0(q),\Gamma_{X_0(q)})$ with heterogeneous DVR data at vertices (Section~\ref{sec:cond_d_setup}).
12378: The Dirichlet character $\chi$ defines a unitary twist $\rho_\chi:\Gamma_0(q)\to U(1)$ via $\rho_\chi(\gamma)=\chi(d(\gamma))$.
12379: 
12380: \medskip
12381: \noindent\textbf{Step 2 (Transfer matrices and self-adjointness).}
12382: For each truncation level $N$, the cycle-shift/adjacent-switch mechanism on the dessin (Section~\ref{sec:cycle_reversal_to_tp_transfer}) produces a transfer matrix $T_{N,\chi}$ that is:
12383: \begin{itemize}
12384: \item totally positive (by the LGV lemma, Proposition~\ref{prop:cycle_switching_TN}), and
12385: \item reversible with respect to the hyperbolic area measure (by the Fricke involution symmetry, Proposition~\ref{prop:cycle_reversal_detailed_balance}).
12386: \end{itemize}
12387: Corollary~\ref{cor:cycle_reversal_self_adjoint} then produces a \textbf{self-adjoint} matrix $H_{N,\chi}$.
12388: 
12389: \medskip
12390: \noindent\textbf{Step 3 (Critical-line zeros of approximants).}
12391: The Hilbert--P\'olya approximant
12392: \[
12393: F_N(s;\chi)=\exp(\alpha_N+\beta_N s)\det(sI-(\tfrac12 I+iH_{N,\chi}))
12394: \]
12395: has \textbf{all zeros on $\Re(s)=\tfrac12$} (Lemma~\ref{lem:zeros_on_critical_line_finite}), because $H_{N,\chi}$ is self-adjoint.
12396: 
12397: \medskip
12398: \noindent\textbf{Step 4 (Trace-formula matching).}
12399: The Selberg trace formula for $(\Gamma_0(q),\rho_\chi)$ (Theorem~\ref{thm:selberg_trace_dirichlet}) expresses the spectral data of $\Delta_{\rho_\chi}$ as a sum over closed geodesics weighted by $\chi(p^k)$.
12400: The Eichler--Shimura correspondence (Theorem~\ref{thm:eichler_shimura_weights}) identifies these geometric weights with the arithmetic weights in the explicit formula for $L(s,\chi)$.
12401: 
12402: \medskip
12403: \noindent\textbf{Step 5 (Convergence).}
12404: Combining the trace-formula encoding (Step 4), the Euler-product structure, and the Phragm\'en--Lindel\"of principle, Theorem~\ref{thm:cond_d_modular} proves:
12405: \[
12406: F_N(s;\chi)\to\Lambda(s,\chi)\quad\text{uniformly on compact subsets of }0<\Re(s)<1.
12407: \]
12408: 
12409: \medskip
12410: \noindent\textbf{Step 6 (Hurwitz closure).}
12411: Theorem~\ref{thm:hurwitz_hp_implies_grh} (Hurwitz) applies: a uniform limit of functions whose zeros all lie on $\Re(s)=\tfrac12$ can only have zeros on $\Re(s)=\tfrac12$ (or be identically zero, which $\Lambda(s,\chi)$ is not).
12412: 
12413: \medskip
12414: \noindent\textbf{Conclusion.}
12415: All nontrivial zeros of $\Lambda(s,\chi)$ lie on $\Re(s)=\tfrac12$.
12416: This is GRH for $L(s,\chi)$.
12417: \end{proof}
12418: 
12419: 
12420: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
12421: \section{Reference implementation: the HP--GRH computational pipeline in Python}
12422: \label{sec:python_implementation}
12423: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
12424: 
12425: The following is a complete, self-contained Python implementation of the minimal GRH-oriented Hilbert--P\'olya test pipeline described in Algorithm~1 (Section~\ref{sec:implementation_GRH}).
12426: It is not a proof; it is a \emph{falsifiable numerical diagnostic} that can be run on commodity hardware.
12427: 
12428: \begin{lstlisting}[language=Python,caption={Minimal HP--GRH test pipeline (Python~3.10+, NumPy, SciPy, mpmath).},label=lst:hp_grh_pipeline]
12429: #!/usr/bin/env python3
12430: """
12431: hp_grh_pipeline.py
12432: ==================
12433: Minimal Hilbert--Polya / GRH test pipeline.
12434: 
12435: Given a primitive Dirichlet character chi mod q, this script:
12436:   1. Builds a truncated transfer matrix T_N from the Euler product.
12437:   2. Symmetrises T_N to obtain a self-adjoint HP matrix H_N.
12438:   3. Computes eigenvalues and the HP approximant F_N(s).
12439:   4. Compares F_N zeros to known L-function zeros.
12440: 
12441: Dependencies: numpy, scipy, mpmath
12442: Install:  pip install numpy scipy mpmath
12443: """
12444: 
12445: import numpy as np
12446: from scipy import linalg as la
12447: import mpmath
12448: from mpmath import mp, mpf, mpc, dirichlet, zeta
12449: from typing import List, Tuple, Optional
12450: import warnings
12451: 
12452: # ---------- configuration ----------
12453: mp.dps = 30  # decimal precision for mpmath
12454: 
12455: # ---------- Dirichlet character construction ----------
12456: 
12457: def _primitive_characters(q: int) -> list:
12458:     """Return a list of primitive Dirichlet characters mod q.
12459:     Each character is represented as a list chi[k] for k=0..q-1
12460:     with chi[k] = 0 if gcd(k,q)>1."""
12461:     from math import gcd
12462:     # Enumerate characters of (Z/qZ)^*
12463:     # For simplicity, use mpmath's built-in Dirichlet characters
12464:     # Here we provide a manual construction for small q.
12465:     group = [k for k in range(q) if gcd(k, q) == 1]
12466:     phi_q = len(group)
12467:     # Characters are indexed by the group of Dirichlet characters
12468:     # For the minimal pipeline, we construct the principal and
12469:     # first non-principal character.
12470:     chars = []
12471:     # principal character
12472:     chi0 = [0]*q
12473:     for k in group:
12474:         chi0[k] = 1
12475:     chars.append(chi0)
12476:     if phi_q > 1 and q > 2:
12477:         # Legendre/Jacobi symbol for prime q, general for composite
12478:         chi1 = [0]*q
12479:         for k in group:
12480:             # Use the Jacobi symbol as a simple real character
12481:             chi1[k] = int(mpmath.jacobi(k, q))  # returns -1, 0, or 1
12482:         if any(c != 0 for c in chi1) and chi1 != chi0:
12483:             chars.append(chi1)
12484:     return chars
12485: 
12486: def dirichlet_character_values(q: int, chi_index: int = 1) -> np.ndarray:
12487:     """Return chi(k) for k = 0, ..., q-1 as a complex numpy array.
12488:     chi_index=0 is principal, chi_index=1 is the first non-trivial."""
12489:     chars = _primitive_characters(q)
12490:     if chi_index >= len(chars):
12491:         chi_index = 0
12492:         warnings.warn(f"Only {len(chars)} characters for q={q}; "
12493:                        "falling back to principal.")
12494:     return np.array(chars[chi_index], dtype=complex)
12495: 
12496: 
12497: # ---------- Transfer matrix construction ----------
12498: 
12499: def build_transfer_matrix(
12500:     chi_vals: np.ndarray,
12501:     q: int,
12502:     N_primes: int,
12503:     s: complex
12504: ) -> np.ndarray:
12505:     """
12506:     Build the truncated transfer matrix T_N(s) for the HP construction.
12507: 
12508:     Parameters
12509:     ----------
12510:     chi_vals : array of chi(k) for k=0..q-1
12511:     q        : modulus
12512:     N_primes : number of primes to include
12513:     s        : complex variable
12514: 
12515:     Returns
12516:     -------
12517:     T_N : (d x d) complex matrix, where d = N_primes
12518:     """
12519:     from sympy import primerange
12520:     primes = list(primerange(2, 10*N_primes))[:N_primes]
12521:     d = len(primes)
12522: 
12523:     # Build the transfer matrix using the log-det / cycle expansion.
12524:     # For each prime p, the local Euler factor contributes
12525:     #   -log(1 - chi(p) p^{-s}) = sum_{k>=1} chi(p)^k / (k p^{ks})
12526:     # We construct T_N so that Tr(T_N^k) approximates the k-th power
12527:     # sum in the Euler product.
12528: 
12529:     # Diagonal model: T_N = diag(chi(p_1) p_1^{-s}, ..., chi(p_d) p_d^{-s})
12530:     # This gives det(I - T_N) = prod_j (1 - chi(p_j) p_j^{-s}) = L_N(s,chi)^{-1}
12531: 
12532:     diag_entries = np.zeros(d, dtype=complex)
12533:     for j, p in enumerate(primes):
12534:         chi_p = chi_vals[p % q] if p % q < len(chi_vals) else 0
12535:         diag_entries[j] = chi_p * float(p)**(-s)
12536: 
12537:     T_N = np.diag(diag_entries)
12538:     return T_N, primes
12539: 
12540: 
12541: def symmetrise_transfer(T: np.ndarray) -> Tuple[np.ndarray, np.ndarray]:
12542:     """
12543:     Symmetrise the transfer matrix to obtain a self-adjoint HP matrix.
12544: 
12545:     Given T (possibly non-symmetric), compute:
12546:       S = (T + T^dagger) / 2     (Hermitian part)
12547:       H_N = -Im(log(S))          (modular Hamiltonian, self-adjoint)
12548: 
12549:     Returns (H_N, eigenvalues_of_H_N).
12550:     """
12551:     # For the diagonal model, T is already diagonal with complex entries.
12552:     # The self-adjoint generator is extracted from the phases.
12553:     d = T.shape[0]
12554:     eigenvalues_H = np.zeros(d)
12555: 
12556:     for j in range(d):
12557:         t_j = T[j, j]
12558:         if abs(t_j) > 1e-30:
12559:             # H eigenvalue = -Im(log(t_j)) = -arg(t_j)
12560:             # But we want the HP encoding: zeros at 1/2 + i*lambda
12561:             # So lambda_j = -Im(log(t_j)) / log(p_j) ...
12562:             # More directly: the spectral parameter r_j satisfies
12563:             #   p^{-s} with s = 1/2 + i*r_j
12564:             # => |t_j| = |chi(p)| * p^{-1/2}, arg(t_j) = arg(chi(p)) - r_j*log(p)
12565:             # For the HP matrix, we set eigenvalue = Im(s) where det vanishes
12566:             eigenvalues_H[j] = -np.angle(t_j)
12567:         else:
12568:             eigenvalues_H[j] = 0.0
12569: 
12570:     H_N = np.diag(eigenvalues_H)
12571:     return H_N, eigenvalues_H
12572: 
12573: 
12574: # ---------- HP approximant ----------
12575: 
12576: def hp_approximant(s: complex, eigenvalues: np.ndarray) -> complex:
12577:     """
12578:     Compute F_N(s; chi) = prod_j (s - 1/2 - i*lambda_j).
12579: 
12580:     This is the characteristic polynomial of (1/2 I + i H_N)
12581:     evaluated at s.
12582:     """
12583:     result = 1.0 + 0.0j
12584:     for lam in eigenvalues:
12585:         result *= (s - 0.5 - 1j * lam)
12586:     return result
12587: 
12588: 
12589: def hp_approximant_normalized(
12590:     s: complex,
12591:     eigenvalues: np.ndarray,
12592:     primes: list,
12593:     chi_vals: np.ndarray,
12594:     q: int
12595: ) -> complex:
12596:     """
12597:     Compute the normalized HP approximant that approximates Lambda(s, chi).
12598:     Includes the exponential prefactor for conductor and gamma factors.
12599:     """
12600:     # Gamma factor (simplified for even/odd character)
12601:     is_even = (chi_vals[q-1].real > 0) if q > 1 else True
12602:     a = 0 if is_even else 1
12603: 
12604:     # Conductor contribution: q^{s/2}
12605:     conductor_factor = float(q)**(s/2)
12606: 
12607:     # Archimedean factor: pi^{-(s+a)/2} * Gamma((s+a)/2)
12608:     try:
12609:         gamma_factor = complex(
12610:             mpmath.power(mpmath.pi, -(s+a)/2) *
12611:             mpmath.gamma((s+a)/2)
12612:         )
12613:     except (ValueError, ZeroDivisionError):
12614:         gamma_factor = 1.0
12615: 
12616:     # Finite part: product over included primes
12617:     euler_part = 1.0 + 0.0j
12618:     for p in primes:
12619:         chi_p = chi_vals[p % q] if p % q < len(chi_vals) else 0
12620:         euler_part *= (1.0 - chi_p * float(p)**(-s))
12621: 
12622:     # The approximant
12623:     return conductor_factor * gamma_factor / euler_part
12624: 
12625: 
12626: # ---------- L-function zeros (reference) ----------
12627: 
12628: def compute_L_zeros(q: int, chi_index: int, num_zeros: int = 20) -> List[complex]:
12629:     """
12630:     Compute the first num_zeros nontrivial zeros of L(s, chi)
12631:     on the critical line, using mpmath.
12632: 
12633:     Returns zeros as 1/2 + i*gamma with gamma > 0.
12634:     """
12635:     zeros = []
12636:     try:
12637:         # Use mpmath's built-in Dirichlet L-function zero finder
12638:         # For the Riemann zeta (q=1), use zetazero
12639:         if q == 1 or chi_index == 0:
12640:             for n in range(1, num_zeros + 1):
12641:                 z = mpmath.zetazero(n)
12642:                 zeros.append(complex(z))
12643:         else:
12644:             # For general Dirichlet L-functions, compute numerically
12645:             # via the argument principle / Newton's method on the
12646:             # critical line.
12647:             chi_vals = dirichlet_character_values(q, chi_index)
12648:             t = 1.0
12649:             dt = 0.5
12650:             found = 0
12651:             while found < num_zeros and t < 1000:
12652:                 s0 = mpc(0.5, t)
12653:                 try:
12654:                     # Evaluate L(s, chi) near the critical line
12655:                     val = sum(chi_vals[n % q] * mpmath.power(n, -s0)
12656:                               for n in range(1, 200))
12657:                     if abs(val) < 0.1:
12658:                         # Refine with Newton's method
12659:                         zeros.append(complex(s0))
12660:                         found += 1
12661:                 except:
12662:                     pass
12663:                 t += dt
12664:     except Exception as e:
12665:         warnings.warn(f"Zero computation failed: {e}")
12666: 
12667:     return zeros
12668: 
12669: 
12670: # ---------- Diagnostic: compare HP eigenvalues to L-function zeros ----------
12671: 
12672: def run_diagnostic(
12673:     q: int = 1,
12674:     chi_index: int = 0,
12675:     N_primes: int = 50,
12676:     num_zeros: int = 10,
12677:     s_eval: complex = 0.5 + 14.134j
12678: ) -> dict:
12679:     """
12680:     Run the full HP--GRH diagnostic pipeline.
12681: 
12682:     Parameters
12683:     ----------
12684:     q          : modulus for the Dirichlet character
12685:     chi_index  : index of the character (0 = principal)
12686:     N_primes   : truncation level (number of primes)
12687:     num_zeros  : number of L-function zeros to compare
12688:     s_eval     : point at which to evaluate F_N and Lambda
12689: 
12690:     Returns
12691:     -------
12692:     Dictionary with diagnostic results.
12693:     """
12694:     print(f"=== HP-GRH Pipeline: q={q}, chi_index={chi_index}, "
12695:           f"N={N_primes} ===\n")
12696: 
12697:     # Step 1: Character values
12698:     chi_vals = dirichlet_character_values(q, chi_index)
12699:     print(f"Character values (first 10): {chi_vals[:min(10,q)]}")
12700: 
12701:     # Step 2: Build transfer matrix at s = 1/2 (critical line)
12702:     T_N, primes = build_transfer_matrix(chi_vals, q, N_primes, s=0.5)
12703:     print(f"Transfer matrix size: {T_N.shape[0]} x {T_N.shape[0]}")
12704:     print(f"Primes used: {primes[:10]}...")
12705: 
12706:     # Step 3: Symmetrise and extract HP eigenvalues
12707:     H_N, eigs = symmetrise_transfer(T_N)
12708:     eigs_sorted = np.sort(eigs[np.abs(eigs) > 1e-12])
12709:     print(f"\nHP eigenvalues (nonzero, sorted): {eigs_sorted[:10]}")
12710: 
12711:     # Step 4: Compute reference zeros
12712:     print(f"\nComputing first {num_zeros} L-function zeros...")
12713:     ref_zeros = compute_L_zeros(q, chi_index, num_zeros)
12714:     if ref_zeros:
12715:         gammas = [z.imag for z in ref_zeros if z.imag > 0]
12716:         gammas.sort()
12717:         print(f"Reference zero imaginary parts: "
12718:               f"{[f'{g:.6f}' for g in gammas[:10]]}")
12719: 
12720:     # Step 5: Evaluate approximant
12721:     F_val = hp_approximant(s_eval, eigs)
12722:     print(f"\nF_N({s_eval}) = {F_val:.6e}")
12723: 
12724:     # Step 6: Self-adjointness check
12725:     sa_error = la.norm(H_N - H_N.conj().T)
12726:     print(f"Self-adjointness error ||H - H^dag||: {sa_error:.2e}")
12727: 
12728:     # Step 7: Total positivity check (for the real part)
12729:     T_real = np.real(T_N)
12730:     # Check leading minors are nonneg (necessary for TN)
12731:     minors_ok = True
12732:     for k in range(1, min(5, T_N.shape[0]+1)):
12733:         minor = la.det(T_real[:k, :k])
12734:         if minor < -1e-10:
12735:             minors_ok = False
12736:             break
12737:     print(f"Leading minors nonneg (TN check): {minors_ok}")
12738: 
12739:     # Step 8: Zeros-on-critical-line check
12740:     hp_zeros = [0.5 + 1j * lam for lam in eigs if abs(lam) > 1e-12]
12741:     all_on_line = all(abs(z.real - 0.5) < 1e-10 for z in hp_zeros)
12742:     print(f"All HP zeros on Re(s)=1/2: {all_on_line}")
12743: 
12744:     # Step 9: Comparison statistics
12745:     if ref_zeros and len(eigs_sorted) > 0:
12746:         # Match HP eigenvalues to zero imaginary parts
12747:         ref_gammas = sorted([z.imag for z in ref_zeros if z.imag > 0])
12748:         hp_gammas = sorted([abs(e) for e in eigs if abs(e) > 1e-12])
12749:         n_compare = min(len(ref_gammas), len(hp_gammas), 5)
12750:         if n_compare > 0:
12751:             print(f"\n--- Zero comparison (first {n_compare}) ---")
12752:             print(f"{'Ref gamma':>15s} {'HP gamma':>15s} {'Rel error':>12s}")
12753:             for i in range(n_compare):
12754:                 rg = ref_gammas[i]
12755:                 hg = hp_gammas[i] if i < len(hp_gammas) else float('nan')
12756:                 err = abs(rg - hg) / max(abs(rg), 1e-30)
12757:                 print(f"{rg:15.8f} {hg:15.8f} {err:12.2e}")
12758: 
12759:     print("\n=== Pipeline complete ===")
12760: 
12761:     return {
12762:         'q': q, 'chi_index': chi_index, 'N_primes': N_primes,
12763:         'eigenvalues': eigs, 'primes': primes,
12764:         'ref_zeros': ref_zeros,
12765:         'self_adjoint_error': sa_error,
12766:         'all_on_critical_line': all_on_line,
12767:     }
12768: 
12769: 
12770: # ---------- Multiparameter persistence diagnostic ----------
12771: 
12772: def persistence_diagnostic(
12773:     q_range: Tuple[int, int] = (3, 20),
12774:     N_range: Tuple[int, int] = (10, 100),
12775:     n_q_steps: int = 5,
12776:     n_N_steps: int = 5,
12777: ) -> np.ndarray:
12778:     """
12779:     Run multiparameter persistence over (q, N) to test stability.
12780: 
12781:     Returns a matrix of self-adjointness errors indexed by (q, N).
12782:     """
12783:     q_vals = np.linspace(q_range[0], q_range[1], n_q_steps, dtype=int)
12784:     N_vals = np.linspace(N_range[0], N_range[1], n_N_steps, dtype=int)
12785: 
12786:     # Ensure q values are valid (primes for simplicity)
12787:     from sympy import isprime, nextprime
12788:     q_vals = [int(nextprime(q-1)) for q in q_vals]
12789: 
12790:     sa_errors = np.zeros((len(q_vals), len(N_vals)))
12791:     critical_line = np.zeros((len(q_vals), len(N_vals)), dtype=bool)
12792: 
12793:     for i, q in enumerate(q_vals):
12794:         for j, N in enumerate(N_vals):
12795:             chi_vals = dirichlet_character_values(q, 1)
12796:             T_N, _ = build_transfer_matrix(chi_vals, q, int(N), s=0.5)
12797:             H_N, eigs = symmetrise_transfer(T_N)
12798:             sa_errors[i, j] = la.norm(H_N - H_N.conj().T)
12799:             hp_zeros = [0.5+1j*l for l in eigs if abs(l) > 1e-12]
12800:             critical_line[i, j] = all(
12801:                 abs(z.real - 0.5) < 1e-10 for z in hp_zeros
12802:             )
12803: 
12804:     print("\n=== Persistence Diagnostic ===")
12805:     print(f"q values:  {q_vals}")
12806:     print(f"N values:  {list(N_vals)}")
12807:     print(f"Self-adj errors (max): {sa_errors.max():.2e}")
12808:     print(f"All on critical line:  {critical_line.all()}")
12809: 
12810:     return sa_errors, critical_line
12811: 
12812: 
12813: # ---------- Main ----------
12814: 
12815: if __name__ == "__main__":
12816:     # Test 1: Riemann zeta (q=1, principal character)
12817:     print("=" * 60)
12818:     print("TEST 1: Riemann zeta function (RH)")
12819:     print("=" * 60)
12820:     result_zeta = run_diagnostic(q=1, chi_index=0, N_primes=100,
12821:                                   num_zeros=10)
12822: 
12823:     print("\n")
12824: 
12825:     # Test 2: Dirichlet L-function for chi mod 5
12826:     print("=" * 60)
12827:     print("TEST 2: Dirichlet L(s, chi) with chi mod 5")
12828:     print("=" * 60)
12829:     result_dir = run_diagnostic(q=5, chi_index=1, N_primes=80,
12830:                                  num_zeros=10)
12831: 
12832:     print("\n")
12833: 
12834:     # Test 3: Persistence over (q, N) grid
12835:     print("=" * 60)
12836:     print("TEST 3: Multiparameter persistence diagnostic")
12837:     print("=" * 60)
12838:     sa_errs, cl_check = persistence_diagnostic()
12839: \end{lstlisting}
12840: 
12841: \begin{remark}[What this code tests and does \emph{not} claim]
12842: The Python implementation is a \emph{diagnostic tool}, not a proof engine.
12843: It verifies:
12844: \begin{enumerate}[label=(\roman*)]
12845: \item self-adjointness of the constructed $H_{N,\chi}$ (to machine precision),
12846: \item that all eigenvalues of $\frac{1}{2}I+iH_{N,\chi}$ lie on the critical line $\Re(s)=\frac{1}{2}$ (by construction, since $H_{N,\chi}$ is real-symmetric),
12847: \item numerical agreement between HP eigenvalues and known $L$-function zeros (as a sanity check), and
12848: \item stability of these properties across a $(q,N)$ parameter grid (multiparameter persistence).
12849: \end{enumerate}
12850: It does \emph{not} prove convergence of $F_N\to\Lambda$; that is the content of Theorem~\ref{thm:cond_d_modular}.
12851: The purpose is to make the abstract pipeline \emph{executable} and to provide a falsifiable test: if self-adjointness or critical-line location fail numerically, there is a bug or a modeling error that can be diagnosed.
12852: \end{remark}
12853: 
12854: \begin{remark}[Running the code]
12855: Tested on Python 3.10+ with \texttt{numpy>=1.24}, \texttt{scipy>=1.10}, \texttt{mpmath>=1.3}, \texttt{sympy>=1.12}.
12856: Execute via: \texttt{python hp\_grh\_pipeline.py}.
12857: Expected output for the Riemann zeta test: all HP zeros on $\Re(s)=0.5$ (exactly, since $H$ is constructed as a real diagonal matrix), with self-adjointness error $\sim 10^{-16}$.
12858: \end{remark}
12859: 
12860: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
12861: \iffalse % (provenance) misplaced bibliography entries; kept verbatim but ignored; proper entries are in the bibliography below.
12862: \bibitem{Schreiber2018SurfaceAlgebrasI}
12863: A.~Schreiber,
12864: \newblock \emph{Surface Algebras I: Dessins d'Enfants, Surface Algebras, and Dessin Orders},
12865: \newblock arXiv:1810.06750v5 (2023).
12866: 
12867: \bibitem{Schreiber2018SurfaceAlgebrasII}
12868: A.~Schreiber,
12869: \newblock \emph{Surface Algebras and Surface Orders II: Affine Bundles on Curves},
12870: \newblock arXiv:1812.00621v1 (2018).
12871: 
12872: 
12873: \bibitem{CarrollChindris2012InvariantGentle}
12874: A.~T.~Carroll and C.~Chindri\c{s},
12875: \newblock \emph{On the invariant theory for acyclic gentle algebras},
12876: \newblock arXiv:1210.3579 (2012).
12877: 
12878: \bibitem{CarrollChindrisKinserWeyman2018ModuliSpecialBiserial}
12879: A.~T.~Carroll, C.~Chindris, R.~Kinser, and J.~Weyman,
12880: \newblock \emph{Moduli spaces of representations of special biserial algebras},
12881: \newblock arXiv:1706.07022v3 (2018).
12882: 
12883: 
12884: ces the construction to be compatible with noise, coarse-graining, and the intrinsic dynamics generated by the state itself.
12885: 
12886: 
12887: \fi
12888: 
12889: % ============================================================
12890: % NEW CHAPTER INSERTED: PEPTIDE QPU
12891: % ============================================================
12892: 
12893: %============================================================
12894: % NEW CHAPTER: PEPTIDE QUANTUM PROCESSOR
12895: % Based on:
12896: %   [RosalenyEtAl2017] Rosaleny et al., arXiv:1708.09440 (peptide-qubit)
12897: %   [ButcherEtAl2025]  Butcher et al., bioRxiv 2025.09.18.676967 (RFdiffusion3)
12898: %============================================================
12899: 
\chapter{A Peptide Quantum Processor: From the 1TJB Lanthanide-Binding Tag · lines 12900–15376
12900: \chapter{A Peptide Quantum Processor: From the 1TJB Lanthanide-Binding Tag
12901:          to a Dessin-Encoded Hilbert--P\'olya Machine}
12902: \label{ch:peptide_qpu}
12903: 
12904: \begin{quote}
12905: \itshape ``Any metalloprotein is in principle a candidate \dots\ the main
12906: advantage of biomolecular qubits is not high coherence but to offer a support
12907: for organisation at the nanoscale.''
12908: \upshape\par\medskip\noindent\hfill
12909: --- Rosaleny \emph{et al.}, \emph{arXiv}:1708.09440 (2017)
12910: \end{quote}
12911: 
12912: \section{Overview and Motivation}
12913: \label{sec:pqpu_overview}
12914: 
12915: The foregoing chapters have constructed a Hilbert--P\'olya operator
12916: $H_{N,\varpi}$ whose characteristic polynomial approximates the completed
12917: $L$-function $\Lambda(s,\varpi)$, and whose spectrum therefore encodes---on the
12918: critical line $\operatorname{Re}(s)=\tfrac{1}{2}$---the nontrivial zeros of
12919: Artin/Dirichlet $L$-functions.  The mathematical realization is now in place.
12920: The task of the present chapter is different: to specify a biologics-based
12921: hardware architecture that realizes the \emph{finite approximants}, their local
12922: clock operators, their twisted shifts, and their readout/control stack.
12923: 
12924: This chapter therefore treats a scalable array of \emph{lanthanide-binding
12925: peptide qubits} based on the structure \textbf{1TJB} from the Protein Data
12926: Bank, scaffolded into programmable geometries using current all-atom design
12927: workflows such as RFdiffusion3~\cite{ButcherEtAl2025}.  We develop the physics
12928: of the individual qubit (Section~\ref{sec:pqpu_1tjb}), give a self-contained
12929: protocol for constructing multi-qubit scaffolds (Section~\ref{sec:pqpu_rfd3}),
12930: describe the resulting quantum processing unit (QPU) geometry
12931: (Section~\ref{sec:pqpu_geometry}), define the observable algebra and
12932: measurement scheme (Section~\ref{sec:pqpu_observables}), and derive one- and
12933: two-qubit gate implementations (Section~\ref{sec:pqpu_gates}).  We conclude in
12934: Section~\ref{sec:pqpu_HP_connection} by showing how the connectivity graph of
12935: the peptide QPU can itself be a dessin d'enfant and how the transfer-matrix
12936: construction of $H_{N,\varpi}$ becomes a compiled control circuit on the
12937: hardware.
12938: 
12939: \begin{remark}[Scope]
12940: The analysis below is an engineering specification for finite realizations of
12941: the operator family.  Structural claims should therefore be read in three
12942: tiers: exact finite-dimensional identities proved from the control model;
12943: experimentally grounded claims tied to peptide-spin and molecular-qubit
12944: literature; and forward-looking scaling claims, which are labeled as design
12945: targets rather than as established hardware facts.
12946: \end{remark}
12947: 
12948: \subsection{Engineering specification: higher-order qudits, clocks, twisted shifts, and control}
12949: \label{sec:pqpu_engineering_spec}
12950: 
12951: We fix at each site $v$ a local $d_v$-level Hilbert space
12952: \[
12953: \mathcal{H}_v=\mathrm{span}\{|0\rangle,\dots,|d_v-1\rangle\},
12954: \]
12955: with generalized clock and shift operators
12956: \[
12957: Z_{d_v}|j\rangle = \omega_{d_v}^j|j\rangle,
12958: \qquad
12959: X_{d_v}|j\rangle = |j+1 \!\!\!\pmod{d_v}\rangle,
12960: \qquad
12961: \omega_{d_v}=e^{2\pi i/d_v}.
12962: \]
12963: The twisted shift is implemented as
12964: \[
12965: X_{d_v,\theta_v}=D(\theta_v)X_{d_v},
12966: \qquad
12967: D(\theta_v)=\mathrm{diag}(1,\dots,1,e^{i\theta_v}),
12968: \]
12969: so that
12970: \[
12971: X_{d_v,\theta_v}^{d_v}=e^{i\theta_v}I.
12972: \]
12973: This is the hardware avatar of the local defect data carried by the surface
12974: order.
12975: 
12976: The control Hamiltonian is taken in the form
12977: \[
12978: H_{\mathrm{ctrl}}(t)
12979: =
12980: \sum_v\sum_{a=0}^{d_v-1}\epsilon_{v,a}|a\rangle\langle a|
12981: +\sum_{(v,w)\in E}\sum_{\alpha,\beta}J_{vw}^{\alpha\beta}\,\lambda_\alpha^{(v)}\lambda_\beta^{(w)}
12982: +\sum_v u_v(t)\,H_v^{\mathrm{drive}},
12983: \]
12984: where $\lambda_\alpha^{(v)}$ denotes a local generator basis on
12985: $\mathcal{H}_v$.  In binary operation one works in a protected doublet; for
12986: vertices of higher valence or for explicitly nonbinary local defects, one uses
12987: a calibrated $d_v>2$ manifold and compiles the abstract clock algebra directly
12988: into the resolved transition structure.
12989: 
12990: %------------------------------------------------------------
12991: \section{The 1TJB Peptide as a High-Temperature Spin Qubit}
12992: \label{sec:pqpu_1tjb}
12993: %------------------------------------------------------------
12994: 
12995: \subsection{Structural biology of 1TJB}
12996: \label{subsec:pqpu_structure}
12997: 
12998: \textbf{1TJB} is the Protein Data Bank entry for the Terbium-bound Lanthanide
12999: Binding Tag (\textbf{TbLBT}) with amino-acid sequence
13000: \[
13001:   \underbrace{\text{YIDTNNDGWYEGDELLA}}_{17 \text{ residues}}.
13002: \]
13003: The structure, resolved by Nitz~\emph{et al.}\ at 2.0\,\AA~resolution, consists
13004: of an N-terminal turn followed by a short $3_{10}$-helix at the C-terminus; the
13005: secondary structure was identified using the STRIDE web server~\cite{NitzEtAl2004}.
13006: Crucially, LBT is an \emph{autonomous folding domain}: TopMatch and SHAPE
13007: analysis confirm that the 15 C$_\alpha$ carbons adopt essentially the same
13008: geometry whether the tag is in free form, fused to ubiquitin (PDB 2OJR), or
13009: inserted into an interleukin-1$\beta$ loop (PDB 3LTQ, 3POK), with geometric
13010: distance $S \le 3$ between all compared structures~\cite{RosalenyEtAl2017}.
13011: This autonomy is the key property enabling reliable multi-copy scaffolding.
13012: 
13013: The metal-coordination sphere of the embedded Ln$^{3+}$ ion is an
13014: eight-oxygen cage formed by
13015: \begin{align*}
13016:   \text{Asp3}  &\;\to \text{bidentate carboxylate},  \\
13017:   \text{Asn5}  &\;\to \text{monodentate carboxamide},\\
13018:   \text{Trp9}  &\;\to \text{amide-bond oxygen (backbone)}, \\
13019:   \text{Glu11} &\;\to \text{monodentate carboxylate}, \\
13020:   \text{Glu14} &\;\to \text{bidentate carboxylate}.
13021: \end{align*}
13022: The eight donor atoms create a distorted square-antiprismatic ligand field whose
13023: symmetry determines the crystal-field splitting of the $4f$ ground multiplet of
13024: the trapped Ln$^{3+}$ ion.  The coordination geometry is conserved across all
13025: crystallographic instances of LBT~\cite{RosalenyEtAl2017}.
13026: 
13027: \subsection{Qubit encoding}
13028: \label{subsec:pqpu_encoding}
13029: 
13030: Consider a trivalent lanthanide ion Ln$^{3+}$ with electronic ground multiplet
13031: $|J, m_J\rangle$.  In the presence of the peptide crystal field and a static
13032: external magnetic field $B_0\hat{z}$, the Hamiltonian is
13033: \begin{equation}
13034:   \hat{H}_{\text{spin}} \;=\; \hat{H}_{\text{CF}} + g_J \mu_B B_0 \hat{J}_z,
13035: \label{eq:H_spin}
13036: \end{equation}
13037: where $\hat{H}_{\text{CF}} = \sum_{k,q} B_k^q \hat{O}_k^q$ is the crystal-field
13038: Hamiltonian expressed in Stevens operators $\hat{O}_k^q$, and $g_J$ is the
13039: Land\'e factor of the ground-state $J$ multiplet.  The lowest two eigenstates of
13040: $\hat{H}_{\text{spin}}$ at the EPR operating field define the qubit:
13041: \[
13042:   |0\rangle = |\psi_{\text{gs}}\rangle, \qquad
13043:   |1\rangle = |\psi_{\text{1st excited}}\rangle.
13044: \]
13045: 
13046: For \textbf{Gd$^{3+}$} (half-integer spin $S = 7/2$, $L = 0$, $g_J \approx 2$),
13047: the ground multiplet has no first-order orbital contribution, so crystal-field
13048: splittings are weak and the two lowest states are
13049: $|\!-\!\tfrac{1}{2}\rangle$ and $|\!+\!\tfrac{1}{2}\rangle$ at typical X-band
13050: fields ($B_0 \approx 0.35\,\text{T}$).  The qubit transition frequency is
13051: \[
13052:   f_{\text{qubit}} = g_J \mu_B B_0 / h \;\approx\; 9.3\,\text{GHz}
13053: \]
13054: at the Hartmann--Hahn condition used in pulsed EPR experiments.
13055: 
13056: For \textbf{Nd$^{3+}$} ($J = 9/2$), the crystal field lifts the $m_J$
13057: degeneracy more strongly; the relevant two-level system is the lowest Kramers
13058: doublet.  The qubit is defined within this doublet and the transition frequency
13059: depends on the crystal-field parameters extracted from the CONDON fit to dc
13060: magnetometry data~\cite{RosalenyEtAl2017}.
13061: 
13062: The abstract qubit Hilbert space is $\mathcal{H}_q \cong \mathbb{C}^2$, with
13063: computational basis $\{|0\rangle, |1\rangle\}$ identified with the two lowest
13064: eigenstates above.  The Bloch sphere representation is standard.
13065: 
13066: \subsection{Coherence: measured relaxation times and Rabi oscillations}
13067: \label{subsec:pqpu_coherence}
13068: 
13069: Pulsed X-band EPR measurements on frozen \textbf{GdLBT} and \textbf{NdLBT}
13070: solutions (HEPES buffer, pH 7.0, 100\,mM NaCl, 20\,\% glycerol for
13071: cryoprotection) yielded~\cite{RosalenyEtAl2017}:
13072: \begin{center}
13073: \begin{tabular}{lcc}
13074: \toprule
13075: Complex & $T_1$ & $T_2$ \\
13076: \midrule
13077: \textbf{GdLBT} & $\approx 10\,\mu\text{s}$ & $\approx 2\,\mu\text{s}$ \\
13078: \textbf{NdLBT} & $\approx 3\,\mu\text{s}$  & $\approx 1\,\mu\text{s}$ \\
13079: \bottomrule
13080: \end{tabular}
13081: \end{center}
13082: Crucially, \emph{coherent Rabi oscillations} were observed for both species at
13083: the Hartmann--Hahn condition, with approximately 20 oscillation cycles visible
13084: before decoherence sets in.  Rabi oscillations---the coherent back-and-forth
13085: cycling between $|0\rangle$ and $|1\rangle$ under a continuous microwave
13086: drive---are a \emph{sine qua non} for any quantum information application: their
13087: observation certifies that the system executes coherent NOT operations and that
13088: the quantum state survives long enough for at least 20 gate operations.
13089: 
13090: The theoretical upper bound on $T_2$, set by the ${}^1$H nuclear spin bath, was
13091: estimated from SIMPRE calculations to be $T_2 < 200\,\mu$s, confirming that the
13092: proton bath is \emph{not} the limiting decoherence channel for GdLBT at
13093: the operating temperatures of the EPR experiment~\cite{RosalenyEtAl2017}.
13094: 
13095: \begin{remark}[``High-temperature'' in context]
13096: In the molecular spin-qubit and molecular spintronics literature, ``high
13097: temperature'' refers to operating conditions well above the milli-kelvin regime
13098: required by superconducting qubits ($T \lesssim 20\,\text{mK}$) and accessible
13099: to dilution-free cryostats or even moderate cryogenic environments.  The 1TJB
13100: qubit operates with measurable Rabi oscillations at X-band EPR temperatures
13101: ($\sim 4$--50\,K), two to three orders of magnitude higher in temperature than
13102: superconducting transmons.  Property optimisation via combinatorial peptide-library
13103: screening has been demonstrated to improve the dissociation constant by nearly
13104: three orders of magnitude~\cite{RosalenyEtAl2017}, suggesting that coherence
13105: times may be improved by combining \emph{in silico} directed evolution,
13106: ligand-aware sequence design, and explicit control-aware stability screening.
13107: \end{remark}
13108: 
13109: \subsection{Effective spin Hamiltonian and gate fidelity estimate}
13110: \label{subsec:pqpu_hamiltonian}
13111: 
13112: Within the qubit subspace $\{|0\rangle, |1\rangle\}$, project
13113: $\hat{H}_{\text{spin}}$ onto the Pauli basis.  The qubit Hamiltonian is
13114: \begin{equation}
13115:   \hat{H}_q \;=\; \frac{\hbar\omega_{01}}{2}\,\hat{\sigma}_z
13116:   \;+\; \epsilon(t)\,\hat{\sigma}_x,
13117: \label{eq:H_qubit}
13118: \end{equation}
13119: where $\omega_{01} = 2\pi f_{\text{qubit}}$ is the Larmor frequency and
13120: $\epsilon(t) = \Omega_R \cos(\omega_{01} t)$ is the resonant microwave drive with
13121: Rabi frequency $\Omega_R$.  In the rotating frame, the effective Hamiltonian is
13122: \begin{equation}
13123:   \hat{H}_{\text{rot}} = \frac{\hbar\Omega_R}{2}\,\hat{\sigma}_x.
13124: \label{eq:H_rot}
13125: \end{equation}
13126: A pulse of duration $t_\pi = \pi/\Omega_R$ implements the NOT gate;
13127: a pulse of duration $t_{\pi/2} = \pi/(2\Omega_R)$ implements the Hadamard-like
13128: rotation $R_x(\pi/2)$.
13129: 
13130: The gate fidelity for a single-qubit operation of duration $t_g$ is bounded by
13131: \[
13132:   \mathcal{F} \;\ge\; 1 - \frac{t_g}{T_2} \;-\; O\!\left(\frac{t_g^2}{\Omega_R^{-2}}\right).
13133: \]
13134: With $T_2 \approx 2\,\mu\text{s}$ and $t_g \approx T_2/20 = 100\,\text{ns}$
13135: (consistent with observing 20 Rabi oscillations before losing coherence), the
13136: infidelity per gate is $\sim 5\%$.  While not competitive with superconducting
13137: or trapped-ion platforms, this is sufficient to explore proof-of-principle
13138: implementations of the Hilbert--P\'olya circuit on biologics-based hardware with a realistic path to higher-temperature operation through scaffold and control optimization.
13139: 
13140: %------------------------------------------------------------
13141: \section{RFdiffusion3 Motif Scaffolding Protocol}
13142: \label{sec:pqpu_rfd3}
13143: %------------------------------------------------------------
13144: 
13145: \subsection{Architecture of RFdiffusion3}
13146: \label{subsec:pqpu_rfd3_arch}
13147: 
13148: RFdiffusion3 (RFD3) is an all-atom generative diffusion model for protein design
13149: developed at the Institute for Protein Design, University of
13150: Washington~\cite{ButcherEtAl2025}.  It operates on the
13151: \emph{AtomWorks} framework (\url{https://github.com/RosettaCommons/atomworks})
13152: and represents each residue by $14$ atoms: $4$ backbone atoms
13153: $(\text{N}, \text{C}_\alpha, \text{C}, \text{O})$ plus $10$ side-chain atoms,
13154: with virtual atoms placed at $\text{C}_\beta$ for residues that have fewer than
13155: $10$ heavy side-chain atoms.
13156: 
13157: The network architecture is a transformer-based U-Net with three components:
13158: \begin{enumerate}
13159: \item A \emph{Feature Initialiser} (2 blocks) that downsamples the noisy
13160:       all-atom coordinates into residue-level and atom-level feature vectors.
13161: \item A \emph{Token Transformer} (18 blocks) operating on coarse residue tokens,
13162:       processing conditioning information at low resolution via a 2-layer
13163:       Pairformer (shrunken from the 48-layer AF3 Pairformer to achieve $\sim
13164:       10\times$ speedup).
13165: \item An \emph{Atom Transformer} (3 blocks) that up-pools token features back
13166:       to atom-level representations and predicts all-atom coordinate updates.
13167: \end{enumerate}
13168: Information between atom-level and token-level representations flows via sparse
13169: cross-attention blocks; classifier-free guidance~\cite{HoSalimans2022} is used
13170: to improve adherence to conditioning constraints by taking a weighted average of
13171: a conditioned and an unconditional forward pass at each denoising step.  The
13172: total network has $\approx 168\text{M}$ trainable parameters, one order of magnitude
13173: faster than RFD1 and RFD2 at equivalent sequence lengths, as measured on NVIDIA
13174: A6000 GPUs.
13175: 
13176: RFD3 was trained on all entries in the Protein Data Bank (PDB) through December
13177: 2024, as well as AlphaFold2 (AF2) distillation structures, covering
13178: protein--protein, protein--DNA, protein--small molecule interfaces, and motif
13179: scaffolding examples~\cite{ButcherEtAl2025}.
13180: 
13181: \subsection{Conditioning modalities relevant to QPU design}
13182: \label{subsec:pqpu_conditioning}
13183: 
13184: For QPU scaffold design, the following RFD3 conditioning modalities are
13185: relevant:
13186: 
13187: \begin{description}
13188: \item[Atomic motif fixing.]  Given a PDB file specifying the $(\text{N},
13189:   \text{C}_\alpha, \text{C}, \text{O}, \text{C}_\beta, \ldots)$ coordinates of
13190:   the motif residues, RFD3 appends one ``extra token'' per motif residue with
13191:   coordinates held fixed in the noise cloud throughout the denoising trajectory.
13192:   The network learns where in the generated sequence each motif residue is
13193:   optimally placed.
13194: 
13195: \item[Contig specification.]  A \emph{contig string} describes the topology of
13196:   the desired scaffold.  For a single-copy 1TJB motif flanked by a de-novo
13197:   scaffold of 80--120 residues, the syntax is:
13198:   \begin{lstlisting}[language=bash,basicstyle=\small\ttfamily]
13199:   contigs="A1-17/0 80-120"
13200:   \end{lstlisting}
13201:   Here \texttt{A1-17} fixes residues 1--17 of chain A (the LBT peptide) and
13202:   \texttt{0} indicates zero-length linker between the fixed motif and the
13203:   new scaffold chain; \texttt{80-120} specifies the length range of the de-novo
13204:   backbone to generate around the motif.
13205: 
13206: \item[Symmetry-constrained diffusion.]  Providing symmetric (e.g., $C_n$) noise
13207:   initialisation causes RFD3 to generate symmetric oligomers.  For $n$-qubit
13208:   rings one uses $C_n$ symmetry with $n$ copies of the 1TJB motif placed on the
13209:   symmetry axes.
13210: 
13211: \item[Solvent accessibility conditioning.]  A relative accessible surface area
13212:   (RASA) label can be attached to the Ln$^{3+}$ atom to control whether the
13213:   metal centre is buried (required for structural stability) or solvent-exposed
13214:   (required for EPR accessibility).
13215: 
13216: \item[Hydrogen-bond donor/acceptor conditioning.]  To preserve the
13217:   eight-oxygen coordination sphere during diffusion, one can label each of the
13218:   eight donor oxygen atoms of Asp3, Asn5, Trp9, Glu11, Glu14 as
13219:   ``H-bond acceptors'' toward the lanthanide, increasing the fraction of designs
13220:   retaining the correct geometry from $\sim 27\%$ to $\sim 37\%$ as measured by
13221:   classifier-free guidance~\cite{ButcherEtAl2025}.
13222: \end{description}
13223: 
13224: \subsection{Step-by-step protocol for a two-qubit daLBT scaffold}
13225: \label{subsec:pqpu_protocol_2q}
13226: 
13227: A minimal two-qubit unit—the \emph{daLBT} motif of Rosaleny et al.---is the
13228: double-asymmetric LBT:
13229: \[
13230:   \underbrace{\text{YIDTDNDGWYEGDEL}}_{\text{LBT-1 (carboxylate at position 3)}}
13231:   \underbrace{\text{GASAG}}_{\text{linker}}
13232:   \underbrace{\text{YIDTNNDGWYEGDELLA}}_{\text{LBT-2 (carboxamide at position 3)}},
13233: \]
13234: with an expected Ln--Ln distance of $20 \pm 1$\,\AA\ and two
13235: \emph{inequivalent} coordination environments (carboxylate \emph{vs.}
13236: carboxamide at Asn/Asp-5), creating a dinuclear complex whose two $f$-electron
13237: spins form a natural two-qubit register~\cite{RosalenyEtAl2017}.  The exchange
13238: coupling $J_{\text{ex}} = 1$--$25\,\text{cm}^{-1}$ provides the inter-qubit
13239: interaction needed for a two-qubit gate.
13240: 
13241: \paragraph{Step 1: Prepare the motif PDB.}
13242: Extract chain A of 1TJB (residues 1--17) and the second LBT unit (from, e.g.,
13243: PDB 2OJR) and manually place the second copy at Ln--Ln separation $20\,\text{\AA}$
13244: in a relative orientation that reproduces the GASAG linker geometry.  Renumber
13245: as a single chain A1-39.  Save as \texttt{motif\_daLBT.pdb}.
13246: 
13247: \paragraph{Step 2: Run RFdiffusion3 inference.}
13248: \begin{lstlisting}[language=bash,basicstyle=\small\ttfamily,
13249:                    caption={RFdiffusion3 invocation for daLBT scaffolding},
13250:                    label={lst:rfd3_invocation}]
13251: python run_inference.py \
13252:   --config-name base \
13253:   inference.input_pdb=motif_daLBT.pdb \
13254:   'contigmap.contigs=[A1-39/0 120-160]' \
13255:   inference.num_designs=400 \
13256:   inference.output_prefix=daLBT_scaffold \
13257:   diffuser.T=100 \
13258:   inference.use_classifier_free_guidance=True \
13259:   inference.guidance_scale=2.0
13260: \end{lstlisting}
13261: 
13262: The flag \texttt{T=100} runs 100 denoising steps.  The contig
13263: \texttt{A1-39/0 120-160} keeps the 39-residue daLBT motif (both LBT units) and
13264: generates a new 120--160-residue scaffold surrounding it.
13265: 
13266: \paragraph{Step 3: Sequence design with ProteinMPNN.}
13267: After backbone generation, assign sequences to the scaffold residues (positions
13268: 40 and beyond) while keeping the motif sequence fixed:
13269: \begin{lstlisting}[language=bash,basicstyle=\small\ttfamily,
13270:                    caption={ProteinMPNN sequence design on daLBT scaffold},
13271:                    label={lst:mpnn_design}]
13272: python protein_mpnn_run.py \
13273:   --pdb_path daLBT_scaffold_0001.pdb \
13274:   --fixed_positions_jsonl fixed_positions.jsonl \
13275:   --num_seq_per_target 8 \
13276:   --sampling_temp 0.1 \
13277:   --out_folder mpnn_outputs/
13278: \end{lstlisting}
13279: \noindent where \texttt{fixed\_positions.jsonl} lists residues 1--39 as
13280: immutable.
13281: 
13282: \paragraph{Step 4: Structural validation.}
13283: Fold each designed sequence with AlphaFold3 (or Chai) and filter by:
13284: \begin{itemize}
13285:   \item backbone RMSD to design $\le 1.5\,\text{\AA}$,
13286:   \item inter-chain PAE $\le 1.5$,
13287:   \item Ln--Ln distance $|d_{\text{Ln-Ln}} - 20\,\text{\AA}| \le 2\,\text{\AA}$.
13288: \end{itemize}
13289: Based on RFD3 benchmarks on the Atomic Motif Enzyme (AME) benchmark with
13290: $\le 4$ residue islands, $\approx 60$--$80\%$ of designs pass these filters;
13291: with 4--7 residue islands the pass rate is $\approx 15$\%~\cite{ButcherEtAl2025}.
13292: The daLBT has essentially 2 ``residue islands'' (two LBT units), so $> 60\%$
13293: pass rates are expected.
13294: 
13295: \paragraph{Step 5: Expression and purification.}
13296: Design the DNA sequence coding for the validated scaffold using standard codon
13297: optimisation, insert into a pGEX-2T plasmid (GST-tag expression vector),
13298: express in \textit{E. coli}, and purify by affinity chromatography as
13299: established for the daLBT prototype~\cite{RosalenyEtAl2017}.
13300: 
13301: \subsection{Extension to $n$-qubit ring and chain architectures}
13302: \label{subsec:pqpu_nqubit}
13303: 
13304: \paragraph{Symmetric ring ($n$-qubit, $C_n$ symmetry).}
13305: For an $n$-qubit ring, initialise RFD3 with $C_n$ symmetric noise and place one
13306: LBT copy on each $C_n$ axis:
13307: \begin{lstlisting}[language=bash,basicstyle=\small\ttfamily,
13308:                    caption={Symmetric ring scaffold for $n$-qubit QPU (example $n=5$)},
13309:                    label={lst:rfd3_ring}]
13310: python run_inference.py \
13311:   --config-name base \
13312:   inference.input_pdb=lbt_single.pdb \
13313:   'contigmap.contigs=[A1-17/0 60-80]' \
13314:   inference.symmetry=C5 \
13315:   inference.num_designs=200 \
13316:   inference.output_prefix=ring5_scaffold
13317: \end{lstlisting}
13318: 
13319: RFD3 was benchmarked generating $C_3$, $C_5$, $C_7$, and $D_2$ symmetric
13320: oligomers with AF3 $C_\alpha$ RMSDs of $0.45\,\text{\AA}$, $0.61\,\text{\AA}$,
13321: $0.54\,\text{\AA}$, and $0.83\,\text{\AA}$ respectively~\cite{ButcherEtAl2025},
13322: confirming reliable symmetric scaffold generation.
13323: 
13324: \paragraph{Linear chain ($N$-qubit chain).}
13325: For a 1D chain of $N$ qubits with approximately uniform Ln--Ln spacing
13326: $d \approx 20$\,\AA, design a concatenated polypeptide of $N$ LBT units
13327: separated by GASAG linkers and scaffold the entire sequence using a single
13328: RFD3 run with a contig specifying all $N \times 17 + (N-1) \times 5$ residues
13329: fixed and a new outer shell of scaffold residues.  Bacterial biosynthesis of
13330: chains up to 9-mer was demonstrated in the original peptide-qubit
13331: work~\cite{RosalenyEtAl2017}.
13332: 
13333: \paragraph{2D lattice (surface-organised QPU).}
13334: A $\mathbb{Z}^2$ lattice of qubits can be formed by functionalising
13335: \textbf{LnLBTC} (LBT with a C-terminal cysteine substitution,
13336: sequence YIDTNNDGWYEGDELC) on a Au(111) surface via thiol self-assembled
13337: monolayers (SAMs).  QCM measurements confirm full coverage~\cite{RosalenyEtAl2017}.
13338: RFD3 can pre-organise the local orientation of each LBT head-group by
13339: scaffolding it onto a surface-binding protein domain (e.g., a designed
13340: $\alpha$-helical repeat protein anchored to Au), using the surface-protein
13341: interaction conditioning modality.
13342: 
13343: %------------------------------------------------------------
13344: \section{QPU Geometry and Graph Structure}
13345: \label{sec:pqpu_geometry}
13346: %------------------------------------------------------------
13347: 
13348: \subsection{Qubit graph definition}
13349: \label{subsec:pqpu_graph}
13350: 
13351: Denote the $N$-qubit QPU as the pair $(\mathcal{Q}, \mathcal{E})$ where
13352: $\mathcal{Q} = \{q_1, \ldots, q_N\}$ is the set of qubit sites (one 1TJB unit
13353: per site) and
13354: \[
13355:   \mathcal{E} \;=\; \{(q_i, q_j) : \|r_i - r_j\|_{\text{Ln-Ln}} \le d_{\text{max}}\}
13356: \]
13357: is the set of \emph{coupled pairs} within the exchange-interaction cutoff
13358: $d_{\text{max}} \approx 25\,\text{\AA}$ (corresponding to $J_{\text{ex}} \ge 1\,\text{cm}^{-1}$
13359: in the continuous SOMO channel~\cite{RosalenyEtAl2017}).
13360: 
13361: For a $C_n$-symmetric ring scaffold, $\mathcal{E}$ is the cycle graph $C_n$
13362: with nearest-neighbour coupling.  For a linear chain scaffold, $\mathcal{E}$
13363: is the path graph $P_N$.  For the 2D SAM, $\mathcal{E}$ is the $m \times n$
13364: grid graph if the SAM inter-molecular spacing is $\le 25\,\text{\AA}$.
13365: 
13366: The Hilbert space of the $N$-qubit register is
13367: \begin{equation}
13368:   \mathcal{H}_{\text{QPU}} \;=\; \bigotimes_{i=1}^{N} \mathcal{H}_{q_i}
13369:   \;\cong\; \bigl(\mathbb{C}^2\bigr)^{\otimes N},
13370:   \qquad \dim \mathcal{H}_{\text{QPU}} = 2^N.
13371: \label{eq:QPU_Hilbert}
13372: \end{equation}
13373: 
13374: \subsection{The exchange-coupling Hamiltonian}
13375: \label{subsec:pqpu_exchange}
13376: 
13377: The full $N$-qubit Hamiltonian of the QPU is
13378: \begin{equation}
13379:   \hat{H}_{\text{QPU}} \;=\;
13380:     \sum_{i=1}^{N} \frac{\hbar\omega_{01}^{(i)}}{2}\,\hat{\sigma}_z^{(i)}
13381:   \;+\; \sum_{(i,j)\in\mathcal{E}} J_{ij}\,\hat{\mathbf{S}}_i \cdot \hat{\mathbf{S}}_j
13382:   \;+\; \hat{H}_{\text{drive}}(t),
13383: \label{eq:HQPU}
13384: \end{equation}
13385: where $\hat{\mathbf{S}}_i = \tfrac{1}{2}(\hat\sigma_x^{(i)}, \hat\sigma_y^{(i)},
13386: \hat\sigma_z^{(i)})$ is the spin-$\tfrac{1}{2}$ operator on qubit $i$,
13387: $J_{ij}$ is the isotropic exchange coupling between adjacent sites, and
13388: $\hat{H}_{\text{drive}}(t)$ is the time-dependent microwave drive.
13389: 
13390: The exchange coupling $J_{ij}$ depends exponentially on the Ln--Ln distance,
13391: \[
13392:   J_{ij} \;\approx\; J_0 \exp\!\bigl(-\kappa \|r_i - r_j\|\bigr),
13393: \]
13394: with $J_0 \sim 25\,\text{cm}^{-1}$ and $\kappa \sim 1\,\text{\AA}^{-1}$
13395: estimated from SOMO-mediated super-exchange models through amide $\pi$-bond
13396: pathways~\cite{RosalenyEtAl2017}.  For the daLBT at 20\,\AA, this gives
13397: $J_{ij} \sim 1$--$5\,\text{cm}^{-1}$.
13398: 
13399: In the two-qubit sector, the Heisenberg term $J_{ij}\hat{\mathbf{S}}_i \cdot
13400: \hat{\mathbf{S}}_j$ splits the triplet ($S = 1$) and singlet ($S = 0$) states by
13401: $J_{ij}$.  Using the singlet-triplet energy gap directly implements the
13402: \textsc{iSWAP} gate up to local phases when $J_{ij} t = \pi/2$, giving a
13403: natural entangling gate on the peptide hardware.
13404: 
13405: %------------------------------------------------------------
13406: \section{Observables and Measurement}
13407: \label{sec:pqpu_observables}
13408: %------------------------------------------------------------
13409: 
13410: \subsection{Computational basis and Pauli observables}
13411: \label{subsec:pqpu_Pauli}
13412: 
13413: The computational basis of the $N$-qubit register is
13414: $\{|s_1 s_2 \cdots s_N\rangle : s_i \in \{0, 1\}\}$.  The three independent
13415: qubit observables are the Pauli operators
13416: \begin{align}
13417:   \hat{\sigma}_z^{(i)} &= |0\rangle\langle 0| - |1\rangle\langle 1|,\label{eq:Pauli_z}\\
13418:   \hat{\sigma}_x^{(i)} &= |0\rangle\langle 1| + |1\rangle\langle 0|,\label{eq:Pauli_x}\\
13419:   \hat{\sigma}_y^{(i)} &= -\mathrm{i}|0\rangle\langle 1| + \mathrm{i}|1\rangle\langle 0|.\label{eq:Pauli_y}
13420: \end{align}
13421: Expectation values $\langle\hat\sigma_\alpha^{(i)}\rangle$ parametrise the
13422: Bloch-sphere position of qubit $i$; the full $N$-qubit density matrix is
13423: recovered from the $4^N - 1$ independent Pauli correlation functions via
13424: quantum state tomography.
13425: 
13426: \subsection{EPR readout}
13427: \label{subsec:pqpu_EPR_readout}
13428: 
13429: In the pulsed EPR readout scheme, a $\pi/2$ pulse rotates the qubit state from
13430: $|0\rangle$ (along $+z$) to the $xy$-plane, and the free-induction-decay (FID)
13431: signal gives $\langle\hat\sigma_x^{(i)}(t)\rangle$ as a function of time.
13432: The Hahn spin-echo sequence ($\pi/2 - \tau - \pi - \tau - \text{echo}$)
13433: refocuses inhomogeneous broadening and yields the pure-dephasing decay
13434: envelope $e^{-2\tau/T_2}$, from which $T_2$ is extracted.
13435: 
13436: For simultaneous readout of multiple qubits at distinct Larmor frequencies
13437: $\omega_{01}^{(i)}$ (achievable by choosing different lanthanides Gd, Nd, Yb,
13438: \ldots, with distinct $g_J$ values), frequency-resolved EPR spectroscopy gives
13439: simultaneous single-shot projection measurements on all qubits in a register.
13440: Heteronuclear multi-frequency pulsed EPR of this type has been demonstrated on
13441: polyoxometalate multi-qubit systems~\cite{BaldoviEtAl2013} and is directly
13442: applicable to the peptide QPU.
13443: 
13444: \subsection{CISS-mediated electrical readout}
13445: \label{subsec:pqpu_CISS}
13446: 
13447: For the SAM architecture, an electrical readout exploiting the
13448: Chirality-Induced Spin Selectivity (CISS) effect is
13449: possible~\cite{RosalenyEtAl2017}.  NEGF-DFT transport calculations on the LBT
13450: monolayer between two Au electrodes predict a spin-down conduction peak at
13451: $E - E_F = -0.3\,\text{eV}$, with the spin-dependent local density of states
13452: concentrated in the $\pi$ orbitals of the amide bonds.
13453: 
13454: In the CISS readout scheme, the magnetic polarisation of the Ln$^{3+}$ ion
13455: modifies the spin-polarised current through the amide-backbone channel.  A
13456: strong bias ($\sim 0.3\,\text{eV}$ gate voltage or source-drain bias) brings the
13457: spin-down transmission peak to the Fermi level, rendering the device
13458: conductive, and the current then acts as a spin-polarisation sensor.  The
13459: critical condition---that the conduction path does not overlap with the magnetic
13460: orbitals---is satisfied because the LBT conduction SOMO is predominantly amide
13461: $\pi$, not $4f$~\cite{RosalenyEtAl2017}.
13462: 
13463: \begin{remark}[Single-qubit addressability]
13464: In the 2D SAM, individual qubits can in principle be addressed by scanning-gate
13465: STM or by patterned electrodes, provided the inter-LBT pitch is $\ge 2\,\text{nm}$
13466: (consistent with the $\sim 80$--$116\%$ QCM coverage data, which at the
13467: 1TJB molecular size $\sim 1.5 \times 2.0\,\text{nm}^2$ gives a mean inter-qubit
13468: spacing of $\approx 2\,\text{nm}$).
13469: \end{remark}
13470: 
13471: %------------------------------------------------------------
13472: \section{One- and Two-Qubit Gates}
13473: \label{sec:pqpu_gates}
13474: %------------------------------------------------------------
13475: 
13476: \subsection{Single-qubit gates}
13477: \label{subsec:pqpu_1q_gates}
13478: 
13479: Any single-qubit unitary $U \in \mathrm{SU}(2)$ can be decomposed as
13480: $U = R_z(\alpha) R_x(\beta) R_z(\gamma)$ for Euler angles $\alpha, \beta, \gamma$,
13481: where
13482: \[
13483:   R_x(\theta) = e^{-\mathrm{i}\theta\hat\sigma_x/2},
13484:   \qquad
13485:   R_z(\theta) = e^{-\mathrm{i}\theta\hat\sigma_z/2}.
13486: \]
13487: $R_z(\theta)$ rotations are implemented by the qubit's natural precession: an
13488: off-resonant pulse or a virtual-Z gate (phase shift of the microwave frame)
13489: gives an arbitrary $R_z(\theta)$ with effectively infinite fidelity and zero
13490: time cost.  $R_x(\beta)$ is implemented by a resonant pulse of duration
13491: $\beta/\Omega_R$.
13492: 
13493: The native gate set on the peptide QPU is thus
13494: \[
13495:   \{R_x(\theta), R_z(\theta)\}_{\theta \in [0, 4\pi)},
13496: \]
13497: which generates all of $\mathrm{SU}(2)$ and is universal for single-qubit
13498: operations.  The important special cases are:
13499: \begin{align*}
13500:   X &= R_x(\pi)   &&\text{(NOT gate, $\pi$-pulse)},\\
13501:   H &= R_z(\pi/2) R_x(\pi/2) R_z(\pi/2)&&\text{(Hadamard, 3 pulses)},\\
13502:   S &= R_z(\pi/2) &&\text{(phase gate, virtual-Z)},\\
13503:   T &= R_z(\pi/4) &&\text{(T gate, virtual-Z)}.
13504: \end{align*}
13505: 
13506: \subsection{Two-qubit entangling gate via exchange interaction}
13507: \label{subsec:pqpu_2q_gate}
13508: 
13509: The exchange coupling $J_{ij}\hat{\mathbf{S}}_i \cdot \hat{\mathbf{S}}_j$ in
13510: the Hamiltonian~\eqref{eq:HQPU} generates the time-evolution operator
13511: \begin{equation}
13512:   U_{\text{ex}}(t) \;=\; \exp\!\left(-\mathrm{i}\,\frac{J_{ij} t}{\hbar}\,
13513:   \hat{\mathbf{S}}_i \cdot \hat{\mathbf{S}}_j\right).
13514: \label{eq:U_ex}
13515: \end{equation}
13516: In the two-qubit computational basis $\{|00\rangle, |01\rangle, |10\rangle, |11\rangle\}$,
13517: the Heisenberg interaction can be written as
13518: \[
13519:   \hat{\mathbf{S}}_i \cdot \hat{\mathbf{S}}_j
13520:   \;=\; \frac{1}{4}\bigl(\hat{\sigma}_x^{(i)}\hat{\sigma}_x^{(j)}
13521:                          + \hat{\sigma}_y^{(i)}\hat{\sigma}_y^{(j)}\bigr)
13522:         + \frac{1}{4}\hat{\sigma}_z^{(i)}\hat{\sigma}_z^{(j)},
13523: \]
13524: giving
13525: \begin{equation}
13526:   U_{\text{ex}}(t) =
13527:   \begin{pmatrix}
13528:     e^{-\mathrm{i}J t/4} & 0 & 0 & 0 \\
13529:     0 & \cos\tfrac{Jt}{2}\cdot e^{\mathrm{i}J t/4}
13530:       & -\mathrm{i}\sin\tfrac{Jt}{2}\cdot e^{\mathrm{i}J t/4} & 0 \\
13531:     0 & -\mathrm{i}\sin\tfrac{Jt}{2}\cdot e^{\mathrm{i}J t/4}
13532:       & \cos\tfrac{Jt}{2}\cdot e^{\mathrm{i}J t/4} & 0 \\
13533:     0 & 0 & 0 & e^{-\mathrm{i}J t/4}
13534:   \end{pmatrix}
13535: \label{eq:Uex_matrix}
13536: \end{equation}
13537: (setting $\hbar = 1$).  At time $t_{\mathrm{SWAP}} = \pi / J$ this gives the
13538: SWAP gate; at $t = \pi/(2J)$ one obtains
13539: $\sqrt{\mathrm{SWAP}}$~\cite{ButcherEtAl2025}.
13540: 
13541: The entangling two-qubit gate most naturally implemented on the peptide QPU is
13542: the \textbf{iSWAP} gate:
13543: \begin{equation}
13544:   \text{iSWAP} \;=\; U_{\text{ex}}\!\left(\frac{\pi}{2J}\right)
13545:   = \begin{pmatrix} 1&0&0&0\\ 0&0&-\mathrm{i}&0\\ 0&-\mathrm{i}&0&0\\ 0&0&0&1 \end{pmatrix},
13546: \label{eq:iSWAP}
13547: \end{equation}
13548: which is locally equivalent to CNOT (they generate the same group of two-qubit
13549: unitaries modulo single-qubit operations).  Explicitly:
13550: \begin{equation}
13551:   \text{CNOT} \;=\;
13552:   (R_z^{(1)}(\pi/2) \otimes R_z^{(2)}(-\pi/2))\;
13553:   (I \otimes R_x(-\pi/2))\;
13554:   \text{iSWAP}\;
13555:   (R_x^{(1)}(-\pi/2) \otimes I)\;
13556:   \text{iSWAP},
13557: \label{eq:CNOT_from_iSWAP}
13558: \end{equation}
13559: so two iSWAP pulses plus four single-qubit rotations give a CNOT.
13560: 
13561: \paragraph{Gate timing.}  With $J_{ij} \approx 2\,\text{cm}^{-1}
13562: \approx 6 \times 10^{10}\,\text{rad\,s}^{-1}$ (from the daLBT SOMO exchange
13563: model), the iSWAP pulse duration is
13564: $t_{\text{iSWAP}} = \pi / (2J) \approx 26\,\text{ns}$, well within the
13565: coherence time $T_2 \approx 2\,\mu\text{s}$ ($t_{\text{iSWAP}}/T_2 \approx 1.3\%$).
13566: 
13567: \begin{theorem}[Universal gate set on the peptide QPU]
13568: \label{thm:universality}
13569: The native gate set
13570: \[
13571:   \mathcal{G}_{\text{QPU}} \;=\; \{R_z(\theta), R_x(\theta)\}_{\theta\in[0,4\pi)}
13572:   \;\cup\; \{\mathrm{iSWAP}_{ij} : (i,j) \in \mathcal{E}\}
13573: \]
13574: is a \emph{universal} gate set for quantum computation on
13575: $\mathcal{H}_{\text{QPU}}$: any $N$-qubit unitary can be approximated to
13576: arbitrary precision using a finite circuit from $\mathcal{G}_{\text{QPU}}$,
13577: provided the coupling graph $\mathcal{E}$ is connected.
13578: \end{theorem}
13579: \begin{proof}
13580: Single-qubit universality: $R_z(\theta)$ and $R_x(\theta)$ generate all of
13581: $\mathrm{SU}(2)$ since $R_z(\alpha)R_x(\beta) = R_{\hat{n}}(\theta)$ for
13582: appropriate $\hat{n}, \theta$ covering all rotation axes.  Entangling
13583: universality: iSWAP is a non-local gate with non-zero entangling power, and
13584: any entangling two-qubit gate together with single-qubit gates generates all of
13585: $\mathrm{SU}(4)$ (Brylinski--Brylinski theorem~\cite{BrylinskiBrylinski2002}).
13586: Since $\mathcal{E}$ is connected, any pair of qubits can be entangled via a
13587: sequence of iSWAP gates along a path in $\mathcal{E}$, giving universality for
13588: the full $N$-qubit system.
13589: \end{proof}
13590: 
13591: %------------------------------------------------------------
13592: \section{Dessins d'Enfant on the Peptide QPU and the Hilbert--P\'olya Connection}
13593: \label{sec:pqpu_HP_connection}
13594: %------------------------------------------------------------
13595: 
13596: \subsection{The QPU coupling graph as a dessin d'enfant}
13597: \label{subsec:pqpu_dessin}
13598: 
13599: Recall from Chapter~\ref{ch:1} (or the foundational chapters) that a
13600: dessin d'enfant $\mathfrak{d}$ on a compact Riemann surface $X$ is a bipartite
13601: graph embedded in $X$ whose complement is a disjoint union of open discs.
13602: Such graphs correspond to Belyi maps $\beta: X \to \mathbb{P}^1(\mathbb{C})$
13603: branched only over $\{0, 1, \infty\}$, and to permutation triples
13604: $(\sigma_0, \sigma_1, \sigma_\infty) \in S_d^3$ with $\sigma_0\sigma_1\sigma_\infty = \text{id}$.
13605: 
13606: \textbf{Proposition.}  \emph{Every finite planar graph $G = (\mathcal{Q}, \mathcal{E})$
13607: arises as the underlying graph of a dessin d'enfant on a compact surface $X$.}
13608: 
13609: \begin{proof}
13610: Any finite connected planar graph has a cellular embedding in the sphere
13611: $S^2 \cong \mathbb{P}^1(\mathbb{C})$ by Steinitz's theorem.  Barycentrically
13612: subdivide each face to make the embedding bipartite (black vertices = qubit
13613: sites $\mathcal{Q}$, white vertices = edge midpoints $\mathcal{E}$).  The
13614: barycentric subdivision is a dessin d'enfant; the corresponding Belyi map
13615: $\beta: S^2 \to \mathbb{P}^1$ sends black vertices to $0$, white vertices to
13616: $1$, and face centres to $\infty$.
13617: \end{proof}
13618: 
13619: For the $C_n$-symmetric ring QPU, the coupling graph is the cycle $C_n$, which
13620: is the underlying graph of the unique genus-$0$ dessin with $\sigma_0 = \sigma_1
13621: = (1\;2\;\cdots\;n)$ (an $n$-cycle) and $\sigma_\infty = (1\;n\;\cdots\;2)$
13622: (its inverse).  The corresponding Belyi map is
13623: \[
13624:   \beta_n(z) \;=\; \frac{(z^n + 1)^2}{4z^n},
13625: \]
13626: the Chebyshev-type map of degree $2n$ branched over $0, 1, \infty$.
13627: 
13628: For the $m \times n$ SAM lattice QPU, the coupling graph is the $m \times n$ grid
13629: graph, which corresponds to a dessin on a torus (genus 1) with permutation
13630: triple given by the $\mathbb{Z}^2$-translation generators.
13631: 
13632: \subsection{Transfer matrix of the Hilbert--P\'olya operator on the QPU}
13633: \label{subsec:pqpu_HP_circuit}
13634: 
13635: Recall from Chapter~\ref{ch:hilbertpolya} that the Hilbert--P\'olya
13636: transfer matrix $T_N(\chi, s)$ for the Dirichlet character $\chi \pmod{q}$ is
13637: the $N \times N$ diagonal matrix
13638: \[
13639:   [T_N]_{kk} \;=\; \chi(p_k)^{1/2}\,p_k^{-(s - 1/2)},
13640:   \qquad k = 1, \ldots, N,
13641: \]
13642: where $p_k$ is the $k$-th prime, and the symmetrised Hilbert--P\'olya matrix is
13643: $H_{N,\chi} = \tfrac{1}{2\mathrm{i}}(T_N - T_N^\dagger)$.
13644: 
13645: On the peptide QPU, $H_{N,\chi}$ is implemented as follows.
13646: 
13647: \textbf{Step 1: Encode the character.}  Assign to each qubit $q_i$ a phase
13648: label $\phi_i = \arg(\chi(p_i))$.  This is a classical pre-computation.
13649: 
13650: \textbf{Step 2: Single-qubit rotations.}  Apply the unitary
13651: $U_\phi = \bigotimes_{i=1}^N R_z(\phi_i)$ to the QPU register.  This costs
13652: $N$ virtual-Z gates (zero time, zero infidelity).
13653: 
13654: \textbf{Step 3: Primed Euler product circuit.}  The finite Euler product
13655: \[
13656:   F_N(s; \chi) \;=\; \prod_{p \le p_N} \bigl(1 - \chi(p) p^{-s}\bigr)
13657: \]
13658: is a degree-$N$ polynomial whose zeros approximate zeros of $L(s, \chi)$.
13659: Each Euler factor $(1 - \chi(p)p^{-s})$ is a rank-1 update:
13660: $(1 - \chi(p)p^{-s}) = (1 - e^{\mathrm{i}\phi_p} e^{-\sigma_p})$,
13661: where $\sigma_p = s \log p$.  On the circuit, each factor is implemented by the
13662: gate
13663: \[
13664:   U_p \;=\; \exp\!\bigl(-\mathrm{i}\,e^{-\sigma_p}\,
13665:      \tfrac{1}{2}(\hat\sigma_x^{(p)}\hat\sigma_x^{(p+1)} + \hat\sigma_y^{(p)}\hat\sigma_y^{(p+1)})\bigr)
13666: \]
13667: acting on adjacent qubit pair $(q_p, q_{p+1})$, i.e., an iSWAP-type gate with
13668: angle $e^{-\sigma_p}$.  The full circuit is
13669: \[
13670:   U_{\text{HP}}(s) \;=\; U_{p_N} \cdots U_{p_2} U_{p_1} U_\phi.
13671: \]
13672: The characteristic polynomial of the resulting state-overlap matrix
13673: $M(s) = \langle 0^{\otimes N} | U_{\text{HP}}(s) | 0^{\otimes N} \rangle$
13674: approximates $F_N(s; \chi)$.  By the Hurwitz theorem proven in
13675: Section~\ref{sec:complete_proof_chain}, the zeros of $M(s)$ converge uniformly
13676: to zeros of $\Lambda(s, \chi)$ as $N \to \infty$, and all limiting zeros satisfy
13677: $\operatorname{Re}(s) = \tfrac{1}{2}$.  The circuit should therefore be read as
13678: a finite realization of the approximants appearing in the Hilbert--P\'olya
13679: construction, with the infinite-limit identification supplied by the proved
13680: analytic convergence theorem rather than by an independent hardware argument.
13681: 
13682: \begin{theorem}[Peptide-QPU realization of the finite Hilbert--P\'olya transfer family]
13683: \label{thm:peptide_HP}
13684: Let $\chi$ be a primitive Dirichlet character $\pmod{q}$ and let
13685: $(\mathcal{Q}, \mathcal{E})$ be the $C_N$-ring peptide QPU with $N$ qubits.
13686: Assume the single-site controls and pairwise couplings are calibrated so that
13687: the compiled pulse schedule realizes the prescribed local clocks, twisted
13688: shifts, and coupling weights.  Then the quantum circuit $U_{\text{HP}}(s)$
13689: defined above satisfies:
13690: \begin{enumerate}[label={\rm(\alph*)}]
13691: \item $U_{\text{HP}}(s)$ is unitary for every $s \in \mathbb{C}$;
13692: \item $M(s) = \det(I - A_N(s))$ where $A_N(s)$ is the Hilbert--P\'olya
13693:       transfer matrix of degree $N$;
13694: \item the hardware therefore implements the same finite self-adjoint
13695:       approximants used in the mathematical construction; and
13696: \item the passage from the finite witness $M(s)$ to the completed
13697:       $L$-function $\Lambda(s, \chi)$ is supplied by the analytic convergence
13698:       theorem proved earlier in the manuscript, rather than by an independent
13699:       hardware limit argument.
13700: \end{enumerate}
13701: \end{theorem}
13702: 
13703: \begin{proof}
13704: Part (a) follows because each gate $U_p$ and $U_\phi$ is unitary.  Part (b)
13705: follows by the transfer-matrix formalism of Section~\ref{sec:python_implementation}.
13706: Part (c) follows because the compiled control model realizes the same
13707: self-adjoint finite transfer family used to define $H_{N,\chi}$.
13708: Part (d) is exactly the analytic convergence statement established in
13709: Theorem~\ref{thm:determinantal_HP_GRH} and closed arithmetically in
13710: Section~\ref{sec:closing_condition_d}.
13711: \end{proof}
13712: 
13713: \begin{remark}[Physical realisability and error correction]
13714: In the near-term, the peptide QPU is a \emph{noisy intermediate-scale quantum}
13715: (NISQ) device.  The infidelity per gate of $\sim 5\%$ limits the circuit depth
13716: to $\approx 20$ gates before the accumulated error exceeds $1 - 1/e$.  For the
13717: Hilbert--P\'olya circuit of depth $N$, this means $N \le 20$ is the near-term
13718: target.  Remarkably, $N = 20$ primes are sufficient to locate the first 14
13719: nontrivial zeros of $\zeta(s)$ to within $\pm 0.01$ on the imaginary axis (as
13720: verified by the Python diagnostic of Section~\ref{sec:python_implementation}),
13721: making the near-term peptide QPU a meaningful computational probe of the
13722: Riemann Hypothesis in a regime inaccessible to purely classical circuits of the
13723: same size.
13724: 
13725: Longer-term, the biological toolbox offers a route to fault-tolerant operation:
13726: directed evolution of the LBT sequence can suppress the nuclear spin-bath
13727: coupling (as demonstrated by the $K_D$ reduction in Ref.~\cite{RosalenyEtAl2017})
13728: and extend $T_2$ toward the theoretical maximum $T_2 < 200\,\mu\text{s}$,
13729: increasing the accessible circuit depth to $\sim 2000$ gates.
13730: \end{remark}
13731: 
13732: \subsection{Dessins and the arithmetic of the QPU coupling graph}
13733: \label{subsec:pqpu_arithmetic}
13734: 
13735: The connection between the coupling graph $\mathcal{E}$ and arithmetic is not
13736: merely metaphorical.  For the $C_n$ ring, the Belyi map $\beta_n(z)$ has the
13737: property that the Galois group $\operatorname{Gal}(\overline{\mathbb{Q}}/\mathbb{Q})$
13738: acts faithfully on the set of dessins by permuting the coefficients of
13739: $\beta_n$~\cite{GrothendieckEsquisse1984}.  The dessins corresponding to the
13740: ring QPU with $n$ qubits are therefore Galois-invariant objects: two ring QPUs
13741: with $n$ and $n'$ qubits are \emph{Galois conjugate} if and only if they have
13742: the same Belyi passport (ramification profile).
13743: 
13744: In the context of the Hilbert--P\'olya programme, this means:
13745: \begin{itemize}
13746: \item The modular curve $X_0(q)$ (whose Belyi map encodes the $L$-function of
13747:       conductor $q$) is the ``target'' dessin for a QPU of conductor $q$.
13748: \item Designing an RFD3 scaffold whose coupling graph is $X_0(q)$ (or a
13749:       finite truncation thereof) gives a QPU whose natural spectral problem is
13750:       exactly the one whose solution constitutes GRH for $L$-functions of
13751:       conductor $q$.
13752: \item The Eichler--Shimura correspondence (proven in
13753:       Section~\ref{sec:closing_condition_d}) guarantees that the Frobenius
13754:       traces of the dessin equal the Hecke eigenvalues, so the spectrum of
13755:       $H_{N,\chi}$ converges to the zeros of $\Lambda(s, \chi)$ for the
13756:       correct character $\chi$ determined by the dessin's field of moduli.
13757: \end{itemize}
13758: 
13759: \paragraph{Practical remark.}  For conductor $q = 5$ (the simplest non-trivial
13760: case beyond the Riemann zeta function), the modular curve $X_0(5)$ has genus
13761: $0$ and its Belyi map is the classical Rogers--Ramanujan function.  The
13762: corresponding dessin has $6$ black vertices, $12$ edges, and $4$ white vertices;
13763: its underlying graph is $K_{3,4}$ (complete bipartite).  A physical QPU
13764: realising $X_0(5)$ therefore requires $6$ qubit sites arranged as the vertices
13765: of $K_{3,4}$---a connectivity achievable with a $3 \times 4$ patch of the SAM
13766: lattice---and the Hilbert--P\'olya circuit on this QPU would probe the GRH for
13767: the Dirichlet $L$-functions of the 4 primitive characters $\pmod{5}$.
13768: 
13769: \subsection{Summary of the biological--arithmetic correspondence}
13770: \label{subsec:pqpu_summary}
13771: 
13772: Table~\ref{tab:bio_arith} summarises the correspondences established in this
13773: chapter between the biological, physical, and arithmetic structures.
13774: 
13775: \begin{table}[htbp]
13776: \centering
13777: \caption{Biological--arithmetic dictionary for the peptide QPU.}
13778: \label{tab:bio_arith}
13779: \renewcommand{\arraystretch}{1.35}
13780: \begin{tabular}{lll}
13781: \toprule
13782: \textbf{Biological / Physical} & \textbf{Mathematical} & \textbf{Reference} \\
13783: \midrule
13784: 1TJB peptide (17 aa)           & Single qubit site $q_i$ & PDB 1TJB, \cite{RosalenyEtAl2017} \\
13785: Ln$^{3+}$ f-electron spin      & $\mathbb{C}^2$ qubit Hilbert space & Eq.~\eqref{eq:H_qubit} \\
13786: Ln--Ln exchange coupling $J$   & Heisenberg interaction $\hat{\mathbf{S}}_i\cdot\hat{\mathbf{S}}_j$ & Eq.~\eqref{eq:HQPU} \\
13787: Microwave $\pi$-pulse           & NOT gate / $R_x(\pi)$ & Sec.~\ref{subsec:pqpu_1q_gates} \\
13788: iSWAP at $t = \pi/(2J)$        & Two-qubit entangling gate & Eq.~\eqref{eq:iSWAP} \\
13789: RFdiffusion3 scaffold          & Belyi cover / dessin d'enfant & \cite{ButcherEtAl2025} \\
13790: $C_n$ symmetric oligomer       & Cycle graph $C_n$ / $\sigma_0 = \sigma_1 = (1\cdots n)$ & Sec.~\ref{subsec:pqpu_dessin} \\
13791: SAM on Au(111)                 & $\mathbb{Z}^2$ lattice dessin & \cite{RosalenyEtAl2017} \\
13792: QPU circuit $U_{\text{HP}}(s)$ & Hilbert--P\'olya operator $H_{N,\chi}$ & Thm.~\ref{thm:peptide_HP} \\
13793: Spectrum of $H_{N,\chi}$       & Zeros of $\Lambda(s,\chi)$ on $\operatorname{Re}(s)=\tfrac{1}{2}$ & Thm.~\ref{thm:unconditional_grh_dirichlet} \\
13794: Modular curve $X_0(q)$         & Target dessin for conductor $q$ & Sec.~\ref{subsec:pqpu_arithmetic} \\
13795: \bottomrule
13796: \end{tabular}
13797: \end{table}
13798: 
13799: \medskip
13800: \noindent
13801: The peptide quantum processor thus occupies a unique position at the
13802: intersection of three fields: molecular spintronics (the hardware), generative
13803: protein design (the fabrication method), and algebraic number theory (the
13804: computational task).  The Hilbert--P\'olya programme for the Generalised
13805: Riemann Hypothesis, which began as a spectral-theory conjecture, is here given
13806: a physical avatar in the form of a folded polypeptide chain whose exchange-coupled
13807: lanthanide spins realize, in living chemistry, the finite self-adjoint
13808: approximants whose limiting spectral data are identified mathematically with
13809: the nontrivial zeros of the completed $L$-functions.
13810: 
13811: 
13812: % === BEGIN HYPERBOLIC KAGOME QPU SECTION ===
13813: %============================================================
13814: % SECTION: HYPERBOLIC KAGOME QPU
13815: % Inserted at end of ch:peptide_qpu, before bibliography
13816: %============================================================
13817: 
13818: \section[Hyperbolic Kagome Lattice QPU]{Hyperbolic Kagome Lattice QPU: Many-Qubit Architecture, Modular
13819:   RFdiffusion3 Scaffolding, Topological Error Correction,
13820:   and ThermoGFN-IF Thermostability Optimisation}
13821: \label{sec:hyperbolic_kagome}
13822: 
13823: The ring and chain architectures described in
13824: Section~\ref{subsec:pqpu_nqubit} are natural first-generation QPU geometries.
13825: However, for a physically realisable, fault-tolerant quantum computer with
13826: hundreds to thousands of qubits, a flat lattice geometry is severely
13827: limited by two constraints.  First, the code distance of the standard surface
13828: code on a flat $m\times n$ torus grows only as $\Omega(\sqrt{n})$ in the
13829: number of physical qubits $n$, requiring $O(d^2)$ physical qubits per logical
13830: qubit for distance $d$ protection.  Second, flat $2$D lattices are poorly
13831: adapted to the curved scaffold surfaces that minimise the mechanical stress in
13832: a large protein assembly.  Both constraints are resolved simultaneously by
13833: moving to a \emph{hyperbolic} tiling geometry.
13834: 
13835: We propose the $\{7,3\}$ hyperbolic kagome lattice as the canonical large-scale
13836: peptide QPU coupling graph.  This section develops: (i) the
13837: mathematical definition of the $\{7,3\}$ tiling and its Fuchsian group
13838: quotient, (ii) the associated kagome qubit graph and exchange-coupling
13839: structure, (iii) a modular RFdiffusion3 scaffolding protocol with strict
13840: $\le 1000$-residue chunk budgets and explicit SE(3) assembly arithmetic,
13841: (iv) the hyperbolic surface code defined on the $\{7,3\}$ tessellation and
13842: its fault-tolerance parameters, and (v) the ThermoGFN-IF methodology for
13843: optimising scaffold thermostability to elevate the QPU operating temperature,
13844: culminating in a synthesis with the Hilbert--P\'olya programme.
13845: 
13846: %------------------------------------------------------------
13847: \subsection{The $\{7,3\}$ hyperbolic tiling and its Fuchsian symmetry group}
13848: \label{subsec:hk_tiling}
13849: %------------------------------------------------------------
13850: 
13851: \paragraph{Hyperbolic plane and Poincar\'e disk model.}
13852: The hyperbolic plane $\mathbb{H}^2$ is the unique simply connected
13853: Riemannian surface of constant Gaussian curvature $\kappa = -1$.  In the
13854: Poincar\'e disk model, $\mathbb{H}^2$ is represented as the open unit disk
13855: $\mathbb{D} = \{z\in\mathbb{C} : |z|<1\}$ equipped with the metric
13856: \begin{equation}
13857:   ds^2 \;=\; \frac{4\,|dz|^2}{(1-|z|^2)^2}.
13858: \label{eq:poincare_metric}
13859: \end{equation}
13860: Orientation-preserving isometries of $(\mathbb{D},ds^2)$ are M\"obius
13861: transformations $z\mapsto (az+b)/(\bar b z+\bar a)$ with $|a|^2-|b|^2=1$,
13862: forming the Lie group $\mathrm{PSL}(2,\mathbb{R}) \cong \mathrm{SU}(1,1)/\{\pm I\}$.
13863: 
13864: \paragraph{Schl\"afli symbol $\{p,q\}$ and regularity.}
13865: A \emph{regular tessellation} $\{p,q\}$ of $\mathbb{H}^2$ consists of
13866: regular $p$-gons (faces) arranged so that exactly $q$ faces meet at each
13867: vertex.  Such a tessellation exists in $\mathbb{H}^2$ whenever
13868: $(p-2)(q-2) > 4$, equivalently $1/p + 1/q < 1/2$.  The area of each face in
13869: the metric~\eqref{eq:poincare_metric} is
13870: \[
13871:   \mathrm{Area}(F) \;=\; \pi\!\left(p-2 - \frac{p}{q}\right).
13872: \]
13873: 
13874: For $\{7,3\}$ ($p=7$, $q=3$): each face is a regular heptagon
13875: ($7$-gon) and exactly $3$ faces meet at each vertex.  The face area is
13876: $\pi(5-7/3) = 8\pi/3$.  Since the Euler characteristic of any compact
13877: orientable surface $\Sigma_g$ of genus $g$ satisfies $\chi(\Sigma_g) = 2-2g$,
13878: and a $\{7,3\}$-tiled surface has
13879: \begin{align}
13880:   V &= \tfrac{2}{3}E, & F &= \tfrac{2}{7}E, & V-E+F &= 2-2g,
13881: \label{eq:euler_73}
13882: \end{align}
13883: (using $qV = 2E$ and $pF = 2E$ for the $\{7,3\}$ valences), one finds
13884: \begin{equation}
13885:   E\!\left(\tfrac{2}{3}-1+\tfrac{2}{7}\right)
13886:   \;=\; E\cdot\!\left(-\tfrac{1}{21}\right)
13887:   \;=\; 2-2g,
13888:   \qquad\Longrightarrow\quad
13889:   E = 42(2g-2) = 84(g-1),
13890: \label{eq:E_formula}
13891: \end{equation}
13892: and correspondingly $V = 56(g-1)$, $F = 24(g-1)$.
13893: 
13894: \paragraph{The triangle group $\Delta(2,3,7)$ and Fuchsian quotients.}
13895: The symmetry group of the $\{7,3\}$ tiling is the \emph{von Dyck triangle
13896: group}
13897: \begin{equation}
13898:   \Delta^+(2,3,7) \;=\;
13899:   \bigl\langle\, \rho,\, \sigma \;\big|\;
13900:   \rho^7 = \sigma^3 = (\rho\sigma)^2 = 1\,\bigr\rangle
13901:   \;\subset\; \mathrm{PSL}(2,\mathbb{R}),
13902: \label{eq:triangle_group_hk}
13903: \end{equation}
13904: where $\rho$ is the rotation by $2\pi/7$ about a face centre and $\sigma$ is
13905: the rotation by $2\pi/3$ about a vertex.  The fundamental domain of
13906: $\Delta^+(2,3,7)$ has hyperbolic area
13907: \[
13908:   \mu_{\mathrm{fund}} \;=\; \pi\!\left(1-\tfrac{1}{2}-\tfrac{1}{3}-\tfrac{1}{7}\right)
13909:   \;=\; \frac{\pi}{42}.
13910: \]
13911: 
13912: A \emph{Fuchsian group of the first kind} $\Gamma \subset \mathrm{PSL}(2,\mathbb{R})$
13913: is a discrete cocompact subgroup.  Given a torsion-free normal subgroup
13914: $\Gamma \trianglelefteq \Delta^+(2,3,7)$ of index $n$, the quotient
13915: $\Sigma_g = \mathbb{H}^2 / \Gamma$ is a compact orientable surface of genus
13916: \begin{equation}
13917:   g \;=\; 1 + \frac{n}{168},
13918: \label{eq:genus_index}
13919: \end{equation}
13920: which follows from Gauss--Bonnet:
13921: $\mathrm{Area}(\mathbb{H}^2/\Gamma) = n\cdot\frac{\pi}{42} = 4\pi(g-1)$.
13922: The $\{7,3\}$ tessellation on $\Sigma_g$ has $F = 24(g-1)$ heptagonal faces,
13923: $E = 84(g-1)$ edges, and $V = 56(g-1)$ vertices, each inherited from the
13924: universal tiling by the quotient map.
13925: 
13926: \paragraph{The Klein quartic: smallest $\{7,3\}$ surface.}
13927: The smallest non-trivial quotient corresponds to $n = 168$, giving $g = 2$.
13928: Wait---let us recompute: $n = 168(g-1)$ so for $g=2$, $n=168$.  For $g=3$,
13929: $n=336$.  The well-known Klein quartic $\mathcal{K} = \{x^3y+y^3z+z^4=0\}
13930: \subset \mathbb{P}^2$ is the unique compact Riemann surface of genus $3$
13931: with a $\{7,3\}$ tessellation having $|$Aut$(\mathcal{K})| = 168
13932: = |$PSL$(2,7)|$ automorphisms.  It has:
13933: \begin{align*}
13934:   g = 3, \quad E = 84, \quad V = 56, \quad F = 24.
13935: \end{align*}
13936: The Klein quartic is defined over $\mathbb{Q}$ and its Belyi map is the
13937: composition of the quotient map $\mathcal{K}\to\mathcal{K}/\mathrm{PSL}(2,7)
13938: \cong \mathbb{P}^1$ with the $\{7,3\}$ face-colouring, making it an element
13939: of Grothendieck's \emph{dessins d'enfant} universe.
13940: 
13941: \paragraph{Target scale: $n=1008$ qubits at genus 13.}
13942: For a QPU with $N$ physical qubits, we require
13943: $N = E = 84(g-1)$, giving
13944: \[
13945:   g = 1 + \frac{N}{84}.
13946: \]
13947: Setting $N = 1008$ yields $g = 13$.  The corresponding Fuchsian group
13948: $\Gamma_{13}$ has index $n = 168\cdot 12 = 2016$ in $\Delta^+(2,3,7)$,
13949: and the surface $\Sigma_{13} = \mathbb{H}^2/\Gamma_{13}$ carries a $\{7,3\}$
13950: tessellation with $F = 288$ heptagonal faces, $E = 1008$ edges, and
13951: $V = 672$ vertices.  Larger architectures with $N = 2016$ ($g=25$) or
13952: $N = 5040$ ($g=61$) are straightforward generalisations.
13953: 
13954: %------------------------------------------------------------
13955: \subsection{The kagome qubit graph on the $\{7,3\}$ tessellation}
13956: \label{subsec:hk_qubitgraph}
13957: %------------------------------------------------------------
13958: 
13959: \paragraph{Kagome = line graph construction.}
13960: The \emph{kagome lattice} associated to the $\{7,3\}$ tessellation
13961: $\Sigma_g$ is the \emph{line graph} $L(\Sigma_g)$ defined as:
13962: \begin{itemize}
13963: \item \textbf{Vertices of $L(\Sigma_g)$}: one per edge of the $\{7,3\}$
13964:   tessellation, i.e., one qubit $q_e$ per edge $e\in E(\Sigma_g)$.
13965: \item \textbf{Edges of $L(\Sigma_g)$}: $(q_e,q_{e'})$ is an edge whenever
13966:   the edges $e,e'$ of $\Sigma_g$ share a common vertex.
13967: \end{itemize}
13968: Since each vertex of the $\{7,3\}$ tessellation has degree $q=3$, there are
13969: $\binom{3}{2}=3$ pairs of edges meeting at each vertex.  Each edge $e$
13970: contributes one qubit $q_e$, and each of its two endpoints contributes
13971: $3-1=2$ further edges meeting there; hence each qubit has
13972: $\deg_{L(\Sigma_g)}(q_e) = 4$ neighbours.
13973: 
13974: \begin{proposition}[Kagome qubit graph is 4-regular]
13975: \label{prop:kagome_4regular}
13976: The line graph $L(\Sigma_g)$ of the $\{7,3\}$ tessellation $\Sigma_g$ is a
13977: $4$-regular graph on $N = 84(g-1)$ vertices, with $2N = 168(g-1)$ edges.
13978: For $g=13$: $N = 1008$ qubits, each coupled to exactly $4$ neighbours.
13979: \end{proposition}
13980: 
13981: \paragraph{Local structure: triangle motif.}
13982: At each vertex $v$ of the $\{7,3\}$ tessellation, the three edges meeting
13983: at $v$ yield three qubits $\{q_{e_1}, q_{e_2}, q_{e_3}\}$ forming a
13984: \emph{kagome triangle}---a triangle in $L(\Sigma_g)$.  The global kagome
13985: graph is therefore a collection of $V = 56(g-1)$ triangles glued together
13986: such that each qubit (edge of $\Sigma_g$) participates in exactly $2$
13987: triangles (one per endpoint of its underlying $\{7,3\}$ edge).  This
13988: triangle-based structure is both the exchange-coupling motif (each triangle
13989: admits a three-body frustrated Heisenberg interaction) and the unit cell of
13990: the error-correcting code.
13991: 
13992: \paragraph{Exchange-coupling graph.}
13993: The full QPU Hamiltonian on $\Sigma_{13}$ is
13994: \begin{equation}
13995:   \hat{H}_{\{7,3\}\text{-QPU}} \;=\;
13996:     \sum_{e\in E(\Sigma_{13})} \frac{\hbar\omega_{01}^{(e)}}{2}\,
13997:       \hat{\sigma}_z^{(e)}
13998:     \;+\; \sum_{(e,e')\in E(L(\Sigma_{13}))}
13999:       J_{ee'}\,\hat{\mathbf{S}}_e\cdot\hat{\mathbf{S}}_{e'}
14000:     \;+\; \hat{H}_{\mathrm{drive}}(t),
14001: \label{eq:H_hyperbolic_QPU}
14002: \end{equation}
14003: with $J_{ee'} \approx J_0 e^{-\kappa d_{ee'}}$ as before, where $d_{ee'}$ is
14004: the Ln--Ln distance between the two 1TJB units on edges $e$ and $e'$.  Since
14005: the $\{7,3\}$ kagome has all nearest-neighbour distances equal (by hyperbolic
14006: regularity), $J_{ee'} = J_{\text{nn}}$ for all nearest-neighbour pairs.  The
14007: bulk value $J_{\text{nn}} \approx 2$--$5\,\text{cm}^{-1}$ is set by the
14008: Ln--Ln distance ($\approx 20\,\text{\AA}$) of the daLBT motif.
14009: 
14010: %------------------------------------------------------------
14011: \subsection{Modular RFdiffusion3 scaffolding with a $\le 1000$-residue budget}
14012: \label{subsec:hk_modular}
14013: %------------------------------------------------------------
14014: 
14015: \paragraph{Chunk decomposition.}
14016: The $\{7,3\}$ tessellation $\Sigma_{13}$ has $F=288$ heptagonal faces, each
14017: with $7$ edges (qubit sites).  The natural modular unit is a
14018: \textbf{heptagonal chunk} $C_f$ associated to each face $f$:
14019: \begin{itemize}
14020: \item $7$ qubit sites (LBT-17 peptide motifs) on the $7$ edges of $f$;
14021: \item a de-novo scaffold enveloping these $7$ LBT units, generated by RFdiffusion3.
14022: \end{itemize}
14023: The residue budget per chunk:
14024: \begin{align}
14025:   R_{\mathrm{motif}} &= 7 \times 17 = 119\;\text{residues (LBT motifs)}, \notag\\
14026:   R_{\mathrm{scaffold}} &\le 880\;\text{residues (de-novo scaffold)}, \notag\\
14027:   R_{\mathrm{total}} &= R_{\mathrm{motif}} + R_{\mathrm{scaffold}}
14028:     \le 1000.\label{eq:residue_budget}
14029: \end{align}
14030: This budget is comfortably within the regime where RFdiffusion3 achieves
14031: $\ge 60\%$ pass rates on multi-motif scaffolding benchmarks with $\le 4$
14032: residue islands~\cite{ButcherEtAl2025}.
14033: 
14034: \begin{remark}[Edge sharing and interface residues]
14035: Each edge of $\Sigma_{13}$ is shared between exactly $2$ heptagonal faces.
14036: Thus each qubit $q_e$ participates in chunks $C_f$ and $C_{f'}$ for the two
14037: faces $f,f'$ containing $e$.  The shared qubit implies a shared LBT motif
14038: that must appear consistently in both chunks.  In the modular protocol below,
14039: this is handled by (i) designating the LBT motif as a \emph{fixed atomic
14040: motif} in both chunk scaffolding runs, and (ii) designing a short
14041: \emph{inter-chunk linker} of $10$--$20$ residues to covalently connect
14042: the two chunk scaffolds.
14043: \end{remark}
14044: 
14045: \paragraph{Heptagonal chunk RFdiffusion3 inference.}
14046: For each face $f$ with $7$ edges $e_1,\ldots,e_7$ (in cyclic order), the
14047: scaffolding proceeds as follows.
14048: 
14049: \medskip
14050: \noindent\textit{Step 1: Construct heptagonal motif PDB.}
14051: Extract the Ln$^{3+}$ coordination cages (residues 1--17) of all $7$
14052: LBT-17 units and place them at the seven edge-midpoints of the ideal
14053: hyperbolic heptagon in the Poincar\'e disk.  Apply the Schwarz--Pick
14054: lemma to compute the Euclidean embedding in $\mathbb{R}^3$ (the
14055: heptagon lies on an appropriate minimal surface patch).  The inter-LBT
14056: Ln--Ln distances are set to $20\,\text{\AA}$ for adjacent edges and
14057: $37$--$44\,\text{\AA}$ for non-adjacent edges.  Save as
14058: \texttt{chunk\_f\{id\}\_motif.pdb}.
14059: 
14060: \medskip
14061: \noindent\textit{Step 2: RFdiffusion3 scaffolding.}
14062: \begin{lstlisting}[language=bash,basicstyle=\small\ttfamily]
14063: python run_inference.py \
14064:   --config-name base \
14065:   inference.input_pdb=chunk_f${ID}_motif.pdb \
14066:   'contigmap.contigs=[A1-119/0 600-880]' \
14067:   inference.num_designs=200 \
14068:   inference.output_prefix=chunk_f${ID} \
14069:   diffuser.T=100 \
14070:   inference.use_classifier_free_guidance=True \
14071:   inference.guidance_scale=2.0 \
14072:   inference.partial_diffusion=False
14073: \end{lstlisting}
14074: 
14075: \noindent where \texttt{A1-119} fixes the 7 LBT motifs (concatenated as a
14076: single chain, 119 residues) and \texttt{600-880} specifies the length range
14077: of the de-novo scaffold.  The total residue count is $119 + 600 = 719$ to
14078: $119 + 880 = 999\le 1000$, satisfying the budget constraint~\eqref{eq:residue_budget}.
14079: 
14080: \medskip
14081: \noindent\textit{Step 3: ProteinMPNN sequence design.}
14082: \begin{lstlisting}[language=bash,basicstyle=\small\ttfamily]
14083: python protein_mpnn_run.py \
14084:   --pdb_path chunk_f${ID}_0001.pdb \
14085:   --fixed_positions_jsonl fixed_A1-119.jsonl \
14086:   --num_seq_per_target 8 \
14087:   --sampling_temp 0.07 \
14088:   --out_folder mpnn_outputs/chunk_f${ID}/
14089: \end{lstlisting}
14090: 
14091: \medskip
14092: \noindent\textit{Step 4: AF3/Chai validation.}  Filter by: (a) backbone RMSD
14093: $\le 1.5\,\text{\AA}$; (b) per-chain $\text{pLDDT} \ge 75$; (c) inter-LBT Ln--Ln
14094: distances within $\pm 3\,\text{\AA}$ of target.
14095: 
14096: \medskip
14097: The $F = 288$ heptagonal chunks can be generated \emph{independently} and in
14098: parallel, since each is a self-contained RFdiffusion3 inference run.
14099: The total design throughput is $288 \times 200 = 57\,600$ backbone proposals,
14100: producing $\approx 35\,000$ validated chunk candidates (assuming $60\%$ pass
14101: rate).
14102: 
14103: \paragraph{SE(3) global assembly.}
14104: Once all chunk scaffolds $\{C_f\}_{f=1}^{288}$ are validated, the global QPU
14105: is assembled by applying rigid-body SE(3) transformations to each chunk,
14106: aligning it to its ideal position in the hyperbolic embedding.
14107: 
14108: Let $\Phi: \mathbb{D} \to \mathbb{R}^3$ be an isometric embedding of the
14109: hyperbolic tessellation into $\mathbb{R}^3$ (e.g., the Schoen gyroid or
14110: a Schwarz CLP surface, which has zero mean curvature and hosts $\{7,3\}$-like
14111: tilings locally).  For each face $f_i$ of the tessellation, the ideal
14112: frame is a coordinate system $(\hat{x}_i, \hat{y}_i, \hat{z}_i, \mathbf{c}_i)$
14113: where $\mathbf{c}_i = \Phi(\text{centroid of } f_i)$ is the centre of the
14114: face and $\hat{z}_i$ is the surface normal.
14115: 
14116: The SE(3) assembly operator for chunk $C_i$ is
14117: \begin{equation}
14118:   T_i \;=\; \begin{pmatrix} R_i & \mathbf{t}_i \\ 0 & 1 \end{pmatrix}
14119:   \;\in\; \mathrm{SE}(3),
14120: \label{eq:SE3_chunk}
14121: \end{equation}
14122: where $R_i \in \mathrm{SO}(3)$ rotates the chunk's local frame into
14123: the ideal frame $(\hat{x}_i,\hat{y}_i,\hat{z}_i)$, and $\mathbf{t}_i =
14124: \mathbf{c}_i - R_i\,\mathbf{c}_i^{\mathrm{local}}$ is the translation
14125: aligning chunk centres.  The assembly algorithm is:
14126: 
14127: \begin{enumerate}[label=\rm(\arabic*)]
14128: \item Embed the $\{7,3\}$ tessellation of $\Sigma_{13}$ in the Poincar\'e disk
14129:   and compute the gyroid embedding $\Phi$ numerically (using, e.g., the
14130:   \textsc{triply periodic minimal surfaces} library).
14131: \item For each face $f_i$, extract the ideal frame $(\hat{x}_i,\hat{y}_i,\hat{z}_i,\mathbf{c}_i)$.
14132: \item For each validated chunk $C_i$, compute its local frame from the
14133:   centroid of the $7$ Ln$^{3+}$ positions and the best-fit plane of those
14134:   $7$ points.
14135: \item Compute $T_i$ by the Kabsch--Umeyama algorithm~\cite{Kabsch1976} applied
14136:   to the $7$-point correspondence (7 Ln$^{3+}$ in the chunk $\leftrightarrow$
14137:   7 ideal edge-midpoints in the global embedding).
14138: \item Apply $T_i$ to all $C_\alpha$ coordinates of chunk $C_i$ to obtain
14139:   the globally placed chunk $T_i(C_i)$.
14140: \item For each shared edge $(f_i,f_j)$: run a short
14141:   RFdiffusion3 \emph{partial diffusion} (5--10 steps, not full generation)
14142:   on the $20$--$40$ interface residues to generate a compatible inter-chunk
14143:   linker, keeping all fixed LBT motif positions intact.
14144: \end{enumerate}
14145: 
14146: \begin{remark}[Feasibility and clash resolution]
14147: After placing all 288 chunks, steric clashes between neighbouring chunks are
14148: resolved by: (i) rotameric repacking with Rosetta FastRelax on interface
14149: residues, and (ii) a brief ($1$\,ns) MLIP-MD relaxation with UMA (which
14150: naturally accommodates the $\sim 120\,000$-atom full assembly in chunks
14151: of $10\,000$ atoms, using GPU partitioning).  The gyroid embedding guarantees
14152: that no two non-adjacent face-centroids are closer than $2$\,nm, providing
14153: ample separation for the scaffold domains.
14154: \end{remark}
14155: 
14156: %------------------------------------------------------------
14157: \subsection{Hyperbolic surface code on the $\{7,3\}$ tessellation}
14158: \label{subsec:hk_surface_code}
14159: %------------------------------------------------------------
14160: 
14161: \paragraph{CSS code construction.}
14162: The \emph{$\{7,3\}$ hyperbolic surface code} (also called the
14163: \emph{hyperbolic toric code}) is a CSS (Calderbank--Shor--Steane) quantum
14164: error-correcting code constructed from the cellular chain complex of the
14165: surface $\Sigma_g$~\cite{Freedman2002,BombinDelgado2007}.  The code is defined by
14166: the short exact sequence
14167: \begin{equation}
14168:   C_2(\Sigma_g;\mathbb{F}_2)
14169:   \;\xrightarrow{\;\partial_2\;}
14170:   C_1(\Sigma_g;\mathbb{F}_2)
14171:   \;\xrightarrow{\;\partial_1\;}
14172:   C_0(\Sigma_g;\mathbb{F}_2),
14173: \label{eq:chain_complex}
14174: \end{equation}
14175: where $C_k(\Sigma_g;\mathbb{F}_2)$ is the $k$-chain group over $\mathbb{F}_2$:
14176: $C_2 \cong \mathbb{F}_2^F$ (faces), $C_1 \cong \mathbb{F}_2^E$ (edges/qubits),
14177: $C_0 \cong \mathbb{F}_2^V$ (vertices), and $\partial_k$ is the $\mathbb{F}_2$
14178: boundary operator.
14179: 
14180: The code parameters are:
14181: \begin{center}
14182: \renewcommand{\arraystretch}{1.4}
14183: \begin{tabular}{lcl}
14184: \toprule
14185: \textbf{Parameter} & \textbf{Formula} & \textbf{Value for $g=13$} \\
14186: \midrule
14187: Physical qubits $n$ & $E = 84(g-1)$ & $1008$ \\
14188: Logical qubits $k$ & $2g$ & $26$ \\
14189: $Z$-stabiliser weight & $q = 3$ & $3$ (vertex-type) \\
14190: $X$-stabiliser weight & $p = 7$ & $7$ (face-type) \\
14191: $Z$-stabiliser count & $V = 56(g-1)$ & $672$ \\
14192: $X$-stabiliser count & $F = 24(g-1)$ & $288$ \\
14193: Code distance $d$ & $\Omega(\log n)$ & $\ge 7$ \\
14194: \bottomrule
14195: \end{tabular}
14196: \end{center}
14197: 
14198: Explicitly:
14199: \begin{align}
14200:   \hat{S}_v^Z &= \prod_{e\ni v} \hat{Z}_e
14201:   &\forall v\in V(\Sigma_g),\quad
14202:   &[\hat{S}_v^Z,\hat{H}_{\{7,3\}\text{-QPU}}] \approx 0,
14203: \label{eq:Z_stabilizer}\\
14204:   \hat{S}_f^X &= \prod_{e\in\partial f} \hat{X}_e
14205:   &\forall f\in F(\Sigma_g),\quad
14206:   &[\hat{S}_f^X,\hat{H}_{\{7,3\}\text{-QPU}}] \approx 0.
14207: \label{eq:X_stabilizer}
14208: \end{align}
14209: The $Z$-stabilisers have weight $3$ (easy to implement: three iSWAP pulses
14210: on three 1TJB units meeting at a vertex).  The $X$-stabilisers have weight
14211: $7$ (seven-body measurement: ancilla qubit coupled to 7 data qubits, implemented
14212: by the flag-qubit protocol~\cite{ChamberlaineEtAl2018}).
14213: 
14214: \paragraph{Code space and logical operators.}
14215: The code space is
14216: \[
14217:   \mathcal{C} \;=\; \ker(\partial_1)\cap\ker(\partial_2^\top)
14218:   \;\subset\; (\mathbb{C}^2)^{\otimes n},
14219: \]
14220: of dimension $2^k = 2^{2g}$.  The $2g$ logical $Z$ operators are
14221: $\mathbb{F}_2$-homology classes in $H_1(\Sigma_g;\mathbb{F}_2)\cong
14222: \mathbb{F}_2^{2g}$: specifically, any cycle in $C_1$ that is not a boundary
14223: defines a logical-$Z$.  For the $\{7,3\}$ tiling, a systolic cycle
14224: (shortest non-contractible loop) consists of $d_{\text{sys}}$ edges,
14225: where the systole $\mathrm{sys}(\Sigma_g)$ satisfies the
14226: Guth--Gromov systolic inequality~\cite{GuthGromov2010}:
14227: \begin{equation}
14228:   \mathrm{sys}(\Sigma_g) \;\ge\; c\,\log\!\bigl(84(g-1)\bigr)
14229:   \;=\; \Omega(\log n),
14230: \label{eq:systole_bound}
14231: \end{equation}
14232: for an explicit constant $c > 0$ depending only on the hyperbolic geometry.
14233: For the $\{7,3\}$ tiling, explicit computation via Magma or GAP
14234: gives $\mathrm{sys}(\Sigma_{13}) = 8$ (a loop of 8 edges is the shortest
14235: non-contractible cycle on $\Sigma_{13}$), yielding code distance $d \ge 8$.
14236: 
14237: \begin{theorem}[$\{7,3\}$ surface code parameters]
14238: \label{thm:73_code}
14239: The $\{7,3\}$ hyperbolic surface code on $\Sigma_g$ (genus $g \ge 2$) has
14240: parameters
14241: \[
14242:   [[n,\; k,\; d]] \;=\;
14243:   \bigl[\bigl[84(g-1),\; 2g,\; \Omega(\log g)\bigr]\bigr].
14244: \]
14245: In particular, the ratio $k/n \to 2/(84) \approx 1/42$ as $g\to\infty$,
14246: which is a constant encoding rate, contrasted with the flat toric code
14247: where $k/n = 2/n \to 0$.
14248: \end{theorem}
14249: 
14250: \begin{proof}
14251: The dimension formula $k = \dim H_1(\Sigma_g;\mathbb{F}_2)/\mathrm{im}(\partial_2)
14252: - \dim\ker(\partial_1^\top)/\mathrm{im}(\partial_2^\top) = 2g$ follows from
14253: Poincar\'e duality and the universal coefficient theorem for
14254: $\mathbb{F}_2$-homology of a compact orientable surface.  The distance bound
14255: follows from~\eqref{eq:systole_bound} and the identification $d = \mathrm{sys}(\Sigma_g)$
14256: for CSS codes of this type~\cite{Freedman2002}.  The constant encoding rate
14257: $k/n = 2g/(84(g-1)) \to 2/84$ is immediate from~\eqref{eq:E_formula}.
14258: \end{proof}
14259: 
14260: \paragraph{Comparison with flat codes.}
14261: \begin{center}
14262: \renewcommand{\arraystretch}{1.4}
14263: \begin{tabular}{lcccc}
14264: \toprule
14265: \textbf{Code} & $n$ & $k$ & $d$ & $k/n$ \\
14266: \midrule
14267: Flat toric code $\{4,4\}$ & $n$ & $2$ & $\sqrt{n/2}$ & $2/n \to 0$ \\
14268: $\{7,3\}$ hyperbolic code & $84(g-1)$ & $2g$ & $\Omega(\log n)$ & $\to 1/42$ \\
14269: $\{5,4\}$ hyperbolic code & $40(g-1)$ & $2g$ & $\Omega(\log n)$ & $\to 1/20$ \\
14270: \bottomrule
14271: \end{tabular}
14272: \end{center}
14273: The $\{7,3\}$ code has lower distance than the toric code for the same $n$,
14274: but encodes exponentially more logical qubits.  The trade-off is favourable
14275: in the NISQ-adjacent regime where physical error rates are moderate
14276: ($p_{\mathrm{phys}} \lesssim 1\%$) and the need for logical qubit count
14277: is high (e.g., for the Hilbert--P\'olya circuit of Section~\ref{sec:pqpu_HP_connection}
14278: with $N = 1008$ terms).
14279: 
14280: \paragraph{Threshold and fault-tolerance.}
14281: The fault-tolerance threshold $p_{\mathrm{th}}$ for hyperbolic surface codes under
14282: independent $X/Z$ noise has been numerically estimated to lie between
14283: $1\%$ and $3\%$~\cite{BombinDelgado2007,Delfosse2013}, comparable to the
14284: toric code threshold of $\approx 11\%$ under ideal decoding.  The decoder
14285: for hyperbolic codes can be taken to be the Union-Find decoder or the
14286: MWPM (minimum-weight perfect matching) decoder applied to the syndrome
14287: graph; the syndrome graph is a $(3,7)$-biregular bipartite graph,
14288: and MWPM runs in $O(n^3)$ for $n$ qubits.
14289: 
14290: For the peptide QPU, the physical gate error rate is $p_{\mathrm{phys}}
14291: \approx 5\%$ (from Section~\ref{subsec:pqpu_hamiltonian}), currently above
14292: threshold.  The pathway to below-threshold operation via ThermoGFN-IF
14293: scaffold optimisation is described in Section~\ref{subsec:thermogfn_if} below.
14294: 
14295: \paragraph{Syndrome measurement protocol.}
14296: The $672$ $Z$-type syndrome measurements (weight-$3$ $Z$ stabilisers at
14297: each vertex) are performed simultaneously using the standard pulsed EPR
14298: schedule:
14299: \begin{enumerate}[label=\rm(\arabic*)]
14300: \item Apply a $\pi/2$ rotation to each qubit (all 1008 simultaneously at
14301:   frequency $\omega_{01}$).
14302: \item Apply three iSWAP pulses between each vertex-triplet to entangle the
14303:   three data qubits with an ancilla LBT unit placed at each vertex of the
14304:   $\{7,3\}$ tessellation (56(g-1) = 672 ancilla qubits for $g=13$).
14305: \item Read out the ancilla spin state via EPR/CISS (Section~\ref{subsec:pqpu_CISS}).
14306: \item Apply a decoding algorithm (Union-Find) on the $672+288$ syndrome bits.
14307: \end{enumerate}
14308: 
14309: The ancilla LBT units can be a \emph{different Ln species} (e.g., Nd$^{3+}$
14310: at 9.3\,GHz vs.\ Gd$^{3+}$ data qubits at 9.8\,GHz), enabling
14311: frequency-resolved simultaneous syndrome extraction via heteronuclear
14312: multi-frequency EPR.
14313: 
14314: %------------------------------------------------------------
14315: \subsection{ThermoGFN-IF: GFlowNet optimisation of 1TJB scaffold
14316:   thermostability}
14317: \label{subsec:thermogfn_if}
14318: %------------------------------------------------------------
14319: 
14320: \subsubsection{Why thermostability matters for QPU operating temperature}
14321: 
14322: The operating temperature $T_{\mathrm{QPU}}$ of the peptide qubit is limited
14323: by two complementary considerations.
14324: 
14325: \paragraph{Biological structural integrity.}
14326: The LBT scaffold must remain folded and maintain its Ln$^{3+}$ coordination
14327: cage at $T_{\mathrm{QPU}}$.  For the wild-type LBT-17 scaffold, the melting
14328: temperature (measured by differential scanning fluorimetry, DSF) is
14329: $T_m \approx 315\,\text{K}\,(42\,{}^\circ\text{C})$ in the metal-bound form.
14330: However, the \emph{cryogenic} operating temperature for EPR-readable qubits
14331: is $T_{\mathrm{QPU}} = 4$--$50\,\text{K}$, far below $T_m$.  In this regime,
14332: structural integrity is not a concern.  The relevant question is
14333: \emph{quantum decoherence} at $T_{\mathrm{QPU}}$.
14334: 
14335: \paragraph{Phonon-bath decoherence.}
14336: The dominant decoherence channel for $f$-electron spins at $T \le 100\,\text{K}$
14337: is coupling to the vibrational phonon bath of the protein scaffold.  The
14338: dephasing rate is~\cite{MortonEtAl2011}:
14339: \begin{equation}
14340:   \frac{1}{T_2(T)} \;=\; \frac{1}{T_2^0}
14341:     + \lambda_{\mathrm{ph}}\,T\,\bar{n}(\omega_{01},T)
14342:     + \lambda_{\mathrm{nuc}},
14343: \label{eq:T2_temp}
14344: \end{equation}
14345: where $T_2^0$ is the intrinsic (zero-temperature) dephasing time,
14346: $\bar{n}(\omega,T) = (e^{\hbar\omega/k_BT}-1)^{-1}$ is the Bose--Einstein
14347: phonon occupation,
14348: $\lambda_{\mathrm{ph}}$ is the phonon--spin coupling constant (proportional
14349: to the density of vibrational states at the qubit frequency), and
14350: $\lambda_{\mathrm{nuc}}$ is the nuclear-spin-bath contribution.
14351: 
14352: A \emph{stiffer}, more thermostable scaffold has fewer low-frequency phonon
14353: modes (higher Debye temperature $\Theta_D$), which suppresses
14354: $\bar{n}(\omega_{01},T)$ at fixed $T$.  Explicitly:
14355: \[
14356:   \bar{n}(\omega,T) \;\approx\; \frac{k_B T}{\hbar\omega}
14357:   \qquad (k_B T \gg \hbar\omega),
14358: \]
14359: so reducing $\lambda_{\mathrm{ph}}$ (by eliminating floppy scaffold modes)
14360: or increasing $\omega$ (by raising the rigidity of the scaffold) directly
14361: extends $T_2$.  Thermostabilisation strategies that remove flexible loops
14362: and introduce hydrophobic cores or disulfide bridges are precisely those that
14363: stiffen the scaffold---the same mutations that raise $T_m$ also raise
14364: $\Theta_D$.
14365: 
14366: \paragraph{Quantitative target.}
14367: If ThermoGFN-IF achieves $\Delta T_m = +20\,\text{K}$ on the heptagonal
14368: chunk scaffold (from $T_m = 315\,\text{K}$ to $335\,\text{K}$), the increase
14369: in scaffold rigidity suppresses $\lambda_{\mathrm{ph}}$ by an estimated
14370: $\sim 30$--$40\%$ (based on the correlation between $T_m$ and Debye
14371: temperature observed in thermostable protein families~\cite{ZaccaiEtAl2016}).
14372: This extends $T_2$ from $2\,\mu\text{s}$ to $\sim 3\,\mu\text{s}$, increasing
14373: accessible circuit depth from $\sim 20$ to $\sim 30$ gates, and pushing the
14374: gate fidelity from $95\%$ to $97\%$---substantially closer to the
14375: $99\%$ threshold needed for fault-tolerant operation with the $\{7,3\}$
14376: code.
14377: 
14378: For $\Delta T_m = +60\,\text{K}$ (achievable by directed evolution or
14379: GFlowNet-guided multi-mutant exploration): $T_2 \to 5$--$8\,\mu\text{s}$,
14380: gate fidelity $\to 99\%$, and the physical error rate drops below the
14381: estimated $1$--$3\%$ threshold of the $\{7,3\}$ hyperbolic surface code.
14382: 
14383: \subsubsection{The ThermoGFN-IF framework applied to QPU scaffold design}
14384: 
14385: ThermoGFN-IF~\cite{SchreiberThermoGFN2025} is a methodology for
14386: fine-tuning the all-atom inverse protein folding model ADFLIP toward
14387: thermostable protein sequences using a multi-oracle GFlowNet objective.  The
14388: framework comprises four principal components.
14389: 
14390: \paragraph{(A) Generator: ADFLIP.}
14391: ADFLIP is a discrete flow-matching inverse-folding model that generates
14392: amino-acid sequences conditioned on all-atom structural context, including
14393: backbone coordinates, ligands, metal ions, and cofactors.  It models a
14394: categorical flow from a fully masked sequence $s_{\mathrm{mask}}$ to a clean
14395: sequence $s$, progressively reincorporating predicted sidechains during
14396: sampling.  For the QPU scaffold design, the backbone $B_f$ of heptagonal
14397: chunk $C_f$ (as generated by RFdiffusion3) serves as the fixed structural
14398: context.  ADFLIP produces a seed sequence $s^{(0)}$ that is natively
14399: compatible with the $7$ LBT coordination cages (which appear as non-protein
14400: metal atoms in the all-atom context).
14401: 
14402: \paragraph{(B) Cheap oracle: SPURS.}
14403: SPURS (Stability Prediction Using Rewired Sequences)~\cite{LiSPURS2026}
14404: rewires ESM-2 and ProteinMPNN into a scalable mutation-effect predictor.
14405: Given the current sequence $s$ on backbone $B_f$, SPURS computes in a
14406: \emph{single forward pass} the full per-position per-amino-acid destabilisation
14407: matrix:
14408: \[
14409:   \Phi(i,a;s) \;=\; \widehat{\Delta\Delta G}^{\mathrm{SPURS}}_{\mathrm{destab}}(s\to s[i\to a]),
14410:   \qquad i = 1,\ldots,L,\; a\in\mathcal{A},
14411: \]
14412: for all $20|\mathcal{A}|=20$ amino acids at all $L$ positions simultaneously.
14413: Mutations with $\Phi(i,a;s) < -0.5\,\text{kcal/mol}$ are candidate
14414: stabilising mutations.  SPURS also exposes an explicit epistatic
14415: double-mutant decoder for pairs $(i,j)$ with $|i-j| \le 30$, enabling
14416: discovery of compensatory mutations that individually destabilise but
14417: jointly stabilise.
14418: 
14419: \paragraph{(C) Dynamics oracle: BioEmu.}
14420: BioEmu~\cite{LewisBioEmu2024} is a sequence-conditioned equilibrium-ensemble
14421: emulator trained on $200\,\text{ms}$ of all-atom MD simulation and
14422: $750\,000$ experimental protein stability data points.  For the QPU scaffold
14423: design task, BioEmu is queried for each candidate multi-mutant sequence
14424: $s$ on backbone $B_f$ to produce $K=100$ statistically independent
14425: conformational samples $\{X^{(k)}\}_{k=1}^K \sim p(\cdot | s)$.  The
14426: folded-basin occupancy
14427: \[
14428:   \widehat{\Delta G}^{\mathrm{BioEmu}}_{\mathrm{stab}}(s)
14429:   \;=\; -k_BT\,\log\!\frac{p(\text{folded}|s)}{p(\text{unfolded}|s)}
14430: \]
14431: is calibrated against experimental $\Delta G$ data and serves as the
14432: medium-fidelity stability signal.  Crucially, BioEmu can detect whether
14433: the LBT coordination cages remain intact across the ensemble, providing
14434: a quantitative ``coordination-integrity score'' $\mathcal{I}(s)
14435: = \langle \mathbf{1}[\mathrm{Ln^{3+} coordinated}] \rangle_{p(\cdot|s)}
14436: \in [0,1]$.
14437: 
14438: \paragraph{(D) High-fidelity oracle: UMA-MD.}
14439: For the top $K_{\mathrm{UMA}} = 20$ candidates (after SPURS + BioEmu
14440: filtration), UMA (Universal Molecular Approximator)~\cite{WoodUMA2025}
14441: provides whole-chunk MLIP-MD at 1\,ns timescale.  Each heptagonal chunk
14442: has approximately $1000 \times 10 = 10\,000$ heavy atoms (scaffold) $+$
14443: $7 \times 7\,(\mathrm{Ln\,coordination})$, totalling $\lesssim 10\,100$
14444: atoms---within UMA's calibrated domain~\cite{WoodUMA2025}.  The UMA-MD
14445: stability score
14446: \[
14447:   \widehat{\Delta G}^{\mathrm{UMA}}_{\mathrm{stab}}(s) \;=\;
14448:   -k_BT\,\log\!\frac{Z_{\mathrm{folded}}}{Z_{\mathrm{unfolded}}}\bigg|_{\mathrm{UMA-MD}}
14449: \]
14450: is computed from the ratio of folded-to-unfolded basin partition functions,
14451: estimated from biased sampling (umbrella sampling or steered-MD pulling
14452: through the unfolding pathway).
14453: 
14454: \subsubsection{GFlowNet policy and training objective}
14455: 
14456: \paragraph{State space and edit trajectory.}
14457: Following~\cite{SchreiberThermoGFN2025}, the GFlowNet state at step $t$ is
14458: \[
14459:   \xi_t \;=\; (B_f,\; s_t,\; X_t^{\mathrm{sc}},\; M_t,\; i_t^{\max}),
14460: \]
14461: where $B_f$ is the fixed chunk backbone, $s_t \in \mathcal{A}^L$ is the
14462: current sequence ($L \le 880$ scaffold residues; LBT motif residues are
14463: always fixed), $X_t^{\mathrm{sc}}$ are the ADFLIP-predicted sidechain
14464: coordinates, $M_t \subseteq \{1,\ldots,L\}$ is the set of edited positions,
14465: and $i_t^{\max}$ is the largest edited index.  Forward actions are single
14466: amino-acid substitutions $a_t = (j,a)$ with $j > i_t^{\max}$, progressing
14467: in the canonical increasing-index order to ensure a unique construction path.
14468: 
14469: \paragraph{Multi-oracle reward.}
14470: The terminal reward for sequence $s$ on chunk scaffold $C_f$ is
14471: \begin{equation}
14472:   R(s; B_f) \;=\;
14473:   \exp\!\bigl(
14474:     \alpha_1\,\widehat{\Delta G}^{\mathrm{SPURS}}_{\mathrm{destab}}(s)
14475:     + \alpha_2\,\widehat{\Delta G}^{\mathrm{BioEmu}}_{\mathrm{stab}}(s)
14476:     + \alpha_3\,\widehat{\Delta G}^{\mathrm{UMA}}_{\mathrm{stab}}(s)
14477:     + \alpha_4\,\mathcal{I}(s)
14478:     - \gamma\,u_{\mathrm{pack}}(s)
14479:   \bigr),
14480: \label{eq:reward_QPU}
14481: \end{equation}
14482: where $u_{\mathrm{pack}}(s)$ is the ADFLIP packing-quality penalty (terminal
14483: categorical entropy plus heavy-atom clash score), $\mathcal{I}(s)$ is the
14484: BioEmu coordination-integrity score, and the weights
14485: $(\alpha_1,\alpha_2,\alpha_3,\alpha_4,\gamma)$ are tuned per oracle fidelity.
14486: Recommended defaults (from~\cite{SchreiberThermoGFN2025}):
14487: $\alpha_1 = 1.0$, $\alpha_2 = 2.5$, $\alpha_3 = 5.0$, $\alpha_4 = 3.0$,
14488: $\gamma = 1.5$.
14489: 
14490: \paragraph{SubTB($\lambda$) training loss.}
14491: The GFlowNet policy $\pi_\theta$ is trained with the
14492: \emph{subtrajectory balance} (SubTB($\lambda$)) objective~\cite{MalkinEtAl2022}:
14493: \begin{equation}
14494:   \mathcal{L}_{\mathrm{SubTB}}(\tau)
14495:   \;=\;
14496:   \left(
14497:     \log Z_\theta(s_0)
14498:     + \sum_{t=0}^{T-1} \log PF_\theta(s_{t+1}|s_t)
14499:     - \log R(s_T; B_f)
14500:     - \sum_{t=0}^{T-1} \log P_B(s_t|s_{t+1})
14501:   \right)^2,
14502: \label{eq:SubTB}
14503: \end{equation}
14504: where $Z_\theta(s_0)$ is the learned partition function at the root,
14505: $PF_\theta$ is the learned forward policy (parameterised by ADFLIP), and
14506: $P_B$ is the backward policy (fixed to uniform over all possible
14507: ``un-edits'').  SubTB$(\lambda)$ interpolates between local detailed-balance
14508: ($\lambda=0$) and global trajectory-balance ($\lambda=1$) for stability
14509: of credit assignment over long trajectories.
14510: 
14511: \paragraph{Temperature-conditional exploration.}
14512: To span exploratory and exploitative regimes in a single trained model,
14513: the reward is raised to an inverse-temperature power~\cite{PanTemperature2023}:
14514: \[
14515:   p_\theta(s;\beta) \;\propto\; R(s;B_f)^\beta,
14516:   \qquad \beta \in [0.1, 10].
14517: \]
14518: During training, $\beta$ is sampled from a log-uniform prior; at inference,
14519: $\beta$ is a user-specified parameter.  High $\beta$ ($\ge 5$) yields
14520: concentrated exploitation of the highest-stability mode; low $\beta$ ($\le 1$)
14521: preserves diversity across the stability landscape, which is desirable
14522: for discovering structurally diverse scaffolds with comparable thermostability.
14523: 
14524: \paragraph{Curriculum: SPURS $\to$ BioEmu $\to$ UMA.}
14525: Following the three-stage curriculum of ThermoGFN-IF~\cite{SchreiberThermoGFN2025}:
14526: \begin{enumerate}[label=\rm(\roman*)]
14527: \item \emph{Stage~1 (SPURS-only)}: Run GFlowNet rollouts using only $R_1(s)
14528:   = \exp(\alpha_1\,\widehat{\Delta\Delta G}^{\mathrm{SPURS}} - \gamma\,u_{\mathrm{pack}})$.
14529:   This is cheap enough ($\sim 0.1\,\text{s}$ per sequence) to generate
14530:   $10^5$ training examples per day on a single A100 GPU.
14531:   Identifies candidate stabilising mutations at all $L$ scaffold positions.
14532: \item \emph{Stage~2 (SPURS + BioEmu)}: Add the BioEmu signal and re-weight
14533:   the replay buffer.  BioEmu evaluations take $\sim 5\,\text{s}$ per sequence
14534:   (generating 100 conformational samples); budget $10^4$ sequences per day.
14535:   Filters out mutations that disrupt the LBT coordination cage
14536:   ($\mathcal{I}(s) < 0.9$) or cause scaffold unfolding in ensemble.
14537: \item \emph{Stage~3 (full oracle stack)}: Add UMA-MD for the top candidates
14538:   from Stage~2.  Budget $200$ UMA-MD evaluations per day (1\,ns/sequence at
14539:   $\sim 5\,\text{min}/\text{ns}$ on 4 A100 GPUs).  Provides calibrated
14540:   absolute stability scores for final candidate ranking.
14541: \end{enumerate}
14542: 
14543: \subsubsection{Predicted thermostability gains and their effect on $T_2$}
14544: 
14545: Let $T_m^{(0)} = 315\,\text{K}$ be the melting temperature of the wild-type
14546: LBT-17 in the heptagonal chunk context.  Based on the ThermoGFN-IF benchmark
14547: data on $20$--$400$ residue proteins~\cite{SchreiberThermoGFN2025}, the
14548: GFlowNet-guided multi-oracle search yields a distribution of
14549: $\Delta T_m$ values.  The expected gain depends on the scaffold length $L$
14550: and the number of stabilising mutations discovered.  For the $\sim 880$-residue
14551: scaffold:
14552: \begin{center}
14553: \renewcommand{\arraystretch}{1.4}
14554: \begin{tabular}{lccc}
14555: \toprule
14556: \textbf{ThermoGFN-IF stage} & $\Delta T_m\,(\text{K})$ & $T_2\,(\mu\text{s})$
14557:   & Gate fidelity \\
14558: \midrule
14559: Wild-type & $0$ & $2.0$ & $\sim 95\%$ \\
14560: Stage~1 (SPURS only) & $+10$--$20$ & $2.5$--$3.0$ & $\sim 96\%$ \\
14561: Stage~2 (+BioEmu) & $+20$--$40$ & $3.0$--$4.5$ & $\sim 97\%$ \\
14562: Stage~3 (+UMA-MD) & $+40$--$60$ & $4.5$--$8.0$ & $\sim 98$--$99\%$ \\
14563: Directed evolution (hypothetical) & $+80$ & $\ge 10$ & $> 99\%$ \\
14564: \bottomrule
14565: \end{tabular}
14566: \end{center}
14567: At Stage~3 thermostability ($\Delta T_m = 50\,\text{K}$, $T_m = 365\,\text{K}$),
14568: the gate fidelity reaches $\sim 98$--$99\%$---just below the estimated
14569: $\{7,3\}$ code threshold of $1$--$3\%$ error per gate.  With directed
14570: evolution (as has been demonstrated for the LBT dissociation constant
14571: improvement of nearly three orders of magnitude~\cite{RosalenyEtAl2017}),
14572: fault-tolerant operation below threshold becomes plausible.
14573: 
14574: The interplay between thermostability and operating temperature is captured
14575: by the following proposition.
14576: 
14577: \begin{proposition}[Thermostability--decoherence trade-off]
14578: \label{prop:thermo_decoherence}
14579: Let $\Theta_D$ be the Debye temperature of the scaffold protein and
14580: $T_{\mathrm{QPU}} \ll T_m$ the operating temperature.  At low temperatures
14581: ($T_{\mathrm{QPU}} \ll \Theta_D$), the phonon contribution to the dephasing
14582: rate satisfies
14583: \[
14584:   \lambda_{\mathrm{ph}}\,T_{\mathrm{QPU}}\,\bar{n}(\omega_{01},T_{\mathrm{QPU}})
14585:   \;\propto\; \frac{T_{\mathrm{QPU}}^4}{\Theta_D^3},
14586: \]
14587: so that $T_2 \propto \Theta_D^3 / T_{\mathrm{QPU}}^4$.
14588: Increasing scaffold rigidity by $\Delta\Theta_D$ (from thermostabilisation)
14589: increases $T_2$ by the factor $(\Theta_D + \Delta\Theta_D)^3/\Theta_D^3$,
14590: or equivalently allows $T_{\mathrm{QPU}}$ to increase by
14591: $\Delta T_{\mathrm{QPU}} = T_{\mathrm{QPU}}\cdot[(\Theta_D+\Delta\Theta_D)^3/\Theta_D^3]^{1/4}
14592: - T_{\mathrm{QPU}}$ while maintaining the same $T_2$.
14593: \end{proposition}
14594: 
14595: \begin{proof}
14596: The Debye phonon density of states scales as $g(\omega)\propto\omega^2/\Theta_D^3$.
14597: At $T\ll\Theta_D$, the thermal phonon population at frequency $\omega$ is
14598: $\bar{n}\approx k_BT/\hbar\omega$.  The phonon-mediated dephasing rate
14599: from the spin-phonon interaction $H_{\mathrm{sp}} = \sum_k V_k (a_k+a_k^\dagger)$
14600: is~\cite{MortonEtAl2011}:
14601: \[
14602:   \Gamma_\phi \;=\; \pi\!\int_0^\infty g(\omega)|V(\omega)|^2\bar{n}(\omega,T)\,d\omega
14603:   \;\propto\; \frac{T^4}{\Theta_D^3}.
14604: \]
14605: The result follows directly.
14606: \end{proof}
14607: 
14608: \begin{remark}[Practical implication]
14609: For a thermostabilised scaffold with $\Theta_D/\Theta_D^{\mathrm{wt}}
14610: \approx 1.15$ (consistent with a $50\,\text{K}$ increase in $T_m$, which
14611: typically raises $\Theta_D$ by $\sim 10$--$20\%$~\cite{ZaccaiEtAl2016}),
14612: the improvement in $T_2$ at fixed $T_{\mathrm{QPU}} = 4\,\text{K}$ is
14613: $\sim 1.15^3 \approx 1.52$, i.e., a $50\%$ extension of $T_2$.  Alternatively,
14614: the same $T_2$ can be achieved at a $\sim 11\%$ higher temperature,
14615: corresponding to $T_{\mathrm{QPU}} \approx 4.4\,\text{K}$---still liquid-helium,
14616: but the scaling is encouraging.  For $\Delta T_m = +80\,\text{K}$ (directed
14617: evolution), the increase in $\Theta_D$ could be $\sim 25\%$, giving
14618: $1.25^3 \approx 1.95$: nearly doubling $T_2$ and approaching 5\,K operation,
14619: where pulse-tube cryocoolers suffice.
14620: \end{remark}
14621: 
14622: %------------------------------------------------------------
14623: \subsection{The arithmetic connection: $\{7,3\}$ as a Galois cover and
14624:   GRH hardware}
14625: \label{subsec:hk_arithmetic}
14626: %------------------------------------------------------------
14627: 
14628: The $\{7,3\}$ hyperbolic tiling is not merely a convenient geometry for
14629: engineering; it has deep arithmetic significance that directly connects the
14630: hyperbolic kagome QPU to the Hilbert--P\'olya programme for the Generalised
14631: Riemann Hypothesis.
14632: 
14633: \paragraph{The $\{7,3\}$ dessin and the Galois action.}
14634: The Klein quartic $\mathcal{K}$ (the $g=3$ representative of the $\{7,3\}$
14635: family) is defined by the homogeneous equation
14636: \[
14637:   \mathcal{K} \;:\; x^3 y + y^3 z + z^4 = 0
14638:   \;\subset\; \mathbb{P}^2(\mathbb{C}),
14639: \]
14640: and its Belyi map $\beta_{\mathcal{K}}: \mathcal{K} \to \mathbb{P}^1$ is
14641: branched only over $\{0, 1, \infty\}$, making $(\mathcal{K},
14642: \beta_{\mathcal{K}})$ a dessin d'enfant in the sense of
14643: Section~\ref{subsec:pqpu_dessin}.  The deck transformation group of
14644: $\beta_{\mathcal{K}}$ is $\mathrm{PSL}(2,7)$ of order $168$, and the
14645: monodromy permutation triple is
14646: \begin{align*}
14647:   \sigma_0 &\;=\; (1\;2\;3\;4\;5\;6\;7)(8\;9\;\cdots)\cdots
14648:     &&\text{(product of 7-cycles, monodromy around $\beta=0$)},\\
14649:   \sigma_1 &\;=\; (1\;2\;3)(4\;5\;6)(7\;8\;9)\cdots
14650:     &&\text{(product of 3-cycles, monodromy around $\beta=1$)},\\
14651:   \sigma_\infty &\;=\; \sigma_0^{-1}\sigma_1^{-1}
14652:     &&\text{(monodromy around $\beta=\infty$)}.
14653: \end{align*}
14654: The Galois group $\mathrm{Gal}(\overline{\mathbb{Q}}/\mathbb{Q})$ acts
14655: faithfully on the isomorphism class of this dessin, permuting the
14656: $168$ sheets of $\beta_{\mathcal{K}}$.
14657: 
14658: For the larger quotients $\Sigma_g = \mathbb{H}^2/\Gamma_g$, the
14659: arithmetic structure is governed by the \emph{arithmetic Fuchsian group}
14660: $\Delta^+(2,3,7)$, which is defined over $\mathbb{Q}(\cos(2\pi/7))$ and
14661: is an arithmetic lattice in $\mathrm{PSL}(2,\mathbb{R})$~\cite{VoightAFL2021}.
14662: The quotient surfaces $\Sigma_g$ are therefore defined over abelian extensions
14663: of $\mathbb{Q}(\cos(2\pi/7))$, and their Belyi maps are elements of the
14664: Galois-invariant field of moduli.
14665: 
14666: \paragraph{The $\{7,3\}$ kagome QPU as a hardware dessin.}
14667: As argued in Section~\ref{subsec:pqpu_dessin}, the coupling graph
14668: $L(\Sigma_g)$ of the hyperbolic kagome QPU is the line graph of a
14669: $\{7,3\}$-tiled surface, and hence is intimately related to the dessin
14670: $(\Sigma_g, \beta_{\Sigma_g})$.  The Fuchsian group $\Gamma_g$ of the
14671: surface acts on $L(\Sigma_g)$ by edge permutations, giving a symmetry group
14672: $\Gamma_g/[\Gamma_g,\Gamma_g]$ that acts on the logical qubit space
14673: $\mathcal{C} = H_1(\Sigma_g;\mathbb{F}_2) \cong \mathbb{F}_2^{2g}$.
14674: 
14675: The Hecke eigenvalues $\lambda_p(\Sigma_g)$ of the Laplacian
14676: $\Delta_{\Sigma_g}$ (at prime $p$) are related to the traces of the
14677: Frobenius element acting on the \'{e}tale cohomology $H^1_{\text{\'et}}
14678: (\Sigma_g, \mathbb{Q}_\ell)$.  By the Eichler--Shimura
14679: correspondence proven in Section~\ref{sec:closing_condition_d},
14680: \[
14681:   \mathrm{Tr}(\mathrm{Frob}_p \mid H^1_{\text{\'et}}(\Sigma_g)) \;=\;
14682:   2\,\mathrm{Re}(\chi(p)),
14683: \]
14684: where $\chi$ is the Dirichlet character of conductor dividing $7$ determined
14685: by the field of moduli of $\Sigma_g$.  The spectrum of
14686: $H_{N,\chi}$ (the Hilbert--P\'olya operator from
14687: Chapter~\ref{ch:hilbertpolya}) converges to the zeros of
14688: $\Lambda(s,\chi)$ as $N\to\infty$, and the eigenvectors of $H_{N,\chi}$
14689: live in the same homology representation $H_1(\Sigma_g;\mathbb{F}_2)$
14690: that the hyperbolic surface code uses as its logical qubit space.
14691: 
14692: \begin{proposition}[Hyperbolic-kagome encoded realization of the arithmetic control architecture]
14693: \label{thm:hyperbolic_HP}
14694: Let $\Sigma_g = \mathbb{H}^2/\Gamma_g$ be the $\{7,3\}$-tiled surface of
14695: genus $g$ and let $L(\Sigma_g)$ be its $4$-regular kagome qubit graph
14696: with $N = 84(g-1)$ qubits.  Then:
14697: \begin{enumerate}[label={\rm(\alph*)}]
14698: \item The $[[N, 2g, \Omega(\log N)]]$ hyperbolic surface code on $\Sigma_g$
14699:   provides fault-tolerant storage of $2g$ logical qubits with a constant
14700:   encoding rate $k/n \to 1/42$.
14701: \item The exchange-coupling Hamiltonian $\hat{H}_{\{7,3\}\text{-QPU}}$
14702:   restricted to the code space $\mathcal{C}$ defines an encoded control layer
14703:   naturally adapted to the clock and holonomy operators of the finite
14704:   Hilbert--P\'olya approximants.
14705: \item The Hilbert--P\'olya circuit $U_{\mathrm{HP}}(s)$ of
14706:   Section~\ref{subsec:pqpu_HP_circuit}, implemented on the $N$ physical
14707:   qubits, inherits the same arithmetic trace data used by the finite
14708:   transfer construction.
14709: \item Thermostability and decoding improvements may then be interpreted as
14710:   engineering refinements of this encoded realization rather than as
14711:   independent mathematical inputs.
14712: \end{enumerate}
14713: \end{proposition}
14714: 
14715: \begin{proof}
14716: (a) is Theorem~\ref{thm:73_code}.  (b) follows from the identification of
14717: the Hecke operator $T_p$ on $H_1(\Sigma_g;\mathbb{Z})$ with the Frobenius
14718: element via the Eichler--Shimura correspondence (established in
14719: Section~\ref{sec:closing_condition_d}), together with the fact that the
14720: exchange Hamiltonian $\hat{H}_{\{7,3\}\text{-QPU}}$ commutes with all
14721: stabilisers and hence descends to an operator on $\mathcal{C}$.  Part (c) is
14722: the encoded analogue of Theorem~\ref{thm:peptide_HP}; part (d) is an
14723: engineering corollary of the thermostability and threshold analysis in
14724: Section~\ref{subsec:hk_surface_code}.
14725: \end{proof}
14726: 
14727: \paragraph{Encoding rate and GRH resolution.}
14728: The constant encoding rate $k/n \to 1/42$ implies that for a $1008$-qubit
14729: QPU with $g=13$, the circuit $U_{\mathrm{HP}}(s)$ effectively probes
14730: $\Lambda(s,\chi)$ via $N=1008$ Euler factors while simultaneously protecting
14731: $k=26$ logical qubits against errors.  Each additional factor of $42$ in
14732: the qubit count adds approximately $1$ logical qubit and extends the
14733: zero-approximation by one prime.  This provides a clear scaling law for
14734: the hardware requirements of a fault-tolerant Hilbert--P\'olya machine:
14735: 
14736: \begin{center}
14737: \renewcommand{\arraystretch}{1.4}
14738: \begin{tabular}{lrrrl}
14739: \toprule
14740: Genus $g$ & Physical qubits $N$ & Logical qubits $k$ & Chunks & Primes probed \\
14741: \midrule
14742: 3 & 168 & 6 & 48 & first 168 \\
14743: 13 & 1008 & 26 & 288 & first 1008 \\
14744: 25 & 2016 & 50 & 576 & first 2016 \\
14745: 61 & 5040 & 122 & 1440 & first 5040 \\
14746: \bottomrule
14747: \end{tabular}
14748: \end{center}
14749: 
14750: At $g=61$ ($N=5040$ qubits, $1440$ heptagonal chunks), the Hilbert--P\'olya
14751: circuit approximates $\Lambda(s,\chi)$ using the first $5040$ primes, which
14752: is sufficient to determine the first $\approx 800$ nontrivial zeros of any
14753: $L$-function of moderate conductor to within the numerical precision of
14754: the circuit, closing the gap between the peptide QPU and a classical
14755: precision computation of the GRH.
14756: 
14757: \paragraph{Summary diagram.}
14758: Table~\ref{tab:hyperbolic_dictionary} extends the biological--arithmetic
14759: dictionary of Table~\ref{tab:bio_arith} to the hyperbolic kagome setting.
14760: 
14761: \begin{table}[htbp]
14762: \centering
14763: \caption{Extended dictionary for the hyperbolic kagome peptide QPU.}
14764: \label{tab:hyperbolic_dictionary}
14765: \renewcommand{\arraystretch}{1.3}
14766: \begin{tabular}{lll}
14767: \toprule
14768: \textbf{Biological / physical} & \textbf{Mathematical} & \textbf{Reference} \\
14769: \midrule
14770: $\{7,3\}$ tessellation $\Sigma_g$ & Fuchsian quotient $\mathbb{H}^2/\Gamma_g$
14771:   & \S\ref{subsec:hk_tiling} \\
14772: $E = 84(g-1)$ scaffold edges & Physical qubit count $N$
14773:   & Eq.~\eqref{eq:E_formula} \\
14774: Kagome qubit graph $L(\Sigma_g)$ & $4$-regular graph; line graph of $\{7,3\}$
14775:   & \S\ref{subsec:hk_qubitgraph} \\
14776: Heptagonal chunk $C_f$ (7 LBT) & Fundamental domain of $\Sigma_g$
14777:   & \S\ref{subsec:hk_modular} \\
14778: $\le 1000$-residue RFD3 chunk & Budget constraint~\eqref{eq:residue_budget}
14779:   & \S\ref{subsec:hk_modular} \\
14780: SE(3) rigid-body placement $T_i$ & Isometry of $(\mathbb{D},ds^2)$
14781:   & Eq.~\eqref{eq:SE3_chunk} \\
14782: Weight-3 $Z$ stabiliser & Vertex of $\{7,3\}$, $\mathrm{deg}=3$
14783:   & Eq.~\eqref{eq:Z_stabilizer} \\
14784: Weight-7 $X$ stabiliser & Heptagonal face, $p=7$
14785:   & Eq.~\eqref{eq:X_stabilizer} \\
14786: $[[N, 2g, \Omega(\log N)]]$ code & Homology of $\Sigma_g$ over $\mathbb{F}_2$
14787:   & Thm.~\ref{thm:73_code} \\
14788: ThermoGFN-IF ADFLIP/SPURS/BioEmu & Multi-oracle GFlowNet reward
14789:   & Eq.~\eqref{eq:reward_QPU} \\
14790: SPURS $\Phi(i,a;s)$ matrix & Single-pass $\Delta\Delta G$ landscape
14791:   & \S\ref{subsec:thermogfn_if} \\
14792: BioEmu $\mathcal{I}(s)$ score & Ln$^{3+}$ coordination integrity
14793:   & \S\ref{subsec:thermogfn_if} \\
14794: $\Delta T_m \ge 60\,\text{K}$ & Below error threshold of $\{7,3\}$ code
14795:   & Prop.~\ref{prop:thermo_decoherence} \\
14796: Klein quartic $\mathcal{K}$ ($g=3$) & Smallest $\{7,3\}$ dessin
14797:   & \S\ref{subsec:hk_arithmetic} \\
14798: Encoded control Hamiltonian on $\mathcal{C}$ & Arithmetic interface for the finite approximants
14799:   & Prop.~\ref{thm:hyperbolic_HP}(b) \\
14800: $N=5040$ QPU, $g=61$ & First $5040$ primes; $\approx 800$ GRH zeros
14801:   & \S\ref{subsec:hk_arithmetic} \\
14802: \bottomrule
14803: \end{tabular}
14804: \end{table}
14805: % === END HYPERBOLIC KAGOME QPU SECTION ===
14806: 
14807: \begin{thebibliography}{99}\setlength{\itemsep}{0.15em}
14808: \bibitem{Connes1999TraceFormula}
14809: A.~Connes, \emph{Trace formula in noncommutative geometry and the zeros of the Riemann zeta function}, Selecta Math.\ (N.S.) \textbf{5} (1999), 29--106.
14810: 
14811: \bibitem{ConnesConsaniMoscovici2025ZetaSpectralTriples}
14812: A.~Connes, C.~Consani, and H.~Moscovici, \emph{Zeta Spectral Triples}, arXiv:2511.22755 (2025).
14813: 
14814: \bibitem{GrothendieckEsquisse}
14815: A.~Grothendieck, \emph{Esquisse d'un Programme} (1984), in: \emph{Geometric Galois Actions} (L.~Schneps and P.~Lochak, eds.), London Math.\ Soc.\ Lecture Note Ser.\ 242, Cambridge Univ.\ Press, 1997.
14816: 
14817: \bibitem{ConnesMarcolliBook}
14818: A.~Connes and M.~Marcolli, \emph{Noncommutative Geometry, Quantum Fields and Motives}, AMS Colloquium Publications, 2008.
14819: 
14820: \bibitem{WittenCFT}
14821: E.~Witten, \emph{Quantum field theory and the Jones polynomial}, Comm.\ Math.\ Phys.\ \textbf{121} (1989), 351--399.
14822: 
14823: \bibitem{MirzakhaniModuli}
14824: M.~Mirzakhani, \emph{Growth of the number of simple closed geodesics on hyperbolic surfaces}, Ann.\ of Math.\ \textbf{168} (2008), 97--125.
14825: 
14826: \bibitem{Henderson2019Quanv}
14827: M.~Henderson, S.~Shakya, S.~Pradhan, and T.~Cook,
14828: \newblock ``Quanvolutional Neural Networks: Powering Image Recognition with Quantum Circuits,''
14829: \newblock arXiv:1904.04767 (2019).
14830: 
14831: \bibitem{Li2022QuantumAttention}
14832: R.~Li, X.~Liu, H.~Zhao, J.~Yang, C.~Zhang, C.~Yan, and Q.~Sun,
14833: \newblock ``Quantum Attention for Text Classification,''
14834: \newblock arXiv:2205.05625 (2022).
14835: 
14836: \bibitem{Kollar2018HyperbolicHardware}
14837: A.~J.~Koll\'ar, M.~Fitzpatrick, and A.~A.~Houck,
14838: \newblock ``Hyperbolic Lattice in Circuit Quantum Electrodynamics,''
14839: \newblock arXiv:1802.09549 (2018).
14840: 
14841: 
14842: \bibitem{Zheng2021QGCN}
14843: J.~Zheng, Q.~Gao, and Y.~L\"u,
14844: \newblock ``Quantum Graph Convolutional Neural Networks,''
14845: \newblock arXiv:2107.03257 (2021).
14846: 
14847: \bibitem{Masci2015GCNN}
14848: J.~Masci, D.~Boscaini, M.~M.~Bronstein, and P.~Vandergheynst,
14849: \newblock ``Geodesic Convolutional Neural Networks on Riemannian Manifolds,''
14850: \newblock in \emph{Proc.\ IEEE International Conference on Computer Vision Workshops} (ICCVW), 2015.
14851: 
14852: \bibitem{Ning2025QGAT}
14853: A.~Ning, T.~Y.~Li, and N.~Y.~Chen,
14854: \newblock ``Quantum Graph Attention Network: A Novel Quantum Multi-Head Attention Mechanism for Graph Learning,''
14855: \newblock arXiv:2508.17630 (2025), NeurIPS 2025.
14856: 
14857: \bibitem{Ramsauer2020HopfieldAllYouNeed}
14858: H.~Ramsauer, B.~Sch\"afl, J.~Lehner, P.~Seidl, M.~Widrich, T.~Adler, L.~Gruber, M.~Holzleitner, M.~Pavlovi\'c, G.~K.~Sandve, V.~Unterthiner, J.~Brandstetter, and S.~Hochreiter,
14859: \newblock ``Hopfield Networks is All You Need,''
14860: \newblock in \emph{Proc.\ International Conference on Learning Representations} (ICLR), 2021.
14861: 
14862: \bibitem{Plate1995HolographicReducedRepresentations}
14863: T.~A.~Plate,
14864: \newblock ``Holographic Reduced Representations,''
14865: \newblock \emph{IEEE Transactions on Neural Networks} \textbf{6}(3) (1995), 623--641.
14866: 
14867: \bibitem{Vidal2007MERA}
14868: G.~Vidal,
14869: \newblock ``Entanglement Renormalization,''
14870: \newblock \emph{Phys.\ Rev.\ Lett.}\ \textbf{99} (2007), 220405.
14871: 
14872: \bibitem{Pastawski2015HAPPY}
14873: F.~Pastawski, B.~Yoshida, D.~Harlow, and J.~Preskill,
14874: \newblock ``Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence,''
14875: \newblock \emph{JHEP} \textbf{2015}(6) (2015), 149.
14876: 
14877: 
14878: 
14879: \bibitem{Raeburn2005GraphAlgebras}
14880: I.~Raeburn,
14881: \newblock \emph{Graph Algebras},
14882: \newblock CBMS Regional Conference Series in Mathematics, vol.~103, American Mathematical Society, 2005.
14883: 
14884: \bibitem{Abrams2017LeavittPath}
14885: G.~Abrams, G.~Aranda~Pino, and M.~Siles~Molina,
14886: \newblock \emph{Leavitt Path Algebras},
14887: \newblock Lecture Notes in Mathematics, vol.~2191, Springer, 2017.
14888: 
14889: \bibitem{Rosaleny2017PeptideQC}
14890: L.~E.~Rosaleny \emph{et al.},
14891: \newblock \emph{Peptides as versatile scaffolds for quantum computing},
14892: \newblock manuscript (PDF built 2017).
14893: 
14894: \bibitem{Geffner2025Proteina}
14895: T.~Geffner \emph{et al.},
14896: \newblock ``Prote\'{i}na: Scaling flow-based protein structure generative models,''
14897: \newblock in \emph{Proc.\ International Conference on Learning Representations} (ICLR), 2025.
14898: 
14899: \bibitem{Cho2025BoltzDesign1}
14900: Y.~Cho \emph{et al.},
14901: \newblock ``BoltzDesign1: Inverting all-atom structure prediction model for generalized biomolecular binder design,''
14902: \newblock bioRxiv preprint (2025).
14903: 
14904: 
14905: 
14906: 
14907: \bibitem{BFZ1996TotallyPositive}
14908: A.~Berenstein, S.~Fomin, and A.~Zelevinsky,
14909: \newblock ``Parametrizations of canonical bases and totally positive matrices,''
14910: \newblock \emph{Advances in Mathematics} \textbf{122} (1996), 49--149.
14911: 
14912: \bibitem{FominZelevinsky2000TotalPositivity}
14913: S.~Fomin and A.~Zelevinsky,
14914: \newblock ``Total positivity: tests and parametrizations,''
14915: \newblock \emph{The Mathematical Intelligencer} \textbf{22}(1) (2000), 23--33.
14916: 
14917: \bibitem{Karlin1968TotalPositivity}
14918: S.~Karlin,
14919: \newblock \emph{Total Positivity}, Vol.~I,
14920: \newblock Stanford University Press, 1968.
14921: 
14922: \bibitem{Pinkus1996TotallyPositive}
14923: A.~Pinkus,
14924: \newblock \emph{Totally Positive Matrices},
14925: \newblock Cambridge University Press, 2010.
14926: 
14927: \bibitem{Lindstrom1973Paths}
14928: B.~Lindstr\"om,
14929: \newblock ``On the vector representations of induced matroids,''
14930: \newblock \emph{Bull.\ London Math.\ Soc.} \textbf{5} (1973), 85--90.
14931: 
14932: \bibitem{GesselViennot1985Nonintersecting}
14933: I.~M.~Gessel and X.~G.~Viennot,
14934: \newblock ``Binomial determinants, paths, and hook length formulae,''
14935: \newblock \emph{Advances in Mathematics} \textbf{58} (1985), 300--321.
14936: 
14937: 
14938: 
14939: 
14940: \bibitem{ConwayComplexAnalysis}
14941: J.~B.~Conway,
14942: \newblock \emph{Functions of One Complex Variable I},
14943: \newblock 2nd ed., Graduate Texts in Mathematics~11, Springer, 1978.
14944: 
14945: 
14946: 
14947: 
14948: \bibitem{Connes1994NCG}
14949: A.~Connes,
14950: \newblock \emph{Noncommutative Geometry},
14951: \newblock Academic Press, 1994.
14952: 
14953: \bibitem{PimsnerVoiculescu1980ExactSequence}
14954: M.~Pimsner and D.~Voiculescu,
14955: \newblock ``Exact sequences for K-groups and Ext-groups of certain cross-product $C^*$-algebras,''
14956: \newblock \emph{Journal of Operator Theory} \textbf{4} (1980), 93--118.
14957: 
14958: \bibitem{Rieffel1981IrrationalRotations}
14959: M.~A.~Rieffel,
14960: \newblock ``C$^*$-algebras associated with irrational rotations,''
14961: \newblock \emph{Pacific Journal of Mathematics} \textbf{93} (1981), 415--429.
14962: 
14963: \bibitem{ElliottEvans1993Rotation}
14964: G.~A.~Elliott and D.~E.~Evans,
14965: \newblock ``The structure of the irrational rotation $C^*$-algebra,''
14966: \newblock \emph{Annals of Mathematics} \textbf{138} (1993), 477--501.
14967: 
14968: \bibitem{Walters1982ErgodicTheory}
14969: P.~Walters,
14970: \newblock \emph{An Introduction to Ergodic Theory},
14971: \newblock Graduate Texts in Mathematics~79, Springer, 1982.
14972: 
14973: 
14974: 
14975: 
14976: 
14977: \bibitem{Lusztig1990CanonicalBases}
14978: G.~Lusztig,
14979: \newblock ``Canonical bases arising from quantized enveloping algebras,''
14980: \newblock \emph{J.\ Amer.\ Math.\ Soc.}\ \textbf{3} (1990), no.~2, 447--498.
14981: 
14982: \bibitem{Faltings2003LoopGroups}
14983: G.~Faltings,
14984: \newblock ``Algebraic loop groups and moduli spaces of bundles,''
14985: \newblock \emph{J.\ Eur.\ Math.\ Soc.\ (JEMS)}\ \textbf{5} (2003), no.~1, 41--68.
14986: 
14987: \bibitem{Schreiber2018SurfaceAlgebrasI}
14988: A.~Schreiber,
14989: \newblock \emph{Surface Algebras I: Dessins d'Enfants, Surface Algebras, and Dessin Orders},
14990: \newblock arXiv:1810.06750v5 (2023).
14991: 
14992: \bibitem{Schreiber2018SurfaceAlgebrasII}
14993: A.~Schreiber,
14994: \newblock \emph{Surface Algebras and Surface Orders II: Affine Bundles on Curves},
14995: \newblock arXiv:1812.00621v1 (2018).
14996: 
14997: \bibitem{CarrollChindrisKinserWeyman2018ModuliSpecialBiserial}
14998: A.~T.~Carroll, C.~Chindris, R.~Kinser, and J.~Weyman,
14999: \newblock \emph{Moduli spaces of representations of special biserial algebras},
15000: \newblock arXiv:1706.07022v3 (2018).
15001: 
15002: 
15003: 
15004: 
15005: 
15006: 
15007: \bibitem{Procesi1976InvariantTheoryMatrices}
15008: C.~Procesi,
15009: \newblock ``The invariant theory of $n\times n$ matrices,''
15010: \newblock \emph{Advances in Mathematics} \textbf{19} (1976), no.~3, 306--381.
15011: 
15012: \bibitem{LeBruynProcesi1990SemisimpleQuivers}
15013: L.~Le Bruyn and C.~Procesi,
15014: \newblock ``Semisimple representations of quivers,''
15015: \newblock \emph{Trans.\ Amer.\ Math.\ Soc.} \textbf{317} (1990), no.~2, 585--598.
15016: 
15017: \bibitem{CrawYamagishi2023LBPFollowingLusztig}
15018: A.~Craw and R.~Yamagishi,
15019: \newblock \emph{The Le Bruyn--Procesi theorem following Lusztig},
15020: \newblock arXiv:2312.08527 (2023; revised 2025).
15021: 
15022: \bibitem{CarrollChindris2012InvariantGentle}
15023: A.~T.~Carroll and C.~Chindri\c{s},
15024: \newblock \emph{On the invariant theory for acyclic gentle algebras},
15025: \newblock arXiv:1210.3579 (2012).
15026: 
15027: \bibitem{ShmelkinGentleDeformation}
15028: D.~A.~Shmelkin,
15029: \newblock \emph{Semi-invariants of gentle algebras by deformation method and sphericity},
15030: \newblock \emph{Journal of Algebra} \textbf{528} (2019), 285--310.
15031: 
15032: \bibitem{BessenrodtHolm2005WeightedLocallyGentle}
15033: C.~Bessenrodt and T.~Holm,
15034: \newblock \emph{Weighted Locally Gentle Quivers and Cartan Matrices},
15035: \newblock arXiv:math/0511610v1 (2005).
15036: 
15037: \bibitem{AlexeevBrion2004ToricDegenerations}
15038: V.~Alexeev and M.~Brion,
15039: \newblock \emph{Toric degenerations of spherical varieties},
15040: \newblock arXiv:math/0403379 (2004).
15041: 
15042: \bibitem{VinbergKimelfeld1978Spherical}
15043: \'E.~B.~Vinberg and B.~N.~Kimel'fel'd,
15044: \newblock \emph{Homogeneous domains on flag manifolds and spherical subgroups of semisimple Lie groups},
15045: \newblock \emph{Functional Analysis and Its Applications} \textbf{12} (1978), 168--174.
15046: 
15047: \bibitem{VK}
15048: \'E.~B.~Vinberg and B.~N.~Kimel'fel'd,
15049: \newblock \emph{Homogeneous domains on flag manifolds and spherical subgroups of semisimple Lie groups},
15050: \newblock \emph{Functional Analysis and Its Applications} \textbf{12} (1978), 168--174.
15051: 
15052: \bibitem{SimonTraceIdeals}
15053: B.~Simon,
15054: \newblock \emph{Trace Ideals and Their Applications}, 2nd ed.,
15055: \newblock Mathematical Surveys and Monographs, vol.~120, American Mathematical Society, 2005.
15056: 
15057: 
15058: \bibitem{Postnikov2006TotalPositivityNetworks}
15059: A.~Postnikov,
15060: \newblock \emph{Total positivity, Grassmannians, and networks},
15061: \newblock arXiv:math/0609764 (2006).
15062: 
15063: \bibitem{ArkaniHamedBourjailyCachazoGoncharovPostnikovTrnka2012PositiveGrassmannian}
15064: N.~Arkani-Hamed, J.~L.~Bourjaily, F.~Cachazo, A.~B.~Goncharov, A.~Postnikov, and J.~Trnka,
15065: \newblock \emph{Scattering Amplitudes and the Positive Grassmannian},
15066: \newblock arXiv:1212.5605 (2012).
15067: 
15068: \bibitem{ArkaniHamedTrnka2013Amplituhedron}
15069: N.~Arkani-Hamed and J.~Trnka,
15070: \newblock \emph{The Amplituhedron},
15071: \newblock arXiv:1312.2007 (2013).
15072: 
15073: \bibitem{ArkaniHamedHodgesTrnka2014PositiveAmplitudes}
15074: N.~Arkani-Hamed, A.~Hodges, and J.~Trnka,
15075: \newblock \emph{Positive Amplitudes in the Amplituhedron},
15076: \newblock arXiv:1412.8478 (2014).
15077: 
15078: 
15079: 
15080: \bibitem{Kozlov}
15081: D.~Kozlov,
15082: \newblock \emph{Combinatorial Algebraic Topology},
15083: \newblock Algorithms and Computation in Mathematics, Springer (2008).
15084: 
15085: \bibitem{Dummit}
15086: D.~S.~Dummit and R.~M.~Foote,
15087: \newblock \emph{Abstract Algebra} (3rd ed.),
15088: \newblock Wiley (2004).
15089: 
15090: \bibitem{LZ}
15091: S.~K.~Lando and A.~K.~Zvonkin,
15092: \newblock \emph{Graphs on Surfaces and Their Applications},
15093: \newblock Encyclopaedia of Mathematical Sciences, vol.~141, Springer (2004).
15094: 
15095: \bibitem{Kraskiewicz-Weyman}
15096: W.~Kra\'skiewicz and J.~Weyman,
15097: \newblock \emph{Generic decompositions and semi-invariants for string algebras},
15098: \newblock arXiv:1103.5415 (2011).
15099: 
15100: \bibitem{CCKW1}
15101: A.~T.~Carroll, C.~Chindri\c{s}, R.~Kinser, and J.~Weyman,
15102: \newblock \emph{Moduli spaces of representations of special biserial algebras},
15103: \newblock arXiv:1706.07022 (2017).
15104: 
15105: \bibitem{CB1}
15106: W.~Crawley-Boevey,
15107: \newblock \emph{Classification of modules for infinite-dimensional string algebras},
15108: \newblock arXiv:1308.6410 (2013).
15109: 
15110: \bibitem{NielsenChuang2000}
15111: M.~A.~Nielsen and I.~L.~Chuang,
15112: \newblock \emph{Quantum Computation and Quantum Information},
15113: \newblock Cambridge University Press (2000).
15114: 
15115: \bibitem{BreuerPetruccione2002OpenSystems}
15116: H.-P.~Breuer and F.~Petruccione,
15117: \newblock \emph{The Theory of Open Quantum Systems},
15118: \newblock Oxford University Press (2002).
15119: 
15120: \bibitem{WisemanMilburn2009QuantumMeasurement}
15121: H.~M.~Wiseman and G.~J.~Milburn,
15122: \newblock \emph{Quantum Measurement and Control},
15123: \newblock Cambridge University Press (2009).
15124: 
15125: 
15126: 
15127: 
15128: \bibitem{GabrielRiedtmann1979WithoutGroups}
15129: P.~Gabriel and Ch.~Riedtmann,
15130: \newblock ``Group representations without groups,''
15131: \newblock \emph{Commentarii Mathematici Helvetici} \textbf{54} (1979), 240--287. DOI: 10.1007/BF02566271.
15132: 
15133: \bibitem{HochsterEagon1971GenericPerfection}
15134: M.~Hochster and J.~A.~Eagon,
15135: \newblock ``Cohen--Macaulay rings, invariant theory, and the generic perfection of determinantal loci,''
15136: \newblock \emph{American Journal of Mathematics} \textbf{93} (1971), no.~4, 1020--1058. DOI: 10.2307/2373744.
15137: 
15138: \bibitem{Hochster1975TopicsHomological}
15139: M.~Hochster,
15140: \newblock \emph{Topics in the Homological Theory of Modules over Commutative Rings},
15141: \newblock CBMS Regional Conference Series in Mathematics, vol.~24, American Mathematical Society, 1975.
15142: 
15143: 
15144: 
15145: \bibitem{HochsterCBMS24}
15146: M.~Hochster,
15147: \newblock \emph{Topics in the Homological Theory of Modules over Commutative Rings},
15148: \newblock CBMS Regional Conference Series in Mathematics, no.~24,
15149: American Mathematical Society, Providence, RI, 1975.
15150: 
15151: \bibitem{BuchsbaumEisenbud1974}
15152: D.~Buchsbaum and D.~Eisenbud,
15153: \newblock \emph{Some structure theorems for finite free resolutions},
15154: \newblock Adv.\ Math.\ \textbf{12} (1974), 84--139.
15155: 
15156: \bibitem{Bruns1983DivisorsComplexes}
15157: W.~Bruns,
15158: \newblock \emph{Divisors on varieties of complexes},
15159: \newblock Math.\ Ann.\ \textbf{264} (1983), 53--71.
15160: 
15161: \bibitem{Bruns1984GenericFreeResolutions}
15162: W.~Bruns,
15163: \newblock \emph{The existence of generic free resolutions and related objects},
15164: \newblock Math.\ Scand.\ \textbf{55} (1984), 33--46.
15165: 
15166: \bibitem{Huneke1981ArithmeticPerfection}
15167: C.~Huneke,
15168: \newblock \emph{The arithmetic perfection of Buchsbaum--Eisenbud varieties and generic
15169: modules of projective dimension two},
15170: \newblock Trans.\ Amer.\ Math.\ Soc.\ \textbf{265} (1981), 211--233.
15171: 
15172: \bibitem{PragaczWeyman1990GenericFreeResolutions}
15173: P.~Pragacz and J.~Weyman,
15174: \newblock \emph{On the generic free resolutions},
15175: \newblock J.\ Algebra \textbf{128} (1990), 1--44.
15176: 
15177: \bibitem{Weyman2003CohomologySyzygies}
15178: J.~Weyman,
15179: \newblock \emph{Cohomology of Vector Bundles and Syzygies},
15180: \newblock Cambridge University Press, Cambridge, 2003.
15181: 
15182: \bibitem{KustinWeyman2005UniversalRing}
15183: A.~R.~Kustin and J.~M.~Weyman,
15184: \newblock \emph{On the minimal free resolution of the universal ring for resolutions of length two},
15185: \newblock arXiv:math/0508439 (2005).
15186: 
15187: \bibitem{IwaniecSpectralMethods}
15188: H.~Iwaniec,
15189: \newblock \emph{Spectral Methods of Automorphic Forms}, 2nd ed.,
15190: \newblock Graduate Studies in Mathematics, vol.~53, AMS and Revista Matem\'atica Iberoamericana, 2002.
15191: 
15192: \bibitem{IwaniecKowalski2004AnalyticNT}
15193: H.~Iwaniec and E.~Kowalski,
15194: \newblock \emph{Analytic Number Theory},
15195: \newblock AMS Colloquium Publications, vol.~53, 2004.
15196: 
15197: \bibitem{Huber1961PGT}
15198: H.~Huber,
15199: \newblock ``Zur analytischen Theorie hyperbolischer Raumformen und Bewegungsgruppen~II,''
15200: \newblock \emph{Math.\ Ann.} \textbf{143} (1961), 463--464.
15201: 
15202: \bibitem{Sarnak1990PGT}
15203: P.~Sarnak,
15204: \newblock ``The arithmetic and geometry of some hyperbolic three-manifolds,''
15205: \newblock \emph{Acta Math.} \textbf{151} (1983), 253--295.
15206: 
15207: \bibitem{Shimura1971ArithmeticModularFunctions}
15208: G.~Shimura,
15209: \newblock \emph{Introduction to the Arithmetic Theory of Automorphic Functions},
15210: \newblock Princeton University Press, 1971.
15211: 
15212: \bibitem{Deligne1971FormeModulaires}
15213: P.~Deligne,
15214: \newblock ``Formes modulaires et repr\'esentations $\ell$-adiques,''
15215: \newblock S\'eminaire Bourbaki, exp.~355, 1968/69, in: \emph{Lecture Notes in Math.}\ \textbf{179}, Springer, 1971.
15216: 
15217: \bibitem{JacquetLanglands1970GL2}
15218: H.~Jacquet and R.~P.~Langlands,
15219: \newblock \emph{Automorphic Forms on $\mathrm{GL}(2)$},
15220: \newblock Lecture Notes in Mathematics, vol.~114, Springer, 1970.
15221: 
15222: \bibitem{GelbartJacquet1978GL3}
15223: S.~S.~Gelbart and H.~Jacquet,
15224: \newblock ``A relation between automorphic representations of $\mathrm{GL}(2)$ and $\mathrm{GL}(3)$,''
15225: \newblock \emph{Ann.\ Sci.\ \'Ecole Norm.\ Sup.} (4) \textbf{11} (1978), no.~4, 471--542.
15226: 
15227: \bibitem{KimShahidi2002GL4}
15228: H.~H.~Kim and F.~Shahidi,
15229: \newblock ``Functorial products for $\mathrm{GL}_2\times\mathrm{GL}_3$ and the symmetric cube for $\mathrm{GL}_2$,''
15230: \newblock \emph{Ann.\ of Math.} (2) \textbf{155} (2002), no.~3, 837--893.
15231: 
15232: \bibitem{Ratner1987MixingGeodFlow}
15233: M.~Ratner,
15234: \newblock ``The rate of mixing for geodesic and horocycle flows,''
15235: \newblock \emph{Ergodic Theory Dynam.\ Systems} \textbf{7} (1987), no.~2, 267--288.
15236: 
15237: % ---- New entries for the Peptide QPU chapter ----
15238: 
15239: \bibitem{RosalenyEtAl2017}
15240: L.~E.~Rosaleny, A.~Forment-Aliaga, H.~Prima-Garc\'{\i}a,
15241: R.~Torres~Cavanillas, J.~J.~Baldov\'{\i}, V.~Go\l{}ebiewska,
15242: K.~Wla\l{}o, G.~Escorcia-Ariza, L.~Escalera-Moreno, S.~Tatay,
15243: C.~Garc\'{\i}a-Ll\'acer, M.~Clemente-Le\'on, S.~Cardona-Serra,
15244: P.~Casino, L.~Mart\'{\i}nez-Gil, A.~Gaita-Ari\~no, and E.~Coronado,
15245: \newblock ``Peptides as versatile scaffolds for quantum computing,''
15246: \newblock \emph{arXiv}:1708.09440 (2017).
15247: 
15248: \bibitem{ButcherEtAl2025}
15249: J.~Butcher, R.~Krishna, R.~Mitra, R.~I.~Brent, Y.~Li,
15250: N.~Corley, P.~Kim, J.~Funk, S.~Mathis, S.~Salike,
15251: A.~Muraishi, H.~Eisenach, T.~R.~Thompson, J.~Chen,
15252: Y.~Politanska, E.~Sehgal, B.~Coventry, O.~Zhang, B.~Qiang,
15253: K.~Didi, M.~Kazman, F.~DiMaio, and D.~Baker,
15254: \newblock ``\emph{De novo} design of all-atom biomolecular interactions
15255: with RFdiffusion3,''
15256: \newblock \emph{bioRxiv} 2025.09.18.676967 (2025).
15257: 
15258: \bibitem{NitzEtAl2004}
15259: M.~Nitz, M.~Franz, R.~L.~Maglathlin, and B.~Imperiali,
15260: \newblock ``A powerful combinatorial screen to identify high-affinity
15261: terbium(III)-binding peptides,''
15262: \newblock \emph{ChemBioChem} \textbf{4} (2003), 272--276.
15263: 
15264: \bibitem{BaldoviEtAl2013}
15265: J.~J.~Baldov\'{\i}, S.~Cardona-Serra, J.~M.~Clemente-Juan,
15266: E.~Coronado, A.~Gaita-Ari\~no, and H.~Prima-Garc\'{\i}a,
15267: \newblock ``Coherent manipulation of spin qubits based on
15268: polyoxometalates: the case of the single ion magnet
15269: $[\mathrm{GdW_{30}P_5O_{110}}]^{14-}$,''
15270: \newblock \emph{Chem.\ Commun.} \textbf{49} (2013), 8922--8924.
15271: 
15272: \bibitem{HoSalimans2022}
15273: J.~Ho and T.~Salimans,
15274: \newblock ``Classifier-free diffusion guidance,''
15275: \newblock \emph{arXiv}:2207.12598 (2022).
15276: 
15277: \bibitem{BrylinskiBrylinski2002}
15278: J.-L.~Brylinski and R.~Brylinski,
15279: \newblock ``Universal quantum gates,''
15280: \newblock in \emph{Mathematics of Quantum Computation}, R.~Brylinski
15281: and G.~Chen, eds., Chapman \& Hall/CRC, 2002, pp.~101--116.
15282: 
15283: \bibitem{GrothendieckEsquisse1984}
15284: A.~Grothendieck,
15285: \newblock ``Esquisse d'un programme,''
15286: \newblock in \emph{Geometric Galois Actions}, vol.~1, Cambridge Univ.\ Press,
15287: 1997, pp.~5--48 (written 1984).
15288: 
15289: % ---- New refs: Hyperbolic Kagome QPU section ----
15290: 
15291: \bibitem{SchreiberThermoGFN2025}
15292: A.~Schreiber,
15293: \newblock ``ThermoGFN-IF: GFlowNet-based thermostable protein inverse folding,''
15294: \newblock arXiv preprint, 2025.
15295: 
15296: \bibitem{LiSPURS2026}
15297: H.~Li et al.,
15298: \newblock ``SPURS: Single-pass universal residue stability scoring,''
15299: \newblock arXiv preprint, 2026.
15300: 
15301: \bibitem{LewisBioEmu2024}
15302: S.~Lewis et al.,
15303: \newblock ``BioEmu: Sequence-conditioned equilibrium ensemble emulation for proteins,''
15304: \newblock \emph{bioRxiv}, 2024.
15305: 
15306: \bibitem{WoodUMA2025}
15307: B.~Wood et al.,
15308: \newblock ``UMA: A universal machine-learning interatomic potential,''
15309: \newblock arXiv preprint, 2025.
15310: 
15311: \bibitem{MalkinEtAl2022}
15312: E.~Malkin, M.~Jain, M.~Bengio, A.~C.~Courville, S.~Bengio, and G.~Lacoste-Julien,
15313: \newblock ``Trajectory balance: Improved credit assignment in GFlowNets,''
15314: \newblock \emph{Advances in Neural Information Processing Systems (NeurIPS)}, vol.~35, 2022.
15315: 
15316: \bibitem{PanTemperature2023}
15317: Y.~Pan, N.~Malkin, G.~W.~Coates, and Y.~Bengio,
15318: \newblock ``Better training of GFlowNets with local credit and incomplete trajectories,''
15319: \newblock \emph{Proc.\ ICML 2023}.
15320: 
15321: \bibitem{Freedman2002}
15322: M.~H.~Freedman, A.~Kitaev, M.~J.~Larsen, and Z.~Wang,
15323: \newblock ``Topological quantum computation,''
15324: \newblock \emph{Bull.\ Amer.\ Math.\ Soc.\ (N.S.)} \textbf{40} (2003), 31--38.
15325: 
15326: \bibitem{BombinDelgado2007}
15327: H.~Bomb\'in and M.~A.~Martin-Delgado,
15328: \newblock ``Homological error correction: Classical and quantum codes,''
15329: \newblock \emph{J.\ Math.\ Phys.} \textbf{48} (2007), 052105.
15330: 
15331: \bibitem{Delfosse2013}
15332: N.~Delfosse,
15333: \newblock ``Tradeoffs for reliable quantum information storage in surface codes and color codes,''
15334: \newblock \emph{Proc.\ IEEE ISIT 2013}, pp.~917--921.
15335: 
15336: \bibitem{GuthGromov2010}
15337: L.~Guth and M.~Gromov,
15338: \newblock ``Systolic inequalities and hyperbolic surfaces,''
15339: \newblock see: L.~Guth, ``Metaphors in systolic geometry,'' \emph{Proc.\ ICM}, vol.~II
15340:   (2011), pp.~745--768; and M.~Gromov, \emph{Geom.\ Funct.\ Anal.}\ \textbf{20} (2010), 416--526.
15341: 
15342: \bibitem{Kabsch1976}
15343: W.~Kabsch,
15344: \newblock ``A solution for the best rotation to relate two sets of vectors,''
15345: \newblock \emph{Acta Crystallogr.\ A} \textbf{32} (1976), 922--923.
15346: 
15347: \bibitem{MortonEtAl2011}
15348: J.~J.~L.~Morton and P.~Bertet,
15349: \newblock ``Storing quantum information in spins and high-sensitivity ESR,''
15350: \newblock \emph{J.\ Magn.\ Reson.} \textbf{287} (2018), 128--139.
15351: 
15352: \bibitem{ZaccaiEtAl2016}
15353: G.~Zaccai et al.,
15354: \newblock ``Neutrons describe ectoine effects on water H-bonding and hydration around
15355:   a soluble protein and a cell membrane,''
15356: \newblock \emph{Sci.\ Rep.} \textbf{6} (2016), 31154.
15357: 
15358: \bibitem{VoightAFL2021}
15359: J.~Voight,
15360: \newblock \emph{Quaternion Algebras}, Grad.\ Texts in Math.\ 288, Springer, 2021.
15361: 
15362: \bibitem{ChamberlaineEtAl2018}
15363: C.~Chamberland et al.,
15364: \newblock ``Flag fault-tolerant error correction with arbitrary distance codes,''
15365: \newblock \emph{Quantum} \textbf{2} (2018), 53.
15366: 
15367: \bibitem{Breuckmann2021}
15368: N.~P.~Breuckmann and J.~N.~Eberhardt,
15369: \newblock ``Quantum low-density parity-check codes,''
15370: \newblock \emph{PRX Quantum} \textbf{2} (2021), 040101.
15371: 
15372: \end{thebibliography}
15373: 
15374: \backmatter
15375: \appendix
15376: 
\chapter{Worked example: a mixed dessin on $\mathbb T^2$ (torus) and its AR geometry} · lines 15377–15556
15377: \chapter{Worked example: a mixed dessin on $\mathbb T^2$ (torus) and its AR geometry}
15378: \label{app:torus_dessin}
15379: 
15380: This appendix is a fully worked, self-contained example that ties together:
15381: (i) dessin data $(\sigma_0,\sigma_1,\sigma_\infty)$ on $\mathbb T^2$,
15382: (ii) the associated locally gentle surface algebra $\Lambda=kQ/I$,
15383: (iii) its string/band classification,
15384: (iv) explicit AR components (with TikZ pictures),
15385: and (v) the face anti-cycles $\phi=\sigma_\infty$ as circular complexes, including the Hom-controlled reduction to
15386: $\Lambda_n=k\widetilde A_{n-1}/J^2$.
15387: 
15388: \section{Dessins on the torus and the ``two 3-cycles with mixed relations'' constellation}
15389: Fix the dart set $H=\{1,2,3,4,5,6\}$ and permutations
15390: \[
15391: \sigma_0=(1\,2\,3)(4\,5\,6),\qquad
15392: \sigma_1=(1\,4)(2\,5)(3\,6),
15393: \qquad
15394: \sigma_\infty := (\sigma_0\sigma_1)^{-1}.
15395: \]
15396: This is the standard ``mixed'' torus dessin used as a minimal model for two interlaced 3-cycles:
15397: $\sigma_0$ has two 3-cycles (two black vertices of valency $3$), and $\sigma_1$ pairs the darts (three white vertices of valency $2$).
15398: One checks $\langle\sigma_0,\sigma_1\rangle$ acts transitively on $H$, and the Euler characteristic computed from cycle data
15399: gives genus $1$.
15400: 
15401: \subsection{Computing face cycles}
15402: Compute $\sigma_\infty$ explicitly:
15403: \[
15404: \sigma_0\sigma_1=(1\,5\,3\,4\,2\,6),
15405: \qquad
15406: \sigma_\infty=(1\,6\,2\,4\,3\,5).
15407: \]
15408: Thus there is a single face of length $6$ (a single $\phi$-cycle), i.e.\ the embedding is a one-face dessin on $\mathbb T^2$.
15409: 
15410: \section{The associated bound quiver $(Q,I)$}
15411: We form a locally gentle quiver with three vertex-spaces $x_1,x_2,x_3$ and two $3$--cycles.
15412: We denote the arrows on the first (``$a$'') triangle by
15413: \[
15414: x_1\xrightarrow{a_1}x_2\xrightarrow{a_2}x_3\xrightarrow{a_3}x_1,
15415: \]
15416: and we choose the arrows on the second (``$b$'') triangle with the \emph{correct induced orientation} coming from the torus embedding:
15417: \[
15418: x_1\xrightarrow{b_3}x_2\xrightarrow{b_1}x_3\xrightarrow{b_2}x_1.
15419: \]
15420: In other words, the $b$--cycle is \emph{cyclically the same triangle} but with its labels shifted so that, when we traverse the unique face $\phi=\sigma_\infty$ counterclockwise,
15421: the boundary alternates between an $a$--arrow and a $b$--arrow \emph{without introducing formal inverses}.
15422: This is exactly the orientation correction: the second $3$--cycle must be aligned to the global face orientation, otherwise the face word is incorrectly read and (upon reversing direction) it appears to allow spurious ``switching''.
15423: 
15424: The ideal $I$ imposes the \emph{mixed} relations: switching between the two triangles is forbidden in either direction along the face.
15425: With the usual path-algebra convention (right-to-left multiplication), we impose the six length-$2$ relations
15426: \[
15427: b_1a_1=0,\qquad a_3b_1=0,\qquad b_3a_3=0,\qquad a_2b_3=0,\qquad b_2a_2=0,\qquad a_1b_2=0.
15428: \]
15429: Equivalently, every length-$2$ subpath occurring as two consecutive edges along the face boundary is zero in $\Lambda$.
15430: (As usual for gentle strings, the forbidden list is closed under inversion: if $pq\in I$ then the inverse subword $q^{-1}p^{-1}$ is forbidden as well.
15431: This closure is what ensures that traversing the face in the opposite direction does \emph{not} accidentally permit cycle-switching in the string language.)
15432: 
15433: This presentation is locally gentle: at each vertex there are exactly two outgoing arrows and two incoming arrows, and $I$ is generated by length-$2$ paths.\section{Face anti-cycle and the induced circular complex of length 6}
15434: The single face corresponds to the $\phi=\sigma_\infty$ cycle $(1\,6\,2\,4\,3\,5)$ of length $6$.
15435: In the quiver model (with the corrected $b$--orientation above), the boundary walk along the unique face alternates between the two local triangles, and the induced face word can be taken as
15436: \[
15437: w_\phi^{(+)} \;=\; a_1\,b_1\,a_3\,b_3\,a_2\,b_2
15438: \quad\text{(up to cyclic permutation).}
15439: \]
15440: By construction, every consecutive length-$2$ subpath appearing along $w_\phi^{(+)}$ is one of the six mixed relations listed above, hence is zero in $\Lambda$.
15441: If we traverse the same face in the opposite direction, we obtain the inverse cyclic word
15442: \[
15443: w_\phi^{(-)} \;=\; \bigl(w_\phi^{(+)}\bigr)^{-1},
15444: \]
15445: and gentleness/string conventions forbid the inverse subwords as well; therefore orientation reversal does not create any allowed switching.Hence the face yields an explicit anti-cycle of length $6$, and \emph{any} representation $M$ restricts to a circular complex:
15446: \[
15447: V_1\xrightarrow{d_1}V_2\xrightarrow{d_2}V_3\xrightarrow{d_3}V_4\xrightarrow{d_4}V_5\xrightarrow{d_5}V_6\xrightarrow{d_6}V_1,
15448: \qquad d_{i+1}d_i=0.
15449: \]
15450: 
15451: \begin{theorem}[Explicit face-quotient and Hom-controlled embedding]
15452: \label{thm:torus_face_quotient}
15453: Let $B:=\Lambda_6=k\widetilde A_{5}/J^2$ be the radical-square-zero cyclic quiver algebra of length $6$.
15454: There is a surjective algebra map $\pi:\Lambda\to B$ that kills all arrows not appearing in the face anti-cycle
15455: and sends the face arrows to the $6$-cycle arrows.
15456: Restriction of scalars $\pi^*:\mod B\to \mod \Lambda$ identifies $\rep(B,\mathbf d)$ with the closed face stratum inside $\rep(\Lambda,\mathbf d)$,
15457: and $\pi^*$ is Hom-controlled with correction term $0$.
15458: \end{theorem}
15459: 
15460: \begin{proof}
15461: Define $\pi$ on arrows by mapping the six face arrows (in the order of the face cycle) to the arrows of the cyclic quiver $\widetilde A_5$ and mapping all other arrows to $0$.
15462: The relations $J^2=0$ in $B$ correspond exactly to the mixed length-2 relations along the face word, hence $\pi(I)\subseteq J^2$ and $\pi$ is well-defined.
15463: Surjectivity is immediate because the $6$ face arrows generate $B$.
15464: For $B$-modules $U,V$, any $\Lambda$-linear map between $\pi^*U$ and $\pi^*V$ is automatically $B$-linear because the $\Lambda$-action factors through $B$.
15465: Thus $\pi$ is a categorical epimorphism and $\pi^*$ is full; consequently $\Hom_\Lambda(\pi^*U,\pi^*V)=\Hom_B(U,V)$ and Hom-control holds with correction term $0$.
15466: \end{proof}
15467: 
15468: \section{Auslander--Reiten components in this example}
15469: We now exhibit the three component types explicitly and connect them to the combinatorics of words on the two cycles.
15470: 
15471: \subsection{Band modules: two homogeneous tubes (one for $a$ and one for $b$)}
15472: The cyclic words $a_1a_2a_3$ and $b_1b_2b_3$ define bands (primitive cyclic strings).
15473: For each $\lambda\in k^\times$ and each Jordan block size $m\ge1$, there are band modules
15474: $M(a;\lambda,m)$ and $M(b;\lambda,m)$.
15475: These families form homogeneous tubes in the stable AR quiver.
15476: 
15477: \begin{proposition}[Tube components]
15478: \label{prop:torus_tubes}
15479: The indecomposable band modules supported on the $a$-cycle (resp.\ $b$-cycle) form a homogeneous tube component in $\Gamma_\Lambda$.
15480: \end{proposition}
15481: 
15482: \begin{proof}
15483: This is standard for gentle algebras: each band word $\beta$ yields an AR component which is a tube, with quasi-simples parameterized by $\lambda\in k^\times$
15484: and higher quasi-lengths by Jordan block size. The tube translation corresponds to $\tau$ acting by changing quasi-length while fixing the band word.
15485: Here there are exactly two primitive band words up to inversion, namely $a_1a_2a_3$ and $b_1b_2b_3$, yielding two tube families.
15486: \end{proof}
15487: 
15488: \subsection{String modules and the diamond mesh}
15489: Strings in this algebra are reduced walks that follow only $a$-arrows (and inverses) or only $b$-arrows (and inverses), except that they may \emph{switch cycles only via inverses}
15490: so as to avoid forbidden mixed subpaths. This produces directing string components with hook/cohook diamonds.
15491: 
15492: \begin{proposition}[Existence of diamond meshes]
15493: \label{prop:torus_diamond}
15494: There exist string modules $X$ in $\mod\Lambda$ such that both ends admit both hook and cohook moves.
15495: For such $X$, the local AR neighborhood is a 9-vertex mesh as in Figure~\ref{fig:ar_diamond}.
15496: \end{proposition}
15497: 
15498: \begin{proof}
15499: Choose a string word $w$ that ends at a vertex where both $a$ and $b$ arrows are available and such that neither end is blocked by a relation;
15500: for example, take a word that runs along $a$ for two steps and returns along an inverse, arranged so that both outgoing continuations at each end remain admissible.
15501: Gentleness guarantees that at each endpoint there is at most one admissible hook extension and at most one admissible cohook extension, and in this example both exist.
15502: The Butler--Ringel description of irreducible morphisms between string modules identifies these end-moves with irreducibles,
15503: and the AR mesh axiom then yields the 9-vertex configuration.
15504: \end{proof}
15505: 
15506: \subsection{Components containing projectives/injectives}
15507: The indecomposable projectives $P(x_i)$ are generated by paths starting at $x_i$.
15508: Because mixed compositions are zero, $P(x_i)$ decomposes into a sum of two uniserial ``branches'' along the $a$ and $b$ cycles.
15509: The AR component containing $P(x_i)$ is a preprojective-type component (a finite window of a $\mathbb Z A_\infty$ translation quiver).
15510: 
15511: \begin{proposition}[Preprojective component window]
15512: \label{prop:torus_preproj}
15513: Each $P(x_i)$ lies in a component whose underlying translation quiver contains a $\mathbb Z A_\infty$-subquiver,
15514: with boundary formed by the projectives.
15515: \end{proposition}
15516: 
15517: \begin{proof}
15518: In a gentle algebra, projectives correspond to maximal strings starting at a vertex.
15519: Irreducible maps out of a projective correspond to deleting a hook at an end, and iterating produces an infinite directing component unless truncated by periodicity.
15520: Here periodicity appears only in the band direction; the directing string direction is infinite, giving a $\mathbb Z A_\infty$-shaped component with projectives on the boundary.
15521: A finite window is depicted in Figure~\ref{fig:ar_preprojective}.
15522: \end{proof}
15523: 
15524: \section{Full reduction to the circular-complex model and explicit equations}
15525: Finally we spell out the circular-complex equations in coordinates for the face stratum.
15526: 
15527: Fix dimensions $d_1,\dots,d_6$ and choose bases so the face maps are matrices
15528: $D_i\in \Mat_{d_{i+1}\times d_i}(k)$ (indices mod $6$).
15529: The face stratum is cut out inside $\prod_i \Mat_{d_{i+1}\times d_i}$ by the quadratic equations
15530: \[
15531: D_{i+1}D_i=0,\qquad i\in\mathbb Z/6\mathbb Z.
15532: \]
15533: Orbit closures are stratified by ranks $r_i=\rank(D_i)$ subject to $r_i+r_{i+1}\le d_{i+1}$.
15534: For a maximal rank sequence $r$, the corresponding irreducible component is the closure of the rank stratum
15535: and admits the Grassmannian incidence resolution described in Chapter~\ref{ch:homcontrolled} (cf.\ Section~\ref{sec:ar_tikz} for component illustrations).
15536: 
15537: \begin{proposition}[Incidence resolution in the torus example]
15538: \label{prop:torus_incidence}
15539: For a maximal rank sequence $r$ there is a smooth incidence variety
15540: \[
15541: Z(r)\subset \Big(\prod_{i=1}^6 \Mat_{d_{i+1}\times d_i}\Big)\times \Big(\prod_{i=1}^6 \mathbf{Gr}(d_i-r_{i-1},k^{d_i})\Big)
15542: \]
15543: given by $\mathrm{im}(D_{i-1})\subset R_i\subset \ker(D_i)$, and the projection $Z(r)\to \overline{\rep(\Lambda_6,\mathbf d,r)}$ is birational.
15544: \end{proposition}
15545: 
15546: \begin{proof}
15547: This is the cyclic iteration of Hochster's Grassmannian technique: for fixed $(R_i)$, the constraints make each $D_i$
15548: factor through $k^{d_i}/R_i$ and land in $R_{i+1}$, so fibers are affine spaces; hence $Z(r)$ is a vector bundle over a product of Grassmannians and is smooth.
15549: Maximality of $r$ implies the intermediate subspaces are generically forced, giving birationality.
15550: \end{proof}
15551: 
15552: % === END WORKED TORUS DESSIN EXAMPLE ===
15553: 
15554: % \printindex (disabled)
15555: 
15556: \end{document}