Pith. sign in

REVIEW 3 major objections 5 minor 8 references

Zeros of orthogonal little q-Jacobi polynomials: interlacing and monotonicity

T0 review · 3 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The paper proves that zeros of little q-Jacobi polynomials are q-separated, interlace under parameter shifts, and move monotonically with parameters.

desk verdict New interlacing results for little q-Jacobi zeros that are worth taking seriously, but the interlacing half rests on an unproved extension of Theorem A to positive b; the authors owe the referee that argument. read the letter →

arxiv 2506.05492 v1 pith:FD7SBNH3 submitted 2025-06-05 math.CA

Andrei Martinez-Finkelshtein , Rafael Morales , Daniel Perales This is my paper
classification math.CA MSC 33C4533C2042C0546L54
keywords littleq-Jacobipolynomialszerointerlacinglogarithmicmeshmonotonicityofzerosq-hypergeometricq-BesselStieltjes-Wigertq-differenceequations
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper proves that the real zeros of the little $q$-Jacobi polynomials $p_n(x;a,b)$ obey sharp spacing and ordering laws. In the orthogonality regime $0

What carries the argument

The logarithmic mesh, $\operatorname{lmesh} p = \max_{1\le j\le n-1} \lambda_j(p)/\lambda_{j+1}(p)$, and the classes $P^q_n((0,1))$ of positive-root polynomials with mesh below $q$. The paper uses the equivalence $p\in P^q_n(\mathbb{R}_{>0})$ iff $p(x)\prec p(qx)$ and the lemma that a common interlacer plus the partial order $\ll$ upgrades to interlacing $\prec$. The $q$-derivative sends $p_n(x;a,b)$ to a constant multiple of $p_{n-1}(x;qa,qb)$, so a mesh bound immediately yields the first interlacing; contiguous relations (40)--(43), combined with an interlacing-transfer lemma for linear combinations, produce the parameter-shift interlacings.

What would settle it

Test Theorem A's relations (23)--(25) numerically for a small instance, for example $n=3$, $q=0.5$, $a=1$, $b=0.4$, by computing the zeros of $p_n(x;a,b)$, $p_n(x;qa,qb)$, $p_n(x;q^2a,b)$, and $p_n(x;a,q^2b)$. If relation (25), or the derived interlacing $p_n(x;a,q^2b)\prec p_n(x;q^2a,b)$, fails for $b>0$, the argument for Theorem 3.2(ii) is unsupported; a single counterexample would settle the question.

Watch

Extended reading notes

Core claim

The central claim is that the zero set of a little $q$-Jacobi polynomial is completely ordered by the parameter pair $(a,b)$: the polynomial $p_n(x;a,q^2b)$ interlaces $p_n(x;q^2a,b)$, $p_n(x;a,b)$ interlaces $p_{n-1}(x;qa,qb)$, and for $b<0$ similarly $p_n(x;a,b)\prec p_n(x;a,q^2b)$. Theorem 3.1 supplies the underlying monotonicity: for fixed $n,q$, zeros increase with $b$ and decrease with $a$. The lmesh statement $p_n(x;a,b)\in P^q_n((0,1))$ is the quantitative engine: each zero is separated from the next by a ratio smaller than $q$, which is exactly what makes interlacing proofs go through. The paper further shows that in non-orthogonal cases $b=q^{-k}$ and $a=q^{-k}$ the polynomial factors as an explicit product, so membership in $P^q_n((0,1))$ survives, and it treats $q$-Bessel and $1\phi_1$, $2\phi_0$, $2\phi_1$ families as limits or transformations.

Load-bearing premise

The proof leans on an unproved extension: interlacing relations known only for negative $b$ are asserted to hold for all positive $b<1/q$ 'by the same arguments,' and the new positive-$b$ interlacing conclusions collapse if that extension fails.

Editorial extensions

If this is right

  • For every admissible $a,b$, $p_n(x;a,b)\in P^q_n((0,1))$, so consecutive zeros satisfy $\lambda_j/\lambda_{j+1}<q$ and the zeros are strictly $q$-separated.
  • The interlacing $p_n(x;a,b)\prec p_{n-1}(x;qa,qb)$ means the $q$-derivative of a little $q$-Jacobi polynomial has zeros that separate exactly one zero of the original polynomial.
  • Corollary 3.3 gives $p_n(x;a,t_1b)\prec p_n(x;t_2a,b)$ for $q^2\le t_1,t_2\le 1$, $t_1t_2\ne 1$, producing a continuum of interlacing relations by scaling parameters.
  • The limit families inherit the structure: $q$-Bessel polynomials have strict mesh $<q$ for $b<0$ and interlace under $t$-scaling, while Stieltjes-Wigert polynomials lie in $P^{q^2}_n(\mathbb{R}_{>0})$.
  • The monotonicity theorem supplies the partial order behind these interlacings and suggests a discrete electrostatic model in which zeros move monotonically with $a$ and $b$.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • This reader's inference: the same proof architecture---mesh bound plus a common interlacer supplied by a contiguous relation---should produce interlacing theorems for any one-parameter $q$-orthogonal family with a $q$-difference equation, so the paper's method is a template beyond little $q$-Jacobi polynomials.
  • A direct numerical test of (23)--(25) for positive $b$ would settle the paper's most exposed gap; such a check is inexpensive and independent of the analytic proof.
  • The strict mesh bound for $q$-Bessel zeros, proved by ruling out two zeros with ratio exactly $q$, implies quantitative lower bounds on zero spacings in that family, which could be compared with asymptotic formulas for $q$-Bessel functions.
  • Because the monotonicity laws are obtained from a ratio of discrete weights, differentiating that ratio suggests explicit formulas for the rate at which each zero moves as $b$ changes, a testable refinement the paper does not pursue.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper studies the real zeros of little q-Jacobi polynomials p_n(x;a,b) and related q-hypergeometric families. It claims monotonicity of the zeros with respect to the parameters a and b (Theorem 3.1), strong interlacing relations (Theorem 3.2, Corollary 3.3), membership in the logarithmic-mesh classes P^q_n((0,1)), and analogous results for q-Bessel, 1phi1, 2phi1, and 2phi0 polynomials. The monotonicity proof is a direct application of a standard ratio-monotonicity criterion for the orthogonality weight. The interlacing results are derived from contiguous relations, the q-derivative, Lemma 4.1, and a stated but unproved extension of known interlacing relations (Theorem A) to positive values of b.

Significance. If the interlacing and monotonicity statements are fully established, the paper makes a useful contribution to the zero theory of q-orthogonal polynomials: it introduces the logarithmic mesh as a classification tool, extends and corrects earlier partial results of Gochhayat et al. and Tcheutia et al., and transfers the new structural information to q-Bessel, Stieltjes-Wigert, and general 2-phi-1 and 2-phi-0 families. The monotonicity part (Theorem 3.1) is clean, self-contained, and does not depend on the questionable extension of Theorem A. The interlacing results would be the main novelty, but their current proofs rest on an unproved assertion and on two additional argumentative gaps.

major comments (3)
  1. [§3.1, Theorem A, equations (23)–(25)] Theorem A is stated for all 0<aq<1 and bq<1, but the authors note that [8] proved it only for b<0 and that the general statement 'follows using the same arguments' without providing those arguments. This is load-bearing: in the proof of Theorem 3.2, equation (23) supplies the common interlacer p_{n-1}(x;a,qb) for the lmesh claim, equation (24) is used in (51) and in the derivation of (52), and equation (25) produces the chain (48). Since the partial order ≺ lacks transitivity, none of these conclusions can be recovered from Theorem 3.1 alone. The paper should either give a complete proof of Theorem A for 0<b<1/q or explicitly restrict the new interlacing results to the range b<0 where Theorem A is proved.
  2. [§4.2, proof of Theorem 3.2(ii), around equations (48)–(50)] The second inequality in (48), p_n(x;qa,qb) ≺ p_n(x;q^2a,b), is obtained by applying Theorem A (25) with a replaced by qa and b replaced by b/q. This application requires b<1, not merely bq<1. For parameters satisfying bq<1 but 1≤b<1/q, which are allowed by the theorem's hypotheses, the stated assumptions do not justify (48), and therefore equation (50) and the conclusion p_n(x;a,q^2b) ≺ p_n(x;q^2a,b) are not established. The authors need a separate argument for the range b≥1 or should restrict the statement of Theorem 3.2(ii).
  3. [§4.3, proof of Corollary 3.3] After the chain of componentwise inequalities p_n(x;a,q^2b) ≪ p_n(x;a,t1b) ≪ p_n(x;t2a,b) ≪ p_n(x;q^2a,b), the conclusion p_n(x;a,t1b) ≺ p_n(x;t2a,b) does not follow from the endpoint interlacing p_n(x;a,q^2b) ≺ p_n(x;q^2a,b). The relation ≺ is not transitive, and no common interlacer for the two middle polynomials is exhibited. The sentence 'By Theorem 3.2(i), p_n(x;a,q^2b) ≺ p_n(x;q^2a,b)' also mislabels the result (it is Theorem 3.2(ii), not (i)). Since Corollary 3.3 is used to derive the interlacing statements (38) and (39) and the corresponding rows of Table 1, the proof must be repaired, for example by identifying an explicit common interlacer and invoking Remark 2.3.
minor comments (5)
  1. [§4.2, Proposition 4.2, equation (41)] The proof of the contiguous relation (41) is only sketched, with the coefficient equality reduced to an algebraic identity that is not derived; since (41) is not used in the subsequent arguments, the authors should either provide the full verification or omit the identity.
  2. [§4.3, proof of Proposition 3.4] The sentence 'by the orthogonality that p_{n-j}(x;a,q^j) ∈ P^q_n((0,1))' should cite Theorem 3.2 (the lmesh bound) rather than orthogonality alone, since orthogonality gives only the location of the zeros in (0,1), not the logarithmic-mesh bound.
  3. [§4.3, proof of Corollary 3.3] The reference to 'Theorem 3.1(iii)' in the proof of part (ii) should read 'Theorem 3.2(iii)'.
  4. [§4.3, proof of Theorem 3.6] There are two typographical slips: 'logaritmic mesh' should be 'logarithmic mesh' and 'this inequity is strict' should be 'this inequality is strict'.
  5. [Table 1] The layout of Table 1 is difficult to read: the columns labeled 'a', 'b', 'Roots in', and 'lmesh' are not visually separated, and some entries, such as '−∞, bqn−1' and 'b, bq, . . . , bqn−1', are hard to parse. Please reformat the table for clarity.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the paper’s new interlacing and monotonicity results are derived from external theorems and proved relations, not from their own conclusions.

full rationale

The derivation chain is self-contained against the stated external inputs. Theorem 3.1 (monotonicity in a and b) is proved directly from the monotone likelihood-ratio property of the orthogonality weight in (15), with no fitted parameter. Theorem 3.2 is proved using the external interlacing result Theorem A, the standard q-difference/contiguous relations (40)–(43), Proposition 2.6, and Lemma 4.1; the proof does not redefine the target interlacing as an assumption. The only self-citation is [1], used for the standard fact that the partial-order ≪ is preserved under differentiation, which is not load-bearing for any central claim. The skeptical concern that the extension of Theorem A from b<0 to all bq<1 is asserted without proof is a genuine correctness gap: if (23)–(25) fail for some 0<b<1/q, parts of Theorem 3.2 and Corollary 3.3 could lose support. But this is reliance on an unproved assertion about an external result, not circularity: Theorem A is not the same statement as the new theorems, and the new proofs use common-interlacer arguments rather than equating their conclusions with (23)–(25). No prediction reduces to a fit, and no target-conditional normalization is present. Score 0.

Assumptions & free parameters 0 free parameters · 8 assumptions · 0 invented entities

The paper rests on standard q-hypergeometric theory and external interlacing lemmas; no free parameters or invented entities appear. The most fragile input is the asserted extension of Theorem A to positive b, listed here as a domain assumption.

assumptions (8)
  • domain assumption Little q-Jacobi orthogonality: for 0<aq<1 and bq<1, p_n(x;a,b) is orthogonal on (0,1) with respect to the discrete measure in (15).
    Used in Section 2.2 and in the proof of Theorem 3.1 to apply the zero-monotonicity lemma.
  • domain assumption Theorem A interlacing relations (23)-(25), including the authors' extension from b<0 to 0<b<1/q.
    Cited from [8] for b<0; the positive-b extension is asserted in Section 3.1 and used in the common-interlacer arguments of Theorem 3.2.
  • standard math Jordaan-Toókos interlacing lemma (Lemma 4.1) for sign-constant linear combinations of interlacing polynomials.
    Used throughout the proof of Theorem 3.2 to extract interlacing relations from contiguous relations.
  • standard math Logarithmic mesh characterization and q-derivative interlacing (Proposition 2.6, from [6]).
    Used to derive p_n in P^q and statement (i) of Theorem 3.2.
  • standard math q-hypergeometric transformation identities (31)-(33) from [5].
    Used in Section 3.2 to transfer zero results among 1phi1, 2phi1, and 2phi0 families.
  • standard math q-Bessel q-difference equation (59) from [5, (14.22.3)].
    Used in the proof of Theorem 3.6 to rule out mesh exactly equal to q by iterating a zero chain.
  • standard math Zero monotonicity lemma for weights with monotone ratio [3, Lemma 2].
    Used in Theorem 3.1; the weight-ratio derivatives are computed in Section 4.1.
  • standard math Convergence lemma (Lemma 2.5) for limits of interlacing and mesh properties.
    Used to pass from little q-Jacobi polynomials to q-Bessel and Stieltjes-Wigert limits.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Zeros of orthogonal little q-Jacobi polynomials: interlacing and monotonicity." pith.science (2026). https://pith.science/paper/FD7SBNH3

@misc{pith2026250605492,
  author       = {Pith},
  title        = {Pith review of: Zeros of orthogonal little q-Jacobi polynomials: interlacing and monotonicity},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/FD7SBNH3}},
  note         = {Machine review of arXiv:2506.05492}
}
read the original abstract

We investigate the distribution of zeros of the little q-Jacobi polynomials and related q-hypergeometric families. We prove that the zeros of these orthogonal polynomials exhibit strong interlacing properties and obey natural monotonicity rules with respect to the parameters. A key tool in our approach is the logarithmic mesh, which quantifies the relative spacing of the positive real zeros and allows us to classify families of polynomials with prescribed interlacing patterns. Our results include new interlacing relations, monotonicity with respect to parameters, and structural decompositions in non-orthogonal regimes. Several classical families of q-hypergeometric polynomials, including q-Bessel and Stieltjes-Wigert polynomials, are treated as limit cases. The methods rely on a combination of classical orthogonality theory and q-difference equations.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

8 extracted references · 7 canonical work pages

  1. [3]

    Gochhayat, K

    P. Gochhayat, K. Jordaan, K. Raghavendar, and A. Swaminathan. Interlacing properties and bounds for zeros of 2ϕ1 hypergeometric and littleq-Jacobi polynomials.The Ramanujan Journal, 40:45–62, 2016

    work page 2016

  2. [8]

    Tcheutia, A

    D. Tcheutia, A. Jooste, and W. Koepf. Mixed recurrence equations and interlacing properties for zeros of sequences of classicalq-orthogonal polynomials.Applied Numerical Mathematics, 125:86–102, 2018. (AMF)Department of Mathematics, Baylor University, TX, USA, and Department of Mathemat- ics, University of Almería, Spain Email address:a_martinez-finkelsht...

    work page 2018

  3. [1]

    Arizmendi, K

    O. Arizmendi, K. Fujie, D. Perales, and Y. Ueda. S-transform in finite free probability.Preprint arXiv:2408.09337, 2024

    arXiv 2024

  4. [2]

    D. K. Dimitrov. A late report on interlacing of zeros of polynomials. InConstructive theory of functions, pages 69–79. Prof. M. Drinov Acad. Publ. House, Sofia, 2012

    work page 2012

  5. [4]

    Jordaan and F

    K. Jordaan and F. Toókos. Interlacing theorems for the zeros of some orthogonal polynomials from different sequences.Applied numerical mathematics, 59(8):2015–2022, 2009

    work page 2015

  6. [5]

    Koekoek, P

    R. Koekoek, P. Lesky, and R. F. Swarttouw.Hypergeometric orthogonal polynomials and their q-analogues. Berlin: Springer, 2010

    work page 2010

  7. [6]

    Lamprecht

    M. Lamprecht. Suffridge’s convolution theorem for polynomials and entire functions having only real zeros. Advances in Mathematics, 288:426–463, 2016

    work page 2016

  8. [7]

    D. S. Moak. Theq-analogue of the Laguerre polynomials.Journal of Mathematical Analysis and Applications, 81(1):20–47, 1981

    work page 1981

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.