|
Ultrafilter Monad
In the mathematical field of set theory, an ultrafilter is a ''maximal proper filter'': it is a filter U on a given non-empty set X which is a certain type of non-empty family of subsets of X, that is not equal to the power set \wp(X) of X (such filters are called ) and that is also "maximal" in that there does not exist any other proper filter on X that contains it as a proper subset. Said differently, a proper filter U is called an ultrafilter if there exists proper filter that contains it as a subset, that proper filter (necessarily) being U itself. More formally, an ultrafilter U on X is a proper filter that is also a maximal filter on X with respect to set inclusion, meaning that there does not exist any proper filter on X that contains U as a proper subset. Ultrafilters on sets are an important special instance of ultrafilters on partially ordered sets, where the partially ordered set consists of the power set \wp(X) and the partial order is subset inclusion \,\subsete ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Set Theory
Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as a branch of mathematics, is mostly concerned with those that are relevant to mathematics as a whole. The modern study of set theory was initiated by the German mathematicians Richard Dedekind and Georg Cantor in the 1870s. In particular, Georg Cantor is commonly considered the founder of set theory. The non-formalized systems investigated during this early stage go under the name of '' naive set theory''. After the discovery of paradoxes within naive set theory (such as Russell's paradox, Cantor's paradox and the Burali-Forti paradox) various axiomatic systems were proposed in the early twentieth century, of which Zermelo–Fraenkel set theory (with or without the axiom of choice) is still the best-known and most studied. Set theory is commonly employed as a foundational ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Intersection (set Theory)
In set theory, the intersection of two sets A and B, denoted by A \cap B, is the set containing all elements of A that also belong to B or equivalently, all elements of B that also belong to A. Notation and terminology Intersection is written using the symbol "\cap" between the terms; that is, in infix notation. For example: \\cap\=\ \\cap\=\varnothing \Z\cap\N=\N \\cap\N=\ The intersection of more than two sets (generalized intersection) can be written as: \bigcap_^n A_i which is similar to capital-sigma notation. For an explanation of the symbols used in this article, refer to the table of mathematical symbols. Definition The intersection of two sets A and B, denoted by A \cap B, is the set of all objects that are members of both the sets A and B. In symbols: A \cap B = \. That is, x is an element of the intersection A \cap B if and only if x is both an element of A and an element of B. For example: * The intersection of the sets and is . * The number 9 is in t ... [...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 ( ref ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Preorder
In mathematics, especially in order theory, a preorder or quasiorder is a binary relation that is reflexive and transitive. Preorders are more general than equivalence relations and (non-strict) partial orders, both of which are special cases of a preorder: an antisymmetric (or skeletal) preorder is a partial order, and a symmetric preorder is an equivalence relation. The name comes from the idea that preorders (that are not partial orders) are 'almost' (partial) orders, but not quite; they are neither necessarily antisymmetric nor asymmetric. Because a preorder is a binary relation, the symbol \,\leq\, can be used as the notational device for the relation. However, because they are not necessarily antisymmetric, some of the ordinary intuition associated to the symbol \,\leq\, may not apply. On the other hand, a preorder can be used, in a straightforward fashion, to define a partial order and an equivalence relation. Doing so, however, is not always useful or worth ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Measure (mathematics)
In mathematics, the concept of a measure is a generalization and formalization of geometrical measures ( length, area, volume) and other common notions, such as mass and probability of events. These seemingly distinct concepts have many similarities and can often be treated together in a single mathematical context. Measures are foundational in probability theory, integration theory, and can be generalized to assume negative values, as with electrical charge. Far-reaching generalizations (such as spectral measures and projection-valued measures) of measure are widely used in quantum physics and physics in general. The intuition behind this concept dates back to ancient Greece, when Archimedes tried to calculate the area of a circle. But it was not until the late 19th and early 20th centuries that measure theory became a branch of mathematics. The foundations of modern measure theory were laid in the works of Émile Borel, Henri Lebesgue, Nikolai Luzin, Johann Radon, Const ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Almost Everywhere
In measure theory (a branch of mathematical analysis), a property holds almost everywhere if, in a technical sense, the set for which the property holds takes up nearly all possibilities. The notion of "almost everywhere" is a companion notion to the concept of measure zero, and is analogous to the notion of ''almost surely'' in probability theory. More specifically, a property holds almost everywhere if it holds for all elements in a set except a subset of measure zero, or equivalently, if the set of elements for which the property holds is conull. In cases where the measure is not complete, it is sufficient that the set be contained within a set of measure zero. When discussing sets of real numbers, the Lebesgue measure is usually assumed unless otherwise stated. The term ''almost everywhere'' is abbreviated ''a.e.''; in older literature ''p.p.'' is used, to stand for the equivalent French language phrase ''presque partout''. A set with full measure is one whose complement i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Content (measure Theory)
In mathematics, a content is a set function that is like a measure, but a content must only be finitely additive, whereas a measure must be countably additive. A content is a real function \mu defined on a collection of subsets \mathcal such that # \mu(A)\in\ , \infty\text A \in \mathcal. # \mu(\varnothing) = 0. # \mu(A_1 \cup A_2) = \mu(A_1) + \mu(A_2) \text A_1, A_2, A_1\cup A_2\ \in \mathcal \text A_1 \cap A_2 = \varnothing. In many important applications the \mathcal is chosen to be a Ring of sets or to be at least a Semiring of sets in which case some additional properties can be deduced which are described below. For this reason some authors prefer to define contents only for the case of semirings or even rings. If a content is additionally ''σ''-additive it is called a pre-measure and if furthermore \mathcal is a ''σ''-algebra, the content is called a measure. Therefore every (real-valued) measure is a content, but not vice versa. Contents give a good notion of integrat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finitely Additive
In mathematics, an additive set function is a function mapping sets to numbers, with the property that its value on a union of two disjoint sets equals the sum of its values on these sets, namely, \mu(A \cup B) = \mu(A) + \mu(B). If this additivity property holds for any two sets, then it also holds for any finite number of sets, namely, the function value on the union of ''k'' disjoint sets (where ''k'' is a finite number) equals the sum of its values on the sets. Therefore, an additive set function is also called a finitely-additive set function (the terms are equivalent). However, a finitely-additive set function might not have the additivity property for a union of an ''infinite'' number of sets. A σ-additive set function is a function that has the additivity property even for countably infinite many sets, that is, \mu\left(\bigcup_^\infty A_n\right) = \sum_^\infty \mu(A_n). Additivity and sigma-additivity are particularly important properties of measures. They are abstrac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
2-valued Morphism
In mathematics, a 2-valued morphism. is a homomorphism that sends a Boolean algebra ''B'' onto the two-element Boolean algebra 2 = . It is essentially the same thing as an ultrafilter on ''B'', and, in a different way, also the same things as a maximal ideal of ''B.'' 2-valued morphisms have also been proposed as a tool for unifying the language of physics. 2-valued morphisms, ultrafilters and maximal ideals Suppose ''B'' is a Boolean algebra. * If ''s'' : ''B'' → 2 is a 2-valued morphism, then the set of elements of ''B'' that are sent to 1 is an ultrafilter on ''B'', and the set of elements of ''B'' that are sent to 0 is a maximal ideal of ''B''. * If ''U'' is an ultrafilter on ''B'', then the complement of ''U'' is a maximal ideal of ''B'', and there is exactly one 2-valued morphism ''s'' : ''B'' → 2 that sends the ultrafilter to 1 and the maximal ideal to 0. * If ''M'' is a maximal ideal of ''B'', then the complement of ''M'' is an ultrafilter on ''B'', and there is exact ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cover (topology)
In mathematics, and more particularly in set theory, a cover (or covering) of a set X is a collection of subsets of X whose union is all of X. More formally, if C = \lbrace U_\alpha : \alpha \in A \rbrace is an indexed family of subsets U_\alpha\subset X, then C is a cover of X if \bigcup_U_ = X. Thus the collection \lbrace U_\alpha : \alpha \in A \rbrace is a cover of X if each element of X belongs to at least one of the subsets U_. Cover in topology Covers are commonly used in the context of topology. If the set X is a topological space, then a ''cover'' C of X is a collection of subsets \_ of X whose union is the whole space X. In this case we say that C ''covers'' X, or that the sets U_\alpha ''cover'' X. Also, if Y is a (topological) subspace of X, then a ''cover'' of Y is a collection of subsets C=\_ of X whose union contains Y, i.e., C is a cover of Y if :Y \subseteq \bigcup_U_. That is, we may cover Y with either open sets in Y itself, or cover Y by open sets in the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bornology
In mathematics, especially functional analysis, a bornology on a set ''X'' is a collection of subsets of ''X'' satisfying axioms that generalize the notion of boundedness. One of the key motivations behind bornologies and bornological analysis is the fact that bornological spaces provide a convenient setting for homological algebra in functional analysis. This is becausepg 9 the category of bornological spaces is additive, complete, cocomplete, and has a tensor product adjoint to an internal hom, all necessary components for homological algebra. History Bornology originates from functional analysis. There are two natural ways of studying the problems of functional analysis: one way is to study notions related to topologies ( vector topologies, continuous operators, open/compact subsets, etc.) and the other is to study notions related to boundedness ( vector bornologies, bounded operators, bounded subsets, etc.). For normed spaces, from which functional analysis arose, the disti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Normed Space
In mathematics, a normed vector space or normed space is a vector space over the real or complex numbers, on which a norm is defined. A norm is the formalization and the generalization to real vector spaces of the intuitive notion of "length" in the real (physical) world. A norm is a real-valued function defined on the vector space that is commonly denoted x\mapsto \, x\, , and has the following properties: #It is nonnegative, meaning that \, x\, \geq 0 for every vector x. #It is positive on nonzero vectors, that is, \, x\, = 0 \text x = 0. # For every vector x, and every scalar \alpha, \, \alpha x\, = , \alpha, \, \, x\, . # The triangle inequality holds; that is, for every vectors x and y, \, x+y\, \leq \, x\, + \, y\, . A norm induces a distance, called its , by the formula d(x,y) = \, y-x\, . which makes any normed vector space into a metric space and a topological vector space. If this metric space is complete then the normed space is a Banach space. Every normed vec ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Measure (mathematics)")
