Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 11 1 a Solution Created 2026-10-03 Updated 2026-10-14
The infinite Ramsey theorem used here says that every finite colouring of the -element subsets of an infinite subset of has an infinite homogeneous subset. Let be normalized with basis constant .
For each positive integer , rational scalar tuple and precision , colour increasing -tuples according to intervals of length containing . This is a finite colouring, because all these norms lie between zero and . Enumerate the countably many triples and repeatedly apply the Ramsey theorem, obtaining decreasing infinite sets on which each specified norm has oscillation at most . Choose a diagonal subsequence whose tail is contained in every previously selected infinite set.
Consequently, for every rational tuple , the net of norms over increasing tuples from is Cauchy as its first index tends to infinity. Denote its limit by . This extends to arbitrary scalar tuples becauseuniformly in the indices. For complex scalars use rational real and imaginary parts. The same estimate proves convergence uniformly over all sufficiently late increasing tuples for each fixed scalar tuple.
Homogeneity and the triangle inequality pass to the limit. The coordinate functionals of a normalized basic sequence have norm at most , since the coordinate projection is the difference of two initial projections. Thusso is a genuine norm. Zero coefficients may be inserted anywhere without changing the value: removing those coordinates simply selects another increasing tuple for the same limiting combination. Also every initial-segment projection has norm at most , by the corresponding inequality for . Completing the finitely supported scalar sequences in therefore gives a Banach space with a normalized basic sequence .
Its finite norms are invariant under increasing relabellings, by the zero-insertion observation, andThis is the required spreading model, generated by the diagonal subsequence.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 11 1 b Solution Created 2026-10-03 Updated 2026-10-14
Write for the limiting spreading model norm. We show that deleting any one coefficient does not increase it; iteration then gives every finite suppression.
Fix an index , the coefficients, and a small . Choose a generation threshold so that all the relevant full and shortened combinations beyond it approximate their model norms within . Fix the indices before position beyond this threshold. Since is a weakly null sequence, the Mazur lemma gives a finite convex combinationwith every after the fixed prefix. Choose the remaining indices after . For every , the full ordered combination with in slot has norm at most . Averaging these combinations givesThe shortened combination has norm at most , and approximates its own model norm within . Letting provesfor every finite set . Thus the model is a suppression-unconditional basic sequence with constant one. The convex-combination argument allows the omitted coordinate to sit between two retained coordinates; simply letting a single omitted index tend to infinity with all others fixed would not respect their order.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 11 1 c Solution Created 2026-10-03 Updated 2026-10-14
Choose a normalized basic sequence in the infinite-dimensional Banach space, and apply the Rosenthal l1 theorem. If a subsequence is equivalent to the unit vector basis of , any spreading model generated from a further subsequence retains its two-sided estimates and is therefore unconditional.
Otherwise there is a weakly Cauchy sequence as a subsequence , still basic. Its consecutive differences are weakly null and are a block sequence. The coordinate-functional bound for its normalized parent basis gives . Hence is a normalized weakly null basic sequence. Part (a) gives a spreading model, and part (b) makes that model one-suppression-unconditional. Thus every infinite-dimensional Banach space has an unconditional spreading model, even though it need not contain an unconditional basic sequence.