 What's the agent and patient in a causative clause
 BTC/USDT trading on binance
 Which light wallets actually connect to nodes?
 Has anybody worked with cryptobitup?
 Lightning Network's RSMC: what happens if there's no revocation transaction?
 convert 12 word seed into 24 word seed
 When you pay from a P2SH address, does its change go into a P2SH address too?
 Que signifient l'inapplication et l'intérêt dans les écrits du dixhuitième siècle ?
 How to assess perceptional volume from FFT
 What is the reason of using Pedersen Commitment scheme over HMAC?
 What is an example of elgamal homomorphic double encryption?
 SQLite encrypted database password
 Cryptanalisis on Kasumi in A5/3 GSM algorithm why is broken in 2G and not in 3G?
 May a French citizen obtain a visa for Vietnam while in the country during the visa “free” 15 days?
 Schengen visa until September 4
 Lounge access when flying from Chongqing to Hong Kong?
 How can there be order without intelligence to understand it?
 What are the differences between “Raum” and “Zimmer”?
 Ambiguity in a subordinate clause
 What is a Safek Muchlat? (i.e. unsure if he's a fullfledged Metzora)
If two random variables have CDFs that have the same value for all x, can we assume the random variables are equal?
My text has the following theorem:
Let $X$ have a CDF $F$ and let $Y$ have CDF $G$. If $F(x) = G(x)$ for all $x$, then $\mathbb{P}(X \in A) = \mathbb{P}(Y \in A)$ for all $A$.
I don't see a way that X and Y could assign a different probability to the same event but still have their CDFs be equal at every point. If they disagreed at point j, then F(j) will not equal G(j). Therefore they must be the same?
For elementary probability:
I think it's just saying that if the cdf's are the same then the pdf's are the same. PDF's don't always exist in advanced probability.
Do you seriously prove that? Anyway, it likely comes down to how 'all' $A$ (subsets of $\mathbb R$?) that you can come up with is somehow 'related' to $(\infty, x]$. For example,
$$A = (a,x] = (\infty,x] \cap (\infty,a]^c$$
$$A = (\infty, x) = (\infty, x] \cap \{x\}^c$$
$$A = \{x\} = (\infty, x] \cap (\infty, x)^c$$
$$A = \{x\} \cup [a,b] = [(\infty, x] \cap (\infty, x)^c] \cup [(\infty,b] \c

For elementary probability:
I think it's just saying that if the cdf's are the same then the pdf's are the same. PDF's don't always exist in advanced probability.
Do you seriously prove that? Anyway, it likely comes down to how 'all' $A$ (subsets of $\mathbb R$?) that you can come up with is somehow 'related' to $(\infty, x]$. For example,
$$A = (a,x] = (\infty,x] \cap (\infty,a]^c$$
$$A = (\infty, x) = (\infty, x] \cap \{x\}^c$$
$$A = \{x\} = (\infty, x] \cap (\infty, x)^c$$
$$A = \{x\} \cup [a,b] = [(\infty, x] \cap (\infty, x)^c] \cup [(\infty,b] \cap (\infty,a)^c]$$
Thus, if you can compute $P((\infty, x])$ for all $x$, then you can compute $P(X \in A)$ for 'all' A. The thing is not all subsets of $\mathbb R$ are 'related' to $(\infty, x]$. But that's okay because even in advanced probability, we don't mind those subsets. In advanced probability, there may be random variables where that doesn't hold if you try those subsets.
For advanced probability:
Use the
20180420 22:21:05