[‰ß‹ŽÛ¸Þ] ƒˆE‰ž—p”ŠwE”Šw—×Ú•ª–ìiŠÜ‚ÞƒKƒƒA—˜_j20 (1002Ú½)
㉺‘OŽŸ1-V
’Šo‰ðœ Ú½žx

‚±‚̽گÄނ͉ߋŽÛ¸Þ‘qŒÉ‚ÉŠi”[‚³‚ê‚Ä‚¢‚Ü‚·¡
ŽŸ½ÚŒŸõ —ðí¨ŽŸ½Ú žxí¨ŽŸ½Ú ‰ß‹ŽÛ¸ÞÒÆ­°
631
(1): Œ»‘㔊w‚ÌŒn•ˆ ŽG’k ŸyH25M02vWFhP 06/18(…)17:04 ID:1ZjEJMOG(4/4) AAS
‚‚«
Alternative method
An alternative method is the following. Let
ƒ³(x) be the formula that says "x is inductive"; i.e.
ƒ³(x)=(∅¸xÈÍy(y¸x¨(y¾{y}¸x))).
Informally, what we will do is take the intersection of all inductive sets. More formally, we wish to prove the existence of a unique set W such that
Íx(x¸W↔ÍI(ƒ³(I)¨x¸I)). (*)
For existence, we will use the Axiom of Infinity combined with the Axiom schema of specification.
Let I be an inductive set guaranteed by the Axiom of Infinity. Then we use the axiom schema of specification to define our set
W={x¸I:ÍJ(ƒ³(J)¨x¸J)}
– i.e. W is the set of all elements of I, which also happen to be elements of every other inductive set. This clearly satisfies the hypothesis of (*), since if x¸W, then
x is in every inductive set, and if
x is in every inductive set, it is in particular in I, so it must also be in W.

For uniqueness, first note that any set that satisfies (*) is itself inductive, since 0 is in all inductive sets, and if an element
x is in all inductive sets, then by the inductive property so is its successor. Thus if there were another set
WŒ that satisfied (*) we would have that
WμW since
W is inductive, and
WºWŒsince
WŒis inductive. Thus W=WŒ.
Let ƒÖ denote this unique element.

This definition is convenient because the principle of induction immediately follows: If
IºƒÖ is inductive, then also
ƒÖºI, so that I=ƒÖ.¡
(ˆø—pI‚è)
ˆÈã
852
(3): Œ»‘㔊w‚ÌŒn•ˆ ŽG’k ŸyH25M02vWFhP 07/10(–Ø)07:08 ID:J4CWtGen(1/3) AAS
>>848-851
‚Ó‚Á‚ÓA‚Ù‚Á‚Ù
‚à‚¤‹l‚ñ‚¾‚Ì‚©H‚— G‚j

@>>727‚æ‚èĘ^
>h¿{x¼A|{}¸xÈÍy[y¸x¨y¾{y}¸x]}h
‚±‚ÌŽ®‚ÍA‰º‹Lija.ipediaj‚̃yƒAƒm‚ÌŒö— Ž©‘R”‚ÌW‡˜_“I\¬ ‚ÌŽ®‚¾‚ª
ã‹L‚Ì’Ê‚èA¿‚ÌIterated binary operation ‚̈Ӗ¡‚ª•s–¾Šmi‚±‚Ìà–¾‚ð‹‚ß‚ç‚ê‚邯‹l‚܂邾‚낤j
‚Ȃ̂ÅA¿‚ðŽg‚í‚È‚¢ •Ê‚ÌH•v‚ª‚ ‚éi‰º‹Lj
—Ⴆ‚Î en.wikipedia Axiom of infinity, Extracting the natural numbers from the infinite set, Alternative method
‚ ‚é‚¢‚Í fr.wikipedia Axiome de l'infini
‚ ‚é‚¢‚ÍA>>569 ’}”g‘å ’Øˆä–¾l PDF P9 ŠO•”ØÝ¸[pdf]:www.math.tsukuba.ac.jp ”—˜_—ŠwII
‚ ‚é‚¢‚ÍA>>677 Ÿº–ì¹ P10i–³ŒÀŒö—jŠO•”ØÝ¸[pdf]:fuchino.ddo.jp uƒQ[ƒfƒ‹‚Æ20¢‹I‚̘_—Šw‘æ‚SŠªvi“Œ‹ž‘åŠwo”ʼnïC2007j‚ÌCŸº–ì ¹‚ÌŽ·•M‚µ‚½‘æI•”
ˆÈã
(ˆø—pI‚è)

ŒJ‚è•Ô‚·‚ªA¿‚ÌIterated binary operation ‚̈Ӗ¡‚ª•s–¾Šm

‚³‚ç‚ÉAwikipedia Axiom of infinity ‹Lq‚ðˆø—p‚·‚é >>630-631 ‚æ‚è
ŠO•”ØÝ¸:en.wikipedia.org
Axiom of infinity
Extracting the natural numbers from the infinite set
The infinite set I is a superset of the natural numbers. To show that the natural numbers themselves constitute a set, the axiom schema of specification can be applied to remove unwanted elements, leaving the set N of all natural numbers. This set is unique by the axiom of extensionality.
To extract the natural numbers, we need a definition of which sets are natural numbers. The natural numbers can be defined in a way that does not assume any axioms except the axiom of extensionality and the axiom of induction—a natural number is either zero or a successor and each of its elements is either zero or a successor of another of its elements. In formal language, the definition says:
Ín(n¸N⟺([n=∅ÉÎk(n=k¾{k})]ÈÍm¸n[m=∅ÉÎk¸n(m=k¾{k})])).
Or, even more formally:
Ín(n¸N⟺([Ík(¬k¸n)ÉÎkÍj(j¸n⟺(j¸kÉj=k))]È
@Ím(m¸nË[Ík(¬k¸m)ÉÎk(k¸nÈÍj(j¸m⟺(j¸kÉj=k)))]))).

‚‚­
㉺‘OŽŸ1-VŠÖŽÊ”——õÝžx—ð
½Úî•ñ ÔÚ½’Šo ‰æ‘œÚ½’Šo —ð‚Ì–¢“ǽÚ

‚Ê‚±‚ÌŽè ‚Ê‚±TOP 0.048s