1) Construct a 2 × 2 examples to prove the following statements: (a) λ ∈ σ(A)...

1) Construct a 2 × 2 examples to prove the following statements:

(a) λ ∈ σ(A) and µ ∈ σ(B) 6=⇒ λ + µ ∈ σ(A + B).

(b) λ ∈ σ(A) and µ ∈ σ(B) 6=⇒ λµ ∈ σ(AB).

Expert Solution

milcah answered 3 years ago

Prove: (?) ???=Σ ( ?−?̅ )2 =Σ ?2−[(Σ ?2)/n] (Sum Squares X) (?) ???=Σ( ?−?̅ )2=Σ ?2−[(Σ...

Prove: (?) ???=Σ ( ?−?̅ )2 =Σ ?2−[(Σ ?2)/n] (Sum Squares X) (?) ???=Σ( ?−?̅ )2=Σ ?2−[(Σ ?2)/?] (Sum Squares Y) (?) ??? =Σ( ?−?̅ ) ( ?−?̅ )=Σ ??−[(Σ?)(Σ?)?] (Sum Products X,Y)

Let Σ an and Σ bn be series with positive terms such that lim(an/bn) = λ...

Let Σ an and Σ bn be series with positive terms such that lim(an/bn) = λ ∈ (0, ∞). Prove that the two series have the same behavior, that is they both converge or they both diverge to +∞.

Show that the skewness of X~Poisson(λ) is λ^-(1/2)

Find the joint pdf of the random sampleY1,...,Yn from the following distributions: a. Poisson(λ). b.N(0,σ^2).

Prove the following statements! 1. If A and B are sets then (a) |A ∪ B|...

Prove the following statements! 1. If A and B are sets then (a) |A ∪ B| = |A| + |B| − |A ∩ B| and (b) |A × B| = |A||B|. 2. If the function f : A→B is (a) injective then |A| ≤ |B|. (b) surjective then |A| ≥ |B|. 3. For each part below, there is a function f : R→R that is (a) injective and surjective. (b) injective but not surjective. (c) surjective but not injective. (d)...

H0:σ^2 (1) ≤σ^2 (2), HA:σ^2 (1)>σ^2 (2) n(1) = 15, s^2 (1) = 1000; n(2) =...

H0:σ^2 (1) ≤σ^2 (2), HA:σ^2 (1)>σ^2 (2) n(1) = 15, s^2 (1) = 1000; n(2) = 27, s^2 (2) = 689 α=0.05 Reject or do not reject H0?

Prove the following using the properties of regular expressions: (ab)* + c + c* = Λ...

Prove the following using the properties of regular expressions: (ab)* + c + c* = Λ + ab + (ab)* + c(Λ + c*) Λ+ab+abab+ababab(ab)* = Λ + ∅* + (ab)* a(b+c*) + (d+e)* = ab + ac*c* + d + e + (d+e)* a*b + a*a*bc* + d* + ab = d* + ab + a*bc* + Λ a(b+cd*) = a(b+c) + acdd* (a+b)* = ∧* + ∅* + (a*b*)* (ab)*(c*+d*) = (ab)*(c+c*) + (ab)*( ∧ + d*)

Prove the following statements! 1. Let S = {0, 1, . . . , 23} and...

Prove the following statements! 1. Let S = {0, 1, . . . , 23} and define f : Z→S by f(k) = r when 24|(k−r). If g : S→S is defined by (a) g(m) = f(7m) then g is injective and (b) g(m) = f(15m) then g is not injective. 2. Let f : A→B and g : B→C be injective. Then g ◦f : A→C is injective. 3. Let f : A→B and g : B→C be surjective....

(a) Let Λ = {λ ∈ R : 0 < λ < 1}. For each λ...

(a) Let Λ = {λ ∈ R : 0 < λ < 1}. For each λ ∈ Λ, let Aλ = {x ∈ R : −λ < x < 1/λ}. Find U λ∈Λ Aλ and ~U λ∈Λ Aλ respectively. (b) Let Λ = \ {λ ∈ R : λ > 1}. For each λ ∈ Λ, let Aλ = {x ∈ R : −λ < x < 1/λ}. Find U λ∈Λ Aλ and ~U λ∈Λ Aλ respectively.

Prove the following statements! 1. There is a bijection from the positive odd numbers to the...

Prove the following statements! 1. There is a bijection from the positive odd numbers to the integers divisible by 3. 2. There is an injection f : Q→N. 3. If f : N→R is a function, then it is not surjective.

Question