Consider the poset category $\mathbb{Q}^{op}$, i.e. where $p \rightarrow q$ iff $p \geq q$. Take any $q \in \mathbb{Q}$. Then how many sieves are there for $q$ in $\mathbb{Q}^{op}$?
Supposedly, the answer should be $\lbrace r \vert r \geq q, r \in \mathbb{R} \cup \lbrace \infty \rbrace \rbrace$. But I can only see there corresponding exactly one sieve for each rational $p \geq q$, namely the sieve $S_p = \lbrace r \in \mathbb{Q} \vert r \geq p \rbrace$. In which case there are only countably many sieves on $q$.
So I really cannot see how there could be uncountably many sieves on $q$ (in $\mathbb{Q}^{op}$) as the suggested answer suggests. I tried thinking in terms of Dedekind cuts on the rationals, but that doesn't change the fact that there is exactly one sieve for each rational greater than $q$. Namely, even if I label the sieves with reals, there's still going to be countably many reals.
I'm sure I've misunderstood something, but really cannot see what it is. Any help will be greatly appreciated.