|
Ultrafilter Principle
In the mathematical field of order theory, an ultrafilter on a given partially ordered set (or "poset") P is a certain subset of P, namely a maximal filter on P; that is, a proper filter on P that cannot be enlarged to a bigger proper filter on P. If X is an arbitrary set, its power set (X), ordered by set inclusion, is always a Boolean algebra and hence a poset, and ultrafilters on (X) are usually called X.If X happens to be partially ordered, too, particular care is needed to understand from the context whether an (ultra)filter on (X) or an (ultra)filter just on X is meant; both kinds of (ultra)filters are quite different. Some authors use "(ultra)filter ''of'' a partial ordered set" vs. "''on'' an arbitrary set"; i.e. they write "(ultra)filter on X" to abbreviate "(ultra)filter of (X)". An ultrafilter on a set X may be considered as a finitely additive 0-1-valued measure on (X). In this view, every subset of X is either considered " almost everything" (has measure 1) or "al ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Order Theory
Order theory is a branch of mathematics that investigates the intuitive notion of order using binary relations. It provides a formal framework for describing statements such as "this is less than that" or "this precedes that". This article introduces the field and provides basic definitions. A list of order-theoretic terms can be found in the order theory glossary. Background and motivation Orders are everywhere in mathematics and related fields like computer science. The first order often discussed in primary school is the standard order on the natural numbers e.g. "2 is less than 3", "10 is greater than 5", or "Does Tom have fewer cookies than Sally?". This intuitive concept can be extended to orders on other sets of numbers, such as the integers and the reals. The idea of being greater than or less than another number is one of the basic intuitions of number systems in general (although one usually is also interested in the actual difference of two numbers, which is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Subset
In mathematics, a Set (mathematics), set ''A'' is a subset of a set ''B'' if all Element (mathematics), elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they are unequal, then ''A'' is a proper subset of ''B''. The relationship of one set being a subset of another is called inclusion (or sometimes containment). ''A'' is a subset of ''B'' may also be expressed as ''B'' includes (or contains) ''A'' or ''A'' is included (or contained) in ''B''. A ''k''-subset is a subset with ''k'' elements. When quantified, A \subseteq B is represented as \forall x \left(x \in A \Rightarrow x \in B\right). One can prove the statement A \subseteq B by applying a proof technique known as the element argument:Let sets ''A'' and ''B'' be given. To prove that A \subseteq B, # suppose that ''a'' is a particular but arbitrarily chosen element of A # show that ''a'' is an element of ''B''. The validity of this technique ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zermelo–Fraenkel Set Theory
In set theory, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is an axiomatic system that was proposed in the early twentieth century in order to formulate a theory of sets free of paradoxes such as Russell's paradox. Today, Zermelo–Fraenkel set theory, with the historically controversial axiom of choice (AC) included, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics. Zermelo–Fraenkel set theory with the axiom of choice included is abbreviated ZFC, where C stands for "choice", and ZF refers to the axioms of Zermelo–Fraenkel set theory with the axiom of choice excluded. Informally, Zermelo–Fraenkel set theory is intended to formalize a single primitive notion, that of a hereditary well-founded set, so that all entities in the universe of discourse are such sets. Thus the axioms of Zermelo–Fraenkel set theory refer only to pure sets and prevent its models fr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Boolean Prime Ideal Theorem
In mathematics, the Boolean prime ideal theorem states that Ideal (order theory), ideals in a Boolean algebra (structure), Boolean algebra can be extended to Ideal (order theory)#Prime ideals , prime ideals. A variation of this statement for Filter (set theory), filters on sets is known as the ultrafilter lemma. Other theorems are obtained by considering different mathematical structures with appropriate notions of ideals, for example, Ring (mathematics), rings and prime ideals (of ring theory), or distributive lattices and ''maximal'' ideals (of order theory). This article focuses on prime ideal theorems from order theory. Although the various prime ideal theorems may appear simple and intuitive, they cannot be deduced in general from the axioms of Zermelo–Fraenkel set theory without the axiom of choice (abbreviated ZF). Instead, some of the statements turn out to be equivalent to the axiom of choice (AC), while others—the Boolean prime ideal theorem, for instance—represent ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zorn's Lemma
Zorn's lemma, also known as the Kuratowski–Zorn lemma, is a proposition of set theory. It states that a partially ordered set containing upper bounds for every chain (that is, every totally ordered subset) necessarily contains at least one maximal element. The lemma was proved (assuming the axiom of choice) by Kazimierz Kuratowski in 1922 and independently by Max Zorn in 1935. It occurs in the proofs of several theorems of crucial importance, for instance the Hahn–Banach theorem in functional analysis, the theorem that every vector space has a basis, Tychonoff's theorem in topology stating that every product of compact spaces is compact, and the theorems in abstract algebra that in a ring with identity every proper ideal is contained in a maximal ideal and that every field has an algebraic closure. Zorn's lemma is equivalent to the well-ordering theorem and also to the axiom of choice, in the sense that within ZF ( Zermelo–Fraenkel set theory without th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Axiom Of Choice
In mathematics, the axiom of choice, abbreviated AC or AoC, is an axiom of set theory. Informally put, the axiom of choice says that given any collection of non-empty sets, it is possible to construct a new set by choosing one element from each set, even if the collection is infinite. Formally, it states that for every indexed family (S_i)_ of nonempty sets (S_i as a nonempty set indexed with i), there exists an indexed set (x_i)_ such that x_i \in S_i for every i \in I. The axiom of choice was formulated in 1904 by Ernst Zermelo in order to formalize his proof of the well-ordering theorem. The axiom of choice is equivalent to the statement that every partition has a transversal. In many cases, a set created by choosing elements can be made without invoking the axiom of choice, particularly if the number of sets from which to choose the elements is finite, or if a canonical rule on how to choose the elements is available — some distinguishing property that happens to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ultrafilter Lemma
In the mathematical field of set theory, an ultrafilter on a set X is a ''maximal filter'' on the set X. In other words, it is a collection of subsets of X that satisfies the definition of a filter on X and that is maximal with respect to inclusion, in the sense that there does not exist a strictly larger collection of subsets of X that is also a filter. (In the above, by definition a filter on a set does not contain the empty set.) Equivalently, an ultrafilter on the set X can also be characterized as a filter on X with the property that for every subset A of X either A or its complement X\setminus A belongs to the ultrafilter. 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 \,\subseteq. This article deals specifically with ultrafilters on a set and does not cover the more general notion. There are two types of ultra ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Intersection Property
In general topology, a branch of mathematics, a non-empty family A of subsets of a set X is said to have the finite intersection property (FIP) if the intersection over any finite subcollection of A is non-empty. It has the strong finite intersection property (SFIP) if the intersection over any finite subcollection of A is infinite. Sets with the finite intersection property are also called centered systems and filter subbases. The finite intersection property can be used to reformulate topological compactness in terms of closed sets; this is its most prominent application. Other applications include proving that certain perfect sets are uncountable, and the construction of ultrafilters. Definition Let X be a set and \mathcal a nonempty family of subsets of that is, \mathcal is a nonempty subset of the power set of Then \mathcal is said to have the finite intersection property if every nonempty finite subfamily has nonempty intersection; it is said to have the strong ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite–cofinite Algebra
In mathematics, a cofinite subset of a set X is a subset A whose complement in X is a finite set. In other words, A contains all but finitely many elements of X. If the complement is not finite, but is countable, then one says the set is cocountable. These arise naturally when generalizing structures on finite sets to infinite sets, particularly on infinite products, as in the product topology or direct sum. This use of the prefix "" to describe a property possessed by a set's mplement is consistent with its use in other terms such as " meagre set". Boolean algebras The set of all subsets of X that are either finite or cofinite forms a Boolean algebra, which means that it is closed under the operations of union, intersection, and complementation. This Boolean algebra is the on X. In the other direction, a Boolean algebra A has a unique non-principal ultrafilter (that is, a maximal filter not generated by a single element of the algebra) if and only if there exists an infi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ultrafilter On The Powerset Of A Set
In the mathematical field of order theory, an ultrafilter on a given partially ordered set (or "poset") P is a certain subset of P, namely a maximal filter on P; that is, a proper filter on P that cannot be enlarged to a bigger proper filter on P. If X is an arbitrary set, its power set (X), ordered by set inclusion, is always a Boolean algebra and hence a poset, and ultrafilters on (X) are usually called X.If X happens to be partially ordered, too, particular care is needed to understand from the context whether an (ultra)filter on (X) or an (ultra)filter just on X is meant; both kinds of (ultra)filters are quite different. Some authors use "(ultra)filter ''of'' a partial ordered set" vs. "''on'' an arbitrary set"; i.e. they write "(ultra)filter on X" to abbreviate "(ultra)filter of (X)". An ultrafilter on a set X may be considered as a finitely additive 0-1-valued measure on (X). In this view, every subset of X is either considered " almost everything" (has measure 1) or "al ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cofinite Subset
In mathematics, a cofinite subset of a set X is a subset A whose complement in X is a finite set. In other words, A contains all but finitely many elements of X. If the complement is not finite, but is countable, then one says the set is cocountable. These arise naturally when generalizing structures on finite sets to infinite sets, particularly on infinite products, as in the product topology or direct sum. This use of the prefix "" to describe a property possessed by a set's mplement is consistent with its use in other terms such as " meagre set". Boolean algebras The set of all subsets of X that are either finite or cofinite forms a Boolean algebra, which means that it is closed under the operations of union, intersection, and complementation. This Boolean algebra is the on X. In the other direction, a Boolean algebra A has a unique non-principal ultrafilter (that is, a maximal filter not generated by a single element of the algebra) if and only if there exists an inf ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fréchet Filter
In mathematics, the Fréchet filter, also called the cofinite filter, on a set X is a certain collection of subsets of X (that is, it is a particular subset of the power set of X). A subset F of X belongs to the Fréchet filter if and only if the complement of F in X is finite. Any such set F is said to be , which is why it is alternatively called the ''cofinite filter'' on X. The Fréchet filter is of interest in topology, where filters originated, and relates to order and lattice theory because a set's power set is a partially ordered set under set inclusion (more specifically, it forms a lattice). The Fréchet filter is named after the French mathematician Maurice Fréchet (1878-1973), who worked in topology. Definition A subset A of a set X is said to be cofinite in X if its complement in X (that is, the set X \setminus A) is finite. If the empty set is allowed to be in a filter, the Fréchet filter on X, denoted by F is the set of all cofinite subsets of X. That is: F = ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
