-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathparity_toeplitz_classification.tex
More file actions
3901 lines (3626 loc) · 189 KB
/
Copy pathparity_toeplitz_classification.tex
File metadata and controls
3901 lines (3626 loc) · 189 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
% ---------------------------------------------------------------------
% A total-variation floor and a rank-three classification for the
% parity-compressed sector of a log-singular Toeplitz form with a
% prime-power comb.
%
% Standalone draft. Self-contained preamble, no external \input:
% the paper is deliberately independent of any surrounding document
% set and uses no vocabulary beyond standard numerical analysis.
%
% STATUS (this revision): complete draft. Sections 1-9 are written out
% in full, with proofs where a statement is typed as proved. The typing
% table of Section 1.3 records the status of every numbered statement,
% and nothing in it is silently upgraded.
% ---------------------------------------------------------------------
\documentclass[11pt,a4paper]{article}
\usepackage[T1]{fontenc}
\usepackage[utf8]{inputenc}
\usepackage[english]{babel}
\usepackage{lmodern}
\usepackage[a4paper,margin=2.6cm]{geometry}
\usepackage{amsmath,amssymb,amsthm}
\usepackage{mathtools}
\usepackage{booktabs,array,tabularx}
\usepackage{xltabular}
\usepackage{enumitem}
\usepackage{microtype}
\usepackage[hidelinks]{hyperref}
\emergencystretch=3em
\theoremstyle{plain}
\newtheorem{theorem}{Theorem}[section]
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{corollary}[theorem]{Corollary}
\theoremstyle{definition}
\newtheorem{definition}[theorem]{Definition}
\newtheorem{convention}[theorem]{Convention}
\newtheorem{remark}[theorem]{Remark}
\newtheorem{measurement}[theorem]{Measurement}
\newtheorem{problem}[theorem]{Problem}
\newcommand{\R}{\mathbb{R}}
\newcommand{\Z}{\mathbb{Z}}
\newcommand{\N}{\mathbb{N}}
\newcommand{\T}{\mathsf{T}}
\newcommand{\Tm}[1]{T_{#1}}
\newcommand{\lmin}{\lambda_{\min}}
\newcommand{\lmax}{\lambda_{\max}}
\newcommand{\cond}{\operatorname{cond}}
\newcommand{\PSD}{\succeq 0}
\newcommand{\PD}{\succ 0}
\newcommand{\Ah}{\widehat{A}}
\newcommand{\Qt}{\widetilde{Q}}
\newcommand{\ah}{\widehat{a}}
\newcommand{\MM}{\mathcal{M}}
\newcommand{\TV}{\operatorname{TV}}
\newcommand{\Ac}{\operatorname{Ac}}
\newcommand{\Cv}{\operatorname{Cv}}
\DeclareMathOperator{\diag}{diag}
\DeclareMathOperator{\rank}{rank}
\DeclareMathOperator{\tr}{tr}
\DeclareMathOperator{\sgn}{sgn}
\newcommand{\draftnote}[1]{%
\par\smallskip\noindent\textit{[Draft note: #1]}\par\smallskip}
\setlist{itemsep=2pt,topsep=3pt}
\newcolumntype{Y}{>{\raggedright\arraybackslash}X}
\title{A total-variation floor and a rank-three classification\\
for the parity-compressed sector of a log-singular\\
Toeplitz form with a prime-power comb}
\author{Stefan Hamann}
\date{\today}
\begin{document}
\maketitle
\begin{abstract}
\noindent
This paper is about the near-degeneracy behind a Toeplitz spectral floor: a
total-variation bound, three linear functionals, and a priced table of what the
standard unconditional toolbox reaches. The object is the reflection-odd
compression $A$ of a finite Toeplitz form whose lag sequence is a logarithmic
profile minus an explicit comb, and the question is how small the Rayleigh
quotient of $A$ can be on the low end of the parity spectrum. Four results are
proved. First, a \emph{total-variation floor}: every trial vector whose leading
parity coordinate is normalised to one has lag weights of total variation at
least $1/\mu_1$, where $\mu_1=4\sin^2(\pi/(2h+1))$ is the spectral gap of the
parity compression of the second difference; the floor is closed, involves no
comb node, no taper and no truncation, and it prices the entire trial-vector
route at $O(h^{-2})$ for every vector of bounded value. Second, a \emph{gauge
rigidity} statement: the leading-coordinate normalisation pins only the scale of
the trial direction, both the value and the total variation are homogeneous of
degree two, hence their ratio is a function of the ray and takes the same range
in every reparametrisation of the entry spectrum --- no sector change removes
the floor, and a shifted sector conserves it exactly, floor times transfer
being $1/\mu_1$ identically. Third, an exact \emph{rank-three classification}:
the two-by-two raw Gram block of the low parity modes splits as an archimedean
block minus a comb block, the determinant polarises into three terms, and the
comb--comb term is the polarisation of the determinant on symmetric
two-by-two matrices --- a form of rank three and signature $(1,2)$ --- so the
comb enters the determinant only through \emph{three} linear functionals of its
weights, for every window and every truncation. Fourth, a classification of
what this costs: any majorant of the comb--comb term built from a norm of the
weight vector must dominate the supremum of a rank-three quadratic over the
image of that norm ball, which is where the priced routes lose. The remaining
question --- whether the two rows of the block become collinear at a rate
uniform in the window index --- is stated as an open problem about a finite
bilinear form. Around it we report, as measurements on declared surfaces: the
rates; a table of five unconditional majorants together with the exponent each
certifies, the best of them short of the demanded one by two units in the
exponent; five structural obstructions, each exhibited failing; a curve of the
binned exponent against comb density over four decades of density, whose densest
bins are consistent with zero and whose undecidability under the declared caps is
part of the claim; and two controlled placement experiments, the second of which
closes into an exact identity for the response of the ratio to a displacement of
comb nodes inside their lag cells. Randomising the node positions at fixed
weights leaves every theorem here intact and removes the phenomenon: the
arithmetic enters the theorems only as the source of the comb positions and
weights, and every statement proved here holds for an arbitrary finite comb.
\end{abstract}
\section{Introduction}
\label{sec:intro}
\subsection{The problem, and why the direction is hard}
\label{sec:problem}
Let $c=(c_m)_{m=0}^{M-1}$ be a real lag sequence, let $\Tm{M}(c)$ be its
symmetric Toeplitz matrix, and let $A$ be the compression of $\Tm{M}(c)$ to the
reflection-odd sector of the window (Section~\ref{sec:setting}). The question
this paper is about is a lower bound for the Rayleigh quotient of $A$ on the low
end of a fixed orthonormal mode family --- equivalently, an upper bound for the
extent to which the quadratic form $v\mapsto v^{\T}Av$ can cancel along a smooth
direction.
The classical route from a Toeplitz form to a spectral bound is the symbol. If
$\ell\le\sigma$ pointwise then $\Tm{M}(\ell)\preceq\Tm{M}(\sigma)$ by Parseval,
and a positive pointwise minorant of the symbol transfers to a positive floor
for the form \cite{Szego1939,GrenanderSzego1958,KMS1953,Dirichlet1829,Fejer1916}. For the
class considered here that route is unavailable, and not marginally so: the
symbol is a logarithmic profile minus an explicit cosine comb, the comb dips are
numerous and narrow, and on every window of the declared surface of
Section~\ref{sec:numerics} the infimum of the symbol is negative, while the form
restricted to the parity sector is positive. The smallest Rayleigh quotient is
therefore not produced by a small value of the symbol at some frequency; it is
produced by \emph{cancellation inside the quadratic form}, along a direction that
lives in the low modes. A pointwise minorant is by construction blind to which
vector realises the minimum.
The natural substitute is a trial-vector route: exhibit an explicit direction,
evaluate the form on it, and price the evaluation. This paper is a
classification of that route. Its first two results say that the route has a
closed price which no reparametrisation removes; its second two say that the
object which remains after the price is paid is a quadratic polynomial in three
linear functionals of the comb weights, and that this is exactly why the
unconditional toolbox --- size budgets, symbol arguments, sectors and gauges,
splits, perturbation theory, the bilinear sieve box --- does not reach it. What
is \emph{not} claimed anywhere is a bound on the arithmetic: the three
functionals are finite sums over the comb, all four results hold for an
arbitrary finite comb, and the one remaining question is stated as an open
problem in Section~\ref{sec:open}.
The companion paper \cite{PaperI} treats the same window form from the opposite
direction --- a certified lower bound for a Galerkin defect on a nested ladder
--- and we cite it for the window form and the comb class rather than repeating
them.
\subsection{Contribution}
\label{sec:contrib}
\begin{enumerate}[label=(C\arabic*),leftmargin=3.1em]
\item\label{C:floor} \textbf{The total-variation floor, and the price it
fixes} (Theorem~\ref{thm:tvfloor} with
Corollaries~\ref{cor:price}--\ref{cor:abis}). For every trial vector whose
leading parity coordinate is normalised to one, the lag weights $w$ of the
associated window vector satisfy
$\TV(w)\ge|w_0|=\lVert v\rVert^{2}\ge1/\mu_1\ge N^{2}/(4\pi^{2})$, where
$\mu_1=4\sin^{2}(\pi/N)$, $N=2h+1$, is the spectral gap of the parity
compression $L_P$ of the second difference \cite{KMS1953}. The proof is four
steps and uses no property of the comb whatsoever. The load-bearing
consequence is a \emph{price}: the ratio of the value to the total variation
is at most $\mu_1$ times the value, so every trial vector of bounded value
certifies a ratio $O(h^{-2})$, and the boundary-free summation by parts
\cite{Abel1826} can certify nothing better.
\item\label{C:gauge} \textbf{Gauge rigidity of the normalisation}
(Theorem~\ref{thm:gauge} with
Propositions~\ref{prop:shift}--\ref{prop:nullmode} and
Corollary~\ref{cor:noescape}). The normalisation pins only the scale of the
trial direction; value and total variation are homogeneous of degree two;
hence their ratio is a function of the ray, and its range over admissible
vectors is the \emph{same} for every entry spectrum. A shifted spectrum does
flatten the floor, but the transfer factor that returns the bound to the
original scale conserves the product exactly: floor times transfer is
$1/\mu_1$ at every shift. So (C1) cannot be reparametrised away, and the
parity compression is not a convenience --- Proposition~\ref{prop:nullmode}
shows it is what makes the normalisation well posed at all.
\item\label{C:rank} \textbf{The exact bilinear form and the rank-three
classification} (Section~\ref{sec:rank}: Propositions~\ref{prop:split} and
\ref{prop:polarisation}, Theorem~\ref{thm:rank3},
Corollary~\ref{cor:majorant}). The two-by-two raw Gram block of the two lowest
parity modes splits exactly as $\Ah_2=B-S$ with $B$ archimedean and $S$ a
weighted sum of comb reads; the determinant polarises as
$\det\Ah_2=\det B-D(B,S)+\det S$; and $D$ is the polarisation of $\det$ on
symmetric two-by-two matrices, a form of rank three and signature $(1,2)$ in
the coordinates $(X_{11},X_{22},X_{12})$. Consequently the comb--comb term is
$S_{11}S_{22}-S_{12}^{2}$: a quadratic polynomial in \emph{three} linear
functionals of the comb weights, for every window, every $h$ and every
truncation. Corollary~\ref{cor:majorant} turns this into the statement about
majorants that the priced routes of Section~\ref{sec:open} run into.
\item\label{C:nogo} \textbf{A priced table, a density curve, and one open
problem} (Section~\ref{sec:open}). What remains after (C1)--(C3) is a single
question about a finite bilinear form: is the near-collinearity of the two
rows of $\Ah_2$ bounded uniformly in the window index? It is stated as
Problem~\ref{prob:R1} in three equivalent forms --- never as an approach to, a
weakening of, or a consequence of any conjecture. Around it,
Proposition~\ref{prop:routes} proves five unconditional majorants and
Measurement~\ref{meas:routes} reports the exponent each certifies on a
declared surface; Measurement~\ref{meas:nogo} exhibits five further routes
failing for structural reasons; Measurement~\ref{meas:density} gives the
binned exponent of Definition~\ref{def:ratio} against comb density over four
decades, with
Remark~\ref{rem:undecidable} stating what that curve cannot decide and at what
price; and Measurements~\ref{meas:placement} and \ref{meas:pole} locate the
phenomenon by intervention, the second through the closed-form response of
Proposition~\ref{prop:fh}.
\end{enumerate}
Two of these four are theorems; two are classifications supported by theorems
together with declared measurements. Which is which is recorded in
Section~\ref{sec:typing} rather than left to the reader.
\subsection{Typing of the results}
\label{sec:typing}
Every numbered statement of this paper that makes a claim carries exactly one of
three types, and the type is part of the statement. Table~\ref{tab:typing} types
every one of them: a definition and the open problem are marked as what they
are, and a remark that only reads results already stated carries a dash, since
it claims nothing of its own.
\begin{description}[leftmargin=2.2em,style=nextline]
\item[\textnormal{\emph{proved}}] A written proof is given (or, for classical
facts, cited). The statement holds for every window and every finite comb
within its stated hypotheses. Where a hypothesis is itself of a different
type --- positive definiteness of $A$ on the parity sector, for instance ---
the statement is \emph{conditional} and says so.
\item[\textnormal{\emph{certified per window}}] The statement is verified on
each window of a declared finite surface by a computation whose failure mode
is loud (a completed Cholesky factorisation, an exact identity residual
against a declared floor). No quantifier over windows is claimed.
\item[\textnormal{\emph{measured}}] The statement is a number, a fitted
exponent, or a controlled experiment on a declared finite surface, reported as
such. Fitted exponents are never used as bounds.
\end{description}
{\small
\begin{xltabular}{\textwidth}{@{}llY@{}}
\caption{Typing of every numbered statement. ``Conditional'' marks a proved
implication whose hypothesis is of a weaker type; the hypothesis is then named
in the statement.}
\label{tab:typing}\\
\toprule
statement & type & remark \\
\midrule
\endfirsthead
\toprule
statement & type & remark \\
\midrule
\endhead
\midrule
\multicolumn{3}{r@{}}{\emph{continued on the next page}}\\
\endfoot
\bottomrule
\endlastfoot
\multicolumn{3}{@{}l}{\emph{Section~\ref{sec:setting} --- setting and
scaffolding}}\\
the comb is not used (Rem.~\ref{rem:combfree}) & --- & the scope statement:
Secs.~\ref{sec:setting}--\ref{sec:rank} hold for an arbitrary finite comb \\
parity spectrum (Lem.~\ref{lem:kms}) & proved & closed eigenpairs and the gap
\eqref{eq:gap}; Kac--Murdock--Szeg\H{o} \cite{KMS1953} \\
L1 interlacing (Lem.~\ref{lem:interlacing}) & proved (cited) &
Cauchy \cite{Cauchy1829}, Courant--Fischer \cite{CourantFischer1920} \\
L2 Schur nesting (Lem.~\ref{lem:nesting}) & proved &
Schur \cite{Schur1917}, Haynsworth \cite{Haynsworth1968} \\
L3 constrained minimum (Lem.~\ref{lem:constrained}) & proved &
requires $G_k\PD$ \\
gauge law (Lem.~\ref{lem:gauge}) & proved & $\sum_dw_d=0$, unconditional \\
Abel swap (Lem.~\ref{lem:abel}) & proved & boundary-free, $w_M=0$ \\
C5 cascade forms (Prop.~\ref{prop:cascade}) & proved & prefix / minor /
regression \\
C6 diagonal invariance (Lem.~\ref{lem:diaginv}) & proved & one line \\
B4 cascade direction (Prop.~\ref{prop:direction}) & \emph{conditional}
& proved given $\Ah\PD$; the hypothesis is certified per window \\
\midrule
\multicolumn{3}{@{}l}{\emph{Section~\ref{sec:tvfloor} --- the
total-variation floor}}\\
A the floor (Thm.~\ref{thm:tvfloor}) & proved & comb-free, taper-free \\
A1 the price (Cor.~\ref{cor:price}) & proved & the load-bearing corollary \\
A2 Abel/H\"older (Cor.~\ref{cor:holder}) & proved & \\
A-bis (Cor.~\ref{cor:abis}) & proved & no normalisation needed \\
A4 negative control (Rem.~\ref{rem:negcontrol}) & proved & one line \\
A3 sharpness (Meas.~\ref{meas:sharpness}) & measured & $\mu_1\TV\in[5.00,23.20]$
on Surface~II \\
\midrule
\multicolumn{3}{@{}l}{\emph{Section~\ref{sec:gauge} --- gauge rigidity}}\\
B homogeneity (Thm.~\ref{thm:gauge}) & proved & \\
B1 floor $\times$ transfer (Prop.~\ref{prop:shift}) & proved & pure shift \\
B2 the null mode (Prop.~\ref{prop:nullmode}) & proved & closed spectra \\
no escape (Cor.~\ref{cor:noescape}) & proved & \\
sector battery (Meas.~\ref{meas:battery}) & certified per window &
$35\times6\times27$, residual $\le8.8\cdot10^{-10}$ \\
\midrule
\multicolumn{3}{@{}l}{\emph{Section~\ref{sec:twodim} --- the two-dimensional
reduction}}\\
C1 exact $K=2$ (Prop.~\ref{prop:K2}) & proved & \\
C2 pivot identity (Prop.~\ref{prop:pivot}) & proved & \\
C3 union identity (Prop.~\ref{prop:union}) & proved & \\
C7 Wronskian (Lem.~\ref{lem:wronskian}) & proved & the corner entry $3$ closes
it \\
C8 maximal minors (Lem.~\ref{lem:minors}) & proved & Lagrange
\cite{Lagrange1773} \\
C9 determinant reading (Lem.~\ref{lem:detread}) & proved & uses no positivity \\
C10 Gershgorin (Lem.~\ref{lem:gershgorin}) & proved & uniform in the window \\
C11 det-collapse (Prop.~\ref{prop:collapse}) & proved / \emph{conditional} &
the closed form is unconditional; the harmonic-mean bound needs
$\Ah_2\PD$ \\
wrong sign priced (Rem.~\ref{rem:wrongsign}) & proved & the identity
\eqref{eq:wrongsign}, $\rho=4r_{12}^{2}/(1-r_{12}^{2})$ \\
one obstruction, three readings (Rem.~\ref{rem:onedress}) & proved & the
explicit factor $1+3r_{12}^{2}\in[1,4]$; the reading is an observation \\
the section read together (Rem.~\ref{rem:selfsimilar}) & --- & which statements
are identities and which two are not \\
\midrule
\multicolumn{3}{@{}l}{\emph{Section~\ref{sec:rank} --- bilinear form and rank}}\\
D0 exact split (Prop.~\ref{prop:split}) & proved & needs an admissible
resolution \\
D1 polarisation (Prop.~\ref{prop:polarisation}) & proved & \\
D rank three (Thm.~\ref{thm:rank3}) & proved & every $h$, every
truncation \\
D wedge form (Lem.~\ref{lem:wedge}) & \emph{conditional} & proved given
rank-one reads; the defect is measured \\
D3 majorants (Cor.~\ref{cor:majorant}) & proved & the class
$\mathfrak M$ of Def.~\ref{def:majclass}; the route reading of
Rem.~\ref{rem:routeclass} is a reading \\
D3$'$ $\ell^{1}$ mass (Meas.~\ref{meas:l1}) & measured & $40.6\times$ the signed
value on the declared subsample; the rank-one defect priced on both
surfaces \\
D4a closed weights (Lem.~\ref{lem:closedweight}) & proved & one formula on
$1\le d\le M-1$ \\
D4b bandwidth $K$ (Lem.~\ref{lem:band}) & proved & the $4K$-dimensional band
space \eqref{eq:bandspace} \\
D4c band $\Rightarrow\eta$-rank (Lem.~\ref{lem:etarank}) & proved & general;
$r=(2\Omega+1)(q+1)$ for $\Omega$ frequencies and degree bound $q$ \\
D4d spline read (Lem.~\ref{lem:spline}) & proved & $\eta=O(K^{2}/N^{2})$ \\
D4 Type II $\eta$-rank (Prop.~\ref{prop:typeII}) & proved &
$\sigma_{4K+1}\le\eta\sqrt{RC}$; needs the interior hypothesis
\eqref{eq:interior} \\
D4$''$ what the interior hypothesis costs (Rem.~\ref{rem:interior}) & --- &
without \eqref{eq:interior} the conclusion is false as stated; the triangular
cut-off is not of low rank \\
D4$'$ Type II collapse (Meas.~\ref{meas:typeII}) & measured & the observed
$2$ is sharper than the proved $8$ and stays measured \\
D5 reference window (Meas.~\ref{meas:refwindow}) & measured & the
three-term cancellation \\
\midrule
\multicolumn{3}{@{}l}{\emph{Section~\ref{sec:open} --- the open problem}}\\
E0 Problem~\ref{prob:R1} & \emph{open} & three equivalent forms; a question
about a finite bilinear form \\
E1 angle against determinant (Lem.~\ref{lem:angle}) & proved & the factor lies
in $(0,1]$; used only to relate two readings \\
E2 rates (Meas.~\ref{meas:rate}) & measured & fitted exponents; every surface
and both readings declared \\
E3a dual-point read (Lem.~\ref{lem:dualpoint}) & proved & the two points
$\gamma_k=2\pi k/(ND)$ and their spacing are derived, not assumed \\
E3 five majorants (Prop.~\ref{prop:routes}) & proved & five unconditional
inequalities with their hypotheses \\
E4 priced routes (Meas.~\ref{meas:routes}) & measured & the exponent each
proved route certifies on Surface~II \\
E5 structural obstructions (Meas.~\ref{meas:nogo}) & certified per window &
each route exhibited failing on Surface~I \\
E6 the binned exponent (Def.~\ref{def:ratio}) & definition & deterministic;
ladder-dependent by Rem.~\ref{rem:undecidable} \\
E7 density curve (Meas.~\ref{meas:density}) & measured & on Surface~III,
quoted with its rung ladder \\
E8 undecidability, fence, caveat (Rem.~\ref{rem:undecidable}) & measured &
part of the claim of E7, not a caveat on it \\
E9 the scramble (Meas.~\ref{meas:placement}) & measured & controlled
experiment at fixed weight multiset \\
E10 exact placement derivative (Lem.~\ref{lem:dcexact}) & proved & $\dot c$
affine and piecewise constant \\
E11 placement response (Prop.~\ref{prop:fh}) & proved &
Hellmann--Feynman \cite{Hellmann1937,Feynman1939}; simple extreme
eigenvalues \\
E12 causality and the pole (Meas.~\ref{meas:pole}) & measured & a derivative
at a point on named instances, not a rate \\
E13 what is not claimed (Rem.~\ref{rem:notclaimed}) & --- & the binding
negative list \\
\midrule
\multicolumn{3}{@{}l}{\emph{Section~\ref{sec:numerics} --- numerical
verification}}\\
F1--F3 conventions (Sec.~\ref{sec:fp}) & --- & floors, conditioning cap,
mutation controls \\
the three surfaces (Sec.~\ref{sec:surfaces}) & --- & declared before any
number is read \\
cross-reference (Tab.~\ref{tab:crossref}) & --- & every numbered statement to
its check \\
the two fit remarks (Rem.~\ref{rem:fit2}, \ref{rem:twoexponents}) & measured &
why $h^{+1.997}$ is the closed $h^{2}$; why two exponents are one object \\
\end{xltabular}}
Table~\ref{tab:typing} is the first thing to read. Four entries deserve
emphasis. Proposition~\ref{prop:direction} and the harmonic-mean half of
Proposition~\ref{prop:collapse} are \emph{conditional}: they are proved
implications whose hypothesis is positive definiteness of the raw Gram block,
which on the surfaces of Section~\ref{sec:numerics} is a numerical fact about
finitely many finite matrices and nothing more. Lemma~\ref{lem:wedge} is
conditional in the same sense, on a rank-one hypothesis whose defect is
measured. And Measurement~\ref{meas:typeII} is the one place where a phrase of
the source material does not convert: ``effective rank $O(1)$'' is not a
theorem. What is proved instead is the chain
Lemmata~\ref{lem:closedweight}--\ref{lem:spline} and
Proposition~\ref{prop:typeII}, which bounds the $(4K+1)$-st singular value of a
factorisation-indexed block by a declared truncation error under a declared
interior hypothesis; the measured number of significant singular values is
smaller than what that proposition gives, and it therefore stays measured.
Two entries in the last block of the table need the same care.
Measurement~\ref{meas:routes} carries two types in one row on purpose: the
inequality of each route is proved (Proposition~\ref{prop:routes}), and only
the exponent it certifies is a fit on Surface~II. And
Measurement~\ref{meas:density} is quoted with its rung ladder, because the
estimator of Definition~\ref{def:ratio} is ladder-dependent: a bin value
reported without the ladder it was computed on is not reproducible
(Remark~\ref{rem:undecidable}).
\subsection{Notation}
\label{sec:notation}
Notation is fixed once, in Table~\ref{tab:notation}, and not varied. Three
choices need a word. The symbol $\Pi$ denotes the reflection-odd isometry, so
that $B$ can be reserved for the archimedean Gram block of
Section~\ref{sec:rank}; $\MM$ (calligraphic) denotes $\diag(\mu_1,\dots,\mu_K)$,
so that $M$ (upright) keeps its meaning as the window dimension; and the comb
weights, written $\mu_j$ in \cite{PaperI}, are written $\varrho_j$ here, because
$\mu_k$ is needed for the parity eigenvalues. The archimedean kernel is written
$a(\cdot)$ and always carries its argument; the coefficient vector of a trial
vector is written $a$ and never does.
\begin{table}[t]
\centering\small
\begin{tabularx}{\textwidth}{@{}lY@{}}
\toprule
symbol & meaning \\
\midrule
$D,\ M\in2\N,\ \alpha=MD/2,\ h=M/2,\ N=2h+1$ & cell width, window dimension,
half-width, sector dimension, parity period \\
$\Tm{M}(c)=(c_{|r-r'|})_{r,r'=0}^{M-1}$ & symmetric Toeplitz matrix of the lag
sequence $c$ \\
$\Pi\in\R^{M\times h}$, $\Pi e_r=\tfrac1{\sqrt2}(e_r-e_{M-1-r})$ &
reflection-odd isometry, $\Pi^{\T}\Pi=I_h$ \\
$A=\Pi^{\T}\Tm{M}(c)\Pi$, $A_{rr'}=c_{|r-r'|}-c_{M-1-r-r'}$ & the odd window
form \\
$a(\cdot)$; $S_D(s,u)$; $\varrho_j,u_j$ & archimedean kernel; symmetrised hat;
comb weights and node positions \\
$L_P$ & odd compression of the lag sequence $(2,-1,0,\dots)$: tridiagonal
$2I-E-E^{\T}$ with corner entry $3$ \\
$\mu_k=4\sin^{2}(k\pi/N)$, $(t_k)_r=\tfrac2{\sqrt N}\sin\tfrac{2\pi k(r+1)}N$ &
parity eigenvalues and orthonormal parity modes, $k=1,\dots,h$ \\
$\ah_{ij}=t_i^{\T}At_j$, $\Ah_K=(\ah_{ij})_{i,j\le K}$ & the raw Gram block \\
$\MM=\diag(\mu_1,\dots,\mu_K)$, $G=\MM^{-1/2}\Ah_K\MM^{-1/2}$ & the normalised
$K$-block \\
$G_k$, $g_k=e_1^{\T}G_k^{-1}e_1$, $s=\mu_1t_1^{\T}A^{-1}t_1$ & leading blocks,
the ladder, the entry functional \\
$x$ admissible: $x\in\R^{K}$, $x_1=1$ & trial vector \\
$a_k=x_k/\sqrt{\mu_k}$, $v=\sum_{k\le K}a_kt_k$ & coefficient vector and window
vector \\
$Q(x)=x^{\T}Gx=v^{\T}Av$ & the value \\
$w_0=\Ac_0(v)$, $w_d=2\Ac_d(v)-\Cv_{M-1-d}(v)$ $(d\ge1)$, $w_M:=0$ & lag
weights; $\Ac$ autocorrelation, $\Cv$ self-convolution \\
$(\Delta w)_d=w_d-w_{d+1}$, $\TV(x)=\lVert\Delta w\rVert_1$ & lag increments and
total variation \\
$C_d=\sum_{e\le d}c_e$, $C_{-1}:=0$ & partial sums of the lag sequence \\
$B$, $S$, $r_{12}^{2}=\ah_{12}^{2}/(\ah_{11}\ah_{22})$, $\nu_1\ge\nu_2$ &
archimedean block, comb block, squared correlation, eigenvalues of $\Ah_2$ \\
$D(P,Q)=P_{11}Q_{22}+P_{22}Q_{11}-2P_{12}Q_{12}$ & polarisation of $\det$ on
symmetric $2\times2$ matrices \\
\bottomrule
\end{tabularx}
\caption{Notation, fixed for the whole paper.}
\label{tab:notation}
\end{table}
$X\PSD$ and $X\PD$ denote positive semidefiniteness and definiteness,
$\preceq$ the L\"owner order, $\lVert\cdot\rVert$ the Euclidean norm,
$e_k$ the $k$-th coordinate vector, $|X|$ the entrywise absolute value of a
matrix, and $\sgn$ the entrywise sign. For $v\in\R^{h}$ the autocorrelation and
self-convolution are
\begin{equation}
\label{eq:accv}
\Ac_d(v)=\sum_{r}v_rv_{r+d}\quad(d\ge0),
\qquad
\Cv_j(v)=\sum_{r+r'=j}v_rv_{r'},
\end{equation}
both sums over indices in $\{0,\dots,h-1\}$ and empty sums being zero.
\emph{Admissible} always means $x_1=1$.
\section{Setting}
\label{sec:setting}
\subsection{The odd window form and the comb class}
\label{sec:window}
We use the window form and the comb class of \cite{PaperI} verbatim and recall
only what is needed. Fix a cell width $D>0$ and an even $M$, put $\alpha=MD/2$,
$h=M/2$, and let $\Pi$ be the reflection-odd isometry of
Table~\ref{tab:notation}. Given a real lag sequence $c=(c_m)_{m=0}^{M-1}$ the
odd window form is
\begin{equation}
\label{eq:Adef}
A=\Pi^{\T}\Tm{M}(c)\,\Pi\in\R^{h\times h},
\qquad
A_{rr'}=c_{|r-r'|}-c_{M-1-r-r'} .
\end{equation}
The class we verify on is the comb class of \cite[Def.~2.6]{PaperI}: with
$a(\cdot)$ the archimedean kernel of that definition, a finite node set
$\{(u_j,\varrho_j)\}_j$ with $u_j>0$, $\varrho_j>0$, and
$S_D(s,u)=\tfrac12[\Delta_D(s-u)+\Delta_D(s+u)]$ the symmetrised hat built from
the unit-height triangle $\Delta_D(t)=\max\{0,1-|t|/D\}$ of half-width $D$,
\begin{equation}
\label{eq:lags}
c_m=a(mD)-\sum_{j:\,u_j\le2\alpha}\varrho_j\,S_D(mD,u_j),
\qquad m=0,\dots,M-1 .
\end{equation}
The \emph{prime-power instance} is $u_j=\log n_j$ over the prime powers
$n_j=p^{\nu}$ in increasing order with $\varrho_j=2\Lambda(n_j)/\sqrt{n_j}$,
$\Lambda$ the von Mangoldt weight. By linearity of $c\mapsto A$ the split of
\eqref{eq:lags} induces a split
\begin{equation}
\label{eq:Asplit}
A=A_{\mathrm{arch}}-A_{\mathrm{comb}},
\qquad
A_{\mathrm{comb}}=\sum_{j}\varrho_j\,A^{(j)},
\quad
A^{(j)}=\Pi^{\T}\Tm{M}\bigl(S_D(\cdot D,u_j)\bigr)\Pi .
\end{equation}
Throughout, a \emph{resolution} $D$ is called \emph{admissible} if
$D<\min_ju_j$; for the prime-power instance this is implied by the admissibility
convention of \cite[Def.~5.1]{PaperI}, which fixes $D$ as a fraction of the
smallest log-gap in the run.
\begin{remark}[the arithmetic is not used]
\label{rem:combfree}
Theorems~\ref{thm:tvfloor}, \ref{thm:gauge} and \ref{thm:rank3}, and every
lemma, proposition and corollary of Sections~\ref{sec:setting}--\ref{sec:rank},
hold for an \emph{arbitrary} finite comb: the node positions $u_j$ and the
weights $\varrho_j$ enter only as the data of \eqref{eq:lags}, and no property of
the sequence $(u_j)$ or $(\varrho_j)$ is used. Where the prime-power instance is
mentioned it is as the instance the measurements of
Sections~\ref{sec:open}--\ref{sec:numerics} were taken on, and the only
arithmetic facts consumed anywhere are the two classical gap inequalities used
in \cite{PaperI} to check that a resolution is admissible
\cite{Chebyshev1852,RosserSchoenfeld1962}. No arithmetic statement is claimed.
\end{remark}
\subsection{The parity spectrum}
\label{sec:parity}
Let $c^{L}=(2,-1,0,\dots,0)$ and let $L_P$ be the odd window form
\eqref{eq:Adef} of $c^{L}$.
\begin{lemma}[the parity compression and its spectrum]
\label{lem:kms}
$L_P$ is the tridiagonal matrix $2I-E-E^{\T}$ on $\R^{h}$ with corner entry
$(L_P)_{h-1,h-1}=3$; equivalently, $L_P$ is the second-difference form with a
Dirichlet condition at the outer end and the odd reflection $u_h=-u_{h-1}$ at
the inner end. Its eigenpairs are
\begin{equation}
\label{eq:kms}
\mu_k=4\sin^{2}\Bigl(\frac{k\pi}{N}\Bigr),
\qquad
(t_k)_r=\frac2{\sqrt N}\,\sin\frac{2\pi k(r+1)}{N},
\qquad k=1,\dots,h,\ r=0,\dots,h-1,
\end{equation}
with $N=2h+1$, and $\{t_k\}_{k=1}^{h}$ is an orthonormal basis of $\R^{h}$. In
particular $\mu_1=4\sin^{2}(\pi/N)$ is the smallest eigenvalue and
\begin{equation}
\label{eq:gap}
\frac1{\mu_1}\;\ge\;\frac{N^{2}}{4\pi^{2}}\;>\;\frac{h^{2}}{\pi^{2}} .
\end{equation}
\end{lemma}
\begin{proof}
For $c^{L}$ the Hankel part of \eqref{eq:Adef} is
$-c^{L}_{M-1-r-r'}$, which is nonzero only if $M-1-r-r'\in\{0,1\}$, i.e.\ only
if $r+r'\in\{2h-2,2h-1\}$; since $r,r'\le h-1$ the only possibility is
$r=r'=h-1$, contributing $-c^{L}_1=+1$. Hence $L_P$ is tridiagonal with
diagonal $2$ except for the corner entry $2+1=3$, which is the first assertion.
Reading the rows as a recurrence, row $0$ is $2u_0-u_1=\mu u_0$, i.e.\ the
convention $u_{-1}=0$, and row $h-1$ is $-u_{h-2}+3u_{h-1}=\mu u_{h-1}$, i.e.\
$-u_{h-2}+2u_{h-1}-u_h=\mu u_{h-1}$ with $u_h=-u_{h-1}$.
For the eigenpairs, put $u_r=\sin(\omega(r+1))$. Then $u_{-1}=0$ and the
interior recurrence holds with $\mu=2-2\cos\omega=4\sin^{2}(\omega/2)$. The
inner condition $u_h=-u_{h-1}$ reads
$\sin(\omega(h+1))+\sin(\omega h)=2\sin\bigl(\tfrac{\omega N}2\bigr)
\cos\bigl(\tfrac\omega2\bigr)=0$, and since $0<\omega<\pi$ the second factor is
positive, so $\omega N/2=k\pi$, i.e.\ $\omega=2k\pi/N$ and
$\mu=4\sin^{2}(k\pi/N)$. The values $k=1,\dots,h$ give $h$ distinct eigenvalues,
hence all of them. For the normalisation,
$\sum_{r=0}^{N-1}\sin^{2}(2\pi kr/N)=N/2$, the term $r=0$ vanishes, and the
remaining $2h$ terms pair up as $r\leftrightarrow N-r$ with equal values, so
$\sum_{r=1}^{h}\sin^{2}(2\pi kr/N)=N/4$ and the factor $2/\sqrt N$ normalises.
Orthogonality is symmetry of $L_P$ together with simplicity of the spectrum.
Finally $\sin t\le t$ on $[0,\pi/2]$ gives
$\mu_1\le4\pi^{2}/N^{2}$, which is \eqref{eq:gap}; the last inequality is
$N=2h+1>2h$.
\end{proof}
The spectrum \eqref{eq:kms} is the classical Kac--Murdock--Szeg\H{o} spectrum of
the second difference in the reflection-odd sector \cite{KMS1953}, and $\mu_1$
is its spectral gap. Everything in Sections~\ref{sec:tvfloor} and
\ref{sec:gauge} is driven by \eqref{eq:gap} and by nothing else.
\subsection{The raw Gram block, the normalised block, and the ladder}
\label{sec:gram}
Fix $K\le h$ (the verified surfaces use $K=16$; nothing below depends on the
value). With $\{t_k\}$ of Lemma~\ref{lem:kms} put
\begin{equation}
\label{eq:gram}
\ah_{ij}=t_i^{\T}At_j,
\qquad
\Ah_K=(\ah_{ij})_{i,j\le K},
\qquad
G=\MM^{-1/2}\Ah_K\MM^{-1/2},
\qquad \MM=\diag(\mu_1,\dots,\mu_K),
\end{equation}
write $G_k$ for the leading $k\times k$ block of $G$, and
\begin{equation}
\label{eq:ladder}
g_k=e_1^{\T}G_k^{-1}e_1\quad(k=1,\dots,K),
\qquad
s=\mu_1\,t_1^{\T}A^{-1}t_1 .
\end{equation}
The following three facts are classical; we record them in the form used later.
\begin{lemma}[interlacing]
\label{lem:interlacing}
Let $X\in\R^{n\times n}$ be symmetric and $P\in\R^{n\times m}$ an isometry.
Then the eigenvalues of $P^{\T}XP$ interlace those of $X$; in particular
$\lmin(X)\le\lmin(P^{\T}XP)$. Consequently a $K$-truncated Rayleigh minimum is
an upper bound for $\lmin$ and never a lower bound.
\end{lemma}
\begin{proof}
Cauchy's interlacing theorem \cite{Cauchy1829} in the Courant--Fischer form
\cite{CourantFischer1920}.
\end{proof}
\begin{lemma}[Schur nesting]
\label{lem:nesting}
Let $X\PD$ be partitioned as
$\bigl[\begin{smallmatrix}\xi&b^{\T}\\ b&Y\end{smallmatrix}\bigr]$ with
$\xi\in\R$. Then $Y\PD$ and
\begin{equation}
\label{eq:schur}
\frac1{(X^{-1})_{11}}=\xi-b^{\T}Y^{-1}b,
\qquad
(X^{-1})_{11}=\frac{\det Y}{\det X} .
\end{equation}
\end{lemma}
\begin{proof}
The first identity is the Schur complement of the $(1,1)$ pivot
\cite{Schur1917,Haynsworth1968}; the second is Jacobi's formula for a cofactor
of the inverse, i.e.\ Cramer's rule.
\end{proof}
\begin{lemma}[constrained minimum]
\label{lem:constrained}
Let $X\PD$ be $k\times k$. Then
\begin{equation}
\label{eq:constrmin}
\min\{u^{\T}Xu:\ u\in\R^{k},\ u_1=1\}
=\frac1{e_1^{\T}X^{-1}e_1},
\end{equation}
attained exactly at $u^{\star}=X^{-1}e_1/(e_1^{\T}X^{-1}e_1)$. Equivalently,
\emph{every} admissible $u$ gives $u^{\T}Xu\ge1/(e_1^{\T}X^{-1}e_1)$: an
explicit trial vector is a certified lower bound for the reciprocal, never an
upper one.
\end{lemma}
\begin{proof}
Write $u=u^{\star}+\delta$ with $\delta_1=0$. Since
$Xu^{\star}=e_1/(e_1^{\T}X^{-1}e_1)$, the cross term is
$2\delta^{\T}Xu^{\star}=2\delta_1/(e_1^{\T}X^{-1}e_1)=0$, so
$u^{\T}Xu=(u^{\star})^{\T}Xu^{\star}+\delta^{\T}X\delta$ and
$(u^{\star})^{\T}Xu^{\star}=(u^{\star})^{\T}e_1/(e_1^{\T}X^{-1}e_1)
=1/(e_1^{\T}X^{-1}e_1)$ because $u^{\star}_1=1$. As $X\PD$ the remainder is
positive unless $\delta=0$.
\end{proof}
\begin{proposition}[three forms of the ladder]
\label{prop:cascade}
Assume $G\PD$ and let $G=LL^{\T}$ be its Cholesky factorisation,
$y=L^{-1}e_1$. Then for every $k\le K$:
\begin{align}
\label{eq:prefix}
\text{(prefix)}\qquad & g_k=\sum_{j\le k}y_j^{2};\\
\label{eq:minor}
\text{(minor)}\qquad & \frac1{g_k}
=\frac{\det\Ah_{[1..k]}}{\mu_1\,\det\Ah_{[2..k]}}
\qquad(\det\Ah_{[2..1]}:=1);\\
\label{eq:regression}
\text{(regression)}\qquad & \frac{g_k}{g_1}=\frac1{1-R_k^{2}},
\qquad R_k^{2}=\frac{b^{\T}G_{HH}^{-1}b}{G_{11}},
\end{align}
where in \eqref{eq:regression} the block $G_k$ is partitioned as
$\bigl[\begin{smallmatrix}G_{11}&b^{\T}\\ b&G_{HH}\end{smallmatrix}\bigr]$ with
$H=\{2,\dots,k\}$. In particular $k\mapsto g_k$ is nondecreasing, strictly
increasing whenever $y_k\ne0$, and $R_k^{2}\in[0,1)$ is the squared multiple
correlation of the first coordinate on the remaining $k-1$.
\end{proposition}
\begin{proof}
\emph{Prefix.} For a Cholesky factorisation the leading $k\times k$ block of $G$
is $L_kL_k^{\T}$ with $L_k$ the leading block of $L$, so
$g_k=e_1^{\T}L_k^{-\T}L_k^{-1}e_1=\lVert L_k^{-1}e_1\rVert^{2}$; and since $L$
is lower triangular, forward substitution gives
$L_k^{-1}e_1=(L^{-1}e_1)_{1:k}=y_{1:k}$. Monotonicity is immediate.
\emph{Minor.} By \eqref{eq:schur},
$g_k=\det G_{[2..k]}/\det G_{[1..k]}$. Substituting
$G=\MM^{-1/2}\Ah_K\MM^{-1/2}$ gives
$\det G_{[1..k]}=\det\Ah_{[1..k]}/\prod_{j\le k}\mu_j$ and
$\det G_{[2..k]}=\det\Ah_{[2..k]}/\prod_{2\le j\le k}\mu_j$, and all factors
cancel except $\mu_1$, which yields \eqref{eq:minor}.
\emph{Regression.} By \eqref{eq:schur}, $1/g_k=G_{11}-b^{\T}G_{HH}^{-1}b
=G_{11}(1-R_k^{2})$, while $g_1=1/G_{11}$; divide.
\end{proof}
\begin{lemma}[diagonal invariance of the ladder gain]
\label{lem:diaginv}
For every positive diagonal $\Lambda=\diag(d_1,\dots,d_K)$ the gain
$g_k/g_1=G_{11}\,(G_k^{-1})_{11}$ is unchanged under $G\mapsto\Lambda G\Lambda$.
\end{lemma}
\begin{proof}
$(\Lambda G\Lambda)_{11}=d_1^{2}G_{11}$ and
$\bigl((\Lambda G\Lambda)_k^{-1}\bigr)_{11}=d_1^{-2}(G_k^{-1})_{11}$; the
product is invariant.
\end{proof}
Lemma~\ref{lem:diaginv} localises the phenomenon: the gain does not see the
$\mu^{-1/2}$ normalisation of \eqref{eq:gram} at all, so whatever makes
$g_K/g_1$ large is a property of the raw Gram block $\Ah_K$ alone, and the
parity spectrum enters it only through the choice of the modes.
\begin{proposition}[direction of the ladder]
\label{prop:direction}
Assume $\Ah_h\PD$, i.e.\ $A\PD$ on the parity sector. Then
\begin{equation}
\label{eq:direction}
s\;\ge\;g_K\;\ge\;g_1=\frac1{G_{11}},
\qquad\text{equivalently}\qquad
\frac1s\;\le\;\frac1{g_K}\;\le\;\frac1{g_1},
\end{equation}
with every ladder increment $g_{k+1}-g_k\ge0$. The hypothesis is used only for
the Cholesky factorisation of Proposition~\ref{prop:cascade} and is, on the
surfaces of Section~\ref{sec:numerics}, certified per window.
\end{proposition}
\begin{proof}
Let $T=[t_1,\dots,t_h]$, so $T$ is orthogonal and $\Ah_h=T^{\T}AT$. Then
$A^{-1}=T\Ah_h^{-1}T^{\T}$, hence
$t_1^{\T}A^{-1}t_1=(\Ah_h^{-1})_{11}$; and with
$\MM_h=\diag(\mu_1,\dots,\mu_h)$ and $G^{(h)}=\MM_h^{-1/2}\Ah_h\MM_h^{-1/2}$
one has $\bigl((G^{(h)})^{-1}\bigr)_{11}=\mu_1(\Ah_h^{-1})_{11}$, i.e.\
$s=g_h$. Now apply \eqref{eq:prefix}: $g_k$ is a partial sum of squares, so
$g_1\le g_K\le g_h=s$.
\end{proof}
\subsection{Lag weights, the gauge law, and the boundary-free swap}
\label{sec:lag}
Let $v\in\R^{h}$ and define the \emph{lag weights} of $v$ by
\begin{equation}
\label{eq:weights}
w_0=\Ac_0(v),
\qquad
w_d=2\Ac_d(v)-\Cv_{M-1-d}(v)\quad(1\le d\le M-1),
\qquad w_M:=0 ,
\end{equation}
with $\Ac,\Cv$ as in \eqref{eq:accv}, and put $(\Delta w)_d=w_d-w_{d+1}$ and
$\TV=\lVert\Delta w\rVert_1=\sum_{d=0}^{M-1}|(\Delta w)_d|$. For an admissible
$x$ we write $w(x)$, $\TV(x)$ for the weights and total variation of the window
vector $v=\sum_{k\le K}a_kt_k$, $a_k=x_k/\sqrt{\mu_k}$.
\begin{lemma}[the weights represent the form; the gauge law]
\label{lem:gauge}
For every $v\in\R^{h}$ and every lag sequence $c$,
\begin{equation}
\label{eq:represent}
v^{\T}Av=\sum_{d=0}^{M-1}c_d\,w_d,
\qquad
w_0=\lVert v\rVert^{2},
\qquad
\sum_{d=0}^{M-1}w_d=0 .
\end{equation}
In particular, for an admissible $x$, $Q(x)=x^{\T}Gx=v^{\T}Av=\sum_dc_dw_d(x)$.
\end{lemma}
\begin{proof}
By \eqref{eq:Adef},
$v^{\T}Av=\sum_{r,r'}v_rv_{r'}c_{|r-r'|}-\sum_{r,r'}v_rv_{r'}c_{M-1-r-r'}$. The
first sum collects the lag $d=|r-r'|$ with multiplicity $1$ for $d=0$ and $2$
for $d\ge1$, i.e.\ it equals $c_0\Ac_0(v)+2\sum_{d\ge1}c_d\Ac_d(v)$. The second
sum collects the index $d=M-1-r-r'$, and
since $r,r'\le h-1$ we have $r+r'\le M-2$, so $d\ge1$ throughout and the
coefficient of $c_d$ is $\Cv_{M-1-d}(v)$. This is the first identity of
\eqref{eq:represent} with the weights \eqref{eq:weights}, and it also shows
$w_0=\Ac_0(v)=\lVert v\rVert^{2}$: the reflection term cannot reach $d=0$.
For the gauge law, sum \eqref{eq:weights}. Over all $d\ge0$,
$\Ac_0(v)+2\sum_{d\ge1}\Ac_d(v)=\bigl(\sum_rv_r\bigr)^{2}$, and as $d$ runs
through $1,\dots,M-1$ the index $j=M-1-d$ runs through $0,\dots,M-2=2h-2$, so
$\sum_{d\ge1}\Cv_{M-1-d}(v)=\sum_{j=0}^{2h-2}\Cv_j(v)
=\bigl(\sum_rv_r\bigr)^{2}$. The two contributions cancel.
\end{proof}
The gauge law has a consequence we use once: since $\sum_dw_d=0$, the value
$\sum_dc_dw_d$ is unchanged if a constant is added to every $c_d$. So the
representation \eqref{eq:represent} determines the form only up to an additive
normalisation of $c$, and any bound obtained from it may be optimised over that
normalisation.
\begin{lemma}[boundary-free summation by parts]
\label{lem:abel}
With $C_d=\sum_{e\le d}c_e$, $C_{-1}=0$, and $w_M=0$,
\begin{equation}
\label{eq:abel}
\sum_{d=0}^{M-1}c_d\,w_d\;=\;\sum_{d=0}^{M-1}C_d\,(\Delta w)_d
\end{equation}
with no boundary term at either end.
\end{lemma}
\begin{proof}
Substituting $c_d=C_d-C_{d-1}$,
\[
\sum_{d=0}^{M-1}c_dw_d
=\sum_{d=0}^{M-1}C_dw_d-\sum_{d=0}^{M-1}C_{d-1}w_d
=\sum_{d=0}^{M-1}C_dw_d-\sum_{d=0}^{M-2}C_dw_{d+1}
=\sum_{d=0}^{M-1}C_d(w_d-w_{d+1}),
\]
where the second equality shifted the index and used $C_{-1}=0$, and the third
used $w_M=0$ to absorb the last term.
\end{proof}
This is Abel's summation by parts \cite{Abel1826}. Both boundary terms vanish
for structural reasons and not by a choice: $C_{-1}=0$ by definition of a
partial sum, and $w_M=0$ because both terms of \eqref{eq:weights} vanish at
$d=M$.
\section{The total-variation floor}
\label{sec:tvfloor}
\begin{theorem}[the total-variation floor]
\label{thm:tvfloor}
Let $x\in\R^{K}$ be admissible, i.e.\ $x_1=1$, and let $w=w(x)$ be the lag
weights of $v=\sum_{k\le K}a_kt_k$, $a_k=x_k/\sqrt{\mu_k}$. Then
\begin{equation}
\label{eq:tvfloor}
\TV(x)\;\ge\;|w_0|\;=\;\lVert v\rVert^{2}\;=\;\lVert a\rVert^{2}
\;\ge\;\frac1{\mu_1}\;=\;\frac1{4\sin^{2}(\pi/N)}
\;\ge\;\frac{N^{2}}{4\pi^{2}} .
\end{equation}
The bound involves no comb node, no taper and no truncation, and it holds for
every lag sequence $c$ --- indeed the left- and right-hand sides do not depend
on $c$ at all.
\end{theorem}
\begin{proof}
Four steps.
\emph{(i) $w_0=\lVert a\rVert^{2}$.} By Lemma~\ref{lem:gauge},
$w_0=\lVert v\rVert^{2}$; and $\lVert v\rVert^{2}=\lVert a\rVert^{2}$ because
$\{t_k\}$ is orthonormal (Lemma~\ref{lem:kms}).
\emph{(ii) $\TV\ge|w_0|$.} With $w_M=0$ the increments telescope:
$\sum_{d=0}^{M-1}(\Delta w)_d=w_0-w_M=w_0$. Hence
$|w_0|\le\sum_{d=0}^{M-1}|(\Delta w)_d|=\TV$.
\emph{(iii) $\lVert a\rVert^{2}\ge1/\mu_1$.} Admissibility gives
$a_1=x_1/\sqrt{\mu_1}=1/\sqrt{\mu_1}$, so
$\lVert a\rVert^{2}\ge a_1^{2}=1/\mu_1$.
\emph{(iv) $1/\mu_1\ge N^{2}/(4\pi^{2})$.} This is \eqref{eq:gap}, i.e.\
$\sin t\le t$.
\end{proof}
Three features of \eqref{eq:tvfloor} are worth separating. It is a statement
about the \emph{normalisation}, not about the form: step (iii) is the only place
where admissibility is used, and it is where the whole $h^{2}$ comes from. It is
a statement about the \emph{sector}: step (i) uses orthonormality of the parity
modes and step (iv) uses their spectrum, both of which are the classical
Kac--Murdock--Szeg\H{o} data \cite{KMS1953}. And it is \emph{closed}: no
constant is fitted, no window is excluded, and the right-hand side is an
elementary function of $h$.
\begin{corollary}[the price]
\label{cor:price}
For every admissible $x$,
\begin{equation}
\label{eq:price}
\frac{|Q(x)|}{\TV(x)}\;\le\;\mu_1\,|Q(x)| .
\end{equation}
Consequently, if a family of admissible trial vectors has values bounded by
$|Q(x)|\le U$ with $U$ independent of $h$, the ratio it certifies is at most
$U\mu_1=O(h^{-2})$.
\end{corollary}
\begin{proof}
By Theorem~\ref{thm:tvfloor}, $\TV(x)\ge1/\mu_1>0$, so
$1/\TV(x)\le\mu_1$; multiply by $|Q(x)|\ge0$. The consequence is
$\mu_1=4\sin^{2}(\pi/N)\le4\pi^{2}/N^{2}$.
\end{proof}
Corollary~\ref{cor:price} is the load-bearing statement of the section. It says
that the pair (value, total variation) cannot be improved by choosing a better
trial vector: the ratio is pinned by the value alone, up to the spectral gap.
Any route whose output is the ratio therefore pays a factor $h^{-2}$ that is a
property of the parity spectrum meeting the normalisation, and not a property of
the comb.
\begin{corollary}[what summation by parts can certify]
\label{cor:holder}
For every admissible $x$,
\begin{equation}
\label{eq:holder}
|Q(x)|\;\le\;\Bigl(\max_{0\le d\le M-1}|C_d|\Bigr)\,\TV(x),
\qquad\text{hence}\qquad
\max_{d}|C_d|\;\ge\;\frac{|Q(x)|}{\TV(x)} .
\end{equation}
Combined with \eqref{eq:price}, a family of bounded value certifies
$\max_d|C_d|\ge$ a quantity that is $O(h^{-2})$, and nothing stronger. By the
gauge law of Lemma~\ref{lem:gauge} the estimate may be applied to $c+\gamma$ for
any $\gamma\in\R$, so $\max_d|C_d|$ may be replaced by
$\inf_{\gamma}\max_d|C_d+\gamma(d+1)|$.
\end{corollary}
\begin{proof}
Lemma~\ref{lem:abel} and H\"older: $|\sum_dC_d(\Delta w)_d|
\le\max_d|C_d|\cdot\lVert\Delta w\rVert_1$. The final sentence is the remark
after Lemma~\ref{lem:gauge}, since replacing $c_d$ by $c_d+\gamma$ leaves
$Q$ unchanged and replaces $C_d$ by $C_d+\gamma(d+1)$.
\end{proof}
\begin{corollary}[the floor at one coordinate]
\label{cor:abis}
For every $v\in\R^{h}\setminus\{0\}$ with $t_1^{\T}v\ne0$,
\begin{equation}
\label{eq:abis}
\frac{\TV(v)}{(t_1^{\T}v)^{2}}\;\ge\;1,
\qquad\text{because}\qquad
\TV(v)\;\ge\;|w_0|=\lVert v\rVert^{2}\;\ge\;(t_1^{\T}v)^{2} .
\end{equation}
No normalisation is required: \eqref{eq:abis} holds for every window vector, and
for admissible $x$ it reduces to \eqref{eq:tvfloor} because
$(t_1^{\T}v)^{2}=a_1^{2}=1/\mu_1$.
\end{corollary}
\begin{proof}
The first two relations are steps (i)--(ii) of Theorem~\ref{thm:tvfloor}, which
used no admissibility; the third is Cauchy--Schwarz with $\lVert t_1\rVert=1$.
\end{proof}
\begin{remark}[negative control: the floor is a property of the normalisation]
\label{rem:negcontrol}
Step (iii) is the only step that uses $x_1=1$, and it is indispensable: for
$\lambda\ne0$ the vector $\lambda x$ has $\TV(\lambda x)=\lambda^{2}\TV(x)$
(both $\Ac$ and $\Cv$ are quadratic in $v$, and $v$ is linear in $x$), so
$\mu_1\TV(\lambda x)=\lambda^{2}\mu_1\TV(x)$ falls below $1$ as soon as
$|\lambda|$ is small enough. An inadmissible vector therefore undercuts the
floor, and recognising it as inadmissible is the whole content of the
observation. This is also the reason Theorem~\ref{thm:gauge} below is a
statement about rays.
\end{remark}
\begin{measurement}[sharpness of the floor]
\label{meas:sharpness}
On Surface~II of Section~\ref{sec:numerics} --- $27$ windows of the frame-A
family, $h=142$ to $1445$, all with $\cond(G)\le10^{12}$ --- the floor of
Theorem~\ref{thm:tvfloor} is tight to about one order of magnitude: the measured
ratio is
\begin{equation}
\label{eq:sharp}
\mu_1\,\TV(x)\in[5.00,\ 23.20]
\end{equation}
at the optimiser of the declared trial family, while the floor itself takes the