🤯 Did You Know (click to read)
The proof applies uniformly to every positive integer step, regardless of magnitude.
As the step size in an arithmetic progression increases, the proportion of sampled positions approaches zero. Intuition suggests that extremely rare sampling might prevent large cumulative sums. The Erdős Discrepancy theorem proves otherwise. Even when the density of sampled terms vanishes, the subsequence remains infinite. Infinite repetition eventually outweighs sparsity. Some rarefied progression still produces sums exceeding any bound. Thinness cannot defeat arithmetic infinity.
💥 Impact (click to read)
The contrast is stark: density shrinks toward nothing while discrepancy explodes toward infinity. This defies everyday proportional reasoning. Sparse sampling feels harmless, yet infinite length compensates completely. Small structural biases accumulate relentlessly over infinite steps. Arithmetic patience guarantees divergence.
The lesson generalizes to other infinite systems where dilution does not imply containment. Frequency reduction cannot neutralize structural amplification across infinite horizons. The theorem cements sparsity’s impotence against arithmetic law. Even vanishingly thin progressions hide explosive potential.
💬 Comments