[數撚圍爐區] 將一個波分成五份, 然後砌兩個同原本一樣的波的鬼故事 (108)

前10a 彭匡怡中學就去法官office 做助理

普通人點會做到呢d intern

通常我會分做natural domain同埋domain

maximal domain, natural domain, domain

Dedekind infinite -> infinite(proved)
infinite -?-> dedekind infinite

proved, by AOC and transfinite recursion

Countable union of countable set is countable: AOC x 3, choose surjection function out of many, surjection implies the possibiltiy of choosing one input out of many from in reverse direction, subset is countable set is countable is by exhaust all element of subset by choosing
AOC

, subset is of countable set

頭兩AOC x 2 應該可以唔洗用返AOC，因為唔需要盲舂舂咁揀，我地已經有function map好咗