Fekete convergence from balanced integer predecessors in shrinking corridors
Loading original first page…
Abstract
Let w be positive, measurable and nonincreasing, with divergent square integral. Consider real sequences satisfying exact subadditivity only for integer pairs n≤ m≤ n+n w(log n). We replace eventual legality of adjacent pairs by a weaker condition: every sufficiently large output has a legal decomposition whose two summands differ by O(N^α) for some α<1, or by O(N/(log N)^(3/2+ε)) for some ε>0. Under either condition, a_n/n converges in ℝ ∪ {−∞}, without sign, monotonicity or growth assumptions. The proof regularizes the sequence by growing local maxima, proves exact integer corridor inequalities for that majorant, and separately transfers its limit back by propagation of low values along dyadic orbits. An explicit staircase width has arbitrarily long windows of illegal adjacent pairs, satisfies the logarithmic condition, and fails every fixed power condition. Both this convergence example and an oscillating isolated-output example can have divergent integrals of every finite positive power of w. Thus analytic width budgets and integer connectivity play different roles.
Read the full paper in the original PDF.
Edition files
- main.pdf88.6 KiB · pdf
SHA-256
58171f32cb3012870b1f6b3dbf729d8d916342e858efe009c3d3e3cd0dc2797d - Corridor_connectivity_publication_package.zip100.1 KiB · package
SHA-256
52631f287e6fec088f255f8c847f72f6f6efc8f5f535f7d99895cb09f290256a
Available editions
Research details
- Subjects
- Mathematics · Classical and Real Analysis
- Keywords
- Fekete lemma, subadditivity, integer connectivity, shrinking corridors, real sequences
- Manuscript date
- 2026-10-25
- Reader reuse
- No additional permission granted
Scope
Convergence for arbitrary real sequences under exact corridor subadditivity, divergent square integral and quantitative balanced predecessor hypotheses.
Disclosures
AI tools assisted in developing and checking the arguments and preparing the manuscript.
Reproduction
Editable LaTeX source and exact standard-library finite controls are included. With Python 3.10 or later, run python verify.py and python -O verify.py; the output verification.json records integer window, allocation and staircase checks. Finite controls accompany the analytic convergence proof. Compile main.tex with Tectonic or run pdfLaTeX twice.