Bounded slab operators in every character chamber
The operator estimates needed in reconstruction hold at every character of the compression algebra. Their proof does not require discarding exceptional characters. We give the power argument, including the step that removes a character-dependent constant. Let map the algebraic span of future words into its reflection-positive Hilbert completion. Let
satisfy
Searchable transcription
⟨XAv, Xw⟩= ⟨Xv, XBw⟩.
Set. Suppose
0 and, for every
, there is a finite constant
such that
Searchable transcription
∥XT nv∥≤CvD2n (n ≥0). (ST1)
The constant need not be uniform in. The adjoint relation implies symmetry of
, and then of each power, relative to this Gram form. Put
Searchable transcription
dn = ∥XT nv∥D−2n, s = sup n≥0 dn.
The supremum is finite by (ST1). Symmetry and Cauchy–Schwarz give
Searchable transcription
d2 n = D−4n|⟨Xv, XT 2nv⟩| ≤∥Xv∥d2n ≤∥Xv∥s.
Taking the supremum shows, hence
. Finally,
Searchable transcription
∥XAv∥2 = |⟨Xv, XTv⟩| ≤∥Xv∥∥XTv∥≤D2∥Xv∥2. (ST2)
Thus descends through the null space and extends to a bounded operator of norm at most
on the Hilbert completion. Apply this to insertion of a slab word and insertion of its reflected word. Translation invariance of the hierarchy gives the displayed adjoint relation. Starting with a future word
, denote by
the word obtained by adjoining
successive reflected/unreflected slab pairs. It suffices to have
Searchable transcription
| Gram(vn, vn)| ≤QvD4n. (ST3)
Searchable transcription
For a scalar multiple av, the Hilbert norm bound is |a|√QvD2n. A finite linear combination has (ST1) by the triangle inequality, with constant equal to the corresponding finite sum. Hence a diagonal estimate on individual words really does produce a bounded operator on their entire dense span. This proves the slab operator construction without assuming boundedness beforehand. To obtain (ST3) in a character chamber, let U be the slab operator in the unselected chamber and let Xv be its ground-space word map. Concatenation says
Searchable transcription
Xenter(w,v) = UXv,
while reflection givesfor the reflected slab. Therefore
Searchable transcription
Xvn = (U∗U)nXv, ∥Xvn∥≤∥Xv∥∥U∥2n.
Searchable transcription
Let χ be the chosen continuous character of the closed compression algebra. The character chamber receives the scalar Gram values of that algebra, and the compressed two-sided word is X∗ vXv. Consequently | Gramχ(v, v)| = |χ(X∗ vXv)| ≤∥χ∥∥Xv∥2.
For any, substitution of
proves (ST3) with
. The power argument removes this prefactor, producing a character-chamber slab operator of norm at most
All the operators obtained for differentagree on the dense future-word span, where their action is prescribed by insertion. They are therefore the same bounded operator. Letting
proves the exact estimate
(ST4)
This also covers= 0. Every unselected arbitrary-copy estimate thus transfers with its original constants to every character, uniformly over the character space.
For each character construct its reflection-positive chamber, these bounded slab maps, and the derivative calculus inherited by the character hierarchy. The transferred arbitrary-copy estimates give the slab laws required to form its contour and strict waves. Apply the field reconstruction to those data to obtain its Hilbert space and fields, with the common conjugation and rotation labels. At the previously selected character, choose the already constructed chamber, slab maps, contour and fields themselves. This is legitimate because they satisfy the same requirements; consequently no comparison between independently chosen copies is needed there. The resulting family supplies the common phasewise operator bounds used in the strict-wave polynomial estimates and in passage to the tested Wightman boundaries. The remaining contour and field construction is developed below; vacuum uniqueness is a separate conclusion and is not assumed in this step.
Centered insertions and the strict-time waves
Write) for the chamber’s heat contraction,
) for its holomorphic contraction semigroup on
0, and
) for spatial translation. Thus
) for
0; translations commute with the heat flow and fix the unit vacuum Ω. For a field label
and
0, define its centered, buffered insertion by the bounded slab operator