Home·The theorem·The proof in one reading·Architecture·Units·Manuscript·Glossary·FAQ·Work items·Data·Method·Provenance·Changes
← IV.1 Infinite volume: extraction of a subsequence and the Euclidean axioms of the limit (notes)Part V·Unit outlineV.2 Osterwalder-Schrader reconstruction of a Wightman theory (notes) →

V.1. Decomposition of the limit into phases — detailed notes

Contents

1. What this unit proves 1

2. What it uses 7

3. Strategy 9

4. Steps 10

4.1 OS space, chambers, spectral calculus 10

4.2 Slab operators 12

4.3 The compressed algebra 13

4.4 Phase reflection and rotation invariance 14

4.5 The phase tables 16

4.6 Null spaces of the phases 17

4.7 Choosing a phase 18

5. Where the difficulty lies 20

6. Notation 21

7. What remains unexplained 22

The full account of unit V.1: every proposition with its proof sketch, checked against the Lean in two rounds and edited. The condensed outline and the map of the Lean are on the unit page.

Unit page · All units · Overview

Part: V, phases and reconstruction. Lean: YM/OS, YM/Phase, YM/Ground, YM/Heat, YM/SNAG, YM/Paley, YM/Spectral, the work items B01–B18 in YM/Work, and the assembly files Bid/Phase.lean, Bid/Fetch.lean, Bid/Market.lean, Org/Phase.lean. Size: about 5,700 lines in declarations used by the main theorem, including about 2,700 in B01–B18, plus the assembly files.

1. What this unit proves

Setting and notation.

Nowhere does the unit assume clustering, a unique vacuum or a spectral gap.

Proposition V.1.1 (chambers and ground space). Let \(S\) satisfy the Euclidean hierarchy and let \(a\) be a coordinate axis. Then:

Status: theorem. Lean: OS.realization, OS.implement, OS.Semigroup.emerges; definitions OS.Chamber, OS.Semigroup, Semigroup.ground.

Proposition V.1.2 (spectral calculus in a chamber). In a chamber, write formally \(E_t = e^{- tH}\).

\(\displaystyle \langle \psi, V (x) \hspace{0.17em} e^{i (\text{Re} \hspace{0.17em} z) H} E_{\text{Im} \hspace{0.17em} z} \hspace{0.17em} \psi \rangle = \int e^{ip \cdot x} \hspace{0.17em} e^{ip^a z} \hspace{0.17em} d \mu_{\psi} (p) .\)

Status: theorem. It holds for every semigroup with the properties of V.1.1. No gap is assumed or proved. Lean: Semigroup.edge, Semigroup.unit, Spectral.Orbit.total, Orbit.P, Semigroup.nonneg, Semigroup.heat.

Proposition V.1.3 (slab operators). Assume the hierarchy and the bench (V.1.7). Then every chamber of \(S\) for the time axis carries a unique family of bounded operators \(T_d (w)\), one for each \(d > 0\) and each word \(w\) in the slab \((0, d)\), with

\(\displaystyle T_d (w) \hspace{0.17em} |b \rangle = |w \cdot \tau_d b \rangle \qquad \text{for every positive word } b.\)
\(\displaystyle \|T_d (w)\| \leqslant C^{|w|} (|w| / r)^{\kappa |w|}\)

for every \(d > 0\), every \(r \in (0, 1]\), and every word \(w\) that is \(r\)-buffered in \((0, d)\) with degrees \(\leqslant D\) and label norms \(\leqslant \rho\). The right side is \(1\) for the empty word.

Status: theorem, given the bench. More generally, smoothness follows for any slab family with the all-copy bound on a time-axis chamber of a table \(S'\) that satisfies the hierarchy, respects \(S\), and satisfies the derivative identities of the plan on \(S\). Lean: Work.B01.answer, Work.B02.answer; definitions Spread, Spread.AllCopy, Spread.Laws.

Proposition V.1.4 (the compressed vacuum algebra). Assume the hierarchy and \(O (4)\)-covariance of \(S\). Fix a time-axis chamber and any family \(T_d (w)\) with the defining identity of V.1.3. Then:

Status: theorem. Lean: Ground.inert, Ground.overline, Ground.almost, Spread.insertValue, Ground.arcs, Ground.adjunction, Ground.full, Ground.attains, Work.B03.answer, Work.B12.answer; definitions Ground.M, Spread.algebra, Bid.Theme.

Proposition V.1.5 (decomposition into phases). Assume the setting of V.1.4(a)–(e). Then:

\(\displaystyle \int_X S^{\xi} (w) \hspace{0.17em} d \nu (\xi) = S (w) \qquad \text{for every separated word } w.\)

Status: theorem. Lean: Ground.resolution, Work.B07.state, Resolution.barycenter; definitions Spread.Resolution, Resolution.Out, Resolution.receives.

Proposition V.1.6 (every phase satisfies the hierarchy and the field laws). In addition to V.1.3–V.1.5 (with the smoothness laws for the plan of the field algebra), assume:

Then two operator identities hold before any character is applied:

As a consequence, for every \(\xi \in X\):

\(\displaystyle |S^{\xi} (w) | \leqslant K^{|w|} (|w| / r)^{\kappa |w|}\)

for all \(\xi\), all \(r \in (0, 1]\), and all words with degrees \(\leqslant D\), label norms \(\leqslant \rho\) and points at mutual sup-distance \(\geqslant r\).

Status: theorem. Lean: Work.B05.answer, B06.answer, B07.answer, B08.answer, B09.answer, B10.answer, B11.answer, Retain.lift_detect; definitions Phase.reflects, Bid.Garland, Phase.Scripts.

Proposition V.1.7 (bench). For every \(D \in \mathbb{N}\) and \(\rho > 0\) there are \(C_0 > 0\) and \(\kappa \in \mathbb{N}\) with the following property. Let \(d > 0\), \(r \in (0, 1]\), and let \(w \neq \emptyset\) be \(r\)-buffered in \((0, d)\), with degrees \(\leqslant D\) and label norms \(\leqslant \rho\). Then there are a lattice level \(b\) and a width \(s \leqslant d\) with \(s \in a_b \mathbb{N}\) and \(w\) in the slab \((0, s)\), such that every positive word \(v\) has a constant \(B_v\) with

\(\displaystyle | S (\Theta v_n \cdot v_n) | \leqslant B_v \hspace{0.17em} A^{4 n} (n \geqslant 0), \qquad A = C_0^{|w|} (|w| / r)^{\kappa |w|}, \qquad v_0 = v, v_{n + 1} = \tau_s (\Theta w) \cdot \tau_s (w \cdot \tau_s v_n) .\)

Here \(v_n\) is \(v\) preceded by \(2 n\) consecutive slabs of width \(s\), holding alternately \(w\) and its reflection. Thus \(|v_n \rangle = (T_s (w)^{\ast} T_s (w))^n |v \rangle\) once \(T_s (w)\) exists, and \(S (\Theta v_n \cdot v_n)\) is a reflection-symmetric train of \(4 n\) copies of \(w\).

Status: a hypothesis of this unit, required of every limit table with a Seed. It is proved in VII.4 (Next.Phase.seats) from the cutoff family, the hierarchy, the point limits and the cell hypothesis of the Seed.

Lean: Bid.Bench, Bid.Seats, OS.QRead, Next.Phase.replicas, Next.Phase.rates.

Proposition V.1.8 (vacuum uniqueness in almost every phase). Let \((X, \nu, \chi)\) and \(S^{\xi}\) be as in V.1.5, with every \(S^{\xi}\) satisfying the hierarchy. For each \(\xi\) fix a time-axis chamber of \(S^{\xi}\), with vacuum \(\Omega_{\xi}\) and ground space \(\mathcal{H}_0^{\xi}\). Then:

Status: theorem. Uniqueness for every phase is proved later, in V.3 (EveryPhase.every), by an argument outside this unit. Lean: Cluster.exp_real, Cluster.lifts, Cluster.selects, Work.B13.answer, Work.B14.answer; definition Chamber.UniqueHeat.

Proposition V.1.9 (selected-phase certificate). Let \(C\) be a Wilson family with extraction order \(f\) and limit table \(S\). Assume:

Then there are:

Status: theorem.

Lean: definitions Phase.Loom, Phase.Stall, Phase.Vendor, OS.Selection, Selection.Certificate, Spec.Materializes.

2. What it uses

Standard mathematics.

Imported constants and assumptions.

3. Strategy

The limit table as a mixture. The table \(S\) is obtained by ordered limits of finite-volume Wilson correlations. Its OS semigroup may have a multidimensional ground space \(\mathcal{H}_0\). The unit decomposes the correlations through an algebra acting on that space.

Four inputs. Four inputs make this work, and each is used where the classical argument would use the measure.

Selecting a phase. For a positive word \(b\), the quantity \(\|P_0^{\xi} |b \rangle \|^2 - |S^{\xi} (b) |^2 \geqslant 0\) has \(\nu\)-integral zero. This follows by dominated convergence along \(E_s\) and the barycenter identity. One countable family of words is total in every phase chamber, so a single null set suffices, and outside it every phase has a one-dimensional ground space. The spectral calculus of V.1.2 (SNAG, positivity of the energy from analyticity of the heat semigroup) is built without assuming a gap and is used downstream (V.2, V.3).

4. Steps

4.1 OS space, chambers, spectral calculus

Lemma V.1.a (chamber). Under the hierarchy, V.1.1 holds except for the convergence \(E_t \to P_0\). Proof sketch.

Lean: OS.contract, OS.implement.

Lemma V.1.b (ground projection). For a semigroup of self-adjoint contractions, \(E_t \psi \to P_0 \psi\) for every \(\psi\). Proof sketch.

Lean: Semigroup.emerges.

Lemma V.1.c (real-time group and SNAG). V.1.2(a), (b) hold. Proof sketch.

Lean: Semigroup.roots_heat, Semigroup.pillar, Semigroup.edge, Semigroup.unit, Spectral.Orbit.total, Spectral.PVM.

Lemma V.1.d (spectrum condition and Laplace formula). V.1.2(c), (d) hold. Proof sketch.

Lean: Semigroup.altitude, Semigroup.nonneg, Semigroup.heat, Paley.supports, Paley.heat, Paley.Air.

4.2 Slab operators

Lemma V.1.e (power argument).

Proof sketch.

Lean: Drive.against, OS.size, OS.producer.

Lemma V.1.f (existence and all-copy bound; B01). The first part of V.1.3 holds. Proof sketch.

Lean: Work.B01.answer.

Lemma V.1.g (smoothness laws; B02).

Proof sketch.

Lean: Work.B02.answer, B02.norm_remainder, B02/Slab.

4.3 The compressed algebra

Lemma V.1.h (ground states are spatially invariant). Under the hierarchy and \(O (4)\)-covariance, \(U_y \psi = \psi\) for all \(\psi \in \mathcal{H}_0\). Proof sketch. Let \(p, q\) be positive words, \(y\) spatial, and \(u = y + e_t\).

Lean: Ground.inert, Ground.rays, Ground.across_axis, Ground.overtops.

Lemma V.1.i (the compression and its identities; B03). V.1.4(b) and (e), except separability, hold. Proof sketch.

Lean: Ground.at_any, Ground.overline, Ground.pins, Ground.slim, Work.B03.answer, Bid.depot.

Lemma V.1.j (cluster limits). V.1.4(c) holds. Proof sketch.

Lean: Ground.arcs, Ground.future_train, Ground.receives.

Lemma V.1.k (commutativity, cyclicity, separation). V.1.4(d) holds. Proof sketch. Write \(\langle q_1, \ldots, q_m \rangle = \langle \Omega, M (q_1) \cdots M (q_m) \Omega \rangle\).

Lean: Ground.same_up, Ground.exchanges, Ground.gens, Ground.adjunction, Ground.full, Ground.attains.

Lemma V.1.l (separability; Gelfand–Riesz; B12). \(\mathcal{A}\) is norm-separable, and the first part of V.1.5 holds. Proof sketch.

Lean: Work.B12.answer, Ground.resolution, Ground.tiny, Ground.supports.

4.4 Phase reflection and rotation invariance

Lemma V.1.m (grid passage; B04).

\(\displaystyle e_{ij} (t) = \text{Re} [S (w_i \cdot w_j) - S (w_i \cdot (\vartheta w)_j) - S ((\vartheta w)_i \cdot w_j) + S ((\vartheta w)_i \cdot (\vartheta w)_j)] .\)

Proof sketch. Expand the product into four point moments of the Wilson family. For large \(t\) the union of two translated grid words is generic, and the point limits of the Seed apply term by term. The reflection acts before the shift, so the shift stays outside it. Lean: Work.B04.answer, Grid.Expects, Grid.event.

Lemma V.1.n (phase reflection; B05).

Proof sketch.

\(\displaystyle 0 \leqslant \int \left( \sum_{j = 0}^q g_j \right)^2 \leqslant (q + 1) R_{\varkappa}^2 + 2 \sum_{0 \leqslant i < j \leqslant q} (\mathbb{E}_{N, p} [\text{Re} (f_i f_j)] + \delta_{\varkappa}) .\)

First take the ordered cutoff limit using V.1.m. Then let \(t \to \infty\); V.1.j gives \(e_{ij} (t) \to a\), so

\(\displaystyle 0 \leqslant (q + 1) (R_{\varkappa}^2 + q (a + \delta_{\varkappa})) .\)

Let \(q \to \infty\), then \(\varkappa \to \infty\). This gives \(a \geqslant 0\), hence \(D \Omega = 0\) and \(D = 0\) by V.1.k.

Lean: Work.B05.answer, B05.real_depot, Grid.horizon, Grid.estimates, Grid.Covering.square in Phase/Square.lean, Grid.anti.

Lemma V.1.o (invariance under \(O (4)\); B06). Given phase reflection and the rotation laws, \(M (w) = M (Kw)\) for all \(K \in O (4)\). Proof sketch.

Lean: Work.B06.answer, auxiliary lemmas in Work/B06.lean.

4.5 The phase tables

Lemma V.1.p (phase tables, symmetries, barycenter; B07).

Lean: Work.B07.answer, B07.state_spin, B07.state_smooth, Resolution.barycenter.

Lemma V.1.q (reflection positivity in every phase; B08). Every \(S^{\xi}\) is reflection positive for every axis, in point and smeared form. Proof sketch.

Lean: Work.B08.answer, B08.char_nonneg, B08.smear.

Lemma V.1.r (derivative, inclusion and stress laws in every phase; B09). Every \(S^{\xi}\) satisfies the inclusion and derivative identities of the plan and the stress-tensor Ward identities. Proof sketch.

Lean: Work.B09.answer, B09.has_evaluator, B09.Evaluates.flux.

Lemma V.1.s (caps in every phase; B10, B11).

Proof sketch.

Lean: Work.B11.answer, B11.phase_cap, Work.B10.answer, B10.capped_tags, Bid.OneCap.

4.6 Null spaces of the phases

Lemma V.1.t (moment bounds give bounds in every phase). Let \(\tau \geqslant 0\) and \(p \in \mathcal{A}\). If \(\langle \Omega, (p^{\ast} p)^n \Omega \rangle \leqslant \tau^{2 n}\) for every \(n \in \mathbb{N}\), then \(| \chi_{\xi} (p) | \leqslant \tau\) for every \(\xi\). Proof sketch.

Lean: Retain.bit, Retain.Tall.

Lemma V.1.u (detectors; B15–B18).

Proof sketch. Each detector is the cluster element \(c_E = \sum_i \lambda_i M (\text{word}_i)\) of a finite lattice episode \(E\), whose chessboard budget is \(\text{gap}_k\) (B18, from the corrected-field data). Then:

Lean: Work.B15.answer, B16.answer, B17.answer, B18.answer, Bid.episode; definitions Bid.Episode, Episode.Sold, Retain.Δone, Retain.Δtwo, Retain.Funds.

Lemma V.1.v (retention of null spaces). Assume the corrected-field data and detector bounds of V.1.u. If a table \(S'\) is symmetric, respects \(S\), and satisfies \(S' (w) = \chi_{\xi} (M (w))\) for every separated word and some fixed \(\xi\), then \(N_d (S') = N_d (S)\) for every \(d\). Proof sketch.

Lean: Retain.lift_detect, Retain.result, Retain.pair_near.

4.7 Choosing a phase

Lemma V.1.w (slab operators in a phase chamber; B13). For every \(\xi\), every time-axis chamber of \(S^{\xi}\) carries a slab family with \(\|T^{\xi}_d (w)\| \leqslant \|T_d (w)\|\). Proof sketch.

Lean: Work.B13.answer, B13.buys.

Lemma V.1.x (one countable family; B14). There is a single sequence \((b_k)\) of positive words, depending only on the label register and the time axis, whose vectors have dense linear span in every OS Hilbert space realizing the positive-word Gram form of a symmetric smooth table. Proof sketch.

Lean: Work.B14.universal, B14.answer.

Lemma V.1.y (almost every phase has a unique ground state).

Proof sketch.

Lean: Cluster.exp_real, Cluster.champ, Cluster.fits, Cluster.lifts, Cluster.selects.

Lemma V.1.z (assembly). V.1.9 holds. Proof sketch.

Lean: Bid.Looms, Phase.Loom.cleanse, Pert.withFinal.

5. Where the difficulty lies

Distinctive arguments.

Routine but long.

Unusual or worth checking.

  1. Selection. The selected phase comes from a measure-theoretic existence argument and is not canonical. No finite bound on the number of phases is asserted. V.3 later proves unique ground states for every phase.

  2. Sub-width in the bench. The bench gives the train bound only at a lattice-compatible width \(s \leqslant d\). The remaining width is absorbed by the contraction \(E_{d - s}\) (V.1.f).

  3. Which symmetries are used where.

  4. Scope of the certificate. Its unique-ground-state assertion concerns the time-axis chamber of the selected phase. It also records the hierarchy, field laws and null-space equality for every phase. The continuation linked to the selected Wightman realization uses that selected table.

  5. Smoothness hypothesis in B02. B02 needs the derivative identities of the table on which the slab family lives. For phases these come from B09, which uses the slab laws of \(S\), so the two applications of B02 are ordered.

6. Notation

object code name proposed notation
limit table, value on a word Table, S.expect w \(S = S^{\text{mix}}\), \(S (w)\)
OS reflection; linear time reflection of a word reflect w timeAxis; Grid.anti \(\Theta w\); \(\vartheta w\)
OS space, vector of a positive word GNS.H, GNS.plant \(\mathcal{H}\), \(\lvert b \rangle\)
chamber Chamber \((\mathcal{H}, E_t, U_y)\)
ground space, projection, vacuum Semigroup.ground, orth, omega0 \(\mathcal{H}_0\), \(P_0\), \(\Omega\)
real-time group; 4-parameter group; spectral measure edge; unit; Orbit.P \(e^{isH}\); \(V (x)\); \(P (dp)\)
slab, buffer Slab, buffer slab \((0, d)\), \(r\)-buffered
slab operators ("Spread") and all-copy bound Spread, place, AllCopy, Laws \(T_d (w)\); \(C^n (n / r)^{\kappa n}\)
bench, train bound Bench, Seats, QRead bench (V.1.7)
spatial invariance of \(\mathcal{H}_0\) Steady V.1.4(a)
compression; its multilinear form; algebra M, atom; depot; Spread.algebra \(M (w)\); \(M (x ; v)\); \(\mathcal{A}\)
identities of \(M\) ("Theme") Theme V.1.4(e)
phase reflection Phase.reflects \(M (w) = M (\vartheta w)\)
decomposition ("Resolution") Spread.Resolution, X, μ, character \(X\), \(\nu\), \(\chi_{\xi}\)
phase tables; their properties ensemble, Garland, Scripts \(S^{\xi}\)
\(S^{\xi}\) receives \(\chi_{\xi}\) Resolution.receives \(S^{\xi} (w) = \chi_{\xi} (M (w))\)
grid hypothesis, bounded approximants Org.Grill, Grid.Covering grid hypothesis
lattice episode, cluster element, budget Episode, cluster, Sold \(E\), \(c_E\)
detectors; moment bound Δone, Δtwo; Tall, Funds \(\Delta_1, \Delta_2\)
countable dense family Cluster.horizon \((b_k)\)
unique ground state UniqueHeat \(\mathcal{H}_0^{\xi} =\mathbb{C} \Omega_{\xi}\)
selected phase and certificate Selection, atPoint, Certificate, Materializes \(\xi_{\ast}\); V.1.9
bundles of obligations Loom, Stall, Vendor assembly assumptions

The measure \(\nu\) corresponds to \(\mu\) in the Lean.

7. What remains unexplained

  1. Ultraviolet inputs. The chessboard geometry below Next.Phase.travel_price belongs to VII.4. Its train estimate and the subsequent scale choice give the bench used here; the supporting packing argument remains outside this unit. The bounded-approximation input to Accent.grilled belongs to III.11. Its output has the cutoff-independent bounds required in V.1.n, but the underlying ultraviolet estimates and the production of the corrected-field data remain inputs.

  2. Order of limits. In V.1.n, fix the number of copies and approximation index, then fix a sufficiently large translation, take the ordered cutoff limit, and let the translation tend to infinity. Only then let the number of copies tend to infinity and the approximation error tend to zero. The detector argument similarly takes the cutoff limit before the large-translation limit and sends its budget slack to zero last.

  3. Later vacuum uniqueness. V.1.8 gives uniqueness almost everywhere, which suffices to select \(\xi_{\ast}\). The stronger result for every phase, EveryPhase.every, uses reconstruction in V.3; its proof is outside this unit.

  4. Placement of the spectral calculus. V.1.2 supplies V.2 and V.3 and can be placed at the start of reconstruction in the written proof. The \(O (4)\) action from VI.1 is needed only after the preliminary chamber and heat constructions.

  5. Bibliography. The reference locations marked “probable” in §2 need bibliographic verification.

← IV.1 Infinite volume: extraction of a subsequence and the Euclidean axioms of the limit (notes)Part V·Unit outlineV.2 Osterwalder-Schrader reconstruction of a Wightman theory (notes) →