The batch 50 to 51

Sendov.R_le_batch bounds every R n α for 50 ≤ n ≤ 51 by the elementary part and moment at n₀ = 50 together with the prefactor at n₁ = 51, so one moment and one certificate serve all 2 degrees. The certificate has degree 48, set by n₀ rather than n₁.

Feasibility at n₀ is proved rather than assumed: for n ≥ 36 it follows from 0 ≤ α ≤ 17, since A - c² increases with n. This matters because feasibility propagates upward in n, so it could not be inherited from the hypothesis at n.

The moment numerator Nmomc is checked against the packed recurrence (Sendov.pev_wsum_eq_of_packed), and the numerator Sendov.batchP 50 51 23 Lc Nmomc of 1 - bound is certified positive on [0, 17] by its Bernstein coefficients Bc (Sendov.pev_pos_of_bern). Every closed computation is evaluated by the kernel.

def Sendov.Batch50To51.Lc : ℤ

The common denominator L of the moment weights: j + 4 ∣ L for every j < 2k + 1.

Equations

• Sendov.Batch50To51.Lc = 3099044504245996706400

def Sendov.Batch50To51.betac : ℤ

The base β at which polynomials in α are packed: it exceeds twice the absolute value of every coefficient of Nmomc and of the weighted row sum wsum Lc 0 (qrow …).

Equations

• Sendov.Batch50To51.betac = Sendov.big [235006444834003773194078594346278954074399321062636764811967835770189517023966542377779201, 33981]

def Sendov.Batch50To51.tauc : ℤ

The base τ at which the recurrence rows, evaluated at betac, are packed into a single integer exponentiation: it exceeds twice the absolute value of every row entry.

Equations

• One or more equations did not get rendered due to their size.

def Sendov.Batch50To51.Nmomc : List ℤ

The moment numerator at n₀ = 50, k = 23.

Equations

• One or more equations did not get rendered due to their size.

def Sendov.Batch50To51.Bc : List ℤ

Bernstein coefficients of 17 ^ 48 * batchP 50 51 23 Lc Nmomc on [0, 17].

Equations

• One or more equations did not get rendered due to their size.

theorem Sendov.Batch50To51.c_lo {α : ℝ} (hα : 0 ≤ α) : c 50 α = (294 + 43 * α - 2 * α ^ 2) / (98 * (3 + α))

theorem Sendov.Batch50To51.c_lo_nonneg {α : ℝ} (hα : 0 ≤ α) (hU : α ≤ 17) : 0 ≤ c 50 α

c is nonnegative at n₀ on the batch's α-range. This replaces feasibility at n₀, which for n₀ < 36 does not follow from α ≤ 17.

theorem Sendov.Batch50To51.pev_Nmomc (α : ℝ) : pev Nmomc α = pev (wsum Lc 0 (qrow (gg0 50) (gg1 50) (gg2 50) 23)) α

theorem Sendov.Batch50To51.integral_lo (α : ℝ) (hα : 0 ≤ α) : ∫ (t : ℝ) in 0..1, t ^ 3 * Q 50 α t ^ 23 = pev Nmomc α / (↑Lc * (2 * M 50 * (3 + α)) ^ 23)

theorem Sendov.Batch50To51.P_pos {α : ℝ} (hα : 0 ≤ α) (hU : 1 * α ≤ 17) : 0 < pev (batchP 50 51 23 Lc Nmomc) α

The certificate: batchP 50 51 23 Lc Nmomc is positive on [0, 17].

theorem Sendov.Batch50To51.finite_range {n : ℕ} (h0 : 50 ≤ n) (h1 : n ≤ 51) {α : ℝ} (hα : 0 ≤ α) (hα' : α ≤ 17) (hfeas : c n α ^ 2 ≤ A n α) : R n α < 1

The batch 50 ≤ n ≤ 51.