Keyboard shortcuts

Press or to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Linear Margin and Typical Distance Density

Abstract

Diagonal listings satisfy the corrected linear-margin bound and concentrate at the typical distance density.

Theorem 1.1 (Linear margins concentrate at the nonzero-choice density).

Proof. Machine-checked in Lean as D5/S0/Diagonal/Probability/LinearMarginConcentration.linear_margin_concentration (✓ std3). ∎

Source. Repository-derived.

Commentary.

For a finite value type Y of cardinality at least two, a self-map f, and a lower density alpha strictly between zero and (card(Y)-1)/card(Y), the first conjunct gives the corrected finite KL-Chernoff bound for every finite address type satisfying the displayed threshold restriction.

The second conjunct states that the corrected bound tends to zero. The third states that the actual probability of any row missing the linear margin also tends to zero, which is the asymptotically almost-sure linear escape clause. The fourth quantifies over every upper density between the typical density and one and states two-sided concentration of the minimum-distance density.

The proof directly combines the four frozen diagonal-margin theorems. It introduces no replacement probability, distance, divergence, or carrier. The displayed probability names abbreviate the finite uniform cardinality ratios written explicitly in the Lean statement.

References