Books Probability and Statistical Inference

Bivariate Distributions of the Discrete Type

Definition 4.1

Let 𝑋𝑋 and 𝑌𝑌 be discrete random variables. Let 𝑆𝑆 denote the corresponding two-dimensional space of (𝑋,𝑌)(𝑋,𝑌). The probability that 𝑋=𝑥𝑋=𝑥 and 𝑌=𝑦𝑌=𝑦 is denoted by 𝑓(𝑥,𝑦)=P(𝑋=𝑥,𝑌=𝑦)𝑓(𝑥,𝑦)=ℙ(𝑋=𝑥,𝑌=𝑦). The function 𝑓(𝑥,𝑦)𝑓(𝑥,𝑦) defined on 𝑆𝑆 is called the joint probability mass function or joint PMF of 𝑋𝑋 and 𝑌𝑌. And it has the following properties:

  1. 𝑓(𝑥,𝑦)≥0𝑓(𝑥,𝑦)\geq 0 for all (𝑥,𝑦)∈𝑆(𝑥,𝑦)\in 𝑆.
  2. ∑(𝑥,𝑦)∈𝑆𝑓(𝑥,𝑦)=1{\sum }_{(𝑥,𝑦)\in 𝑆}𝑓(𝑥,𝑦)=1.
  3. P[(𝑋,𝑌)∈𝐴]=∑(𝑥,𝑦)∈𝐴𝑓(𝑥,𝑦)ℙ[(𝑋,𝑌)\in 𝐴]={\sum }_{(𝑥,𝑦)\in 𝐴}𝑓(𝑥,𝑦) where 𝐴⊆𝑆𝐴\subseteq 𝑆.
Remark

The joint support 𝑆𝑆 is typically defined as a subset of the Cartesian product of the support of 𝑋𝑋 and 𝑌𝑌, on which the mass does not vanish. That is,

𝑆={(𝑥,𝑦)∈𝑆𝑋×𝑆𝑌:𝑓(𝑥,𝑦)>0}.𝑆=\{(𝑥,𝑦)\in {𝑆}_{𝑋}\times {𝑆}_{𝑌}:𝑓(𝑥,𝑦)>0\}.
Example 4.1

Roll a pair of fair dice. Let 𝑋𝑋 be the integer of the smaller number and 𝑌𝑌 be the integer of the larger number. The outcome is (𝑥,𝑦)(𝑥,𝑦) where 𝑥,𝑦∈{1,2,3,4,5,6}𝑥,𝑦\in \{1,2,3,4,5,6\} and 𝑥≤𝑦𝑥\leq 𝑦. When 𝑥<𝑦𝑥<𝑦, there are 22 possibilities: either the result of the first die is 𝑥𝑥 and the result of the other one is 𝑦𝑦, or the other way around. Thus, we have

𝑓(𝑥,𝑦)=236,𝑥<𝑦.𝑓(𝑥,𝑦)=\frac{2}{36},\quad 𝑥<𝑦.

When 𝑥=𝑦𝑥=𝑦, there is only 11 possibility: the result of the two dice is 𝑥𝑥 (or 𝑦𝑦). We have

𝑓(𝑥,𝑥)=136,𝑥=𝑦.𝑓(𝑥,𝑥)=\frac{1}{36},\quad 𝑥=𝑦.

Therefore, the joint probability mass function is given by

𝑓(𝑥,𝑦)={236,𝑥<𝑦136,𝑥=𝑦𝑓(𝑥,𝑦)=\begin{cases}\frac{2}{36},\quad & 𝑥<𝑦 \\ \frac{1}{36},\quad & 𝑥=𝑦\end{cases}

One can check that summing 𝑓𝑓 over 𝑥𝑥 and 𝑦𝑦 gives 11.

Figure 4.1 shows the joint PMF for this example in a form typical of discrete bivariate mass functions: support points, joint mass beside each marker, and marginal masses at the axis ticks.

Figure 4.1 Joint PMF for two fair dice, with 𝑋𝑋 the smaller face and 𝑌𝑌 the larger. The support is composed of the coordinates of the markers, forming the triangular region. Joint and marginal masses are shown beside the markers and the axis ticks, respectively.

Note the numbers in the margins of Figure 4.1. Each bottom margin entry sums the joint masses in that 𝑥𝑥-column over 𝑦𝑦; each left margin entry sums those in that 𝑦𝑦-row over 𝑥𝑥. Intuitively, these are the PMF values of 𝑋𝑋 and 𝑌𝑌 alone, respectively.

Definition 4.2

Let 𝑋𝑋 and 𝑌𝑌 have the joint probability mass function 𝑓(𝑥,𝑦)𝑓(𝑥,𝑦) with space 𝑆=𝑆𝑋×𝑆𝑌𝑆={𝑆}_{𝑋}\times {𝑆}_{𝑌}. The probability mass function of 𝑋𝑋 alone, which is called the marginal probability mass function of 𝑋𝑋, is given by

𝑓𝑋(𝑥)=∑𝑦∈𝑆𝑌𝑓(𝑥,𝑦)=P(𝑋=𝑥),𝑥∈𝑆𝑋.{𝑓}_{𝑋}(𝑥)=\sum _{𝑦\in {𝑆}_{𝑌}}𝑓(𝑥,𝑦)=ℙ(𝑋=𝑥),\quad 𝑥\in {𝑆}_{𝑋}.

The marginal probability mass function of 𝑌𝑌 is defined similarly as

𝑓𝑌(𝑦)=∑𝑥∈𝑆𝑋𝑓(𝑥,𝑦)=P(𝑌=𝑦),𝑦∈𝑆𝑌.{𝑓}_{𝑌}(𝑦)=\sum _{𝑥\in {𝑆}_{𝑋}}𝑓(𝑥,𝑦)=ℙ(𝑌=𝑦),\quad 𝑦\in {𝑆}_{𝑌}.

The random variables 𝑋𝑋 and 𝑌𝑌 are said to be independent if

P(𝑋=𝑥,𝑌=𝑦)=P(𝑋=𝑥)P(𝑌=𝑦)∀(𝑥,𝑦)∈𝑆.ℙ(𝑋=𝑥,𝑌=𝑦)=ℙ(𝑋=𝑥)ℙ(𝑌=𝑦)\quad \forall (𝑥,𝑦)\in 𝑆.

Or, equivalently,

𝑓(𝑥,𝑦)=𝑓𝑋(𝑥)𝑓𝑌(𝑦)∀(𝑥,𝑦)∈𝑆.𝑓(𝑥,𝑦)={𝑓}_{𝑋}(𝑥){𝑓}_{𝑌}(𝑦)\quad \forall (𝑥,𝑦)\in 𝑆.

Otherwise, they are said to be dependent.

Remark

A quick way to test for possible dependence is to compare the joint support 𝑆𝑆 to the set 𝑆𝑋×𝑆𝑌{𝑆}_{𝑋}\times {𝑆}_{𝑌} of all pairs of marginal values. We call 𝑆𝑆 rectangular (with respect to 𝑆𝑋{𝑆}_{𝑋} and 𝑆𝑌{𝑆}_{𝑌}) when every such pair is jointly possible, i.e., when 𝑆=𝑆𝑋×𝑆𝑌𝑆={𝑆}_{𝑋}\times {𝑆}_{𝑌}. If 𝑆≠𝑆𝑋×𝑆𝑌𝑆\neq {𝑆}_{𝑋}\times {𝑆}_{𝑌}, then 𝑋𝑋 and 𝑌𝑌 are dependent. In symbols, independence implies

𝑋⊥𝑌⟹𝑆=𝑆𝑋×𝑆𝑌.𝑋⟂𝑌\quad ⟹\quad 𝑆={𝑆}_{𝑋}\times {𝑆}_{𝑌}.

We can quickly prove this. Indeed, if 𝑋𝑋 and 𝑌𝑌 are independent, fix 𝑥∈𝑆𝑋𝑥\in {𝑆}_{𝑋} and 𝑦∈𝑆𝑌𝑦\in {𝑆}_{𝑌}. We have 𝑓𝑋(𝑥)>0{𝑓}_{𝑋}(𝑥)>0 and 𝑓𝑌(𝑦)>0{𝑓}_{𝑌}(𝑦)>0 since we assume the mass does not vanish on the support. Then 𝑓(𝑥,𝑦)=𝑓𝑋(𝑥)𝑓𝑌(𝑦)>0𝑓(𝑥,𝑦)={𝑓}_{𝑋}(𝑥){𝑓}_{𝑌}(𝑦)>0, which implies (𝑥,𝑦)∈𝑆(𝑥,𝑦)\in 𝑆. Since 𝑥𝑥 and 𝑦𝑦 are arbitrary, we have 𝑆𝑋×𝑆𝑌⊆𝑆{𝑆}_{𝑋}\times {𝑆}_{𝑌}\subseteq 𝑆. Therefore, 𝑆=𝑆𝑋×𝑆𝑌𝑆={𝑆}_{𝑋}\times {𝑆}_{𝑌}.

Example 4.2

Consider the joint probability mass function of 𝑋𝑋 and 𝑌𝑌 in Example 4.1. For fixed 𝑥𝑥, the values of 𝑦𝑦 with 𝑓(𝑥,𝑦)>0𝑓(𝑥,𝑦)>0 are 𝑦∈{𝑥,𝑥+1,…,6}𝑦\in \{𝑥,𝑥+1,\ldots ,6\}; for fixed 𝑦𝑦, the values of 𝑥𝑥 are 𝑥∈{1,2,…,𝑦}𝑥\in \{1,2,\ldots ,𝑦\}. Hence

𝑓𝑋(𝑥)=∑𝑦=𝑥6𝑓(𝑥,𝑦)=(6−𝑥)⋅236+136=13−2𝑥36,𝑥∈{1,…,6},𝑓𝑌(𝑦)=∑𝑥=1𝑦𝑓(𝑥,𝑦)=(𝑦−1)⋅236+136=2𝑦−136,𝑦∈{1,…,6}.\begin{aligned}{𝑓}_{𝑋}(𝑥) & =\sum _{𝑦=𝑥}^{6}𝑓(𝑥,𝑦)=(6-𝑥)\cdot \frac{2}{36}+\frac{1}{36}=\frac{13-2𝑥}{36},\quad 𝑥\in \{1,\ldots ,6\}, \\ {𝑓}_{𝑌}(𝑦) & =\sum _{𝑥=1}^{𝑦}𝑓(𝑥,𝑦)=(𝑦-1)\cdot \frac{2}{36}+\frac{1}{36}=\frac{2𝑦-1}{36},\quad 𝑦\in \{1,\ldots ,6\}.\end{aligned}

Clearly, 𝑋𝑋 and 𝑌𝑌 are dependent for there are many points where 𝑓(𝑥,𝑦)≠𝑓𝑋(𝑥)𝑓𝑌(𝑦)𝑓(𝑥,𝑦)\neq {𝑓}_{𝑋}(𝑥){𝑓}_{𝑌}(𝑦). For example,

𝑓(1,1)=136≠𝑓𝑋(1)𝑓𝑌(1)=1136⋅136.𝑓(1,1)=\frac{1}{36}\neq {𝑓}_{𝑋}(1){𝑓}_{𝑌}(1)=\frac{11}{36}\cdot \frac{1}{36}.

In fact, this is intuitive since by observing a value 𝑥𝑥 of 𝑋𝑋, we know something about 𝑌𝑌, namely, 𝑌𝑌 must be greater than or equal to 𝑥𝑥.

Another way to see this is to observe the joint support 𝑆𝑆 depicted in Figure 4.1. As we have noted in the remark, since 𝑆𝑆 is clearly not rectangular, 𝑋𝑋 and 𝑌𝑌 are dependent.

Let 𝑋1{𝑋}_{1} and 𝑋2{𝑋}_{2} be random variables of the discrete type with the joint PMF 𝑓(𝑥1,𝑥2)𝑓({𝑥}_{1},{𝑥}_{2}) on space 𝑆𝑆. Let 𝑢(𝑋1,𝑋2)𝑢({𝑋}_{1},{𝑋}_{2}) be a function of 𝑋1{𝑋}_{1} and 𝑋2{𝑋}_{2}. Then

E[𝑢(𝑋1,𝑋2)]=∑(𝑥1,𝑥2)∈𝑆𝑢(𝑥1,𝑥2)𝑓(𝑥1,𝑥2).\mathbb{E}[𝑢({𝑋}_{1},{𝑋}_{2})]=\sum _{({𝑥}_{1},{𝑥}_{2})\in 𝑆}𝑢({𝑥}_{1},{𝑥}_{2})𝑓({𝑥}_{1},{𝑥}_{2}).
(4.1)

if it exists, is called the mathematical expectation of 𝑢(𝑋1,𝑋2)𝑢({𝑋}_{1},{𝑋}_{2}).

Specially:

  1. If 𝑢(𝑋1,𝑋2)=𝑋𝑘𝑢({𝑋}_{1},{𝑋}_{2})={𝑋}_{𝑘}, then
E[𝑢(𝑋1,𝑋2)]=E[𝑋𝑘]=μ𝑘,𝑘=1,2\mathbb{E}[𝑢({𝑋}_{1},{𝑋}_{2})]=\mathbb{E}[{𝑋}_{𝑘}]={\mu }_{𝑘},\quad 𝑘=1,2
  1. If 𝑢(𝑋1,𝑋2)=(𝑋𝑘−μ𝑘)2𝑢({𝑋}_{1},{𝑋}_{2})={({𝑋}_{𝑘}-{\mu }_{𝑘})}^{2}, then
E[𝑢(𝑋1,𝑋2)]=E[(𝑋𝑘−μ𝑘)2]=σ𝑘2,𝑘=1,2.\mathbb{E}[𝑢({𝑋}_{1},{𝑋}_{2})]=\mathbb{E}[{({𝑋}_{𝑘}-{\mu }_{𝑘})}^{2}]={\sigma }_{𝑘}^{2},\quad 𝑘=1,2.

We now extend the concept of binomial distribution to the trinomial distribution. Different from the Bernoulli experiment that only has two possible outcomes, the trinomial experiment has three, say 𝐶1{𝐶}_{1}, 𝐶2{𝐶}_{2}, and 𝐶3{𝐶}_{3}. Think of this as drawing a ball from an urn with 33 different colors, say red, blue, and green. Let 𝑝𝑋{𝑝}_{𝑋}, 𝑝𝑌{𝑝}_{𝑌}, and 𝑝𝑍{𝑝}_{𝑍} be the probabilities of getting 𝐶1{𝐶}_{1}, 𝐶2{𝐶}_{2}, and 𝐶3{𝐶}_{3}, respectively. Of course, we have 𝑝𝑋+𝑝𝑌+𝑝𝑍=1{𝑝}_{𝑋}+{𝑝}_{𝑌}+{𝑝}_{𝑍}=1. Now, the experiment is repeated 𝑛𝑛 times and we are interested in the number of times we get each color. Let 𝑋=#𝐶1𝑋=\#{𝐶}_{1}, 𝑌=#𝐶2𝑌=\#{𝐶}_{2}, and 𝑍=#𝐶3=𝑛−𝑋−𝑌𝑍=\#{𝐶}_{3}=𝑛-𝑋-𝑌. We want to find the probability mass function 𝑓(𝑥,𝑦)𝑓(𝑥,𝑦) of 𝑋𝑋 and 𝑌𝑌, i.e., P(𝑋=𝑥,𝑌=𝑦)ℙ(𝑋=𝑥,𝑌=𝑦).

Fix nonnegative integers 𝑥𝑥 and 𝑦𝑦 with 𝑥+𝑦≤𝑛𝑥+𝑦\leq 𝑛, and suppose that among the 𝑛𝑛 trials there are 𝑥𝑥 outcomes 𝐶1{𝐶}_{1}, 𝑦𝑦 outcomes 𝐶2{𝐶}_{2}, and 𝑛−𝑥−𝑦𝑛-𝑥-𝑦 outcomes 𝐶3{𝐶}_{3}. To evaluate P(𝑋=𝑥,𝑌=𝑦)ℙ(𝑋=𝑥,𝑌=𝑦) we must count how many length-𝑛𝑛 sequences contain exactly those counts; call this number 𝑁𝑁.

Think of the 𝑛𝑛 trials as distinguishable for the moment (label the trials 1,2,…,𝑛1,2,\ldots ,𝑛). Then there are 𝑛!𝑛! ways to order the 𝑛𝑛 labels. Among the 𝑛!𝑛! orders of labels, fix one outcome pattern with counts (𝑥,𝑦,𝑛−𝑥−𝑦)(𝑥,𝑦,𝑛-𝑥-𝑦) (which positions show 𝐶1{𝐶}_{1}, 𝐶2{𝐶}_{2}, or 𝐶3{𝐶}_{3}). Exactly 𝑥!𝑦!(𝑛−𝑥−𝑦)!𝑥!𝑦!(𝑛-𝑥-𝑦)! label orders induce that same pattern: we may permute labels among the 𝑥𝑥 trials labeled 𝐶1{𝐶}_{1} in 𝑥!𝑥! ways, among the 𝑦𝑦 trials labeled 𝐶2{𝐶}_{2} in 𝑦!𝑦! ways, and among the 𝑛−𝑥−𝑦𝑛-𝑥-𝑦 trials labeled 𝐶3{𝐶}_{3} in (𝑛−𝑥−𝑦)!(𝑛-𝑥-𝑦)! ways, independently. So each such pattern accounts for 𝑥!𝑦!(𝑛−𝑥−𝑦)!𝑥!𝑦!(𝑛-𝑥-𝑦)! of the 𝑛!𝑛! orders, and there are 𝑁𝑁 distinct patterns. Hence

𝑁⋅𝑥!⋅𝑦!⋅(𝑛−𝑥−𝑦)!=𝑛!,𝑁\cdot 𝑥!\cdot 𝑦!\cdot (𝑛-𝑥-𝑦)!=𝑛!,

so

𝑁=𝑛!𝑥!𝑦!(𝑛−𝑥−𝑦)!.𝑁=\frac{𝑛!}{𝑥!𝑦!(𝑛-𝑥-𝑦)!}.

This quotient is the multinomial coefficient with parameters (𝑛;𝑥,𝑦,𝑛−𝑥−𝑦)(𝑛;𝑥,𝑦,𝑛-𝑥-𝑦); it is often written in stacked form as

(𝑛𝑥,𝑦,𝑛−𝑥−𝑦)=𝑛!𝑥!𝑦!(𝑛−𝑥−𝑦)!.\binom{𝑛}{𝑥,𝑦,𝑛-𝑥-𝑦}=\frac{𝑛!}{𝑥!𝑦!(𝑛-𝑥-𝑦)!}.

Therefore the PMF of 𝑋𝑋 and 𝑌𝑌 can be written as

𝑓(𝑥,𝑦)=(𝑛𝑥,𝑦,𝑛−𝑥−𝑦)𝑝𝑋𝑥𝑝𝑌𝑦(1−𝑝𝑋−𝑝𝑌)𝑛−𝑥−𝑦.𝑓(𝑥,𝑦)=\binom{𝑛}{𝑥,𝑦,𝑛-𝑥-𝑦}{𝑝}_{𝑋}^{𝑥}{𝑝}_{𝑌}^{𝑦}{(1-{𝑝}_{𝑋}-{𝑝}_{𝑌})}^{𝑛-𝑥-𝑦}.

Question: What is the marginal distribution of 𝑋𝑋? There is no need to sum the joint PMF over 𝑦𝑦: the 𝑛𝑛 trials are independent, and each trial yields 𝐶1{𝐶}_{1} with probability 𝑝𝑋{𝑝}_{𝑋}. Thus 𝑋𝑋 is the number of 𝐶1{𝐶}_{1}s in 𝑛𝑛 independent Bernoulli trials with success probability 𝑝𝑋{𝑝}_{𝑋}, so 𝑋∼Bin⁡(𝑛,𝑝𝑋)𝑋∼\operatorname{Bin}(𝑛,{𝑝}_{𝑋}) and similarly 𝑌∼Bin⁡(𝑛,𝑝𝑌)𝑌∼\operatorname{Bin}(𝑛,{𝑝}_{𝑌}). But it is worth an exercise to calculate the marginal distribution of 𝑋𝑋 explicitly.

Exercise 4.1
Show that 𝑋∼Bin⁡(𝑛,𝑝𝑋)𝑋∼\operatorname{Bin}(𝑛,{𝑝}_{𝑋}) by calculating the marginal distribution of 𝑋𝑋 for the trinomial distribution as defined above.
Proof

We have

𝑓𝑋(𝑥)=∑𝑦=0𝑛−𝑥𝑓(𝑥,𝑦)=∑𝑦=0𝑛−𝑥(𝑛𝑥,𝑦,𝑛−𝑥−𝑦)𝑝𝑋𝑥𝑝𝑌𝑦(1−𝑝𝑋−𝑝𝑌)𝑛−𝑥−𝑦=∑𝑦=0𝑛−𝑥𝑛!𝑥!𝑦!(𝑛−𝑥−𝑦)!𝑝𝑋𝑥𝑝𝑌𝑦(1−𝑝𝑋−𝑝𝑌)𝑛−𝑥−𝑦=∑𝑦=0𝑛−𝑥𝑛!𝑥!(𝑛−𝑥)!⋅(𝑛−𝑥)!𝑦!(𝑛−𝑥−𝑦)!𝑝𝑋𝑥𝑝𝑌𝑦(1−𝑝𝑋−𝑝𝑌)𝑛−𝑥−𝑦=𝑛!𝑥!(𝑛−𝑥)!𝑝𝑋𝑥∑𝑦=0𝑛−𝑥(𝑛−𝑥)!𝑦!(𝑛−𝑥−𝑦)!𝑝𝑌𝑦(1−𝑝𝑋−𝑝𝑌)𝑛−𝑥−𝑦Apply the binomial theorem for [𝑝𝑌+(1−𝑝𝑋−𝑝𝑌)]𝑛−𝑥=𝑛!𝑥!(𝑛−𝑥)!𝑝𝑋𝑥(1−𝑝𝑋)𝑛−𝑥=(𝑛𝑥)𝑝𝑋𝑥(1−𝑝𝑋)𝑛−𝑥.\begin{aligned}{𝑓}_{𝑋}(𝑥)=\sum _{𝑦=0}^{𝑛-𝑥}𝑓(𝑥,𝑦) & =\sum _{𝑦=0}^{𝑛-𝑥}\binom{𝑛}{𝑥,𝑦,𝑛-𝑥-𝑦}{𝑝}_{𝑋}^{𝑥}{𝑝}_{𝑌}^{𝑦}{(1-{𝑝}_{𝑋}-{𝑝}_{𝑌})}^{𝑛-𝑥-𝑦} \\ & =\sum _{𝑦=0}^{𝑛-𝑥}\frac{𝑛!}{𝑥!𝑦!(𝑛-𝑥-𝑦)!}{𝑝}_{𝑋}^{𝑥}{𝑝}_{𝑌}^{𝑦}{(1-{𝑝}_{𝑋}-{𝑝}_{𝑌})}^{𝑛-𝑥-𝑦} \\ & =\sum _{𝑦=0}^{𝑛-𝑥}\frac{𝑛!}{𝑥!(𝑛-𝑥)!}\cdot \frac{(𝑛-𝑥)!}{𝑦!(𝑛-𝑥-𝑦)!}{𝑝}_{𝑋}^{𝑥}{𝑝}_{𝑌}^{𝑦}{(1-{𝑝}_{𝑋}-{𝑝}_{𝑌})}^{𝑛-𝑥-𝑦} \\ & =\frac{𝑛!}{𝑥!(𝑛-𝑥)!}{𝑝}_{𝑋}^{𝑥}\sum _{𝑦=0}^{𝑛-𝑥}\frac{(𝑛-𝑥)!}{𝑦!(𝑛-𝑥-𝑦)!}{𝑝}_{𝑌}^{𝑦}{(1-{𝑝}_{𝑋}-{𝑝}_{𝑌})}^{𝑛-𝑥-𝑦} \\ & \text{Apply the binomial theorem for}\, {[{𝑝}_{𝑌}+(1-{𝑝}_{𝑋}-{𝑝}_{𝑌})]}^{𝑛-𝑥} \\ & =\frac{𝑛!}{𝑥!(𝑛-𝑥)!}{𝑝}_{𝑋}^{𝑥}{(1-{𝑝}_{𝑋})}^{𝑛-𝑥} \\ & =\binom{𝑛}{𝑥}{𝑝}_{𝑋}^{𝑥}{(1-{𝑝}_{𝑋})}^{𝑛-𝑥}.\end{aligned}

Therefore, 𝑋∼Bin⁡(𝑛,𝑝𝑋)𝑋∼\operatorname{Bin}(𝑛,{𝑝}_{𝑋}).

Exercises

Exercise 4.2

Select an even integer randomly from the set {12,14,16,18,20,22}\{12,14,16,18,20,22\}. Then, select an integer randomly from another set {12,13,14,15,16,17}\{12,13,14,15,16,17\}. Let 𝑋𝑋 denote the integer selected from the first set and let 𝑌𝑌 equal the sum of the two selected integers.

  1. Find the joint PMF of 𝑋𝑋 and 𝑌𝑌.
  2. Compute the marginal PMFs.
  3. Determine whether 𝑋𝑋 and 𝑌𝑌 are independent.