現代数学の系譜　カントル　超限集合論

[過去ﾛｸﾞ] 現代数学の系譜　カントル　超限集合論 (1002ﾚｽ)
上下前次1-新
通常表示 512ﾊﾞｲﾄ分割ﾚｽ栞
抽出解除ﾚｽ栞

このｽﾚｯﾄﾞは過去ﾛｸﾞ倉庫に格納されています｡
次ｽﾚ検索歴削→次ｽﾚ栞削→次ｽﾚ過去ﾛｸﾞﾒﾆｭｰ

ﾘﾛｰﾄﾞ規制です｡10分ほどで解除するので､他のﾌﾞﾗｳｻﾞへ避難してください｡

509: 現代数学の系譜 雑談 ◆e.a0E5TtKE  [] 2019/11/28(木) 00:24:40.66 ID:QdpmOFrx

>>508

つづき

Kuratowski finiteness is defined as follows. Given any set S, the binary operation of union endows the powerset P(S) with the structure of a semilattice.
Writing K(S) for the sub-semilattice generated by the empty set and the singletons, call set S Kuratowski finite if S itself belongs to K(S).[8] Intuitively,
K(S) consists of the finite subsets of S. Crucially, one does not need induction, recursion or a definition of natural numbers to define generated by since one may obtain K(S) simply by taking the intersection of all sub-semilattices containing the empty set and the singletons.

Readers unfamiliar with semilattices and other notions of abstract algebra may prefer an entirely elementary formulation.
Kuratowski finite means S lies in the set K(S), constructed as follows. Write M for the set of all subsets X of P(S) such that:

X contains the empty set;
For every set T in P(S), if X contains T then X also contains the union of T with any singleton.
Then K(S) may be defined as the intersection of M.

In ZF, Kuratowski finite implies Dedekind finite, but not vice versa.
In the parlance of a popular pedagogical formulation, when the axiom of choice fails badly, one may have an infinite family of socks with no way to choose one sock from more than finitely many of the pairs.
That would make the set of such socks Dedekind finite: there can be no infinite sequence of socks, because such a sequence would allow a choice of one sock for infinitely many pairs by choosing the first sock in the sequence.
However, Kuratowski finiteness would fail for the same set of socks.

http://rio2016.5ch.net/test/read.cgi/math/1570237031/509

上下前次1-新書関写板覧索設栞歴

ｽﾚ情報赤ﾚｽ抽出画像ﾚｽ抽出歴の未読ｽﾚ AAｻﾑﾈｲﾙ

ぬこの手ぬこTOP 0.045s