{"id":"0825395e-10cc-4e32-9ef6-84521b48ee9a","arxiv_id":"2411.18362","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Connects scalar and matrix Gegenbauer polynomials through explicit expansions, unlocking new symmetries, generating functions, zero distributions, and differential-difference equations.","lead":"This paper finds explicit formulas that turn matrix-valued Gegenbauer polynomials into combinations of ordinary scalar Gegenbauer polynomials. This makes many properties of the matrix versions accessible for the first time, including generating functions and zero locations of entries.","discovery_kind":"unification","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 3.6 rests on a rational identity that is only asserted to be computer-verified; if that identity is wrong, the central expansion collapses. This is the load-bearing gap, exactly as the reader identified.","rationale":"The reader's weakest-assumption choice is exactly the one I would make: the central theorem's proof contains an unverified computer-algebra step. I agree with the conditional verdict. I considered whether the more serious gap is Lemma 3.2's 'Therefore, the integral vanishes for m>2ℓ when i+j≤2ℓ,' since the preceding orthogonality argument only gives vanishing for m>4ℓ−i−j; however, the explicit γ formula already makes F(ν)_{k,n}=0 for k>2ℓ through the factor binom(2ℓ,k), so Lemma 3.2 is not the load-bearing step for the theorem as stated. The unverified coefficient identity remains the single point on which the central claim depends. This is not an accusation of error but a reproducibility request: the authors themselves admit the step is only computer-checked, and the correct response is to supply the derivation or certificate before the theorem is fully accepted. The concern is concrete and settleable by symbolic computation.","tokens_in":19684,"tokens_out":12032,"duration_ms":109485,"concrete_test":"Take the coefficient identity in the proof of Theorem 3.6, substitute the explicit gamma/binomial definition of γ, clear denominators, and cancel Γ-factors to reduce it to a rational identity in ν, n, i, j, k, ℓ. Verify symbolically for representative ℓ=1,2,3,5 with symbolic ν and n over all admissible i,j,k; equivalently, have the authors supply a reproducible CAS file or a human-readable certificate of the rational identity. If the simplified expression is not identically zero for some admissible parameter set, Theorem 3.6 is false; if it simplifies to zero, the missing computational step is supplied and the conditional verdict can be upgraded.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Theorem 3.6 is the central result: it gives the explicit expansion P̂(ν)_n(x) = Σ_{k=0}^{n∧2ℓ} F(ν)_{k,n} C(ν+2ℓ)_{n−k}(x) with F entrywise a gamma/binomial expression. The proof verifies the three-term recurrence and reduces to the coefficient identity displayed at the end of Section 3: the six-term equality involving γ(ν+n;i,j,k±1), γ(ν+n+1;i,j,k+1), and γ(ν+n;i±1,j,k). The text states only that \"This rational identity is checked (by computer algebra) to be valid.\" No derivation, code, output, or certificate is supplied. This is load-bearing because all later claims — Corollaries 3.8–3.9, the differential-difference identities of Section 4, the generating function of Section 5, and the zero-location discussion of Section 6 — feed directly from Theorem 3.6. The identity is not a one-line cancellation: it mixes γ at shifted values of k, i, and ν, so a single error in the γ normalization would make the recurrence comparison fail. Since the paper itself treats this step as a black box, the main theorem is currently established only conditionally, pending correctness of the unreported computation.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper establishes explicit connection formulas between scalar Gegenbauer polynomials and the symmetrized matrix-valued Gegenbauer polynomials introduced in [16]. Theorem 3.4 expresses each scalar Gegenbauer polynomial times the identity as a finite sum of matrix-valued Gegenbauer polynomials, and Theorem 3.6 gives the inverse expansion: each symmetrized matrix-valued Gegenbauer polynomial is written as a short sum of scalar Gegenbauer polynomials with explicit rational/gamma coefficients. From these formulas the authors derive symmetry of the matrix-valued polynomials, new differential-difference identities, generating functions for fixed matrix size, and an experimental study of the zero loci of individual entries. Part of the proof is described as a manually performed matrix analogue of creative telescoping, with a final coefficient identity verified only by computer algebra.","tokens_in":19904,"tokens_out":7543,"duration_ms":60891,"significance":"If fully substantiated, the results are valuable: they give the first explicit entrywise bridge between scalar and matrix Gegenbauer polynomials for arbitrary matrix size, yielding new symmetries, finite-sum expansions, matrix-valued generating functions, and differential-difference structures with no scalar analogue. The paper also contains a concrete double-sum identity (Corollary 3.9) and a clearly labelled experimental zero analysis. However, the central expansion Theorem 3.6 currently rests on an unverified computer-algebra check, and one supporting lemma has a logical gap; the claims are therefore conditional at this stage.","major_comments":[{"comment":"The proof reduces to a six-term rational identity involving gamma-factors γ at shifted values of k, i, and ν, and the text states only that “This rational identity is checked (by computer algebra) to be valid.” No derivation, code, or certificate is supplied. This identity is load-bearing: the expansion in Theorem 3.6 is used in Corollaries 3.7–3.9, in all of Section 4, in the generating function of Section 5, and in the zero-location discussion of Section 6. Because the identity mixes several shifted parameter sets, a single normalization error would break the recurrence comparison. Please provide a human-verifiable derivation of the identity or include the computer algebra code/output as supplementary material.","section":"Section 3, proof of Theorem 3.6"},{"comment":"The proof states that the p-th term vanishes when m + i - p > 4\\ell - p - j, i.e. when m > 4\\ell - i - j, and then concludes that the integral (3.4) vanishes for m > 2\\ell when i + j \\le 2\\ell. This implication is not justified: for i + j \\le 2\\ell one has 4\\ell - i - j \\ge 2\\ell, so m > 2\\ell does not imply m > 4\\ell - i - j. The argument as written proves vanishing only under the stronger condition m > 4\\ell - i - j. Since the bound m > 2\\ell is used to truncate the sum in Theorem 3.6 at n \\wedge 2\\ell, this gap must be repaired.","section":"Section 3, proof of Lemma 3.2"},{"comment":"The proof of Lemma 3.3 is a single sentence: “Recall formula (2.7). Using the orthogonality relations (2.5) and the fact that the matrix-valued Gegenbauer polynomials are symmetric, the statement follows.” This is insufficient for a lemma that supplies the zero pattern of the integral in (3.6) and is needed for Theorem 3.4. The proof should show explicitly how (2.7) and (2.5) imply the three restrictions m < j-i, i+j \\equiv m \\pmod 2, and m > 2\\ell; the reference to symmetry of the matrix-valued Gegenbauer polynomials appears premature and is not needed for this step.","section":"Section 3, Lemma 3.3"}],"minor_comments":[{"comment":"The parenthetical definition “a \\vee b, a \\wedge b stands for min {a, b} and max {a, b}, respectively” is reversed relative to standard usage and to the actual bounds in the formula; \\vee should be max and \\wedge should be min.","section":"Section 2, formula (2.7)"},{"comment":"The sentence “Since \\binom{n}{k} is non-zero only for n,k\\in N with 0 \\le k \\le n” appears to refer to a binomial coefficient that is not present in the surrounding argument; please remove it or rephrase it to match the actual notation.","section":"Section 3, after Theorem 3.6"},{"comment":"There is a typo: “Gegenbaure” should be “Gegenbauer”.","section":"Section 4, proof of Proposition 4.2"},{"comment":"The claim that the entries of \\tilde F^{(\\nu)}_{k,n} are polynomials in \\nu + n of degree \\lfloor \\ell \\rfloor is stated without proof; a short justification would help the reader verify the generating-function computation for general \\ell.","section":"Section 5"}],"recommendation":"major_revision","confidential_remarks":"The main expansion theorem is conditional on an unreported computer-algebra check; in a field where computer-assisted proofs are standard, the authors should supply either a derivation or reproducible code. The gap in Lemma 3.2 is a genuine logical error, though it may be repairable with a different argument. The paper is otherwise well positioned for a journal in special functions and orthogonal polynomials, and I would be willing to review a revised version."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's the short version: this is a genuinely useful paper for the matrix-valued orthogonal polynomials community, and the main theorems are new. The caveat is that the proof of Theorem 3.6, the expansion of the symmetrized matrix Gegenbauer polynomials into scalar ones, reduces at the end to a rational identity in gamma functions that the authors say is \"checked (by computer algebra)\" and then give neither the check nor code. That identity is load-bearing: Corollaries 3.8-3.9, the differential-difference identities in Section 4, the generating function in Section 5, and the zero discussion all feed from Theorem 3.6. One wrong normalization in the gamma factors would break the recurrence comparison. So the central result is presently established only conditionally on that unshown computation.\n\nWhat is good? Theorems 3.4 and 3.6 give explicit bidirectional expansions connecting scalar Gegenbauer polynomials to the matrix-valued ones for arbitrary matrix size, not just the 2x2 case where this was known before. From those expansions the paper gets new symmetries (Corollary 3.7), a matrix analogue of creative telescoping, generating functions for the matrix polynomials, and a genuinely noncommutative differential-difference structure that has no scalar counterpart. The exposition is honest about what is experimental: Section 6 is clearly flagged as observations, and the higher-echelon zero patterns are presented as speculations, not theorems. The paper also builds on [16] in a clean way; there is no circularity.\n\nSoft spots, besides the main one: Lemma 3.3 is proved in a single sentence, and while the statement is plausible from parity and orthogonality, it deserves a few lines. The claimed matrix creative telescoping is manual and no algorithm or artifact is supplied; that is a missed opportunity, not a flaw in the math. The zero-location section is suggestive but should be labeled more firmly as a conjecture for echelons 3 and above.\n\nWho is it for: specialists in matrix orthogonal polynomials, and anyone who works with connection formulas for Gegenbauer/Jacobi families. It deserves a serious referee, with the explicit request that the computer algebra identity in Theorem 3.6 be made reproducible--either a derivation, a Maple/Sage worksheet, or a certificate. If that computation checks out, the paper is publishable roughly as is; if not, the main expansion is unsupported. I would send it to review.","headline":"Real new connection formulas with a load-bearing computer-algebra check that needs to be made explicit.","tokens_in":20431,"tokens_out":2784,"would_cite":true,"duration_ms":25297,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["33C45","33C47","33E30","33F10"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves explicit two-way connection formulas between matrix-valued and scalar Gegenbauer polynomials, giving access to symmetries, generating functions, zeros, and differential-difference structure.","keywords":["matrix-valued orthogonal polynomials","Gegenbauer polynomials","connection formulas","creative telescoping","zeros of polynomials","generating functions","differential-difference operators","experimental mathematics"],"falsifier":"Evaluate both sides of the coefficient identity displayed inside the proof of Theorem 3.6 at several explicit parameter choices, for example $\\nu=2$, $\\ell=3$, $n=4$, $i=2$, $j=5$, $k=1$ and $k=3$, to high precision; any mismatch would disprove the expansion. A direct check would compare $\\hat P_n^{(\\nu)}(x)$ computed from the three-term recurrence with the sum $\\sum_k F_{k,n}^{(\\nu)}C_{n-k}^{(\\nu+2\\ell)}(x)$ at a non-rational point such as $x=\\sqrt{2}/3$.","tokens_in":19461,"feed_emoji":"🧮","tokens_out":5945,"duration_ms":50671,"temperature":0.7,"pith_summary":"Matrix-valued Gegenbauer polynomials are families of orthogonal polynomials whose entries are themselves polynomials, but their explicit form has been hard to use. This paper proves that, after a degree-dependent symmetrization, each matrix-valued Gegenbauer polynomial of size $2\\ell+1$ is a short linear combination of ordinary scalar Gegenbauer polynomials with at most $2\\ell$ terms, with coefficients given explicitly by rational functions and gamma factors. The expansion can be inverted: each scalar Gegenbauer polynomial, multiplied by the identity matrix, is a short combination of the symmetrized matrix polynomials. If correct, these formulas turn the scalar theory of Gegenbauer polynomials into a working tool for the matrix case, yielding symmetries, generating functions, entry-wise zero information, and new differential-difference identities that have no scalar analogue.","feed_headline":"Matrix Gegenbauer polynomials reduce to scalar ones explicitly","feed_subtitle":"Explicit two-way expansions unlock symmetries, generating functions, zeros, and new differential equations.","key_machinery":"The load-bearing objects are the symmetrized polynomials $\\hat P_n^{(\\nu)} = D_n^{(\\nu)}P_n^{(\\nu)}$, with $D_n^{(\\nu)}$ a diagonal matrix chosen so that $\\hat P_n^{(\\nu)}$ is genuinely symmetric, and the two triangular coefficient matrices $F_{k,n}^{(\\nu)}$ and $G_{r,m}^{(\\nu)}$ defined by the expansions. The proof of the main expansion verifies that the candidate right-hand side satisfies the same three-term recurrence and initial conditions as $\\hat P_n^{(\\nu)}$; the comparison reduces to a rational identity in gamma functions, which the paper treats with a matrix-level version of creative telescoping. The proliferation of gamma ratios and binomial factors is what makes the number of terms in the expansions depend only on the matrix size parameter $\\ell$, not on the polynomial degree $n$.","core_discovery":"The central claim is Theorem 3.6: for the symmetrized matrix-valued Gegenbauer polynomial $\\hat P_n^{(\\nu)}(x)$ of size $(2\\ell+1)\\times(2\\ell+1)$, the expansion $$\\hat $P_n^{{(\\nu)}}$(x) = \\sum_{k=0}^{n\\wedge 2\\ell} F_{k,n}^{(\\nu)} C_{n-k}^{(\\nu+2\\ell)}(x)$$ holds, where each $(i,j)$-entry of $F_{k,n}^{(\\nu)}$ is $n!\\Gamma(\\nu+2\\ell)\\gamma(\\nu+n;i,j,k)/2^n$, and $\\gamma$ is an explicitly written product of binomial coefficients and gamma functions that vanishes unless $i+j\\equiv k \\pmod 2$. The companion Theorem 3.4 gives the inverse expansion of $C_m^{(\\nu)}(x)\\mathbf{1}$ in the matrix polynomials with coefficients $G_{r,m}^{(\\nu)}$ of the same type. From these two expansions the paper derives a matrix hypergeometric summation identity, a family of commutation identities that become differential-difference equations, and closed generating functions, and it uses the expansions to study where individual entries vanish.","pith_inferences":["A natural next step, not pursued in the paper, is to push the expansion through known asymptotics of scalar Gegenbauer polynomials to obtain strong asymptotic formulas for entries of matrix-valued Gegenbauer polynomials as $n\\to\\infty$.","The same expansion could be used to test whether zero patterns of entries persist for larger $\\ell$ and other symmetrizable matrix orthogonal families, since the structure reduces to zeros of short linear combinations of scalar polynomials.","If the matrix version of creative telescoping became algorithmic, the rational identity currently checked by computer algebra could be proven mechanically and the method extended to other families such as matrix-valued Hermite and Jacobi polynomials.","The generating-function representation may support arithmetic or Pad\\'e-type applications, since the paper notes the matrix moments' generating function values at rational points can be studied entry-wise."],"forward_implications":["Each entry of a symmetrized matrix-valued Gegenbauer polynomial becomes a linear combination of at most $2\\ell$ scalar Gegenbauer polynomials, so scalar identities can be imported to the matrix setting.","Generating functions for the matrix polynomials exist in closed form: for each fixed $\\ell$ the generating series is a rational expression in $x,t$ times $(1-2xt+t^2)^{-\\nu-2\\ell-\\lfloor\\ell\\rfloor}$ with polynomial entries.","Entry-wise zeros of the first and second echelons (entries near the matrix border) are real and lie in $(-1,1)$, with interlacing between consecutive degrees in the first echelon.","Symmetry of $\\hat P_n^{(\\nu)}$ produces mixed differential-difference identities for the coefficient matrices $F_{k,n}^{(\\nu)}$ that degenerate in the scalar $1\\times1$ case.","Composing the two expansions recovers the known scalar connection formula, yielding a new matrix hypergeometric summation identity that the paper says it cannot yet prove by classical methods."],"supporting_citations":[{"why":"Defines the matrix-valued Gegenbauer polynomials, their weight, recurrence, derivative property, and differential operators; this is the object the paper expands.","marker":"[16]"},{"why":"Supplies creative telescoping, whose matrix generalization the paper uses to prove Theorem 3.6.","marker":"[25, 26]"},{"why":"Provides the experimental-mathematics approach used to guess the expansion and symmetries before proving them.","marker":"[3]"},{"why":"Gives the zero-location theorem for determinants of matrix orthogonal polynomials that frames the entry-wise zero discussion.","marker":"[10]"},{"why":"Studies zeros of linear combinations of scalar orthogonal polynomials, the context for the entry-wise linear combinations appearing here.","marker":"[4]"},{"why":"Records the scalar connection and linearisation formulae that the paper's expansions generalize.","marker":"[2]"}],"fun_headline_variants":["Explicit two-way expansions link matrix and scalar Gegenbauer","Matrix Gegenbauer zeros, generating functions from scalar expansions","Two-way matrix-scalar Gegenbauer expansions give new symmetries","Explicit expansions reveal matrix Gegenbauer differential structure","Matrix Gegenbauer gains from explicit scalar expansions"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The main expansion holds only if the rational identity in gamma functions that the proof of Theorem 3.6 verifies by computer algebra is genuinely true, and the paper supplies no derivation or code to reproduce it.","fun_headline_variants_meta":{"raw":{"variants":["Explicit two-way expansions link matrix and scalar Gegenbauer","Matrix Gegenbauer zeros, generating functions from scalar expansions","Two-way matrix-scalar Gegenbauer expansions give new symmetries","Explicit expansions reveal matrix Gegenbauer differential structure","Matrix Gegenbauer gains from explicit scalar expansions"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001225,"raw_usage":{"total_tokens":4993,"prompt_tokens":862,"completion_tokens":4131,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":478,"completion_tokens_details":{"reasoning_tokens":4054}},"tokens_in":478,"tokens_out":4131,"duration_ms":26992,"temperature":1.0,"reasoning_tokens":4054,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T11:16:24.252753+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Evaluate both sides of the coefficient identity displayed inside the proof of Theorem 3.6 at several explicit parameter choices, for example $\\nu=2$, $\\ell=3$, $n=4$, $i=2$, $j=5$, $k=1$ and $k=3$, to high precision; any mismatch would disprove the expansion. A direct check would compare $\\hat P_n^{(\\nu)}(x)$ computed from the three-term recurrence with the sum $\\sum_k F_{k,n}^{(\\nu)}C_{n-k}^{(\\nu+2\\ell)}(x)$ at a non-rational point such as $x=\\sqrt{2}/3$.","supporting_citations":[{"cited_title":"Koelink, A.M","cited_arxiv_id":null,"evidence_quote":"Defines the matrix-valued Gegenbauer polynomials, their weight, recurrence, derivative property, and differential operators; this is the object the paper expands."},{"cited_title":"Bailey, J.M","cited_arxiv_id":null,"evidence_quote":"Provides the experimental-mathematics approach used to guess the expansion and symmetries before proving them."},{"cited_title":"Dur´ an, P","cited_arxiv_id":null,"evidence_quote":"Gives the zero-location theorem for determinants of matrix orthogonal polynomials that frames the entry-wise zero discussion."},{"cited_title":"Beardon, K.A","cited_arxiv_id":null,"evidence_quote":"Studies zeros of linear combinations of scalar orthogonal polynomials, the context for the entry-wise linear combinations appearing here."},{"cited_title":"Askey, Orthogonal polynomials and special functions , Regional Conf","cited_arxiv_id":null,"evidence_quote":"Records the scalar connection and linearisation formulae that the paper's expansions generalize."}],"review_version":1}