Elementary note. A Sierpiński space is introduced along with its representability of the open-set functor
, then observing how this representability comes out. It is observed that “classifying phenomena” often is encoded within the notion of representability—classifying space is one of such.1
Preorders as Thin Categories
Thin categories and preorders
Let
be a preorder. It may be regarded as a thin category by declaring a unique morphism
whenever
. Reflexivity furnishes identity morphisms; transitivity furnishes composition. Conversely, a small thin category determines a preorder on its object set by
![]()
Thus small thin categories are preorders up to isomorphism. Taking the skeleton — identifying objects
for which
and
— produces a poset; hence thin categories are posets up to equivalence. This distinction is minor for many order-theoretic purposes, but it is not vacuous: a preorder may contain distinct yet isomorphic objects when viewed categorically.
Directed subsets as filtered diagrams
A nonempty preorder
is directed if every pair
admits an upper bound in
: there exists
with
and
.
Viewed as a thin category, this is precisely the condition that
is filtered. A category
is filtered when (1) it is nonempty, (2) any two objects admit a common morphic target, and (3) any two parallel morphisms are equalized by some further morphism. In a thin category the third condition is automatic — there is at most one morphism between any two objects — so a directed preorder is exactly a filtered thin category.
If
is a directed subset of a preorder
, the inclusion
is a filtered diagram in the thin category
. With the convention
, the colimit of this diagram, if it exists, is the supremum of
: ![]()
Thus directed joins are filtered colimits in the thin-categorical sense.
Topologies on Preorders via Characteristic Maps
The Alexandrov topology
Let
be a preorder and let
carry its natural order. The characteristic map
is a morphism of preorders — equivalently, a functor between thin categories — if and only if
![]()
i.e., if and only if
is upward-closed.
The upper Alexandrov topology on
is therefore
![]()
whose opens are precisely the upward-closed subsets. In this formulation, upward-closedness is not the primary definition but the order-theoretic expansion of the condition that
be a functor.
The Scott topology
Let
be a directed subposet — a filtered thin diagram — whose colimit
exists in
. The map
preserves this directed colimit if
![]()
in
. Since
is itself a thin category, colimits in
are suprema, so the right-hand side equals
, and the condition becomes
![]()
Now
if and only if
, so preservation of this directed colimit is exactly the inaccessibility condition:
![]()
The Scott topology on
is accordingly
![]()
Equivalently,
if and only if
is upward-closed and inaccessible by directed joins. The first phrasing is the structural one; the second is its order-theoretic unpacking.
When
is a dcpo every directed subset has a join, so the preservation condition is tested on all directed subsets. When
is not directed-complete, it is tested only on those directed subsets whose joins exist in
.
Comparison: Alexandrov versus Scott
The two topologies are distinguished by which functors
are admitted:
![]()
![]()
Every Scott-open set is Alexandrov-open, so
and the inclusion may be strict.
Example. Let
with
, and let
. The map
is monotone, so
. However, the directed subset
has colimit
, and
![]()
so
does not preserve this directed colimit. Hence
.
This example isolates the distinction: Alexandrov openness detects only monotonicity, while Scott openness further demands compatibility with filtered colimits.
A Worked Example: Five Points
Coincidence of topologies on a finite poset
Let
with order generated by
and with
incomparable to all other elements.
Since
is finite, every directed subset has a greatest element. Therefore every directed colimit is already attained within the indexing directed subset, and every morphism of preorders
automatically preserves directed colimits. Consequently,
![]()
The Scott-open sets are precisely the upward-closed subsets of
:
![]()
For instance,
is not open because
is not a morphism of preorders: since
yet
![]()
monotonicity would require
in
, which is false.
The lattice of opens
The topology
, ordered by inclusion, is a complete lattice ![]()
Arbitrary joins in this lattice are unions, and finite meets are intersections.

: the latter displays the ordering on elements, while the former displays the ordering on open sets by inclusion. This distinction is often suppressed when one says that finite Alexandrov spaces correspond to preorders; the correspondence is correct, but the topology is itself a nontrivially structured object.The Sierpiński Space as Classifier
The classifying bijection
Let
be the Sierpiński Space, two-point set equipped with the Scott, or equivalently, Alexandrov topology
, where
is the open point and
the closed point. For a topological space
, every subset
has a characteristic function
![Rendered by QuickLaTeX.com \[\mathrm{ch}_U : X \to S, \, \mathrm{ch}_U(x) = \begin{cases} 1 & x \in U, \\ 0 & x \notin U. \end{cases}\]](https://blog.icefog.work/wp-content/ql-cache/quicklatex.com-2e79463139556e65651f4bc969d5ef31_l3.png)
Since
, the map
is continuous if and only if
is open. Hence there is a bijection
, where
denotes the lattice2 of open subsets of
. This bijection sends
to
, and sends an open subset
to its characteristic function
.
The bijection is natural in
. If
is continuous and
classifies the open subset
, then the composite
classifies
, since ![]()
Thus precomposition with
corresponds, under the bijection, to pullback of open subsets along
:
![Rendered by QuickLaTeX.com \[\begin{array}{ccc}\mathbf{Top}(X, S) & \cong & O(X) \\[4pt]\downarrow{g^\ast} && \downarrow{g^{-1}} \\[4pt]\mathbf{Top}(Y, S) & \cong & O(Y).\end{array}\]](https://blog.icefog.work/wp-content/ql-cache/quicklatex.com-38fee4f5ff16d6beb44b234604117e97_l3.png)
Equivalently, the open-set functor
is representable with representing object
:
; furthermore,
is the universal element with respect to
, in a sense that it is the terminal object in the category of elements
. 3
- Let
denote a suitable category of spaces for which principal
-bundles are classified by
, e.g., the category of paracompact Hausdorff spaces, the category of CW complexes, etc. The principal
-bundle functor
![Rendered by QuickLaTeX.com \[{\bf Prin}_G(-):\mathbb{T}^{op}\to {\bf Set}\]](https://blog.icefog.work/wp-content/ql-cache/quicklatex.com-3acbe27f2a66c589232ce0b79abc4b8c_l3.png)
sends each topological space
the isomorphism class of principal
-bundle over
.What bundle theory claims is that there is the representation
![Rendered by QuickLaTeX.com \[\psi(u): {\bf Ho}\mathbb{T}(-,BG)\cong {\bf Prin}_G;\, [f:X\to BG]\mapsto f^\ast(EG\xrightarrow{u} BG),\]](https://blog.icefog.work/wp-content/ql-cache/quicklatex.com-b496ea12144b1b6daa0d23a73d7d5a25_l3.png)
where
is the universal bundle (indeed,
is the universal element). - Or more generally dcpo.
- Here we don’t need Yoneda formulation of the category of elements, namely
, where
is the Yoneda functor. We can replace the element-wise definition by Yoneda lemma
.