Yoshida’s Rapid-Decrease Question
Abstract
A positive sequence satisfies Yoshida’s rapid-decrease inequalities but its first Turan transform does not.
Definition 1.1 (Rapid decrease).
Formalization. D5/S0/Certificates/YoshidaRapidDecreaseRefutation.RapidlyDecreasing (✓ std3).
Citation. Rintaro Yoshida (2010). On some questions of Fisk and Brändén. DOI: 10.48550/arXiv.1005.4218. URL: https://arxiv.org/abs/1005.4218v1.
Commentary.
Definition 29 (p. 10): “A sequence of positive real numbers is called rapidly decreasing, if the sequence satisfies the following condition , for .”
The sequence a has natural indices, all its terms are positive, and one real alpha satisfies the threshold and every inequality at k>=1.
Definition 1.2 (The transformed coefficients).
Formalization. D5/S0/Certificates/YoshidaRapidDecreaseRefutation.sCoeff (✓ std3).
Citation. Rintaro Yoshida (2010). On some questions of Fisk and Brändén. DOI: 10.48550/arXiv.1005.4218. URL: https://arxiv.org/abs/1005.4218v1.
Commentary.
Open Problem 5 (p. 11) writes Sᵣ[f(x)]=∑ₖ₌₀∞ (aₖ²−aₖ₋ᵣaₖ₊ᵣ)xᵏ:=∑ₖ₌₀∞ bₖxᵏ. The function sCoeff(a,r) is the coefficient sequence of S_r[f]. Definition 8 (p. 3) sets “and aⱼ=0 if j∉{0,1,…,n}.” Only negative indices are outside an infinite sequence. The conditional ite returns zero at negative indices and a(Int.toNat(j)) otherwise. Both k and r are natural numbers; the two shifted indices are cast to integers before subtraction and addition.
Definition 1.3 (Open Problem 5).
Formalization. D5/S0/Certificates/YoshidaRapidDecreaseRefutation.claim (✓ std3).
Citation. Rintaro Yoshida (2010). On some questions of Fisk and Brändén. DOI: 10.48550/arXiv.1005.4218. URL: https://arxiv.org/abs/1005.4218v1.
Commentary.
Open Problem 5 (p. 11): “Let where is a rapidly decreasing sequence. If , is it true that is a rapidly decreasing sequence?”
A power series is represented by its coefficients a. The first conjunct asserts existence of such a sequence; the second asserts closure for every such sequence and every positive natural r. The predicate RapidlyDecreasing and the function sCoeff are expanded above.
Theorem 1.4 (A negative answer).
Proof. Machine-checked in Lean as D5/S0/Certificates/YoshidaRapidDecreaseRefutation.result (✓ std3). ∎
Resolves. Problems/yoshida-rapid-decrease (refuted) by D5/S0/Certificates/YoshidaRapidDecreaseRefutation.result.
Source. Repository-derived.
Acknowledgement. Rintaro Yoshida (2010). On some questions of Fisk and Brändén. DOI: 10.48550/arXiv.1005.4218. URL: https://arxiv.org/abs/1005.4218v1.
Commentary.
Take aₖ=48ᵏ/32^(k choose 2) and r=1. Every a_k is positive, a_0=1 and a_1=48. The adjacent identity aₖ₊₁²=32aₖaₖ₊₂ gives rapid decrease with alpha=4 sqrt(2). The first transformed coefficients are 1, 2232 and 5022. The output inequality at index 1 forces alpha squared to be at most 992. Its threshold forces alpha squared to be at least 1117+sqrt(2233), which is larger. This contradiction concerns the coefficient question; it asserts no failure of Laguerre-Polya membership.
References
- Truth anchor:
D5/S0/Certificates/YoshidaRapidDecreaseRefutation.RapidlyDecreasing - Truth anchor:
D5/S0/Certificates/YoshidaRapidDecreaseRefutation.claim - Truth anchor:
D5/S0/Certificates/YoshidaRapidDecreaseRefutation.result - Truth anchor:
D5/S0/Certificates/YoshidaRapidDecreaseRefutation.sCoeff