Search

23 Feb 2017: E[X1|Sn] =Snn. (c) Compute E[Sn|X1]. (d) Find an example of a process (Zn)n0 adapted to some filtration which hasthe property. ... E[Zn1|Zn] = Znfor all n 0, but E[ZN1|FN ] 6= ZN for some N.

20 Jan 2017: Xn be independent Poisson random variables, with Xi having meaniθ, for some θ > 0. ... b) For some n > 2, let X1,. ,Xn be iid with Xi Exponential(θ).

12 Oct 2017: algebra. 1.2. Show that the following sets of subsets of R all generate the same σ-algebra:(a) {(a,b) : a < b}, (b) {(a,b] : a < b}, (c) {(,b] : b ... 1.8. Let (E,E,µ) be a measure space. Call a subset N E null if N B for some B E withµ(B) = 0.

22 Nov 2017: The square matrices A and B over the field F are congruent if B = PTAP for some invertible matrixP over F. ... for some λ,µ,ν R (which should turn out in this example to be integers).Does there exist a linear transformation which reduces the pair of

25 Jul 2017: By the pigeonhole principle, we must haveca = cb for some a and b with 0 6 a < b 6 k. ... First, what if instead of simply requiring that X be infinite, we seek an Xof cardinality 1, say, or of some larger specified cardinality?

23 Oct 2017: Hint: Bolzano-Weierstrass.). 3. If A and B are subsets of Rn, let A B = {a b |a A,b B}. ... vn} C such that{B(v1),. ,B(vn)} cover C. (b) Show that there exists some > 0 such that for every v C, B(v) Uα for some α.Deduce that

13 Nov 2017: a) All words w {0, 1} consisting of either the string 01 repeated some number oftimes (possibly none), or the string 010 repeated some number of times (possiblynone). ... b) All words w {a,b,c} consisting of some number of a’s (possibly none), followed

23 May 2017: Assume otherwise, ie that for some such tree, the number of leaves is less thanor equal to the depth. ... Theyprobably don’t mean that tho’.). To show that the restriction of a partial order of A to some subset B of A is a partialorder of B we have

7 Mar 2017: 0 πb. ),. for some integers a,b 0. Replacing F by an OK-equivalent form, it follows that. ... Lemma 2.5. Let F be an integral (2, 2)-form. If some pair (a,b) is admissible for.

8 Nov 2017: b) for some b K. In the case K = Q we give an algorithm for. ... Let L = K( 3. b) for some b K not a cube.