Theorem 6.1 — Flat-orbit proportions including the asymptotic limit
OpenZLIPPadding.Padding.Supplement.flat_orbit_proportioncomputational-complexitylattice-algorithmsp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1probability
For integers , let be the flat vectors of and set . Then
For every sequence of positive integers , the flat proportion tends to one. Also, for every and the flat proportion is strictly greater than . This companion theorem retains both finite inequalities, the complete sequential little-o assertion, and the strict finite-range bound. It provides the flat-mass hypothesis for short-shell recovery.
Differences from the source:
- encoding: m=o(n^(3/4)) and finite cardinality ratios → Tendsto for every positive integer sequence and Finset cardinalities coerced to real numbers; reason: this states the full sequential little-o consequence and preserves both finite inequalities
Preamble
import Definitions.Def_ZLIPPadding_Padding_Supplement_Statistics
Formal statement
namespace ZLIPPadding.Padding.Supplement
open scoped BigOperators ENNReal
theorem flat_orbit_proportion :
(∀ n m : ℕ, 1 ≤ m → 2*m ≤ n →
flatRatio n m ≥ Real.exp (-flatError n m) ∧
(((shell n m) \ flat n m).card : ℝ)/(shell n m).card ≤ flatError n m) ∧
(∀ ms : ℕ → ℕ, (∀ n, 1 ≤ ms n) →
Filter.Tendsto (fun n => (ms n : ℝ)/(n : ℝ)^(3/4 : ℝ))
Filter.atTop (nhds 0) →
Filter.Tendsto (fun n => flatRatio n (ms n)) Filter.atTop (nhds 1)) ∧
(∀ n m : ℕ, shortRange n m → flatRatio n m > 2/3) := by sorry
end ZLIPPadding.Padding.Supplement
Source
Shengmao Jiang, STOC 2027 submission #496 (October 2026), printed p. 24 (PDF p. 25), Theorem 6.1