MHB Axiom of Infinity and Garling, Theorem 1.7.4 - the successor set Z^+

Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading D. J. H. Garling: "A Course in Mathematical Analysis: Volume I Foundations and Elementary Real Analysis ... ...

I am currently focused on Garling's Section 1.7 The Foundation Axiom and the Axiom of Infinity ... ...

I need some help with Theorem 1.7.4 ... and in particular with the notion of a successor set $$Z^+$$ ... ... ... ... the relevant text from Garling is as follows:
View attachment 6153
In the above text we read the following:

" ... ... Suppose that $$S$$ is a successor set. Let

$$Z^+ = \cap \{ B \in P(S) : B \text{ is a successor set } \}$$ ... "
Note also that Garling defines a successor set as follows:

" ... ... A set $$A$$ is called a successor set if $$\emptyset \in A$$ and if $$a^+ \in A$$ whenever $$a \in A$$ ... ... "and

Garling defines $$a^+$$ as follows:

" ... ... If $$a$$ is a set, we define $$a^+$$ to be the set $$a \cup \{ a \}$$ ... ... "
Now my problem is that I do not understand the definition/construction of $$Z^+$$ ... ... in each example I construct I seem to get $$Z^+ = \emptyset$$ ... ... and this cannot be right ...
For example ...
Suppose that

$$S = \{ \emptyset , a , a \cup \{ a \} , \{ a , b \}, \{ a , b \} \cup \{ \{ a , b \} \} \}$$$$Z^+ = \cap B_i$$ where $$B_i \in P(S)$$ and each $$B_i$$ is a successor set ...... ... then we find ... ...$$B_1 = \{ \emptyset, a , a \cup \{ a \} \}$$

$$B_2 = \{ \emptyset, \{ a , b \} , \{ a , b \} \cup \{ \{ a , b \} \} \}$$

$$B_3 = S$$ ... so ... ...$$B_1, B_2, B_3$$ seem to me to be the only subsets of $$P(S)$$ that are successor sets and we find that ...$$\cup B_i = \emptyset $$BUT ... surely this cannot be right ...!Can someone clarify this issue and show me how Z^+ is meant to be constructed ...

Hope someone can help ...

Peter====================================================

In order to enable readers to get a better understanding of Garling's notation and approach I am providing the first two pages of Section 1.7 ... as follows:View attachment 6154
View attachment 6155
 
Physics news on Phys.org
Peter said:
Suppose that

$$S = \{ \emptyset , a , a \cup \{ a \} , \{ a , b \}, \{ a , b \} \cup \{ \{ a , b \} \} \}$$
This $S$ is not a successor set because $(a \cup \{ a \})^+\notin S$ (at least, not for al $a$).
 
Evgeny.Makarov said:
This $S$ is not a successor set because $(a \cup \{ a \})^+\notin S$ (at least, not for al $a$).
Thanks Evgeny ... I'll now try to reformulate my example ...

I am assuming S should be as follows ... ...

$$S = \{ \emptyset , \emptyset^+, \emptyset^{++}, \emptyset^{+++}, \ ... \ ... \ ... \ , a, a^+, a^{++}, a^{+++}, \ ... \ ... \ ... \ , \{ a , b \}, \{ a , b \}^+, \{ a , b \}^{++}, \{ a , b \}^{+++}, \ ... \ ... \ ... \ \} $$Then Garling defines $$Z^+$$ as follows:$$Z^+ = \cap B_i$$ where $$B_i \in P(S)$$ and each $$B_i$$ is a successor set ...... ... then we find ... ...$$B_1 = \{ \emptyset , \emptyset^+, \emptyset^{++}, \emptyset^{+++}, \ ... \ ... \ ... \ \}$$$$B_2 = \{ \emptyset , \emptyset^+, \emptyset^{++}, \emptyset^{+++}, \ ... \ ... \ ... \ a, a^+, a^{++}, a^{+++}, \ ... \ ... \ ... \ \}$$$$B_3 = \{ \emptyset , \emptyset^+, \emptyset^{++}, \emptyset^{+++}, \ ... \ ... \ ... \ , \{ a , b \}, \{ a , b \}^+, \{ a , b \}^{++}, \{ a , b \}^{+++}, \ ... \ ... \ ... \ \} $$

and

$$B_4 = S$$ ... so ... ...$$B_1, B_2, B_3, B_4 $$ now seem to me to be the only subsets of $$P(S)$$ that are successor sets and we find that ...$$\cap B_i = \{ \emptyset , \emptyset^+, \emptyset^{++}, \emptyset^{+++}, \ ... \ ... \ ... \ \} $$

Is that correct?

PeterNOTE - just by the way, I think that what Garling is calling a "successor set" is often called an "inductive set" ... can you confirm that this is the case?
 
Last edited:
Peter said:
$$B_1, B_2, B_3, B_4 $$ now seem to me to be the only subsets of $$P(S)$$ that are successor sets
$P(S)$ contains infinitely many successor sets. All of them include $B_1$, but elements of the form $a^{+\dots}$ may start with, say, $a^{+++}$ and not with $a$. The intersection of all these sets is indeed $\{ \emptyset , \emptyset^+, \emptyset^{++}, \emptyset^{+++}, \ ...\}$.

Peter said:
I think that what Garling is calling a "successor set" is often called an "inductive set" ... can you confirm that this is the case?
Yes.
 
Evgeny.Makarov said:
$P(S)$ contains infinitely many successor sets. All of them include $B_1$, but elements of the form $a^{+\dots}$ may start with, say, $a^{+++}$ and not with $a$. The intersection of all these sets is indeed $\{ \emptyset , \emptyset^+, \emptyset^{++}, \emptyset^{+++}, \ ...\}$.

Yes.
Thanks so much Evgeny... most helpful indeed!

Peter
 
Last edited:
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Back
Top