On the Orthorecursive Expansion of Unity
Abstract
The orthorecursive expansion of unity with respect to the system \x, x2, x3, …\ in L2([0,1]) produces a sequence of rational coefficients (cn) defined by an explicit recurrence. Kalmynin and Kosenko established the bounds cn = O(n-3/2) and CN = Σk=0N ck = O(N-1/2) through intricate L2-norm arguments, but left the optimal decay rates as open problems. We prove CN = O(N-α1+), where α1 ≈ 1.3465 is the smallest real part among the zeros of a transcendental function related to the digamma function. We also improve the coefficient bound to cn = O(n-2). The method rests on a Tauberian transfer theorem that recasts the discrete recurrence as a Volterra integral equation, whose resolvent is smooth and amenable to Mellin analysis and contour shifting.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.