用户: Yao/集合论
< 用户:Yao
1ZF
Extensionality | If and have the same elements, then . | |
Separation | For any set and formula , there is a set . | Then . |
Pairing | For any and , there is a set . | Then , . |
Union | For any , there is a set . | |
Power | For any , there is a set . | Then is a subset of . |
Infinity | There is a set s.t. and . | This is called an inductive set. |
Replacement | If a class is a function, then for any there is a set . | |
Regularity | Every nonempty set has an -minimal element. | This implies . |
Choice | Every family of nonempty sets has a choice function. | The first eight constitute ZF, and all nine ZFC. |
Zorn’s Lemma | A partially ordered set each chain (linearly ordered) of which has a upper bound has a maximal element. |
Well–Ordering | Every set can be well–ordered. |
Hausdorff | There is a maximal chain for any partially ordered set. |
2Cardinal
partial ordering | and |
linear ordering | moreover or or |
well–ordering | moreover every nonempty subset has a least element |
transitive | every element of is a subset of |
ordinal | transitive 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 inaccessible | uncountable regular limit cardinal (not provable in ZFC) |
inaccessible | uncountable regular strong limit cardinal |
weakly compact | uncountable 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 | , , , |
examples | trivial , principal |
-complete | for |
ideal on | , , , |
examples | trivial , principal , -measure set |
ultrafilter | either or (example: ) |
prime ideal | either or (example: ) |
measurable | uncountable, exist a -complete nonprincipal ultrafilter on |
implies | regular, inaccessible |
closed | contain 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 filter | closed under diagonal intersections |
Fodor | is regressive on stationary , then for some stationary and |
Solovay | for uncountable regular , every stationary subset of is the disjoint union of stationary subsets |
Mahlo | inaccessible st regular is stationary |
weakly Mahlo | weakly inaccessible st regular is stationary |
Ramsey | every partition of into has an infinite homogeneous set (), written |
tree | a partially oredered set such that is well–ordered for all |
Suslin line | a 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
formula | a 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 Principle | for each there is transitive st reflects |
ibid | for each there is for some limit st reflects |
ibid | assuming 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 |