roseking commited on
Commit
d64eda1
·
verified ·
1 Parent(s): 3ac99db

Add preprints files (part 3)

Browse files
This view is limited to 50 files because it contains too many changes.   See raw diff
Files changed (50) hide show
  1. .gitattributes +34 -0
  2. preprints/A-Fixed-Particle-Test-for-Computation-in-a-Forced-Viscous-Flow-September-27-2026/README.md +17 -0
  3. preprints/A-Fixed-Particle-Test-for-Computation-in-a-Forced-Viscous-Flow-September-27-2026/build/analytic-appendix.tex +129 -0
  4. preprints/A-Fixed-Particle-Test-for-Computation-in-a-Forced-Viscous-Flow-September-27-2026/build/analytic-tools.tex +109 -0
  5. preprints/A-Fixed-Particle-Test-for-Computation-in-a-Forced-Viscous-Flow-September-27-2026/build/main.tex +663 -0
  6. preprints/A-Fixed-Particle-Test-for-Computation-in-a-Forced-Viscous-Flow-September-27-2026/manuscript.pdf +3 -0
  7. preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/.gitignore +4 -0
  8. preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026.pdf +3 -0
  9. preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/README.md +17 -0
  10. preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/figures/relative-transfer.tex +13 -0
  11. preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/main.tex +109 -0
  12. preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/references.bib +329 -0
  13. preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/sections/01-introduction.tex +200 -0
  14. preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/sections/02-operators.tex +60 -0
  15. preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/sections/03-spin.tex +106 -0
  16. preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/sections/04-comparison.tex +172 -0
  17. preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/sections/05-transfer.tex +232 -0
  18. preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/sections/06-gap.tex +154 -0
  19. preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/sections/07-plane.tex +86 -0
  20. preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/sections/08-arithmetic.tex +152 -0
  21. preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/verification/rows.txt +20 -0
  22. preprints/A-Fully-Polynomial-Randomized-Approximation-Scheme-for-Perfect-Matchings-in-General-Graphs-September-23-2026/README.md +18 -0
  23. preprints/A-Fully-Polynomial-Randomized-Approximation-Scheme-for-Perfect-Matchings-in-General-Graphs-September-23-2026/build/main.tex +0 -0
  24. preprints/A-Fully-Polynomial-Randomized-Approximation-Scheme-for-Perfect-Matchings-in-General-Graphs-September-23-2026/main.pdf +3 -0
  25. preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/README.md +16 -0
  26. preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/build/figures/fifth-phase-grid.tex +39 -0
  27. preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/build/paper.tex +61 -0
  28. preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/build/references.bib +212 -0
  29. preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/build/sections/aisles.tex +492 -0
  30. preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/build/sections/grid.tex +647 -0
  31. preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/build/sections/introduction.tex +147 -0
  32. preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/build/sections/numerical.tex +207 -0
  33. preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/build/sections/periodicity.tex +153 -0
  34. preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/paper.pdf +3 -0
  35. preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/README.md +18 -0
  36. preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/article.pdf +3 -0
  37. preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/paper.tex +28 -0
  38. preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/preamble.tex +43 -0
  39. preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/references.tex +155 -0
  40. preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/sections/anchors.tex +71 -0
  41. preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/sections/boundaries.tex +46 -0
  42. preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/sections/concentration.tex +178 -0
  43. preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/sections/convergence.tex +442 -0
  44. preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/sections/forcing.tex +213 -0
  45. preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/sections/introduction.tex +181 -0
  46. preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/sections/three-clause.tex +202 -0
  47. preprints/A-Linear-Clock-for-Random-Walk-on-Tree-Weighted-Planar-Maps-October-5-2026/README.md +18 -0
  48. preprints/A-Linear-Clock-for-Random-Walk-on-Tree-Weighted-Planar-Maps-October-5-2026/build/bibliography.tex +152 -0
  49. preprints/A-Linear-Clock-for-Random-Walk-on-Tree-Weighted-Planar-Maps-October-5-2026/build/paper.tex +80 -0
  50. preprints/A-Linear-Clock-for-Random-Walk-on-Tree-Weighted-Planar-Maps-October-5-2026/build/sections/01-history.tex +55 -0
.gitattributes CHANGED
@@ -104,3 +104,37 @@ preprints/A-dimension-free-logarithmic-Sobolev-inequality-for-subgaussian-log-co
104
  preprints/A-Direct-Proof-of-Optimal-Max-Cut-Hardness-September-23-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
105
  preprints/A-direct-proof-of-the-complete-Crouzeix-inequality-September-26-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
106
  preprints/A-directional-zero-one-law-for-finite-range-dependent-random-environments-October-5-2026/directional-zero-one-finite-range.pdf filter=lfs diff=lfs merge=lfs -text
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
104
  preprints/A-Direct-Proof-of-Optimal-Max-Cut-Hardness-September-23-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
105
  preprints/A-direct-proof-of-the-complete-Crouzeix-inequality-September-26-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
106
  preprints/A-directional-zero-one-law-for-finite-range-dependent-random-environments-October-5-2026/directional-zero-one-finite-range.pdf filter=lfs diff=lfs merge=lfs -text
107
+ preprints/A-directional-zero-one-law-under-strict-ellipticity-September-23-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
108
+ preprints/A-doubling-Hilbert-subset-with-no-finite-dimensional-bi-Lipschitz-embedding-September-25-2026/main.pdf filter=lfs diff=lfs merge=lfs -text
109
+ preprints/A-finite-entropy-separation-of-microstates-and-nonmicrostates-free-entropy-September-25-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
110
+ preprints/A-finite-entropy-system-without-a-smooth-positive-volume-model-September-25-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
111
+ preprints/A-finite-Smith-Toda-complex-V4-at-the-prime-1009-September-23-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
112
+ preprints/A-finite-time-singularity-of-Calabi-flow-on-projective-space-September-24-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
113
+ preprints/A-finitely-generated-counterexample-to-the-Eilenberg-Ganea-conjecture-September-23-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
114
+ preprints/A-Fixed-Particle-Test-for-Computation-in-a-Forced-Viscous-Flow-September-27-2026/manuscript.pdf filter=lfs diff=lfs merge=lfs -text
115
+ preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026.pdf filter=lfs diff=lfs merge=lfs -text
116
+ preprints/A-Fully-Polynomial-Randomized-Approximation-Scheme-for-Perfect-Matchings-in-General-Graphs-September-23-2026/main.pdf filter=lfs diff=lfs merge=lfs -text
117
+ preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
118
+ preprints/A-group-without-fixed-price-October-5-2026/unequal-costs-rank-100-amalgam.pdf filter=lfs diff=lfs merge=lfs -text
119
+ preprints/A-high-arity-counterexample-to-Pixton-completeness-in-Chow-September-24-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
120
+ preprints/A-hyperbolic-group-with-no-geometric-CAT0-action-September-25-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
121
+ preprints/A-latest-anchor-induction-with-spectrally-compact-masks-for-worst-case-trace-reconstruction-October-5-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
122
+ preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/article.pdf filter=lfs diff=lfs merge=lfs -text
123
+ preprints/A-Linear-Clock-for-Random-Walk-on-Tree-Weighted-Planar-Maps-October-5-2026/linear-clock-random-walk-tree-weighted-planar-maps.pdf filter=lfs diff=lfs merge=lfs -text
124
+ preprints/A-linear-cycle-and-edge-decomposition-of-every-graph-September-24-2026/main.pdf filter=lfs diff=lfs merge=lfs -text
125
+ preprints/A-linear-list-coloring-bound-in-terms-of-the-Hadwiger-number-September-23-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
126
+ preprints/A-local-Penrose-inequality-for-conformal-perturbations-of-Schwarzschild-anti-de-Sitter-data-October-5-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
127
+ preprints/A-Logarithmic-Independence-Bound-for-Clique-Free-Graphs-September-25-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
128
+ preprints/A-Low-Space-Algorithm-for-Worst-Case-Subset-Sum-September-26-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
129
+ preprints/A-marked-tensor-obstruction-to-four-dimensional-disk-embedding-September-24-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
130
+ preprints/A-Modulus-Proof-of-Cannons-Conjecture-September-23-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
131
+ preprints/A-Nearly-Quartic-Separation-Between-Randomized-and-Quantum-Query-Complexity-October-5-2026/quartic-query-separation.pdf filter=lfs diff=lfs merge=lfs -text
132
+ preprints/A-Negative-Solution-to-the-Finite-Lattice-Representation-Problem-September-24-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
133
+ preprints/A-negatively-pinched-Kahler-threefold-without-bounded-holomorphic-coordinates-September-25-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
134
+ preprints/A-nine-dimensional-counterexample-to-Borsuks-covering-assertion-September-23-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
135
+ preprints/A-nondegenerate-counterexample-to-the-Morse-number-Arnold-bound-September-23-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
136
+ preprints/A-Nonspectrahedral-Hyperbolicity-Cone-September-24-2026/nonspectrahedral-hyperbolicity-cone.pdf filter=lfs diff=lfs merge=lfs -text
137
+ preprints/A-PD4-group-without-an-aspherical-manifold-model-September-24-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
138
+ preprints/A-Pivotal-Amplitude-for-Voronoi-Percolation-from-Cardys-Formula-October-5-2026/voronoi-pivotal-amplitude.pdf filter=lfs diff=lfs merge=lfs -text
139
+ preprints/A-pointwise-2-converse-for-elliptic-curves-with-rational-two-torsion-September-24-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
140
+ preprints/A-Polynomial-Time-2-Approximation-for-Shortest-Common-Superstring-September-24-2026/paper.pdf filter=lfs diff=lfs merge=lfs -text
preprints/A-Fixed-Particle-Test-for-Computation-in-a-Forced-Viscous-Flow-September-27-2026/README.md ADDED
@@ -0,0 +1,17 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ # [A Fixed Particle Test for Computation in a Forced Viscous Flow](manuscript.pdf)
2
+
3
+ **Author:** OpenAI
4
+ **Date:** September 27, 2026
5
+
6
+ ## Citation
7
+
8
+ ```bibtex
9
+ @misc{OAI:A-Fixed-Particle-Test-for-Computation-in-a-Forced-Viscous-Flow-September-27-2026,
10
+ author = {{OpenAI}},
11
+ title = {{A Fixed Particle Test for Computation in a Forced Viscous Flow}},
12
+ howpublished = {OpenAI Math Release preprint
13
+ \href{https://github.com/openai/math/blob/main/preprints/A-Fixed-Particle-Test-for-Computation-in-a-Forced-Viscous-Flow-September-27-2026/manuscript.pdf}{OAI:A-Fixed-Particle-Test-for-Computation-in-a-Forced-Viscous-Flow-September-27-2026}},
14
+ year = {2026}
15
+ }
16
+ ```
17
+
preprints/A-Fixed-Particle-Test-for-Computation-in-a-Forced-Viscous-Flow-September-27-2026/build/analytic-appendix.tex ADDED
@@ -0,0 +1,129 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \appendix
2
+ \section{Comparison on noncompact domains and Fourier identification}
3
+ The main particle theorem is already complete. We record two analytic
4
+ details separately: a comparison theorem with precise noncompact
5
+ pressure assumptions, useful for other prescribed flows, and the
6
+ elementary Fourier uniqueness argument used in the periodic projection.
7
+
8
+ \subsection{The precise comparison class}\label{app:comparison}
9
+ Let $\Omega$ be $\T^3$, $\R^3$, or
10
+ $\R^2\times\T$. A classical solution on $[0,T]$ has continuous
11
+ $u$, $u_t$, all spatial derivatives of $u$ through order two, $p$, and
12
+ $\nabla p$ on the closed time cylinder, and satisfies the equation
13
+ pointwise. In the noncompact cases we additionally require
14
+ \begin{equation}\label{eq:energy-class}
15
+ \begin{gathered}
16
+ u\in C([0,T];H^2(\Omega))\cap C^1([0,T];L^2(\Omega)),
17
+ \qquad p\in C([0,T];H^1(\Omega)),\\
18
+ \sup_{[0,T]\times\Omega}(|u|+|\nabla u|)<\infty.
19
+ \end{gathered}
20
+ \end{equation}
21
+ The Sobolev spaces are periodic in the torus coordinates. On $\T^3$
22
+ the pressure has mean zero; on the noncompact domains its $H^1$
23
+ membership fixes the representative, since a nonzero spatial constant
24
+ is not in $L^2$.
25
+
26
+ \begin{lemma}[Prescribed motion and uniqueness]\label{lem:realization}
27
+ Fix $\nu>0$ and $\Omega\in\{\T^3,\R^3,\R^2\times\T\}$.
28
+ Let $U$ be smooth and divergence free on $[0,\infty)\times\Omega$,
29
+ with $U(0)=0$, and suppose $U$ and $\nabla U$ are bounded on every
30
+ finite closed time cylinder. In the noncompact cases assume the
31
+ velocity conditions in \eqref{eq:energy-class}. Then the force
32
+ \[
33
+ \mathcal F_\nu[U]=U_t+(U\cdot\nabla)U-\nu\Delta U
34
+ \]
35
+ has the solution $(u,p)=(U,0)$, unique in the classical class just
36
+ defined on each finite time interval. Its material trajectories exist
37
+ uniquely for every finite time. On $\T^3$, mean-zero $U$ gives
38
+ mean-zero $\mathcal F_\nu[U]$.
39
+
40
+ More generally, if an independently constructed pair $(U,P)$ is a
41
+ classical solution in the same class for a given force and initial
42
+ velocity, it is the unique solution for those data in that class.
43
+ In either noncompact uniqueness statement, the competitor's gradient
44
+ bound can be omitted while keeping its bounded velocity and all other
45
+ conditions. The reference velocity $U$ still has bounded gradient.
46
+ For smooth $U$, each finite-time material map $\Phi_t$ is a smooth
47
+ diffeomorphism and satisfies
48
+ \[
49
+ U(t,\cdot)=(\partial_t\Phi_t)\circ\Phi_t^{-1},\qquad
50
+ \partial_{tt}\Phi_t(a)
51
+ =(f-\nabla P+\nu\Delta U)(t,\Phi_t(a)).
52
+ \]
53
+ \end{lemma}
54
+ \begin{proof}
55
+ Substitution proves the residual assertion. For either uniqueness
56
+ statement, let $(v,p)$ be another solution for the same data, and set
57
+ $w=v-U$ and $q=p-P$. Subtracting the equations gives
58
+ \[
59
+ w_t+(v\cdot\nabla)w+(w\cdot\nabla)U
60
+ =-\nabla q+\nu\Delta w,\qquad \diver w=0.
61
+ \]
62
+ On the torus, multiplication by $w$ and periodic integration give
63
+ \begin{equation}\label{eq:energy-comparison}
64
+ \frac12\frac{d}{dt}\|w\|_2^2+\nu\|\nabla w\|_2^2
65
+ \leq\|\nabla U(t)\|_{\infty,\mathrm{op}}\|w\|_2^2.
66
+ \end{equation}
67
+ The transport and pressure integrals vanish by incompressibility.
68
+
69
+ Here are the cutoff details on the other two domains. Let $x'$ denote
70
+ the noncompact coordinates, choose $0\leq\zeta\leq1$ smooth with
71
+ compact support, equal to one on $|x'|\leq1$, and set
72
+ $\zeta_R(x')=\zeta(x'/R)$. Multiply the difference equation by
73
+ $\zeta_Rw$ and integrate in all coordinates. Integration by parts
74
+ leaves, besides the term $-\int\zeta_Rw\cdot(w\cdot\nabla)U$,
75
+ three boundary errors. Their absolute values are at most
76
+ \[
77
+ \frac C R\|v\|_\infty\|w\|_2^2,\qquad
78
+ \frac C R\|q\|_2\|w\|_2,\qquad
79
+ \frac {C\nu}R\|\nabla w\|_2\|w\|_2,
80
+ \]
81
+ respectively for transport, pressure, and viscosity. For example,
82
+ the pressure term is $\int q\nabla\zeta_R\cdot w$ because
83
+ $\diver w=0$. Each displayed norm is uniformly bounded on $[0,T]$
84
+ by \eqref{eq:energy-class}. Also $w\in C^1([0,T];L^2)$
85
+ justifies differentiating $\int\zeta_R|w|^2$. Integrate the identity
86
+ between any two times and then let $R\to\infty$. Dominated
87
+ convergence applies to the quadratic terms and the error integrals
88
+ tend to zero. This gives \eqref{eq:energy-comparison} in integrated
89
+ form, equivalently almost everywhere in time. Thus no decay of the
90
+ pressure beyond the stated $C_tH^1$ condition has been assumed.
91
+
92
+ On every finite interval the coefficient in
93
+ \eqref{eq:energy-comparison} is bounded. Its integrating factor and
94
+ $w(0)=0$ imply $w=0$. The equation then gives $\nabla q=0$;
95
+ the mean-zero or $H^1$ pressure convention gives $q=0$.
96
+ The estimates use boundedness of $v$ but never a bound on $\nabla v$,
97
+ which proves the stated competitor extension.
98
+
99
+ Finally, bounded spatial gradient gives a uniformly Lipschitz vector
100
+ field on each finite time interval, so the material ODE has unique
101
+ local solutions. Bounded velocity prevents escape to infinity in
102
+ finite time. Successive local solutions therefore cover each finite
103
+ interval, and periodic coordinates descend to their quotients.
104
+ Solving the same ODE backwards on $[0,t]$ gives the inverse map.
105
+ Smooth dependence on the initial point proves the diffeomorphism
106
+ assertion; differentiating the trajectory equation proves the two
107
+ displayed identities.
108
+ For the mean assertion, integrate the residual: the integrals of
109
+ $\Delta U$ and $(U\cdot\nabla)U=\diver(U\otimes U)$ vanish on
110
+ the torus.
111
+ \end{proof}
112
+
113
+
114
+ \subsection{Identifying continuous periodic functions}\label{app:fourier}
115
+ A continuous function on $\T^3$ is determined by its Fourier
116
+ coefficients. Here is the approximate-identity argument used in
117
+ Lemma~\ref{lem:projection}.
118
+
119
+ In one variable,
120
+ \[
121
+ F_N(s)=\frac1N\left|\sum_{j=0}^{N-1}e^{2\pi i js}\right|^2
122
+ \]
123
+ is nonnegative, has integral one, and has Fourier coefficients
124
+ $(1-|k|/N)_+$. Outside any fixed neighborhood of the integers,
125
+ the geometric-sum formula bounds $F_N$ by $C/N$. Hence the product
126
+ of three such kernels has mass tending to one in every neighborhood
127
+ of zero. Uniform continuity shows that convolution with this product
128
+ converges uniformly to any continuous function on $\T^3$.
129
+ Vanishing Fourier coefficients therefore imply a vanishing function.
preprints/A-Fixed-Particle-Test-for-Computation-in-a-Forced-Viscous-Flow-September-27-2026/build/analytic-tools.tex ADDED
@@ -0,0 +1,109 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \subsection{Uniqueness for the constructed torus flow}
2
+ The residual identity gives the solution. We now show that its particle
3
+ event is determined by the force and initial data. The proof is the
4
+ classical difference-energy comparison \cite[Section~18]{Leray}.
5
+ If $(v,p)$ is another solution in the classical class of
6
+ Section~\ref{sec:statement}, set $w=v-U$. Subtraction gives
7
+ \[
8
+ w_t+(v\cdot\nabla)w+(w\cdot\nabla)U
9
+ =-\nabla p+\nu\Delta w,\qquad \diver w=0.
10
+ \]
11
+ Multiplication by $w$ and periodic integration by parts yield
12
+ \[
13
+ \frac12\frac{d}{dt}\|w\|_2^2+\nu\|\nabla w\|_2^2
14
+ \leq\|\nabla U\|_{\infty,\mathrm{op}}\|w\|_2^2.
15
+ \]
16
+ The stated continuity of $v_t$, the first two spatial derivatives and
17
+ pressure gradient justifies all these operations. The transport and
18
+ pressure terms vanish by incompressibility. Boundedness of $\nabla U$
19
+ on each finite interval and $w(0)=0$ give $w=0$ by Gronwall's
20
+ inequality. The equation then gives $\nabla p=0$, and mean-zero
21
+ normalization gives $p=0$. Smoothness and bounded spatial gradient on
22
+ the compact torus give a unique material flow through every finite
23
+ time. Thus the event already proved for $U$ belongs to the unique
24
+ fluid solution. Appendix~\ref{app:comparison} supplies the corresponding
25
+ noncompact comparison theorem and the finite-time flow identities.
26
+
27
+ \subsection{Solenoidal forcing with the same velocity}
28
+ The Helmholtz--Leray projection removes the divergence of the force.
29
+ Because it changes a gradient, it also changes the pressure. The
30
+ following quantitative version is useful both for the present
31
+ $L^2$ bounds and for other time profiles.
32
+
33
+ \begin{lemma}[Effective periodic projection]\label{lem:projection}
34
+ Let $g$ be a smooth mean-zero vector field on
35
+ $[0,\infty)\times\T^3$, effectively evaluable together with all
36
+ mixed derivatives and with effective bounds for those derivatives
37
+ on every finite time interval. There is a unique smooth mean-zero
38
+ $\phi$ satisfying $\Delta\phi=\diver g$. Both $\phi$ and
39
+ $g_{\rm sol}=g-\nabla\phi$ are effective, and $g_{\rm sol}$ is
40
+ divergence free and mean zero. For every $h\geq0$ and spatial
41
+ multi-index $\mu$,
42
+ \begin{equation}\label{eq:projection-estimate}
43
+ \|\partial_t^h\partial_X^\mu\nabla\phi(t)\|_\infty
44
+ \leq C_\mu\max_{1\leq i\leq3}
45
+ \|\partial_t^h\partial_{X_i}^{|\mu|+5}g(t)\|_\infty.
46
+ \end{equation}
47
+ Thus, when all mixed derivatives of $g$ are bounded, square-integrable
48
+ in time in spatial supremum norm, or rapidly decaying, the same
49
+ property holds for $g_{\rm sol}$. Here rapid decay means a finite
50
+ supremum after multiplication by $(1+t)^A$, for every $A\geq0$ and
51
+ every fixed derivative order. Time periodicity and stationarity
52
+ after a given time are also preserved. If $(U,P)$ solves the equation
53
+ with force $g$, then it solves it with force $g_{\rm sol}$ and
54
+ pressure $P-\phi$.
55
+ More precisely, any common pointwise time weight on the finitely many
56
+ derivatives on the right of \eqref{eq:projection-estimate} passes to
57
+ the derivative on its left. Thus a specified polynomial bound is
58
+ preserved whenever those higher spatial derivatives have that bound.
59
+ \end{lemma}
60
+ \begin{proof}
61
+ For the Fourier basis $e^{2\pi i k\cdot X}$ set
62
+ \[
63
+ \widehat\phi(k)=-\frac{i k\cdot\widehat g(k)}{2\pi|k|^2}
64
+ \quad(k\ne0),\qquad \widehat\phi(0)=0.
65
+ \]
66
+ The multiplier for $\nabla\phi$ is $kk^{\mathsf T}/|k|^2$,
67
+ whose operator norm is one. For a derivative of order $r$, integrate
68
+ the coefficients of $\partial_t^hg$ by parts $r+5$ times in a
69
+ coordinate with maximal $|k_i|$. A term of the differentiated series
70
+ is bounded by a fixed multiple of $|k|^{-5}$ times the right-hand
71
+ derivative norm in \eqref{eq:projection-estimate}. There are
72
+ $O(n^2)$ points in the shell $\|k\|_\infty=n$. The series and its
73
+ derivatives therefore converge absolutely, with an explicit tail
74
+ bounded by $C\sum_{n>K}n^{-3}$. The series for $\phi$ has one
75
+ further factor $|k|^{-1}$. Termwise differentiation proves the
76
+ Poisson equation; the Fourier coefficients also prove uniqueness
77
+ among mean-zero solutions and establish
78
+ \eqref{eq:projection-estimate}.
79
+
80
+ The Fourier identification used here is justified in
81
+ Appendix~\ref{app:fourier}. Since $g$ is real,
82
+ $\widehat\phi(-k)=\overline{\widehat\phi(k)}$, so $\phi$ is real.
83
+
84
+ Riemann sums with a bound on one more spatial derivative compute
85
+ each coefficient to any requested error. Combined with the tail
86
+ estimate, this gives effective evaluation of every derivative.
87
+ The estimate is pointwise in time and commutes with time
88
+ derivatives, so it proves each stated norm and weighted-decay
89
+ assertion. Linearity and uniqueness of the mean-zero Poisson
90
+ solution preserve periodicity and eventual stationarity. Finally,
91
+ \[
92
+ -\nabla(P-\phi)+(g-\nabla\phi)=-\nabla P+g,
93
+ \]
94
+ which proves the pressure formula.
95
+ Conversely, a classical solution with force $g_{\rm sol}$ and pressure
96
+ $p$ solves the equation with force $g$ and pressure $p+\phi$.
97
+ This correspondence preserves the normalized classical class on the
98
+ torus, since $\phi$ is smooth and mean zero. It therefore preserves
99
+ uniqueness for fixed initial data, as well as the reference velocity.
100
+ \end{proof}
101
+
102
+ To apply Lemma~\ref{lem:projection} to the force in \eqref{eq:force},
103
+ we still need to verify its effective-evaluation hypotheses. The next
104
+ subsection supplies them and completes the optional solenoidal
105
+ construction. This periodic projection does not assert preservation
106
+ of compact support on a Euclidean domain, nor does it preserve
107
+ pressure zero.
108
+
109
+ \subsection{Effective evaluation without a simulated execution}
preprints/A-Fixed-Particle-Test-for-Computation-in-a-Forced-Viscous-Flow-September-27-2026/build/main.tex ADDED
@@ -0,0 +1,663 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \documentclass[11pt]{article}
2
+ \ifdefined\pdftrailerid\pdftrailerid{}\fi
3
+ \ifdefined\pdfinfoomitdate\pdfinfoomitdate=1\fi
4
+ \usepackage[T1]{fontenc}
5
+ \usepackage{lmodern,amsmath,amssymb,amsthm,mathtools,microtype,booktabs}
6
+ \usepackage[margin=1in]{geometry}
7
+ \usepackage{xcolor,tikz,needspace}
8
+ \usepackage{xurl}
9
+ \usetikzlibrary{arrows.meta,positioning}
10
+ \usepackage[colorlinks=true,linkcolor=blue!50!black,citecolor=blue!50!black,urlcolor=blue!50!black]{hyperref}
11
+ \hypersetup{pdftitle={A Fixed Particle Test for Computation in a Forced Viscous Flow},pdfauthor={OpenAI}}
12
+ \newtheorem{theorem}{Theorem}
13
+ \newtheorem{lemma}{Lemma}
14
+ \newtheorem{corollary}{Corollary}
15
+ \newcommand{\T}{\mathbb T}
16
+ \newcommand{\R}{\mathbb R}
17
+ \newcommand{\N}{\mathbb N}
18
+ \newcommand{\Z}{\mathbb Z}
19
+ \DeclareMathOperator{\diver}{div}
20
+ \DeclareMathOperator{\supp}{supp}
21
+ \title{A Fixed Particle Test for Computation\\ in a Forced Viscous Flow}
22
+ \author{OpenAI}
23
+ \date{September 27, 2026}
24
+ \begin{document}
25
+ \maketitle
26
+ \begin{abstract}
27
+ We construct smooth external forces for incompressible Navier--Stokes flow
28
+ on a fixed flat three-torus at any fixed positive computable viscosity,
29
+ from zero initial velocity, such that a fixed
30
+ particle enters a fixed open set exactly when a prescribed Turing machine
31
+ halts. Every mixed derivative of the force and velocity is bounded and
32
+ square-integrable in time in spatial supremum norm. The construction uses
33
+ the machine's ordinary instructions, records their history in a third
34
+ coordinate, and compensates for finer spatial gates by longer time steps.
35
+ \end{abstract}
36
+
37
+ \section{Introduction}\label{sec:introduction}
38
+
39
+ Fix a flat three-dimensional torus, a positive viscosity, zero initial
40
+ fluid velocity, one particle label, and an open region that serves as a
41
+ detector. Can a finite program for an external force make that particle
42
+ enter the region exactly when a given Turing machine halts? The machine
43
+ and its finite input may change the force; the geometry, initial velocity,
44
+ particle label and detector remain fixed. We prove this for an explicit
45
+ family of smooth forces. The resulting reachability problem is undecidable.
46
+
47
+ The question connects computability with the dynamics of a continuous
48
+ system. Turing proved that no machine can decide whether an arbitrary
49
+ described machine ever prints a designated symbol \cite[Section~8]{Turing}.
50
+ The halting formulation used here follows by a finite modification
51
+ that halts on that event. A bounded
52
+ continuous phase space can represent such a tape by an infinite positional
53
+ expansion. Moore's generalized shifts made this connection explicit:
54
+ local symbol changes and shifts of the tape become affine operations on
55
+ real coordinates \cite{Moore1990,Moore}. Exact real coordinates supply the unbounded
56
+ information capacity; this is not a bound on what a finite-precision
57
+ measurement can recover.
58
+
59
+ A further issue arises when such operations are realized by a smooth
60
+ flow. A machine may overwrite a symbol or merge two states, whereas the
61
+ flow between two finite times is invertible. Retaining intermediate
62
+ information is a classical way to avoid this loss \cite[Section~3]{Landauer}.
63
+ Bennett gave an explicit reversible simulation that records the index of
64
+ each executed instruction on a history tape \cite[Eqs.~(9)--(11)]{Bennett}. Our construction
65
+ uses the same information-retention principle in a different setting:
66
+ a third real coordinate retains the selected branches, while two planar
67
+ coordinates execute the original, possibly irreversible machine.
68
+
69
+ Computational universality has also been realized in fluid trajectories.
70
+ Cardona, Miranda, Peralta-Salas and Presas constructed stationary Euler
71
+ flows on an adapted Riemannian three-sphere whose trajectories simulate
72
+ Turing machines \cite{CMPP}. Their proof passes through area-preserving
73
+ realizations of generalized shifts. Dyhr, Gonz\'alez-Prieto, Miranda and
74
+ Peralta-Salas subsequently obtained stationary unforced Navier--Stokes universality
75
+ using an adapted metric and Hodge viscosity \cite{DGMP}. Their velocity
76
+ is harmonic for the chosen Hodge Laplacian, so the viscous term vanishes.
77
+
78
+ Fixed-metric computation also has precedents. Cardona, Miranda and
79
+ Peralta-Salas construct universal steady Euler flows on Euclidean $\R^3$
80
+ with infinite energy, and robust tape-bounded simulations on the flat
81
+ three-torus, observed before exit from a prescribed compact region
82
+ \cite[arXiv version~3, Theorems~1 and~26]{CMPBeltrami}.
83
+ Their unforced viscous version starts from nonzero Beltrami velocity
84
+ and traverses a finite interval of its Euler trajectory, chosen to cover
85
+ the bounded computation \cite[arXiv version~3, Remark~29]{CMPBeltrami}.
86
+
87
+ Here the flat torus and viscosity are fixed in advance and the fluid
88
+ starts at rest. The
89
+ machine and input instead enter an external force prescription. These
90
+ are different choices of data for the fluid equation, and the earlier
91
+ results do not supply the construction below.
92
+
93
+ There is an elementary way to force a chosen smooth incompressible
94
+ velocity: subtract its viscous term from its material acceleration.
95
+ The mathematical work lies in choosing that velocity from the finite
96
+ instruction table. It must execute each instruction, retain the information
97
+ needed for invertibility, and avoid the detector at every intermediate
98
+ time of a nonhalting run. In particular, our force formula must prescribe
99
+ all instruction branches; it must not first execute the input computation
100
+ and then replay its trajectory.
101
+
102
+ We implement an instruction in two pulses. The first records its branch
103
+ number in the third coordinate. The second reads the newest record through
104
+ a periodic gate and applies the corresponding planar motion. Earlier
105
+ records remain present but do not affect that gate. As the history grows,
106
+ the gates have finer spatial scales. We make successive steps longer so
107
+ that the time-dependent velocity and force have square-integrable
108
+ derivatives of every fixed order.
109
+
110
+ The result concerns exact material trajectories for these explicitly
111
+ constructed forces. It gives neither a uniform perturbation tolerance
112
+ for arbitrarily long runs nor an efficient simulation-time bound. Its
113
+ existence and uniqueness proof uses the prescribed smooth velocity;
114
+ it is not a regularity theorem for general Navier--Stokes data.
115
+
116
+ \section{The statement and the history invariant}\label{sec:statement}
117
+
118
+ Write $\T=\R/\Z$ and fix a positive computable viscosity $\nu$.
119
+ For velocity $u(t,X)$, pressure $p(t,X)$ and external force $f(t,X)$,
120
+ the incompressible Navier--Stokes equations are
121
+ \begin{equation}\label{eq:NS}
122
+ \partial_tu+(u\cdot\nabla)u=-\nabla p+\nu\Delta u+f,
123
+ \qquad \diver u=0,\qquad u(0)=0
124
+ \end{equation}
125
+ on the unit flat torus $\T^3$. Pressure is periodic and has mean zero.
126
+ We write $X=(x,y,z)$ for a spatial point, use representatives in $[0,1)$
127
+ when specifying a coordinate interval, and take $\|\cdot\|_\infty$ over
128
+ space. The material flow of a smooth velocity $u$ is defined by
129
+ \[
130
+ \frac{d}{dt}\Phi_u(t,a)=u(t,\Phi_u(t,a)),\qquad \Phi_u(0,a)=a.
131
+ \]
132
+ For a label $a_*\in\T^3$ and an open set $O\subset\T^3$, the
133
+ particle event is $\Phi_u(t,a_*)\in O$ for some finite $t$.
134
+
135
+ An effective force prescription is a finite program that evaluates the
136
+ force and any requested mixed derivative at computably supplied space-time
137
+ arguments, to any prescribed rational error. It also supplies the derivative
138
+ bounds on compact sets used below. The program prescribes the transition
139
+ mechanism on all its branches; it does not compute and replay the
140
+ distinguished execution. No running-time bound is required.
141
+
142
+ A classical competitor has continuous velocity, spatial derivatives through
143
+ order two, time derivative, pressure and pressure gradient on every closed
144
+ cylinder $[0,T]\times\T^3$, with the periodicity and pressure normalization
145
+ above. The constructed solution is smooth, including all one-sided time
146
+ derivatives at zero.
147
+
148
+ \Needspace{23\baselineskip}
149
+ \begin{theorem}\label{thm:main}
150
+ There is an algorithm taking a deterministic single-tape machine $M$ and
151
+ a finite word $w$ to an effective smooth mean-zero force $f_{M,w}$ for
152
+ \eqref{eq:NS}, with the following properties.
153
+ \begin{enumerate}
154
+ \item The equation has a global smooth solution $u_{M,w}$, unique among
155
+ classical solutions on every finite time interval.
156
+ \item For every time order $h\geq0$ and spatial multi-index $\mu$, both
157
+ \[
158
+ t\longmapsto\|\partial_t^h\partial_X^\mu u_{M,w}(t)\|_\infty,
159
+ \qquad
160
+ t\longmapsto\|\partial_t^h\partial_X^\mu f_{M,w}(t)\|_\infty
161
+ \]
162
+ belong to $L^\infty(0,\infty)\cap L^2(0,\infty)$.
163
+ \item The particle initially at $a_*=(1/8,3/8,0)$ enters
164
+ \[
165
+ O=\{(x,y,z)\in\T^3:1/2<x<1\}
166
+ \]
167
+ at a finite time if and only if $M$ halts on $w$.
168
+ \end{enumerate}
169
+ The force may additionally be chosen divergence free, with unchanged
170
+ velocity and observation. Constants in the derivative estimates may
171
+ depend on $M,w,\nu$ and the derivative orders. After a loading interval,
172
+ the prescribed velocity mechanism depends on $M$ but not on $w$.
173
+ \end{theorem}
174
+
175
+ The proof has one particularly useful invariant. A branch specifies the
176
+ current state and the symbols read by one local instruction; the precise
177
+ list is given in Section~\ref{sec:planar}. Number these finitely many branches by $1,\ldots,J$ and put $\Lambda=J+1$.
178
+ If the first $n$ selected branches are $j_0,\ldots,j_{n-1}$, we will arrange
179
+ \begin{equation}\label{eq:history}
180
+ z_n=\sum_{i<n}j_i\Lambda^{-i-1}.
181
+ \end{equation}
182
+ Thus $\Lambda^n z_n$ is an integer. Translating $z$ by
183
+ $j_n\Lambda^{-n-1}$ makes its new value satisfy
184
+ \begin{equation}\label{eq:selector}
185
+ \Lambda^n z=\frac{j_n}{\Lambda}\pmod 1.
186
+ \end{equation}
187
+ A smooth periodic gate can now select instruction $j_n$. This is the
188
+ continuous history record corresponding to the transition-index record
189
+ in Bennett's reversible simulation \cite{Bennett}. The earlier
190
+ digits have become an integer and do not affect this gate. They have not
191
+ been erased: they remain in $z$, so two planar updates with overlapping
192
+ images can still represent different pasts.
193
+
194
+ We next construct the planar branches and then realize
195
+ \eqref{eq:history} by a divergence-free field. The symbols $j_n$ describe
196
+ the trajectory in the proof; they will not occur in the formula for the
197
+ force.
198
+
199
+ Here is the route through the proof. Section~\ref{sec:planar} converts each
200
+ instruction into an area-preserving planar motion and proves that it cannot
201
+ cause a false detection between nonhalting configurations.
202
+ Section~\ref{sec:recording} combines the recorder and these motions into one
203
+ smooth incompressible velocity, and proves the event equivalence.
204
+ Section~\ref{sec:force} chooses the force, establishes the derivative bounds
205
+ and uniqueness, and verifies effective evaluation without running the
206
+ machine. The Fourier projection there gives the optional solenoidal force.
207
+
208
+ A force that eventually stops changing in time poses a further question:
209
+ its spatial mechanism must keep computing without progressively changing
210
+ the gates. A separate companion gives that finite spatial mechanism
211
+ and proves eventual stationarity \cite{Stationary}. The present
212
+ proof uses the ordinary machine directly and requires no result
213
+ from that companion.
214
+
215
+ The optional comparison theorem in Appendix~\ref{app:comparison}
216
+ also applies on $\R^3$ and $\R^2\times\T$, with explicit Sobolev
217
+ and pressure assumptions for other constructed flows. The particle theorem above concerns $\T^3$ only.
218
+ For a positive viscosity that is not assumed computable, the same formulas
219
+ and estimates hold, with effective evaluation relative to the ability to
220
+ approximate that fixed viscosity. Unqualified algorithmic assertions in
221
+ this paper use the computable viscosity fixed above.
222
+
223
+ \section{A machine instruction as a planar motion}\label{sec:planar}
224
+
225
+ Our task in this section is to turn each machine instruction into a planar
226
+ motion whose entire path respects the detector. First encode the tape,
227
+ then interpolate the resulting affine update by a Hamiltonian field.
228
+
229
+ First merge designated halting states into a single state $q_h$, or
230
+ adjoin an unreachable $q_h$ if none is designated. Let $Q$ now have
231
+ $N\geq1$ states, and let the tape alphabet $\Sigma$ have $m\geq1$
232
+ letters, including a blank $\square$. Replace a missing instruction
233
+ on symbol $a$ by $(q_h,a,S)$, and give $q_h$ stationary identity
234
+ instructions. This finite normalization preserves the halting event,
235
+ including an initially halted input. The tape is a sequence $(s_i)_{i\in\Z}$ in $\Sigma$, with finitely many
236
+ nonblank cells initially. Place the input word starting at cell zero,
237
+ put blanks elsewhere, and start the head at zero in the machine's initial
238
+ state. Write
239
+ $\delta(q,a)=(q',b,D)$, where $D$ is a left move, right move or stay.
240
+
241
+ The positional coding is the generalized-shift representation of a tape
242
+ \cite[Section~1, Lemma~0]{Moore}, with gaps inserted between symbol intervals.
243
+ Give the letters the odd digits $d_a\in\{1,3,\ldots,2m-1\}$ in base
244
+ $B=2m+1$, and set
245
+ \[
246
+ v(a_0a_1\ldots)=\sum_{r\geq0}d_{a_r}B^{-r-1},
247
+ \qquad I_a=[d_a/B,(d_a+1)/B].
248
+ \]
249
+ The intervals $I_a$ are separated by gaps of length at least $1/B$.
250
+ A code lies in the interval of its first letter, and
251
+ $Bv(a\omega)-d_a=v(\omega)$ removes that letter. This proves unique
252
+ decoding. A blank tail has value $d_{\square}/(B-1)$, so all initial
253
+ codes are rational.
254
+
255
+ If the head is at cell $k$, encode the two relative tape halves by
256
+ \[
257
+ \ell=v(s_{k-1}s_{k-2}\ldots),\qquad r=v(s_ks_{k+1}\ldots).
258
+ \]
259
+ Put $\kappa=(16N)^{-1}$ and $y_0=3/8$. Enumerate nonhalting states as
260
+ $q_0,\ldots,q_{N-2}$ and choose
261
+ \[
262
+ c(q_i)=1/8+2i\kappa,\qquad c(q_h)=3/4.
263
+ \]
264
+ The planar code is $P=(c(q)+\kappa\ell,y_0+\kappa r)$. The state box
265
+ $[c(q),c(q)+\kappa]\times[y_0,y_0+\kappa]$ lies in
266
+ \[
267
+ K=[1/8,13/16]\times[3/8,7/16].
268
+ \]
269
+ Every nonhalting state box has $x\leq1/4$; the halting box has $x\geq3/4$.
270
+ These inequalities leave room for a fixed detector between the two.
271
+
272
+ Index the triples $j=(q,l,a)$ by $1,\ldots,J=Nm^2$. Here $a$ is the
273
+ letter under the head and $l$ the letter immediately to its left. Their
274
+ closed source rectangles are
275
+ \[
276
+ R_j=(c(q)+\kappa I_l)\times(y_0+\kappa I_a).
277
+ \]
278
+ They are pairwise disjoint. If $\ell_*=B\ell-d_l$ and $r_*=Br-d_a$,
279
+ the tape instruction is exactly
280
+ \begin{equation}\label{eq:branches}
281
+ \begin{array}{c|cc}
282
+ D&\ell'&r'\\ \hline
283
+ R&(d_b+\ell)/B&r_*\\
284
+ L&\ell_*&[d_l+(d_b+r_*)/B]/B\\
285
+ S&\ell&(d_b+r_*)/B.
286
+ \end{array}
287
+ \end{equation}
288
+ For example, a right move prefixes the written letter $b$ to the left
289
+ tape and removes $a$ from the right tape. A left move removes $l$ from
290
+ the left tape and prefixes $l,b$ to the old right tail. These operations
291
+ explain both entries in each row of the table.
292
+
293
+ Let $F_j$ be the resulting affine map in the physical coordinates $P$.
294
+ It maps the whole rectangle $R_j$ into the next state box, and its linear
295
+ part is $\operatorname{diag}(\lambda_j,\lambda_j^{-1})$, with
296
+ $\lambda_j=B^{-1},B,1$ respectively. Different image rectangles may
297
+ overlap. We will distinguish them by history, not by assuming that an
298
+ ordinary machine is reversible.
299
+
300
+ We have obtained the correct endpoint update. We now realize it by a
301
+ continuous motion, keeping every nonhalting-to-nonhalting path to the
302
+ left of the detector. Local area-preserving realizations of bijective generalized
303
+ shifts also occur in \cite[Proposition~5.1]{CMPP}; here a separate history
304
+ coordinate will distinguish different branches with overlapping images.
305
+
306
+ \Needspace{9\baselineskip}
307
+ Let $C_j^0,C_j^1$ be the centers of $R_j,F_j(R_j)$ and
308
+ $E_j=C_j^1-C_j^0$. For $0\leq s\leq1$ define
309
+ \[
310
+ C_j(s)=C_j^0+sE_j,\quad g_j(s)=1-s+s\lambda_j,
311
+ \quad \gamma_j(s)=\frac{\lambda_j-1}{g_j(s)},
312
+ \]
313
+ \begin{equation}\label{eq:path}
314
+ \Psi_{j,s}(P)=C_j(s)+
315
+ \operatorname{diag}(g_j(s),g_j(s)^{-1})(P-C_j^0).
316
+ \end{equation}
317
+ This path starts at $P$ and ends at $F_j(P)$. Its first coordinate is
318
+ the convex combination of the two endpoint coordinates. To control the
319
+ second coordinate, let $a$ be the source rectangle's vertical half-width.
320
+ Convexity of the reciprocal gives
321
+ \[
322
+ \frac{a}{g_j(s)}\leq(1-s)a+s\frac{a}{\lambda_j}.
323
+ \]
324
+ Together with the linear motion of the center, this keeps the entire
325
+ rectangle in $K$. In particular, an instruction with nonhalting source
326
+ and target stays in $x\leq1/4$ throughout its motion.
327
+
328
+ Choose a smooth cutoff $\chi$ equal to one on a neighborhood of $K$
329
+ and supported in the open unit square. Periodize the compactly supported
330
+ Hamiltonian
331
+ \[
332
+ H_j(s,x,y)=\chi(x,y)\bigl[
333
+ E_{j,x}(y-C_{j,y}(s))-E_{j,y}(x-C_{j,x}(s))
334
+ +\gamma_j(s)(x-C_{j,x}(s))(y-C_{j,y}(s))\bigr].
335
+ \]
336
+ The planar field $V_j=(\partial_yH_j,-\partial_xH_j)$ is divergence
337
+ free and has mean zero. On the moving rectangle its components are
338
+ $E_{j,x}+\gamma_j(x-C_{j,x})$ and
339
+ $E_{j,y}-\gamma_j(y-C_{j,y})$. Differentiating \eqref{eq:path} gives
340
+ exactly these velocities. Uniqueness for the smooth ODE therefore shows
341
+ that $V_j$ realizes the claimed path, including its intermediate-time
342
+ bound. The cutoff introduces no error there because all its derivatives
343
+ vanish on that path.
344
+
345
+ \section{Recording and selecting the instruction}\label{sec:recording}
346
+
347
+ Each instruction uses two pulses. The first reads the current source
348
+ rectangle and adds its branch number to the history; the second uses that
349
+ new digit to select the planar motion. Thus we can use the individual
350
+ motions of Section~\ref{sec:planar} even when their planar images overlap.
351
+ Figure~\ref{fig:pulses} shows one step; the formulas below implement it
352
+ simultaneously for every possible branch.
353
+
354
+ \begin{figure}[ht]
355
+ \centering
356
+ \begin{tikzpicture}[>=Latex,font=\small]
357
+ \node[draw,rounded corners,align=center,minimum width=2.15cm,minimum height=1.15cm] (start) at (0,0)
358
+ {$P\in R_j$\\$z=z_n$};
359
+ \node[draw,rounded corners,align=center,minimum width=2.8cm,minimum height=1.15cm] (record) at (4.8,0)
360
+ {$P\in R_j$\\$z=z_n+j\Lambda^{-n-1}$};
361
+ \node[draw,rounded corners,align=center,minimum width=2.8cm,minimum height=1.15cm] (end) at (10.5,0)
362
+ {$F_j(P)$\\$z=z_n+j\Lambda^{-n-1}$};
363
+ \draw[->,thick] (start) -- node[above,align=center] {record $j$} node[below] {$P$ fixed} (record);
364
+ \draw[->,thick] (record) -- node[above] {apply $\Psi_{j,s}$} node[below] {$z$ fixed} (end);
365
+ \node[align=center] at (4.8,-1.2)
366
+ {$\Lambda^n z=j/\Lambda\pmod 1$\\the new digit selects the next pulse};
367
+ \end{tikzpicture}
368
+ \caption{One simulated instruction, schematically. The first pulse leaves
369
+ both tape coordinates fixed while recording the selected branch. The
370
+ second leaves the history fixed while executing that branch's planar
371
+ motion. The diagram describes the encoded particle; planar images of
372
+ different branches need not be disjoint.}
373
+ \label{fig:pulses}
374
+ \end{figure}
375
+
376
+ We specify the cutoffs to ensure that closed rectangle boundaries are
377
+ covered. Let
378
+ \[
379
+ \rho(s)=\begin{cases}e^{-1/s},&s>0,\\0,&s\leq0,\end{cases}
380
+ \qquad \sigma(s)=\frac{\rho(s)}{\rho(s)+\rho(1-s)}.
381
+ \]
382
+ For a closed interval $I=[a,b]$, set
383
+ \[
384
+ \eta_I^\varepsilon(v)=
385
+ \sigma\!\left(\frac{2(v-a+\varepsilon)}{\varepsilon}\right)
386
+ \sigma\!\left(\frac{2(b+\varepsilon-v)}{\varepsilon}\right).
387
+ \]
388
+ The cutoff $\eta_I^\varepsilon$ equals one on a neighborhood of $I$
389
+ and vanishes outside its $\varepsilon$ enlargement. Products define
390
+ the analogous rectangle cutoffs. For the earlier Hamiltonians, choose
391
+ $\chi=\eta_K^{1/32}$; its support is strictly inside the unit square.
392
+
393
+ The source rectangles have gaps at least $\kappa/B$, so the supports in
394
+ \[
395
+ G_0(x,y)=\sum_{j=1}^Jj\eta_{R_j}^{\kappa/(4B)}(x,y)
396
+ \]
397
+ are disjoint. Periodize this function from the unit-square chart and put
398
+ \[
399
+ G(x,y)=G_0(x,y)-G_0(x,y-1/2).
400
+ \]
401
+ The original supports lie in $1/4<y<1/2$; their half-period translates
402
+ miss every $R_j$. Consequently $G=j$ on $R_j$ and $G$ has zero mean.
403
+ The correction permits a mean-zero vertical recorder without altering
404
+ the tracked computation. Define the gates by periodizing the following
405
+ bumps with period one:
406
+ \[
407
+ b_j(z)=\eta_{\{j/\Lambda\}}^{1/(4\Lambda)}(z),
408
+ \qquad \Lambda=J+1.
409
+ \]
410
+ Their supports are disjoint and each equals one near its own center.
411
+
412
+ Let $\theta(s)=\sigma(2s-1/2)$. It rises smoothly from zero to one
413
+ inside $(0,1)$ and is constant near both endpoints. Set
414
+ \[
415
+ S_n=2^{n^2},\quad t_0=1,\quad t_{n+1}=t_n+2S_n,
416
+ \qquad
417
+ \alpha_n(t)=\frac{t-t_n}{S_n},\quad
418
+ \beta_n(t)=\frac{t-t_n-S_n}{S_n}.
419
+ \]
420
+ Step $n$ has a recorder interval and an equally long planar interval.
421
+
422
+ The initial planar code $P_{\rm in}$ is rational. Let $V_{\rm load}$
423
+ be the Hamiltonian field of
424
+ \[
425
+ \chi(x,y)[(P_{{\rm in},x}-1/8)y-(P_{{\rm in},y}-3/8)x].
426
+ \]
427
+ It translates $(1/8,3/8)$ along its straight segment to $P_{\rm in}$.
428
+ Define the velocity on $[0,\infty)\times\T^3$ by
429
+ \begin{equation}\label{eq:field}
430
+ \begin{split}
431
+ U(t,x,y,z)={}&(\theta'(t)V_{\rm load}(x,y),0)\\
432
+ &+\sum_{n\geq0}\left(
433
+ \frac{\theta'(\beta_n(t))}{S_n}
434
+ \sum_{j=1}^J b_j(\Lambda^n z)
435
+ V_j(\theta(\beta_n(t)),x,y),\quad
436
+ \frac{\theta'(\alpha_n(t))}{S_n\Lambda^{n+1}}G(x,y)
437
+ \right).
438
+ \end{split}
439
+ \end{equation}
440
+ The displayed sum is a formula for all possible instructions. It has no
441
+ reference to which instruction the machine will actually select.
442
+
443
+ At any time only one stage can be active. Since $t_n\geq1+2n$, the sum
444
+ is locally finite; the zero collars make every join smooth. Multiplying
445
+ a planar divergence-free field by a function of $z$ preserves its planar
446
+ divergence, and the vertical component is independent of $z$. Thus
447
+ $\diver U=0$. Each planar field has zero planar mean, while $G$ has
448
+ zero planar mean, so $U$ has zero spatial mean. Also $U(0)=0$.
449
+
450
+ After the loader, the particle has planar coordinate $P_{\rm in}$ and
451
+ $z_0=0$. Suppose at $t_n$ it has the current planar configuration and
452
+ history \eqref{eq:history}. It belongs to exactly one source rectangle,
453
+ say $R_{j_n}$. During the recorder interval its planar coordinate stays
454
+ fixed, while integration of the last component in \eqref{eq:field}
455
+ adds $j_n\Lambda^{-n-1}$ to $z$. Equation \eqref{eq:selector} follows.
456
+ On the planar interval only $b_{j_n}$ is nonzero at this particle, and
457
+ its value is one. Its path is therefore
458
+ $\Psi_{j_n,\theta(\beta_n(t))}(P(t_n))$, ending at the next machine code.
459
+ The third coordinate stays fixed on this interval. This proves the
460
+ induction and \eqref{eq:history} for every $n$.
461
+
462
+ There is no wraparound ambiguity for the tracked history:
463
+ $0\leq z_n\leq1-\Lambda^{-n}$. At a known step its finite radix
464
+ expansion recovers every previous branch, hence every head displacement
465
+ and the absolute head position. The planar coordinates recover the
466
+ state and relative tape. This is an encoding of the computation, not
467
+ merely a halting indicator.
468
+
469
+ If the machine halts, a planar code with $x\geq3/4$ is reached after
470
+ finitely many finite stages. If it is initially halted, the loader
471
+ already reaches such a code. Conversely, for a nonhalting run the loader
472
+ stays in $x\leq1/4$, a recorder interval does not change $x$, and
473
+ \eqref{eq:path} stays in $x\leq1/4$ at every planar stage. This proves
474
+ both directions of the event equivalence at every real time.
475
+
476
+ \section{Slowing the gates and obtaining the force}\label{sec:force}
477
+
478
+ The velocity now implements the machine and gives the correct event at
479
+ every time. It remains to control its derivatives, realize it as the unique
480
+ fluid velocity, and show that the force has a finite effective prescription.
481
+
482
+ \subsection{Bounds for the prescribed velocity}
483
+
484
+ Why choose the rapidly growing stage lengths $S_n$? Differentiating a
485
+ gate $b_j(\Lambda^n z)$ $k$ times costs a factor $\Lambda^{nk}$.
486
+ The factor $S_n^{-1}$ in the velocity compensates for this at every
487
+ fixed derivative order. More precisely, for a time order $h$ and
488
+ spatial multi-index $\mu=(\mu_x,\mu_y,\mu_z)$, the fixed smooth
489
+ profiles above give, throughout step $n$,
490
+ \begin{equation}\label{eq:bounds}
491
+ \|\partial_t^h\partial_X^\mu U(t)\|_\infty
492
+ \leq C_{h,\mu}S_n^{-1-h}\Lambda^{n\mu_z}.
493
+ \end{equation}
494
+ The profiles $V_j$ and their phase derivatives are uniformly bounded
495
+ for $0\leq s\leq1$, because $g_j(s)>0$. The recorder has no $z$
496
+ dependence and has an additional small factor $\Lambda^{-n-1}$, so it
497
+ also satisfies this estimate. The constants depend on the finite table
498
+ and derivative orders but not on $n$.
499
+
500
+ The right side of \eqref{eq:bounds} is bounded, and integration over
501
+ the two intervals of length $S_n$ gives
502
+ \[
503
+ \int_1^\infty
504
+ \|\partial_t^h\partial_X^\mu U(t)\|_\infty^2\,dt
505
+ \leq 2C_{h,\mu}^2\sum_{n\geq0}
506
+ 2^{-(1+2h)n^2}\Lambda^{2n\mu_z}<\infty.
507
+ \]
508
+ The loader occupies a compact time interval and adds a finite amount.
509
+ Now prescribe
510
+ \begin{equation}\label{eq:force}
511
+ f=\partial_tU+(U\cdot\nabla)U-\nu\Delta U.
512
+ \end{equation}
513
+ Then $(u,p)=(U,0)$ solves \eqref{eq:NS}. Every mixed derivative of $f$
514
+ is a finite sum of derivatives of $U$ and products of two such
515
+ derivatives. Each factor is bounded, and each has the stated temporal
516
+ $L^2$ norm; use one bounded factor and one $L^2$ factor in a product.
517
+ All force estimates in the theorem follow. Integration of
518
+ \eqref{eq:force} over the torus gives zero mean, because $U$ has zero
519
+ mean and $(U\cdot\nabla)U=\diver(U\otimes U)$.
520
+
521
+ \input{analytic-tools}
522
+
523
+ It remains to check that the prescription really is effective. We
524
+ record the elementary fact about smooth profiles separately so that
525
+ its computational hypothesis is explicit.
526
+
527
+ \begin{lemma}[Effective smooth profiles]\label{lem:profiles}
528
+ The functions $\rho,\sigma$ defined in Section~\ref{sec:recording}
529
+ and their finite products, sums, translations, and positive rescalings
530
+ by computable parameters have effective evaluations of every derivative,
531
+ with effective derivative bounds on compact sets. A reciprocal may be
532
+ included when an effective positive lower bound for its denominator is
533
+ given. A compactly supported profile periodized through zero collars
534
+ has the same property if a rational box containing its support is
535
+ supplied. An infinite sum of such profiles has this
536
+ property on compact sets if a finite superset of all possibly active
537
+ indices can be computed there.
538
+ \end{lemma}
539
+ \begin{proof}
540
+ On $s>0$, derivatives of $\rho$ have the form $P(1/s)e^{-1/s}$,
541
+ where $P$ is an effectively computable polynomial. For $v>0$,
542
+ $v^m e^{-v}\leq(m+k)!v^{-k}$ bounds every monomial and gives an
543
+ effective neighborhood of zero where each derivative is smaller than
544
+ a requested error. Away from that neighborhood ordinary effective
545
+ arithmetic and the exponential evaluate it. This avoids deciding
546
+ whether the supplied real is exactly zero. The denominator of
547
+ $\sigma$ is at least $e^{-2}$; quotient differentiation therefore
548
+ gives effective bounds as well. The finite operations in the statement
549
+ preserve these properties by their differentiation rules.
550
+
551
+ For a profile $\psi$ with support in a supplied rational interval
552
+ $[a,b]$, obtain a rational $q$ with $|s-q|\leq1$. A translate
553
+ $\psi(s-k)$ can be nonzero only for an integer
554
+ $k\in[q-b-1,q-a+1]$. Evaluating all integers in this rational interval
555
+ therefore computes the periodization and each of its derivatives;
556
+ no integer-part computation on the real $s$ is required. The same
557
+ argument works coordinatewise for a supplied rational box.
558
+ A supplied finite active-index
559
+ bound reduces the last assertion to a finite sum. Local finiteness
560
+ without that effective bound would not suffice for this argument.
561
+ \end{proof}
562
+
563
+ All tables, rational initial codes, affine maps and stage times are
564
+ obtained from the finite input. Lemma~\ref{lem:profiles} applies to
565
+ their cutoffs and phase functions; the denominators $g_j(s)$ have the
566
+ effective positive lower bounds $\min\{1,\lambda_j\}$. The supports
567
+ of $\chi$ and the rectangle cutoffs lie in the rational coordinatewise
568
+ enlargements of $K$ by $1/32$ and of $R_j$ by $\kappa/(4B)$,
569
+ respectively. The unperiodized gate defining $b_j$ is supported in
570
+ $[(j-1/4)/\Lambda,(j+1/4)/\Lambda]$. Thus every periodization has
571
+ the supplied support enclosure required by the lemma. For a time
572
+ argument, obtain a rational
573
+ upper bound $T>t$. The inequality $t_n\geq1+2n$ gives a finite superset
574
+ of possible active stages in \eqref{eq:field}; evaluating all of them
575
+ is sufficient. Periodizations are evaluated by the same finite-superset
576
+ procedure in coordinate charts, without deciding a real argument's
577
+ integer part. The Gaussian series above gives effective norm bounds:
578
+ for example, if $n\geq4\Lambda\mu_z$, then
579
+ $\Lambda^{2n\mu_z}\leq2^{n^2/2}$.
580
+
581
+ We may now apply Lemma~\ref{lem:projection} to $f$ in
582
+ \eqref{eq:force}. It gives an effective mean-zero solenoidal force
583
+ $f-\nabla\phi$ with solution $(U,-\phi)$, the same derivative bounds,
584
+ and the same particle event. The lemma's pressure correspondence
585
+ also transfers uniqueness from the original force. Riemann sums
586
+ with derivative error bounds compute the Fourier coefficients, and
587
+ the summable tail controls truncation. Neither this procedure nor the
588
+ raw-force evaluation uses the branch sequence $j_0,j_1,\ldots$.
589
+ For $t\geq1$ the loader and all its derivatives vanish, so the raw
590
+ force depends on $M$ and $\nu$ but not on $w$. Its spatial projection
591
+ at that time has the same independence.
592
+ This completes the proof of
593
+ Theorem~\ref{thm:main}.
594
+
595
+ \begin{corollary}
596
+ No algorithm decides the fixed particle event for every force description
597
+ produced by this construction.
598
+ \end{corollary}
599
+ \begin{proof}
600
+ Compose a proposed decision procedure with the terminating compiler of
601
+ Theorem~\ref{thm:main}. The event equivalence would decide whether an
602
+ arbitrary machine halts on its finite input. This would also decide
603
+ Turing's symbol-printing problem \cite[Section~8]{Turing}: modify the
604
+ simulated machine to halt when the specified symbol is printed and
605
+ to continue forever otherwise, including if the original machine stops
606
+ without printing it. Turing proves that no such decision procedure exists.
607
+ Equivalently, one may fix a universal machine and encode the machine
608
+ and word in its finite input; the same event then tests its computation.
609
+ \end{proof}
610
+
611
+ \input{analytic-appendix}
612
+
613
+ \begin{thebibliography}{99}
614
+ \bibitem{Bennett} C.~H. Bennett, Logical reversibility of computation,
615
+ \emph{IBM J. Res. Develop.} \textbf{17} (1973), 525--532.
616
+ \href{https://doi.org/10.1147/rd.176.0525}{\nolinkurl{doi:10.1147/rd.176.0525}}.
617
+
618
+ \bibitem{CMPBeltrami} R. Cardona, E. Miranda and D. Peralta-Salas,
619
+ Computability and Beltrami fields in Euclidean space,
620
+ \emph{J. Math. Pures Appl.} \textbf{169} (2023), 50--81.
621
+ \href{https://doi.org/10.1016/j.matpur.2022.11.007}{\nolinkurl{doi:10.1016/j.matpur.2022.11.007}}.
622
+ \href{https://arxiv.org/abs/2111.03559v3}{\nolinkurl{arXiv:2111.03559v3}}.
623
+
624
+ \bibitem{CMPP} R. Cardona, E. Miranda, D. Peralta-Salas and F. Presas,
625
+ Constructing Turing complete Euler flows in dimension 3,
626
+ \emph{Proc. Natl. Acad. Sci. USA} \textbf{118} (2021), e2026818118.
627
+ \href{https://doi.org/10.1073/pnas.2026818118}{\nolinkurl{doi:10.1073/pnas.2026818118}}.
628
+
629
+ \bibitem{DGMP} S. Dyhr, \'{A}. Gonz\'alez-Prieto, E. Miranda and
630
+ D. Peralta-Salas, Turing complete Navier--Stokes steady states via
631
+ cosymplectic geometry, \emph{PNAS Nexus} \textbf{5} (2026), pgag131.
632
+ \href{https://doi.org/10.1093/pnasnexus/pgag131}{\nolinkurl{doi:10.1093/pnasnexus/pgag131}}.
633
+
634
+ \bibitem{Landauer} R. Landauer, Irreversibility and heat generation in
635
+ the computing process, \emph{IBM J. Res. Develop.} \textbf{5} (1961),
636
+ 183--191.
637
+ \href{https://doi.org/10.1147/rd.53.0183}{\nolinkurl{doi:10.1147/rd.53.0183}}.
638
+
639
+ \bibitem{Leray} J. Leray, Sur le mouvement d'un liquide visqueux
640
+ emplissant l'espace, \emph{Acta Math.} \textbf{63} (1934), 193--248.
641
+ \href{https://doi.org/10.1007/BF02547354}{\nolinkurl{doi:10.1007/BF02547354}}.
642
+
643
+ \bibitem{Moore1990} C. Moore, Unpredictability and undecidability in
644
+ dynamical systems, \emph{Phys. Rev. Lett.} \textbf{64} (1990), 2354--2357.
645
+ \href{https://doi.org/10.1103/PhysRevLett.64.2354}{\nolinkurl{doi:10.1103/PhysRevLett.64.2354}}.
646
+
647
+ \bibitem{Moore} C. Moore, Generalized shifts: unpredictability and
648
+ undecidability in dynamical systems, \emph{Nonlinearity} \textbf{4}
649
+ (1991), 199--230.
650
+ \href{https://doi.org/10.1088/0951-7715/4/2/002}{\nolinkurl{doi:10.1088/0951-7715/4/2/002}}.
651
+
652
+ \bibitem{Stationary}
653
+ OpenAI, Universal Computation with Eventually Stationary Navier--Stokes Forcing,
654
+ OpenAI Math Release preprint
655
+ \href{https://github.com/openai/math/blob/main/preprints/Universal-Computation-with-Eventually-Stationary-Navier-Stokes-Forcing-September-27-2026/manuscript.pdf}{OAI:Universal-Computation-with-Eventually-Stationary-Navier-Stokes-Forcing-September-27-2026},
656
+ 2026.
657
+
658
+ \bibitem{Turing} A.~M. Turing, On computable numbers, with an application
659
+ to the Entscheidungsproblem, \emph{Proc. London Math. Soc.} (2)
660
+ \textbf{42} (1936--1937), 230--265.
661
+ \href{https://doi.org/10.1112/plms/s2-42.1.230}{\nolinkurl{doi:10.1112/plms/s2-42.1.230}}.
662
+ \end{thebibliography}
663
+ \end{document}
preprints/A-Fixed-Particle-Test-for-Computation-in-a-Forced-Viscous-Flow-September-27-2026/manuscript.pdf ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:87defbd4577b4c8ef80cd148000ffd55e7b3d2ce296d27b04efb16aae92f8c0d
3
+ size 403452
preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/.gitignore ADDED
@@ -0,0 +1,4 @@
 
 
 
 
 
1
+ /.build/
2
+ /.paper.pdf.*
3
+ /__pycache__/
4
+ /verification/__pycache__/
preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026.pdf ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:46a8f75298d339060d7a8ed72fbb7bd52e7b85e8b39f0438be55f19ae217ec0b
3
+ size 477632
preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/README.md ADDED
@@ -0,0 +1,17 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ # [A Fock-space inequality and the Laughlin spectral gap](A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026.pdf)
2
+
3
+ **Author:** OpenAI
4
+
5
+ **Date:** September 24, 2026
6
+
7
+ ## Citation
8
+
9
+ ```bibtex
10
+ @misc{OAI:A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026,
11
+ author = {{OpenAI}},
12
+ title = {{A Fock-space inequality and the Laughlin spectral gap}},
13
+ howpublished = {OpenAI Math Release preprint
14
+ \href{https://github.com/openai/math/blob/main/preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026.pdf}{OAI:A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026}},
15
+ year = {2026}
16
+ }
17
+ ```
preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/figures/relative-transfer.tex ADDED
@@ -0,0 +1,13 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \begin{tikzpicture}[
2
+ box/.style={draw=blue!45!black,rounded corners=2pt,align=center,
3
+ text width=0.265\linewidth,inner sep=6pt,font=\small},
4
+ >={Latex[length=2mm]}, node distance=6mm]
5
+ \node[box] (limit) {\textbf{Finite limiting matrices}\\[2pt]
6
+ Exact positivity on the\\four-particle space};
7
+ \node[box,right=of limit] (local) {\textbf{Fixed set of modes}\\[2pt]
8
+ Exact change of variables;\\error bounded by pair energy};
9
+ \node[box,right=of local] (global) {\textbf{All particle sectors}\\[2pt]
10
+ Add spectator modes and\\average over rotations};
11
+ \draw[->] (limit) -- (local);
12
+ \draw[->] (local) -- (global);
13
+ \end{tikzpicture}
preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/main.tex ADDED
@@ -0,0 +1,109 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \documentclass[11pt]{article}
2
+ \ifdefined\pdftrailerid\pdftrailerid{}\fi
3
+ \input{glyphtounicode}
4
+ \pdfgentounicode=1
5
+ \pdfglyphtounicode{parenleftbig}{0028}
6
+ \pdfglyphtounicode{parenrightbig}{0029}
7
+ \pdfglyphtounicode{bracketleftbig}{005B}
8
+ \pdfglyphtounicode{bracketrightbig}{005D}
9
+ \pdfglyphtounicode{floorleftbig}{230A}
10
+ \pdfglyphtounicode{floorrightbig}{230B}
11
+ \pdfglyphtounicode{ceilingleftbig}{2308}
12
+ \pdfglyphtounicode{ceilingrightbig}{2309}
13
+ \pdfglyphtounicode{radicalbig}{221A}
14
+ \pdfglyphtounicode{parenleftBig}{0028}
15
+ \pdfglyphtounicode{parenrightBig}{0029}
16
+ \pdfglyphtounicode{bracketleftBig}{005B}
17
+ \pdfglyphtounicode{bracketrightBig}{005D}
18
+ \pdfglyphtounicode{floorleftBig}{230A}
19
+ \pdfglyphtounicode{floorrightBig}{230B}
20
+ \pdfglyphtounicode{ceilingleftBig}{2308}
21
+ \pdfglyphtounicode{ceilingrightBig}{2309}
22
+ \pdfglyphtounicode{radicalBig}{221A}
23
+ \pdfglyphtounicode{parenleftbigg}{0028}
24
+ \pdfglyphtounicode{parenrightbigg}{0029}
25
+ \pdfglyphtounicode{bracketleftbigg}{005B}
26
+ \pdfglyphtounicode{bracketrightbigg}{005D}
27
+ \pdfglyphtounicode{floorleftbigg}{230A}
28
+ \pdfglyphtounicode{floorrightbigg}{230B}
29
+ \pdfglyphtounicode{ceilingleftbigg}{2308}
30
+ \pdfglyphtounicode{ceilingrightbigg}{2309}
31
+ \pdfglyphtounicode{radicalbigg}{221A}
32
+ \pdfglyphtounicode{parenleftBigg}{0028}
33
+ \pdfglyphtounicode{parenrightBigg}{0029}
34
+ \pdfglyphtounicode{bracketleftBigg}{005B}
35
+ \pdfglyphtounicode{bracketrightBigg}{005D}
36
+ \pdfglyphtounicode{floorleftBigg}{230A}
37
+ \pdfglyphtounicode{floorrightBigg}{230B}
38
+ \pdfglyphtounicode{ceilingleftBigg}{2308}
39
+ \pdfglyphtounicode{ceilingrightBigg}{2309}
40
+ \pdfglyphtounicode{radicalBigg}{221A}
41
+ \pdfglyphtounicode{vextendsingle}{007C}
42
+ \pdfglyphtounicode{circleplustext}{2A01}
43
+ \pdfglyphtounicode{circleplusdisplay}{2A01}
44
+ \pdfglyphtounicode{summationtext}{2211}
45
+ \pdfglyphtounicode{summationdisplay}{2211}
46
+ \pdfglyphtounicode{producttext}{220F}
47
+ \pdfglyphtounicode{productdisplay}{220F}
48
+ \pdfglyphtounicode{integraltext}{222B}
49
+ \pdfglyphtounicode{integraldisplay}{222B}
50
+ \pdfglyphtounicode{logicalandtext}{22C0}
51
+ \pdfglyphtounicode{logicalanddisplay}{22C0}
52
+ \pdfglyphtounicode{hatwider}{005E}
53
+ \usepackage[T1]{fontenc}
54
+ \usepackage{lmodern}
55
+ \usepackage[utf8]{inputenc}
56
+ \usepackage[margin=1in]{geometry}
57
+ \usepackage{amsmath,amssymb,amsthm,mathtools}
58
+ \usepackage{booktabs,microtype,xcolor,listings,needspace}
59
+ \usepackage{tikz}
60
+ \usetikzlibrary{arrows.meta,positioning}
61
+ \usepackage[colorlinks=true,linkcolor=blue!45!black,citecolor=blue!45!black,urlcolor=blue!45!black]{hyperref}
62
+ \hypersetup{pdftitle={A Fock-space inequality and the Laughlin spectral gap},pdfauthor={OpenAI},pdfsubject={The full fermionic V1 interaction on the round sphere},pdfkeywords={Laughlin state, spectral gap, fractional quantum Hall effect, pseudopotential, sphere}}
63
+ \newtheorem{theorem}{Theorem}[section]
64
+ \newtheorem{proposition}[theorem]{Proposition}
65
+ \newtheorem{lemma}[theorem]{Lemma}
66
+ \newtheorem{corollary}[theorem]{Corollary}
67
+ \theoremstyle{remark}
68
+ \newtheorem{remark}[theorem]{Remark}
69
+ \newcommand{\FF}{\mathcal F}
70
+ \newcommand{\LL}{\mathcal L}
71
+ \newcommand{\ran}{\operatorname{ran}}
72
+ \newcommand{\tr}{\operatorname{tr}}
73
+ \newcommand{\diag}{\operatorname{diag}}
74
+ \newcommand{\eps}{\varepsilon}
75
+ \newcommand{\ket}[1]{\lvert #1\rangle}
76
+ \newcommand{\bra}[1]{\langle #1\rvert}
77
+ \newcommand{\ip}[2]{\langle #1,#2\rangle}
78
+ \newcommand{\norm}[1]{\lVert #1\rVert}
79
+ \lstset{basicstyle=\ttfamily\scriptsize,columns=fullflexible,keepspaces=true,breaklines=true,frame=single}
80
+ \title{A Fock-space inequality and the Laughlin spectral gap}
81
+ \author{OpenAI}
82
+ \date{September 24, 2026}
83
+ \AddToHook{env/theorem/before}{\Needspace{4\baselineskip}}
84
+ \AddToHook{env/proposition/before}{\Needspace{4\baselineskip}}
85
+ \AddToHook{env/lemma/before}{\Needspace{4\baselineskip}}
86
+ \AddToHook{env/corollary/before}{\Needspace{4\baselineskip}}
87
+ \begin{document}
88
+ \maketitle
89
+ \begin{abstract}
90
+ We prove the spherical fermionic Laughlin spectral-gap conjecture for the
91
+ full \(V_1\) interaction. With coefficient one for each pair projector,
92
+ the gap above the Laughlin state at filling \(1/3\) on the round sphere
93
+ is at least \(1/25\) for all sufficiently large systems.
94
+ More generally, \(H_Q^2\ge\gamma H_Q\) for some fixed \(\gamma>1/25\)
95
+ on the entire lowest-Landau-level Fock space for all sufficiently large
96
+ flux \(Q\), independently of particle number.
97
+ \end{abstract}
98
+ \input{sections/01-introduction}
99
+ \input{sections/02-operators}
100
+ \input{sections/03-spin}
101
+ \input{sections/04-comparison}
102
+ \input{sections/05-transfer}
103
+ \input{sections/06-gap}
104
+ \input{sections/07-plane}
105
+ \appendix
106
+ \input{sections/08-arithmetic}
107
+ \bibliographystyle{plain}
108
+ \bibliography{references}
109
+ \end{document}
preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/references.bib ADDED
@@ -0,0 +1,329 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ @article{Laughlin,
2
+ author = {Laughlin, Robert B.},
3
+ title = {Anomalous quantum {Hall} effect: an incompressible quantum fluid with fractionally charged excitations},
4
+ journal = {Physical Review Letters},
5
+ volume = {50},
6
+ number = {18},
7
+ pages = {1395--1398},
8
+ year = {1983},
9
+ note = {\href{https://doi.org/10.1103/PhysRevLett.50.1395}{doi:10.1103/PhysRevLett.50.1395}},
10
+ doi = {10.1103/PhysRevLett.50.1395},
11
+ url = {https://doi.org/10.1103/PhysRevLett.50.1395}
12
+ }
13
+
14
+ @article{Haldane,
15
+ author = {Haldane, F. D. M.},
16
+ title = {Fractional quantization of the {Hall} effect: a hierarchy of incompressible quantum fluid states},
17
+ journal = {Physical Review Letters},
18
+ volume = {51},
19
+ number = {7},
20
+ pages = {605--608},
21
+ year = {1983},
22
+ note = {\href{https://doi.org/10.1103/PhysRevLett.51.605}{doi:10.1103/PhysRevLett.51.605}},
23
+ doi = {10.1103/PhysRevLett.51.605},
24
+ url = {https://doi.org/10.1103/PhysRevLett.51.605}
25
+ }
26
+
27
+ @article{Rougerie,
28
+ author = {Rougerie, Nicolas},
29
+ title = {On the {Laughlin} function and its perturbations},
30
+ journal = {S{\'e}minaire Laurent Schwartz --- EDP et applications},
31
+ year = {2018--2019},
32
+ pages = {1--17},
33
+ note = {Exp.~II. \href{https://doi.org/10.5802/slsedp.131}{doi:10.5802/slsedp.131}},
34
+ doi = {10.5802/slsedp.131},
35
+ url = {https://doi.org/10.5802/slsedp.131},
36
+ eprint = {1906.11656},
37
+ archivePrefix = {arXiv}
38
+ }
39
+
40
+ @article{NWY,
41
+ author = {Nachtergaele, Bruno and Warzel, Simone and Young, Amanda},
42
+ title = {Spectral gaps and incompressibility in a {$\nu=1/3$} fractional quantum {Hall} system},
43
+ journal = {Communications in Mathematical Physics},
44
+ volume = {383},
45
+ pages = {1093--1149},
46
+ year = {2021},
47
+ note = {\href{https://doi.org/10.1007/s00220-021-03997-0}{doi:10.1007/s00220-021-03997-0}},
48
+ doi = {10.1007/s00220-021-03997-0},
49
+ url = {https://doi.org/10.1007/s00220-021-03997-0},
50
+ eprint = {2004.04992},
51
+ archivePrefix = {arXiv}
52
+ }
53
+
54
+ @article{WY,
55
+ author = {Warzel, Simone and Young, Amanda},
56
+ title = {The spectral gap of a fractional quantum {Hall} system on a thin torus},
57
+ journal = {Journal of Mathematical Physics},
58
+ volume = {63},
59
+ number = {4},
60
+ pages = {041901},
61
+ year = {2022},
62
+ note = {\href{https://doi.org/10.1063/5.0084677}{doi:10.1063/5.0084677}},
63
+ doi = {10.1063/5.0084677},
64
+ url = {https://doi.org/10.1063/5.0084677},
65
+ eprint = {2112.13764},
66
+ archivePrefix = {arXiv}
67
+ }
68
+
69
+ @article{Knabe,
70
+ author = {Knabe, Stefan},
71
+ title = {Energy gaps and elementary excitations for certain {VBS}-quantum antiferromagnets},
72
+ journal = {Journal of Statistical Physics},
73
+ volume = {52},
74
+ pages = {627--638},
75
+ year = {1988},
76
+ note = {\href{https://doi.org/10.1007/BF01019721}{doi:10.1007/BF01019721}},
77
+ doi = {10.1007/BF01019721},
78
+ url = {https://doi.org/10.1007/BF01019721}
79
+ }
80
+
81
+ @article{Cruz,
82
+ author = {Cruz, Esther and Baccari, Flavio and Tura, Jordi and Schuch, Norbert and Cirac, J. Ignacio},
83
+ title = {Preparation and verification of tensor network states},
84
+ journal = {Physical Review Research},
85
+ volume = {4},
86
+ pages = {023161},
87
+ year = {2022},
88
+ note = {\href{https://doi.org/10.1103/PhysRevResearch.4.023161}{doi:10.1103/PhysRevResearch.4.023161}},
89
+ doi = {10.1103/PhysRevResearch.4.023161},
90
+ url = {https://doi.org/10.1103/PhysRevResearch.4.023161},
91
+ eprint = {2105.06866},
92
+ archivePrefix = {arXiv}
93
+ }
94
+
95
+ @article{Rai,
96
+ author = {Rai, Kshiti Sneh and Kull, Ilya and Emonts, Patrick and Tura, Jordi and Schuch, Norbert and Baccari, Flavio},
97
+ title = {A hierarchy of spectral gap certificates for frustration-free spin systems},
98
+ journal = {Quantum},
99
+ volume = {10},
100
+ pages = {2065},
101
+ year = {2026},
102
+ note = {\href{https://doi.org/10.22331/q-2026-04-13-2065}{doi:10.22331/q-2026-04-13-2065}},
103
+ doi = {10.22331/q-2026-04-13-2065},
104
+ url = {https://doi.org/10.22331/q-2026-04-13-2065},
105
+ eprint = {2411.03680},
106
+ archivePrefix = {arXiv}
107
+ }
108
+
109
+ @article{TrugmanKivelson1985,
110
+ author = {Trugman, S. A. and Kivelson, S.},
111
+ title = {Exact results for the fractional quantum {Hall} effect with general interactions},
112
+ journal = {Physical Review B},
113
+ volume = {31}, number = {8}, pages = {5280--5284}, year = {1985},
114
+ doi = {10.1103/PhysRevB.31.5280},
115
+ note = {\href{https://doi.org/10.1103/PhysRevB.31.5280}{doi:10.1103/PhysRevB.31.5280}}
116
+ }
117
+
118
+ @article{HaldaneRezayi1985FiniteSize,
119
+ author = {Haldane, F. D. M. and Rezayi, E. H.},
120
+ title = {Finite-Size Studies of the Incompressible State of the Fractionally Quantized {Hall} Effect and its Excitations},
121
+ journal = {Physical Review Letters},
122
+ year = {1985},
123
+ volume = {54},
124
+ number = {3},
125
+ pages = {237--240},
126
+ month = jan,
127
+ doi = {10.1103/PhysRevLett.54.237},
128
+ url = {https://doi.org/10.1103/PhysRevLett.54.237},
129
+ note = {\href{https://doi.org/10.1103/PhysRevLett.54.237}{doi:10.1103/PhysRevLett.54.237}}
130
+ }
131
+
132
+ @article{GMP,
133
+ author = {Girvin, S. M. and MacDonald, A. H. and Platzman, P. M.},
134
+ title = {Magneto-roton theory of collective excitations in the fractional quantum {Hall} effect},
135
+ journal = {Physical Review B},
136
+ volume = {33},
137
+ number = {4},
138
+ pages = {2481--2494},
139
+ year = {1986},
140
+ doi = {10.1103/PhysRevB.33.2481},
141
+ url = {https://doi.org/10.1103/PhysRevB.33.2481},
142
+ note = {\href{https://doi.org/10.1103/PhysRevB.33.2481}{doi:10.1103/PhysRevB.33.2481}}
143
+ }
144
+
145
+ @article{LRYRigidity,
146
+ author = {Lieb, Elliott H. and Rougerie, Nicolas and Yngvason, Jakob},
147
+ title = {Rigidity of the {Laughlin} Liquid},
148
+ journal = {Journal of Statistical Physics},
149
+ volume = {172},
150
+ pages = {544--554},
151
+ year = {2018},
152
+ doi = {10.1007/s10955-018-2082-1},
153
+ url = {https://doi.org/10.1007/s10955-018-2082-1},
154
+ eprint = {1609.03818},
155
+ archivePrefix = {arXiv},
156
+ note = {\href{https://doi.org/10.1007/s10955-018-2082-1}{doi:10.1007/s10955-018-2082-1}}
157
+ }
158
+
159
+ @article{ChenSeidel2015,
160
+ author = {Chen, Li and Seidel, Alexander},
161
+ title = {Algebraic approach to the study of zero modes of {Haldane} pseudopotentials},
162
+ journal = {Physical Review B}, volume = {91}, pages = {085103}, year = {2015},
163
+ doi = {10.1103/PhysRevB.91.085103},
164
+ eprint = {1409.3569}, archivePrefix = {arXiv}, primaryClass = {cond-mat.str-el},
165
+ note = {\href{https://doi.org/10.1103/PhysRevB.91.085103}{doi:10.1103/PhysRevB.91.085103}}
166
+ }
167
+
168
+ @article{MazaheriOrtizNussinovSeidel2015,
169
+ author = {Mazaheri, Tahereh and Ortiz, Gerardo and Nussinov, Zohar and Seidel, Alexander},
170
+ title = {Zero modes, bosonization, and topological quantum order: The {Laughlin} state in second quantization},
171
+ journal = {Physical Review B}, volume = {91}, pages = {085115}, year = {2015},
172
+ doi = {10.1103/PhysRevB.91.085115},
173
+ eprint = {1409.3577}, archivePrefix = {arXiv}, primaryClass = {cond-mat.str-el},
174
+ note = {\href{https://doi.org/10.1103/PhysRevB.91.085115}{doi:10.1103/PhysRevB.91.085115}}
175
+ }
176
+
177
+ @article{NakamuraWangBergholtz2012,
178
+ author = {Nakamura, Masaaki and Wang, Zheng-Yuan and Bergholtz, Emil J.},
179
+ title = {Exactly Solvable Fermion Chain Describing a {$\nu=1/3$} Fractional Quantum {Hall} State},
180
+ journal = {Physical Review Letters}, volume = {109}, number = {1},
181
+ pages = {016401}, year = {2012}, doi = {10.1103/PhysRevLett.109.016401},
182
+ eprint = {1110.5033}, archivePrefix = {arXiv},
183
+ url = {https://doi.org/10.1103/PhysRevLett.109.016401},
184
+ note = {\href{https://doi.org/10.1103/PhysRevLett.109.016401}{doi:10.1103/PhysRevLett.109.016401}}
185
+ }
186
+
187
+ @article{WangNakamura2013,
188
+ author = {Wang, Zheng-Yuan and Nakamura, Masaaki},
189
+ title = {One-dimensional lattice model with an exact matrix-product ground state describing the {Laughlin} wave function},
190
+ journal = {Physical Review B}, volume = {87},
191
+ pages = {245119}, year = {2013}, doi = {10.1103/PhysRevB.87.245119},
192
+ eprint = {1206.3071}, archivePrefix = {arXiv},
193
+ url = {https://doi.org/10.1103/PhysRevB.87.245119},
194
+ note = {\href{https://doi.org/10.1103/PhysRevB.87.245119}{doi:10.1103/PhysRevB.87.245119}}
195
+ }
196
+
197
+ @article{Jansen2012,
198
+ author = {Jansen, Sabine},
199
+ title = {Fermionic and bosonic {Laughlin} state on thick cylinders},
200
+ journal = {Journal of Mathematical Physics}, volume = {53},
201
+ pages = {123306}, year = {2012}, doi = {10.1063/1.4768250},
202
+ eprint = {1109.4022}, archivePrefix = {arXiv},
203
+ url = {https://doi.org/10.1063/1.4768250},
204
+ note = {\href{https://doi.org/10.1063/1.4768250}{doi:10.1063/1.4768250}}
205
+ }
206
+
207
+ @article{WarzelYoung2023BulkEdge,
208
+ author = {Warzel, Simone and Young, Amanda},
209
+ title = {A Bulk Spectral Gap in the Presence of Edge States for a Truncated Pseudopotential},
210
+ journal = {Annales Henri Poincar\'e}, volume = {24},
211
+ pages = {133--178}, year = {2023}, doi = {10.1007/s00023-022-01210-z},
212
+ eprint = {2108.10794}, archivePrefix = {arXiv},
213
+ url = {https://doi.org/10.1007/s00023-022-01210-z},
214
+ note = {\href{https://doi.org/10.1007/s00023-022-01210-z}{doi:10.1007/s00023-022-01210-z}}
215
+ }
216
+
217
+ @article{LemmNachtergaeleWarzelYoung2026Recursive,
218
+ author = {Lemm, Marius and Nachtergaele, Bruno and Warzel, Simone and Young, Amanda},
219
+ title = {Recursive spectral relations and the charge vs neutral gap in fractional quantum {Hall} systems},
220
+ journal = {Journal of Mathematical Physics},
221
+ volume = {67},
222
+ number = {1},
223
+ pages = {011901},
224
+ year = {2026},
225
+ month = jan,
226
+ doi = {10.1063/5.0292975},
227
+ url = {https://doi.org/10.1063/5.0292975},
228
+ eprint = {2507.18814},
229
+ archivePrefix = {arXiv},
230
+ primaryClass = {math-ph},
231
+ note = {\href{https://doi.org/10.1063/5.0292975}{doi:10.1063/5.0292975}}
232
+ }
233
+
234
+ @misc{SchravenWarzel2026IMPS,
235
+ author = {Schraven, Severin and Warzel, Simone},
236
+ title = {Fractional Quantum {Hall} States: Infinite Matrix Product Representation and its Implications},
237
+ year = {2026},
238
+ eprint = {2601.12165},
239
+ archivePrefix = {arXiv},
240
+ primaryClass = {math-ph},
241
+ note = {\href{https://arxiv.org/abs/2601.12165v1}{arXiv:2601.12165v1}, January 17, 2026},
242
+ doi = {10.48550/arXiv.2601.12165},
243
+ url = {https://arxiv.org/abs/2601.12165}
244
+ }
245
+
246
+ @article{OrtizNussinovDukelskySeidel,
247
+ author = {Ortiz, G. and Nussinov, Z. and Dukelsky, J. and Seidel, A.},
248
+ title = {Repulsive interactions in quantum {Hall} systems as a pairing problem},
249
+ journal = {Physical Review B},
250
+ volume = {88},
251
+ pages = {165303},
252
+ year = {2013},
253
+ doi = {10.1103/PhysRevB.88.165303},
254
+ url = {https://doi.org/10.1103/PhysRevB.88.165303},
255
+ eprint = {1306.3268},
256
+ archivePrefix = {arXiv},
257
+ note = {\href{https://doi.org/10.1103/PhysRevB.88.165303}{doi:10.1103/PhysRevB.88.165303}}
258
+ }
259
+
260
+ @article{Wick,
261
+ author = {Wick, G. C.},
262
+ title = {The Evaluation of the Collision Matrix},
263
+ journal = {Physical Review},
264
+ volume = {80},
265
+ number = {2},
266
+ pages = {268--272},
267
+ year = {1950},
268
+ doi = {10.1103/PhysRev.80.268},
269
+ url = {https://doi.org/10.1103/PhysRev.80.268},
270
+ note = {\href{https://doi.org/10.1103/PhysRev.80.268}{doi:10.1103/PhysRev.80.268}}
271
+ }
272
+
273
+ @article{BartlettRudolphSpekkens,
274
+ author = {Bartlett, Stephen D. and Rudolph, Terry and Spekkens, Robert W.},
275
+ title = {Reference frames, superselection rules, and quantum information},
276
+ journal = {Reviews of Modern Physics},
277
+ volume = {79},
278
+ pages = {555--609},
279
+ year = {2007},
280
+ doi = {10.1103/RevModPhys.79.555},
281
+ url = {https://doi.org/10.1103/RevModPhys.79.555},
282
+ note = {\href{https://doi.org/10.1103/RevModPhys.79.555}{doi:10.1103/RevModPhys.79.555}}
283
+ }
284
+
285
+ @article{PeyrlParrilo,
286
+ author = {Peyrl, Helfried and Parrilo, Pablo A.},
287
+ title = {Computing sum of squares decompositions with rational coefficients},
288
+ journal = {Theoretical Computer Science},
289
+ volume = {409},
290
+ number = {2},
291
+ pages = {269--281},
292
+ year = {2008},
293
+ doi = {10.1016/j.tcs.2008.09.025},
294
+ url = {https://doi.org/10.1016/j.tcs.2008.09.025},
295
+ note = {\href{https://doi.org/10.1016/j.tcs.2008.09.025}{doi:10.1016/j.tcs.2008.09.025}}
296
+ }
297
+
298
+ @inproceedings{HouConference,
299
+ author = {Hou, Shui-Hung},
300
+ title = {On the {Leverrier--Faddeev} Algorithm},
301
+ booktitle = {Electronic Proceedings of the Third Asian Technology Conference in Mathematics},
302
+ year = {1998},
303
+ url = {https://atcm.mathandtech.org/EP/1998/ATCMP002/paper.pdf},
304
+ note = {\href{https://atcm.mathandtech.org/EP/1998/ATCMP002/paper.pdf}{Full text}}
305
+ }
306
+
307
+ @article{GaoLanzettaLedwithWangKhalaf,
308
+ author = {Gao, Qiang and Lanzetta, Ryan A. and Ledwith, Patrick and Wang, Jie and Khalaf, Eslam},
309
+ title = {Bootstrapping the Quantum {Hall} Problem},
310
+ journal = {Physical Review X},
311
+ volume = {15},
312
+ pages = {031034},
313
+ year = {2025},
314
+ doi = {10.1103/csnn-vjhn},
315
+ url = {https://doi.org/10.1103/csnn-vjhn},
316
+ eprint = {2409.10619},
317
+ archivePrefix = {arXiv},
318
+ note = {\href{https://doi.org/10.1103/csnn-vjhn}{doi:10.1103/csnn-vjhn}}
319
+ }
320
+
321
+ @article{GirvinJach,
322
+ author = {Girvin, S. M. and Jach, Terrence},
323
+ title = {Formalism for the quantum {Hall} effect: {Hilbert} space of analytic functions},
324
+ journal = {Physical Review B},
325
+ volume = {29}, number = {10}, pages = {5617--5625}, year = {1984},
326
+ doi = {10.1103/PhysRevB.29.5617},
327
+ url = {https://doi.org/10.1103/PhysRevB.29.5617},
328
+ note = {\href{https://doi.org/10.1103/PhysRevB.29.5617}{doi:10.1103/PhysRevB.29.5617}}
329
+ }
preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/sections/01-introduction.tex ADDED
@@ -0,0 +1,200 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{The gap and the model}
2
+ \label{sec:intro}
3
+ Laughlin's wave function gave an explicit description of the fractional
4
+ quantum Hall state at filling $1/3$~\cite{Laughlin}. Haldane's spherical
5
+ geometry and pseudopotentials identify a particularly simple parent
6
+ Hamiltonian: every pair pays energy one in relative angular momentum one
7
+ and zero in the other pair sectors~\cite{Haldane}. Its exact Laughlin
8
+ zero mode is known, but a uniform lower bound on the positive spectrum
9
+ requires control of all competing many-particle states. We prove this
10
+ bound for the full interaction on the round sphere, resolving positively
11
+ the spherical fermionic Laughlin spectral-gap conjecture.
12
+
13
+ The gap question has accompanied this model since its early development.
14
+ Haldane and Rezayi's finite-size study supplied numerical evidence and
15
+ explicitly distinguished the expected hard-core gap from a formal
16
+ proof~\cite{HaldaneRezayi1985FiniteSize}. The density-wave variational
17
+ picture of Girvin, MacDonald, and Platzman explains important features of
18
+ the excitation spectrum~\cite{GMP}. A variational excitation energy is
19
+ an upper bound; the lower bound sought here must hold for every state
20
+ orthogonal to the zero modes.
21
+
22
+ \subsection{Normalization and main results}
23
+ For an integer \(Q\ge1\), let \(U_Q\) be the spin-\(Q/2\) representation of
24
+ \(SU(2)\), equipped with its invariant inner product. It is the one-particle
25
+ lowest Landau level on the sphere with \(Q\) flux quanta. Equivalently, it is
26
+ the space of homogeneous polynomials of degree \(Q\) in spinor coordinates
27
+ \((u,v)\). For \(2\le N\le Q+1\), define
28
+ \begin{equation}\label{eq:physicalH}
29
+ H_{N,Q}=\left.\sum_{1\le i<j\le N}P_{ij}^{(1)}
30
+ \right|_{\bigwedge^N U_Q},
31
+ \end{equation}
32
+ where \(P_{ij}^{(1)}\) is the orthogonal projector onto pair spin \(Q-1\)
33
+ in tensor positions \(i,j\). This is relative angular momentum one. The sum
34
+ preserves the antisymmetric subspace. Each unordered pair has coefficient
35
+ one, with no rescaling depending on \(N\) or \(Q\).
36
+
37
+ Set \(H_{0,Q}=H_{1,Q}=0\), and write
38
+ \[
39
+ \FF_Q=\bigoplus_{N=0}^{Q+1}\bigwedge^N U_Q,\qquad
40
+ H_Q=\bigoplus_{N=0}^{Q+1}H_{N,Q},\qquad
41
+ \gamma_*=\frac{4616733319001}{10^{14}}> \frac1{25}.
42
+ \]
43
+ Our principal estimate concerns this entire Fock space.
44
+
45
+ \begin{theorem}\label{thm:fock}
46
+ For every \(0<\gamma<\gamma_*\), there is an integer \(Q_\gamma\) such that
47
+ for every integer \(Q\ge Q_\gamma\),
48
+ \begin{equation}\label{eq:architecture}
49
+ H_Q^2\ge\gamma H_Q\qquad\text{on }\FF_Q.
50
+ \end{equation}
51
+ The threshold \(Q_\gamma\) is independent of particle number.
52
+ \end{theorem}
53
+
54
+ Thus the spectrum is contained in \(\{0\}\cup[\gamma,\infty)\).
55
+ In a particle sector without a zero mode, this statement bounds the energy
56
+ away from zero; it does not assert a gap between that sector's two lowest
57
+ eigenvalues. At Laughlin filling the zero mode is unique, and we obtain the
58
+ usual ground-state spectral gap.
59
+
60
+ \begin{corollary}\label{thm:main}
61
+ There is an integer \(N_0\ge2\) such that, for every \(N\ge N_0\) and
62
+ \(Q=3(N-1)\),
63
+ \begin{equation}\label{eq:main}
64
+ H_{N,Q}\ge\frac1{25}\bigl(I-P_{\mathrm L,N}\bigr)
65
+ \qquad\text{on }\bigwedge^N U_Q,
66
+ \end{equation}
67
+ where \(P_{\mathrm L,N}\) projects onto the line spanned by
68
+ \[
69
+ \Psi_{\mathrm L,N}=\prod_{i<j}(u_iv_j-u_jv_i)^3.
70
+ \]
71
+ \end{corollary}
72
+
73
+ At fixed magnetic length, the sphere radius is proportional to \(\sqrt Q\),
74
+ so this is the two-dimensional thermodynamic limit. The thresholds in
75
+ Theorem~\ref{thm:fock} and Corollary~\ref{thm:main} are existential.
76
+ The proof does not give an explicit flux threshold or the endpoint
77
+ coefficient \(\gamma_*\) on finite spheres.
78
+
79
+ \subsection{Prior work}
80
+ The exact ground-state structure is an established part of the theory.
81
+ Besides Haldane's spherical construction, Trugman and Kivelson obtained
82
+ exact Laughlin ground states for repulsive interactions in a vanishing-range
83
+ limit~\cite{TrugmanKivelson1985}. The second-quantized algebra of
84
+ pseudopotentials was developed systematically by Ortiz, Nussinov, Dukelsky,
85
+ and Seidel~\cite{OrtizNussinovDukelskySeidel}. Chen and Seidel, and
86
+ Mazaheri, Ortiz, Nussinov, and Seidel, gave algebraic constructions and
87
+ characterizations of their zero modes~\cite{ChenSeidel2015,MazaheriOrtizNussinovSeidel2015}.
88
+ These results identify the zero modes that a spectral estimate must preserve. We include a short self-contained proof of the known spherical
89
+ zero-mode uniqueness at the Laughlin flux in Lemma~\ref{lem:kernel}.
90
+
91
+ For Laughlin states on a cylinder of any fixed radius, Jansen established
92
+ thermodynamic correlation limits and axial periodicity~\cite{Jansen2012}.
93
+ Exact ground states of related finite-range orbital chains, including
94
+ squeezed and matrix-product states, were constructed by Nakamura, Wang, and
95
+ Bergholtz~\cite{NakamuraWangBergholtz2012} and by Wang and
96
+ Nakamura~\cite{WangNakamura2013}. Nachtergaele, Warzel, and Young proved
97
+ uniform gaps for a truncated fermionic pseudopotential~\cite{NWY};
98
+ Warzel and Young obtained thin-torus bounds that separate bulk behavior
99
+ from open-chain edge modes~\cite{WY}. Their invariant-subspace method
100
+ also treats a truncated bosonic pseudopotential~\cite{WarzelYoung2023BulkEdge}.
101
+ The fermionic estimates already hold uniformly across particle sectors.
102
+ The distinction in Theorem~\ref{thm:fock} is the full spherical pair
103
+ interaction, with its fixed projector normalization and sphere radius
104
+ growing in the thermodynamic limit. The finite support used in our
105
+ auxiliary comparison operators does not truncate that interaction.
106
+
107
+ Recent work gives further structural and spectral information.
108
+ Lemm, Nachtergaele, Warzel, and Young derive recursions between particle
109
+ sectors and compare charge and neutral gaps~\cite{LemmNachtergaeleWarzelYoung2026Recursive};
110
+ a uniform bound for the full pseudopotential still requires control of
111
+ the model-specific ground-space overlap matrices in those criteria.
112
+ Schraven and Warzel prove entanglement-gap and clustering results for
113
+ Laughlin states on sufficiently thin cylinders~\cite{SchravenWarzel2026IMPS}.
114
+ The entanglement spectrum is distinct from the Hamiltonian spectrum
115
+ considered here. Density rigidity within the family of fully correlated
116
+ Laughlin states is another complementary form of incompressibility,
117
+ established by Lieb, Rougerie, and Yngvason~\cite{LRYRigidity}.
118
+ No density-screening assumption enters our argument.
119
+
120
+ Rougerie's survey records the spectral-gap conjecture and its geometric
121
+ formulations~\cite[Appendix~A]{Rougerie}. For $N$ fermions in the planar
122
+ lowest Landau level, consider the sum over unordered pairs of the orthogonal
123
+ projectors onto relative polynomial degree one, each with coefficient one
124
+ and with center-of-mass degree unrestricted. Section~\ref{sec:plane} proves
125
+ that its positive spectrum is bounded below by the endpoint $\gamma_*$,
126
+ uniformly in particle number $N\ge2$ and total polynomial degree $L$.
127
+ In particular, this proves the fermionic cubic case of the folklore
128
+ spectral-gap conjecture in \cite[Conjecture~A.1]{Rougerie}, whose degree range
129
+ is $L\le3N(N-1)/2$.
130
+
131
+ \subsection{Proof strategy}
132
+ Proving positivity of $H^2-\gamma H$ is a standard route to a gap,
133
+ underlying finite-size criteria~\cite{Knabe} and methods based on positive
134
+ local decompositions~\cite{Cruz,Rai}. Our argument uses rotations and
135
+ angular-momentum decomposition to construct such a comparison.
136
+ It starts from the normal-ordered expansion of \(H_Q^2\).
137
+ It has two-, three-, and four-body terms. We compare them with the
138
+ corresponding terms of a positive operator
139
+ \[
140
+ \mathcal K_Q=(2Q-1)\int_{SU(2)}
141
+ \sum_{\rho=1}^{7}F_\rho(g)^\dagger F_\rho(g)\,dg,
142
+ \]
143
+ where each \(F_\rho\) is a specified linear combination of a pair
144
+ annihilator and operators that annihilate three particles and create one.
145
+ Here \(F_\rho(g)\) denotes rotation by \(g\), and Haar measure has mass
146
+ one. These auxiliary operators involve finitely many orbital modes;
147
+ the Hamiltonian itself is never truncated.
148
+
149
+ Rotational symmetry reduces the comparison to fixed spin blocks.
150
+ The three-body blocks have an explicit spectrum and a summable tail.
151
+ For four particles, coupling the interacting pair to the different spin
152
+ sectors of a second pair can produce several copies of the same total spin.
153
+ Their four-particle images under exterior multiplication can be linearly
154
+ dependent.
155
+ For the retained blocks, seven rows of rational data establish finite
156
+ inequalities in their large-flux limits. The remaining issue is to transfer
157
+ those inequalities to finite spheres without an error that grows with the
158
+ number of particles.
159
+
160
+ The key device is an exact diagonal change of variables for the pair
161
+ coefficients. On a fixed set of orbital modes, it converts finite-flux
162
+ annihilators into their limiting forms. Every perturbation is then bounded
163
+ by the local pair energy. Rotation averaging turns this into
164
+ \(o(1)H_Q\) on the full Fock space. This relative estimate remains valid
165
+ when the Gram matrices of these limiting four-particle images have kernels.
166
+ A second useful observation
167
+ is to apply Bessel's inequality to all equivalent spin copies at once;
168
+ this substantially reduces the four-body comparison error.
169
+
170
+ The comparisons leave a positive margin:
171
+ \begin{equation}\label{eq:budget}
172
+ H_Q^2\ge\mathcal K_Q+
173
+ \bigl(\gamma_*-o(1)\bigr)H_Q.
174
+ \end{equation}
175
+ All errors and convergence
176
+ thresholds are independent of particle number.
177
+ Figure~\ref{fig:transfer} isolates the passage responsible for this
178
+ uniformity. A small norm error on a growing many-particle space would not
179
+ suffice: it must vanish on the zero modes and be controlled by the pair
180
+ energy. The fixed-mode comparison gives precisely that control before
181
+ rotations distribute it over the sphere.
182
+
183
+ \begin{figure}[t]
184
+ \centering
185
+ \input{figures/relative-transfer}
186
+ \caption{The finite-sphere comparison preserves an error relative to the
187
+ pair energy at every step. The limiting positivity is imposed only after
188
+ wedging; no invertibility of its Gram matrices is required.}
189
+ \label{fig:transfer}
190
+ \end{figure}
191
+
192
+
193
+ Section~\ref{sec:algebra} derives the normal-ordered square, and
194
+ Section~\ref{sec:spin} establishes the spin formulas.
195
+ Section~\ref{sec:squares} gives the finite comparisons.
196
+ Section~\ref{sec:transfer} proves their uniform transfer, and
197
+ Section~\ref{sec:finish} controls the tail and proves the spherical results.
198
+ Section~\ref{sec:plane} derives the planar consequence.
199
+ The exact row data, rational formulas, and complete arithmetic procedure
200
+ for the positivity checks are in Appendix~\ref{app:certificate}.
preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/sections/02-operators.tex ADDED
@@ -0,0 +1,60 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{Exterior algebra and the square of the interaction}
2
+ \label{sec:algebra}
3
+ Our first task is to isolate the two-, three-, and four-body terms of $H_Q^2$. The lifting notation below keeps this calculation independent of particle number.
4
+
5
+ Throughout the operator argument take $Q\ge2$; statements involving limits hold for all sufficiently large integer $Q$. We use the convention that wedges of distinct increasing orthonormal basis vectors have norm one. On
6
+ \[
7
+ \FF_Q=\bigoplus_{n=0}^{Q+1}\bigwedge^n U_Q,
8
+ \]
9
+ let $B(v)$ be the adjoint of left wedge multiplication by $v$. Thus $B(v)$ is conjugate-linear in $v$, and
10
+ \[
11
+ B(v\wedge w)=B(w)B(v).
12
+ \]
13
+ For an orthonormal basis $e_0,\ldots,e_Q$ of $U_Q$, write $c_j=B(e_j)$. These operators satisfy the canonical anticommutation relations, and $\norm{c_j}\le1$.
14
+
15
+ For a matrix on $\bigwedge^k U_Q$, define its lift by linear extension of
16
+ \begin{equation}\label{eq:lift}
17
+ \LL_k(\ket v\bra w)=B(v)^\dagger B(w).
18
+ \end{equation}
19
+ This map preserves positivity, intertwines rotations, acts as the original matrix on $k$ particles, and vanishes on fewer than $k$ particles. Positivity follows by decomposing a positive matrix into a sum of rank-one positive matrices.
20
+
21
+ Put $a=Q-1$ and let $V_Q\subset\bigwedge^2 U_Q$ be the spin-$a$ summand. If $v_0,\ldots,v_{2Q-2}$ is an orthonormal basis of $V_Q$, set
22
+ \begin{equation}\label{eq:fockH}
23
+ B_p=B(v_p),\qquad H_Q=\LL_2(\Pi_{V_Q})=\sum_{p=0}^{2Q-2}B_p^\dagger B_p.
24
+ \end{equation}
25
+ This pair-annihilator form is standard in the algebraic treatment of
26
+ pseudopotentials~\cite[Sections~II.B--D]{OrtizNussinovDukelskySeidel};
27
+ see also \cite[Equation~(2)]{ChenSeidel2015}. We verify its coefficient-one
28
+ normalization here. Its restriction to $\bigwedge^N U_Q$ is \eqref{eq:physicalH}. Indeed contraction in two specified tensor positions corresponds to $B(v)/\sqrt{\binom N2}$ under the isometric identification of wedge and antisymmetric tensor spaces; summing over the $\binom N2$ unordered pairs gives \eqref{eq:fockH}.
29
+
30
+ Define intertwining wedge maps
31
+ \[
32
+ W_3:V_Q\otimes U_Q\longrightarrow\bigwedge^3U_Q,
33
+ \qquad W_4:V_Q\otimes V_Q\longrightarrow\bigwedge^4U_Q,
34
+ \]
35
+ by $W_3(v\otimes u)=v\wedge u$ and $W_4(v\otimes w)=v\wedge w$. We suppress the subscript $Q$ when no confusion can result.
36
+
37
+ A finite normal-ordering calculation in the sense of Wick~\cite{Wick}
38
+ now determines the square. Only contractions between the two middle
39
+ pair operators are needed.
40
+
41
+ \begin{lemma}[Normal-ordered square]\label{lem:square}
42
+ On $\FF_Q$,
43
+ \begin{equation}\label{eq:square}
44
+ H^2=H+\LL_3\!\left(W_3(W_3^\dagger W_3-I)W_3^\dagger\right)
45
+ +\LL_4(W_4W_4^\dagger).
46
+ \end{equation}
47
+ \end{lemma}
48
+ \begin{proof}
49
+ In normal ordering $B_p^\dagger(B_pB_r^\dagger)B_r$, only the two inner annihilators cross the two inner creators. Two, one, or zero contractions leave two-, three-, or four-body terms, respectively. On two particles, $H=\Pi_{V_Q}$ is a projection, so the two-body coefficient is $\Pi_{V_Q}$. The term with no contractions is
50
+ \[
51
+ \sum_{p,r}B(v_p\wedge v_r)^\dagger B(v_p\wedge v_r)
52
+ =\LL_4(W_4W_4^\dagger).
53
+ \]
54
+ There is no extra factor of two: this sum, and the defining basis of $V_Q\otimes V_Q$, both use ordered pairs. On three particles, $H=W_3W_3^\dagger$, since $W_3$ restricted to $v_p\otimes U_Q$ is the map $B_p^\dagger$ from one to three particles. Subtracting its two-body contribution from $H^2$ therefore determines the remaining coefficient as
55
+ \[
56
+ (W_3W_3^\dagger)^2-W_3W_3^\dagger
57
+ =W_3(W_3^\dagger W_3-I)W_3^\dagger.
58
+ \]
59
+ Normal-ordered coefficients are determined successively by these restrictions, proving the identity on Fock space.
60
+ \end{proof}
preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/sections/03-spin.tex ADDED
@@ -0,0 +1,106 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{Spin coefficients and their limits}
2
+ \label{sec:spin}
3
+ The three-body comparison will use the exact spin spectrum of the wedge map. The four-body comparison will use only finitely many coupling coefficients and their limits.
4
+
5
+ The spherical pair coefficients can be expressed through angular-momentum
6
+ coupling~\cite[Section~II.C and Appendix~A]{OrtizNussinovDukelskySeidel}.
7
+ We derive the particular coefficients and fixed-deficit limits needed
8
+ here to keep their phases and normalization explicit.
9
+
10
+ We now fix $e_p$ and $v_p$ to be the normalized lowering bases of $U_Q$ and $V_Q$, respectively, with $v_0=-e_0\wedge e_1$. For spin $j$, lowering from label $p$ to $p+1$ has coefficient $\sqrt{(p+1)(2j-p)}$. Write $(s)_p=s(s-1)\cdots(s-p+1)$, with $(s)_0=1$.
11
+
12
+ \begin{lemma}[Pair coefficients]\label{lem:pair}
13
+ The coefficient of $e_i\wedge e_j$ in $v_p$, for $i<j$, vanishes unless $i+j=p+1$, and otherwise equals
14
+ \begin{equation}\label{eq:pair}
15
+ v_p(i,j)=(i-j)\sqrt{\frac{(Q)_i(Q)_j\,p!}{Q(2Q-2)_p\,i!j!}}.
16
+ \end{equation}
17
+ For fixed $p,i,j$, its limit is
18
+ \begin{equation}\label{eq:pairstar}
19
+ v_p^*(i,j)=(i-j)\sqrt{\frac{p!}{2^p i!j!}}\,\mathbf1_{i+j=p+1}.
20
+ \end{equation}
21
+ \end{lemma}
22
+ \begin{proof}
23
+ Apply simultaneous lowering $p$ times to $-e_0\wedge e_1$ and divide by $\sqrt{(2Q-2)_p p!}$. Expand the lowering operator binomially. Combining the two contributions to each increasing pair gives \eqref{eq:pair}. Taking the limit gives \eqref{eq:pairstar}.
24
+ The normalization can also be checked directly: the square of the
25
+ coefficient in \eqref{eq:pair} is
26
+ \[
27
+ (i-j)^2\frac{\binom Qi\binom Qj}{Q\binom{2Q-2}{p}},
28
+ \]
29
+ and differentiating \((1+x)^Q\) gives
30
+ \[
31
+ \sum_{i,j=0}^Q(i-j)^2\binom Qi\binom Qj x^{i+j}
32
+ =2Qx(1+x)^{2Q-2}.
33
+ \]
34
+ Take the coefficient of \(x^{p+1}\) and halve the sum to restrict to \(i<j\).
35
+ \end{proof}
36
+
37
+ The elementary tensor product rule decomposes spins $j_1,j_2$ into one copy of each spin $j_1+j_2-z$, for $0\le z\le\min(2j_1,2j_2)$. This rule can be seen directly in the
38
+ polynomial model: at deficit $z$ the raising equation determines a highest
39
+ vector, and normalized lowering generates its $2(j_1+j_2-z)+1$
40
+ orthogonal weight vectors. Different highest spins give orthogonal
41
+ invariant subspaces, and the sum of these dimensions is
42
+ $(2j_1+1)(2j_2+1)$, exhausting the tensor product. Let $R_{3,z}$ be the corresponding projection in $V_Q\otimes U_Q$, and put
43
+ \[
44
+ d_a=2Q-1,\qquad d_{3,z}=3Q-1-2z.
45
+ \]
46
+ For $Q\ge2$, the allowed indices are $0\le z\le Q$.
47
+
48
+ \begin{lemma}[Three-body Gram eigenvalues]\label{lem:q}
49
+ \begin{equation}\label{eq:q}
50
+ W_3^\dagger W_3-I=\sum_{z=0}^Qq_z(Q)R_{3,z},\qquad
51
+ q_z(Q)=(-1)^z\frac{(Q)_z}{(2Q-2)_z}
52
+ \left(3z-1-\frac{z(z+1)}Q\right).
53
+ \end{equation}
54
+ In particular $W_3R_{3,z}=0$ for $z=0,1,3$ whenever these indices are allowed. For fixed $z$,
55
+ \begin{equation}\label{eq:qlimit}
56
+ q_z(Q)\longrightarrow (3z-1)(-1/2)^z.
57
+ \end{equation}
58
+ \end{lemma}
59
+ \begin{proof}
60
+ Identify $V_Q\otimes U_Q$ with tensors antisymmetric in their first two positions. Then $W_3$ is $\sqrt3$ times full antisymmetrization. Its Gram operator is the compression of $I-P_{13}-P_{23}$, where $P_{ij}$ swaps tensor positions. The two swap compressions coincide, since conjugation by $P_{12}$ interchanges them and $P_{12}=-I$ on the domain. By equivariance and multiplicity-freeness they act by the same scalar $b_z$ on each spin block.
61
+
62
+ A highest vector of that block has coefficients $s_p$ on $v_p\otimes e_{z-p}$, $0\le p\le z$, satisfying
63
+ \begin{equation}\label{eq:highest-ratio}
64
+ \frac{s_{p+1}}{s_p}=-\sqrt{\frac{(z-p)(Q-z+p+1)}{(p+1)(2Q-2-p)}}.
65
+ \end{equation}
66
+ This follows by applying the raising operator. Write
67
+ $\xi_z=\sum_{p=0}^z s_pv_p\otimes e_{z-p}$. Since
68
+ $v_0=(-e_0\otimes e_1+e_1\otimes e_0)/\sqrt2$, testing $P_{23}\xi_z$
69
+ against $v_0\otimes e_z$ tests $\xi_z$ only on the ordered triples
70
+ $(0,z,1)$ and $(1,z,0)$. Their pair labels are $z-1$ and $z$,
71
+ respectively, with the first contribution absent at $z=0$.
72
+ Substituting their pair coefficients from \eqref{eq:pair} gives
73
+ \[
74
+ s_0b_z=\frac12\left[
75
+ s_{z-1}\sqrt{\frac{z(Q)_z}{Q(2Q-2)_{z-1}}}
76
+ -s_z(z-1)\sqrt{\frac{(Q)_z}{(2Q-2)_z}}\right].
77
+ \]
78
+ Here the ordered tensor coefficients of a normalized wedge include a factor $1/\sqrt2$. Iteration of \eqref{eq:highest-ratio} gives
79
+ \[
80
+ \frac{s_z}{s_0}=(-1)^z\sqrt{\frac{(Q)_z}{(2Q-2)_z}},\qquad
81
+ \frac{s_{z-1}}{s_0}=(-1)^{z-1}
82
+ \sqrt{\frac{z(Q-1)_{z-1}}{(2Q-2)_{z-1}}}\quad(z\ge1).
83
+ \]
84
+ Substitution gives $q_z=-2b_z$ in the form \eqref{eq:q}. The three stated null sectors have $q_z=-1$, and \eqref{eq:qlimit} follows directly.
85
+ \end{proof}
86
+
87
+ We will repeatedly use a fixed-deficit limit of this same calculation. In a product of spins $j_1,j_2$, total lowering deficit means $T=j_1+j_2-m$, where $m$ is the total magnetic quantum number. Coefficients below are with respect to normalized monomials $X^pY^{T-p}/\sqrt{p!(T-p)!}$, and are zero outside the stated index ranges.
88
+
89
+ \begin{lemma}[Fixed-deficit coupling limit]\label{lem:coupling}
90
+ Suppose $j_1,j_2\to\infty$ and $j_2/(j_1+j_2)\to u^2$, where $0<u<1$. Put $v=\sqrt{1-u^2}$. For fixed integers $0\le z\le T$, the normalized coupled vector of spin $j_1+j_2-z$ at total lowering deficit $T$ can be chosen with real coefficients converging to the coefficients $s^{(u)}_{z,T,p}$ of
91
+ \begin{equation}\label{eq:coupling}
92
+ \frac{(uX-vY)^z(vX+uY)^{T-z}}{\sqrt{z!(T-z)!}}.
93
+ \end{equation}
94
+ Descendants in every copy are obtained by normalized lowering, so the matching of bases between equal-spin copies is intertwining.
95
+ \end{lemma}
96
+ \begin{proof}
97
+ At $T=z$, the raising equation gives the adjacent ratio
98
+ \[
99
+ -\sqrt{\frac{(z-p)(2j_2-z+p+1)}{(p+1)(2j_1-p)}}.
100
+ \]
101
+ With sign $(-1)^z$ at $p=0$, normalization yields the coefficients of $(uX-vY)^z/\sqrt{z!}$ in the limit. The change of variables $(X,Y)\mapsto(uX-vY,vX+uY)$ is orthogonal, so these polynomials have norm one in the normalized-monomial inner product. Normalized lowering from $T$ to $T+1$ divides the sum of the two lowering operators by
102
+ \[
103
+ \sqrt{(T-z+1)\{2(j_1+j_2-z)-(T-z)\}}.
104
+ \]
105
+ In the limit this acts by multiplication by $(vX+uY)/\sqrt{T-z+1}$. Induction proves the statement for fixed descendants.
106
+ \end{proof}
preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/sections/04-comparison.tex ADDED
@@ -0,0 +1,172 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{Rotational averages of explicit squares}
2
+ \label{sec:squares}
3
+ We construct a positive rotational average and compare its three- and four-body terms with those of $H_Q^2$. This section specifies the finite inequalities needed; Appendix~\ref{app:certificate} proves them by exact rational arithmetic.
4
+
5
+ Haar measure $dg$ on $SU(2)$ is normalized to have total mass one. For an operator $A$, write $A(g)=U(g)AU(g)^\dagger$, with the appropriate Fock representation. Schur averaging sends a rank-one operator on an irreducible spin-$j$ space to its trace times $I/(2j+1)$. For several equivalent copies, it acts in the same way on the spin
6
+ factor and retains the matrix between copies. Explicitly, if the
7
+ representation is $\bigoplus_j(V_j\otimes\mathbb C^{m_j})$ and $P_j$
8
+ is its spin-$j$ projection, then
9
+ \[
10
+ \int U(g)XU(g)^\dagger\,dg
11
+ =\bigoplus_j\frac{I_{V_j}}{2j+1}\otimes
12
+ \operatorname{Tr}_{V_j}(P_jXP_j).
13
+ \]
14
+ Here $\operatorname{Tr}_{V_j}$ is the partial trace over the spin factor.
15
+ This follows from Schur's lemma applied to each pair of irreducible
16
+ copies, with the scalar fixed by its trace; see
17
+ \cite[Section~II.C]{BartlettRudolphSpekkens}. In particular, averaging
18
+ preserves off-diagonal entries between equivalent spin copies.
19
+
20
+ The positive-square construction belongs to the quadratic-gap approach
21
+ described in Section~\ref{sec:intro}. Fermionic positivity constraints,
22
+ normal ordering, and symmetry also appear in the quantum Hall bootstrap
23
+ of Gao et al.~\cite{GaoLanzettaLedwithWangKhalaf}, which bounds ground-state
24
+ energies. Here the explicit squares are compared with $H_Q^2-\gamma H_Q$
25
+ to control the positive excitation spectrum.
26
+
27
+ For each of the seven rows in Appendix~\ref{app:certificate}, the integer
28
+ $t_\rho$ lies in $\{0,\ldots,7\}$. Set
29
+ \[
30
+ \mathcal S_\rho=\{(p,j)\in\mathbb Z^2:0\le p\le7,\ 0\le j\le8,\
31
+ 0\le p+j-t_\rho\le8\}.
32
+ \]
33
+ The row specifies real coefficients $\lambda_\rho$ and
34
+ $\alpha^\rho_{pj}$ for $(p,j)\in\mathcal S_\rho$; unlisted entries are zero.
35
+ Every coefficient sum for row $\rho$ below is over $\mathcal S_\rho$.
36
+ Our comparison operator is
37
+ \begin{equation}\label{eq:F}
38
+ K=\sum_{\rho=1}^7F_\rho^\dagger F_\rho,\qquad
39
+ F_\rho=\lambda_\rho B_{t_\rho}
40
+ +\sum_{(p,j)\in\mathcal S_\rho}\alpha^{\rho}_{pj}\,
41
+ c_{p+j-t_\rho}^\dagger c_jB_p.
42
+ \end{equation}
43
+ Each summand of $F_\rho$ removes two particles and decreases the sum of
44
+ occupied orbital labels by $t_\rho+1$: for the second term the decrease is
45
+ $(p+1)+j-(p+j-t_\rho)=t_\rho+1$. This common weight allows the two parts
46
+ to interfere in their square, adjusting the three-body comparison at the
47
+ two-body cost $\lambda_\rho^2B_{t_\rho}^\dagger B_{t_\rho}$.
48
+ Only modes $0,\ldots,8$ occur in these auxiliary squares.
49
+
50
+ For a single row, omit $\rho$ and put $i=p+j-t$, $k=q+l-t$. Define
51
+ \[
52
+ O_{p,j,k}=B(v_p\wedge e_j\wedge e_k)=c_kc_jB_p.
53
+ \]
54
+ Reordering $c_ic_k^\dagger=\delta_{ik}-c_k^\dagger c_i$ gives the two-, three-, and four-body terms of $F^\dagger F$:
55
+ \begin{align}
56
+ &\lambda^2 B_t^\dagger B_t,\label{eq:normal2}\\
57
+ &\sum_{p,j}\lambda\alpha_{pj}\left[(c_iB_t)^\dagger c_jB_p
58
+ +(c_jB_p)^\dagger c_iB_t\right]
59
+ +\sum_{p,j;q,l}\alpha_{pj}\alpha_{ql}\delta_{ik}
60
+ (c_jB_p)^\dagger c_lB_q,\label{eq:normal3}\\
61
+ &-\sum_{p,j;q,l}\alpha_{pj}\alpha_{ql}
62
+ O_{p,j,k}^\dagger O_{q,l,i}.\label{eq:normal4}
63
+ \end{align}
64
+ Let $A_2,A_3,A_4$ denote these terms, summed over rows and averaged with factor $d_a$. Thus
65
+ \begin{equation}\label{eq:Adecomp}
66
+ \mathcal K_Q:=d_a\int K(g)\,dg=A_2+A_3+A_4,\qquad A_2=\eta H,
67
+ \quad \eta=\sum_\rho\lambda_\rho^2.
68
+ \end{equation}
69
+
70
+ \subsection{The three-body comparison}
71
+ Before wedging, \eqref{eq:normal3} is a matrix on $V_Q\otimes U_Q$. Its nonzero entries preserve $T=p+j$, and $T\le15$. Averaging therefore gives
72
+ \begin{equation}\label{eq:A3}
73
+ A_3=\LL_3\left(W_3\sum_{z=0}^{15}\frac{d_a}{d_{3,z}}e_z^Q R_{3,z}W_3^\dagger\right),
74
+ \end{equation}
75
+ for all sufficiently large $Q$, where $e_z^Q$ is the trace of the unaveraged matrix in that spin block. By Lemma~\ref{lem:coupling}, with $u=1/\sqrt3$, these traces converge to
76
+ \begin{equation}\label{eq:ez}
77
+ e_z=\sum_\rho\sum_{T=\max(z,t_\rho)}^{15}
78
+ \left[2\lambda_\rho s_{z,T,t_\rho}
79
+ \sum_{p+j=T}\alpha^{\rho}_{pj}s_{z,T,p}
80
+ +\left(\sum_{p+j=T}\alpha^{\rho}_{pj}s_{z,T,p}\right)^2\right],
81
+ \end{equation}
82
+ where $s=s^{(1/\sqrt3)}$ and empty inner sums are zero. The condition $i=k$ in \eqref{eq:normal3} is exactly the equality of the two values of $T$.
83
+
84
+ The exact calculation in Appendix~\ref{app:certificate} proves
85
+ \begin{equation}\label{eq:3certificate}
86
+ e_z<\frac32(3z-1)(-1/2)^z,
87
+ \qquad z\in\{2,4,5,\ldots,15\}.
88
+ \end{equation}
89
+ There are finitely many strict inequalities, $d_{3,z}/d_a\to3/2$, and the omitted blocks $z=0,1,3$ are annihilated by $W_3$. Consequently, for all sufficiently large $Q$,
90
+ \begin{equation}\label{eq:A3bound}
91
+ A_3\le\LL_3\left(W_3\sum_{z=0}^{15}q_z(Q)R_{3,z}W_3^\dagger\right).
92
+ \end{equation}
93
+
94
+ \subsection{The four-body comparison before taking limits}
95
+ Let
96
+ \[
97
+ \widehat W:V_Q\otimes\bigwedge^2U_Q\longrightarrow\bigwedge^4U_Q
98
+ \]
99
+ be the wedge map. The second tensor factor decomposes into spins $Q-r$, with $r$ odd, $1\le r\le Q$. In its lowering bases use the sign of Lemma~\ref{lem:coupling}; at $r=1$ this is precisely the basis $v_p$.
100
+
101
+ A copy of spin $2Q-1-D$ is obtained by coupling $a=Q-1$ with $Q-r$ at deficit $D-r$. Denote its vector at total deficit $T$ by $\ket{D,T;r}_Q$. Its physical orbital-index sum is $1+T$, and it is a highest vector when $T=D$. For fixed $D,T$ and sufficiently large $Q$, the allowed copy labels are
102
+ \[
103
+ \mathcal R_D=\{1,3,5,\ldots\}\cap[1,D],\qquad D\le T.
104
+ \]
105
+ Define the real finite-flux coefficients by
106
+ \[
107
+ \ket{D,T;r}_Q=\sum_{\substack{p+j+k=T\\j<k}}
108
+ S_r^Q(D,T;p,j,k)\,v_p\otimes(e_j\wedge e_k),
109
+ \]
110
+ and extend them antisymmetrically in $j,k$. By two applications of Lemma~\ref{lem:coupling}, they converge to
111
+ \begin{equation}\label{eq:S}
112
+ S_r(D,T;p,j,k)=\sqrt2\,
113
+ s^{(1/\sqrt2)}_{r,j+k,j}\,
114
+ s^{(1/\sqrt2)}_{D-r,T-r,p},
115
+ \end{equation}
116
+ interpreted as zero if $r>j+k$. The formula holds for either ordering of $j,k$, by antisymmetry. It follows by applying Lemma~\ref{lem:coupling} first to the two single-particle spins and then to the two pair spins.
117
+
118
+ Only $1\le D\le23$ contribute: every unaveraged term has
119
+ \[
120
+ T=p+j+k=q+l+i\le23.
121
+ \]
122
+ Put $d_D=4Q-1-2D$. In the coupled bases $\ket{D,T;r}_Q$, the
123
+ spin-$2Q-1-D$ block is identified with
124
+ $\mathbb C^{d_D}\otimes\mathbb C^{\mathcal R_D}$: the first factor uses the
125
+ $(T-D)$-th normalized spin descendant, and the second has basis vector
126
+ indexed by $r$. Let $E_D^Q$ be the partial trace over the spin factor of
127
+ the compression to this block of the matrix representing \eqref{eq:normal4}
128
+ before wedging, summed over rows. Schur averaging then gives, for all sufficiently large $Q$,
129
+ \begin{equation}\label{eq:A4}
130
+ A_4=\LL_4\!\left(\widehat W
131
+ \left[\bigoplus_{D=1}^{23}\frac{d_a}{d_D}
132
+ (I_{d_D}\otimes E_D^Q)\right]\widehat W^\dagger\right),
133
+ \end{equation}
134
+ where the direct sum acts as zero on all other spin blocks.
135
+ For these finitely many $D$, entrywise convergence gives $E_D^Q\to E_D$, with
136
+ \begin{equation}\label{eq:E}
137
+ (E_D)_{rs}=-\sum_\rho\sum_{\substack{p,j;q,l\\T\ge D}}
138
+ \alpha^{\rho}_{pj}\alpha^{\rho}_{ql}
139
+ S_r(D,T;p,j,k)S_s(D,T;q,l,i),
140
+ \end{equation}
141
+ where $i=p+j-t_\rho$, $k=q+l-t_\rho$, and $T=p+j+k$. The exact finite-flux matrix $E_D^Q$ is given by the same formula with each $S_r$ replaced by $S_r^Q$. Exchanging the two ordered entry pairs exchanges $r$ and $s$, so both matrices are real symmetric.
142
+
143
+ The target term $\LL_4(W_4W_4^\dagger)$ is obtained from the $r=1$ summand, since that summand is $V_Q\otimes V_Q$. Thus its copy matrix, in the units just used, is $(d_D/d_a)\chi$, where
144
+ \[
145
+ \chi_{rs}=\mathbf1_{r=s=1},\qquad d_D/d_a\longrightarrow2.
146
+ \]
147
+ For even $D$, the $r=1$ coupled vector is antisymmetric under exchange
148
+ of its two spin-$a$ factors, since its coupling deficit is $D-1$.
149
+ Wedging two degree-two vectors is symmetric, so this target column then
150
+ vanishes after applying $\widehat W$. The formula with $\chi$ still
151
+ represents it exactly; we never assume that the wedged copy vectors are
152
+ independent.
153
+
154
+ Target spin blocks outside $1\le D\le23$ contribute positively and may be discarded in a lower bound.
155
+
156
+ Set
157
+ \begin{align}
158
+ w_{Dr}^Q&=\widehat W\ket{D,D;r}_Q,\label{eq:wQ}\\
159
+ w_{Dr}^*&=\sum_{\substack{p+j+k=D\\j<k}}
160
+ S_r(D,D;p,j,k)\,v_p^*\wedge e_j\wedge e_k,\qquad
161
+ (G_D)_{rs}=\ip{w_{Dr}^*}{w_{Ds}^*}.\label{eq:wstar}
162
+ \end{align}
163
+ The star is a limit label, not an adjoint. Let $W_D^*$ be the map with columns
164
+ $w_{Dr}^*$. With allowance $\eps=3\cdot10^{-6}$, the limiting comparison on
165
+ these four-particle images asks that
166
+ $W_D^*(2\chi-E_D+\eps I)(W_D^*)^\dagger$ be nonnegative.
167
+ Lemma~\ref{lem:compression} identifies this with the exact certificate
168
+ \begin{equation}\label{eq:4certificate}
169
+ G_D(2\chi-E_D+\eps I)G_D\ge0,
170
+ \qquad 1\le D\le23.
171
+ \end{equation}
172
+ Appendix~\ref{app:certificate} specifies and verifies it entirely by rational arithmetic.
preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/sections/05-transfer.tex ADDED
@@ -0,0 +1,232 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{A relative error bound for finite spheres}
2
+ \label{sec:transfer}
3
+ The limiting Gram matrices have kernels, so their positivity cannot be
4
+ transferred by assuming that their ranges vary continuously. Instead, we
5
+ compare the annihilators themselves. An exact diagonal change of variables
6
+ reduces every error to a fixed finite family of pair-generated annihilators.
7
+ This gives an error relative to $H_Q$, uniformly on the full Fock space.
8
+
9
+ Geometry-dependent diagonal changes of occupation-number coordinates
10
+ already relate pseudopotential annihilators and their zero modes~\cite[Section~II.E]{OrtizNussinovDukelskySeidel}.
11
+ For a gap estimate, the needed additional statement is quantitative:
12
+ on a fixed set of modes the change of variables approaches the identity,
13
+ and its error is controlled by pair energy. The proof below establishes
14
+ that statement before adding spectator modes and averaging over rotations.
15
+
16
+ For the local argument, let $\FF_{\mathrm{loc}}$ be the exterior algebra
17
+ of $\mathbb C^{25}$ with orthonormal basis $e_0,\ldots,e_{24}$.
18
+ For $Q\ge24$ we identify it with the Fock space of the first 25 orbital
19
+ modes in $U_Q$. By \eqref{eq:pairstar}, each limiting pair vector $v_p^*$
20
+ with $p\le23$ lies in $\bigwedge^2\mathbb C^{25}$.
21
+ Contraction by these vectors is defined on $\FF_{\mathrm{loc}}$
22
+ by the same exterior-algebra convention as before.
23
+
24
+ \begin{lemma}[Compression and annihilator bounds]\label{lem:compression}
25
+ Let $W$ be a linear map between finite-dimensional Hilbert spaces,
26
+ $G=W^\dagger W$, and let $C$ be self-adjoint on the domain of $W$. Then
27
+ \[
28
+ GCG\ge0\quad\Longleftrightarrow\quad WCW^\dagger\ge0.
29
+ \]
30
+ On $\FF_{\mathrm{loc}}$, for any fixed finite collection
31
+ $A_b=c_kc_jB(v_p^*)$ with $0\le p\le23$ and $0\le j,k\le24$,
32
+ \begin{equation}\label{eq:annihilatorbound}
33
+ \sum_b\norm{A_b\psi}^2\le C_0\ip\psi{h_*\psi},
34
+ \qquad h_*:=\sum_{p=0}^{23}B(v_p^*)^\dagger B(v_p^*),
35
+ \end{equation}
36
+ where $C_0$ depends only on the collection.
37
+ \end{lemma}
38
+ \begin{proof}
39
+ The two positivity statements both assert that the quadratic form of $C$
40
+ is nonnegative on $\ran G=\ran W^\dagger$. For the second assertion, use
41
+ $\norm{c_kc_jB(v_p^*)\psi}\le\norm{B(v_p^*)\psi}$ and sum; one may take
42
+ $C_0$ to be the largest multiplicity of a pair label $p$.
43
+ \end{proof}
44
+
45
+ \Needspace{11\baselineskip}
46
+ \begin{lemma}[Uniform transfer]\label{lem:transfer}
47
+ For $Q\ge24$ and $1\le D\le23$, put
48
+ \[
49
+ C_D^Q=(d_D/d_a)\chi-E_D^Q+\eps I,
50
+ \qquad h_Q=\sum_{p=0}^{23}B_p^\dagger B_p.
51
+ \]
52
+ Assuming \eqref{eq:4certificate}, there is a scalar $\rho_Q\ge0$,
53
+ independent of $D$ and tending to zero as $Q\to\infty$, such that
54
+ \begin{equation}\label{eq:relative}
55
+ \sum_{r,s\in\mathcal R_D}(C_D^Q)_{rs}
56
+ B(w_{Dr}^Q)^\dagger B(w_{Ds}^Q)
57
+ \ge-\rho_Qh_Q
58
+ \end{equation}
59
+ on the entire Fock space $\FF_Q$.
60
+ \end{lemma}
61
+ \begin{proof}
62
+ \emph{An exact change of variables.}
63
+ Take $Q\ge24$. All annihilators in \eqref{eq:relative}, including those
64
+ in $h_Q$, involve only the modes $0,\ldots,24$. First work on
65
+ $\FF_{\mathrm{loc}}$. Define the positive diagonal operator
66
+ \[
67
+ \Delta_Q\ket A=\left(\prod_{x\in A}d_Q(x)\right)\ket A,
68
+ \qquad d_Q(x)=\sqrt{(Q)_x/Q^x},
69
+ \]
70
+ on each basis wedge $\ket A$. This local Fock space is fixed as $Q$
71
+ varies. Thus $\Delta_Q$ and $\Delta_Q^{-1}$ converge in norm to $I$;
72
+ also $0<\Delta_Q\le I$.
73
+
74
+ The pair coefficient formula \eqref{eq:pair} gives
75
+ \[
76
+ v_p(x,y)=r_p(Q)d_Q(x)d_Q(y)v_p^*(x,y),
77
+ \qquad r_p(Q)=\sqrt{(2Q)^p/(2Q-2)_p}\ge1.
78
+ \]
79
+ Checking the factors attached to the removed orbital labels on a basis
80
+ wedge gives the exact identities
81
+ \begin{align}
82
+ B_p&=r_p(Q)\Delta_Q^{-1}B(v_p^*)\Delta_Q,
83
+ \label{eq:pairconjugation}\\
84
+ B(v_p\wedge e_j\wedge e_k)
85
+ &=\frac{r_p(Q)}{d_Q(j)d_Q(k)}\,
86
+ \Delta_Q^{-1}B(v_p^*\wedge e_j\wedge e_k)\Delta_Q.
87
+ \label{eq:fourconjugation}
88
+ \end{align}
89
+ These are identities on the local Fock space, with the inverse diagonal
90
+ acting on the output particle sector. Repeated removed labels make both
91
+ sides zero. In particular, solving \eqref{eq:pairconjugation} for
92
+ $B(v_p^*)\Delta_Q$ and using $r_p(Q)\ge1$ and $\norm{\Delta_Q}\le1$
93
+ gives
94
+ \begin{equation}\label{eq:pairenergytransfer}
95
+ \Delta_Q h_*\Delta_Q\le h_Q.
96
+ \end{equation}
97
+
98
+ \emph{The error is controlled by pair energy.}
99
+ Fix $D$. Index a finite family by
100
+ $b=(p,j,k)$ with $p+j+k=D$ and $j<k$, and put
101
+ \[
102
+ A_b=B(v_p^*\wedge e_j\wedge e_k),\qquad
103
+ \beta_{rb}^Q=S_r^Q(D,D;p,j,k)
104
+ \frac{r_p(Q)}{d_Q(j)d_Q(k)}.
105
+ \]
106
+ Equations \eqref{eq:wQ} and \eqref{eq:fourconjugation} yield
107
+ \[
108
+ B(w_{Dr}^Q)=\Delta_Q^{-1}
109
+ \left(\sum_b\beta_{rb}^QA_b\right)\Delta_Q.
110
+ \]
111
+ The coefficients are real, and Lemma~\ref{lem:coupling} gives
112
+ $\beta_{rb}^Q\to\beta_{rb}^*:=S_r(D,D;p,j,k)$. Hence the finite
113
+ real symmetric matrices
114
+ \[
115
+ M_Q=(\beta^Q)^TC_D^Q\beta^Q
116
+ \quad\hbox{converge to}\quad
117
+ M_*=(\beta^*)^T(2\chi-E_D+\eps I)\beta^*.
118
+ \]
119
+ The quadratic expression in \eqref{eq:relative} is consequently
120
+ \[
121
+ \Delta_Q\left(\sum_{b,c}(M_Q)_{bc}
122
+ A_b^\dagger\Delta_Q^{-2}A_c\right)\Delta_Q.
123
+ \]
124
+ Its limiting expression before the outer diagonals is
125
+ \begin{equation}\label{eq:limitpositive}
126
+ \sum_{b,c}(M_*)_{bc}A_b^\dagger A_c
127
+ =\sum_{r,s}(2\chi-E_D+\eps I)_{rs}
128
+ B(w_{Dr}^*)^\dagger B(w_{Ds}^*)\ge0.
129
+ \end{equation}
130
+ Indeed, the certificate \eqref{eq:4certificate} and
131
+ Lemma~\ref{lem:compression}, applied to the map with columns $w_{Dr}^*$,
132
+ give positivity before lifting; the lift $\LL_4$ preserves positivity.
133
+
134
+ For clarity, the perturbation estimate does not require $M_*\ge0$.
135
+ Let $R_Q$ be the block matrix with entries
136
+ \[
137
+ (R_Q)_{bc}=(M_Q)_{bc}\Delta_Q^{-2}-(M_*)_{bc}I.
138
+ \]
139
+ Regard $R_Q$ as an operator on the Hilbert direct sum of one copy of
140
+ $\FF_{\mathrm{loc}}$ for each index $b$. The diagonal $\Delta_Q^{-2}$
141
+ acts on the output of $A_c$, hence on the sector with four fewer particles;
142
+ using its direct sum over local sectors makes this a single operator
143
+ identity. Its norm tends to zero, since both its index set and the local
144
+ Fock space are fixed. For every vector $\phi$,
145
+ \[
146
+ \left|\sum_{b,c}\ip{A_b\phi}{(R_Q)_{bc}A_c\phi}\right|
147
+ \le\norm{R_Q}\sum_b\norm{A_b\phi}^2
148
+ \le C_0\norm{R_Q}\ip\phi{h_*\phi}.
149
+ \]
150
+ Combine this estimate with \eqref{eq:limitpositive}, take
151
+ $\phi=\Delta_Q\psi$, and apply \eqref{eq:pairenergytransfer}. This
152
+ proves \eqref{eq:relative} on the local Fock space with a coefficient
153
+ tending to zero. Taking a maximum over the fixed set $1\le D\le23$
154
+ gives a common $\rho_Q$.
155
+
156
+ \emph{Additional particles are spectators.}
157
+ Order the 25 local modes before all other modes in the Fock
158
+ factorization. Under the isometry that sends a local wedge tensored with a spectator
159
+ wedge to their ordered product, each $c_j$ with $j\le24$ is its local
160
+ annihilator tensored with the identity. The fermionic parity factor belongs
161
+ to annihilators in the later spectator modes, which do not occur here.
162
+ Thus every operator in \eqref{eq:relative} acts on the local factor alone.
163
+ Tensoring the local inequality with the identity proves
164
+ it on $\FF_Q$, with the same $\rho_Q$, regardless of the number of
165
+ occupied modes outside this factor.
166
+ \end{proof}
167
+
168
+ The allowance $\eps I$ in the certificate must also be paid for in pair
169
+ energy. Here it is useful to sum over the orthonormal highest vectors
170
+ \emph{before} estimating their wedges. Bessel's inequality then avoids
171
+ an extra factor equal to the number of spin copies.
172
+
173
+ \begin{proposition}[Four-body estimate]\label{prop:A4}
174
+ For the coefficients in Appendix~\ref{app:certificate},
175
+ \begin{equation}\label{eq:A4bound}
176
+ A_4\le\LL_4(W_4W_4^\dagger)+(1222\eps+o(1))H,
177
+ \qquad Q\to\infty,
178
+ \end{equation}
179
+ uniformly on $\FF_Q$.
180
+ \end{proposition}
181
+ \begin{proof}
182
+ Haar averaging the matrix unit
183
+ $\ket{D,D;r}_Q\bra{D,D;s}_Q$ gives the corresponding copy matrix unit
184
+ tensored with the spin identity, divided by $d_D$. Therefore, on the
185
+ retained spin blocks, the target minus $A_4$, with the $\eps I$ allowance
186
+ added, is
187
+ \[
188
+ d_a\sum_{D=1}^{23}\int\sum_{r,s}(C_D^Q)_{rs}
189
+ B(w_{Dr}^Q(g))^\dagger B(w_{Ds}^Q(g))\,dg.
190
+ \]
191
+ Lemma~\ref{lem:transfer}, conjugated by each rotation, bounds this below
192
+ by $-o(1)H$, because Schur averaging gives
193
+ \[
194
+ d_a\int h_Q(g)\,dg=24H.
195
+ \]
196
+ The number of retained blocks is fixed, so this error remains uniform
197
+ in particle number.
198
+
199
+ To bound the allowance, fix $D$ and write
200
+ \[
201
+ \ket{D,D;r}_Q
202
+ =\sum_{\substack{p+j+k=D\\j<k}}S_{rb}^Q\,
203
+ v_p\otimes(e_j\wedge e_k),
204
+ \qquad b=(p,j,k).
205
+ \]
206
+ The uncoupled vectors on the right are orthonormal. So are the highest
207
+ vectors on the left: distinct $r$ belong to orthogonal spin summands of
208
+ the second pair factor. Thus $S^Q(S^Q)^T=I$. Apply the contraction
209
+ $S^Q\otimes I$ to the Hilbert-space-valued vector
210
+ $(c_kc_jB_p\psi)_b$. It follows that
211
+ \[
212
+ \sum_{r\in\mathcal R_D}\norm{B(w_{Dr}^Q)\psi}^2
213
+ \le\sum_{\substack{p+j+k=D\\j<k}}\norm{c_kc_jB_p\psi}^2
214
+ \le\sum_{\substack{p+j+k=D\\j<k}}\norm{B_p\psi}^2.
215
+ \]
216
+ This uses orthogonality before wedging; the vectors $w_{Dr}^Q$ themselves
217
+ need not be orthogonal. The number of triples on the right is
218
+ \[
219
+ n_D=\sum_{n=1}^D\left\lceil\frac n2\right\rceil
220
+ =\left\lfloor\frac{(D+1)^2}{4}\right\rfloor.
221
+ \]
222
+ Conjugate by rotations and integrate. Each pair norm contributes
223
+ $\ip\psi{H\psi}/d_a$, so the total allowance is bounded by
224
+ \[
225
+ \eps\sum_{D=1}^{23}n_DH
226
+ =\eps\left(\sum_{m=1}^{12}m^2+
227
+ \sum_{m=1}^{11}m(m+1)\right)H
228
+ =1222\eps H.
229
+ \]
230
+ The discarded target spin blocks are positive. Removing the allowance
231
+ therefore proves \eqref{eq:A4bound}.
232
+ \end{proof}
preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/sections/06-gap.tex ADDED
@@ -0,0 +1,154 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{The tail estimate and the gap}
2
+ \label{sec:finish}
3
+ The finite comparisons are now in place. We first bound all remaining three-body blocks by a summable multiple of $H_Q$, then identify the zero mode at Laughlin flux.
4
+
5
+ \begin{lemma}[Three-body tail]\label{lem:tail}
6
+ For sufficiently large $Q$,
7
+ \begin{equation}\label{eq:tailbound}
8
+ \LL_3\left(W_3\sum_{z=16}^Qq_z(Q)R_{3,z}W_3^\dagger\right)
9
+ \ge-\delta_QH,
10
+ \end{equation}
11
+ where
12
+ \begin{equation}\label{eq:delta}
13
+ \delta_Q=\sum_{\substack{17\le z\le Q\\z\text{ odd}}}
14
+ \frac{d_{3,z}}{d_a}|q_z(Q)|(z+1),\qquad
15
+ \delta_Q\longrightarrow\frac{61}{4096}.
16
+ \end{equation}
17
+ \end{lemma}
18
+ \begin{proof}
19
+ For $16\le z\le Q$, the bracket in \eqref{eq:q} is positive, since it is at least $2z-2$. Thus only odd $z$ contribute negatively. A normalized highest vector of $R_{3,z}$ is $\sum_{p=0}^zs_pv_p\otimes e_{z-p}$. Its orbit resolves that spin projector with factor $d_{3,z}$. After wedging and lifting, its quadratic form is
20
+ \[
21
+ \norm{\sum_{p=0}^zs_pc_{z-p}(g)B_p(g)\psi}^2
22
+ \le\sum_{p=0}^z\norm{B_p(g)\psi}^2.
23
+ \]
24
+ Averaging each summand proves \eqref{eq:tailbound} with \eqref{eq:delta}.
25
+
26
+ For $Q\ge4$, the ratios in $(Q)_z/(2Q-2)_z$ are nonincreasing, so
27
+ \[
28
+ \frac{(Q)_z}{(2Q-2)_z}\le\left(\frac Q{2Q-2}\right)^z
29
+ \le(2/3)^z,\qquad \frac{d_{3,z}}{d_a}\le2.
30
+ \]
31
+ The summands, extended by zero for $z>Q$, are therefore dominated by
32
+ $6z(z+1)(2/3)^z$. Dominated convergence and \eqref{eq:qlimit} give
33
+ \[
34
+ \lim_{Q\to\infty}\delta_Q
35
+ =\frac32\sum_{z=17,19,\ldots}(3z-1)(z+1)2^{-z}
36
+ =\frac{61}{4096}.
37
+ \]
38
+ For the last identity, write $z=17+2m$. Then
39
+ $(3z-1)(z+1)=900+208m+12m^2$, while the sums of $4^{-m}$,
40
+ $m4^{-m}$, and $m^24^{-m}$ are $4/3$, $4/9$, and $20/27$,
41
+ respectively. Multiplication by $(3/2)2^{-17}$ gives $61/4096$.
42
+ \end{proof}
43
+
44
+ \begin{proof}[Proof of Theorem~\ref{thm:fock}]
45
+ Combine Lemma~\ref{lem:square}, \eqref{eq:Adecomp}, \eqref{eq:A3bound}, Proposition~\ref{prop:A4}, and Lemma~\ref{lem:tail}. They give
46
+ \[
47
+ H^2\ge d_a\int K(g)\,dg+
48
+ (1-\eta-\delta_Q-1222\eps-o(1))H.
49
+ \]
50
+ The integral is positive. The certificate gives
51
+ \[
52
+ \eta=\frac{93527408868499}{10^{14}},\qquad\eps=\frac3{10^6},
53
+ \]
54
+ so the coefficient tends to
55
+ \begin{equation}\label{eq:finalmargin}
56
+ 1-\frac{93527408868499}{10^{14}}-\frac{61}{4096}
57
+ -1222\frac3{10^6}
58
+ =\gamma_*=\frac{4616733319001}{10^{14}}>\frac1{25}.
59
+ \end{equation}
60
+ The limit in \eqref{eq:finalmargin} is $\gamma_*$. For each fixed $0<\gamma<\gamma_*$, the coefficient therefore exceeds $\gamma$ for all sufficiently large $Q$. Every convergence threshold is independent of particle number, proving the assertion on $\FF_Q$.
61
+ \end{proof}
62
+
63
+ We now recover the known unique zero mode of Haldane's spherical
64
+ parent Hamiltonian~\cite[p.~606, Equations~(6)--(7)]{Haldane}.
65
+ The elementary divisibility proof also fixes the exact flux at which the
66
+ kernel is a line.
67
+
68
+ \begin{lemma}[Kernel at Laughlin flux]\label{lem:kernel}
69
+ For $N\ge2$ and $Q=3(N-1)$, the kernel of $H_{N,Q}$ is the line spanned by $\Psi_{\mathrm L,N}$.
70
+ \end{lemma}
71
+ \begin{proof}
72
+ Realize $U_Q$ as the homogeneous polynomials of degree $Q$ in spinor coordinates $(u,v)$. Write $b_{ij}=u_iv_j-u_jv_i$. The pair-spin $Q-r$ summand has highest polynomial
73
+ \[
74
+ b_{ij}^{\,r}u_i^{Q-r}u_j^{Q-r}.
75
+ \]
76
+ Since $b_{ij}$ is invariant under simultaneous rotations of the pair, every vector in this summand is divisible by $b_{ij}^r$. Exchange of the pair has parity $(-1)^r$, so antisymmetric pair states have odd $r$.
77
+
78
+ If $H_{N,Q}\Psi=0$, then, in the ambient tensor space,
79
+ \[
80
+ 0=\ip\Psi{H_{N,Q}\Psi}=\sum_{i<j}\norm{P_{ij}^{(1)}\Psi}^2.
81
+ \]
82
+ Thus $P_{ij}^{(1)}\Psi=0$ for every pair. Expanding in the other particles' monomials, the remaining pair sectors all have odd $r\ge3$. Thus $b_{ij}^3$ divides $\Psi$ for every $i<j$. Each bracket $b_{ij}=v_ju_i-u_jv_i$ is primitive as a polynomial in $u_i$, since $v_j$ and $u_jv_i$ are coprime, and is linear over the fraction field of the other variables. Gauss's lemma therefore makes it irreducible in the polynomial ring. Brackets for distinct unordered pairs are nonassociate. They are consequently relatively prime. Unique factorization implies
83
+ \[
84
+ \prod_{i<j}b_{ij}^3\mid\Psi.
85
+ \]
86
+ This product has degree $3(N-1)=Q$ in each particle's spinor variables, exhausting the multidegree of $\Psi$; the quotient is constant.
87
+
88
+ Conversely, $\Psi_{\mathrm L,N}$ is antisymmetric. Its factor $b_{ij}^3$ leaves pair degrees $Q-3$ in each spinor, whose maximum total pair spin is $Q-3$. Multiplication by the invariant bracket cannot introduce spin $Q-1$. Hence every pair projector annihilates $\Psi_{\mathrm L,N}$.
89
+ \end{proof}
90
+
91
+ \begin{proof}[Proof of Corollary~\ref{thm:main}]
92
+ Apply Theorem~\ref{thm:fock} with $\gamma=1/25$. On each particle sector,
93
+ the spectral theorem gives
94
+ \[
95
+ H_{N,Q}\ge\frac1{25}\bigl(I-P_{\ker H_{N,Q}}\bigr)
96
+ \]
97
+ once $Q$ exceeds the common threshold. Take $Q=3(N-1)$ and apply
98
+ Lemma~\ref{lem:kernel}. Choosing $N_0$ so that $3(N_0-1)$ exceeds the
99
+ threshold proves the claim.
100
+ \end{proof}
101
+
102
+ The following comparison specializes the recursive spectral relations of
103
+ Lemm, Nachtergaele, Warzel, and Young
104
+ \cite[arXiv v1, Theorem~2.1(I), Lemma~2.3, and (2.10)]{LemmNachtergaeleWarzelYoung2026Recursive}.
105
+
106
+ \begin{corollary}[Charge versus neutral gap at fixed flux]\label{cor:charge-neutral}
107
+ For \(N\ge2\), fix \(Q_N=3(N-1)\) and write
108
+ \(E_0(n;Q_N)=\min\operatorname{spec}H_{n,Q_N}\) for the coefficient-one
109
+ interaction \eqref{eq:physicalH}. Let \(\operatorname{Gap}_N\) be the
110
+ first positive eigenvalue of \(H_{N,Q_N}\), its neutral gap.
111
+ The particle-number charge gap at this same flux,
112
+ \[
113
+ \Delta_N=E_0(N+1;Q_N)+E_0(N-1;Q_N)-2E_0(N;Q_N),
114
+ \]
115
+ satisfies
116
+ \[
117
+ \Delta_N=E_0(N+1;Q_N)
118
+ \ge\frac{N}{N-1}\operatorname{Gap}_N>0.
119
+ \]
120
+ In particular, \(\Delta_N\ge N/[25(N-1)]\) for \(N\ge N_0\), with
121
+ \(N_0\) as in Corollary~\ref{thm:main}.
122
+ \end{corollary}
123
+
124
+ \begin{proof}
125
+ All three sectors are nonempty since \(N+1\le\dim U_{Q_N}=3N-2\).
126
+ Lemma~\ref{lem:kernel} gives \(E_0(N;Q_N)=0\) and a one-dimensional
127
+ ground space. The \(N\)-particle sector has dimension greater than one,
128
+ so \(\operatorname{Gap}_N>0\).
129
+ For a nonzero Laughlin vector \(\Psi\), each pair annihilator \(B_p\)
130
+ commutes with every \(c_j\), while
131
+ \(\sum_j\|c_j\Psi\|^2=N\|\Psi\|^2\). Thus some \(c_j\Psi\) is a nonzero
132
+ \((N-1)\)-particle zero mode, giving \(E_0(N-1;Q_N)=0\).
133
+ The divisibility argument in Lemma~\ref{lem:kernel} excludes a zero mode
134
+ in the \((N+1)\)-particle sector: the required product of cubed brackets
135
+ would have degree \(3N>Q_N\) in each particle variable.
136
+
137
+ Let \(P_n\) project onto the lowest-energy eigenspace of \(H_{n,Q_N}\),
138
+ and define the overlap operator on the \((N+1)\)-particle sector by
139
+ \[
140
+ \mathcal G_N=P_{N+1}\left(\sum_{j=0}^{Q_N}c_j^\dagger P_Nc_j\right)P_{N+1}.
141
+ \]
142
+ Here \(P_{N+1}\) projects onto a positive-energy ground eigenspace.
143
+ For the pure two-body fermionic form \eqref{eq:fockH}, the cited
144
+ Theorem~2.1(I), with \(m_0=m_1=2\), gives
145
+ \[
146
+ E_0(N+1;Q_N)\ge\frac{N+1}{N-1}E_0(N;Q_N)
147
+ +\frac{N+1-\|\mathcal G_N\|}{N-1}\operatorname{Gap}_N.
148
+ \]
149
+ The cited Lemma~2.3 gives \(\|\mathcal G_N\|\le\operatorname{rank}P_N=1\).
150
+ Since \(E_0(N;Q_N)=0\), this yields
151
+ \(E_0(N+1;Q_N)\ge N\operatorname{Gap}_N/(N-1)\).
152
+ The two zero energies give the asserted second difference, and
153
+ Corollary~\ref{thm:main} supplies the final uniform bound.
154
+ \end{proof}
preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/sections/07-plane.tex ADDED
@@ -0,0 +1,86 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{A planar corollary}
2
+ \label{sec:plane}
3
+
4
+ The full-Fock-space estimate also gives a gap on the plane. We use the
5
+ analytic lowest-Landau-level representation described by Girvin and
6
+ Jach~\cite[Section~II]{GirvinJach}, with Gaussian scale fixed below.
7
+ Let
8
+ $\mathcal B$ be the Bargmann space of entire functions with norm
9
+ \[
10
+ \|f\|_{\mathcal B}^2=\frac1\pi\int_{\mathbb C}|f(z)|^2e^{-|z|^2}\,d^2z,
11
+ \qquad e_j(z)=\frac{z^j}{\sqrt{j!}}.
12
+ \]
13
+ Multiplication by $\pi^{-1/2}e^{-|z|^2/2}$ identifies this space unitarily
14
+ with the planar lowest Landau level at magnetic field $2$; changing magnetic
15
+ length is a unitary dilation.
16
+ For a pair of coordinates set $w=(z_1-z_2)/\sqrt2$ and
17
+ $Z=(z_1+z_2)/\sqrt2$. Let $P^{(1)}$ be the orthogonal projector onto
18
+ relative degree one, with no restriction on the degree in $Z$, and put
19
+ \[
20
+ H_N^{\mathrm{pl}}=\left.\sum_{1\le i<j\le N}P_{ij}^{(1)}
21
+ \right|_{\bigwedge^N\mathcal B}.
22
+ \]
23
+ Thus each pair projector has coefficient one, as on the sphere.
24
+
25
+ \begin{corollary}[Planar spectral gap]\label{cor:plane}
26
+ For every $N\ge2$, the untruncated planar Hamiltonian satisfies
27
+ \[
28
+ (H_N^{\mathrm{pl}})^2\ge\gamma_* H_N^{\mathrm{pl}},
29
+ \]
30
+ where $\gamma_*$ is the constant in Theorem~\ref{thm:fock}.
31
+ Equivalently, if $P_{0,N}^{\mathrm{pl}}$ projects onto its kernel, then
32
+ $H_N^{\mathrm{pl}}\ge\gamma_*(I-P_{0,N}^{\mathrm{pl}})$.
33
+ The constant is independent of both particle number and total angular
34
+ momentum. In particular, the case $\ell=3$ of the spectral gap conjecture
35
+ in \cite[Conjecture~A.1]{Rougerie} holds, in its pair-projector normalization.
36
+ \end{corollary}
37
+ \begin{proof}
38
+ The coordinate change $(z_1,z_2)\mapsto(w,Z)$ is unitary for the
39
+ Bargmann inner product. Consequently the vectors
40
+ $wZ^p/\sqrt{p!}$, $p\ge0$, form an orthonormal basis of the relative-degree-one
41
+ subspace. Their coefficients in the normalized wedge basis are
42
+ \[
43
+ v_p^{\mathrm{pl}}(i,j)
44
+ =(i-j)\sqrt{\frac{p!}{2^p i!j!}}\,\mathbf1_{i+j=p+1},
45
+ \qquad i<j.
46
+ \]
47
+ Indeed, expanding $(z_1-z_2)(z_1+z_2)^p$
48
+ first gives the coefficient in the tensor basis; passage to the normalized
49
+ antisymmetric wedge multiplies it by $\sqrt2$. These are exactly the
50
+ limits in \eqref{eq:pairstar}. The second-quantized pair-projector identity
51
+ therefore gives
52
+ $H_N^{\mathrm{pl}}=\sum_{p\ge0}B(v_p^{\mathrm{pl}})^\dagger B(v_p^{\mathrm{pl}})$
53
+ on antisymmetric polynomials.
54
+
55
+ Fix $N$ and a total degree $L$. The corresponding homogeneous subspace
56
+ has the finite orthonormal basis
57
+ \[
58
+ e_{i_1}\wedge\cdots\wedge e_{i_N},\qquad
59
+ 0\le i_1<\cdots<i_N,\qquad \sum_{k=1}^N i_k=L.
60
+ \]
61
+ For $Q\ge\max\{L,N-1,2\}$ this is also the entire spherical subspace of total
62
+ lowering deficit $L$, under the identification of normalized one-particle
63
+ bases. Both Hamiltonians preserve this subspace: a pair is annihilated
64
+ and created with the same sum of orbital labels. Only $p+1\le L$
65
+ can contribute. The finitely many matrix entries of the spherical
66
+ restriction therefore converge to those of the planar restriction by
67
+ \eqref{eq:pair}--\eqref{eq:pairstar}; the convergence is in operator norm.
68
+
69
+ Fix $0<\gamma<\gamma_*$. Theorem~\ref{thm:fock} gives
70
+ $H_Q^2\ge\gamma H_Q$ for all sufficiently large $Q$.
71
+ Restrict to the invariant block just described and let $Q\to\infty$.
72
+ Norm convergence passes through the square and gives
73
+ $(H_N^{\mathrm{pl}})^2\ge\gamma H_N^{\mathrm{pl}}$ on that block.
74
+ Now let $\gamma\uparrow\gamma_*$; the cone of positive matrices is closed,
75
+ so the same inequality holds at $\gamma_*$. The limit $Q\to\infty$ is taken
76
+ separately for each fixed $\gamma$, allowing the flux threshold to depend
77
+ on $\gamma$. Here $N$ and $L$ were arbitrary, and the resulting constant is the
78
+ same for all of them.
79
+
80
+ Finally, $\bigwedge^N\mathcal B$ is the Hilbert direct sum of its homogeneous
81
+ subspaces, and $0\le H_N^{\mathrm{pl}}\le\binom N2 I$. The block inequalities
82
+ thus extend by continuity to the whole space. The spectral theorem gives
83
+ the asserted gap. Restriction to total degrees
84
+ $L\le3N(N-1)/2$ gives exactly the sector in the cited conjecture for
85
+ $\ell=3$.
86
+ \end{proof}
preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/build/sections/08-arithmetic.tex ADDED
@@ -0,0 +1,152 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{The finite rational certificate}
2
+ \label{app:certificate}
3
+ This appendix specifies the seven rows and all arithmetic needed to verify
4
+ \eqref{eq:3certificate} and \eqref{eq:4certificate}. Starting from the integer
5
+ rows in Section~\ref{app:rows}, evaluate the rational three-body traces in
6
+ Section~\ref{app:three-arithmetic} and the rational four-body matrices in
7
+ Section~\ref{app:four-arithmetic}. The margin and coefficient-sign tables in
8
+ those sections record the resulting checks. The formulas below determine
9
+ every value using only integers and rational numbers.
10
+
11
+ \subsection{Row data}
12
+ \label{app:rows}
13
+ Let $P=10^7$. The first two numbers of each row are $t$ and $\ell=P\lambda$. An entry $pj:a$ specifies the integer $a_{pj}$, with $p$ and $j$ parsed as separate single-digit labels; omitted entries are zero. Continuation lines belong to the preceding row. Define
14
+ \begin{equation}\label{eq:alphadata}
15
+ \alpha_{pj}=\frac{a_{pj}}P
16
+ \sqrt{\frac{2^p\binom{p+j}{p}}{2^t\binom{p+j}{t}}}
17
+ =\frac{a_{pj}}P\sqrt{\frac{2^{p-t}t!(p+j-t)!}{p!j!}}.
18
+ \end{equation}
19
+ Every nonzero entry has $0\le p+j-t\le8$.
20
+ \par\noindent\begin{minipage}{\linewidth}
21
+ \lstinputlisting{../verification/rows.txt}
22
+ \end{minipage}\par
23
+ \smallskip
24
+ \noindent In particular $P^2\eta=\sum_\rho\ell_\rho^2=93527408868499$.
25
+
26
+ \subsection{Three-body arithmetic}
27
+ \label{app:three-arithmetic}
28
+ For $c\in\{1,2\}$, an integer $T\ge0$, and integers $z,p$, define
29
+ \begin{equation}\label{eq:U}
30
+ \mathsf U(c,z,T,p)=
31
+ \sum_{h=\max(0,p+z-T)}^{\min(p,z)}
32
+ (-1)^{z-h}\binom zh\binom{T-z}{p-h}c^{p-h},
33
+ \end{equation}
34
+ and set it to zero if $z$ or $p$ lies outside $[0,T]$. Expanding \eqref{eq:coupling} gives
35
+ \[
36
+ s^{(1/\sqrt3)}_{z,T,p}=\mathsf U(2,z,T,p)
37
+ \sqrt{\frac{2^z\binom Tz}{3^T2^p\binom Tp}}.
38
+ \]
39
+ Substitution in \eqref{eq:ez} and \eqref{eq:alphadata} cancels all radicals:
40
+ \begin{equation}\label{eq:erational}
41
+ P^2e_z=\sum_\rho\sum_{T=\max(z,t_\rho)}^{15}
42
+ \frac{2^z\binom Tz}{3^T2^{t_\rho}\binom T{t_\rho}}
43
+ X_{\rho,T}\left(X_{\rho,T}+2\ell_\rho\mathsf U(2,z,T,t_\rho)\right),
44
+ \end{equation}
45
+ where $X_{\rho,T}=\sum_{p+j=T}a^\rho_{pj}\mathsf U(2,z,T,p)$, with value zero on empty levels. For each $z\in\{2,4,5,\ldots,15\}$, evaluate \eqref{eq:erational} and form the exact rational margin
46
+ $m_z=\frac32(3z-1)(-1/2)^z-e_z$. Write $10^6m_z=n_z/d_z$ with integers $n_z,d_z$ and $d_z>0$. Integer division gives the floors $\lfloor n_z/d_z\rfloor$ listed below:
47
+ \begin{center}
48
+ \begin{tabular}{rrrrrrrrrrrrrr}
49
+ \toprule
50
+ $z$&2&4&5&6&7&8&9&10&11&12&13&14&15\\
51
+ \midrule
52
+ floor&1298313&211317&249&250&249&250&250&250&249&250&250&6470&250\\
53
+ \bottomrule
54
+ \end{tabular}
55
+ \end{center}
56
+ All are positive, proving \eqref{eq:3certificate}.
57
+
58
+ \subsection{Four-body arithmetic}
59
+ \label{app:four-arithmetic}
60
+ Fix $1\le D\le23$; all copy indices below lie in $\mathcal R_D$. Put
61
+ \[
62
+ u_r=\frac1{r!(D-r)!},\qquad
63
+ (E_D)_{rs}=\sqrt{u_ru_s}\,Y_{rs},\qquad
64
+ (G_D)_{rs}=\sqrt{u_ru_s}\,Z_{rs}.
65
+ \]
66
+ The matrices $Y,Z$ are rational. Define
67
+ \[
68
+ \mathsf V_r(D,T;p,j,k)=
69
+ \mathsf U(1,r,j+k,j)\mathsf U(1,D-r,T-r,p),
70
+ \]
71
+ with value zero for $r>j+k$. Two applications of \eqref{eq:coupling} give
72
+ \begin{equation}\label{eq:Srational}
73
+ S_r(D,T;p,j,k)=\mathsf V_r(D,T;p,j,k)
74
+ \sqrt{2^{1-(j+k)-T+r}\frac{j!k!p!\,u_r}{(T-D)!}}.
75
+ \end{equation}
76
+ Therefore
77
+ \begin{equation}\label{eq:Yrational}
78
+ \begin{split}
79
+ P^2Y_{rs}=-\sum_\rho\sum_{\substack{p,j;q,l\\T\ge D}}
80
+ &a^\rho_{pj}a^\rho_{ql}\,
81
+ \mathsf V_r(D,T;p,j,k)\mathsf V_s(D,T;q,l,i)\\
82
+ &\times2^{1-2T+p+q-t_\rho+(r+s)/2}
83
+ \frac{i!k!t_\rho!}{(T-D)!},
84
+ \end{split}
85
+ \end{equation}
86
+ where $i=p+j-t_\rho$, $k=q+l-t_\rho$, and $T=p+j+k$. Both entry sums are ordered. To verify the cancellation, multiply the two factors in \eqref{eq:Srational} by the two factors \eqref{eq:alphadata}; the factorial product under the combined square root is
87
+ $(t_\rho!i!k!)^2u_ru_s/((T-D)!)^2$.
88
+ Using $j+k=T-p$ and $l+i=T-q$, its power of two has exponent
89
+ $2+2p+2q-2t_\rho-4T+r+s$. Taking the positive square root and
90
+ removing $\sqrt{u_ru_s}$ gives exactly the displayed factor.
91
+
92
+ For an increasing quadruple $A$ of nonnegative indices with sum $D+1$, put $f(A)=\prod_{b\in A}b!$. If $(x,y,j,k)$ lists its elements, let $\sigma(x,y,j,k)$ be the sign of sorting this list into increasing order. In each summand below put $p=x+y-1$, and define
93
+ \begin{equation}\label{eq:Lrational}
94
+ L_r(A)=2^{(1-2D+r)/2}
95
+ \sum_{\substack{x<y\text{ in }A\\\{j,k\}=A\setminus\{x,y\},\ j<k}}
96
+ \sigma(x,y,j,k)(x-y)\,p!j!k!\,
97
+ \mathsf V_r(D,D;p,j,k).
98
+ \end{equation}
99
+ Combining \eqref{eq:pairstar} and \eqref{eq:Srational}, the coefficient of $w_{Dr}^*$ on the Slater wedge $A$ is $\sqrt{u_r/f(A)}L_r(A)$. Thus
100
+ \begin{equation}\label{eq:Zrational}
101
+ Z_{rs}=\sum_{\substack{A\text{ increasing quadruple}\\\sum_{b\in A}b=D+1}}
102
+ \frac{L_r(A)L_s(A)}{f(A)}.
103
+ \end{equation}
104
+ All exponents of two in these formulas are integers, since $r,s$ are odd.
105
+
106
+ Let $D_u=\diag(u_r)$ and $D_{\sqrt u}=\diag(\sqrt{u_r})$. The matrix in \eqref{eq:4certificate} equals $D_{\sqrt u}MD_{\sqrt u}$, where
107
+ \begin{equation}\label{eq:M}
108
+ M=ZBZ,\qquad
109
+ B=\diag\bigl((2\mathbf1_{r=1}+\eps)u_r\bigr)-D_uYD_u.
110
+ \end{equation}
111
+ Thus it suffices to check $M\ge0$ using rational arithmetic. This
112
+ congruence uses only the positive diagonal $D_{\sqrt u}$; it does not
113
+ invert $G_D$ or presume that its columns are independent.
114
+
115
+ To check positivity for each $D=1,\ldots,23$, form $Y$ and $Z$ from
116
+ \eqref{eq:Yrational} and \eqref{eq:Zrational}, then form $B$ and $M$ from
117
+ \eqref{eq:M}, using $\eps=3/10^6$. All sums range over the printed rows and
118
+ the finite index sets specified above. Compute with exact fractions
119
+ throughout. If $d=|\mathcal R_D|$, initialize $J=I_d$. For
120
+ $b=1,\ldots,d$, compute in order
121
+ \begin{equation}\label{eq:recurrence}
122
+ X=MJ,\qquad c_b=\frac{\tr X}{b},\qquad J=c_bI_d-X.
123
+ \end{equation}
124
+ This is the Leverrier--Faddeev recurrence applied to $-M$;
125
+ see \cite{HouConference}. It gives
126
+ $\det(xI+M)=x^d+c_1x^{d-1}+\cdots+c_d$. For example, this recurrence follows by multiplying the polynomial adjugate of $xI+M$ by $xI+M$ and comparing coefficients, together with the derivative-of-determinant trace identity. Exact evaluation of \eqref{eq:U}, \eqref{eq:Yrational}, \eqref{eq:Lrational}, \eqref{eq:Zrational}, and \eqref{eq:recurrence} gives:
127
+ \begin{center}
128
+ \begin{tabular}{rl@{\qquad}rl@{\qquad}rl}
129
+ \toprule
130
+ $D$&signs&$D$&signs&$D$&signs\\
131
+ \midrule
132
+ 1&\texttt{0}&9&\texttt{++000}&17&\texttt{++++++000}\\
133
+ 2&\texttt{0}&10&\texttt{+0000}&18&\texttt{+++++0000}\\
134
+ 3&\texttt{00}&11&\texttt{+++000}&19&\texttt{+++++++000}\\
135
+ 4&\texttt{00}&12&\texttt{++0000}&20&\texttt{++++++0000}\\
136
+ 5&\texttt{+00}&13&\texttt{++++000}&21&\texttt{++++++++000}\\
137
+ 6&\texttt{000}&14&\texttt{+++0000}&22&\texttt{+++++++0000}\\
138
+ 7&\texttt{+000}&15&\texttt{+++++000}&23&\texttt{+++++++++000}\\
139
+ 8&\texttt{+000}&16&\texttt{++++0000}&&\\
140
+ \bottomrule
141
+ \end{tabular}
142
+ \end{center}
143
+ The signs list the coefficients after the leading $1$, in descending degree.
144
+ For each computed coefficient, choose a positive denominator and inspect
145
+ its integer numerator: \texttt{+} denotes a positive numerator and
146
+ \texttt{0} denotes zero. We use the characteristic-coefficient positivity test for symmetric
147
+ matrices~\cite[Theorem~5]{PeyrlParrilo}. Every coefficient is nonnegative,
148
+ so $\det(xI+M)>0$ for $x>0$. Since $M$ is real symmetric, a negative eigenvalue would give a positive root of this polynomial. Therefore $M\ge0$, proving \eqref{eq:4certificate}.
149
+
150
+ \begin{remark}[Nature of the certificate]
151
+ The data above certify fixed spin-matrix inequalities. The positive comparison operator is a sum of squares by construction. No many-particle finite-size spectrum, numerical extrapolation, or assumed plasma property enters the argument. The exact equalities and inequalities in this appendix can be verified by a finite calculation using only integers and rational numbers.
152
+ \end{remark}
preprints/A-Fock-space-inequality-and-the-Laughlin-spectral-gap-September-24-2026/verification/rows.txt ADDED
@@ -0,0 +1,20 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ 0 7181518 05:-849651 07:-2958744 15:751659 16:-43084 17:-146216 32:720949 35:-127514
2
+ 42:222437 43:-262822 53:-117700 61:-55024 71:-166049
3
+ 1 -112991 05:142772 06:-142342 07:527055 08:50742 16:197917 18:-18343 24:5764 27:-21183
4
+ 32:75832 35:-6115 45:2660 53:-9455 61:-27091 63:-3494 71:479 72:-15331
5
+ 1 -4247311 05:-12207250 06:-14064191 07:-14063663 08:-15662679 16:483831 18:3987214
6
+ 24:-814558 27:888887 32:966462 35:145978 45:-171722 53:34350 61:389319 63:97603
7
+ 71:412447 72:-53786
8
+ 2 3438746 14:6689266 15:6620205 16:6625065 17:4969272 18:4878238 27:-1387380 36:-586188
9
+ 37:344087 42:-1120634 45:-318530 46:559169 55:157455 61:1207103 63:211617 64:33240
10
+ 71:577001 73:-142578
11
+ 5 -98645 05:-2719776 08:-8519913 14:-949523 17:-1952105 18:-1562606 28:-8919966 32:248826
12
+ 35:-1017623 37:3656005 38:-2081871 42:-33163 43:-305905 46:35677 47:-1320749
13
+ 48:-1040378 53:502094 55:1060633 58:-998003 61:-113617 63:184919 64:209239 65:-68198
14
+ 67:-266297 72:-606696 73:-563620 74:437345 76:-432189
15
+ 5 -3160276 05:-1698129 08:10575875 14:-252576 17:-8002616 18:22592844 28:7370640
16
+ 32:289294 35:1400647 37:1987740 38:4030699 42:-1731401 43:-1034062 46:-1106371
17
+ 47:-1257051 48:1461735 53:1408149 55:1136847 58:1878501 61:-2838516 63:-734099
18
+ 64:1062416 65:11745 67:611312 72:-480776 73:20459 74:316925 76:37092
19
+ 7 1441784 07:3441286 08:-6097155 37:-1002399 47:-251321 58:1143225 66:-17397 71:-1007464
20
+ 73:-662286 76:-344621 78:-1115284
preprints/A-Fully-Polynomial-Randomized-Approximation-Scheme-for-Perfect-Matchings-in-General-Graphs-September-23-2026/README.md ADDED
@@ -0,0 +1,18 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ # [A Fully Polynomial Randomized Approximation Scheme for Perfect Matchings in General Graphs](main.pdf)
2
+
3
+ **Author:** OpenAI
4
+
5
+ **Date:** September 23, 2026
6
+
7
+ ## Citation
8
+
9
+ ```bibtex
10
+ @misc{OAI:A-Fully-Polynomial-Randomized-Approximation-Scheme-for-Perfect-Matchings-in-General-Graphs-September-23-2026,
11
+ author = {{OpenAI}},
12
+ title = {{A Fully Polynomial Randomized Approximation Scheme for Perfect Matchings in General Graphs}},
13
+ howpublished = {OpenAI Math Release preprint
14
+ \href{https://github.com/openai/math/blob/main/preprints/A-Fully-Polynomial-Randomized-Approximation-Scheme-for-Perfect-Matchings-in-General-Graphs-September-23-2026/main.pdf}{OAI:A-Fully-Polynomial-Randomized-Approximation-Scheme-for-Perfect-Matchings-in-General-Graphs-September-23-2026}},
15
+ year = {2026}
16
+ }
17
+ ```
18
+
preprints/A-Fully-Polynomial-Randomized-Approximation-Scheme-for-Perfect-Matchings-in-General-Graphs-September-23-2026/build/main.tex ADDED
The diff for this file is too large to render. See raw diff
 
preprints/A-Fully-Polynomial-Randomized-Approximation-Scheme-for-Perfect-Matchings-in-General-Graphs-September-23-2026/main.pdf ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:1510b15725ee7e92a6c543484c6c02ce7f26347a32c1a11cd66c5890b94c6de1
3
+ size 617073
preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/README.md ADDED
@@ -0,0 +1,16 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ # [A Gepner stability condition on every smooth quintic threefold](paper.pdf)
2
+
3
+ OpenAI
4
+ September 24, 2026
5
+
6
+ ## Citation
7
+
8
+ ```bibtex
9
+ @misc{OAI:A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026,
10
+ author = {{OpenAI}},
11
+ title = {{A Gepner stability condition on every smooth quintic threefold}},
12
+ howpublished = {OpenAI Math Release preprint
13
+ \href{https://github.com/openai/math/blob/main/preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/paper.pdf}{OAI:A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026}},
14
+ year = {2026}
15
+ }
16
+ ```
preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/build/figures/fifth-phase-grid.tex ADDED
@@ -0,0 +1,39 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \begin{figure}[tbp]
2
+ \centering
3
+ \begin{tikzpicture}[x=1.45cm,y=1cm,>=Stealth,
4
+ every node/.style={font=\small}]
5
+ \foreach \k in {0,...,5} {
6
+ \node (v\k) at (\k,1.1) {$V_{\k}$};
7
+ }
8
+ \foreach \k in {0,...,4} {
9
+ \pgfmathtruncatemacro{\next}{\k+1}
10
+ \draw[->] (v\next.west) -- (v\k.east);
11
+ }
12
+ \draw[->] (v0.north) to[bend left=35]
13
+ node[above] {$\Phi$} (v2.north);
14
+ \draw[->] (v0.north) to[bend left=40]
15
+ node[above] {$[1]$} (v5.north);
16
+ \foreach \k in {0,...,4} {
17
+ \fill[blue!6] (\k,-0.05) rectangle (\k+1,0.4);
18
+ \node at (\k+0.5,0.175) {$\mathcal S_{\k}$};
19
+ }
20
+ \draw (0,-0.05) -- (5,-0.05);
21
+ \foreach \k in {0,...,5} {
22
+ \draw (\k,0.4) -- (\k,-0.12);
23
+ }
24
+ \node[below] at (0,-0.12) {$0$};
25
+ \foreach \k in {1,...,4} {
26
+ \node[below] at (\k,-0.12) {$\k/5$};
27
+ }
28
+ \node[below] at (5,-0.12) {$1$};
29
+ \node[below] at (2.5,-0.65) {charge phase};
30
+ \end{tikzpicture}
31
+ \caption{The fifth-phase grid. Inclusion arrows point toward the larger
32
+ aisle. The autoequivalence $\Phi$ advances two indices, and the shift $[1]$
33
+ advances five. A nonzero object of $\mathcal S_k$ has charge phase in the
34
+ closed interval $[k/5,(k+1)/5]$, by Proposition~\ref{prop:block-support}.
35
+ At a shared endpoint, generators from both adjacent blocks enter the
36
+ definition of the slicing. The diagram shows the unperturbed grid;
37
+ Proposition~\ref{prop:fine-grid} gives the independent-parameter nesting.}
38
+ \label{fig:fifth-phase-grid}
39
+ \end{figure}
preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/build/paper.tex ADDED
@@ -0,0 +1,61 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \documentclass[11pt]{article}
2
+ \usepackage[T1]{fontenc}
3
+ \usepackage[utf8]{inputenc}
4
+ \usepackage{lmodern}
5
+ \usepackage[margin=1in]{geometry}
6
+ \usepackage{amsmath,amssymb,amsthm,mathtools}
7
+ \usepackage{enumitem}
8
+ \usepackage{microtype}
9
+ \usepackage{xcolor}
10
+ \usepackage{tikz}
11
+ \usetikzlibrary{arrows.meta}
12
+ \usepackage[unicode,colorlinks=true,linkcolor=blue!45!black,citecolor=blue!45!black,urlcolor=blue!45!black]{hyperref}
13
+ \numberwithin{equation}{section}
14
+ \newtheorem{theorem}{Theorem}[section]
15
+ \newtheorem{lemma}[theorem]{Lemma}
16
+ \newtheorem{proposition}[theorem]{Proposition}
17
+ \newtheorem{corollary}[theorem]{Corollary}
18
+ \theoremstyle{definition}
19
+ \newtheorem{definition}[theorem]{Definition}
20
+ \theoremstyle{remark}
21
+ \newtheorem{remark}[theorem]{Remark}
22
+ \newcommand{\C}{\mathbb C}
23
+ \newcommand{\R}{\mathbb R}
24
+ \newcommand{\Z}{\mathbb Z}
25
+ \newcommand{\Q}{\mathbb Q}
26
+ \newcommand{\D}{\mathcal D}
27
+ \newcommand{\OO}{\mathcal O}
28
+ \newcommand{\Db}{D^{\mathrm b}}
29
+ \newcommand{\Knum}{K_{\mathrm{num}}}
30
+ \newcommand{\norm}[1]{\left\lVert#1\right\rVert}
31
+ \DeclareMathOperator{\Coh}{Coh}
32
+ \DeclareMathOperator{\ch}{ch}
33
+ \DeclareMathOperator{\rk}{rk}
34
+ \DeclareMathOperator{\Hom}{Hom}
35
+ \DeclareMathOperator{\Ext}{Ext}
36
+ \DeclareMathOperator{\im}{im}
37
+ \renewcommand{\Re}{\operatorname{Re}}
38
+ \renewcommand{\Im}{\operatorname{Im}}
39
+ \setlist{itemsep=3pt,topsep=5pt}
40
+ \setlength{\emergencystretch}{1em}
41
+ \title{A Gepner stability condition on every smooth quintic threefold}
42
+ \author{OpenAI}
43
+ \date{September 24, 2026}
44
+ \hypersetup{pdftitle={A Gepner stability condition on every smooth quintic threefold},pdfauthor={OpenAI}}
45
+ \begin{document}
46
+ \maketitle
47
+ \begin{abstract}
48
+ We prove Toda's normalized quintic Gepner conjecture. On every smooth complex
49
+ quintic threefold, we construct a numerical Bridgeland stability condition for
50
+ which tensoring by the hyperplane bundle, followed by the spherical twist at
51
+ the structure sheaf, increases phase by $2/5$.
52
+ \end{abstract}
53
+ \input{sections/introduction}
54
+ \input{sections/numerical}
55
+ \input{sections/aisles}
56
+ \input{sections/grid}
57
+ \appendix
58
+ \input{sections/periodicity}
59
+ \bibliographystyle{plain}
60
+ \bibliography{references}
61
+ \end{document}
preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/build/references.bib ADDED
@@ -0,0 +1,212 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ @article{Bridgeland2007,
2
+ author = {Bridgeland, Tom},
3
+ title = {Stability conditions on triangulated categories},
4
+ journal = {Annals of Mathematics},
5
+ series = {2},
6
+ volume = {166},
7
+ number = {2},
8
+ year = {2007},
9
+ pages = {317--345},
10
+ doi = {10.4007/annals.2007.166.317},
11
+ note = {\url{https://doi.org/10.4007/annals.2007.166.317}},
12
+ url = {https://annals.math.princeton.edu/2007/166-2/p01}
13
+ }
14
+
15
+ @article{HappelReitenSmalo1996,
16
+ author = {Happel, Dieter and Reiten, Idun and Smal{\o}, Sverre O.},
17
+ title = {Tilting in abelian categories and quasitilted algebras},
18
+ journal = {Memoirs of the American Mathematical Society},
19
+ volume = {120},
20
+ number = {575},
21
+ pages = {viii+88},
22
+ year = {1996},
23
+ doi = {10.1090/memo/0575},
24
+ note = {\url{https://doi.org/10.1090/memo/0575}},
25
+ url = {https://doi.org/10.1090/memo/0575}
26
+ }
27
+
28
+ @article{SeidelThomas2001,
29
+ author = {Seidel, Paul and Thomas, Richard P.},
30
+ title = {Braid group actions on derived categories of coherent sheaves},
31
+ journal = {Duke Mathematical Journal},
32
+ volume = {108},
33
+ number = {1},
34
+ year = {2001},
35
+ pages = {37--108},
36
+ doi = {10.1215/S0012-7094-01-10812-0},
37
+ note = {\url{https://doi.org/10.1215/S0012-7094-01-10812-0}},
38
+ eprint = {math/0001043},
39
+ archivePrefix = {arXiv},
40
+ primaryClass = {math.AG},
41
+ url = {https://arxiv.org/abs/math/0001043}
42
+ }
43
+
44
+ @incollection{Orlov2009,
45
+ author = {Orlov, Dmitri},
46
+ title = {Derived categories of coherent sheaves and triangulated categories of singularities},
47
+ booktitle = {Algebra, Arithmetic, and Geometry: In Honor of {Yu. I. Manin}},
48
+ editor = {Tschinkel, Yuri and Zarhin, Yuri},
49
+ series = {Progress in Mathematics},
50
+ volume = {270},
51
+ publisher = {Birkh{\"a}user},
52
+ address = {Boston, MA},
53
+ year = {2009},
54
+ pages = {503--531},
55
+ doi = {10.1007/978-0-8176-4747-6_16},
56
+ note = {\url{https://doi.org/10.1007/978-0-8176-4747-6_16}},
57
+ eprint = {math/0503632},
58
+ archivePrefix = {arXiv},
59
+ primaryClass = {math.AG},
60
+ url = {https://arxiv.org/abs/math/0503632}
61
+ }
62
+
63
+ @article{BayerMacriToda2014,
64
+ author = {Bayer, Arend and Macr{\`i}, Emanuele and Toda, Yukinobu},
65
+ title = {{Bridgeland} stability conditions on threefolds {I}: {Bogomolov--Gieseker} type inequalities},
66
+ journal = {Journal of Algebraic Geometry},
67
+ volume = {23},
68
+ number = {1},
69
+ year = {2014},
70
+ pages = {117--163},
71
+ doi = {10.1090/S1056-3911-2013-00617-7},
72
+ note = {\url{https://doi.org/10.1090/S1056-3911-2013-00617-7}},
73
+ eprint = {1103.5010},
74
+ archivePrefix = {arXiv},
75
+ primaryClass = {math.AG},
76
+ url = {https://arxiv.org/abs/1103.5010v2}
77
+ }
78
+
79
+ @misc{Toda2013,
80
+ author = {Toda, Yukinobu},
81
+ title = {{Gepner} type stability conditions on graded matrix factorizations},
82
+ year = {2013},
83
+ eprint = {1302.6293v1},
84
+ archivePrefix = {arXiv},
85
+ primaryClass = {math.AG},
86
+ doi = {10.48550/arXiv.1302.6293},
87
+ url = {https://arxiv.org/abs/1302.6293v1},
88
+ note = {\href{https://arxiv.org/abs/1302.6293v1}{arXiv:1302.6293v1}. Version 1, 26 February 2013}
89
+ }
90
+
91
+ @misc{TodaQuintic2013,
92
+ author = {Toda, Yukinobu},
93
+ title = {{Gepner} point and strong {Bogomolov--Gieseker} inequality for quintic 3-folds},
94
+ year = {2013},
95
+ eprint = {1305.0345v3},
96
+ archivePrefix = {arXiv},
97
+ primaryClass = {math.AG},
98
+ doi = {10.48550/arXiv.1305.0345},
99
+ url = {https://arxiv.org/abs/1305.0345v3},
100
+ note = {\href{https://arxiv.org/abs/1305.0345v3}{arXiv:1305.0345v3}. Version 3, 7 May 2013; first posted 2 May 2013}
101
+ }
102
+
103
+ @article{Li2019,
104
+ author = {Li, Chunyi},
105
+ title = {On stability conditions for the quintic threefold},
106
+ journal = {Inventiones Mathematicae},
107
+ volume = {218},
108
+ number = {1},
109
+ year = {2019},
110
+ pages = {301--340},
111
+ doi = {10.1007/s00222-019-00888-z},
112
+ note = {\url{https://doi.org/10.1007/s00222-019-00888-z}},
113
+ eprint = {1810.03434},
114
+ archivePrefix = {arXiv},
115
+ primaryClass = {math.AG},
116
+ url = {https://arxiv.org/abs/1810.03434v2}
117
+ }
118
+
119
+ @misc{Xu2026,
120
+ author = {Xu, Chunkai},
121
+ title = {Stronger {Bogomolov--Gieseker} type inequality on quintic threefold},
122
+ year = {2026},
123
+ eprint = {2511.21288v2},
124
+ archivePrefix = {arXiv},
125
+ primaryClass = {math.AG},
126
+ doi = {10.48550/arXiv.2511.21288},
127
+ url = {https://arxiv.org/abs/2511.21288v2},
128
+ note = {\href{https://arxiv.org/abs/2511.21288v2}{arXiv:2511.21288v2}. Version 2, 4 January 2026; first posted 26 November 2025}
129
+ }
130
+
131
+ @article{Tattar2021,
132
+ author = {Tattar, Aran},
133
+ title = {Torsion pairs and quasi-abelian categories},
134
+ journal = {Algebras and Representation Theory},
135
+ volume = {24},
136
+ year = {2021},
137
+ pages = {1557--1581},
138
+ doi = {10.1007/s10468-020-10004-y},
139
+ note = {\url{https://doi.org/10.1007/s10468-020-10004-y}},
140
+ url = {https://link.springer.com/article/10.1007/s10468-020-10004-y}
141
+ }
142
+
143
+ @article{Douglas2001,
144
+ author = {Douglas, Michael R.},
145
+ title = {D-branes, Categories and {N=1} Supersymmetry},
146
+ journal = {Journal of Mathematical Physics},
147
+ volume = {42},
148
+ year = {2001},
149
+ pages = {2818--2843},
150
+ doi = {10.1063/1.1374448},
151
+ note = {\url{https://doi.org/10.1063/1.1374448}},
152
+ eprint = {hep-th/0011017},
153
+ archivePrefix = {arXiv},
154
+ url = {https://arxiv.org/abs/hep-th/0011017v4}
155
+ }
156
+
157
+ @misc{KontsevichSoibelman2008,
158
+ author = {Kontsevich, Maxim and Soibelman, Yan},
159
+ title = {Stability structures, motivic {Donaldson--Thomas} invariants and cluster transformations},
160
+ year = {2008},
161
+ note = {\href{https://arxiv.org/abs/0811.2435v1}{arXiv:0811.2435v1}},
162
+ eprint = {0811.2435},
163
+ archivePrefix = {arXiv},
164
+ url = {https://arxiv.org/abs/0811.2435v1}
165
+ }
166
+
167
+ @article{BallardFaveroKatzarkov2012,
168
+ author = {Ballard, Matthew and Favero, David and Katzarkov, Ludmil},
169
+ title = {{Orlov} spectra: bounds and gaps},
170
+ journal = {Inventiones Mathematicae},
171
+ volume = {189},
172
+ year = {2012},
173
+ pages = {359--430},
174
+ eprint = {1012.0864v3},
175
+ archivePrefix = {arXiv},
176
+ primaryClass = {math.AG},
177
+ url = {https://arxiv.org/abs/1012.0864v3},
178
+ note = {\href{https://arxiv.org/abs/1012.0864v3}{arXiv:1012.0864v3}. Version 3, 14 October 2013}
179
+ }
180
+
181
+ @misc{Aspinwall2004,
182
+ author = {Aspinwall, Paul S.},
183
+ title = {{D}-branes on {Calabi--Yau} manifolds},
184
+ year = {2004},
185
+ eprint = {hep-th/0403166v1},
186
+ archivePrefix = {arXiv},
187
+ url = {https://arxiv.org/abs/hep-th/0403166v1},
188
+ note = {\href{https://arxiv.org/abs/hep-th/0403166v1}{arXiv:hep-th/0403166v1}. Version 1, 16 March 2004}
189
+ }
190
+
191
+ @article{BorelSerre1958,
192
+ author = {Borel, Armand and Serre, Jean-Pierre},
193
+ title = {Le th{\'e}or{\`e}me de {Riemann--Roch}},
194
+ journal = {Bulletin de la Soci{\'e}t{\'e} Math{\'e}matique de France},
195
+ volume = {86},
196
+ year = {1958},
197
+ pages = {97--136},
198
+ note = {\url{https://www.numdam.org/item/BSMF_1958__86__97_0/}},
199
+ url = {https://www.numdam.org/item/BSMF_1958__86__97_0/}
200
+ }
201
+
202
+ @misc{Catanese2014,
203
+ author = {Catanese, Fabrizio},
204
+ title = {Topological methods in moduli theory},
205
+ year = {2014},
206
+ eprint = {1411.3235v1},
207
+ archivePrefix = {arXiv},
208
+ primaryClass = {math.AG},
209
+ url = {https://arxiv.org/abs/1411.3235v1},
210
+ note = {\href{https://arxiv.org/abs/1411.3235v1}{arXiv:1411.3235v1}. Version 1}
211
+ }
212
+
preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/build/sections/aisles.tex ADDED
@@ -0,0 +1,492 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{A uniform family of double-tilt aisles}
2
+ \label{sec:aisles}
3
+
4
+ Our goal is to construct bounded aisles $U_\eta$ for which
5
+ $\Phi U_\eta\subset U_\theta$ holds uniformly with independent parameters.
6
+ We begin with Toda's proposed two tilts for the quintic Gepner charge
7
+ \cite[Sections~3.4--3.6]{TodaQuintic2013}, and vary the second cut in two
8
+ numerical directions. The slope estimate below supplies the strict margins
9
+ that make the comparison survive these variations.
10
+ The two first-tilt slopes $-1/2$ and $1/2$ reflect the order of the factors
11
+ in $\Phi$: tensoring by $\OO_X(1)$ moves the first cut from $-1/2$ to
12
+ $1/2$, and the spherical twist will take the resulting aisle into one
13
+ constructed at $-1/2$.
14
+
15
+ We first isolate the geometric input. Slope always means
16
+ $\mu(F)=c(F)/r(F)$ for a torsion-free sheaf of positive rank. We use
17
+ ordinary slope Harder--Narasimhan filtrations, writing $\mu^+(F)$ and
18
+ $\mu^-(F)$ for their largest and smallest slopes. For an arbitrary
19
+ sheaf, its torsion subsheaf is removed before these slopes are taken.
20
+
21
+ \begin{lemma}[Slope input]\label{lem:slope-input}
22
+ Put
23
+ \[
24
+ f(x)=\max\left\{-\frac{3x}{25},\ \frac{x}{2}-\frac7{25},\
25
+ \frac{28x}{25}-\frac{31}{50}\right\}
26
+ \qquad(0\leq x\leq1).
27
+ \]
28
+ Every torsion-free slope-semistable sheaf $F$ on $X$ with
29
+ $|\mu(F)|\leq1$ satisfies
30
+ \begin{equation}\label{eq:slope-envelope}
31
+ \frac{d(F)}{r(F)}\leq f(|\mu(F)|).
32
+ \end{equation}
33
+ The estimate extends under integral twists by
34
+ $(x,y)\mapsto(x+n,y+nx+n^2/2)$. In particular,
35
+ $f(x)\leq0$ for $0\leq x\leq1/2$, and $f(1/2)=-3/100$.
36
+ \end{lemma}
37
+
38
+ \begin{proof}
39
+ We use Xu's Theorem~1.3 \cite{Xu2026}. Its hypotheses are precisely a
40
+ smooth complex quintic threefold with its hyperplane polarization and a
41
+ torsion-free slope-semistable sheaf of slope in $[-1,1]$; its coordinates
42
+ $\mu_H$ and $\xi_H$ are our $c/r$ and $d/r$. On $[0,1/2]$ its upper
43
+ bound $g$ is
44
+ \[
45
+ g(x)=
46
+ \begin{cases}
47
+ -x/2,&0\leq x\leq1/4,\\
48
+ x/2-1/4,&1/4\leq x\leq5/13,\\
49
+ -3x/20,&5/13\leq x\leq6/13,\\
50
+ x/2-3/10,&6/13\leq x\leq1/2.
51
+ \end{cases}
52
+ \]
53
+ The first and third lines are at most $-3x/25$; the second is also at
54
+ most $-3x/25$ because $5/13<25/62$; and the last is at most
55
+ $x/2-7/25$. Thus $g\leq f$ on this half interval. The full upper
56
+ bound $g$ in Xu's theorem and the maximum $f$ both satisfy
57
+ \[
58
+ h(1-x)=h(x)+\frac12-x.
59
+ \]
60
+ For $f$, this reflection exchanges the first and third affine pieces
61
+ and fixes the second. This proves the comparison on $[0,1]$, and the
62
+ theorem uses $|\mu|$ on the negative strip.
63
+
64
+ For completeness, the symmetry is also compatible with the sheaf
65
+ operations used here. Twisting by $\OO_X(n)$ has the displayed effect
66
+ on $(x,y)$ and preserves slope semistability. If $F$ is not reflexive,
67
+ passing to $F^{**}$ preserves slope semistability and $r,c$, and only
68
+ increases $d$. For a reflexive sheaf on a smooth threefold the higher
69
+ sheaf Ext terms of its derived dual are supported in dimension zero,
70
+ so its ordinary dual has characters $(r,-c,d)$ through degree two and
71
+ is slope-semistable. The operations of dualizing and twisting by
72
+ $\OO_X(1)$ therefore give $(x,y)\mapsto(1-x,y+1/2-x)$ without changing
73
+ the validity of an upper bound. Finally the three defining lines are
74
+ nonpositive on $[0,1/2]$, and their maximum at $1/2$ is $-3/100$.
75
+ \end{proof}
76
+
77
+ We use aisles in the convention $\D^{\leq0}$: they are closed under
78
+ $[1]$, and the heart of an aisle $V$ is $V\cap(V[1])^\perp$, where
79
+ $\perp$ denotes right Hom orthogonality. Recall explicitly the tilt
80
+ construction of Happel--Reiten--Smal\o\ \cite{HappelReitenSmalo1996}.
81
+ A torsion pair $(\mathcal T,\mathcal F)$ in the heart of
82
+ a bounded aisle $V$ gives the aisle
83
+ \begin{equation}\label{eq:aisle-tilt}
84
+ V^\sharp=\{E\in V:H^0_V(E)\in\mathcal T\},\qquad
85
+ \mathcal H^\sharp=\langle\mathcal F[1],\mathcal T\rangle,
86
+ \qquad V[1]\subset V^\sharp\subset V.
87
+ \end{equation}
88
+ Here and below angle brackets denote extension closure. To construct
89
+ the new truncation triangle, first truncate at zero for $V$, then take
90
+ the inverse image of the torsion subobject of its zeroth cohomology.
91
+ The remaining triangle has terms from $\mathcal F$ and the old positive
92
+ degrees. The old orthogonality and
93
+ $\Hom(\mathcal T,\mathcal F)=0$ give the required new orthogonality.
94
+ Shift closure and the two inclusions prove that this is a bounded
95
+ $t$-structure. The same truncations show conversely that an aisle
96
+ between $V[1]$ and $V$ gives a torsion pair in the heart of $V$.
97
+
98
+ For $b\in\{-1/2,1/2\}$, let $\mathcal C_{\leq b}$ consist of zero
99
+ and the torsion-free sheaves with $\mu^+\leq b$, and let
100
+ $\mathcal C_{>b}$ consist of sheaves whose torsion-free quotient has
101
+ $\mu^->b$, together with all torsion sheaves. Ordinary slope
102
+ filtrations give the torsion pair
103
+ $(\mathcal C_{>b},\mathcal C_{\leq b})$ in $\Coh(X)$. Define the
104
+ first tilted heart and its aisle by
105
+ \[
106
+ \mathcal B_b=\langle\mathcal C_{\leq b}[1],\mathcal C_{>b}\rangle,
107
+ \qquad W_b=\D^{\leq0}_{\mathcal B_b},
108
+ \qquad p_b=c-br.
109
+ \]
110
+ On $\mathcal B_b$, $p_b$ takes values in $\frac12\Z_{\geq0}$, by
111
+ Lemma~\ref{lem:numerical}. For $E\in\mathcal B_b$, the equality
112
+ $p_b(E)=0$ holds exactly when $H^{-1}(E)$ is slope-semistable of slope
113
+ $b$ (or zero), and $H^0(E)$ has dimension at most one. This follows
114
+ by applying $p_b$ to the slope factors of the two cohomology sheaves:
115
+ each contribution is nonnegative, and a nonzero divisorial torsion
116
+ sheaf has positive $c$.
117
+
118
+ \begin{lemma}\label{lem:first-tilt-noetherian}
119
+ The abelian categories $\mathcal B_{-1/2}$ and $\mathcal B_{1/2}$ are
120
+ noetherian.
121
+ \end{lemma}
122
+
123
+ \begin{proof}
124
+ We give the rational first-tilt argument; compare
125
+ \cite[proof of Lemma~3.2.4]{BayerMacriToda2014}.
126
+ Consider epimorphisms $E_0\twoheadrightarrow E_1\twoheadrightarrow
127
+ E_2\twoheadrightarrow\cdots$ in $\mathcal B_b$, with kernels $K_i$
128
+ for the individual arrows. The nonnegative discrete numbers
129
+ $p_b(E_i)$ eventually stabilize, so $p_b(K_i)=0$. The ordinary
130
+ cohomology sheaves $H^0(E_i)$ form a sequence of epimorphisms and
131
+ eventually stabilize, since $\Coh(X)$ is noetherian. The preceding
132
+ description of $K_i$ gives $r(K_i)\leq0$, hence the integers $r(E_i)$
133
+ are nondecreasing. They are bounded above by the now fixed rank of
134
+ $H^0(E_i)$, so eventually $r(K_i)=0$. Each remaining $K_i$ is then an
135
+ ordinary sheaf of dimension at most one.
136
+
137
+ The cohomology sequence now reads
138
+ \[
139
+ 0\longrightarrow H^{-1}(E_i)\longrightarrow H^{-1}(E_{i+1})
140
+ \longrightarrow K_i\longrightarrow0.
141
+ \]
142
+ These torsion-free sheaves agree in codimension one. Their injections
143
+ extend to isomorphisms of their reflexive hulls, so they form an
144
+ increasing chain of coherent subsheaves of a fixed reflexive sheaf.
145
+ That chain stabilizes, forcing $K_i=0$. Thus every such sequence of
146
+ epimorphisms stabilizes, as required.
147
+ \end{proof}
148
+
149
+ The first tilted hearts are now available. We define the second cut and choose
150
+ constants for three uses: negativity at the slope boundary, exclusion of a
151
+ small neighboring slope strip, and a strict comparison between the two cuts.
152
+ At zero perturbation and $b=-1/2$, the cut is the imaginary part of the
153
+ normalized Gepner charge, as in Toda's candidate heart
154
+ \cite[Section~3.6]{TodaQuintic2013}. Fix
155
+ \begin{equation}\label{eq:aisle-parameters}
156
+ \begin{gathered}
157
+ \delta=10^{-5},\qquad s_0=\frac{553}{1000},\qquad
158
+ B_\delta=\{\eta=(\eta_0,\eta_1)\in\R^2:|\eta_j|<\delta\},\\
159
+ N_b^\eta=d-bc+ur+\eta_1c+\eta_0r.
160
+ \end{gathered}
161
+ \end{equation}
162
+ The following exact margins will be useful:
163
+ \begin{align}
164
+ m_b&=\frac7{25}-u-\frac32\delta>0,\label{eq:boundary-margin}\\
165
+ m_s&=\frac{13857}{50000}-u-(1+s_0)\delta>0,
166
+ \label{eq:strip-margin}\\
167
+ m_c&=\frac12-\frac{u}{s_0}-3\delta>0.\label{eq:comparison-margin}
168
+ \end{align}
169
+ For example, $\sqrt5>223606/100000$ implies
170
+ $u<138197/500000$, and gives respectively the positive lower bounds
171
+ $3591/10^6$, $73047/10^8$, and $8941/55300000$ for these three
172
+ expressions. On a slope-semistable sheaf $F$ of slope $b$,
173
+ Lemma~\ref{lem:slope-input} gives
174
+ \begin{equation}\label{eq:boundary-negative}
175
+ \frac{N_b^\eta(F)}{r(F)}
176
+ \leq -\frac3{100}-\frac14+u+\frac32\delta=-m_b<0.
177
+ \end{equation}
178
+ Consequently $N_b^\eta\geq0$ on the $p_b=0$ objects of $\mathcal B_b$;
179
+ equality holds precisely for zero-dimensional sheaves, including zero.
180
+ Indeed their degree-minus-one part contributes strictly positively
181
+ unless it vanishes, while a sheaf of dimension at most one has
182
+ $N_b^\eta=d\geq0$, with equality exactly in dimension zero.
183
+
184
+ Call a nonzero object of $\mathcal B_b$ \emph{high} if $p_b=0$ or
185
+ $N_b^\eta>0$, and \emph{low} otherwise. Thus low means $p_b>0$ and
186
+ $N_b^\eta\leq0$. Set
187
+ \[
188
+ \begin{split}
189
+ \mathcal T_b^\eta&=\{E:\text{every nonzero quotient of $E$ in
190
+ $\mathcal B_b$ is high}\},\\
191
+ \mathcal F_b^\eta&=\{E:\text{every nonzero subobject of $E$ in
192
+ $\mathcal B_b$ is low}\}.
193
+ \end{split}
194
+ \]
195
+
196
+ \begin{lemma}[The second tilt]\label{lem:second-tilt}
197
+ For every $b=\pm1/2$ and $\eta\in B_\delta$, the pair
198
+ $(\mathcal T_b^\eta,\mathcal F_b^\eta)$ is a torsion pair. Its tilt
199
+ has bounded heart and aisle
200
+ \[
201
+ \mathcal A_b^\eta=\langle\mathcal F_b^\eta[1],\mathcal T_b^\eta\rangle,
202
+ \qquad \mathcal U_b^\eta
203
+ =\{E\in W_b:H^0_{\mathcal B_b}(E)\in\mathcal T_b^\eta\}.
204
+ \]
205
+ On $\mathcal A_b^\eta$ one has $N_b^\eta\geq0$, and no nonzero object
206
+ of this heart has zero numerical class.
207
+ \end{lemma}
208
+
209
+ \begin{proof}
210
+ High objects are closed under extensions: if one end term has positive
211
+ $N_b^\eta$, so does the extension, and otherwise both have $p_b=0$.
212
+ It follows, by taking the induced filtration on a quotient, that
213
+ $\mathcal T_b^\eta$ is closed under quotients and extensions.
214
+
215
+ If an object has a high subobject, choose such a nonzero subobject $A$
216
+ with $p_b(A)$ minimal. When $p_b(A)=0$, all its quotients have
217
+ $p_b=0$. Otherwise $N_b^\eta(A)>0$, and a low quotient $Q$ would
218
+ have $p_b(Q)>0$ and $N_b^\eta(Q)\leq0$. Its kernel would then be a
219
+ high subobject with strictly smaller $p_b$, a contradiction. Thus
220
+ $A\in\mathcal T_b^\eta$ in either case.
221
+
222
+ By Lemma~\ref{lem:first-tilt-noetherian}, every object has a maximal
223
+ $\mathcal T_b^\eta$ subobject; sums of such subobjects again belong to
224
+ $\mathcal T_b^\eta$, so maximality has its usual torsion meaning. The
225
+ quotient has no high subobject, since such a subobject would contain
226
+ a nonzero member of $\mathcal T_b^\eta$ by the preceding paragraph,
227
+ and its inverse image would enlarge the maximal torsion subobject.
228
+ The quotient therefore lies in $\mathcal F_b^\eta$. Finally a
229
+ nonzero image of a map from $\mathcal T_b^\eta$ to
230
+ $\mathcal F_b^\eta$ would be both high and low. This proves the
231
+ torsion pair, and \eqref{eq:aisle-tilt} gives boundedness.
232
+
233
+ Write an object of the new heart as an extension of $T$ by $F[1]$,
234
+ where $T\in\mathcal T_b^\eta$ and $F\in\mathcal F_b^\eta$. Then
235
+ $N_b^\eta(T)\geq0$ and $N_b^\eta(F)\leq0$, proving nonnegativity.
236
+ If $N_b^\eta(E)=0$, both terms have $N_b^\eta=0$. Since $T$ itself
237
+ is high when nonzero, this forces $p_b(T)=0$, hence $T$ is
238
+ zero-dimensional. If $F\ne0$, then $p_b(F)>0$ and
239
+ $p_b(E)=-p_b(F)<0$. Thus $[E]=0$ would force $F=0$; it would then
240
+ force $T=0$, since $e(T)=\operatorname{length}(T)/5$. This proves
241
+ the last assertion.
242
+ \end{proof}
243
+
244
+ We next compare the two slope cuts with independent parameters.
245
+ Subscripts $-$ and $+$ mean $b=-1/2$ and $b=1/2$, respectively.
246
+
247
+ \begin{lemma}\label{lem:compare-slope-cuts}
248
+ For every $\alpha,\theta\in B_\delta$,
249
+ \[
250
+ \mathcal U_+^\alpha\subset\mathcal U_-^\theta.
251
+ \]
252
+ \end{lemma}
253
+
254
+ \begin{proof}
255
+ Let $\mathcal M$ be the ordinary torsion-free sheaves all of whose
256
+ slopes lie in $(-1/2,1/2]$, and let
257
+ \[
258
+ \mathcal L=\langle\mathcal C_{\leq-1/2}[1],\mathcal C_{>1/2}\rangle
259
+ =\mathcal B_-\cap\mathcal B_+.
260
+ \]
261
+ To see the torsion pair $(\mathcal L,\mathcal M)$ in $\mathcal B_-$,
262
+ take $E\in\mathcal B_-$ and let $M_E$ be the quotient of $H^0(E)$
263
+ obtained by removing its torsion and its slope factors above $1/2$.
264
+ Then $M_E\in\mathcal M$. The kernel of $E\to M_E$ in
265
+ $\mathcal B_-$ has degree-minus-one cohomology $H^{-1}(E)$ and
266
+ degree-zero cohomology in $\mathcal C_{>1/2}$, so it lies in
267
+ $\mathcal L$. The slope vanishing and the ordinary cohomological
268
+ degrees give $\Hom(\mathcal L,\mathcal M)=0$.
269
+ Tilting this torsion pair gives
270
+ $\mathcal B_+=\langle\mathcal M[1],\mathcal L\rangle$; in
271
+ $\mathcal B_+$ the corresponding torsion pair is
272
+ $(\mathcal M[1],\mathcal L)$. In particular
273
+ $W_-[1]\subset W_+\subset W_-$, and
274
+ $W_+[1]\subset W_-[1]\subset\mathcal U_-^\theta$.
275
+ It suffices to prove
276
+ \begin{equation}\label{eq:comparison-hom}
277
+ \Hom(\mathcal T_+^\alpha,\mathcal F_-^\theta)=0.
278
+ \end{equation}
279
+ Indeed an object $E\in W_-$ has maps to a member of
280
+ $\mathcal F_-^\theta$ exactly through $H^0_{\mathcal B_-}(E)$;
281
+ vanishing of all such maps puts this cohomology object in
282
+ $\mathcal T_-^\theta$. Equation~\eqref{eq:comparison-hom} therefore
283
+ puts $\mathcal T_+^\alpha$ in $\mathcal U_-^\theta$, and the preceding
284
+ inclusion handles the negative $\mathcal B_+$ degrees.
285
+
286
+ Suppose there is a nonzero map $E\to G$ with
287
+ $E\in\mathcal T_+^\alpha$ and $G\in\mathcal F_-^\theta$.
288
+ Its source decomposes in $\mathcal B_+$ as
289
+ $0\to M_E[1]\to E\to E_0\to0$, with $E_0\in\mathcal L$.
290
+ Because $\Hom(\mathcal M[1],\mathcal B_-)=0$, the map factors through
291
+ $E_0$, which is still in $\mathcal T_+^\alpha$. The
292
+ $(\mathcal L,\mathcal M)$ decomposition of $G$ in $\mathcal B_-$
293
+ then factors it through a subobject $G_0\in\mathcal L$ of $G$, since
294
+ $\Hom(\mathcal L,\mathcal M)=0$.
295
+
296
+ Take the kernel $K$ and the nonzero image $Q$ of $E_0\to G_0$ in
297
+ $\mathcal B_-$. Let $K_{\mathcal L}$ be the $\mathcal L$ torsion
298
+ part of $K$, and put $U'=E_0/K_{\mathcal L}$ in $\mathcal B_-$.
299
+ The quotient closure of $\mathcal L$ gives $Q,U'\in\mathcal L$.
300
+ All three terms of
301
+ $K_{\mathcal L}\to E_0\to U'$ belong to both hearts, so its triangle
302
+ is short exact in $\mathcal B_+$ as well. Thus $U'$ remains a
303
+ quotient of $E$ in $\mathcal B_+$, and we have
304
+ \begin{equation}\label{eq:common-heart-sequence}
305
+ 0\longrightarrow S\longrightarrow U'\longrightarrow Q\longrightarrow0
306
+ \quad\text{in }\mathcal B_-,\qquad
307
+ S=K/K_{\mathcal L}\in\mathcal M,
308
+ \quad U'\in\mathcal T_+^\alpha,
309
+ \quad 0\ne Q\in\mathcal F_-^\theta.
310
+ \end{equation}
311
+ We use the sequence~\eqref{eq:common-heart-sequence} only as a short exact
312
+ sequence in $\mathcal B_-$; its term $S$
313
+ need not belong to $\mathcal B_+$.
314
+
315
+ We now use the slope envelope to exclude factors close to the two slope
316
+ boundaries. The resulting rank bounds will contradict the opposite signs of
317
+ the two cut forms on $U'$ and $Q$.
318
+
319
+ Directly from the three affine functions defining $f$,
320
+ \begin{equation}\label{eq:strip-test}
321
+ \max_{1/2\leq s\leq s_0}\bigl(f(s)-s/2+u\bigr)
322
+ =u-\frac{13857}{50000}.
323
+ \end{equation}
324
+ The perturbation error on a slope $\pm s$ is at most
325
+ $(1+s_0)\delta$, so \eqref{eq:strip-margin} makes the relevant
326
+ sheaf value of $N_-$ on $[-s_0,-1/2]$, or of $N_+$ on
327
+ $[1/2,s_0]$, strictly negative.
328
+
329
+ Write $A=H^{-1}(Q)$. If $A\ne0$, its top slope factor $A_1$
330
+ is a saturated subsheaf and $A/A_1\in\mathcal C_{\leq-1/2}$.
331
+ Consequently $A_1[1]$ is a subobject of $A[1]$, and then of $Q$, in
332
+ $\mathcal B_-$. If $\mu(A_1)\in[-s_0,-1/2]$, the preceding
333
+ negative sheaf value makes $A_1[1]$ high, contradicting
334
+ $Q\in\mathcal F_-^\theta$. Thus $\mu^+(A)<-s_0$.
335
+
336
+ For $U'$, put $A'=H^{-1}(U')$ and $D'=H^0(U')$.
337
+ If $D'$ has positive rank, remove its ordinary torsion subsheaf and
338
+ take its bottom positive-rank slope quotient $G'$. The kernel of
339
+ $D'\to G'$ consists of that torsion and the other slope factors,
340
+ all of slope $>1/2$; this sequence is therefore exact in
341
+ $\mathcal B_+$. The ordinary cohomology sequence also makes $D'$
342
+ a $\mathcal B_+$ quotient of $U'$, so $G'$ is such a quotient.
343
+ A slope $\mu(G')\in(1/2,s_0]$ would give
344
+ $p_+(G')>0$, $N_+^\alpha(G')<0$, contradicting
345
+ $U'\in\mathcal T_+^\alpha$. Every positive-rank slope of $D'$
346
+ therefore exceeds $s_0$.
347
+
348
+ For any $L\in\mathcal L$, its two ordinary cohomology sheaves give
349
+ \begin{equation}\label{eq:overlap-rank-bound}
350
+ c(L)\geq\frac12\bigl(r(H^{-1}(L))+r(H^0(L))\bigr)
351
+ \geq\frac12|r(L)|.
352
+ \end{equation}
353
+ Divisorial torsion contributes nonnegative $c$, and torsion in lower
354
+ dimension contributes zero. The stronger slope conclusions just
355
+ proved similarly give
356
+ \begin{equation}\label{eq:two-slope-tests}
357
+ c(Q)\geq-s_0r(Q),\qquad c(U')\geq s_0r(U').
358
+ \end{equation}
359
+ More explicitly, with $D=H^0(Q)$ the estimates are
360
+ \[
361
+ \begin{split}
362
+ c(Q)&\geq s_0r(A)+\tfrac12r(D)\geq-s_0r(Q),\\
363
+ c(U')&\geq\tfrac12r(A')+s_0r(D')\geq s_0r(U').
364
+ \end{split}
365
+ \]
366
+ They include torsion cohomology sheaves: their ranks are zero and
367
+ their contributions to $c$ are nonnegative. Also $d(S)\leq0$, by applying
368
+ Lemma~\ref{lem:slope-input} to the ordinary slope factors of $S$.
369
+
370
+ Set $C=c(Q)+c(U')$. By \eqref{eq:overlap-rank-bound}, $C\geq0$.
371
+ If $C=0$, then $c(Q)=r(Q)=0$, so $p_-(Q)=0$, impossible for a
372
+ nonzero member of $\mathcal F_-^\theta$. Hence $C>0$; and
373
+ \eqref{eq:two-slope-tests} together with
374
+ \eqref{eq:common-heart-sequence} gives $C\geq s_0r(S)$.
375
+ By additivity,
376
+ \begin{align*}
377
+ N_-^\theta(Q)-N_+^\alpha(U')
378
+ &=\frac12 C-u r(S)-d(S)
379
+ +\theta_1c(Q)+\theta_0r(Q)-\alpha_1c(U')-\alpha_0r(U')\\
380
+ &\geq \left(\frac12-\frac{u}{s_0}-3\delta\right)C-d(S)>0.
381
+ \end{align*}
382
+ Here the absolute value of the last four terms is at most $3\delta C$
383
+ by \eqref{eq:overlap-rank-bound}; this applies even when a derived
384
+ rank is negative. The strict sign is \eqref{eq:comparison-margin}.
385
+ But $N_-^\theta(Q)\leq0\leq N_+^\alpha(U')$, a contradiction.
386
+ This proves \eqref{eq:comparison-hom} and the aisle inclusion.
387
+ \end{proof}
388
+
389
+ \begin{lemma}\label{lem:twist-aisle}
390
+ For all $\alpha,\theta\in B_\delta$,
391
+ \[
392
+ \OO_X\in\mathcal A_-^\theta,\qquad
393
+ \OO_X[2]\in\mathcal A_+^\alpha,\qquad
394
+ T_{\OO_X}(\mathcal U_+^\alpha)\subset\mathcal U_-^\theta.
395
+ \]
396
+ \end{lemma}
397
+
398
+ \begin{proof}
399
+ The object $\OO_X\in\mathcal B_-$ has the smallest positive value
400
+ $p_-=1/2$ and $N_-^\theta=u+\theta_0>0$.
401
+ It has no nonzero subobject of $p_-=0$: a $p_-=0$ object is an
402
+ extension of a sheaf of dimension at most one by $F[1]$ of slope
403
+ $-1/2$, and both have zero Hom to $\OO_X$.
404
+ Any nonzero low quotient of $\OO_X$ would have $p_-=1/2$, leaving
405
+ a kernel of $p_-=0$; that kernel must vanish, contradicting that
406
+ $\OO_X$ is high. Hence $\OO_X\in\mathcal T_-^\theta$.
407
+
408
+ Similarly $\OO_X[1]\in\mathcal B_+$ has $p_+=1/2$ and
409
+ $N_+^\alpha=-u-\alpha_0<0$. A $p_+=0$ object has no map to it:
410
+ for its slope-$1/2$ part this is
411
+ $\Hom(F[1],\OO_X[1])=\Hom(F,\OO_X)=0$, and for its
412
+ dimension-at-most-one part $T$ it follows from
413
+ \[
414
+ \Ext^1(T,\OO_X)=H^2(X,T)^*=0.
415
+ \]
416
+ Here we use Serre duality and $K_X\simeq\OO_X$. Every nonzero
417
+ subobject $A$ of $\OO_X[1]$ therefore has $p_+(A)=1/2$, and its
418
+ quotient $Q$ has $p_+(Q)=0$. Hence
419
+ $N_+^\alpha(A)=N_+^\alpha(\OO_X[1])-N_+^\alpha(Q)<0$.
420
+ This proves $\OO_X[1]\in\mathcal F_+^\alpha$, and thus
421
+ $\OO_X[2]\in\mathcal A_+^\alpha$.
422
+
423
+ For $B\in\mathcal U_+^\alpha$ and $j\geq2$, Serre duality and
424
+ the heart orthogonality give
425
+ \[
426
+ \Ext^j(\OO_X,B)
427
+ =\Hom(B[j-1],\OO_X[2])^*=0,
428
+ \]
429
+ since $B[j-1]\in\mathcal U_+^\alpha[1]$.
430
+ Lemma~\ref{lem:compare-slope-cuts} puts $B$ in
431
+ $\mathcal U_-^\theta$. In the twist triangle
432
+ \[
433
+ B\longrightarrow T_{\OO_X}(B)\longrightarrow
434
+ \operatorname{RHom}(\OO_X,B)\otimes\OO_X[1]\longrightarrow B[1],
435
+ \]
436
+ the third term is a finite direct sum of copies of
437
+ $\OO_X[1-j]$ with $j\leq1$, because bounded complexes of
438
+ finite-dimensional vector spaces split into their cohomology.
439
+ All these terms lie in $\mathcal U_-^\theta$. Extension closure
440
+ therefore gives the claimed twist inclusion.
441
+ \end{proof}
442
+
443
+ \begin{proposition}[Uniform independent-parameter inclusion]
444
+ \label{prop:uniform-aisle}
445
+ There is a fixed open square
446
+ \begin{equation}\label{eq:fixed-omega}
447
+ \Omega=\{\eta=(\eta_0,\eta_1):|\eta_0|,|\eta_1|<5\cdot10^{-6}\}
448
+ \end{equation}
449
+ and bounded aisles $U_\eta=\mathcal U_-^\eta$, with hearts
450
+ $\mathcal A_\eta=U_\eta\cap(U_\eta[1])^\perp$, such that
451
+ \begin{equation}\label{eq:uniform-aisle}
452
+ \Phi U_\eta\subset U_\theta
453
+ \qquad(\eta,\theta\in\Omega).
454
+ \end{equation}
455
+ Moreover
456
+ \begin{equation}\label{eq:perturbed-positive-form}
457
+ N_\eta=d+\frac12c+ur+\eta_1c+\eta_0r\geq0
458
+ \quad\text{on }\mathcal A_\eta,
459
+ \qquad N_0=\frac{\Im Z}{5t_0},
460
+ \end{equation}
461
+ and no nonzero object of any $\mathcal A_\eta$ has zero numerical
462
+ class. The two parameters in \eqref{eq:uniform-aisle} vary
463
+ independently throughout this same square.
464
+ \end{proposition}
465
+
466
+ \begin{proof}
467
+ Tensoring by $\OO_X(1)$ takes $\mathcal B_-$ to $\mathcal B_+$
468
+ and preserves the $p$ test. Its effect on the other test is
469
+ \[
470
+ N_+^\alpha(E(1))=N_-^\eta(E)
471
+ \quad\text{when}\quad
472
+ \alpha_1=\eta_1,\qquad\alpha_0=\eta_0-\eta_1.
473
+ \]
474
+ Thus it takes the second torsion pair and aisle to those with this
475
+ parameter $\alpha$. If $\eta\in\Omega$, then $\alpha\in B_\delta$;
476
+ also $\theta\in\Omega$ implies $\theta\in B_\delta$.
477
+ Lemma~\ref{lem:twist-aisle} now gives
478
+ \[
479
+ \Phi U_\eta=T_{\OO_X}\bigl(\mathcal U_+^\alpha\bigr)
480
+ \subset U_\theta.
481
+ \]
482
+ The remaining assertions are Lemma~\ref{lem:second-tilt} and
483
+ \eqref{eq:imaginary-charge}.
484
+
485
+ The parameter shear was used once, in proving this inclusion for
486
+ the original family. In particular, applying any power $\Phi^i$
487
+ to \eqref{eq:uniform-aisle} gives
488
+ $\Phi^{i+1}U_\eta\subset\Phi^iU_\theta$ with the same
489
+ $\eta,\theta\in\Omega$; it performs no further shear and requires
490
+ no further shrinkage. Negative powers are allowed by
491
+ Lemma~\ref{lem:periodicity}.
492
+ \end{proof}
preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/build/sections/grid.tex ADDED
@@ -0,0 +1,647 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{From uniform aisle inclusions to a slicing}
2
+ \label{sec:grid}
3
+
4
+ We now use the bounded aisles $U_\eta$ and their hearts
5
+ $\mathcal A_\eta$ constructed above. The parameter $\eta=(\eta_0,\eta_1)$
6
+ ranges over the fixed open square $\Omega$ of
7
+ Proposition~\ref{prop:uniform-aisle}, and $0\in\Omega$. The inputs to this
8
+ section are
9
+ \begin{equation}\label{eq:grid-inputs}
10
+ \begin{gathered}
11
+ \Phi U_\eta\subset U_\theta
12
+ \quad(\eta,\theta\in\Omega),\\
13
+ N_\eta=d+\tfrac12c+ur+\eta_1c+\eta_0r\ge0
14
+ \quad\text{on }\mathcal A_\eta,
15
+ \end{gathered}
16
+ \end{equation}
17
+ the absence of nonzero objects of zero numerical class in these hearts,
18
+ and Lemma~\ref{lem:periodicity}, Lemma~\ref{lem:numerical}, and
19
+ Proposition~\ref{prop:central-charge}. In particular, throughout this
20
+ section $\Phi$ is an autoequivalence, $\Phi^5\simeq[2]$, and
21
+ $Z\Phi=e^{2\pi i/5}Z$. All extension closures below mean finite extension
22
+ closures, contain zero, and are strictly full subcategories of $\D$.
23
+ For a subcategory $\mathcal C$, write
24
+ $\mathcal C^\perp=\{E:\Hom(C,E)=0\text{ for all }C\in\mathcal C\}$;
25
+ the left orthogonal ${}^\perp\mathcal C$ is defined similarly.
26
+
27
+ The decisive use of the perturbations is twofold. Simultaneous positivity
28
+ in fixed middle hearts improves the coarse nesting to a grid with spacing
29
+ $1/5$. Positivity in every perturbed preceding heart then bounds the full
30
+ numerical class of each grid block by its charge.
31
+
32
+ \subsection{The finer grid}
33
+
34
+ Put $D_i^\eta=\Phi^iU_\eta$ for $i\in\Z$. The hypotheses give
35
+ \begin{equation}\label{eq:coarse-grid}
36
+ D_{i+1}^\eta\subset D_i^\theta\quad
37
+ (i\in\Z,\ \eta,\theta\in\Omega),\qquad
38
+ D_{i+5}^\eta=D_i^\eta[2].
39
+ \end{equation}
40
+ All successive inclusions allow independent parameter choices.
41
+ The charge rotation suggests how to insert a fifth-step between these
42
+ coarse cuts: $\Phi^3[-1]$ multiplies $Z$ by $e^{i\pi/5}$.
43
+ For its translates to give nested aisles, we need
44
+ $\Phi^3U_\alpha[-1]\subset U_\beta$, or equivalently
45
+ $D_3^\alpha\subset D_0^\beta[1]$. The next proposition proves this
46
+ inclusion before any slicing or semistable phase is defined.
47
+
48
+ \begin{proposition}[Uniform refinement of the grid]\label{prop:fine-grid}
49
+ There is an open square $\Omega_1$ about zero, contained in $\Omega$, such
50
+ that
51
+ \begin{equation}\label{eq:single-shift-inclusion}
52
+ D_3^\alpha\subset D_0^\beta[1]
53
+ \qquad(\alpha,\beta\in\Omega_1).
54
+ \end{equation}
55
+ For $k\in\Z$ and $\eta\in\Omega_1$, define
56
+ \begin{equation}\label{eq:fifths-aisles}
57
+ V_k^\eta=\Phi^mU_\eta[j],\qquad k=2m+5j.
58
+ \end{equation}
59
+ This is independent of the integers $m,j$ chosen, and these bounded aisles
60
+ satisfy
61
+ \begin{equation}\label{eq:fifths-nesting}
62
+ \begin{gathered}
63
+ V_{k+1}^\alpha\subset V_k^\beta,\qquad
64
+ V_{k+5}^\eta=V_k^\eta[1],\qquad
65
+ \Phi V_k^\eta=V_{k+2}^\eta,\\
66
+ k\in\Z,\quad \alpha,\beta,\eta\in\Omega_1.
67
+ \end{gathered}
68
+ \end{equation}
69
+ \end{proposition}
70
+
71
+ \begin{proof}
72
+ For $\alpha,\beta\in\Omega$, consider
73
+ \[
74
+ \mathcal I_{\alpha,\beta}
75
+ =D_3^\alpha\cap(D_0^\beta[1])^\perp.
76
+ \]
77
+ Every object of this intersection belongs to the hearts of $D_0^\beta$
78
+ and $D_3^\alpha$. More strongly, for every $\gamma\in\Omega$ and
79
+ $i\in\{1,2\}$, \eqref{eq:coarse-grid} gives
80
+ \[
81
+ D_3^\alpha\subset D_i^\gamma\subset D_0^\beta,
82
+ \qquad D_i^\gamma[1]\subset D_0^\beta[1].
83
+ \]
84
+ The first inclusion gives aisle membership, and the second gives the
85
+ orthogonal membership. Thus the same object lies in the heart of
86
+ $D_i^\gamma$ for every $\gamma$ in the original fixed square $\Omega$.
87
+ This square is independent of the endpoints $\alpha,\beta$ and of the
88
+ object.
89
+
90
+ Fix a Euclidean norm on $\Knum(X)_\R$. Suppose there were nonzero
91
+ objects $E_n\in\mathcal I_{\alpha_n,\beta_n}$ with
92
+ $\alpha_n,\beta_n\longrightarrow0$. The endpoint heart has no nonzero
93
+ zero-class object, so
94
+ $v_n=[E_n]/\norm{[E_n]}$ is defined. After a subsequence it tends to a
95
+ unit vector $v$. Heart positivity at the two endpoints, and at the
96
+ unperturbed middle hearts, gives in the limit
97
+ \begin{equation}\label{eq:four-halfplanes}
98
+ \Im\bigl(e^{-2\pi i q/5}Z(v)\bigr)\ge0
99
+ \qquad(q=0,1,2,3).
100
+ \end{equation}
101
+ These four inequalities force $Z(v)=0$. Indeed, if $Z(v)\ne0$, choose its
102
+ argument $\vartheta\in[0,2\pi)$. The first three inequalities force
103
+ $\vartheta\in[4\pi/5,\pi]$, whereas the fourth forces
104
+ $\vartheta\in[0,\pi/5]\cup[6\pi/5,2\pi)$, which is impossible.
105
+
106
+ Now fix any $\gamma\in\Omega$. The middle-heart inequality at index one
107
+ holds for every $n$, so the same convergent subsequence satisfies
108
+ \[
109
+ N_\gamma(\Phi_*^{-1}v)\ge0.
110
+ \]
111
+ Since $\gamma$ was arbitrary, this holds simultaneously for all
112
+ $\gamma\in\Omega$; there is no further subsequence or shrinking of the
113
+ middle parameter set. Write $w=\Phi_*^{-1}v$. The eigencharge identity
114
+ and \eqref{eq:imaginary-charge} give $Z(w)=N_0(w)=0$. Varying
115
+ $\gamma_0,\gamma_1$ with both signs in $\Omega$ now gives
116
+ $r(w)=c(w)=0$. The real-linear independence of the $d,e$ coefficients
117
+ of $Z$ gives $d(w)=e(w)=0$. This contradicts $\norm{v}=1$.
118
+
119
+ Consequently some square $\Omega_1$ about zero has
120
+ $\mathcal I_{\alpha,\beta}=0$ for every pair
121
+ $\alpha,\beta\in\Omega_1$: otherwise choose counterexamples with both
122
+ parameters within distance $1/n$ of zero. To deduce
123
+ \eqref{eq:single-shift-inclusion}, let $E\in D_3^\alpha$ and truncate in
124
+ the bounded t-structure with aisle $D_0^\beta$:
125
+ \[
126
+ A\longrightarrow E\longrightarrow H^0_{D_0^\beta}(E)
127
+ \longrightarrow A[1],\qquad A\in D_0^\beta[1].
128
+ \]
129
+ Here $E\in D_0^\beta$, and
130
+ $A[1]\in D_0^\beta[2]=D_5^\beta\subset D_3^\alpha$.
131
+ Extension closure therefore puts the zeroth cohomology in
132
+ $D_3^\alpha\cap(D_0^\beta[1])^\perp=0$. Hence $E\in D_0^\beta[1]$.
133
+
134
+ Every integer is $2m+5j$. Two such representations differ by
135
+ $(m,j)\mapsto(m+5t,j-2t)$, so $\Phi^5\simeq[2]$ proves that
136
+ \eqref{eq:fifths-aisles} is well defined. Since
137
+ $V_1^\alpha=\Phi^3U_\alpha[-1]\subset U_\beta=V_0^\beta$,
138
+ transport by $\Phi^m[j]$ proves the first assertion of
139
+ \eqref{eq:fifths-nesting} for all $k$. Its other assertions follow
140
+ directly from the definition.
141
+ \end{proof}
142
+
143
+ From now on $V_k=V_k^0$. Define the heart and the block
144
+ \begin{equation}\label{eq:block-definitions}
145
+ \mathcal H_k=V_k\cap V_{k+5}^\perp,
146
+ \qquad \mathcal S_k=V_k\cap V_{k+1}^\perp.
147
+ \end{equation}
148
+ The first is a bounded heart because $V_{k+5}=V_k[1]$.
149
+
150
+ \begin{lemma}[Block filtrations]\label{lem:block-filtrations}
151
+ The blocks are extension closed, and
152
+ $\Hom(\mathcal S_j,\mathcal S_k)=0$ whenever $j>k$.
153
+ Every object has a finite triangle filtration with nonzero factors in
154
+ blocks of strictly decreasing indices. In $\mathcal H_k$ there is a
155
+ torsion pair
156
+ \begin{equation}\label{eq:block-torsion-pair}
157
+ \begin{aligned}
158
+ \mathcal T_k=V_{k+1}\cap\mathcal H_k
159
+ &=\langle\mathcal S_{k+4},\mathcal S_{k+3},
160
+ \mathcal S_{k+2},\mathcal S_{k+1}\rangle,\\
161
+ \mathcal F_k&=\mathcal S_k.
162
+ \end{aligned}
163
+ \end{equation}
164
+ In particular, $\mathcal S_k$ is closed under subobjects in $\mathcal H_k$.
165
+ \end{lemma}
166
+
167
+ \begin{proof}
168
+ Extension closure follows from \eqref{eq:block-definitions}. If $j>k$,
169
+ then $\mathcal S_j\subset V_j\subset V_{k+1}$ and
170
+ $\mathcal S_k\subset V_{k+1}^\perp$, proving the Hom vanishing.
171
+ Boundedness and $V_{k+5}=V_k[1]$ put any object $E$ in
172
+ $V_l\cap V_h^\perp$ for some integers $l<h$. Truncation at $V_{l+1}$
173
+ gives
174
+ \[
175
+ A\longrightarrow E\longrightarrow B\longrightarrow A[1],
176
+ \quad A\in V_{l+1},\ B\in V_{l+1}^\perp.
177
+ \]
178
+ Because $E,A[1]\in V_l$, we have $B\in V_l$, hence $B\in\mathcal S_l$.
179
+ Also $B[-1]\in V_h^\perp$: for $F\in V_h$,
180
+ $F[1]\in V_h\subset V_{l+1}$ gives $\Hom(F,B[-1])=0$.
181
+ The rotated triangle thus shows $A\in V_h^\perp$.
182
+ Repeat with $A\in V_{l+1}\cap V_h^\perp$. At index $h$ the remaining
183
+ object belongs to $V_h\cap V_h^\perp$ and is zero. Reading the resulting
184
+ triangles from the first subobject to the last quotient gives the stated
185
+ decreasing order; zero factors are omitted.
186
+
187
+ If $E\in\mathcal H_k$, apply the same construction with $l=k$ and
188
+ $h=k+5$. The first triangle has all its terms in $\mathcal H_k$, so it is
189
+ a short exact sequence there, with $A\in\mathcal T_k$ and
190
+ $B\in\mathcal S_k$. The preceding Hom vanishing proves the torsion-pair
191
+ axiom. Repeating on $A$ proves the displayed four-block description.
192
+ For completeness, a subobject $G$ of an object of $\mathcal S_k$ has
193
+ $\Hom(\mathcal T_k,G)=0$, by composing with the inclusion, so its torsion
194
+ part vanishes. Thus $G\in\mathcal S_k$.
195
+ \end{proof}
196
+
197
+ Figure~\ref{fig:fifth-phase-grid} records the index conventions and the charge
198
+ sectors that will be established in Proposition~\ref{prop:block-support}.
199
+ \input{figures/fifth-phase-grid}
200
+
201
+ \subsection{Full numerical support on the blocks}
202
+
203
+ We first locate a block's charge using its two adjacent unperturbed hearts.
204
+ To bound its numerical class, we then place the same object in every perturbed
205
+ heart at the preceding grid position. This second step retains the two
206
+ independent inequalities that control rank and first Chern character.
207
+
208
+ \begin{proposition}\label{prop:block-support}
209
+ For the fixed Euclidean norm on $\Knum(X)_\R$, there is a constant $C>0$
210
+ such that, for every $k\in\Z$ and every nonzero $E\in\mathcal S_k$,
211
+ \begin{equation}\label{eq:block-support}
212
+ \begin{gathered}
213
+ Z(E)\in\{t e^{i\pi\varphi}:t>0,\ k/5\le\varphi\le(k+1)/5\},\\
214
+ \norm{[E]}\le C|Z(E)|.
215
+ \end{gathered}
216
+ \end{equation}
217
+ \end{proposition}
218
+
219
+ \begin{proof}
220
+ For $k=2m+5j$, the functor $\Phi^{-m}[-j]$ takes $\mathcal H_k$ to
221
+ $\mathcal A_0$ and multiplies its charge by $e^{-i\pi k/5}$. Positivity
222
+ therefore gives $\Im(e^{-i\pi k/5}Z(E))\ge0$ on $\mathcal H_k$.
223
+ An object $E\in\mathcal S_k$ belongs both to $\mathcal H_k$ and to
224
+ \[
225
+ \mathcal H_{k+1}[-1]
226
+ =V_{k-4}\cap V_{k+1}^\perp.
227
+ \]
228
+ The two tests are consequently
229
+ \[
230
+ \Im(e^{-i\pi k/5}Z(E))\ge0,\qquad
231
+ \Im(e^{-i\pi(k+1)/5}Z(E))\le0.
232
+ \]
233
+ Their intersection is the closed sector in \eqref{eq:block-support},
234
+ together with the origin.
235
+
236
+ Choose $\varepsilon>0$ such that the closed square
237
+ $[-\varepsilon,\varepsilon]^2$ is contained in $\Omega_1$.
238
+ For every $\eta$ in this square, independent-parameter nesting gives
239
+ \[
240
+ V_k\subset V_{k-1}^\eta,
241
+ \qquad V_{k-1}^\eta[1]=V_{k+4}^\eta\subset V_{k+1}.
242
+ \]
243
+ Thus $E$ belongs to the heart of $V_{k-1}^\eta$ for every such $\eta$:
244
+ the second inclusion supplies exactly its required right orthogonality.
245
+ Write $k-1=2m+5j$, and set $w=[\Phi^{-m}E[-j]]$. This is the class of an
246
+ actual object of $\mathcal A_\eta$ for every parameter under consideration,
247
+ including the shift in this formula. Hence
248
+ \[
249
+ N_0(w)+\eta_1c(w)+\eta_0r(w)\ge0
250
+ \quad\text{for all }|\eta_0|,|\eta_1|\le\varepsilon.
251
+ \]
252
+ Choosing the two signs independently proves
253
+ \begin{equation}\label{eq:perturbed-support}
254
+ \varepsilon\bigl(|r(w)|+|c(w)|\bigr)
255
+ \le N_0(w)=\frac{\Im Z(w)}{5t_0}
256
+ \le\frac{|Z(E)|}{5t_0}.
257
+ \end{equation}
258
+ The invertible real coordinate map
259
+ $w\mapsto(r(w),c(w),\Re Z(w),\Im Z(w))$, established in
260
+ \eqref{eq:numerical-norm-control}, now bounds $\norm{w}$ by a constant
261
+ times $|Z(E)|$. Explicitly,
262
+ $d(w)=\Im Z(w)/(5t_0)-c(w)/2-ur(w)$, and then the real part of
263
+ \eqref{eq:central-charge} recovers $e(w)$.
264
+
265
+ We can choose $m\in\{0,1,2,3,4\}$ according to $k-1$ modulo five.
266
+ There are therefore only five norm-conversion operators $\Phi_*^m$;
267
+ the arbitrary shift $j$ only changes the sign of a numerical class.
268
+ Taking the maximum of their operator norms gives one $C$ for every $k$.
269
+ If $Z(E)=0$, the estimate gives $w=0$. The object
270
+ $\Phi^{-m}E[-j]$ belongs to $\mathcal A_0$, so
271
+ Lemma~\ref{lem:second-tilt} forces $\Phi^{-m}E[-j]=0$ and hence $E=0$.
272
+ This excludes the origin for a nonzero block object and completes the proof.
273
+ \end{proof}
274
+
275
+ \subsection{Finite refinement inside a block}
276
+
277
+ The support estimate is now in place. We use it with the discreteness of the
278
+ full numerical lattice to obtain maximal phases and a bound on the length of
279
+ refinement; no discreteness of the charge image is needed.
280
+
281
+ Fix $k$, and put $a=k/5$, $b=(k+1)/5$.
282
+ Each nonzero $E\in\mathcal S_k$ has a unique phase
283
+ $\varphi_k(E)\in[a,b]$ with $Z(E)=|Z(E)|e^{i\pi\varphi_k(E)}$.
284
+ A subobject $F\subset E$ in $\mathcal H_k$ is called \emph{saturated in
285
+ the block} if $E/F\in\mathcal S_k$. Its source already belongs to
286
+ $\mathcal S_k$ by Lemma~\ref{lem:block-filtrations}. We call $E$
287
+ \emph{block-semistable} if
288
+ \[
289
+ \varphi_k(F)\le\varphi_k(E)
290
+ \quad\text{for every nonzero subobject saturated in the block.}
291
+ \]
292
+ The whole object is allowed as such a subobject.
293
+
294
+ \begin{lemma}[Finite block refinement]\label{lem:block-hn}
295
+ Every nonzero object of $\mathcal S_k$ has a finite filtration by short
296
+ exact sequences in $\mathcal H_k$, with all intermediate quotients in
297
+ $\mathcal S_k$, whose nonzero factors are block-semistable with strictly
298
+ decreasing phases.
299
+ \end{lemma}
300
+
301
+ \begin{proof}
302
+ Let $\ell>0$ be a lower bound for the norms of nonzero elements of the
303
+ full numerical lattice, supplied by Lemma~\ref{lem:numerical}, and define
304
+ \[
305
+ q_k(z)=\Re\bigl(e^{-i\pi(a+b)/2}z\bigr),\qquad
306
+ d_* =\frac{\ell\cos(\pi/10)}{C}>0.
307
+ \]
308
+ For every nonzero block object, Proposition~\ref{prop:block-support}
309
+ implies
310
+ \begin{equation}\label{eq:block-mass}
311
+ q_k(Z(E))\ge\cos(\pi/10)|Z(E)|\ge d_*.
312
+ \end{equation}
313
+ This projection is additive in short exact sequences. Hence every
314
+ filtration of a fixed $E$ with nonzero block factors has length at most
315
+ $q_k(Z(E))/d_*$.
316
+
317
+ If $F\subset E$ is saturated in the block, then both $F$ and $E/F$ are
318
+ block objects. Their projections are nonnegative, so
319
+ \[
320
+ \norm{[F]}\le C|Z(F)|
321
+ \le \frac{C}{\cos(\pi/10)}q_k(Z(F))
322
+ \le \frac{C}{\cos(\pi/10)}q_k(Z(E)).
323
+ \]
324
+ Only finitely many lattice classes, and therefore only finitely many
325
+ charges and phases, can occur for such $F$. Choose a nonzero saturated
326
+ subobject $F\subset E$ of maximal phase, and among those of maximal
327
+ $|Z(F)|$. These maxima concern finite sets of numerical values; no
328
+ finiteness of the set of subobjects is needed.
329
+
330
+ This $F$ is block-semistable. Indeed, a saturated subobject of $F$ is
331
+ saturated in $E$, since the resulting quotient of $E$ is an extension of
332
+ two objects of $\mathcal S_k$. If $G\subset E/F$ is a nonzero saturated
333
+ subobject, its preimage $\widetilde G\subset E$ is also saturated and is
334
+ an extension of $G$ by $F$. Charges in a sector of width less than $\pi$
335
+ have the elementary strict see-saw property: the argument of their sum
336
+ is strictly between their arguments when those arguments differ, and
337
+ their magnitudes add when they agree. Thus
338
+ $\varphi_k(G)>\varphi_k(F)$ contradicts maximal phase of $F$ by using
339
+ $\widetilde G$; equality contradicts maximal magnitude. Every such $G$
340
+ therefore has phase strictly less than $\varphi_k(F)$.
341
+
342
+ Apply the same selection to the nonzero quotient $E/F$, if there is one,
343
+ and continue. Preimages give a filtration in the original heart with all
344
+ factors and intermediate quotients in the block. The phases strictly
345
+ decrease by the preceding argument, and \eqref{eq:block-mass} bounds the
346
+ number of nonzero factors, so the process terminates.
347
+ \end{proof}
348
+
349
+ \begin{lemma}[The unsaturated test and Hom vanishing]
350
+ \label{lem:block-hom}
351
+ If $E\in\mathcal S_k$ is block-semistable, then every nonzero subobject
352
+ $G\subset E$ in $\mathcal H_k$ satisfies
353
+ $\varphi_k(G)\le\varphi_k(E)$, without a saturation assumption.
354
+ Consequently, for block-semistable $E,F\in\mathcal S_k$,
355
+ \[
356
+ \varphi_k(E)>\varphi_k(F)\quad\Longrightarrow\quad\Hom(E,F)=0.
357
+ \]
358
+ \end{lemma}
359
+
360
+ \begin{proof}
361
+ Suppose $G\subset E$ violates the stated inequality. Decompose $E/G$
362
+ by \eqref{eq:block-torsion-pair} and take the preimage of its torsion
363
+ part:
364
+ \[
365
+ 0\longrightarrow T\longrightarrow E/G\longrightarrow F'\longrightarrow0,
366
+ \qquad
367
+ 0\longrightarrow G\longrightarrow\overline G\longrightarrow T
368
+ \longrightarrow0,
369
+ \quad T\in\mathcal T_k,\ F'\in\mathcal S_k.
370
+ \]
371
+ The object $\overline G\subset E$ lies in $\mathcal S_k$ by subobject
372
+ closure, and is saturated because $E/\overline G=F'$.
373
+ The four-block filtration of $T$ has charge rays with phases in
374
+ $[b,a+1]$. If $g=\varphi_k(G)$, then
375
+ \[
376
+ a<g\le b,
377
+ \qquad 0\le\psi-g\le a+1-g<1
378
+ \quad\text{for every such phase }\psi.
379
+ \]
380
+ Thus $Z(G)$ and every added ray lie in the sector with phase interval
381
+ $[g,a+1]$ of width strictly less than one. Their sum is nonzero and has
382
+ phase in that same interval. Since $\overline G\in\mathcal S_k$, its
383
+ phase in $[a,b]$ must therefore be at least $g$. In particular,
384
+ $\varphi_k(\overline G)>\varphi_k(E)$, a contradiction.
385
+ The strict inequality $g>a$, supplied by the alleged destabilization,
386
+ is what excludes an antipodal endpoint in this argument. If $T=0$, the
387
+ contradiction already comes from $G$ itself being saturated.
388
+
389
+ For a nonzero map $E\to F$, take its image $I$ in $\mathcal H_k$.
390
+ Since $I\subset F$, we have $I\in\mathcal S_k$. The kernel in $E$ is
391
+ therefore saturated. If that kernel is zero, $\varphi_k(I)=\varphi_k(E)$;
392
+ otherwise semistability and the see-saw property give
393
+ $\varphi_k(I)\ge\varphi_k(E)$. The unsaturated test applied to
394
+ $I\subset F$ gives $\varphi_k(I)\le\varphi_k(F)$. These inequalities
395
+ exclude a nonzero map when the source phase is strictly larger.
396
+ \end{proof}
397
+
398
+ \subsection{The slicing and its phase cuts}
399
+
400
+ For $\varphi\in\R$, let $\mathcal P(\varphi)$ be the extension closure
401
+ of all block-semistable objects whose assigned phase equals $\varphi$.
402
+ There is one possible block unless $5\varphi\in\Z$, in which case the
403
+ two adjacent blocks are both included in this definition.
404
+
405
+ \begin{proposition}\label{prop:slicing}
406
+ The categories $\mathcal P(\varphi)$ form a slicing of $\D$ with finite
407
+ Harder--Narasimhan filtrations. They satisfy
408
+ \begin{equation}\label{eq:slicing-covariance}
409
+ \mathcal P(\varphi+1)=\mathcal P(\varphi)[1],\qquad
410
+ \Phi\mathcal P(\varphi)=\mathcal P(\varphi+2/5)
411
+ \quad(\varphi\in\R),
412
+ \end{equation}
413
+ and every nonzero $E\in\mathcal P(\varphi)$ satisfies
414
+ \begin{equation}\label{eq:semistable-support}
415
+ Z(E)\in\R_{>0}e^{i\pi\varphi},\qquad
416
+ \norm{[E]}\le C|Z(E)|.
417
+ \end{equation}
418
+ \end{proposition}
419
+
420
+ \begin{proof}
421
+ First consider the generators. If two are in different blocks and the
422
+ source has strictly larger phase, its block index is larger: for $j<k$
423
+ one has $(j+1)/5\le k/5$. Thus their Hom group vanishes by
424
+ Lemma~\ref{lem:block-filtrations}. The case of a common block is
425
+ Lemma~\ref{lem:block-hom}. Induction along extensions in each variable
426
+ now gives
427
+ \[
428
+ \Hom(\mathcal P(\varphi),\mathcal P(\psi))=0
429
+ \qquad(\varphi>\psi).
430
+ \]
431
+ The categories are additive, since finite direct sums are split
432
+ extensions. The charge of an extension of phase-$\varphi$ generators
433
+ is a sum of positive multiples of $e^{i\pi\varphi}$ and hence is again
434
+ positive on that ray. Likewise the triangle inequality gives
435
+ \[
436
+ \norm{[E]}\le\sum_j\norm{[E_j]}
437
+ \le C\sum_j|Z(E_j)|=C|Z(E)|
438
+ \]
439
+ for any such extension filtration. This proves
440
+ \eqref{eq:semistable-support}.
441
+
442
+ Refine the decreasing block filtration of any object by
443
+ Lemma~\ref{lem:block-hn}, splicing the resulting triangles by the
444
+ octahedral axiom. The phases are weakly decreasing globally and strictly
445
+ decreasing inside each block. Adjacent equal phases can only occur at a
446
+ shared endpoint; merging each run of equal-phase factors into its
447
+ extension gives a finite filtration with strictly decreasing phases and
448
+ factors in the corresponding $\mathcal P(\varphi)$. This also explains
449
+ why both blocks at a shared endpoint must enter the same phase category.
450
+
451
+ By \eqref{eq:fifths-nesting}, the functors $[1]$ and $\Phi$ take
452
+ $(\mathcal H_k,\mathcal S_k)$ to
453
+ $(\mathcal H_{k+5},\mathcal S_{k+5})$ and
454
+ $(\mathcal H_{k+2},\mathcal S_{k+2})$, respectively. These equivalences
455
+ take exact sequences in the hearts to exact sequences, preserve the
456
+ condition of being saturated in a block, and change the assigned phase
457
+ by $1$ and $2/5$. They therefore preserve block-semistability with these
458
+ phase increments. Applying them and their inverses to the extension
459
+ closures proves both equalities in \eqref{eq:slicing-covariance}.
460
+ The phase-cut argument that follows proves closure under direct
461
+ summands without presupposing a slicing heart.
462
+ \end{proof}
463
+
464
+ For any interval $I\subset\R$, write $\mathcal P(I)$ for the extension
465
+ closure of the $\mathcal P(\varphi)$ with $\varphi\in I$.
466
+
467
+ \begin{lemma}[Direct construction of the phase cuts]\label{lem:phase-cuts}
468
+ For every real $c$, both pairs
469
+ \begin{equation}\label{eq:phase-cuts}
470
+ \bigl(\mathcal P((c,\infty)),\mathcal P((-\infty,c])\bigr),
471
+ \qquad
472
+ \bigl(\mathcal P([c,\infty)),\mathcal P((-\infty,c))\bigr)
473
+ \end{equation}
474
+ are an aisle and its right orthogonal for a bounded t-structure.
475
+ Their hearts are respectively
476
+ $\mathcal P((c,c+1])$ and $\mathcal P([c,c+1))$.
477
+ Every interval category is the intersection of its lower and upper cut
478
+ categories, with the indicated endpoint conventions. In particular,
479
+ these categories, including each $\mathcal P(\varphi)$, are closed under
480
+ direct summands.
481
+ \end{lemma}
482
+
483
+ \begin{proof}
484
+ Denote either pair in \eqref{eq:phase-cuts} by $(\mathcal U,\mathcal L)$.
485
+ Strict phase separation gives $\Hom(\mathcal U,\mathcal L)=0$ by
486
+ extension induction. Equation~\eqref{eq:slicing-covariance} gives
487
+ $\mathcal U[1]\subset\mathcal U$ and
488
+ $\mathcal L[-1]\subset\mathcal L$. Cutting the finite decreasing
489
+ filtration at $c$ and splicing triangles gives, for every $E$, a triangle
490
+ \begin{equation}\label{eq:phase-truncation}
491
+ U_E\longrightarrow E\longrightarrow L_E\longrightarrow U_E[1],
492
+ \qquad U_E\in\mathcal U,\ L_E\in\mathcal L.
493
+ \end{equation}
494
+ All factors of phase exactly $c$ are assigned to the same side, according
495
+ to the selected convention. These are the t-structure axioms in the
496
+ aisle/right-orthogonal convention, and we can verify the orthogonal
497
+ characterizations directly before using any summand closure. If
498
+ $E\in{}^\perp\mathcal L$, applying $\Hom(-,L_E)$ to
499
+ \eqref{eq:phase-truncation} shows that $\Hom(L_E,L_E)=0$, since its
500
+ neighboring terms $\Hom(U_E[1],L_E)$ and $\Hom(E,L_E)$ vanish.
501
+ Thus $L_E=0$ and $E\in\mathcal U$. Similarly, if
502
+ $E\in\mathcal U^\perp$, apply $\Hom(U_E,-)$ and use
503
+ $\Hom(U_E,L_E[-1])=\Hom(U_E,E)=0$ to obtain $U_E=0$.
504
+ Hence
505
+ \[
506
+ \mathcal U={}^\perp\mathcal L,\qquad
507
+ \mathcal L=\mathcal U^\perp.
508
+ \]
509
+ They are consequently closed under direct summands, and
510
+ \eqref{eq:phase-truncation} is a genuine truncation triangle. Finite
511
+ upper and lower bounds on the phases of each object's filtration, and
512
+ the shift law, prove boundedness.
513
+
514
+ We justify the interval description explicitly. A nonempty decreasing
515
+ filtration with nonzero phase factors cannot have zero total object.
516
+ Indeed, the identity of its first factor maps nontrivially into the
517
+ total object: at each subsequent triangle this map remains nonzero
518
+ because $\Hom(F_1,F_j[-1])=0$. Now group a chosen filtration of an
519
+ object at the two endpoints of an interval. If the object lies in the
520
+ upper and lower cut categories, the preceding orthogonal
521
+ characterizations force the exterior truncation objects to be zero.
522
+ By the observation just made, their groups of factors are empty. The
523
+ remaining factors lie in the interval. The reverse inclusion follows
524
+ from extension closure. This works with either choice at either
525
+ endpoint, as well as for rays and singletons.
526
+ Intersecting the aisle with the right orthogonal of its shift therefore
527
+ gives precisely the two displayed hearts. Finally, intersections of
528
+ orthogonals are closed under summands, which proves the last assertion.
529
+ \end{proof}
530
+
531
+ \subsection{Quasi-abelian intervals and local finite length}
532
+
533
+ It remains to verify local finiteness. We first identify the exact sequences
534
+ in a short phase interval by realizing it inside a phase-cut heart. We then
535
+ use a positive projection of the charge to bound the length of every strict
536
+ filtration in that interval.
537
+
538
+ \begin{lemma}[The exact structure on a short phase interval]
539
+ \label{lem:interval-quasiabelian}
540
+ For every interval $I$ of width less than one, with any choices of open
541
+ or closed endpoints, $\mathcal P(I)$ is quasi-abelian. Its strict exact
542
+ sequences are exactly the short exact sequences of a suitable bounded
543
+ heart whose three terms belong to $\mathcal P(I)$.
544
+ \end{lemma}
545
+
546
+ \begin{proof}
547
+ The empty interval gives the zero category. Otherwise let $a\le b$
548
+ be its endpoints, with $b-a<1$. If $a$ is excluded, use the heart
549
+ $\mathcal H=\mathcal P((a,a+1])$; if it is included, use
550
+ $\mathcal H=\mathcal P([a,a+1))$. Inside this heart, the cut at $b$
551
+ gives a torsion pair $(\mathcal T,\mathcal F)$ with
552
+ $\mathcal F=\mathcal P(I)$. Equality at $b$ is assigned to
553
+ $\mathcal F$ exactly when $b\in I$. For example, for $I=(a,b)$ it is
554
+ \[
555
+ \mathcal T=\mathcal P([b,a+1]),\qquad
556
+ \mathcal F=\mathcal P((a,b))
557
+ \quad\text{in }\mathcal P((a,a+1]).
558
+ \]
559
+ For $I=(a,b]$ the corresponding torsion class is
560
+ $\mathcal P((b,a+1])$. The lower-closed variants use the other heart
561
+ above and the same upper-endpoint rule. Hom orthogonality follows from
562
+ the phase inequality, and the cut triangles have all terms in
563
+ $\mathcal H$, so they give the required short exact decompositions.
564
+
565
+ We prove the quasi-abelian assertion directly for a torsion-free class
566
+ $\mathcal F$ in an abelian heart $\mathcal H$; this standard fact is also
567
+ recorded in \cite[Lemma~3.1]{Tattar2021}.
568
+ It is closed under subobjects and extensions. For a morphism
569
+ $f:A\to B$ in $\mathcal F$, put
570
+ $K=\ker_{\mathcal H}f$, $J=\im_{\mathcal H}f$, and
571
+ $Q=\operatorname{coker}_{\mathcal H}f$.
572
+ The kernel in $\mathcal F$ is $K$, and the cokernel is
573
+ $Q/t(Q)$, where $t(Q)$ denotes the torsion part of $Q$.
574
+ Indeed, maps from $Q$ to an object of $\mathcal F$ annihilate $t(Q)$;
575
+ this proves the cokernel's universal property. Both $K$ and $J$ lie in
576
+ $\mathcal F$. Consequently the internal coimage of $f$ is $J$, whereas
577
+ its internal image is the preimage of $t(Q)$ under $B\to Q$.
578
+
579
+ Recall that a morphism is strict if its canonical coimage-to-image map
580
+ is an isomorphism. The preceding formulas show that a strict
581
+ monomorphism in $\mathcal F$ is exactly a monomorphism in $\mathcal H$
582
+ whose cokernel belongs to $\mathcal F$. A strict epimorphism in
583
+ $\mathcal F$ is exactly an epimorphism in $\mathcal H$ between its
584
+ objects: for an internal epimorphism the internal image is $B$, and
585
+ strictness says precisely that $J=B$. This statement is about strict
586
+ epimorphisms, not all epimorphisms of the subcategory.
587
+
588
+ The pushout in $\mathcal H$ of a strict monomorphism $A\hookrightarrow B$
589
+ along $A\to A'$ fits into
590
+ \[
591
+ 0\longrightarrow A'\longrightarrow B'\longrightarrow B/A
592
+ \longrightarrow0.
593
+ \]
594
+ Both outside terms are in $\mathcal F$, so $B'\in\mathcal F$ and the
595
+ new monomorphism is strict. The pullback in $\mathcal H$ of a strict
596
+ epimorphism $A\twoheadrightarrow B$ along $B'\to B$ is a subobject of
597
+ $A\oplus B'$, hence lies in $\mathcal F$, and its projection to $B'$ is
598
+ an ambient epimorphism, hence strict. These ambient universal
599
+ properties remain universal in the full subcategory $\mathcal F$.
600
+ Thus kernels and cokernels exist, pushouts preserve strict
601
+ monomorphisms, and pullbacks preserve strict epimorphisms. This proves
602
+ quasi-abelianity and the stated description of strict exact sequences.
603
+ \end{proof}
604
+
605
+ \begin{proposition}[Local finiteness]\label{prop:local-finiteness}
606
+ Every phase interval of width less than one generates a finite-length
607
+ quasi-abelian category. Hence the slicing in
608
+ Proposition~\ref{prop:slicing} is locally finite.
609
+ \end{proposition}
610
+
611
+ \begin{proof}
612
+ Let $I$ have endpoints $a\le b$ and width $w=b-a<1$, and put
613
+ \[
614
+ q_I(z)=\Re\bigl(e^{-i\pi(a+b)/2}z\bigr),\qquad
615
+ d_I=\frac{\ell}{C}\cos(\pi w/2)>0,
616
+ \]
617
+ where $\ell$ is the full-lattice norm lower bound used in
618
+ Lemma~\ref{lem:block-hn}. A nonzero semistable $F$ of phase in $I$ has
619
+ nonzero numerical class, since its charge is nonzero. Therefore
620
+ \eqref{eq:semistable-support} gives
621
+ \[
622
+ q_I(Z(F))\ge\cos(\pi w/2)|Z(F)|\ge d_I.
623
+ \]
624
+ Every nonzero object of $\mathcal P(I)$ is a finite extension of nonzero
625
+ semistable objects with phases in $I$. Additivity thus gives the same
626
+ lower bound $q_I(Z(E))\ge d_I$ for every such object.
627
+
628
+ By Lemma~\ref{lem:interval-quasiabelian}, a strict exact sequence in
629
+ $\mathcal P(I)$ is exact in its ambient heart, so the projection $q_I Z$
630
+ is additive on it. Every nonzero successive quotient in a strict
631
+ filtration of a fixed $E\in\mathcal P(I)$ is again an object of
632
+ $\mathcal P(I)$ and consumes at least $d_I$ of this projection.
633
+ The number of such quotients is consequently at most
634
+ $q_I(Z(E))/d_I$. This bounds both increasing and decreasing strict
635
+ subobject chains, and proves finite length in the quasi-abelian exact
636
+ structure. The argument uses discreteness of the full numerical
637
+ lattice; it requires no discreteness of its image under $Z$.
638
+ \end{proof}
639
+
640
+ The charge is numerical and normalized on point sheaves by
641
+ Proposition~\ref{prop:central-charge}; its eigencharge identity combines
642
+ with \eqref{eq:slicing-covariance}. Proposition~\ref{prop:slicing},
643
+ Lemma~\ref{lem:phase-cuts}, and Proposition~\ref{prop:local-finiteness}
644
+ give all slicing, Harder--Narasimhan, and local-finiteness requirements.
645
+ Finally \eqref{eq:semistable-support} is the support property on the
646
+ \emph{full} space $\Knum(X)_\R$. This completes the proof of
647
+ Theorem~\ref{thm:main}.
preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/build/sections/introduction.tex ADDED
@@ -0,0 +1,147 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{Introduction}
2
+
3
+ Stability conditions organize the objects of a derived category by a complex
4
+ central charge and a real phase, with finite filtrations into semistable
5
+ objects. Their physical antecedent is Douglas's proposal of $\Pi$-stability
6
+ for D-branes \cite{Douglas2001}; Bridgeland gave the mathematical framework
7
+ used here \cite{Bridgeland2007}. At a Gepner point, one seeks a stability
8
+ condition compatible with a distinguished autoequivalence: the functor should
9
+ rotate the central charge and translate every semistable phase by a fixed
10
+ amount. We construct such a condition for every smooth quintic threefold.
11
+
12
+ Let $X\subset\mathbb P^4_{\C}$ be a smooth quintic hypersurface, and put
13
+ $\D=\Db(\Coh(X))$ and $H=c_1(\OO_X(1))$. The structure sheaf is spherical:
14
+ $\Ext^*(\OO_X,\OO_X)=\C\oplus\C[-3]$. Using the spherical twist of
15
+ Seidel--Thomas \cite{SeidelThomas2001}, we consider the autoequivalence
16
+ \[
17
+ \Phi=T_{\OO_X}\circ(-\otimes\OO_X(1)),\qquad
18
+ T_{\OO_X}(E)=\operatorname{Cone}\bigl(
19
+ R\Hom(\OO_X,E)\otimes\OO_X\longrightarrow E\bigr).
20
+ \]
21
+ We write $\Knum(X)$ for the Grothendieck group modulo the radical of its Euler
22
+ pairing, and $\Knum(X)_{\R}=\Knum(X)\otimes_{\Z}\R$.
23
+ A numerical central charge is a homomorphism $Z\colon\Knum(X)\to\C$.
24
+
25
+ Following Bridgeland \cite{Bridgeland2007}, a slicing $\mathcal P$ is a family
26
+ of full additive subcategories $\mathcal P(\varphi)\subset\D$, indexed by
27
+ $\varphi\in\R$, with
28
+ $\mathcal P(\varphi+1)=\mathcal P(\varphi)[1]$,
29
+ vanishing $\Hom(\mathcal P(\varphi_1),\mathcal P(\varphi_2))$ for
30
+ $\varphi_1>\varphi_2$, and finite Harder--Narasimhan filtrations by distinguished
31
+ triangles with strictly decreasing phases. A nonzero object of
32
+ $\mathcal P(\varphi)$ has charge in $\R_{>0}e^{i\pi\varphi}$. Local finiteness
33
+ requires the extension categories of sufficiently short phase intervals to be
34
+ quasi-abelian of finite length. We use the support property of
35
+ Kontsevich--Soibelman \cite[Section~1.2]{KontsevichSoibelman2008}, expressed on
36
+ the full numerical group: there exist a norm on $\Knum(X)_{\R}$ and a
37
+ constant $C>0$ such that
38
+ \[
39
+ \norm{[E]}\le C|Z(E)|
40
+ \quad\text{for every nonzero }E\in\mathcal P(\varphi).
41
+ \]
42
+ The pair $(Z,\mathcal P)$ is a numerical Bridgeland stability condition when
43
+ these charge and slicing requirements hold, with local finiteness.
44
+ We will also verify directly that each phase category is closed under direct
45
+ summands, using the phase cuts constructed in Lemma~\ref{lem:phase-cuts}.
46
+
47
+ Toda formulated Gepner-type stability for graded matrix factorizations
48
+ \cite[Definition~2.3 and Conjecture~1.2]{Toda2013}, and gave the normalized
49
+ quintic formulation in \cite[Conjecture~3.1]{TodaQuintic2013}.
50
+ The following theorem positively resolves this quintic conjecture.
51
+
52
+ \begin{theorem}\label{thm:main}
53
+ Every smooth complex quintic threefold admits a numerical Bridgeland stability
54
+ condition $\sigma=(Z,\mathcal P)$ with the support property on $\Knum(X)_{\R}$
55
+ such that, for every $E\in\D$ and $\varphi\in\R$,
56
+ \[
57
+ Z(\Phi E)=e^{2\pi i/5}Z(E),\qquad
58
+ \Phi\bigl(\mathcal P(\varphi)\bigr)=\mathcal P(\varphi+2/5),\qquad
59
+ Z(\OO_x)=-1
60
+ \]
61
+ for every closed point $x\in X$.
62
+ \end{theorem}
63
+
64
+ The normalization identifies our central charge with Toda's by the uniqueness
65
+ of the normalized eigenform proved in Proposition~\ref{prop:central-charge}.
66
+
67
+ \paragraph{Prior work and the remaining construction.}
68
+ The functor relation $\Phi^5\simeq[2]$ and its eigencharge are established
69
+ features of the quintic Gepner problem. Orlov's equivalence
70
+ \cite[Theorem~2.5]{Orlov2009} and the compatibility with grade shift proved by
71
+ Ballard--Favero--Katzarkov \cite[Proposition~5.8 and Remark~5.12]{BallardFaveroKatzarkov2012}
72
+ identify the relevant categorical symmetry; Toda recalls this identification
73
+ in \cite[Theorem~2.5]{TodaQuintic2013}. A direct computation with
74
+ Fourier--Mukai kernels appears in Aspinwall \cite[Section~7.1.4]{Aspinwall2004}.
75
+ Section~\ref{sec:numerical} fixes the numerical conventions used in our
76
+ construction; Appendix~\ref{app:periodicity} supplies a relative-kernel proof
77
+ of the functor relation.
78
+
79
+ The double-tilt approach to threefold stability was developed by
80
+ Bayer--Macr\`i--Toda \cite{BayerMacriToda2014}. For the Gepner charge, Toda
81
+ already proposed the first slope tilt at $-1/2$ and the second tilt using
82
+ the imaginary part of that charge
83
+ \cite[Sections~3.4--3.6 and Conjecture~3.9]{TodaQuintic2013}.
84
+ His Remark~3.10 identifies the existence of Harder--Narasimhan filtrations
85
+ for this irrational charge as a remaining difficulty.
86
+ The existence of numerical Bridgeland stability conditions on every smooth
87
+ quintic was established by Li \cite[Theorem~1.3]{Li2019}.
88
+ Theorem~\ref{thm:main} adds the specified Gepner symmetry.
89
+ Our slope-sheaf input is a consequence
90
+ of Xu's stronger Bogomolov--Gieseker inequality
91
+ \cite[Theorem~1.3]{Xu2026}, whose hypotheses and precise comparison with the
92
+ bound used here are recorded in Lemma~\ref{lem:slope-input}.
93
+
94
+ \paragraph{Main idea and proof roadmap.}
95
+ The central step is to retain two independent perturbations of Toda's second
96
+ cut. They give inequalities controlling rank and first Chern character; the
97
+ complex charge then controls the other two numerical coordinates. We obtain
98
+ this support estimate before defining semistable objects. It makes finite
99
+ refinement possible even though the image of the numerical lattice under the
100
+ charge need not be discrete.
101
+
102
+ The proof proceeds through four stages.
103
+ \begin{enumerate}
104
+ \item In Section~\ref{sec:numerical}, we record periodicity and compute the
105
+ unique normalized eigencharge. We also identify the full numerical group
106
+ with a rank-four lattice. The resulting coordinate estimate will turn
107
+ control of rank, first Chern character, and charge into full support.
108
+
109
+ \item In Section~\ref{sec:aisles}, we construct a family of bounded aisles
110
+ $U_\eta$, where an aisle is the nonpositive part of a bounded
111
+ $t$-structure and $\eta=(\eta_0,\eta_1)$ ranges over a fixed open square in
112
+ $\R^2$. The construction tilts $\Coh(X)$ twice, beginning at slope
113
+ $-1/2$, and varies the rank and first-Chern coefficients of the second cut.
114
+ Xu's inequality supplies strict margins for the comparison. The crucial
115
+ conclusion of Proposition~\ref{prop:uniform-aisle} is
116
+ \[
117
+ \Phi U_{\eta}\subset U_{\theta}.
118
+ \]
119
+ Both parameters vary independently throughout the same square.
120
+
121
+ \item In Section~\ref{sec:grid}, periodicity and positivity refine the
122
+ translated aisles to a nested grid $V_k$, indexed by integers, with phase
123
+ spacing $1/5$ (Proposition~\ref{prop:fine-grid}). The category
124
+ $\mathcal S_k=V_k\cap V_{k+1}^\perp$ between consecutive aisles is called
125
+ a block; here $\perp$ is right $\Hom$-orthogonality. Its charges lie in a
126
+ closed sector of angle $\pi/5$. Each block object belongs to every member
127
+ of a suitable perturbed family of hearts. Testing all those perturbations
128
+ gives the full support estimate of Proposition~\ref{prop:block-support}.
129
+
130
+ \item We then refine each block into semistable factors
131
+ (Lemma~\ref{lem:block-hn}). Support and a positive projection of the charge
132
+ bound the numerical classes of subobjects and the length of any refinement.
133
+ The full lattice is discrete, so maximal phases exist and refinement stops.
134
+ We merge shared endpoint phases to obtain the slicing, construct its phase
135
+ cuts, and prove local finiteness through the exact structure of short phase
136
+ intervals (Proposition~\ref{prop:local-finiteness}).
137
+ \end{enumerate}
138
+
139
+ \paragraph{Conventions and prerequisites.}
140
+ Our aisle convention is degree $\le0$, so aisles are closed under $[1]$.
141
+ For a subcategory $\mathcal C$, the notation
142
+ $\mathcal C^\perp$ means its right $\Hom$-orthogonal. Extension closures always
143
+ include the zero object and finite iterated extensions. We use standard
144
+ coherent-sheaf cohomology, slope Harder--Narasimhan filtrations, derived
145
+ truncations, Riemann--Roch, Serre duality, and the hyperplane theorem. The
146
+ specific slope inequality is cited as above; the construction of the
147
+ stability condition from it is given in full.
preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/build/sections/numerical.tex ADDED
@@ -0,0 +1,207 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{Periodicity and the numerical central charge}
2
+ \label{sec:numerical}
3
+
4
+ Throughout, $X\subset\mathbf P^4_{\C}$ is a smooth hypersurface of degree
5
+ five, $i\colon X\hookrightarrow\mathbf P^4$ is its inclusion, and
6
+ $\D=\Db(\Coh(X))$. Put $H=c_1(\OO_X(1))$, so that $\int_XH^3=5$.
7
+ For an object $E\in\D$ we use the normalized characters
8
+ \begin{equation}
9
+ \label{eq:normalized-characters}
10
+ v(E)=(r,c,d,e)
11
+ =\left(\rk(E),\frac{\int_XH^2\ch_1(E)}5,
12
+ \frac{\int_XH\ch_2(E)}5,
13
+ \frac{\int_X\ch_3(E)}5\right).
14
+ \end{equation}
15
+ In particular, ordinary slope is normalized as $\mu_H(E)=c(E)/r(E)$
16
+ for a sheaf of positive rank. We first record the functor relation that
17
+ will make the subsequent family of aisles periodic, and then determine
18
+ the central charge on the full numerical Grothendieck group.
19
+ The periodicity is already visible in Aspinwall's direct kernel calculation
20
+ \cite[Section~7.1.4]{Aspinwall2004}. It also follows from Orlov's equivalence
21
+ \cite[Theorem~2.5]{Orlov2009} and its compatibility with grade shift
22
+ \cite[Proposition~5.8 and Remark~5.12]{BallardFaveroKatzarkov2012},
23
+ as recalled in \cite[Theorem~2.5]{TodaQuintic2013}.
24
+ Appendix~\ref{app:periodicity} gives a direct proof, keeping track of the
25
+ relative kernels and the natural transformations needed for a functor
26
+ isomorphism. Here we record the relation and compute its numerical action.
27
+
28
+ \begin{lemma}\label{lem:periodicity}
29
+ Let $\Phi=T_{\OO_X}\circ(-\otimes\OO_X(1))$. There is a natural
30
+ isomorphism of exact functors
31
+ \begin{equation}\label{eq:periodicity}
32
+ \Phi^5\simeq[2].
33
+ \end{equation}
34
+ Consequently $\Phi$ is an autoequivalence, with inverse $\Phi^4[-2]$.
35
+ \end{lemma}
36
+
37
+ To prove the relation, expand the ordered composition as
38
+ \[
39
+ \Phi^5\simeq
40
+ T_{\OO_X}\circ T_{\OO_X(1)}\circ\cdots\circ T_{\OO_X(4)}
41
+ \circ(-\otimes\OO_X(5)).
42
+ \]
43
+ The rightmost functor acts first. The relative-kernel argument in
44
+ Appendix~\ref{app:periodicity} identifies this twist product with
45
+ tensoring by $\OO_X(-5)$ followed by $[2]$.
46
+
47
+ We next identify the entire numerical group and its integral discreteness.
48
+ After computing the charge, these coordinates will also show that controlling
49
+ rank, first Chern character, and charge suffices to control a numerical class.
50
+
51
+ \begin{lemma}\label{lem:numerical}
52
+ The map $v$ identifies $\Knum(X)_{\R}$ with $\R^4$. Under this
53
+ identification, $\Knum(X)$ is a full discrete lattice contained in
54
+ \begin{equation}\label{eq:numerical-lattice}
55
+ \Z\times\Z\times\tfrac1{10}\Z\times\tfrac1{30}\Z.
56
+ \end{equation}
57
+ For $v=(r,c,d,e)$ and $w=(r',c',d',e')$, the Euler form is
58
+ \begin{equation}\label{eq:euler-form}
59
+ \chi(v,w)=5\left(re'-cd'+dc'-er'
60
+ +\frac56(rc'-cr')\right).
61
+ \end{equation}
62
+ The matrix induced by $\Phi$ is
63
+ \begin{equation}\label{eq:numerical-rotation}
64
+ M=
65
+ \begin{pmatrix}
66
+ -4&-20/3&-5&-5\\
67
+ 1&1&0&0\\
68
+ 1/2&1&1&0\\
69
+ 1/6&1/2&1&1
70
+ \end{pmatrix},
71
+ \qquad
72
+ \det(zI-M)=z^4+z^3+z^2+z+1.
73
+ \end{equation}
74
+ \end{lemma}
75
+
76
+ \begin{proof}
77
+ The Weak Lefschetz Theorem (in the integral form recalled in
78
+ \cite[Theorem~3]{Catanese2014}) and Poincar\'e duality give
79
+ $H^{2j}(X,\Q)=\Q H^j$ for $0\le j\le3$; the integral version also
80
+ gives $H^2(X,\Z)=\Z H$. Thus the even Chern character is precisely
81
+ \[
82
+ \ch(E)=r+cH+dH^2+eH^3.
83
+ \]
84
+ The tangent sequence gives
85
+ $c(T_X)=(1+H)^5/(1+5H)$, so that $c_1(T_X)=0$,
86
+ $c_2(T_X)=10H^2$, and
87
+ \[
88
+ \operatorname{td}(X)=1+\frac56H^2.
89
+ \]
90
+ Hirzebruch--Riemann--Roch, obtained by taking the proper map to a point in
91
+ \cite[Section~7]{BorelSerre1958}, now gives \eqref{eq:euler-form}, and in
92
+ particular
93
+ \begin{equation}\label{eq:euler-characteristic}
94
+ \chi(E)=5\left(e(E)+\frac56c(E)\right).
95
+ \end{equation}
96
+ The matrix of the bilinear form~\eqref{eq:euler-form} is
97
+ \[
98
+ J=\begin{pmatrix}
99
+ 0&25/6&0&5\\
100
+ -25/6&0&-5&0\\
101
+ 0&5&0&0\\
102
+ -5&0&0&0
103
+ \end{pmatrix},
104
+ \qquad\det J=625.
105
+ \]
106
+ Moreover the four vectors
107
+ \[
108
+ v(\OO_X(k))=(1,k,k^2/2,k^3/6),\qquad 0\le k\le3,
109
+ \]
110
+ span $\Q^4$: their row matrix has determinant one. It follows that
111
+ the kernel of $v$ on $K_0(X)$ is exactly the radical of the Euler
112
+ pairing. Indeed one implication follows from Riemann--Roch, and the
113
+ other follows by testing against these four spanning vectors and using
114
+ the nondegeneracy of $J$. Hence $v$ identifies the numerical group with
115
+ its image, which spans $\Q^4$.
116
+
117
+ For any class of $K_0(X)$, integrality of Chern classes and
118
+ \[
119
+ \ch_2=\frac{c_1^2-2c_2}{2},\qquad
120
+ \ch_3=\frac{c_1^3-3c_1c_2+3c_3}{6}
121
+ \]
122
+ give $d\in\tfrac1{10}\Z$ and $e\in\tfrac1{30}\Z$; integral Weak
123
+ Lefschetz gives $c\in\Z$. The image is therefore a subgroup of the
124
+ discrete lattice in \eqref{eq:numerical-lattice}. Since it contains the
125
+ four spanning line-bundle classes, it is itself a full lattice.
126
+ In particular its real span is the full space $\R^4$.
127
+
128
+ Tensoring by $\OO_X(1)$ sends
129
+ \[
130
+ (r,c,d,e)\longmapsto
131
+ \left(r,c+r,d+c+\frac r2,e+d+\frac c2+\frac r6\right).
132
+ \]
133
+ The twist $T_{\OO_X}$ then subtracts $\chi(E(1))$ from the rank and leaves
134
+ the other three coordinates unchanged. Formula~\eqref{eq:euler-characteristic}
135
+ therefore gives $M$ as displayed. Expanding $\det(zI-M)$ gives
136
+ \eqref{eq:numerical-rotation}; in particular its four eigenvalues are
137
+ the nonidentity fifth roots of unity, each with multiplicity one.
138
+ \end{proof}
139
+
140
+ We denote by $\Phi_*$ the induced automorphism of $\Knum(X)$ and its
141
+ real-linear extension to $\Knum(X)_{\R}$; both are represented by $M$ in
142
+ these coordinates.
143
+
144
+ Put
145
+ \begin{equation}\label{eq:charge-constants}
146
+ \lambda=\exp(2\pi i/5),\qquad
147
+ t_0=\frac12\cot(\pi/5)>0,\qquad
148
+ u=\frac45\sin^2(\pi/5)=\frac{5-\sqrt5}{10}.
149
+ \end{equation}
150
+
151
+ \begin{proposition}\label{prop:central-charge}
152
+ There is a unique numerical homomorphism $Z\colon\Knum(X)\to\C$
153
+ such that $Z\circ\Phi=\lambda Z$ and $Z(\OO_x)=-1$ for closed points
154
+ $x\in X$. It is
155
+ \begin{equation}\label{eq:central-charge}
156
+ \frac{Z(r,c,d,e)}5
157
+ =\frac{\lambda-1}{5}r
158
+ +\left(t_0^2-\frac56+\frac{i t_0}{2}\right)c
159
+ +\left(-\frac12+i t_0\right)d-e.
160
+ \end{equation}
161
+ In particular,
162
+ \begin{equation}\label{eq:imaginary-charge}
163
+ \frac{\Im Z(r,c,d,e)}{5t_0}=d+\frac12c+ur.
164
+ \end{equation}
165
+ For any fixed norm on $\Knum(X)_{\R}$, there is a constant $C_0>0$
166
+ such that every real numerical class $v=(r,c,d,e)$ satisfies
167
+ \begin{equation}\label{eq:numerical-norm-control}
168
+ \norm{v}\le C_0\bigl(|r|+|c|+|Z(v)|\bigr).
169
+ \end{equation}
170
+ \end{proposition}
171
+
172
+ \begin{proof}
173
+ A closed point has $v(\OO_x)=(0,0,0,1/5)$, so the normalization fixes
174
+ the coefficient of $e$ in $Z/5$ to be $-1$.
175
+ Write $Z/5=Ar+Bc+Cd-e$. Reading the $e$, $d$, and $c$ columns of
176
+ $ZM=\lambda Z$, in that order, gives
177
+ \[
178
+ A=\frac{\lambda-1}{5},\qquad
179
+ C=-\frac{\lambda}{\lambda-1},\qquad
180
+ B=-\frac43+\frac{C-1/2}{\lambda-1}.
181
+ \]
182
+ The identity
183
+ \[
184
+ \frac1{\lambda-1}=-\frac12-i t_0
185
+ \]
186
+ then gives $C=-1/2+i t_0$ and
187
+ $B=t_0^2-5/6+i t_0/2$. Substitution in the remaining, rank-column
188
+ equation reduces it to
189
+ $1+\lambda+\lambda^2+\lambda^3+\lambda^4=0$.
190
+ This proves both the eigenvalue identity and uniqueness with the stated
191
+ normalization. Taking imaginary parts and using
192
+ \[
193
+ \frac{\sin(2\pi/5)}{5t_0}
194
+ =\frac45\sin^2(\pi/5)=u
195
+ \]
196
+ proves \eqref{eq:imaginary-charge}.
197
+
198
+ Finally, the real coefficient matrix of $(d,e)$ in
199
+ $(\Re Z,\Im Z)$ is
200
+ \[
201
+ \begin{pmatrix}-5/2&-5\\5t_0&0\end{pmatrix},
202
+ \qquad \det=25t_0\ne0.
203
+ \]
204
+ Thus $v\mapsto(r,c,\Re Z(v),\Im Z(v))$ is an isomorphism of real
205
+ vector spaces. Boundedness of its inverse in finite dimension proves
206
+ \eqref{eq:numerical-norm-control}.
207
+ \end{proof}
preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/build/sections/periodicity.tex ADDED
@@ -0,0 +1,153 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{A relative-kernel proof of periodicity}
2
+ \label{app:periodicity}
3
+
4
+ \begin{proof}[Proof of Lemma~\ref{lem:periodicity}]
5
+ Write $T_j=T_{\OO_X(j)}$ and $L=(-\otimes\OO_X(1))$.
6
+ We interpret the twist as the Fourier--Mukai transform whose kernel is
7
+ the cone of the evaluation map
8
+ \[
9
+ \OO_X(-j)\boxtimes\OO_X(j)\longrightarrow\OO_\Delta.
10
+ \]
11
+ We take cones in the standard enhancement by complexes of perfect
12
+ kernels, so that the evaluation squares below induce maps of cones.
13
+ Their transforms give natural transformations of functors. Tensoring the evaluation
14
+ kernel gives $LT_jL^{-1}\simeq T_{j+1}$, and hence
15
+ \begin{equation}\label{eq:twist-product}
16
+ \Phi^5\simeq T_0T_1T_2T_3T_4L^5.
17
+ \end{equation}
18
+ We will identify the kernel of $T_0T_1T_2T_3T_4$ with
19
+ $\OO_\Delta(-5)[2]$, where the twist is in the second factor.
20
+
21
+ Keep the first copy of $X$ as a source parameter. Set
22
+ \[
23
+ f=1_X\times i\colon X\times X\longrightarrow X\times\mathbf P^4,
24
+ \qquad
25
+ p\colon X\times\mathbf P^4\longrightarrow X,
26
+ \quad q\colon X\times X\longrightarrow X.
27
+ \]
28
+ Here $p$ and $q$ are the first projections.
29
+ The kernel convention is that $F\in\Db(\Coh(X\times Y))$ sends $E$ to
30
+ $R\pi_{Y*}(\pi_X^*E\otimes^{\mathbf L}F)$.
31
+ For such a kernel, let
32
+ \[
33
+ a_j^Y(F)=R\pi_{X*}\bigl(F\otimes\pi_Y^*\OO_Y(-j)\bigr),
34
+ \qquad
35
+ \mathsf L_j^Y(F)=
36
+ \operatorname{Cone}\bigl(a_j^Y(F)\boxtimes\OO_Y(j)\longrightarrow F\bigr).
37
+ \]
38
+ The arrow is the adjunction evaluation. Projection formula and proper
39
+ base change show that $\mathsf L_j^Y(F)$ represents postcomposition of
40
+ the transform of $F$ with the evaluation cone for $\OO_Y(j)$.
41
+ Indeed, on an input $E$ the first kernel in this cone gives
42
+ \[
43
+ R\Gamma\bigl(X,E\otimes^{\mathbf L}a_j^Y(F)\bigr)\otimes\OO_Y(j)
44
+ \simeq
45
+ R\operatorname{Hom}\bigl(\OO_Y(j),\Phi_F(E)\bigr)\otimes\OO_Y(j).
46
+ \]
47
+ In particular the source coefficient here is $a_j^Y(F)$ itself.
48
+
49
+ These coefficient functors let us compare the evaluation cones on $X$ with
50
+ those on $\mathbf P^4$. We will show that the five projective-space
51
+ evaluations remove all coefficients and leave the zero kernel, while the
52
+ comparison preserves the cone of the divisor counit. Computing that cone
53
+ will give the required shift.
54
+
55
+ Start with
56
+ \[
57
+ K_5=f_*\OO_\Delta,\qquad G_5=\OO_\Delta,\qquad
58
+ u_5\colon Lf^*K_5\longrightarrow G_5
59
+ \]
60
+ given by the counit. For $j=4,3,\ldots,0$, form successively
61
+ \[
62
+ K_j=\mathsf L_j^{\mathbf P^4}(K_{j+1}),
63
+ \qquad
64
+ G_j=\mathsf L_j^X(G_{j+1}).
65
+ \]
66
+ We construct compatible maps $u_j\colon Lf^*K_j\to G_j$ and show
67
+ that their cones are all isomorphic to $\operatorname{Cone}(u_5)$.
68
+
69
+ For any map $u\colon Lf^*K\to G$, the unit followed by $f_*u$ gives
70
+ $K\to f_*G$, hence comparison maps
71
+ \[
72
+ \theta_l\colon a_l^{\mathbf P^4}(K)\longrightarrow a_l^X(G).
73
+ \]
74
+ For $(K_5,G_5,u_5)$ these are isomorphisms for every $l$: the composite
75
+ $f_*\OO_\Delta\to f_*Lf^*f_*\OO_\Delta\to f_*\OO_\Delta$
76
+ is the identity by the adjunction identity. Suppose that, before the
77
+ step indexed by $j$, the maps $\theta_l$ are isomorphisms for
78
+ $0\le l\le j$. The evaluation square
79
+ \[
80
+ \begin{array}{ccc}
81
+ q^*a_j^{\mathbf P^4}(K_{j+1})\otimes\OO_X(j)
82
+ &\longrightarrow& Lf^*K_{j+1}\\
83
+ \big\downarrow\scriptstyle{\simeq}&&\big\downarrow\scriptstyle{u_{j+1}}\\
84
+ q^*a_j^X(G_{j+1})\otimes\OO_X(j)
85
+ &\longrightarrow& G_{j+1}
86
+ \end{array}
87
+ \]
88
+ commutes by adjunction. Taking its cones defines $u_j$; because its
89
+ left vertical arrow is an isomorphism, the cone of $u_j$ is isomorphic
90
+ to the cone of $u_{j+1}$.
91
+
92
+ For $l<j$, apply the coefficient functor $a_l$ to the two evaluation
93
+ triangles. The comparison on their first terms is
94
+ \[
95
+ a_j^{\mathbf P^4}(K_{j+1})\otimes R\Gamma(\mathbf P^4,\OO(j-l))
96
+ \longrightarrow
97
+ a_j^X(G_{j+1})\otimes R\Gamma(X,\OO_X(j-l)).
98
+ \]
99
+ It is an isomorphism: $\theta_j$ is an isomorphism, and the divisor
100
+ sequence
101
+ \[
102
+ 0\longrightarrow\OO_{\mathbf P^4}(m-5)
103
+ \longrightarrow\OO_{\mathbf P^4}(m)
104
+ \longrightarrow i_*\OO_X(m)\longrightarrow0
105
+ \]
106
+ identifies the two cohomology complexes for $1\le m\le4$.
107
+ The comparison on the middle terms is also an isomorphism by induction,
108
+ so the remaining maps $\theta_l$ stay isomorphisms after the mutation.
109
+ This proves the induction and the constancy of the cone.
110
+
111
+ We next show that $K_0=0$. The step indexed by $j$ kills
112
+ $a_j^{\mathbf P^4}$, since
113
+ $R\Gamma(\mathbf P^4,\OO)=\C$. It preserves the already vanishing
114
+ coefficients with indices $k>j$, since
115
+ $R\Gamma(\mathbf P^4,\OO(j-k))=0$ for $1\le k-j\le4$.
116
+ Thus $a_j^{\mathbf P^4}(K_0)=0$ for $0\le j\le4$.
117
+ All these kernels are perfect, and proper base change implies that
118
+ every derived source fiber $F$ of $K_0$ satisfies
119
+ \[
120
+ R\operatorname{Hom}_{\mathbf P^4}(\OO(j),F)=0
121
+ \qquad(0\le j\le4).
122
+ \]
123
+ The exact Koszul complex of the five homogeneous coordinates propagates
124
+ these five consecutive vanishings to
125
+ $R\Gamma(\mathbf P^4,F(n))=0$ for every integer $n$.
126
+ For sufficiently large $n$, Serre vanishing and global generation,
127
+ applied to the finitely many cohomology sheaves of $F$, force all those
128
+ sheaves to vanish. Therefore every derived source fiber is zero, and
129
+ the derived Nakayama lemma gives $K_0=0$. It follows that
130
+ \[
131
+ G_0\simeq\operatorname{Cone}(u_0)
132
+ \simeq\operatorname{Cone}(u_5).
133
+ \]
134
+
135
+ Finally, $f$ is a Cartier divisor embedding with normal bundle
136
+ $\OO_X(5)$ in the target variable. Its two-term divisor resolution
137
+ computes
138
+ \[
139
+ \mathcal H^{-1}(Lf^*f_*\OO_\Delta)=\OO_\Delta(-5),
140
+ \qquad
141
+ \mathcal H^0(Lf^*f_*\OO_\Delta)=\OO_\Delta,
142
+ \]
143
+ with no other cohomology sheaves. The counit $u_5$ induces the identity
144
+ in degree zero. Consequently its cone has the single cohomology sheaf
145
+ $\OO_\Delta(-5)$ in degree $-2$, and
146
+ \[
147
+ G_0\simeq\OO_\Delta(-5)[2].
148
+ \]
149
+ Since $G_0$ is the composition kernel for $T_0T_1T_2T_3T_4$, this is
150
+ an isomorphism of kernels and therefore a natural functor isomorphism.
151
+ Equation~\eqref{eq:twist-product} now gives $\Phi^5\simeq[2]$.
152
+ The asserted inverse follows by composing this relation with $[-2]$.
153
+ \end{proof}
preprints/A-Gepner-stability-condition-on-every-smooth-quintic-threefold-September-24-2026/paper.pdf ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:f70b73596fffb0689874c768d3975cb8e16cbdede231c21baef0707ab1898f49
3
+ size 482371
preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/README.md ADDED
@@ -0,0 +1,18 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ # [A Limiting Satisfiability Threshold for Every Fixed Clause Size](article.pdf)
2
+
3
+ **Author:** OpenAI
4
+
5
+ **Date:** September 25, 2026
6
+
7
+ ## Citation
8
+
9
+ ```bibtex
10
+ @misc{OAI:A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026,
11
+ author = {{OpenAI}},
12
+ title = {{A Limiting Satisfiability Threshold for Every Fixed Clause Size}},
13
+ howpublished = {OpenAI Math Release preprint
14
+ \href{https://github.com/openai/math/blob/main/preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/article.pdf}{OAI:A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026}},
15
+ year = {2026}
16
+ }
17
+ ```
18
+
preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/article.pdf ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:5318fe3d0e3db4e4c22f79dc8b342ae38fc1ddd60172ba78a00ee612c1576365
3
+ size 213536
preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/paper.tex ADDED
@@ -0,0 +1,28 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \documentclass[11pt]{article}
2
+ \input{preamble}
3
+ \title{A Limiting Satisfiability Threshold\\for Every Fixed Clause Size}
4
+ \author{OpenAI}
5
+ \date{September 25, 2026}
6
+
7
+ \begin{document}
8
+ \maketitle
9
+ \begin{abstract}
10
+ For every fixed integer \(k\ge3\), random \(k\)-SAT with independent
11
+ uniformly signed clauses on distinct variables, sampled with replacement,
12
+ has a finite positive limiting satisfiability threshold.
13
+ We credit Gaia Carenini~\cite{Carenini2026Polynomial} with priority for
14
+ resolving the satisfiability conjecture. This paper gives an alternative
15
+ proof, using concentration of a capped last satisfiable index and a
16
+ comparison between different system sizes.
17
+ \end{abstract}
18
+
19
+ \input{sections/introduction}
20
+ \input{sections/forcing}
21
+ \input{sections/concentration}
22
+ \input{sections/anchors}
23
+ \input{sections/convergence}
24
+ \input{sections/three-clause}
25
+ \input{sections/boundaries}
26
+
27
+ \input{references}
28
+ \end{document}
preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/preamble.tex ADDED
@@ -0,0 +1,43 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \pdftrailerid{}
2
+ \pdfinfoomitdate=1
3
+ \pdfsuppressptexinfo=-1
4
+ \usepackage[T1]{fontenc}
5
+ \usepackage{mathpazo}
6
+ \usepackage[margin=1.12in]{geometry}
7
+ \usepackage{amsmath,amssymb,amsthm,mathtools}
8
+ \usepackage{microtype}
9
+ \usepackage[dvipsnames]{xcolor}
10
+ \usepackage{needspace}
11
+ \usepackage{hyperref}
12
+ \hypersetup{
13
+ colorlinks=true,
14
+ linkcolor=MidnightBlue,
15
+ citecolor=MidnightBlue,
16
+ urlcolor=MidnightBlue,
17
+ pdfauthor={OpenAI},
18
+ pdftitle={A Limiting Satisfiability Threshold for Every Fixed Clause Size},
19
+ pdfsubject={Convergence of the random k-SAT satisfiability threshold for every fixed k at least three}
20
+ }
21
+ \urlstyle{same}
22
+ \numberwithin{equation}{section}
23
+ \newtheorem{theorem}{Theorem}[section]
24
+ \newtheorem{proposition}[theorem]{Proposition}
25
+ \newtheorem{lemma}[theorem]{Lemma}
26
+ \newtheorem{corollary}[theorem]{Corollary}
27
+ \theoremstyle{remark}
28
+ \newtheorem{remark}[theorem]{Remark}
29
+ \newcommand{\PP}{\mathbb P}
30
+ \newcommand{\EE}{\mathbb E}
31
+ \newcommand{\Var}{\operatorname{Var}}
32
+ \newcommand{\Pois}{\operatorname{Pois}}
33
+ \newcommand{\Bin}{\operatorname{Bin}}
34
+ \newcommand{\ind}{\mathbf 1}
35
+ \newcommand{\sat}{\mathrm{SAT}}
36
+ \newcommand{\fall}[2]{(#1)_{#2}}
37
+ \newcommand{\eps}{\varepsilon}
38
+ \newcommand{\F}{\mathcal F}
39
+ \newcommand{\sd}{\operatorname{sd}}
40
+ \setlength{\emergencystretch}{2em}
41
+ \clubpenalty=10000
42
+ \widowpenalty=10000
43
+ \displaywidowpenalty=10000
preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/references.tex ADDED
@@ -0,0 +1,155 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \begingroup\small
2
+ \begin{thebibliography}{99}
3
+ \setlength{\itemsep}{0pt}
4
+
5
+ \bibitem{AM}
6
+ E.~Abbe and A.~Montanari,
7
+ \emph{On the concentration of the number of solutions of random
8
+ satisfiability formulas},
9
+ Random Structures Algorithms \textbf{45} (2014), no.~3, 362--382.
10
+ \href{https://doi.org/10.1002/rsa.20501}{doi:10.1002/rsa.20501};
11
+ \href{https://arxiv.org/abs/1006.3786v1}{arXiv:1006.3786v1}.
12
+
13
+ \bibitem{AP}
14
+ D.~Achlioptas and Y.~Peres,
15
+ \emph{The threshold for random \(k\)-SAT is \(2^k\log2-O(k)\)},
16
+ J. Amer. Math. Soc. \textbf{17} (2004), no.~4, 947--973.
17
+ \href{https://doi.org/10.1090/S0894-0347-04-00464-3}
18
+ {doi:10.1090/S0894-0347-04-00464-3}.
19
+
20
+ \bibitem{BGT}
21
+ M.~Bayati, D.~Gamarnik, and P.~Tetali,
22
+ \emph{Combinatorial approach to the interpolation method and scaling
23
+ limits in sparse random graphs},
24
+ Ann. Probab. \textbf{41} (2013), no.~6, 4080--4115.
25
+ \href{https://doi.org/10.1214/12-AOP816}{doi:10.1214/12-AOP816};
26
+ \href{https://arxiv.org/abs/0912.2444v3}{arXiv:0912.2444v3}.
27
+
28
+ \bibitem{BBLM}
29
+ S.~Boucheron, O.~Bousquet, G.~Lugosi, and P.~Massart,
30
+ \emph{Moment inequalities for functions of independent random variables},
31
+ Ann. Probab. \textbf{33} (2005), no.~2, 514--560.
32
+ \href{https://doi.org/10.1214/009117904000000856}
33
+ {doi:10.1214/009117904000000856};
34
+ \href{https://arxiv.org/abs/math/0503651v1}{arXiv:math/0503651v1}
35
+ (electronic reprint).
36
+
37
+ \bibitem{Carenini2026Polynomial}
38
+ G.~Carenini,
39
+ \emph{A polynomial scaling window for random \(k\)-SAT and a proof of
40
+ the satisfiability conjecture},
41
+ Electronic Colloquium on Computational Complexity,
42
+ Report TR26-229 (2026), published 5 October 2026.
43
+ \href{https://eccc.weizmann.ac.il/report/2026/229/}{ECCC Report TR26-229}.
44
+
45
+ \bibitem{Carenini}
46
+ G.~Carenini,
47
+ \emph{The Scaling Window of Random \(k\)-SAT},
48
+ Electronic Colloquium on Computational Complexity,
49
+ Report TR26-145 (2026), preprint;
50
+ \href{https://arxiv.org/abs/2609.26222v1}{arXiv:2609.26222v1}.
51
+ \href{https://eccc.weizmann.ac.il/report/2026/145/}{ECCC Report TR26-145}.
52
+
53
+ \bibitem{CR}
54
+ V.~Chv\'atal and B.~Reed,
55
+ \emph{Mick Gets Some (the Odds Are on His Side)},
56
+ Proc. 33rd Annual Symposium on Foundations of Computer Science (1992),
57
+ 620--627.
58
+ \href{https://doi.org/10.1109/SFCS.1992.267789}{doi:10.1109/SFCS.1992.267789}.
59
+ \href{https://www.diochnos.com/teaching/CS5970/2020F/project-papers/ChvatalReed.pdf}{conference paper PDF}.
60
+
61
+ \bibitem{COP}
62
+ A.~Coja-Oghlan and K.~Panagiotou,
63
+ \emph{The asymptotic \(k\)-SAT threshold},
64
+ Adv. Math. \textbf{288} (2016), 985--1068.
65
+ \href{https://doi.org/10.1016/j.aim.2015.11.007}
66
+ {doi:10.1016/j.aim.2015.11.007};
67
+ \href{https://arxiv.org/abs/1310.2728v6}{arXiv:1310.2728v6}.
68
+
69
+ \bibitem{DSS}
70
+ J.~Ding, A.~Sly, and N.~Sun,
71
+ \emph{Proof of the satisfiability conjecture for large \(k\)},
72
+ Ann. of Math. (2) \textbf{196} (2022), no.~1, 1--388.
73
+ \href{https://doi.org/10.4007/annals.2022.196.1.1}
74
+ {doi:10.4007/annals.2022.196.1.1};
75
+ \href{https://arxiv.org/abs/1411.0650v3}{arXiv:1411.0650v3}.
76
+
77
+ \bibitem{EfronStein}
78
+ B.~Efron and C.~Stein,
79
+ \emph{The jackknife estimate of variance},
80
+ Ann. Statist. \textbf{9} (1981), no.~3, 586--596.
81
+ \href{https://doi.org/10.1214/aos/1176345462}{doi:10.1214/aos/1176345462}.
82
+
83
+ \bibitem{FV}
84
+ J.~Franco and A.~Van Gelder,
85
+ \emph{A perspective on certain polynomial-time solvable classes of
86
+ satisfiability},
87
+ Discrete Appl. Math. \textbf{125} (2003), nos.~2--3, 177--214.
88
+ \href{https://doi.org/10.1016/S0166-218X(01)00358-4}
89
+ {doi:10.1016/S0166-218X(01)00358-4}.
90
+ See also the \href{https://citeseerx.ist.psu.edu/document?doi=a79e4c87237fc557de1acc74371bc986f575a571&repid=rep1&type=pdf}{author manuscript dated 7 August 1998}, Section~8.
91
+
92
+ \bibitem{FL}
93
+ S.~Franz and M.~Leone,
94
+ \emph{Replica bounds for optimization problems and diluted spin systems},
95
+ J. Statist. Phys. \textbf{111} (2003), 535--564.
96
+ \href{https://doi.org/10.1023/A:1022885828956}{doi:10.1023/A:1022885828956};
97
+ \href{https://arxiv.org/abs/cond-mat/0208280v1}{arXiv:cond-mat/0208280v1}.
98
+
99
+ \bibitem{FLT}
100
+ S.~Franz, M.~Leone, and F.~L.~Toninelli,
101
+ \emph{Replica bounds for diluted non-Poissonian spin systems},
102
+ J. Phys. A \textbf{36} (2003), no.~43, 10967--10985.
103
+ \href{https://doi.org/10.1088/0305-4470/36/43/021}
104
+ {doi:10.1088/0305-4470/36/43/021};
105
+ \href{https://arxiv.org/abs/cond-mat/0307367v2}{arXiv:cond-mat/0307367v2}.
106
+
107
+ \bibitem{Friedgut}
108
+ E.~Friedgut, with an appendix by J.~Bourgain,
109
+ \emph{Sharp thresholds of graph properties, and the \(k\)-SAT problem},
110
+ J. Amer. Math. Soc. \textbf{12} (1999), no.~4, 1017--1054.
111
+ \href{https://doi.org/10.1090/S0894-0347-99-00305-7}
112
+ {doi:10.1090/S0894-0347-99-00305-7}.
113
+
114
+ \bibitem{Goerdt}
115
+ A.~Goerdt,
116
+ \emph{A threshold for unsatisfiability},
117
+ J. Comput. System Sci. \textbf{53} (1996), no.~3, 469--486.
118
+ \href{https://doi.org/10.1006/jcss.1996.0081}{doi:10.1006/jcss.1996.0081}.
119
+
120
+ \bibitem{GT}
121
+ F.~Guerra and F.~L.~Toninelli,
122
+ \emph{The thermodynamic limit in mean field spin glass models},
123
+ Comm. Math. Phys. \textbf{230} (2002), no.~1, 71--79.
124
+ \href{https://doi.org/10.1007/s00220-002-0699-y}
125
+ {doi:10.1007/s00220-002-0699-y};
126
+ \href{https://arxiv.org/abs/cond-mat/0204280v1}{arXiv:cond-mat/0204280v1}.
127
+
128
+ \bibitem{Hall}
129
+ P.~Hall,
130
+ \emph{On representatives of subsets},
131
+ J. London Math. Soc. \textbf{10} (1935), no.~1, 26--30.
132
+ \href{https://doi.org/10.1112/jlms/s1-10.37.26}{doi:10.1112/jlms/s1-10.37.26}.
133
+
134
+ \bibitem{MMZ}
135
+ S.~Mertens, M.~M\'ezard, and R.~Zecchina,
136
+ \emph{Threshold values of random \(K\)-SAT from the cavity method},
137
+ Random Structures Algorithms \textbf{28} (2006), no.~3, 340--373.
138
+ \href{https://doi.org/10.1002/rsa.20090}{doi:10.1002/rsa.20090};
139
+ \href{https://arxiv.org/abs/cs/0309020v2}{arXiv:cs/0309020v2}.
140
+
141
+ \bibitem{MPZ}
142
+ M.~M\'ezard, G.~Parisi, and R.~Zecchina,
143
+ \emph{Analytic and algorithmic solution of random satisfiability problems},
144
+ Science \textbf{297} (2002), no.~5582, 812--815.
145
+ \href{https://doi.org/10.1126/science.1073287}
146
+ {doi:10.1126/science.1073287}.
147
+
148
+ \bibitem{Steele}
149
+ J.~M.~Steele,
150
+ \emph{An Efron--Stein inequality for nonsymmetric statistics},
151
+ Ann. Statist. \textbf{14} (1986), no.~2, 753--758.
152
+ \href{https://doi.org/10.1214/aos/1176349952}{doi:10.1214/aos/1176349952}.
153
+
154
+ \end{thebibliography}
155
+ \endgroup
preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/sections/anchors.tex ADDED
@@ -0,0 +1,71 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{Positive and finite center bounds}\label{sec:anchors}
2
+
3
+ Before comparing different sizes, we place the centers in a fixed
4
+ positive interval below the cap. At high density, an assignment first
5
+ moment makes satisfiability unlikely. At a sufficiently small positive
6
+ density, a matching from clauses to variables supplies a satisfying
7
+ assignment regardless of the signs.
8
+
9
+ The matching criterion is Hall's theorem~\cite{Hall}. Its application
10
+ to satisfiability and the associated deficiency counting appear in
11
+ Franco and Van Gelder~\cite[Section~8]{FV}. We include the
12
+ alternating-path argument and the probability estimate.
13
+
14
+ \begin{lemma}[Bounds on the centers]\label{lem:center-bounds}
15
+ For each fixed \(k\ge3\), there is \(a_0>0\) such that, for all
16
+ sufficiently large \(n\),
17
+ \[
18
+ a_0\le\mu_n\le2^k+1.
19
+ \]
20
+ \end{lemma}
21
+
22
+ \begin{proof}
23
+ For any fixed assignment, each proper uniformly signed \(k\)-clause
24
+ is satisfied with probability \(1-2^{-k}\). The clauses are independent,
25
+ so at \(m=2^kn\) the expected number of satisfying assignments is
26
+ \[
27
+ 2^n(1-2^{-k})^{2^kn}\le(2/e)^n=o(1).
28
+ \]
29
+ Consequently \(P_n(2^kn)=o(1)\). Since \(V_n\le L_kn\),
30
+ \[
31
+ \mu_n\le2^k+(L_k-2^k)P_n(2^kn)=2^k+o(1).
32
+ \]
33
+
34
+ For the lower bound, fix \(c_0>0\) with \(e^2c_0<1\) and put
35
+ \(m=\lfloor c_0n\rfloor<n\). A matching assigning each clause position
36
+ a distinct variable occurring in that clause guarantees satisfiability:
37
+ give each matched variable the value that satisfies its literal in the
38
+ matched clause. These choices are compatible because the matched
39
+ variables are distinct.
40
+
41
+ If no such matching exists, some \(t\) clause positions use fewer than
42
+ \(t\) variables. To see this directly, take a maximum matching and
43
+ start an alternating-path search from an unmatched clause. Every
44
+ reached variable must be matched, or an augmenting path would exist.
45
+ Its matched clause is then reached as well. The starting unmatched
46
+ clause gives more reached clauses than reached variables, which is
47
+ the asserted obstruction.
48
+
49
+ Enlarge a deficient variable set to a set of exactly \(t\) variables.
50
+ A union bound gives
51
+ \begin{align*}
52
+ \PP(\text{no matching})
53
+ &\le\sum_{t=1}^{m}\binom mt\binom nt(t/n)^{kt}\\
54
+ &\le\sum_{t=1}^{m}(e^2c_0\,t/n)^t=o(1).
55
+ \end{align*}
56
+ Indeed, the probability that a proper clause lies in a specified
57
+ \(t\)-set is \(\fall tk/\fall nk\le(t/n)^k\), and it is zero for
58
+ \(t<k\). Bounding the two binomial coefficients by \( (em/t)^t\) and
59
+ \((en/t)^t\) first gives \([e^2c_0(t/n)^{k-2}]^t\).
60
+ Since \(k\ge3\) and \(t<n\), this is at most the displayed summand.
61
+ For the last limit, every fixed summand tends to zero, whereas the tail
62
+ is bounded by the tail of the convergent geometric series
63
+ \(\sum_{t\ge1}(e^2c_0)^t\).
64
+
65
+ Thus \(P_n(m)=1-o(1)\). Because \(m\le M_n\), the survival identity
66
+ \eqref{eq:survival} gives
67
+ \[
68
+ \mu_n\ge\frac mn P_n(m)=c_0-o(1).
69
+ \]
70
+ An eventual lower bound \(a_0>0\) and the asserted upper bound follow.
71
+ \end{proof}
preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/sections/boundaries.tex ADDED
@@ -0,0 +1,46 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{Lower arities and finite-size information}\label{sec:boundaries}
2
+
3
+ The balanced comparison gives a one-sided quantitative bound on the
4
+ finite-size centers. In \eqref{eq:balanced-comparison-bound}, take
5
+ \(u_n=\mu_n\), \(A=4\), and \(\beta=\delta_k\), then let the larger
6
+ size tend to infinity. For every sufficiently large integer \(s\),
7
+ \begin{equation}\label{eq:one-sided-center-rate}
8
+ \mu_s\le\alpha_k+C_k s^{-\delta_k},\qquad
9
+ C_k=4\left(1+\frac{(3/2)^{\delta_k}}
10
+ {1-(2/3)^{\delta_k}}\right).
11
+ \end{equation}
12
+ Thus the center cannot exceed its limit by more than the stated error.
13
+ The proof gives no corresponding bound on \(\alpha_k-\mu_s\), and
14
+ hence no effective two-sided rate for approximating \(\alpha_k\).
15
+ Proposition~\ref{prop:concentration} controls fluctuations about
16
+ \(\EE V_n\); it does not place a two-sided window of width
17
+ \(n^{1-\delta_k}\) around \(\alpha_kn\). All constants concern a fixed
18
+ \(k\), and are not uniform when \(k\) grows with \(n\).
19
+
20
+ \begin{remark}[The two-clause boundary]\label{rem:two}
21
+ Chv\'atal and Reed~\cite[Theorems~3--4]{CR} proved that independent
22
+ uniform clauses on two distinct variables, sampled with replacement,
23
+ are satisfiable with probability tending to one below density \(1\)
24
+ and unsatisfiable with probability tending to one above density \(1\).
25
+ Goerdt~\cite{Goerdt} obtained the threshold independently.
26
+ Thus \(\alpha_2=1\) in the same proper-clause convention. This is a
27
+ separate theorem: the bound \(O_k(n^{1+2/k})\) is only \(O(n^2)\) at
28
+ \(k=2\) and gives no sublinear concentration window there.
29
+ \end{remark}
30
+
31
+ \begin{remark}[The unit-clause boundary]\label{rem:unit}
32
+ For \(k=1\), the threshold on the linear-density scale is zero.
33
+ Fix \(c>0\), choose \(0<c'<c\), and Poissonize the number of independent
34
+ uniform unit clauses at mean \(c'n\). For each variable, the positive
35
+ and negative occurrence counts are independent \(\Pois(c'/2)\)
36
+ variables, independently across variables. The formula is satisfiable
37
+ exactly when no variable receives both signs, an event of probability
38
+ \[
39
+ \bigl(2e^{-c'/2}-e^{-c'}\bigr)^n\longrightarrow0.
40
+ \]
41
+ The Poisson clause count is at most \(\lfloor cn\rfloor\) with
42
+ probability tending to one. Monotonicity in the clause count therefore
43
+ implies that the fixed-count unit-clause formula is unsatisfiable with
44
+ probability tending to one at every \(c>0\). At density zero it is
45
+ empty and satisfiable.
46
+ \end{remark}
preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/sections/concentration.tex ADDED
@@ -0,0 +1,178 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{Clause omission and polynomial concentration}\label{sec:concentration}
2
+
3
+ We now turn the integrated forcing estimate into a bound on the
4
+ fluctuations of the last satisfiable prefix. Omitting one clause can
5
+ delay the loss of satisfiability. The delay counts the prefixes where
6
+ that clause is pivotal, and its square counts pairs of pivotal times.
7
+ The key observation is that a future punctured prefix can survive only
8
+ if every intervening clause avoids killing the present solution set.
9
+
10
+ \subsection{Omitting a clause without changing time indices}
11
+
12
+ Fix an integer \(M\ge1\) and the independent clauses \(C_1,\ldots,C_M\).
13
+ For the next two lemmas, let
14
+ \[
15
+ V=\max\{0\le m\le M:F_{n,m}\in\sat\}
16
+ \]
17
+ be the last satisfiable index capped at \(M\). For \(1\le i\le M\), set
18
+ \[
19
+ V^{-i}=\max\left\{0\le m\le M:
20
+ \bigwedge_{\substack{1\le j\le m\\j\ne i}}C_j\in\sat\right\}.
21
+ \]
22
+ The time index \(i\) is skipped; the remaining positions are not
23
+ renumbered. Thus \(V^{-i}\ge V\), and \(V^{-i}\) is independent of
24
+ \(C_i\).
25
+
26
+ The following coordinate-omission inequality belongs to the martingale
27
+ variance method associated with Efron and Stein~\cite{EfronStein} and
28
+ Steele's treatment of nonsymmetric statistics~\cite{Steele}.
29
+ Boucheron, Bousquet, Lugosi, and Massart
30
+ \cite[Section~3.2, equation~(3.6)]{BBLM} state the arbitrary-omission
31
+ form. The short proof fixes the deletion convention and constant.
32
+
33
+ \begin{lemma}[Deletion variance bound]\label{lem:variance-deletion}
34
+ For the capped indices just defined,
35
+ \[
36
+ \Var(V)\le\sum_{i=1}^{M}\EE(V^{-i}-V)^2.
37
+ \]
38
+ \end{lemma}
39
+
40
+ \begin{proof}
41
+ Let \(\F_i=\sigma(C_1,\ldots,C_i)\), with \(\F_0\) trivial, and put
42
+ \[
43
+ D_i=\EE[V\mid\F_i]-\EE[V\mid\F_{i-1}].
44
+ \]
45
+ Independence of the clauses and the fact that \(V^{-i}\) does not use
46
+ \(C_i\) give
47
+ \[
48
+ \EE[V^{-i}\mid\F_i]=\EE[V^{-i}\mid\F_{i-1}].
49
+ \]
50
+ For \(Z_i=V-V^{-i}\), it follows that
51
+ \[
52
+ D_i=\EE[Z_i\mid\F_i]-\EE[Z_i\mid\F_{i-1}].
53
+ \]
54
+ The tower property and conditional Jensen inequality yield
55
+ \[
56
+ \EE D_i^2
57
+ =\EE\bigl(\EE[Z_i\mid\F_i]\bigr)^2
58
+ -\EE\bigl(\EE[Z_i\mid\F_{i-1}]\bigr)^2
59
+ \le\EE Z_i^2.
60
+ \]
61
+ The martingale differences are orthogonal and sum to \(V-\EE V\).
62
+ Summing the displayed inequalities proves the lemma.
63
+ \end{proof}
64
+
65
+ \subsection{Pairs of pivotal times}
66
+
67
+ Fix \(i\). For \(i\le m\le M\), the punctured prefix and its killing
68
+ probability are
69
+ \[
70
+ G_m=\bigwedge_{\substack{1\le j\le m\\j\ne i}}C_j,\qquad
71
+ q_m=q_k(G_m).
72
+ \]
73
+ The function \(q_k\) was defined in \eqref{eq:kill}; in particular,
74
+ \(q_m=0\) when \(G_m\) is unsatisfiable.
75
+
76
+ \begin{lemma}[Pivotal pairs]\label{lem:pivotal}
77
+ For every \(1\le i\le M\),
78
+ \begin{equation}\label{eq:pivotal}
79
+ \EE(V^{-i}-V)^2
80
+ \le2\sum_{m=i}^{M}\EE\min\{Mq_m,1\}.
81
+ \end{equation}
82
+ \end{lemma}
83
+
84
+ \begin{proof}
85
+ Let
86
+ \[
87
+ A_m=\{G_m\in\sat,\ G_m\wedge C_i\notin\sat\}.
88
+ \]
89
+ This event is exactly \(\{V<m\le V^{-i}\}\): prefix \(m\) is
90
+ satisfiable after omission and unsatisfiable before it. Hence, including
91
+ the endpoint \(m=M\),
92
+ \[
93
+ V^{-i}-V=\sum_{m=i}^{M}\ind_{A_m}.
94
+ \]
95
+ For \(\ell\ge m\), on \(A_m\) the original prefix remains
96
+ unsatisfiable, so
97
+ \[
98
+ A_m\cap A_\ell=A_m\cap\{G_\ell\in\sat\}.
99
+ \]
100
+
101
+ Condition on
102
+ \(\F_m^{(-i)}=\sigma(C_j:1\le j\le m,\ j\ne i)\).
103
+ The clause \(C_i\) and the future clauses
104
+ \(C_{m+1},\ldots,C_\ell\) are conditionally independent. The
105
+ conditional probability of \(A_m\) is \(q_m\). If \(G_m\) is
106
+ satisfiable, then \(G_\ell\) can be satisfiable only if none of these
107
+ future clauses individually makes \(G_m\) unsatisfiable. Each does so
108
+ with probability \(q_m\), independently. Thus
109
+ \begin{equation}\label{eq:pivotal-pair}
110
+ \PP(A_m\cap A_\ell\mid\F_m^{(-i)})
111
+ =q_m\PP(G_\ell\in\sat\mid\F_m^{(-i)})
112
+ \le q_m(1-q_m)^{\ell-m}.
113
+ \end{equation}
114
+ If \(G_m\) is unsatisfiable, the relevant event and the right side are
115
+ both zero.
116
+
117
+ Expand the square of the indicator sum and bound its double sum by
118
+ twice the sum over \(m\le\ell\). For \(q>0\),
119
+ \[
120
+ \sum_{\ell=m}^{M}(1-q)^{\ell-m}\le\min\{M,1/q\},
121
+ \]
122
+ because \(m\ge1\). Multiplication by \(q\), followed by expectation
123
+ and summation over \(m\), gives \eqref{eq:pivotal}. When \(q=0\), every
124
+ term in the corresponding product is zero, so no division by zero is
125
+ needed.
126
+ \end{proof}
127
+
128
+ \subsection{The variance bound}
129
+
130
+ The pivotal-pair estimate has reduced the squared omission delay to a
131
+ truncated killing probability. Taking a \(k\)-th root converts that
132
+ quantity into the forced fraction controlled by
133
+ Proposition~\ref{prop:forcing}.
134
+
135
+ \begin{proposition}[Polynomial concentration]\label{prop:concentration}
136
+ For every fixed integer \(k\ge3\), the statistic
137
+ \(V_n=\min(H_n-1,L_kn)\) from \eqref{eq:statistic} satisfies
138
+ \begin{equation}\label{eq:variance}
139
+ \Var(V_n)=O_k(n^{1+2/k}).
140
+ \end{equation}
141
+ In particular, with \(\mu_n=\EE V_n/n\),
142
+ \begin{equation}\label{eq:concentration}
143
+ \PP\bigl(|V_n-n\mu_n|\ge n^{1-\delta_k}\bigr)
144
+ =O_k(n^{-\eta_k}),\qquad
145
+ \delta_k=\frac{k-2}{4k},\quad \eta_k=\frac{k-2}{2k}.
146
+ \end{equation}
147
+ \end{proposition}
148
+
149
+ \begin{proof}
150
+ Set \(M=L_kn\), \(V=V_n\), and fix \(i\). With the notation of
151
+ Lemma~\ref{lem:pivotal}, let \(\rho_m=b(G_m)/n\).
152
+ The falling-factorial ratios in \eqref{eq:kill} give
153
+ \(q_m\le\rho_m^k\). Since \(\min\{z,1\}\le z^{1/k}\) for \(z\ge0\),
154
+ \[
155
+ \min\{Mq_m,1\}\le(Mq_m)^{1/k}\le M^{1/k}\rho_m.
156
+ \]
157
+ Unconditionally, \(G_m\) has the law of \(F_{n,m-1}\).
158
+ Lemma~\ref{lem:pivotal} and Proposition~\ref{prop:forcing} therefore
159
+ give, uniformly in \(1\le i\le M\),
160
+ \[
161
+ \EE(V^{-i}-V)^2
162
+ \le2M^{1/k}\sum_{m=i}^{M}\EE\rho_m
163
+ \le2M^{1/k}\sum_{j=0}^{M-1}\EE\frac{b(F_{n,j})}{n}
164
+ =O_k(n^{2/k}).
165
+ \]
166
+ Summing over \(M=L_kn\) indices in
167
+ Lemma~\ref{lem:variance-deletion} proves \eqref{eq:variance}.
168
+ Chebyshev's inequality proves \eqref{eq:concentration}, because
169
+ \[
170
+ 1+\frac2k-2(1-\delta_k)
171
+ =-\left(1-\frac2k-2\delta_k\right)=-\eta_k.
172
+ \]
173
+ \end{proof}
174
+
175
+ The exponent \(\delta_k\) is positive for \(k\ge3\), so the window
176
+ \(n^{1-\delta_k}\) is sublinear. The estimate is centered at the
177
+ finite-size mean \(n\mu_n\); comparing those means across sizes is a
178
+ separate task.
preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/sections/convergence.tex ADDED
@@ -0,0 +1,442 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{From concentration to a limiting location}\label{sec:convergence}
2
+
3
+ The preceding estimates control fluctuations at one size. We now rule
4
+ out drift of the centers as the number of variables grows. The argument
5
+ has two steps. An auxiliary Poisson formula compares the satisfiability
6
+ probabilities at a combined size and at two smaller sizes. Concentration
7
+ turns this probability comparison into inequalities between centers, whose
8
+ errors can then be summed along a balanced tree.
9
+
10
+ Recall that \(H_n=\inf\{m\ge1:F_{n,m}\notin\sat\}\) is the first
11
+ unsatisfiable index in the proper-clause process. To state the comparison
12
+ argument independently of the cap used above, fix \(\lambda>0\) and define
13
+ \begin{equation}\label{eq:general-capped-center}
14
+ \begin{gathered}
15
+ M_n^{(\lambda)}=\lfloor\lambda n\rfloor,\qquad
16
+ V_n^{(\lambda)}=\min\{H_n-1,M_n^{(\lambda)}\},\\
17
+ x_n^{(\lambda)}=\frac{\EE V_n^{(\lambda)}}{n}.
18
+ \end{gathered}
19
+ \end{equation}
20
+ Thus, for every integer \(0\le m\le M_n^{(\lambda)}\),
21
+ \begin{equation}\label{eq:general-cap-survival}
22
+ P_n(m)=\PP\bigl(V_n^{(\lambda)}\ge m\bigr).
23
+ \end{equation}
24
+ This identity includes \(m=M_n^{(\lambda)}\). The superscript keeps
25
+ these statistics distinct from the particular \(V_n\) and \(\mu_n\)
26
+ used in the preceding sections.
27
+
28
+ \Needspace{24\baselineskip}
29
+ \begin{samepage}
30
+ \begin{theorem}[Concentration implies convergence]
31
+ \label{thm:concentration-to-convergence}
32
+ Fix an integer \(k\ge3\) and \(\lambda>0\). Suppose that the proper
33
+ independent uniformly signed \(k\)-clause process has constants
34
+ \[
35
+ 0<a\le b<\lambda,\qquad 0<\delta<\frac12,\qquad
36
+ \eta>0,\qquad 0\le K<\infty
37
+ \]
38
+ such that, for all sufficiently large \(n\),
39
+ \begin{equation}\label{eq:convergence-input}
40
+ \begin{gathered}
41
+ a\le x_n^{(\lambda)}\le b,\\
42
+ \PP\left(\left|V_n^{(\lambda)}-nx_n^{(\lambda)}\right|
43
+ \ge n^{1-\delta}\right)\le K n^{-\eta}.
44
+ \end{gathered}
45
+ \end{equation}
46
+ Then \(x_n^{(\lambda)}\) converges to some \(\alpha\in[a,b]\), and
47
+ \[
48
+ \lim_{n\to\infty}P_n(\lfloor cn\rfloor)=
49
+ \begin{cases}
50
+ 1,&0\le c<\alpha,\\
51
+ 0,&c>\alpha.
52
+ \end{cases}
53
+ \]
54
+ Moreover, for all sufficiently large \(r,s\),
55
+ \begin{align}
56
+ x_{r+s}^{(\lambda)}
57
+ &\ge\min\{x_r^{(\lambda)},x_s^{(\lambda)}\}
58
+ -4\min\{r,s\}^{-\delta},\label{eq:convergence-sum}\\
59
+ x_{s+1}^{(\lambda)}
60
+ &\ge x_s^{(\lambda)}-4s^{-\delta}.
61
+ \label{eq:convergence-neighbor}
62
+ \end{align}
63
+ The first comparison holds without a restriction on \(r/s\).
64
+ \end{theorem}
65
+ \end{samepage}
66
+
67
+ The input is a tail estimate about a finite-size mean. The conclusion
68
+ gives convergence of that mean, while the quantitative comparison is
69
+ one-sided. We begin with the probability inequality that supplies it.
70
+
71
+ \subsection{An auxiliary product inequality}
72
+
73
+ For every positive integer \(n\) and \(c\ge0\), let \(s_n(c)\) be the
74
+ satisfiability probability of the following auxiliary formula. Its number
75
+ of clauses is \(\Pois(cn)\). Within each clause, the \(k\) variable indices
76
+ are chosen independently and uniformly from \(\{1,\ldots,n\}\), and their
77
+ signs are independent and fair. The clauses are independent. The
78
+ resulting literals are disjoined in the usual Boolean sense, so repeated
79
+ variables and tautologies are allowed. This definition applies at every
80
+ positive size, including \(n=1\).
81
+
82
+ The following calculation is a Poisson form of the frozen-variable
83
+ interpolation of Bayati, Gamarnik, and Tetali
84
+ \cite[Section~4, Proposition~2]{BGT}. Independence of the endpoint
85
+ Poisson families gives the product that we need.
86
+
87
+ \begin{lemma}[Auxiliary product inequality]\label{lem:auxiliary-product}
88
+ For every pair of positive integers \(r,s\) and every \(c\ge0\),
89
+ \begin{equation}\label{eq:auxiliary-product}
90
+ s_{r+s}(c)\ge s_r(c)s_s(c).
91
+ \end{equation}
92
+ \end{lemma}
93
+
94
+ \begin{proof}
95
+ Let \(N=r+s\), and partition the variables into parts of sizes
96
+ \(n_1=r\) and \(n_2=s\). For \(0\le t\le c\), take three independent
97
+ Poisson families: a mean \(Nt\) family of auxiliary clauses on all
98
+ \(N\) variables and, for \(i=1,2\), a mean \(n_i(c-t)\) family of
99
+ auxiliary clauses confined to part \(i\). Write \(G_t\) for their
100
+ conjunction and \(f(t)=\PP(G_t\in\sat)\).
101
+
102
+ We use the elementary add-one formula for a marked Poisson family.
103
+ If a bounded observable has conditional expectations \(a_j\) given
104
+ exactly \(j\) independent marks, then its expectation at mean \(v\) is
105
+ \(\sum_{j\ge0}e^{-v}v^ja_j/j!\), whose derivative is
106
+ \(\sum_{j\ge0}e^{-v}v^j(a_{j+1}-a_j)/j!\). Both series converge
107
+ uniformly on compact intervals of \(v\), so the formula also applies
108
+ after conditioning on the other two Poisson families.
109
+
110
+ For a satisfiable background \(G_t\), let \(b_i\) be the number of
111
+ variables in part \(i\) that are forced by the entire background: every
112
+ satisfying assignment gives each such variable the same value. Set
113
+ \(b_i=0\) on unsatisfiable backgrounds. For a satisfiable background,
114
+ a new auxiliary clause destroys satisfiability exactly when each of its literals
115
+ is false in every satisfying assignment. Each literal must therefore
116
+ oppose the value of a forced variable. Conversely, that condition makes
117
+ the whole new clause false in every solution. The independent signed
118
+ draws give killing probabilities
119
+ \[
120
+ \left(\frac{b_1+b_2}{2N}\right)^k
121
+ \quad\text{and}\quad
122
+ \left(\frac{b_i}{2n_i}\right)^k
123
+ \]
124
+ for a global clause and a clause confined to part \(i\), respectively.
125
+ This remains exact when an index is repeated: each independent signed
126
+ draw must still be one of the literals false in every solution.
127
+
128
+ An unsatisfiable background remains unsatisfiable after any clause is
129
+ added. The add-one formula, applied to the three means, therefore gives
130
+ for \(0<t<c\)
131
+ \begin{align*}
132
+ f'(t)
133
+ &=N\EE\left[\ind_{\{G_t\in\sat\}}
134
+ \left\{\sum_{i=1}^{2}\frac{n_i}{N}
135
+ \left(\frac{b_i}{2n_i}\right)^k
136
+ -\left(\frac{b_1+b_2}{2N}\right)^k\right\}\right]\\
137
+ &\ge0.
138
+ \end{align*}
139
+ The last inequality is convexity of \(z\mapsto z^k\) on
140
+ \([0,\infty)\), since \((b_1+b_2)/(2N)\) is the weighted average of
141
+ \(b_i/(2n_i)\) with weights \(n_i/N\). At \(t=0\) the two restricted
142
+ formulas are independent, so \(f(0)=s_r(c)s_s(c)\); at \(t=c\), only
143
+ the global formula remains, so \(f(c)=s_N(c)\). Continuity at the
144
+ endpoints proves the assertion for \(c>0\), and \(c=0\) is immediate.
145
+ \end{proof}
146
+
147
+ \subsection{Transfer to proper clauses}
148
+
149
+ For the rest of the proof of
150
+ Theorem~\ref{thm:concentration-to-convergence}, assume its hypotheses
151
+ and keep \(k,\lambda,a,b,\delta,\eta,K\) fixed. Choose any density
152
+ ceiling \(D>b\). The elementary sandwich below does not use the
153
+ concentration hypothesis; its tail consequences also use
154
+ \eqref{eq:convergence-input}. The ceiling is independent of the cap
155
+ parameter \(\lambda\): the cap locates the survival events in
156
+ \eqref{eq:general-cap-survival}, whereas \(D\) bounds the expected number
157
+ of clauses with internal repetitions in the auxiliary formula. Put
158
+ \begin{equation}\label{eq:transfer-parameters}
159
+ R=D\binom{k}{2},\qquad
160
+ \gamma=\min\{\eta,1-2\delta\}>0,\qquad
161
+ \kappa=\frac{e^{-R}}2.
162
+ \end{equation}
163
+
164
+ \begin{samepage}
165
+ \begin{lemma}[Proper-clause transfer]\label{lem:proper-transfer}
166
+ For \(n\ge k\) set \(\theta_n=(n)_k/n^k\), where
167
+ \((n)_k=n(n-1)\cdots(n-k+1)\). If \(0\le c\le D\) and
168
+ \(J\sim\Pois(cn\theta_n)\), then
169
+ \begin{equation}\label{eq:proper-sandwich}
170
+ \begin{gathered}
171
+ e^{-R}\EE P_n(J)\le s_n(c)\le\EE P_n(J),\\
172
+ cn-R\le\EE J\le cn,\qquad \Var(J)\le Dn.
173
+ \end{gathered}
174
+ \end{equation}
175
+ If \eqref{eq:convergence-input} holds, then there are constants
176
+ \(0\le K'<\infty\) and an integer \(n_1\ge k\) such that for every \(n\ge n_1\) and
177
+ every \(c\in[0,D]\),
178
+ \begin{align}
179
+ c\le x_n^{(\lambda)}-2n^{-\delta}
180
+ &\quad\Longrightarrow\quad s_n(c)\ge\kappa,
181
+ \label{eq:proper-transfer-low}\\
182
+ c\ge x_n^{(\lambda)}+2n^{-\delta}
183
+ &\quad\Longrightarrow\quad s_n(c)\le K'n^{-\gamma}.
184
+ \label{eq:proper-transfer-high}
185
+ \end{align}
186
+ The constants \(K'\) and \(n_1\) may depend on the fixed parameters,
187
+ but not on \(c\) or \(n\).
188
+ \end{lemma}
189
+ \end{samepage}
190
+
191
+ \begin{proof}
192
+ An auxiliary clause has distinct indices with probability \(\theta_n\).
193
+ Poisson thinning separates the clauses into a family of \(J\) clauses
194
+ with distinct indices and a family of \(Q\) clauses with an internal
195
+ repetition, where
196
+ \[
197
+ J\sim\Pois(cn\theta_n),\qquad Q\sim\Pois(cn(1-\theta_n)).
198
+ \]
199
+ These counts are independent. Indeed, their joint probability-generating
200
+ function is
201
+ \[
202
+ \EE[z^Jw^Q]
203
+ =\exp\bigl(cn[\theta_n z+(1-\theta_n)w-1]\bigr)
204
+ =e^{cn\theta_n(z-1)}e^{cn(1-\theta_n)(w-1)}.
205
+ \]
206
+ The same independent-mark construction shows that, conditional on these
207
+ counts, the marks in the two families are independent with their
208
+ respective conditional laws. In the first family, every unordered set
209
+ of \(k\) distinct variables has \(k!\) equally likely orders and the
210
+ signs remain independent and fair. Conditional on \(J\), this family
211
+ therefore has exactly the law \(F_{n,J}\).
212
+
213
+ A union bound over the \(\binom{k}{2}\) pairs of variable positions gives
214
+ \[
215
+ cn(1-\theta_n)\le c\binom{k}{2}\le R.
216
+ \]
217
+ Consequently \(cn-R\le\EE J\le cn\) and \(\Var(J)=\EE J\le Dn\).
218
+ Deleting the repeated-variable clauses can only help satisfiability.
219
+ Requiring \(Q=0\), which is independent of the proper family and has
220
+ probability \(e^{-cn(1-\theta_n)}\ge e^{-R}\), gives the lower bound.
221
+ This proves \eqref{eq:proper-sandwich}.
222
+
223
+ Write \(h=n^{1-\delta}\). The concentration input and the survival
224
+ identity give, for all sufficiently large \(n\) and integer \(j\),
225
+ \begin{align*}
226
+ P_n(j)&\ge1-Kn^{-\eta}
227
+ &&\text{if }0\le j\le nx_n^{(\lambda)}-h,\\
228
+ P_n(j)&\le Kn^{-\eta}
229
+ &&\text{if }j\ge nx_n^{(\lambda)}+h.
230
+ \end{align*}
231
+ For the first estimate the indicated counts are below the cap because
232
+ \(x_n^{(\lambda)}\le b<\lambda\). For the second, first use
233
+ \eqref{eq:general-cap-survival} up to the cap and then use monotonicity
234
+ beyond it at \(j_0=\lceil nx_n^{(\lambda)}+h\rceil\).
235
+ The inequality \(j_0\le M_n^{(\lambda)}\) holds for all sufficiently
236
+ large \(n\): the gap \((\lambda-b)n\) dominates \(h+2\). This also
237
+ accounts for both integer roundings.
238
+
239
+ If \(c\le x_n^{(\lambda)}-2n^{-\delta}\), then
240
+ \(\EE J\le nx_n^{(\lambda)}-2h\). Chebyshev's inequality yields
241
+ \[
242
+ \PP\bigl(J>nx_n^{(\lambda)}-h\bigr)
243
+ \le\frac{Dn}{h^2}=D n^{-(1-2\delta)}.
244
+ \]
245
+ \begin{samepage}
246
+ The lower bound in \eqref{eq:proper-sandwich} is thus at least
247
+ \[
248
+ e^{-R}\bigl(1-Kn^{-\eta}-D n^{-(1-2\delta)}\bigr),
249
+ \]
250
+ which is at least \(\kappa\) for every sufficiently large \(n\).
251
+ \end{samepage}
252
+
253
+ If \(c\ge x_n^{(\lambda)}+2n^{-\delta}\), then
254
+ \(\EE J\ge nx_n^{(\lambda)}+2h-R\). For large \(n\), \(h>R\), and
255
+ \[
256
+ \PP\bigl(J<nx_n^{(\lambda)}+h\bigr)
257
+ \le\frac{Dn}{(h-R)^2}=O\bigl(n^{-(1-2\delta)}\bigr).
258
+ \]
259
+ The upper bound in \eqref{eq:proper-sandwich} is at most this probability
260
+ plus \(Kn^{-\eta}\), proving \eqref{eq:proper-transfer-high} with
261
+ \(\gamma=\min\{\eta,1-2\delta\}\). All estimates used the common
262
+ bounds \(R\) and \(Dn\), so they are uniform on \([0,D]\).
263
+ \end{proof}
264
+
265
+ \subsection{Comparing centers at different sizes}
266
+
267
+ The lower transfer bound \eqref{eq:proper-transfer-low} stays positive,
268
+ whereas the upper bound \eqref{eq:proper-transfer-high} tends to zero
269
+ uniformly. We use this separation with the product inequality
270
+ \eqref{eq:auxiliary-product} to compare the centers.
271
+
272
+ Let \(u=\min\{r,s\}\), \(N=r+s\), and set
273
+ \[
274
+ c=\min\{x_r^{(\lambda)},x_s^{(\lambda)}\}-2u^{-\delta}.
275
+ \]
276
+ For all sufficiently large \(u\), the center bounds in
277
+ \eqref{eq:convergence-input} put \(c\) in \([0,D]\). Since
278
+ \(u^{-\delta}\ge r^{-\delta},s^{-\delta}\), the lower estimate in
279
+ Lemma~\ref{lem:proper-transfer} applies at both sizes. Hence
280
+ Lemma~\ref{lem:auxiliary-product} gives \(s_N(c)\ge\kappa^2\).
281
+ For all sufficiently large \(N\), the upper estimate in
282
+ Lemma~\ref{lem:proper-transfer} is smaller than \(\kappa^2\); it rules
283
+ out \(c\ge x_N^{(\lambda)}+2N^{-\delta}\). Therefore
284
+ \[
285
+ x_N^{(\lambda)}>c-2N^{-\delta}
286
+ \ge\min\{x_r^{(\lambda)},x_s^{(\lambda)}\}-4u^{-\delta}.
287
+ \]
288
+ This proves \eqref{eq:convergence-sum} for every pair of sufficiently
289
+ large sizes. No ratio between them was used.
290
+
291
+ To reach every sufficiently large size from a fixed block size, we will
292
+ use blocks of sizes \(s\) and \(s+1\). We therefore also need a
293
+ neighboring-size comparison. Take
294
+ \(c=x_s^{(\lambda)}-2s^{-\delta}\), which again lies in \([0,D]\)
295
+ for large \(s\). In the size-one auxiliary model, the empty-formula
296
+ event gives \(s_1(c)\ge e^{-c}\ge e^{-D}\). Consequently
297
+ \[
298
+ s_{s+1}(c)\ge s_s(c)s_1(c)\ge\kappa e^{-D}.
299
+ \]
300
+ For large \(s\), the upper transfer estimate at size \(s+1\) is smaller
301
+ than this fixed positive constant. It follows that
302
+ \[
303
+ x_{s+1}^{(\lambda)}>c-2(s+1)^{-\delta}
304
+ \ge x_s^{(\lambda)}-4s^{-\delta},
305
+ \]
306
+ which proves \eqref{eq:convergence-neighbor}.
307
+
308
+ The tree argument below uses the sum comparison only when its child
309
+ sizes are comparable.
310
+
311
+ \subsection{Summing the errors along a balanced tree}
312
+
313
+ The principle that errors summable over geometrically increasing sizes
314
+ cannot sustain macroscopic drift parallels the approximate-superadditivity
315
+ argument of Abbe and Montanari \cite[arXiv version, Lemma~8]{AM}.
316
+ Here the operation is a minimum of normalized quantities; the following
317
+ lemma proves the required form directly.
318
+
319
+ \begin{samepage}
320
+ \begin{lemma}[Balanced comparisons]\label{lem:balanced-comparison}
321
+ Let \(n_0\ge1\) be an integer and let \((u_n)_{n\ge n_0}\) be a bounded
322
+ real sequence. Suppose that \(0\le A<\infty\), \(\beta>0\), and that,
323
+ for all \(r,s\ge n_0\) with \(1/3\le r/s\le3\),
324
+ \[
325
+ u_{r+s}\ge\min\{u_r,u_s\}-A\min\{r,s\}^{-\beta}.
326
+ \]
327
+ Suppose also that, for every \(s\ge n_0\),
328
+ \[
329
+ u_{s+1}\ge u_s-As^{-\beta}.
330
+ \]
331
+ Then \(u_n\) converges. More precisely, put
332
+ \[
333
+ B_\beta=\frac{(3/2)^\beta}{1-(2/3)^\beta}.
334
+ \]
335
+ For every integer \(s\ge\max\{n_0,2\}\) and every integer \(n\ge s^2\),
336
+ \begin{equation}\label{eq:balanced-comparison-bound}
337
+ u_n\ge u_s-A(1+B_\beta)s^{-\beta}.
338
+ \end{equation}
339
+ \end{lemma}
340
+ \end{samepage}
341
+
342
+ \begin{proof}
343
+ Fix an integer \(s\ge\max\{n_0,2\}\). For \(n\ge s^2\),
344
+ write \(n=qs+t\), where \(q=\lfloor n/s\rfloor\ge s\) and \(0\le t<s\).
345
+ Thus \(n\) is a sum of \(q-t\) blocks of size \(s\) and \(t\) blocks
346
+ of size \(s+1\). Both block counts are nonnegative, and the neighbor
347
+ inequality puts the value of every block at least
348
+ \(u_s-As^{-\beta}\).
349
+
350
+ Arrange these \(q\) blocks in a binary tree by dividing each group of
351
+ \(a\ge2\) blocks into groups of \(\lfloor a/2\rfloor\) and
352
+ \(\lceil a/2\rceil\) blocks. Each child contains at least \(a/3\)
353
+ blocks, so its total size is at least \(sa/3\). Moreover, the ratio of
354
+ the larger child's total size to the smaller child's is at most
355
+ \[
356
+ \frac{\lceil a/2\rceil(s+1)}{\lfloor a/2\rfloor s}
357
+ \le2(1+1/s)\le3.
358
+ \]
359
+ The sum inequality is therefore valid at every internal node, with
360
+ error at most \(A(sa/3)^{-\beta}\).
361
+
362
+ Iterating the minimum inequality from the leaves to the root gives a
363
+ lower bound by the least leaf value minus the largest sum of errors on
364
+ a leaf-to-root path. If \(a_1,a_2,\ldots\) are the block counts at the
365
+ successive internal nodes of such a path, then \(a_1\ge2\) and
366
+ \(a_{j+1}\ge(3/2)a_j\), because a child contains at most two thirds of
367
+ its parent's blocks. Every path error is consequently at most
368
+ \[
369
+ As^{-\beta}(3/2)^\beta
370
+ \sum_{j=0}^{\infty}(2/3)^{j\beta}
371
+ =AB_\beta s^{-\beta}.
372
+ \]
373
+ This proves \eqref{eq:balanced-comparison-bound}. First let
374
+ \(n\to\infty\) with \(s\) fixed to obtain
375
+ \[
376
+ \liminf_{n\to\infty}u_n
377
+ \ge u_s-A(1+B_\beta)s^{-\beta}.
378
+ \]
379
+ Taking the limsup as \(s\to\infty\) gives
380
+ \(\liminf_n u_n\ge\limsup_n u_n\). Boundedness makes both quantities
381
+ finite, and hence \(u_n\) converges.
382
+ \end{proof}
383
+
384
+ \begin{proof}[Completion of Theorem~\ref{thm:concentration-to-convergence}]
385
+ Apply Lemma~\ref{lem:balanced-comparison} to
386
+ \eqref{eq:convergence-sum}--\eqref{eq:convergence-neighbor}, with
387
+ \(A=4\) and \(\beta=\delta\). It gives convergence, and the center
388
+ bounds place the limit \(\alpha\) in \([a,b]\).
389
+
390
+ Fix \(0\le c<\alpha\). Since \(x_n^{(\lambda)}\to\alpha\) and
391
+ \(n^{-\delta}\to0\), for all sufficiently large \(n\),
392
+ \(\lfloor cn\rfloor\le nx_n^{(\lambda)}-n^{1-\delta}\). This count
393
+ lies below the cap, and \eqref{eq:convergence-input} together with
394
+ \eqref{eq:general-cap-survival} gives
395
+ \(P_n(\lfloor cn\rfloor)\ge1-Kn^{-\eta}\to1\).
396
+
397
+ Now fix \(c>\alpha\), and choose a real \(d\) with
398
+ \(\alpha<d<\min\{c,\lambda\}\), which is possible because
399
+ \(\alpha\le b<\lambda\). For large \(n\), the integer
400
+ \(\lfloor dn\rfloor\) lies below the cap and is at least
401
+ \(nx_n^{(\lambda)}+n^{1-\delta}\). The same two estimates give
402
+ \(P_n(\lfloor dn\rfloor)\le Kn^{-\eta}\to0\).
403
+ Monotonicity then yields
404
+ \(P_n(\lfloor cn\rfloor)\le P_n(\lfloor dn\rfloor)\to0\).
405
+ \end{proof}
406
+
407
+ \subsection{Application to every fixed clause size}
408
+
409
+ We finish by checking the inputs for the statistic used in this paper.
410
+ This also identifies the repetition constant furnished by the general
411
+ transfer lemma.
412
+
413
+ \begin{proof}[Proof of Theorem~\ref{thm:main}]
414
+ Fix \(k\ge3\). Recall \(L_k=2^{k+1}\),
415
+ \(V_n=\min\{H_n-1,L_kn\}\), and \(\mu_n=\EE V_n/n\).
416
+ Since \(L_k\) is an integer, the definitions in
417
+ \eqref{eq:general-capped-center} with \(\lambda=L_k\) give exactly
418
+ \(V_n^{(L_k)}=V_n\) and \(x_n^{(L_k)}=\mu_n\).
419
+
420
+ Proposition~\ref{prop:concentration} supplies the tail estimate in
421
+ \eqref{eq:convergence-input} with
422
+ \[
423
+ \delta=\delta_k=\frac{k-2}{4k},\qquad
424
+ \eta=\eta_k=\frac{k-2}{2k},
425
+ \]
426
+ and some \(K=K_k<\infty\). These exponents satisfy
427
+ \(0<\delta<1/2\) and \(\eta>0\). Lemma~\ref{lem:center-bounds}
428
+ supplies the center bounds with
429
+ \(a=a_0\) and \(b=2^k+1<L_k\).
430
+
431
+ For the transfer in this application choose \(D=L_k>b\). Then
432
+ \[
433
+ R=L_k\binom{k}{2},\qquad
434
+ 1-2\delta=\frac{k+2}{2k}>\eta,
435
+ \qquad \gamma=\eta,\qquad \kappa=\frac{e^{-R}}2.
436
+ \]
437
+ Thus all hypotheses of Theorem~\ref{thm:concentration-to-convergence}
438
+ hold with the stated cap, center bounds, and exponents. It follows that
439
+ \(\mu_n\to\alpha_k\in[a_0,2^k+1]\) and that the proper-clause
440
+ satisfiability probabilities tend to one for \(0\le c<\alpha_k\)
441
+ and to zero for \(c>\alpha_k\), as claimed.
442
+ \end{proof}
preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/sections/forcing.tex ADDED
@@ -0,0 +1,213 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{Replacement and integrated forcing}\label{sec:forcing}
2
+
3
+ We begin the local concentration proof by controlling how many
4
+ variables are forced along the clause process. The estimate is
5
+ integrated over prefix lengths: erasing one variable turns forcing into
6
+ a difference of satisfiability probabilities, and those differences
7
+ can be summed by telescoping.
8
+
9
+ \begin{samepage}
10
+ For the fixed \(k\ge3\), write
11
+ \[
12
+ H_n=\inf\{m\ge1:F_{n,m}\notin\sat\}.
13
+ \]
14
+ The value \(+\infty\) is allowed in this definition, although
15
+ \(P_n(m)\le2^n(1-2^{-k})^m\) implies that \(H_n\) is finite almost
16
+ surely. Put
17
+ \begin{equation}\label{eq:statistic}
18
+ L_k=2^{k+1},\qquad M_n=L_kn,\qquad
19
+ V_n=\min\{H_n-1,M_n\},\qquad \mu_n=\frac{\EE V_n}{n}.
20
+ \end{equation}
21
+ Thus \(V_n\) is the last satisfiable index up to the cap \(M_n\), and
22
+ \begin{equation}\label{eq:survival}
23
+ P_n(m)=\PP(V_n\ge m)\qquad(0\le m\le M_n).
24
+ \end{equation}
25
+ This identity includes \(m=M_n\). Later, when a clause is omitted, the
26
+ same endpoint convention will count every additional satisfiable prefix.
27
+ \end{samepage}
28
+
29
+ \subsection{Killing a solution set with one clause}
30
+
31
+ A variable of a satisfiable formula \(H\) is \emph{forced} if all
32
+ satisfying assignments of \(H\) give it the same value. Let \(b(H)\) be
33
+ the number of forced variables, and set \(b(H)=0\) if \(H\) is
34
+ unsatisfiable. This definition uses all solutions of the entire
35
+ formula, even when the formula contains clauses of different lengths.
36
+
37
+ For a formula \(H\) on \(v\) variables and \(1\le r\le v\), define
38
+ \begin{equation}\label{eq:kill}
39
+ q_r(H)=\frac{\fall{b(H)}r}{2^r\fall vr},
40
+ \qquad
41
+ \fall ur=u(u-1)\cdots(u-r+1),
42
+ \end{equation}
43
+ where \(\fall ur=0\) for nonnegative integers \(u<r\).
44
+ Here a random \(r\)-clause uses \(r\) distinct uniform variables and
45
+ independent fair signs.
46
+
47
+ If \(H\) is satisfiable, \(q_r(H)\) is exactly the probability that
48
+ adding one independent random \(r\)-clause makes it unsatisfiable.
49
+ Indeed, every solution of \(H\) must falsify every literal in such a
50
+ clause. Each chosen variable must therefore be forced, and its sign
51
+ must oppose the forced value. Conversely those conditions make the
52
+ clause false in every solution. For unsatisfiable \(H\), the convention
53
+ \(q_r(H)=0\) records that there is no transition to count.
54
+
55
+ \subsection{Replacing a shorter clause}
56
+
57
+ The next estimate is uniform in the background formula. This
58
+ uniformity will allow successive replacements after conditioning on all
59
+ other clauses.
60
+
61
+ \begin{samepage}
62
+ \begin{lemma}[Replacing a \((k-1)\)-clause]\label{lem:replacement}
63
+ Let \(k\ge3\) and \(n\ge k+1\) be integers, and put
64
+ \[
65
+ v=n-1,\qquad \eps=n^{-(k-1)/k},\qquad
66
+ g=\lceil2kn^{1/k}\rceil.
67
+ \]
68
+ For any formula \(H\) on these \(v\) variables, let \(Q\) be an
69
+ independent random \((k-1)\)-clause and let \(R_1,\ldots,R_g\) be
70
+ independent random \(k\)-clauses, also independent of \(H,Q\). Then
71
+ \[
72
+ \PP(H\wedge R_1\wedge\cdots\wedge R_g\notin\sat)
73
+ \ge \PP(H\wedge Q\notin\sat)-\eps.
74
+ \]
75
+ \end{lemma}
76
+ \end{samepage}
77
+
78
+ The power comparison below is the Boolean forced-variable instance of
79
+ the codimension comparison in Carenini~\cite[Lemma~6.1]{Carenini}. The
80
+ proof records the block size and error needed for the present summation.
81
+
82
+ \begin{proof}
83
+ If \(H\) is unsatisfiable, both unsatisfiability probabilities are one.
84
+ Suppose it is satisfiable, and set \(x=q_{k-1}(H)\) and \(b=b(H)\).
85
+ When \(x\le\eps\), the right side after subtracting \(\eps\) is
86
+ nonpositive. Assume \(x>\eps\).
87
+
88
+ First \(b\ge k\). Otherwise
89
+ \[
90
+ x\le\frac{1}{2^{k-1}\binom{n-1}{k-1}}
91
+ \le\frac1n\le n^{-(k-1)/k}=\eps.
92
+ \]
93
+ The middle inequality follows from
94
+ \(\binom{n-1}{k-1}\ge n-1\), valid for \(1\le k-1\le n-2\), and
95
+ \(2^{k-1}(n-1)\ge n\). For \(b\ge k\), the exact killing probabilities
96
+ give
97
+ \[
98
+ q_k(H)
99
+ =x\frac{b-k+1}{2(v-k+1)}
100
+ \ge \frac{x}{k}\frac{b}{2v}
101
+ \ge \frac1k x^{k/(k-1)}.
102
+ \]
103
+ Here \(b-k+1\ge b/k\) and \(v-k+1\le v\). For the last inequality,
104
+ each factor \((b-j)/(v-j)\) is at most \(b/v\), so
105
+ \(x\le(b/(2v))^{k-1}\). Consequently,
106
+ \[
107
+ gq_k(H)\ge2n^{1/k}x^{k/(k-1)}\ge2x,
108
+ \]
109
+ because \(x>n^{-(k-1)/k}\).
110
+
111
+ The block makes \(H\) unsatisfiable whenever at least one of its
112
+ clauses does so individually. These individual events are independent
113
+ conditional on \(H\). Hence
114
+ \[
115
+ \PP(H\wedge R_1\wedge\cdots\wedge R_g\notin\sat)
116
+ \ge1-(1-q_k(H))^g
117
+ \ge1-e^{-2x}
118
+ \ge x.
119
+ \]
120
+ For the last inequality, \(0\le x\le2^{-(k-1)}\le1/4\), and
121
+ \(1-e^{-2x}-x\) vanishes at zero and has positive derivative on that
122
+ interval.
123
+ \end{proof}
124
+
125
+ \subsection{Erasing one variable and summing over time}
126
+
127
+ The following estimate is the input to the omission argument in
128
+ Section~\ref{sec:concentration}. Unsatisfiable formulas contribute zero,
129
+ and the sum includes the empty prefix and the cap.
130
+
131
+ \begin{proposition}[Integrated forcing]\label{prop:forcing}
132
+ For every fixed integer \(k\ge3\),
133
+ \begin{equation}\label{eq:integrated}
134
+ \sum_{j=0}^{M_n}\EE\frac{b(F_{n,j})}{n}=O_k(n^{1/k}),
135
+ \qquad M_n=2^{k+1}n.
136
+ \end{equation}
137
+ \end{proposition}
138
+
139
+ \begin{proof}
140
+ It is enough to consider \(n\ge k+1\). We first prove an explicit
141
+ bound for every integer cap \(M\ge0\), and then take \(M=M_n\).
142
+ The case \(M=0\) is immediate, so assume \(M\ge1\).
143
+ By symmetry, the \(j\)-th
144
+ summand is the probability that \(F_{n,j}\) is satisfiable and \(x_n\)
145
+ is forced. Delete the clauses containing \(x_n\), and let \(d\) be
146
+ their number. Then \(d\sim\Bin(j,k/n)\). Conditional on their positions,
147
+ the untouched formula \(B\) is an independent proper \(k\)-SAT formula
148
+ on \(v=n-1\) variables with \(j-d\) clauses. Erasing the literal on
149
+ \(x_n\) from each deleted clause leaves independent uniform
150
+ \((k-1)\)-clauses \(Q_1,\ldots,Q_d\) on those \(v\) variables,
151
+ independent of \(B\).
152
+
153
+ If \(F_{n,j}\) is satisfiable and \(x_n\) is forced, then
154
+ \begin{equation}\label{eq:forced-reduction}
155
+ B\in\sat,\qquad B\wedge Q_1\wedge\cdots\wedge Q_d\notin\sat.
156
+ \end{equation}
157
+ Indeed, any solution of the latter formula would extend to a solution
158
+ of \(F_{n,j}\) with either value of \(x_n\).
159
+
160
+ Keep the incidence positions fixed. Replace each \(Q_\ell\) in turn by
161
+ \(g\) fresh random \(k\)-clauses, with \(g,\eps\) as in
162
+ Lemma~\ref{lem:replacement}. At a replacement step, condition on \(B\),
163
+ all other remaining shortened clauses, and all previously inserted
164
+ blocks. The clause being replaced is still uniform and independent of
165
+ this background, so the lemma bounds the loss in unsatisfiability
166
+ probability by \(\eps\). Averaging at each step yields
167
+ \[
168
+ \PP(B\wedge Q_1\wedge\cdots\wedge Q_d\notin\sat
169
+ \mid\text{incidence positions})
170
+ \le1-P_v(j-d+dg)+d\eps.
171
+ \]
172
+ The formula after all replacements has \(j-d+dg\) independent proper
173
+ \(k\)-clauses on \(v\) variables. Since \(B\notin\sat\) is contained in
174
+ the event on the left and has conditional probability \(1-P_v(j-d)\),
175
+ the conditional probability of \eqref{eq:forced-reduction} is at most
176
+ \begin{equation}\label{eq:replacement-difference}
177
+ \Delta_{j,d}+d\eps,\qquad
178
+ \Delta_{j,d}=P_v(j-d)-P_v(j-d+dg)\ge0.
179
+ \end{equation}
180
+
181
+ To sum this estimate, let
182
+ \(p_{j,d}=\PP(\Bin(j,k/n)=d)\). For \(0\le d\le j\le M\),
183
+ \[
184
+ p_{j,d}\le\binom jd(k/n)^d\le\frac{(kM/n)^d}{d!}.
185
+ \]
186
+ For fixed \(d\), monotonicity of \(P_v\) and telescoping give
187
+ \begin{equation}\label{eq:telescoping}
188
+ \sum_{j=d}^{M}\Delta_{j,d}
189
+ =\sum_{t=0}^{M-d}\bigl[P_v(t)-P_v(t+dg)\bigr]\le dg.
190
+ \end{equation}
191
+ For example, after shifting the second sum by \(dg\), only the first
192
+ \(dg\) nonnegative terms can remain; if the shift exceeds the number
193
+ of terms, that number is already at most \(dg\).
194
+
195
+ Use the envelope \((kM/n)^d/d!\) only for the nonnegative
196
+ \(\Delta_{j,d}\) term. The error \(d\eps\) is averaged with its original
197
+ binomial weight, whose mean is \(kj/n\). Therefore
198
+ \begin{align}
199
+ \sum_{j=0}^{M}\EE\frac{b(F_{n,j})}{n}
200
+ &\le
201
+ \sum_{d=0}^{M}\frac{(kM/n)^d}{d!}
202
+ \sum_{j=d}^{M}\Delta_{j,d}
203
+ +\eps\sum_{j=0}^{M}\frac{kj}{n}\notag\\
204
+ &\le
205
+ g\sum_{d=0}^{\infty}\frac{d(kM/n)^d}{d!}
206
+ +\frac{kM(M+1)}{2n}\eps\notag\\
207
+ &=\frac{kM}{n}e^{kM/n}g+\frac{kM(M+1)}{2n}\eps.
208
+ \label{eq:forcing-general-cap}
209
+ \end{align}
210
+ At \(M=M_n=L_kn\), the exponential factor depends only on \(k\).
211
+ The last expression is therefore \(O_k(g+n\eps)=O_k(n^{1/k})\),
212
+ because \(g=O_k(n^{1/k})\) and \(n\eps=n^{1/k}\).
213
+ \end{proof}
preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/sections/introduction.tex ADDED
@@ -0,0 +1,181 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{The limiting-threshold problem}\label{sec:intro}
2
+
3
+ As independent clauses are added to a random Boolean formula,
4
+ satisfiability changes from likely to unlikely. A narrow transition
5
+ window answers only part of the threshold question: its location might
6
+ still drift as the number of variables grows. We prove that the location
7
+ converges for every fixed clause size at least three.
8
+
9
+ A Boolean assignment gives each variable \(x_i\) a value in \(\{0,1\}\).
10
+ A literal is a variable or its negation; a clause is a disjunction of
11
+ literals, and a conjunctive normal form formula is a conjunction of
12
+ clauses. A formula is satisfiable if some assignment makes every clause
13
+ true. Random \(k\)-SAT asks how this event changes as independent clauses
14
+ are added to a formula on \(n\) variables.
15
+
16
+ Fix an integer \(k\ge3\). For \(n\ge k\), a \emph{proper \(k\)-clause}
17
+ uses \(k\) distinct variables chosen uniformly from \(x_1,\ldots,x_n\),
18
+ with independent fair signs. Thus each of the \(2^k\binom nk\) possible
19
+ clauses has the same probability. Let \(C_1,C_2,\ldots\) be independent
20
+ clauses with this law, and define
21
+ \[
22
+ F_{n,m}=\bigwedge_{i=1}^{m}C_i,
23
+ \qquad P_n(m)=\PP(F_{n,m}\in\sat),\qquad m=0,1,2,\ldots.
24
+ \]
25
+ Here \(\sat\) denotes satisfiability, and the empty conjunction is true.
26
+ Whole clauses are sampled with replacement: two positions may contain
27
+ the same clause, although a variable cannot occur twice within one
28
+ proper clause. The prefix coupling makes \(P_n\) nonincreasing and gives
29
+ \(P_n(0)=1\). The ratio \(c=m/n\) is the clause density.
30
+
31
+ \begin{theorem}\label{thm:main}
32
+ For every fixed integer \(k\ge3\), there is a constant
33
+ \(\alpha_k\in(0,\infty)\) such that, for independent proper uniformly
34
+ signed \(k\)-clauses sampled with replacement,
35
+ \[
36
+ \lim_{n\to\infty}P_n(\lfloor cn\rfloor)
37
+ =
38
+ \begin{cases}
39
+ 1,&0\le c<\alpha_k,\\
40
+ 0,&c>\alpha_k.
41
+ \end{cases}
42
+ \]
43
+ \end{theorem}
44
+
45
+ The conclusion is a strict-side threshold statement; it makes no
46
+ assertion at \(c=\alpha_k\). All estimates below may depend on the fixed
47
+ integer \(k\). The proof does not require the centers of the transition
48
+ windows to be known in advance. It constructs a finite-size center,
49
+ controls the fluctuations about it, and then proves that these centers
50
+ converge.
51
+
52
+ \subsection{Prior work and the role of the present argument}
53
+
54
+ Carenini~\cite[Theorem~1.1 and Corollary~1.2]{Carenini2026Polynomial}
55
+ proves an \(O_{k,\eta}(n^{1/2+1/k})\) clause window between probability
56
+ levels \(\eta\) and \(1-\eta\), for each fixed \(0<\eta<1/2\), and, using
57
+ the Abbe--Montanari criterion, establishes the satisfiability conjecture for
58
+ every fixed \(k\ge3\). We credit Carenini with priority for the resolution
59
+ of the satisfiability conjecture. The present paper gives an alternative
60
+ proof of the limiting-threshold conclusion.
61
+
62
+ Chv\'atal and Reed~\cite{CR} explicitly formulated the conjecture that
63
+ each fixed clause size greater than one has a limiting satisfiability
64
+ density. Friedgut's sharp-threshold theorem, with Bourgain's appendix
65
+ \cite[Theorem~1.3]{Friedgut}, established that random \(k\)-SAT has a
66
+ sharp transition around a sequence of densities. It left open whether
67
+ that sequence converges for each fixed \(k\). The classical two-clause
68
+ problem had already been settled by Chv\'atal and Reed
69
+ \cite[Theorems~3--4]{CR}, who also credit independent proofs by Goerdt
70
+ and Fernandez de la Vega. Goerdt's journal treatment is~\cite{Goerdt}.
71
+ The implication-graph mechanism is separate from the proof given here.
72
+
73
+ For larger arities, Achlioptas and Peres~\cite{AP} obtained leading-order
74
+ bounds \(2^k\log2-O(k)\), using weighted second moments. The
75
+ statistical-physics work of M\'ezard, Parisi, and Zecchina~\cite{MPZ}
76
+ and of Mertens, M\'ezard, and Zecchina~\cite{MMZ} developed threshold
77
+ predictions through the cavity method and one-step replica symmetry
78
+ breaking. In particular, the latter work predicted the large-\(k\)
79
+ expansion
80
+ \[
81
+ 2^k\log2-\frac{1+\log2}{2}+o_k(1),
82
+ \qquad o_k(1)\longrightarrow0\quad(k\longrightarrow\infty).
83
+ \]
84
+ Coja-Oghlan and Panagiotou~\cite[Theorem~1.1]{COP} proved that the
85
+ liminf and limsup of the sharp-threshold sequence both lie within an
86
+ additive error tending to zero as \(k\to\infty\) of
87
+ \(2^k\log2-(1+\log2)/2\). These asymptotic-in-arity estimates are
88
+ distinct from convergence in \(n\) at a fixed arity. Ding, Sly, and
89
+ Sun~\cite{DSS} proved existence and identified the threshold with the
90
+ one-step replica symmetry breaking prediction for all sufficiently
91
+ large fixed \(k\). Theorem~\ref{thm:main} establishes existence for every
92
+ fixed \(k\ge3\), without identifying the value of \(\alpha_k\).
93
+
94
+ The first ingredient is a comparison between shorter clauses and
95
+ blocks of ordinary clauses. Friedgut's half-cube replacement lemma
96
+ \cite[Lemma~5.7]{Friedgut} gives a qualitative antecedent based on frozen
97
+ coordinates and sequential replacement. Carenini
98
+ \cite[Lemma~6.1 and Corollaries~6.2, 7.10--7.11]{Carenini} developed an
99
+ averaged clause-replacement method. The cited version proves an
100
+ \(O_k(n/\log n)\) window between any two fixed central probability
101
+ levels, with constants also depending on those levels, and distinguishes
102
+ window width from convergence of the location in Section~10.1.
103
+ Here the replacement is applied after erasing one variable. Summing the
104
+ resulting changes in satisfiability probabilities bounds the forced
105
+ fraction along the clause process. A deletion argument then converts
106
+ this integrated bound into polynomial concentration. We give the
107
+ replacement, forcing, and deletion proofs in full.
108
+
109
+ The second ingredient compares a whole system with independent
110
+ subsystems. Guerra and Toninelli~\cite{GT} used interpolation to
111
+ establish thermodynamic limits for mean-field spin glasses.
112
+ Franz and Leone~\cite{FL}, and Franz, Leone, and Toninelli~\cite{FLT},
113
+ developed interpolation for diluted systems. Their pressure and
114
+ free-energy arguments, with the stated even-arity restrictions, do not
115
+ supply the hard satisfiability-threshold conclusion used here.
116
+ Bayati, Gamarnik, and Tetali~\cite[Section~4, Proposition~2]{BGT}
117
+ established a frozen-variable satisfiability interpolation between
118
+ clauses on a whole variable set and clauses confined to its parts.
119
+ Our Poisson comparison is a continuous-parameter form of that method.
120
+ Its sign follows from convexity of \(x\mapsto x^k\), applied to the
121
+ proportions of globally forced variables in the parts. The comparison
122
+ is exact for an auxiliary clause model that permits repeated variables;
123
+ we prove the transfer back to proper clauses, including the constant
124
+ loss caused by repetitions.
125
+
126
+ Finally, errors that are summable over geometrically increasing sizes
127
+ cannot produce macroscopic drift. This principle parallels the
128
+ approximate-superadditivity analysis of Abbe and Montanari
129
+ \cite[arXiv version, Section~4.3, Lemma~8 and Remark~3]{AM}, developed
130
+ in their study of solution counts. Our comparison uses the minimum of
131
+ two normalized centers. We prove the corresponding deterministic
132
+ convergence lemma, in a form that requires the comparison only when
133
+ the two sizes are comparable.
134
+
135
+ \subsection{How the proof reaches the threshold}
136
+
137
+ We cap the last satisfiable index at a fixed multiple of \(n\), and
138
+ take its expectation divided by \(n\) as the finite-size center. The
139
+ first task is to show that this capped index has sublinear fluctuations.
140
+ In a satisfiable formula, a variable is \emph{forced} if every
141
+ satisfying assignment gives it the same value. The clauses that avoid
142
+ the variable form the untouched background. If the variable is forced,
143
+ deleting its literal from each incident clause produces shorter clauses
144
+ that eliminate every solution of this background. Replacing each
145
+ shortened clause by a block of ordinary clauses turns this event into
146
+ a decrease of the satisfiability probability. Summing over prefix
147
+ lengths telescopes the decreases. Section~\ref{sec:forcing} thereby
148
+ controls the total expected forced fraction along the process.
149
+
150
+ Section~\ref{sec:concentration} omits a single clause while keeping the
151
+ other time indices. The delay in losing satisfiability counts the
152
+ prefixes where that clause is pivotal. Its square counts pairs of such
153
+ prefixes. If the punctured formula survives from the earlier prefix to
154
+ the later one, every intervening clause must avoid killing the earlier
155
+ solution set. This bounds the pair probability in terms of the variables
156
+ already forced at the earlier time. The integrated forcing estimate
157
+ then yields the required variance bound. Section~\ref{sec:anchors}
158
+ places the normalized means in a fixed positive bounded interval, using
159
+ a clause-to-variable matching at low density and an assignment first
160
+ moment at high density.
161
+
162
+ Concentration alone still permits the centers to drift. In the auxiliary
163
+ Poisson model, interpolation says that satisfiability at a combined size
164
+ is at least the product of the probabilities in two independent parts.
165
+ Below either finite-size center, transfer from the proper model gives a
166
+ fixed positive probability; above the combined center, it gives a
167
+ probability tending to zero. These facts prevent the combined center
168
+ from lying much below both smaller centers. A comparison with one extra
169
+ variable handles adjacent sizes. Section~\ref{sec:convergence} makes
170
+ these steps precise and sums the errors along a balanced tree of nearly
171
+ equal blocks. Its concentration-to-convergence theorem is then applied
172
+ to the local variance and center bounds.
173
+
174
+ Section~\ref{sec:three-clause} uses a first moment at density six to
175
+ bound the means of the three-clause indices, and gives exact relations
176
+ between their cap conventions. It then specializes the forcing estimate and deduces
177
+ concentration at the smaller cap. The improved mean bound permits a
178
+ smaller transfer interval for either cap, sharpening the numerical
179
+ constants while keeping the roles of the cap and the interval distinct.
180
+ Section~\ref{sec:boundaries} explains the lower-arity cases and the
181
+ finite-size information supplied by the proof.
preprints/A-Limiting-Satisfiability-Threshold-for-Every-Fixed-Clause-Size-September-25-2026/build/source/sections/three-clause.tex ADDED
@@ -0,0 +1,202 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \section{Three-clause refinements}\label{sec:three-clause}
2
+
3
+ For three literals per clause, a first moment at density six improves
4
+ the center bound enough to use the comparison interval \([0,8]\),
5
+ including for the main cap \(16n\). We also compare that statistic with
6
+ last-satisfiable and first-unsatisfiable indices capped at \(10n\).
7
+ Changing the cap of the last-satisfiable index has an exponentially
8
+ small effect on its normalized mean. Comparison with the first
9
+ unsatisfiable index also includes a one-step shift.
10
+
11
+ Throughout this section the clauses are independent uniformly signed
12
+ proper triples, sampled with replacement, and \(n\ge3\). Recall the
13
+ first unsatisfiable index \(H_n\), and write
14
+ \begin{equation}\label{eq:three-statistics}
15
+ W_n=\min\{H_n-1,10n\},\qquad
16
+ T_n=\min\{H_n,10n\},\qquad
17
+ V_n=\min\{H_n-1,16n\}.
18
+ \end{equation}
19
+ Thus \(V_n\) is the statistic of the main proof at \(k=3\). Put
20
+ \(\nu_n=\EE W_n/n\), while \(\mu_n=\EE V_n/n\) as before.
21
+ For integer \(m\),
22
+ \begin{equation}\label{eq:three-survival}
23
+ \begin{aligned}
24
+ P_n(m)&=\PP(W_n\ge m)&&\quad(0\le m\le10n),\\
25
+ P_n(m)&=\PP(T_n>m)&&\quad(0\le m<10n).
26
+ \end{aligned}
27
+ \end{equation}
28
+ Only the last-satisfiable identity includes its capped endpoint.
29
+
30
+ \subsection{The density-six bound and changes of cap}
31
+
32
+ Each fixed assignment satisfies a proper triple with probability \(7/8\),
33
+ so \(P_n(m)\le2^n(7/8)^m\). Set
34
+ \[
35
+ \sigma=2(7/8)^6<1,\qquad \rho=2(7/8)^{10}<1.
36
+ \]
37
+ The survival-sum identity for the positive integer \(H_n\) gives the
38
+ cap-independent bound
39
+ \begin{equation}\label{eq:three-h-mean}
40
+ \EE H_n=\sum_{m\ge0}P_n(m)
41
+ \le6n+\sum_{m\ge6n}2^n(7/8)^m
42
+ =6n+8\sigma^n.
43
+ \end{equation}
44
+ In particular, the normalized means of \(W_n,T_n,V_n\) are all at most
45
+ seven for large \(n\). Splitting at \(6n\) also gives the direct estimate
46
+ \begin{equation}\label{eq:three-center}
47
+ \nu_n\le6+4P_n(6n)\le6+4\sigma^n.
48
+ \end{equation}
49
+ The matching argument in Lemma~\ref{lem:center-bounds} gives
50
+ \(P_n(\lfloor c_0n\rfloor)=1-o(1)\) whenever \(c_0>0\) and
51
+ \(e^2c_0<1\). These clause counts lie below both caps, so there is
52
+ \(a_0>0\) such that
53
+ \begin{equation}\label{eq:three-anchors}
54
+ a_0\le\nu_n\le\mu_n\le7
55
+ \qquad\text{for all sufficiently large }n.
56
+ \end{equation}
57
+ The improved upper bound therefore applies to either cap.
58
+
59
+ The exact relations explain the distinction between first and last
60
+ indices at the capped endpoint. With the common cap \(10n\),
61
+ \begin{equation}\label{eq:three-same-cap}
62
+ W_n=T_n-1+\ind_{\{H_n>10n\}}
63
+ =T_n-1+\ind_{\{F_{n,10n}\in\sat\}}.
64
+ \end{equation}
65
+ If \(H_n\le10n\), the indices differ by one; otherwise both equal
66
+ \(10n\). To compare \(V_n\) with \(T_n-1\), count the extra satisfiable
67
+ prefixes:
68
+ \begin{equation}\label{eq:three-cross-cap}
69
+ \begin{gathered}
70
+ V_n=T_n-1+E_n,\qquad
71
+ E_n=\sum_{m=10n}^{16n}\ind_{\{H_n>m\}},\\
72
+ 0\le E_n\le(6n+1)\ind_{\{H_n>10n\}}.
73
+ \end{gathered}
74
+ \end{equation}
75
+ The first term is necessary: \(H_n=10n+1\) gives \(E_n=1\).
76
+ Since \(P_n(10n)\le\rho^n\), these identities imply
77
+ \begin{align}
78
+ 0\le\EE V_n-(\EE T_n-1)&\le(6n+1)\rho^n,
79
+ \label{eq:three-mean-bridge}\\
80
+ |\sd(V_n)-\sd(T_n)|&\le(6n+1)\rho^{n/2}.
81
+ \label{eq:three-sd-bridge}
82
+ \end{align}
83
+ For the second estimate, center the identity \(V_n=T_n-1+E_n\) and
84
+ apply the reverse triangle inequality in \(L^2\), using
85
+ \(\sd(E_n)\le(\EE E_n^2)^{1/2}\). Similarly,
86
+ \begin{equation}\label{eq:three-last-cap-bridge}
87
+ 0\le V_n-W_n\le6n\ind_{\{H_n>10n\}},\qquad
88
+ 0\le\mu_n-\nu_n\le6\rho^n.
89
+ \end{equation}
90
+ Thus \(\nu_n\to\alpha_3\), since the main proof already gives
91
+ \(\mu_n\to\alpha_3\).
92
+
93
+ \subsection{Numerical forcing bound and concentration}
94
+
95
+ The replacement parameters of Lemma~\ref{lem:replacement} become
96
+ \(v=n-1\), \(\varepsilon=n^{-2/3}\), and
97
+ \(g=\lceil6n^{1/3}\rceil\), for \(n\ge4\).
98
+ For a satisfiable background \(B\), put \(b=b(B)\) and
99
+ \(x=q_2(B)=b(b-1)/(4v(v-1))\). When \(x>\varepsilon\), the proof of
100
+ that lemma gives \(b\ge3\), and the exact killing probabilities read
101
+ \begin{equation}\label{eq:three-killing}
102
+ q_3(B)=x^{3/2}
103
+ \frac{b-2}{\sqrt{b(b-1)}}
104
+ \frac{\sqrt{v(v-1)}}{v-2}
105
+ \ge\frac13x^{3/2}.
106
+ \end{equation}
107
+ Here \(b-2\ge b/3\), \(\sqrt{b(b-1)}\le b\), and
108
+ \(\sqrt{v(v-1)}\ge v-2\). Thus \(gq_3(B)>2x\), and the lemma's
109
+ independent-block estimate is
110
+ \(1-(1-q_3(B))^g\ge1-e^{-2x}\ge x\).
111
+ Together with the case \(x\le\varepsilon\), this recovers the uniform
112
+ replacement loss \(\varepsilon\).
113
+
114
+ The numerical forcing bound follows directly from
115
+ \eqref{eq:forcing-general-cap} with \(k=3\) and \(M=10n\):
116
+ \begin{equation}\label{eq:three-forcing}
117
+ \sum_{j=0}^{10n}\EE\frac{b(F_{n,j})}{n}
118
+ \le30e^{30}\lceil6n^{1/3}\rceil
119
+ +(150n+15)n^{-2/3}
120
+ =O(n^{1/3}).
121
+ \end{equation}
122
+ The constant \(30\) is the maximum mean incidence count \(3M/n\).
123
+ The general proof supplies the conditioning and telescoping needed
124
+ for this estimate, including the prefix \(j=10n\).
125
+
126
+ Concentration at the smaller cap follows even more directly from the
127
+ main variance bound: \(W_n=\min\{V_n,10n\}\). If \(V_n'\) is an
128
+ independent copy of \(V_n\) and \(W_n'=\min\{V_n',10n\}\), truncation
129
+ is \(1\)-Lipschitz, so
130
+ \[
131
+ \Var(W_n)=\tfrac12\EE(W_n-W_n')^2
132
+ \le\tfrac12\EE(V_n-V_n')^2=\Var(V_n).
133
+ \]
134
+ Proposition~\ref{prop:concentration} and Chebyshev's inequality give
135
+ \begin{equation}\label{eq:three-concentration}
136
+ \Var(W_n)=O(n^{5/3}),\qquad
137
+ \PP\bigl(|W_n-n\nu_n|\ge n^{11/12}\bigr)=O(n^{-1/6}).
138
+ \end{equation}
139
+ The same powers hold for \(V_n\), with its own finite-size mean.
140
+
141
+ \subsection{The comparison range is independent of the cap}
142
+
143
+ In the auxiliary model, an ordered triple has distinct variable indices
144
+ with probability
145
+ \[
146
+ \vartheta_n=\frac{(n)_3}{n^3}=1-\frac3n+\frac2{n^2}.
147
+ \]
148
+ At density \(c\), Poisson thinning separates a proper-clause count
149
+ \(J\sim\Pois(cn\vartheta_n)\) from an independent repeated-variable
150
+ family with mean count \(c(3-2/n)\). Therefore
151
+ Lemma~\ref{lem:proper-transfer} gives, for every fixed \(D\ge0\) and
152
+ \(0\le c\le D\),
153
+ \begin{equation}\label{eq:three-density-sandwich}
154
+ e^{-3D}\EE P_n(J)\le s_n(c)\le\EE P_n(J),\qquad
155
+ cn-3D\le\EE J\le cn,\qquad \Var(J)\le Dn.
156
+ \end{equation}
157
+ The parameter \(D\) controls the density at which probabilities are
158
+ compared. The proof of Theorem~\ref{thm:concentration-to-convergence}
159
+ requires \(D>b\); it need not equal the cap.
160
+
161
+ By \eqref{eq:three-anchors} and \eqref{eq:three-concentration}, both
162
+ \((\lambda,x_n^{(\lambda)})=(10,\nu_n)\) and
163
+ \((\lambda,x_n^{(\lambda)})=(16,\mu_n)\) satisfy that theorem's inputs
164
+ with
165
+ \begin{equation}\label{eq:three-engine-parameters}
166
+ (a,b,\delta,\eta)=\left(a_0,7,\frac1{12},\frac16\right),\qquad
167
+ (D,R,\gamma,\kappa)=\left(8,24,\frac16,\frac{e^{-24}}2\right).
168
+ \end{equation}
169
+ Here \(b<\lambda\) for either cap, \(D>b\), and
170
+ \(\gamma=\min\{\eta,1-2\delta\}=1/6\).
171
+ On \([0,8]\), the repetition mean is at most \(24\), so the sandwich is
172
+ \begin{equation}\label{eq:three-poisson-sandwich}
173
+ e^{-24}\EE P_n(J)\le s_n(c)\le\EE P_n(J),\qquad
174
+ cn-24\le\EE J\le cn,\qquad \Var(J)\le8n.
175
+ \end{equation}
176
+ For either choice \(z_n=\nu_n\) or \(z_n=\mu_n\), there is an absolute
177
+ constant \(K_8<\infty\) such that, uniformly on \(0\le c\le8\) for all
178
+ sufficiently large \(n\),
179
+ \begin{align}
180
+ c\le z_n-2n^{-1/12}&\Longrightarrow s_n(c)\ge e^{-24}/2,
181
+ \label{eq:three-transfer-low}\\
182
+ c\ge z_n+2n^{-1/12}&\Longrightarrow s_n(c)\le K_8n^{-1/6}.
183
+ \label{eq:three-transfer-high}
184
+ \end{align}
185
+ The theorem also gives the corresponding size comparisons for either
186
+ choice of center:
187
+ \begin{align}
188
+ z_{r+s}&\ge\min\{z_r,z_s\}-4\min\{r,s\}^{-1/12},
189
+ \label{eq:three-center-sum}\\
190
+ z_{s+1}&\ge z_s-4s^{-1/12},
191
+ \label{eq:three-neighbor}
192
+ \end{align}
193
+ for all sufficiently large relevant sizes, without a restriction on
194
+ \(r/s\) in the first inequality.
195
+
196
+ If probabilities are instead compared over the wider interval
197
+ \([0,16]\), the same calculation gives \(R=48\), lower sandwich factor
198
+ \(e^{-48}\), and lower-transfer constant \(e^{-48}/2\). These are the
199
+ constants obtained from the generic choices \(\lambda=16\), \(b=9\),
200
+ and \(D=16\) in the main proof. The sharper mean bound permits \(D=8\)
201
+ for that same cap, while the \(D=16\) calculation covers a larger range
202
+ of densities.
preprints/A-Linear-Clock-for-Random-Walk-on-Tree-Weighted-Planar-Maps-October-5-2026/README.md ADDED
@@ -0,0 +1,18 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ # [A Linear Clock for Random Walk on Tree-Weighted Planar Maps](linear-clock-random-walk-tree-weighted-planar-maps.pdf)
2
+
3
+ **Author:** OpenAI
4
+
5
+ **Date:** October 5, 2026
6
+
7
+ ## Citation
8
+
9
+ ```bibtex
10
+ @misc{OAI:A-Linear-Clock-for-Random-Walk-on-Tree-Weighted-Planar-Maps-October-5-2026,
11
+ author = {{OpenAI}},
12
+ title = {{A Linear Clock for Random Walk on Tree-Weighted Planar Maps}},
13
+ howpublished = {OpenAI Math Release preprint
14
+ \href{https://github.com/openai/math/blob/main/preprints/A-Linear-Clock-for-Random-Walk-on-Tree-Weighted-Planar-Maps-October-5-2026/linear-clock-random-walk-tree-weighted-planar-maps.pdf}{OAI:A-Linear-Clock-for-Random-Walk-on-Tree-Weighted-Planar-Maps-October-5-2026}},
15
+ year = {2026}
16
+ }
17
+ ```
18
+
preprints/A-Linear-Clock-for-Random-Walk-on-Tree-Weighted-Planar-Maps-October-5-2026/build/bibliography.tex ADDED
@@ -0,0 +1,152 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \begin{thebibliography}{99}
2
+
3
+ \bibitem{Aldous}
4
+ D. Aldous,
5
+ \emph{Stopping times and tightness},
6
+ Ann. Probab. \textbf{6} (1978), no.~2, 335--340.
7
+ \href{https://doi.org/10.1214/aop/1176995579}{doi:10.1214/aop/1176995579}.
8
+
9
+ \bibitem{Berestycki}
10
+ N. Berestycki,
11
+ \emph{Diffusion in planar Liouville quantum gravity},
12
+ Ann. Inst. Henri Poincar\'e Probab. Stat. \textbf{51} (2015), no.~3,
13
+ 947--964.
14
+ \href{https://doi.org/10.1214/14-AIHP605}{doi:10.1214/14-AIHP605}.
15
+
16
+ \bibitem{BG}
17
+ N. Berestycki and E. Gwynne,
18
+ \emph{Random walks on mated-CRT planar maps and Liouville Brownian motion},
19
+ Comm. Math. Phys. \textbf{395} (2022), no.~2, 773--857.
20
+ \href{https://doi.org/10.1007/s00220-022-04482-y}{doi:10.1007/s00220-022-04482-y}.
21
+ \href{https://arxiv.org/abs/2003.10320v2}{arXiv:2003.10320v2}.
22
+
23
+ \bibitem{Chaiken}
24
+ S. Chaiken,
25
+ \emph{A combinatorial proof of the all minors matrix tree theorem},
26
+ SIAM J. Algebraic Discrete Methods \textbf{3} (1982), no.~3, 319--329.
27
+ \href{https://doi.org/10.1137/0603033}{doi:10.1137/0603033}.
28
+
29
+ \bibitem{DMS}
30
+ B. Duplantier, J. Miller, and S. Sheffield,
31
+ \emph{Liouville quantum gravity as a mating of trees},
32
+ Ast\'erisque \textbf{427} (2021), viii+258 pp.
33
+ \href{https://doi.org/10.24033/ast.1149}{doi:10.24033/ast.1149}.
34
+ \href{https://arxiv.org/abs/1409.7055v4}{arXiv:1409.7055v4}.
35
+
36
+ \bibitem{Dykhne}
37
+ A. M. Dykhne,
38
+ \emph{Conductivity of a two-dimensional two-phase system},
39
+ Soviet Phys. JETP \textbf{32} (1971), no.~1, 63--65;
40
+ translated from Zh. Eksp. Teor. Fiz. \textbf{59} (1970), 110--115.
41
+
42
+ \bibitem{FOT}
43
+ M. Fukushima, Y. Oshima, and M. Takeda,
44
+ \emph{Dirichlet Forms and Symmetric Markov Processes},
45
+ second revised and extended edition,
46
+ De Gruyter Studies in Mathematics, vol.~19,
47
+ Walter de Gruyter, Berlin, 2011.
48
+ \href{https://doi.org/10.1515/9783110218091}{doi:10.1515/9783110218091}.
49
+
50
+ \bibitem{GRV}
51
+ C. Garban, R. Rhodes, and V. Vargas,
52
+ \emph{Liouville Brownian motion},
53
+ Ann. Probab. \textbf{44} (2016), no.~4, 3076--3110.
54
+ \href{https://doi.org/10.1214/15-AOP1042}{doi:10.1214/15-AOP1042}.
55
+
56
+ \bibitem{GRVForm}
57
+ C. Garban, R. Rhodes, and V. Vargas,
58
+ \emph{On the heat kernel and the Dirichlet form of Liouville Brownian motion},
59
+ Electron. J. Probab. \textbf{19} (2014), Paper No.~96, 1--25.
60
+ \href{https://doi.org/10.1214/EJP.v19-2950}{doi:10.1214/EJP.v19-2950}.
61
+
62
+ \bibitem{GHS}
63
+ E. Gwynne, N. Holden, and X. Sun,
64
+ \emph{A mating-of-trees approach for graph distances in random planar maps},
65
+ Probab. Theory Related Fields \textbf{177} (2020), nos.~3--4, 1043--1102.
66
+ \href{https://doi.org/10.1007/s00440-020-00969-8}{doi:10.1007/s00440-020-00969-8}.
67
+
68
+ \bibitem{GMMetric}
69
+ E. Gwynne and J. Miller,
70
+ \emph{Existence and uniqueness of the Liouville quantum gravity metric
71
+ for $\gamma\in(0,2)$},
72
+ Invent. Math. \textbf{223} (2021), no.~1, 213--333.
73
+ \href{https://doi.org/10.1007/s00222-020-00991-6}{doi:10.1007/s00222-020-00991-6}.
74
+
75
+ \bibitem{GMConformal}
76
+ E. Gwynne and J. Miller,
77
+ \emph{Conformal covariance of the Liouville quantum gravity metric
78
+ for $\gamma\in(0,2)$},
79
+ Ann. Inst. Henri Poincar\'e Probab. Stat. \textbf{57} (2021), no.~2,
80
+ 1016--1031.
81
+ \href{https://doi.org/10.1214/20-AIHP1105}{doi:10.1214/20-AIHP1105}.
82
+
83
+ \bibitem{GM}
84
+ E. Gwynne and J. Miller,
85
+ \emph{Random walk on random planar maps: spectral dimension, resistance
86
+ and displacement},
87
+ Ann. Probab. \textbf{49} (2021), no.~3, 1097--1128.
88
+ \href{https://doi.org/10.1214/20-AOP1471}{doi:10.1214/20-AOP1471}.
89
+
90
+ \bibitem{GMSHarmonic}
91
+ E. Gwynne, J. Miller, and S. Sheffield,
92
+ \emph{Harmonic functions on mated-CRT maps},
93
+ Electron. J. Probab. \textbf{24} (2019), Paper No.~58, 1--55.
94
+ \href{https://doi.org/10.1214/19-EJP325}{doi:10.1214/19-EJP325}.
95
+
96
+ \bibitem{GMS}
97
+ E. Gwynne, J. Miller, and S. Sheffield,
98
+ \emph{The Tutte embedding of the mated-CRT map converges to Liouville
99
+ quantum gravity},
100
+ Ann. Probab. \textbf{49} (2021), no.~4, 1677--1717.
101
+ \href{https://doi.org/10.1214/20-AOP1487}{doi:10.1214/20-AOP1487}.
102
+
103
+ \bibitem{GMS2}
104
+ E. Gwynne, J. Miller, and S. Sheffield,
105
+ \emph{An invariance principle for ergodic scale-free random environments},
106
+ Acta Math. \textbf{228} (2022), no.~2, 303--384.
107
+ \href{https://doi.org/10.4310/ACTA.2022.v228.n2.a2}{doi:10.4310/ACTA.2022.v228.n2.a2}.
108
+
109
+ \bibitem{LP}
110
+ R. Lyons and Y. Peres,
111
+ \emph{Probability on Trees and Networks},
112
+ Cambridge Series in Statistical and Probabilistic Mathematics, vol.~42,
113
+ Cambridge University Press, New York, 2016.
114
+ \href{https://doi.org/10.1017/9781316672815}{doi:10.1017/9781316672815}.
115
+
116
+ \bibitem{IG4}
117
+ J. Miller and S. Sheffield,
118
+ \emph{Imaginary geometry IV: interior rays, whole-plane reversibility,
119
+ and space-filling trees},
120
+ Probab. Theory Related Fields \textbf{169} (2017), nos.~3--4, 729--869.
121
+ \href{https://doi.org/10.1007/s00440-017-0780-2}{doi:10.1007/s00440-017-0780-2}.
122
+ \href{https://arxiv.org/abs/1302.4738v2}{arXiv:1302.4738v2}.
123
+
124
+ \bibitem{MSSphere}
125
+ J. Miller and S. Sheffield,
126
+ \emph{Liouville quantum gravity spheres as matings of finite-diameter trees},
127
+ Ann. Inst. Henri Poincar\'e Probab. Stat. \textbf{55} (2019), no.~3,
128
+ 1712--1750.
129
+ \href{https://doi.org/10.1214/18-AIHP932}{doi:10.1214/18-AIHP932}.
130
+ \href{https://arxiv.org/abs/1506.03804v4}{arXiv:1506.03804v4}.
131
+
132
+ \bibitem{Mullin}
133
+ R. C. Mullin,
134
+ \emph{On the enumeration of tree-rooted maps},
135
+ Canad. J. Math. \textbf{19} (1967), 174--183.
136
+ \href{https://doi.org/10.4153/CJM-1967-010-x}{doi:10.4153/CJM-1967-010-x}.
137
+
138
+ \bibitem{ConformalMaps}
139
+ OpenAI,
140
+ \emph{Canonical conformal limits of subcritical FK planar maps},
141
+ OpenAI Math Release preprint
142
+ \href{https://github.com/openai/math/blob/main/preprints/Canonical-conformal-limits-of-subcritical-FK-planar-maps-September-24-2026/main.pdf}{OAI:Canonical-conformal-limits-of-subcritical-FK-planar-maps-September-24-2026},
143
+ 2026.
144
+
145
+ \bibitem{MetricMaps}
146
+ OpenAI,
147
+ \emph{Metric-measure limits of subcritical FK and spanning-tree planar maps},
148
+ OpenAI Math Release preprint
149
+ \href{https://github.com/openai/math/blob/main/preprints/Metric-measure-limits-of-subcritical-FK-and-spanning-tree-planar-maps-September-24-2026/main.pdf}{OAI:Metric-measure-limits-of-subcritical-FK-and-spanning-tree-planar-maps-September-24-2026},
150
+ 2026.
151
+
152
+ \end{thebibliography}
preprints/A-Linear-Clock-for-Random-Walk-on-Tree-Weighted-Planar-Maps-October-5-2026/build/paper.tex ADDED
@@ -0,0 +1,80 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ \documentclass[11pt]{article}
2
+ \usepackage[T1]{fontenc}
3
+ \usepackage{lmodern}
4
+ \usepackage[margin=1.1in]{geometry}
5
+ \usepackage{amsmath,amssymb,amsthm,mathtools}
6
+ \usepackage{microtype}
7
+ \usepackage{enumitem}
8
+ \usepackage{booktabs,array}
9
+ \usepackage{xcolor}
10
+ \usepackage{tikz}
11
+ \usetikzlibrary{arrows.meta,calc,patterns,positioning}
12
+ \usepackage[hyphens]{url}
13
+ \usepackage[colorlinks=true,linkcolor=blue!45!black,citecolor=blue!45!black,urlcolor=blue!45!black]{hyperref}
14
+ \hypersetup{pdftitle={A Linear Clock for Random Walk on Tree-Weighted Planar Maps},pdfauthor={OpenAI}}
15
+
16
+ \newtheorem{theorem}{Theorem}[section]
17
+ \newtheorem{proposition}[theorem]{Proposition}
18
+ \newtheorem{lemma}[theorem]{Lemma}
19
+ \newtheorem{corollary}[theorem]{Corollary}
20
+ \theoremstyle{definition}
21
+ \newtheorem{definition}[theorem]{Definition}
22
+ \theoremstyle{remark}
23
+ \newtheorem{remark}[theorem]{Remark}
24
+ \numberwithin{equation}{section}
25
+
26
+ \newcommand{\R}{\mathbb R}
27
+ \newcommand{\C}{\mathbb C}
28
+ \newcommand{\Z}{\mathbb Z}
29
+ \newcommand{\N}{\mathbb N}
30
+ \newcommand{\E}{\mathbb E}
31
+ \renewcommand{\P}{\mathbb P}
32
+ \newcommand{\dd}{\mathrm d}
33
+ \newcommand{\1}{\mathbf 1}
34
+ \newcommand{\en}{\mathsf e}
35
+ \newcommand{\enstar}{\mathsf e^{*}}
36
+ \newcommand{\cE}{\mathcal E}
37
+ \newcommand{\cQ}{\mathcal Q}
38
+ \DeclareMathOperator{\EL}{EL}
39
+ \let\Cap\relax
40
+ \DeclareMathOperator{\Cap}{Cap}
41
+ \DeclareMathOperator{\supp}{supp}
42
+ \DeclareMathOperator{\diam}{diam}
43
+ \DeclareMathOperator{\dist}{dist}
44
+ \DeclareMathOperator{\vol}{vol}
45
+ \DeclareMathOperator{\osc}{osc}
46
+ \DeclareMathOperator{\Law}{Law}
47
+ \DeclareMathOperator{\Var}{Var}
48
+ \DeclareMathOperator{\Area}{Area}
49
+ \newcommand{\articleid}[1]{\begingroup\Urlmuskip=0mu plus 2mu\relax\nolinkurl{#1}\endgroup}
50
+ \setlist{topsep=4pt,itemsep=3pt,parsep=0pt}
51
+ \setlength{\emergencystretch}{2em}
52
+
53
+ \title{A Linear Clock for Random Walk\\on Tree-Weighted Planar Maps}
54
+ \author{OpenAI}
55
+ \date{October 5, 2026}
56
+
57
+ \begin{document}
58
+ \maketitle
59
+ \begin{abstract}
60
+ We prove that stationary random walk on a planar map sampled with weight
61
+ equal to its number of spanning trees converges to Liouville Brownian
62
+ motion on the unit-area $\sqrt2$-Liouville quantum sphere. The convergence
63
+ retains the conditional path law jointly with the measured metric space.
64
+ The walk chooses uniformly among all incident half-edges and starts from
65
+ the stationary degree measure. For total attempt rate one and the
66
+ continuum Dirichlet form with factor $1/2$, the time acceleration is exactly
67
+ the number of map edges. The result uses the companion contour and metric
68
+ limits for this same ensemble.
69
+ \end{abstract}
70
+
71
+ \tableofcontents
72
+ \input{sections/01-introduction}
73
+ \input{sections/02-inputs}
74
+ \input{sections/03-nondegeneration}
75
+ \input{sections/04-energy}
76
+ \input{sections/05-sphere}
77
+ \input{sections/06-green}
78
+ \input{sections/07-dynamics}
79
+ \input{bibliography}
80
+ \end{document}
preprints/A-Linear-Clock-for-Random-Walk-on-Tree-Weighted-Planar-Maps-October-5-2026/build/sections/01-history.tex ADDED
@@ -0,0 +1,55 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ Mullin's enumeration of tree-rooted maps \cite{Mullin} gives the
2
+ combinatorial starting point: the selected spanning tree and its
3
+ complementary dual tree encode a map by a two-coordinate walk. The
4
+ continuum counterpart is the mating-of-trees construction of
5
+ Duplantier, Miller, and Sheffield \cite{DMS}. At $\gamma=\sqrt2$ its
6
+ boundary-length coordinates are independent Brownian motions. Miller
7
+ and Sheffield \cite{MSSphere} give the corresponding finite-area
8
+ sphere description, and their imaginary-geometry construction
9
+ \cite{IG4} supplies the space-filling $\mathrm{SLE}_8$ between the two
10
+ continuum trees. Couplings of discrete and continuum encodings have
11
+ also been used to compare graph distances across random-map models
12
+ \cite{GHS}. The continuum metric itself is characterized in
13
+ \cite{GMMetric}, with conformal covariance established in
14
+ \cite{GMConformal}.
15
+
16
+ Liouville Brownian motion was constructed by Garban, Rhodes, and Vargas
17
+ \cite{GRV} and independently by Berestycki \cite{Berestycki} through a
18
+ change of Brownian time determined by quantum area. Its Dirichlet-form
19
+ description \cite{GRVForm} separates two structures: the energy is
20
+ conformally invariant, while the speed measure is quantum area. This
21
+ distinction explains why the clock is a separate part of a random-map
22
+ scaling limit.
23
+
24
+ Several works establish important parts of the discrete picture.
25
+ Gwynne, Miller, and Sheffield prove convergence of the Tutte embedding
26
+ of mated-CRT maps, including conditional walk-law convergence modulo
27
+ time parameterization \cite{GMS}. Their estimates for harmonic
28
+ functions compare discrete and continuum energies up to constants and control
29
+ oscillation \cite{GMSHarmonic}; their invariance principle for ergodic
30
+ scale-free environments develops a broader framework for embedded
31
+ networks \cite{GMS2}. Gwynne and Miller obtain resistance,
32
+ return-probability, and displacement estimates for several infinite
33
+ random planar maps, including spanning-tree-weighted maps \cite{GM}.
34
+
35
+ Berestycki and Gwynne prove parameterized, quenched convergence to
36
+ Liouville Brownian motion for mated-CRT maps \cite{BG}. Their
37
+ deterministic time scale is an annealed exit-time median, comparable
38
+ to the inverse quantum area of a cell. Whether its ratio to that
39
+ inverse area converges is left open in \cite[Remark~1.3]{BG}.
40
+ Theorem~\ref{thm:main} concerns
41
+ the finite combinatorial tree-weighted map and its stationary
42
+ half-edge walk. It retains the conditional path law together with
43
+ metric and area, and identifies the acceleration as exactly $n$
44
+ for \eqref{eq:continuum-form}.
45
+
46
+ Our geometric inputs are the companion results in \cite{MetricMaps}.
47
+ The nondegeneration argument adapts the local-flow method in
48
+ \cite[Section~``The canonical conformal structure'']{ConformalMaps}
49
+ to a primal and a dual electrical network. The use of planar duality
50
+ to determine an effective conductivity has classical precedents,
51
+ including Dykhne's exact-conductivity argument \cite{Dykhne}. Here
52
+ we must first construct the energy limit without regularity
53
+ assumptions on the shapes of discrete faces. A separate Green
54
+ estimate in the original finite-map law then controls sources of
55
+ small stationary mass and supplies the missing clock information.