Let $S=\{s_1,\dots,s_k\}$ be some set of size $k$ and let $\mathit{Dist}(S)$ be the set of all probability distributions over $S$ where a probability distribution is simply a function $p \colon S \rightarrow [0,1]$ with $\sum_{s\in S}p(s) = 1$.
We construct a random probability distribution $t$ over $S=\{s_1,\dots,s_k\}$ in the following way:
- generate a multiset $R$ of $k-1$ random variables each sampled uniformly from $[0,1]$
- sort them ascending and label them $n_1$ to $n_k$, i.e., $\hat{\{}n_i\mid i\in \{1,\dots,k-1\}\hat{\}}=R$ and $n_1\leq n_2 \leq \dots \leq n_{k-1}$
- define $n_0=0$ and $n_k=1$
- for each $i$ we define $t(s_i)=n_i-n_{i-1}$
This can be visualised as taking the number line from 0 to 1, split it into $k$ parts by dropping $k-1$ separators randomly and asserting each probability a value that corresponds to the distance between two adjacent separators.
Note that $t$ is indeed a probability distribution since $n_i\geq n_{i-1}$ and $\sum_{s\in S}t(s) = 1$.
Given a set of distributions $T \subseteq Dist(S)$, what is the probability that $t \in T$?
If it helps, we can assume that $T$ gives a dense range of possible values for the probability of each element of $S$, i.e., for each $i \in \{1,\dots,k\}$ there are some $\underline{p_i},\overline{p_i}\in [0,1]$ with $\underline{p_i} < \overline{p_i}$ and $T = \{ p \mid p \in \mathit{Dist}(S) \text{ and } \forall i.p(s_i)\in [\underline{p_i},\overline{p_i}] \}$.
For $k=2$ this is straight forward since $p(s_1) = 1-p(s_2)$, i.e., it is essentially just one random variable. However even extending this to a set of three elements already gives me troubles. The main issue I keep running into is that I know the $p(s_i)$ are not independent (since they have to add to 1).
I'm not looking for a closed form necessarily. A way to compute this algorithmically would be perfectly fine.