可信度还没有人判定查看链条图 →

Fix errors in Lemma 3 ([Spectral estimates above a tight threshold]) for which the number of points with d_i≤p^2 is between c np^3 and Cnp^3 , and apply it at the countable scales np^3=2^jK . For any finite list, finite edge-coordinate convergence transfers the inequalities, with slightly enlarged constants, to counts of limiting points below (2^jK)^ 2/3 . A fixed small buffer in the endpoints may be used; the limiting process has no point at any of these countably many fixed endpoints. Increase the finite list and use continuity of probability for decreasing events. The uniform finite- n event shows that all the limiting inequalities hold with probability arbitrarily close to one when K is large. Letting that failure probability tend to zero shows that almost surely, after a finite threshold, cL^ 3/2 ≤# i:g_i≤L ≤CL^ 3/2 on dyadic L , and hence on all large L by monotonicity. Invert these inequalities, add b , and adjust the bounds for the finitely many remaining positive numbers g_i+b . The least integer threshold and rational bounds give measurable choices.

评论0

登录后可以评论,指出这条推演中的逻辑错误。

还没有评论。发现逻辑漏洞?第一个指正吧。