We construct a stronger family: every injection will have coinfinite range, and coherence means agreement modulo finitely many arguments. Begin with the empty function. At a successor, extend by assigning the new argument a value outside its range; the range remains coinfinite, and coherence with earlier functions is unchanged.
At a countable limit , take cofinal in . We build injections , extending one another exactly, with differing from at finitely many arguments. Also reserve distinct numbers , never used by the eventual union. After constructing , choose outside its range and different from the earlier reserved numbers; its range is coinfinite since it differs finitely from that of .
To extend to , first use on the new arguments while keeping on the old ones. Only finitely many collisions can arise: and differ finitely by the inductive coherence hypothesis, so their image sets differ finitely. The candidate is otherwise injective. There are also only finitely many new arguments assigned a value among . Reassign these finitely many bad arguments to distinct fresh values outside the candidate image and the reserved finite set. Infinitely many fresh values are available because the candidate image differs only finitely from the coinfinite image of . The resulting is injective, extends , omits the reserved numbers, and differs finitely from .
Put . It is injective and omits all , so its range is coinfinite. For each , choose with . The restriction is , which differs finitely from , and hence from . Transfinite recursion now gives
These coherent coinfinite injections into omega solve the requested problem. Reserving infinitely many omitted values is important: a union of injections with individually coinfinite ranges need not itself have coinfinite range.

Articles by others on the same topic (0)

There are currently no matching articles.