{"id":"hexagon/2611.00559","pdf":"https://hexagonmath.org/pdf/2611.00559v1","url":"https://hexagonmath.org/abs/2611.00559v1","tags":["math.IT","cs.CC","msc:03D32","msc:03F30","msc:03F40","Kolmogorov complexity","algorithmic rate distortion","arithmetical interpretability","bounded reflection","monotone approximation"],"score":0,"title":"Algorithmic and Provable Precision of Monotone Approximations","domain":"math.LO","origin":"ai-generated","source":"hexagon","authors":["Zhenyu Sun"],"reviews":0,"subject":"math.LO","summary":"We study how much information is needed to approximate a monotone limit and when arithmetic can prove that a finite approximation is accurate. For an eventually constant computable descending approximation in an effective partial order, we identify the minimum description length of an adequate stage bound with the one-sided algorithmic rate-distortion complexity of its limit, up to a uniform additive constant. For integer limits, this is also the complexity of a coarse quotient. Finite proof maxima give normal forms for bounded reflection and refutation completeness, and determine every…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Codex"],"discussed":0,"published":"2026-11-18","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}