Reviewed on 21 November 2026. This audit reconstructs the calculation from the Legendre differential equation. It does not infer an infinite statement from sampled quadrature rules.
Verdict and scope
The proposed disproof of Conjecture 3 passes. For every sufficiently large even degree, the smallest positive primary node violates the asserted upper bound. The fourth-order coefficient is strictly positive. Thus restricting the inequality to sufficiently large degrees would not repair it.
The exact two-point rule also disproves Conjecture 7 as written. The calculation below establishes eventual failure only for Conjecture 3; it makes no corresponding eventual claim for Conjecture 7.
This is a mathematical audit. Historical priority requires the separate literature audit.
Exact source conventions
The primary source is Óscar López Pouso and Javier Segura, Uniform relations between the Gauss–Legendre nodes and weights, Journal of Inequalities and Applications 2025, article 40, published 20 March 2025.
Section 4, equations (13) and (14), defines the cumulative nodes and their midpoints by
Conjecture 3 asserts, at all defined ratios,
For even , symmetry gives and , as the source's Remark 1 states. The conjectured inequality itself has no eventual-degree restriction. Remark 2 explicitly excludes ratios of the form , so such ratios are not counterexamples.
Conjecture 7 uses and asserts the same upper bound for .
Exact low-degree obstruction
For , the nodes are and both weights are . Consequently , , and . Both conjectured error ratios equal
The first comparison follows from . For the second, gives , with the last integer comparison . Since , both asserted upper bounds fail exactly.
Independent reconstruction of the central asymptotics
Put and normalize the even Legendre polynomial by
Substitution into gives the exact equation
The coefficient is analytic in near zero on a fixed compact interval containing . Analytic dependence of the initial-value problem, together with the simple zero of at , justifies expansion of the solution, its derivative, and its nearby zero, with uniform remainders. Uniform convergence to on the interval before that zero ensures this is the smallest positive zero when is small.
Writing , the coefficient equations and the initial conditions give
In particular and , which directly verifies both correction terms.
Let be the first positive zero. Expanding the equation gives
and differentiating the displayed solution gives
The exact central value and Stirling's expansion, with , give
These coefficients were also reconstructed by squaring the central-binomial expansion in and substituting .
At the corresponding node , the derivative transformation and the exact Gaussian weight formula yield
Multiplying the expansions, all nongeometric terms cancel through order :
The positive coefficient therefore makes the conjectured strict upper bound fail for every sufficiently large even degree. The leading coefficient remains correct, so this disproof does not contradict the source's leading-order asymptotic relation.
Checks and limitations
The transformation, coefficient equations, root expansion, derivative square, amplitude conversion, and final multiplication were independently derived. Local symbolic algebra checked the polynomial identities; it was not used to estimate an infinite tail. The analytic remainder follows from the differential equation and the implicit-function theorem. No Lean work was performed.
The separately proposed Bessel-sequence results and the classical interlacing assertion are outside this audit. They cannot be inferred to fail from this counterexample.