I am trying to understand the hypergeometric distribution
I looked at this example, I can see that it makes sense when we force each object to be distinct, though I am wondering why this is correct when each element is not distinct.
For example if I am choosing from red und black balls the formula $\Pr(X = k) = \frac{\binom{K}{k} \binom{N - K}{n-k}}{\binom{N}{n}}$ states that I would have to choose k out of the red balls and n - k out of the black balls. But in reality there is just one possibility to choose $\binom{K}{k}$ since every chosen red ball is the same und not distinct. It would just be a set $(r, ... , r)$ k times without being able to say what $r_i$ with $0 \leq i \leq k$ actually is.
We could even choose $\Omega := {(,,,...,),(,,...,),...,(,,...,)} $ as sample space. Why is it not done in this way?
So why do we have to enforce distincness of the objects when they are actually not distinct to get the disired result and why is this still correct?