Reason: Initial publication: information of the smoothed record family (V4b statement) — conditional joint density of the smoothed lattice parameter and the record, verification of the van Trees hypotheses, information decomposition, and the propagator-corrected information limit with explicit error scales. Proof to follow.
Setup for a fixed N≥1. Let h be an observation-driven control policy with horizon T, control dimension m, and l~ channels (the policy may be chosen separately for each N in claim 4). Let G={x∈Δl:Nxγis an integer for everyγ}, a finite set, fix an anchorSˉ∈G, and let H0={z∈Rl:z1+⋯+zl=0} and L={N(x−Sˉ):x∈G}⊆H0, with N the square root. Let the configuration mapc:G→{1,…,l}N assign to x the nondecreasing configuration with exactly Nxγ agents in state γ. Fix a matrix ι∈Rl×(l−1) whose columns span H0 and which satisfies ι⊤ι=Il−1; such matrices exist, by orthonormalization applied to a basis of H0. Write Bl−1 and λl−1 for the Borel σ-algebra and product Lebesgue measure on Rl−1.
Let (Ω,F,P) be a probability space carrying: an L-valued random variable M; an Rl−1-valued random variable ξ; and transition clocks Yi,σγ and observation clocks Y~i,υ as in conditions 2 and 3 of N-Agent Driving System; such that the following family of σ-algebras is independent: σ(M); σ(ξ); and the σ-algebra of each clock. Let η=ηN∈(0,1] and assume ξ has the density φη with respect to λl−1 (measure with density), where φη(z)=cηexp(−(z⋅z)/(2η)) with exp the real exponential function, z⋅z the sum of the squared coordinates, and cη>0 the unique real for which φη integrates to 1. Define the smoothed parameterΘ=ι⊤M+ξ.
Moment and propagator hypotheses. There are reals CM≥1 and C∗≥1 with E[(M⋅M)2]≤CM and, for every x∈G,
E[supu∈[0,T](∑δ=1lΣu(x),δ−Su∗,δ)4]≤C∗(1+(N(x−Sˉ)⋅(x−Sˉ))2)N−2,
the suprema being measurable since the paths are right-continuous. Moreover (used in claim 4 only) there are a map Φ:[0,T]→Rl×l with continuous entries and Φ0=Il, fixed independently of N, and reals CΦ≥1 and ϵΦ∈(0,1/2], such that for every y∈L, writing x=Sˉ+N−1/2y,
E[supu∈[0,T](∑δ=1lN(Σu(x),δ−Σu(Sˉ),δ)−(Φuy)δ)2]≤CΦ(1+(y⋅y)2)N−2ϵΦ.
Claims.
1. (Conditional joint density) The map g is measurable with respect to Bl−1⊗R⊗TcP, where TcP is Tc enlarged by the events of probability zero, and for every Tc-measurable Z:Ω→[0,∞], every Bl−1-measurable ϕ:Rl−1→[0,∞], and every R-measurable g0:R→[0,∞],
E[Zϕ(Θ)g0(W)]=E[Z∫Rl−1∫Rϕ(θ)g0(r)g(θ,r,⋅)ρ(dr)λl−1(dθ)]in [0,∞].
2. (van Trees hypotheses) For P-almost every ω: g(θ,r,ω)>0 for every (θ,r); each section θ↦g(θ,r,ω) is a C1 map on Rl−1; and the density (θ,r)↦g(θ,r,ω) together with any pair of random elements whose joint law is the measure with densityg(⋅,⋅,ω) with respect to λl−1⊗ρ satisfies hypotheses (i)--(iv) of The Multivariate van Trees Inequality with l there replaced by l−1 and with data space (R,R,ρ). Write J(ω) for the resulting van Trees information matrix, I(θ,ω) for the (l−1)×(l−1) matrix with entries Iab(θ,ω)=∫R(∂ap)(∂bp)/p(θ,r,ω)ρ(dr), where p(θ,r,ω)=g(θ,r,ω)/q(θ) and ∂a is the partial derivative in the coordinate θa, and J(q) for the (l−1)×(l−1) matrix with entries ∫Rl−1(∂aq)(∂bq)/qdλl−1, which is finite and positive definite.
3. (Information decomposition) For P-almost every ω, every entry of I(⋅,ω) is measurable in θ and
J(ω)=J(q)+∫Rl−1I(θ,ω)q(θ)dλl−1(θ),
all entries being finite, the matrix integral taken entrywise.
4. (Information limit) Let data as above be given for every N in an unbounded set N of natural numbers, with (β,β~,U~,β~ˉ,T,S∗,Φ) and the constants B,B~,Kβ,Kβ~,K~,β~min,CM,C∗,CΦ,ϵΦ fixed, and with ηN→0 and NηN→∞ as N→∞ in N. Then the entrywise expectationIˉN=E[∫Rl−1I(θ,⋅)q(θ)dλl−1(θ)] (the inner integral being the one of claim 3, defined for P-almost every ω) is finite for every N∈N, and there are reals C≥0 and N0, depending only on the fixed data and constants, such that for every N∈N with N≥N0 every entry of
IˉN−ι⊤(∫[0,T](E~(Su∗)Φu)⊤Θ~⋆(Su∗)−1(E~(Su∗)Φu)du)ι
has absolute value at most C(N−1/2ηN−1/2+ηN1/2+N−1ηN−1+N−ϵΦ), the matrix integral taken entrywise, its integrands being bounded and continuous by Regularity and Derivative Bounds of the Extended Aggregate Observation Drift and the continuity of S∗ and Φ.
Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.