The sequence c0,c1,…,cn,… is defined by c0=1, c1=0 and cn+2=cn+1+cn for n≥0. Consider the set S of ordered pairs (x,y) for which there is a finite set J of positive integers such that x=∑j∈Jcj, y=∑j∈Jcj−1. Prove that there exist real numbers α, β and m, M with the following property: An ordered pair of nonnegative integers (x,y) satisfies the inequality m<αx+βy<M if and only if (x,y)∈S.
N. B. A sum over the elements of the empty set is assumed to be 0.
This one wants a proof. Work it on paper, read the official solution, then mark
yourself honestly — the ladder only means something if the record is true.
Official solution
Let φ=(1+5)/2 and ψ=(1−5)/2 be the roots of the quadratic equation t2−t−1=0. So φψ=−1, φ+ψ=1 and 1+ψ=ψ2. An easy induction shows that the general term cn of the given sequence satisfies cn=φ−ψφn−1−ψn−1 for n≥0 Suppose that the numbers α and β have the stated property, for appropriately chosen m and M. Since (cn,cn−1)∈S for each n, the expression αcn+βcn−1=5α(φn−1−ψn−1)+5β(φn−2−ψn−2)=51[(αφ+β)φn−2−(αψ+β)ψn−2] is bounded as n grows to infinity. Because φ>1 and −1<ψ<0, this implies αφ+β=0. To satisfy αφ+β=0, one can set for instance α=ψ, β=1. We now find the required m and M for this choice of α and β. Note first that the above displayed equation gives cnψ+cn−1=ψn−1, n≥1. In the sequel, we denote the pairs in S by (aJ,bJ), where J is a finite subset of the set N of positive integers and aJ=∑j∈Jcj, bJ=∑j∈Jcj−1. Since ψaJ+bJ=∑j∈J(cjψ+cj−1), we obtain ψaJ+bJ=j∈J∑ψj−1 for each (aJ,bJ)∈S(1) On the other hand, in view of −1<ψ<0, −1=1−ψ2ψ=j=0∑∞ψ2j+1<j∈J∑ψj−1<j=0∑∞ψ2j=1−ψ21=1−ψ=φ Therefore, according to (1), −1<ψaJ+bJ<φ for each (aJ,bJ)∈S. Thus m=−1 and M=φ is an appropriate choice. Conversely, we prove that if an ordered pair of nonnegative integers (x,y) satisfies the inequality −1<ψx+y<φ then (x,y)∈S. Lemma. Let x,y be nonnegative integers such that −1<ψx+y<φ. Then there exists a subset J of N such that ψx+y=j∈J∑ψj−1(2) Proof. For x=y=0 it suffices to choose the empty subset of N as J, so let at least one of x,y be nonzero. There exist representations of ψx+y of the form ψx+y=ψi1+⋯+ψik where i1≤⋯≤ik is a sequence of nonnegative integers, not necessarily distinct. For instance, we can take x summands ψ1=ψ and y summands ψ0=1. Consider all such representations of minimum length k and focus on the ones for which i1 has the minimum possible value j1. Among them, consider the representations where i2 has the minimum possible value j2. Upon choosing j3,…,jk analogously, we obtain a sequence j1≤⋯≤jk which clearly satisfies ψx+y=∑r=1kψjr. To prove the lemma, it suffices to show that j1,…,jk are pairwise distinct. Suppose on the contrary that jr=jr+1 for some r=1,…,k−1. Let us consider the case jr≥2 first. Observing that 2ψ2=1+ψ3, we replace jr and jr+1 by jr−2 and jr+1, respectively. Since ψjr+ψjr+1=2ψjr=ψjr−2(1+ψ3)=ψjr−2+ψjr+1, the new sequence also represents ψx+y as needed, and the value of ir in it contradicts the minimum choice of jr. Let jr=jr+1=0. Then the sum ψx+y=∑r=1kψjr contains at least two summands equal to ψ0=1. On the other hand js=1 for all s, because the equality 1+ψ=ψ2 implies that a representation of minimum length cannot contain consecutive ir 's. It follows that ψx+y=r=1∑kψjr>2+ψ3+ψ5+ψ7+⋯=2−ψ2=φ, contradicting the condition of the lemma. Let jr=jr+1=1; then ∑r=1kψjr contains at least two summands equal to ψ1=ψ. Like in the case jr=jr+1=0, we also infer that js=0 and js=2 for all s. Therefore ψx+y=r=1∑kψjr<2ψ+ψ4+ψ6+ψ8+⋯=2ψ−ψ3=−1, which is a contradiction again. The conclusion follows. □
Source: MathNet,
licensed CC-BY-4.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.