A gas of billiard balls. A large box holds identical hard spheres,
like a three-dimensional break of pool: they fly in straight lines and
bounce elastically on contact. The diameter ε is tiny and the density
is mu=ε^{-2} spheres per unit volume, so the gas is dilute yet the
number of spheres is enormous.

The average. The expected number of spheres per unit volume of
position-velocity space, the one-particle density, solves the Boltzmann
equation as ε↓0. That is Lanford's kinetic limit.

The wobble. The random gas equals this deterministic density plus
a small error. Scaling the error by sqrtmu gives the fluctuation field
zeta^ε_t; the question is its law as ε↓0.

The answer. The scaled error is asymptotically Gaussian, with a
covariance governed by the fluctuating Boltzmann equation: the linearized
Boltzmann drift plus a Gaussian noise whose strength is the collision rate,

d zeta_t(phi)=zeta_t(A_tphi) d t+ d W_t(phi),

where A_t is the linearized generator and W is a noise of covariance
C_t, both fixed below. This is a finite-dimensional, multi-time central
limit theorem for a deterministic gas.

Not obvious. The spheres interact deterministically; there is no
random force and no resampling. The Gaussian limit is emergent, produced by
the random initial configuration together with the extreme sensitivity of
which pairs collide. Both effects must be tracked, not averaged over.

What was known. The derivation descends from the BBGKY hierarchy of
Bogolyubov and Kirkwood, from the Boltzmann--Grad limit for rarefied gases,
and from the Hilbert and Chapman--Enskog expansions that organize the
hydrodynamic corrections. Lanford proved short-time validity of the
Boltzmann equation. Uchiyama gave a different derivation, and
Gallagher--Saint-Raymond--Texier later recast the proof so that the
geometric and probabilistic content separate cleanly. Van Beijeren--Lanford--Lebowitz--Spohn and Spohn
computed the fluctuation covariance. Pulvirenti--Simonella and
Bodineau--Gallagher--Saint-Raymond--Simonella built the quantitative
short-time fluctuation theory, the latter with process-level convergence,
the Gaussian collision noise, and exact microscopic centering, on a periodic
box; at equilibrium the same group reached the long-time Gaussian limit.
Deng--Hani--Ma carried the averaged kinetic limit to the full regular
Boltzmann lifespan on all of space. The new step is to carry the
fluctuation theorem to that same lifespan, on all of space, away from
equilibrium.

pdf/dhm-2025-2408.07818.pdf
pdf/bgss-2008.10403.pdf
pdf/bgss-2201.04514.pdf
pdf/bgss-2004.00311.pdf
pdf/bgss-2205.04110.pdf
pdf/bgss-2012.03813.pdf
pdf/pulvirenti-simonella-2017-1405.4676-correlation-error.pdf

Two new difficulties. First, size: the h-th factorial cumulant,
the connected h-point correlation, must be pinned at the sharp scale
mu^{1-h}, far below a crude bound. A change of relative translations of
collision clusters extracts one ε^2 per merging collision and does it.
Second, centering: the gas is centered by its true microscopic mean, which
differs from the Boltzmann mean already at order ε, since hard spheres
cannot overlap; at the scale sqrtmu=ε^{-1} that difference survives,
so the model dynamics must match the gas with probability better than
O(ε).

Notation is fixed once and used without variation.

N : number of spheres; N/mu stays near the mass int f_0 d z.

f_0(z), f_t(z) : initial one-particle density and the regular Boltzmann
solution, both in z=(x,v); regularity on [0,T] is
the kinetic assumption.

|·|_{Bol,beta} : sup norm with a Gaussian velocity weight
e^{beta|v|^2}, summed over unit spatial cells so mass is controlled.

B, Deltaphi : collision kernel [(v-v_*)·omega]_+ and the change
Deltaphi of a test across one collision.

A_t, C_t : linearized Boltzmann drift and collision-noise covariance:
the two coefficients of the fluctuating equation.

zeta_t^ε, zeta_t : the centered, sqrtmu-scaled fluctuation
(microscopic) and its Gaussian limit.

W : the Gaussian noise driving zeta_t, with independent increments.

g_i, f_{itau} : one-root mean at interface i (the independent input)
and the Boltzmann density f_{itau} at the same time.

H_i,Λ_i,Gamma : collision bookkeeping of the Deng--Hani--Ma
machinery: root count, particle-size cap, and cluster-excess cap.

L, tau=T/L, K, rho : number of slabs, slab length, the complexity
cutoff, and the complexity of a history.

c_h^ε : the h-th factorial cumulant density; its target size is the
sharp scale mu^{1-h}.

Why one collision costs ε^2. Two groups of spheres that
evolved independently can join one connected history only if, at the
contact, their relative position lands exactly on a sphere of radius ε
around the other group. Their relative motion is a straight line, and a line
meets that tiny sphere in a window whose cross section is a disk of area of
order ε^2, hit during a sliding time interval. This is the source of the
factor ε^2 per merging collision, the merger Jacobian
ε^2[(v-v_*)·omega] d t d omega. The gas carries activity
mu=ε^{-2} per particle, so a connected diagram with h marked
particles and m lines weighs mu^{m-h}, and each merger pays one ε^2:
the two powers of ε cancel line by line. The initial excluded-volume link
is a ball, not a sphere, so it costs ε^3, the only place where the
static problem is even smaller than the dynamical one.

Where does the Gaussian randomness come from? A test sees a sum of very many
almost-independent contributions, one from each close encounter. Whether a
given near-encounter happens is decided by microscopic sensitivity, so each
contribution acts like an independent bounded random variable. A sum of many
such variables is Gaussian by the central limit theorem, and its variance is
the collision rate, exactly C_t. The body of the argument proves the gas is
close enough to this picture for it to hold throughout the regular lifespan
and on the whole space.

Phase space is R_x^3times R_v^3 and z=(x,v). For a rate beta>0
define the weighted sup norm

|g|_{Bol,beta}
:=sum_{ain Z^3} sup_{substack{|x-a|le1vin R^3}}
e^{beta|v|^2} |g(x,v)|

It is a supremum with a Gaussian velocity weight, summed over unit spatial
cells so that it also controls the total mass. Hard-sphere collisions use
the kernel and scattering

B(v-v_*,omega) =[(v-v_*)·omega]_+, omegainS^2

v' =v-[(v-v_*)·omega]omega,
v_*' =v_*+[(v-v_*)·omega]omega

with [a]_+=max{a,0} and  d omega the unnormalized surface measure.
The Boltzmann equation reads

(∂_t+v·nabla_x)f=Q(f,f),
Q(f,f)=int_{R^3timesS^2}'f_*'-ff_*) d v_* d omega

all densities evaluated at the same x.

Fix the sphere diameter ε>0 and set the mean density
mu=ε^{-2}. The grand-canonical initial law, including N=0, is

P_ε(N, d Z_N)
=Z_ε^calZ_ε^{-1}(mu^N)/(N!)
1 _{D_N^ε}calD_N^ε(Z_N)prod_{i=1}^N f_0(z_i) d z_i

with the non-overlap set
D_N^ε=calD_N^ε={(z_i):|x_i-x_j|>ε, ine j} and
1leZ_εcalZ_εle e^mu. Given the configuration, spheres move by
free flight and deterministic elastic collisions, defined almost surely
by Deng--Hani--Ma, Proposition 1.2. There is no random collision rule and no
resampling: the only randomness is the initial configuration.

Assumption. f_0ge0 is a smooth probability density with
|f_0|_{Bol,2beta}+|nabla_xf_0|_{Bol,2beta}<∞ for some
beta>0. There is a nonnegative classical solution f of
the Boltzmann equation on a prescribed interval [0,T] with

M:=sup_{0le tle T}sup_{x,v}e^{2beta|v|^2}f(t,x,v)<∞

Throughout, [0,T] is one fixed regular kinetic interval; nothing
below asserts that T can be taken infinite.

For real phiin C_c^∞(R^6) put

pi_t^ε(phi)=mu^{-1}sum_{i=1}^Nphi(z_i(t)),

zeta_t^ε(phi)=sqrtmu [pi_t^ε(phi)-E_εpi_t^ε(phi)]

The expectation is the exact microscopic one. This is essential; see
the centering remark.

Define the pair difference and the two limiting operators

Deltaphi =phi(x,v')+phi(x,v_*')-phi(x,v)-phi(x,v_*)

(A_tphi)(x,v)
=v·nabla_xphi
+int_{R^3timesS^2}-v_*,omega)f_t(x,v_*)Deltaphi
d v_* d omega

C_t(phi,psi)
=tfrac12int_{R^3times R^3times R^3timesS^2}
B(v-v_*,omega)f_t(x,v)f_t(x,v_*)Deltaphi Deltapsi
d x d v d v_* d omega

A_t is the linearized Boltzmann generator; the collision part carries
no extra factor 1/2 because of the pre/post substitution together with
omega|->-omega (the collision normalization, below). The quadratic form
C_t is the collision noise, nonnegative because f_tge0.

Theorem (Finite-dimensional fluctuation limit). Under the kinetic assumption, the centered Gaussian field zeta solving the
weak fluctuating Boltzmann equation

d zeta_t(phi)=zeta_t(A_tphi) d t+ d W_t(phi)

in backward-mild form is well defined on test scales of small Gaussian
growth. Its initial field is independent of W, and

E[zeta_0(phi)zeta_0(psi)] =int_{R^6}f_0 phipsi d z

E[W_t(phi)W_s(psi)] =int_0^{twedge s}C_r(phi,psi) d r

with W of independent increments. For every mge1, all t_1,...,t_m
in[0,T], and real phi_1,...,phi_min C_c^∞(R^6),

(zeta_{t_1}^ε(phi_1),...,zeta_{t_m}^ε(phi_m))
⇒
(zeta_{t_1}(phi_1),...,zeta_{t_m}(phi_m))
(ε↓0)

Remark (The initial covariance). The initial covariance has no subtraction of
(int f_0phi)(int f_0psi): the particle number is random. More
importantly, microscopic centering is not the same as centering by the
Boltzmann mean. With ρ_0(x)=int f_0(x,v) d v,

lim_{εto0}sqrtmu(Epi_0^ε(phi)-int f_0phi)
=-(4pi)/(3)int f_0(x,v)phi(x,v)ρ_0(x) d x d v .

So exclusion shifts the mean by order ε, which survives the factor
sqrtmu=ε^{-1}. Centering by the Boltzmann density alone would
leave a nonzero deterministic drift already at time zero. This is why
the proof must compare exact expectations, not merely laws.

The layered collision-history framework of Deng--Hani--Ma is kept, stated as the
black box the analytic package. Its role is to remove large
complexity: histories with many entangled collisions. What remains must
be controlled at the fluctuation scale, and that is where the new work
lies.

1. Initial ensemble and Gaussian target
(the initial ensemble, below). Exact initial cumulants, the initial CLT,
the shift, the initial-covariance remark, and construction of the Gaussian
field of the fluctuation limit theorem.

2. Connected expansion with records
(the connected expansion, below). Factorial cumulants are written as a
finite sum of globally connected diagrams, on a single pasted dynamics,
keeping finitely many observation records. Large complexity is dropped
by the Deng--Hani--Ma package.

3. Sharp correlation bounds (the sharp bounds, below,
the sharp connected bounds). The h-th cumulant is O(mu^{1-h}),
with the leading h=1,2 terms identified as signed sums of trees
weighted by f_{itau}, contact flux, and pm1 signs. This is proved
by chronological merger coordinates: each collision that merges two
clusters contributes ε^2[(v-v_*)·omega]_+, and summing all
clusters costs CT/sqrt L<1.

4. Gaussian limit for the model dynamics
(the Gaussian limit of the model dynamics, below). A mark that accumulates observations turns
every fixed multi-time linear combination into one scalar whose
ordinary cumulants are computed; second cumulant converges, higher ones
vanish, giving the Gaussian law with the correct covariance.

5. Accuracy of the model dynamics (the cutoff comparison, below,
the pasted accuracy bound). The pasted and true dynamics agree with
probability O(ε^{1+eta}), eta=1/20. This is a positive
geometric estimate on terminal witnesses, carried out with local
gains, a common birth-energy bound, and a causal time-order sum free of
per-vertex logarithms.

6. Exact centering transfer (the centering transfer, below). The
discrepancy estimate, the fixed moments of N/mu, and H"older's
inequality show that expectations agree to o(mu^{-1/2}), which is
what transfers the limit with exact centering.

This stage is independent of the dynamics. It does two things: prove the
fluctuation limit at time zero (a pure equilibrium statement about the
grand-canonical hard-sphere measure), and construct the Gaussian field
that the fluctuation limit theorem claims to be the limit. It also records the initial
correlation bounds that later parts use.

Let F_{h,0}^{ε} be the density of the ordered factorial measure
divided by mu^h:

int F_{h,0}^{ε}(Z_h)Phi(Z_h) d Z_h
=mu^{-h}Esum_{i_1,...,i_h distinct}Phi(z_{i_1},...,z_{i_h})

Write [h]={1,...,h}, Z_B=(z_j)_{jin B}, and let P(V)
be the set of set-partitions of V. The factorial cumulant
(connected) densities c_{h,0}^{ε} are defined by the cumulant
inversion of the factorial hierarchy,

F_{h,0}^{ε}(Z_h)
=sum_{piinP([h])}calP([h])prod_{Binpi}c_{|B|,0}^{ε}(Z_B)

The one-point function is g_0=c_{1,0}^{ε}=F_{1,0}^{ε}. Set

ρ_0(x)=int f_0(x,v) d v,
b_ε=(4pi)/(3)|ρ_0|_∞ε^3,
d_ε=mu b_ε=O(ε),

and let (N)_p=N...(N-p+1) denote the falling factorial.

The key geometric fact, before the initial CLT can even be stated, is that
connected correlations are order ε^3 per connected pair.
This is the static shadow of the dynamical statement that each merging
collision costs ε^2; excluded volume makes it ε^3.

Proposition (Initial ensemble). For all sufficiently small ε:

(i) 0le F_{h,0}^{ε}leprod_{j=1}^hf_0(z_j) and
(1-Cε)f_0le g_0le f_0. Hence
|g_0-f_0|_{Bol,2beta}=O(ε) and, for every fixed pge1,

E(N)_plemu^p, sup_{0<εleε_0}E(N/mu)^p<∞

(ii) With υ=1/81, for every hge2 and a constant C independent
of h,

|c_{h,0}^{ε}(Z_h)|le(Ch)^{Ch}prod_{j=1}^hf_0(z_j)
sum_{T}{{i,j}inT}
( 1 _{|x_i-x_j|leε}+ε^υ)

the sum over trees T on [h]. For fixed hge2 and any
D>0 there is C_{D,h} with

|c_{h,0}^{ε}(Z_h)|le C_{D,h}prod_{j=1}^hf_0(z_j)
sum_{T}{{i,j}inT}
( 1 _{|x_i-x_j|le C_{D,h}ε}+ε^D)

and

|c_{h,0}^{ε}|_{L^1}le C_hε^{3(h-1)} (hge2)

(iii) For every finite list of bounded real tests, the exact-centered
initial fluctuations converge jointly to a centered Gaussian vector with
covariance int f_0phipsi. For smooth compactly supported real
phi,

lim_{εto0}sqrtmu(Epi_0^ε(phi)-int f_0phi)
=-(4pi)/(3)int_{R^6}f_0phi ρ_0 d z

Proof.
(i) Factorial bound and moments. For fixed Z_h, let
Z_ε[Z_h]calZ_ε[Z_h] be the partition function of the remaining
particles, still mutually excluding and additionally avoiding the balls
B(x_j,ε). Directly from the grand-canonical law,

F_{h,0}^{ε}(Z_h)= 1 _{D_h^ε}calD_h^ε(Z_h)prod_{j=1}^hf_0(z_j)
(Z_ε[Z_h])/(calZ_ε[Z_h])/(Z_ε)calZ_ε)

The ratio is le1, giving the factorial upper bound. For h=1 it is
the probability that B(x_1,ε) is empty of particle centers; by the
factorial upper bound with one particle and the union bound this is
ge1-mu b_ε=1-O(ε), giving (1-Cε)f_0le g_0le f_0.
Integrating the factorial bound gives E(N)_plemu^p; writing N^p
as a positive combination of (N)_j gives the moment bounds.

(ii) The Penrose tree bound. Write chi_{ij}= 1 _{|x_i-x_j|le
ε} and set

U_1=1,
U_n(Z_n)={H conn. on [n]}prod_{{i,j}in H}(-chi_{ij}) (nge2).

The tree bound is

|U_n(Z_n)|calU_n(Z_n)|lesum_{T tree}prod_{{i,j}inT}{ij}

This is the Penrose forest scheme. Root a connected labelled graph at
vertex 1, assign graph-distance levels, and let the parent of each
vertex be its least-labelled neighbour in the preceding level. For a
fixed resulting tree T, the graphs giving it are exactly
T⊆calT⊆ H⊆ R(T), where R(T)
adds all same-level edges and every edge to a preceding-level vertex with
label ge that of the chosen parent. These intervals partition all
connected graphs, and summing one interval gives

prod_{einT}-chi_e)prod_{ein R(T)∖calT)∖T}-chi_e),

whose second factor lies in [0,1], proving the tree bound.

Penrose's scheme, with this precise tree bound, is reproduced in
Bodineau--Gallagher--Saint-Raymond--Simonella 2022, Proposition 2.3.3;
the original is O. Penrose, Convergence of fugacity expansions for
classical systems, in Statistical Mechanics (Benjamin, 1967).
pdf/bgss-2205.04110.pdf

Integrating a tree from its leaves, keeping one free vertex, gives

int f_0^{ ⊗  n}|U_n|calU_n|le n^{n-2}b_ε^{n-1} (nge2)

Hence the connected-graph (Mayer) series is absolutely convergent when
emu b_ε|a|_∞<1, and by exponentiation/analytic continuation

logZ_ε[a]=calZ_ε[a]=sum_{nge1}(mu^n)/(n!)intU_n(Z_n)
prod_{j=1}^nf_0(z_j)a(z_j) d Z_n

From the partition function to the cumulants. Apply
the logarithmic partition formula with a=1+u. The log of
Eprod_i(1+u(z_i)) has coefficients mu^hc_{h,0}^{ε}/h!, so
differentiation gives the rooted Mayer series

c_{h,0}^{ε}(Z_h)=prod_{j=1}^hf_0(z_j)
sum_{nge0}(mu^n)/(n!)int f_0^{ ⊗  n}(Z_{h+1:h+n})
U_{h+n}(Z_{h+n}) d Z_{h+1:h+n}

For bounds uniform in h: delete h-1 edges of a tree on h+n vertices
so each component contains one fixed root (possible by repeatedly cutting
an edge on a path between two roots). Dropping the deleted constraints and
integrating the auxiliary leaves costs at most b_ε^n. With
n!ge(n/e)^n, (1+h/n)^nle e^h, (h+n)^hle h^he^n,

frac{(h+n)^{h+n-2}}{n!}le(eh)^he^{2n}

and the n=0 count is le(Ch)^{Ch}. Thus the rooted Mayer series
converges absolutely for εleε_0 with ε_0 independent of
h.

Coarse link bound. Let q be the number of connected components
of the graph on the h roots with edges |x_i-x_j|leε. If qge2,
every contributing tree must attach each such component to an auxiliary
vertex. One auxiliary vertex touches at most 27 root components: pick
one adjacent root from each; their mutual distances exceed ε, and
their disjoint balls of radius ε/2 lie in a ball of radius
3ε/2. Hence qle27n for a contributing tree with n auxiliary
vertices. Using the counting inequality and d_ε=O(ε),

frac{|c_{h,0}^{ε}(Z_h)|}{prod_jf_0(z_j)}
le(Ch)^{Ch}ε^{q/27}le(Ch)^{Ch}ε^{(q-1)/81} (qge2),

and for q=1 the same argument without the restriction on n gives
(Ch)^{Ch}. A tree of the roots using intra-component and q-1
inter-component edges has weight at least ε^{(q-1)/81} in
the factorial bound. This proves the factorial lower bound.

Sharp link bound. For fixed h,D, truncate
the rooted Mayer series at n_0+1ge D(h-1). The tail is
C_{D,h}ε^{D(h-1)}prod_jf_0(z_j). In any term with nle n_0, all
roots are connected by paths of le h+n_0-1 links of length leε,
so their diameter is le(h+n_0)ε; on that set the sharp link bound
holds with C_{D,h} chosen large. This proves the sharp link bound.
Integrating the rooted Mayer series and using the rooted tree integral bound
instead gives

|c_{h,0}^{ε}|_1le b_ε^{h-1}sum_{nge0}frac{(h+n)^{h+n-2}}{n!}d_ε^n
le C_hε^{3(h-1)},

which is the L1 bound.

(iii) Initial CLT and the shift. For real bounded phi put
S_phi=sum_iphi(z_i) and let kappa_k denote ordinary cumulants.
Substituting a=e^{uphi} in the logarithmic partition formula and
differentiating k times at u=0,

kappa_k(S_phi)=sum_{nge1}(mu^n)/(n!)int f_0^{ ⊗  n}U_n
(sum_{j=1}^nphi(z_j))^k,

and the rooted tree integral bound gives kappa_k(S_phi)=muint f_0phi^k+
O_{k,phi}(muε). After exact centering and division by sqrtmu,
the second cumulant tends to int f_0phi^2 and every higher one to
zero. The moment-cumulant identity then gives every Gaussian moment; for
scalar convergence compare characteristic functions of the normalized
variable and the Gaussian of variance sigma^2=int f_0phi^2 using
Taylor polynomials of degree 2n-1, whose combined remainder after
limsup is at most 2|u|^{2n}sigma^{2n}/(2^n n!)to0. Joint
convergence follows on each linear combination. This includes zero
variance.

For the shift, the n=1 term of the rooted Mayer series with h=1
gives, uniformly in z,

g_0(z)=f_0(z)[1-muint_{|x-x_*|leε}ρ_0(x_*) d x_*+O(ε^2)].

The bounded gradient of ρ_0 gives
int_{|x-x_*|leε}ρ_0=(4pi)/(3)ε^3ρ_0(x)+O(ε^4),
and sqrtmu=ε^{-1} converts this into the centering shift.

Remark (The centering shift). The shift is generally nonzero, so exact
microscopic centering is essential already at time zero. Meanwhile
mu|c_{2,0}^{ε}|_1=O(ε), so the limiting initial covariance has
only the same-particle term int f_0phipsi.

Write M=sup_{tle T,x,v}e^{2beta|v|^2}f_t(x,v). The noise form needs global velocity integrability, which does not
follow from a spatially uniform bound alone.

Lemma (Global weighted integrability). For every 0<q<2beta,

sup_{0le tle T}int_{R^6}f_t(x,v)e^{q|v|^2} d x d v<∞

Proof.
Let Q^+ be the gain part of Q and P_tg=Q^+(g,f_t) with the second
factor fixed. With T_tg(x,v)=g(x-tv,v)sfT_tg(x,v)=g(x-tv,v) and
(Vg)_t= T_sfT_{t-s}P_sg_s d s, positivity and the
transport Duhamel formula give
f_tlesum_{j<n}(V^j T_sfT_· f_0)_t+(V^nf)_t.
On the Gaussian decay spaces Y_a with |g|_{Y_a}=sup e^{a|v|^2}|g|,
energy conservation gives for 0<b<ale2beta

|P_tg|le CM|g|_{Y_a}(1+|v|)e^{-a|v|^2},
|P_tg|_{Y_b}le CM(1+(a-b)^{-1/2})|g|_{Y_a}.

Distributing the exponent from beta to beta/2 over n factors and
using that the time simplex has volume T^n/n!,
sup_{tle T}|(V^nf)_t|_{Y_{beta/2}}le M(CT)^n/n!(1+
√(2n/beta))^nto0, so f is dominated pointwise by the positive
gain series.

Let X_q=L^1(e^{q|v|^2} d x d v). The pre/post substitution with
e^{q|v'|^2}le e^{q|v|^2+q|v_*|^2} and the bound on f_t give
|P_tg|_{X_q}le CM(1+delta^{-1/2})|g|_{X_{q+delta}} uniformly for
exponents in a compact subinterval of (0,2beta). Since f_0in X_{q_0}
for q_0<2beta, distributing the exponent over the gain series and using
n^{n/2}/n! bounds its X_q norm uniformly for tle T; integrating the
pointwise majorant proves the velocity moment bound.

For age0 define the test spaces

E_a^0={hin C(R^6):e^{-a|v|^2}hin C_0(R^6)},
|h|_a=sup e^{-a|v|^2}|h|

on which smooth compactly supported tests are dense. Let
S_uh(x,v)=h(x+uv,v)sfS_uh(x,v)=h(x+uv,v) be free test transport and
K_t=A_t-v·nabla_x.

Lemma (Backward evolution). For 0le a<b<2beta and 0le rle tle T there is a bounded backward
propagator U(r,t):E_a^0to E_b^0 solving

U(r,t)h=S_{t-r}h+int_r^tS_{s-r}K_sU(s,t)h d s

with the composition law at intermediate exponents and uniqueness as a
mild propagator in these scales. For phiin C_c^∞,

U(r,t)phi-phi=int_r^tU(r,s)A_sphi d s

Proof.
For a in a compact subinterval of [0,2beta), energy conservation and
the Gaussian bound give

|K_th|le CM|h|_a(1+|v|)e^{a|v|^2},
|K_th|_ble CM(1+(b-a)^{-1/2})|h|_a

using |Delta_h|le4|h|_ae^{a(|v|^2+|v_*|^2)} and
int B d omega=pi|v-v_*|. Spatial tails vanish by replacing |h|_a
with eta_h(x)=sup_ve^{-a|v|^2}|h|, and K_th is continuous in
E_b^0. Iterating the backward mild equation bounds the n-th
time-ordered term by

((CM(t-r))^n)/(n!)(1+√(n/(b-a)))^n|h|_a

so the series converges for every finite T. Splitting a time simplex at
an intermediate time gives composition, and the same estimate on an
iterated remainder gives uniqueness with a positive exponent allowance.
For compactly supported smooth phi, differentiability of the series at
its upper end (its final transport gives U(r,t)(v·nabla_xphi);
the simplex faces give U(r,t)K_tphi) converges with the Dyson bound,
giving ∂_tU(r,t)phi=U(r,t)A_tphi and hence the upper-end identity.

Proposition (Gaussian target). The fluctuating equation has a centered Gaussian solution on each
test scale E_a^0, 0le a<beta, mapping continuously and linearly into
L^2 uniformly on [0,T], with covariance

E[zeta_t(phi)zeta_s(psi)]
={} int f_0 U(0,t)phi U(0,s)psi d z

+int_0^{min(s,t)}C_r(U(r,t)phi,U(r,s)psi) d r

It is unique in the class of solutions extending to these scales with
uniformly bounded second-moment norms. Thus the law in the fluctuation limit theorem
is well defined.

Proof.
For b<beta, energy conservation and the weighted integrability bound give

|C_t(h,k)|le CM|h|_b|k|_bint f_t(1+|v|)e^{2b|v|^2} d x d vle C_b|h|_b|k|_b

choosing the moment exponent slightly above 2b to absorb 1+|v|. The
initial form has the corresponding bound.

Let I_0,I be independent isonormal Gaussians on L^2(f_0 d z) and
L^2(nu) with
 d nu=tfrac12B(v-v_*,omega)f_r(x,v)f_r(x,v_*) d r d x d v d v_* d omega.
Define

zeta_t(h)=I_0(U(0,t)h)+I( 1 _{rle t}Delta_{U(r,t)h}),
W_t(h)=I( 1 _{rle t}Delta_h)

For hin E_a^0 propagate to bin(a,beta) and apply
the isonormal construction: the maps are well defined and

sup_{tle T}|zeta_t(h)|_{L^2}le C_a|h|_a

They are jointly Gaussian and linear with covariance the target covariance;
orthogonality of disjoint time intervals in L^2(nu) gives independent
increments of W, and I_0perp I gives initial independence.

Weak equation. For phiin C_c^∞, using the upper-end identity
and boundedness of the isonormal maps against Bochner integrals,
int_0^tzeta_s(A_sphi) d s=I_0(U(0,t)phi-phi)+
I( 1 _{rle t}Delta_{U(r,t)phi-phi}), which together with
the isonormal construction is zeta_t(phi)=zeta_0(phi)+int_0^tzeta_s(A_sphi)
d s+W_t(phi).

Uniqueness. On any candidate's probability space, construct the
backward mild field from its own initial field and noise. The difference
D_t has zero initial field and noise, mean-square continuity, and the
transport mild identity D_t(phi)=int_0^tD_s(K_sS_{t-s}phi) d s
(finite-support Riemann sums with S_{t-s}phi). Iterating n
times with 0le a<b<beta bounds its L^2 norm by
C_b|phi|_a(CT)^n/n!(1+√(n/(b-a)))^nto0, proving uniqueness in
the class and uniqueness in law.

This is a Gaussian generalized field in the mean-square sense of
the field bound; it does not claim samplewise membership in the
dual of E_a^0. Its restriction to C_c^∞ does have a random
distribution version: expanding locally in Fourier functions times a
compact cutoff, variances bounded by the field bound with a=0
make the expected local H^{-s} norm finite for s>3, and a cube
exhaustion gives consistent local distributions. No path-space assertion
is needed.

Deng--Hani--Ma 2025 is used. Its
diagram estimates are bounds for positive geometric integrals; they
do not by themselves give a fluctuation theorem or the sharp connected
bound. Everything is either a definition that is needed or a
statement quoted from Deng--Hani--Ma with its source location. This is the only
place where an unproved external input enters.

Fix υ=3^{-4}=1/81. Choose the excess bound Gamma as a large
dimensional constant before the number of slabs L. Put
tau=T/L and, with harmless integer roundings,

A_L=|logε|, Λ_i=A_i^{30}, A_{i-1}=Λ_i^{30}

and for the analytic induction

beta_i=(1-(i)/(10L))fracbeta2,
widetildebeta_i=frac{beta_{i-1}+beta_i}{2},
theta_i=(1-(i)/(10L))3^{-11}

Constants written C inside an exponential factor C^b are independent
of L; constants C_* and c_*>0 may depend on L and the kinetic
bounds but not on ε. Crucially, no moment order enters the choice of
Gamma or L.

Restarted truncated dynamics. Work slab by slab. Within slab i,
restart the collision prehistory. At an incoming contact, accept the
elastic collision iff adding it to the current collision graph of
that component keeps the component's particle count leΛ_i and its
excess leGamma; otherwise both particles continue straight. The
excess of a graph with b edges, n vertices, k components is
r=b-n+k (repeated edges counted with multiplicity); an internal contact
adds 1, a merging contact adds the two excesses. Grazing, simultaneous,
and tied-branch contacts are null sets. This is Deng--Hani--Ma, Definition 4.3 and Eq. (4.2), with existence and mass preservation in Deng--Hani--Ma, Proposition 4.5.

Pasted dynamics. Concatenate these restarted slab dynamics. It is
not a semigroup (the prehistory resets at each slab), which is why
it is treated as a separate object to be compared with the true flow in
the cutoff comparison, below.

Lemma (Kinetic envelopes). Under the kinetic assumption,

sup_{0le tle T}(|f_t|_{Bol,beta}+|nabla_xf_t|_{Bol,beta})<∞

Proof.
Apply Deng--Hani--Ma, Proposition A.1 with decreasing exponent
beta_*(t)=2beta-beta t/T. Its hypothesis is the initial Gaussian bound, and its two initial summable spatial norms are that same initial bound;
since beta_*(t)gebeta, its conclusion gives the propagated envelope.
This is Deng--Hani--Ma, Eq. (1.29).

Definition (Layered C/O history). A history consists of finitely many oriented particle lines and binary
atoms with a fixed order on the atoms along each line. Each atom
has two incoming and two outgoing half-edges paired into two serial lines.
A C-atom applies elastic scattering; an O-atom records an
incoming encounter with straight continuation. A segment between atoms is
a bond; a segment with one incident atom is an end.

Atoms carry slabs, and the order along each line must respect slabs. Lines
may begin or end at interfaces; their beginnings carry one-particle input
functions. Certain top lines with distinct labels are roots; all
other particle names are immaterial (histories are identified under
root-preserving relabelling of the serial pairing, C/O types, and line
orders). Integrals use the factorial weights of ordered particle labels.

In a slab, the C-clusters are the components formed by C-atoms; the
cluster graph has C-clusters as vertices and O-atoms as edges; its
components are layer components (isolated rooted lines included).
Let H_i be the roots of slab i (lines continued above, or the
designated roots if i is the top slab), and H_0 the lines incident to
an initial link, where initial links join pairs of lines born at zero with
weight

ell_ε(x,x')= 1 _{|x-x'|leε}+ε^υ 1 _{|x-x'|>ε}

An admissible dependent history satisfies:

(i) |H_i|le A_i; every C-cluster has leΛ_i lines and excess
leGamma; every layer component has <Λ_i C-clusters.

(ii) The cluster graph in each slab is a forest and every layer component
contains a root of its slab; every unrooted line is connected in its slab
to a rooted line.

(iii) The initial links form a forest.

(iv) For ige2, each line in H_i is connected within slab i to a
different line of H_i, or to a line of H_{i-1}, or itself lies in
H_{i-1} (replace H_{i-1} by H_0 when i=1).

Connection in a slab means sharing a component of its atom graph; the last
alternative of (iv) covers a straight line with no atom there. These are
Deng--Hani--Ma, Definition 3.20(1). The complexity is

rho=|H_0|+sum_i(|H_i|+r(M_i))

with r(M_i) the cycle excess in slab i; since the O-graph is
a forest this is the sum of C-cluster excesses. b denotes the number of
atoms.

Integral convention. Give each bond e a vector z_e=(x_e,v_e)
with position X_e(t)=x_e+tv_e; give atom a a time t_a. Its incoming
edges are 1,2 and serial outgoing edges 1',2'. On the contact surface
put u=v_1-v_2, omega=(X_1(t_a)-X_2(t_a))/ε, and
mathfrak b=[-ufrakb=[-u·omega]_+. Define

Delta_a^{mathrm C}rmC
=delta(|X_1-X_2|-ε)mathfrak bfrakb
prod_{j=1}^2delta(X_{j'}(t_a)-X_j(t_a))
delta(v_{1'}-v_1+(u·omega)omega)delta(v_{2'}-v_2-(u·omega)omega)

Delta_a^{mathrm O}rmO
=delta(|X_1-X_2|-ε)mathfrak bfrakb
prod_{j=1}^2delta(x_{j'}-x_j)delta(v_{j'}-v_j)

Reverse omega to match the scattering convention; surface measure is
unnormalized. With a set E_* of integrated bonds and free ends, the
positive measure of a cut history M with kernel Q is

I_M(Q)(z_{fixed})
:=mu^{|E_*|-2b}int_{D_M} Q(z_E,t_M)
prod_{ain M}Delta_aprod_{ein E_*} d z_eprod_{ain M} d t_a

where D_M enforces the slab and strictly increasing times along
each line. For a full history |E|-2b=n= number of lines, and with h
roots the normalized integral is

J_M(Q)={-h}I_M(Q):

each birth carries activity mu, each root a normalization mu^{-1},
each contact surface a factor ε^2 Deng--Hani--Ma, Proposition 7.5, Eq. (7.7).
To keep a root endpoint (x,v) at time t free, make its top end a fixed
end evaluated at (x-tv,v), removing the root activity.

The one-slab class T_i consists of connected histories with one
top root, conditions (i)--(ii) only, no continuation or initial-link
requirement; it may have up to simΛ_i^2 lines.
T_i^{err} inserts one extra O-atom into a member of
T_i. The one-root signed tree sum contains every one-root
particle-line tree of size <Λ_i/3, with C/O choices and sign
(-1)^{#mathrm O}rmO.

Theorem (Deng--Hani--Ma analytic package). Assume the kinetic assumption, the cutoff hierarchy, the exponent hierarchy, and a common Gaussian Bol bound on all birth
inputs. For L sufficiently large (fixed) and ε sufficiently small:

(a) For admissible dependent histories with prescribed labeled roots,
fixed b, and complexity rho, the normalized positive integral sums
to at most

C^btau^{b/10}ε^{c_*rho}|logε|^{C_*rho}

The sum includes graph enumeration and admissibility restrictions;
bounded observable multipliers cost their supremum. Birth inputs need
only satisfy the common Gaussian Bol envelope.

(b) If the independent input g in slab i has
|g-f_{(i-1)tau}|_{Bol,beta_{i-1}}leε^{theta_{i-1}}, then the
signed tree sum T_i^ε[g]sfT_i^ε[g] satisfies

|T_i^ε[g]-f_sfT_i^ε[g]-f_{itau}|_{Bol,beta_i}letfrac12ε^{theta_i}

In the fixed-top-endpoint norm Bol,widetildebeta_i, the summed
absolute contributions of cyclic T_i, of
T_i^{err}, and of T_i with geΛ_i/3
lines are o(ε^{theta_i}). Fixed cutoff powers and a fixed
exponential-atom factor can be included, the latter absorbed by large
L.

Part (b) holds uniformly for a slab truncated at any 0lesigmaletau,
with target f_{(i-1)tau+sigma}; at sigma=0 the map is the identity.

Proof (Source and envelope adaptations).
For (a): Deng--Hani--Ma, Proposition 7.2 counts root-labeled unlabeled histories by
C^b|logε|^{C_*rho}; Deng--Hani--Ma, Proposition 9.7 and Eq. (9.51) retain a
positive gain proptorho; after regular cutting, Deng--Hani--Ma, Eq. (9.53)
bounds each full edge integral by
tau^{b/9}ε^{-2h+2υ/5+c_*rho}|logε|^{C_*rho}.
Multiplication by mu^{-h}=ε^{2h} cancels the root power; weakening
1/9to1/10 and discarding the extra positive power gives
the coarse bound. These are the estimates inside the proof of Deng--Hani--Ma, Proposition 6.2, Section 9.2, not only its displayed conclusion.

The only use of a birth density is the envelope decomposition Deng--Hani--Ma, Eqs. (9.58)--(9.63): from (1) choose a summable
sequence (m_a) bounding the weighted supremum on unit balls; bounded
overlap and sum_am_a<∞ dominate |g| by
Csum_am_a 1 _{|x-a|le1}e^{-beta'|v|^2}, and the positive source
estimates applied to each envelope product sum by
sum_am_a<∞. This extends (a) to arbitrary bounded inputs,
including absolute values of signed inputs. Multipliers in [0,1] are
kept or dropped only when taking a positive upper bound.

For (b): the one-root integral is a function of a fixed endpoint
Deng--Hani--Ma, Eq. (14.2); the C/O involution Deng--Hani--Ma, Proposition 14.2 cancels
noncausal trees; the causal remainder satisfies the Gaussian Bol
estimate Deng--Hani--Ma, Proposition 14.3, Eq. (14.8); comparison to the short-time
Boltzmann expansion, using the kinetic envelope bound, is Deng--Hani--Ma, Proposition 6.1, Section 14. To pass from f_{(i-1)tau} to g, expand each birth factor as
f_{(i-1)tau}+(g-f_{(i-1)tau}); each residual costs
ε^{theta_{i-1}} by hypothesis, and the multilinear tree bound sums
all choices; since theta_{i-1}>theta_i the residuals are
o(ε^{theta_i}). For the positive subleading terms the bound is
Deng--Hani--Ma, Eq. (14.28) in Bol,widetildebeta_i with a time power per atom
and gain ε^{υ/3+c_*rho} in cyclic and extra-encounter
classes; Section 14.3 Points 1--2 keep the Gaussian weight at the fixed root and
the spatial Bol sum, Point 4 regularizes an O-atom adjacent to the root
without changing its integral. The tree-tail branch of Point 5 uses only
that the atom number is of cutoff order, so Λ_itoΛ_i/3
leaves an exponentially small tail. Graph enumeration, the bounded
selected-edge choices, and fixed exponential factors are absorbed by
taking L large. For the partial slab, restrict contact times to
((i-1)tau,(i-1)tau+sigma) and repeat the fixed-root Gaussian and
spatial localization at endpoint (x-sigma v,v); all shifts are letau
so the exponent margin survives. The signed involution preserves the
restriction and the upper majorants keep their full-tau bounds. At
sigma=0 only the zero-atom tree remains, i.e. g, and
theta_{i-1}>theta_i gives the bound.

Lemma (Coarse boundary modifications). The positive coarse bound tolerates:

(i) dropping continuation condition (iv) in the top slab with h roots,
at the cost of a loss ε^{-C_*h};

(ii) a connected pure-C terminal component with le3Λ_i lines and
excess le2Gamma, meeting a lower continuation but with no designated
root, at cost mu (add one artificial root);

(iii) supplying initial-link continuations to a fixed number q of
specified lines, at cost ε^{-qυ} (add q dummy straight
root lines), provided the root cutoffs have the corresponding slack.

Bounded records carried by these lines are kept.

Proof (Source and construction).
(i): use the error form of the cutting inequality Deng--Hani--Ma, Eq. (9.51)
retaining its deficit propto h. The finale Deng--Hani--Ma, Section 13.5, p. 169 splits
into a bounded-rho case, where the UP algorithm makes le h free-
component ``bad pieces'' paid by the root deficit, and a large-rho case
using the dependent cutting argument with the continuation condition of a
strictly lower layer still available; the resulting positive integration
gives the loss ε^{-C_*h} of Deng--Hani--Ma, Eq. (9.82). Terminal size is used
only later and absorbed by the time power.

(ii): take one line of the terminal component as root; its normalization
costs mu^{-1} and multiplication by mu restores the integral.
Splitting into leΛ_i lines and leGamma excess (ordinary
admissible) versus the enlarged terminal class of Deng--Hani--Ma, Definition 3.20(4), the same root operation is Deng--Hani--Ma, Eq. (15.4); summing over the
choice of line costs a cutoff polynomial.

(iii): fix nonnegative q_0 with int q_0=1 and finite Gaussian Bol
norm; for every x,

int q_0(x',v')ell_ε(x,x') d x' d v'geε^υ .

Insert once
per continuation: the dummy activity mu cancels the extra root factor
mu^{-1}, its straight line satisfies continuation in every slab, and
the new links are pendant so the initial forest is preserved. This is a
positive kernel inequality, valid even where f_0 vanishes; the envelope
extension of the analytic package admits q_0, and records are
untouched.

This stage is pure algebra plus the Deng--Hani--Ma coarse bound. Its job: write the
factorial cumulants of the pasted process as a finite sum of
globally connected diagrams, each with the correct label weight,
while carrying along finitely many observation records (running
sums of test values on designated particles). The high-complexity part is
dropped with the analytic package(a); what remains is what
the sharp bounds, below controls at the fluctuation scale. The
connected coefficients are genuine factorial cumulants of the pasted
process, not a factorization assumption.

Put

M_i=floor(Λ_i/2)

the expansion cluster cap. It differs from the dynamics caps
Λ_i,Gamma and belongs only to the expansion; take ε small so
M_ige2 for all i.

Idea. Run each subset of particles on its own, with the truncated
collision rule. The full truncated history is then a union of ``autonomous
clusters'' that never accept a collision with each other, and the block
structure is governed by a finite inclusion-exclusion over
compatibilities.

Fix a slab (suppress its index). Let V be a finite labelled particle set.
A particle state may carry previously observed test values, or their
running sum, as extra coordinates called records; the acceptance rule uses
only positions, velocities, and the prehistory on this slab. For
C⊆ V, Psi_C is the autonomous truncated evolution of C
(including its observation updates), and kappa_C is the indicator that
its accepted collision graph is connected (singletons kappa_bullet=1;
|C|>Λ⇒kappa_C=0). For disjoint C,D, a(C,D)
indicates an incoming cross-contact that would be accepted with
their respective prefix prehistories, and chi(C,D)=1-a(C,D). These are
indicators, not counts. All identities are on the common full-measure set
where all finite subsystems are defined.

Lemma (Autonomous partition). For finite V,

sum_{C P(V)}calP(V)prod_{CinC}
prod_{{C,D}⊆C},D)=1

For S⊆ V and a root test H,

H(Psi_V|_S)=sum_{C P(V)}calP(V)
prod_{CinC}{{C,D}⊆C},D)
H(Psi_{C}|_S)

Proof.
The collision components of the full truncated history give one summand
=1; its restrictions are autonomous because no accepted collision joins
components and the rule is prefix-local. Conversely, if all factors of a
summand equal one, juxtapose the autonomous histories and scan incoming
contacts in time order: internal accepted contacts obey the rule, every
cross-contact fails it by chi=1, so the juxtaposition is the full
truncated history, and uniqueness identifies its components with
C.

The next lemma is finite algebra; its vertices will be autonomous clusters.

Lemma (Rooted forest stopping). Let W be finite, R⊆ W nonempty, a_ein{0,1} for each pair,
Mge2, and

u(B)=sum_{substack{G connectedV(G)=B}}prod_{ein E(G)}(-a_e),
u({w})=1

There is a finite signed remainder R with

prod_{e⊆ W}(1-a_e)
=sum_{R⊆ I⊆ W}
sum_{substack{B P(I)calP(I) Bcap Rne∅, |B|<M (BinB)}}
prod_{BinB}{e⊆ W∖ I}(1-a_e)+R

|R|calR| is bounded by a sum of rooted forests, each with exactly one
component of size in [M,2M-2] and all other components smaller than M,
all meeting R, vertices off the forest keeping their mutual compatibility
product, each selected forest with coefficient le1. Moreover

|u(B)|lesum_{T spanning tree}prod_{ein E(T)}a_e

Proof.
Order the pairs. Grow the empty forest: at each step take the first
unprocessed pair joining distinct current components, at least one meeting
R, and split 1-a_e (positive branch deletes, negative branch selects
e and merges). Never split a pair internal to a component. Stop a branch
when a component reaches M vertices; complete when no eligible pair
remains. Selected edges form a forest; an unrooted vertex never joins
another, so each nontrivial component is rooted; a stop merges two
components of size <M, giving the single large component in [M,2M-2]
and the asserted multiplicity. Completed branches produce all graphs with
unique exploration, grouped by their reached components into products of
u(B) with survivors keeping their compatibility product, giving the main
term; stopped branches give the forest bound. For the tree inequality, fix
a total edge order on B, assign each connected graph its minimum spanning
tree T, let Q(T) be the edges later than the whole T-path; then
connected graphs on B are exactly T⊆ G⊆ Tcup Q(T), so
u(B)=(-1)^{|B|-1}sum_Tprod_{ein T}a_eprod_{ein Q(T)}(1-a_e); since
the second product lies in [0,1], dropping it proves
the autonomous partition.

Idea. The autonomous partition plus the forest identity become a
single linear operator on the factorial hierarchy. Its ``retained'' part
keeps bounded rooted blocks; its ``stopped'' part bounds the remainder by
a positive forest integral.

Write F_s for ordered factorial measures normalized by mu^s (records
allowed on a specified subset of the s labels). Using symmetric Janossy
measures p_n (sum_n p_n(E^n)/n!=1, p_n/n! the law restricted to
N=n),

F_s=mu^{-s}sum_{nge s}(1)/((n-s)!)(pr_{[s]})_#p_n

For S=[s], V=[s+j], define the signed root-output kernel

K_{S,V}(X, d X'_S)
=sum_{C P(V)}calP(V)prod_{CinC}
sum_{substack{B P(calP(C)
(∪_{Cin B}C)cap Sne∅, |B|<M}}
prod_{BinB};X) delta_{Psi_{C}|_S}( d X'_S)

and the retained operator

(L_sF)( d X'_S)
=sum_{j=0}^{s(M-1)Λ-s}(mu^j)/(j!)
int F_{s+j}( d X_V) K_{S,V}(X, d X'_S)

(An empty restriction is zero; at most s retained blocks, so the bound on
j follows from the caps.) The stopped kernel replaces the inner
block sum by
sum_{Finmathfrak F^frakF^{stop}_S(C)}{ein E(F)}a_e(X),
where mathfrak F^frakF^{stop}_S(C) are forests spanning
C with every component meeting S, exactly one of size
[M,2M-2], the rest smaller, no unrooted isolated cluster; keep
prod_Ckappa_C and the root-output map. Define E_sF by
the retained operator with this kernel and j up to

jle(s+1)(M-1)Λ-s

Lemma (One-slab identity and variation remainder). For a positive input law with factorial hierarchy F, let F' be its
hierarchy after the truncated slab. If factorial measures up to
the fresh-label bound are finite, then

F'_s=L_sF+R_s,calL_sF+R_s, |R_s|leE_sF

The record version holds, and E_sF is a positive domination of
R_s, not a claim that R_s has this local kernel.

Proof.
Insert the one-slab identity and the rooted forest stopping lemma into
the branch recursion. On a completed branch, fix the reached labels
Vsupset S, |V|=s+j; the unreached cluster partitions sum to one
pointwise by the stopped bound, using no independence of the
input, and
frac1{(n-s)!}binom{n-s}{j}=frac1{j!(n-s-j)!} turns the remaining sum
into mu^{s+j}F_{s+j}; the output normalization mu^{-s} leaves
mu^j/j!. Stopped terms keep only the unreached compatibility product and
drop the rest, so positivity of the input and the multiplicity bound give
|R_s(H)|le(E_sF)(|H|);calE_sF)(|H|); there are le s rooted components and
only one of size up to 2M-2 clusters, giving
the fresh-label bound. Records are untouched by the spectator
summation and travel with the root-output map.

For a signed family Delta (uniformly in records and sle A_i/2),

|L_{i,s}Delta|_{TV}+|E_{i,s}|Delta||_{TV}
le e^{C_*A_iΛ_i^2log(1/ε)}max_{qle A_{i-1}/2}|Delta_q|_{TV}

Indeed relevant qle(s+1)Λ_i^2/2<A_{i-1}/2, with at most q^q
particle and q^q cluster partitions, spanning/forest sum le q^{2q},
activity lemu^q, and at most A_iΛ_i^2 values of q; take logs.

Define the unmarked one-root measures recursively by

g_i=U_i(g_{i-1}),
U_i(g):=calU_i(g):=L_{i,1}((g^{ ⊗  q})_{qge0})

a finite signed measure using the full retained one-root block. It
approximates the Boltzmann density:

Proposition (Independent factors). g_i has a Gaussian Bol-bounded density representative and, with the
exponents of the analytic package,

|g_i-f_{itau}|_{Bol,beta_i}leε^{theta_i},
sup_{0le ile L}|g_i|_{Bol,beta_i}le C

with the same bounds for the one-root map run through any partial slab
sigmain[0,tau], target f_{(i-1)tau+sigma}.

The bridge from the retained block to the unrestricted tree sum is the
following; it is where ``retained'' and ``DHM signed trees'' are shown to
differ only by error classes.

Lemma (Modified one-root bridge). The difference between U_i(g) and the signed unrestricted
one-root particle-tree sum with n<Λ_i/3 is dominated, with inputs
replaced by |g|, by the positive integrals of

(i) retained one-root molecules with cycle excess rge1;

(ii) retained one-root molecules with ngeΛ_i/3;

(iii) small unrestricted trees with one extra incoming O-atom inserted
between two flight segments.

Families (i)--(ii) are subsets of the DHM one-root class; (iii) is its
additional-overlap class. Coefficients carry only a fixed cutoff power, and
the leading tree coefficient is exactly (-1)^{#mathrm O}rmO with the
labelled factorial mu^{n-1}/(n-1)!.

Proof.
Apply the autonomous partition to the single retained block and refine
each autonomous C-cluster by its ordered accepted collisions; the internal
indicator is at most the prescribed-C-contact indicator. Each chosen
cluster-tree edge demands a prospective accepted encounter between two
isolated histories. A cluster of q particles has le q-1+Gamma
collisions, so each pair of straight segments has le1 incoming contact;
partition the encounter event by the first admissible segment pair, giving
disjoint encounter indicators with weights in [0,1]. Ordering these along
lines gives particle-line molecules. C-clusters plus the O forest determine
the connected block with sign (-1)^{#mathrm O}rmO and global excess equal
to the sum of C-cluster excesses, so cyclic terms and ngeΛ_i/3
terms are exactly (i)--(ii), inside the DHM caps Λ_i<∞,
Gamma. A remaining tree molecule with no other encounters has autonomous
C-clusters equal to the displayed ones, every O contact the unique selected
one, and unused factors equal to one; otherwise the first undesignated
accepted contact (or a discarded compatibility factor, or a nonfirst
cluster-pair contact) inserts an O-atom that changes no velocity, giving
(iii). Conversely every small unrestricted tree with no further encounter
is admitted with the displayed sign, so no symmetry factor is dropped.

Proof of the independent-factor construction.
the initial ensemble gives |g_0-f_0|_{Bol,beta_0}le Cε, which is
the initial smallness for theta_0<1. Assume the bound at the preceding
interface. the one-root bridge plus the fixed-endpoint part of
the analytic package bounds the three error families and compares the
signed small-tree sum with f_{itau}, under the preceding
Bol,beta_{i-1} error, to o(ε^{theta_i}), giving the induction and
the uniform Bol bound. The estimate is a fixed-endpoint Bol one, not
an integrated L^1 inference, so it also gives density representatives;
restricting contact times gives the uniform partial-slab version.

Fix finitely many observation pulses. Let m bound both the number of
pulses and of record-carrying labels; record coordinates lie in a fixed
bounded interval. For a root set S and required records on R⊆ S,
let F^R_{i,S} be the pasted factorial measure at interface i with record
coordinates on R. The operators L_i append the slab
observations on the same labels; compatibility is record-independent. The
retained hierarchy is the finite composition

widehatwidehat F^R_i=F^R_i=L_i L_calL_{i-1}...L_1F^R_0

well defined order by order (finitely many previous orders per output).

Lemma (Resummation with records). There is an exact finite expansion

widehatwidehat F^R_F^R_{i,S}=sum_{R⊆ H⊆ S}E^R_{i,H} ⊗  g_i^{ ⊗ (S∖ H)}

The E^R_{i,H} are represented by layered diagrams: every retained block
in slab i contains a root of the interface above; a block is retained if
it has ge2 such roots or meets a dependent input label below; all other
blocks resum to the independent factor g_i on their single root; every
record-bearing line continues to time zero. Forgetting a record commutes
with the projection identity.

Proof.
At time zero expand the hierarchy into exact initial cumulant blocks; put
every label of a nontrivial block and of R in H, unmarked singletons
into g_0 on the complement, marked singletons into H with their
initial record. Insert the preceding expansion into
the retained operator; blocks with one new root and disjoint from the
dependent set H_- have independent g_{i-1} inputs and sum to
the one-root definition (carrying no record since R⊆ H_-);
keep the rest and call their new root set H. This gives
the dependent-subset expansion and the rule; record labels stay in H_- at
every step, so their lines continue. Fresh labels on distinct blocks are
disjoint with multinomial coefficients, and
frac1{(j_1+j_2)!}binom{j_1+j_2}{j_1}=frac1{j_1!j_2!} permits the
separate sums; everything is finite. Record forgetting commutes with the
root-output kernel the root-output kernel (record-free weight) and with
the initial updates, so it commutes with the composition.

Regard each nontrivial initial cumulant block as a connection. A block on
k labels is dominated by prod f_0, (Ck)^{Ck}, and a root tree with
edge kernel the edge kernel; the sharper kernel
 1 _{|x-x'|le C_{D,k}ε}+ε^D holds for bounded k. These dominate
the exact blocks; artificial links for marked lines are not connections.

Lemma (Labels and connected components). The retained expansion factors over global components. If D^R_{i,B} is
the sum of diagrams connected on roots B, then

widehatwidehat F^R_F^R_{i,S}=sum_{piinP(S)}⊗_{Binpi}D^{Rcap B}_{i,B}

Hence factorial-cumulant inversion keeps exactly the connected diagrams,
even after resumming into g_i. At fixed root order h=|S| and bounded
complexity rhole K, with n_i lines and j_i fresh labels in slab i,

n_i-j_i=O_{K,h,m,L}(1),
prod_ifrac1{j_i!}lefrac{(1+sum_in_i)^{C_{K,h,m,L}}}{prod_in_i!}

Apart from ordinary contact pair/order choices, all distinguished-label,
gluing, initial-block, and record-placement multiplicities are bounded by a
fixed polynomial in total size times C^b, with base C independent of K
and the moment order; in the coarse regime the same choices cost a cutoff
power with exponent O(rho).

Proof.
Expand each g_i to time zero (algebraically only). Weights are label-local;
size and excess caps are componentwise; every global component contains a
designated root (each slab block meets a root above). Distributing j fresh
labels with sizes j_1,...,j_q gives coefficient
frac1{j!}(j!)/(j_1!... j_q!)=prod_afrac1{j_a!}, so everything
factors; group components to get the component expansion, and finite
partition inversion gives the cumulant statement. A one-root resummation
contracts a history attached through one line and cannot split or merge
components. For counting, the only non-fresh labels in a slab are
boundedly many roots/continued labels, giving the first part of
the crossing-factorial bound and then, via n!/(n-d)!le n^d, the second.
There are 2^b C/O choices; once the ordered C/O graph is fixed its
C-components are the clusters and its O-forest the blocks, so no extra
partition enters; the exploration has one branch per selected forest.
Bounded distinguished choices cost fixed powers of total size, with
exponent controlled by crossings and initial links.

Lemma (Stopped variation errors). For L large in terms of the fixed data and Gamma, any fixed record
bound, and |S|le A_i/2, there are c_i>0 with

|F^R_{i,S}-widehatwidehat F^R_F^R_{i,S}|_{TV}le e^{-c_iΛ_i}

uniformly for a partial final slab (no velocity weight claimed).

Proof.
Write Delta_i=F_i-widehatwidehat F_i.F_i. Then
Delta_i=R_i+L_i{i-1}, |R_i|leE_iF_{i-1},
Delta_0=0. Substitute F_{i-1}=widehatwidehat F_F_{i-1}+Delta_{i-1} in the
positive stopped bound and expand the retained part as in
the resummation with records; refining autonomous histories into C graphs
and picking one incoming contact per incompatibility gives exactly the
positive C/O histories of the coarse package with previous-interface
continuations. The only top-slab difference, a stopped component with
M_ile·<2M_i-2<Λ_i clusters, is in the same coarse family with
atom count ge M_i-1. Bookkeeping: the lower independent inputs are
already resummed into g; the top stopped forest is not resummed. Top
components failing continuation are paid by the coarse boundary modifications, part (i)
(ε^{-C_*|S|}), and bottom continuation of a record line with no
initial link uses the coarse boundary modifications, part (ii)--(iii) (add a unit-mass Gaussian
Bol dummy and an initial link geε^υ, cost ε^{-υ},
bounded many). Remaining label and initial-block factors are the cutoff
powers of the label bookkeeping. Choosing L so
Ctau^{c_0}<1 and using Λ_i=A_i^{30}, A_ige|logε| makes the
top loss absorb into the exponential size gain,

|E_i F_F_{i-1}|_{TV}le
ε^{-C_*|S|-C_m}sum_{bge M_i-1}(Ctau^{c_0})^b
sum_{rhoge0}|logε|^{C_*rho}ε^{c_*rho}le e^{-cΛ_i}

Input orders are at most (|S|+1)Λ_i^2/2, which is below
A_{i-1}/2; the Delta_{i-1}
terms are bounded by the stopped input bound, and
A_iΛ_i^2log(1/ε)=o(Λ_{i-1})=Λ_i^{30} absorbs them.
This is the induction; restricting the last slab preserves every bound.

Theorem (Marked component expansion). Choose Gamma then L as above, independent of the moment order and the
observation list. On this single pasted dynamics:

(i) The factorial hierarchy with any fixed finite record list has the
finite componentwise expansion the projection identity with variation
error the variation error; independent inputs are the g_i
of the independent-factor construction; label weights, continuations, and record
projections are those of the resummation with records, the label bookkeeping.

(ii) At fixed final order h, the actual normalized marked cumulant
c_h^ε is the sum of retained globally connected diagrams plus an
error of total variation le C_he^{-cΛ_L}. Nontrivial initial
blocks count as connections; dummy links do not.

(iii) For any accuracy power P, one can choose K (after the record list
and h) so that all retained diagrams with rho>K have summed absolute
variation leε^P; at rhole K the crossing-factorial bound holds.
Increasing K or h never changes the exponential base per ordinary atom.

Proof.
(i) combines the preceding results. For (ii), invert both the actual and the
retained hierarchies: the component expansion gives the connected sum for
the retained one, and every term in the difference of the two finite
partition polynomials carries a factor Delta_{L,B}. The actual
normalized factorial measures have mass le1 (initially by the insertion
bound of the initial ensemble, and conserved since N is preserved), and
the retained ones have variation le1+e^{-cΛ_L} at fixed orders by
the stopped variation bound. For (iii) apply the coarse bound to each
resummed core with the same fixed record and top-root losses; independent
top singletons are bounded by the independent-factor construction; for small ε,
|logε|^{C_*rho}ε^{c_*rho}leε^{c_*rho/2}, so after summing
the geometric atom factor the rho>K part is
le C_{h,m}ε^{-C_*h-C_m}ε^{c_*K/2}; raise K to make it
leε^P. Dummy lines change complexity by a fixed amount and are
removed before low-complexity asymptotics. All root-order and observation
dependence sits in cutoff powers or fixed polynomial factors of
the crossing-factorial bound; the exponential atom base depends only on the
fixed graph counting, the Bol bounds, and Gamma, so the chosen L
works for every subsequently fixed order.

The comparison with the true flow (the cutoff comparison, below) needs a positive
version with a connected final collision witness instead of observed
outputs, and without any bound on the cutoff probability.

Corollary (Terminal-witness expansion). In slab i let a terminal witness be a connected true C history on
nle3Λ_i incoming labels, excess le2Gamma, stopped at a contact
in that slab, with arbitrary further nonnegative realizability
restrictions. Its activity-normalized functional

sum_n(mu^n)/(n!)int F_{i-1,n}( d Z_n) 1 _{terminal witness}(Z_n)

has the retained layer expansion with independent g inputs and initial
blocks. All lower C/O components attach through particle lines to the
witness. The preceding variation error is smaller than every fixed power of
ε. After the artificial-top-root normalization mu, the coarse part
with rho>K is also < any assigned power for large K; the remaining
low-complexity witness integrals keep their realizability restrictions.

Proof.
Since nle3Λ_i<A_{i-1}/2, insert the preceding expansion from
the marked component expansion into the terminal-witness functional.
Every lower component has a root leading above and the final roots enter
the connected witness (attachment before discarding any initial link). The
variation error contributes at most
sum_{nle3Λ_i}mu^n/n! e^{-cΛ_{i-1}}le
e^{CΛ_ilog(1/ε)-cΛ_{i-1}}, which is super-polynomially
small. Designating an artificial top root places the dependent diagrams in
the terminal class at cost mu; with no dependent continuation the
diagram lives in the terminal slab with independent inputs and complexity
le1+2Gamma. The same geometric complexity summation, with this fixed
power, proves the last assertion. For i=1 there is no preceding variation
error and the argument starts from the initial cumulant expansion. No
comparison of true and pasted evolutions is made.

This is the central new estimate. The Deng--Hani--Ma package already removed large
complexity (the marked component expansion, part (iii)); the remaining issue is what
survives at the sharp fluctuation scale mu^{1-h} for the h-th
factorial cumulant. The mechanism is a change of relative
translations: every collision that merges two clusters of particles
adjusts one relative position by the collision geometry, producing a
factor ε^2[(v-v_*)·omega]_+ d t d omega. After accounting
for the activity mu per birth line, a connected diagram with p
physical initial links scales like mu^{1-h}ε^p, which is exactly the
size sought; cycles and nontrivial initial correlations are smaller by a
positive power (proved via a null-set/dominated-convergence argument). The
sum over all cluster structures converges because each cluster slab has a
life time tau=T/L and the base CT/sqrt L<1 for large L.

Fix finitely many observation times and bounded continuous observation
functions. When observations are accumulated in a mark, update
y|-> y+phi_j(x,v), so |y|le M with M independent of the
number of particles. More generally one may retain finitely many phase
points along each designated trajectory. A record is kept only along a
line on which it is required; forgetting part of a record means pushing
the measure forward under the corresponding coordinate projection, which
commutes with the finite hierarchy before regrouping by
the marked component expansion.

Let c_h^ε be the ordered normalized factorial cumulant measure of the
pasted process, with records on its h designated particles; thus c_1^ε
is the one-particle measure and the normalization at order h is
mu^{-h}. Constants C_K may depend on a fixed complexity bound K, on
the fixed observations, and on L; the exponential base C^n never does.

The independent factors of the independent-factor construction satisfy, for some b>0 and
B_0<∞,

sup_{0<εleε_0, i}|g_i|_{Bol,b}le B_0,
|g_i-f_{itau}|_{Bol,b}→0

The exponent b is decreased a fixed number of times when reserving Gaussian weights;
this does not change the microscopic dynamics.

Theorem (Sharp connected bounds). Choose Gamma,L as in the marked component expansion, increasing L if
necessary by an amount depending only on the Boltzmann bounds and on T.
This single choice works for every fixed factorial order h and every
fixed bounded observation list. For each fixed h,

|c_h^ε|_{TV}le C_hmu^{1-h}

For h=1,2, the measures mu^{h-1}c_h^ε converge against bounded
continuous record tests to the signed sums of retained global trees with
trivial initial cumulants, with contact weight
[(v-v_*)·omega]_+ d t d omega (scattering +1,
non-scattering -1) and independent birth factors f_{itau}. The sums
of absolute retained diagram measures, after multiplication by
mu^{h-1}, are bounded uniformly with a small Gaussian weight in their
designated endpoint velocities; the same holds for the limiting tree
measures and for Gaussian weights in finitely many record velocities after
decreasing the exponent. Among retained connected diagrams, the sum of the
absolute measures having a nontrivial initial cumulant or a global cycle
is o(mu^{1-h}). These weighted assertions concern retained diagrams and
their limits, not the microscopic expansion remainder.

A global tree is a tree on the particle lines with contacts as
edges; continuing one line through an interface does not create a vertex,
while newly integrated particles do. This convention is essential for
counting translations and activity factors.

Work with a term of complexity le K. Replace each initial cumulant by
its bound from the initial ensemble,

C_Ksum_{L forest}prod_{(p,q)inL}
( 1 _{|x_p(0)-x_q(0)|le R_{K,D}ε}+ε^D)
prod_pf_0(z_p(0))

only for absolute bounds (not to sign an initial link). Expand the
parentheses and suppose first that all chosen links are physical.

Let m be the number of distinct lines, c the number of global
components, p the physical initial links, e_i the contacts in slab
i. The initial link graph is a forest. Scan contacts in time order: a
contact is a merger if its two lines lie in different components
just before it, else redundant. With a_i mergers in slab i and
r redundant contacts,

sum_ia_i=m-c-p, r=sum_ie_i+p-m+c

the second being the global cycle excess. With n_i lines present in slab
i (including contact-free lines) and q interface crossings,

sum_in_i=m+q, sum_i(n_i-a_i)=q+c+p

Merger edges in one slab form a forest on its n_i lines, so a_ile n_i.
All of q,p,c,r and n_i-a_i are bounded by K: glue layer graphs along
interfaces to see r (total excess grows by at most the number of
gluings, all in rho); each layer component meets a root so its count is
bounded; erasing boundedly many initial links changes this boundedly.

Each birth line has one independent input velocity and position; a
continued line has neither. The cancellation of activity at interfaces
leaves, in the normalized factorial expansion,

mu^{m-h}

A birth at an interface of a g_i-supplied line is an independent phase
variable; the passage of a recorded line is a continuation of its old
variable.

Lemma (Chronological merger coordinates). Fix a finite line graph, the C/O choices, the chronological order, and
which contacts are redundant. Away from nontransversal and simultaneous
events, its history integral has coordinates: the birth velocities, one
absolute translation per global component, a vector in a ball of radius
R_{K,D}ε per physical initial merger, and (t,omega)in Rtimes
S^2 per dynamic merger. The positional Jacobian per dynamic merger is

ε^2[(v-v_*)·omega]_+ d t d omega

A specified redundant contact has no free continuous parameter. The
coordinate map has multiplicity at most one on each incoming transversal
branch.

Proof.
Take birth velocities first. Each line begins with an independent
translation of its free trajectory. An initial forest link fixes the
difference of two translations by a vector in the stated ball; orienting
the forest toward one representative per group has determinant one.

Proceed in increasing contact time. Within each group the histories are
known up to a common translation. A merger of groups with translations
X,X_* on the indicated straight segments satisfies
X-X_*=-d(t)-εomega with d(t) the known relative displacement,
dot d=v-v_*, and omega opposite the outward normal, so the incoming
condition is (v-v_*)·omega>0. The determinant of
(t,omega)|-> X-X_* on the sphere is
ε^2|(v-v_*)·omega|, and the incoming convention selects the sign
in the coordinate formula. A scattering reflection or O-continuation
updates velocities; the two groups now share one translation.

If the next specified contact is redundant, its relative displacement and
velocities are already fixed. A straight relative flight r(t)=d+tu has
at most one incoming crossing, and
int_Idelta(|r|-ε)[-u· r/ε]_+ d t= 1 _{{incoming
crossing in I}}, since the flux cancels the absolute derivative of
|r|-ε; the outgoing deltas then make a deterministic substitution.
If the crossing is absent the branch has weight zero. Segments starting
inside the sphere have an exit, not an incoming crossing.

Every step uses only earlier coordinates; the full determinant is
triangular with the displayed diagonal entries, so there is no new
relative translation at a redundant step. Contacts at different interfaces
are treated identically (different affine origins, same current-velocity
derivative). Keep one representative translation per component; on an
incoming transversal branch the reverse construction recovers every
relative translation, giving multiplicity one. Excluded boundaries and
ties are null in merger coordinates unless retained as a redundant-contact
indicator, where no change of variables is made. Work first on compact
subsets of transversal branches and exhaust.

Multiplying the activity bookkeeping factor by the merger Jacobians and the
physical-link volumes,

mu^{m-h}ε^{2(m-c-p)}ε^{3p}=mu^{c-h}ε^{p}

All acceptance indicators can be carried through the change of variables;
for an upper bound they may be dropped, except that a redundant scattering
determines its branch velocities when it occurs (extend by zero where it
does not). For a connected diagram c=1, and a physical initial block has
pge1 so gains a factor ε. A term of the sharp scaling
using a tail factor: erase that link; erasing le K links raises c by
le K and costs leε^{-2K} in the activity counting; choosing
D>2K+M makes such terms O(ε^Mmu^{1-h}), with M arbitrary and
chosen after the moment order.

Lemma (Fresh-label factorials). For complexity le K, the absolute sum with slab sizes (n_1,...,n_L)
is bounded by a sum over chronologically ordered merger pair lists with
denominator prod_in_i!, times

C_K(1+n)^{d_K}C^{sum_ia_i}, n=sum_in_i

with base C independent of K (the merger pairs themselves are not
counted).

Proof.
In slab i, s_i labels arrive as roots from above (the final roots in
the top slab) and j_i=n_i-s_i are fresh, integrated with coefficient
1/j_i!. Since s_ile K,
frac1{j_i!}=(n_i!)/((n_i-s_i)!)frac1{n_i!}le
frac{(1+n_i)^{s_i}}{n_i!}. Continued labels, dependent subsets, and
initial-link labels are boundedly many, costing a fixed power of 1+n.
The rooted compatibility expansion represents connected coefficients by
spanning forests whose deterministic exploration has one branch per
selected forest; after selecting one incoming encounter per forest edge
the C-components are the collision clusters and the O-forest the blocks,
so no extra partition enters, and the fresh-label denominator survives.
There are rle C_K redundant contacts costing (1+n)^{2r} choices and
(1+n+r)^r insertions; C/O flags give an absolute exponential base; a
chronological order already fixes the line order so has no extra
permutation factor.

Lemma (Uniform summability). For fixed K, the sum of absolute connected diagram measures with slab
sizes (n_i), after removing mu^{1-h}, is bounded by

C_K(1+n)^{d_K}(Ctausqrt L)^n

The same bound (with the corresponding mu^{c-h}) holds after erasing
boundedly many initial links, after prescribing the absolute position of
one observation per component, or after inserting a small Gaussian weight
in the designated velocities.

Proof.
Energy and time are bounded jointly to avoid a logarithmic loss per vertex.
Let E_0=sum_{p=1}^m|v_p^{birth}|^2. Elastic collisions conserve
every colliding-pair energy, O-contacts do not change it, a line ending at
an interface discards its energy, and a birth adds energy already in
E_0. Hence the sum of squared velocities active at any time is le E_0.

On the bin E_0in[P/2,P] (with E_0<1 by P=1), summing the incoming
speed over all merger-pair choices in slab i gives

sum_{p<q}|v_p-v_q|le(n_i-1)sum_p|v_p|le n_i^{3/2}sqrt P

Applied to a discrete tree of successive pair choices at fixed merger
times, normals, and birth velocities, where earlier velocities and
intervening specified redundant contacts are already determined by
the merger coordinates, induction bounds the product of fluxes by

prod_i(n_i^{3/2}sqrt P)^{a_i}

Integrating normals adds C^{sum_ia_i}; merger times are globally ordered
within a slab, leaving prod_itau^{a_i}/a_i!.

A common translation remains per component. For fixed birth velocities and
merger coordinates, write the input spatial arguments as X+d_p,
integrate one chosen input in X, and use the spatial supremum of the
others; the Gaussian suppression gives le C^mexp(-bE_0) uniformly
in the displacements. To prescribe an observation position, solve
X=x-d_{obs} with Jacobian one, same bound uniformly in x.

For the velocity volume, reserve half the Gaussian: with b_1>0,
 1 _{E_0in[P/2,P]}e^{-2b_1E_0}le e^{-b_1P/2}e^{-b_1E_0}, whose last
factor integrates over 3m birth velocities to (pi/b_1)^{3m/2} (the
lowest bin uses P^{a/2}=1 and costs only C^m). With a=sum_ia_i,

sum_{P=1,2,4,...}e^{-b_1P/2}P^{a/2}le C^{a+1}(1+a)^{a/2}

by comparison with int e^{-b_1u/4}(1+u)^{a/2} and Stirling.
Combining with the fresh-label factorials, the remainder is a fixed polynomial
in 1+n times

C^{n+a}tau^a(1+a)^{a/2}prod_ifrac{n_i^{3a_i/2}}{a_i!n_i!}

With delta_i=n_i-a_ige0 and sum_idelta_ile C_K, and
n_i!/a_i!le(1+n_i)^{delta_i}, n_i!ge(n_i/e)^{n_i},

frac{n_i^{3a_i/2}}{a_i!n_i!}le e^{2n_i}(1+n_i)^{delta_i}n_i^{-n_i/2}.

Also tau^aletau^nmax(1,tau^{-1})^{C_K} and
(1+a)^{a/2}le C(1+n)^{C_K}n^{n/2}, and convexity of ulog u gives

prod_in_i^{n_i}ge(n/L)^n

Substitution proves the Stirling bound. For weights: the sum of
squared designated velocities is le E_0 at a fixed time and
le q_0E_0 at q_0 record times, so a weight exponent below
b_1/(2max(1,q_0)) is absorbed by the reserved Gaussian fraction; the
exponent shrinks with the record list but the exponential base does not.

Since tau=T/L, the base in the Stirling bound is CT/sqrt L;
increase L once so it is <1. There are polynomially many vectors
(n_i) of total size n (fixed L), so the Stirling bound gives
uniform summability and vanishing size tails, with polynomial degrees that
may grow with h but never need another enlargement of L.

A qualitative fact is needed: a limiting tree carries no extra contact. Only
a fixed finite graph is examined. Its independent parameters are birth
velocities, contact times, merger directions, and one free translation per
component, all absolutely continuous. A claim about lines in one component
is translation-invariant and survives fixing one observation position.

Lemma (No extra contact for a limiting tree). Consider a finite chronological forest with no physical initial links and
a prescribed C/O choice, on incoming merger branches. Off a null set of
merger parameters:

(i) specified contacts occur at distinct times away from interfaces and
observation times and are transversal;

(ii) before the first redundant contact, that contact's requirement is
false for all small ε;

(iii) on a full tree, any contact not in the prescribed list (including one
preceding the prescribed joining of its two groups) is absent for all
small ε.

For (ii) the parameters are those of the forest prefix; the rest may be
appended. In (iii) an outgoing crossing after an O-contact is not counted.

Proof.
Set ε=0. Segment velocities are polynomial in birth velocities and
sphere coordinates, and displacements polynomial also in the times; the
parameter set is a connected real-analytic manifold, so a non-identically-
zero polynomial has a null zero set (grazing/ineffective reflections
extend analytically). For two lines on a common time interval, write the
relative displacement d+tu; a coincidence requires the collinearity

dtimes u=0

If the lines lie in different forest components, vary their free relative
translation. Otherwise, with ineffective reflections, a non-neighbor path
p_0,...,p_k, kge2, with edge times s_1,...,s_k gives an endpoint
displacement built from (v_{p_{j-1}}-v_{p_j})s_j; the intermediate
velocity v_{p_j} (1le j<k) occurs with coefficient
s_{j+1}-s_jne0, so varying it off the endpoint velocity direction
disproves the null-set conclusion.

Neighbors meeting at time a: after a with no later velocity change the
relative flight is the single separating flight, which has no second
incoming crossing (an O-contact passes out once). If an endpoint scatters
at b>a, the third particle is distinct; choose its velocity and the
normal so the pair's relative velocity jumps from u_1 to u_2
nonparallel (e.g. endpoint velocity e_1to e_2, third particle -e_1,
normal (e_1-e_2)/sqrt2), then the displacement contains
(b-a)u_1+(t-b)u_2 with nonzero cross product against u_2. Before the
meeting, an intervening scattering b<a with the same jump forces a
displacement (t-b)e_1-(a-b)e_2 not parallel to e_1.

Zero relative velocities and grazing contacts are null; at a merger the
incoming relative velocity is a nonzero linear function of independent
birth velocities and the normal is a free sphere parameter. Time
coincidences are null. A third line at a prescribed vertex has a nonneighbor
path, killed above. Finally, formal tree velocities are ε-independent:
x_p^ε(t)=x_p^0(t)+ε d_p with d_p a fixed sum of merger normals,
so convergence is uniform on each active interval. Away from small
neighborhoods of prescribed vertices every pair of segments has positive
separation or is the treated separating flight; near a vertex a different
pair needs an excluded zero-offset coincidence, and the incident pair has
no other velocity change in a small neighborhood, so it has only its one
incoming crossing. The same compactness handles interfaces and observation
times, proving (ii)--(iii) including contacts whose times vary with ε.

For a diagram with a cycle, keep its first redundant-contact indicator. All
prior contacts form a forest, and the tested relative trajectory is
determined by that forest prefix (no later redundant update enters). By
the no-extra-contact lemma it tends to zero for a.e. earlier parameters. Truncate
size, velocities, and translations; on the compact pieces the post-change
integrands have an integrable bound (from the finitely many speed factors
or from the proof of the uniform summability bound), extend unrealizable branches
by zero, and apply dominated convergence. Remove velocity/spatial
truncations with the Gaussian bounds and the spatial tightness from
the Gaussian suppression, then the size truncation with
the Stirling bound. This order needs no size-uniform rate and proves
the asserted o for cycles and nontrivial initial cumulants.

For a fixed tree all prescribed C-clusters and O-blocks fall below the caps
once ε is small; by the no-extra-contact lemma almost every merger parameter
set has only prescribed incoming contacts for all small ε. Thus every
acceptance restriction holds, counting an encounter or its existence is the
same, and the connected compatibility coefficient equals its tree sign
(-1)^{#mathrm O}rmO. Replacing g_i by f_{itau} in a fixed-size term is
justified by a telescoping product and the Gaussian suppression, with
the uniform summability bound (one factor replaced by its Bol-difference)
giving convergence to zero. Dominated convergence in space (checked first
on bounded velocities/size, then removing truncations with
the Stirling bound) defines the limiting signed tree measures.

Lemma (Spatial traces of tree measures). Let T be one of the summable tree measures above, with a line
and a time at which its position is required. It has a disintegration

T= d x T_x

with Gaussian-weighted variation of T_x bounded uniformly in x
and finite integral over x. For every bounded continuous test of the
other coordinates (and continuous tests of smaller Gaussian growth),
x|->T_x( is continuous. If two tree components are
joined at their designated positions, the product of their conditional
measures at a common position, integrated against incoming flux, is an
absolutely defined measure; it equals imposing the joining position in
merger coordinates, or a smooth approximate identity for the equality.
This applies to marked one-root and connected two-root trees and their
record projections.

Proof.
Choose the free representative translation to be the designated position
x: every birth position is x+d_p, every recorded position likewise,
with displacements independent of x and derivative the identity. This
gives the expression for the limiting measure as an integral formula, with both variation
bounds from the fixed-position and integrated versions of
the uniform summability bound. After size/velocity truncation the test integrand
is continuous in x with a uniform integrable majorant, and the tails
converge uniformly in x by the fixed-position estimate; a stronger
reserved Gaussian handles Gaussian growth. For two components with
positions x,x_*, setting x_*=x gives the conditional product, whose
variation is finite by B(v-v_*,omega)le|v|+|v_*| (one component
conditional, the other integrated); the same bound dominates a compactly
supported approximate identity in x-x_* uniformly, and on bounded
velocity sets conditional weak continuity gives convergence against
product tests, extended by the variation bounds.

Lemma (Completeness of the tree class). For fixed roots, required records, and L, all global trees with trivial
initial cumulants in the regrouped retained expansion have complexity
le K_0, independent of their number of ordinary vertices. Undoing and
reapplying an unmarked one-root regrouping preserves their weights and
record projections.

Proof.
An unmarked dependent one-root component cannot be a tree with trivial
initial cumulants. In its highest occupied slab a one-root component is a
single connected block; if all lower inputs are independent it is a term of
g_i and regroups away. If a lower dependent component attaches through
two lines, the upper and lower connections form a global cycle; so for a
global tree each lower dependent component attaches through le1 line,
and at least one must exist for the upper component to stay dependent.
Following it down repeats the argument; at time zero a dependent
nonsingleton needs a nontrivial initial cumulant. Downward induction proves
the claim; required records are the only cause to expand an independent
singleton further.

Cut a global forest at an interface and contract upper components to
vertices. With u such, a lower component with kge2 attachments meets
distinct upper components (else a cycle), so the bipartite incidence graph
is a forest; with v lower vertices of degree ge2 and d incidences,
dle u+v-1 and 2vle d, giving

dle2u

A lower component attached at one line is either absorbed (first
paragraph) or continues a required record, contributing at most the fixed
number of recorded lines. Starting from the fixed final roots and
iterating the completeness recursion through L slabs bounds all interface
roots and recorded singletons: this is K_0 (no cycle or initial-link
contribution in a leading tree). Regrouping an unmarked one-root component
is the defining finite sum of its factor with the original fresh-label
coefficient, attaching at one line, so it neither splits nor merges
components; the marked component expansion shows record forgetting and
regrouping commute before a limit, and the uniform summability bound carries this
to the limits, preserving weights and projections.

Lemma (Last-contact products). In the leading tree sums, deleting a last contact of the highest slab that
meets a designated root splits its global tree into the product of the two
component tree measures, incident lines designated before the contact;
their product at the collision position is the conditional product of
the spatial-trace construction. Conversely joining two disjoint component
histories at that contact gives the corresponding retained tree with its
original factorial weight, and unused record portions project out. Valid
for bounded continuous record tests and, with a smaller exponent, for
Gaussian velocity growth.

Proof.
Temporarily expand the top-slab independent factors by their one-root
definitions, keep lower inputs canonical, and bound each limiting tree's
line count by N; for small ε every cap Λ_i,M_i exceeds N,
so the already-proved convergence gives each such tree its original
factorial weight. Do finite algebra on this limiting class (not a closure
claim for finite-ε capped classes). Deleting a tree edge makes two
components, each holding one incident line (now designated); a component
losing its old top root keeps the incident line or another original root,
so the rooted-block rule still holds, and lower attachments are put in
canonical form by singleton regrouping. Conversely two disjoint components
plus their edge form a tree whose highest block meets the original root;
inverse regroupings restore the retained representation. Coefficients:
choosing an extra incident particle among j fresh labels changes 1/j!
to 1/(j-1)!, and
binom{j_1+j_2}{j_1}frac1{(j_1+j_2)!}=frac1{j_1!j_2!} splits the
remaining labels; a contact between two designated particles uses one
unordered pair, no fresh label; the deleted contact contributes its C/O
sign, other signs multiply. Letting Nto∞ passes through deletion
and joining by the uniform summability bound, the spatial-trace construction, the uniform
conditional Gaussian bound controlling the joining flux with a fixed
exponent loss; records project because record forgetting commutes.

Proof of the sharp connected bounds.
Weighted high-complexity tail. Take the birth exponent b>0 of
the Gaussian suppression independent of L, and L large enough for
the coarse package at the smaller exponent 3b/4. For a fixed record list
let J count designated endpoint and record velocity slots; on every
retained history the sum of their squared velocities is le JE_0. Choose
alpha>0 with alpha Jle b/4; the weight is dominated by
e^{bE_0/4}, absorbed by tilting every birth input to
|g_i(x,v)|e^{b|v|^2/4} (and f_0 likewise), which has a common
Bol,3b/4 bound. The positive coarse bound the analytic package(a)
needs only this envelope; apply it to the tilted inputs with the same
initial-link and record bounds. The geometric complexity sum makes the
weighted retained tail smaller than any power of ε after choosing K.
The Gaussian fraction reserved is fixed, so its atom base is
independent of J,h,K.

Assembling the scale. Use the marked component expansion at accuracy
ε^M, M>2(h-1), with K large enough for that accuracy and for
the tree-class completeness. The expansion error and the high-complexity
tail are negligible after multiplication by mu^{h-1} (they need only the
unweighted variation bound, since observation tests are bounded).

For the remaining connected diagrams, the activity bookkeeping and
the uniform summability bound prove the uniform bound at scale mu^{1-h}.
Physical initial links gain ε; nonphysical initial tails gain any
power after choosing D; cycles are negligible by the no-extra-contact lemma plus
finite-size dominated convergence and the uniform tails; the survivors are
exactly the leading trees by the tree-class completeness. Their fluxes,
signs, input limits, and record tests are evaluated above, and the same
summable majorant yields the asserted Gaussian variation bounds for their
retained sums and limits, including the one-root and two-root limits of the
following stage. All exponential bases are independent of K and h; those
quantities enter only through front constants and polynomial degrees, so
the Gamma,L choice remains the single choice made before the moment
order.

The central limit theorem is now run on the single pasted dynamics fixed by
the marked component expansion, the sharp connected bounds. Its Gamma,L do not
depend on the observation list or the moment order. The method: attach a
mark that accumulates test values along each particle, so that any
fixed multitime linear combination becomes one scalar. Its ordinary
cumulants are computed from the sharp bounds; the second converges and the
higher ones vanish, giving a Gaussian law whose covariance is identified
by propagating marked tree laws backward. Comparison with the true flow is
deferred to the next stage; exact centering is restored at the end.

Give every particle a scalar mark, initially 0, and at time t_j update

(x,v,y)⟼Θ_j(x,v,y)=(x,v,y+phi_j(x,v))

Collisions preserve the mark of each particle. Write
M_{obs}=sum_j|phi_j|_∞, xi=(x,v,y), |y|le
M_{obs}. The mark only records deterministic trajectories; it adds
no randomness. On either dynamics,

sum_{i=1}^Ny_i(T)=sum_jsum_{i=1}^Nphi_j(z_i(t_j))

Use a superscript ε for the normalized factorial cumulants of the
pasted marked process. At any observation-free time the sharp connected bounds
provides limits

c_1^ε→ F_t, mu c_2^ε→ J_t

against bounded continuous tests of the records; F_t is a one-root
measure and J_t a symmetric signed two-root measure, both with the
Gaussian variation bounds of the sharp connected bounds. Before the updates
at time zero, the initial ensemble gives

F_0=f_0(x,v) d x d v delta_0( d y), J_0=0

(since mu|c_{2,0}^ε|_1=O(ε)). Forgetting records in the finite
marked hierarchy commutes with the one-root regroupings; by
the marked component expansion, the independent-factor construction, the tree-class completeness, the
(x,v) marginal of F_t is f_t(x,v) d x d v (also inside a slab, via
the partial-slab version the partial-slab one-root bound of the one-root block).

As F_t is positive, it disintegrates by the spatial-trace construction as

F_t= d x F_t(x, d v d y)

with unmarked marginal f_t(x,v) d v at every x in the continuous
sense (a.e. x by globality, then both sides weakly continuous). To form
collision products, use the conditional measure of a factor at its
designated position, multiply the two component measures at a common
position, integrate that position, and include
B(v-v_*,omega) d omega when the incident variables collide. These are
absolutely defined; a conditional Gaussian bound for one component and the
integrated one for the other, with Ble|v|+|v_*|, give an integrable
majorant, equivalently replacing equality by a smooth approximate identity
and passing to width zero.

At a collision, with xi=(x,v,y), xi_*=(x,v_*,y_*),
xi'=(x,v',y), xi_*'=(x,v_*',y_*), put

DeltaPhi=Phi(xi')+Phi(xi_*')-Phi(xi)-Phi(xi_*),
DPhi=v·nabla_xPhi,

and

(H_tPhi)(xi)=int_{R^3times[-M_{obs},M_{obs}]timesS^2}
B(v-v_*,omega)DeltaPhi F_t(x, d v_* d y_*) d omega

In the formulas below, int BFF_*(...) is the simultaneous position
integral, with  d x d omega.

Proposition (Evolution of the marked tree laws). Between updates,

∂_tF_t(Phi) =F_t(DPhi)+tfrac12int BF_tF_{t,*}DeltaPhi

∂_tJ_t(Phi ⊗ Psi) =J_t((D+H_t)Phi ⊗ Psi+Phi ⊗ (D+H_t)Psi)

 +int BF_tF_{t,*}(Phi(xi')Psi(xi_*')-Phi(xi)Psi(xi_*))

These hold in transport mild form, hence in weak differential form for
smooth tests for which the integrals exist. At an update,

F_{t_j+}=(Θ_j)_#F_{t_j-}, J_{t_j+}=(Θ_j ⊗ Θ_j)_#J_{t_j-}

Proof.
Derive the identities from the tree integrals after the limit. Start with
smooth bounded marked tests and expand the top-slab one-root factors by
their one-slab definition, retaining canonical lower inputs, then truncate
to finitely many vertices and bounded birth energy. Vary the upper endpoint,
equivalently integrate in the time of the last top-slab contact. Last
contacts meeting no tested root cancel between scattering and non-scattering
(same flux, opposite signs, test unchanged). When a tested root is incident
the change is its scattered-minus-free value; deleting that last edge splits
the tree into two components, which by the last-contact products are the
component measures multiplied at the common position, with the inverse
joining and its fresh-label coefficients.

Three counts enter. (a) One root: the partner chosen among j fresh labels changes 1/j!
to 1/(j-1)! and splitting remaining labels uses
frac1{(j_1+j_2)!}binom{j_1+j_2}{j_1}=frac1{j_1!j_2!}, giving
int BFF_*(Phi(xi')-Phi(xi)), symmetrized by particle interchange
(including omega|->-omega) into the collision term of
the pushforward identity.
(b) Two roots: a contact between them is one
unordered pair and no fresh label; deleting it gives two one-root means and
the last integral of the pushforward identity with no factor 1/2.
(c) A contact between the first root and a new partner: the second original root
lies with the first (contribution J on it, F on the partner, change
Phi(xi')-Phi(xi)) or with the partner (interchange; the J component
carries Phi(xi_*')-Phi(xi_*)), summing to J(H_tPhi ⊗ Psi),
and the same at the second root gives J(Phi ⊗  H_tPsi). Records
project when a partner has no record in the integrand. Free flight gives
D; a transport-mild version avoids differentiating a sum (freely
transport the test to the last-contact time s; no-contact term plus
a<s<t contact integrals). The finite re-expansion, deletion, and joining
were bijections of labelled trees with their factorial weights; passing to
full sums and unbounded velocities is justified by
the uniform summability bound, the spatial-trace construction, the last-contact products. Interface
concatenation is the empty-top-slab no-contact term, preserved by the
absolutely convergent tree sums. Updates are deterministic pushforwards,
giving the pushforward identity.

The pre/post substitution with omega|->-omega preserves
B(v-v_*,omega) d v d v_* d omega, as does particle interchange with
the normal reversed. Hence the normalization in the Boltzmann equation gives

int Q(f,f)phi=tfrac12int Bff_*Deltaphi,
int[Q(g,f)+Q(f,g)]phi=int g K_tphi

with background f=f_t. So the collision part of the linearized weak drift
has no extra 1/2.

Restore the same-particle term by defining

G_t(Phi,Psi)=J_t(Phi ⊗ Psi)+F_t(PhiPsi)

Then the tree-law evolution gives

∂_tG_t(Phi,Psi)=G_t((D+H_t)Phi,Psi)+G_t(Phi,(D+H_t)Psi)
+tfrac12int BF_tF_{t,*}DeltaPhi DeltaPsi

Direct check of the source: with P=Phi+Phi_*, R=Psi+Psi_*, the
collision change of the diagonal products from the F equation plus the
J source, symmetrized, is tfrac12int BFF_*Delta(PR); the diagonal
drifts contribute tfrac12int BFF_*(RDelta P+PDelta R); the difference
is the last term of the G evolution since
Delta(PR)=RDelta P+PDelta R+Delta P Delta R. This uses neither
detailed balance nor equilibrium. The source is positive semidefinite
(F_tge0). Initially, before updates,

G_0(Phi,Psi)=int f_0(z)Phi(z,0)Psi(z,0) d z

and at an update G pushes forward in both slots.

the G evolution is needed on the spaces

V_a={Phi=c y+h:cin R, hin E_a^0},
|Phi|_{V_a}|c|+|h|_a .

Let alpha>0 be a common exponent in the integrated and conditional
Gaussian variation bounds for F,J, and choose 0<a<b<beta with
2b<alpha (a positive margin for the flux; the factor 2 also controls
the diagonal F_t(hk)). The mark is constant on a particle between updates
and conserved at a collision, so the marginal statement after
the collision-position integral gives

(D+H_t)(c y+h)=A_th,
tfrac12int BF_tF_{t,*}Delta(c y+h)Delta(d y+k)=C_t(h,k)

At pulse t_j, backward substitution sends c y+h to c y+h+cphi_j.

Use the backward propagator in this possibly nonsmooth class: the Gaussian
variation bounds make G_t a uniformly bounded bilinear form on
V_b, and the transport mild identity extends from smooth tests
by local uniform approximation with a small Gaussian margin; the unmarked
collision operator is K_t, so the linearized operator estimate applies. Iterating
the bilinear mild identity chooses one of two slots per collision factor;
an n-fold remainder is bounded by
((CT)^n)/(n!)(1+√(n/delta))^n for fixed allowance
delta=b-a>0 (the 2^n slot choices absorbed in C^n), which vanishes.
Source iterations obey the same bound, justifying dual propagation by the
convergent mild series with no spatial/velocity differentiability of
U(r,t)phi.

Starting from the test y after the last observation, the backward test at
r away from pulses is y+h_r with

h_r=sum_{j: t_jge r}U(r,t_j)phi_j

(The convention at r=0 includes observations at time zero; values at
positive pulse times do not affect a time integral.) Combining dual
propagation, the backward pulse test, and the pulse substitutions,

G_T(y,y)=int f_0h_0^2+int_0^TC_r(h_r,h_r) d r

After the last pulse the unmarked backward part is zero, so the last
observation time may replace T. By the explicit construction
the isonormal construction, sum_jzeta_{t_j}(phi_j)=I_0(h_0)+I(Delta h_r),
whose variance is exactly the variance formula, which by expanding
h_r=sum_{j:t_jge r}U(r,t_j)phi_j equals the target covariance. This
identifies all multi-time and repeated-observation correlations.

Proposition (Gaussian limit on the pasted dynamics). For the single pasted dynamics fixed above and every fixed observation list,

(sum_iy_i(T)-Esum_iy_i(T))/(sqrtmu) ⇒
sum_jzeta_{t_j}(phi_j),

and all centered moments converge to the Gaussian ones.

Proof.
Put S^ε=sum_iy_i(T). Since |S^ε|le M_{obs}N and
Z_εcalZ_εle e^mu, S^ε has exponential moments for each fixed
ε. The exact factorial-to-ordinary identity at the final marked time is

kappa_k(S^ε)=sum_{piinP([k])}calP([k])mu^{|pi|}
int c_{|pi|}^ε( d xi_1... d xi_{|pi|})prod_{Binpi}y_B^{|B|}

Directly: write
exp(lambda S^ε)=prod_i[1+(exp(lambda y_i)-1)], insert the factorial
series, and take the logarithm; each exp(lambda y)-1 must receive a
nonempty set of the k derivatives, and distributing those sets gives
exactly the partitions of the factorial-to-ordinary identity, whose ordering
cancels the factorial denominator. This is a finite formal identity through
degree k.

All y-powers are bounded on the mark interval (extend to bounded
continuous functions on the mark line). By the sharp connected bounds every
term on the right is O_k(mu). For
X^ε=(S^ε-E S^ε)/sqrtmu, the first cumulant vanishes and

kappa_2(X^ε)=c_1^ε(y^2)+mu c_2^ε(y ⊗  y)→
F_T(y^2)+J_T(y ⊗  y)=G_T(y,y),

while for k>2, kappa_k(X^ε)=O_k(mu^{1-k/2})to0. That these hold on
one dynamics is essential: the bases fixing Gamma,L in
the marked component expansion, the sharp connected bounds are independent of the fixed
order; enlarging the auxiliary complexity cutoff or D only changes the
error representation, not the random variable X^ε.

The finite moment-cumulant identities give every centered Gaussian moment
with variance sigma^2=G_T(y,y). For scalar convergence, truncate the
characteristic functions of X^ε and of a centered Gaussian Z at
degree 2n-1; Taylor's integral remainder is bounded by
|ux|^{2n}/(2n)!, so

limsup_{εto0}|E e^{iuX^ε}-E e^{iuZ}|
lefrac{2|u|^{2n}E Z^{2n}}{(2n)!}
=frac{2|u|^{2n}sigma^{2n}}{2^nn!},

and nto∞ proves convergence for every real u, including
sigma=0. This gives weak convergence with variance
the variance formula.

The pasted dynamics recolors every restarted slab, resets the collision
prehistory at each interface, and truncates components above the caps
Λ_i,Gamma. The true hard-sphere flow does none of this. It must be
shown that the two trajectories coincide up to time T with probability
1-O(ε^{1+eta}), eta>0, better than O(ε). The reason:
the fluctuation scale is sqrtmu=ε^{-1}, and the mean of the pasted
process differs from the exact microscopic mean by a deterministic
O(ε) amount; an error of probability O(ε) alone would compete
with that shift after multiplication by ε^{-1}, and exact centering
would fail. The sharper bound is proved.

Proposition (Accuracy of the pasted dynamics). There is a large dimensional integer Gamma_0 with the following
property. Fix GammageGamma_0. There is
L_0=L_0(Gamma,f_0,f,T,beta) such that for every fixed Lge L_0, the
true and pasted dynamics of the marked component expansion, coupled from the
same initial configuration, satisfy

P{the two trajectories differ at some time in [0,T]}le
Cε^{1+eta}

for all small ε, with eta=1/20. The size cutoffs are the
A_i,Λ_i of the analytic package; C and the upper bound on ε
may depend on the displayed fixed data.

The rest of this argument proves it. The plan:

1. Bound the probability of a first disagreement by the number of
``terminal witnesses'': a connected block of true collisions in one
slab, of bounded excess, meeting a fresh label and stopped by a rejection.

2. Separate coarse from fine. Coarse witnesses (complexity >K, or
terminal component larger than Λ_i) sum to less than any power of
ε by the Deng--Hani--Ma package---this fixes K large.

3. On the low-complexity fine regime, localize energy, then combine a
local gain at every good cutting piece with a global energy
and causal time-order bound, gaining enough powers of ε to beat
1+eta.

Distinguish the geometric cycle excess r(M) of a graph from its
multislab complexity rho(M). For a graph with b binary-contact
vertices, n particle lines, and c connected components, when each line
has at least one vertex,

r(M)=b-n+c

equivalently, with contacts as vertices and segments as bonds,
r=#{bonds}-b+c. The graph's directed order is the order
increasing in time along each particle line; orders on disjoint lines need
not be comparable.

Lemma (First disagreement). For every initial configuration the indicator that the true and pasted
trajectories first disagree in slab i is at most the number of its
terminal witnesses: connected true C histories M on incoming labels, with
no designated root, excess r(M)le2Gamma, an internal realizability
restriction, meeting a label born at or after the previous interface,
ending at a terminal contact, and with an occupied replica at the terminal
contact.

Proof.
Compare the two evolutions in chronological order; they agree up to the
first disagreement, which therefore is a contact accepted by the true rule
but rejected by the pasted one (or vice versa). On agreement so far the
pasted state is the true state; the collision component in the true history
just before that contact has excess le2Gamma (it was accepted), and the
rejection is exactly ``component size >Λ_i or excess added >Gamma''
within this block. Summing over possible blocks, each such rejection is
charged to a distinct terminal witness; summing charges gives the bound.

Insert the terminal-witness functional
and apply the terminal-witness expansion. Begin with the previous pasted
factorial measure at interface i-1. Since nle3Λ_i<A_{i-1}/2, the
variation error is below every power. The connected terminal witness is
itself a block at the top of the pasted hierarchy and enters through its
positive layer expansion. Its lower dependent and rooted components attach
through particle lines to the terminal component. Keep M's realizability
restriction throughout. A rooted lower component with kge2 attachments
cannot touch the same upper component twice (that would create a cycle);
with u upper and v lower vertices of degree ge2 and d incidence
edges, the bipartite incidence forest has dle u+v-1 per nonempty part
and 2vle d, so dle2u. A lower component attached at a single line is
either absorbed into an independent g input, or continues a required
record; the latter are boundedly many (the records through this interface,
including continued empty lines).

Choose a complexity threshold K after L is fixed. By
the terminal-witness expansion, the analytic package, the sum of positive majorants
with rho>K, including the activity cost of an artificial top root when
required, is O(ε^3) for K large enough. The terms left to estimate
have rhole K. Their interface crossings, initial-link vertices,
within-slab cycles, and total geometric excess are bounded. Discard the
initial-link restrictions in these positive majorants; the trajectory
attachments to the terminal component persist.

Henceforth all graphs are connected low-complexity witnesses,
summarized by a polylogarithmic exponent bound B_ε on the total number
of atoms in the top-slab terminal component, with
B_εle C_*|logε| (C_* may depend on K,L). A connected witness
of low complexity has its top-slab component of bounded excess, and a
connected graph with b atoms and excess le2Gamma can be produced
without new crossings and within the same realization family by
le C^b choices of the initial labelled M and its geometric data.

The number of scattered velocities in any witness is at most B_ε, and
initial data carry only le2beta Gaussian under the kinetic assumption; a
terminal witness has controllable total birth energy with Gaussian
cost e^{-cP} for total energy P.

Lemma (Energy tail). Fix Gamma and then choose L once, larger when needed. For witnesses
with n true input lines carry total birth energy E_0=frac12sum_j|v_j|^2,
put

P_ε=(C_*B_ε)^{1/2}(1+B_ε|logε|^{1/2}),
gamma_ε=ε^{B_ε^2}

For a witness with nle B_ε terminal lines, once energy is
>P_ε the

integralle C^{B_ε}e^{-cB_ε P_ε}leε^{cB_ε^2}

smaller than every fixed power. On the low-energy regime E_0le P_ε
the terminal terminals are localized to a ball of radius R=C_*(1+B_ε P_ε^{1/2}).

Proof.
The forward bound below holds on the positive original measure, so it uses
no local recollision gain. For fixed fully ordered graph with n births,
integrate forward from the birth phase points. At each contact its two
incoming affine lines are already determined, and by the
two-incoming-flight identity (below) all other variables are integrated to
an indicator; births at later interfaces are inserted at their times.
Dropping encounter restrictions and initial links, a graph with n births
has mass at most

mu^nintprod_{j=1}^nh_j(x_j,v_j) 1 _{{sum_j|v_j|^2>P_ε}}
prod_j d x_j d v_jlemu^nC^ne^{-cP_ε},

using half of the uniform birth Gaussian for the tail and the number of
births le B_ε; summing a finite count and mu^n=ε^{-2n} gives
e^{2B_ε|logε|-cP_ε} times a prefactor; choosing P_ε a
fixed large multiple of B_ε|logε| makes this below any fixed
power. With no exponential growth M_{top}to1.

Lemma (Causal order and relative speeds). In a slab with q_i ordinary atoms, retain the partial order induced by the
full graph (including chains through exceptional atoms), and let
T_i be its time-order region. On the original support with total
birth energy le P, an empty slab contributing one,

|T_i|calT_i|supprod_{a ordinary in i}|v_a-v_{*a}|
lefrac{tau^{q_i}(2q_iP)^{q_i/2}}{q_i!}

Proof.
With e_i the number of linear extensions, |T_i|=e_icalT_i|=e_itau^{q_i}/q_i!.
An antichain of ordinary vertices occupies disjoint incoming pairs on a
common causal slice: place all strict ancestors first in a total extension;
no two vertices share a line; energy conservation bounds the sum of their
pair energies by P, including interfaces via inactive coordinates. For
a_v=|v_v-v_{*v}|, every antichain has sum_{A}a_vle√(2q_iP).
Summing the products of weights over the recursive enumeration of linear
extensions (available minimal vertices form an antichain) gives
e_iprod_va_vle(2q_iP)^{q_i/2} for every feasible assignment, hence the
supremum.

Lemma (Free-parameter extraction). Consider a finite ordered composition of positive cut kernels. At an
ordinary step the free variables are θ_j=(t_j,omega_j,w_j) with
measure a_j d t_j d omega_j d w_j, followed by a deterministic update.
Suppose every exceptional kernel K_ell(h, d z) has mass at most
H_ell, uniformly in earlier-cut data (every restriction needed for that
bound included, zero outside the admissibility domain). Remove the a_j
from the ordinary measures to get a positive measure nu. If E is a set
of complete histories and D a measurable set containing its
projection onto θ, then

nu(E)le(prod_ell H_ell)
int_{D}{j=1}^q d t_j d omega_j d w_j

The same holds if the density after division by a_j is merely bounded by
one.

Proof.
First put all ordinary variables in bounded boxes and fix their vector
θ. The exceptional kernels stay in place with θ
exterior; integrating them backwards from the last exceptional step bounds
the surviving mass by prod_ell H_ell, and intervening deterministic
substitutions have norm at most one on bounded functions. Nonnegative
Fubini represents nu as the product in θ times these
kernels, and majorizing the indicator of E by
 1 _{D}θ) proves the extraction inequality.
Exhaustion removes the boxes. Equivalently, restrict ordinary relative
speeds away from zero and bound a rectangle by its product volume; cover a
compact containing set by products of rectangles and take the infimum;
then let the speed restriction tend to zero (zero-speed incoming contacts
have zero flux).

The local (kernel) estimates and the cutting alternatives are imported.
They are used with conditional masses, not global probabilities.

A cut exposes a set of contact variables. Its shared lines become
fixed phase-space data for the unexposed graph. The available degree of an
atom is its number of nonfixed edges; a history is regular if at every
O-atom each fixed end is serial with a free end. A one-atom piece of type
{2} has two nonfixed ends with the two fixed ends on the same time side
(C) or nonserial (O); types {3} and {4} have respectively one and
zero fixed ends. A {33} piece has two degree-three atoms joined by one
bond; it is type A if one atom cuts as a type {3} singleton and the
other becomes an allowed {2} piece, type B otherwise. A {44} piece
has two degree-four atoms joined by one bond
(Deng--Hani--Ma, Definitions 8.2, 8.11). The kernels compose
I_M=I_Acirc I_{M∖ A} with repeated boundary variables identified
(Deng--Hani--Ma, Proposition 8.14); this is how a later kernel is estimated
with earlier variables fixed. The uniform bound on the number of collisions in
semi-dispersing billiards behind these counting estimates is due to Burago,
Ferleger and Kononenko; Deng--Hani--Ma adapt it to the extended dynamics.

Lemma (Local kernels). Let R bound velocities and localized radii; the time length is le T.
For a singleton with two fixed ends in a free kernel:

(i) If all incident free edges have relative speeds geε^υ, the
mass is le C R^Cε^{2+υ/3}.

(ii) If it is a scattering contact and the strong restrictions
(|s-s_*|, |x-x_*| and exterior x_* below ε^{1-υ} on both
edges) hold, the mass is leε^{2+υ/3}. The bound is uniform in
the exterior parameters t_*,x_*.

(iii) For a type-B {33} piece, both atoms C, with |t_1-t_2|geε^υ
and every incident pair having |v_e-v_{e'}|geε^υ, the mass is
leε^υ|logε|^{C_*} uniformly in the two fixed ends.

Multiplying any such kernel by a bounded factor on its support costs its
supremum; no independent Gaussian distribution of a fixed-end velocity is
assumed. This is (Deng--Hani--Ma, Lemmas 8.15, 8.20, 8.23). A
uniformly good singleton or type-B pair is one of these restricted
kernels with conditional mass ε^υ|logε|^{C_*}; all
gain-producing restrictions are part of the kernel.

Proposition (Pure-collision cutting alternatives). Let M be a connected full realizable graph with only scattering contacts.
A transversal set Asubset M satisfies
M∖ A=A^-sqcup A^+ with no directed bond from A^+ to
Acup A^-, nor from A to A^-. Let X_0(A) be vertices outside A
with two bonds to A, and X(A) its closure obtained by repeatedly adding
vertices with two bonds to the grown set. Then:

(i) There is a chain of connected transversal sets A_1,...,A_m=M, A_1 a
tree, X_0(A_j)ne∅ for j<m,
A_jcup X(A_j)subset A_{j+1},
r(A_{j+1})=r(A_jcup X(A_j)), r(A_{j+1})-r(A_j)le10|X(A_j)|. The
intermediate growth adds one bond per new vertex. For D transitions there
is a cutting sequence of M with one type {4}, no type {44} or
type-B pair, and ge D type-A pairs.

(ii) One can choose A^pm so each component of A^+ is attached to A; then
X^pm(A)=X(A)cap A^pm are convex along particle lines, and with m_pm
the bonds from A to X^pm(A),
|X^pm(A)|le G(m_pm), G(q)=(2q+1)binom q2(32q^{3/2})^{q^2}.

(iii) Put z=|X_0^pm(A)|, a=r(A); there is a cutting sequence with one type
{4}, no type {44} or type-B pair, and ge z/2-a-1 type-A pairs.

(iv) For this side there is a finite Borel partition of the contact-parameter
domain, with a subcase integer yge0 and two available sequences:
a sequence with one type {4}, no type {44} or type-B pair, and
ge y/10-3(a+1) uniformly good singletons; or a sequence with no type
{44}, le S=a+z+y type {4} singletons, all type-B pairs uniformly
good, and ge(m_pm-10^5S)/10 type-A or type-B pairs.

Neutral pieces keep their neutral kernels; partitions and operation
sequences have le C^b|logε|^{C_*} subcases with C independent of
L. These are (Deng--Hani--Ma, Definition 15.3; Propositions 15.1, 15.2, 15.4, 15.6, 15.10).

Lemma (Adjacent scattering contacts). Let Rge2 bound velocities and localized radii, and length le T. A pair
of adjacent contacts with one bond is primitive if there is no other
directed chain between them; a double bond between two consecutive
scattering contacts is impossible. For e_1,e_2 the prospective fixed
edges of a type-A pair with contact times t_1,t_2 and

strongly close: |t_2-t_1|leε^{9/10},
|v_{e_2}-v_{e_1}|leε^{4/5},


(i) a primitive strongly close pair cut freely as one piece has mass at most

CR^Cmuε^{9/10+3·4/5}=CR^Cε^{13/10};

(ii) without any strongly close primitive pair, each type-A pair used by a
sequence has conditional mass le CR^Cε^{1/20}, or splits into a
neutral type-two piece and a singleton with the same bound.

The bounds are uniform in previously exposed lines and times. This is
(Deng--Hani--Ma, Lemma 15.12).

Fix delta=tfrac12min{υ,1/20}>0; every retained local gain is
at least ε^delta up to a fixed polylogarithmic factor.

Lemma (Amplified pure-collision cut). For large dimensional Gamma_0, every connected realizable full scattering
graph with Gamma<r(M)le2Gamma, GammageGamma_0, decomposes into cut
sequences such that either it contains a freely cut pair estimated by
the gain balance with no other activity loss, or its retained
improved pieces g and free singletons s_4 satisfy

delta g-2s_4ge6/5

There are le C^b|logε|^{C_*} subcases; the number of non-ordinary
pieces is bounded in terms of Gamma and fixed choices. This is
(Deng--Hani--Ma, Proposition 15.11).

The local powers must survive simultaneous integration without a
per-vertex logarithmic loss. Call a neutral type-three singleton
ordinary; all other pieces exceptional. Counting both vertices
of an exceptional pair, their number is bounded by a constant depending on
K,Gamma; the terminal part is the amplified cut, below it
the local kernels; the degree count
s_2+p_{33}=r(M)+s_4+p_{44}-1 on the complete graph (or its version with
boundedly many crossing ends fixed) bounds the extra type-two pieces. With
b the total atoms and q the ordinary ones, q=b-O_K(1).

Lemma (Total birth energy bounds the velocity domain). Fix a cutoff E_{cut}=P_ε and, as in
the energy tail, use the local kernels at the scopes where
the cutting alternatives and the amplified cut retain them. Then
for a witness with ordinary projection within the containing set D
(energy le P_ε), there is a compact measurable set inside
D, of volume

leprod_i(C(L)/(q_i))^{q_i}(1+P_ε/q_i)^{3q_i/2}

that contains every admissible ordinary velocity vector.

Proof.
Run the velocity computation forward in chronological order. Ordinary
scattering applies an orthogonal matrix to two velocities; an ordinary
nonscattering contact applies the identity. At an exceptional atom erase the
dependence of the two outgoing coordinates and insert prescribed values;
inaugurated coordinates can be inactive from the start. The part linear in
the birth vector u propagates by orthogonal matrices and projections, norm
le1 at each time. Each ordinary w_j is a physical edge velocity
immediately before or after its contact (including the outgoing side when
cut backwards), so

W=A(omega)u+d(omega,a), |A(omega)|_{HS}^2le3q

Rows need not be orthogonal; only the sum of squared norms is used, and the
maps do not depend on contact times. Take a Euclidean net of a of mesh
c_s(1+q)^{-1/2}, cardinality le C_s{(1+P_ε)(1+q)}^{C_s}; a change
zeta in a changes one chronological velocity by lesqrt szeta and
the observations by le C√(qs)zeta. Choose c_s so simultaneous
error is le1. The allowed W lie in ∪_{a_0}
(d(omega,a_0)+A(omega)B_{3n}(√(P_ε))+B_{3q}(1)), and the Minkowski
sum is in sqrt2(P_ε AA^{T}+Id_m)^{1/2}B_m(1) for m=3q
(support function: √(P_ε)|A^{T}|+|xi|le
sqrt{2(P_ε|A^{T}|^2+|xi|^2)}). Combining the trace bound
with AM-GM on eigenvalues and vol(B_m(1))le(C/sqrt m)^m,

2^{m/2}vol(B_m(1))det(Id_m+P_ε AA^{T}{1/2}
le(C√((1+P_ε)/q))^{3q}.

The identity enlargement handles small singular values without an inverse
Jacobian; a finite union of continuous images of compact parameter sets
gives the compact containing set for the extraction lemma.

Lemma (Summation with finitely many exceptional pieces). Suppose a cut sequence has q=b-O_K(1) ordinary atoms and boundedly many
exceptional pieces whose conditional mass bounds have product
ε^alpha|logε|^{C_*}. After summing spatial cells and energy bins in
a polylogarithmic energy region, its integral is at most

ε^alpha|logε|^{C_*}(Ctausqrt L)^q

The base C depends on the fixed kinetic envelopes and dimension, not on
K,L. This is (Deng--Hani--Ma, Lemma 16.2).

Proof of the pasted accuracy bound.
Start from the first-disagreement bound, the terminal-witness expansion, and fix the
complexity cutoff K large enough that the coarse part is <ε^3
(the marked component expansion, part (iii) after the terminal-witness expansion):
rho>K is discarded. The remaining witnesses are connected, full, realizable
graphs with rhole K, hence bounded crossing/initial/cycle counts, and
r(M)le2Gamma. Localize by the energy tail: outside the
polylogarithmic energy region the sum is smaller than any power.

On the low-energy region, apply the cutting alternatives, the amplified cut
to the top-slab graph. The freely cut primitive pair (if any) gives
the gain balance, product ε^{13/10}|logε|^{C_*}. Otherwise
the summation bound holds: the retained improved pieces number g
with a fixed bound except for the bounded seed, and gain ε^{delta g},
while each free type-four seed costs mu=ε^{-2}; so the exceptional
product is at most ε^{6/5}|logε|^{C_*} (using
delta g-2s_4ge6/5 in both the ε^{13/10} and the ε^{6/5}
branches). All the extra variables inside the containing set are then
removed by the coarea and time-order bounds: the causal-order bound
gives prod_itau^{q_i}(2q_iP_ε)^{q_i/2}/q_i!, and the ordinary
velocity box by the birth-energy bound. Combining
the exceptional-piece summation, the extraction lemma, the low-complexity sum is
bounded by

ε^{6/5}|logε|^{C_*}(Ctausqrt L)^{b-O_K(1)} .

Choose L so large that Ctausqrt L=C T/sqrt L<1/2, absorbing
constants depending on K,L into the fixed prefactor. The exponential atom
counting (C_1^b with C_1 independent of K,L, per
the marked component expansion, part (iii) and the terminal-witness expansion) together
with the bounded crossing labels, selected pairs, and initial coefficients
costs only a fixed-degree polynomial; the resulting sum over b is a
convergent geometric series, with the Λ_i cutoff removing the large-b
part. Thus the total sum is at most

Cε^{6/5}|logε|^{C_*}

Since (6)/(5)=1.2>1+(1)/(20)=1.05, this is
le Cε^{1+1/20}, proving the discrepancy bound. (The witnesses
with terminal component larger than Λ_i are smaller than any power
by the energy tail, the analytic package, via the activity cost
mu=ε^{-2} versus the Gaussian gain over Λ_ige|logε|^{30}
births, summing geometrically as in the coarse step.)

Remark (Order of choices). The local exponent delta and the finite hierarchy of
the amplified cut fix Gamma_0 from dimensional constants. Then
choose Gamma, then L for the imported estimates and the common
exponential base; only afterward choose K, the localization powers, and the
small upper bound on ε. No observation number or moment order enters the
first two choices. This is what allows a single pasted dynamics to be fixed in
the Gaussian limit of the model dynamics, below.

The pasted process of the pasted Gaussian limit is centered by its own
microscopic mean. The real gas is centered by a slightly different mean,
since the pasted and true laws charge the discrepancy event (probability
le Cε^{1+eta}, the pasted accuracy bound) with different mass. At the
fluctuation scale sqrtmu=ε^{-1} this difference of means must go to
zero, and that is exactly the sharp estimate of the pasted accuracy bound. This is made
quantitative, then the fluctuation limit theorem is assembled.

Lemma (Discrepancy and centering). Couple the true and pasted dynamics from the same initial configuration.
For every fixed time t and bounded continuous test phi, with
|N/mu|_{L^2}le C,

sqrtmu |E_{true}pi_t^ε(phi)
-E_{pasted}pi_t^ε(phi)|
le C_phi ε^{(eta-1)/2}→0

and moreover

zeta_t^{ε,true}(phi)
=zeta_t^{ε,pasted}(phi)+o_{L^1}(1)

Proof.
Let A={the two trajectories agree on [0,T]}, so
P(A^c)le Cε^{1+eta}, and both N and N/mu have bounded second
moments (the initial ensemble). On A the empirical measures agree for every
t, hence so do pi_t^ε(phi) and the running records. Write
pi=(1/mu)sum_iphi. Off A, |pi|le|phi|_∞ N/mu on either
side, so |pi^{true}-pi^{pasted}|
le2|phi|_∞ (N/mu) 1 _{A^c}. By Cauchy--Schwarz,

|E_{true}pi-E_{pasted}pi|
le2|phi|_∞|N/mu|_{L^2} P(A^c)^{1/2}
le C_phi ε^{(1+eta)/2},

and multiplying by sqrtmu=ε^{-1} gives
ε^{(eta-1)/2}to0, proving the mean comparison.

For the centered-difference estimate, insert the centered definitions:
zeta^{true}-zeta^{pasted}
=sqrtmu[(pi^{true}-pi^{pasted})
-(E_{true}pi-E_{pasted}pi)].
The second bracket is bounded by the mean comparison. For the first,
using the A^c indicator,

Esqrtmu |pi^{true}-pi^{pasted}|
le2|phi|_∞sqrtmu E[(N/mu) 1 _{A^c}]
le2|phi|_∞|N/mu|_{L^2}sqrtmu P(A^c)^{1/2},

and sqrtmu ε^{(1+eta)/2}=ε^{-1}ε^{(1+eta)/2}
=ε^{(eta-1)/2}to0. So the L^1 norm of the difference of the
centered fields tends to zero.

Proof of the fluctuation limit theorem.
Existence and uniqueness of the target. the Gaussian target
constructs the centered generalized Gaussian field zeta with covariance
the target covariance, initial field zeta_0 of covariance
the initial covariance independent of the noise W, and weak equation
the fluctuating equation; uniqueness in law holds in the class of
L^2-continuous fields there.

Initial fluctuation limit. the initial ensemble, part (iii) gives, for any
fixed list of tests, joint convergence of
(zeta_0^ε(phi_1),...,zeta_0^ε(phi_m)) to the centered Gaussian
vector with covariance int f_0phi_iphi_j.

Dynamical limit on the pasted dynamics. Fix a single pasted
dynamics as in the Gaussian limit of the model dynamics, below (Gamma,L independent of the
observation list and order). the pasted Gaussian limit gives, for every fixed
list of times and tests, convergence of the centered combination
εsum_i y_i(T) to sum_jzeta_{t_j}(phi_j), with convergence of all
centered moments. By the factorial-to-ordinary identity and
the sharp connected bounds, this is the finite-dimensional Gaussian limit
with the multi-time covariance the target covariance.

Transfer to the true flow. By the discrepancy and centering bound,
zeta_t^{ε,true}(phi)-zeta_t^{ε,pasted}(phi)
=o_{L^1}(1), while
|zeta_t^ε(phi)|le|phi|_∞(ε N+ε E N) has uniformly
bounded moments because E(N/mu)^p<∞ (the initial ensemble). Hence the
p-moments of the difference vanish for every fixed p by interpolation of
the L^1 bound with the uniform L^{p+1} bound, and, for any bounded
continuous functional of a fixed finite collection
(zeta_{t_1}^ε(phi_1),...,zeta_{t_m}^ε(phi_m)),

E_{true}F-E_{pasted}F→0

(local uniform approximation of a continuous F on a compact by a smooth
one, then the moment control of the difference off the compact). Therefore
the true centered fields converge in distribution to the same Gaussian
vector. Sending the finite list over a countable dense family and using the
variance bound the field bound upgrades this to the map
t|->zeta_t(phi) in joint law.

Weak equation. The limiting field inherits the fluctuating equation from the
isonormal construction, so its law is the one prescribed. The
initial and noise covariances are identified in
the Gaussian target and via the variance formula. This is
the convergence assertion of the fluctuation limit theorem.

Remark (What is exact and what is asymptotic). The subtracted mean is the exact microscopic
expectation, not a Boltzmann approximation; this is essential because of
the centering remark. The Gaussian limit and its covariance are exact
in the limit; on the way, only the discrepancy probability, not the law
itself, is estimated with a power gain. The single imported analytic input is the
Deng--Hani--Ma package, used solely to remove large complexity and to
compare signed small trees with the Boltzmann solution; every connected
correlation, the sharp tree limits, the covariance, the Gaussian central
limit, and the exact-centering transfer are proved.