Maths Olympiad Prep

Library / /250 of 520

Combinatorics Difficulty 6.9 National olympiad Find the answer

a) There is an infinite sequence of 0,10,1, like ,a1,a0,a1,\dots,a_{-1},a_{0},a_{1},\dots (i.e. an element of {0,1}Z\{0,1\}^{\mathbb Z}). At each step we make a new sequence. There is a function ff such that for each ii, \mboxnewai=f(ai100,ai99,,ai+100)\mbox{new }a_{i}=f(a_{i-100},a_{i-99},\dots,a_{i+100}). This operation is mapping F:{0,1}Z{0,1}ZF: \{0,1\}^{\mathbb Z}\longrightarrow\{0,1\}^{\mathbb Z}. Prove that if FF is 1-1, then it is surjective.
b) Is the statement correct if we have an fif_{i} for each ii?

Solution

### Part (a)

To prove that if F F is injective (1-1), then it is surjective, we will use the properties of compactness and continuity in the product topology.

1. **Consider the Set S S **:
- Let S S be the set of all infinite sequences in {0,1}Z \{0,1\}^{\mathbb{Z}} such that ai=0 a_i = 0 for i0 i \leq 0 or i>N i > N . This means S S consists of sequences that are zero outside a finite interval.

2. **Image of S S under F F **:
- Since F F is injective, the image F(S) F(S) has 2N 2^N elements because there are 2N 2^N different sequences in S S .

3. Cutting Strings:
- Consider the strings in F(S) F(S) from character 99 -99 to character N+100 N+100 . Since F F is injective, these strings must be distinct. Therefore, we have 2N 2^N different strings of length N+200 N+200 .

4. Probability Argument:
- The probability that a given string of length k k is in the image is at least 2200 2^{-200} . This is because the number of distinct strings of length N+200 N+200 in F(S) F(S) is 2N 2^N , and the total number of such strings is 2N+200 2^{N+200} .

5. Density of Finite Strings:
- Since every finite string can be found in the image of F F , the image of F F contains all finite strings.

6. Compactness and Continuity:
- The space {0,1}Z \{0,1\}^{\mathbb{Z}} with the product topology is compact and Hausdorff. The function F F is continuous in this topology because if two sequences are equal in a sufficiently large part, their images under F F will also be equal.
- The image of a continuous function from a compact space is compact. Since the image contains all finite strings and is closed, it must be dense in {0,1}Z \{0,1\}^{\mathbb{Z}} .

7. Conclusion:
- Since the image is dense and closed in a compact space, it must be the entire space. Therefore, F F is surjective.

\blacksquare

### Part (b)

To determine if the statement is correct when we have a different function fi f_i for each i i :

1. **Different Functions fi f_i **:
- If we have a different function fi f_i for each i i , the mapping F F is no longer defined by a single function f f but by a sequence of functions {fi} \{f_i\} .

2. Injectivity and Surjectivity:
- The injectivity of F F does not necessarily imply surjectivity in this case. The argument used in part (a) relies on the continuity and compactness properties, which may not hold if each fi f_i is different.

3. Counterexample:
- Consider a sequence of functions {fi} \{f_i\} such that each fi f_i only depends on ai a_i . For example, fi(ai)=ai f_i(a_i) = a_i . This mapping is injective but not surjective because it cannot produce sequences that are not already in the original set.

Therefore, the statement is not necessarily correct if we have a different fi f_i for each i i .

The final answer is False

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.