Fleming-Viot couples live forever

We prove a non-extinction result for Fleming-Viot-type systems of two particles with dynamics described by an arbitrary symmetric Hunt process under the assumption that the reference measure is finite. Additionally, we describe an invariant measure for the system, we discuss its ergodicity, and we prove that the reference measure is a stationary measure for the embedded Markov chain of positions of the surviving particle at successive branching times.


INTRODUCTION
Consider a Hunt process X(t) on a state space D, with a possibly finite lifetime ζ.The Fleming-Viot system of K 2 particles is a collection of K processes Xk (t), which evolve as follows.The particles are independent copies of X(t) up to the random time τ 1 when one of the particles reaches its lifetime.Instead of dying, however, this particle immediately jumps to the position of a randomly chosen other particle.Then the particles again evolve as independent copies of X(t) until one of them reaches its lifetime, at a random time τ 2 , and so the process continues.
Alternatively, one can think that a randomly chosen particle branches into two whenever some particle dies.For this reason, the random times τ n described above are often called branching times.One expects that, under reasonable assumptions, the branching times τ n diverge to infinity, and so the Fleming-Viot system is welldefined for every t ∈ (0, ∞).It is known, however, that in some cases the limit τ ∞ = lim n→∞ τ n can be finite with positive probability, and then there is no obvious way to extend the evolution of the Fleming-Viot system past τ ∞ .Therefore, we say that extinction, or branching explosion, occurs at τ ∞ whenever it is finite.
The main result of this paper deals with just K = 2 particles.Note that in this case at each branching time there is only one surviving particle, and so both particles occupy the same location at each branching time.Our key assumption is that the Hunt processes X(t) is self-dual (or symmetric) with respect to a finite reference measure m.Here by self-duality we simply mean that the transition operators of X(t) are self-adjoint on L 2 (m).
Theorem 1.1.Consider the Fleming-Viot system of two particles evolving according to a self-dual Hunt process on a state space D with a finite reference measure m.For almost every initial configuration of the two particles, either (a) on D × D (with respect to the product measure m × m); or (b) on the diagonal of D × D (with respect to the measure with marginals m), extinction never happens.
Remark 1.2.The Fleming-Viot system of particles following the Brownian motion was introduced in [6,7].A non-extinction result was stated already in [7], but the proof given there has an error.This led to an open problem which has been resolved only for sufficiently regular domains.More precisely, non-extinction was established rigorously in [15] under the assumption that the domain satisfies the interior and exterior cone conditions, and the interior cone has a sufficiently large aperture.The result of [15] also covers particles following a general diffusion with smooth coefficients.A very similar result was simultaneously proved in [2] for Lipschitz domains with a sufficiently small Lipschitz constant, as well as for systems of two particles in polyhedral domains.
Our Theorem 1.1 shows that no regularity is needed for Fleming-Viot systems of two Brownian particles, and that the Brownian motion can be replaced by an arbitrary self-dual Hunt process with a finite reference measure.The question for Fleming-Viot systems of more than two particles, however, remains open.
We mention here a related stream of research [1,4,5,8,21] on the spine (the path of the surviving particle) of the Fleming-Viot system.In particular, the results of the present paper are used in [5] to show that for Fleming-Viot systems of two particles following the Brownian motion in an interval, the spine does not coincide with the Brownian motion conditioned to live forever.Remark 1.3.Self-duality is an essential assumption in Theorem 1.1.For example, if D = (0, 1) and X(t) is the uniform motion to the left (that is, X(t) = X(0) − t for t less than the life-time ζ = X(0)), then τ ∞ = max{ X1 (0), X2 (0)} is always finite.
We expect that for many self-dual Hunt processes on state spaces D with an infinite reference measure m the assertion Theorem 1.1 holds true, but the assumption that m is finite cannot be completely removed.In other words, if m is an infinite measure, then the system may become extinct in finite time with positive probability.For example, Theorem 1.1(a) in [3] asserts that Bessel processes of negative dimension lead to Fleming-Viot systems of two particles with τ ∞ < ∞ almost surely; see also Example 5.7 in [2].We note that a Bessel process of dimension ν ∈ R is a self-dual Hunt process on (0, ∞), but the reference measure r ν−1 dr has infinite mass near the origin when ν 0.
Under mild additional assumptions, Theorem 1.1 holds for every initial configuration.This is illustrated by the following result, which clearly covers the case of Brownian particles.
Corollary 1.4.Consider the Fleming-Viot system of two particles evolving according to a self-dual Hunt process X(t) on a state space D with a finite reference measure m.Suppose that the one-dimensional distributions of X(t) are absolutely continuous with respect to m for every t > 0 and every starting point X(0) ∈ D.
Then, the Fleming-Viot system of two particles never becomes extinct, regardless of the initial configuration of the particles.
Let G(x, dy) be the potential kernel of X(t):  We say that the Hunt process X(t) is irreducible if for every Borel set A ⊆ D such that m(A) > 0 we have G(x, A) > 0 for almost every x ∈ D. By Theorems 6 and 29 in [19], irreducibility is equivalent to the following property: for every t > 0 and every Borel set A ⊆ D such that m(A) > 0 we have P x (X(t) ∈ A) > 0 for almost every x ∈ E; for further equivalent definitions, we refer to [19].In addition to Theorem 1.1, we prove the following result on ergodicity of Fleming-Viot systems of two particles.
Theorem 1.5.Consider the Fleming-Viot system of two particles ( X1 (t), X2 (t)) evolving according to a self-dual Hunt process X(t) on a state space D with a finite reference measure m.If G is finite (or, more generally, if the measure G(x, dy)m(dx) is σ-finite), then G(x, dy)m(dx) is an invariant measure for ( X1 (t), X2 (t)).
If G is finite and additionally X(t) is irreducible, then, for every nonnegative Borel function ϕ on D × D and for almost every initial configuration of the two particles (with respect to either the product measure m × m or the measure m on the diagonal of D × D, as in Theorem 1.1), the ergodic averages of ϕ( X1 (t), X2 (t)) converge with probability one: The above theorem is closely related to the following result on the embedded Markov chain of branching positions.
Corollary 1.6.Consider the Fleming-Viot system of two particles evolving according to a self-dual Hunt process X(t) on a state space D with a finite reference measure m, and assume that the branching times are finite with probability one.Let Z n denote the position of the surviving particle at the nth branching time τ n .Then Z n is a conservative Markov chain, and m is a stationary measure for Z n .Remark 1.7.Let us discuss the assumptions in Theorem 1.5 and Corollary 1.6.By definition, G = D E x ζm(dx).Therefore, if G is finite, then P x (ζ < ∞) = 1 for almost every x ∈ D, and hence the branching times τ n are finite with probability one for almost every initial configuration (with respect to both the product measure m × m and the measure on the diagonal with marginals m).Converse implication need not be true, but if P x (ζ < ∞) = 1 for almost every x ∈ D, then G(x, dy)m(dx) is a σ-finite measure; see, for example, items (iv) and (v) of Proposition (2.2) in [12].
Let us define D 0 = {x ∈ D : P x (ζ < ∞) = 1}.As it was kindly pointed out by the referee, for a self-dual Hunt process X(t) on a state space D with a finite reference measure m, it can be proved that D 0 is an invariant set, and P x (ζ = ∞) = 1 for almost every x ∈ D \ D 0 (see Remark 3.3).From the point of view of Fleming-Viot systems of particles, we can safely ignore D\D 0 , or, in other words, we may restrict our attention to the case when P x (ζ < ∞) = 1 for almost every x ∈ D. Thus, the assumptions in the first part of Theorem 1.5 and in Corollary 1.6 are quite natural and not restrictive.We refer to [13] for further discussion.
The remaining part of the paper is divided into four sections.In Section 2 we illustrate the main idea of the proof when X(t) is the standard Brownian motion in a smooth domain in R d .In Section 3 we consider two independent copies of the underlying Hunt process X(t).This part contains two auxiliary lemmas, which describe the location of the surviving particle when the other one dies.Section 4 contains the proof of Theorem 1.1, while in Section 5 we prove Theorem 1.5.

IDEA OF THE PROOF
Let us consider a Fleming-Viot system of two particles, that from now on we denote by ( X(t), Ȳ (t)) rather than ( X1 (t), X2 (t)).In this section we assume that X(t) and Ȳ (t) evolve as independent Brownian motions in a smooth, bounded Euclidean domain D, and whenever one of the particles hits the boundary, it immediately jumps to the position of the other particle.The key idea of our proof lies in the following observation.Its refined variant, Lemma 3.2, is proved rigorously in Section 3.With the above result at hand, the remaining part of the proof of Theorem 1.1 is fairly simple.The sequence (Z n , σ n ) of branching locations Z n = X(τ n ) = Ȳ (τ n ) and gaps between branching times σ n = τ n − τ n−1 forms a stationary Markov chain, and hence, by the ergodic theorem, τ n /n converges to a positive limit with probability one.In particular, τ ∞ = lim n→∞ τ n is necessarily infinite, that is, there is no extinction.
We remark that our proof of Theorem 1.1 in Section 4 uses the full statement of Lemma 3.2 rather than just Proposition 2.1, and it is in fact even simpler than the argument sketched above.
Our proof of Proposition 2.1 (or Lemma 3.2) in the next section uses relatively standard, but rather abstract tools from the theory of Markov processes.For this reason, we think it will be instructive to discuss first a more direct approach to Proposition 2.1 for Brownian particles in a smooth domain D. While the two arguments (the one that follows and the actual proof in Section 3) may appear quite different, in fact both of them follow the same line: we identify the occupation density of the bivariate process with the Green function of D (using an analytic approach in Step 1 below, and a probabilistic reasoning in Lemma 3.1), and then we determine the distribution at the first branching time (expressing it in terms of the Poisson kernel of D in Step 2 below, and using resolvent techniques in Lemma 3.2).Sketch of the proof of Proposition 2.1.We divide the argument into three steps.
Step 1.Let G D (x, y) denote the usual Green function in D. That is, we have G D (x, y) = G D (y, x), for every y ∈ D the function x → G D (x, y) vanishes continuously on the boundary of D, and we have in the sense of distributions.Here ∆ x stands for the Laplace operator in R d acting on the variable x, and δ y is the Dirac delta at y.By symmetry, It follows that, as a bivariate function, the Green function satisfies Here and below we denote by δ the uniform measure on the diagonal of D × D: δ(dx, dy) = δ x (dy)dx = δ y (dx)dy.
Since G D (x 1 , x 2 ) converges to zero on the boundary of D × D, Green's third identity implies that Here G D×D ((x 1 , x 2 ), (y 1 , y 2 )) denotes the Green function in D × D.
Step 2. Consider the 2d-dimensional Brownian motion (X(t), Y (t)) in D × D, absorbed at the boundary, and denote by τ the hitting time of the boundary.By Kakutani's formula for the solution of the Dirichlet problem, if (X(0), Y (0)) = (x 1 , x 2 ), then the density function of the distribution of (X(τ ), Y (τ )) on the boundary of Here ∂ ∂ν | z denotes the inward normal derivative on the boundary of D evaluated at a point z ∈ ∂D.
It follows that if the initial position (X(0), Y (0)) is uniformly distributed over the diagonal of D × D, then the density function of the distribution of (X(τ ), Y (τ )) is given by and hence it is the inward normal derivative on the boundary of In other words, But the inward normal derivative (with respect to y) of the Green function in D, G D (x, y), is the Poisson kernel in D, P D (x, z).Thus, What we have found above implies that for every Borel set A ⊆ D, However, the integral of P D (x, y) over y ∈ ∂D is equal to one, and so that is, Z is uniformly distributed over D.
Step 3. Let us now consider the Fleming-Viot pair X(t) and Ȳ (t) evolving as independent Brownian motions in D, but whenever either particle hits the boundary of D, it is immediately resurrected at the location of the other particle.We suppose that X(0) = Ȳ (0) is uniformly distributed over D, and we claim that in this case also the first branching location Z 1 = X(τ 1 ) = Ȳ (τ 1 ) is uniformly distributed over D.

WHERE WERE YOU
In this section we prove an auxiliary result, which describes the distribution of the position of the Hunt process X(t) at the lifetime of its independent copy.This turns out to be the key ingredient of the proof of Theorem 1.1 in the next section.
Suppose that X(t) is a self-dual Hunt processes with state space D ∪{∂}, where ∂ is a cemetery point, and a finite reference measure m.By F t we denote the natural filtration of X(t).For notational convenience, with no loss of generality we assume that m is a probability measure.As it is customary, we adopt the convention that X(∞) = ∂, and that if f is a function on D, then we automatically extend f to D ∪ {∂} so that f (∂) = 0. We denote by 1 the constant one on D; note, however, that 1(∂) = 0. We also write f, g for the inner product of f, g ∈ L 2 (m).Finally, we denote by δ the measure concentrated on the diagonal of D × D with marginals m, δ(dx, dy) = δ x (dy)m(dx) = δ y (dx)m(dy).
We write P x for the probability corresponding to the process X(t) started at X(0) = x.We denote by ζ the lifetime of X(t), by p t (x, A) = P x (X(t) ∈ A) the transition kernel of X(t), and by the transition operators P t of the process X(t), defined whenever the expectation or the integral is well-defined.Then P t form a strongly continuous semigroup of self-adjoint contractions on L 2 (D, m).We also define the resolvent kernel and the resolvent operators defined whenever λ 0 and the double integral on the right-hand side is welldefined.Note that for λ = 0 we recover the potential kernel G(x, dy) = u 0 (x, dy) discussed in the introduction.For further information about Hunt processes and their transition and resolvent operators, we refer to [9].Suppose that Y (t) an independent copy of X(t).Let us write P x,y for the probability corresponding to processes X(t) and Y (t) started at X(0) = x and Y (0) = y, and P δ for the probability corresponding to processes X(t) and Y (t) started at a random point X(0) = Y (0) with distribution m: We stress that under P δ , the processes X(t) and Y (t) are not independent.Denote by ζ X , ζ Y the lifetimes of X(t) and Y (t), respectively.We view the bivariate process (X(t), Y (t)) as a Hunt process on state space (D ∪ {∂}) × (D ∪ {∂}), with lifetime max{ζ X , ζ Y }, and cemetery state (∂, ∂).Clearly, for every Borel sets A, B ⊆ D ∪ {∂}, for every Borel functions f, g on D ∪ {∂}, and for every x, y ∈ D, Here we abuse the notation by setting p t (x, {∂}) = 1 − p t (x, D).
Symmetry (or self-duality) of X(t) allows us to link the resolvent kernels of the bivariate process (X(t), Y (t)) and the original process X(t).Lemma 3.1.For bounded Borel functions f and g and λ > 0, or for nonnegative Borel functions f and g and λ 0, we have Note that since we agreed that f (∂) = g(∂) = 0, we have f (X(t))g(Y (t)) = 0 when t min{ζ X , ζ Y }.Thus, the integral in (3.1) is effectively over t ∈ [0, min{ζ X , ζ Y }). Proof.Clearly, Using the fact that P t is self-adjoint and the semigroup property, we find that E δ f (X(t))g(Y (t)) = f, P t P t g = f, P 2t g .
Our next result is a refined version of Proposition 2.1.Before we state it, we We also agree that e −∞ = 0.
Lemma 3.2.If f is a bounded Borel function and λ > 0, then When λ = 0 and P x (ζ X < ∞) = 1 for almost all x ∈ D, then we have Remark 3.3.Self-duality of X(t) and finiteness of m imply that P arguing as in (3.2), we have Therefore, f (x) − (f (x)) 2 is a nonnegative function with integral zero.This is only possible if f (x) ∈ {0, 1} for almost every x ∈ D, as claimed.Additionally, f = P t f for every t > 0, and hence the set of x ∈ D such that P x (ζ X < ∞) = 1 is an invariant set.Thus, if X(t) is irreducible, then either X(t) is conservative (in the sense that We refer to [19] for a closely related discussion. Remark 3.4.One can prove that X(t) has an exit law ℓ t (x) such that if s, t > 0, then P s ℓ t (x) = ℓ t+s (x) for almost every x ∈ D, and P x (ζ X ∈ dt) = ℓ t (x)dt on (0, ∞) for almost every x ∈ D. Thus, using independence of X(t) and ζ Y , we have ∞ 0 e −λs f, ℓ s ds.
Undoing the initial steps, we conclude that and Lemma 3.2 follows.The above argument, kindly suggested by the referee, is very elegant and insightful, but it depends on the existence of the exit law ℓ t (x).
This fact can be proved using Proposition (3.7) in [10] and an appropriate approximation argument, similar to the one given below; see also [13].With some effort, one can also extend Lemma 3.2 to the case of a σ-finite reference measure m.However, we choose to restrict our attention to finite reference measures m, and we give a slightly longer, but more elementary proof.
Proof.The idea of the proof is to apply Lemma 3.1 to f and L1, where L denotes the generator of the process X(t).However, 1 typically fails to be in the domain of L.
Let µ > λ > 0, and let g = µ1 − µ 2 U µ 1.Our goal is to apply Lemma 3.1 to f and g, simplify both sides of (3.1), and pass to the limit as µ → ∞.We divide the proof into three steps.
It follows that Finally, since 1(X(t)) = 1 when t < ζ X and 1(X(t)) = 0 for t ζ X , we have The above identity links the right-hand side of (3.1) and the right-hand side of (3.3).
Step 2. For x, y ∈ D ∪ {∂} we have Using the above formula and the Markov property (with the usual abuse of notation), alongside with Fubini's theorem, we find that Since f is bounded and e −2λ(ζ Y −v/µ) 1, the dominated convergence theorem applies, and we conclude that This identity provides a link between the left-hand sides of (3.1) and (3.3).
Step 3. The desired result for λ > 0 follows now from (3.5) and (3.6), combined with Lemma 3.1.Finally, the result for λ = 0 is shown by passing to the limit as λ → 0 + and using the dominated convergence theorem.
We will need the following simple property: This follows easily from the fact that the semigroup P t is analytic (see Theorem 1 in Section III.1, p. 67, in [20]).Indeed: the function P δ (ζ X > s, ζ Y > t) = P s 1, P t 1 is real-analytic with respect to s, t > 0, and so the joint distribution of (ζ X , ζ Y ) under P δ is absolutely continuous on (0, ∞)×(0, ∞) (with a real-analytic density function).Alternatively, one can derive (3.7) from formula (3.4) with f = 1, with a minor twist when P δ (ζ X = ∞) ∈ (0, 1) (which is only possible when X(t) is not irreducible).For a closely related result, see Proposition (3.7) in [10] or Proposition (6.20)(i) in [14].
We define the random time and the random variable Recall that f (X(t))g(Y (t)) = 0 when t σ.Thus, Lemma 3.1 reads When λ > 0 and f = g = 1, we obtain On the other hand, setting λ = 0 and f = g = 1 leads to ).Thus, the assumption that G is finite in Theorem 1.5 is equivalent to finiteness of E δ σ.
We now rephrase Lemma 3.2.Note that e and both sides are equal to zero otherwise.Thus, formula (3.3) can be written as By symmetry, and therefore By considering λ = 0, we find that if P x (ζ X < ∞) = 1 for almost all x ∈ D, then a property that was stated as Proposition 2.1 in the previous section, and proved with a more direct approach when X(t) is the Brownian motion.

WE'LL MEET AGAIN
We are now ready to prove Theorem 1.1.This is done below, after the Fleming-Viot system of two particles is introduced in a more careful way.
As in the previous section, we consider a self-dual Hunt process X(t) on a state space D with a finite reference measure m, and its independent copy Y (t).Again with no loss of generality we assume that m is a probability measure.In this section we consider the corresponding Fleming-Viot system of two particles: a bivariate process ( X(t), Ȳ (t)) which evolves just as (X(t), Y (t)), except that at an increasing sequence of branching times τ n the coordinate that is about to die, reenters the state space D at the position of the other coordinate.
More precisely, the Fleming-Viot system ( X(t), Ȳ (t)) is constructed recursively.We let τ 0 = 0, and we let Z 0 to be a random variable taking values in D, with distribution m.Once τ n−1 ∈ [0, ∞) and Z n−1 ∈ D are given, and X(t) and Ȳ (t) are defined on [0, τ n−1 ), we proceed as follows.We sample an independent copy (X n (t), Y n (t)) of the bivariate process (X(t), Y (t)) started at the random position (Z n−1 , Z n−1 ), and we denote the corresponding variables σ and Z by σ n and Z n .
That is, We define We denote the probability corresponding to the above construction by Pδ to em- phasise that the initial configuration of the particles is distributed according to the measure δ on the diagonal of D × D with marginals m.
Exactly the same construction can be carried out for an arbitrary distribution of the initial configuration of the two particles.If X(0) = x and Ȳ (0) = y with probability one, we write Px,y for the corresponding probability.If X(0) and Ȳ (0) are drawn independently from distribution m, we denote the corresponding probability by Pm×m .More generally, for an arbitrary probability measure µ on D × D we write Pµ = D×D Px,y µ(dx, dy) for the probability corresponding to the system of particles with initial configuration ( X(0), Ȳ (z)) chosen randomly from distribution µ.Clearly, for any event E we have
Below we restate, and then prove, Theorem 1.1.For convenience, we show items (a) and (b) of Theorem 1.1 separately, as Corollary 4.2 and Theorem 4.1, respectively.Theorem 4.1.Consider the Fleming-Viot system ( X(t), Ȳ (t)) of two particles evolving according to a self-dual Hunt process X(t) on a state space D with a finite reference measure m.For almost every x ∈ D (with respect to m), if the initial configuration is X(0) = Ȳ (0) = x, then the system never becomes extinct.
Proof.With no loss of generality we assume that m is a probability measure.
. This means that Z 1 is defined in terms of X 1 (t) and Y 1 (t) in the same way as the random variable Z was constructed in (3.8) using X(t) and Y (t).
By the strong Markov property and (3.10), we have However, E x e −λζ X < 1 for every x ∈ D. It follows that f (x) = 0 for almost every x ∈ D, that is, τ ∞ = ∞ with probability Px,x one for almost every x ∈ D.
Claim (b) in Theorem 1.1 is thus proved.In order to extend this result to almost all initial configurations ( X(0), Ȳ (0)) = (x, y) with respect to the product measure m × m, as in claim (a), we need one more step.
Corollary 4.2.The result of Theorem 4.1 remains true for almost every initial configuration X(0) = x, Ȳ (0) = y (with respect to the product measure m × m), and also when the distribution of ( X(0), Ȳ (0)) is absolutely continuous with respect to m × m.
Proof.Again, with no loss of generality we assume that m is a probability measure.Suppose that the initial position of ( X(t), Ȳ (t)) is chosen randomly according to the product measure m × m, and recall that we denote the corresponding probability by Pm×m .As in the proof of Theorem 4.1, we observe that up to the first branching time τ 1 , we have X(t) = X 1 (t) and Ȳ (t) = Y 1 (t), where X 1 (t) and Y 1 (t) are independent copies of the underlying Hunt process X(t), and both are started independently at a random position in D chosen according to the measure m.Furthermore, we have If P m corresponds to the process X(t) started at a random position X(0) with distribution m, then we obtain and since P t is self-adjoint, we have Therefore, In particular, the distribution of Z 1 is absolutely continuous with respect to m.
By the strong Markov property, the shifted process ( X(τ 1 +t), Ȳ (τ 1 +t)) is the same Fleming-Viot particle system, with initial configuration (Z 1 , Z 1 ).Above we proved that the distribution of Z 1 under Pm×m is absolutely continuous with respect to m.
Thus, using the strong Markov property and Theorem 4.1, we find that that is, the system never becomes extinct.By (4.1) (with µ = m × m), we conclude that τ ∞ = ∞ with probability Px,y one for almost every pair x, y.
The latter assertion of the lemma follows immediately from the former by (4.1) and Fubini.Alternatively, one can repeat the above argument with the initial configuration distributed according to a given absolutely continuous distribution rather than m × m.
Of course, this proves claim (a) of Theorem 1.1, and so the proof of our main result is complete.
Proof of Corollary 1.4.Suppose that X(t) and Ȳ (t) are started at fixed points x and y, respectively.Then the processes X(t) and Ȳ (t) are independent up to the first branching time τ 1 .By the same argument as in the proof of Corollary 4.2, the distribution of Z 1 is a mixture of the one-dimensional distributions of the underlying Hunt process X(t), and hence, by assumption, it is absolutely continuous with respect to m.The remaining part of the proof is exactly the same as in the proof of Corollary 4.2.
Proof.Recall that G(x, dy) = u 0 (x, dy), and that the process ( X(t), Ȳ (t)) up to the first branching time τ 1 is a copy of the process (X(t), Y (t)) up to time σ = min{ζ X , ζ Y }.Thus, formula (3.9) implies that We now show a variant of the resolvent equation, with one integral over (0, ∞) and the other one over (0, τ 1 ).Using the Markov property, we find that We study each of the terms on the right-hand side.For the first one, by equality of ( X(t), Ȳ (t)) and (X(t), Y (t)) up to the first branching time, and by (3.9) with λ = 0, x)g(y)G(x, dy)m(dx). (5.3) In order to transform the third term, we apply the strong Markov property: By the definition of ϕ, we have (5.4) Combining (5.3) and (5.4) with (5.2), we find that The last three terms on the right-hand side cancel out, and the desired result follows.
Proof of Theorem 1.5.We divide the argument into three parts.
Step 2. Extension to the case when G(x, dy)m(dx) is a σ-finite measure is immediate, except that we need to work with the infinite measure µ(dx, dy) = G(x, dy)m(dx) (without the normalisation constant G −1 ).We leave it to the interested reader to verify that the above proof carries over to this setting.
Step 3. The second assertion of Theorem 1.5 follows now from Birkhoff's ergodic theorem for Markov processes.Indeed: suppose that ϕ is a nonnegative Borel function on D × D. By the ergodic theorem given in Corollary 25.9 in [17], the limit
Below we prove that irreducibility of X(t) implies that I is trivial: it only contains events of probability Pµ zero or one.This implies that M = Ēµ ϕ( X(0), Ȳ (0)) = with probability Pµ one, completing the proof of the theorem.It remains to show that I is trivial.This follows by a standard argument, which is however difficult to find in literature, and so we provide full details.Recall that we assume irreducibility of X(t): if m(A) > 0 and t > 0, then P x (X t ∈ A) > 0 for almost every x ∈ D, and our goal is to prove that if I is an invariant event for ( X(t), Ȳ (t)), in the sense that the time-shifts leave I unchanged, then Pµ (I) is either zero or one.
By Lemma 1 in [11], for every invariant event I we have Pµ 1 I = 1 B ( X(0), Ȳ (0)) = 1 for some invariant Borel set B ⊆ D × D. That is, for every t > 0 we have Px,y (( X(t), Ȳ (t)) ∈ B) = 1 B (x, y) for almost every (x, y) ∈ D × D with respect to the measure µ.Since the product measure m × m is absolutely continuous with respect to µ(dx, dy) = G −1 G(x, dy)m(dx), the above property also holds for almost every (x, y) ∈ D × D with respect to m × m.It follows that for every t > 0, P x,y ((X(t), Y (t)) ∈ B) 1 B (x, y) for almost every (x, y) ∈ D × D (with respect to m × m).On the other hand, irreducibility of X(t) and Y (t) and independence of these processes imply that if m × m(B) > 0, then for almost every (x, y) ∈ D × D we have P x,y ((X(t), Y (t)) ∈ B) > 0.
Thus, if m × m(B) > 0, then 1 B (x, y) > 0 for almost every (x, y) ∈ D × D, that is, B is of full measure m × m.We conclude that either B or its complement has zero measure m × m.In the former case Pµ (I) = 0, while in the latter Pµ (I) = 1, and so I is indeed trivial. dy)m(dx).

Proposition 2 . 1 .
If the Fleming-Viot pair of particles is started at a random point distributed uniformly over the diagonal of D × D, then at the first branching time the particles are again distributed uniformly on the diagonal of D × D.
Recall that the Poisson kernel is the inward normal derivative of the Green function (with respect to the second variable) on the boundary ∂(D × D) = (∂D × D) ∪ (D × ∂D): (s), Ȳ (s))ds .