Generic filter
In the mathematical field of set theory, a generic filter is a kind of object used in the theory of forcing, a technique used for many purposes, but especially to establish the independence of certain propositions from certain formal theories, such as ZFC. For example, Paul Cohen used forcing to establish that ZFC, if consistent, cannot prove the continuum hypothesis, which states that there are exactly aleph-one real numbers. In the contemporary re-interpretation of Cohen's proof, it proceeds by constructing a generic filter that codes more than [math]\displaystyle{ \aleph_1 }[/math] reals, without changing the value of [math]\displaystyle{ \aleph_1 }[/math]. Formally, let P be a partially ordered set, and let F be a filter on P; that is, F is a subset of P such that:
- F is nonempty
- If p, q ∈ P and p ≤ q and p is an element of F, then q is an element of F (F is closed upward)
- If p and q are elements of F, then there is an element r of F such that r ≤ p and r ≤ q (F is downward directed)
Now if D is a collection of dense open subsets of P, in the topology whose basic open sets are all sets of the form {q | q ≤ p} for particular p in P, then F is said to be D-generic if F meets all sets in D; that is,
- [math]\displaystyle{ F\cap E \ne \varnothing,\, }[/math] for all E ∈ D.
Similarly, if M is a transitive model of ZFC (or some sufficient fragment thereof), with P an element of M, then F is said to be M-generic, or sometimes generic over M, if F meets all dense open subsets of P that are elements of M.
See also
- Rasiowa–Sikorski lemma – Mathematical lemma
References
- K. Ciesielski (1997). Set Theory for the Working Mathematician. London Mathematical Society, Student Texts 39. Cambridge University Press. ISBN 9780521594653. https://books.google.com/books?id=tTEaMFvzhDAC.
 |  |
