|
Subfunctor
In category theory, a branch of mathematics, a subfunctor is a special type of functor that is an analogue of a subset. Definition Let C be a category, and let ''F'' be a contravariant functor from C to the category of sets Set. A contravariant functor ''G'' from C to Set is a subfunctor of ''F'' if # For all objects ''c'' of C, ''G''(''c'') ⊆ ''F''(''c''), and # For all arrows ''f'': ''c''′ → ''c'' of C, ''G''(''f'') is the restriction of ''F''(''f'') to ''G''(''c''). This relation is often written as ''G'' ⊆ ''F''. For example, let 1 be the category with a single object and a single arrow. A functor ''F'': 1 → Set maps the unique object of 1 to some set ''S'' and the unique identity arrow of 1 to the identity function 1''S'' on ''S''. A subfunctor ''G'' of ''F'' maps the unique object of 1 to a subset ''T'' of ''S'' and maps the unique identity arrow to the identity function 1''T'' on ''T''. Notice that 1''T'' is the restriction of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Grothendieck Topologies
In category theory, a branch of mathematics, a Grothendieck topology is a structure on a category ''C'' that 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 site. Grothendieck topologies axiomatize the notion of an open cover. Using the notion of covering provided by a Grothendieck topology, it becomes possible to define sheaves on a category and their cohomology. This was first done in algebraic geometry and algebraic number theory by Alexander Grothendieck to define the étale cohomology of a scheme. It has been used to define other cohomology theories since then, such as ℓ-adic cohomology, flat cohomology, and crystalline cohomology. While Grothendieck topologies are most often used to define cohomology theories, they have found other applications as well, such as to John Tate's theory of rigid analytic geometry. There is a natural way to associate a site to an ordinary topol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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. Sieves were introduced by in order to reformulate the notion of a Grothendieck topology. Definition Let C be a category, and let ''c'' be an object of C. A sieve S\colon C^ \to 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'' (in the sense of precomposition, not of fiber products), to ''S''(''c''′); see the next section, below. Put another way, a sieve is a collection ''S'' of arrows with a common codomain that satisfies the condition, "If ''g'':''c''&prime ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Category Theory
Category theory is a general theory of mathematical structures and their relations that was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Nowadays, category theory is used in almost all areas of mathematics, and in some areas of computer science. In particular, many constructions of new mathematical objects from previous ones, that appear similarly in several contexts are conveniently expressed and unified in terms of categories. Examples include quotient spaces, direct products, completion, and duality. A category is formed by two sorts of objects: the objects of the category, and the morphisms, which relate two objects called the ''source'' and the ''target'' of the morphism. One often says that a morphism is an ''arrow'' that ''maps'' its source to its target. Morphisms can be ''composed'' if the target of the first morphism equals the source of the second one, and morphism compos ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Scheme (mathematics)
In mathematics, a scheme is a mathematical structure that enlarges the notion of algebraic variety in several ways, such as taking account of multiplicities (the equations ''x'' = 0 and ''x''2 = 0 define the same algebraic variety but different schemes) and allowing "varieties" defined over any commutative ring (for example, Fermat curves are defined over the integers). Scheme theory was introduced by Alexander Grothendieck in 1960 in his treatise "Éléments de géométrie algébrique"; one of its aims was developing the formalism needed to solve deep problems of algebraic geometry, such as the Weil conjectures (the last of which was proved by Pierre Deligne). Strongly based on commutative algebra, scheme theory allows a systematic use of methods of topology and homological algebra. Scheme theory also unifies algebraic geometry with much of number theory, which eventually led to Wiles's proof of Fermat's Last Theorem. Formally, a scheme is a topological space together with ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Yoneda Lemma
In mathematics, the Yoneda lemma is arguably the most important result in category theory. It is an abstract result on functors of the type ''morphisms into a fixed object''. It is a vast generalisation of Cayley's theorem from group theory (viewing a group as a miniature category with just one object and only isomorphisms). It allows the embedding of any locally small category into a category of functors (contravariant set-valued functors) defined on that category. It also clarifies how the embedded category, of representable functors and their natural transformations, relates to the other objects in the larger functor category. It is an important tool that underlies several modern developments in algebraic geometry and representation theory. It is named after Nobuo Yoneda. Generalities The Yoneda lemma suggests that instead of studying the locally small category \mathcal , one should study the category of all functors of \mathcal into \mathbf (the category of sets with ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ringed Space
In mathematics, a ringed space is a family of (commutative) rings parametrized by open subsets of a topological space together with ring homomorphisms that play roles of restrictions. Precisely, it is a topological space equipped with a sheaf of rings called a structure sheaf. It is an abstraction of the concept of the rings of continuous (scalar-valued) functions on open subsets. Among ringed spaces, especially important and prominent is a locally ringed space: a ringed space in which the analogy between the stalk at a point and the ring of germs of functions at a point is valid. Ringed spaces appear in analysis as well as complex algebraic geometry and the scheme theory of algebraic geometry. Note: In the definition of a ringed space, most expositions tend to restrict the rings to be commutative rings, including Hartshorne and Wikipedia. "Éléments de géométrie algébrique", on the other hand, does not impose the commutativity assumption, although the book mostly consi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Representable Functor
In mathematics, particularly category theory, a representable functor is a certain functor from an arbitrary category into the category of sets. Such functors give representations of an abstract category in terms of known structures (i.e. sets and functions) allowing one to utilize, as much as possible, knowledge about the category of sets in other settings. From another point of view, representable functors for a category ''C'' are the functors ''given'' with ''C''. Their theory is a vast generalisation of upper sets in posets, and of Cayley's theorem in group theory. Definition Let C be a locally small category and let Set be the category of sets. For each object ''A'' of C let Hom(''A'',–) be the hom functor that maps object ''X'' to the set Hom(''A'',''X''). A functor ''F'' : C → Set is said to be representable if it is naturally isomorphic to Hom(''A'',–) for some object ''A'' of C. A representation of ''F'' is a pair (''A'', Φ) where :Φ : Hom(''A'',&ndash ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hom Functor
In mathematics, specifically in category theory, hom-sets (i.e. sets of morphisms between objects) give rise to important functors to the category of sets. These functors are called hom-functors and have numerous applications in category theory and other branches of mathematics. Formal definition Let ''C'' be a locally small category (i.e. a category for which hom-classes are actually sets and not proper classes). For all objects ''A'' and ''B'' in ''C'' we define two functors to the category of sets as follows: : The functor Hom(–, ''B'') is also called the ''functor of points'' of the object ''B''. Note that fixing the first argument of Hom naturally gives rise to a covariant functor and fixing the second argument naturally gives a contravariant functor. This is an artifact of the way in which one must compose the morphisms. The pair of functors Hom(''A'', –) and Hom(–, ''B'') are related in a natural manner. For any pair of morphisms ''f'' : ''B'' → ''B'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Presheaf
In mathematics, a sheaf is a tool for systematically tracking data (such as sets, abelian groups, rings) attached to the open sets of a topological space and defined locally with regard to them. For example, for each open set, the data could be the ring of continuous functions defined on that open set. Such data is well behaved in that it can be restricted to smaller open sets, and also the data assigned to an open set is equivalent to all collections of compatible data assigned to collections of smaller open sets covering the original open set (intuitively, every piece of data is the sum of its parts). The field of mathematics that studies sheaves is called sheaf theory. Sheaves are understood conceptually as general and abstract objects. Their correct definition is rather technical. They are specifically defined as sheaves of sets or as sheaves of rings, for example, depending on the type of data assigned to the open sets. There are also maps (or morphisms) from one ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Restriction (mathematics)
In mathematics, the restriction of a function f is a new function, denoted f\vert_A or f , obtained by choosing a smaller domain A for the original function f. The function f is then said to extend f\vert_A. Formal definition Let f : E \to F be a function from a set E to a set F. If a set A is a subset of E, then the restriction of f to A is the function _A : A \to F given by _A(x) = f(x) for x \in A. Informally, the restriction of f to A is the same function as f, but is only defined on A. If the function f is thought of as a relation (x,f(x)) on the Cartesian product E \times F, then the restriction of f to A can be represented by its graph where the pairs (x,f(x)) represent ordered pairs in the graph G. Extensions A function F is said to be an ' of another function f if whenever x is in the domain of f then x is also in the domain of F and f(x) = F(x). That is, if \operatorname f \subseteq \operatorname F and F\big\vert_ = f. A '' '' (respectively, '' '', etc.) of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
