HOME
*





Rasiowa–Sikorski Lemma
In axiomatic set theory, the Rasiowa–Sikorski lemma (named after Helena Rasiowa and Roman Sikorski) is one of the most fundamental facts used in the technique of forcing. In the area of forcing, a subset ''E'' of a poset (''P'', ≤) is called dense in ''P'' if for any ''p'' ∈ ''P'' there is ''e'' ∈ ''E'' with ''e'' ≤ ''p''. If ''D'' is a family of dense subsets of ''P'', then a filter ''F'' in ''P'' is called ''D''-generic if :''F'' ∩ ''E'' ≠ ∅ for all ''E'' ∈ ''D''. Now we can state the Rasiowa–Sikorski lemma: :Let (''P'', ≤) be a poset and ''p'' ∈ ''P''. If ''D'' is a countable family of dense subsets of ''P'' then there exists a ''D''-generic filter ''F'' in ''P'' such that ''p'' ∈ ''F''. Proof of the Rasiowa–Sikorski lemma The proof runs as follows: since ''D'' is countable, one can enumerate the dense subsets of ''P'' as ''D''1, ''D''2, …. By assumption, there exists ''p'' ∈ ''P''. Then by density, there exists ''p''1 ≤ ''p'' with ''p''1 ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Axiomatic Set Theory
Set theory is the branch of mathematical logic that studies Set (mathematics), 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 of set theory, 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 co ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Filter (mathematics)
In mathematics, a filter or order filter is a special subset of a partially ordered set (poset). Filters appear in order and lattice theory, but can also be found in topology, from which they originate. The dual notion of a filter is an order ideal. Filters on sets were introduced by Henri Cartan in 1937 and as described in the article dedicated to filters in topology, they were subsequently used by Nicolas Bourbaki in their book ''Topologie Générale'' as an alternative to the related notion of a net developed in 1922 by E. H. Moore and Herman L. Smith. Order filters are generalizations of this notion from sets to the more general setting of partially ordered sets. For information on order filters in the special case where the poset consists of the power set ordered by set inclusion, see the article Filter (set theory). Motivation 1. Intuitively, a filter in a partially ordered set (), P, is a subset of P that includes as members those elements that are large enoug ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


An Introduction To Independence Proofs
An, AN, aN, or an may refer to: Businesses and organizations * Airlinair (IATA airline code AN) * Alleanza Nazionale, a former political party in Italy * AnimeNEXT, an annual anime convention located in New Jersey * Anime North, a Canadian anime convention * Ansett Australia, a major Australian airline group that is now defunct (IATA designator AN) * Apalachicola Northern Railroad (reporting mark AN) 1903–2002 ** AN Railway, a successor company, 2002– * Aryan Nations, a white supremacist religious organization * Australian National Railways Commission, an Australian rail operator from 1975 until 1987 * Antonov, a Ukrainian (formerly Soviet) aircraft manufacturing and services company, as a model prefix Entertainment and media * Antv, an Indonesian television network * ''Astronomische Nachrichten'', or ''Astronomical Notes'', an international astronomy journal * ''Avisa Nordland'', a Norwegian newspaper * ''Sweet Bean'' (あん), a 2015 Japanese film also known as ''An'' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Cambridge University Press
Cambridge University Press is the university press of the University of Cambridge. Granted letters patent by Henry VIII of England, King Henry VIII in 1534, it is the oldest university press A university press is an academic publishing house specializing in monographs and scholarly journals. Most are nonprofit organizations and an integral component of a large research university. They publish work that has been reviewed by schola ... in the world. It is also the King's Printer. Cambridge University Press is a department of the University of Cambridge and is both an academic and educational publisher. It became part of Cambridge University Press & Assessment, following a merger with Cambridge Assessment in 2021. With a global sales presence, publishing hubs, and offices in more than 40 Country, countries, it publishes over 50,000 titles by authors from over 100 countries. Its publishing includes more than 380 academic journals, monographs, reference works, school and uni ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Countable Chain Condition
In order theory, a partially ordered set ''X'' is said to satisfy the countable chain condition, or to be ccc, if every strong antichain in ''X'' is countable. Overview There are really two conditions: the ''upwards'' and ''downwards'' countable chain conditions. These are not equivalent. The countable chain condition means the downwards countable chain condition, in other words no two elements have a common lower bound. This is called the "countable chain condition" rather than the more logical term "countable antichain condition" for historical reasons related to certain chains of open sets in topological spaces and chains in complete Boolean algebras, where chain conditions sometimes happen to be equivalent to antichain conditions. For example, if κ is a cardinal, then in a complete Boolean algebra every antichain has size less than κ if and only if there is no descending κ-sequence of elements, so chain conditions are equivalent to antichain conditions. Partial orders and s ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Cardinality
In mathematics, the cardinality of a set is a measure of the number of elements of the set. For example, the set A = \ contains 3 elements, and therefore A has a cardinality of 3. Beginning in the late 19th century, this concept was generalized to infinite sets, which allows one to distinguish between different types of infinity, and to perform arithmetic on them. There are two approaches to cardinality: one which compares sets directly using bijections and injections, and another which uses cardinal numbers. The cardinality of a set is also called its size, when no confusion with other notions of size is possible. The cardinality of a set A is usually denoted , A, , with a vertical bar on each side; this is the same notation as absolute value, and the meaning depends on context. The cardinality of a set A may alternatively be denoted by n(A), , \operatorname(A), or \#A. History A crude sense of cardinality, an awareness that groups of things or events compare with other grou ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Partial Function
In mathematics, a partial function from a set to a set is a function from a subset of (possibly itself) to . The subset , that is, the domain of viewed as a function, is called the domain of definition of . If equals , that is, if is defined on every element in , then is said to be total. More technically, a partial function is a binary relation over two sets that associates every element of the first set to ''at most'' one element of the second set; it is thus a functional binary relation. It generalizes the concept of a (total) function by not requiring every element of the first set to be associated to ''exactly'' one element of the second set. A partial function is often used when its exact domain of definition is not known or difficult to specify. This is the case in calculus, where, for example, the quotient of two functions is a partial function whose domain of definition cannot contain the zeros of the denominator. For this reason, in calculus, and more gene ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Martin's Axiom
In the mathematical field of set theory, Martin's axiom, introduced by Donald A. Martin and Robert M. Solovay, is a statement that is independent of the usual axioms of ZFC set theory. It is implied by the continuum hypothesis, but it is consistent with ZFC and the negation of the continuum hypothesis. Informally, it says that all cardinals less than the cardinality of the continuum, \mathfrak c, behave roughly like \aleph_0. The intuition behind this can be understood by studying the proof of the Rasiowa–Sikorski lemma. It is a principle that is used to control certain forcing arguments. Statement For any cardinal 𝛋, we define a statement, denoted by MA(𝛋): For any partial order ''P'' satisfying the countable chain condition (hereafter ccc) and any family ''D'' of dense sets in ''P'' such that '', D, '' ≤ 𝛋, there is a filter ''F'' on ''P'' such that ''F'' ∩ ''d'' is non-empty for every ''d'' in ''D''. \operatorname(\aleph_0) is simply true — this is known ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Dense Order
In mathematics, a partial order or total order < on a X is said to be dense if, for all x and y in X for which x < y, there is a z in X such that x < z < y. That is, for any two elements, one less than the other, there is another element between them. For total orders this can be simplified to "for any two distinct elements, there is another element between them", since all elements of a total order are .


Example

The s as a linearly ordered set are a densely o ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Helena Rasiowa
Helena Rasiowa (20 June 1917 – 9 August 1994) was a Polish mathematician. She worked in the foundations of mathematics and algebraic logic. Early years Rasiowa was born in Vienna on 20 June 1917 to Polish parents. As soon as Poland regained its independence in 1918, the family settled in Warsaw. Helena's father was a railway specialist. She exhibited many different skills and interests, from music to business management and the most important of her interests, mathematics. In 1938, the time was not very opportune for entering a university. Rasiowa had to interrupt her studies, as no legal education was possible in Poland after 1939. Many people fled the country, or at least they fled the big towns, which were subject to German bombardment and terror. The Rasiowa family fled also, as most high-ranking administration officials and members of the government were being evacuated to Romania. The family spent a year in Lviv. After the Soviet invasion in September 1939, the town ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Countable
In mathematics, a set is countable if either it is finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is ''countable'' if there exists an injective function from it into the natural numbers; this means that each element in the set may be associated to a unique natural number, or that the elements of the set can be counted one at a time, although the counting may never finish due to an infinite number of elements. In more technical terms, assuming the axiom of countable choice, a set is ''countable'' if its cardinality (its number of elements) is not greater than that of the natural numbers. A countable set that is not finite is said countably infinite. The concept is attributed to Georg Cantor, who proved the existence of uncountable sets, that is, sets that are not countable; for example the set of the real numbers. A note on terminology Although the terms "countable" and "countably infinite" as defined here are quite comm ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

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 (mathematics), 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 Comparability, comparison. Two elements ''x'' and ''y'' may stand in any of four mutually exclusive relationships to each other: either ''x''  ''y'', ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]