Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

A counterexample to the sum-condition lower bound

Abstract

A convergent hypergeometric series contradicts the sum-condition Luke lower bound.

Definition 1.1 (The generalized hypergeometric summand).

Formalization. D5/S3/Analytic/KarpSitnikLuke/Result.hyperTerm (✓ std3).

Citation. D. Karp and S. M. Sitnik (2009). Inequalities and monotonicity of ratios for generalized hypergeometric function. DOI: 10.1016/j.jat.2008.10.002. URL: https://arxiv.org/abs/math/0703084.

Commentary.

Equation (1), printed page 1 of arXiv:math/0703084v2, defines the generalized hypergeometric series by the product of upper rising factorials divided by the product of lower rising factorials and n!, multiplied by z^n. The upper list here is sigma followed by a, and the lower list is b. The existing pochRatio is precisely the quotient of the products for a and b. Mathlib’s (ascPochhammer R n).eval t equals the source’s (t)n=t(t+1)…(t+n−1), with value one at n=0. Thus hyperTerm is the source’s summand, with no Gamma normalization factor.

Definition 1.2 (The power-series value).

Formalization. D5/S3/Analytic/KarpSitnikLuke/Result.hyper (✓ std3).

Citation. D. Karp and S. M. Sitnik (2009). Inequalities and monotonicity of ratios for generalized hypergeometric function. DOI: 10.1016/j.jat.2008.10.002. URL: https://arxiv.org/abs/math/0703084.

Commentary.

The real tsum interprets equation (1) inside its convergence disk. Printed page 1 states: “The series converges for |z| < 1 and can be analytically continued onto the entire complex plane cut along [1, ∞].” Summability is an explicit assumption of the assertion below, and is proved for the counterexample.

Definition 1.3 (The sum-condition assertion inside the disk).

Formalization. D5/S3/Analytic/KarpSitnikLuke/Result.claim (✓ std3).

Citation. D. Karp and S. M. Sitnik (2009). Inequalities and monotonicity of ratios for generalized hypergeometric function. DOI: 10.1016/j.jat.2008.10.002. URL: https://arxiv.org/abs/math/0703084.

Commentary.

Theorem 3, printed page 6, equation (23), with the displayed formula joined to its sentence: “For bₖ > aₖ > 0, k = 1, . . . , q, x > −1 and σ ≥ 1 the inequality 1/(1 + x ∏ᵢ₌₁ᵠ (aᵢ/bᵢ))^σ < _{q+1}F_q(σ, (a_q); (b_q); −x) holds true.”

Conjecture 1, printed page 14: “Theorem 3 is true for all σ > 0 and ∑ᵢ₌₁ᵠ (bᵢ − aᵢ) > 0.”

All a and b entries are positive; the conjecture replaces the componentwise inequalities by positivity of the sum of b−a. The assertion is restricted to −1<x<1, the power-series disk at z=−x, and assumes summability and a positive real-power base. These restrictions give a weaker assertion than the paper’s x>−1 assertion via analytic continuation. Refuting this weaker assertion therefore refutes the paper’s Conjecture 1. For q=0 the positive-sum assumption is impossible; including it adds no cases. Real powers use Real.rpow.

Definition 1.4 (Positive magnitudes of the witness summands).

Formalization. D5/S3/Analytic/KarpSitnikLuke/Result.u (✓ std3).

Source. Repository-derived.

Commentary.

The magnitudes are n!/((1/10)n(n+1)) times (1/10)^n. Natural indices in real expressions are coerced to real numbers.

Theorem 1.5 (Nonnegative magnitudes).

Proof. Machine-checked in Lean as D5/S3/Analytic/KarpSitnikLuke/Result.u_nonneg (✓ std3). ∎

Source. Repository-derived.

Commentary.

The rising factorial at 1/10 and the factorial are positive, and the power is nonnegative.

Theorem 1.6 (The exact successive-term ratio).

Proof. Machine-checked in Lean as D5/S3/Analytic/KarpSitnikLuke/Result.u_step (✓ std3). ∎

Source. Repository-derived.

Commentary.

The factorial and rising-factorial recurrences give u(n+1)/u(n)=(n+1)^2/(10(n+1/10)(n+2)).

Theorem 1.7 (A uniform geometric comparison).

Proof. Machine-checked in Lean as D5/S3/Analytic/KarpSitnikLuke/Result.u_half (✓ std3). ∎

Source. Repository-derived.

Commentary.

For every natural n the ratio is at most one half: the denominator comparison reduces to 4n^2+(17/2)n≥0. In particular the magnitudes decrease from the first term onward.

Theorem 1.8 (Absolute convergence of the magnitudes).

Proof. Machine-checked in Lean as D5/S3/Analytic/KarpSitnikLuke/Result.u_summable (✓ std3). ∎

Source. Repository-derived.

Commentary.

The ratio bound one half implies summability by the geometric comparison test.

Theorem 1.9 (The exact witness summands).

Proof. Machine-checked in Lean as D5/S3/Analytic/KarpSitnikLuke/Result.term_eq (✓ std3). ∎

Source. Repository-derived.

Commentary.

At q=2, sigma=1, a=(1,1), b=(1/10,2) and z=−1/10, the identities (1)n=n! and (2)n=(n+1)! cancel the factorial weights. The resulting term is (−1)^n u(n).

Theorem 1.10 (Convergence at the counterexample).

Proof. Machine-checked in Lean as D5/S3/Analytic/KarpSitnikLuke/Result.witness_summable (✓ std3). ∎

Source. Repository-derived.

Commentary.

The exact summand identity and summability of the magnitudes imply convergence of the alternating hypergeometric series.

Theorem 1.11 (The hypergeometric value is below two thirds).

Proof. Machine-checked in Lean as D5/S3/Analytic/KarpSitnikLuke/Result.witness_upper (✓ std3). ∎

Source. Repository-derived.

Commentary.

The antitone alternating-series upper bound uses indices zero, one and two: 1−1/2+2/33=37/66<2/3. Summability identifies the limit with the real tsum.

Theorem 1.12 (Refutation of the conjectured extension).

Proof. Machine-checked in Lean as D5/S3/Analytic/KarpSitnikLuke/Result.result (✓ std3). ∎

Resolves. Problems/karp-sitnik-2009-luke-lower-bound (refuted) by D5/S3/Analytic/KarpSitnikLuke/Result.result.

Source. Repository-derived.

Acknowledgement. D. Karp and S. M. Sitnik (2009). Inequalities and monotonicity of ratios for generalized hypergeometric function. DOI: 10.1016/j.jat.2008.10.002. URL: https://arxiv.org/abs/math/0703084.

Commentary.

Take q=2, sigma=1, a=(1,1), b=(1/10,2), x=1/10. The parameters are positive, the sum of b−a is 1/10, and the product of a/b is 5. The real-power base is 3/2, so the proposed lower bound is 2/3. The convergent series value is at most 37/66, contradicting the strict lower-bound assertion. This counterexample uses sigma=1 and violates the componentwise condition b1>a1. It does not contradict Theorem 3 under that theorem’s original hypotheses, and does not address the componentwise case 0<sigma<1 or Conjecture 2.

References