词条 | List of forcing notions |
释义 |
In mathematics, forcing is a method of constructing new models M[G] of set theory by adding a generic subset G of a poset P to a model M. The poset P used will determine what statements hold in the new universe (the 'extension'); to force a statement of interest thus requires construction of a suitable P. This article lists some of the posets P that have been used in this construction. Notation
Definitions
Amoeba forcingAmoeba forcing is forcing with the amoeba order, and adds a measure 1 set of random reals. Cohen forcing{{Main|Cohen forcing}}In Cohen forcing (named after Paul Cohen) P is the set of functions from a finite subset of ω2 × ω to {0,1} and {{nowrap|p < q}} if {{nowrap|p ⊇ q}}. This poset satisfies the countable chain condition. Forcing with this poset adds ω2 distinct reals to the model; this was the poset used by Cohen in his original proof of the independence of the continuum hypothesis. More generally, one can replace ω2 by any cardinal κ so construct a model where the continuum has size at least κ. Here, the only restriction is that κ does not have cofinality ω. Grigorieff forcingGrigorieff forcing (after Serge Grigorieff) destroys a free ultrafilter on ω. Hechler forcingHechler forcing (after Stephen Herman Hechler) is used to show that Martin's axiom implies that every family of less than c functions from ω to ω is eventually dominated by some such function. P is the set of pairs {{nowrap|(s, E)}} where s is a finite sequence of natural numbers (considered as functions from a finite ordinal to ω) and E is a finite subset of some fixed set G of functions from ω to ω. The element (s, E) is stronger than {{nowrap|(t, F)}} if t is contained in s, F is contained in E, and if k is in the domain of s but not of t then {{nowrap|s(k) > h(k)}} for all h in F. Jockusch–Soare forcingForcing with classes was invented by Robert Soare and Carl Jockusch to prove, among other results, the low basis theorem. Here P is the set of nonempty subsets of (meaning the sets of paths through infinite, computable subtrees of ), ordered by inclusion. Iterated forcing{{Main|Iterated forcing}}Iterated forcing with finite supports was introduced by Solovay and Tennenbaum to show the consistency of Suslin's hypothesis. Easton introduced another type of iterated forcing to determine the possible values of the continuum function at regular cardinals. Iterated forcing with countable support was investigated by Laver in his proof of the consistency of Borel's conjecture, Baumgartner, who introduced Axiom A forcing, and Shelah, who introduced proper forcing. Revised countable support iteration was introduced by Shelah to handle semi-proper forcings, such as Prikry forcing, and generalizations, notably including Namba forcing. {{vanchor|Laver forcing}}Laver forcing was used by Laver to show that Borel's conjecture, which says that all strong measure zero sets are countable, is consistent with ZFC. (Borel's conjecture is not consistent with the continuum hypothesis.)
A Laver tree p is a subset of the finite sequences of natural numbers such that
If G is generic for {{nowrap|(P, ≤)}}, then the real {{nowrap|{s(p) : p ∈ G}{{null}}}}, called a Laver-real, uniquely determines G. Laver forcing satisfies the Laver property. Levy collapsing{{main|collapsing algebra}}These posets will collapse various cardinals, in other words force them to be equal in size to smaller cardinals.
Levy collapsing is named for Azriel Levy. Magidor forcingAmongst many forcing notions developed by Magidor, one of the best known is a generalization of Prikry forcing used to change the cofinality of a cardinal to a given smaller regular cardinal. Mathias forcing
{{nowrap|(t, B)}} is stronger than {{nowrap|(s, A)}} {{nowrap|((t, B) < (s, A))}} if s is an initial segment of t, B is a subset of A, and t is contained in {{nowrap|s ∪ A}}. Mathias forcing is named for Adrian Richard David Mathias. {{vanchor|Namba forcing}}Namba forcing (after Kanji Namba) is used to change the cofinality of ω2 to ω without collapsing ω1.
Namba' forcing is the subset of P such that there is a node below which the ordering is linear and above which each node has immediate successors. Magidor and Shelah proved that if CH holds then a generic object of Namba forcing does not exist in the generic extension by Namba', and vice versa.[1][2]{{vanchor|Prikry forcing}}In Prikry forcing (after Karel Prikrý) P is the set of pairs {{nowrap|(s, A)}} where s is a finite subset of a fixed measurable cardinal κ, and A is an element of a fixed normal measure D on κ. A condition {{nowrap|(s, A)}} is stronger than {{nowrap|(t, B)}} if t is an initial segment of s, A is contained in B, and s is contained in {{nowrap|t ∪ B}}. This forcing notion can be used to change to cofinality of κ while preserving all cardinals. {{vanchor|Product forcing}}Taking a product of forcing conditions is a way of simultaneously forcing all the conditions.
Radin forcingRadin forcing (after Lon Berk Radin), a technically involved generalization of Magidor forcing, adds a closed, unbounded subset to some regular cardinal λ. If λ is a sufficiently large cardinal, then the forcing keeps λ regular, measurable, supercompact, etc. Random forcing{{main|random algebra}}
Sacks forcing
Sacks forcing has the Sacks property. Shooting a fast clubFor S a stationary subset of we set is a closed sequence from S and C is a closed unbounded subset of , ordered by iff end-extends and and . In , we have that is a closed unbounded subset of S almost contained in each club set in V. is preserved. Shooting a club with countable conditionsFor S a stationary subset of we set P equal to the set of closed countable sequences from S. In , we have that is a closed unbounded subset of S and is preserved, and if CH holds then all cardinals are preserved. Shooting a club with finite conditionsFor S a stationary subset of we set P equal to the set of finite sets of pairs of countable ordinals, such that if and then and , and whenever and are distinct elements of p then either or . P is ordered by reverse inclusion. In , we have that is a closed unbounded subset of S and all cardinals are preserved. Silver forcingSilver forcing (after Jack Howard Silver) is the set of all those partial functions from the natural numbers into {{nowrap|{0, 1}{{null}}}} whose domain is coinfinite; or equivalently the set of all pairs {{nowrap|(A, p)}}, where A is a subset of the natural numbers with infinite complement, and p is a function from A into a fixed 2-element set. A condition q is stronger than a condition p if q extends p. Silver forcing satisfies Fusion, the Sacks property, and is minimal with respect to reals (but not minimal). References1. ^Shelah, S., Proper and Improper Forcing (Claim XI.4.2), Springer, 1998 2. ^Schlindwein, C., Shelah's work on non-semiproper iterations, I, Archive for Mathematical Logic, vol. 47, no. 6, pp. 579 -- 606 (2008)
External links
1 : Forcing (mathematics) |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。