用户: Yao/集合论

1ZF

ExtensionalityIf and have the same elements, then .
SeparationFor any set and formula , there is a set .Then .
PairingFor any and , there is a set .Then , .
UnionFor any , there is a set .
PowerFor any , there is a set .Then is a subset of .
InfinityThere is a set s.t. and .This is called an inductive set.
ReplacementIf a class is a function, then for any there is a set .
RegularityEvery nonempty set has an -minimal element.This implies .
ChoiceEvery family of nonempty sets has a choice function.The first eight constitute ZF, and all nine ZFC.
Zorn’s LemmaA partially ordered set each chain (linearly ordered) of which has a upper bound has a maximal element.
Well–OrderingEvery set can be well–ordered.
HausdorffThere is a maximal chain for any partially ordered set.

2Cardinal

partial ordering and
linear orderingmoreover or or
well–orderingmoreover every nonempty subset has a least element
transitiveevery element of is a subset of
ordinaltransitive and well–ordered by
successor ordinal
limit ordinal
cardinal such that for all
the least infinite cardinal
cardinal successor is the least cardinal greater than
cofinality the least limit ordinal s.t. there is an increasing with
regular cardinal (singular if )
strong limit cardinal (example: )
successor cardinal (limit cardinal otherwise)
weakly inaccessibleuncountable regular limit cardinal (not provable in ZFC)
inaccessibleuncountable regular strong limit cardinal
weakly compactuncountable and (is inaccessible)
GCH
SCH
for all for limit
for all for limit
for all for limit
for limit
s.t.
if , then and s.t.
Represent in the unique form where and
For limit ordinal , . (Corollary: is regular.)
is regular.
(Hausdorff) .
(Tarski) for .
For infinite , .
(König) , then .
Corollary: .
are infinite, then
For uncountable regular and continuous increasing , is a club.
Pf: for all , st , satisfies .

3Filter

filter on , , ,
examplestrivial , principal
-complete for
ideal on , , ,
examplestrivial , principal , -measure set
ultrafiltereither or (example: )
prime idealeither or (example: )
measurableuncountable, exist a -complete nonprincipal ultrafilter on
impliesregular, inaccessible
closedcontain all limit points less than , i.e.
unbounded, i.e. for all , exist
club filter contains a club
stationary intersects each club of
diagonal intersection
diagonal union
normal filterclosed under diagonal intersections
Fodor is regressive on stationary , then for some stationary and
Solovayfor uncountable regular , every stationary subset of is the disjoint union of stationary subsets
Mahloinaccessible st regular is stationary
weakly Mahloweakly inaccessible st regular is stationary
Ramseyevery partition of into has an infinite homogeneous set (), written
treea partially oredered set such that is well–ordered for all
Suslin linea dense (always ) linearly ordered set with countable chain condition ( is countable) but not separable
Suslin tree, every branch (maximal linearly ordered subset) is at most countable, every antichain (incomparable) is at most countable
is , is , is , is is , is , is wrong, is true
means
iff;

4Model

formulaa formula consisting of or or
formula where is (like , )
formula where is (like is a (regular/limit) cardinal)
is absolute for model , , reflects
elementary embedding
Skolem function implies
is definable in from for some formula and
example transitive is definable as
Reflection Principlefor each there is transitive st reflects
ibidfor each there is for some limit st reflects
ibidassuming AC, for each there is st reflects and
Generalized RP, for limit , , then there is arbitrarily large limit st
is definable over
denotes the closure under Gödel operations
is the rudimentary closure of
, , for limit
, , for limit
inner model of ZF ( is the smallest)a transitive class that contains all ordinals and satisfies ZF
, , for limit
if every set is constructible, AC, GCH