1. Prove that a discrete space consisting of m points is homotopy equivalent to a discrete...
Let (X, d) be a discrete space and let (Y, d′) be any metric space. Prove that any function f : (X, d) → (Y, d′) is continuous. (Namely, any function from a discrete space to any metric space is continuous.)
Let X be a discrete random variable with values in N = {1, 2,...}. Prove that X is geometric with parameter p = P(X = 1) if and only if the memoryless property P(X = n + m | X > n) = P(X = m) holds. To show that the memoryless property implies that X is geometric, you need to prove that the p.m.f. of X has to be P(X = k) = p(1 - p)^(k-1). For this, use...
3. (Contractible spaces.) (i) Recall that a space X is said to be contractible if it is homotopy equivalent to a point. Prove the following (a) A space X is contractible if and only if it the identity map Idx is homotopic to the constant map at some point of X b) If X is contractible then it is simply connected1 (c) If f and g are maps from Y into a contractible space X, then f g. (ii) Recall...
DISCRETE MATHEMATIC For question 1, Use mathematical induction to prove the statements are correct for n ∈ Z+(set of positive integers). 1. Prove that for n ≥ 1 1 + 8 + 15 + ... + (7n - 6) = [n(7n - 5)]/2 For question 2, Use a direct proof, proof by contraposition or proof by contradiction. 2. Let m, n ≥ 0 be integers. Prove that if m + n ≥ 59 then (m ≥ 30 or n ≥...
Using discrete mathematical proofs: a. Prove that, for an odd integer m and an even integer n, 2m + 3n is even. b. Give a proof by contradiction that 1 + 3√ 2 is irrational.
Let (X, d) be an infinite discrete metric space. Prove that any infinite subset of X is closed and bounded but NOT compact
8. Prove that if two rational sequences (a)1 and (n)1 are equivalent, then (a) (an) is Cauchy if and only if (bn) is Cauchy. (b) (an) is bounded if and only if (%) is bounded. 8. Prove that if two rational sequences (a)1 and (n)1 are equivalent, then (a) (an) is Cauchy if and only if (bn) is Cauchy. (b) (an) is bounded if and only if (%) is bounded.
DISCRETE MATHEMATICS Problem 3 (10 points) Use mathematical induction to prove the following statement for all n 21. For full credit, mention the base case (1pt), the induction hypothesis (1 pt) and the induction step (8 pts). 12 22 32
Let A be an m x n matrix. Prove that the null-space of AT A, Null (AT A), is a subspace of Rn.
1. Exit times. Let X be a discrete-time Markov chain (with discrete state space) and suppose pii > 0. Let T =min{n 21: X i} be the exit time from state i. Show that T has a geometric distribution with respect to the conditional probability P 1. Exit times. Let X be a discrete-time Markov chain (with discrete state space) and suppose pii > 0. Let T =min{n 21: X i} be the exit time from state i. Show that...