Rasiowa–Sikorski lemma
Rasiowa–Sikorski lemma is a mathematical lemma.
All 3 facts, and where they come from
Facts
3 facts · 0 confirmed by two sources · 0 cited · 3 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2567877892
- Described as
- mathematical lemma
- What it is
- lemma
- Named after
- Helena Rasiowa; Roman Sikorski
- Wikipedias with a page
- 10
Wikidata item Q1816937 (wikidata.org/wiki/Q1816937), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1333782007
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 set 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 set of dense subsets of P then there exists a D-generic filter F in P such that p ∈ F.
From the Wikipedia article “Rasiowa–Sikorski lemma” (en.wikipedia.org/wiki/Rasiowa–Sikorski_lemma), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.