OpenAI preprint, September 2026 · 5. The numerical obstruction
Section 5 (proof of Theorem 1.2):Nonnegative weights on an interval of length one give the bound
Variance decomposes in finite weighted mixtures.
Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its
declaration both in Lean and in words.
The Setting
The numerical obstruction involves finite weighted real data. Let be a finite set. A system of normalized real weights on is a family of real numbers satisfying (1). (1)
For real data , the weighted mean and weighted variance are the real numbers defined by (2). (2)
The Claim
Theorem 1. Let be a finite set and let be normalized real weights. For real data and , the weighted mixture identity (3) holds: (3)✦If the weights are nonnegative and real data lie in for a real number , the weighted variance satisfies (4): (4)✦
In the paper, the result reads: for the semistable factors of a balanced sheaf , with positive ranks and total rank , writing for the direct image, for the polarization and for the first Chern class, put , and ; then the numerical invariant satisfies , and if the lie in an interval of length one, the last sum is at most .
What Is Checked
The mixture identity is stated over finite real data with real weights of sum one, and the variance bound additionally assumes nonnegative weights and data in .