CS388C HW1

ANIRUDH NAIR
AN26439

Proof. Proof of 1.5 We can prove this like so:

We start off with the right hand side:
n   n  
X n X n−1
k =n
k k−1
k=1 k=1

Then from here, we can change the index by x = k − 1:

n−1  
X n−1
=n
x
x=0
 
n
Pn n
Then from what we learned it class (about 2 = k=0 ), we can further write and
k
conclude:
= n2n−1

Proof. Proof of 1.9 We start off with the left hand side of the given equation and use the
binomial theorem to expand it:
X p + q 
xk = (1 + x)p+q = (1 + x)p (1 + x)q
k
k

From here we can once again use the binomial theorem to write:
X p  X q 
= xi xm
i m
i m

X p
 X q

i
= x xk−i
i k−i
i k−i

We then finally get:

!
X X p  q 
= xk
i k−i
k i
Now since this is true for all x, we get that:
  X  
p+q p q
=
k i k−i
i


P P
Proof. Proof of 1.22 We know that x∈X d(x) = A∈F |A| (Prop. 1.7). If we make an
incidence matrix M = (mx,A ) of F, like as in the proof for prop. 1.7, but with 2 matrices
for both Ai and Aj , we can then take M T M for Ai ∩ Aj . Then counting the number of ones
corresponds to the intersection of the two sets.
1
Final Exam - Grad. Prob. A - 2020 Due date: Tuesday December 15th at 9:00AM

PNotice that if we change the index from x ∈ X on the sum from the left hand side, we get
x∈Ai d(x) and using idea in the previous paragraph, we get:
X m
X
d(x) = |Ai ∩ Aj |
x∈Ai j=1

Then summing over all Ai , we get the desired result:

X m m X
X m
|Ai ∩ Aj | = |Ai ∩ Aj |
i,j=1 i=1 j=1
m
X X
= d(x)
i=1 x∈Ai
X
= d(x)2
x∈X
Proof. Consider the incidence matrix M = (mx,A ) of F. That is, M is a 0 − 1 matrix with
|X| rows labeled by points x ∈ X and with |F| columns labeled by sets A ∈ F such that
mx,A = 1 if and only if x ∈ A. Observe that d(x) is exactly the number of 1 s in the x -th
row, and |A| is the number of 1 s in the A-th column.

Proof. Proof of 18.2 For i = 1 to n, let Xi = 1 if the elevator stops at the i -th floor, and
let Xi = 0 otherwise. Then N , the number of floors stopped at, is given by
N = X 1 + X2 + · · · + Xn
Thus by the linearity of expectation, we have
E(N ) = E (X1 ) + E (X2 ) + · · · + E (Xn )

k
The probability that no one stops at floor i is n−1n
. Thus the probability that Xi = 1 is
k
1 − n−1


n
. This is also the expectation of Xi For E(N ), add up over all i, that is, multiply
by n:
 k
n−1
E(N ) = n(1 − )
n
 k
1
= n(1 − 1 − )
n

Proof. Proof of 18.3 Let us choose an arbitrary set B which contains points ω ∈ Ω for
which X(ω) < M − b. This means if we take the expected value, we then get:
E(X(ω)) = M − a ≤ P r(B) · (M − b) + P r(B̄) · M
From here we do some algebra, and get the desired result:
=⇒ P r(B) · (M − b) + P r(B̄) · M ≥ M − a
=⇒ (P r(B) + P r(B̄)) · M − P r(B) · b ≥ M − a
=⇒ 1 · M − P r(B) · b ≥ M − a
=⇒ −P r(B) · b ≥ −a
=⇒ P r(B) · b ≤ a
a
=⇒ P r(B) ≤
b
a
=⇒ 1 − P r(B) ≥ 1 −
b
M385C – Fall 2020 Page 2
Final Exam - Grad. Prob. A - 2020 Due date: Tuesday December 15th at 9:00AM

b−a
=⇒ P r(B̄) ≥
b
b−a
=⇒ P r(X ≥ M − b) ≥
b

Proof. Proof of 20.5 Note: let’s say for convenience that a sub-matrix with all 1’s is called
an ”all-1” sub-matrix. Take a random n x n 0-1 matrix A = (aij ). Take f(A) to be the
number of all-1’s in the matrix A. Now create a new matrix A∗ = a∗ij by switching all of the
1’s in each alone in A to a 0 and no 1’s are switched twice (so if two all-1’s share the same
1 then it is switched only once). Then A∗ contains no all-1’s since at most f(A) 1’s were
switched, so X X
a∗ij ≥ aij − f (A)
Now we let A = (aij ) be a random nXn matrix with probability P (aij = 1) = p. Then we
get: X X
E( a∗ij ) = E(a∗ij ) = n2 p
and  2
n 2
E(f (A)) = pa
a

2 2
This is because there are na a x a sub-matrices that are all-1’s with a probability pa . Thus,
if we apply the linearity of the expectation to the inequality at the beginning, we get:
 2
n
X  2
∗ 2
E aij ≥ n p − pa
a
If we approximate na = na /a! and set p = (a − 1)!2/(a −1)−2/(a) , we get:

2

P ∗ P ∗
2 2
ka (n) ≥ aij ≥ E aij ≥ (1 − a−2 ) (a − 1)! a2 −1 n2− a
2
Then setting  = (1 − a−2 )(a − 1)! a2 −1 , we get the result:
2
ka (n) ≥ n2− a


M385C – Fall 2020 Page 3