other exercises: 20241031_DiskMat_Serie6.pdf

Question for TA

Can you please correct all the tasks in this series? I have found the problems very difficult and I am not sure if my approach is correct

6.6 The hunt for Red October

inspiration: https://cage.ugent.be/~ldnaux/problem_5.html

The position of the submarine is

Since are not known, the submarine has a par of unknown values . Since is countable, is countable as well (Theorem 3.22). The pairs can be written as

where . At every , Svetlana can fire a torpedo at

until she targets the position (pair) where the submarine is, e.g. , thus sinking the submarine in a finite time.

6.5 Countability

For all :

~~Since , cannot be smaller than 1. Thus, all functions

are also part of .~~ Now, we assume that is countable (). Let

Let and . Since the function only returns if , the sum is always smaller than . Thus, is in .

-> This means that for

Let so that . This means that for . Let be the smallest index where . Then , since only or satisfy the first case of the function.

-> is an injective function

We have shown that there is an injective function . According to Definition 3.42, then applies .

Since we assume that is countable and we have shown that it follows (Lemma 3.15):

This is a contradiction, thus proving that is uncountable.