* Tree cover?
@ 2003-09-01 8:30 Jonas Eliasson
0 siblings, 0 replies; only message in thread
From: Jonas Eliasson @ 2003-09-01 8:30 UTC (permalink / raw)
To: categories
It seems that you can modify the construction of the localic Diaconescu
cover to get an open surjective _filtered_ cover of a Grothendieck topos
Sh(C).
Instead of using the category String(C) of strings in C, you could
construct the category Tree(C) of finite, rooted, binary trees in C. If
given c and d in C you can find e such that e --> c and e --> d then
Tree(C) is a poset with binary upper bounds, i.e. a filtered category.
Could anyone provide a reference for such a construction?
Grateful for any help,
Jonas Eliasson
------------------------------------------
| Jonas Eliasson |
| Department of Mathematics |
| Uppsala University |
| Sweden |
| E-mail: jonase@math.uu.se |
| Homepage: http://www.math.uu.se/~jonase/ |
------------------------------------------
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2003-09-01 8:30 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2003-09-01 8:30 Tree cover? Jonas Eliasson
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).