作者recorriendo (孟新)
看板Math
標題[其他] Well-ordering的問題
時間Mon Feb 7 08:39:51 2011
Let D be the set of decreasing functions f: N -> N. (N 是自然數集)
The relation < on D is defined as follows: f < g iff there is an natural
number n such that f(n) < g(n) and f(i)=g(i) for all i < n.
Let S be a nonempty subset of D. Show that S has a least element under <.
想了一些方法可是好像都不太對
不知道有沒有熟悉集合論的高手幫忙解此題
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 128.12.121.149