Skip to content

Commit e599bda

Browse files
authored
Merge pull request #99 from JoramSoch/master
added 1 definitions and 3 proofs
2 parents dbd4d96 + a7965b4 commit e599bda

5 files changed

Lines changed: 277 additions & 10 deletions

File tree

D/rvar-uni.md

Lines changed: 36 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,36 @@
1+
---
2+
layout: definition
3+
mathjax: true
4+
5+
author: "Joram Soch"
6+
affiliation: "BCCN Berlin"
7+
e_mail: "joram.soch@bccn-berlin.de"
8+
date: 2020-11-06 03:47:00
9+
10+
title: "Univariate and multivariate random variable"
11+
chapter: "General Theorems"
12+
section: "Probability theory"
13+
topic: "Random variables"
14+
definition: "Univariate vs. multivariate"
15+
16+
sources:
17+
- authors: "Wikipedia"
18+
year: 2020
19+
title: "Multivariate random variable"
20+
in: "Wikipedia, the free encyclopedia"
21+
pages: "retrieved on 2020-11-06"
22+
url: "https://en.wikipedia.org/wiki/Multivariate_random_variable"
23+
24+
def_id: "D106"
25+
shortcut: "rvar-uni"
26+
username: "JoramSoch"
27+
---
28+
29+
30+
**Definition:** Let $X$ be a [random variable](/D/rvar) with possible outcomes $\mathcal{X}$. Then,
31+
32+
* $X$ is called a univariate random variable or [random scalar](/D/rvar), if $\mathcal{X}$ is one-dimensional, i.e. (a subset of) the set of real numbers $\mathbb{R}$;
33+
34+
* $X$ is called a multivariate random variable or [random vector](/D/rvec), if $\mathcal{X}$ is multi-dimensional, e.g. (a subset of) the set of real vectors $\mathbb{R}^n$;
35+
36+
* $X$ is called a matrix-valued random variable or [random matrix](/D/rmat), if $\mathcal{X}$ is (a subset of) the set of real matrices $\mathbb{R}^{n \times p}$.

I/Table_of_Contents.md

Lines changed: 14 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -22,6 +22,7 @@ title: "Table of Contents"
2222
&emsp;&ensp; 1.1.3. *[Random matrix](/D/rmat)* <br>
2323
&emsp;&ensp; 1.1.4. *[Constant](/D/const)* <br>
2424
&emsp;&ensp; 1.1.5. *[Discrete vs. continuous](/D/rvar-disc)* <br>
25+
&emsp;&ensp; 1.1.6. *[Univariate vs. multivariate](/D/rvar-uni)* <br>
2526

2627
1.2. Probability <br>
2728
&emsp;&ensp; 1.2.1. *[Probability](/D/prob)* <br>
@@ -40,16 +41,19 @@ title: "Table of Contents"
4041
1.4. Probability functions <br>
4142
&emsp;&ensp; 1.4.1. *[Probability mass function](/D/pmf)* <br>
4243
&emsp;&ensp; 1.4.2. **[Probability mass function of strictly increasing function](/P/pmf-sifct)** <br>
43-
&emsp;&ensp; 1.4.3. *[Probability density function](/D/pdf)* <br>
44-
&emsp;&ensp; 1.4.4. **[Probability density function of strictly increasing function](/P/pdf-sifct)** <br>
45-
&emsp;&ensp; 1.4.5. *[Cumulative distribution function](/D/cdf)* <br>
46-
&emsp;&ensp; 1.4.6. **[Cumulative distribution function of strictly increasing function](/P/cdf-sifct)** <br>
47-
&emsp;&ensp; 1.4.7. *[Quantile function](/D/qf)* <br>
48-
&emsp;&ensp; 1.4.8. *[Moment-generating function](/D/mgf)* <br>
49-
&emsp;&ensp; 1.4.9. **[Moment-generating function of linear transformation](/P/mgf-ltt)** <br>
50-
&emsp;&ensp; 1.4.10. **[Moment-generating function of linear combination](/P/mgf-lincomb)** <br>
51-
&emsp;&ensp; 1.4.11. *[Cumulant-generating function](/D/cgf)* <br>
52-
&emsp;&ensp; 1.4.12. *[Probability-generating function](/D/pgf)* <br>
44+
&emsp;&ensp; 1.4.3. **[Probability mass function of strictly decreasing function](/P/pmf-sdfct)** <br>
45+
&emsp;&ensp; 1.4.4. *[Probability density function](/D/pdf)* <br>
46+
&emsp;&ensp; 1.4.5. **[Probability density function of strictly increasing function](/P/pdf-sifct)** <br>
47+
&emsp;&ensp; 1.4.6. **[Probability density function of strictly decreasing function](/P/pdf-sdfct)** <br>
48+
&emsp;&ensp; 1.4.7. *[Cumulative distribution function](/D/cdf)* <br>
49+
&emsp;&ensp; 1.4.8. **[Cumulative distribution function of strictly increasing function](/P/cdf-sifct)** <br>
50+
&emsp;&ensp; 1.4.9. **[Cumulative distribution function of strictly decreasing function](/P/cdf-sdfct)** <br>
51+
&emsp;&ensp; 1.4.10. *[Quantile function](/D/qf)* <br>
52+
&emsp;&ensp; 1.4.11. *[Moment-generating function](/D/mgf)* <br>
53+
&emsp;&ensp; 1.4.12. **[Moment-generating function of linear transformation](/P/mgf-ltt)** <br>
54+
&emsp;&ensp; 1.4.13. **[Moment-generating function of linear combination](/P/mgf-lincomb)** <br>
55+
&emsp;&ensp; 1.4.14. *[Cumulant-generating function](/D/cgf)* <br>
56+
&emsp;&ensp; 1.4.15. *[Probability-generating function](/D/pgf)* <br>
5357

5458
1.5. Expected value <br>
5559
&emsp;&ensp; 1.5.1. *[Definition](/D/mean)* <br>

P/cdf-sdfct.md

Lines changed: 78 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,78 @@
1+
---
2+
layout: proof
3+
mathjax: true
4+
5+
author: "Joram Soch"
6+
affiliation: "BCCN Berlin"
7+
e_mail: "joram.soch@bccn-berlin.de"
8+
date: 2020-11-06 04:12:00
9+
10+
title: "Cumulative distribution function of a strictly decreasing function of a random variable"
11+
chapter: "General Theorems"
12+
section: "Probability theory"
13+
topic: "Probability functions"
14+
theorem: "Cumulative distribution function of strictly decreasing function"
15+
16+
sources:
17+
- authors: "Taboga, Marco"
18+
year: 2017
19+
title: "Functions of random variables and their distribution"
20+
in: "Lectures on probability and mathematical statistics"
21+
pages: "retrieved on 2020-11-06"
22+
url: "https://www.statlect.com/fundamentals-of-probability/functions-of-random-variables-and-their-distribution#hid5"
23+
24+
proof_id: "P186"
25+
shortcut: "cdf-sdfct"
26+
username: "JoramSoch"
27+
---
28+
29+
30+
**Theorem:** Let $X$ be a [random variable](/D/rvar) with possible outcomes $\mathcal{X}$ and let $g(x)$ be a strictly decreasing function on the support of $X$. Then, the [cumulative distribution function](/D/cdf) of $Y = g(X)$ is given by
31+
32+
$$ \label{eq:cdf-sdfct}
33+
F_Y(y) = \left\{
34+
\begin{array}{rl}
35+
1 \; , & \text{if} \; y > \mathrm{max}(\mathcal{Y}) \\
36+
1 - F_X(g^{-1}(y)) + \mathrm{Pr}(X = g^{-1}(y)) \; , & \text{if} \; y \in \mathcal{Y} \\
37+
0 \; , & \text{if} \; y < \mathrm{min}(\mathcal{Y})
38+
\end{array}
39+
\right.
40+
$$
41+
42+
where $g^{-1}(y)$ is the inverse function of $g(x)$ and $\mathcal{Y}$ is the set of possible outcomes of $Y$:
43+
44+
$$ \label{eq:Y-range}
45+
\mathcal{Y} = \left\lbrace y = g(x): x \in \mathcal{X} \right\rbrace \; .
46+
$$
47+
48+
49+
**Proof:** The support of $Y$ is determined by $g(x)$ and by the set of possible outcomes of $X$. Moreover, if $g(x)$ is strictly decreasing, then $g^{-1}(y)$ is also strictly decreasing. Therefore, the [cumulative distribution function](/D/cdf) of $Y$ can be derived as follows:
50+
51+
1) If $y$ is higher than the [highest value](/D/max) $Y$ can take, then $\mathrm{Pr}(Y \leq y) = 1$, so
52+
53+
$$ \label{eq:cdf-sdfct-p1}
54+
F_Y(y) = 1, \quad \text{if} \quad y > \mathrm{max}(\mathcal{Y}) \; .
55+
$$
56+
57+
2) If $y$ belongs to the support of $Y$, then $F_Y(y)$ can be derived as follows:
58+
59+
$$ \label{eq:cdf-sdfct-p2}
60+
\begin{split}
61+
F_Y(y) &= \mathrm{Pr}(Y \leq y) \\
62+
&= 1 - \mathrm{Pr}(Y > y) \\
63+
&= 1 - \mathrm{Pr}(g(X) > y) \\
64+
&= 1 - \mathrm{Pr}(X < g^{-1}(y)) \\
65+
&= 1 - \mathrm{Pr}(X < g^{-1}(y)) - \mathrm{Pr}(X = g^{-1}(y)) + \mathrm{Pr}(X = g^{-1}(y)) \\
66+
&= 1 - \left[ \mathrm{Pr}(X < g^{-1}(y)) + \mathrm{Pr}(X = g^{-1}(y)) \right] + \mathrm{Pr}(X = g^{-1}(y)) \\
67+
&= 1 - \mathrm{Pr}(X \leq g^{-1}(y)) + \mathrm{Pr}(X = g^{-1}(y)) \\
68+
&= 1 - F_X(g^{-1}(y)) + \mathrm{Pr}(X = g^{-1}(y)) \; .
69+
\end{split}
70+
$$
71+
72+
3) If $y$ is lower than the [lowest value](/D/min) $Y$ can take, then $\mathrm{Pr}(Y \leq y) = 0$, so
73+
74+
$$ \label{eq:cdf-sdfct-p3}
75+
F_Y(y) = 0, \quad \text{if} \quad y < \mathrm{min}(\mathcal{Y}) \; .
76+
$$
77+
78+
Taking together \eqref{eq:cdf-sdfct-p1}, \eqref{eq:cdf-sdfct-p2}, \eqref{eq:cdf-sdfct-p3}, eventually proves \eqref{eq:cdf-sdfct}.

P/pdf-sdfct.md

Lines changed: 92 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,92 @@
1+
---
2+
layout: proof
3+
mathjax: true
4+
5+
author: "Joram Soch"
6+
affiliation: "BCCN Berlin"
7+
e_mail: "joram.soch@bccn-berlin.de"
8+
date: 2020-11-06 05:30:00
9+
10+
title: "Probability density function of a strictly decreasing function of a continuous random variable"
11+
chapter: "General Theorems"
12+
section: "Probability theory"
13+
topic: "Probability functions"
14+
theorem: "Probability density function of strictly decreasing function"
15+
16+
sources:
17+
- authors: "Taboga, Marco"
18+
year: 2017
19+
title: "Functions of random variables and their distribution"
20+
in: "Lectures on probability and mathematical statistics"
21+
pages: "retrieved on 2020-11-06"
22+
url: "https://www.statlect.com/fundamentals-of-probability/functions-of-random-variables-and-their-distribution#hid7"
23+
24+
proof_id: "P188"
25+
shortcut: "pdf-sdfct"
26+
username: "JoramSoch"
27+
---
28+
29+
30+
**Theorem:** Let $X$ be a [continuous](/D/rvar-disc) [random variable](/D/rvar) with possible outcomes $\mathcal{X}$ and let $g(x)$ be a strictly decreasing function on the support of $X$. Then, the [probability density function](/D/pdf) of $Y = g(X)$ is given by
31+
32+
$$ \label{eq:pdf-sdfct}
33+
f_Y(y) = \left\{
34+
\begin{array}{rl}
35+
-f_X(g^{-1}(y)) \, \frac{\mathrm{d}g^{-1}(y)}{\mathrm{d}y} \; , & \text{if} \; y \in \mathcal{Y} \\
36+
0 \; , & \text{if} \; y \notin \mathcal{Y}
37+
\end{array}
38+
\right.
39+
$$
40+
41+
where $g^{-1}(y)$ is the inverse function of $g(x)$ and $\mathcal{Y}$ is the set of possible outcomes of $Y$:
42+
43+
$$ \label{eq:Y-range}
44+
\mathcal{Y} = \left\lbrace y = g(x): x \in \mathcal{X} \right\rbrace \; .
45+
$$
46+
47+
48+
**Proof:** The [cumulative distribution function of a strictly decreasing function](/P/cdf-sifct) is
49+
50+
$$ \label{eq:cdf-sdfct}
51+
F_Y(y) = \left\{
52+
\begin{array}{rl}
53+
1 \; , & \text{if} \; y > \mathrm{max}(\mathcal{Y}) \\
54+
1 - F_X(g^{-1}(y)) + \mathrm{Pr}(X = g^{-1}(y)) \; , & \text{if} \; y \in \mathcal{Y} \\
55+
0 \; , & \text{if} \; y < \mathrm{min}(\mathcal{Y})
56+
\end{array}
57+
\right.
58+
$$
59+
60+
Note that [for continuous random variables, the probability](/D/pdf) of point events is
61+
62+
$$ \label{eq:pdf-cont}
63+
\mathrm{Pr}(X = a) = \int_a^a f_X(x) \, \mathrm{d}x = 0 \; .
64+
$$
65+
66+
Because the [probability density function is the first derivative of the cumulative distribution function](/P/pdf-cdf)
67+
68+
$$ \label{eq:pdf-cdf}
69+
f_X(x) = \frac{\mathrm{d}F_X(x)}{\mathrm{d}x} \; ,
70+
$$
71+
72+
the [probability density function](/D/pdf) of $Y$ can be derived as follows:
73+
74+
1) If $y$ does not belong to the support of $Y$, $F_Y(y)$ is constant, such that
75+
76+
$$ \label{eq:pdf-sdfct-p1}
77+
f_Y(y) = 0, \quad \text{if} \quad y \notin \mathcal{Y} \; .
78+
$$
79+
80+
2) If $y$ belongs to the support of $Y$, then $f_Y(y)$ can be derived using the chain rule:
81+
82+
$$ \label{eq:pdf-sdfct-p2}
83+
\begin{split}
84+
f_Y(y) &\overset{\eqref{eq:pdf-cdf}}{=} \frac{\mathrm{d}}{\mathrm{d}y} F_Y(y) \\
85+
&\overset{\eqref{eq:cdf-sdfct}}{=} \frac{\mathrm{d}}{\mathrm{d}y} \left[ 1 - F_X(g^{-1}(y)) + \mathrm{Pr}(X = g^{-1}(y)) \right] \\
86+
&\overset{\eqref{eq:pdf-cont}}{=} \frac{\mathrm{d}}{\mathrm{d}y} \left[ 1 - F_X(g^{-1}(y)) \right] \\
87+
&= -\frac{\mathrm{d}}{\mathrm{d}y} F_X(g^{-1}(y)) \\
88+
&= - f_X(g^{-1}(y)) \, \frac{\mathrm{d}g^{-1}(y)}{\mathrm{d}y} \; .
89+
\end{split}
90+
$$
91+
92+
Taking together \eqref{eq:pdf-sdfct-p1} and \eqref{eq:pdf-sdfct-p2}, eventually proves \eqref{eq:pdf-sdfct}.

P/pmf-sdfct.md

Lines changed: 57 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,57 @@
1+
---
2+
layout: proof
3+
mathjax: true
4+
5+
author: "Joram Soch"
6+
affiliation: "BCCN Berlin"
7+
e_mail: "joram.soch@bccn-berlin.de"
8+
date: 2020-11-06 04:21:00
9+
10+
title: "Probability mass function of a strictly decreasing function of a discrete random variable"
11+
chapter: "General Theorems"
12+
section: "Probability theory"
13+
topic: "Probability functions"
14+
theorem: "Probability mass function of strictly decreasing function"
15+
16+
sources:
17+
- authors: "Taboga, Marco"
18+
year: 2017
19+
title: "Functions of random variables and their distribution"
20+
in: "Lectures on probability and mathematical statistics"
21+
pages: "retrieved on 2020-11-06"
22+
url: "https://www.statlect.com/fundamentals-of-probability/functions-of-random-variables-and-their-distribution#hid6"
23+
24+
proof_id: "P187"
25+
shortcut: "pmf-sdfct"
26+
username: "JoramSoch"
27+
---
28+
29+
30+
**Theorem:** Let $X$ be a [discrete](/D/rvar-disc) [random variable](/D/rvar) with possible outcomes $\mathcal{X}$ and let $g(x)$ be a strictly decreasing function on the support of $X$. Then, the [probability mass function](/D/pmf) of $Y = g(X)$ is given by
31+
32+
$$ \label{eq:pmf-sdfct}
33+
f_Y(y) = \left\{
34+
\begin{array}{rl}
35+
f_X(g^{-1}(y)) \; , & \text{if} \; y \in \mathcal{Y} \\
36+
0 \; , & \text{if} \; y \notin \mathcal{Y}
37+
\end{array}
38+
\right.
39+
$$
40+
41+
where $g^{-1}(y)$ is the inverse function of $g(x)$ and $\mathcal{Y}$ is the set of possible outcomes of $Y$:
42+
43+
$$ \label{eq:Y-range}
44+
\mathcal{Y} = \left\lbrace y = g(x): x \in \mathcal{X} \right\rbrace \; .
45+
$$
46+
47+
48+
**Proof:** Because a strictly decreasing function is invertible, the [probability mass function](/D/pmf) of $Y$ can be derived as follows:
49+
50+
$$ \label{eq:pmf-sdfct-qed}
51+
\begin{split}
52+
f_Y(y) &= \mathrm{Pr}(Y = y) \\
53+
&= \mathrm{Pr}(g(X) = y) \\
54+
&= \mathrm{Pr}(X = g^{-1}(y)) \\
55+
&= f_X(g^{-1}(y)) \; .
56+
\end{split}
57+
$$

0 commit comments

Comments
 (0)