|
Property Of Baire
A subset A of a topological space X has the property of Baire (Baire property, named after René-Louis Baire), or is called an almost open set, if it differs from an open set by a meager set; that is, if there is an open set U\subseteq X such that A \bigtriangleup U is meager (where \bigtriangleup denotes the symmetric difference).. Definitions A subset A \subseteq X of a topological space X is called almost open and is said to have the property of Baire or the Baire property if there is an open set U\subseteq X such that A \bigtriangleup U is a meager subset, where \bigtriangleup denotes the symmetric difference. Further, A has the Baire property in the restricted sense if for every subset E of X the intersection A\cap E has the Baire property relative to E. Properties The family of sets with the property of Baire forms a σ-algebra. That is, the complement of an almost open set is almost open, and any countable union or intersection of almost open sets is again almos ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Subset
In mathematics, set ''A'' is a subset of a set ''B'' if all 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. The subset relation defines a partial order on sets. In fact, the subsets of a given set form a Boolean algebra under the subset relation, in which the join and meet are given by intersection and union, and the subset relation itself is the Boolean inclusion relation. Definition If ''A'' and ''B'' are sets and every element of ''A'' is also an element of ''B'', then: :*''A'' is a subset of ''B'', denoted by A \subseteq B, or equivalently, :* ''B'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Banach–Mazur Game
In general topology, set theory and game theory, a Banach– Mazur game is a topological game played by two players, trying to pin down elements in a set (space). The concept of a Banach–Mazur game is closely related to the concept of Baire spaces. This game was the first infinite positional game of perfect information to be studied. It was introduced by Stanisław Mazur as problem 43 in the Scottish book, and Mazur's questions about it were answered by Banach. Definition Let Y be a non-empty topological space, X a fixed subset of Y and \mathcal a family of subsets of Y that have the following properties: * Each member of \mathcal has non-empty interior. * Each non-empty open subset of Y contains a member of \mathcal. Players, P_1 and P_2 alternately choose elements from \mathcal to form a sequence W_0 \supseteq W_1 \supseteq \cdots. P_1 wins if and only if :X \cap \left (\bigcap_ W_n \right ) \neq \emptyset. Otherwise, P_2 wins. This is called a general Banach–Mazur ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Natural Number
In mathematics, the natural numbers are those numbers used for counting (as in "there are ''six'' coins on the table") and ordering (as in "this is the ''third'' largest city in the country"). Numbers used for counting are called ''cardinal numbers'', and numbers used for ordering are called ''ordinal numbers''. Natural numbers are sometimes used as labels, known as '' nominal numbers'', having none of the properties of numbers in a mathematical sense (e.g. sports jersey numbers). Some definitions, including the standard ISO 80000-2, begin the natural numbers with , corresponding to the non-negative integers , whereas others start with , corresponding to the positive integers Texts that exclude zero from the natural numbers sometimes refer to the natural numbers together with zero as the whole numbers, while in other writings, that term is used instead for the integers (including negative integers). The natural numbers form a set. Many other number sets are built by succ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ultrafilter
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 \wp(X), ordered by set inclusion, is always a Boolean algebra and hence a poset, and ultrafilters on \wp(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 \wp(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 \wp(X)". An ultrafilter on a set X may be considered as a finitely additive measure on X. In this view, every subset of X is either considered " almost everything" (has measure 1) or ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Boolean Prime Ideal Theorem
In mathematics, the Boolean prime ideal theorem states that ideals in a Boolean algebra can be extended to prime ideals. A variation of this statement for 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, 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 a property that is strictly weaker than AC. It is due to this intermediate status between ZF and ZF + AC (ZFC) th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vitali Set
In mathematics, a Vitali set is an elementary example of a set of real numbers that is not Lebesgue measurable, found by Giuseppe Vitali in 1905. The Vitali theorem is the existence theorem that there are such sets. There are uncountably many Vitali sets, and their existence depends on the axiom of choice. In 1970, Robert Solovay constructed a model of Zermelo–Fraenkel set theory without the axiom of choice where all sets of real numbers are Lebesgue measurable, assuming the existence of an inaccessible cardinal (see Solovay model). Measurable sets Certain sets have a definite 'length' or 'mass'. For instance, the interval , 1is deemed to have length 1; more generally, an interval 'a'', ''b'' ''a'' ≤ ''b'', is deemed to have length ''b'' − ''a''. If we think of such intervals as metal rods with uniform density, they likewise have well-defined masses. The set , 1∪ , 3is composed of two intervals of length one, so we take its total length to be 2. In ter ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Real Number
In mathematics, a real number is a number that can be used to measure a ''continuous'' one-dimensional quantity such as a distance, duration or temperature. Here, ''continuous'' means that values can have arbitrarily small variations. Every real number can be almost uniquely represented by an infinite decimal expansion. The real numbers are fundamental in calculus (and more generally in all mathematics), in particular by their role in the classical definitions of limits, continuity and derivatives. The set of real numbers is denoted or \mathbb and is sometimes called "the reals". The adjective ''real'' in this context was introduced in the 17th century by René Descartes to distinguish real numbers, associated with physical reality, from imaginary numbers (such as the square roots of ), which seemed like a theoretical contrivance unrelated to physical reality. The real numbers include the rational numbers, such as the integer and the fraction . The rest of the real ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Axiom Of Choice
In mathematics, the axiom of choice, or AC, is an axiom of set theory equivalent to the statement that ''a Cartesian product of a collection of non-empty sets is non-empty''. Informally put, the axiom of choice says that given any collection of sets, each containing at least one element, it is possible to construct a new set by arbitrarily 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, 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. In many cases, a set arising from choosing elements arbitrarily can be made without invoking the axiom of choice; this is, in particular, the case 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 distinguis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Projective Set
In the mathematical field of descriptive set theory, a subset A of a Polish space X is projective if it is \boldsymbol^1_n for some positive integer n. Here A is * \boldsymbol^1_1 if A is analytic * \boldsymbol^1_n if the complement of A, X\setminus A, is \boldsymbol^1_n * \boldsymbol^1_ if there is a Polish space Y and a \boldsymbol^1_n subset C\subseteq X\times Y such that A is the projection of C; that is, A=\ The choice of the Polish space Y in the third clause above is not very important; it could be replaced in the definition by a fixed uncountable Polish space, say Baire space or Cantor space or the real line. Relationship to the analytical hierarchy There is a close relationship between the relativized analytical hierarchy on subsets of Baire space (denoted by lightface letters \Sigma and \Pi) and the projective hierarchy on subsets of Baire space (denoted by boldface letters \boldsymbol and \boldsymbol). Not every \boldsymbol^1_n subset of Baire space is \Sigma^1 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Large Cardinal Property
In the mathematical field of set theory, a large cardinal property is a certain kind of property of transfinite cardinal numbers. Cardinals with such properties are, as the name suggests, generally very "large" (for example, bigger than the least α such that α=ωα). The proposition that such cardinals exist cannot be proved in the most common axiomatization of set theory, namely ZFC, and such propositions can be viewed as ways of measuring how "much", beyond ZFC, one needs to assume to be able to prove certain desired results. In other words, they can be seen, in Dana Scott's phrase, as quantifying the fact "that if you want more you have to assume more". There is a rough convention that results provable from ZFC alone may be stated without hypotheses, but that if the proof requires other assumptions (such as the existence of large cardinals), these should be stated. Whether this is simply a linguistic convention, or something more, is a controversial point among distinct philo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Projective Determinacy
In mathematical logic, projective determinacy is the special case of the axiom of determinacy applying only to projective sets. The axiom of projective determinacy, abbreviated PD, states that for any two-player infinite game of perfect information of length ω in which the players play natural numbers, if the victory set (for either player, since the projective sets are closed under complementation) is projective, then one player or the other has a winning strategy. The axiom is not a theorem of ZFC (assuming ZFC is consistent), but unlike the full axiom of determinacy (AD), which contradicts the axiom of choice, it is not known to be inconsistent with ZFC. PD follows from certain large cardinal axioms, such as the existence of infinitely many Woodin cardinals. PD implies that all projective sets are Lebesgue measurable (in fact, universally measurable) and have the perfect set property and the property of Baire A subset A of a topological space X has the property of Baire ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Adequate Pointclass
In the mathematical field of descriptive set theory, a pointclass can be called adequate if it contains all recursive Recursion (adjective: ''recursive'') occurs when a thing is defined in terms of itself or of its type. Recursion is used in a variety of disciplines ranging from linguistics to logic. The most common application of recursion is in mathematics ... pointsets and is closed under recursive substitution, bounded universal and existential quantification and preimages by recursive functions.. References Descriptive set theory {{settheory-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
