OctoInformBeta

OpenAI preprint, September 2026 · §4. Directions that change slowly in scale and position · §4

Lemma 4.4 [A finite particle measure]: Built from survival fractions; on the dyadic grid, terminal masses sum to the finest mass ∑q|vq|\sum_q |v_q| and active paths stay near their endpoints

Particle evaluation on finite trees recovers the node masses.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Let a complex vector mass vqv_q sit at each index qq of a square grid at the finest dyadic scale rr. Paths of refinement descend from a vertex of a coarser level to the finest grid, one vertex per level, and each path carries the mass at its end multiplied by a weight for every step. Grouped by their initial segments, the paths from one vertex form a tree, and the mass of a node, the norm of the vector it collects, can be less than the masses of its children together, since their vectors cancel. The item replaces the tree by particles indexed by a path and a birth level, weighted by the fractions of mass that survive each branching, and locates in the plane the paths of nonzero mass.

Trees, Masses and Charges

Fix a finite index set II and a normed abelian group EE. A finite tree TT over II with vectors in EE is either a leaf, carrying a vector of EE, or a branch node with one subtree for each i∈Ii \in I.✦ Its nodes are addressed by finite words ξ\xi over II: the root is the empty word ⌀\varnothing, and ξi\xi i is the child ii of ξ\xi. A terminal path is the address ω\omega of a leaf. For a word ω\omega of length |ω||\omega| we write ω|j\omega|_j for its prefix of length jj, the node at depth jj on the path.

The total vector of TT is the sum of the vectors at its leaves.✦ We write VξV_\xi for the total vector of the subtree at the node ξ\xi and Mξ=|Vξ|M_\xi = |V_\xi| for its node mass, so that VωV_\omega is the vector at the leaf ω\omega. The terminal mass of TT is the sum m(T)=∑ω|Vω|m(T) = \sum_\omega |V_\omega| of the norms of its leaf vectors✦, and a terminal path ω\omega is active when Vω≠0V_\omega \neq 0.✦

The survival fraction sξs_\xi of a branch node ξ\xi is the norm of the sum of the total vectors of its children divided by the sum of their norms: sξ=|∑i∈IVξi|∑i∈I|Vξi|.s_\xi = \frac{\bigl|\sum_{i \in I} V_{\xi i}\bigr|}{\sum_{i \in I} |V_{\xi i}|}.(1)✦

For a real function CC on the nodes of TT, the node charge of CC is the sum over all nodes, branch nodes and leaves, of the node mass times CC✦; the path charge of CC is the function of a word ω\omega over II and a level B∈ℕB \in \mathbb{N} that sums CC over the prefixes of ω\omega of length at least BB: NT(C)=∑ξMξC(ξ),C̃(ω,B)=∑j=B|ω|C(ω|j).N_T(C) = \sum_{\xi} M_\xi\, C(\xi), \qquad \widetilde C(\omega, B) = \sum_{j=B}^{|\omega|} C(\omega|_j).(2)✦

The particle evaluation of TT assigns to a real function F(ω,B)F(\omega, B) of a word over II and a level the number μT(F)=∑ω∑B=0|ω||Vω|(1−sω|B−1)(∏j=B|ω|−1sω|j)F(ω,B),\mu_T(F) = \sum_{\omega} \sum_{B=0}^{|\omega|} |V_\omega|\, \bigl(1 - s_{\omega|_{B-1}}\bigr) \Bigl(\prod_{j=B}^{|\omega|-1} s_{\omega|_j}\Bigr) F(\omega, B),(3)✦ where ω\omega runs over the terminal paths of TT and the factor 1−sω|B−11 - s_{\omega|_{B-1}} is read as 11 for B=0B = 0. Each term is a particle born at the node ω|B\omega|_B and running to the leaf ω\omega; the terms with B=0B = 0 form the root evaluation, the particles born at the root, and the others the late evaluation.

Mark Trees on the Dyadic Grid

For N∈ℕN \in \mathbb{N}, the grid GNG_N is the square index box of half-width NN, the set of indices p∈ℤ2p \in \mathbb{Z}^2 with |p1|≤N|p_1| \le N and |p2|≤N|p_2| \le N.✦ Fix a finest scale r>0r > 0. The dyadic scale of level kk is 2kr2^k r✦, and the grid point of index pp at scale ρ\rho is the point ρp\rho p of ℂ\mathbb{C} with coordinates ρp1\rho p_1 and ρp2\rho p_2.✦ The box norm of x∈ℂx \in \mathbb{C} is ∥x∥∞=max⁡(|Re⁡x|,|Im⁡x|)\|x\|_\infty = \max(|\operatorname{Re} x|, |\operatorname{Im} x|).✦ The tent is the function Λ(t)=max⁡(1−|t|,0)\Lambda(t) = \max(1 - |t|, 0) on ℝ\mathbb{R}✦, and the hat of index pp at scale rr is the function on ℂ\mathbb{C} φr,p(x)=Λ(Re⁡xr−p1)Λ(Im⁡xr−p2).\varphi_{r,p}(x) = \Lambda\Bigl(\frac{\operatorname{Re} x}{r} - p_1\Bigr)\, \Lambda\Bigl(\frac{\operatorname{Im} x}{r} - p_2\Bigr).(4)✦

Let vector masses vq∈ℂv_q \in \mathbb{C} be given at the indices q∈GNq \in G_N, and a real weight w(p,q)w(p, q) for each step from an index pp to an index qq. For a level kk, a real weight bb and a root q0∈GNq_0 \in G_N, the mark tree Tkb(q0)T^b_k(q_0) is the tree over GNG_N with vectors in ℂ\mathbb{C} whose terminal paths are all sequences (q1,…,qk)(q_1, \dots, q_k) in GNG_N, the leaf at (q1,…,qk)(q_1, \dots, q_k) carrying the vector bw(q0,q1)w(q1,q2)⋯w(qk−1,qk)vqk.b\, w(q_0, q_1)\, w(q_1, q_2) \cdots w(q_{k-1}, q_k)\, v_{q_k}.(5)✦ The vertex qjq_j of such a path, reached after jj steps, lies at level k−jk - j, at the grid point 2k−jrqj2^{k-j} r\, q_j, and qkq_k is the last vertex of the path.

The Claim

Theorem 1. Let TT be a finite tree over a finite index set with vectors in a normed abelian group, and CC a real function on its nodes. Then the particle evaluation of the path charge of CC is the node charge of CC: μT(C̃)=NT(C).\mu_T\bigl(\widetilde C\bigr) = N_T(C).(6)✦ Let vector masses vqv_q and step weights ww be given on GNG_N, and let k∈ℕk \in \mathbb{N}. Then the mark trees of level kk and weight 11 satisfy ∑p∈GNm(Tk1(p))=∑q∈GN|vq|.\sum_{p \in G_N} m\bigl(T^1_k(p)\bigr) = \sum_{q \in G_N} |v_q|.(7)✦ Let moreover r>0r > 0, m∈ℕm \in \mathbb{N} and q0∈GNq_0 \in G_N. If (q1,…,qm)(q_1, \dots, q_m) is an active terminal path of Tm1(q0)T^1_m(q_0), then for 0≤j≤m0 \le j \le m ∥rqm−2m−jrqj∥∞<2m−jr.\bigl\|r q_m - 2^{m-j} r\, q_j\bigr\|_\infty < 2^{m-j} r.(8)✦ If b∈ℝb \in \mathbb{R}, (q1,…,qk)(q_1, \dots, q_k) is an active terminal path of Tkb(q0)T^b_k(q_0) and x∈ℂx \in \mathbb{C} is a point with φr,qk(x)≠0\varphi_{r, q_k}(x) \neq 0, then for 0≤j≤k0 \le j \le k ∥x−2k−jrqj∥∞<2k−jr.\bigl\|x - 2^{k-j} r\, q_j\bigr\|_\infty < 2^{k-j} r.(9)✦

In the paper, the result reads: there is a finite positive measure μ\mu on pairs of a terminal path (q1,…,qm)(q_1, \dots, q_m) and a birth level BB such that μ{B≤k,(q1,…,qk)=ξ}=Mξ\mu\{B \le k,\ (q_1, \dots, q_k) = \xi\} = M_\xi for every node ξ\xi at level kk, in particular μ{B≤k,qk=q}=aq\mu\{B \le k,\ q_k = q\} = a_q and the total mass of μ\mu is Am≤VA_m \le V, the terminal position y=qmy = q_m satisfies ∥y−qs∥∞<rs\|y - q_s\|_\infty < r_s for 1≤s≤m1 \le s \le m, and the path is defined also before birth, where the levels are counted from the coarsest with scales rs=2−sr_s = 2^{-s}, the vertices qsq_s are points of the plane, aqa_q is the level mass at qq, AmA_m the sum of the level masses at the finest level mm, and V=∫|h|V = \int |h| the total mass of the vector measure hh.

In the library, the particle evaluation μT\mu_T stands for integration against μ\mu. With r=2−mr = 2^{-m}, the vertex qjq_j of Tm1(q0)T^1_m(q_0) has the scale rj=2−jr_j = 2^{-j}.

What Is Checked

The claim is stated over finite trees over a finite index set with vectors in a normed abelian group, with their total vectors, node masses, survival fractions (1), node and path charges, particle evaluation and active terminal paths, and over the mark trees of vector masses on the grid GNG_N, placed in the plane by the dyadic scales, the grid points, the box norm and the hats (4).