Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 91 tok/s
Gemini 2.5 Pro 58 tok/s Pro
GPT-5 Medium 29 tok/s
GPT-5 High 29 tok/s Pro
GPT-4o 102 tok/s
GPT OSS 120B 462 tok/s Pro
Kimi K2 181 tok/s Pro
2000 character limit reached

Grothendieck topologies on a poset (1405.4408v2)

Published 17 May 2014 in math.CT, math-ph, and math.MP

Abstract: We investigate Grothendieck topologies (in the sense of sheaf theory) on a poset $\P$ that are generated by some subset of $\P$. We show that such Grothendieck topologies exhaust all possibilities if and only if $\P$ is Artinian. If $\P$ is not Artinian, other families of Grothendieck topologies on $\P$ exist that are not generated by some subset of $\P$, but even those are related to the Grothendieck topologies generated by subsets. Furthermore, we investigate several notions of equivalences of Grothendieck topologies, and using a posetal version of the Comparison Lemma, a sheaf-theoretic result known as the Comparison Lemma, going back to Grothendieck et al \cite{SGA4}, we calculate the sheaves with respect to most of the Grothendieck topologies we have found.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)