Equivalence Of Categories
In category theory, a branch of abstract mathematics, an equivalence of categories is a relation between two categories that establishes that these categories are "essentially the same". There are numerous examples of categorical equivalences from many areas of mathematics. Establishing an equivalence involves demonstrating strong similarities between the mathematical structures concerned. In some cases, these structures may appear to be unrelated at a superficial or intuitive level, making the notion fairly powerful: it creates the opportunity to "translate" theorems between different kinds of mathematical structures, knowing that the essential meaning of those theorems is preserved under the translation. If a category is equivalent to the opposite (or dual) of another category then one speaks of a duality of categories, and says that the two categories are dually equivalent. An equivalence of categories consists of a functor between the involved categories, which is required t ... [...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 compo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Pointed Set
In mathematics, a pointed set (also based set or rooted set) is an ordered pair (X, x_0) where X is a set and x_0 is an element of X called the base point, also spelled basepoint. Maps between pointed sets (X, x_0) and (Y, y_0) – called based maps, pointed maps, or pointpreserving maps – are functions from X to Y that map one basepoint to another, i.e. a map f \colon X \to Y such that f(x_0) = y_0. This is usually denoted : f \colon (X, x_0) \to (Y, y_0). Pointed sets are very simple algebraic structures. In the sense of universal algebra, a pointed set is a set X together with a single nullary operation *: X^0 \to X, which picks out the basepoint. Pointed maps are the homomorphisms of these algebraic structures. The class of all pointed sets together with the class of all based maps form a category. In this category the pointed singleton sets (\, a) are initial objects and terminal objects,Mac Lane (1998) p.26 i.e. they are zero objects. There is a faithful functor fro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Compact Space
In mathematics, specifically general topology, compactness is a property that seeks to generalize the notion of a closed and bounded subset of Euclidean space by making precise the idea of a space having no "punctures" or "missing endpoints", i.e. that the space not exclude any ''limiting values'' of points. For example, the open interval (0,1) would not be compact because it excludes the limiting values of 0 and 1, whereas the closed interval ,1would be compact. Similarly, the space of rational numbers \mathbb is not compact, because it has infinitely many "punctures" corresponding to the irrational numbers, and the space of real numbers \mathbb is not compact either, because it excludes the two limiting values +\infty and \infty. However, the ''extended'' real number line ''would'' be compact, since it contains both infinities. There are many ways to make this heuristic notion precise. These ways usually agree in a metric space, but may not be equivalent in other topolog ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

C*algebra
In mathematics, specifically in functional analysis, a C∗algebra (pronounced "Cstar") is a Banach algebra together with an involution satisfying the properties of the adjoint. A particular case is that of a complex algebra ''A'' of continuous linear operators on a complex Hilbert space with two additional properties: * ''A'' is a topologically closed set in the norm topology of operators. * ''A'' is closed under the operation of taking adjoints of operators. Another important class of nonHilbert C*algebras includes the algebra C_0(X) of complexvalued continuous functions on ''X'' that vanish at infinity, where ''X'' is a locally compact Hausdorff space. C*algebras were first considered primarily for their use in quantum mechanics to model algebras of physical observables. This line of research began with Werner Heisenberg's matrix mechanics and in a more mathematically developed form with Pascual Jordan around 1933. Subsequently, John von Neumann attempted to estab ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Functional Analysis
Functional analysis is a branch of mathematical analysis, the core of which is formed by the study of vector spaces endowed with some kind of limitrelated structure (e.g. inner product, norm, topology, etc.) and the linear functions defined on these spaces and respecting these structures in a suitable sense. The historical roots of functional analysis lie in the study of spaces of functions and the formulation of properties of transformations of functions such as the Fourier transform as transformations defining continuous, unitary etc. operators between function spaces. This point of view turned out to be particularly useful for the study of differential and integral equations. The usage of the word '' functional'' as a noun goes back to the calculus of variations, implying a function whose argument is a function. The term was first used in Hadamard's 1910 book on that subject. However, the general concept of a functional had previously been introduced in 1887 by the Ital ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Prime Ideal
In algebra, a prime ideal is a subset of a ring that shares many important properties of a prime number in the ring of integers. The prime ideals for the integers are the sets that contain all the multiples of a given prime number, together with the zero ideal. Primitive ideals are prime, and prime ideals are both primary and semiprime. Prime ideals for commutative rings An ideal of a commutative ring is prime if it has the following two properties: * If and are two elements of such that their product is an element of , then is in or is in , * is not the whole ring . This generalizes the following property of prime numbers, known as Euclid's lemma: if is a prime number and if divides a product of two integers, then divides or divides . We can therefore say :A positive integer is a prime number if and only if n\Z is a prime ideal in \Z. Examples * A simple example: In the ring R=\Z, the subset of even numbers is a prime ideal. * Given an integral domain ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Spectrum Of A Ring
In commutative algebra, the prime spectrum (or simply the spectrum) of a ring ''R'' is the set of all prime ideals of ''R'', and is usually denoted by \operatorname; in algebraic geometry it is simultaneously a topological space equipped with the sheaf of rings \mathcal. Zariski topology For any ideal ''I'' of ''R'', define V_I to be the set of prime ideals containing ''I''. We can put a topology on \operatorname(R) by defining the collection of closed sets to be :\. This topology is called the Zariski topology. A basis for the Zariski topology can be constructed as follows. For ''f'' ∈ ''R'', define ''D''''f'' to be the set of prime ideals of ''R'' not containing ''f''. Then each ''D''''f'' is an open subset of \operatorname(R), and \ is a basis for the Zariski topology. \operatorname(R) is a compact space, but almost never Hausdorff: in fact, the maximal ideals in ''R'' are precisely the closed points in this topology. By the same reasoning, it is not, in general, a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Commutative Ring
In mathematics, a commutative ring is a ring in which the multiplication operation is commutative. The study of commutative rings is called commutative algebra. Complementarily, noncommutative algebra is the study of ring properties that are not specific to commutative rings. This distinction results from the high number of fundamental properties of commutative rings that do not extend to noncommutative rings. Definition and first examples Definition A ''ring'' is a set R equipped with two binary operations, i.e. operations combining any two elements of the ring to a third. They are called ''addition'' and ''multiplication'' and commonly denoted by "+" and "\cdot"; e.g. a+b and a \cdot b. To form a ring these two operations have to satisfy a number of properties: the ring has to be an abelian group under addition as well as a monoid under multiplication, where multiplication distributes over addition; i.e., a \cdot \left(b + c\right) = \left(a \cdot b\right) + \left(a \c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Affine Scheme
In commutative algebra, the prime spectrum (or simply the spectrum) of a ring ''R'' is the set of all prime ideals of ''R'', and is usually denoted by \operatorname; in algebraic geometry it is simultaneously a topological space equipped with the sheaf of rings \mathcal. Zariski topology For any ideal ''I'' of ''R'', define V_I to be the set of prime ideals containing ''I''. We can put a topology on \operatorname(R) by defining the collection of closed sets to be :\. This topology is called the Zariski topology. A basis for the Zariski topology can be constructed as follows. For ''f'' ∈ ''R'', define ''D''''f'' to be the set of prime ideals of ''R'' not containing ''f''. Then each ''D''''f'' is an open subset of \operatorname(R), and \ is a basis for the Zariski topology. \operatorname(R) is a compact space, but almost never Hausdorff: in fact, the maximal ideals in ''R'' are precisely the closed points in this topology. By the same reasoning, it is not, in general, a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Algebraic Geometry
Algebraic geometry is a branch of mathematics, classically studying zeros of multivariate polynomials. Modern algebraic geometry is based on the use of abstract algebraic techniques, mainly from commutative algebra, for solving geometrical problems about these sets of zeros. The fundamental objects of study in algebraic geometry are algebraic varieties, which are geometric manifestations of solutions of systems of polynomial equations. Examples of the most studied classes of algebraic varieties are: plane algebraic curves, which include lines, circles, parabolas, ellipses, hyperbolas, cubic curves like elliptic curves, and quartic curves like lemniscates and Cassini ovals. A point of the plane belongs to an algebraic curve if its coordinates satisfy a given polynomial equation. Basic questions involve the study of the points of special interest like the singular points, the inflection points and the points at infinity. More advanced questions involve the topology of the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Additive Category
In mathematics, specifically in category theory, an additive category is a preadditive category C admitting all finitary biproducts. Definition A category C is preadditive if all its homsets are abelian groups and composition of morphisms is bilinear; in other words, C is enriched over the monoidal category of abelian groups. In a preadditive category, every finitary product (including the empty product, i.e., a final object) is necessarily a coproduct (or initial object in the case of an empty diagram), and hence a biproduct, and conversely every finitary coproduct is necessarily a product (this is a consequence of the definition, not a part of it). Thus an additive category is equivalently described as a preadditive category admitting all finitary products, or a preadditive category admitting all finitary coproducts. Another, yet equivalent, way to define an additive category is a category (not assumed to be preadditive) that has a zero object, finite coproduct ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Matrix (mathematics)
In mathematics, a matrix (plural matrices) is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns, which is used to represent a mathematical object or a property of such an object. For example, \begin1 & 9 & 13 \\20 & 5 & 6 \end is a matrix with two rows and three columns. This is often referred to as a "two by three matrix", a "matrix", or a matrix of dimension . Without further specifications, matrices represent linear maps, and allow explicit computations in linear algebra. Therefore, the study of matrices is a large part of linear algebra, and most properties and operations of abstract linear algebra can be expressed in terms of matrices. For example, matrix multiplication represents composition of linear maps. Not all matrices are related to linear algebra. This is, in particular, the case in graph theory, of incidence matrices, and adjacency matrices. ''This article focuses on matrices related to linear algebra, and, u ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 