Sieve (category theory)

Sieve (category theory)

In category theory, a branch of mathematics, a sieve is a way of choosing arrows with a common codomain. It is a categorical analogue of a collection of open subsets of a fixed open set in topology. In a Grothendieck topology, certain sieves become categorical analogues of open covers in topology.

Definition

Let C be a category, and let "c" be an object of C. A sieve "S" on "c" is a subfunctor of Hom(−, "c"), i.e., for all objects "c"′ of C, "S"("c"′) ⊆ Hom("c"′, "c"), and for all arrows "f":"c"″→"c"′, "S"("f") is the restriction of Hom("f", "c"), the pullback by "f", to "S"("c"′).

Put another way, a sieve is a collection "S" of arrows with a common codomain which satisfies the functoriality condition, "If "g":"c"′→"c" is an arrow in "S", and if "f":"c"″→"c"′ is any other arrow in C, then the pullback "gf" of "g" by "f" is in "S"." Consequently sieves are similar to right ideals in ring theory or filters in order theory.

Pullback of sieves

The most common operation on a sieve is "pullback". Pulling back a sieve "S" on "c" by an arrow "f":"c"′→"c" gives a new sieve "f"*"S" on "c"′. This new sieve consists of all the arrows in "S" which factor through "c"′.

There are several equivalent ways of defining "f"*"S". The simplest is:

:For any object "d" of C, "f"*"S"("d") = { "g":"d"→"c"′ | fg ∈ "S"("d")}

A more abstract formulation is:

:"f"*"S" is the image of the fibered product "S"×Hom(−, "c")Hom(−, "c"′) under the natural projection "S"×Hom(−, "c")Hom(−, "c"′)→Hom(−, "c"′).

Here the map Hom(−, "c"′)→Hom(−, "c") is Hom("f", "c"′), the pullback by "f".

The latter formulation suggests that we can also take the image of "S"×Hom(−, "c")Hom(−, "c"′) under the natural map to Hom(−, "c"). This will be the image of "f"*"S" under composition with "f". For each object "d" of C, this sieve will consist of all arrows "fg", where "g":"d"→"c"′ is an arrow of "f"*"S"("d"). In other words, it consists of all arrows in "S" that can be factored through "f".

If we denote by unicode|∅"c" the empty sieve on "c", that is, the sieve for which unicode|∅("d") is always the empty set, then for any "f":"c"′→"c", "f"*unicode|∅"c" is unicode|∅"c"′. Furthermore, "f"*Hom(−, "c") = Hom(−, "c"′).

Properties of sieves

Let "S" and "S"′ be two sieves on "c". We say that "S" ⊆ "S"′ if for all objects "c"′ of C, "S"("c"′) ⊆ "S"("c"′). For all objects "d" of C, we define ("S" ∪ "S"′)("d") to be "S"("d") ∪ "S"′("d") and ("S" ∩ "S"′)("d") to be "S"("d") ∩ "S"′("d"). We can clearly extend this definition to infinite unions and intersections as well.

If we define SieveC("c") (or Sieve("c") for short) to be the set of all sieves on "c", then Sieve("c") becomes a partially ordered under ⊆. It is easy to see from the definition that the union or intersection of any family of sieves on "c" is a sieve on "c", so Sieve("c") is a complete lattice.

A Grothendieck topology is a collection of sieves subject to certain properties. These sieves are called "covering sieves". The set of all covering sieves on an object "c" is a subset "J"("c") of Sieve("c"). "J"("c") satisfies several properties in addition to those required by the definition:

*If "S" and "S"′ are sieves on "c", "S" ⊆ "S"′, and "S" ∈ "J"("c"), then "S"′ ∈ "J"("c").
*Finite intersections of elements of "J"("c") are in "J"("c").

Consequently, "J"("c") is also a distributive lattice, and it is cofinal in Sieve("c").


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Sieve (mathematics) — In mathematics, sieve has several possible definitions: * In number theory, a sieve is a technique for counting the size of certain sets whose precise number of elements is hard to determine. See sieve theory, general number field sieve, and… …   Wikipedia

  • Sieve — In general, a sieve separates wanted/desired elements from unwanted material using a tool such as a mesh, net or other filtration or distillation methods, but it is also used for classification of powders by particle size, or for size measurement …   Wikipedia

  • Number theory — A Lehmer sieve an analog computer once used for finding primes and solving simple diophantine equations. Number theory is a branch of pure mathematics devoted primarily to the study of the integers. Number theorists study prime numbers (the… …   Wikipedia

  • Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …   Wikipedia

  • List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

  • Grothendieck topology — In category theory, a branch of mathematics, a Grothendieck topology is a structure on a category C which makes the objects of C act like the open sets of a topological space. A category together with a choice of Grothendieck topology is called a …   Wikipedia

  • Wikipedia:Manual of Style/Mathematics — This guideline is a part of the English Wikipedia s Manual of Style. Use common sense in applying it; it will have occasional exceptions. Please ensure that any edits to this page reflect consensus. Shortcuts: WP:MSM MO …   Wikipedia

  • List of mathematics articles (L) — NOTOC L L (complexity) L BFGS L² cohomology L function L game L notation L system L theory L Analyse des Infiniment Petits pour l Intelligence des Lignes Courbes L Hôpital s rule L(R) La Géométrie Labeled graph Labelled enumeration theorem Lack… …   Wikipedia

  • List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… …   Wikipedia

  • List of lemmas — This following is a list of lemmas (or, lemmata , i.e. minor theorems, or sometimes intermediate technical results factored out of proofs). See also list of axioms, list of theorems and list of conjectures. 0 to 9 *0/1 Sorting Lemma ( comparison… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”