The 1998 paper of Ermakov, Tóth and Werner derives the scaling limits of the one-dimensional coalescing ideal gas — point particles with velocities that merge and pick a fresh velocity at each collision — through a deterministic particle-path construction read off from a càdlàg profile function , developed under the standing condition . Two steps of the program were explicitly left unwritten: the adaptation of the path construction and of the subsequent convergence proofs to arbitrary profile functions not satisfying the liminf condition, which the authors said requires only 'very slight modifications', and the complete proof of Theorem 15, the invariance principle stating that rescaled discrete coalescence times converge in distribution to the coalescence time of the coalescing flight process, which the paper says can be proven 'along similar lines as Theorem 13' and leaves to the reader. The problem — to write out both missing pieces of the proof route in the paper's intended generality, or to demonstrate precisely where the announced adaptations fail — remains open.
Background
In the one-dimensional coalescing ideal gas, point-like particles sit on the lattice (or on the line), move ballistically with velocities , and when two particles collide they merge into one particle which chooses a fresh velocity , each with probability ; a standard initial condition assigns to each site an independent exponential mass with a random sign, the sign fixing the initial velocity. The model was introduced by Ermakov, who derived exact identities in law for the infinitely extended system. Its macroscopic theory was derived by Ermakov, Tóth and Werner in the paper from which this problem is taken; the annihilating counterpart of the model, and the scaling limit of its height function, had been treated earlier by Belitsky and Ferrari. Coalescing systems of this kind go back to Arratia's coalescing random walks — random walks on the lattice that merge into a single walk when they meet — and their diffusion-scale limiting point processes.
The paper's proof route is deterministic at its core. A configuration of the system is encoded by a càdlàg profile function ( denotes the space of right-continuous real functions with left limits): records the signed mass accumulated between points, the initial profile being for (and analogously for , with ), where is the signed charge of the particle at site ; hats distinguish discrete, lattice quantities from their continuum counterparts. Under this encoding the time evolution is the semigroup of operators an 'erosion' of the profile at unit speed: the profile of the gas at time is , which for has locally bounded variation and decomposes into alternating monotone pieces, the particles of the deterministic picture.
Individual particle trajectories are read off from the profile as follows. For a level let and , and write and ; for a target time let . For at which is not constant in any neighbourhood, the particle started at is at time located at , defined by interpolating linearly between the points as the level decreases past . The construction yields 1-Lipschitz paths which coalesce upon meeting, with coalescence time for . This construction, and the proofs built on it, are made under the standing condition which guarantees that and are finite.
The main results are invariance principles (functional central limit theorems in the spirit of Donsker's theorem for partial sums). Under hyperbolic rescaling of space and time (, ) with diffusive normalization of the amplitude, the random initial profile of the gas converges to a two-sided Brownian motion (Brownian motion indexed by the whole line with ), and, by continuity of the map , the evolved profile converges to . The tagged-particle trajectories (a tagged particle is one whose individual trajectory is followed through the evolution) converge jointly — for any finite set of tagged particles — to the coalescing flight process: a collection of unit-speed, piecewise-linear paths which coalesce upon meeting, a single one being distributed as the 'Brownian flight' built from a Brownian motion , so that its turning instants are the zeros of . The paper also identifies the law of the limiting coalescence time between two flights: , where and is an independent positive stable(1/2) random variable, i.e. a variable with density on .
Two parts of this program were not written out. First, the whole path construction is developed only under the liminf condition above; the authors remark that it could be adapted to a general 'with very slight modifications', but no such adaptation is given. Second, Theorem 13 (the joint invariance principle for finitely many tagged trajectories) is proved via an almost-sure continuity lemma for and Donsker convergence of the rescaled profiles, while the analogous invariance principle for coalescence times, Theorem 15 — asserting that the rescaled discrete coalescence time of the two particles started near and converges in distribution to — is stated with the remark that it can be proven along similar lines as Theorem 13 and is left to the reader.
Problem Statement
Complete the rigorous exposition of the Ermakov–Tóth–Werner scaling-limit program for the one-dimensional coalescing ideal gas by carrying out the two pieces of the particle-path proof route that the source paper explicitly leaves unwritten. The two pieces serve one objective — that the paper's announced invariance principles hold with full written proofs in the generality the paper intends — and they are linked: the first widens the class of initial data for which the route is valid, while the second closes the one stated theorem whose proof the route was announced to yield but was never written.
(1) General profile functions. Write out, with full proofs, the adaptation of the particle-path construction (defined through the level-set quantities , , , and the level ) to arbitrary càdlàg profile functions that do not satisfy the standing condition — for example bounded, eventually increasing, or compactly supported profiles. This deterministic adaptation must establish, for such profiles and with full proofs, each of the following three components, all of which are required: the path properties (the 1-Lipschitz property, the positive homogeneity, i.e. the scale-invariance for , and the coalescence-time formula ); the identification of the discrete gas trajectories with ; and the continuity property of that replaces the paper's Lemma 14 and is the general-profile ingredient of the convergence arguments for the invariance principles.
(2) Proof of Theorem 15. Provide a complete written proof of the invariance principle for coalescence times: for the coalescing ideal gas on with i.i.d. exponential masses and independent signs, and fixed , the rescaled coalescence time of the two particles started at and converges in distribution as to , the coalescence time of the two coalescing flights started at and in the Brownian profile. The paper states that this can be proven along similar lines as Theorem 13; no proof or sketch is given.
Either of the two deliverables may in fact be impossible as claimed. A refutation of (1) must show that, for some càdlàg profile without the liminf condition, the construction or one of its required properties — the path properties, the identification of the discrete gas trajectories, or the continuity property — fails, and must delimit the maximal class of càdlàg profiles for which the construction and those properties do hold. A refutation of (2) must show that the stated convergence of the rescaled lattice coalescence times fails, and must identify the class of initial conditions, or the corrected limiting statement, that replaces it.
References
- Alexei Ermakov, Bálint Tóth and Wendelin Werner (1998), On Some Annihilating and Coalescing Systems, Journal of Statistical Physics 91, no. 5-6, 845–870, DOI 10.1023/A:1023071714672, https://doi.org/10.1023/A:1023071714672
- Alexei Ermakov (1997), Exact probabilities and asymptotics for the one-dimensional coalescing ideal gas, Stochastic Processes and their Applications 71, no. 2, 275–284, DOI 10.1016/S0304-4149(97)00077-X, https://doi.org/10.1016/S0304-4149(97)00077-X
- Vladimir Belitsky and Pablo A. Ferrari (1995), Ballistic annihilation and deterministic surface growth, Journal of Statistical Physics 80, no. 3-4, 517–543, DOI 10.1007/BF02178546, https://doi.org/10.1007/BF02178546
- Richard Arratia (1981), Limiting point processes for rescalings of coalescing and annihilating random walks on Z^d, Annals of Probability 9, no. 6, 909–936, DOI 10.1214/aop/1176994264, https://doi.org/10.1214/aop/1176994264
- Yevgeniy Kovchegov and Ilya Zaliapin (2020), Dynamical Pruning of Rooted Trees with Applications to 1-D Ballistic Annihilation, Journal of Statistical Physics 181, no. 2, 618–672, DOI 10.1007/s10955-020-02593-1, arXiv:1707.01984, https://arxiv.org/abs/1707.01984
- Vladas Sidoravicius and Laurent Tournier (2017), Note on a one-dimensional system of annihilating particles, Electronic Communications in Probability 22, paper no. 59, 9 pp., DOI 10.1214/17-ECP83, arXiv:1610.05955, https://arxiv.org/abs/1610.05955
- Steven N. Evans, Ben Morris and Arnab Sen (2013), Coalescing systems of non-Brownian particles, Probability Theory and Related Fields 156, 307–342 (online first 10 April 2012), DOI 10.1007/s00440-012-0429-0, arXiv:0912.0017, https://arxiv.org/abs/0912.0017
- Steven N. Evans (2008), Probability and Real Trees, Lecture Notes in Mathematics 1920, Springer, DOI 10.1007/978-3-540-74798-7, https://doi.org/10.1007/978-3-540-74798-7
- Vladimir Belitsky and Pablo A. Ferrari (2005), Invariant Measures and Convergence Properties for Cellular Automaton 184 and Related Processes, Journal of Statistical Physics 118, no. 3-4, 589–623, DOI 10.1007/s10955-004-8822-4, https://doi.org/10.1007/s10955-004-8822-4
- Nicolas Broutin and Jean-François Marckert (2020), The combinatorics of the colliding bullets, Random Structures & Algorithms 56, no. 2, 401–431 (online first 19 June 2019), DOI 10.1002/rsa.20869, https://doi.org/10.1002/rsa.20869
- John Haslegrave, Vladas Sidoravicius and Laurent Tournier (2021), Three-speed ballistic annihilation: phase transition and universality, Selecta Mathematica (New Series) 27, no. 5, article no. 84, DOI 10.1007/s00029-021-00701-x, https://doi.org/10.1007/s00029-021-00701-x
- Matthew Junge and Hanbaek Lyu (2022), The phase structure of asymmetric ballistic annihilation, Annals of Applied Probability 32, no. 5, 3797–3816, DOI 10.1214/21-aap1773, https://doi.org/10.1214/21-aap1773
- Brittany Dygert, Christoph Kinzel, Matthew Junge, Annie Raymond, Erik Slivken and Jennifer Zhu (2019), The bullet problem with discrete speeds, Electronic Communications in Probability 24, paper no. 27, 11 pp., DOI 10.1214/19-ECP238, https://doi.org/10.1214/19-ECP238
- Luis Benitez, Matthew Junge, Hanbaek Lyu, Maximus Redman and Lily Reeves (2023), Three-velocity coalescing ballistic annihilation, Electronic Journal of Probability 28, paper no. 56, 18 pp., DOI 10.1214/23-EJP948, https://doi.org/10.1214/23-EJP948
- Darío Cruzado Padró, Matthew Junge and Lily Reeves (2024), Arrivals are universal in coalescing ballistic annihilation, Latin American Journal of Probability and Mathematical Statistics (ALEA) 21, 837–848, DOI 10.30757/alea.v21-34, https://doi.org/10.30757/alea.v21-34