|
Prestack
In algebraic geometry, a prestack ''F'' over a category ''C'' equipped with some Grothendieck topology is a category together with a functor ''p'': ''F'' → ''C'' satisfying a certain lifting condition and such that (when the fibers are groupoids) locally isomorphic objects are isomorphic. A stack is a prestack with effective descents, meaning local objects may be patched together to become a global object. Prestacks that appear in nature are typically stacks but some naively constructed prestacks (e.g., groupoid scheme or the prestack of projectivized vector bundles) may not be stacks. Prestacks may be studied on their own or passed to stacks. Since a stack is a prestack, all the results on prestacks are valid for stacks as well. Throughout the article, we work with a fixed base category ''C''; for example, ''C'' can be the category of all schemes over some fixed scheme equipped with some Grothendieck topology. Informal definition Let ''F'' be a category and suppose it is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Torsor (algebraic Geometry)
In algebraic geometry, a torsor or a principal bundle is an analog of a principal bundle in algebraic topology. Because there are few open sets in Zariski topology, it is more common to consider torsors in étale topology or some other flat topologies. The notion also generalizes a Galois extension in abstract algebra. The category of torsors over a fixed base forms a stack. Conversely, a prestack can be stackified by taking the category of torsors (over the prestack). Definition Given a smooth algebraic group ''G'', a ''G''-torsor (or a principal ''G''-bundle) ''P'' over a scheme ''X'' is a scheme (or even algebraic space) with an action of ''G'' that is locally trivial in the given Grothendieck topology in the sense that the base change Y \times_X P along some covering map Y \to X is isomorphic to the trivial torsor Y \times G \to Y (''G'' acts only on the second factor). Equivalently, a ''G''-torsor ''P'' on ''X'' is a principal homogeneous space for the group scheme G_X ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stack Associated To A Scheme
In mathematics a stack or 2-sheaf is, roughly speaking, a sheaf that takes values in categories rather than sets. Stacks are used to formalise some of the main constructions of descent theory, and to construct fine moduli stacks when fine moduli spaces do not exist. Descent theory is concerned with generalisations of situations where isomorphic, compatible geometrical objects (such as vector bundles on topological spaces) can be "glued together" within a restriction of the topological basis. In a more general set-up the restrictions are replaced with pullbacks; fibred categories then make a good framework to discuss the possibility of such gluing. The intuitive meaning of a stack is that it is a fibred category such that "all possible gluings work". The specification of gluings requires a definition of coverings with regard to which the gluings can be considered. It turns out that the general language for describing these coverings is that of a Grothendieck topology. Thus a sta ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stack (mathematics)
In mathematics a stack or 2-sheaf is, roughly speaking, a sheaf that takes values in categories rather than sets. Stacks are used to formalise some of the main constructions of descent theory, and to construct fine moduli stacks when fine moduli spaces do not exist. Descent theory is concerned with generalisations of situations where isomorphic, compatible geometrical objects (such as vector bundles on topological spaces) can be "glued together" within a restriction of the topological basis. In a more general set-up the restrictions are replaced with pullbacks; fibred categories then make a good framework to discuss the possibility of such gluing. The intuitive meaning of a stack is that it is a fibred category such that "all possible gluings work". The specification of gluings requires a definition of coverings with regard to which the gluings can be considered. It turns out that the general language for describing these coverings is that of a Grothendieck topology. Thus a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Groupoid Scheme
In category theory, a branch of mathematics, a groupoid object is both a generalization of a groupoid which is built on richer structures than sets, and a generalization of a group objects when the multiplication is only partially defined. Definition A groupoid object in a category ''C'' admitting finite fiber products consists of a pair of objects R, U together with five morphisms :s, t: R \to U, \ e: U \to R, \ m: R \times_ R \to R, \ i: R \to R satisfying the following groupoid axioms # s \circ e = t \circ e = 1_U, \, s \circ m = s \circ p_1, t \circ m = t \circ p_2 where the p_i: R \times_ R \to R are the two projections, # (associativity) m \circ (1_R \times m) = m \circ (m \times 1_R), # (unit) m \circ (e \circ s, 1_R) = m \circ (1_R, e \circ t) = 1_R, # (inverse) i \circ i = 1_R, s \circ i = t, \, t \circ i = s, m \circ (1_R, i) = e \circ s, \, m \circ (i, 1_R) = e \circ t. Examples Group objects A group object is a special case of a groupoid object, where R = U a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
The Prestack Of Equivalence Classes
''The'' () is a grammatical article in English, denoting persons or things that are already or about to be mentioned, under discussion, implied or otherwise presumed familiar to listeners, readers, or speakers. It is the definite article in English. ''The'' is the most frequently used word in the English language; studies and analyses of texts have found it to account for seven percent of all printed English-language words. It is derived from gendered articles in Old English which combined in Middle English and now has a single form used with nouns of any gender. The word can be used with both singular and plural nouns, and with a noun that starts with any letter. This is different from many other languages, which have different forms of the definite article for different genders or numbers. Pronunciation In most dialects, "the" is pronounced as (with the voiced dental fricative followed by a schwa) when followed by a consonant sound, and as (homophone of the archaic pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Classifying Stack
In algebraic geometry, a quotient stack is a stack that parametrizes equivariant objects. Geometrically, it generalizes a quotient of a scheme or a variety by a group: a quotient variety, say, would be a coarse approximation of a quotient stack. The notion is of fundamental importance in the study of stacks: a stack that arises in nature is often either a quotient stack itself or admits a stratification by quotient stacks (e.g., a Deligne–Mumford stack.) A quotient stack is also used to construct other stacks like classifying stacks. Definition A quotient stack is defined as follows. Let ''G'' be an affine smooth group scheme over a scheme ''S'' and ''X'' an ''S''-scheme on which ''G'' acts. Let the quotient stack /G/math> be the category over the category of ''S''-schemes: *an object over ''T'' is a principal ''G''-bundle P\to T together with equivariant map P\to X; *an arrow from P\to T to P'\to T' is a bundle map (i.e., forms a commutative diagram) that is compatible wit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Coequalizer
In category theory, a coequalizer (or coequaliser) is a generalization of a quotient by an equivalence relation to objects in an arbitrary category. It is the categorical construction dual to the equalizer. Definition A coequalizer is a colimit of the diagram consisting of two objects ''X'' and ''Y'' and two parallel morphisms ''f'', ''g'' : ''X'' → ''Y''. More explicitly, a coequalizer can be defined as an object ''Q'' together with a morphism ''q'' : ''Y'' → ''Q'' such that ''q'' ∘ ''f'' = ''q'' ∘ ''g''. Moreover, the pair (''Q'', ''q'') must be universal in the sense that given any other such pair (''Q''′, ''q''′) there exists a unique morphism ''u'' : ''Q'' → ''Q''′ such that ''u'' ∘ ''q'' = ''q''′. This information can be captured by the following commutative diagram: As with all universal constructions, a coequalizer, if it exists, is unique up to a unique isomorphism (this is why, by abuse of language, one sometimes speaks of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quotient By An Equivalence Relation
In mathematics, given a category ''C'', a quotient of an object ''X'' by an equivalence relation f: R \to X \times X is a coequalizer for the pair of maps :R \ \overset\ X \times X \ \overset\ X,\ \ i = 1,2, where ''R'' is an object in ''C'' and "''f'' is an equivalence relation" means that, for any object ''T'' in ''C'', the image (which is a set) of f: R(T) = \operatorname(T, R) \to X(T) \times X(T) is an equivalence relation; that is, a reflexive, symmetric and transitive relation. The basic case in practice is when ''C'' is the category of all schemes over some scheme ''S''. But the notion is flexible and one can also take ''C'' to be the category of sheaves. Examples *Let ''X'' be a set and consider some equivalence relation on it. Let ''Q'' be the set of all equivalence classes in ''X''. Then the map q: X \to Q that sends an element ''x'' to the equivalence class to which ''x'' belongs is a quotient. *In the above example, ''Q'' is a subset of the power set ''H'' of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Injective Function
In mathematics, an injective function (also known as injection, or one-to-one function) is a function that maps distinct elements of its domain to distinct elements; that is, implies . (Equivalently, implies in the equivalent contrapositive statement.) In other words, every element of the function's codomain is the image of one element of its domain. The term must not be confused with that refers to bijective functions, which are functions such that each element in the codomain is an image of exactly one element in the domain. A homomorphism between algebraic structures is a function that is compatible with the operations of the structures. For all common algebraic structures, and, in particular for vector spaces, an is also called a . However, in the more general context of category theory, the definition of a monomorphism differs from that of an injective homomorphism. This is thus a theorem that they are equivalent for algebraic structures; see for more d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Equivalence Relation
In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. Each equivalence relation provides a partition of the underlying set into disjoint equivalence classes. Two elements of the given set are equivalent to each other if and only if they belong to the same equivalence class. Notation Various notations are used in the literature to denote that two elements a and b of a set are equivalent with respect to an equivalence relation R; the most common are "a \sim b" and "", which are used when R is implicit, and variations of "a \sim_R b", "", or "" to specify R explicitly. Non-equivalence may be written "" or "a \not\equiv b". Definition A binary relation \,\sim\, on a set X is said to be an equivalence relation, if and only if it is reflexive, symmetric and transitive. That is, for all a, b, and c in X: * a \sim a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Groupoid
In mathematics, especially in category theory and homotopy theory, a groupoid (less often Brandt groupoid or virtual group) generalises the notion of group in several equivalent ways. A groupoid can be seen as a: *'' Group'' with a partial function replacing the binary operation; *''Category'' in which every morphism is invertible. A category of this sort can be viewed as augmented with a unary operation on the morphisms, called ''inverse'' by analogy with group theory. A groupoid where there is only one object is a usual group. In the presence of dependent typing, a category in general can be viewed as a typed monoid, and similarly, a groupoid can be viewed as simply a typed group. The morphisms take one from one object to another, and form a dependent family of types, thus morphisms might be typed g:A \rightarrow B, h:B \rightarrow C, say. Composition is then a total function: \circ : (B \rightarrow C) \rightarrow (A \rightarrow B) \rightarrow A \rightarrow C , so that h \c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.png "Click for more on -> The Prestack Of Equivalence Classes")
