Inverse-Limit Formulas and Stable-Range Rigidity for Cyclotomic Sums

We study truncation compatible families F = (F_m){m>=1} over Q[z] through an inverse limit formalism, and we evaluate them at the punctured cyclotomic cosine points alpha{k,n} = cos(2 pi k/n) with the specialization z equals n-1. For symmetric families of uniformly bounded total degree in x <= d, we prove a stable range rigidity theorem: for all n >= d+2, the cosine point evaluation factors through the finitely many punctured cosine power sums the finitely many power sums P1(n) through Pd(n). In the purely polynomial case this implies eventual polynomiality in n. We then extend the framework to include fixed product factors and package their cosine point contribution in multiplicative invariants MQ(n). In the stable range, the bounded degree symmetric part collapses as before; any remaining cyclotomic dependence occurs only through these explicit product terms. Finally, we show that coefficient extraction from such products produces further bounded degree symmetric families, and we apply this to complete symmetric functions h_r evaluated at cosine points.

💡 Research Summary

The paper introduces a new algebraic framework for handling families of polynomials that depend on a level parameter n, where the number of variables grows with n. The authors define a “truncation‑compatible” family F = (Fₘ)ₘ≥1 as an element of the inverse limit
𝔽ₚₒₗ𝑦 = lim← ℚ