{"id":"d786e57f-84ec-4bf2-80af-019045d01a97","arxiv_id":"2506.05492","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Zeros of little q-Jacobi polynomials have q-controlled logarithmic spacing, interlace under parameter shifts, and increase in b while decreasing in a.","lead":"This paper proves new spacing and interlacing laws for the zeros of little q-Jacobi polynomials, a family of q-hypergeometric orthogonal polynomials. The results give rigorous monotonicity in the polynomial parameters and controlled logarithmic gaps, with limit consequences for q-Bessel and Stieltjes-Wigert polynomials.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The new interlacing results in Theorem 3.2 and Corollary 3.3 rest on Theorem A for 0<b<1/q, which is asserted but not proved; a failure of (23)–(25) for positive b would leave the central claims unsupported.","rationale":"The manuscript's central novel assertions are the interlacing relations in Theorem 3.2 and their corollaries. The proof of Theorem 3.2 explicitly invokes relations from Theorem A for parameter regimes in which the cited source [8] is acknowledged not to prove them. Since the authors' own text admits the gap, this is not an artifact of the review pipeline; it is the single least-secure step. I checked the other proof components: Theorem 3.1's monotonicity argument via weight ratios is standard and its sign computations are correct; the q-derivative step for Theorem 3.2(i) is valid; the q-Bessel limit in Theorem 3.6 is coherent; Proposition 3.4's induction using (42)–(43) checks out. The only remaining worry is the unproved extension of Theorem A to positive b. If the extension is true, the paper's conclusions are very likely correct. The proposed test—reproducing the proof for positive b, with a numerical spot-check as a falsifier—would settle the issue.","tokens_in":14335,"tokens_out":18572,"duration_ms":190778,"concrete_test":"Independently re-derive (23)–(25) for 0<b<1/q by repeating the proof of [8, Theorem 12(d),(e)] without the restriction b<0. The concrete check is to verify that every coefficient in the contiguous-relation combinations used there, for example (1−abq^{2n+2}), (1−bq^{n+1}), and (1−aq^n) in (40)–(43), has a fixed sign on {0<aq<1, 0<bq<1}; a sign change at some parameter point would invalidate the corresponding Lemma 4.1 application. As a falsification check, compute the zeros of p_2 and p_3 for q=0.5, a=1, b=0.25, 0.5, 1.2 and test (23)–(25) directly; any single violation disproves the asserted extension.","verdict_should_be":"UNCHANGED","load_bearing_attack":"In Section 3.1 the authors state Theorem A, including relations (23)–(25), for all 0<aq<1 and bq<1, then note that [8] proved it only for b<0 and that 'the general statement follows using the same arguments'. No proof is supplied. Those relations are used exactly in the unproved regime: (23) provides the common interlacer p_{n-1}(x;a,qb) in the proof of p_n∈P^q_n((0,1)) (Section 4.2); (24) yields (51); (25) yields the chain (48) and, together with (24), the common interlacer p_{n-1}(x;q^2a,q^2b) used to conclude Theorem 3.2(ii). Because the partial order ≺ is not transitive, Theorem 3.1 alone cannot supply (48) or the strict interlacing. Thus, if any of (23)–(25) fails for some 0<b<1/q, Theorem 3.2(i)–(ii), Corollary 3.3, and the rows of Table 1 derived from them lose their support. Monotonicity (Theorem 3.1) is independent and would survive.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","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.","tokens_in":14554,"tokens_out":8907,"duration_ms":90241,"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":[{"comment":"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.","section":"§3.1, Theorem A, equations (23)–(25)"},{"comment":"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).","section":"§4.2, proof of Theorem 3.2(ii), around equations (48)–(50)"},{"comment":"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.","section":"§4.3, proof of Corollary 3.3"}],"minor_comments":[{"comment":"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.","section":"§4.2, Proposition 4.2, equation (41)"},{"comment":"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.","section":"§4.3, proof of Proposition 3.4"},{"comment":"The reference to 'Theorem 3.1(iii)' in the proof of part (ii) should read 'Theorem 3.2(iii)'.","section":"§4.3, proof of Corollary 3.3"},{"comment":"There are two typographical slips: 'logaritmic mesh' should be 'logarithmic mesh' and 'this inequity is strict' should be 'this inequality is strict'.","section":"§4.3, proof of Theorem 3.6"},{"comment":"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.","section":"Table 1"}],"recommendation":"major_revision","confidential_remarks":"The central monotonicity theorem is sound and self-contained, but the interlacing results Theorems 3.2 and Corollary 3.3 and the derived Table 1 rows currently rest on three fixable but real gaps: the unproved positive-b extension of Theorem A, the unjustified passage from b<1 to bq<1 in the proof of Theorem 3.2(ii), and the missing common-interlacer step in Corollary 3.3. The authors should be asked to close these gaps before the paper can be accepted. If the extension of Theorem A to positive b is not true, the paper's scope would need to be narrowed to b<0, which would substantially reduce the claimed generality."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Punchline: the paper proves genuinely new monotonicity and interlacing theorems for zeros of little q-Jacobi polynomials, and the main ideas are sound. But the interlacing half (Theorems 3.2, Corollary 3.3, and the q-Bessel interlacing) depends on an extension of Theorem A from b<0 to positive b that the authors assert without proof. If that extension holds, the results stand; the paper needs to show it.\n\nWhat is actually new: Theorem 3.1, monotonicity in the parameters a and b, is proven cleanly by differentiating the ratio of the orthogonality weights; I checked the computation and it works. The q-derivative argument for p_n(x;a,b) ≺ p_{n-1}(x;qa,qb) is elegant, and the strict lmesh result for q-Bessel polynomials via the q-difference equation is a nice trick. The paper also correctly flags that an earlier announcement in [3] had flawed proofs.\n\nSoft spots: The big one is Theorem A. The authors state it for all 0<aq<1 and bq<1, then note that [8] proved it only for b<0 and claim that ``the general statement follows using the same arguments.'' No proof is supplied. Relations (23), (24), and (25) are used exactly for positive b in the proofs of the main interlacing theorems: (23) supplies the common interlacer p_{n-1}(x;a,qb) to show p_n ∈ P^q_n((0,1)); (24) yields (51); (25) yields the chain (48). If any of those interlacing relations fails for some b in (0,1/q), then Theorem 3.2(i)-(ii), Corollary 3.3, and the q-Bessel interlacing (30) lose support. Monotonicity (Theorem 3.1) is independent and would survive. Minor issues: the proof of Corollary 3.3 cites ``Theorem 3.1 (iii)'' when it means Theorem 3.2 (iii), and the coefficient identity (41) is only sketched rather than fully verified. These are easy fixes.\n\nBottom line: This is a serious paper with a load-bearing gap. Anyone working on q-orthogonal polynomials or interlacing will find the monotonicity theorem and the lmesh machinery useful. The paper deserves peer review, but the referee should demand a full proof of the positive-b case of Theorem A, either by reproducing the argument from [8] or by a new argument. If the authors supply that, the paper is publishable in a good special-functions journal. Without it, the interlacing results are conditional.","headline":"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.","tokens_in":15152,"tokens_out":5705,"would_cite":false,"duration_ms":55981,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["33C45","33C20","42C05","46L54"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that zeros of little q-Jacobi polynomials are q-separated, interlace under parameter shifts, and move monotonically with parameters.","keywords":["little q-Jacobi polynomials","zero interlacing","logarithmic mesh","monotonicity of zeros","q-hypergeometric polynomials","q-Bessel polynomials","Stieltjes-Wigert polynomials","q-difference equations"],"falsifier":"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.","tokens_in":14103,"feed_emoji":"📐","tokens_out":9599,"duration_ms":99784,"temperature":0.7,"pith_summary":"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<aq<1$, $bq<1$, the zeros lie in $P^q_n((0,1))$, meaning consecutive zero ratios are bounded by $q$, and they satisfy interlacing with the $q$-derivative sibling $p_{n-1}(x;qa,qb)$ and with same-degree parameter shifts. The paper also establishes monotonicity: zeros increase with $b$ and decrease with $a$. These structural facts transfer to limit families such as $q$-Bessel and Stieltjes-Wigert polynomials, and to non-orthogonal parameter regimes by explicit factorizations; one previously announced interlacing result with an erroneous proof is corrected and generalized.","feed_headline":"Little q-Jacobi zeros interlace as parameters shift","feed_subtitle":"New proofs give q-separated zeros, parameter interlacing, and monotone motion in a and b.","key_machinery":"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.","core_discovery":"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.","pith_inferences":["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."],"forward_implications":["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$."],"supporting_citations":[{"why":"Source of Theorem A's interlacing relations, proved there for $b<0$ and extended here by assertion to all $bq<1$; also supplies the $q$-Laguerre interlacing $L_n^{(b)}\\prec L_n^{(q^2b)}$.","marker":"[8]"},{"why":"Provides the interlacing-transfer lemma for linear combinations that turns contiguous relations into interlacing conclusions.","marker":"[4]"},{"why":"Supplies the recurrence used in the factorizations and the earlier announced interlacing result whose proof the paper corrects.","marker":"[3]"},{"why":"Standard reference for $q$-hypergeometric definitions, orthogonality of the little $q$-Jacobi polynomials, and the $q$-difference equation used for $q$-Bessel strict mesh.","marker":"[5]"},{"why":"Contains the characterization of the mesh class by $p(x)\\prec p(qx)$ and the $q$-derivative interlacing theorem used for $p_n\\prec p_{n-1}$.","marker":"[6]"},{"why":"Establishes that $q$-Laguerre zeros lie in $P^{q^2}_n$, a fact imported for Stieltjes-Wigert and $1\\phi_1$ results.","marker":"[7]"}],"fun_headline_variants":["q-Jacobi zeros interlace under parameter shifts","New interlacing rules for little q-Jacobi zeros","Zeros of q-Jacobi polynomials move monotonically","Parameter-monotone interlacing for q-Jacobi zeros"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"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.","fun_headline_variants_meta":{"raw":{"variants":["q-Jacobi zeros interlace under parameter shifts","New interlacing rules for little q-Jacobi zeros","Zeros of q-Jacobi polynomials move monotonically","Parameter-monotone interlacing for q-Jacobi zeros"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000189,"raw_usage":{"total_tokens":1331,"prompt_tokens":938,"completion_tokens":393,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":554,"completion_tokens_details":{"reasoning_tokens":330}},"tokens_in":554,"tokens_out":393,"duration_ms":4514,"temperature":1.0,"reasoning_tokens":330,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T10:21:08.241174+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"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.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Establishes that $q$-Laguerre zeros lie in $P^{q^2}_n$, a fact imported for Stieltjes-Wigert and $1\\phi_1$ results."},{"cited_title":"Tcheutia, A","cited_arxiv_id":null,"evidence_quote":"Source of Theorem A's interlacing relations, proved there for $b<0$ and extended here by assertion to all $bq<1$; also supplies the $q$-Laguerre interlacing $L_n^{(b)}\\prec L_n^{(q^2b)}$."},{"cited_title":"Jordaan and F","cited_arxiv_id":null,"evidence_quote":"Provides the interlacing-transfer lemma for linear combinations that turns contiguous relations into interlacing conclusions."},{"cited_title":"Gochhayat, K","cited_arxiv_id":null,"evidence_quote":"Supplies the recurrence used in the factorizations and the earlier announced interlacing result whose proof the paper corrects."},{"cited_title":"Koekoek, P","cited_arxiv_id":null,"evidence_quote":"Standard reference for $q$-hypergeometric definitions, orthogonality of the little $q$-Jacobi polynomials, and the $q$-difference equation used for $q$-Bessel strict mesh."},{"cited_title":"Lamprecht","cited_arxiv_id":null,"evidence_quote":"Contains the characterization of the mesh class by $p(x)\\prec p(qx)$ and the $q$-derivative interlacing theorem used for $p_n\\prec p_{n-1}$."}],"review_version":1}