Every family of pairwise disjoint nonempty open disks in the plane is countable. The density of the rational numbers gives each disk a point of the countable set . Fixing an enumeration and taking the first point in each disk yields an injection from disks to labels. This argument requires no countable choice of representatives and is useful when geometric separation would otherwise produce an uncountable family.
The integers are countable: for and for is an injection . Hence is a countable set. The map is a surjection onto the rational numbers, so the image result already proved gives is countable. Unique reduced fractions are not required for this surjection argument.
For the final unheaded geometry request, suppose for contradiction that no two distinct circles in the collection intersect. Restrict to the subcollection of circles tangent to the -axis. Each such nondegenerate circle has a unique tangency point, and the tangency-point map is a surjection by the hypothesis.
The closed disk of a circle tangent at meets the -axis only at . Two distinct members of cannot have nested disks: if one disk were inside the other, its tangency point would belong to the larger disk, so both tangency points would be equal and both circle boundaries would pass through it. That already contradicts nonintersection. Circles with disjoint boundaries and no nesting have disjoint disks. Thus their open disks are pairwise disjoint.
By the density of the rational numbers, every nonempty open disk contains a point of , which is a countable set. Fix an enumeration of and assign to each disk the first enumerated point inside it. Disjointness makes this assignment an injection. This is the countability of pairwise disjoint open disks, and proves that is a countable set. Its surjection onto would make the real numbers countable, contrary to the Cantor diagonal argument. Therefore
The proof allows circles on either side of the axis and counts tangential contact as intersection; it does not assume that all circles in the original collection are tangent to the axis.
The Martingale convergence theorem says that if a discrete-time martingale satisfies , then there is an integrable random variable such that
The hypothesis does not by itself ensure convergence in L1.
For each pair of rational numbers , the Doob upcrossing inequality gives . The monotone convergence theorem therefore gives a finite expected value for , so this upcrossing count is finite almost surely. There are only countably many such pairs, hence all their upcrossing counts are simultaneously finite outside one event of probability zero.
If , the density of the rational numbers supplies strictly between them, forcing infinitely many upcrossings. Consequently has a limit in the extended real numbers almost surely. By the Fatou lemma,
A limit of either or would make this lower limit infinite, so the limit is finite almost surely, and the same inequality proves its integrability.
The sigma-algebras decrease with , and (b) gives . The permitted reverse martingale convergence theorem therefore gives an integrable random variable such that almost surely and with convergence in L1. In particular,
It remains to prove that is constant. We must not assume that is the tail sigma-algebra of the ; instead use tail measurability of limits of sample averages directly. Define the random variable valued in the extended real numbers . For every fixed ,
because pointwise. Thus is measurable with respect to for every , and hence to the tail sigma-algebra. Also almost surely.
By the Kolmogorov zero-one law, each tail event , for a rational number , has probability zero or one. Since is finite almost surely, its distribution function can only be that of a constant : taking and using the density of the rational numbers gives almost surely. Its expected value identifies . This proves the strong law of large numbers:
For a increasing function , define its one-sided limits by
They exist because of monotonicity. The function is discontinuous at only if the jump interval
is nonempty. By the density of the rational numbers, choose .
If , monotonicity gives , so and are disjoint. Consequently , and injects the set of discontinuities into . Since the rationals are countable by part (ii), the set of discontinuities is countable.