|
Coherent Space
In proof theory, a coherent space (also coherence space) is a concept introduced in the semantic study of linear logic. Let a set ''C'' be given. Two subsets ''S'',''T'' ⊆ ''C'' are said to be ''orthogonal'', written ''S'' ⊥ ''T'', if ''S'' ∩ ''T'' is ∅ or a singleton. The ''dual'' of a family ''F'' ⊆ ℘(''C'') is the family ''F'' ⊥ of all subsets ''S'' ⊆ ''C'' orthogonal to every member of ''F'', i.e., such that ''S'' ⊥ ''T'' for all ''T'' ∈ ''F''. A coherent space ''F'' over ''C'' is a family of ''C''-subsets for which ''F'' = (''F'' ⊥) ⊥. In ''Proofs and Types'' coherent spaces are called coherence spaces. A footnote explains that although in the French original they were ''espaces cohérents'', the coherence space translation was used because spectral spaces are sometimes called coherent spaces. Definitions As defined by Jean-Yves Girard, a ''coherence space'' \mathcal is a collection of sets satisfying down-closure and binary completeness in the f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Proof Theory
Proof theory is a major branchAccording to Wang (1981), pp. 3–4, proof theory is one of four domains mathematical logic, together with model theory, axiomatic set theory, and recursion theory. Barwise (1978) consists of four corresponding parts, with part D being about "Proof Theory and Constructive Mathematics". of mathematical logic that represents proofs as formal mathematical objects, facilitating their analysis by mathematical techniques. Proofs are typically presented as inductively-defined data structures such as lists, boxed lists, or trees, which are constructed according to the axioms and rules of inference of the logical system. Consequently, proof theory is syntactic in nature, in contrast to model theory, which is semantic in nature. Some of the major areas of proof theory include structural proof theory, ordinal analysis, provability logic, reverse mathematics, proof mining, automated theorem proving, and proof complexity. Much research also focuses ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Function (mathematics)
In mathematics, a function from a set to a set assigns to each element of exactly one element of .; the words map, mapping, transformation, correspondence, and operator are often used synonymously. The set is called the domain of the function and the set is called the codomain of the function.Codomain ''Encyclopedia of Mathematics'Codomain. ''Encyclopedia of Mathematics''/ref> The earliest known approach to the notion of function can be traced back to works of Persian mathematicians Al-Biruni and Sharaf al-Din al-Tusi. Functions were originally the idealization of how a varying quantity depends on another quantity. For example, the position of a planet is a ''function'' of time. Historically, the concept was elaborated with the infinitesimal calculus at the end of the 17th century, and, until the 19th century, the functions that were considered were differentiable (that is, they had a high degree of regularity). The concept of a function was formalized at the end of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Universal Property
In mathematics, more specifically in category theory, a universal property is a property that characterizes up to an isomorphism the result of some constructions. Thus, universal properties can be used for defining some objects independently from the method chosen for constructing them. For example, the definitions of the integers from the natural numbers, of the rational numbers from the integers, of the real numbers from the rational numbers, and of polynomial rings from the field of their coefficients can all be done in terms of universal properties. In particular, the concept of universal property allows a simple proof that all constructions of real numbers are equivalent: it suffices to prove that they satisfy the same universal property. Technically, a universal property is defined in terms of categories and functors by mean of a universal morphism (see , below). Universal morphisms can also be thought more abstractly as initial or terminal objects of a comma catego ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Product (category Theory)
In category theory, the product of two (or more) objects in a category is a notion designed to capture the essence behind constructions in other areas of mathematics such as the Cartesian product of sets, the direct product of groups or rings, and the product of topological spaces. Essentially, the product of a family of objects is the "most general" object which admits a morphism to each of the given objects. Definition Product of two objects Fix a category C. Let X_1 and X_2 be objects of C. A product of X_1 and X_2 is an object X, typically denoted X_1 \times X_2, equipped with a pair of morphisms \pi_1 : X \to X_1, \pi_2 : X \to X_2 satisfying the following universal property: * For every object Y and every pair of morphisms f_1 : Y \to X_1, f_2 : Y \to X_2, there exists a unique morphism f : Y \to X_1 \times X_2 such that the following diagram commutes: *: Whether a product exists may depend on C or on X_1 and X_2. If it does exist, it is unique up to canonical ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pullback With Order
In mathematics, a pullback is either of two different, but related processes: precomposition and fiber-product. Its dual is a pushforward. Precomposition Precomposition with a function probably provides the most elementary notion of pullback: in simple terms, a function f of a variable y, where y itself is a function of another variable x, may be written as a function of x. This is the pullback of f by the function y. f(y(x)) \equiv g(x) It is such a fundamental process that it is often passed over without mention. However, it is not just functions that can be "pulled back" in this sense. Pullbacks can be applied to many other objects such as differential forms and their cohomology classes; see * Pullback (differential geometry) * Pullback (cohomology) Fiber-product The pullback bundle is an example that bridges the notion of a pullback as precomposition, and the notion of a pullback as a Cartesian square. In that example, the base space of a fiber bundle is pulled back, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pullback Intersection Union
In mathematics, a pullback is either of two different, but related processes: precomposition and fiber-product. Its dual is a pushforward. Precomposition Precomposition with a function probably provides the most elementary notion of pullback: in simple terms, a function f of a variable y, where y itself is a function of another variable x, may be written as a function of x. This is the pullback of f by the function y. f(y(x)) \equiv g(x) It is such a fundamental process that it is often passed over without mention. However, it is not just functions that can be "pulled back" in this sense. Pullbacks can be applied to many other objects such as differential forms and their cohomology classes; see * Pullback (differential geometry) * Pullback (cohomology) Fiber-product The pullback bundle is an example that bridges the notion of a pullback as precomposition, and the notion of a pullback as a Cartesian square. In that example, the base space of a fiber bundle is pulled back, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pullback (category Theory)
In category theory, a branch of mathematics, a pullback (also called a fiber product, fibre product, fibered product or Cartesian square) is the limit of a diagram consisting of two morphisms and with a common codomain. The pullback is often written : and comes equipped with two natural morphisms and . The pullback of two morphisms and need not exist, but if it does, it is essentially uniquely defined by the two morphisms. In many situations, may intuitively be thought of as consisting of pairs of elements with in , in , and . For the general definition, a universal property is used, which essentially expresses the fact that the pullback is the "most general" way to complete the two given morphisms to a commutative square. The dual concept of the pullback is the '' pushout''. Universal property Explicitly, a pullback of the morphisms and consists of an object and two morphisms and for which the diagram : commutes. Moreover, the pullback must be universal wi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Directed Union
In mathematics, a direct limit is a way to construct a (typically large) object from many (typically smaller) objects that are put together in a specific way. These objects may be groups, rings, vector spaces or in general objects from any category. The way they are put together is specified by a system of homomorphisms (group homomorphism, ring homomorphism, or in general morphisms in the category) between those smaller objects. The direct limit of the objects A_i, where i ranges over some directed set I, is denoted by \varinjlim A_i . (This is a slight abuse of notation as it suppresses the system of homomorphisms that is crucial for the structure of the limit.) Direct limits are a special case of the concept of colimit in category theory. Direct limits are dual to inverse limits, which are also a special case of limits in category theory. Formal definition We will first give the definition for algebraic structures like groups and modules, and then the general definition, wh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Filtered Colimit
In category theory, filtered categories generalize the notion of directed set understood as a category (hence called a directed category; while some use directed category as a synonym for a filtered category). There is a dual notion of cofiltered category, which will be recalled below. Filtered categories A category J is filtered when * it is not empty, * for every two objects j and j' in J there exists an object k and two arrows f:j\to k and f':j'\to k in J, * for every two parallel arrows u,v:i\to j in J, there exists an object k and an arrow w:j\to k such that wu=wv. A filtered colimit is a colimit of a functor F:J\to C where J is a filtered category. Cofiltered categories A category J is cofiltered if the opposite category J^ is filtered. In detail, a category is cofiltered when * it is not empty, * for every two objects j and j' in J there exists an object k and two arrows f:k\to j and f':k \to j' in J, * for every two parallel arrows u,v:j\to i in J, there exists an obj ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Continuous Function
In mathematics, a continuous function is a function such that a continuous variation (that is a change without jump) of the argument induces a continuous variation of the value of the function. This means that there are no abrupt changes in value, known as '' discontinuities''. More precisely, a function is continuous if arbitrarily small changes in its value can be assured by restricting to sufficiently small changes of its argument. A discontinuous function is a function that is . Up until the 19th century, mathematicians largely relied on intuitive notions of continuity, and considered only continuous functions. The epsilon–delta definition of a limit was introduced to formalize the definition of continuity. Continuity is one of the core concepts of calculus and mathematical analysis, where arguments and values of functions are real and complex numbers. The concept has been generalized to functions between metric spaces and between topological spaces. The latter are t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Poset
In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary relation indicating that, for certain pairs of elements in the set, one of the elements precedes the other in the ordering. The relation itself is called a "partial order." The word ''partial'' in the names "partial order" and "partially ordered set" is used as an indication that not every pair of elements needs to be comparable. That is, there may be pairs of elements for which neither element precedes the other in the poset. Partial orders thus generalize total orders, in which every pair is comparable. Informal definition A partial order defines a notion of comparison. Two elements ''x'' and ''y'' may stand in any of four mutually exclusive relationships to each other: either ''x'' ''y'', or ''x'' and ''y'' are ''incompa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Functor
In mathematics, specifically category theory, a functor is a mapping between categories. Functors were first considered in algebraic topology, where algebraic objects (such as the fundamental group) are associated to topological spaces, and maps between these algebraic objects are associated to continuous maps between spaces. Nowadays, functors are used throughout modern mathematics to relate various categories. Thus, functors are important in all areas within mathematics to which category theory is applied. The words ''category'' and ''functor'' were borrowed by mathematicians from the philosophers Aristotle and Rudolf Carnap, respectively. The latter used ''functor'' in a linguistic context; see function word. Definition Let ''C'' and ''D'' be categories. A functor ''F'' from ''C'' to ''D'' is a mapping that * associates each object X in ''C'' to an object F(X) in ''D'', * associates each morphism f \colon X \to Y in ''C'' to a morphism F(f) \colon F(X) \to F(Y) in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
