Convergence of the interacting scale histories · Part 5

reset construction produces continuous coarse states), with the same retained choices, such that

Searchable transcription

T(b). eval = P β(Q(b))
i
(Q(b). eval),
|β(Q(b)) −β(T(b)) −s log Li| ≤di+1.
(FCA3)

The number is the fixed drift allowance of this stage. The output satisfies all level- local bounds before imposing its coupling band. This distinction permits the shooting argument to detect crossings of that band.

These forward families are obtained from the actual primitive formulas, rather than a choice of unrelated admissible outputs. At a step, keep one primitive construction, its ordinal and tree choice, and its fixed support dictionaries. Its output is the moment state produced by that primitive. The local integral comparison and the absolute activity estimates above prove continuity of the output in the stated budgets. The reset identity gives the density equality in (FCA3); its coupling bound gives the second inequality. For a continuous input curve these same formulas therefore define a continuous output curve. For two occurrences of the identical input state they give the identical output state: equality is equality of the represented moment states, including the activities. Choosing this rule once at each, and the startup rule (FCA2) once at, gives a single deterministic forward recipe. Its underlying path, clip, normalizers, source bounds and calendar remain those of the nonlinear construction. Restricting a parameter interval preserves every one of these properties.

To make the normalization in this construction explicit, write eval)( The positive push kernel and the retained positive vacuum give is the already committed path correction, the output coupling and scalar are

Searchable transcription

β(T(b)) = β(Q(b)) + αN,i + ∆(b),
v(T(b)) = log Hb(1)
| Sitei | .
(FCA9)

Searchable transcription

The scalar reset produces |∆(b)| ≤ri and θ2
i |∆(b)| ≤ei, where ri is its fixed correction radius and ei
its regular allowance. In the exact normalized splitting, the output trunk density times its attached-
log exponential is Hb(U)/Hb(1). Installing (FCA9) multiplies that density by exp(| Sitei |v) = Hb(1),
proving (FCA3) at every configuration, including flag boundaries. The site count, rather than the
bond count, is essential in this cancellation.
The correction in this construction is the source Hessian projection:

Searchable transcription

∆(b) = Averaging. delta
X. read(a(b))

.
(FCA10)

Here is the actual fixed source listing and) its parameterized source. The affine-curvature Hessian projection, rebates, faults and low-and high-path loan identities in the coupling-reset exponent section prove the exact all-configuration representation with this value of ∆. In particular the correction is not defined by solving a two-probe contrast equation. The projection’s diagonal bound gives ), where) is the paid regular source bound. The schedule pays 4 and the reset fees, giving the stated correction radius and the unit bound used in (DR7). The regular and forced bounds after the projection and the two dictionary fusions are paid independently by those same fees.

To see the normalization without an extra characterization of the correction, let) be the primitive scalar before reset and let 1) be its attached logarithms at the identity. The exact exponent calculation gives the installed scalar

Searchable transcription

v(b) = τ(b) −| Sitei |−1 X
j
lj(b, 1).
(FCA11)

The resulting state has regular entries zero at the identity, no identity flags, and kinetic and loop actions zero there. Its density at the identity is therefore The already proved all-configuration density identity makes this equal(1), proving the logarithmic formula in (FCA9). Thus (FCA9) and (FCA11) are the same scalar normalization. The interval estimate for this same projection value is obtained by the probe argument below. We must still show that this projected correction lies in the purchased correction interval. The source uses a nonflat probe for this purpose, on the very same trial family. Its activity terms are independent of the correction dial: they have already been computed with the Hessian projection value ∆. Only the scalar coupling varies in that trial. Thus there is no second reset algorithm.

Here is the probe construction, uniform in the even torus side. Fix the clip’s positive direct coefficient and its common cubic/quartic path bound0. A nonzero Lie-algebra direction gives a group curve through the identity with nonzero curvature derivative. Its chord is therefore positive somewhere; continuity and the intermediate value theorem give 0 such that every chord in [0] is attained. Put

Searchable transcription

t = min{ε, 1/4, a/[512(1 + C)]},
η = at2/4 > 0.
(RSP1)

Choose with chord. Set all links to the identity except direction-zero links whose directionone coordinate is even; set those links to This is periodic on every even side. Every (0 plaquette has holonomy or, and every plaquette has chord at most 4 Thus the field has no flags. Its direct plaquette charge in every signed-frame sum is at least where is the number of sites. The cubic and quartic terms have absolute sum per site at most 4, by (RSP1) and1. Averaging over the signed frames leaves

Searchable transcription

K(V ) ≥nηθ2 > 0,
(RSP2)

where is the actual kinetic action. No smallness of the loop tensor enters this lower bound. Write) for the actual transferred density at a fixed input parameter, and set On any flag-free configuration its early representation is

Searchable transcription

H(U) = exp{nτ −[β main(U) + α second(U) + loop(U)] −E(U)}.
(RSP3)

The source’s anchored regular budget is at most4, with = funds. Summing its anchors bounds4 at every flag-free configuration, including 1 and . Formula (RSP3) proves positivity at both probes and gives log4. Subtracting its two logarithms gives contrast error at most2 relative to main + second + loop.

On flag-free fields the main and loop actions equal their unmasked path expressions. The higher-order kinetic correction obeyssecond(. The stage’s cubic payment is 2. Therefore, with) the zero-coupling loop background,

Searchable transcription

|BK(V ) + L0(V ) −[log H(1) −log H(V )]| ≤nF.
(RSP4)

This is the actual contrast estimate, with its and loop terms retained. Let be the final regular allowance, 1] the correction radius. The reset price is chosen before history selection so that (RSP5)

This is paid by the coupling-entry delay:, and1, whereas the monitor; it suffices to impose 2(. This same condition is imposed for both permitted adjacent-stage choices.

For the fixed trial activities, let be their regular action at

Searchable transcription

R(z) = (B + z)K(V ) + L0(V ) + AV −[log H(1) −log H(V )].
(RSP6)

Their budget gives. Equations (RSP2), (RSP4), and (RSP5) imply 2. Since ), this affine function has a unique root in []. Its root varies continuously with the input: the contrast and coupling are continuous, the fixed-trial activity series are continuous by their common deviation bounds, and 0 is fixed.

The projected state already satisfies the full density identity, so evaluating it at 1 gives More explicitly the exact fixed-trial identity is Thus the unique interval root is exactly the previously defined Hessian projection ∆. This proves its radius bound and transfers the interval service’s continuous curve to the actual represented state. The independent projection estimate∆ retains the sharper paid bound. The all-configuration density equality is still supplied by the exponent and gas identities, not inferred from equality at two probes. In the source the corresponding shape comparison is also explicit: for any configuration , the trial shape is its value at ∆times; the inequality bounds its discrepancy by a finite configuration-dependent constant times, using 0. Hence the interval and projection formulations are fully compatible on this same trial family. For a compact input curve, the connected-expansion tails can be made small at one common finite retirement index. Their absolute tail bounds and the finitely many local bounds permit that choice throughout the curve. In the deterministic recipe the index is chosen as a function of the incoming address layout. A curve’s layout is constant, so that index is constant on the curve. The identities for the primitive expressions show that changing the incidental local guide or the point at which the curve was presented does not change the resulting state: all such expressions have the same tensors, canonical matching coordinates, source list and scalar reset. This supplies the continuous forward rule used above without silently choosing new dictionaries at different parameter values.

The source-level continuity and admissibility statement can now be written without suppressing its series hypotheses. Fix a closed parameter interval and an incoming curve) in its admissible band. Use one point as reference. The incoming path equals the prescribed path at every point, and the regular and forced layouts equal those at. The matching maps therefore use identity label correspondence on these dictionaries. Local physical guides may be selected separately at each point; the matched primitive expression is independent of that selection. Transport all entries to the reference layout. This fixes the unretired source dictionary, its support windows and the finite debris predicate used for retirement.

For its source), the actual continuity assertions are the following. Each regular entry, with all permitted derivatives on its fixed healthy support, and each forced entry on all configurations, converges as within. Their absolute support-weighted envelopes have uniformly small tails near. These two facts imply the deviation budget tends to zero: given 0, choose a finite set of addresses leaving total tail less than2; then choose a neighborhood on which the finitely many remaining differences cost less than2. This uses no continuity of flag indicators as functions of the gauge field: their support and threshold predicates are held fixed in the compared evaluation.

On a compact input interval one retirement index can be used throughout. The uniform tail estimate for the unretired source and compactness give an eventual regular tail bound 0, while the local finite-volume comparison gives an eventual bound for all the retained local beacon entries. Intersect these eventual conditions, choose one integer above their thresholds, and retain it at every parameter value. The resulting source obeys the explicit regular estimate

Searchable transcription

BudgetPi(a(t)) ≤(1/16 + 2/16)Ei + turnFee(Pi)g + g,
(FCC1)

where = forecastE. Each beacon on its fixed neighbor support has the derivative bound gleam The source graft combines the retired regular entries, beacon entries and the fixed local profile. Its forced ingredient estimate is paid by its original forced allowance: the primitive forced part costs at most forecastK8, while the added local profile has size at most the prescribed reserve after its cover weight. The local gluing estimate sums these contributions into forecastK). The turn fee times the local beacon bound is included in the regular price. The stage delays make the right side of (FCC1), with that additional beacon price, at most. This proves the regular and forced local estimates for the grafted source simultaneously at every parameter value.

The uniformity over all presentations of one layout requires a separate argument. A layout is the regular and forced address lists, including supports, without coefficient functions. If no admissible state has a layout, its assertion is empty. Otherwise choose one such state. Form the canonical curve on the entire closed incoming coupling band by retaining its path, cutoffand address lists, setting every regular and forced coefficient function and the vacuum scalar to zero, and assigning coupling. Keep the address symmetry permutations. Zero functions satisfy every derivative and hit bound, so this curve remains admissible and is continuous.

Choose local guides along this canonical curve and match their expressions to its reference layout. At a fixed coupling the weighted connected series has a summable majorant. For a target tail bound 0, take a finite set of terms outside which its sum is below2. Each of these finitely many terms eventually leaves the debris set: a term is either kept or eventually appears in the finite retirement roster. Hence one depth removes them all. Continuity in the deviation budget bounds the change of the entire weighted series by2 in a neighborhood of that coupling. The retired part is a subfamily of the same majorant, so the same neighborhood works for every larger retirement depth. Finitely many such neighborhoods cover the closed coupling band. Their maximum depth supplies a common tail bound Intersect it with the eventual finite beacon bounds, taking = gold Now let) be any other admissible curve with this layout and any allowed guide choices. At a point, compare its guide with the canonical guide at. The paths, lists, cutoffs, budgets and couplings agree. The matching map is the identity on the lists, and its induced relabeling preserves the finite retirement roster and debris predicate. For a debris address the primitive term does not read the incoming coefficient functions: it is an omitted foreground cluster formed from the common geometric and Gaussian factors, or an unretired scalar path term. Matching preserves its connected coefficient, integrand and scalar coupling. Thus the two debris functions and beacon contractions agree: 1

This is equality of local functions, so it preserves every derivative envelope tested in the budget. Transfer the canonical tail and beacon bounds through it. Adding the principal unretired contributions gives (FCC1) for the arbitrary presentation. The threshold therefore depends on the layout, stage, depth, period and fixed prices, but not on the curve, its coefficients or its guide choices.

Apply this construction both with standard allowances 116 and with the allowances needed for the contraction. Intersect the two eventual sets with, and choose one integer ) for each layout. Along every admissible curve is constant, hence so is). The matching identities identify the deterministic rule with the fixed-index continuous formula on that curve. No continuity of this integer-valued selection as the layout changes is needed. For the deterministic operation, the retirement index is selected once from the incoming layout, at least the terminal depth, to satisfy these bounds for every compatible presentation of that layout. The universal retirement estimate supplies such an index. Because a curve has one layout, this selected index is constant on the curve. The primitive changes of local guide leave the matched source unchanged,

Searchable transcription

including its finite debris predicate and beacon contraction. Thus the deterministic moment state
agrees with the continuous curve construction just described. Restricting the interval in the shooting
argument changes neither index nor dictionary.
The Hessian projection is continuous in the resulting deviation budget. For two source values
a, a′, its bound is
θ2
i |∆(a) −∆(a′)| ≤deviationPi(a, a′).
(FCC2)

The threshold is a fixed positive number at this step. The rebate, fault, freshness and loan difference identities are linear in the source difference and in ∆(), as proved in the reset chapter. Their summable quote envelopes therefore pass continuity and uniform tails to the reset entries. The finite-support dictionary fusions preserve these properties by their absolutely convergent product bounds. In particular both the final coefficient families and their actual fixed address layouts form a curve in the stated sense.

Finally the local primitive identity identifies the transferred density with its early-value expression on every configuration. The reset’s exact exponent and gas identities then give its installed state with that same transferred density; its regular and forced closure estimates give all the coarse admissibility conditions. The scalar vacuum term is continuous by the same source-series estimate. Equivalently, evaluate the positive identity at the flat configuration to obtain its logarithmic normalization (FCA9). Together with continuity of the incoming coupling and (FCC2), this proves continuity of the output coupling as well. These are precisely the continuity, density, drift and band-free output conditions used in (FCA3); the subsequent interval restriction is what imposes the coarse coupling band. The calendar makes the following drift condition hold at every step:

Searchable transcription

di+1 ≤s
4 log Li.
(FCA4)

Searchable transcription

Define narrower target intervals

Searchable transcription

li = 3
4
 ̄β + 5
8sτi,
ui = 5
4
 ̄β + 3
2sτi.
(FCA5)

Since0, they obey and [. If the fine coupling in (FCA3) equals, then

Searchable transcription

β(T) ≤li+1 −s log Li + di+1 ≤li −1
8s log Li < li.

Searchable transcription

If it equals ui+1, then

Searchable transcription

β(T) ≥ui+1 −s log Li −di+1 ≥ui + 1
4s log Li > ui.
(FCA6)

These strict crossings require no monotonicity or derivative bound on the coarse coupling as a function of the bare coupling.

We use the following elementary interval restriction. Suppose is continuous on [ ). Let be the first point at which, and let be the last point in [] at which . These points exist by the intermediate value theorem and compactness of the two level sets. Then and]. A value belowwould force a later crossing ofbefore value above would force an earlier crossing of. Both contradict their definitions. This argument also covers

Starting at, restrict the bare parameter to [] in (FCA2). Descend by finite induction. If an interval already carries trajectories through levels and its endpoint level- 1 couplings are, apply (FCA3) to their level- + 1 curve. Equations (FCA6) and the preceding interval restriction give a closed subinterval on which its level- coupling stays in [

Searchable transcription

and takes these exact endpoint values. Retain the already constructed higher states and insert this
new coarse state. Every higher density identity, startup condition and continuity estimate survives
the restriction.
At level zero we have a nonempty closed bare-parameter interval [aN,p, bN,p] and complete
forward trajectories
b 7−→(R b
N,p,i)0≤i≤N.
(FCA7)

Their finest coupling is exactly; each level is continuous in the stated sense; all states are admissible; and every adjacent pair satisfies (FCA3). Their bottom couplings take the endpoint values 3 ̄ and 5 ̄4. Thus every bottom value in this interval is attained by a trajectory of the same recipe.

In particular choose with bottom coupling ̄, and set . This constructs the calibrated finite histories for every

The same retained arc supplies the auxiliary trajectories at nearby prescribed bottom couplings used in the confluence argument. It supplies whole trajectories, not just scalar sequences satisfying the drift inequality. No uniqueness of an inverse shooting map has been assumed. Determinism asserts only that equal finest states give identical forward trajectories; the later contraction argument establishes the required uniqueness of their limiting calibrated data.

Searchable transcription

There is also a uniform interior margin. If the bottom value of any successful trajectory lies in
[3 ̄β/4, 5 ̄β/4], then
3
bβi ≤β(Ri) ≤5
bβi
(0 ≤i ≤N).
(FCA8)
4
4

At = 0 this is the given bottom interval. If it holds at, solve (FCA3) for the fine coupling and use (FCA4): its increment lies between (34) log and (54) log. Adding these bounds proves (FCA8) at + 1. This margin justifies the nearby-trajectory comparisons while retaining the original full bands.

Finally, assembling these states into the history preserves the common path at fixed, its period independence, the prescribed budget and clip, the finest bare Wilson law, and all exact push identities. Induction in the push integral identity gives the same finest Wilson partition function at every coarser level. It is this calibrated history, rather than a separately selected sequence of couplings, that enters the limits below.

Exact density identity after retirement

Searchable transcription

The retirement used above is an exact decomposition before it is an estimate. Keep one anchored
listing for the whole input curve. For its full regular source write Afull(V ) = P
j aj(V ). Partition
its indices by the chosen retirement predicate and write aj = akeep
j
+ atail
j
, including their original
healthy masks. The same predicate is used throughout the compatible curve. The local absolute
envelopes make both subseries summable, hence

Searchable transcription

Afull = Akeep + Atail.
(RET1)

The forced gas is retained in the kept source exactly; it is not split into two multiplicative copies. If the density of the full source is

Searchable transcription

ev|Λ|−H(V )−Afull(V ) G(V ),

then the identical integrated density after retirement is

Searchable transcription

e−Atail(V )ev|Λ|−H(V )−Akeep(V ) G(V ).
(RET2)

This follows by substituting (RET1) in the exponential; in particular the tail has a minus sign. Summability is needed here to identify the sums in (RET1), rather than merely cancelling finitely many formal letters. Replacing the old listing by the anchored common listing preserves each masked occurrence, so it preserves this equality on all configurations.

The full-source density identity follows from the connected expansion already established. Its empty-flag pool is strictly positive and equals the exponential of its absolutely convergent connected logarithm. The scalar normalization contains the positive Gaussian and coordinate prefactors, the incoming scalar volume term, and the reference-forest normalization. Taking their logarithm per coarse site defines. The cubic, quartic, loop and local correction scores have the exact totals displayed above. Their signs cancel those terms in, leaving precisely the logarithm of the positive pool. Multiplying by the forced pool then recovers the original conditional integral, including its prefactors. Thus (RET2) holds before either the kept source or the tail has its sharper output budget.

The kept-source estimate and the tail estimate are purchased separately on this same listing. The former gives the desired small regular price together with the original forced forecast; the latter is the remainder used by the finite reference beacons. Reattaching that remainder restores (RET2). Consequently neither continuity nor projection replaces the exact density by a merely close one.

Finite reference beacons and weighted retirement continuity

The finite beacons used in (FCC1) have an explicit five-volume construction. For integer half-width , use reference torus sides 2( 4, and coefficients

Searchable transcription

ρj = (1, −4, 6, −4, 1)j
24 4!
.
(RB1)

Fold each coordinate of a reference torus by reflection into its interval of length. To pull a configuration to this folded torus, a positively traversed original edge is read directly, a negatively traversed edge is inverted at its lower endpoint, and a collapsed edge is the identity. Translate this folded view to a chosen coarse anchor. Denote the resulting group configuration by . This finite word map defines the views even at folded faces.

Fix the local read radius, with 2. A position in a folded coordinate has a type: within of the left face, within of the right face, or in the interior. A boundary type records the face and its distance 01. Its number of preimages under folding is independent of; an interior type has 2( preimages. In four coordinates a full type therefore has a multiplicity which is a product of four constant or affine functions of. The fourth difference (RB1) kills every such product having a constant factor, and gives one on the product of four interior factors: its fourth difference is 4! 2. Hence for any function of the four-coordinate type,

Searchable transcription

4
X
j=0
ρj
X
x∈torus2(w+j)
f(typej(x)) = f(all-interior type).
(RB2)

Searchable transcription

This is a finite counting identity, including faces and edges of every codimension.
Let fj(x, V ) be the compatible anchored local reference densities. Center them by f0
j (x, V ) =
fj(x, V ) −fj(x, 1). Compatibility means that on healthy configurations two such readings agree
whenever their radius-r cover inputs agree, and they obey the exact signed and translation laws.
Define the beacon at o by

Searchable transcription

4
X
j=0
ρj
X
x
f0
j (x, Sj,oV ).
(RB3)
bo(V ) =

Choose its support radius + 4. Introduce also the shifted expression which uses anchor stage) for the-summand and masks that summand on its radius- neighborhood. Summing this expression over gives exactly the sum of the masked beacons, by the finite translation permutation of the torus. On a healthy radius-2 neighborhood all these masks are one. Their folded local readings depend only on their four-coordinate type; compatibility and the signed laws identify equal types. Equation (RB2) reduces the shifted expression to the original centered local density at. The all-interior type reads its unchanged cover neighborhood. Thus the difference between the assigned retained density, its identity value and this shifted expression vanishes on that healthy neighborhood. This is the local remainder used in the forced part of the graft. Its global identity follows by summing over; there is no discarded face correction.

The derivative allowance of (RB3) is equally concrete. If the centered full reference sum on side ) has left-derivative bound on the small reference chart through order, and the ambient budget has direction power, then

Searchable transcription

4
X
j=0
|ρj| 2k(1 + z)pk qj.
(RB4)
∥bo∥budget ≤

On a healthy neighborhood the folded reference configuration can be gauge transformed into that small chart, by the local axial chart construction; its displacement leaves the fixed margin required by the reference estimate. Gauge invariance transfers that estimate back. Each pulled-back direction reads one original edge or its reversed adjoint transform. Its norm is bounded by (1 + reversal preserves the color norm. Repeated left derivatives of the finite word substitution produce at most the 2 factor in (RB4). Finite summation over the five centered reference sums proves the displayed allowance. These are the actual finite offers used for the beacon, with their common threshold and derivative order. The’s in (RB4) are supplied by the finite reference construction. Putorder, turnFee( = gold( 0, andSite(2(. Its actual allowance is

Searchable transcription

qj = k! h 3k + 2Vj{s(h + h) + h}.
(RB4a)

The centered chart expression has boundsD, at every admitted point of the chart of radius = eaves(), with margin 2 furl(). The logarithm of each varying link recovers its local coordinate. If bounds that logarithm and is the size of a permitted left variation, the scheduled inequalities are

Searchable transcription

(1 + royalty(G))C ≤1,
k!J(1 + royalty(G))C ≤p.

The chain rule bounds the coordinate map through order by, with slope one. Composition with the chart expression costs at most! !

On the strict healthy chart the exact decomposition expresses this chart function as a constant minus the retained full reference sum minus the summable activity source. The source budget bounds the latter by, through the same left-derivative order. Centering at the identity costs at most twice this number; derivatives of positive order kill the centering constant. The triangle inequality proves (RB4a). To include a healthy endpoint on the boundary of the strict chart, approach it along1. This path keeps the prescribed chart margin and is eventually strictly healthy. Regularity of the retained reference function gives continuity of each left derivative at the endpoint, and hence the same bound there. No threshold indicator is differentiated.

The reference estimates hold eventually in their approximation depth uniformly on the compact coupling band. The five reference volumes therefore have a common depth. The actual result after