Convergence of path measures arising from a mean field or polaron type interaction

Size: px
Start display at page:

Download "Convergence of path measures arising from a mean field or polaron type interaction"

Transcription

1 Convergence of path measures arising from a mean field or polaron type interaction Erwin Bolthausen 1, Jean-Dominique Deuschel 2, and Uwe Schmock 1 1 Institut für Angewandte Mathematik der Universität Zürich, Rämistr. 74, CH-81 Zürich, Switzerland 2 Mathematik, ETH Zentrum, CH-892 Zürich, Switzerland Received February 1, 1992; accepted June 24, 1992 Summary. We discuss the iting path measures of Markov processes with either a mean field or a polaron type interaction of the paths. In the polaron type situation the strength is decaying at large distances on the time axis, and so the interaction is of short range in time. In contrast, in the mean field model, the interaction is weak, but of long range in time. Donsker and Varadhan proved that for the partition functions, there is a transition from the polaron type to the mean field interaction when passing to a it by letting the strength tend to zero while increasing the range. The discussion of the path measures is more subtle. We treat the mean field case as an example of a differentiable interaction and discuss the transition from the polaron type to the mean field interaction for two instructive examples. Keywords. maximum entropy principle large deviations weak convergence polaron problem mean field interaction interacting Markov processes 1. Introduction Let {X t } t be a Markov process with Polish state space E. We assume that the sample paths are in (C([, ), E), F) or(d([, ), E), F), where F denotes the corresponding Borel σ-algebra. Let V : E 2 R be a suitable function. A mean field interaction between positions at different points of time, which has often been considered, is given by the Hamiltonian H T = 1 T T T V (X s,x t ) ds dt, T >, (1.1) Research supported by the Swiss National Foundation ( )

2 2 E. Bolthausen, J.-D. Deuschel, and U. Schmock which introduces an interaction which is weak but of long range in time. With this Hamiltonian, we can transform the original path measure P of the process by defining P T (A) =E[1 A exp(h T )]/Z T, A F, (1.2) where Z T = E[exp(H T )]. In contrast to this long-range but weak interaction, there is a model with a strong but short-range (with respect to time) interaction, which we call polaron type interaction, given by the Hamiltonian H α,t = 1 2 T T and the corresponding transformed path measure αe α s t V (X s,x t ) ds dt, α, T >, (1.3) P α,t (A) =E[1 A exp(h α,t )]/Z α,t, A F, (1.4) where Z α,t = E[exp(H α,t )]. The aim of this paper is to describe and compare T P T and α T provided that these its exist. Under some technical conditions, one knows that α T 1 T log Z α,t = T 1 T log Z T = P α,t, (1.5) (Ṽ ) sup (µ, µ) J(µ), (1.6) µ M 1 (E) where M 1 (E) denotes the probability measures on E, the abbreviation Ṽ (µ, ν) stands for the integral of V with respect to µ ν for µ, ν M 1 (E), and J, defined in (2.3), is the Donsker-Varadhan rate function which governs the large deviations of the empirical process. Equation (1.6) has been proved by Donsker and Varadhan [6] for the Fröhlich polaron, where {X t } t is the Brownian motion in R 3 and V (x, y) = x y 1 for x, y R 3 with x y is the Coulomb potential. Recently, (1.6) has been generalized in [14] and [15]. An investigation of the iting mean field path measure with a Hamiltonian, which is more general than (1.1), has been done for discrete-time Markov processes in [2] and [2], and for (possibly non-symmetric) continuous-time Markov processes it is given in Section 2 below. The case of a symmetric continuous-time Markov process with a Hamiltonian given by (1.1) has already been treated in [12], and, with more general Hamiltonians having at least C 2 -regularity, corresponding results have recently been obtained in [13]. A discussion of the iting polaron path measure is given in [22] and [23], partially on a heuristic level. Let us summarize our results about the mean field model contained in Section 2. We consider a uniformly mixing Markov process on a compact state space E, a real-valued continuous function Ψ on M 1 (E), which is differentiable in a suitable sense (Condition 2.12), and define a Hamiltonian by HT Ψ = TΨ(L T ), where L T is the empirical distribution of the process {X t } t up to time T. The Hamiltonian in (1.1) corresponds to Ψ(µ) :=Ṽ (µ, µ) for µ M 1(E), see Example In Theorem 2.2 we show that { P T } T> is relatively compact in the weak topology as T and that each accumulation point P is a mixture of homogeneous Markovian path measures {Q µ } µ KΨ, where K Ψ is the set of all µ M 1 (E) which maximize Ψ J. In particular, for the

3 Path measures arising from a mean field or polaron type interaction 3 Hamiltonian given by (1.1), the set K Ψ consists of all solutions of the variational problem in (1.6) and we obtain a characterization of the first it in (1.5). For µ K Ψ, the measure Q µ is given in terms of Ψ(µ) and the derivative of Ψ at µ. If additional symmetry assumptions are satisfied, then Theorem 2.32 shows that { P T } T> converges weakly to a specified mixture of {Q µ } µ KΨ as T. Given the first equality in (1.6), one could expect that for large T and small α the measure P α,t should be close to P T. There is, however, a somewhat subtle boundary effect for the measures P α,t at the starting point. This boundary effect shows up because the Hamiltonian in (1.3) is not defined in terms of translations of paths which are periodic continuations of the paths in [,T]. Such periodic paths are used in [5] to treat processlevel large deviations. We conjecture that, quite generally, the its in (1.5) are different and that α T P α,t = R α P α,r/α. (1.7) Let us give, on a heuristic level, a description of the right-hand side of (1.7) and explain, why we expect this equality to hold. We are not yet able to prove (1.7) in any generality, especially not for the Fröhlich polaron, but we discuss two instructive examples in Sections 3 and 4. The crucial point is that the right-hand side in (1.7) is a mean field type it which, however, is more delicate to handle than the it of { P T } T> as T. To show this, let us compare the it behaviour of the partition functions {Z T } T> and {Z α,r/α } α,r>. After the time transformations s s/α and t t/α, the latter ones are given by [ ( 1 R R )] Z α,r/α = E exp e s t V (X s/α,x t/α ) ds dt. (1.8) 2Rα One should remark that, for fixed R>, the it of {Z α,r/α } α> as α is a mean field type it. To see this, divide the time interval [,R] into small intervals such that e s t is approximately constant for (s, t) in rectangles formed by these intervals. Then the restriction of the integration in (1.8) to such rectangles is essentially just a mean field type expression. Patching things together, one gets, under appropriate conditions, α log Z α,r/α (1.9) α ( 1 R R = sup e s t Ṽ (µ R,s,µ R,t ) ds dt 1 R ) J(µ R,t ) dt, µ R 2R R where µ R runs over an appropriate space of functions which map [,R] into M 1 (E), compare [3, Exercise 4.2.7]. We expect that the it of { P α,r/α } α> for α is related to the solutions of the variational problem in (1.9) in a similar way as the it of { P T } T> for T is related to the solutions of the variational problem in (1.6). Although the solutions of the variational problem in (1.9) are in general not constant in time, the it of { P α,r/α } α> as α should be a mixture of homogeneous Markov processes, because, due to the transformations leading to (1.8), the inhomogeneity of these solutions is on the time scale 1/α. However, it turns out that, for the description of the Markov processes appearing in this mixture, the inhomogeneity of the solutions of the variational problem is important.

4 4 E. Bolthausen, J.-D. Deuschel, and U. Schmock It is reasonable to expect that, as R, the right-hand side of (1.9) approaches the right-hand side of (1.6) and the solutions (µ R,t ) t [,R] of the variational problem in (1.9) converge to the corresponding solutions of the mean field variational problem in (1.6) for t around the center of the interval [,R]. The above mentioned boundary effect shows up because this convergence does not take place for t near the boundary of the time interval [,R]asR. This behaviour originates from the factor (1/2)e s t in (1.9), which, for t {,R}, gives less than 1/2 when integrated over [,R] instead of converging to 1 as R. If (1.7) is true, then one has a characterization of the iterated it in (1.5). Equality in (1.7) would follow if one can prove that P α,t is close to P α,r/α for large R uniformly in T R/α. To achieve this, one actually needs quite precise information about the solutions of the variational problem in (1.9); to prove the uniformity in T R/α, one has to determine and control the iting behaviour of these solutions in terms of an added condition for µ R,R as R, see Section 3 for details. As already mentioned, we are far away from proving (1.7) and characterizing the iterated it in (1.5) in a general setting, but the two examples in Sections 3 and 4 fully confirm the picture presented above. We actually do not prove (1.7) for these examples, but (1.7) is our guide for identifying the iterated it in (1.5). The first model, treated in Section 3, is a symmetric Markovian jump process on E = {, 1} with exponential waiting times of expectation one and an interaction function V which is given by V (1, ) = V (, 1) = and V (, ) = V (1, 1) = τ, where τ R denotes a strength parameter. We determine the iting path measures in (1.5) explicitly. If τ 1, then they are equal to P. Ifτ > 1, then the iting measures in (1.5) are different but they are both mixtures of asymmetric Markovian jump processes. It turns out that the second iting measure in (1.5) corresponds to the first one with an adjusted strength parameter, namely τ =(τ +1/τ)/2. The second model, treated in Section 4, is the one-dimensional Brownian motion with V (x, y) =τ 2 (x y) 2 /4 for x, y R and a strength parameter τ >. Since Brownian motion is not sufficiently mixing, the results of Section 2 are not applicable. Because V is quadratic, everything is in the realm of Gaussian processes and we can determine the its in (1.5) explicitly by investigating the corresponding covariances. It turns out that the its in (1.5) exist, that they are different, and that they are both mixtures of Ornstein-Uhlenbeck processes with a normally distributed random center. Similar to the result in Section 3, the second iting measure in (1.5) corresponds to the first one with an adjusted strength parameter, namely τ = τ/ Convergence of Path Measures in a Mean Field Model Let E be a compact metric space with Borel σ-algebra E. IfI is a non-empty subset of R, then C(E,I) denotes the set of all I-valued continuous functions on E and C(E) is an abbreviation for C(E,R). We write for the supremum norm. Let M 1 (E) bethe set of all probability measures on (E,E). Note that M 1 (E) with the Prohorov metric, which induces the weak topology [1, Chap. 3, Theorem 3.1], is a compact metric space [1, Chap. 3, Theorem 1.7 and 2.2]. Let B(M 1 (E)) denote the corresponding Borel σ-algebra. Consider the path space Ω = D([, ),E) and, for each t [, ), define the evaluation map X t : Ω E by X t (ω) =ω(t). Let F be the σ-algebra on Ω generated by {X t } t. Note that Ω with the metric given by [1, Chap. 3, (5.2)] is a Polish space

5 Path measures arising from a mean field or polaron type interaction 5 [1, Chap. 3, Theorem 5.6] and that F coincides with the Borel σ-algebra generated by this metric [1, Chap. 3, Proposition 7.1]. For t let F t denote the sub-σ-algebra generated by {X s } s [,t]. We consider an E-measurable family {P x } x E of time-homogeneous Markovian probability measures on (Ω,F) with P x (X = x) = 1 for all x E. Let {P t } t denote the corresponding semigroup of stochastic transition kernels as well as the semigroup of bounded linear operators on C(E). We assume: Condition 2.1 There exists a {P t } t -invariant probability measure π M 1 (E) with supp(π) = E and, for each t >, there exists a jointly continuous transition density p t C(E 2, (, )) of P t with respect to π. Since supp(π) = E, the continuous transition densities are unique. As an abbreviation define c t = max{p t, 1/p t } = exp( log p t ) for all t>. Note that {P t } t is Feller continuous by Condition 2.1. For t the empirical distribution process of the position process after t is defined by 1 T Ω (t, ) (ω, T) L t,t (ω) = δ Xu (ω) du M 1 (E). (2.2) T t t If t =, then we write L T instead of L,T. The right-continuity of the paths in Ω implies that P t (x, ) converges weakly to δ x as t, for every x E. Therefore, the operator semigroup {P t } t is strongly continuous [25, p. 115]. Let L denote the corresponding (strong) generator with domain D(L) and define the position level rate function J : M 1 (E) [, ] by { Lφ } J(µ) = sup E φ dµ φ D(L) C(E,[1, )). (2.3) Examination of [3, pp ] shows that this definition coincides with J P in [3]. According to [3, Theorem ], the measures { P x L 1 T T>, x E } satisfy a uniform full large deviation principle with the rate function J. For µ M 1 (E), let P µ M 1 (Ω) denote the path measure with starting distribution µ, hence P µ (A) = E P x(a) µ(dx) for all A F. In particular, P δx = P x. We denote the expectation with respect to P µ or P x by E µ and E x, respectively. Given ϕ C(E), define the semigroup of transition kernels {P ϕ t } t by ( t ) ] P ϕ t (x, A) =E x [exp ϕ(x u ) du 1 A (X t ), x E, A E, t. (2.4) The corresponding semigroup of bounded linear operators on C(E) is denoted by {P ϕ t } t, too. The logarithmic spectral radius of P ϕ 1, given by Λ ϕ 1 = t t log P ϕ t op, (2.5) satisfies Λ ϕ ϕ. Ift, then exp(λ ϕ t) is the spectral radius of P ϕ t. Using [3, Exercise , (4.2.21), and Corollary ], it follows that Λ ϕ = sup{ ϕ, µ J(µ) µ M 1 (E) }, (2.6) where ϕ, µ denotes the integral of ϕ with respect to µ. Let p denote the usual norm on L p (π).

6 6 E. Bolthausen, J.-D. Deuschel, and U. Schmock Lemma 2.7 Let ϕ C(E) be given. (a) For each t>, there exists a transition density p ϕ t C(E 2, (, )) of P ϕ t with respect to π satisfying log p ϕ t ϕ t + log c t. (b) There exists a unique function h ϕ C(E,(, )) which satisfies h ϕ 2 =1and P ϕ t h ϕ =e Λϕt h ϕ for all t. (c) There exists an E-measurable set {Q ϕ x} x E of time-homogeneous Markovian probability measures on (Ω,F) such that, for all x E, t, and A F t, [ Q ϕ x(a) = e Λϕ t ( t ) ] h ϕ (x) E x 1 A exp ϕ(x u ) du h ϕ (X t ). (2.8) (d) Transition densities of {Q ϕ ( )Xt 1 } t> with respect to π are given by q ϕ t (x, y) = e Λϕ t h ϕ (x) pϕ t (x, y)h ϕ (y), x,y E, t>. (2.9) (e) There exists a unique {Q ϕ ( )Xt 1 } t -invariant distribution µ ϕ M 1 (E). (f) There exists a unique l ϕ C(E,(, )) such that dµ ϕ /dπ = h ϕ l ϕ. (g) log h ϕ 2 ϕ + log c 1 and log l ϕ 4 ϕ + log c 2 1. (h) For every C>there exist ε, C > such that, for all t 1, sup sup q ϕ t (x, ) l ϕ h ϕ C e εt. ϕ: ϕ C x E Remark 2.1 From Lemma 2.7(b) we see that h ϕ is the 2 -normalized, positive eigenfunction associated with the principle eigenvalue Λ ϕ of the (strong) generator L + ϕ of {P ϕ t } t.ifπ is {P t } t -reversing [3, p. 128], then l ϕ = h ϕ. Remark 2.11 The transition densities {q ϕ t } t> in part (d) of Lemma 2.7 are the Doob h ϕ -transforms of {e Λϕt p ϕ t } t>, and the corresponding measures {Q ϕ x} x E on (Ω,F) describe the h ϕ -path process [8, Section 2.VI.13]. The proof of Lemma 2.7 is given after Theorem 2.2. We consider a real-valued function Ψ on M 1 (E) which satisfies the following condition. Note that this condition determines DΨ only up to a constant but that this constant does not enter into ϕ µ given by (2.18). Condition 2.12 Let the function Ψ : M 1 (E) R be continuous and differentiable in the sense that there exists a continuous map DΨ : M 1 (E) C(E) such that the map R :(, 1] (M 1 (E)) 2 R, defined by R λ (µ, ν) = 1 ( ) Ψ((1 λ)µ + λν) Ψ(µ) λ DΨ(µ),ν µ (2.13) λ for all λ (, 1] and µ, ν M 1 (E), is bounded and satisfies for each ν M 1 (E). λ sup µ M 1 (E) R λ (µ, ν) = (2.14) Example 2.15 Given any V C(E 2 ), define the quadratic functional Ψ by Ψ(µ) = V,µ 2 for all µ M 1 (E). Without loss of generality we may assume that Ψ is

7 Path measures arising from a mean field or polaron type interaction 7 given by a symmetric V. To prove that Ψ is continuous, note that V is bounded and uniformly continuous on the compact set E 2. Hence, given any ε>, there exist n N and x 1,...,x n E such that the n balls in C(E) with centers V (x 1, ),...,V(x n, ) and radius ε cover { V (x, ) x E }. Hence, if V (x j, ),µ ν ε for all j {1,...,n}, then V (x, ),µ ν 3ε for all x E and Ψ(µ) Ψ(ν) 6ε. Using the same argument, the continuity of DΨ, given by DΨ(µ)(x) =2 V (x, ),µ, follows. Since R λ (µ, ν) = λ V,(µ ν) 2 for all λ (, 1] and µ, ν M 1 (E), Condition 2.12 holds for Ψ. We fix a starting distribution m M 1 (E). For every function ϕ C(E) define m ϕ M 1 (E) and Q ϕ M 1 (Ω), for all A Fand B E,by Let m ϕ (B) = 1 Bh ϕ,m h ϕ,m K Ψ = { µ M 1 (E) and Q ϕ (A) = Ψ(µ) J(µ) = For each µ M 1 (E) define ϕ µ C(E)by E Q ϕ x(a) m ϕ (dx). (2.16) } sup (Ψ(ν) J(ν)). (2.17) ν M 1 (E) ϕ µ = DΨ(µ)+Ψ(µ) DΨ(µ),µ. (2.18) To simplify the notation, we replace the superscript ϕ µ by µ. Let P M 1 (Ω) be the path measure with starting distribution m. Similar to (1.2) we define the transformed path measures { P T } T> M 1 (Ω)by P T (A) =E[1 A exp(tψ(l T ))]/Z T, A F, T>, (2.19) where Z T = E[exp(TΨ(L T ))]. The main result of this section is the following theorem; for further results about the mixture Σ see Theorem Theorem 2.2 The set K Ψ is non-empty and compact, { P T } T> is relatively compact in the weak topology on M 1 (Ω) as T, and for each accumulation point P there exists Σ M 1 (K Ψ ) such that P(A) = Q µ (A) Σ(dµ), A F. K Ψ Proof of Lemma 2.7. (a) Since P ϕ t (x, ) π by Condition 2.1, we can define p ϕ t (x, ) = dp ϕ t (x, )/dπ for each x E and t>. For s, t > with 2s <tdefine p ϕ s,t(x, y) = p s (x, x) p ϕ t 2s ( x, ỹ)p s(ỹ, y) π(dỹ) π(d x), x,y E. E Then p ϕ s,t C(E 2, (, )) by Condition 2.1. Furthermore, E P ϕ t (x, A) (P s P ϕ t 2s P s)(x, A) c t e (t 2s) ϕ (e 2s ϕ 1)π(A), for each A Eand x E, hence sup p ϕ t (x, ) p ϕ s,t(x, ) c t e t ϕ (e 2s ϕ 1) x E

8 8 E. Bolthausen, J.-D. Deuschel, and U. Schmock whenever < 2s <t. Since supp(π) =E by Condition 2.1, we may and will assume that p ϕ t C(E 2, (, )) for all t>. The estimate for p ϕ t follows from Condition 2.1 and the definition of P ϕ t. (b) Since p ϕ t C(E 2, (, )), it follows that P ϕ t is a compact (compare [17, VI.5]), strictly positive [19, Def. II.2.4], and irreducible [19, p. 186] operator on C(E). The logarithmic spectral radius of e Λϕt P ϕ t is, hence 1 is in the spectrum of e Λϕt P ϕ t [19, Proposition V.4.1] and therefore a pole of the resolvent [9, Theorem V.5.2]. By [19, Theorem V.5.2 and its corollary], there exists a unique h ϕ t C(E,(, )) which satisfies h ϕ t 2 = 1 and h ϕ t = e Λϕt P ϕ t h ϕ t. Define h ϕ = h ϕ 1. Since {P ϕ t } t is a semigroup, P ϕ t h ϕ =e Λϕt h ϕ for all rational t in [, ). Using the right-continuity of the paths in Ω and the dominated convergence theorem, it follows that (P ϕ t f)(x) = E x [exp(t ϕ, L t )f(x t )] and converges to f(x)ast for every x E and f C(E). Applying [25, proof on p. 115] to {e ϕ t P ϕ t } t, it follows that {P ϕ t } t is strongly continuous. Hence, P ϕ t h ϕ =e Λϕt h ϕ for all t. (c) Given x E, it follows from (b) that (2.8) defines a probability measure on (Ω,F t ) for each t and that these measures are consistent. Hence, they can be uniquely extended to a measure Q ϕ x on (Ω,F) [16, Chap. V, Theorem 4.2]. The other properties of {Q ϕ x} x E follow from those of {P x } x E. (d) follows from (a), (c), and the definition of P ϕ t. (e) Let {Q ϕ t } t denote the semigroup of stochastic transition kernels corresponding to {Q ϕ x} x E in (c). According to [3, Exercise ], there exists a unique Q ϕ t -invariant µ ϕ t M 1 (E) for each t>. Define µ ϕ = µ ϕ 1. The semigroup property of {Qϕ t } t implies that µ ϕ Q ϕ t = µ ϕ for all rational t in [, ). Since {P ϕ t } t is a strongly continuous semigroup by the proof of (b), the semigroup {Q ϕ t } t of linear operators on C(E) is strongly continuous, too. Choose ε, t > and f C(E). Using [3, (4.1.5)], there exist n N and a rational s in (,nt) such that µ ϕ Q ϕ nt µ ϕ t var ε and Q ϕ nt sf f ε. Since µ ϕ Q ϕ nt = µ ϕ Q ϕ nt s, it follows that µ ϕ t,f µ ϕ,f 2ε. Using [1, Theorem 1.3], it follows that µ ϕ t = µ ϕ for all t>, hence µ ϕ Q ϕ t = µ ϕ for all t. (f) Using µ ϕ Q ϕ 1 = µϕ, (2.9), the continuity of p ϕ 1 and hϕ, and supp(π) =E, it follows that there exists a unique f ϕ C(E,(, )) with f ϕ = dµ ϕ /dπ. Define l ϕ = f ϕ /h ϕ. (g) Note that h ϕ =e Λϕ P ϕ 1 hϕ by (b). Using the estimate for p ϕ 1 in (a) as well as Λ ϕ ϕ and h ϕ 1 h ϕ 2 = 1, the estimate for h ϕ follows. Note that l ϕ h ϕ = d(µ ϕ Q ϕ 1 )/dπ by (e) and (f). Rewriting with (2.9), dividing by hϕ, using Λ ϕ ϕ and the estimates for p ϕ 1 and hϕ, the estimate for l ϕ follows. (h) Choose ϕ C(E) with ϕ C.Fors, t > define f(t) = sup q ϕ t (x, ) µ(dx) l ϕ h ϕ qs ϕ (x, y) and α s = inf x,y E l ϕ (y)h ϕ (y). µ M 1 (E) E Note that α s (, 1]. If α s < 1, then, for each µ M 1 (E), qs+t(x, ϕ ) µ(dx) l ϕ h ϕ =(1 α s ) q ϕ t (y, ) µ s (dy) l ϕ h ϕ, E E where µ s M 1 (E) isgivenby ( ) 1 µ s (A) = qs ϕ (x, y) µ(dx) α s l ϕ (y)h ϕ (y) π(dy), 1 α s A E A E.

9 Path measures arising from a mean field or polaron type interaction 9 Therefore, f(s + t) (1 α s )f(t) in both cases. Using (2.9), (a), (g), and the estimate Λ ϕ ϕ, it follows that α 1 exp( 8C)/c 4 1 and f(1) 2c3 1 exp(6c). Hence, part (h) follows. Lemma 2.21 Let M be the set of all functions f : Ω R, which are bounded, continuous, and F s -measurable for some s. Then M is convergence determining [1, p. 112] for the weak topology on M 1 (Ω). Proof. By [1, Chap. 3, Theorem 3.1], the set of all bounded f : Ω R, which are uniformly continuous with respect to the metric d given by [1, Chap. 3, (5.2)], is convergence determining. We show that M is dense in this set. Given f as above, choose ε>. There exists s 1 such that f(ω) f( ω) ε for all ω, ω Ω with d(ω, ω) e 1 s. Define π t : Ω Ω by π t (ω)(u) =ω(s u) for all t, u and ω Ω. Note that d(ω, π t (ω)) e t by the definition of d.ifg : Ω R is defined by g(ω) = [s 1,s] f(π t(ω)) dt, then g is bounded and measurable with respect to F s. Furthermore, g f ε.givent and ω Ω, it follows from [1, Chap. 3, (5.2), (5.3), and Proposition 5.2] that π t is continuous at ω if t is a continuity point of ω. Since ω has at most countably many points of discontinuity [1, Chap. 3, Lemma 5.1], it follows with the dominated convergence theorem that g is continuous at ω. Lemma 2.22 (a) The map C(E) ϕ Λ ϕ is continuous. (b) The map C(E) ϕ h ϕ C(E,(, )) is continuous. (c) The map C(E) ϕ Q ϕ M 1 (Ω) is continuous. (d) The map C(E) ϕ l ϕ C(E,(, )) is continuous. Proof. (a) If ϕ, ψ C(E), then Λ ϕ Λ ψ ϕ ψ by (2.6). (b) If ϕ, ψ C(E), then P ϕ t (x, A) P ψ t (x, A) c t e t ϕ (e t ϕ ψ 1)π(A) for all x E and A E, hence p ϕ t p ψ t c t e t ϕ (e t ϕ ψ 1) (2.23) for all t>. If t> and ϕ C(E), then (2.9) shows that g ϕ t (x, y, z) := qϕ 1 (x, y)qϕ t (y, z) q ϕ 1+t (x, z) = pϕ 1 (x, y)pϕ t (y, z) p ϕ 1+t (x, z), x,y,z E. (2.24) Lemma 2.7(a) and (2.23) imply the continuity of ϕ g ϕ t. Define g ϕ in C(E 3 )by g ϕ (x, y, z) =q ϕ 1 (x, y). If C>, then Lemma 2.7(h) implies that sup g ϕ t g ϕ sup q ϕ 1 C e εt + C e ε(1+t) ϕ : ϕ C ϕ : ϕ C l ϕ h ϕ C e ε(1+t) (2.25) for all sufficiently large t 1. Since this estimate is uniform on bounded subsets of C(E), it follows by using Lemma 2.7(a), (g), (2.9), and Λ ϕ ϕ and letting t, that the map ϕ q ϕ 1 is continuous. Since 1 h ϕ (x) = hϕ 2 h ϕ (x) = q ϕ 1 (x, ) ϕ (x, )eλ, x E, (2.26) 2 p ϕ 1 by (2.9), it follows with (a) that ϕ 1/h ϕ and ϕ h ϕ are continuous. (c) By part (b), the map ϕ h ϕ,m is continuous. Using (a) and (b), it follows that the map ϕ exp( Λ ϕ t)e ( ) [f exp(t ϕ, L t )h ϕ (X t )],m is continuous for each t>

10 1 E. Bolthausen, J.-D. Deuschel, and U. Schmock and each bounded, continuous, and F t -measurable f : Ω R. Using (2.8), (2.16), and Lemma 2.21, part (c) follows. (d) If C>, then (2.9) and Lemma 2.7(g), (h) show that sup sup e Λϕ t t h ϕ (x) pϕ t (x, ) l ϕ =. ϕ: ϕ C x E Since this it is uniform on bounded subsets of C(E), part (d) follows from (a), (b), and (2.23). Lemma 2.27 There exists a constant M 1 such that E x [exp(tψ(l T ))] ME π [exp(tψ(l T ))] M 2 E y [exp(tψ(l T ))] for all x, y E and T>1. Proof. Let C denote the common bound of the maps DΨ and R given by Condition Define M = c 1 exp(4c). Note that T Ψ(L T ) Ψ(L 1,T +1 ) = DΨ(L 1,T ),L 1 L T,T+1 + R 1/T (L 1,T,L 1 ) R 1/T (L 1,T,L T,T+1 ) 4C. Using the Markov property and Condition 2.1, it follows that E x [exp(tψ(l T ))] e 4C E x [exp(tψ(l 1,T +1 ))] =e 4C E x [E X1 [exp(tψ(l T ))]] ME π [exp(tψ(l T ))] and E y [exp(tψ(l T ))] M 1 E π [exp(tψ(l T ))] for all x, y E. By Condition 2.12 and Lemma 2.22(d), the map M 1 (E) E (µ, y) l µ (y) is continuous in each argument and therefore jointly measurable. For t, T > define Γ t,t M 1 (M 1 (E)) by Γ t,t (A) = 1 l µ (y) exp(tλ µ + TΨ(µ)) (P y L 1 T )(dµ) π(dy) (2.28) c t,t E A for all A B(M 1 (E)), where c t,t denotes the appropriate normalizing constant. Proof of Theorem 2.2. Due to Condition 2.12 and [3, Theorem ], the map Ψ J is upper semi-continuous. Therefore, Ψ J attains its supremum on a closed subset of the compact set M 1 (E). Hence, K Ψ is non-empty and compact. Condition 2.12 and (2.18) imply that the map µ ϕ µ is bounded. Take any t>. Using Lemma 2.7(g) and Λ ϕ ϕ, it follows that there exists a constant C> such that tλ µ + log l µ C for all µ M 1 (E). Since Ψ is bounded and continuous by Condition 2.12, it follows from the full large deviation principle for { PL 1 T T>, x E } and Varadhan s theorem (compare [3, Exercise ] and [2, Lemma 4.4]) that Γ t,t (U c ) ast for every t>and every neighbourhood U M 1 (E) of K Ψ. Since M 1 (E) is compact, the set {Γ t,t } T 1 is relatively compact for each t>. By the above paragraph, each accumulation point of {Γ t,t } T 1 as T is concentrated on K Ψ. Let {T n } n N be a strictly increasing sequence tending to infinity. By the preceeding paragraph and a diagonal argument we may assume that, for each k N, the sequence {Γ Tk,T n T k } n>k converges weakly to a measure Γ Tk in M 1 (M 1 (E)) as n. Note that Γ Tk (K Ψ ) = 1. By choosing a further subsequence if necessary, we may assume

11 Path measures arising from a mean field or polaron type interaction 11 that {Γ Tk } k N converges weakly to a measure Γ with Γ (K Ψ )=1.Letf: Ω [1, 2] be a continuous function, which is F s -measurable for some s. By Lemma 2.21, it suffices to show that Ê Tn [f] = n h µ,m K Ψ Ω / fdq µ Γ (dµ) h µ,m Γ (dµ). K Ψ (2.29) If s<t<t, then L T =(1 t/t )L t,t +(t/t )L t and, by (2.13) and (2.18), TΨ(L T )=t ϕ L t,t,l t +(T t)ψ(l t,t )+tr t/t (L t,t,l t ). (2.3) If A F t and B B(M 1 (E)), then the Markov property for P implies that E[1 A B (,L t,t ) X t = y] =P(A X t = y)p y (L T t B) = E[1 A B (,µ) X t = y](p y L 1 T t )(dµ) M 1 (E) for PXt 1 -almost all y E; therefore, by (2.3), E[f exp(tψ(l T ))] = E[f exp(t ϕ µ,l t + tr t/t (µ, L t )) X t = y] p t (y) E M 1 (E) exp((t t)ψ(µ)) P y L 1 T t (dµ) π(dy), where p t = d(pxt 1 )/dπ. Using (2.14) and the dominated convergence theorem, it follows that [ E sup exp(tr t/t (µ, L t )) 1 ] = T µ M 1 (E) for every t>. Since µ ϕ µ is bounded, it follows with Lemma 2.27 that, for each t>s, there exist {ε t,t } T>t (, ) with ε t,t 1asT such that E[f exp(tψ(l T ))] = ε t,t E[f exp(t ϕ µ,l t ) X t = y] p t (y) E M 1 (E) By Lemma 2.7(c), (d), and (2.16), E[f exp(t ϕ µ,l t ) X t = y] p t (y) =e Λµt h µ,m l µ (y) exp((t t)ψ(µ)) P y L 1 T t (dµ) π(dy). Ω f qµ t s(x s,y) h µ (y)l µ (y) dqµ for π-almost all y E. Since µ ϕ µ is bounded, it follows with Lemma 2.7(g) and (h) that there exists { ε t } t>s (, ) with ε t 1ast such that ( E[f exp(tψ(l T ))] = ε t,t ε t fdq ) h µ µ,m l µ (y) E M 1 (E) exp(tλ µ +(T t)ψ(µ)) P y L 1 T t (dµ) π(dy). Using (2.19) and (2.28), it follows that, for s<t<t, / Ê T [f] =ε t,t ε t h µ,m fdq µ Γ t,t t (dµ) h µ,m Γ t,t t (dµ), M 1 (E) Ω M 1 (E) Ω

12 12 E. Bolthausen, J.-D. Deuschel, and U. Schmock where { ε t} t>s and {ε t,t } T>t have the same properties as { ε t } t>s and {ε t,t } T>t. Condition 2.12 and Lemma 2.22(c) imply that the map µ Q µ is continuous. Using the assumptions about {T n } n N, equation (2.29) follows. Usually, it is difficult to determine whether { P T } T> converges as T and, if it converges, to which it law. There is, however, a special case, where this it can be determined. Let G be a compact and metrizable topological group. Then there exists a unique normalized left-invariant Haar measure σ [4, , ], which is also right-invariant [4, ]. Let {T a } a G be a collection of bijective transformations of E onto itself such that the map G E (a, x) T a x is continuous and T a T b = T ab for all a, b G. If e denotes the neutral element of G, then T e =id E, hence Ta 1 = T a 1. For each a G define T a : M 1 (E) M 1 (E) by(t a µ)(a) =µ(ta 1 (A)) for all A Eand µ M 1 (E). Note that T a is continuous, T a T b = T ab, and Ta 1 = T a 1 for all a, b G. We assume: Condition 2.31 (a) The function Ψ and the transition kernels {P t } t are G-invariant, which means that Ψ = Ψ T a and P t (T a x, A) =P t (x, Ta 1 (A)) for all t, x E, A E, and a G. (b) There exists ν K Ψ such that the map G a Φ(a) :=T a ν is injective and K Ψ = {T a ν a G }. Typical examples satisfying (a) are Brownian motion and suitable Markovian jump processes on groups. Condition 2.31(b) is more restrictive and usually delicate to investigate. Of course, if K Ψ contains just one measure, then Condition 2.31 is satisfied with G = {e} and T e =id E. The next section contains an example with G = Z 2. Theorem 2.32 If the Conditions 2.1, 2.12, and 2.31 hold, then / P T = Q Taν h Taν,m σ(da) h Taν,m σ(da). (2.33) T G G Proof. Choose a G arbitrarily. Define T a : Ω Ω by T a (ω)(t) =T a X t (ω) for all t and ω Ω. Then X t T a = T a X t and, since {P t } t is T a -invariant, P Ta x = P x T 1 a for each x E. By Condition 2.1, the measure T a π is {P t } t -invariant and the invariant measure is unique [3, Exercise ], hence T a π = π. Since T a is continuous and bijective, J Ta 1 is the rate function for { P x L 1 T T a 1 x E, T > } [3, Lemma 2.1.4]. Since L T T a = T a L T and P Ta xl 1 T = P x L 1 T T a 1 for each T>, the uniqueness of the rate function [3, Lemma 2.1.1] implies that J = J Ta 1, hence J = J T a. Choose ϕ C(E). Then Λ ϕ = Λ ϕ T a by (2.6). Since h ϕ T a = exp( Λ ϕ T a t)p ϕ T a t (h ϕ T a ) for all t and h ϕ T a 2 = 1, Lemma 2.7(b) shows that h ϕ T a = h ϕ T a. Since Q ϕ T a x = Qϕ T a x T 1 a for all x E, the measure T a µ ϕ T a is {Q ϕ ( )Xt 1 } t> -invariant and Lemma 2.7(e) implies that T a µ ϕ T a = µ ϕ. Since Ta 1 = T a 1 and dµ ϕ T a /dπ =(h ϕ l ϕ ) T a, Lemma 2.7(f) implies that l ϕ T a = l ϕ T a. Since Ψ = Ψ T a by assumption, T a µ K Ψ for each µ K Ψ. Since DΨ is (up to a constant) uniquely determined by (2.13) and (2.14), it follows that DΨ(T a µ)(t a x) DΨ(µ)(x) is constant and, by (2.18), ϕ Taµ T a = ϕ µ for all µ M 1 (E). Therefore, Λ Taµ = Λ µ and l Taµ T a = l µ. Finally, Γ t,t Ta 1 = Γ t,t for all T >t>. Since T a is continuous, Γ Ta 1 = Γ for the it Γ in the proof of Theorem 2.2.

13 Path measures arising from a mean field or polaron type interaction 13 Since G E (a, x) T a x is continuous, Φ is continuous, too. By Condition 2.31(b), the map Φ is injective. Therefore, if G denotes the Borel σ-algebra of G, then Φ(A) B(M 1 (E)) for every A Gby Kuratowski s theorem [16, Chap. I, Corollary 3.3]. Since Γ (K Ψ ) = 1 by the proof of Theorem 2.2 and K Ψ = Φ(G) by Condition 2.31(b), the measure σ M 1 (G) with σ(a) =Γ (Φ(A)) for all A Gis well-defined. Since Φ(a 1 b)=t a 1Φ(b), T a 1 = T 1 a, and Γ T 1 a = Γ for all a, b G, it follows that σ(a 1 A)=ΓΦ(a 1 A)=Γ (T a 1Φ(A)) = Γ Ta 1 (Φ(A)) = Γ (Φ(A)) = σ(a) for all A G. Therefore, σ = σ and the theorem follows from (2.29). 3. Convergence of Path Measures Arising from a Jump Process Let {X t } t denote a symmetric jump process on E = {, 1} with exponential holding times of expectation one. We denote by P x the law of the process on the path space Ω = D([, ), {, 1}) which starts in x {, 1}. Fort>define l t =(1/t) t X s ds. Since the measures in M 1 ({, 1}) can be parametrized by µ p = pδ 1 +(1 p)δ for p [, 1], the empirical distribution L t, defined after (2.2), is given by µ lt for t>. The random variables {l t } t> satisfy a uniform large deviation principle [3, Theorem ]. The corresponding rate function J : R [, ] can either be calculated via (2.3) or, since the generator of the jump process is symmetric, via [3, Theorem and (4.2.49)]. Both ways show that { 1 2 p(1 p) ifp [, 1], J(p) = if p R \ [, 1]. Fix a constant τ R and define an interaction function V : {, 1} 2 R by V (x, y) = τ(xy +(1 x)(1 y)) for x, y {, 1}. As in Example 2.15 define Ψ(µ) = V,µ 2. Then Ψ(µ p )=τ(p 2 +(1 p) 2 ) for p [, 1] and H T = TΨ(µ lt ). We choose m = δ as starting distribution, hence P = P. The transformed probability measures P T and P α,t corresponding to P are defined by (1.2) and (1.4), respectively. Then the right-hand side of (1.6) is given by sup{ Ψ(µ p ) J(p) p [, 1] }. Ifτ 1, then the supremum is attained only for p = 1/2. If τ > 1, then there are exactly two maxima at p ± =(1± 1 1/τ 2 )/2. Compared to the situation considered in [6], it would be easy to prove (1.6) in the present setting, but we do not need (1.6) explicitly. For γ>let Q γ be the path measure of a jump process on {, 1} starting in with generator ( L γ L γ, L γ ) ( ),1 γ γ = L γ 1, L γ =, 1/γ 1/γ 1,1 and define the mixture Theorem 3.1 Define P γ = 1 1+γ Qγ + γ 1+γ Q1/γ. { 1 if τ 1, γ(τ) = τ + τ 2 1 if τ>1, and τ = { τ if τ 1, (τ +1/τ)/2 if τ > 1.

14 14 E. Bolthausen, J.-D. Deuschel, and U. Schmock Then and α T P T = P γ(τ) (3.2) T P α,t = P γ( τ). (3.3) Remark 3.4 Given α>, we do not prove explicitly that { P α,t } T> converges to a it as T. Instead of (3.3) we prove that R sup α sup T R/α r Ω ( P α,t, P γ( τ) )=, (3.5) where r Ω denotes the Prohorov metric on M 1 (Ω). Proof of (3.2). Ifτ 1, then K Ψ = {µ 1/2 } by (2.17). Example 2.15 and (2.18) give DΨ(µ 1/2 )(x) =τ and ϕ µ 1/2 (x) =τ/2 for x {, 1}, hence ϕ µ 1/2 Λ µ 1/2 = by (2.6). Therefore, h µ 1/2 from Lemma 2.7(b) is given by h µ 1/2 (x) = 1, hence m µ 1/2 = δ and Q µ 1/2 = P by (2.16), and (3.2) follows from Theorem 2.2. If τ > 1, then we apply Theorem 2.32 as follows: Abbreviating µ p± by µ ±,we obtain K Ψ = {µ +,µ }, and DΨ(µ ± )(x) =2τ(p ± x +(1 p ± )(1 x)) according to Example Using (2.18) and (2.6) and writing ϕ ± for ϕ µ ± and Λ ± for Λ µ ±,it follows that ϕ ± (x) =τp ± (2x p ± )+τ(1 p ± )(2(1 x) (1 p ± )) and Λ ± = τp 2 ± + τ(1 p ± ) 2 1+1/τ. By the Feynman-Kac formula [18, Example IV.22.11], the semigroups {exp( Λ ± t)p ϕ ± t } t with P ϕ ± t given by (2.4) have the generators ( ) ( ) ϕ± () Λ ± 1 1 2τp± 1 = 1 ϕ ± (1) Λ ± 1 1 2τp with eigenvalues and 2τ. The non-negative 2 -normalized eigenfunction corresponding to is given by h ϕ ±() = 2(1 p ± ) and h ϕ ±(1) = 2p ±. Since h ϕ ±(1)/h ϕ ±()=2τp ± = γ(τ) ±1, it follows from (2.8) that L γ(τ) and L 1/γ(τ) are the generators of {Q ϕ ± x } x {,1}. We prove (3.5) only in the case τ>1, the other one is simpler. Notice that γ( τ) =τ for all τ 1. We prove (3.5) essentially by the technique used in Section 2. There are, however, additional difficulties. We proceed as outlined in the introduction starting with (1.9), see Lemma 3.6 below. The crucial estimate is given in Lemma It would not be difficult to prove the existence of the it of P α,r/α as α, which appears in (1.7). We do not need the it explicitely, therefore we only study the behaviour for small α and large R. The uniformity stated in Lemma 3.11 is crucial for the interchange of the its in (1.7). Lemma 3.11 depends on analytic considerations in Lemma Once we have Lemma 3.11, the rest of the proof follows along the lines of Section 2. For R>define C R = { f C([,R], R) f()=}, which is a Banach space with respect to the supremum norm. Let B R denote the set of all Borel measurable functions from [,R]to[, 1]. For α, R > define the map L α,r : Ω C R by

15 Path measures arising from a mean field or polaron type interaction 15 L α,r (t) =tl t/α for all t [,R]. Note that the random variable L α,r takes values in the set G R = { f C R f(t) f(s) t s for all s, t [,R] with s t }, which is compact by Ascoli s theorem. If f G R, then we denote by f B R the density with respect to Lebesgue measure. For α, R > and x, y {, 1} define the probability measure Q x,y α,r on G R by Q x,y α,r = P x( L 1 α,r ( ) X R/α = y ). Lemma 3.6 If x, y {, 1} and R>, then the measures {Q x,y α,r } α> satisfy a large deviation principle on G R with the good rate function J R (f) = R J(f (t)) dt, f G R, in the sense of [3], i.e. the rate function J R is convex, { f G R J R (f) r } is compact for each r R, and inf J R(f) inf f A α α log Q x,y α,r (A) sup α log Q x,y α,r (A) inf J R (f) α f A (3.7) for each Borel subset A of G R. Here the interior A and the closure A of A are taken with respect to the relative topology on G R. Proof. For the measures P x L 1 α,r, α>, the function space large deviation principle on C R follows from [3, Exercise 4.2.7] with the good rate function J R : C R [, ] given by R J R (f) = n 2 n 2 n k=1 ( f(2 n kr) f(2 n ) (k 1)R) J 2 n. (3.8) R If f C R \G R, then there exists k n {1,...,2 n } for all sufficiently large n N such that the corresponding term in (3.8) is infinite, hence J R (f) =. Iff G R, then [7, VII.8] and the dominated convergence theorem show that J R (f) =J R (f). To prove (3.7), first note that α P x (X R/α = y) =1/2. The upper estimate in (3.7) then follows from P x (L α,r A, X R/α = y) P x (L α,r A) and the corresponding estimate for the measures {P x L 1 α,r } α>. To show the lower estimate in (3.7), let A be an open subset of G R and ε (,R). Let A ε denote the set of all g G R ε such that there exists f A satisfying f [,R ε] = g and dist(f,g R \ A) >ε. Since { f G R f [,R ε] A ε } Aand since L α,r takes values in G R, it follows by using the Markov property that P x (L α,r A, X R/α = y) P x (L α,r ε A ε,x R/α = y) P x L 1 α,r ε (A ε) min{ P (X ε/α = y), P 1 (X ε/α = y) }. Since A ε is an open subset of G R ε, there exists an open subset B ε of C R ε such that A ε = B ε G R ε. Using the lower estimate for P x (L α,r ε B ε )asα, it only remains to show that inf ε (,R) inf J R ε (g) inf J R(f). (3.9) g A ε f A

16 16 E. Bolthausen, J.-D. Deuschel, and U. Schmock Take any f A and define ε = min{r, dist(f,g R \ A)}/2. Since A is open, ε>. If g := f [,R ε], then g A ε and J R ε (g) J R (f), hence (3.9) holds. To prepare the application of Varadhan s theorem, define, for each R >, the mappings g R : B R R and g R : G R R by g R (φ) = R e t φ(t) dt and g R (f) =e R f(r)+ R e t f(t) dt for all φ B R and f G R. Extend the interaction function V to [, ) 2 by defining V (x, y) =τ(xy+(1 x)(1 y)) for all x, y [, ). Furthermore, define F R :[ 1, 1] B R R and F R :[ 1, 1] G R R by F R (ϱ, φ) = 1 R R R e s t V (φ(s),φ(t)) ds dt + τϱ e (R t) φ(t) dt 2 and F R (ϱ, f) = τ 2 f 2 (R)+ τ 2 (R f(r))2 + τϱf(r) F R (ϱ, f) + τ 2 τ R R { f 2 (t)+(t f(t)) 2} dt e (R t){ f(r)f(t)+(r f(r))(t f(t)) } dt for all ϱ [ 1, 1], φ B R, and f G R. Integration by parts shows that g R (f) =g R (f ) and F R (ϱ, f) =F R (ϱ, f ) (3.1) for all ϱ [ 1, 1] and f G R. Note that g R and F R are continuous. For x {, 1} let P x α,t be the transformed path measure arising from P x via (1.4). For δ> define U δ =(ξ δ, ξ +δ) (ξ 1 δ, ξ 1 +δ), where ξ =1/(2τ 2 ) and ξ 1 =1 ξ. Lemma 3.11 If δ> and x {, 1}, then sup α T R/α P x α,t (Y α,r / U δ )= (3.12) for all sufficiently large R, where Y α,r = R e t X t/α dt. Proof. Givenα, R >, define X α,r : Ω B R by X α,r (t) =X t/α for all t [,R]. If T R/α, then H α,t = H α,[r/α,t ] + τ α Z (1 e R )+ 1 α F R(Z 1 Z,X α,r ), where H α,[r/α,t ] is given by (1.3) but with integration over [R/α, T ] and Z 1 = αt R e (t R) X t/α dt and Z = αt R e (t R) (1 X t/α ) dt.

17 Path measures arising from a mean field or polaron type interaction 17 Using (3.1), it follows that E x [ exp(h α,t ); Y α,r / U δ ] = E x [ exp ( H α,[r/α,t ] + α 1 τz (1 e R ) ) E x [ exp ( α 1 F R (Z 1 Z, L α,r ) ) ; g R (L α,r ) / U δ F R/α ]], where F R/α is the σ-algebra generated by {X t } t R/α. Since a similar formula holds for E x [exp(h α,t )], we obtain the estimate ( ) Yα,R / U δ P x α,t sup ϱ [ 1,1] y {,1} E x [ exp ( α 1 F R (ϱ, L α,r ) ) ; g R (L α,r ) / U δ X R/α = y ] E x [ exp ( α 1 F R (ϱ, L α,r ) ) X R/α = y ]. Since F R (,f): [ 1, 1] R is increasing for every f G R, it follows that P x α,t ( Yα,R / U δ ) max k { n,...,n 1} y {,1} G δ,r exp ( α 1 F R ((k +1)/n, ) ) dq x,y α,r G R exp ( α 1 F R (k/n, ) ) dq x,y α,r for every n N, where G δ,r = { f G R g R (f) / U δ }. For each ϱ [ 1, 1] the function F R (ϱ, ): G R R is continuous. Hence, it is bounded on the compact set G R and an analogue of [3, (2.1.9)] holds. Since g R is continuous, G δ,r is closed. Therefore, Lemma 3.6 and a version of Varadhan s theorem [3, Exercise (i)] imply that, for every ϱ [ 1, 1], sup α log α exp ( α 1 F R (ϱ, ) ) dq x,y α,r sup ( FR (ϱ, f) J R (f) ). G δ,r f G δ,r Analogously, by [3, Lemma 2.1.7], it follows that inf α log exp ( α 1 F R (ϱ, ) ) dq x,y ( α,r κ(ϱ) := sup FR (ϱ, f) J R (f) ). α G R f G R The last three estimates together imply that sup α 1 α log sup T R/α n P α,t x ( ) Yα,R / U δ ( sup F (min{1,ϱ+1/n},f) JR (f) κ(ϱ) ) (ϱ,f) [ 1,1] G δ,r = sup (ϱ,f) [ 1,1] G δ,r ( F (ϱ, f) JR (f) κ(ϱ) ), where the last equality follows from the uniform continuity of F R on the compact set [ 1, 1] G R. Furthermore, the uniform continuity of F R implies that the map [ 1, 1] ϱ κ(ϱ) is continuous, too. Hence, Λ R :[ 1, 1] G R (, ], defined by Λ R (ϱ, f) =F R (ϱ, f) J R (f) κ(ϱ), is upper semi-continuous and, therefore, attains,

18 18 E. Bolthausen, J.-D. Deuschel, and U. Schmock its supremum on the compact set [ 1, 1] G δ,r. To prove the lemma, it suffices to show that { (ϱ, f) [ 1, 1] G R Λ R (ϱ, f) =andg R (f) / U δ } = for all sufficiently large R. Using (3.1), this follows from the next lemma. Define Λ R :[ 1, 1] B R (, ] by R ( R ) Λ R (ϱ, φ) =F R (ϱ, φ) J(φ(t)) dt sup F R (ϱ, φ) J( φ(t)) dt. φ B R Lemma 3.13 For each δ>there exists R δ > such that, for all R>R δ, { (ϱ, φ) [ 1, 1] B R Λ R (ϱ, φ) =and g R (φ) / U δ } =. Proof. Define x = τ 1/τ. Since τ > 1, it follows that x >. Since U δ U δ for <δ <δ, it suffices to prove the lemma for δ (,x ]. Define c : R R by c(x) = 4(τ 2 τ 4+x 2 + 1). Note that c is even and strictly increasing on [, ) with c() = 4(τ 1) 2 and c(x ) =. Define R δ > by { R δ = max log 2 ( ) 1 δ, τ τ 1, 4τ c(x + δ), 2 2τ +1} 2τ c(x δ) 1. Fix R (R δ, ). Suppose that ϱ [ 1, 1] and φ B R satisfy Λ R (ϱ, φ) =, which is equivalent to saying that Λ R attains its maximal value at (ϱ, φ). To prove the lemma, it suffices to show that g R (φ) U δ. Define p ± =1/2 ± τ 2 /(1+4τ 2 ) and φ (t) =p (p + φ(t)) for all t [,R]. Since J 2p 1 (p) =2, p (, 1), 1 (2p 1) 2 it follows that J(p) J(p ) 4τ p p for all p [,p ] and J(p) J(p + ) 4τ p p + for all p [p +, 1]. Since F R (ϱ, φ 1 ) F R (ϱ, φ 2 ) 3τ φ 1 φ 2 L 1 for all φ 1,φ 2 B R, it follows that Λ R (ϱ, φ ) Λ R (ϱ, φ) τ φ φ L 1. Since (ϱ, φ) maximizes Λ R, we therefore may assume that φ(t) [p,p + ] for all t [,R]. For each φ B R the function ( p,p ) ε Λ R (ϱ, φ + ε φ) attains its maximum at ε =. Considering the derivatives, we see that φ satisfies τ R (2φ(s) 1)e s t ds + τϱe (R t) J (φ(t))= (3.14) for almost all t [,R]. Define ψ = J φ. Then φ(t) =(g(ψ(t))+1)/2 for all t in [,R], where the bounded function g C (R) isgivenbyg(x) =x(4 + x 2 ) 1/2. Equation (3.14) implies that ψ(t) =τϱe (R t) + τ R g(ψ(s))e s t ds (3.15) for almost all t [,R]. Since the right-hand side of (3.15) is continuous, we may assume that ψ is continuous and that (3.15) holds for all t [,R]. It then follows

19 Path measures arising from a mean field or polaron type interaction 19 that ψ and φ are in C ([,R], R). Hence, (3.14) holds for t = and shows that g R (φ) =(ψ() + τ)/(2τ) (1 + ϱ)e R /2. If we can prove that ψ() x <δ or ψ() + x <δ, (3.16) then min{ g R (φ) ξ 1, g R (φ) ξ } δ/(2τ)+e R <δ, because R>R δ log(2/δ). This means that g R (φ) U δ. Therefore, it remains to prove (3.16). If a, b [, 1/2) or a, b (1/2, 1], then a(1 b)+(1 a)b <ab+(1 a)(1 b). Furthermore, note that J(a) =J(1 a) for all a [, 1]. If there were s, t [,R] with φ(s) < 1/2 and φ(t) > 1/2, then F R (,φ) <F R (,φ + )=F R (,φ ), where φ + := max{φ, 1 φ} and φ := min{φ, 1 φ}; hence Λ R (ϱ, φ) < Λ R (ϱ, φ + )if ϱ [, 1], and Λ R (ϱ, φ) <Λ R (ϱ, φ )ifϱ [ 1, ], which contradicts the choice of (ϱ, φ). This proves that φ 1/2 ifϱ (, 1], that φ 1/2 ifϱ [ 1, ), and that φ 1/2 does not change its sign if ϱ =. Since p φ p +,asweprovedabove,it follows that ψ 4τ if ϱ (, 1], that 4τ ψ ifϱ [ 1, ), and that either ψ 4τ or 4τ ψ in the case ϱ =. Computing the first and the second derivative of (3.15), we see that ψ is a solution of the boundary value problem y (t) =y(t) 2τg(y(t)), t [,R], (3.17) y () = y(), (3.18) y (R) =2τϱ y(r). (3.19) Since ψ solves (3.17) and (3.18), it follows that, for all t [,R], ( ψ 2 (t) = 2τ 2 4+ψ (t)) 2 + c(ψ()). (3.2) If ψ() is given, then ψ is uniquely determined by (3.17) and (3.18). If ψ() =, then ψ is identically zero and (3.19) shows that ϱ =. Note that ψ = corresponds to φ =1/2. According to the special choice of φ, the function ( 1, 1) ε Λ R (,φ+ ε/2) attains its maximum at ε =, hence, since φ =1/2, d2 dε 2 Λ R(,φ+ ε/2) =(τ 1)R τ(1 e R ), ε= which is impossible because R>R δ τ/(τ 1). If ψ() x + δ, then ψ (t) c 1/2 (x + δ) >c 1/2 (x ) = for all t [,R]by (3.2). Using (3.18) and the continuity of ψ, it follows that ψ(r) c 1/2 (x + δ)r. This is impossible because R>R δ 4τc 1/2 (x + δ) and ψ(r) 4τ. If ψ() (,x δ], then >c(x δ) c(ψ()) c() = 4(τ 1) 2. Define y = (2τ c(ψ()) ) 2 4, (2τ y 1 = c(x δ) ) 2 4, ( ) 1 2τ t 1 = 4+ y 1, 2 1 and note that t 1 (R δ 1)/2 and ψ() = (2τ c(ψ()) + ψ2 () ) 2 4 <y y 1 < 2 τ 2 1.

20 2 E. Bolthausen, J.-D. Deuschel, and U. Schmock If ψ(t) [ψ(),y ], then (3.17) implies that ( ) ψ 2τ (t) = ψ(t) 4+ψ2 (t) 1 ψ() t 1 <. Hence, since ψ() = ψ () > by (3.18), there exists a smallest t [,t 1 ] such that ψ (t ) = or ψ(t ) = y. By (3.2), each of these two equations implies the other one. According to (3.17), the functions ψ [t,2t ] and ψ :[t, 2t ] R, given by ψ(t) =ψ(2t t), solve the initial value problem y (t) =y(t) 2τg(y(t)), y (t )=, y(t )=y. Due to the uniqueness of the solution, it follows that ψ(2t )=ψ() and ψ (2t )= ψ (). Since ψ() = ψ () > and ψ (t) ifψ(t) [, 2 τ 2 1], there exists t 2 [2t, 2t + 1] where ψ changes its sign. This is impossible because we proved above that ψ does not change its sign in [,R]. A similar argument shows that ψ() [ x + δ, ) is impossible. The preceding three paragraphs prove (3.16). Proof of (3.5) for τ>1. Define π =(1/2, 1/2). For x {, 1} and ϱ [, 1] define ϕ ϱ (x) =τϱx+ τ(1 ϱ)(1 x). Since p ϕ ϱ,µ p J(p) attains its supremum at p ϱ = 1 ( ) 2ϱ 1 1+τ, 2 4+τ2 (2ϱ 1) 2 (2.6) yields Λ ϱ := Λ ϕ ϱ =(τ 2+ 4+τ 2 (2ϱ 1) 2 )/2. Next we determine h ϕ ϱ, µ ϕ ϱ, and l ϕ ϱ, which appear in Lemma 2.7. We use the abbreviations h ϱ, µ ϱ, and l ϱ, respectively. According to the Feynman-Kac formula [18, Example IV.22.11], the semigroup {exp( Λ ϱ t)p ϕ ϱ t } t, where P ϕ ϱ t given by (2.4), has the generator ( ϕϱ () Λ ϱ ) ( ) 1 1 γϱ 1 1 ϕ ϱ (1) Λ ϱ = 1 1 1/γ ϱ with γ ϱ := ( 4+τ 2 (2ϱ 1) 2 + τ(2ϱ 1))/2. The non-negative 2 -normalized eigenfunction corresponding to the eigenvalue is given by h ϱ () = 2/(1 + γ ϱ2 ) and h ϱ (1) = γ ϱ h ϱ (). Since h ϱ (1)/h ϱ () = γ ϱ, it follows from (2.8) that L γ ϱ is the generator of {Q ϕ ϱ x } x {,1}. Note that p ϱ =(h ϱ (1)) 2 π(1) and 1 p ϱ =(h ϱ ()) 2 π(). Since (1,γϱ)L 2 γ ϱ =, it follows that µ ϱ := (1 p ϱ,p ϱ )isthe{q ϕ ϱ ( ) Xt 1 } t -invariant distribution and that l ϱ = h ϱ. Note that γ ξ1 = τ and γ ξ =1/τ. We now follow the proof of Theorem 2.2. For ϱ [, 1] and α, t, T > with t<t define T Θ α,[t,t ] = αe α(s t) X s ds + 1 t) e α(t 2 and t t R α,t,t (ϱ) =H α,t τ (1 e α(t s) )(ϱx s +(1 ϱ)(1 X s )) ds τ 2α (eαt 1)e αt. We use the abbreviation Θ α,t = Θ α,[,t ]. Then, corresponding to (2.3), H α,t = t ϕ Θ α,[t,t ],µ lt + H α,[t,t ] + R α,t,t (Θ α,[t,t ] ), (3.21)

21 Path measures arising from a mean field or polaron type interaction 21 where H α,[t,t ] is given by (1.3) but with integration over [t, T ] instead of [,T]. Define Γ α,t,t M 1 ([, 1]), for all Borel sets A of [, 1], by Γ α,t,t (A) = y {,1} π(y) c α,t,t E y [1 A (Θ α,t )l Θ α,t (y) exp(tλ Θ α,t + H α,t )], (3.22) where c α,t,t denotes the appropriate normalizing constant. Since Λ ϱ = Λ 1 ϱ and V (x, y) = V (1 x, 1 y) as well as P x (X s = y) = P 1 x (X s = 1 y) and h ϱ (x) = h 1 ϱ (1 x) for all s, ϱ [, 1], and x, y {, 1}, it follows that Γ α,t,t is symmetric, which means that Γ α,t,t (A) =Γ α,t,t ({ 1 a a A }) for all Borel sets A of [, 1]. Since sup{ Θ α,t Y α,r : T R/α } asα and R, it follows from Lemma 3.11 that, for each t>, the measures {Γ α,t,t } α,t > converge weakly to the symmetric measure (δ ξ1 + δ ξ )/2, uniformly for T R/α as α and then R. Let f : Ω [1, 2] be a continuous function which is F s -measurable for some s. By Lemma 2.21 it suffices to show that R sup α sup T R/α Êα,T [f] 1 1+τ Ω fdq τ τ 1+τ Ω fdq 1/τ =, (3.23) which would prove (1.7) for this model, too. For α, T > and y {, 1} define the measure Γ y α,t by Γ y α,t (A) =E y[1 A (Θ α,t ) exp(h α,t )] for all Borel sets A of [, 1]. Using (3.21) and the Markov property, it follows that, for every t (s, T ), E[f exp(h α,t )] = y {,1} 1 E[ f exp(t ϕ ϱ,µ lt + R α,t,t (ϱ)); X t = y ] Γ y α,t t (dϱ). Since R α,t,t (ϱ) ατt 2 +2τ(e αt 1+αt)/α + τe R (e αt 1)/(2α) for all ϱ [, 1] and α, R, t, T > with T R/α, there exists, for each t s, a suitable subset { ε α,t,t α>,t > t} of (, ) with sup{ ε α,t,t 1 : T R/α } asα and R such that E[f exp(h α,t )] = ε α,t,t y {,1} 1 By Lemma 2.7(c) and (d), E[ f exp(t ϕ ϱ,µ lt ); X t = y ]=e Λϱt h ϱ ()l ϱ (y)π(y) E[ f exp( ϕ ϱ,µ lt ); X t = y ] Γ y α,t t (dϱ). Ω f qϱ t s(x s,y) h ϱ (y)l ϱ (y) dqϱ for y {, 1}. Since [, 1] ϱ ϕ ϱ is bounded, it follows from Lemma 2.7(g) and (h) that there exists { ε t } t>s (, ) with ε t 1ast such that 1 ( E[f exp(h α,t )] = ε α,t,t ε t fdq ϱ) h ϱ ()π(y)l ϱ (y)e Λϱt Γ y α,t t (dϱ). y {,1} Using (1.4) and (3.22), it follows that, for s<t<tand α>, 1 / 1 Ê α,t [f] =ε α,t,t ε t h ϱ () fdq ϱ Γ α,t,t t (dϱ) h ϱ () Γ α,t,t t (dϱ), Ω Ω

3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?

3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure? MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable

More information

2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?

2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure? MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is

More information

Weak convergence and Brownian Motion. (telegram style notes) P.J.C. Spreij

Weak convergence and Brownian Motion. (telegram style notes) P.J.C. Spreij Weak convergence and Brownian Motion (telegram style notes) P.J.C. Spreij this version: December 8, 2006 1 The space C[0, ) In this section we summarize some facts concerning the space C[0, ) of real

More information

Lecture 12. F o s, (1.1) F t := s>t

Lecture 12. F o s, (1.1) F t := s>t Lecture 12 1 Brownian motion: the Markov property Let C := C(0, ), R) be the space of continuous functions mapping from 0, ) to R, in which a Brownian motion (B t ) t 0 almost surely takes its value. Let

More information

Brownian Motion. 1 Definition Brownian Motion Wiener measure... 3

Brownian Motion. 1 Definition Brownian Motion Wiener measure... 3 Brownian Motion Contents 1 Definition 2 1.1 Brownian Motion................................. 2 1.2 Wiener measure.................................. 3 2 Construction 4 2.1 Gaussian process.................................

More information

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9 MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended

More information

SUMMARY OF RESULTS ON PATH SPACES AND CONVERGENCE IN DISTRIBUTION FOR STOCHASTIC PROCESSES

SUMMARY OF RESULTS ON PATH SPACES AND CONVERGENCE IN DISTRIBUTION FOR STOCHASTIC PROCESSES SUMMARY OF RESULTS ON PATH SPACES AND CONVERGENCE IN DISTRIBUTION FOR STOCHASTIC PROCESSES RUTH J. WILLIAMS October 2, 2017 Department of Mathematics, University of California, San Diego, 9500 Gilman Drive,

More information

Wiener Measure and Brownian Motion

Wiener Measure and Brownian Motion Chapter 16 Wiener Measure and Brownian Motion Diffusion of particles is a product of their apparently random motion. The density u(t, x) of diffusing particles satisfies the diffusion equation (16.1) u

More information

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS PROBABILITY: LIMIT THEOREMS II, SPRING 218. HOMEWORK PROBLEMS PROF. YURI BAKHTIN Instructions. You are allowed to work on solutions in groups, but you are required to write up solutions on your own. Please

More information

{σ x >t}p x. (σ x >t)=e at.

{σ x >t}p x. (σ x >t)=e at. 3.11. EXERCISES 121 3.11 Exercises Exercise 3.1 Consider the Ornstein Uhlenbeck process in example 3.1.7(B). Show that the defined process is a Markov process which converges in distribution to an N(0,σ

More information

Brownian motion. Samy Tindel. Purdue University. Probability Theory 2 - MA 539

Brownian motion. Samy Tindel. Purdue University. Probability Theory 2 - MA 539 Brownian motion Samy Tindel Purdue University Probability Theory 2 - MA 539 Mostly taken from Brownian Motion and Stochastic Calculus by I. Karatzas and S. Shreve Samy T. Brownian motion Probability Theory

More information

MATH MEASURE THEORY AND FOURIER ANALYSIS. Contents

MATH MEASURE THEORY AND FOURIER ANALYSIS. Contents MATH 3969 - MEASURE THEORY AND FOURIER ANALYSIS ANDREW TULLOCH Contents 1. Measure Theory 2 1.1. Properties of Measures 3 1.2. Constructing σ-algebras and measures 3 1.3. Properties of the Lebesgue measure

More information

1 Math 241A-B Homework Problem List for F2015 and W2016

1 Math 241A-B Homework Problem List for F2015 and W2016 1 Math 241A-B Homework Problem List for F2015 W2016 1.1 Homework 1. Due Wednesday, October 7, 2015 Notation 1.1 Let U be any set, g be a positive function on U, Y be a normed space. For any f : U Y let

More information

Functional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...

Functional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability... Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................

More information

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS PROBABILITY: LIMIT THEOREMS II, SPRING 15. HOMEWORK PROBLEMS PROF. YURI BAKHTIN Instructions. You are allowed to work on solutions in groups, but you are required to write up solutions on your own. Please

More information

Recall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm

Recall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm Chapter 13 Radon Measures Recall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm (13.1) f = sup x X f(x). We want to identify

More information

Martingale Problems. Abhay G. Bhatt Theoretical Statistics and Mathematics Unit Indian Statistical Institute, Delhi

Martingale Problems. Abhay G. Bhatt Theoretical Statistics and Mathematics Unit Indian Statistical Institute, Delhi s Abhay G. Bhatt Theoretical Statistics and Mathematics Unit Indian Statistical Institute, Delhi Lectures on Probability and Stochastic Processes III Indian Statistical Institute, Kolkata 20 24 November

More information

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered

More information

l(y j ) = 0 for all y j (1)

l(y j ) = 0 for all y j (1) Problem 1. The closed linear span of a subset {y j } of a normed vector space is defined as the intersection of all closed subspaces containing all y j and thus the smallest such subspace. 1 Show that

More information

Combinatorics in Banach space theory Lecture 12

Combinatorics in Banach space theory Lecture 12 Combinatorics in Banach space theory Lecture The next lemma considerably strengthens the assertion of Lemma.6(b). Lemma.9. For every Banach space X and any n N, either all the numbers n b n (X), c n (X)

More information

Introduction to Empirical Processes and Semiparametric Inference Lecture 08: Stochastic Convergence

Introduction to Empirical Processes and Semiparametric Inference Lecture 08: Stochastic Convergence Introduction to Empirical Processes and Semiparametric Inference Lecture 08: Stochastic Convergence Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics and Operations

More information

ELEMENTS OF PROBABILITY THEORY

ELEMENTS OF PROBABILITY THEORY ELEMENTS OF PROBABILITY THEORY Elements of Probability Theory A collection of subsets of a set Ω is called a σ algebra if it contains Ω and is closed under the operations of taking complements and countable

More information

Invariance Principle for Variable Speed Random Walks on Trees

Invariance Principle for Variable Speed Random Walks on Trees Invariance Principle for Variable Speed Random Walks on Trees Wolfgang Löhr, University of Duisburg-Essen joint work with Siva Athreya and Anita Winter Stochastic Analysis and Applications Thoku University,

More information

Lecture Notes Introduction to Ergodic Theory

Lecture Notes Introduction to Ergodic Theory Lecture Notes Introduction to Ergodic Theory Tiago Pereira Department of Mathematics Imperial College London Our course consists of five introductory lectures on probabilistic aspects of dynamical systems,

More information

Real Analysis Problems

Real Analysis Problems Real Analysis Problems Cristian E. Gutiérrez September 14, 29 1 1 CONTINUITY 1 Continuity Problem 1.1 Let r n be the sequence of rational numbers and Prove that f(x) = 1. f is continuous on the irrationals.

More information

n [ F (b j ) F (a j ) ], n j=1(a j, b j ] E (4.1)

n [ F (b j ) F (a j ) ], n j=1(a j, b j ] E (4.1) 1.4. CONSTRUCTION OF LEBESGUE-STIELTJES MEASURES In this section we shall put to use the Carathéodory-Hahn theory, in order to construct measures with certain desirable properties first on the real line

More information

Spectral theory for compact operators on Banach spaces

Spectral theory for compact operators on Banach spaces 68 Chapter 9 Spectral theory for compact operators on Banach spaces Recall that a subset S of a metric space X is precompact if its closure is compact, or equivalently every sequence contains a Cauchy

More information

A Concise Course on Stochastic Partial Differential Equations

A Concise Course on Stochastic Partial Differential Equations A Concise Course on Stochastic Partial Differential Equations Michael Röckner Reference: C. Prevot, M. Röckner: Springer LN in Math. 1905, Berlin (2007) And see the references therein for the original

More information

In terms of measures: Exercise 1. Existence of a Gaussian process: Theorem 2. Remark 3.

In terms of measures: Exercise 1. Existence of a Gaussian process: Theorem 2. Remark 3. 1. GAUSSIAN PROCESSES A Gaussian process on a set T is a collection of random variables X =(X t ) t T on a common probability space such that for any n 1 and any t 1,...,t n T, the vector (X(t 1 ),...,X(t

More information

Convergence of Markov Processes. Amanda Turner University of Cambridge

Convergence of Markov Processes. Amanda Turner University of Cambridge Convergence of Markov Processes Amanda Turner University of Cambridge 1 Contents 1 Introduction 2 2 The Space D E [, 3 2.1 The Skorohod Topology................................ 3 3 Convergence of Probability

More information

Real Analysis Chapter 4 Solutions Jonathan Conder

Real Analysis Chapter 4 Solutions Jonathan Conder 2. Let x, y X and suppose that x y. Then {x} c is open in the cofinite topology and contains y but not x. The cofinite topology on X is therefore T 1. Since X is infinite it contains two distinct points

More information

Introduction to Topology

Introduction to Topology Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about

More information

Lebesgue Measure on R n

Lebesgue Measure on R n CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets

More information

Functional Analysis Winter 2018/2019

Functional Analysis Winter 2018/2019 Functional Analysis Winter 2018/2019 Peer Christian Kunstmann Karlsruher Institut für Technologie (KIT) Institut für Analysis Englerstr. 2, 76131 Karlsruhe e-mail: peer.kunstmann@kit.edu These lecture

More information

5 Measure theory II. (or. lim. Prove the proposition. 5. For fixed F A and φ M define the restriction of φ on F by writing.

5 Measure theory II. (or. lim. Prove the proposition. 5. For fixed F A and φ M define the restriction of φ on F by writing. 5 Measure theory II 1. Charges (signed measures). Let (Ω, A) be a σ -algebra. A map φ: A R is called a charge, (or signed measure or σ -additive set function) if φ = φ(a j ) (5.1) A j for any disjoint

More information

δ xj β n = 1 n Theorem 1.1. The sequence {P n } satisfies a large deviation principle on M(X) with the rate function I(β) given by

δ xj β n = 1 n Theorem 1.1. The sequence {P n } satisfies a large deviation principle on M(X) with the rate function I(β) given by . Sanov s Theorem Here we consider a sequence of i.i.d. random variables with values in some complete separable metric space X with a common distribution α. Then the sample distribution β n = n maps X

More information

Integration on Measure Spaces

Integration on Measure Spaces Chapter 3 Integration on Measure Spaces In this chapter we introduce the general notion of a measure on a space X, define the class of measurable functions, and define the integral, first on a class of

More information

Part II Probability and Measure

Part II Probability and Measure Part II Probability and Measure Theorems Based on lectures by J. Miller Notes taken by Dexter Chua Michaelmas 2016 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

More information

MA651 Topology. Lecture 10. Metric Spaces.

MA651 Topology. Lecture 10. Metric Spaces. MA65 Topology. Lecture 0. Metric Spaces. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Linear Algebra and Analysis by Marc Zamansky

More information

Lyapunov optimizing measures for C 1 expanding maps of the circle

Lyapunov optimizing measures for C 1 expanding maps of the circle Lyapunov optimizing measures for C 1 expanding maps of the circle Oliver Jenkinson and Ian D. Morris Abstract. For a generic C 1 expanding map of the circle, the Lyapunov maximizing measure is unique,

More information

THEOREMS, ETC., FOR MATH 515

THEOREMS, ETC., FOR MATH 515 THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every

More information

Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem

Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem 56 Chapter 7 Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem Recall that C(X) is not a normed linear space when X is not compact. On the other hand we could use semi

More information

P-adic Functions - Part 1

P-adic Functions - Part 1 P-adic Functions - Part 1 Nicolae Ciocan 22.11.2011 1 Locally constant functions Motivation: Another big difference between p-adic analysis and real analysis is the existence of nontrivial locally constant

More information

Large Deviations Principles for McKean-Vlasov SDEs, Skeletons, Supports and the law of iterated logarithm

Large Deviations Principles for McKean-Vlasov SDEs, Skeletons, Supports and the law of iterated logarithm Large Deviations Principles for McKean-Vlasov SDEs, Skeletons, Supports and the law of iterated logarithm Gonçalo dos Reis University of Edinburgh (UK) & CMA/FCT/UNL (PT) jointly with: W. Salkeld, U. of

More information

From now on, we will represent a metric space with (X, d). Here are some examples: i=1 (x i y i ) p ) 1 p, p 1.

From now on, we will represent a metric space with (X, d). Here are some examples: i=1 (x i y i ) p ) 1 p, p 1. Chapter 1 Metric spaces 1.1 Metric and convergence We will begin with some basic concepts. Definition 1.1. (Metric space) Metric space is a set X, with a metric satisfying: 1. d(x, y) 0, d(x, y) = 0 x

More information

(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define

(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define Homework, Real Analysis I, Fall, 2010. (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define ρ(f, g) = 1 0 f(x) g(x) dx. Show that

More information

SEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE

SEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE SEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE FRANÇOIS BOLLEY Abstract. In this note we prove in an elementary way that the Wasserstein distances, which play a basic role in optimal transportation

More information

Topological properties

Topological properties CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological

More information

Some SDEs with distributional drift Part I : General calculus. Flandoli, Franco; Russo, Francesco; Wolf, Jochen

Some SDEs with distributional drift Part I : General calculus. Flandoli, Franco; Russo, Francesco; Wolf, Jochen Title Author(s) Some SDEs with distributional drift Part I : General calculus Flandoli, Franco; Russo, Francesco; Wolf, Jochen Citation Osaka Journal of Mathematics. 4() P.493-P.54 Issue Date 3-6 Text

More information

9 Radon-Nikodym theorem and conditioning

9 Radon-Nikodym theorem and conditioning Tel Aviv University, 2015 Functions of real variables 93 9 Radon-Nikodym theorem and conditioning 9a Borel-Kolmogorov paradox............. 93 9b Radon-Nikodym theorem.............. 94 9c Conditioning.....................

More information

MATHS 730 FC Lecture Notes March 5, Introduction

MATHS 730 FC Lecture Notes March 5, Introduction 1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists

More information

2 Statement of the problem and assumptions

2 Statement of the problem and assumptions Mathematical Notes, 25, vol. 78, no. 4, pp. 466 48. Existence Theorem for Optimal Control Problems on an Infinite Time Interval A.V. Dmitruk and N.V. Kuz kina We consider an optimal control problem on

More information

DISTRIBUTION OF THE SUPREMUM LOCATION OF STATIONARY PROCESSES. 1. Introduction

DISTRIBUTION OF THE SUPREMUM LOCATION OF STATIONARY PROCESSES. 1. Introduction DISTRIBUTION OF THE SUPREMUM LOCATION OF STATIONARY PROCESSES GENNADY SAMORODNITSKY AND YI SHEN Abstract. The location of the unique supremum of a stationary process on an interval does not need to be

More information

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.

More information

16 1 Basic Facts from Functional Analysis and Banach Lattices

16 1 Basic Facts from Functional Analysis and Banach Lattices 16 1 Basic Facts from Functional Analysis and Banach Lattices 1.2.3 Banach Steinhaus Theorem Another fundamental theorem of functional analysis is the Banach Steinhaus theorem, or the Uniform Boundedness

More information

PROBLEMS. (b) (Polarization Identity) Show that in any inner product space

PROBLEMS. (b) (Polarization Identity) Show that in any inner product space 1 Professor Carl Cowen Math 54600 Fall 09 PROBLEMS 1. (Geometry in Inner Product Spaces) (a) (Parallelogram Law) Show that in any inner product space x + y 2 + x y 2 = 2( x 2 + y 2 ). (b) (Polarization

More information

2) Let X be a compact space. Prove that the space C(X) of continuous real-valued functions is a complete metric space.

2) Let X be a compact space. Prove that the space C(X) of continuous real-valued functions is a complete metric space. University of Bergen General Functional Analysis Problems with solutions 6 ) Prove that is unique in any normed space. Solution of ) Let us suppose that there are 2 zeros and 2. Then = + 2 = 2 + = 2. 2)

More information

25.1 Ergodicity and Metric Transitivity

25.1 Ergodicity and Metric Transitivity Chapter 25 Ergodicity This lecture explains what it means for a process to be ergodic or metrically transitive, gives a few characterizes of these properties (especially for AMS processes), and deduces

More information

Nash Type Inequalities for Fractional Powers of Non-Negative Self-adjoint Operators. ( Wroclaw 2006) P.Maheux (Orléans. France)

Nash Type Inequalities for Fractional Powers of Non-Negative Self-adjoint Operators. ( Wroclaw 2006) P.Maheux (Orléans. France) Nash Type Inequalities for Fractional Powers of Non-Negative Self-adjoint Operators ( Wroclaw 006) P.Maheux (Orléans. France) joint work with A.Bendikov. European Network (HARP) (to appear in T.A.M.S)

More information

4th Preparation Sheet - Solutions

4th Preparation Sheet - Solutions Prof. Dr. Rainer Dahlhaus Probability Theory Summer term 017 4th Preparation Sheet - Solutions Remark: Throughout the exercise sheet we use the two equivalent definitions of separability of a metric space

More information

Metric Spaces and Topology

Metric Spaces and Topology Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies

More information

Probability and Measure

Probability and Measure Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability

More information

Functional Analysis. Martin Brokate. 1 Normed Spaces 2. 2 Hilbert Spaces The Principle of Uniform Boundedness 32

Functional Analysis. Martin Brokate. 1 Normed Spaces 2. 2 Hilbert Spaces The Principle of Uniform Boundedness 32 Functional Analysis Martin Brokate Contents 1 Normed Spaces 2 2 Hilbert Spaces 2 3 The Principle of Uniform Boundedness 32 4 Extension, Reflexivity, Separation 37 5 Compact subsets of C and L p 46 6 Weak

More information

Lecture 19 L 2 -Stochastic integration

Lecture 19 L 2 -Stochastic integration Lecture 19: L 2 -Stochastic integration 1 of 12 Course: Theory of Probability II Term: Spring 215 Instructor: Gordan Zitkovic Lecture 19 L 2 -Stochastic integration The stochastic integral for processes

More information

Non-linear wave equations. Hans Ringström. Department of Mathematics, KTH, Stockholm, Sweden

Non-linear wave equations. Hans Ringström. Department of Mathematics, KTH, Stockholm, Sweden Non-linear wave equations Hans Ringström Department of Mathematics, KTH, 144 Stockholm, Sweden Contents Chapter 1. Introduction 5 Chapter 2. Local existence and uniqueness for ODE:s 9 1. Background material

More information

Continuity of convex functions in normed spaces

Continuity of convex functions in normed spaces Continuity of convex functions in normed spaces In this chapter, we consider continuity properties of real-valued convex functions defined on open convex sets in normed spaces. Recall that every infinitedimensional

More information

Partial Differential Equations

Partial Differential Equations Part II Partial Differential Equations Year 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2015 Paper 4, Section II 29E Partial Differential Equations 72 (a) Show that the Cauchy problem for u(x,

More information

Ergodic Theorems. Samy Tindel. Purdue University. Probability Theory 2 - MA 539. Taken from Probability: Theory and examples by R.

Ergodic Theorems. Samy Tindel. Purdue University. Probability Theory 2 - MA 539. Taken from Probability: Theory and examples by R. Ergodic Theorems Samy Tindel Purdue University Probability Theory 2 - MA 539 Taken from Probability: Theory and examples by R. Durrett Samy T. Ergodic theorems Probability Theory 1 / 92 Outline 1 Definitions

More information

. Then V l on K l, and so. e e 1.

. Then V l on K l, and so. e e 1. Sanov s Theorem Let E be a Polish space, and define L n : E n M E to be the empirical measure given by L n x = n n m= δ x m for x = x,..., x n E n. Given a µ M E, denote by µ n the distribution of L n

More information

Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University

Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University February 7, 2007 2 Contents 1 Metric Spaces 1 1.1 Basic definitions...........................

More information

Empirical Processes: General Weak Convergence Theory

Empirical Processes: General Weak Convergence Theory Empirical Processes: General Weak Convergence Theory Moulinath Banerjee May 18, 2010 1 Extended Weak Convergence The lack of measurability of the empirical process with respect to the sigma-field generated

More information

Compact operators on Banach spaces

Compact operators on Banach spaces Compact operators on Banach spaces Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto November 12, 2017 1 Introduction In this note I prove several things about compact

More information

MA5206 Homework 4. Group 4. April 26, ϕ 1 = 1, ϕ n (x) = 1 n 2 ϕ 1(n 2 x). = 1 and h n C 0. For any ξ ( 1 n, 2 n 2 ), n 3, h n (t) ξ t dt

MA5206 Homework 4. Group 4. April 26, ϕ 1 = 1, ϕ n (x) = 1 n 2 ϕ 1(n 2 x). = 1 and h n C 0. For any ξ ( 1 n, 2 n 2 ), n 3, h n (t) ξ t dt MA526 Homework 4 Group 4 April 26, 26 Qn 6.2 Show that H is not bounded as a map: L L. Deduce from this that H is not bounded as a map L L. Let {ϕ n } be an approximation of the identity s.t. ϕ C, sptϕ

More information

VARIATIONAL PRINCIPLE FOR THE ENTROPY

VARIATIONAL PRINCIPLE FOR THE ENTROPY VARIATIONAL PRINCIPLE FOR THE ENTROPY LUCIAN RADU. Metric entropy Let (X, B, µ a measure space and I a countable family of indices. Definition. We say that ξ = {C i : i I} B is a measurable partition if:

More information

Laplace s Equation. Chapter Mean Value Formulas

Laplace s Equation. Chapter Mean Value Formulas Chapter 1 Laplace s Equation Let be an open set in R n. A function u C 2 () is called harmonic in if it satisfies Laplace s equation n (1.1) u := D ii u = 0 in. i=1 A function u C 2 () is called subharmonic

More information

Solution. 1 Solution of Homework 7. Sangchul Lee. March 22, Problem 1.1

Solution. 1 Solution of Homework 7. Sangchul Lee. March 22, Problem 1.1 Solution Sangchul Lee March, 018 1 Solution of Homework 7 Problem 1.1 For a given k N, Consider two sequences (a n ) and (b n,k ) in R. Suppose that a n b n,k for all n,k N Show that limsup a n B k :=

More information

MATH5011 Real Analysis I. Exercise 1 Suggested Solution

MATH5011 Real Analysis I. Exercise 1 Suggested Solution MATH5011 Real Analysis I Exercise 1 Suggested Solution Notations in the notes are used. (1) Show that every open set in R can be written as a countable union of mutually disjoint open intervals. Hint:

More information

Linear Ordinary Differential Equations

Linear Ordinary Differential Equations MTH.B402; Sect. 1 20180703) 2 Linear Ordinary Differential Equations Preliminaries: Matrix Norms. Denote by M n R) the set of n n matrix with real components, which can be identified the vector space R

More information

Topology, Math 581, Fall 2017 last updated: November 24, Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski

Topology, Math 581, Fall 2017 last updated: November 24, Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski Topology, Math 581, Fall 2017 last updated: November 24, 2017 1 Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski Class of August 17: Course and syllabus overview. Topology

More information

LECTURE 15: COMPLETENESS AND CONVEXITY

LECTURE 15: COMPLETENESS AND CONVEXITY LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other

More information

Lecture 21 Representations of Martingales

Lecture 21 Representations of Martingales Lecture 21: Representations of Martingales 1 of 11 Course: Theory of Probability II Term: Spring 215 Instructor: Gordan Zitkovic Lecture 21 Representations of Martingales Right-continuous inverses Let

More information

Math 5052 Measure Theory and Functional Analysis II Homework Assignment 7

Math 5052 Measure Theory and Functional Analysis II Homework Assignment 7 Math 5052 Measure Theory and Functional Analysis II Homework Assignment 7 Prof. Wickerhauser Due Friday, February 5th, 2016 Please do Exercises 3, 6, 14, 16*, 17, 18, 21*, 23*, 24, 27*. Exercises marked

More information

Weak convergence and Compactness.

Weak convergence and Compactness. Chapter 4 Weak convergence and Compactness. Let be a complete separable metic space and B its Borel σ field. We denote by M() the space of probability measures on (, B). A sequence µ n M() of probability

More information

Problem Set 2: Solutions Math 201A: Fall 2016

Problem Set 2: Solutions Math 201A: Fall 2016 Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that

More information

Annealed Brownian motion in a heavy tailed Poissonian potential

Annealed Brownian motion in a heavy tailed Poissonian potential Annealed Brownian motion in a heavy tailed Poissonian potential Ryoki Fukushima Tokyo Institute of Technology Workshop on Random Polymer Models and Related Problems, National University of Singapore, May

More information

Introduction to Empirical Processes and Semiparametric Inference Lecture 13: Entropy Calculations

Introduction to Empirical Processes and Semiparametric Inference Lecture 13: Entropy Calculations Introduction to Empirical Processes and Semiparametric Inference Lecture 13: Entropy Calculations Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics and Operations Research

More information

Exercises. T 2T. e ita φ(t)dt.

Exercises. T 2T. e ita φ(t)dt. Exercises. Set #. Construct an example of a sequence of probability measures P n on R which converge weakly to a probability measure P but so that the first moments m,n = xdp n do not converge to m = xdp.

More information

1 Stochastic Dynamic Programming

1 Stochastic Dynamic Programming 1 Stochastic Dynamic Programming Formally, a stochastic dynamic program has the same components as a deterministic one; the only modification is to the state transition equation. When events in the future

More information

CHAPTER 7. Connectedness

CHAPTER 7. Connectedness CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set

More information

1 Independent increments

1 Independent increments Tel Aviv University, 2008 Brownian motion 1 1 Independent increments 1a Three convolution semigroups........... 1 1b Independent increments.............. 2 1c Continuous time................... 3 1d Bad

More information

Convergence of Feller Processes

Convergence of Feller Processes Chapter 15 Convergence of Feller Processes This chapter looks at the convergence of sequences of Feller processes to a iting process. Section 15.1 lays some ground work concerning weak convergence of processes

More information

A classification of gapped Hamiltonians in d = 1

A classification of gapped Hamiltonians in d = 1 A classification of gapped Hamiltonians in d = 1 Sven Bachmann Mathematisches Institut Ludwig-Maximilians-Universität München Joint work with Yoshiko Ogata NSF-CBMS school on quantum spin systems Sven

More information

Proof: The coding of T (x) is the left shift of the coding of x. φ(t x) n = L if T n+1 (x) L

Proof: The coding of T (x) is the left shift of the coding of x. φ(t x) n = L if T n+1 (x) L Lecture 24: Defn: Topological conjugacy: Given Z + d (resp, Zd ), actions T, S a topological conjugacy from T to S is a homeomorphism φ : M N s.t. φ T = S φ i.e., φ T n = S n φ for all n Z + d (resp, Zd

More information

The Arzelà-Ascoli Theorem

The Arzelà-Ascoli Theorem John Nachbar Washington University March 27, 2016 The Arzelà-Ascoli Theorem The Arzelà-Ascoli Theorem gives sufficient conditions for compactness in certain function spaces. Among other things, it helps

More information

1. Stochastic Processes and filtrations

1. Stochastic Processes and filtrations 1. Stochastic Processes and 1. Stoch. pr., A stochastic process (X t ) t T is a collection of random variables on (Ω, F) with values in a measurable space (S, S), i.e., for all t, In our case X t : Ω S

More information

Representations of Gaussian measures that are equivalent to Wiener measure

Representations of Gaussian measures that are equivalent to Wiener measure Representations of Gaussian measures that are equivalent to Wiener measure Patrick Cheridito Departement für Mathematik, ETHZ, 89 Zürich, Switzerland. E-mail: dito@math.ethz.ch Summary. We summarize results

More information

THEOREMS, ETC., FOR MATH 516

THEOREMS, ETC., FOR MATH 516 THEOREMS, ETC., FOR MATH 516 Results labeled Theorem Ea.b.c (or Proposition Ea.b.c, etc.) refer to Theorem c from section a.b of Evans book (Partial Differential Equations). Proposition 1 (=Proposition

More information

Reminder Notes for the Course on Distribution Theory

Reminder Notes for the Course on Distribution Theory Reminder Notes for the Course on Distribution Theory T. C. Dorlas Dublin Institute for Advanced Studies School of Theoretical Physics 10 Burlington Road, Dublin 4, Ireland. Email: dorlas@stp.dias.ie March

More information

Lecture 5. If we interpret the index n 0 as time, then a Markov chain simply requires that the future depends only on the present and not on the past.

Lecture 5. If we interpret the index n 0 as time, then a Markov chain simply requires that the future depends only on the present and not on the past. 1 Markov chain: definition Lecture 5 Definition 1.1 Markov chain] A sequence of random variables (X n ) n 0 taking values in a measurable state space (S, S) is called a (discrete time) Markov chain, if

More information

Chapter 1. Measure Spaces. 1.1 Algebras and σ algebras of sets Notation and preliminaries

Chapter 1. Measure Spaces. 1.1 Algebras and σ algebras of sets Notation and preliminaries Chapter 1 Measure Spaces 1.1 Algebras and σ algebras of sets 1.1.1 Notation and preliminaries We shall denote by X a nonempty set, by P(X) the set of all parts (i.e., subsets) of X, and by the empty set.

More information